Number Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 7 September
Let $p_j$ be the prime with index $j$. We prove that the ratios $m/n$ for which $p_m+p_n$ is a square are dense in $\mathbb R_{>0}$. The same is true when $|p_m-p_n|$ is a square. In every nonempty open interval, almost every index can be used as a numerator and as a denominator. We also give a quantitative lower bound for the number of possible partners.
Computation and Language
Beyond Fluent Generation: A CPU Reliability Benchmark for MCP-Style Tool Calling in Sub-2B Small Language Models for Edge Deployment
Resource constrained single-board computers including Raspberry Pi, NVIDIA Jetson Nano, Arduino UNO Q, Orange Pi, and LattePanda motivate on-device small language model (SLM) agents that reduce cloud dependence, improve data locality, and tolerate intermittent connectivity. Model Context Protocol (MCP)-style tool invocation demands more than fluent generation: an agent must emit machine-readable JSON, select the correct tool, supply all required arguments, and avoid unintended actions. We establish a platform-agnostic CPU baseline by evaluating five open-weight models below two billion parameters Phi-1.5, Pythia-1.4B, TinyLlama-1.1B-Chat, Qwen2.5-0.5B, and Qwen2.5-1.5B on 100 prompts spanning weather retrieval, web search, calculation, email composition, and task creation, under greedy decoding and nucleus sampling. A recovery parser strips Markdown fences, extracts brace-delimited substrings, and scores parseability, tool-name correctness, argument completeness, and value agreement. Under this criterion, Qwen2.5-1.5B achieves 75% (greedy) and 79% (sampling); Qwen2.5-0.5B achieves 72% (greedy) but drops to 32% under sampling. Phi-1.5 scores 0%; Pythia and TinyLlama reach at most 7%. A strict post-hoc audit finds only 5 of 1,000 raw responses directly parseable as JSON, exposing near-total dependence on output recovery. A CPU resource probe shows Qwen2.5-1.5B requires 7,960 MiB and 30.782 s mean latency; Qwen2.5-0.5B uses 3,637 MiB and 10.627 s, revealing a reliability-resource trade-off for edge deployment. These results do not cover the named boards directly or a full MCP implementation. Safe deployment requires schema validation, constrained generation, least-privilege execution, and human escalation for consequential actions.
Read the full abstract
Computer Vision
DF26: We Cannot Tell Fake From Real Anymore
We introduce DF26, a novel benchmark for detecting AI-generated videos containing fully synthetic clips produced by recent text-to-video and image-to-video models. The videos capture single-person public-speaking scenarios, spanning direct-to-camera recordings, official statements, and studio interviews - 271 real and 2,420 synthetic videos generated by seven modern video models. The study on DF26 shows that human performance in detecting AI-generated videos, as well as state-of-the-art deepfake detectors, is close to random chance. Our results highlight the limitations of current evaluation protocols and motivate the need for benchmarks that explicitly measure robustness to modern generative model distribution shifts.
Read the full abstract
Mesoscale and Nanoscale Physics
Static-Dynamic Correlations and Complex Spin-Wave Eigenmodes in Single- and Multilayer Diamond-Shaped Nanomagnets Without Bias Field
Diamond-shaped nanomagnets provide a suitable platform for developing microwave devices with reconfigurable characteristics. In this study, the static and dynamic magnetic behaviour of single layer and multilayer diamond-shaped nanomagnets was systematically investigated using micromagnetic simulations. Two distinct remanent magnetic configurations were obtained through a simple magnetic field initialization process. These configurations exhibited different magnetization patterns and dynamic responses. Their resonance characteristics could be modified by applying a nanosecond-scale magnetic field pulse, enabling reconfigurable microwave operation. A clear resonance frequency shift in the sub-GHz (0.9 GHz) range was observed for the single-layer structure, while the multilayer structure exhibited a significantly larger frequency shift in the GHz range (3 GHz). The larger frequency tunability observed in the multilayer configuration arises primarily from the enhanced dipolar coupling between the vertically coupled magnetic layers, which modifies the local effective magnetic field and consequently influences the magnetization dynamics. These findings demonstrate that diamond-shaped nanomagnets can provide a simple and effective route toward reconfigurable microwave functionality, with potential applications in ultralow-power, ultrafast, and frequency tunable microwave devices.
Read the full abstract
Cryptography and Security
5GDescrambler: Locating, Descrambling, and Decoding 5G Scheduling Information (long version)
Tracking users in 5G NR has recently been successfully demonstrated by exploiting various side-channels. This allows for identification of individuals, classification of user activity in real time as well as tracking by fingerprinting, affecting billions of users with a 5G subscription and companies with private 5G deployments. However, previous work relies on weak operator configurations that leak networking parameters–either the radio network temporary identifier (RNTI) or scrambling factor ($N_{ID}$) during handshake–or to inefficiently brute-force Downlink Control Information (DCI). In this paper we present a novel technique exploiting algebraic structure to reverse DCI scrambling, fully integrated into an open-source end-to-end binary DCI sniffing pipeline. It provides enabling input for subsequent attacks like live tracking of users and supports automatic detection of control channel configurations used. We demonstrate the robustness and performance of our approach with measurement campaigns against deployments of srsRAN, OpenAirInterface5G, and two commercial vendors. It reaches block error rates of less than $1\%$ at SNRs below expected values for efficient communication, while performing significantly faster on a reference sample than a previously suggested passive technique brute-forcing the required parameters. In addition, it is entirely passive and does not rely on any side-channel leakage.
Read the full abstract
Analysis of PDEs
Low Mach number limit for a compressible two-fluid model with algebraic closure and ill-prepared initial data in critical Besov spaces
In this paper, we study the low Mach number limit for a compressible two-fluid model with algebraic closure in the $d$-dimensional torus with $d \geq 2$. For large and ill-prepared initial data in critical Besov spaces, we prove that, provided that the Mach number is sufficiently small, the rescaled compressible two-fluid flow exists in critical Besov spaces for any finite time not exceeding the lifespan of the incompressible flow. Moreover, the rescaled compressible two-fluid flow converges to the incompressible Navier–Stokes flow as the Mach number tends to zero. The proof is based on a high-middle-low frequency analysis of the densities and velocity field, combined with a filtering technique involving wave operators. The main novelty is the derivation of new a priori estimates for the high-middle frequency part of the solution to the compressible two-fluid model, depending explicitly on time, the frequency parameter and the Mach number. To the best of our knowledge, this is the first work that proves (almost) global convergence for large and ill-prepared initial data in the low Mach number limit for compressible two-fluid model in critical framework.
Read the full abstract
Software Engineering
Trust the Spec, Not the Code - A Specification-First, AI-Assisted Case Study in Online Banking
Formal specification promises early error detection, explicit invariants, and correctness by design, yet its notational cost has kept it out of mainstream practice. We argue that AI removes much of that cost: natural language enriched with lightweight mathematics, written in \LaTeX, can serve as an intermediate specification language that is precise enough to reason over and prove, while a large language model (LLM) reviews it for ambiguity, drafts proofs, and generates the implementation. The specification becomes the artifact one authors, reviews, proves, and refines; the code becomes regenerable output. This paper is a follow-on to a prior study that established the discipline on an organizational-knowledge-growth simulation~\cite{predecessor2026}. Here we replicate the discipline in a different domain—an online-banking fund-transfer service—and extend it. The two domains share one spine: a conservation invariant (knowledge in the prior study, money here), which suggests the approach generalizes across domains. We contribute: (i) a second, independent case study of the method; (ii) a stress-test of the method on a richer problem—scheduled/recurring transfers—whose generated code grows substantially while the invariant and its proof do not; (iii) an AI-proposed runtime coverage model for invariants (“never violated $\neq$ covered”); and (iv) a Z formalization, including paired success/failure operation schemas and an invariant proved over the inductive set of all reachable configurations, together with an experiment in which the AI proposes the Z interfaces itself. We are explicit about the method's limits: the proofs and runtime checks live at the specification level and do not establish that the generated code refines the specification—that step is delegated to the AI. This is a case study, not a controlled experiment.
Read the full abstract
High Energy Astrophysical Phenomena
Correlation between X-ray and gamma data of Swift measurements
Several studies over the last two decades have used canonical correlation analysis (CCA) to study the relationships between main {\gamma}-ray (e.g. fluence, peak flux, and duration) and main X-ray (flux, decay and spectral index, and hydrogen column density) data from gamma-ray bursts (GRBs). In this paper, we revisit this approach using a much larger dataset to identify potential new insights into these relationships. We used CCA to investigate the interrelationship of the aforementioned gamma-ray and X-ray parameters. Using the derived canonical variables, we calculated their correlations (canonical loadings) with the original data. Consistently with previous research, the analysis revealed that gamma-ray fluence and X-ray flux have the strongest correlation, while the X-ray decay index and spectral index have a lower contribution. Interestingly, our analysis of a much larger dataset reveals that the HI column density makes a significant contribution to the overall correlation. This finding, in the context of the collapsar model for long GRBs, could be interpreted as an indication that the progenitor star ejected an HI envelope during the GRB.
Read the full abstract
Statistics Applications
Bayesian Emulation of Multi-fidelity Earth System Modelling Using Hierarchical Gaussian Processes
Multi-fidelity Earth system models provide simulations at different levels of complexity and computational cost, but exhaustive exploration of the parameter space at the highest fidelity is often prohibitively expensive. Multi-fidelity emulators can reduce this burden by combining abundant lower-fidelity simulations with limited high-fidelity evaluations. We compare four Gaussian-process-based multi-fidelity approaches: the Kennedy–O'Hagan autoregressive model (K&O), hierarchical kriging (HK), Bayesian hierarchical emulation for multi-level models (BayHEm), and multi-fidelity deep Gaussian processes (MF-DGP). We evaluate the methods using two contrasting applications: a three-fidelity tsunami simulator and a two-fidelity implementation of the Joint UK Land Environment Simulator (JULES). Performance is assessed using leave-one-out predictive accuracy, uncertainty representation, design requirements, and computational characteristics. In the tsunami application, BayHEm gives the lowest normalised root mean square error (NRMSE = 0.031) and highest SCORE (3.025), while MF-DGP performs worse than the single-fidelity baseline when only 10 high-fidelity simulations are available. In the JULES application, MF-DGP gives the lowest NRMSE (0.079) and highest SCORE (3.032), with all 30 held-out high-fidelity observations lying within their nominal 95% predictive intervals. These contrasting results show that no single multi-fidelity emulator is uniformly superior. Instead, method choice should reflect the complexity of the inter-fidelity relationship, the amount of high-fidelity information available, and the importance placed on predictive accuracy and uncertainty quantification.
Read the full abstract
Computation and Language
BlueprintAgent: Constraint-Triggered Targeted Revisits for Simulation-Ready Generation from Scanned Structural Blueprints
Converting in-service reinforced-concrete (RC) building blueprints into simulation-ready models—structured frame representations that support deterministic FEM export and qualified-engineer review—underpins safety assessment and seismic retrofit, but the process remains manual. Direct prompting of a multimodal large language model (MLLM) over a scanned sheet is unreliable: outputs often violate engineering constraints on beam–column support, span count, or 3D continuity. We present BlueprintAgent (BPA), a constraint-triggered multimodal agent for simulation-ready frame extraction from scanned blueprints. BPA treats the MLLM as the primary reader and decision maker, with OCR and computer vision supplying localized evidence. Its central mechanism realizes engineering constraints as callable validators whose entity-level conflict reports trigger targeted MLLM revisits over the local region—an inference-time control distinct from fixed pipelines and free-form self-reflection. We evaluate BPA on 300 real scanned blueprint sheets from 20 anonymized RC frame projects, against five baselines and six ablations. BPA reaches a macro-averaged Beam F1 of 0.994, against 0.301 for single-MLLM zero-shot and 0.820 for a fixed pipeline; removing MLLM-led axis adjudication collapses Beam and Column F1 on complex multi-sheet projects. For dense technical drawings, engineering constraints are best deployed as triggers for entity-level targeted revisits rather than as post-hoc output filters.
Read the full abstract
Number Theory
On a problem of Nathanson related to minimal asymptotic bases and maximal asymptotic nonbases
Let $\mathbb{N}_0=\{0,1,2,\ldots\}$ and let $h\ge2$ be an integer. For a set $A\subseteq\mathbb{N}_0$, write $hA$ for the set of all sums of $h$, not necessarily distinct, elements of $A$. In this paper, we prove that for every $h\ge2$, there is a partition $\mathbb{N}_0=A\sqcup B$ such that $A$ is a minimal asymptotic basis of order $h$ and $B$ is a maximal asymptotic nonbasis of order $h$. This solves an open problem posed by Nathanson in 1974.
Read the full abstract
Software Engineering
Scanning the Harness: Configuration Exposures in AI Coding-Agent Supply Chains
AI coding agents rely on repository instructions, skills, hooks, tool-server declarations, and subagent definitions. These artifacts distribute both behavior and access to executable dependencies, making configuration review part of the agent software supply chain. We study 3,171 public GitHub repositories: 2,660 assembled setups and 511 skill collections. Deterministic analysis, mechanical re-derivation, model-assisted adjudication, human review, and platform documentation checks identify six categories of configuration exposure and conformance issues. Unpinned MCP package declarations occur in 9.8% of setups, broad execution grants in 2.5%, and broad skill tool preapproval in 3.8%. Their union covers 409 setups (15.4%); among setups with MCP configuration, 24.5% contain an unpinned declaration. Including required-field and skill-format issues brings the setup rate to 17.9% and the collection rate to 6.8%. Holding the six categories fixed, contextual review changes the setup rate from 18.3% to 17.9%; rule selection explains most of the reduction from the broader candidate set. The findings identify concrete opportunities to pin dependencies, review execution pre approval, and check component conformance before distribution or use. A documented permission exception also exposes a shared error in the scanner and its mechanical audit, motivating version-specific semantic checks. The study provides reproducible evidence about repository declarations; agreement with human judgments informs label validation, while runtime consequences and recall remain unmeasured.
Read the full abstract
Representation Theory
Representation and Extending structure of a Multiplicative Lie algebra
In this paper, we attempt to develop a general notion of representation theory for multiplicative Lie algebras. Consequently, we study equivalent, irreducible, and completely reducible representations. We also introduce the notion of the action of a multiplicative Lie algebra on a vector space and show that there is a one-to-one correspondence between the action and the representation. We also studied the extended structure of a multiplicative Lie algebra through a group.
Read the full abstract
General Economics
Access to Live AI Advice and Behavior Under Risk: An Incentivized Experiment
Generative AI has become an everyday advisor, and the systems people consult are live and interactive, not pre-scripted. We ask whether access to such a system changes behavior under risk. In an incentivized experiment (N = 158), participants made lottery choices with an optional decision aid presented as a conventional pre-written tool, a live one-shot AI, or a live interactive AI they could query, with information format held equivalent across conditions. Risk preferences are elicited via DOSE. We find no evidence that access to a live AI advisor changes risk aversion.
Read the full abstract
Software Engineering
EnvPilot: Systematic Design and Evaluation of an Experience-Augmented Agent for Software Environment Setup
Environment Setup is a critical yet complex task in software engineering that relies heavily on expert knowledge. Existing automated environment setup methods lack the ability to accumulate experience from past execution trajectories and to evolve over time. As a result, their performance is limited because they often perform redundant exploration, ignore useful past solutions, and fail to generalize across diverse software ecosystems. We present the systematic design and empirical validation of EnvPilot, an experience-augmented agent that operationalizes trajectory-derived experience reuse for software environment setup. EnvPilot maintains an expandable Trajectory-Derived Memory (TDM), initialized with 667 high-quality experiences. It systematically transforms implicit knowledge from historical execution trajectories into structured experience and retrieves the most relevant guidance during task execution through the Context-aware Retrieval mechanism. This enables EnvPilot to combine multiple validated setup strategies, providing more precise and detailed guidance than methods that rely solely on static project files or web retrieval. To evaluate EnvPilot, we construct AES-Bench, a multilingual benchmark of 112 real-world GitHub instances across 9 programming languages. Experiments show that EnvPilot achieves a new state-of-the-art (SOTA) with a 75.00% Pass@1 success rate while reducing reasoning costs. Our empirical study shows that both the structured experience representation and the Context-aware Retrieval mechanism are essential.
Read the full abstract
Emerging Technologies
Fast simulation of nonlinear deep resistive networks for energy-based computation
Deep resistive networks are electronic energy-based systems in which computation is performed by the steady-state voltages of nonlinear circuits. Nonlinear devices enable expressive input-output transformations, but make the circuit equilibria costly to compute during simulation and training. Recent coordinate-descent solvers have achieved large speedups over SPICE-class circuit simulators, but only for nonlinearities modeled as ideal-diode models. This mathematical simplification is not sufficient for practical analog circuits. Here we extend coordinate-descent simulation to realistic monotone nonlinearities, including Shockley diodes, antiparallel diode pairs, and piecewise-linear current-voltage characteristics. With neighboring voltages fixed, each node update remains a scalar Kirchhoff-law solve. Single-exponential characteristics admit closed-form Lambert-(W) updates, while more general monotone characteristics can be handled with scalar root-finding methods. Across networks with one to three hidden layers and hidden widths from 64 to 1024, the solver reproduces matched SPICE steady-state voltages with relative $L_1$ errors below $1.1\times10^{-4}$ for 90% of validation samples, while achieving speedups up to $(1.7\times10^3)$. We further train a $1568\times100\times20$ double-Shockley network on MNIST, reaching about 3.0% test error and reducing the per-epoch training time by roughly $4.4\times10^2$. Together, these results establish a practical route to the circuit-level design and training of large-scale analog energy-based systems incorporating realistic nonlinear devices.
Read the full abstract
Neurons and Cognition
Determinants of hyperparameter robustness in connectome reservoir computing
Reservoir computing provides a controlled setting for studying how recurrent network architectureshapes computation: input signals are projected into a high-dimensional state space by a fixed nonlinear dynamical system, and only the readout is trained. However, reservoir performance can be dependent on hyperparameters; this paper asks which recurrent network features support robustness to those parameter changes. We characterize computational performance using memory capacity (MC), truncated single-delay information-processing capacity (IPC), and kernel rank (KR). Generalization across input histories is measured using generalization rank (GR), while hyperparameter robustness is quantified using the coefficient of variation (CV) of each metric across sweeps of target spectral radius, input scaling, leak rate, and neuron bias. To examine the architectural determinants of robustness, we construct perturbations that alter connectivity topology, excitatory/inhibitory sign structure, weight magnitudes, and weight placement while preserving complementary properties. Across these experiments, the C. elegans connectome consistently occupies a relatively low-variance regime. The central result is a performance-robustness tradeoff: architecture variants with higher task-agnostic performance also tend to exhibit greater hyperparameter sensitivity and poorer common-tail generalization. Across the E/I edge balance sweeps and shuffle controls, this tradeoff is closely associated with the raw spectral radius before normalization. Because every perturbed matrix is rescaled to the same target radius, matrices with lower raw spectral radius receive greater global amplification of their recurrent weights. The observed differences among architectures therefore characterize the joint effects of structural variation and architecture-specific global rescaling under spectral-radius normalization.
Read the full abstract
General Relativity and Quantum Cosmology
Black Holes Thermodynamic Topology in Sharma-Mittal Statistics
In this study, we explore the thermodynamic topology of black holes within the Sharma-Mittal entropy framework. Our study covers several black hole solutions, including charged and uncharged black holes in $d$-dimensional, as well as Schwarzschild and Reissner-Nordström black holes. By introducing the Sharma-Mittal entropy characterized by two parameters $\delta$ and $R$, we explore how deviations from the standard Boltzmann-Gibbs statistics modify the thermodynamic structure and stability properties of these systems. Using Duan's $\Phi$-mapping theory, we compute the corresponding topological numbers and classify black holes into distinct topological categories according to the winding number $W$. Moreover, our analysis shows that, within the Sharma-Mittal formalism, the topological classification is independent of spacetime dimension in the case $d>4$, although dimensions higher than four exhibit distinct features compared to the four-dimensional Schwarzschild and Reissner-Nordström black holes, reveal different behavior of thermodynamic topology under generalized statistics.
Read the full abstract
Artificial Intelligence
Human-like moral judgments conceal divergent motive attributions in large language models
Large language models (LLMs) are used to simulate human participants in psychological research. We asked whether LLMs that reproduce human evaluations of a whistleblower's moral character also reproduce the motive attributions that accompany them. Five LLMs and two human samples (N = 125 and N = 742) evaluated a physician who either remained silent about fraudulent billing or reported it to a hospital, regulator, or newspaper. Models reproduced the human ranking of the physician's moral character but portrayed whistleblowers as more helpful, less self-interested, and less hostile. In four of five models, competitive motives were less strongly associated with moral-character judgments. Model ratings changed little when prompts reproduced the narratives and demographic profiles of both human samples, although this comparison cannot isolate a perspective effect. Thus, agreement in average ratings can conceal differences in attributed motives, relationships among judgments, and sensitivity to context. Validating LLMs as simulated participants therefore requires testing psychologically informative response patterns, not average agreement alone.
Read the full abstract
Number Theory
The Normal Form of Smith's Matrices
For any integers $x$ and $y$, let $(x,y)$ and $[x,y]$ stand for the greatest common divisor and the least common multiple of $x$ and $y$, respectively. We denote by $|T|$ the number of elements of a finite set $T$. Let $a,b$ and $n$ be positive integers and let $S=\{x_1,...,x_n\}$ be a set of $n$ distinct positive integers. Let $(f((x_i,x_j)))$ (abbreviated by $f(S)$) and $(f([x_i,x_j]))$ (abbreviated by $(f([S]))$) stand for the $n\times n$ matrices whose $(i,j)-$entry is $(f((x_i,x_j)))$ and $(f([x_i,x_j]))$ respectively. In 1989, Beslin and Ligh gave a description of the lower triangular decomposition of $((x_i,x_j))$. In 1992, Bourque and Ligh showed that if $S$ is factor closed (i.e., S contains all positive divisors of any element of S), then the GCD matrix $((x_i,x_j))$ divides the LCM matrix $([x_i,x_j])$ (written as $((x_i,x_j))|([x_i,x_j])$) in the ring $M_n(\mathbb{Z})$ of $n\times n$ matrices over the integers. In this paper, we will show the diagonalization of $((x_i,x_j))$ and its applications. Our main new contributions are Theorems 4.1 and 4.2, which extend previous results to gcd-closed sets satisfying condition $\mathcal{G}$.
Read the full abstract
Probability
Fixed Points for the $q$-Bass Martingale: Existence, Stability, and Convergence
We establish existence, uniqueness, stability, and convergence results for one-dimensional $q$-Bass martingales, characterized as the martingales with prescribed initial and terminal marginals whose transition kernels are closest to a reference measure $q$. Their existence is equivalent to the solvability of a fixed-point problem for probability distributions. Building on Acciaio and Marini (2026), that requires the first marginal to be supported on finitely many points, we study the case of general marginals in convex order. Under the assumption that $q\ll\lambda$, we prove existence, uniqueness and stability of fixed-point distributions, $\mathcal{W}_\infty$-convergence of the fixed-point iteration, and support-diameter estimates. We also extend the martingale Benamou-Brenier formula from Brownian motion to any additive reference process $X$ and show that the corresponding $X$-Bass martingale is optimal whenever it exists, with an interpretation as an adapted Wasserstein projection of $X$.
Read the full abstract
Robotics
D3ARC: Time-Critical Distributed Disaster Detection for Asynchronous Cooperative Multi-Robot Systems
Climate change is increasing the severity and unpredictability of natural disasters. In time-critical crises such as wildfires, traditional monitoring practices remain limited by coverage, cost, and personnel risk, paving the way for autonomous and adaptive monitoring solutions. Within this context, this paper introduces D3ARC, an asynchronous distributed hierarchical framework for time-aware and reliable wildfire detection. D3ARC integrates multiple robotic agents that cooperate under uncertainty through distributed perception, shared situational awareness and coordinated actions. A remote controller asynchronously decides upon each robot's motion, while each robotic agent senses the environment and decides where and how to execute the wildfire detection. All robotic operations require time, and as time progresses, wildfires continue to spread, reducing the opportunity for early intervention. As such, all agents share a common objective: to detect a wildfire with a certain performance threshold as fast as possible and within a time limit. D3ARC integrates mechanisms for safe navigation, coverage efficiency, cooperation and reliability. It introduces a forward-looking capability that allows agents to anticipate the future by evaluating candidate strategies before execution. The framework is evaluated through realistic robotics simulations, ablation studies, and baseline comparisons, achieving an overall mission success up to 94% with 89.4% detection confidence.
Read the full abstract
Machine Learning
Inferring Urban Mobility Interactions from Aggregated Dynamics
Real-time urban governance depends not only on knowing where people are, but on how they move between places, directional flows that could be conventionally resolved by tracking individuals through space, i.e., expensive to sustain and built on traces that are highly unique and readily re-identifiable. Here we show that this directional structure need not be observed to be known: aggregated counts which cities already collect retain enough information to reconstruct the temporal evolution of origin-destination (OD) matrix. Using an uncertainty-aware physics-informed framework, we infer future OD flows from area-level counts alone across twelve mobility datasets from cities in the United States and China, reaching accuracy comparable to models that take historical OD matrices as input. Probabilistic modeling corrects the systematic underestimation of sparse, high-value corridors and yields calibrated predictions consistent with observed flows. Architectures that respect the generation-before-assignment logic of transport planning recover interactions more faithfully, indicating that location-level spatial heterogeneity should be preserved before pairwise interactions are reconstructed. Because inference requires only aggregated observations after training, recovering interactions this way reduces reliance on continuous individual-level tracking, pointing toward a more deployable and less exposure-heavy basis for real-time urban intelligence.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Recovering Large-Scale Clustering of Missing Galaxies for Galaxy–Gravitational-Wave Cross-correlations
We present a framework for completing galaxy catalogs from flux-limited surveys which reconstructs the missing galaxy population while preserving its clustering properties. This is particularly important for cosmological analyses using gravitational-wave (GW) dark sirens without electromagnetic counterparts, such as binary black hole mergers, which constitute the majority of GW detections. As GW detectors probe increasingly larger distances, galaxy catalogs become progressively incomplete owing to survey flux limits. Current state-of-the-art statistical host identification methods typically account for this incompleteness by assuming that the missing galaxies are uniformly distributed in comoving volume. While this approximation can mitigate biases due to incompleteness, it neglects the clustering of galaxies within the cosmic web. Since galaxies and GW sources are both expected to trace the underlying large-scale structure, their spatial distributions are correlated, making a homogeneous reconstruction physically unrealistic, a shortcoming which our framework addresses. As a proof of concept, we apply the method to simulated galaxy catalogs with different flux limits and observational selection functions. Our approach provides a significantly more realistic completion of incomplete galaxy catalogs than the commonly adopted homogeneous-in-comoving-volume approximation, enabling more robust cosmological inference from gravitational-wave dark sirens.
Read the full abstract
Applied Physics
Dynamic distortion from discretized coupling feedback in soft-spin Ising machines
Although Ising machines (IMs) have grown in popularity due to their potential as physics-based accelerators for combinatorial optimization problems (COPs), most literature focuses on empirically-obtained benchmarks with low universality. In this work, we propose dynamic feedback distortion as a universal metric to quantify the effect of coupling field discretization in time-multiplexed IMs. Starting from the transfer functions of realistic hardware, we analytically show how this distortion can be mitigated using a global bias (or choosing the correct discrete coupling element) and injecting coloured noise. Our numerical results show that our mitigation protocols are very effective, especially in complicated energy landscapes (namely tunable Möbius ladders and 2D tiling problems); where an analogue reduction of the distortion leads to a two–three order of magnitude increase in the success rate of complex COPs.
Read the full abstract
Computer Vision
From Explicit References to Scene Manifolds: Distributional Fidelity and Realism for Radiance Field Quality Assessment
Radiance field representations such as 3D Gaussian Splatting (3DGS) enable high-quality novel view synthesis but can introduce complex, view-dependent artifacts from reconstruction, rendering, and compression. Reliable perceptual quality assessment (QA) is thus essential for evaluating rendered views and guiding the design of perceptually faithful scene representations. Existing full-reference QA metrics require an aligned reference image, while recent cross-reference metrics relax this requirement by comparing a test view with non-aligned references. However, under wide-baseline radiance field settings, selecting a reliable nearby reference can be difficult, particularly when evaluating views along arbitrary trajectories and poses. We propose SCODA, a lightweight scene-conditioned objective QA method that shifts QA from explicit image-to-image comparison to scene-manifold modeling. High-quality observations of each scene are represented as a multivariate Gaussian distribution in deep feature space, producing a semantic fidelity score that measures deviation from the scene distribution. A weakly-supervised distortion-aware patch discriminator provides a complementary realism signal, and both cues are combined through an unsupervised bounded fusion strategy. Experiments on multiple benchmarks show strong agreement with human judgments and robust generalization across GS- and NeRF-generated views and trajectories. Code is publicly available at https://gitlab.com/saeedmp/scoda.
Read the full abstract
Logic in Computer Science
Monadic Second-Order Logic in HOL: Deep and Shallow with Automated Faithfulness (Extended Preprint)
In Isabelle/HOL, we apply the deep-and-shallow embedding methodology of our prior work to monadic second-order logic (MSO). Three embeddings are developed side by side: a deep embedding (an inductive datatype with an explicit satisfaction relation); a maximal-shallow embedding that translates the connectives and quantifiers directly into HOL, carrying the interpretation and both assignments explicitly; and a minimal-shallow embedding – a locale that fixes those parameters, collapsing the formula type to bool. The enabling new ingredient is a two-sorted substitution apparatus – capture-avoiding substitution, renaming, and a substitution lemma per namespace – in which each binder is transparent for the other; faithfulness of all three embeddings is mechanised and largely automated. Our central contribution is a fully mechanised two-sorted downward Loewenheim-Skolem theorem: the minimal embedding recovers deep validity relative to the (countable) assignment ranges, and this range-relative reading is shown to coincide with the general (Henkin-style) reading of MSO, whereas the standard reading validates strictly more formulas, witnessed by comprehension. Both readings are nonetheless recovered from the minimal embedding, differing only in the admitted interpretations: all of them for the general reading, only the elementary substructures of the full model for the standard. We exercise the embeddings on classical MSO landmarks: the Boolean-closure and graph schemata hold under the full second-order domain yet fail in the minimal embedding, making the dichotomy concrete, while reachability and 2-colorability are refuted throughout.
Read the full abstract
Cryptography and Security
Staying on the Attack Path: Structured State for Long-Horizon Automated Penetration Testing
Large language model (LLM) based agents are increasingly applied to cybersecurity tasks such as vulnerability discovery and automated penetration testing. On long-horizon security tasks, however, such agents remain limited by context forgetting and intent drift: early critical facts and causal reasoning chains are lost over extended interactions, and the agent falls into aimless, repetitive exploration. This paper proposes Intentest, an intent-graph-guided automated penetration testing agent that externalizes long-horizon state from the LLM's context window onto a persistent fact-intent directed acyclic graph (DAG), thereby substantially reducing invalid transitions. We evaluate Intentest on automated penetration testing of web applications, a representative long-tail task in cybersecurity. In the DAG, verified network states are stored as immutable fact nodes, and exploration directions are constrained as intent edges bounded by predecessor facts. The system adopts a three-layer architecture, in which the fact-intent mapping layer maintains the global state, the task scheduling and allocation layer ensures execution stability through two-phase degradation recovery and multi-dimensional adaptive load balancing, and the intent retrieval and prediction layer provides tactical priors through a top-down five-stage filtering algorithm. On a benchmark of real CTF challenges covering more than ten vulnerability types across three difficulty levels, Intentest achieves an overall success rate of 88.2% and a success rate of 75.0% on hard tasks, improving over the baseline by approximately 44 and 50 percentage points. Ablation experiments further show that the intent retrieval and prediction reduce the average number of rounds on successful medium and hard tasks by about 33% and 48%, respectively, without changing the set of solvable tasks.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Conformally Coupled Scalar- Field Dark Energy: Cosmological Dynamics with Early- and Late- Measurements
In this work, the cosmology of the conformal interacting dark energy model is investigated by introducing a scalar field representing dark energy (DE) coupled to dark matter (DM) via a conformal transformation. This coupling yields a class of scalar+tensor theories; the interaction term ${Q}$, which indicates the flow of energy between the dark sectors, is proportional to the trace of the energy-momentum tensor of the DM fluid, $T^{\mathrm{DM}}_{\mu\nu}$, as ${Q}=\frac{C'(\phi)}{2C(\phi)}g^{\mu\nu}T^{\mathrm{DM}}_{\mu\nu}$, where $C(\phi)$ is the conformal function of a scalar potential (coupling) field. We assume the power-law parametrization $C(\phi)\propto (1+\phi)^m$, with $m$ as the coupling parameter, and determine the direction and magnitude of energy flow between the DM and DE scalar-field components. We model DE in three scenarios: conformally interacting dark energy (CIDE) coupled to a scalar field, uncoupled scalar+field DE (UCSFDE), and standard $ \Lambda$CDM models. We confront these models with cosmological measurements to test the viability of CIDE and UCSFED against $\Lambda$CDM and constrain them using a combination of early and late time data, namely: Cosmic Microwave Background measurements from Planck 2018 Legacy (CMB); Baryon Acoustic Oscillation (BAO) data from the Dark Energy Survey ( DESI DR2 DR2 BAO); and Supernova Type Ia distance compilations (PantheonPlus, PantheonPlus + SH0ES, Union3, and DES+Dovekie). We perform parameter inference with Monte Carlo Markov Chain (MCMC) simulations using COBAYA and a modified CLASS ...
Read the full abstract
Mesoscale and Nanoscale Physics
Trion-mediated quantum operations on a double-dot charge qubit
A scheme for controlling a charge qubit on a semiconductor asymmetric double quantum dot with suppressed tunnel coupling between individual quantum dots is proposed. Laser pulses convert the logical single-electron states of the qubit into auxiliary trion states, for which the resonant tunneling condition is restored due to the compensation of structural asymmetry by the Coulomb interaction of the particles. The conditions for performing orthogonal single-qubit rotations are formulated. For a two-dimensional structure, the parameters of the qubit are calculated, and the dependence of the fidelity of the inversion operation on the parameters of the laser field and the rates of dissipative processes is obtained. It is shown that the considered algorithm is characterized by high speed and reliability.