Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Thursday 10 September

Number Theory

Local-global principles for visibility of lattice points on parameterized curves

We develop a local-global theory for visibility of lattice points on families of parameterized curves. We introduce a notion of $p$-adic visibility and ask whether a lattice point is globally visible precisely when it is visible at every prime. We prove that this local-global principle holds for a broad class of families whose parametrizations are homogeneous with respect to positive weights. When the points on these curves fill the entire positive integer lattice, we compute the local and global densities of visible points and show that the global density is the product of the local densities. We then consider polynomial families of the form $y=qP(x)$, with $q\in\mathbb{Q}_{>0}$, and show that visibility can be detected prime by prime exactly when $P$ is a monomial. For non-monomial polynomials the local-global principle can fail, but the set of points where it fails has density zero; for separable polynomials we also obtain a quantitative bound for the number of non-visible points, improving the previously known bound. We further consider families whose lattice points lie on a proper lower-dimensional algebraic subset of the ambient space and show that their visibility densities can behave differently from those of the full lattice. Finally, we extend the theory from visibility from the origin to visibility from one lattice point to another and show that the corresponding local-global principle continues to hold for weighted homogeneous families.
Read the full abstract

Analysis of PDEs

A note on p-harmonic measure

Let $1 < p < \infty$. We identify the optimal decay exponent of the $p$-harmonic measure $\omega_p ( B( \xi, t) \cap \partial \mathbb{B}, 0, \mathbb{B}) $ for small $t$, where $\mathbb{B}$ is the unit ball in $\mathbb{R}^n$, $\xi \in \partial \mathbb{B}$ and $B(\xi, t)$ denotes the euclidean ball centered at $\xi$ of radius $t$. As a consequence and, under suitable geometrical restrictions on a domain $\Omega \subset \mathbb{R}^n $, we identify the optimal decay exponent of $\omega_p ( B( \xi, t) \cap \partial \Omega, a, \Omega)$ for small $t$, where $a \in \Omega$ and $\xi \in \partial \Omega$. When restricted to the range $1 < p < n$ we provide new estimates complementing previous results of different authors in the unit ball, the unit disc or the upper half-space.
Read the full abstract

Social and Information Networks

Motifs in temporal hypergraphs

Network motifs, recurrent local patterns of interactions in graphs, provide fundamental insights on the interplay between structure and functionality in complex systems. Many real-world systems are not well represented by traditional static pairwise networks, as interactions may involve groups of nodes, occur over time, or encode directionality. In this paper, we introduce temporal motifs for hypergraphs and directed hypergraphs, extending motif analysis to timestamped many-body interactions. We formalize the corresponding mining problem, study the combinatorial structure of these motifs, and develop exact algorithms for their enumeration. In particular, we propose a dynamic programming algorithm that substantially reduces the computational cost of motif mining, achieving orders of magnitude speedups on empirical datasets. We also introduce a null model for temporal hypergraphs to assess the statistical over- and under-expression of motifs. Applying the proposed framework to real-world datasets from different domains, including face-to-face contacts, scientific collaborations, e-mail exchanges, and Bitcoin transactions, we show that temporal hypergraph motifs reveal distinct forms of local organization across systems. Finally, we demonstrate their use as an exploratory tool through focused case studies on persistent patterns in scientific collaborations and e-mail communications.
Read the full abstract

All authors Quintino Francesco Lotito, Lorenzo Betti, Federico Battiston, Giuseppe Francesco Italiano

High Energy Astrophysical Phenomena

Hidden structures in the UHE sky: unveiling potential cosmic-ray sources via spectral signatures

The search for the origin of ultrahigh-energy cosmic rays (UHECRs) typically relies on identifying directional excesses in the particle flux. While this approach is well established, it cannot detect localized spectral features, which could provide constraints on the sources of UHECRs if measured. In this work, we propose extending directional searches through two complementary energy-weighted metrics: the accumulated energy $U$ and the local average energy per particle $\mu_E$. We demonstrate that $U$ inherently amplifies the statistical significance of sources with high-energy tails, while $\mu_E$ provides a distinct probe for direction-dependent spectra. To assess the statistical significance of these metrics, we derive a generalization of the Li-Ma significance formula for continuous energy variables. Using a maximum-likelihood analysis within an exploratory Monte-Carlo model, we show that these variables can enhance discovery potential by amplifying localized excesses and identifying hard-spectrum regions that are not apparent in standard particle-flux maps, thereby providing a comprehensive probe of potential UHECR sources. Furthermore, $\mu_E$ variations associated with localized excesses are smoothed into minor perturbations when the spectrum is integrated over right-ascension or declination bands. Consequently, the presence of small- or intermediate-scale regions with distinct spectral shapes remains consistent with the absence of declination-band spectral variations recently reported by the Pierre Auger Collaboration.
Read the full abstract

Machine Learning

Estimating Pedestrian Volumes from GIS-Derived Built-Environment Features: A Machine Learning Framework

