Peer Revenue Equity in science

Papers

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

All of arXiv

Friday 28 August

Fluid Dynamics

From Dead-Band to Steady Rotation: Three-Dimensional Vortex Dynamics of Self-Starting Vertical-Axis Wind Turbines

The self-starting behavior of vertical-axis wind turbines is strongly influenced by the development of vortical structures along the span. However, a fully coupled high-fidelity three-dimensional analysis of this process requires substantial computational resources. This study presents a computationally efficient, spanwise-periodic, three-dimensional large-eddy simulation framework in OpenFOAM. The motion of the rotor is prescribed using a combination of two logistic functions to reproduce the angular-velocity evolution of a vertical-axis wind turbine undergoing self-starting. The results show that boundary-layer separation and the subsequent roll-up of the separated shear layer generate detached vortical structures that convect into the wake as finite spanwise segments. The deformation of these structures along the span increases with increasing spanwise extent. The dead-band is characterized by sustained wake interference and weak net acceleration, whereas the rapid-acceleration stage exhibits greater attachment of the flow, with separation confined to smaller regions near the blade. During quasi-steady operation, the shedding of vortices into the wake becomes repeatable, and downstream blade–vortex interactions are reduced. The approach based on the prescribed motion of the rotor enables computationally efficient, spanwise-resolved studies of vortex evolution suitable for parametric investigations and the evaluation of flow-control devices.
Read the full abstract

Artificial Intelligence

iCoder-27B: Recursive AI-Led Development of Frontier Industrial Coding Model

Recursive AI, the prospect of AI taking an increasingly complete role in building and improving AI, is a crown jewel of AI for AI. Although recursive self-development has become practical for small models, bounded tasks, and fixed time budgets, a more consequential realization of this ambition, i.e., developing a release-ready, frontier-competitive model, remains far more challenging. In this work, we ask how little human involvement is sufficient for an agent to develop a frontier model. We concentrate human input into a high-density, low-frequency interface: experts encode objectives, stage scaffolds, permission boundaries, and operating procedures as reusable research skills, while the agent instantiates these priors, selects experiments, diagnoses outcomes, and revises the training strategy. In the challenging domain of industrial coding, the agent evolves data and coordinates SFT, on-policy self-distillation, and reinforcement learning with verifiable rewards, ultimately producing iCoder, a 27B model for RTL design and GPU kernel optimization. Across seven benchmarks, iCoder leads RTLLM, outperforming GPT-5.5 and Claude-Opus-4.8; ranks second on CVDP and KernelBench L2, exceeding GPT-5.5 by 16 points; and ties Claude-Opus-4.8 for the best TritonBench result. Exploratory case studies further show iCoder's competitive iterative RTL and GPU-kernel optimization with substantially fewer tokens. These results chart an engineering path toward recursive self-improvement, in which humans distill the principles of model building, agents operationalize them through evidence-driven experimentation, and each generation of AI becomes a more capable architect of the next.
Read the full abstract

All authors Cheng Yang, Jiayang Lyu, Shangyuan Liu, Guibin Zhang, Jiong Lin, Xinlei Yu, Junchi Yan, Shuicheng Yan, Weinan E, Linfeng Zhang, Linfeng Zhang, Qibing Ren

Machine Learning

Limited Structural Reliability in Public Educational Prediction Benchmarks: A Four-Dimension Audit of Seven Datasets

Across seven public educational prediction datasets, three passed all four pre-modeling reliability checks; the remaining four either failed group-aware generalization tests or lacked the provenance metadata needed to run them. One dataset was initially classified as failing but corrected after excluding group-identifier features from the holdout matrix, demonstrating that the audit can distinguish genuine cross-group confounding from feature-encoding artifacts. Each dataset was audited before model optimization using four checks: baseline gap, split instability, null separation, and metadata adequacy under group-aware holdout. The dominant failure mode was not weak iid performance alone but cross-group fragility: in the clearest case, UCI Student declined from iid R-squared 0.242 to group-holdout R-squared -0.097, while Higher Ed collapsed from 0.041 to -8.79. Increasing model complexity did not remove this pattern: ensemble models improved structurally sound datasets but amplified instability or failed under group holdout on fragile ones. An exploratory cross-dataset comparison further showed that stronger profiles clustered in larger, richer-grouped, performance-proximal datasets, while random-split performance severely overstated deployable signal in fragile datasets. Classification-metric sensitivity analyses reached the same substantive conclusions. The results show that benchmark reliability in educational AI is constrained less by algorithm choice than by data structure, group heterogeneity, and evaluation design. A reusable pre-modeling audit offers a minimum quality gate before public educational datasets support strong benchmark or deployment claims.
Read the full abstract

Combinatorics

On Alon's problem concerning the difference between connected domination number and domination number

