High Energy Physics (Phenomenology)
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 14 September
The report on an extraction of genuine twist-three parton distributions, obtained from a joint fit of the deep-inelastic scattering (DIS) structure function $g_2$, its moment $d_2$, and the Sivers and worm-gear-T asymmetries measured in semi-inclusive DIS (SIDIS). These four observables probe different sections of the same twist-three distributions, and thus their joint analysis makes a precision extraction of this two-variable function possible. Considering a sub-set of observables does not constrain the twist-three distribution in all its parts. Nonetheless, such consideration places a sufficient amount of restrictions to sufficiently accurately estimate eliminated observables, explicitly demonstrating the universality of twist-three distributions.
Robotics
An Information-Space Perspective to Scene Graph Sufficiency for Robotic Task Planning
Planning in complex environments requires task specifications grounded in representations that capture objects, relations, and affordances; scene graphs meet this need, but their size in large environments hinders efficient planning. While task-aware pruning and hierarchical abstractions have been explored, a general, task-centric formalization of what constitutes a sufficient scene graph for planning remains open. This paper provides such a formalization by modeling planning over scene graphs within an information-spaces framework through the definition of scene graph transition systems and relevant action semantics for navigation and manipulation. We then introduce derived scene graphs via information mappings that merge and prune nodes and induce quotient transition systems augmented with motion primitives to capture higher-level actions over merged graph nodes. Sufficiency is characterized by two conditions: (i) the information mapping yields a deterministic quotient, and (ii) the task is well-posed over derived traces, ensuring plans found on the derived model are feasible on the maximal system. We illustrate the framework using a task over an example environment, showing both sufficient and insufficient reduced scene graphs.
Read the full abstract
Quantum Physics
Information Erasure and Quantum Imprint in Quantum Measurement and First-Order SPAM Error Separation
We introduce information erasure and quantum imprint as two properties that classify quantum instruments. Information erasure is the property that an appropriate postselection can render the distribution of earlier measurement outcomes independent of the initial quantum state while retaining all outcome branches. Quantum imprint is the complementary property that no admissible postselection can eliminate this state dependence. We show that this classification has a nontrivial structure and that the natural intuition that measurements providing more information about the initial quantum state should be less likely to exhibit information erasure does not hold in general. We further show that, under a sufficiently reliable postselection, information erasure enables first-order separation of state-preparation and measurement (SPAM) errors. Specifically, the first-order contribution of state-preparation error vanishes from the posterior distribution, whereas visible first-order contributions of measurement error remain. This result recasts SPAM error separation from the problem of simultaneously characterizing state preparation and measurement into the problem of realizing a reliable postselection.
Read the full abstract
Statistics Theory
Extension of Likelihood Ratio Analysis Method to Skorokhod $M_1$ Topology (with Application to Poissonian Smooth Change-Point Model)
We extend the Ibragimov-Khasminskii likelihood ratio analysis method, in the one-dimensional parameter case, to a framework based on the Skorokhod $M\_1$ topology. The proposed framework applies to a broad class of statistical models, including those for which the normalized likelihood ratio processes are continuous while the limiting likelihood ratio process is discontinuous, a setting outside the scope of classical approaches based on the uniform or Skorokhod $J\_1$ topologies. We derive sufficient conditions for the weak convergence of likelihood ratio processes in the space of càdlàg functions on $\RR$ vanishing at $\pm\infty$, endowed with the Skorokhod $M\_1$ topology, and show how this convergence yields the asymptotic behavior of the maximum likelihood estimator. We also introduce new techniques for controlling the $M\_1$ modulus of continuity. Although these techniques are particularly well suited to models in which all jumps and steep continuous transitions are in the same direction, they are of independent interest and may prove useful beyond this setting. As an application, we study a smooth change-point model for inhomogeneous Poisson processes in the fast regime, where the transition interval shrinks faster than $1/n$. We establish that in this case the maximum likelihood estimator has the same asymptotic behavior (consistency, rate of convergence, limiting distribution and convergence of moments) as in the corresponding ”pure” change-point model.
Read the full abstract
Quantitative Methods
Multiscale modeling of host-pathogen interactions and mucociliary clearance during non-tuberculous mycobacterial pulmonary infection
Non-tuberculous mycobacterial (NTM) infections are a clinical challenge in cystic fibrosis (CF), where impaired mucociliary clearance and altered mucus rheology promote bacterial colonization despite host immune responses. Understanding how bacterial growth, immune cell dynamics, and mucus transport regulate infection progression is difficult because these processes interact across spatial and temporal scales. We develop a computational framework bridging a mechanistic agent-based model (ABM) of NTM infection with a spatially resolved partial differential equation (PDE) model. The PDE model couples bacterial proliferation, macrophage chemotaxis, immune-mediated clearance, mucus degradation, and viscoelastic transport in a two-compartment geometry representing mucus and lung tissue. Parameters are calibrated using data from the established ABM, yielding an efficient continuum representation while preserving cellular mechanisms. The PDE model reproduces bacterial and macrophage dynamics and enables analyses of mucus-related mechanisms and therapies. Sensitivity analysis identifies mucus viscosity, bacterial diffusivity, and macrophage mobility as key regulators of bacterial persistence through mucociliary clearance and tissue colonization. Simulations reveal nonlinear effects of mucolytic therapies: enhanced clearance reduces bacterial burden in mucus, whereas excessive viscosity reduction may promote migration into lung tissue, supporting combination with antibacterial treatment. This framework provides a quantitative platform for studying pulmonary infections, evaluating therapies, and developing patient-specific digital twins.
Read the full abstract
High Energy Physics (Phenomenology)
Generalized Parton Distributions: Phenomenology, Extraction, and Hadron Imaging
Generalized Parton Distributions (GPDs) provide a framework for investigating the correlated momentum and spatial structure of quarks and gluons in hadrons and for accessing fundamental properties such as angular momentum and the QCD energy-momentum tensor. In this review, we discuss the present status of GPD phenomenology, emphasizing the challenges involved in connecting deeply virtual exclusive measurements to the underlying partonic structure. We organize this problem in terms of two successive inverse problems: the extraction of Compton Form Factors (CFFs) from measured observables and the reconstruction of GPDs from the convolution integrals defining the CFFs. We review the theoretical description and phenomenological parametrizations of GPDs, current strategies for CFF and GPD extraction, and the role of lattice QCD, Bayesian inference, uncertainty quantification, and artificial intelligence, including neural networks and interpretable machine-learning approaches. We discuss the limitations of present determinations and the opportunities offered by the Jefferson Lab program, complementary exclusive processes, and the future Electron-Ion Collider. Finally, we consider how increasingly precise and multidimensional information, together with new statistical and AI methodologies, will transform GPD phenomenology in the emerging era of precision hadron imaging.
Read the full abstract
Complex Variables
On questions posed by Gundersen and Yang concerning a certain binomial differential equation
Suppose \(a, b, c\) are polynomials with \(ab \neq 0\) and \(c\) nonconstant. We determine all entire solutions to the equation \begin{equation*} f'f” - a(z)f^2 = b(z)e^{2c(z)}. \end{equation*} This completely solves two open questions posed by Gundersen and Yang in [Comput. Methods Funct. Theory 21 (2021), 605-617].
Read the full abstract
Optimization and Control
Classical Solutions for a Finite-Horizon Exit-Time Problem with Degenerate Diffusion Control
We study finite-horizon exit-time control of a one-dimensional affine diffusion, with an unbounded control acting on both drift and volatility. Since an admissible control can cancel the instantaneous volatility, the associated HJB equation is not uniformly parabolic. Moreover, the location of the degeneracy is not prescribed by the model coefficients but depends on the unknown value function and optimal feedback. Rather than relying on a viscosity-solution formulation, we work under suitable structural assumptions and prove that the value function is a $C^{1,2}$ classical solution throughout the interior of the state domain and is strictly convex in the state variable. Moreover, we construct a locally Lipschitz optimal feedback, explicitly identify the degenerate set as a curve, and show that the closed-loop drift on this curve equals the time derivative of its state coordinate. Finally, we prove invariance and inaccessibility before exit and derive exact squared-logarithmic asymptotics for approach probabilities.
Read the full abstract
Information Theory
An Overview of Rate-Distortion-Perception Theory
This paper provides a comprehensive overview of the rate-distortion-perception framework, tracing its evolution from mathematical theory to practical deployment. We review the mathematical definition of the the mathematical definition of the Blau–Michaeli function and the associated coding theorems, examine computational methods for its evaluation, and discuss alternative formulations of the framework. Operational principles and design guidelines for modern image and video coding are also presented, highlighting the rate-distortion-perception framework as a rigorous foundation for developing next-generation perceptual compression systems.
Read the full abstract
Computer Vision
What a gated sensing pipeline never looks at: bandwidth reduction and the misses behind it
An airborne sensor on a contested link cannot send video, so the appealing move is to send findings instead and report the ratio between the two. We evaluate a gated sensing pipeline that does this, combining learned object detection and image-text comparison with deterministic scheduling, gating, evidence accumulation and transmission rules. On staged footage with the semantic stage live it sends 38,736 bits over 211 s, a reduction of 41,977x, and names 1 of 4 staged events with no false report. That detection has since been superseded: a correction to how the tracker measures speed removed the measurement artefact the normality model had been learning from, and the flight no longer warms. Under the corrected code the pipeline names 1 of 7 staged events across four flights, and we report both. On a control flight where nothing was staged it reports nothing, a reduction of 155,830x: the largest number in the study and the least informative, because a reduction ratio measures the scene. The mechanisms that produce the reduction also decide which observations ever reach a decision, so the two cannot be reported apart. We give a tick-level trace of one flight (3,187 rows) that places each of three missed events at the stage where it stopped progressing: one produced no track, one failed the structural place test at 0.129, and one passed 539 structural ticks but reached only 3.192 against a boundary of 3.807. We also report one instance of a known failure mode, an online normality model absorbing the object it will later judge, measured against the threshold that object then failed. The evidence is one detection and six misses across four staged flights, beside one clean control, and we treat it as a case study. We give the reproduction protocol and generated results, identify which supporting artifacts are not distributed, and state which experiments did not run.
Read the full abstract
Information Retrieval
The Magnitude Mirage: Rethinking Confidence for Reasoning-Intensive Retrieval
Many production RAG systems implement retrieval abstention by thresholding raw similarity scores, implicitly treating score magnitude as a confidence signal. We demonstrate that this practice degrades systematically as queries require reasoning beyond semantic matching. Across 11 retrieval architectures and 28 datasets, neural retrievers consistently assign high similarity scores to semantically related but constraint-violating documents, causing magnitude-based thresholds to collapse toward near-random abstention performance on logical and temporal reasoning tasks—a failure we term the Magnitude Mirage. To address this without computationally expensive alternatives, we conduct a large-scale empirical study of six zero-cost Query Performance Prediction (QPP) metrics across three cognitive tiers: semantic matching (BEIR), logical reasoning (BRIGHT), and temporal reasoning (TEMPO). Our central finding is that the key improvement comes from abandoning magnitude in favor of score-distribution signals: the gain from this shift exceeds the differences among distributional alternatives by a factor of 5-10$\times$. In particular, Score Gap ($s_1 - s_k$) and a practical adaptation of Score Magnitude and Variance (LSMV) improve abstention AUROC by up to 0.16 in settings where magnitude-based confidence provides little discriminative power. These methods require no additional inference, retraining, or latency, making them a practical zero-cost replacement for magnitude thresholding in deployed RAG systems.
Read the full abstract
Numerical Analysis
How well do fast discrete trigonometric transforms work for parametric numerical integration?
The fast Fourier transform (FFT) and its real counterparts, the fast algorithms of the discrete cosine transform (DCT) and the discrete sine transform (DST), are frequently employed for the numerical evaluation of the Fourier cosine and Fourier sine transform, thereby acting as parametric quadrature rules based on finitely many samples of a given continuous function. But how accurate are the obtained results? In this paper we study the error occurring if the DCT of type I (DCT-I) and the DST of type I (DST-I) are applied to compute $\int_0^{\infty} f(x)\cos(2\pi xv)\d x$ and $\int_0^{\infty} f(x)\sin(2\pi xv)\d x$ for $f \in L^1(\Rp) \cap C(\Rp)$ and $v \in \Rp$, as well as the error occurring if the Chebyshev coefficients $\frac{2}{\pi}\int_0^{\pi} h(\cos\theta)\,\cos(n\theta)\d\theta$, $n \in \Np$, of a function $h \in C(I)$ on $I := [-1,1]$ are computed by the DCT-I. We present practicable, explicit error estimates under polynomial, exponential, and mixed decay conditions. For the Fourier cosine and sine transform, rational functions lead to a geometric decay in the frequency parameter $P$ combined with an algebraic plateau of order $L^{-3/2}$ in the sampling parameter $L$, while for meromorphic functions such as $\operatorname{sech}(\pi\,\cdot)$ the critical geometric rate is attained in both parameters. For Chebyshev approximation of a rational function with simple poles in $\C \setminus I$, the quadrature error has the critical geometric rate $\rho_0^{-P}$ with an explicit constant, where $\rho_0 > 1$ is the parameter of the largest Bernstein ellipse of analyticity. Several numerical examples illustrate the theory.
Read the full abstract
Cryptography and Security
Approval Integrity and Recovery in LLM Answer Publication
Publication integrity in LLM systems requires binding approved content to its current authorization context. We examine exact-content binding, authorization freshness and checkpoint recovery in Lightcap's publication enforcement mechanism. On 900 independently human-annotated RAGTruth responses from 150 source tasks, three dated Ministral models and a same-model direct-grounding baseline yield 3,600 assessments. The production response-act checker instantiated with 14B accepts 291 of 302 unsupported-labelled answers; the direct baseline accepts 41. Supported-answer retention is 95.2% and 66.9%, respectively. An exact promotion-correction identity tracks error through 100 chronological 3B-14B-8B-14B answer trajectories. Among 65 initially approved answers, the final stateful recheck-recovery policy increases exact-match error by 9.23 percentage points relative to the initial checkpoint (95% article-clustered interval [-1.72, 19.61]). Controlled evidence-fingerprint changes expose asymmetric freshness enforcement between publication and recovery. A separate BIPIA prompt-injection experiment records zero target insertions among 266 valid editor outputs. External Hugging Face calibration experiments transfer retrieval models from ArguAna to SciFact and NFCorpus, and diagnostic decision rules from Thunderbird to BGL, distinguishing probability calibration from ranking changes. The measurements separate semantic false approval, stale authorization and recovery-induced error at executable publication boundaries.
Read the full abstract
Quantum Physics
Bell-inequality violation in light transmitted through disordered emitter ensembles
We show that light transmitted through a disordered ensemble of weakly coupled two-level emitters can violate a Bell inequality in a continuous-wave Franson-type measurement. The Bell signal is determined by two steady-state output-field correlations, the equal-time intensity correlation $g^{(2)}(0)$ and the phase-sensitive two-photon coherence $R$. We compute these quantities for bidirectional propagation through disordered emitter ensembles using a fourth-order cumulant expansion of the many-body master equation. The resulting Bell inequality violation appears in two distinct regimes, an antibunched regime where equal-time coincidences are suppressed and a bunched regime where photon pairs remain phase coherent. Extrapolating the numerics to a representative weak single-emitter coupling $\beta=0.01$ predicts violation in the antibunched regime for atom numbers $N\simeq75$-$220$, and in the bunched regime for $N\gtrsim250$.
Read the full abstract
High Energy Physics (Phenomenology)
Towards the new NNPDF4.1 global analysis
We review progress and plans towards a new global PDF analysis from the NNPDF Collaboration. This new release will be based on state-of-the-art theory calculations, and in particular will be based on exact NNLO interpolation grids, (approximate) N3LO QCD corrections to DGLAP evolution and DIS structure functions, and QED effects to DGLAP evolution. All relevant sources of experimental and theoretical uncertainties, the latter including missing higher orders and higher twists, are taken into account. As compared to NNPDF4.0, this new release includes more than 25 new datasets from HERA jets to Drell-Yan (inclusive and with extra jets), top quark, and jet production at the LHC among others. Our machine learning methodology is statistically validated by extensive closure and future tests and benefits from an improved hyperoptimization algorithm.
Read the full abstract
Theoretical Economics
Algorithmic Attention and Content Creation on Social Media Platforms
We study revenue-maximizing attention allocation on an ad-funded social media platform governed by recommendation algorithms. Attention is costly and can be monetized through advertising or allocated to increase creators' exposure, creating a trade-off between monetization and production incentives. In a two-sided model with heterogeneous viewers and creators under private information, the optimal recommendation mix includes content that is ex post suboptimal for some viewers to leverage network externalities. These distortions are targeted: low-ability creators are excluded, while high-ability creators are subsidized through exposure or monetary payments. Two-sided complementarities reshape content variety and quality, with implications for personalization regulation and advertising markets.
Read the full abstract
Complex Variables
On the pluricomplex Poisson kernel and the associated complex Monge–Ampère equation
We give a geometric characterization of the pluricomplex Poisson kernel of bounded strongly linearly convex domains in $\mathbb C^{n+1}$ in terms of their foliation by all complex geodesic discs whose closure contains a fixed boundary point, thus confirming a conjecture posed by Bracci et al. in 2009, even in greater generality. The proof relies crucially on our previous results obtained in a series of two papers. We also revisit the homogeneous complex Monge–Ampère equation associated with the pluricomplex Poisson kernel and show that its solutions are far from unique in general by constructing a family of pairwise nonproportional continuous solutions on the unit ball in $\mathbb C^{n+1}$. This sharply contrasts with the uniqueness of solutions to the corresponding equation for the pluricomplex Green function.
Read the full abstract
Artificial Intelligence
GRIN+: Towards Fast Yet Effective Machine Unlearning for Imbalanced Medical Data
As deep learning models become fundamental to modern healthcare, the "Right to be Forgotten" mandated by privacy regulations like GDPR and HIPAA necessitates effective machine unlearning (MU) to remove sensitive patient data from trained models. However, existing MU techniques often struggle with a fundamental "privacy-efficiency-utility" (PEU) trilemma, particularly in medical scenarios where data is frequently characterized by severe class imbalance and long-tailed distributions. In such cases, standard unlearning methods can fail to protect key clinical knowledge or mistakenly delete features essential for diagnosing rare conditions due to the gradient dominance of majority classes. To address these challenges, we propose GRIN+, a novel machine unlearning framework designed for fast and precise data erasure in imbalanced medical scenarios. GRIN+ decouples unlearning-specific knowledge from generalized representations at the parameter level by analyzing the gradient contributions of both "forget" and "retain" sets. It introduces a class-adaptive influence scoring mechanism to rectify gradient dominance and employs a direction-constrained update strategy to prevent the unintended erosion of vital clinical knowledge. Comprehensive benchmarking across multiple medical datasets, including skin cancer (ISIC), brain tumor (MRI), and breast ultrasound (BUSI), demonstrates that GRIN+ achieves an optimal balance of the PEU trilemma. Experimental results show that GRIN+ maintains high diagnostic accuracy and robust privacy while significantly enhancing runtime efficiency compared to existing baselines. We open-source the GRIN+ code and benchmarks to support further research.
Read the full abstract
Robotics
DIDO: Distilling Interaction-Centric Dynamics into One-Step Denoising for World Action Models
World Action Models (WAMs) use video generation models to predict future visual dynamics for robotic manipulation, but iterative denoising introduces additional latency for closed-loop control. We empirically find that visual content converges at different rates during denoising. Static background structure forms early, whereas the gripper and manipulated object remain blurry after the first step, with their interaction dynamics emerging only through subsequent denoising. Consequently, naively truncating a multi-step video model to one step preserves scene structure but loses the interaction-centric dynamics most critical for manipulation. To address this issue, we propose DIDO, which distills the converged dynamics of a multi-step video model into a single denoising step. DIDO combines distribution matching distillation with interaction-centric representation guidance. Beyond compressing multi-step generation into one forward pass, DIDO explicitly models the gripper, manipulated object, and their interaction using supervised bounding-box visual reasoning tokens. Additionally, DIDO aligns the target object's representations across multiple model layers with features from a pretrained DINOv3 encoder. This interaction-centric guidance helps the distilled model preserve both the relevant entities and their future dynamics in a single step, while substantially reducing inference latency. DIDO achieves an average success rate of 99.0% on LIBERO, 76.6% on LIBERO-Plus, and 92.0% on RoboTwin, while also demonstrating effective transfer to long-horizon and generalization tasks in real-world robotic manipulation.
Read the full abstract
Neural and Evolutionary Computing
Big Brains and Changing Environments: Cause or Consequence?
Large brains are metabolically costly, and associations with changing environments do not imply they evolved there, as the Cognitive Buffer Hypothesis (CBH) would suggest. They may instead evolve in stable conditions and later facilitate colonization of changing environments. Using neuro-evolution in an artificial seasonal foraging task, we compared agents evolving exclusively in changing environments to agents first evolved in static environments before transitioning. Results show that larger neural networks in dynamic environments arise mainly from prior static evolution, achieving superior performance under unpredictable changes. Our results challenge strict CBH predictions, provide agent-based (computational) support for a colonization-based account and highlight the role of evolutionary history in brain size evolution.
Read the full abstract
Information Retrieval
Beyond Retrieval: Scaffolding Children's Online Learning
Children increasingly turn to online information access systems that are primarily designed for the mainstream population, e.g., adults, but possess a limited understanding of how these systems work, contributing to their unstructured and ineffective search practices. This lack of knowledge can hinder their curiosity and the development of critical search skills. Grounded on the existing literature of both child-oriented Information Retrieval and Human Computer Interaction, our work positions children as active participants in the search process, framing it as a scaffolded learning experience rather than a simple retrieval task.
Read the full abstract
Group Theory
A counterexample to the determinant approximation conjecture
The determinant approximation conjecture states that for a residually finite group $G$ and a chain $G_i$ of finite index normal subgroups with trivial intersection, the Fuglede-Kadison determinant of every matrix over the group algebra $\mathbb{Q} G$ is the limit of the Fuglede-Kadison determinants of the matrix reductions from $\mathbb{Q} G$ to $\mathbb{Q} (G/G_i)$. We disprove the conjecture by exhibiting an explicit element of the integral group ring of the Heisenberg group with determinant equal to $2$ and reduced determinants bounded by $\sqrt[3]{5}$.
Read the full abstract
Probability
Bernoulli flow for Erdős-Rényi graphs
We study the eigenvalues and eigenvectors of the adjacency matrix $A$ of the Erdős-Rényi graph $\mathbb G(N,p)$ in the regime $Np \gg (\log N)^2$. We establish optimal isotropic delocalization for the bulk eigenvectors $\boldsymbol u$, meaning that $\langle \boldsymbol v, \boldsymbol u\rangle^2 \leq \frac{C \log N}{N}$ with very high probability for any deterministic normalized $\boldsymbol v$. In addition, we prove local spectral universality in the bulk by showing that the local spectral statistics coincide with those of the GOE. The main tool of our proof is a local law for the resolvent of $A$, down to optimal spectral scales and with optimal error bounds. Its proof relies on a new approach to local laws that we call the Bernoulli flow. It is a characteristic flow method in which the usual Brownian process is replaced by a Bernoulli process, where each edge of the graph forms an independent Markov process that jumps at unit rate from closed to open. The spectral parameter flows according to a suitably constructed matrix-valued Bernoulli characteristic flow.
Read the full abstract
Statistical Methodology
Leveraging hologenomic data for phenotypic prediction: potential and pitfalls
The microbiota is increasingly recognized as an active component of host biology, influencing various host phenotypes. Advances in high-throughput sequencing and the emergence of the holobiont perspective have raised expectations regarding hologenomic-informed prediction. Yet, whether and under which conditions integrating microbiota and genomic data meaningfully improves phenotypic prediction remains unclear. The biological characteristics of the microbiota, including but not limited to transmission mechanisms, environmental effects and interactions with host genetics, complicate their integration into classical evaluation frameworks. In addition, microbiota datasets are high-dimensional, highly dispersed, sparse and compositional. Finally, analytical choices such as the taxonomic granularity considered for aggregation or the similarity matrix used in prediction models may impact downstream inference and prediction accuracy. Here we explore these challenges using a comprehensive set of transgenerational hologenomic simulations. By generating controlled and contrasted biological scenarios across a broad parameter space, we examine how microbiota granularity, variance structure and host modulation influence (i) the estimation of variance components and (ii) the accuracy of phenotypic prediction. We show that the added value of hologenomic, compared to genomic prediction, is highly context dependent. Our results provide a structured framework to interrogate when and how integrating microbiota may enhance phenotypic prediction in breeding applications.
Read the full abstract
Optimization and Control
Deterministically Optimal Robust Exact Differentiators of Arbitrary Order
Estimation of the derivatives of a function with bounded high-order derivative in the presence of bounded measurement noise is considered, in a deterministic setting. Theoretical fundamental limitations of causal differentiators in terms of the lowest achievable worst-case differentiation error and desired properties such as exactness—the zero-error estimation of derivatives in the absence of noise—and robustness—the small sensitivity of the estimate under small perturbations—are established for the first time for arbitrary differentiation order. Differentiators that achieve these theoretically lowest bounds on their differentiation error are formally defined, fully characterized, and their properties are studied. In particular, deterministically optimal differentiators—those featuring optimal differentiation error bounds among the class of exact differentiators—are shown to exist by means of a novel construction exhibiting, in addition to exactness from the beginning, a very strong form of robustness.
Read the full abstract
Analysis of PDEs
Triangles minimize the Monge-Ampère eigenvalue among planar bounded convex domains of a given area
We prove that triangles minimize the Monge-Ampère eigenvalue among bounded planar convex domains of a given area, thus resolving the two-dimensional case of Le's simplex conjecture for the Monge-Ampère eigenvalue (The eigenvalue problem for the Monge-Ampère operator on general bounded convex domains, Ann. Sc. Norm. Super. Pisa Cl. Sci. (5) 18 (2018)). The proof uses a neighbor-decreasing property of the Monge-Ampère eigenvalues of convex polygons along vertex elimination parallel chord movements.
Read the full abstract
Computer Vision
PIVOT: Physics-Grounded Verification for AI-Generated Audio-Video Detection
As generative models continue to advance, AI-generated content (AIGC) is becoming increasingly realistic, weakening the artifact cues commonly exploited by existing detectors. Nevertheless, faithfully reproducing the physical behavior of real-world events remains challenging for current generators. We therefore explore detecting AIGC by assessing whether the depicted event satisfies measurable constraints derived from physical laws. We introduce PIVOT, a physics-grounded AIGC detector, instantiated here for audio-video clips, that estimates physical quantities from video and audio, selects physical laws relevant to each clip, and verifies their measurable constraints. Beyond a real/fake decision, PIVOT returns supporting evidence that records the verification outcome, relevant time window, and supporting quantities for each applicable law. Although instantiated and evaluated here on audio-video data, the framework can, in principle, extend to other AIGC modalities whenever the physical quantities required for verification can be estimated reliably. We also introduce PhysForensics-Bench, comprising paired real and generated audio-video clips from nine event-centric scene families and two recent audio-video generators. On PhysForensics-Bench, PIVOT achieves 70.30% accuracy and 64.29% F1 score on Real+Seedance, and 72.16% accuracy and 65.82% F1 on Real+VEO. In comparison, direct inspection with Gemini 3.1 Pro obtains 53.96% accuracy and 60.09% F1 on Real+Seedance, and 57.22% accuracy and 63.44% F1 on Real+Veo. These results demonstrate the practical promise of physical-consistency verification as a structured and inspectable source of evidence that complements artifact-based AIGC detection.
Read the full abstract
Computation and Language
Can We Trust the Judges? Validation of Factuality Evaluation Methods via Answer Perturbation
Evaluating the factual correctness of large language models (LLMs) is vital for many applications. But are our evaluation tools themselves trustworthy? Despite the rise of factuality-based metrics, their sensitivity and reliability remain underexplored. This paper introduces a meta-evaluation framework that systematically tests these metrics using controlled corruptions of gold standard answers. Our method generates ranked outputs with known degrees of degradation to probe how metrics capture nuanced changes in truthfulness. Our experiments reveal that pipeline-based methods, such as the RAGAS's factual correctness metric, better track degradation than LLM-as-judge approaches. We also propose a new variant of the factual correctness metric that provides a competitive and cost-efficient.
Read the full abstract
Classical Analysis and ODEs
Besicovitch's covering theorem in the parabolic metric
We prove that Besicovitch's covering theorem holds for the parabolic metric $d_p((x_1,t_1),(x_2,t_2))=(|x_1-x_2|^{p}+|t_1-t_2|^{\frac{p}{2}})^{\frac{1}{p}}$ on $\mathbb{R}^n\times\mathbb{R}$ if and only if $p\geqslant 2$. If $p=2$, this answers a question posed by P. Mattila in the affirmative.
Read the full abstract
Computation and Language
Don't Count the Edits, Judge by the Outcome Alone: Reward-Based Evaluation for Grammatical Error Correction
Grammatical error correction (GEC) evaluation has traditionally relied on reference or edit overlap, which can penalize valid rewrites that differ from gold corrections. Reference-free metrics reduce this dependence, but evaluating whether a fluent output is a valid correction of the source remains challenging. We propose SURE, a source-conditioned reward evaluator trained on within-source preferences spanning minimal-edit and rewrite-oriented corrections. SURE jointly learns an overall reward with criteria-level supervision for grammaticality, faithfulness, and fluency, together with span-level grounding for source-side error resolution. Experiments on SEEDA show that SURE performs competitively against strong baselines, with particular gains on rewrite-style corrections and more disentangled criteria-level diagnostics. Our code is available at https://github.com/hayeonggg/SURE.