Transportation agencies need pedestrian volume estimates across entire road networks to prioritize safety investments, yet manual counts are expensive and cover only a small share of intersections. We present a machine learning pipeline that predicts 2-hour PM peak pedestrian volume at 101 urban intersections in Portland, Oregon, from built-environment, land-use, and street-network features drawn from open GIS data. Starting from the Negative Binomial GLM used in practice, we add feature selection, count-aware gradient boosting, and repeated cross-validation, selecting one configuration by a combined rank over RMSE, MAPE, and SMAPE across four cross-validation strategies. The winner, a histogram-based gradient boosting model with Poisson loss and L1 Lasso feature selection, reduces cross-validated RMSE by 12% over the GLM baseline (89.8 to 78.7) and holdout RMSE by 19% (108.0 to 87.9). Code is released on GitHub.
Read the full abstract

All authors Bahareh Golchin, Banafsheh Rekabdar, Sirisha Kothuri, Joseph Broach

Quantum Physics

Parallel Circuit Execution for Scalable Quantum Computation

Today's quantum processors have tens to hundreds of physical qubits, but reliable execution of arbitrary circuits remains limited to fewer than 30 entangled qubits across hardware modalities. Building upon prior work, we introduce an error- and topology-aware method for mapping multiple independent circuits onto disjoint regions of a single large-scale QPU for parallel circuit execution. For applications with many similarly sized circuits, such as observable estimation for Hamiltonian simulation, this approach can reduce billed QPU execution time, with ideal speedup proportional to the number of usable partitions. We demonstrate the approach on IBM's 156-qubit ibm_boston processor using standard QED-C benchmark and Hamiltonian-based observable-estimation workloads. Compared with standard sequential execution, parallel execution reduces billed execution time by 3.5-5.5x while retaining 83-92% of the sequential fidelity. We further evaluate the scaling of parallel circuit execution using GPU-accelerated classical simulation, distributing measurement circuits across GPUs via MPI. Using CUDA-Q on the NERSC Perlmutter system, we achieve up to 13.8x speedup on 16 GPUs (86% parallel efficiency) for an H2 electronic-structure simulation, with scaling evaluated across multiple Hamiltonians and circuit counts. These results provide an indication of the performance ceiling that parallel execution on future quantum hardware may eventually approach. Both execution modes are implemented as a runtime option within the QED-C Application-Oriented Benchmark suite. Together, the results show that circuit-level parallelism can reduce execution cost on current quantum hardware and simulation time on GPU clusters, with the potential for greater benefits as device quality and qubit counts increase.
Read the full abstract

All authors Avimita Chatterjee, W. Michael Brown, Siyuan Niu, Wibe Albert de Jong, Thomas Lubinski

Artificial Intelligence

WinSyn: An Automated Pipeline for Realistic Enterprise Question-Answering Evaluation

Enterprise settings provide a challenging environment for question-answering agents, which often rely on Retrieval-Augmented Generation, Deep Research (DR), and related techniques. Much of this challenge comes from the complexity of enterprise data: information is often spread across evolving and potentially conflict- ing emails, chat messages, documents, and other artifacts. Existing benchmarks typically have limited real-world complexity, short-form responses, and unnatural queries, so they often fail to capture the challenges of enterprise settings. In this work, we introduce an automated pipeline for generating synthetic datasets of emails reflecting realistic workplace scenarios, along with long- and short-form questions and gold answers grounded in the data. Our method simulates long-running enterprise projects spanning several months and involving up to 25 interacting employees across multiple roles. The data emphasizes ambiguity, distributed information, and naturally occurring queries. To validate the pipeline, we evaluate few standard agentic baselines on our datasets using the latest frontier models. We find that aggregate scores averaged over all queries remain below 80% for each dataset, indicating significant room for improvement. These findings suggest that more work remains to be done for enterprise deployment and underscore the importance of realistic, high-complexity evaluation data for developing stronger real-world enterprise DR systems.
Read the full abstract

All authors Amey Varhade, Ananya Sutradhar, Ravishankar Krishnaswamy, Navin Goyal

Networking

NDT Factory: Synthesizing Verified Network Digital Twins from Semantic Models via Multi-Agent LLM

Autonomous network management requires systems that can evaluate Network Service Intents (NSIs) under varying conditions without manual implementation of analysis logic, as envisioned in TM Forum Level~4 (L4) autonomy. Behavioral Network Digital Twins (NDTs) enable such evaluation, but existing NDTs rely on pre-defined analytical logic, limiting adaptability for evolving closed-loop control. This paper introduces the NDT factory, a multi-agent software system that synthesizes executable behavioral NDTs on demand from semantic models using Large Language Model (LLM). We validate the system using a Call Admission Control (CAC) case study, where deterministic what-if analysis serves as the admission decision process. The NDT factory generates a complete CAC NDT through parallel synthesis and orchestration, achieving 100% compilation and test pass rates across multiple runs. Simulation over 300 NSIs shows 99.3% decision agreement with a reference implementation, 90% admission rate, and correct attribution of all rejections, demonstrating reliable synthesis with deterministic, verifiable execution.
Read the full abstract

