Peer Revenue Past citations are no guarantee of future returns

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Sunday 13 September

Materials Science

Prescreening Point Defects in Semiconductors With Machine Learning

High-throughput calculations using density-functional theory (DFT) are commonly used to explore point defects for applications in power electronics and quantum technologies. There is currently a major shift away from these traditional simulation techniques towards machine learning (ML) methods. We explore a class of physics-guided ML models for predicting defect formation energies and zero-phonon lines (ZPL) to identify point defects for quantum applications. The models are specifically targeted for use in a prescreening step for accelerated high-throughput workflows, and are therefore designed to avoid the costly relaxation step typically present with ML interatomic potentials (MLIPs). We compare performance for single and double point defect systems in 4H-SiC with ridge, kernel ridge, and multilayer perceptron (MLP) models using three different descriptors representing the defect systems. For vacancies and substitutions, the optimized models give mean absolute errors (MAEs) of 0.437 eV for the formation energy and 0.202 eV for ZPLs, which is just above the level at which such predictions can be useful even beyond the targeted prescreening, i.e., in some applications they may completely replace the need for costly DFT calculations. For interstitials the MAEs are larger, 1.101 eV for the formation energy and 0.230 eV for the ZPL, which, while still useful for prescreening, will not generally be useful for more detailed characterization. Hence, while the results may be further improved by model design and optimization, the models presented in this work are already useful for prescreening in high-throughput characterization of point defects.
Read the full abstract

Hardware Architecture

Accurate Models of AMD Matrix Cores

Matrix multipliers available on recent GPUs do not conform with the IEEE 754 floating point standard. Features of matrix multipliers differ across vendors and architectures of the same vendor, such as accumulator width, rounding behaviour, normalisation points, intermediate underflow and overflow logic, the handling of subnormals, and the treatment of special inputs. As a result, reproducibility of small matrix multiplier results across devices is not possible and cannot be achieved by software control. Implementation details of matrix multipliers are not documented, making it difficult to interpret discrepancies in the computed results. We characterise the numerical behaviour of matrix multipliers across three AMD GPU architectures: CDNA 1, CDNA 2, and CDNA 3, using the MI100, MI210/250, and MI300A/300X GPUs, respectively. We design test vectors to target numerical features for all supported input formats and provide the derivation and the reasoning for why each vector allows to determine a particular numerical feature based on the outputs of the devices. MATLAB-based software models of the matrix multipliers are then developed for each architecture and validated for bit-level reproducibility against hardware using a randomized test suite consisting of 10 million sets of random input vectors. To achieve this, we applied a previously developed technique to iteratively refine the accuracy of the models in a loop, by randomized testing followed by test-refinement until the model matches the hardware for every test case. Finally, as a proof of concept for what experimental research can be done with the models, we have utilised them in two demonstrative numerical applications, quantifying application-level accuracy differences between AMD matrix cores and the NVIDIA tensor cores.
Read the full abstract

Statistics Theory

Nonparametric Regression with Measurement Error in Banach Spaces

We consider nonparametric regression with a Banach-space-valued predictor where the covariate takes values in a general separable Banach space. Our primary objective is to develop a unified framework for estimating the regression operator without relying on an inner-product structure, thereby extending classical and functional nonparametric regression beyond Euclidean and Hilbert spaces in the presence of measurement error. We establish the fundamental properties of the proposed estimator and develop its large-sample theory under conditions formulated in terms of the geometry and local concentration of the Banach-valued predictor. In particular, we study pointwise estimation and inference and discuss the construction of pointwise confidence intervals and uniform confidence bands. Our proposed framework is further extended to accommodate error-in-variables settings, where the predictor is observed with contamination. We also investigate related inverse problems arising from the construction of inverse weighting functions and consider partial contamination models. These developments provide a general framework for nonparametric regression and inference with complex infinite-dimensional predictors and identify several statistical and mathematical challenges that arise when the usual Hilbert-space structure is unavailable.
Read the full abstract

Human-Computer Interaction

A Responsive Present, a Shared Past, a Social Other: Teens' Overreliance on Companion AI Chatbots

AI companions provide socially engaging interaction through availability, personalization, memory, roleplay, and emotionally responsive language. For teens, these systems may support sensitive self-disclosure, identity exploration, and relationship rehearsal while shaping intimacy expectations, offline relationships, emotional wellbeing, and self-understanding. We analyzed 17,053 verified quotations from 3,930 teen-relevant Reddit posts using thematic analysis. We identified 53 topics across seven thematic groups. Users described AI companions as sources of comfort, recognition, identity exploration, and relationship rehearsal, but also reported problematic attachment, social substitution, emotional dependence, and disruption to academic and social life. Roleplay, memory, perceived reciprocity, unwanted romantic or sexual role drift, privacy concerns, platform changes, and service interruptions shaped users' boundaries and control. Awareness that the AI was artificial did not prevent guilt, obligation, grief, or distress. These findings show that companion-AI safety must address relationships over time through user-controlled memory, privacy, relational boundaries, and healthy disengagement.
Read the full abstract

