SearcharxivSearch

arXiv subjects

Samuel Reynolds

Publications and source records attributed to Samuel Reynolds.

3 recordsLinked to original sources

Clinical Reasoning AI for Oncology Treatment Planning: A Multi-Specialty Case-Based Evaluation

Background: More than 80% of U.S. cancer care is delivered in community settings, where survival remains worse than at academic centers. Clinicians must integrate genomics, staging, radiology, pathology, and changing guidelines, creating cognitive burden. We evaluated OncoBrain, an AI clinical reasoning platform for oncology treatment-plan generation, as an early step toward OGI. Methods: OncoBrain combines general-purpose LLMs with a cancer-specific graph retrieval-augmented generation layer, a gold-standard treatment-plan corpus as long-term memory, and a model-agnostic safety layer (CHECK) for hallucination detection and suppression. We evaluated clinician-enriched case summaries across gynecologic, genitourinary, neuro-oncology, gastrointestinal/hepatobiliary, and hematologic malignancies. Three clinician groups completed structured evaluations of 173 cases using a common 16-item instrument: subspecialist oncologists reviewed 50 cases, physician reviewers 78, and advanced practice providers 45. Results: Ratings were highest for scientific accuracy, evidence support, and safety, with lower but favorable scores for workflow integration and time savings. On a 5-point scale, mean alignment with evidence and guidelines was 4.60, 4.56, and 4.70 across subspecialists, physician reviewers, and advanced practice providers. Mean scores for absence of safety or misinformation concerns were 4.80, 4.40, and 4.60. Workflow integration averaged 4.50, 3.94, and 4.00; perceived time savings averaged 5.00, 3.89, and 3.60. Conclusions: In this multi-specialty vignette-based evaluation, OncoBrain generated oncology treatment plans judged guideline-concordant, clinically acceptable, and easy to supervise. These findings support the potential of a carefully engineered AI reasoning platform to assist oncology treatment planning and justify prospective real-world evaluation in community settings.

cs.CY

Quadrature for Implicitly-defined Finite Element Functions on Curvilinear Polygons

$H^1$-conforming Galerkin methods on polygonal meshes such as VEM, BEM-FEM and Trefftz-FEM employ local finite element functions that are implicitly defined as solutions of Poisson problems having polynomial source and boundary data. Recently, such methods have been extended to allow for mesh cells that are curvilinear polygons. Such extensions present new challenges for determining suitable quadratures. We describe an approach for integrating products of these implicitly defined functions, as well as products of their gradients, that reduces integrals on cells to integrals along their boundaries. Numerical experiments illustrate the practical performance of the proposed methods.

math.NA

Trefftz Finite Elements on Curvilinear Polygons

We present a Trefftz-type finite element method on meshes consisting of curvilinear polygons. Local basis functions are computed using integral equation techniques that allow for the efficient and accurate evaluation of quantities needed in the formation of local stiffness matrices. To define our local finite element spaces in the presence of curved edges, we must also properly define what it means for a function defined on a curved edge to be "polynomial" of a given degree on that edge. We consider two natural choices, before settling on the one that yields the inclusion of complete polynomial spaces in our local finite element spaces, and discuss how to work with these edge polynomial spaces in practice. An interpolation operator is introduced for the resulting finite elements, and we prove that it provides optimal order convergence for interpolation error under reasonable assumptions. We provide a description of the integral equation approach used for the examples in this paper, which was recently developed precisely with these applications in mind. A few numerical examples illustrate this optimal order convergence of the finite element solution on some families of meshes in which every element has at least one curved edge. We also demonstrate that it is possible to exploit the approximation power of locally singular functions that may exist in our finite element spaces in order to achieve optimal order convergence without the typical adaptive refinement toward singular points.

math.NA