Computer Vision

When Ground-Truth Fidelity Matters: An Orchestrated UAS Framework for Wheat Streak Mosaic Virus Detection Using Vision Transformers and Machine Learning

Wheat streak mosaic virus (WSMV) is a destructive pathogen of sweet corn and other cereal crops, causing yield losses and complicating early detection because symptoms are spatially variable and subtle. In sweet corn seed production, WSMV also has regulatory importance, as phytosanitary regulations from countries such as New Zealand and Chile require seed lots to be certified virus-free. Visual scouting is unreliable because symptoms can resemble abiotic stress, while enzyme-linked immunosorbent assay (ELISA) is accurate but expensive, labor-intensive, and difficult to scale. We present an automated pipeline for plant-level WSMV detection using unmanned aircraft systems (UAS) multispectral imagery. The framework integrates orthomosaic reconstruction, geospatial alignment, plant extraction, and classification using a Vision Transformer with seven-channel inputs (five spectral bands, NDVI, and NDRE). Using treatment-based labels, the model achieved 89% accuracy on over 6,500 test patches across multiple growth stages. However, ELISA-based ground truth revealed substantial label noise: only a small fraction of sampled plants in inoculated plots were infected. Treatment labels therefore did not reliably represent infection status, and the high accuracy was largely driven by label bias rather than disease detection. Performance decreased markedly against row-level symptom severity and plant-level ELISA labels. Under these higher-fidelity but smaller-sample conditions, both deep learning and classical machine learning showed limited generalization and weak separability between ELISA-confirmed mock-inoculated and infected plants. These results show that UAS-based disease detection is constrained by label fidelity and data availability, emphasizing biologically grounded labels and models aligned with real-world conditions.
Read the full abstract

All authors Dewi Endah Kharismawati, Sandeep Dhakal, Courtney E. McCusker, Jennifer R. Wilson, Erik W. Ohlson, Sami Khanal

Computer Vision

USPLIT-VQA: U-Shaped Split Learning for Visual Question Answering with Contribution-Aware Weighted Aggregation

Visual Question Answering (VQA) systems, jointly interpreting images and natural language queries, hold significant promise across many domains, yet the privacy-sensitive nature of user data creates a fundamental barrier. Centralized training requires access to all data, while federated learning requires each client to host the full model. We propose USPLIT-VQA, a U-shaped split learning framework for privacy-preserving VQA in which each client retains the initial layers and the classification head while the server hosts the computationally heavy intermediate layers, keeping raw inputs and labels on the client device. We further introduce Contribution-Aware Weighted Aggregation (CAWA), a gradientsimilarity-based client scoring mechanism designed to reduce the influence of malicious updates. Experiments on four VQA datasets (VQA-RAD, SLAKE, PathVQA, and VizWiz) with two backbones show accuracy gains over Federated Learning for the Custom model and reduced accuracy for BiomedCLIP under the evaluated fixed split, alongside client memory reductions of up to 5.8X and communication reductions of up to 10.8X. With one malicious client, CAWA reduces the attacker's influence by over 98%, while experiments at higher corruption levels identify its limitations. Reconstruction experiments further show lower inversion quality under the evaluated attacks.
Read the full abstract

Optimization and Control

ADMM and Linearized ADMM for Weakly Convex Minimization

We study a class of weakly convex optimization problems in which the objective is the sum of a smooth convex term and a weakly convex term that may be nonsmooth. To exploit this structure, we develop a splitting technique based on the alternating direction method of multipliers (ADMM), which decouples the minimization of the two components into tractable subproblems. Because the update associated with the smooth term may require an inner iterative solver, we further linearize this term, yielding a linearized ADMM (LADMM) scheme with an inexpensive one-step update. Under mild conditions, we establish the subsequence convergence of both ADMM and LADMM methods to directional stationary solutions, which are equivalent to critical points and Clarke stationary solutions for our weakly convex problem. Numerical experiments on two low-dimensional test functions and a high-dimensional logarithmic regularized logistic regression model demonstrate that the proposed approaches are computationally efficient and produce solutions of comparable quality to baseline methods.
Read the full abstract

All authors Shenghan Mei, Chengyu Ke, Yifei Lou, Miju Ahn

Materials Science

Functionalization-Driven Charge Redistribution Enabling Ultra-High-Capacity V2B MBene Anode for Li/Na ion batteries: A First-Principles study