For a connected graph $G$, let $\gamma(G)$ and $\gamma_c(G)$ denote its domination number and connected domination number, respectively. Let $M(n,k)$ be the maximum of $\gamma_c(G)-\gamma(G)$ over all connected $n$-vertex graphs of minimum degree at least $k$. Alon proved that \[ 2\left\lfloor\frac{n}{k+1}\right\rfloor-O(1)\le M(n,k)<\frac{n}{k+1} \bigl(\log\lceil\log(k+1)\rceil+3\bigr). \] He proposed a problem to determine or estimate $M(n,k)$ for $n-1\ge k\ge 3$, and particularly remarked that it would be interesting to close the $\log\log(k+1)$ gap between the upper and lower bounds and decide whether or not $M(n,k)=\Theta\bigl(\frac{n}{k+1}\bigr)$. We give an asymptotic answer to Alon's problem for sufficiently large $k$. More precisely, $M(k+1,k)=0$. For $n>k+1$, let \[ \nu=\frac{n}{k+1} \text{ and } \Phi(x)= \frac{1}{x\log\!\frac{x}{x-1}} \ (\text{for }x>1). \] As $k\to\infty$, uniformly over all integers $n>k+1$, \[ M(n,k)= \big(\Phi(\nu)+o(1)\big) \nu\log\log(k+1). \]
Read the full abstract

Computer Vision

AgenticCADedit: A Stateful, Tool-Mediated Agentic Approach to Multimodal 3D CAD Editing

Computer-aided design is central to industrial manufacturing, and much of a designer's daily work consists of editing existing models from multimodal requests involving speech, sketches, and model interaction. Existing neural CAD approaches focus predominantly on unconditional or text-conditioned generation. The neuralCAD-Edit approach formalizes expert multimodal editing requests, but its iterative baseline refines a complete CAD program across attempts, executing each attempt from the original model in a stateless CAD environment. Every attempt must therefore reconstruct the entire edit from scratch, so partially correct progress is discarded rather than accumulated, and the model can neither inspect the geometry it has just produced nor selectively revert a single faulty operation. We present AgenticCADedit, which turns editing into a sequence of small, verifiable actions on a persistent CAD state instead of a single regenerated program. Rather than emitting one complete program, it applies incremental code steps that each commit to the session, inspects the resulting faces and edges, renders highlighted selections to verify that the intended region was addressed, and reverts individual operations when it was not. Subsequent actions therefore build on the geometry produced by earlier ones. Our approach improves on all metrics for all three evaluated LLMs (open-weight: qwen3.6-27b, gemma4-31b; proprietary: gpt-5.6-luna), with the largest gains for the weakest baseline model, qwen3.6-27b, whose validity rises from 51.0% to 94.8% and acceptance from 1.6% to 12.0%. A token-cost analysis with gpt-5.6-luna further shows $66.7$% fewer output tokens than neuralCAD-Edit, while $94.8$% of input tokens are served from the prompt cache.
Read the full abstract

All authors Saptarshi Neil Sinha, Mika Silvan Goschke, Paul Julius Kühn, Arjan Kuijper, Michael Weinmann

High Energy Physics (Phenomenology)

Event-Level Classification of Boosted Multi-Tau Signatures in scNMSSM Di-Higgs Production

In the semi-constrained NMSSM at large lambda and low tan(beta), di-Higgs production can proceed through h1h1 -> 4a1 -> 8tau when the lightest pseudoscalar lies below the b-bbar threshold. The tau pairs from each a1 decay are collimated and merge within a single jet. Using the benchmark point m_a1 = 8.2 GeV identified in earlier work as a representative signal topology, we examine which observables separate such events from Standard Model processes producing similar final states. The exotic branching fraction of this point exceeds present experimental limits, and all results concern the shape of the distributions, not the signal rate. The substructure observables normally used for two-prong tagging prove ineffective here: the jet mass and the N-subjettiness ratio tau_21 have separation powers of 0.02 and 0.09 against boosted Z -> tau tau. Both are ditau jets, and the neutrinos from tau decays displace the reconstructed masses to a common value near 18 GeV despite parent masses differing by an order of magnitude. Discrimination comes instead from the event as a whole. A boosted decision tree trained on single fat jets reaches an AUC of 0.759 +- 0.002, while an event-level classifier reaches 0.941 +- 0.001, driven by the multiplicity of boosted objects and the masses of the subleading ones. Top-quark pair production reproduces the multi-object structure, and against ttbar -> bbbar tau tau the AUC falls to 0.855 +- 0.008. For a cross-section-weighted combination of the two simulated backgrounds the classifier reaches 0.908 +- 0.002, with 71% signal efficiency at 10% background efficiency. These are classification metrics from fast simulation, not discovery significances.
Read the full abstract

Hardware Architecture

CAGE: Regime-Aware Algorithm Engineering for Coverage Optimization

Coverage-selection policies that optimize the same monotone objective can occupy different quality-runtime frontiers as workload scale, budget, repetition horizon, and execution substrate change. CAGE is a regime-aware algorithm-engineering framework that holds coverage semantics fixed through a shared bitset execution substrate and studies how the nondominated strategy set changes under controlled operating conditions. We separate intrinsic workload descriptors from measured strategy response, represent each condition by its empirical Pareto set, and identify regime transitions from changes in Pareto membership or statistically supported crossovers. Across Defects4J, Epinions, a BWSN-inspired time-to-detection workload, repeated selection, and an embedded RV32 realization, we observe distinct transitions. At a 5% budget, one-exchange refinement adds 27 Chart lines at 11.3x baseline median runtime, whereas deeper search adds five Time lines at roughly 715x. On Math, CP-SAT confirms full-universe optimality at 20% and 40% and residual lower-budget headroom. Persistent preprocessing reuse first achieves confidence-interval-supported speedup at horizon 20 and reaches 1.442x at horizon 100. ModelSim shows a separate bitset-width crossover. The results demonstrate that strategy nondominance is workload- and condition-dependent, supporting regime-aware algorithm engineering rather than a universal policy ranking.
Read the full abstract