Digital Libraries

Ending the NIH embargo accelerated public access to funded research, but substantial delays remain

NIH-funded articles accepted from 1 July 2025 must be public in PubMed Central (PMC) on the day of publication, ending a 12-month embargo in place since 2008. Whether ending the embargo has made articles available sooner has not been measured. Using 1,880 NIH-funded articles published January to April 2026 and 1,880 from 2025, each matched to a same-journal, same-month article that PubMed does not list as US government supported, we compare the change in availability, dated by the day each article went live in PMC. By four months, availability had risen 19.4 percentage points more among NIH-funded articles than among comparison articles. Within a week of publication, however, 6 to 8% of articles in every group and year were available, only 0.1% of NIH-funded articles on the day itself, and the policy effect was 0.3 percentage points. Articles reach PMC by two routes: publishers deposit the final version, or the accepted manuscript is deposited with the author's approval. Two thirds of the gain came through author manuscripts, whose median wait from publication, among those live by the data cut, fell from 374 days in 2025 to 70 in 2026; final versions from publishers moved from 44 days to 36. Agencies ending their embargoes should count days to public access, not only eventual deposit, and test publisher-triggered submission at acceptance.
Read the full abstract

Machine Learning

Tackling Failure Modes of PINNs and PIKANs Using Conflict-Free Gradients

Scientific machine learning methods such as physics-informed neural networks (PINNs) increasingly rely on domain decomposition for better scalability while solving partial differential equations (PDEs) over complex geometries, yet the resulting composite loss comprising residual, boundary, and interface terms is highly susceptible to conflicting gradients that degrade training. This work bridges domain decomposition with projection-based gradient surgery to systematically mitigate such conflicts in 2D and 3D settings. We evaluate two existing projection-based algorithms, PCGrad and ConFIG, and identify their performance degradation in specific scenarios such as 3D domains with multiple overlapping interfaces. To address this limitation, we propose Norm-PCGrad, a normalized variant that achieves state-of-the-art accuracy across a range of 2D and 3D domain decomposition problems. Across the benchmarks considered, Norm-PCGrad consistently achieves the lowest relative $L_2$ error compared to training without gradient surgery as well as to existing algorithms such as PCGrad and ConFIG, while incurring negligible additional computational overhead. To improve computational efficiency of domain decomposition frameworks such as Extended PINN (XPINN), we propose replacing vanilla PINNs in selected subdomains with separable architectures such as Separable PINN (SPINN), reducing the computational cost from quadratic (or cubic) to linear. We additionally demonstrate that gradient surgery extends to physics-informed Kolmogorov-Arnold Networks (PIKANs), yielding substantial accuracy improvements for 3D domain decomposition and confirming the generality of the proposed approach across network architectures.
Read the full abstract

Artificial Intelligence

El Agente Potente: High-Throughput Agentic Atomistic Simulations

Foundational machine-learning interatomic potentials (MLIPs) are transforming atomistic simulations by achieving near-ab initio accuracy across large chemical spaces at a fraction of the computational cost. A central challenge in using these tools for high-throughput property calculations is translating high-level scientific intent into adaptive simulation campaigns without compromising workflow rigour. We introduce El Agente Potente, an agentic system that combines typed execution graphs with a complementary coding mode for MLIPs-driven atomistic simulations. Typed execution graphs provide structured and provenance-aware execution for standardized workflows, with large language models (LLMs) restricted to planning and routing while deterministic Python components perform scientific computation and validation. Complementing this structured execution, a coding agent constructs customized workflows for tasks requiring greater procedural flexibility while invoking existing Potente functions for supported calculations. We demonstrate El Agente Potente across computational materials discovery, molecular energy-landscape exploration, adsorption, and catalytic reaction workflows, together with systematic benchmarks of reproducibility and LLM token cost. These results establish typed execution graphs and code-based workflow construction as complementary mechanisms for agentic scientific computing, combining controlled, auditable execution with the flexibility required for customized atomistic simulations
Read the full abstract

All authors Tsz Wai Ko, Jiaru Bai, Thomas Swanick, Yeonghun Kang, Changhyeok Choi, Angelina Qihong Jiang, Aiwei Yin, Varinia Bernales, Alán Aspuru-Guzik

Software Engineering

Efficiency Hallucination: Formalizing and Measuring Behavioral Calibration in LLM-Based Code Optimization