Amid increasing global demand for clean, sustainable energy, the search for novel electrode materials has emerged as a crucial link to advancing future energy storage technologies. Here, we explored the potential of N-functionalized 2D MBene V2BN2 as anode materials for Li- and Na-ion batteries using first-principles calculations. Phonon dispersion and ab initio molecular dynamics calculations were employed to assess the dynamic and thermal stability of the material. The intrinsic metallic properties of V2BN2 were revealed through electronic band structures and density of states analyses. Importantly, Bader charge analysis demonstrates substantial charge redistribution upon Li/Na adsorption, leading to stronger ion-substrate interactions compared to the pristine counterpart. This redistribution plays a decisive role in enhancing Li/Na ion adsorption and stabilizing ion accommodation. Furthermore, owing to favorable multilayer adsorption of Li and Na ions, V2BN2 exhibited high theoretical specific capacities of 1524 and 762 mAh/g, as well as low open circuit voltages of 0.73 and 0.23 V for Li and Na, respectively. In addition, the energy barriers were calculated to be 0.49 and 0.29 eV for Li- and Na-ion transport, respectively, indicating rapid ion transport and excellent rate capability. These results indicate that V2BN2 holds significant potential as an anode material for next-generation rechargeable ion batteries.
Read the full abstract

Artificial Intelligence

GLARE: Generative Learning via Adversarial Reward Estimation For Social Dynamics Forecasting

Meeting continuation requires tracking the agenda, speaker roles, participant intentions, and disagreement across long multi-party discussions. We introduce the Meeting Dynamic Forecasting Benchmark (MDFB), constructed from 2,207 real-world meetings and 24,794 future-facing queries. Given a transcript prefix and an active question, a model generates a plausible multi-turn continuation in one call. We evaluate utility—progress toward the question—and human-likeness—plausible conversational flow and role consistency—without requiring exact reproduction of the observed future. We further present GLARE, an adaptation of adversarial imitation learning to conditional language generation. A discriminator ranks the observed continuation above samples from the current actor, and its score supplies a KL-regularized policy reward; retraining on current-policy negatives allows the reward landscape to evolve with the actor. GLARE attains average human-evaluated win rates of 0.66 on utility and 0.70 on human-likeness, outperforming SFT and SPIN while remaining below the observed human continuation. We also demonstrate MDFB as a social reasoning arena for comparing general-purpose models, including closed-source systems, through reference-assisted judgments. Together, these studies illustrate the benchmark's use for both task-specific learning and output-based evaluation of meeting behavior.
Read the full abstract

All authors Tenghao Huang, Zhaoxuan Tan, Muhao Chen, Jonathan May, Mengting Wan, Longqi Yang, Pei Zhou, Sihao Chen

Computational Complexity

The Information Complexity of Decision Trees

We define and study a measure of information complexity for randomized decision trees. We prove three main results about this complexity measure: Information equals amortized size complexity. We show that the information complexity of randomized decision tree is equal to the logarithm of the amortized worst-case randomized tree size complexity of computing a function f. That is, when computing f on n inputs, the logarithm of the randomized tree size is exactly equal to the amount of information needed to compute the function. Information allows for tree size compression. We show that even when computing f on a single input, the information complexity can be used to compress the size of a tree, if we allow a small loss in success probability. With the recent characterization of Chattopadhyay, Dahiya, Mande, Radhakrishnan, and Sanyal (2023), this result shows that the depth of AND-OR trees can also be compressed in terms of information complexity. Direct Product Theorems. We show that the success-conditioned variant of information complexity satisfies a perfect direct product theorem. This result gives an information complexity analogue of the direct product theorem for success-conditioned randomized query complexity by Ben-David and Blais (2025).
Read the full abstract

Machine Learning

Certifying Concept Unlearning in Text-to-Image Diffusion Models

Existing evaluations of concept unlearning in text-to-image (T2I) diffusion models primarily rely on attack success rates obtained through automated adversarial prompt search. However, these metrics provide only empirical evidence over a finite set of queries and leave residual leakage over the broader prompt space largely unquantified. This limitation can lead to overestimating unlearning effectiveness and underestimating safety risks. To address this gap, we introduce a novel certification framework for T2I concept unlearning that provides high-confidence guarantees with bounded error on residual concept leakage. Our approach combines statistical certification with worst-case analysis along concept-relevant embedding directions to derive explicit upper bounds on leakage probability under user-specified confidence levels. We evaluate our framework across three major concept categories namely NSFW content, artistic styles, and celebrity identities, and six state-of-the-art unlearning methods. Certified leakage bounds consistently exceed standard attack success rates by 16.2%, uncovering substantial residual risks missed by existing evaluation protocols. Crucially, our results demonstrate that empirical attack-based evaluations can significantly underestimate residual leakage and establish certification as a necessary complement for reliable auditing of concept unlearning in T2I diffusion models.
Read the full abstract

Artificial Intelligence

Can LLMs in Draft-Verify-Revise Pipelines Resolve Deictic Ambiguity?