Computation and Language

An Exploratory Ablation of a Small MLA–SSM Hybrid Language Model

We report an exploratory, single-seed ablation of TALH (Adaptive Latent Hybrid), a decoder-only language model with parallel Multi-head Latent Attention (MLA) and a custom recurrent state-space (SSM) branch. Five variants, spanning 117–217M estimated active parameters per token, are trained from scratch on a FineWeb sample for the same number of optimisation steps and tokens. In this specific setup, removing the SSM branch gives the largest degradation in validation perplexity (MLA-only PPL 315), whereas removing MLA has a much smaller effect (SSM-only PPL 239). A dense-FFN hybrid obtains PPL 231, compared with 240 for the tested top-2 ternary-MoE hybrid, while using 3.87 GB less peak training memory. We also preserve a preliminary Apple M3 timing observation: among the five unoptimised implementations, MLA-only has the flattest measured time-to-first-token curve from 512 to 2,048 prompt tokens, although the dense Transformer is much faster in absolute terms. Because the runs are single-seed, parameter counts are unmatched, the evaluation stream may overlap the training source, and raw repeated timing records are unavailable, these results support implementation-specific hypotheses rather than general conclusions about MLA, SSMs, or mixture-of-experts models.
Read the full abstract

Geophysics

Competition between thermal pressurization and dilatant strengthening in laboratory ruptures

In fluid-saturated faults, thermal pressurization (TP) is predicted to induce rapid weakening, whereas dilatant strengthening (DS) can counteract this process through pore-space expansion. However, experimental constraints on their competition remain limited. Here, we investigate these processes using triaxial stick-slip experiments with direct on- and off-fault pore pressure (Pp) measurements on saturated, saw-cut, thermally cracked Westerly granite under effective confining pressures of 30-60 MPa. Results reveal a systematic rupture transition from co- seismic Pp rise (TP-type) to Pp drop (DS-type) with increasing shear strain, accompanied by a fast-slow-fast slip sequence, with slip velocities differing by up to three orders of magnitude. An undrained, adiabatic TP model reproduces the measured Pp rise evolution during early-stage fast events and indicates progressive shear zone widening that reduces TP efficiency. With continued slip, increasing cumulative plastic porosity reflects enhanced dilatancy during DS-dominated sequences. Microstructural observations reveal gouge development and a near- fault damage zone, providing independent evidence for this structural evolution. This evolution modifies fault stiffness and explains the observed transition in slip behavior. Despite contrasting Pp responses, fracture energy scales similarly with slip for both TP- and DS-type events, suggesting comparable rupture energetics. Overall, this study provides direct experimental evidence of TP-DS transitions, demonstrating that TP governs early-stage weakening but diminishes as dilatancy progressively strengthens with shear zone widening and near-fault damage. These results highlight that fault structure and its evolution plays a key role in controlling rupture dynamics in natural faults.
Read the full abstract

All authors Caiyuan Fan, Gang Lin, Jerome Aubry, Damien Deldicque, Carolina Giorgetti, Harsha S. Bhat, Alexandre Schubnel

Numerical Analysis

Closure complexity of Bänsch-type algorithms for tetrahedral mesh refinement

We prove, to our knowledge, the first unconditional cumulative closure estimates for the Arnold–Mukherjee–Pouly (AMP) refinement algorithm and the original face-marked tetrahedral algorithm of Bänsch on arbitrary conforming initial tetrahedral meshes. Let $T_0,\ldots,T_L$ be an adaptive mesh sequence generated by either algorithm, with $M_\ell\subseteq T_\ell$ denoting the marking set at step $\ell$. Then $$\#T_L-\#T_0\leq C_{\mathrm{clos}}(T_0)\sum_{\ell=0}^{L-1}\#M_\ell.$$ The proof is intrinsic to the physical three-dimensional mesh and requires neither an initial compatibility condition nor a higher-dimensional embedding. It organizes conformity refinements into a causal forest and combines a uniform horizontal-propagation estimate with a weighted packing argument to obtain an explicit closure constant. For the original Bänsch algorithm, every history-dependent resolution of the initial two-edge ambiguity is represented by one of finitely many AMP histories. The estimate therefore holds uniformly for arbitrary deterministic or nondeterministic choices. This resolves a long-standing complexity question for the Bänsch–AMP family.
Read the full abstract

Game Theory

Winning Before You Play: An Iterative Capture Algorithm for Pre-Game Dominance Analysis in Three-Player Auction Bridge

This paper introduces an innovative and bias-free variant of a three-player auction bridge, specifically designed to address structural limitations found in traditional formats. In a standard auction bridge, the partner of the winning bidder often plays a passive role, possessing minimal influence over the outcome once the bidding phase concludes. To rectify this, our proposed three-player model redistributes strategic agency, emphasising a framework where No Trump strategies statistically outperform specific trump card selections. The core of this research is a rule-based dual-algorithm framework. First, we implement an iterative bidding algorithm that allows players to calibrate their bids dynamically based on evolving hand strengths. Second, we introduce a predictive iterative algorithm designed to calculate the expected number of tricks a player will secure before the lead card is played. Unlike traditional approaches that rely on backtracking or high-complexity dynamic programming, our iterative method significantly reduces time complexity. This efficiency is crucial for real-time gameplay, enabling players to perform complex probability assessments instantly without computational lag. To validate the model, a simulation was conducted on a dataset of 1,00,000 game instances. This large-scale analysis allowed for a precise comparison between initial bidding, outcomes, and overall bidding accuracy. The empirical results demonstrate that our algorithm not only enhances the balance and fairness of the auction bridge but also exhibits high reliability in predictive accuracy. Beyond the realm of card games. By modelling uncertainty and strategic competition, the algorithm offers valuable insights into risk management and decision-making in volatile market environments.
Read the full abstract

