Computation and Language
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 10 September
Large language models are typically trained under uniform token weighting, which allows frequent and low-information tokens to dominate learning and can increase the tendency to memorize surface-level text spans. To address this, we present an information-weighted cross-entropy loss that rescales token-level contributions using TF-IDF statistics, emphasizing semantically informative tokens while down-weighting ubiquitous ones. Experiments on five decoder-only LLMs ranging from 1.1B to 13B parameters show consistent reductions in memorized substring length while preserving perplexity and downstream task performance. Under LoRA fine-tuning, TF-IDF reduces average substring memorization length by 14% across all five models. Under full-weight fine-tuning on TinyLLaMA 1.1B, the reduction reaches 58%. Our approach is architecture-agnostic and can be incorporated into existing training pipelines with less than 3% computational overhead, offering a lightweight and principled way to mitigate memorization without disrupting standard training dynamics.
Cryptography and Security
BenchShield: Formal Model-Backed Instrumentation for Reward Integrity in LLM-Agent Evaluation Infrastructure
LM-agent benchmarks increasingly function as interactive evaluation infrastructure. Agents observe state, call tools, modify workspaces, submit artifacts, and receive rewards from outcome procedures. This interactivity makes evaluations vulnerable to reward hacking: an agent improves its measured score by exploiting the reward-relevant trajectory instead of solving the intended task. Existing defenses rely largely on task-specific patches, prompt instructions, or post-hoc detectors. They do not provide reusable evidence that a concrete run remained within its intended evaluation boundary. This paper presents BenchShield, a model-backed instrumentation layer for reward integrity in LLM-agent evaluation. BenchShield grounds detection in a finite lifecycle model of an evaluation's reward-relevant events. Within the benchmark infrastructure, two complementary analyses operate over this model. A static, phase-aware taint analysis exposes reward-hacking paths before a run. Its runtime counterpart uses infrastructure-side evidence to attribute concrete agent use and emit evidence-backed claims. We construct BenchShield Trajectories, a human-labeled corpus of 456 adjudicated trajectories from more than 31,000 public agent runs across three benchmarks. Compared with an agentic hackability scanner baseline on the same tasks and model, BenchShield improves full-chain recall from 23-94% to 77-100%, same-vector coverage from 16-56% to 43-78%, and reduces per-task cost by up to 65%. Its runtime analysis achieves 96% accuracy in detecting reward hacking from infrastructure-side evidence.
Read the full abstract
Analysis of PDEs
Boundary layer analysis for the 2D Chemotaxis-Navier-Stokes system with logarithmic sensitivity, Part II. viscous vanishing limit
This is the second part of a two-part work concerning boundary layer solutions to the coupled Chemotaxis-Navier-Stokes system in the two-dimensional half-space. In the present work, we address the convergence of boundary layer solutions to singular chemotaxis-fluid equations under slip boundary conditions with respect to the chemical diffusion-viscosity parameter $\varepsilon$ in the two-dimensional half-plane. More precisely, we show that the boundary layer for $\varepsilon>0$ (viscous convection coefficient) converges to the superposition of the outer layer (solution with $\varepsilon=0$) and the inner layer as $\varepsilon\rightarrow0$. The outer and inner profiles are explicitly derived as in the first part\cite{WWZ}. Furthermore, the well-posedness results of the coupled Chemotaxis-Navier-Stokes system in conormal Sobolev spaces will be presented in Appendix. They answer the question mentioned in the first part of the two-part work. This study could help the understanding of the chemotactic movement of aerobic bacteria to the water-air surface observed experimentally in fluids, and enrich the theoretical results of boundary layer in chemotactic fluid models.
Read the full abstract
Lattice Field Theory
Properties of the positive and negative parity charm-strange and bottom-strange mesons $D_s$, $D_s^*$, $D_{s0}^*$, $D_{s1}$, $B_s$, $B_s^*$, $B_{s0}^*$, $B_{s1}$ from lattice QCD: masses, decay constants, and compositeness
We present a lattice-QCD determination of properties of the lightest scalar, pseudoscalar, vector, and axial-vector heavy-strange mesons. This includes the decay constants of all mesons, and the binding energies and Weinberg compositeness parameters of the positive-parity states. The calculations are performed with domain-wall fermions for the light and strange quarks and anisotropic clover actions for the charm and bottom quarks. We use seven ensembles generated by RBC/UKQCD with pion masses ranging from 431 MeV to 139 MeV and lattice spacings ranging from 0.114 fm to 0.073 fm, which allows us to perform combined chiral and continuum extrapolations. For the negative-parity mesons, we obtain $f_{D_s}=251.4(2.1)(0.4)(2.5)\:{\rm MeV}$, $f_{D_s^*}=272.5(4.3)(1.0)(2.7)\:{\rm MeV}$, $f_{B_s}=228.4(5.8)(0.5)(2.3)\:{\rm MeV}$, $f_{B_s^*}=229.2(4.4)(0.8)(2.3)\:{\rm MeV}$, $f_{D_s^*}/f_{D_s}=1.086(14)(11)$, and $f_{B_s^*}/f_{B_s}=1.003(22)(10)$. In the positive-parity sector, the finite-volume energies and decay constants are extracted using the GEVP from correlation matrices with three different types of hadron interpolating operators, including operators with covariant derivatives and meson-meson-scattering operators at both source and sink. After extrapolation to the physical point, we obtain $f_{D^*_{s0}}=136.6 (8.0)(4.0)(1.4)$ MeV, $f_{D_{s1}}=200 (33)(24)(2)$ MeV, $f_{B^*_{s0}}=207 (12)(8)(2)$ MeV, and $f_{B_{s1}}= 196 (16)(11)(2)$ MeV. Our results for $f_{B^*_{s0}}$ and $f_{B_{s1}}$ are the first from lattice QCD. Lüscher's method is used to find the infinite-volume bound-state masses. At the physical point, we obtain $m_{D^*_{s0}}-m_D-m_K=-48 (14)(4)$ MeV, $m_{D_{s1}}-m_{D^*}-m_K=-61 (15)(2)$ MeV, $m_{B^*_{s0}}-m_B-m_K= -69 (13)(4)$ MeV, and $m_{B_{s1}}-m_{B^*}-m_K=-77 (10)(5)$ MeV. Our analysis shows consistency with the positive-parity states being predominantly molecular.
Read the full abstract
Dynamical Systems
Admissible Fourier Lengths, KAM Reducibility, and Spectral Applications
We develop a perturbative KAM reducibility theory for one-frequency $\mathrm{SL}(2,\mathbb{R})$ cocycles based on an admissible Fourier length $\ell$. The regularity relevant to the iteration is measured by positive adapted Fourier width rather than ordinary smoothness in the Euclidean length $|n|$. The same length governs Fourier decay, truncation and resonance scales, and the arithmetic condition controlling the small divisors. This framework contains the classical analytic and Gevrey settings, while non-monotone choices of $\ell$ allow classical nowhere differentiable Weierstrass-type perturbations and continuous perturbations outside every positive Hölder class. As spectral applications, we obtain purely absolutely continuous spectrum for every phase and $1/2$-Hölder continuity of the integrated density of states for the associated quasiperiodic Schrödinger operators. The Aubry dual has pure point spectrum for Lebesgue almost every dual phase, with eigenfunctions exponentially localized in the metric induced by $\ell$. We also construct nowhere differentiable quasiperiodic potentials with purely absolutely continuous Cantor spectrum.
Read the full abstract
Cryptography and Security
The Missing Boundary: How Autonomous Agents Lose Control
Autonomous agents increasingly perform long-horizon tasks involving tool use, persistent state, and consequential actions, raising a fundamental question: under what conditions does an agent cross the boundary of authorized execution while pursuing a legitimate task? Existing studies often attribute such failures to adversarial instructions, malicious environments, or conflicting objectives, leaving unclear how loss of control can emerge during otherwise legitimate task execution. We study this question by independently manipulating three factors: goal pressure, control degradation, and executable unsafe opportunity. Our central hypothesis is that a degraded control boundary becomes consequential when the environment exposes an executable action that crosses it, even when the underlying task remains legitimate and a sanctioned path remains feasible. We test this hypothesis in a deterministic multi-turn environment across five agent models and 16 operational domains. Across 1,800 unique trajectories, we find that neither degraded control nor unsafe opportunity alone produces substantial loss of control; when both are present, the loss-of-control rate reaches $55\%$ in the full-factorial study and $62\%$ across ten additional operational domains. Restoring the original control boundary reduces the rate to $0\%$ even when the unsafe action remains executable. A context-management ablation further shows that compaction itself is not harmful: preserving the control constraints yields $0\%$ loss of control, whereas omitting them increases the rate to $87\%$. These results show how a latent loss of control can become an external violation: the task objective remains intact, but an executable opportunity can turn a missing control boundary into consequential action. Our code will be made publicly available at https://github.com/Tencent/AI-Infra-Guard/tree/main/Research/forge_bench.
Read the full abstract
Software Engineering
RCL: A Retrieval-Confidence Layer for Detecting Insufficient Context in Enterprise Retrieval-Augmented Code Generation
Retrieval-Augmented Generation (RAG) for code generation has been studied extensively on public repositories, where a model's parametric knowledge often compensates for imperfect retrieval. This breaks down in enterprise codebases, where private APIs, internal frameworks, and undocumented team conventions fall entirely outside any model's pretraining distribution. Recent work on private-library code generation shows that even oracle (perfect) retrieval does not eliminate errors, but locates failures downstream in API usage; separately, confidence-gated retrieval has been studied for open-domain question answering using model-internal confidence. Neither addresses whether retrieval itself was structurally sufficient for a private-code query before generation begins. We introduce RCL (Retrieval-Confidence Layer), a lightweight module inserted between retrieval and generation that combines a call-graph-derived structural coverage score with a novelty score estimating a query's dependence on knowledge outside the model's prior, to detect insufficient retrieval before generation occurs. When confidence falls below a calibrated threshold, RCL triggers a targeted follow-up retrieval or labels the output for human review, rather than generating silently against incomplete context. We describe RCL's architecture, formalize its scoring functions, and propose an evaluation methodology using a private-code benchmark built by injecting synthetic internal APIs into open-source Java repositories, simulating the enterprise condition without proprietary code. We report results (Section 7) comparing RCL against similarity-only retrieval on generation correctness. Our position is that retrieval sufficiency, assessed structurally rather than from model-internal confidence, is a distinct and currently underaddressed signal for building safer code-generation systems in private, enterprise settings.
Read the full abstract
Computer Vision
New Evidence, Same Choice: Testing Physical Experiment Selection in Vision Language Models
A model first sees an image from one physical measurement experiment, such as how far a block coasted, and must answer a question about a new trial, such as whether the block will pass a target after a fixed push. The initial experiment may provide enough information to answer, or the model may need another measurement, such as the object's mass, friction, restitution, or spring stiffness. We study whether vision language models can decide when to answer immediately and, when more evidence is needed, which experiment to perform. Current physical reasoning benchmarks usually evaluate only the final answer, so they do not directly measure this decision-making ability. We introduce a controlled evaluation where each problem provides one measurement image and four possible physical worlds created by combining two possible masses and two possible values of another relevant property. The model must either stop and answer or select the cheapest additional experiment that can resolve the question. We construct matched problem pairs where changing either the observed measurement or the question changes the optimal action. Since all possible worlds and experiment costs are known, we can explicitly determine the optimal choice. Across six open models and 144 physical parameter sets, direct responses repeat the same action for 95.1% to 100% of image pairs even when the correct action changes. Brief reasoning improves action switching, but the best model makes both decisions correctly for only 5.9% of image pairs. Additional analysis reveals failures in measurement interpretation, physical reasoning, and response formatting. By evaluating evidence selection separately from final answers, our benchmark reveals limitations in physical reasoning that conventional answer accuracy can overlook.
Read the full abstract
Quantum Physics
Full-Rank Noise Forbids Long-Range Entanglement Swapping
Quantum repeaters extend entanglement by swapping noisy elementary links. We prove that full-rank noise forbids this at long range: for any entangled full-rank two-qubit link, there is a finite depth beyond which no end-to-end entanglement can be established regardless of the measurement outcomes on intermediate qubits, even under any adaptive postselected strategy. This limit is set by one spectral parameter of the link, giving a no-go criterion for repeater routing. In contrast, we construct link state families of rank three and rank two that admit postselected measurement outcome branches of exponentially small probability but with strictly positive concurrence at every finite depth. Swapping experiments on a superconducting processor show that links of equal initial concurrence but different rank behave differently under postselected swapping. In the language of many-body physics, the chain is a matrix-product density operator, and full-rank bonds forbid long-range localizable entanglement, while rank-deficient bonds can sustain it.
Read the full abstract
Computation and Language
K/V-Cache Interventions Dissociate Representation Alignment from Persona Expression in Decoder-Only Language Models
We study K/V-cache interventions – transplanting a target-conditioned K/V trajectory into a source-persona generation – as a structured surface for persona control in decoder-only language models. Across 13 intervention configurations applied to Llama-3.1-8B for a fixed source-to-target persona pair, we report two consistent dissociations between representation-level alignment and behavioral expression, plus a common failure under position perturbations. First, all layer-band K/V replacements (early, mid, late) achieve strong local V-space alignment (V-gap 0.91, 0.89, 0.84), but only mid-layer replacement (layers 9-20) combines substantial target-marker expression with preserved lexical diversity. Second, full and mid-layer replacement induce comparable alignment (V-gap 0.94 vs. 0.89) yet produce different lexical-diversity profiles (TTR 0.65 vs. 0.77). Third, position perturbations (lag and shuffle) apply distinct operations yet uniformly suppress target-persona expression – a common behavioral failure rather than a strict dissociation. Representation-level similarity metrics alone are thus not sufficient predictors of downstream persona expression in the regimes we study; the K/V cache emerges as a controllable but structurally constrained intervention surface. Because the transplanted trajectory carries the target's own generated token history, we characterize the intervention as trajectory-level transplantation rather than isolated persona-representation injection; a same-token-sequence control, decoding an identical token sequence under source vs. target conditioning, reproduces the sign and layer localization of the L28 representational shift, indicating the shift is not explained solely by imported token history. These findings characterize representation-behavior dissociation in a high-signal setting rather than establishing universality across models or persona pairs.
Read the full abstract
Computers and Society
Work, Wellbeing, and Choice: Empirical Lessons for AI Futures
Advances in AI-driven automation have raised questions about how humans might find wellbeing in a world where paid employment is less necessary or less available than before. Paid work has been variously characterized as both a contributor and an impediment to human wellbeing. What is already known about the relationship between paid work and wellbeing? What factors influence wellbeing among people who do not work—or who do not need to work? And how might these factors bear upon prospective AI-induced economic transformations? To help provide empirical grounding for these questions, we survey the psychological, sociological, and economic literature that investigates the relationship between wellbeing and work. We draw on evidence from multiple populations, including the unemployed, retirees, lottery winners, and financially dependent spouses. This comparative review draws from studies across OECD countries, China, India, and Gulf states. We identify three key factors that mediate the relationship between work status and wellbeing: (1) agency and choice—whether the exit from work is voluntary or involuntary, as well as long-term agency; (2) the availability of alternative sources of work's latent benefits—such as volunteering, hobbies, or state-provisioned employment; and (3) social and systemic context—including cultural norms around work and the robustness of social safety nets. We draw on these three factors to derive specific implications for different AI automation scenarios, connecting the empirical evidence to concrete policy considerations.
Read the full abstract
Artificial Intelligence
Defining AI Agents: A Compendium of Criteria, Metrics, and Benchmarks
The term agent in artificial intelligence lacks a standard definition, complicating the evaluation, comparison, and reproducibility of AI agent research. We address this ambiguity through a survey organized around five dimensions of agenticness: environmental interaction, learning and adaptation, autonomy, goal-directed behavior, and temporal coherence. For each dimension, we examine how the underlying capability has been conceptualized across prior work and synthesize the metrics, benchmarks, and evaluation frameworks used to assess it. This review provides a structured account of the current landscape of agent evaluation, highlighting both established approaches and areas where evaluation remains limited or inconsistent. We additionally introduce the Agent Compendium, a public-facing digital resource that organizes and extends the evaluation methods identified through this review. Together, the survey and compendium provide a common structure for evaluating and comparing agent capabilities across AI systems, supporting more reproducible research, clearer communication, and more systematic study of artificial agents.
Read the full abstract
Mesoscale and Nanoscale Physics
In-plane magnetic field control of anomalous Hall response enabled by magnetic anisotropy engineering
Engineering magnetic anisotropy provides a powerful route to control magnetization orientation and unlock emerging functionalities in opto-spintronic and current-driven devices. Beyond its role in magnetization reversal, the effective anisotropy can strongly influence the magnetotransport response, offering an additional degree of freedom to tune new device functionalities. In this work, we report a magnetotransport study of a ferrimagnetic [Tb/Co]$_{\times 5}$ multilayer grown with a Tb thickness gradient, whose wedge-shaped tilts the uniaxial anisotropy axis slightly away from the film normal. Anomalous Hall resistivity measurements from 80 K to 300 K reveal a spin reorientation transition, while the angular dependence of the magnetotransport responses exposes the crucial role of the tilted anisotropy. A simplified macrospin model reproduces the full angular response across the transition and shows that the observed anomalous Hall effect when the in-plane magnetic field is applied originates from the tilt of the uniaxial anisotropy axis, which supplies a built-in symmetry-breaking mechanism, enabling in-plane field control over the out-of-plane anomalous Hall response, sign included. These findings establish tilted magnetic anisotropy as a promising route toward Hall effect-based sensor applications and highlight Tb/Co multilayers as a versatile platform for anisotropy-engineered spintronic devices.
Read the full abstract
Statistics Theory
A Scale Invariance Property of PCA
The PCA algorithm is sensitive to changes in measurement scale. Measuring one variable of a system in inches rather than centimeters, say, alters both its principal axes and principal eigenvalues. Although this scale dependence is generally complicated, we show here that it nevertheless obeys a strict invariance property: under a continuous scale adjustment, the initial state's $k$-th largest principal component (ordered by eigenvalue) continuously evolves into the final state's $k$-th largest principal component, for each $k$. In this sense, we can say that the modes of PCA are "order-stable" with respect to changes in measurement scale. A special case occurs when scaling along directions that are orthogonal to some modes. Here, apparent eigenvalue crossings can occur. However, we show that we can interpret these apparent crossings as cases where the modes instantaneously swap their orientation, in this way maintaining the required order stability.
Read the full abstract
Mesoscale and Nanoscale Physics
A substrate booster for P-type 2D ferromagnetic semiconductor
Spin transistors with its both charge and spin properties tuned via electrostatic gating are believed capable for widespread use, which however have proven challenging due to the extreme rareness of their physical base – magnetic semiconductors. The latter are limited within very few systems including diluted magnetic semiconductors (DMS) and two-dimensional ferromagnetic semiconductors (2D-FMS), and known to suffer from inadequate gate-tunability of their electric and/or magnetic properties. Here, we show a substrate engineering paradigm by interfacing few-layered Cr$_{2}$Ge$_{2}$Te$_{6}$ (FL-CGT) with an antiferromagnetic insulator CrOCl. Owing to the subtle interfacial charge transfer couplings, CGT can be drastically turned from an ambipolar semiconductor into a high performance P-type semiconductor. When cooled below the Curie temperature, the ON-OFF ratio in such substrate-boosted FMS field-effect transistor (FET) reaches 10$^{5}$ with its coercive field $H_{c}$ of magnetic hysteresis loop tunable by a factor of more than 200$\%$, enabling {gate-assisted magnetic switching in the prototype semiconducting spin transistor architecture}. A crossover from critical power-law scaling to a dual power-law behaviour under heavy hole doping was further observed. Our findings {signify} an efficient interfacial charge transfer and electrically modulated magnetic anisotropy energy supported by calculations. This high performance P-type FMS-FET system suggests that active substrate-boosting paradigm might be a powerful path for the investigation of future gate-tunable spintronic devices.
Read the full abstract
Machine Learning
Topological Necessities: Mechanism-Invariant Strategic Subgoals for Cross-Embodiment Goal-Conditioned Control
Long-horizon goal-conditioned reinforcement learning delegates control to a high-level module that proposes subgoals, but existing subgoals are implicit byproducts of value functions or latent actions, tied to the executor that produced them. We study a different object: a route-conditioned order of unavoidable stages that every successful executor must traverse, recoverable from offline trajectories and belonging to none of them. Its defining properties are topological: an unskippable stage is a separating set that every admissible path must cross, and a loop in free space forces a route choice. We read the two by homology in dimensions 0 and 1 over a transport-weighted carrier built from successful trajectories, yielding an enumerable gate set with shell-level certificates; the certified gates are what we call topological necessities. Certified gates enter the decision loop as a recursive topological gate hierarchy. Under a fixed, isomorphic free space, the object survives executor replacement: gates frozen on PointMaze data transfer without retraining to Ant and Humanoid, attaining the highest Humanoid aggregate under a unified interface (96.1), with +36.0 over a map-privileged reference on the multi-route task (p=1.4e-5); the planner saturates PointMaze (100+/-0) and matches or exceeds the strongest baselines on AntMaze (giant +22.9) and Kitchen (+15.8/+12.6).
Read the full abstract
Distributed Computing
Online Treasure Hunt in Vertex-Permuted Dynamic Rings
We study the problem of treasure hunt by a group of $k \geq 1$ agents in vertex-permuted dynamic rings (VP). In this model, the $n$ vertices remain on a ring but are permuted at each time step. We first show that treasure hunt is impossible for any $k \leq n-3$ agents, if there are no restrictions on the sequence of permutations used in the dynamic ring. We then study the $VP(\delta)$ setting, in which for every pair $i, j$ of vertices, the edge $(i, j)$ is guaranteed to appear within $\delta$ steps. We show that the class $VP(\delta)$ is feasible only for $\delta \geq \left\lceil \frac{n-1}{2}\right\rceil$. For the one-agent case, we show a tight bound of $\Theta(\delta n)$ on the worst-case search time as well as competitive ratio of any online algorithm for treasure hunt, provided $\delta \geq 2n$. We then give an optimal algorithm for $k$ agents, thereby showing that $k$ agents can obtain a speedup of $k$ on the worst-case search time. Finally, in the R-VP setting, in which in every step, the vertices are arranged as a ring according to a random permutation, we show that treasure hunt takes expected $\Theta(n)$ steps against an oblivious adversary and $\Theta(n \log n)$ steps against an adaptive adversary.
Read the full abstract
Statistical Methodology
Discretization in covariate-adaptive randomization: gains and losses
Covariate-adaptive randomization(CAR) is widely implemented in clinical trials to balance prognostic covariates across treatment arms. Continuous covariates are often discretized into strata in practice, yet their consequences are not clearly understood. This paper provides a comprehensive study of the impact of discretization on both the CAR design process and the inferential results thereafter. We establish the asymptotic properties of both imbalance measures and treatment effect estimators under discretized and non-discretized settings. Practical recommendations are given on when and how discretization should be employed. We show that discretization in design is generally recommended, as it enhances robustness against model misspecification. However, if the true model is known, the most efficient strategy is to balance covariates according to that model in the design. The theoretical results are corroborated by extensive simulation studies and an empirical application to a diabetes trial dataset. Together, the results clarify the gains and losses of discretization in CAR and pave the way for learning impact of discretization to other designs and beyond.
Read the full abstract
Probability
Spectral properties of Random Matrices
We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.
Read the full abstract
High Energy Physics (Phenomenology)
Axionic Wormholes in Metric-Affine Gravity
The axion is a promising candidate for solving the strong CP problem. To solve this problem, the global U(1) symmetry must be preserved to a high degree of accuracy. However, it is well known that global symmetries are explicitly violated by quantum gravity effects, giving rise to what is referred to as the axion quality problem. In this paper, we investigate axionic wormholes as a source of explicit U(1) violation in Metric-Affine Gravity. This framework allows for spacetime torsion and non-metricity, which accommodate additional curvature-like and topological terms, such as the Holst and Nieh–Yan terms, that are absent from the metric and Palatini formalisms. We show that non-minimal couplings to these terms modify the wormhole dynamics and enhance the Euclidean wormhole action, thereby alleviating the axion quality problem. We also find that the viable parameter space is enlarged when two of these couplings are simultaneously present. We further identify representative parameter regions where the alleviation of the axion quality problem is compatible with inflationary constraints.
Read the full abstract
Geometric Topology
Bar cohomology of links: beyond Milnor invariants
We develop bar cohomology of link complements as an invariant of links in homology spheres. In this setting, bar cohomology is a Hopf algebra which is calculable using surfaces and their intersection curves in a link complement. In this first in a sequence of works, we introduce the invariant and show that it defines a canonical subspace of the tensor Hopf algebra, which already encodes information about Milnor's link invariants and provides geometrically significant information beyond them.
Read the full abstract
Cryptography and Security
DeFiFusion: Combining Transaction Events with Smart Contracts to Detect Price Manipulation Attacks
Decentralized Finance (DeFi) has emerged as a rapidly growing blockchain-based financial service, where market transaction dynamics and underlying smart contract logic are intricately intertwined. This autonomous interplay, while eliminating centralized intermediaries, significantly expands the vulnerability surface of DeFi protocols to Price Manipulation Attacks (PMAs), which have already inflicted catastrophic financial losses. Despite their gravity, existing detection paradigms suffer from fundamental limitations. Transaction-centric methods lack awareness of contract execution semantics, making them prone to false positives under legitimate market volatility, while static contract analyses ignore real transaction behaviors and frequently report vulnerabilities that are infeasible to exploit in practice. We present DeFiFusion, a dual-modal PMA detection framework that closes this gap by jointly modeling transaction events and smart contract semantics within a unified pipeline. Our core insight is that PMA maliciousness emerges only from the interaction between transaction behaviors and the contract logic they exploit; neither signal suffices in isolation. Accordingly, we derive price-manipulation-aware event encoding for extracting fine-grained temporal and economic features tailored to manipulation patterns. We further introduce LLM-based contract semantic extraction to supply the execution-logic context that prior behavioral methods lack. To fuse these modalities, we propose a Dual-Modal Projection-Fusion Transformer with T5-style relative positional encoding, capturing the cyclic multi-stage execution structures that distinguish PMAs from benign market activity. Extensive experiments demonstrate that DeFiFusion consistently achieves state-of-the-art detection performance, effectively recalling 222 of the 225 PMA cases while maintaining a precision of 96.10%.
Read the full abstract
Audio and Speech Processing
Diarization Error Decomposition Under Pause Annotation Ambiguity
Speaker diarization evaluation is sensitive to ambiguity in pause annotation, which can inflate diarization error rate (DER) or obscure genuine model errors. We show that morphological closing, which has been used for pause-tolerant diarization evaluation, discards segment-level distinctions. Instead, we propose an exact, overlap-aware decomposition of standard DER into a pause-attributable component, consisting of errors compatible with pause filling, and a residual core component that can serve as a proxy for intrinsic diarization errors. The decomposition leaves DER unchanged, while the pause-attributable and core components vary monotonically with the pause threshold and eventually saturate. Experiments spanning synthetic transformations, annotation mismatch, cross-domain evaluation, and tight-boundary diarization show that the decomposition reveals error sources not apparent from standard DER.
Read the full abstract
Combinatorics
Counting Near-Spanning Matchings in Latin Squares and Steiner Triple Systems
Montgomery recently proved that for sufficiently large $n$, every Latin square of order $n$ has a partial transversal with $n-1$ cells, and every Steiner triple system of order $n$ has a matching with $\lfloor n/3\rfloor-1$ edges, thus confirming the Ryser–Brualdi–Stein conjecture for even $n$ and the conjecture of Brouwer. We prove sharp enumerative refinements of these results: there is an absolute constant $c>0$ such that, for sufficiently large $n$, 1) every Latin square of order $n$ has $ \left((1\pm n^{-c})\frac{n}{\mathrm {e}^2}\right)^n$ partial transversals with $n-1$ cells; 2) every Steiner triple system of order $n$ has $ \left((1\pm n^{-c})\frac{n}{2\mathrm {e}^2}\right)^{\lfloor n/3\rfloor}$ matchings with $\lfloor n/3\rfloor-1$ edges. The first estimate confirms predictions of Montgomery and Kelly.
Read the full abstract
Differential Geometry
The Cartan-Hadamard conjecture in dimension five
We show that the sharp Euclidean isoperimetric inequality holds for domains in complete simply connected Riemannian $5$-manifolds of nonpositive sectional curvature, which establishes the Cartan-Hadamard conjecture in that dimension. The main step is a sharp inequality for constant-mean-curvature hypersurfaces, proved via integrals over pairs of boundary points, in the spirit of Banchoff-Pohl, together with an estimate for Jacobi fields along geodesic chords. The inequality persists for boundaries of isoperimetric regions in geodesic balls, whose mean curvature is constant only on the free part. An isoperimetric-profile argument, after Kleiner, completes the proof. Our method also gives a new proof in dimension $3$.
Read the full abstract
Quantum Physics
On-chip squeezed light in the audio frequency band
Squeezed light in the audio-frequency band is a key resource for quantum metrology and quantum sensing. However, realizing stable audio-frequency squeezed light on integrated photonic platforms remains challenging due to technical noise and the difficulty of scalable phase referencing. Here, we demonstrate on-chip generation of audio-band two-mode squeezed states down to 60 Hz in a silica microcavity. To enable phase-stable operation without directly locking fragile quantum modes, we develop a coherent-comb control method in which a weak electro-optic reference comb co-propagates with the vacuum at the quantum frequency modes in an orthogonal polarization. This scheme provides quadrature measurement and long-timescale phase stability, thereby enabling covariance-matrix reconstruction. We verify the entanglement with the positive partial transposition criterion, which confirms inseparability via a minimum symplectic eigenvalue of 0.395 ($<0.5$). Our results establish an experimentally accessible route toward on-chip phase-stable audio-band squeezing and support the scalable framework for continuous-variable quantum information processing with integrated photonics.
Read the full abstract
Commutative Algebra
The transfer of Artinian and Cohen-Macaulay properties under module-finite extensions
This paper deals with certain classes of modules under module-finite extensions. Let $\varphi: R\hookrightarrow S$ be a module-finite extension between commutative Noetherian local rings. We investigate the transfer of Artinian module structures and attached primes between $R$ and $S$. We clarify the behavior of local cohomology modules as well as certain structures of finitely generated $S$-modules under the restriction of scalars to $R$ via $\varphi$. We show that $R$ is a quotient of a Cohen-Macaulay local ring if and only if so is $S$. As an application, we characterize the structure of Nagata's idealization. Using Macaulayfication of algebraic varieties and idealization, we give an example to illustrate the results.
Read the full abstract
Probability
Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection
In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.
Read the full abstract
Applied Physics
Janus Dipoles: Fundamentals, Realizations, and Emerging Applications
The Janus dipole - featuring orthogonally oriented electric and magnetic dipoles with a 90-degree phase difference - has emerged as a powerful paradigm for wave manipulation. Unlike traditional Huygens dipoles used for directional control, this unique configuration exhibits strongly asymmetric, face-selective near-field behavior while maintaining a quasi-isotropic far-field radiation pattern. These remarkable properties make the Janus dipole an essential platform for directional wave shaping, with wide-ranging applications in on-chip photonics, quantum interactions, and wireless power transfer. This review systematically traces the rapid development of the Janus dipole from its foundational theoretical inception to its diverse implementation platforms across optical, microwave, and acoustic frequencies. In this paper, we explore the governing principles, classify realization strategies into passive Janus dipoles, active Janus dipoles, and advanced near-field coupling control, and highlight emerging frontiers. By bridging foundational electrodynamics with advanced device engineering, this paper serves as an essential reference and roadmap for researchers designing next-generation, highly integrated, and compact wave-manipulation systems.
Read the full abstract
Human-Computer Interaction
ShellVis: Sandboxed Live Programming for Shell Scripts
Live programming provides visibility to programmers by running and tracing programs as they are edited. However, for programs with potentially harmful side effects, liveness can turn mistakes into disasters. We propose enabling live programming in environments with side effects via sandboxing: confining effects to a simulation of the true environment. We apply sandboxed live programming in the challenging context of shell scripting: a ubiquitous and powerful—yet notoriously opaque and error-prone—tool. ShellVis provides line-by-line feedback on a shell script's run-time behavior, with file operations sandboxed via a safe overlay of the file system. A qualitative user evaluation finds ShellVis to be helpful to participants, replacing tedious existing practices and instilling confidence. Participant responses also reveal areas for future research, particularly bridging the gulf of execution alongside the gulf of evaluation. ShellVis serves as a case study of how sandboxing can bring live-programming techniques into the many real-world programming contexts where side effects are important.