Draft-verify-revise is a common LLM orchestration pattern for scaling inference-time compute. One LLM drafts, a second critiques the draft and provides feedback, and a third uses that feedback to revise the draft into the final output. As context cascades between stages, LLMs at different stages can resolve a context-dependent expression such as "previous" differently. When that happens, the expression undergoes a deictic shift, a change in what it refers to. This phenomenon was studied with a synthetic dataset of 10 base examples, each rendered in three conditions. Holding the shared components constant, the conditions varied whether the draft stage LLM (the assistant) or the verify stage LLM (the grader) resolved the expression correctly, and how much independent reasoning the revise stage LLM (the meta-evaluator) needed to determine which reading was correct. Six models from three providers were tested across 21 reasoning effort configurations using e-values for sequential testing, in a primary experiment and an ablation experiment that removed error classification labels from the grader's feedback. A separate LLM analyzed the meta-evaluator's stated rationale for each wrong verdict. Balanced accuracy (the unweighted mean of sensitivity and specificity) ranged from 0.156, below chance, to near-perfect. GPT-5.2 rose from 0.156 without reasoning to 0.942 at its highest reasoning effort level, while Gemini 3 Pro stayed above 0.94 at every level. Gemini 3 Pro at low reasoning effort outscored GPT-5.2 at xhigh reasoning effort for roughly 5% of the cost per trial. When the meta-evaluator erred, it tended to rely on surface cues rather than operational reasoning. Context engineers implementing draft-verify-revise pipelines should be wary of deictic shifts and make the intended referent explicit at each stage.
Read the full abstract

Numerical Analysis

A Fully Discrete Local Discontinuous Galerkin Method for Quasilinear Stochastic Convection-Diffusion-Type Equations

In this paper, we develop and analyze a fully discrete local discontinuous Galerkin (LDG) method with IMEX-Euler time discretization for a class of multi-dimensional quasilinear stochastic convection-diffusion-type equations driven by multiplicative $\mathcal Q$-Wiener noise. The leading diffusion matrix may depend on the solution as well as the spatial and temporal variables, while the lower-order drift and noise coefficients may depend on both the solution and its gradient. Under a suitable stochastic parabolicity condition, we establish unconditional high-moment stability estimates for the fully discrete scheme in the quasilinear setting. In the semilinear setting, where the leading diffusion matrix is independent of the solution but may vary in space and time, we further prove optimal high-moment strong error estimates of order $\mathcal O(h^{r+1})$ in space and $\mathcal O(k^{1/2})$ in time. A pathwise error estimate is then derived by combining the high-moment error bound with a discrete Kolmogorov argument. Numerical experiments are presented to illustrate the stability and convergence properties of the proposed method.
Read the full abstract

Soft Condensed Matter

Collective Behavior of Intelligent Active Brownian Particles in the Presence of a Static Obstacle

Using computer simulations, we investigate the collective behavior of two-dimensional active Brownian particles (ABPs) with excluded-volume interactions in the bulk and in the presence of a single static circular obstacle. Perception-mediated interactions are introduced through a vision-based steering mechanism that enables each particle to reorient its propulsion direction according to the instantaneous positions of neighboring particles within a prescribed vision cone. In the bulk, these intelligent active Brownian particles (iABPs) exhibit distinct collective states, including aggregated clusters, worm-like chains, worm-aggregate coexistence, and dilute gas phases. We characterize these states using a shape anisotropy parameter and construct the corresponding phase diagrams. The presence of a static obstacle, which interacts with the particles through purely repulsive forces, qualitatively alters their collective behavior. In contrast to conventional ABPs, whose isotropic accumulation around the obstacle increases with activity, iABPs exhibit the opposite trend, with boundary accumulation decreasing as the activity increases. We further identify empirical scaling relations that describe particle accumulation and cluster formation at the obstacle boundary. Consequently, the relative effective diffusion coefficient of iABPs displays a nonmonotonic dependence on self-propulsion speed, whereas that of conventional ABPs decreases monotonically with increasing activity. In addition, we show that the residence times of iABPs are orders of magnitude shorter than those of conventional ABPs, indicating that perception-mediated interactions can be useful for controlling the organization and transport of active particles in complex environments.
Read the full abstract

Robotics

A Physics-Based Closed-Loop Robotic Bioprinting Framework Towards Volumetric Muscle Loss Treatment

Robotic bioprinting and Direct Ink Writing (DIW) are being explored towards the treatment of Volumetric Muscle Loss (VML). While previous studies have shown the importance of proper parameter selection on the print outcome, existing approaches often rely on time- and material-intensive design of experiments methods, or require large, well-curated datasets for training machine learning models. In this paper, we propose a physics-based closed-loop robotic bioprinting system capable of near real-time parameter adaptation. The system integrates a 3D point cloud camera and fully autonomous vision-based algorithms to provide quantitative evaluation of printed constructs. This evaluation is fed into a controller that adjusts printing parameters to achieve a desired bead thickness. To assess the framework's performance, four experimental configurations were tested, each repeated three times. In these tests, printing began from an arbitrary initial parameter value, and the controller was tasked with adjusting the parameters to reach the desired thickness. The system converged in all trials, achieving a tracking error below 0.5 mm within an average of 5.2 seconds from the start of printing. The low standard deviation of the converged pressure over different tests (0.04 bar on average) demonstrates robustness and repeatability. Additional experiments were conducted with the controller turned off, enabling direct comparison with open-loop DIW bioprinting, further confirming the effectiveness of the proposed closed-loop framework in achieving the desired bead geometry.
Read the full abstract