Numerical Analysis

Semidiscrete Modeling of Dislocation-Disclination Systems: Finite Element Formulation

We present a numerical formulation for the resolution of finite systems of interacting edge dislocations and wedge disclinations. The approach is based on a finite element discretization of a fourth-order elliptic boundary value problem arising from the mechanical equilibrium equations of plane-strain linear elasticity in the presence of kinematic incompatibilities. The numerical implementation follows a continuous interior penalty discontinuous Galerkin framework and relies on the solution of a finite set of local cell problems. Our method is validated against analytical benchmarks and used to explore several non-trivial dislocation-disclination configurations, illustrating how translational and rotational incompatibilities shape the stress state of the body.
Read the full abstract

All authors Pierluigi Cesana, Edoardo Fabbrini, Andrés A. León Baldelli, Marco Morandotti

Image and Video Processing

Evidence-Driven Differential Diagnosis of Malignant Melanoma

We present a modular and multi-level framework for the differential diagnosis of malignant melanoma. Our framework integrates contextual information and evidence at the lesion, patient, and population levels, enabling decision-making at each level. We introduce an anatomic-site aware masked transformer, which effectively models the patient context by considering all lesions in a patient, which can be variable in count, and their site of incidence. Additionally, we incorporate patient metadata via learnable demographics embeddings to capture population statistics. Through extensive experiments, we explore the influence of specific information on the decision-making process and examine the tradeoff in metrics when considering different types of information. Validation results using the SIIM-ISIC 2020 dataset indicate including the lesion context with location and metadata improves specificity by 17.15% and 7.14%, respectively, while enhancing balanced accuracy. The code is available at https://github.com/narenakash/meldd.
Read the full abstract

Databases

Towards Quantum Range Query for Spatial-Temporal-Semantic Trajectory Data

Range query is a fundamental task in geospatial data search and many other downstream applications. Classic range queries often rely on tree-based spatial indexes, of which the query speed depends on the number of indexed points $k$ within the queried range. For instance, a classical B+ tree answers a range query in O(log N+k). For a long time, this speed has long been considered asymptotically optimal in classic database systems, until the recent emergence of quantum computing, where a quantum B+ tree may requires only O(log_B N). This paper presents Quantum Range Query (QRQ) via a hybrid quantum-classic algorithm to return the range query results in quantum superpositions. In this context, QRQ is designed to accelerate classic range query on spatial-temporal-semantic trajectory geodata using quantum algorithms. Specifically, QRQ develops quantum variants of R-tree, TB-tree and KD-tree, where the physical slots of a node, including unused padding slots, are treated as an array that a quantum random-access memory (QRAM) can read in superpositions. Evaluations on three common trajectory datasets, namely GeoLife, T-Drive, and GDP Drifter, and 10,000 queries per setting, the QRQ speedup at 1% target selectivity ranges from 2.03 times) to 64.70 times. More importantly, QRQ shows a great potential in optimizing existing trajectory range query, so it becomes the shared primitive on which human mobility analysis, and later searches specified by large language models (LLMs) and geo-foundation models (GeoFMs), can rest.
Read the full abstract

All authors Hao Li, Zhihang Liu, Liwei Zou, Jinlin Wu, Wufan Zhao

Human-Computer Interaction

From Maturity Models to Ground Truth: Reconciling Cybersecurity Capacity Frameworks with Household-Level Governance Realities in the Global South

National cybersecurity and digital-governance capacity frameworks, most prominently the Cybersecurity Capacity Maturity Model for Nations (CMM), shape hundreds of millions of dollars in donor-funded governance investments across the Global South. Yet a persistent, under-theorised gap remains between state-level institutional maturity and the governance actually experienced by end-users. We term this the last-mile governance gap: the structural space between what a maturity assessment can see - laws, agencies, standards, awareness campaigns - and what a household living under that formal architecture can access, understand, or enforce. Drawing on a dual vantage point combining CMM assessment experience with peer-reviewed empirical fieldwork on smart-home privacy governance in Jordan, corroborated against studies from Kenya and China, we identify four mechanisms by which national capacity fails to reach the household: legibility, intra-household power distribution, accessibility of redress, and infrastructure-affordability constraints. We map these mechanisms explicitly onto the CMM's five dimensions, propose four concrete, low-cost last-mile indicators pilotable within existing CMM deployments, and outline a staged adoption roadmap with responses to anticipated objections. With AI-enabled devices entering homes across the Global South faster than institutional capacity can adapt, the stakes are rising: this dynamic risks converting a measurable maturity gap into an invisible one. We conclude with actionable implications for the GCSCC, the ITU, the World Bank, and other institutions relying on maturity scores to prioritize investment.
Read the full abstract

Numerical Analysis