The integration of Large Language Models (LLMs) into automated code optimization introduces a critical reliability risk we term the Efficiency Hallucination: an LLM's tendency to issue non-functional mutations with unsubstantiated performance claims on already-optimized code. This is driven by the Evaluation Trap, wherein binary benchmarks incentivize unnecessary modifications over safely abstaining. We present a validation framework using classification penalty methods, evaluated across 180 optimization runs on nine models (GPT, Claude, Gemini) using EffiBench. Under standard prompts, models exhibit a 100% over-edit rate on optimal code. Our guardrail raises correct abstention from 0% to to 44.4%, preserving a 100% edit rate on sub-optimal code with zero false abstentions. Calibration is uneven: GPT-5.4 Mini approaches near-perfect abstention, and simple code is recognized more reliably than complex code. Our framework offers a training-free mechanism to mitigate LLM overconfidence before deployment in production.
Read the full abstract

Strongly Correlated Electrons

Quantum Hall Ferromagnetism in a Cavity Vacuum

We uncover a continuous phase transition in a quantum Hall ferromagnet (QHF) at filling factor $\nu=1$, driven by vacuum fluctuations of a cavity. Our analysis starts with a Landau level projection in dipole gauge, where we find the states to be well-represented by a tensor product of the electronic and photonic degrees of freedom. Through analytic spin wave calculations, mean-field theory and density matrix renormalization group (DMRG) simulations, we show that for a spatially antisymmetric cavity field, the uniform QHF state is stable only for weak light-matter coupling and gives way to states of inhomogeneous electron density above a critical coupling. These states involve "flanks" of uniform QHF fluids, separated by a "compact core" of doubly occupied orbitals with the core size being the order parameter, which we dub as "compact-core phases". While the fully spin polarized electronic states are product states, entanglement builds up between the uniform QHF flanks across the compact core in the $S_z=0$ magnetic sector, motivating an ansatz for the compact-core electronic states. The transition boundary is exactly derived for product electronic states in terms of matter and cavity parameters, and numerically confirmed by DMRG. We also study the thin-cylinder limit near the critical point where quantum fluctuations are enhanced, and the many-body excited states in both phases by focusing on the entanglement spectrum degeneracies. Remarkably, the photon number is found to probe the order parameter of the transition, providing a possible experimental signature of the electronic transition and the compact-core states. Our study offers a rare example of a phase of electrons stabilized solely by coupling to the enhanced vacuum fluctuations of a cavity mode.
Read the full abstract

All authors Ceren B. Dag, Luis Brey, Ganpathy Murthy, H.A. Fertig

Statistics Theory

Low Dimensional Sampling under Reconstructed Constraints

We study sampling from a distribution supported on an unknown compact $d$-dimensional $C^2$ manifold $M\subset\mathbb{R}^D$, observed only through i.i.d. uniform points from $M$. We reconstruct the constraint using an adaptive local-convex-hull estimator and target an ambient distribution penalized by squared distance to the reconstruction. Although the reconstructed set may be nonsmooth or fail to be a manifold, its Hausdorff accuracy alone suffices to control the Wasserstein error. We quantify the tradeoff between reconstruction accuracy and penalty strength and show that optimal tuning gives an error proportional to the square root of the Hausdorff error. A planar example proves that this dependence is sharp for the proposed scheme. For a $d$ dimensional constraint reconstructed from $N$ observations, the error becomes $\mathcal{O}( (N/N)^{1/d})$. Finally, we prove uniform geometric ergodicity of a Gaussian random-walk Metropolis–Hastings sampler and combine reconstruction, approximation, and mixing into an explicit finite-time guarantee.
Read the full abstract

Software Engineering

The Case for Automated Hyperspecialization: Evidence from SAT

The software status quo is to use one system to process many different kinds of inputs. In contrast, we propose hyperspecialization: creating new software that is optimized for a single class of inputs. Hyperspecializing manually is anywhere from expensive to impossible. We conjecture that coding agents make automated hyperspecialization cheap, effective, and safe for problems with measurable performance and checkable output. This paper explores one such problem, SAT solving, by synthesizing hundreds of workload-specific SAT solvers at an average cost of \$37 each. Our specialists outperform their competition-winning, general-purpose cousins by 5$\times$ on average, and by over $10\times$ on a quarter of benchmark families. A general-purpose solver constructed from over a hundred of our prototype hyperspecialists won the SAT track at the 2026 SAT Competition.
Read the full abstract

Networking

ABDS: Classifying Protocol Divergence Causes via AS-Boundary Correlation