All authors Omid Rezayof, Jerin T. Andrews, Ehsan Zobeidi, Ali Ghasemkhani, Meenakshi Kamaraj, Maryam Tilton, Johnson V. John, Farshid Alambeigi

Cosmology and Nongalactic Astrophysics

Probabilistic characterization of blending with LSST and application to cluster lensing cosmology

Next-generation galaxy surveys, like the Vera C. Rubin Observatory's Legacy Survey of Space and Time (LSST), will deliver unprecedented depth and sky coverage, enabling precise measurements of cosmic probes such as weak lensing and galaxy clustering. However, increased imaging depth leads to significant blending of galaxy images, particularly in dense fields like galaxy clusters. This blending, exacerbated by atmospheric blurring in ground-based observations, contaminates galaxy property measurements and causes source confusion. To simultaneously capture these effects, we develop a probabilistic framework introducing the blending entropy, a metric quantifying the ambiguity in matching detected objects to true galaxies or external reference sources. Using simulated data from the DESC Data Challenge 2 (DC2), we characterize blending in LSST data and quantify its impact on cluster lensing cosmology around cosmoDC2 halos. We demonstrate that imposing a blending entropy threshold of $S_b<0.2$ effectively filters out highly blended objects (around 25%), which are especially prevalent near the survey's magnitude limit and are associated with higher errors in shape measurements and photometric redshifts. Applying this cut substantially reduces blending-induced biases in cluster lensing profiles and mass estimates, thereby mitigating systematic errors in cosmological parameters—most notably reducing tension in $\sigma_8$ estimates. Our method is readily generalizable to other static probes and offers a practical path forward for real data analyses, particularly when leveraging overlapping high-resolution datasets from spaced-based missions such as Euclid or the Roman Space Telescope, where these external datasets can act as reference catalogs to improve the identification of blended sources in LSST data.
Read the full abstract

All authors Manon Ramel, Cyrille Doux, Marine Kuna, Michel Aguena, Céline Combet, Shuang Liang, Constantin Payerne, Camille Avestruz, Alex I. Malz, Marina Ricci, Nikolina Šarčević, the LSST Dark Energy Science Collaboration

Computational Geometry

Direct Topology Tracking in Continuous Implicit Models

We present a framework for tracking topological features directly within continuous implicit models. Such models, including implicit neural representations (INRs) and multivariate functional approximations (MFAs), are increasingly adopted to represent scientific data without the resolution constraints of discrete grids. They offer compact, smooth, and differentiable representations of complex fields, enabling new opportunities for high-performance data storage, reconstruction, and analysis. Given a continuous implicit model, our method tracks the evolution of critical points by querying the model and its derivatives, thereby eliminating the need to resample onto a grid. This approach enables faithful feature tracking while avoiding discretization-induced artifacts such as aliasing. We demonstrate the generality of our framework across a range of implicit representations, including analytic functions, MFAs, and INRs, and show that it produces smooth, coherent critical point trajectories. By enabling feature tracking directly on continuous representations, our method supports a new class of feature-driven visualization workflows centered on implicit models.
Read the full abstract

All authors Guanqun Ma, David Lenz, Kaiyuan Tang, Hanqi Guo, Chaoli Wang, Tom Peterka, Bei Wang

Software Engineering

A decision-basis contract for auditable LLM-assisted medical billing verification: deterministic rules, verbatim evidence, and fail-closed abstention

This work presents a proof of concept for auditable LLM-assisted medical billing verification based on a decision-basis contract. The contract separates deterministic checks of versioned fee-catalog rules from LLM-based assessment of free-text documentation. The deterministic layer resolves the applicable catalog release and checks code availability, quantity limits, and exclusions. The semantic layer classifies each claimed item as supported, contradicted, or missing required information. Support and contradiction require a verbatim evidence span; unavailable rule context, unsuccessful assessment, or missing required evidence prevents support through fail-closed abstention. We evaluated four locally run open-weight models on a synthetic catalog and 36 curated cases under the contract, an ablation without explicit documentation requirements, and an end-to-end baseline. Outcome agreement varied across models and showed no consistent advantage over the baseline. Explicit documentation requirements improved identification of missing information for all four models. The evidence gate also exposed cases in which correct raw judgments lacked valid evidence and were converted to incomplete decision-basis entries. The results show how explicit decision records can make rule findings, documentation judgments, and abstention reasons inspectable. Evaluation on real catalogs, independently annotated documentation, and with human reviewers is required to assess practical value.
Read the full abstract

All authors Jan Hölter, Kevin Geis, Benjamin Raab, Boris Bauke

Computer Vision

Single-Query Person-Centric Bimanual Hand-Object Interaction Detection