Uniform Stability of Scott-Vogelius Elements on Three-Dimensional Freudenthal Meshes in Degrees Four and Five: Resolving the Farrell-Mitchell-Scott Conjecture

We establish a uniform inf-sup stability estimate for the Scott-Vogelius finite element spaces on uniform Freudenthal tetrahedralizations of the unit cube for polynomial degrees k >= 4. This result completely settles the first conjecture of Farrell, Mitchell, and Scott for the critical degrees k = 4 and k = 5, complementing the known stability range for higher polynomial degrees. The main mathematical difficulties stem from the complex topological compatibility required at the singular vertices and the corresponding mean-value constraints across adjacent elements. We tackle these challenges by developing a unified barycentric skeleton-bubble calculus that explicitly constructs vertex jets, edge modes, and face transfers to globally route element means. The accompanying exact computations independently verify these finite-dimensional identities and provide reproducibility data.
Read the full abstract

Computer Vision

STRAND: Benchmarking and Improving Object-Centric Spatio-Temporal Monitoring in Video Large Language Models

While multimodal large language models (MLLMs) have advanced video understanding, they remain highly prone to hallucinations in dynamic scenes. We argue this stems from a failure in spatio-temporal monitoring, the ability to persistently track object identities, states, and relations over time. Existing benchmarks obscure this deficit by relying on single final-answer evaluations for queries that can often be resolved via local visual cues or statistical priors. To rigorously diagnose this, we introduce STRAND, a benchmark of human-verified object-centric facts that evaluates intermediate reasoning by decomposing queries into sub-questions, distinguishing genuine temporal understanding from coincidental correctness. Crucially, we score models with Faithful Accuracy, an unconditional joint metric that credits a prediction only when the target answer and every prerequisite sub-question are correct, so that a model cannot inflate its score by being selectively consistent on the small subset of targets it happens to answer correctly. To address failure modes exposed by STRAND, we further propose an object-centric framework that explicitly constructs and reasons over structured object trajectories via chunk-wise state extraction and temporal aggregation. Extensive experiments, including backbone-, frame-, call-, and token-matched comparisons against both end-to-end MLLMs and modular video harnesses, demonstrate that our object-centric framework significantly reduces hallucinated answers and improves spatio-temporal reasoning consistency over state-of-the-art MLLMs. The code, model, and data have been made available at nguyentthong.github.io/strand.
Read the full abstract

All authors Thong Nguyen, Tri Cao, Khoi Le, Cong-Duy Nguyen, Quynh Vo, See-Kiong Ng, Bryan Hooi Kuen-Yew

Systems and Control

Time-Invariant Control Barrier Functions for Bounded STL Safety

Enforcing finite-time persistence specifications in Signal Temporal Logic typically requires formulating Control Barrier Functions within an extended state-time space. This introduces strict mathematical assumptions on global clock synchronization, rendering multi-agent execution brittle under asynchronous network delays, clock skew, and non-monotonic jitter. In this paper, we prove that for bounded-time safety tasks, explicit time dependency can be mathematically eliminated for general continuous-time nonlinear systems. By leveraging the reciprocal integral of worst-case system dissipation, we systematically compile temporal specifications into static, lower-dimensional spatial invariants. We formally prove that this time-invariant realization is strictly sound, removes the need for heuristic time-varying envelope tuning, and guarantees robust forward invariance even under severe network desynchronization.
Read the full abstract

Statistical Mechanics

A summation rule for the four-coupling beta function of four-dimensional nonplanar Euclidean scalar $\varphi^{4}$ theory under factorial coefficient bounds, and a domain on which the summed beta function is well defined

Let $\mathbf{c}=(\lambda,\alpha,\mu,\nu)\in\mathbb{R}^{4}$ denote the four running couplings of four-dimensional nonplanar Euclidean scalar $\varphi^{4}$ theory, and let $B(\mathbf{c})=\sum_{p\ge2}\sum_{|\mathbf{m}|=p}\beta(\mathbf{m})\mathbf{c}^{\mathbf{m}}$ be its formal beta-function series. Assuming the factorial coefficient bounds $|\beta(\mathbf{m})|\le (p-1)!C^{p-1}$ for $|\mathbf{m}|=p$, we construct an explicit summation rule $\mathcal{S}$, given by a cut Borel–Laplace transform whose cut is placed by a scale-covariant real-analytic gauge. We prove that it assigns a well-defined real value to $B$ on an explicit nonempty open domain, in fact on all of $\mathbb{R}^{4}$. The summed function $\mathcal{S}B$ is linear and real, real-analytic on $\mathbb{R}^{4}\setminus\{0\}$, $C^\infty$ on $\mathbb{R}^{4}$ with Taylor series $B$ at the origin, and Gevrey-$1$ asymptotic to $B$ to all orders with an explicit remainder bound. At optimal truncation the remainder is $O(e^{-\eta/(C\|\mathbf{c}\|_\infty)})$ for any $\eta<1$. We show that $\mathcal{S}B$ reproduces the classical Borel sum and the ordinary sum of a convergent series up to errors of the same exponentially small order. Exact reproduction is impossible for any linear rule defined on the whole admissible class: regularity forces all weights to equal $1$, leading to divergence. Finally, we prove optimality under the stated hypothesis. Admissible series may diverge at every $\mathbf{c}\ne0$, and their Borel transforms may have the circle $|\tau|=1/(C\|\mathbf{c}\|_\infty)$ as a natural boundary, so classical Borel-type summation need not be available on the class. Moreover, there exist two functions indistinguishable at the level of the coefficient bounds yet differing by exactly $(2\pi/C)e^{-1/(C\|\mathbf{c}\|_\infty)}$. All constants are explicit and all arguments are self-contained.
Read the full abstract