Network operators frequently encounter protocol divergence—where ICMP, TCP, and UDP experience different treatment along a path. Existing tools identify where divergence occurs but not why, forcing manual investigation that delays resolution. We present two contributions: (1) the AS-Boundary Divergence Score (ABDS), a metric that correlates protocol divergence locations with BGP topology to automatically classify causes as routing-policy-driven versus internal-policy-driven; and (2) the localhost response signature, an empirical finding that security appliances return 127.0.0.1 in TTL-exceeded messages to mask their IPs. We evaluate ABDS against 496 targets across 8 categories (Finance, Government, Education, Healthcare, Tech, E-commerce, Media, International), with multi-vantage validation from 10+ global locations confirming routing consistency. ABDS achieves 100% classification accuracy on verified divergent targets (50/50), significantly outperforming majority-class baseline (54%, McNemar's p < 0.001). The localhost signature achieves 100% precision (18/18, 95% CI: [82%, 100%]) in identifying security appliances across 9 categories including government (IRS, USPS, VA), finance, and healthcare. Our open-source Rust implementation enables automated escalation decisions, reducing mean-time-to-resolution for network operators.
Read the full abstract

Combinatorics

Local Resilience for Containment of Bounded Degree Spanning Subgraphs

We prove that for all $\Delta \geq 2$ and $\gamma > 0$, there exists a constant $C = C(\Delta, \gamma)$ such that for $p\geq C(\log n/n)^{1/\Delta}$, asymptotically almost surely, every spanning subgraph $G$ of $G(n,p)$ with minimum degree at least $(1-1/(2\Delta)+\gamma)pn$ contains every $n$-vertex graph $H$ with maximum degree at most $\Delta$ and with at least $Cp^{-2}$ vertices not in any triangles of $H$. This is a 'sparse local resilience version' of a classical theorem of Sauer and Spencer. The condition that $H$ should contain some vertices not in triangles is necessary, and in fact, the quantity $p^{-2}$ is asymptotically best possible. A key feature of our result is that $H$ is allowed to be an expander graph, distinguishing it from previous results of similar nature, which dealt with, e.g., graphs of sublinear bandwidth. Our proof makes use of regularity arguments, with the sparse blow-up lemma for random graphs being a key tool.
Read the full abstract

All authors Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Mihir Neve

Artificial Intelligence

One Model, Two Physical Stories: Auditing Misalignment in Multi-Modal World Modeling

World models, systems that generate what happens next given current environmental conditions, are increasingly being implemented with multi-modal generation in mind. However, generating multiple modalities simultaneously, such as visual simulations alongside physical state predictions in the form of text, introduces the risk of cross-modal inconsistency. Tested separately, both outputs may look convincing while still disagreeing: a model can calculate that a ball should rebound in one modality, then generate no rebound in another modality, to say nothing of diverging from real-world dynamics entirely. In this work we focus on two failures explicitly: Internal misalignment, the disagreement between the world model's generated video and the same world model's prediction in a different modalities, and external misalignment the disagreement between the world model's generation and an analytic physical environment. We derive common contracts of event, magnitude, timing, and construct a physics grounded pipeline to make comparisons measurable in both external and internal settings. We then ask whether progressively supplying the model's own contract (the A ladder for the internal setting) or a corrected physical contract (the B ladder for the external setting) closes the respective gaps. Across four mechanisms and 20 settings, we find that while language answers all 22 text probes correctly with respect to the true environment, the neutral video is often in disagreement, suggesting that the current unified backbones may not be capable of correct reasoning, internal consistency, and external physical fidelity all at once.
Read the full abstract

All authors Geigh Zollicoffer, Minh Vu, Rajiv Ranasinghe, Manish Bhattarai

Probability

A constructive solution to Talagrand's Gaussian convexification problem

Talagrand asked for a construction of a large convex subset of a bounded Minkowski sum of a large Gaussian set. We first prove a stronger nonsymmetric existential statement: if $A\subset\mathbb{R}^n$ is measurable and $\gamma_n(A)>2/3$, then $A+A+A$ contains a compact convex set of Gaussian measure at least $1/2$. Let now $A$ be closed with $\gamma_n(A)\ge7/8$, let $\Phi$ be the standard Gaussian distribution function, and put $a_0=\Phi^{-1}(3/4)$. For every $\Lambda>1$ and every $0<p<2\Phi(\Lambda a_0)-1$ we construct a centrally symmetric finite polytope $C\subset\Lambda(A+A+A)$ with $\gamma_n(C)\ge p$. Thus measure $3/4$ is obtained for every $\Lambda>1.705510\ldots$. We give matching upper and lower bounds for the optimal high-measure dilation and show that the dilation profile used by the construction is sharp among all symmetric half-measure cores. Finally, if $\gamma_n(A)\ge5/6+\eta$, we construct, for every $0<\varepsilon\le1/2$, a centered ellipsoid $E_\varepsilon$ with $\gamma_n(E_\varepsilon)\ge1-\varepsilon$ and \begin{equation} \frac{c}{\Phi^{-1}(1-\varepsilon/2)}\sqrt{\frac{\log n}{n}}\,E_\varepsilon\subset A+A+A. \end{equation} Both the dimension dependence and the dependence on $\varepsilon$ are optimal up to constants. The construction also gives a six-summand theorem for balanced sets and a second finite construction based on subgaussian tests.
Read the full abstract

2609.14832 · 13 Sep · 25 pages, no figures. Substantially revised and expanded: the constructive result now holds for every exterior dilation greater than 1; added a nonsymmetric three-sum theorem, optimality results for the measure–dilation tradeoff, a constructive high-measure ellipsoid theorem, and further balanced-set and subgaussian consequences

Chemical Physics

Compile-once operation graphs for reusable continuous unitary transformations

Continuous unitary transformations repeatedly evaluate the same operator algebra as the coefficients of a Hamiltonian and its observables evolve. We compile these algebraic relationships once into a numerical operation graph that can be saved and reused for new coefficient sets, additional operators, derivatives, and forward and reverse calculations on CPUs and GPUs. Reuse is demonstrated by applying the same compiled graph to hydrogen and deuterium parameterizations of a reduced molecular model without regenerating the operator equations. The main computational challenge is construction: generated many-body algebra can contain hundreds of millions of contributions before numerical propagation begins. We address this by determining the required storage in advance and writing contributions directly into the final disk-backed representation. In a deliberately large diagnostic-enabled stress test containing more than 350 million generated contributions, peak host memory remains only about 7% above the final stored size. Cross-checks show that CPU and GPU implementations, forward and reverse operations, and repeated loading of the compiled graph reproduce the tested operations to numerical precision. This compile-once representation separates expensive operator-algebra generation from the numerical transformations that reuse it.
Read the full abstract

Algebraic Geometry

Nakajima-extremal Artin–Schreier covers of ordinary elliptic curves in characteristic $2$

Let $k$ be an algebraically closed field of characteristic $2$ and let $q=2^h$, $h\ge3$. We construct ordinary bielliptic curves $X$ of genus $q+1$ for which \[ \Aut(X)\cong \Dih(C_q)\times C_2, \qquad |\Aut(X)|=4q=4(g(X)-1). \] These curves realize case (ib) in the classification of Giulietti–Korchmáros and give an infinite family answering a problem posed by Korchmáros. More generally, we prove that every curve in case (ib) arises from the same construction. Case (ib) occurs exactly in genera $g=2^h+1$ with $h\ge2$. For $g\ge9$ we determine the full automorphism group; in genus $5$ we determine its Sylow $2$-subgroup but do not claim the full automorphism group. For every fixed $q\ge8$, the isomorphism classes in case (ib) of genus $q+1$ are parametrized bijectively by $(k^\times)^2$. The construction is described in terms of an ordinary elliptic curve and an invariant differential. We determine the short orbits and ramification, the unramified cyclic quotients, and the quotients by the central involutions. For $q=8$ an explicit plane model over $\F_2$ is given.
Read the full abstract

Computation and Language

Enemray: Toward Capable Language Models for Hassaniya

We introduce Enemray, a Hassaniya-centric language model that enables general-purpose interaction in Hassaniya. Enemray is trained around a stability–plasticity objective: acquire strong Hassaniya linguistic and cultural competence while preserving the general reasoning, multilingual, instruction-following, and safety behaviors of a capable instruction-tuned model. The development pipeline separates language acquisition from behavioral specialization. A separately assembled continual-pretraining corpus provides broad exposure to natural Hassaniya and Mauritanian text; layer-selective continual pretraining learns a compact language-specific parameter update; that update is transferred into the instruction-tuned parameter space; and supervised post-training develops conversational, cultural, literary, task-oriented, and cross-lingual behavior. The supervised corpus integrates selected public Hassaniya and Mauritanian resources with a substantially larger body of newly collected, reconstructed, curated, and constructed instruction data, while policy-generated replay provides a retention signal from the reference model's own behavior distribution. The resulting collection is substantially larger and broader in purpose than existing Hassaniya text resources. In evaluation, Enemray achieves the strongest English to Hassaniya translation among the compared open and proprietary models and the highest overall score on Mauritanian translation error detection, while retaining most of the general capabilities of its instruction-tuned base model on mathematical reasoning, knowledge, code generation, and function calling. This report describes the motivation, data construction, model design, training methodology, and evaluation of Enemray.
Read the full abstract

Numerical Analysis

Matrix nearness problems: Do real inputs admit real solutions?

Given a real square matrix $A$ and a nonempty closed target set of complex matrices $\mathcal{E}$, invariant by complex conjugation and containing real matrices, does the subset of $\mathcal{E}$ consisting of the matrices nearest to $A$ in the Frobenius distance always contain a real matrix? We give negative answers when $\mathcal{E}$ is either the set of normal matrices (solving a question posed by N. Higham) or the set of matrices whose eigenvalues lie in the closed left half-plane (solving a question posed by the first author and F. Poloni). For the latter problem, we also argue that the ratio between the real and complex distances is unbounded in every dimension $n\geq 3$, and this holds for every distance induced by a unitarily invariant norm. For both problems and $n \geq 3$, we show that a real input $A$ uniformly drawn from the unit sphere $\|A\|_F=1$ has no real minimizer over $\mathcal{E}$ with probability strictly between $0$ and $1$. Beyond these two cases, we prove for an arbitrary nonempty closed target sets $\mathcal{E}$ that, for almost every real input, either $\mathcal{E}$ contains a unique nearest matrix which is real, or every nearest matrix in $\mathcal{E}$ is nonreal.
Read the full abstract

Game Theory

Multi-Agent Reinforcement Learning in Markets with Congestion

This paper investigates multi-agent reinforcement learning (MARL) in settings where firms compete for customers using congestible resources. We consider Bertrand competition in which firms compete by announcing prices and customers choose among firms based on both price and congestion. The relationship between price, congestion and the quantity of customers willing to accept service is governed by an unknown inverse demand curve, which firms must learn through experience. Each firm is modeled as a self-interested learning agent that chooses its price to maximize profit. A growing literature has shown that independently learning MARL agents can develop tacitly collusive behavior. We examine how such behavior emerges in markets with congestible resources. Our results provide insight into how learning dynamics, state representation, and strategic interaction jointly shape competition, with implications for both economic learning and the design of learning-enabled markets.
Read the full abstract

Probability

Variance of random greedy independent sets in triangle-free graphs

Inspect the vertices of a finite simple graph in uniformly random order, accepting each vertex if none of its neighbors has previously been accepted. Let $X_G$ be the number of accepted vertices. For every triangle-free graph with $n\ge2$ vertices and $e$ edges, we prove $\operatorname{Var}(X_G)\le e((n-2)/n)^2$, with equality precisely for edgeless graphs and connected stars. In particular, among trees of a given order, the star uniquely maximizes the variance, with value $(n-1)(n-2)^2/n^2$. Known expected vertex-deletion stability already yields the elementary baseline $\operatorname{Var}(X_G)\le e$. We obtain the sharp finite-order refinement by combining a stronger centered first-choice estimate with a triangle-free edge-count identity in the law of total variance.
Read the full abstract

Computation and Language

Route, Don't Fix: Regime-Dependent Decoding Correction and a Trajectory-Gated Router for Reliable Clinical LLM Answer Selection

Large language models (LLMs) are often deemed unsafe for clinical question answering because of their tendency to hallucinate. Retrieval augmentation, fine-tuning, and external verifiers require new infrastructure that clinical governance must approve and may add latency or extra model calls. Inference-time correction uses the model's internal logit signals, but a fixed transformation need not suit every question. A corrector that improves accuracy by about ten percentage points on a truthfulness stress test yields negligible gains on clinical multiple-choice benchmarks, where instruction tuning concentrates output probability on one answer and leaves low terminal entropy. We introduce ALTAS, which reads terminal entropy and late-layer linearity ($R^2$) from one forward pass to choose per question between greedy decoding and late-layer trajectory correction. No classifier, probe, or head is trained; the router operates on candidate-answer logits and adds 6.5% latency overhead. Applied to every question, the correction improves TruthfulQA over greedy at 3B and 8B by 11.4 and 10.0 percentage points, respectively ($p<10^{-10}$). Gated per question, ALTAS retains gains of 8.3 to 9.5 percentage points while keeping MedQA, PubMedQA, and MedHallu within a one-percentage-point do-no-harm band, with no statistically significant differences from greedy. The method passes verification sweeps over frozen thresholds, the scoring rule, and the domain label.
Read the full abstract

Artificial Intelligence

ANASSA: An Agentic AI Orchestration Framework for Spatial Intelligence

The emergence of large language models (LLMs) and large multimodal models (LMMs) has enabled a new class of agentic systems capable of integrating natural language understanding with tool-based execution. In geographic information systems (GIS), this shift is transforming traditional, expert-driven workflows into semiautonomous systems that can interpret user intent, construct spatial workflows, and execute geospatial analysis tasks. However, existing approaches remain limited by fragmented integration of reasoning, execution, and evaluation, particularly in complex, real-world environments. This study synthesizes recent advances in agentic GIS frameworks, benchmarks, and surveys to identify limitations in spatial reasoning, execution robustness, validation, governance, and evaluation. Building on these insights, it introduces ANASSA (Autonomous Neural Agents for Spatial Systems Architecture), an agentic AI orchestration framework that integrates structured spatial reasoning, multi-agent workflow orchestration, execution feedback, authoritative spatial validation, provenance, uncertainty handling, and human decision authority within a unified system design. The contribution is an architecture-level specification: eleven components across four layers, a six-step Geospatial AI Cognitive Loop, cross-component contracts, and governance mechanisms intended to make agentic geospatial workflows traceable, reproducible, and accountable. Empirical performance evaluation is reserved for implementation and deployment studies.
Read the full abstract

Computation and Language

MedTRACE: Tool-Augmented Multimodal Clinical Reasoning Agents for Evidence-Grounded Decision-Making

Multimodal clinical decision-making requires reliable reasoning over heterogeneous evidence from electronic health records, medical images, and physiological signals. Existing models typically map these inputs directly to diagnoses without explicitly assessing evidence sufficiency, tool-use requirements, or diagnostic uncertainty. This paper presents MedTRACE, a tool-augmented multimodal clinical reasoning agent for evidence-grounded decision-making. MedTRACE uses modality-specific encoders to construct a unified patient-state representation and performs an iterative loop of hypothesis formation, toolaware deliberation, and evidence verification. It dynamically invokes visual grounding, evidence retrieval, and structured parsing tools to locate diagnosis-relevant regions, retrieve clinical knowledge and similar cases, and extract structured findings. The acquired evidence enters an evidence memory, where a consistency verifier confirms or revises the current hypothesis. MedTRACE outputs a diagnosis together with supporting evidence, an auditable reasoning trace, and calibrated confidence. Experiments on multiple multimodal clinical diagnosis benchmarks show that MedTRACE improves diagnostic accuracy by 5.4% and AUROC by 4.7 percentage points over the strongest baseline. It also improves evidenceselection F1 by 8.2 percentage points and visual-grounding IoU by 6.5 percentage points, reduces expected calibration error by 31.6%, and decreases unsupported diagnostic errors by 27.8%. These results demonstrate that active evidence acquisition and verification improve the accuracy, interpretability, and reliability of multimodal clinical decisionmaking.
Read the full abstract

All authors Ji Lu, Lifei Liu, Haoran Yu, Xianglong Wang, Yiru Fang, Kuo Yang, Huiran Duan, Jianping Gou

Number Theory

Transcendence of Montgomery Reduction Factor in the Ring of Integers Modulo Infinitely Large Primes

We prove the transcendence over $\mathbb{Q}$ of the image of Montgomery reduction factor $R'$ in the ring $\mathscr{A}$ of integers modulo infinitely large primes. Here, for an odd prime number $p$, $R'$ is defined as the modular inverse of a power $R$ of $2$ modulo $p$ satisfying $2^{-k} R \leq p < R$ for a fixed constant $k \in \mathbb{N}_{> 0}$ typically given as the standard bit size $32$ of an integer type, and is the element of $\mathbb{Z}/p \mathbb{Z}$ representing Montgomery reduction regarded as a $\mathbb{Z}/p \mathbb{Z}$-linear homomorphism.
Read the full abstract

Machine Learning

Decision-Oriented Uncertainty Quantification for Risk Control in Earth System Spatiotemporal Foundation Models

Earth system modeling is shifting from task-specific predictors toward foundation models with general spatiotemporal representation capabilities. Although these models can jointly encode dynamic Earth fields, external forcings, and static geographic context for multistep forecasting, accurate point predictions or statistically calibrated intervals alone are insufficient for high-impact applications such as extremeweather warning, flood control, renewable-energy dispatch, and emergency resource allocation. What matters in practice is whether predictive uncertainty can be translated into reliable decision risk under specific actions, loss functions, and risk preferences. We propose a decision-oriented uncertainty quantification framework for Earth system spatiotemporal foundation models. The framework produces predictive distributions of future states and uses a decision risk adapter to map forecast samples, decision context, and utility functions into action-conditional risks. A utility-aware calibration module further enforces reliability at the downstream decision-loss level rather than only at the forecast-value level. Calibrated risks are then used to select warning, dispatch, inspection, or resource-allocation actions. Compared with the strongest baseline, the proposed method reduces decision regret by 18.7%, lowers the missed-event rate from 14.2% to 9.1%, and improves expected utility by 11.6%, while maintaining 90.4% predictive coverage and reducing decision calibration error from 0.083 to 0.047. These results suggest that decision-oriented uncertainty quantification can improve the robustness and operational value of Earth system foundation models in risk-sensitive applications.
Read the full abstract

All authors Ji Lu, Huiran Duan, Bo Zhao, Xianglong Wang, Yiru Fang, Kuo Yang, Xiaoqin Feng, Jianping Gou

Sound

POLARIS: Training-Free Audio Fingerprinting with Saliency-Based Landmarks and Delaunay Grouping

This work presents POLARIS, a training-free audio fingerprinting system that selects landmarks from a locally normalized saliency field and groups them into sparse fingerprints using Delaunay triangulation. To deal with query distortion, POLARIS adds fingerprints from two-hop Delaunay neighborhoods only at query time, without enlarging the reference index. An adaptive configuration applies this expansion only when the original fingerprints do not produce a confident match. We evaluate POLARIS on synthetic distortions from the public PEX Hard Medium benchmark, excluding queries with pitch or tempo shifts, and on a new benchmark of real re-recorded music. POLARIS achieves the best performance among the evaluated training-free methods on both benchmarks. On the real recordings, its adaptive configuration also outperforms the neural NMFP baseline with a comparable measured query time and a smaller logical reference payload. Code, dataset, and instructions for reproducing all experiments are available at https://github.com/JihengLi/POLARIS.git.
Read the full abstract

Computation and Language

A primer on evaluation methods for large language models in healthcare

Large language models (LLMs) have a growing range of applications in medicine, and their evaluation is critical for ensuring they provide benefit and not harm. This evaluation can be more challenging than traditional machine learning for many reasons, including probabilistic and open-ended outputs, and behavior that shifts with prompt design and accumulated context. This review covers four key areas of LLM evaluation: principles of study design, statistical methods, capability evaluation and clinical application evaluation. Capability evaluation considers different benchmarks, including multiple-choice, agentic and multi-turn benchmarks, alongside operational metrics like token usage and latency. Clinical application evaluation addresses establishing accuracy of free text outputs, such as human review and LLM-as-a-judge, and clinical trial approaches. Across sections, we describe underlying concepts and potential pitfalls, while emphasizing the importance of aligning evaluation methods with the research question. Together, this article aims to provide a pragmatic basis for designing and executing rigorous evaluations of healthcare LLMs.
Read the full abstract

All authors Suzannah E McKinney, Phuc Vu, Samuel A Justice, Christopher Humphries, Alyssa Pradhan, Timothy J Keyes, Kameron C Black, John L Havlik, David JH Wu, Jack W O'Sullivan, Ethan Goh, Sarah F Mercaldo, James M Hillis

Software Engineering

Trust by Design: Trust Calibration Through Non-Advisory Socratic Dialogue in Conversational Agents

As conversational AI systems increasingly operate in sensitive domains, the central challenge shifts from usability to trust calibration, ensuring that users rely on systems neither too much nor too little. Systems that provide advice or interpretations risk encouraging inappropriate reliance, particularly when users perceive AI outputs as authoritative. We present CASELy, a conversational agent explicitly designed to limit its own authority through non-advisory Socratic dialogue. The agent asks reflective questions grounded exclusively in user input and refuses to provide advice, recommendations, or interpretations. This design operationalizes trust calibration by constraining agent agency rather than optimizing capability. In a pilot randomized controlled study with higher education students, participants interacting with the Socratic dialogue reported substantially higher user experience (UEQ-S overall = 1.50) compared to a non-dialogue control (0). Qualitative findings identify three mechanisms supporting calibrated trust: transparency through visible grounding, preservation of user decision authority, and reduced fear of judgment. We argue that appropriate reliance can be achieved through interactional constraints, offering a design pattern for trustworthy conversational AI in sensitive contexts.
Read the full abstract

Computation and Language

Tone on a Budget: A Reference-Free Metric for Lexical Tone in Massively Multilingual Text-to-Speech

In Yorùbá, pitch alone separates ọkọ (husband, Mid), ọk\dò (vehicle, Low), and ọk\dó (hoe, High) – the diacritics ARE the tone marks. Yet character error rate (CER), the standard automated metric for text-to-speech (TTS), is in practice computed from ASR output that drops those marks: a synthesizer can ace CER and still say vehicle for husband. We introduce DunDun – named for the dùndún, the Yorùbá talking drum that speaks through pitch alone – an automated, reference-free lexical-tone metric that needs no tone-labelled corpus. The gold High/Mid/Low sequence is read from the input text's diacritics (in TTS that text exists by construction, so no reference recording is needed); the prediction comes from the audio's pitch track. We validate three ways. Flattening pitch with PSOLA resynthesis collapses DunDun while CER does not move. Inverting High and Low in the answer key of 300 native recordings drives the two-class readout to 0.14, symmetrically below its 0.35 chance level – a consistency check on the scoring path, not independent evidence. And three native listeners, over 67 blind A/B trials, pick the tone-correct clip 89.6% of the time (95% CI 80.0-94.8; p < 1e-4); whether DunDun tracks those judgements trial by trial is not resolved at this sample size. Applied to a massively multilingual zero-shot TTS model, DunDun shows what CER cannot: Yorùbá tone sits near the native anchor before any Yorùbá fine-tuning (0.567 +/- 0.02 over five decode seeds vs. 0.596; chance 0.33), despite the 21.4% CER the model's own paper reports; and a few hours of clean audio halve CER (5.6% to 2.7% by 5h, 1.7% by 15h) while tone saturates within the hour. On non-tonal Swahili, CER already captures the gains: the metric a language needs is language-dependent. We release the metric and the complete validation protocol.
Read the full abstract