Understanding person-level bi-manual interactions requires not only detecting hands, but also identifying which two hands belong to the same person and what each hand interacts with. Existing hand–object interaction methods are mostly hand-centric: they treat each hand as an independent instance, which can lead to ambiguous ownership in multi-person scenes. We propose a person-centric formulation in which a single query predicts a structured output for one person, including the human box, body pose, hand boxes and states, and interaction targets. We introduce part-aware deformable attention to allocate attention across human, hand, and pose-specific reference regions, enabling one query to capture the full person structure. We further unify detection and interaction reasoning with a hand-to-query relationship matrix, where each hand selects its interaction target from the detected query set plus a learnable off token, directly recovering the target's box and class without separate object regression. We build a COCO-based dataset with person-centric bi-manual interaction annotations and define structured metrics for evaluating hand states and complete hand–object tuples. Experiments with a transformer-based detector show that our formulation improves person-level bi-manual interaction parsing and provides an effective unified framework for joint detection, pose estimation, and hand reasoning.
Read the full abstract

All authors Jonghyun Kim, Junho Roh, Yubin Yoon, Hyotae Lee, Jongkuk Park, Taehwan Hwang, Jaechul Kim, Jungho Lee

Sound

Neural Multichannel Distant Speaker Diarization with Heavy-tailed Source Separation Model