Computer Vision

PROVE: Proof-guided Regime-aware Operator Verification for Hallucination Detection in Medical Visual Question Answering

In medical visual question answering (VQA), hallucinations of vision-language models (VLMs) may lead to confident but incorrect responses, raising the risk of diagnostic errors. Existing hallucination detection methods uniformly estimate the reliability of VLM outputs from response consistency or visual evidence. However, such uniform verification across questions ignores question-specific characteristics, resulting in missed overconfident errors and false alarms from over-verification. We present PROVE (Proof-guided Regime-aware Operator Verification), a black-box detector that adapts verification strategy to the evidential structure of each question. PROVE classifies questions into three verification regimes based on what kind of visual proof they demand, activates a regime-specific subset of five complementary operators, and adjusts operator importance per question through a lightweight calibration layer conditioned on deterministic question-answer features. PROVE uses question-specific evidence to reweight operators and produce a calibrated risk score. Evaluated on 8048 test samples across three medical VQA benchmarks and four frontier VLMs, PROVE achieves 0.821 AUROC, outperforming the strongest baseline by +0.159, with consistent gains across all models and benchmarks.
Read the full abstract

All authors Keyang Zhou, Siyi Li, Zhongnan Shi, Qichao Ying, Wei Tang, Zhenxing Qian

Hardware Architecture

Certified Bank-Aware Fast-Path Coverage for Hardware-Constrained NDN Forwarding Lookup

Named Data Networking (NDN) replaces address-based forwarding with longest-prefix lookup over variable-length hierarchical names, creating a difficult fit with bounded hardware fast paths. We formulate this problem as certified fast-path coverage. An offline mapper selects a prefix-closed set of parser-visible trie nodes and a separate set of action-equivalence certificates under a shared budget. A certificate relates a selected shallow FIB prefix to a deeper true-LPM class with the same forwarding action; applying the shortcut requires a sound class guard, while uncertain traffic falls back to an exact path. We present BPC-Greedy, a certificate-aware placement heuristic, and BPC-Portfolio, a multi-strategy wrapper spanning exact-heavy, repair-based, and shallow-shortcut constructions. The formulation exposes a tree-closure knapsack structure for prefix placement, exact top-k certificate selection for a fixed selected set under uniform certificate cost, and a separate bank-feasibility layer. On a synthetic parser-depth sweep and a 50k replay of public NDN testbed names under a reproducible synthetic forwarding-action snapshot, modeled certified coverage increases from 46.48% for the best exact-prefix-only bank-aware baseline to 64.06% at total budget M=48. These results characterize placement opportunity under the stated model: the evaluator uses the known true LPM as an oracle-style guard, certificate-table bank traffic is not modeled, and no claim is made about synthesized latency, area, or throughput.
Read the full abstract

Numerical Analysis

Accelerating Multiple-Precision LU Decomposition with Ozaki Scheme II

Solving ill-conditioned linear systems needs LU decomposition in precisions beyond binary64. The standard approaches – GMP/MPFR, or multi-component arithmetic such as double-double – leave every scalar multiply-add inside the O(n^3) update in multiple precision, and so cannot exploit the low-precision matrix engines that dominate current hardware. We build a blocked, partially pivoted LU decomposition on Ozaki scheme II, which replaces the multiple-precision GEMM by exact integer modular products followed by an explicit CRT reconstruction, and implement it for multi-component (DD/TD/QD) and arbitrary precision, on CPUs and GPUs. Two contributions make this practical: a direct conversion between the non-overlapping expansion format and the internal fixed-point representation, which removes the MPFR round trip and is worth a factor of 2.4–4.7; and new FP16, FP8 and binary64 GPU back-ends, the FP8 one using a balanced base-17 two-digit encoding that keeps the full 362.8-bit CRT capacity of INT8. On an Arm/GB10 and an x86/H100 the fastest back-end changes with the machine: INT8 wins on GB10, whereas on H100 binary64 is fastest for QD, beating both the native implementation and INT8. The essential point of Ozaki scheme II is thus not to use a low-precision engine but to choose the format maximising bits-per-modulus times engine throughput. For the Lotkin matrix at p ~ 1.2 log2 cond(A) we reach relative errors of 10^-645 at n=2048, up to 2.84x faster than a fully OpenMP-parallel multiple-precision LU. We also show by measurement that the O(p) advantage of scheme II over scheme I applies only to the GEMM term: modular reduction and CRT grow as O(p^2) and dominate the runtime at the matrix sizes considered here. The implementation is released as open source.
Read the full abstract

Computers and Society

When Agents Act Unwatched: The Reduced-Supervision Paradox in Agentic AI

Agentic AI is sold on a simple promise: the system keeps acting when the user stops watching. That promise creates an accountability inversion. As stepwise supervision recedes, verification does not disappear; it moves into the runtime infrastructure that defines authority, records action, interrupts execution, checks outcomes, and supports repair. We call this the reduced-supervision paradox. Using a 63-artifact audit, we examine its public visibility across 46 research papers and 17 engineering, documentation, security, and governance sources. We find that agents' action surfaces are far easier to reconstruct than the mechanisms needed to answer for their actions. Tool mediation and monitoring traces were clearly visible in 40 and 37 artifacts, whereas checkpoint placement was clearly visible in 6, validator independence in 4, recovery in 2, and contestability in 1. Three action paths show why this imbalance matters. A repository path can preserve rich diffs after a consequential change. A browser path can cross organizational boundaries faster than permissions travel. A service path can follow policy while leaving affected people without recourse. We argue that observability can become a substitute for accountability when it shifts verification onto users after meaningful intervention is no longer possible. Our action-path diagnostic instead asks whether a delegated action remains connected to authority, evidence, interruption, independent judgment, recovery, and challenge. The claim is deliberately bounded to public visibility; it does not establish the prevalence or effectiveness of undisclosed controls. We contribute an action-level account that recasts the harness from a technical wrapper into accountability infrastructure.
Read the full abstract

Computers and Society

Beloved Afterlives: Governing AI Resurrection Beyond Consent

AI resurrection is often framed as a question of consent: did the represented person authorize being made to speak? That question matters, but it freezes authority at the moment of creation. A representation can later change models, pass to relatives, depend on a provider, incorporate records shared with others, or circulate far beyond its intended audience. We argue that the central governance problem is therefore not whether authorization exists once, but whether it remains legible as the representation moves. Across a public-record audit of 93 systems, creation was far easier to inspect than the conditions for speaking, contesting, preserving, or leaving: consent or authority information was thin in 82 systems, objection or redress in 82, and deletion or export in 77. The differences among systems reveal why these gaps cannot be reduced to one transparency score. Human afterlives show consent becoming incomplete over time. Companion-animal afterlives begin where subject consent is unavailable and shared care must allocate authority. Adjacent persona and mimetic systems show how voices, likenesses, and personalities can travel into later afterlife uses. Four public cases follow the same movement from premortem participation, through intimate postmortem creation, to third-party circulation and family contestation. From this evidence we develop relational authority: authorization is distributed across people, records, providers, and audiences, and must remain traceable as those relations change. This reframes AI resurrection from a product authorized once into an accountability chain linking creation authority, source boundaries, circulation, contestation, and exit. The study measures what users and affected parties can inspect publicly; private implementation and lived outcomes remain open empirical questions.
Read the full abstract

Accelerator Physics

Macroscopic Classical and Quantum Models of Inverse Compton Scattering

Inverse Compton sources — in which a relativistic electron beam scatters a laser pulse to produce tunable, collimated, high-energy radiation — have emerged as promising compact radiation sources, with applications in nuclear photonics, medical imaging, and nanoscale metrology. As laser intensities increase and electron energies grow, the interaction enters the radiation reaction regime, where the energy radiated by the electron becomes a significant fraction of its kinetic energy. Predicting the scattered electron energy spectrum from first principles has remained an unsolved problem. Existing models are either classical equations of motion requiring large-scale multiparticle simulation, or quantum models relying on approximations of uncertain validity with the same simulation burden. None directly produce a spectral prediction. This dissertation presents a novel framework that resolves this deficiency. The laser pulse is represented as a coherent quantum state of the electromagnetic field and the electron beam as a statistical quantum state encoding its momentum distribution — the natural realization of particle-field scattering within quantum electrodynamics. For a Gaussian laser pulse, a closed-form analytic expression for the scattered spectrum is derived requiring no simulation, no approximation of the laser field profile, and no large particle ensembles. The classical limit recovers Landau-Lifshitz dynamics exactly, establishing the coherent-state model as the quantum electrodynamic realization of classical radiation reaction theory. The framework is validated against existing experimental data, and fundamental structural limitations of all current modeling approaches are identified and analyzed.
Read the full abstract

Software Engineering

On Behavioral Alignment of Model-Code and Human-Code Understandability via Behavioral Proxies

Code understandability is a critical aspect of software quality. Prior research has largely focused on this attribute from a human-centric or code-centric perspective, while it should be viewed as a relational property arising from the interaction between a reader and the code. With the increasing adoption of large language models in software engineering, we posit that the notion of "reader" should be generalized to encompass both humans and models. Building on this relational perspective, we extend the concept of code understandability to distinguish between human and model code understandability, aiming to investigate the behavioral alignment between the two. To this end, we use a dataset from a prior study containing human-rated judgments of understandability across diverse participant groups, and evaluate multiple open and closed-source LLMs. To operationalize such behavioral alignment, we introduce four behavioral proxies of model-code understandability (BPMU): P0, based on program comprehension-focused question answering; and P1–P3, based on program intent summarization (derived from our proposed semantic self-consistency). Our findings show that LLMs exhibit stronger behavioral alignment with general human code understandability than previously used shallow machine learning baselines. Stratified analyses further reveal that model code understandability aligns most closely with professional developers, but significantly less with other student groups. Role-conditioned prompting does not improve the alignment for the latter, suggesting that current LLMs cannot accurately mimic the perspectives of human readers with varying expertise. Finally, we demonstrate that semantic self-consistency is a reliable and extensible measure to be used as a behavioral proxy for quantifying model code understandability, with broad implications in both software engineering research and practice.
Read the full abstract