Distant speaker diarization remains challenging due to difficult acoustic environments, varying numbers of speakers and overlapping speech. Model-driven methods are proposed to exploit the speech source features in multi-channel recordings that help diarization. This paper generalizes a neural model that jointly learns to perform blind source separation and diarization over speech mixtures (neural FCASA) with heavy-tailed models. The popular Gaussian distribution has been applied for variance modeling in the original source separation model, which we replace with two families of heavy-tailed models (Leptokurtic Generalized Gaussian distribution and Student's t distribution) to better capture the heavy-tailedness in speech signals. Thanks to the Gaussian scale mixture model, we are able to unify the proposed method and the original one under the same form of learning objective. Our experiments show consistent large improvements in Diarization Error Rate (DER) and Jaccard Error Rate (JER) compared to the baseline on various corpora.
Read the full abstract

All authors Sicheng Mao, Baihan Li, Mathieu Fontaine, Anthony Larcher, Roland Badeau

Instrumentation and Methods for Astrophysics

A Proliferated Space Architecture for Time-Domain Astrophysics

Time-Domain and Multi-Messenger Astrophysics (TDAMM) is entering a discovery-rich but follow-up-limited era, creating an urgent need for responsive, multiwavelength space-based capabilities. The Hydra constellation is a concept for a proliferated space architecture for time-domain astrophysics. The constellation would act as a disaggregated observatory composed of coordinated, relatively low-cost spacecraft that collectively provide capabilities traditionally concentrated within a single large mission. The architecture would combine persistent wide-field gamma-ray monitoring, wide-field and focused X-ray observations, and rapid-response ultraviolet, optical, and infrared imaging and spectroscopy. The constellation would both discover high-energy transients and respond to external alerts from gravitational-wave detectors, neutrino observatories, and ground- and space-based surveys, using low-latency communications, automated event prioritization, and community coordination frameworks to rapidly assign observing resources. A proliferated architecture would offer operational advantages over a single larger mission, including simultaneous observations of multiple targets, graceful degradation following individual spacecraft failures, recurring technology refresh, and opportunities for commercial, international, and philanthropic contributed nodes to join the network. The constellation would address fundamental questions concerning cosmic accelerators, the origin and evolution of the elements, the behavior of matter at extreme density, and the nature of dark energy through gravitational-wave standard sirens. This white paper presents the Hydra concept description that was submitted to NASA's ASTRA initiative for consideration by the Cosmic Origins Program Analysis Group (CoPAG) and Physics of the Cosmos Program Analysis Group (PhysPAG).
Read the full abstract

All authors Daniel Kocevski, Eric Burns, Thomas Barclay, Nicholas E. White, Massimiliano Galeazzi, Brendan O'Connor, Amy Lien, Chris Fryer, Hallie Fausey, Fe McBride, Neil Cornish, Dheeraj Pasham, Kip Kuntz, Anya Nugent, Scott Porter, Tzu-Ching Chang, Adam Lidz, Alexander van der Horst, Sylvain Guiriec, Ed Cackett, Dieter Hartmann, Brad Cenko, C. Michelle Hui, Tyler Parsotan, Michael W. Coughlin, Eliza Neights, Zorawar Wadiasingh, Catherine Grant, Oindabi Mukherjee, Francesco Longo, Eric Bellm, Alec Habig, George Younes, Kim Page, Shivam Kumar Sharma, Oliver J. Roberts, Rachel Hamburg, Rahul Gupta, Colleen A. Wilson-Hodge, William Cleveland, Breann Sitarski, Vikas Chand, Raffaella Margutti, Adam Goldstein, Ryan J. Foley, Vidushi Sharma, Yi-Jung Yang, Elisabetta Bissaldi, M. Coleman Miller, T. A. Pritchard, D. J. Sand, Tomas Ahumada, Judith Racusin, Noah Franz, Kate D. Alexander, Brenna Mockler, D. Andrew Howell, Elisa Quintana, Chin-Ping Hu, Igor Andreoni, Boyan Hristov

Differential Geometry

Taut and Dupin Submanifolds (Updated Version)

This is an updated version of a paper by the author which originally appeared in 1997. The original paper was a survey of the closely related fields of taut and Dupin submanifolds of Euclidean space, and this updated version includes many results in the field that have appeared since the publication of the original version. The emphasis is on stating results in their proper context and noting areas for future research, and relatively few proofs are given. The important class of isoparametric hypersurfaces is surveyed in detail, as is the relationship between the two concepts of taut and Dupin. Also included is a brief introduction to submanifold theory in Lie sphere geometry which is needed to state many known results on Dupin submanifolds accurately. The paper concludes with detailed descriptions of the main known classification results for both Dupin and taut submanifolds.
Read the full abstract

Computer Vision

HSI-Road Relabeled: Surface-Aware Road-Scene Segmentation

The HSI-Road dataset provides paired RGB and 25-channel NIR (680-960nm) images with binary masks but no surface-level labels. This paper introduces a manually labeled six-class taxonomy: Background, Asphalt, Concrete, Dirt, Water, and Grass, and an RGB-to-NIR registration pipeline with corresponding annotations. Six semantic-segmentation models are evaluated under four input configurations: original-resolution RGB, registered low-resolution RGB (RGB$_{\text{reg}}$), NIR, and channel-stacked RGB$_{\text{reg}}$-NIR (RGBN$_{\text{stk}}$). The comparison quantifies the effect of spatial-resolution reduction on RGB, along with evaluation of NIR and RGBN$_{\text{stk}}$, with results reported using per-class and mean IoU and F1 scores. The original-resolution RGB achieves the highest overall performance but contains 12$\times$ more pixels and incurs a 15.5-20.6$\%$ latency penalty compared to the reduced-resolution inputs. At the common 192$\times$384 resolution, RGBN$_{\text{stk}}$ outperforms NIR for all six models and RGB$_{\text{reg}}$ for five of six, with the most consistent gains for the Water class. These results highlight the importance of spatial resolution while showing that NIR provides complementary information to RGB.
Read the full abstract

All authors Imad Ali Shah, Imran Mehmood, Enda Ward, Martin Glavin, Edward Jones, Brian Deegan

Probability

Lehmer-Lambert Distribution

The Lehmer transform of a positive signal is the ratio of its power sums at consecutive orders, read as a function of the order, and it is a strictly increasing analytic curve from the smallest observation to the largest. Composing this curve with a map whose inverse is the Lambert function turns it into a probability law on the real line, the Lehmer-Lambert distribution, which we introduce and study. Its distribution, density and quantile functions are closed-form, its random variates are exact, and the law is invariant under changes of gain and of power-law calibration of the signal. Its modes lie at orders at which the signal changes scale, and for a sample its tails are exponential with rates equal to the two extreme logarithmic gaps of the sample. We derive moments, generating functions and limit theorems, and we investigate applications of the Lehmer-Lambert distribution in the analysis of electroencephalograms of patients with major depressive disorder.
Read the full abstract

Theoretical Economics

Comparative Statics of Information Acquisition and Risk Aversion

This paper studies how willingness to pay for information depends on risk aversion. We model a decision maker who faces background risk and can acquire information before choosing from a menu of assets. We show that the comparative statics depend on two factors. The first is whether available assets constitute an investment menu, whose payoffs are procyclical with background wealth, or an insurance menu, whose payoffs are countercyclical. The second factor is the tail geometry of background risk. We show that willingness to pay for information decreases with risk aversion for investment menus when the density of background risk is log-concave, and that it increases with risk aversion for insurance menus when background risk is downward-log-convex. The proofs compare the distributions of terminal wealth with and without information. They develop new aggregation arguments for state-dependent single-crossing comparisons. We also construct reversals under strictly log-convex tails for investment menus and super-exponential left tails for insurance menus.
Read the full abstract

All authors Antonio Cabrales, Gregorio Curello, Olivier Gossner, Roberto Serrano

Number Theory

An adelic approach to the Kudla-Millson lifts over totally real number fields

We compute the Fourier expansions of the Kudla-Millson theta lifts of vector-valued Hilbert cusp forms of parallel weight. These expansions are with respect to 0-dimensional cusps of non-compact orthogonal Shimura varieties defined over any totally real number field, and computed using a mixed model of the adelic Weil representation under a partial Fourier transform. As a consequence, we obtain the injectivity of the theta lifts under some additional hypothesis on the variety. Furthermore, we show that the theta lifts are square-integrable harmonic differential forms, and deduce lower bounds for dimensions of cohomology groups of such varieties.
Read the full abstract