All authors Xiaokai Rong, Aashish Yadavally, Anh H. N. Nguyen, Hridya Dhulipala, Tien N. Nguyen

Number Theory

Infinitely Many Binomial Coefficients of Deficiency One

A binomial coefficient $\binom{n}{k}$ is good if all its prime divisors exceed $k$, and its deficiency is the number of $k$-smooth integers in $(n-k,n]$. A short constructive proof of the existence of infinitely many good binomial coefficients with deficiency exactly one is given, which provides an answer to a problem of Erdős, Lacampagne, and Selfridge.
Read the full abstract

Combinatorics

A square-root law for equitable coloring

An equitable $k$-coloring of a graph partitions its vertex set into $k$ independent sets whose sizes differ by at most one; the least such $k$ is the equitable chromatic number $\chie(G)$. Every known bound on $\chie$ valid for all graphs, beginning with the Hajnal–Szemerédi theorem, is linear in the maximum degree $\Delta$, and the star $K_{1,\Delta}$, for which $\chie=\ceil{\Delta/2}+1$, shows that no general bound below $\Delta/2$ exists. We prove that this obstruction is a shortage of vertices rather than an effect of the degree: every graph with $|V(G)|\ge3\chi(G)\Delta$ satisfies $\chie(G)=O\bigl(\chi(G)^{3/2}\sqrt{\Delta/\ln\Delta}\bigr)$ throughout the range $\chi(G)\le(\Delta/\ln\Delta)^{1/3}$, so that for graphs of large order the degree enters only through $\sqrt{\Delta/\ln\Delta}$, with the chromatic number governing the rest. For each fixed $\ell$, $\ell$-colorable graphs of sufficiently large order satisfy $\chie\le\bigl(2\sqrt2\,\ell\sqrt{\ell-1}+o(1)\bigr)\sqrt{\Delta/\ln\Delta}$, while a probabilistic construction supplies graphs of arbitrarily large order, bipartite when $\ell=2$, with $\chie\ge\tfrac13\sqrt{(\ell-1)\Delta/\ln\Delta}$: the order of growth $\Theta\bigl(\sqrt{\Delta/\ln\Delta}\bigr)$ is exact for every fixed chromatic number, and the extremal constant is determined up to a factor $O(\chi(G))$. All upper bounds are constructive, and a prescribed-anchor variant of the construction produces equitable colorings of bipartite graphs with $O(\sqrt\Delta)$ colors in optimal linear time.
Read the full abstract

Quantum Physics

Physics-Informed Classical and Quantum Neural Networks for One-Dimensional Schrodinger Eigenvalue Problems

The Schrodinger equation in one spatial dimension admits a small set of exactly solvable potentials that serve as natural proving grounds for any new eigenvalue solver. We formulate Physics-Informed Neural Networks (PINNs) and Physics-Informed Quantum Neural Networks (PIQNNs) for the time-independent Schrodinger equation and apply them to three of these benchmarks: the harmonic oscillator, the infinite square well, and the finite square well. In each case a composite loss encodes the differential-equation residual, the normalization condition, the boundary behavior, and the orthogonality between eigenstates, so that the trial wave function is driven toward a genuine eigenfunction without supervised data. The eigenvalues and wave functions returned by both methods are compared against the exact spectra and against three classical references: the matrix Numerov method, the finite difference method, and the shooting method. For the smooth oscillator the two neural solvers reproduce the lowest four eigenvalues to parts per million, while for the square wells they recover the analytic levels with comparable fidelity even where the potential is discontinuous. The quantum circuit, built as a layered angle-embedding ansatz with strongly entangling blocks, converges more reliably than its classical counterpart on the higher excited states, where the loss landscape of the classical network becomes harder to navigate.
Read the full abstract

All authors Tariq Mahmood, Waqas Arshad, Bilal Naseer, Alfredo Raya

Computation and Language

Fairness Beyond Anonymization? Demographic Leakage in German LLM-Generated Resumes

Large language models (LLMs) are increasingly integrated into AI-assisted hiring pipelines, including automated resume generation and screening. Under the EU AI Act, the hiring domain is classified as high-risk, making fairness and transparency critical requirements. Existing work has primarily focused on explicit hiring decisions, while less attention has been paid to whether generated resumes themselves encode recoverable demographic information. In this work, we conduct a two-stage audit of demographic leakage in German-language LLM-generated resumes. First, we use ChatGPT (GPT-4o-mini), Gemini 2.5 Flash-Lite, and multiple scales of the open-weight Qwen 3 model family (4B, 8B, and 14B) to generate resumes from real anonymized job-matching profiles, systematically varying gender- and ethnicity-associated names while holding qualifications constant. Second, we simulate a downstream resume screening scenario, where the generated resumes are first anonymized and gender-neutralized, before demographic leakage classifiers are trained on the resulting texts. We find that, despite these interventions, classifiers reliably distinguish between resumes generated with male and female names. This leakage is not driven by overtly gendered wording, but by subtle differences in the usage of semantically equivalent, formally gender-neutral terms in German. In contrast, ethnicity-related leakage remains comparatively weak across models. Our findings demonstrate that apparently neutral resume generation can still preserve highly predictive demographic signals, raising concerns about anonymization-based fairness interventions in multilingual AI hiring pipelines.
Read the full abstract

All authors Charlotte Leininger, Helena Veit, Matthias Aßenmacher, Andreas Bender