Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Monday 14 September

Physics and Society

On-Demand Combinatorial Event Markets on Kalshi: Instantiation, Concentration, and Effective Market Breadth

Kalshi's multivariate-event architecture produces market objects on demand from exact selected legs. Across a registered seven-day interval, 190 independently validated temporal shards yield 7,611,594 unique REST MVE market tickers after excluding 5,777 boundary-overlap observations; the population was created at an average rate of 1.087 million objects per day, with strong hourly burstiness. The hierarchy is sharply compressed relative to the market-object count: 5,262,526 exact event keys, three collection keys, 83,701 selected-leg primitives, and 66,344,938 selected-leg occurrences. The largest collection accounts for 7,217,085 objects (94.82 percent), with an effective collection count of 1.11; the effective primitive count is approximately 720. REST and WebSocket are distinct observation surfaces: 1,487,330 created-notification tickers intersect the REST population in only 276,177 exact tickers. All three observed collection keys have current endpoint confirmation without establishing historical collection or rule versions. The exact structural signature yields 7,611,594 unique signatures with zero collision groups. At retrieval, 2,692,787 objects (35.38 percent) have positive cumulative volume or open interest; all observed 24-hour-volume values are zero and trade-count fields are unavailable. This is current-snapshot activity eligibility, not historical trading. The central result is that a very large on-demand market-object population is generated by a concentrated collection layer and reused primitive vocabulary; economic breadth must be measured at several hierarchical levels rather than by ticker count alone. Exact public endpoint evidence is available for 7,357,576 MVE objects, whereas only 126,806 have an exact determination-to-endpoint pair: terminal-state coverage and lifecycle-path coverage are distinct statistical objects.
Read the full abstract

Portfolio Management

Separated Signal Libraries: Packing, Saturation, and Joint Spectral Limits

We study libraries of cross-sectional signals: at each date, a forecast vector over $d$ assets intended to predict the next period's cross-sectional return. Demeaned and unit-normalized, a signal is a point on a sphere and its $T$-date history a point on a product of $T$ spheres. A pairwise correlation cap on histories is a minimum angular separation on that product, so growing a library under such a cap is a packing problem. If a large library is not too pairwise correlated and is equally weighted, does the equally weighted sum (EWS) tend to a known principal-component quantity as it grows? We answer this under explicit assumptions on how the library is filled. Separation alone guarantees nothing: it fixes no limiting distribution; a saturated library covers the sphere yet can carry a biased count; and near-maximum packing on a fixed domain forces uniform volume, which on the unrestricted sphere gives zero mean and no distinguished principal component (PC1). Alignment depends on the admission rule and candidate distribution. Under the uniform product-volume benchmark, screening on positive average information coefficient (IC) yields a nonzero, target-aligned mean but an isotropic second moment, whereas a positive IC margin $\beta$ makat every finite $T$, with athree-level spectrum whose leading eigenvalue tends to $\beta^2$ while residual levels decay as $1/T$; margins of order $T^{-1/2}$ keep a positive admission rate but a vanishing eigengA finite residual-spectrum criteS-PC1 alignment.Gilbert-Varshamov codes show separation permits both outcomes: exponentially large positive-IC libraries exist whose EWS is PC1, and others whose EWS is orthogonal to PC1. $\log J=o(T)$ suffices for uniform estimation among $J$ candidates from $T$ iid dates. Derived results are proved and checked numerically; no market data are used.
Read the full abstract

Theoretical Economics

Equilibrium Selection in Coordination Games with Planned Actions and Scouting

We study Stag Hunt games in which every action requires planning and preparation. Before players act, they observe noisy signals of their opponent's preparations and can revise their plans, which allows players to screen for cooperation. As screening becomes more precise and cheap, small trembles ensure that, in every equilibrium, play yields the payoff-dominant outcome with a probability that converges to one, even when the safe, low payoff equilibrium is risk dominant. Across scenarios, we emphasize that decomposing an action into (i) preparation and (ii) execution allows us to analyze simultaneous-move games in which players partially observe each other's contemporaneous actions.
Read the full abstract

Quantum Physics

Adaptive Record Consistency in a Schulman-Type Model

Adaptive measurements test whether a retrocausal model preserves observable records when experiments are connected by classical feedback. We establish exact and quantitative composition constraints for a finite-width, coplanar Schulman-type source with positive wrapped-Cauchy propagation weights. Raw segment composition admits an explicit adaptive signalling witness. A uniquely determined scalar correction preserves recorded continuations, and a detector with preparation memory implements this correction while retaining the source correlations. For common, independently prepared terminal detectors coupled to the source through arrival angles, exact calibration forces equal-mass antipodal atomic responses. Under setting-only raw feedback, the sharp minimum worst disturbance of an earlier record is $\epsilon_\star(0)=[2\cosh(2\Gamma)]^{-1}$, where $\Gamma$ is the total source-path width. We derive explicit finite-error bounds and prove linear small-error improvement. For four settings at $\Gamma=0.4$, a uniform reduction over arbitrary nonnegative response measures and a continuous polynomial certificate establish $\epsilon_\star(\delta)=\epsilon_\star(0)-C_{0.4}\delta+O(\delta^2)$, with $C_{0.4}\simeq9.351091771057010$. A positive five-atom detector attains this coefficient. The results quantify the compatibility of isolated-source accuracy and adaptive record preservation, and provide precise design conditions for retrocausal apparatus models with explicit preparation, memory, and control.
Read the full abstract

Neural and Evolutionary Computing

The Cost of Becoming: Developmental Encoding Increases Phenotypic Diversity but Reduces Locality and Recombination Robustness in Evolved Robots

Developmental encodings are often motivated by the expectation that a structured genotype-to-phenotype process can improve evolvability, robustness, and adaptation. Yet an encoding that expands phenotypic variation may simultaneously make useful parental structure harder to preserve under mutation and recombination. We test this trade-off in a controlled evolutionary-robotics benchmark comparing three matched representations: direct encoding, a static generative encoding, and a temporal zygotic developmental encoding. All three conditions use 34 genome parameters, 34 adult-controller parameters, identical initial genome matrices, the same optimizer, the same mutation and crossover operators, the same environments, and the same number of fitness evaluations. Across 30 paired evolutionary runs per representation, developmental encoding does not reliably exceed direct encoding in final training or out-of-distribution fitness. It does, however, substantially increase final population phenotypic diversity and mutant-reachable phenotype diversity. The same representation exhibits lower mutation viability, lower genotype–phenotype locality, sharply reduced crossover offspring fitness and viability, and increased recombination novelty. Continued developmental dynamics also attenuate damage applied early in development relative to otherwise identical late damage. These results identify a representation-level trade-off: development can enlarge the neighborhood of reachable phenotypes and provide within-development damage attenuation while degrading the local inheritance of already-adapted structure. We argue that developmental encodings should therefore be evaluated not by performance alone, but by a joint geometry of generativity, locality, robustness, and inheritance compatibility.
Read the full abstract

Solar and Stellar Astrophysics

Characterizing bright $\delta$ Scuti pulsators using TESS light curves:II. Pulsation amplitude and energy distributions

Pulsations in $\delta$ Scuti stars exhibit a wide range of excited frequencies and amplitudes, but the underlying principles governing their amplitude distribution remain unclear. We revisit this problem using a global, energy-based perspective. For a complete sample of 3200 bright $\delta$ Scuti stars observed by TESS, integrated power spectral density (PSD) of the Fourier spectrum allows us to measure the overall pulsation signal. From this, we derive a proxy for the total pulsation energy. We uncover a bimodality among higher-frequency delta Scuti stars in their integrated PSD, possibly suggesting the presence of two distinct pulsation regimes. In addition, we identify an apparent upper limit to the total pulsation energy, indicating a constrained energy budget for these pulsations. This feature is not evident when stars are characterized solely by their dominant mode amplitude.
Read the full abstract

All authors Prasad Mani, Timothy Bedding, Simon Murphy, Daniel Hey, Tom Love

Number Theory

Higher Schwarzians of Elliptic Double Covers and Eisenstein–Kronecker Functions

We determine the Aharonov invariants of order at least two of every elliptic double cover by evaluating its projective kernel. In orders at least three, the formula separates the invariant into a constant Eisenstein term and an Eisenstein–Kronecker function evaluated under multiplication by two. The formula determines the ramification principal parts, torsion specializations, and isogeny traces, including the correction from two-torsion in an isogeny kernel. It also realizes the same intrinsic de Rham tensor through every degree-two projection: in higher orders this is the image of an Eisenstein section, while order two gives the classical Weierstrass complement to the Hodge line. A separate differential calculation shows that the Bernoulli-normalized invariant of order $p-1$ reduces to the quotient of the $p$th and first iterates of the defining derivation. For an elliptic invariant derivation this quotient is the Hasse invariant, independently of the rational function on its separable locus. The universal double cover provides a global specialization, integral away from two-torsion, whose reduction extends regularly across that locus. Classical Eisenstein zero theorems and the supersingular divisor congruence then describe the exactness loci and their reduction.
Read the full abstract

Robotics

The Neverwhere Visual Parkour Benchmark Suite

State-of-the-art visual locomotion controllers are increasingly capable at handling complex visual environments, making evaluating their real-world performance before deployment increasingly difficult. This work intends to narrow this train/evaluation gap by developing a collection of hyper-photo-realistic, closed-loop evaluation environments - The Neverwhere Benchmark Suite - comprised of over sixty 3D Gaussian Splatting reconstructions of urban indoor and outdoor scenes. Our goal is to encourage large-scale and reproducible robot evaluation by making it easier to create and integrate Gaussian splats-based reconstructions into simulated continuous testing setups. We also underscore the potential pitfalls of relying exclusively on 3D Gaussian-generated data for training, by providing policy checkpoints trained over multiple Neverwhere scenes and their performance when evaluated in novel scenes. Our analysis illustrates the necessity of sourcing diverse data to ensure performance. Code and data are available on the project page: https://ziyc.github.io/neverwhere-bench/.
Read the full abstract

All authors Ziyu Chen, Henghui Bao, Haoran Chang, Alan Yu, Ran Choi, Kai McClennen, Gio Huh, Kevin Yang, Ri-Zhao Qiu, Yajvan Ravan, John J. Leonard, Xiaolong Wang, Phillip Isola, Ge Yang, Yue Wang

Analysis of PDEs

A Differential Algebraic Framework for Boundary Layer $\alpha$-Models

By addressing the problem of describing the differences between the saturation monoids of the Prandtl and Leray-$\alpha$ boundary layers, and algebraically distinguishing the action of the Helmholtz operator, we can show that, when the modification of the vector field is halted at a minimum scale determined by the differential filter, the paradox of constructing a solution that reaches infinite velocity in a finite time is avoided. Furthermore, it allows us to obtain the coefficients of the Taylor expansion near the wall for boundary layers where the Helmholtz operator has been applied.
Read the full abstract

All authors C. Valencia-Negrete, J. Flores, M. Perez, M. Romero de Terreros, M. Favela

Materials Science

Full Minimal Coupling All-Electron Real-Time TDDFT for X-Ray-Matter Interactions

Standard real-time time-dependent density functional theory (RT-TDDFT) couples light to matter through a spatially uniform (dipole) vector potential, an approximation that breaks down in the X-ray regime, where the photon wavelength approaches interatomic scales. We present an all-electron, numeric-atom-centered-orbital implementation of full minimal coupling in FHI-aims that retains the spatial structure of the vector potential in both the paramagnetic and diamagnetic couplings, implements a reciprocal-space-resolved current diagnostic, and extends the propagation to periodic systems through a perturbative photon-momentum sideband coupling that recovers the density response at the photon wavevector. Four benchmarks ranging in energy from 100 eV to 5 keV validate the implementation and exercise its reach. The retained photon momentum proves physically consequential throughout, from measurable beyond dipole corrections to the enabling of channels forbidden in the dipole limit. On an all-electron footing, the implementation lays the groundwork for a general ab initio treatment of X-ray light-matter interaction across molecules, surfaces, and solids.
Read the full abstract

All authors Daniel Schacher, Tod A. Pascal, Craig P. Schwartz, Keith V. Lawler

Machine Learning (Statistics)

Learned Look-Ahead Splitting Rule for CART

Classification and regression trees are typically constructed using a greedy splitting rule that maximizes the immediate reduction in prediction error at each node. Although this strategy is computationally efficient, it can miss splits that yield small short-term gains but create substantial downstream improvements after further partitioning. We propose a look-ahead tree-building method that evaluates each candidate split by the prediction error reduction achieved after growing a conventional CART subtree below that split. Because the full look-ahead procedure can be computationally expensive, we also describe a smart look-ahead algorithm that learns downstream split values using node-level features. The proposed framework preserves the interpretability of recursive partitioning while improving split selection in hierarchical or interaction-driven settings. We conduct a simulation study comparing conventional, full look-ahead, and smart look-ahead methods under several settings and apply the proposed methods to analyze two real data examples demonstrating the merit of the new methods.
Read the full abstract

All authors Andrew Gao, Tianlin Liu, Ruichen Han, Lu Tian

Metric Geometry

Strong laws, random monotone vector fields and gradient flows on metric spaces of nonpositive curvature

We establish a probabilistic Lie-Trotter-Kato formula for the gradient flow generated by an integral function over suitable separable Hadamard spaces. This result leverages Stojković's Lie-Trotter-Kato formula for gradient flows of sums of convex functions and Bačák's result relating resolvent and gradient flow convergence, along with a strong law of large numbers for normal convex integrands. For separable Hilbert spaces and locally compact Hadamard spaces, these strong laws follow from results of King and Wets and Artstein and Wets, respectively, but we crucially go beyond these examples by establishing a new such strong law for normal convex integrands on all Hadamard spaces whose tangent cones are isometric to Hilbert spaces, a class that includes non-Hilbertian, non-locally compact examples such as infinite-dimensional hyperbolic space. This new strong law arises as a combination of a strong law of large numbers for integrable random monotone vector fields on Hilbert-Hadamard spaces, that is, Hadamard spaces whose tangent cones all embed isometrically into Hilbert spaces, extending a result of Salim from Hilbert spaces, together with a new result on the interchangeability of the subdifferential and the integral, which we establish for $L^2$-Lipschitz integrands. This latter ingredient provides, to our knowledge, the first nonlinear version of (a particular case of) a previous result due variously to Ioffe and Tikhomirov, Levin, Hiriart-Urruty, Thibault as well as Rockafellar and Wets. On the way to this strong law for random monotone vector fields, we also establish a distribution-uniform generalization of Sturm's strong law of large numbers for inductive means of $L^1$-sequences of i.i.d. random variables on Hadamard spaces via a new effective non-asymptotic concentration inequality. Throughout the paper, we highlight various remaining open problems.
Read the full abstract

Strongly Correlated Electrons

Analytical solutions to the non-equilibrium Green's functions in large-$q$ SYK models

It is known that the Sachdev-Ye-Kitaev (SYK) model is exactly solvable at leading order in $1/q$; specifically, the instantaneously thermal time block after the quench is known in closed form. Thus far the remaining (inherently out of equilibrium) blocks have only been numerically accessible. Here we provide their analytical solutions for a quench between non-commuting $q/2$-body SYK Hamiltonians. We obtain the Green's functions in closed form for every time block. We extract a simple relation between the pre- and post-quench energies $\epsilon_1 \propto \epsilon_0$ leading to an exact temperature update rule. Via a Cauchy-Schwarz inequality, we show that heating is inevitable for the closed system; hence, the second law emerges geometrically. The solution is used in a companion paper to address what “instantaneous thermalization” means at finite $q$.
Read the full abstract

Robotics

XRoboToolKit-T: Teleoperation with High Stability and Precision with Tactile Sensing for Contact-rich Manipulation

Collecting high-quality robot data for contact-rich manipulation tasks is essential for enabling robots to acquire real-world skills. However, existing data collection solutions often lack the capability to obtain stable and high-frequency tactile feedback, limiting their effectiveness in contact-rich manipulation scenarios. In this work, we propose a versatile teleoperation system with tactile-driven assistance to enable high-frequency and stable contact-rich manipulation. The proposed XRoboToolKit-T teleoperation system incorporates a tactile-informed force control architecture, designed to ensure both stable and precise force control in contact-rich manipulation during teleoperation. The stabilizer haptic module rapidly analyzes the normal force distribution and infers pseudo shear force, enabling real-time tactile-based assistance during manipulation. The refiner haptic module integrates a vision-language-action model to predict and refine manipulation actions based on tactile sensing data and task descriptions. We apply the proposed teleoperation system to challenging contact-rich manipulation tasks, including grasping a deformable rubber pipette for liquid transfer and inserting a medical syringe into a vascular training pad, to demonstrate the effectiveness of tactile-informed force control. Furthermore, the system achieves higher data collection efficiency and improved manipulation stability compared to state-of-the-art teleoperation without tactile assistance.
Read the full abstract

All authors Xiwen Dengxiong, Xueting Wang, Ke Jing, Rui Li, Yunbo Zhang

Machine Learning

Interpreting and Steering LLM Agents for Social Simulations

Simulations based on large language models (LLMs) have proven to be powerful for understanding human behavior, making them valuable additions to the social scientific toolkit. However, LLMs are ultimately black boxes based on deep neural networks which limits their value for social science. This is because of a lack of (i) interpretability: i.e. the ability to assign clear mechanisms driving observed behavior; and a lack of (ii) steerability: i.e. the ability to mute or amplify specific theoretically meaningful mechanisms of action to drive specific model behavior. Here, we demonstrate how the black box could be opened up to further enrich LLM-based simulations. Specifically, we compare three types of methods: (1) prompt-based manipulation, (2) SAE-derived feature steering, and (3) probe-based direction steering and examine their utility for LLM-based social scientific simulations. We do so by interpreting and steering two foundational components of human behaviors, namely preferences (risk attitudes, altruism) and capabilities (divergent creativity, product innovation), operationalized using four classic economic and creative tasks implemented as natural-language interactions. Overall, our results show that SAE- and probe-based techniques often outperform basic prompt-based methods for steering LLM agents, although this advantage depends on the specific prompting strategy involved. Together, SAEs and probes constitute an effective pipeline for social scientists seeking to interpret and steer agents in social simulations: SAEs decompose agents' internal representations into human-readable features, after which probes can reliably shift agents' behaviors in specified directions. We discuss implications of these methods for future work using LLM agents for social scientific simulations.
Read the full abstract

All authors Jiayue Gaveal Fan, Arul Murugan, Shreyas Krishnan, Abhishek Nagaraj

Quantum Physics

Exact Work Characteristic Functions for Time-Dependent Bosonic Quadratic Hamiltonians

We derive an exact analytical expression for the characteristic function of work in closed many-body bosonic systems governed by general time-dependent quadratic Hamiltonians. This is made possible by adopting a unified prescription in which all operators appearing in the characteristic function are treated as elements of the inhomogeneous Metaplectic group. The esulting expression involves a single symplectic matrix, a single phase-space displacement, and a single accumulated phase. It holds for any number of degrees of freedom, arbitrary time dependence of the quadratic Hamiltonian, and any initial thermal equilibrium state of the system. The formalism trades the explicit time-ordering problem associated with the unitary evolution for the determination of a symplectic path in phase space, from which the corresponding driving Hamiltonian can be reconstructed. We also discuss the generalization to arbitrary nonequilibrium initial states within the two-projective-measurement scheme for quantum work. The same construction yields Loschmidt echoes and mixed-state total phases. Using the derived characteristic function, we obtain formulas for the Helmholtz free energy, the Jarzynski equality, the mean work, the work variance, and the nonequilibrium lag. Undisplaced Hamiltonians, sudden quenches, constant-Hessian protocols, and the adiabatic limit follow as special cases of the general result. As an illustration, we analyze a one-dimensional system constructed from an unconventional symplectic path and exhibiting physically relevant limiting cases. We then show how affine and purely symplectic contributions affect work statistics and irreversibility.
Read the full abstract

Geophysics

Adaptive and accuracy-aware multiple data assimilation in a three step framework

The ensemble smoother with multiple data assimilation (ES-MDA) is an algorithmic framework for the ensemble-based solution of inverse problems in reservoir engineering (and beyond). ES-MDA gradually transitions a prior ensemble to a posterior ensemble. The details of how this transition, or "multiple data assimilation," is implemented defines the accuracy and computational cost of ES-MDA. We show that many popular, adaptive variants of ES-MDA can be understood within a simple three-step framework: inflation proposal, pre-analysis revision, and post-analysis revision. The three steps interact to resolve a trade-off between accuracy (many assimilations with small updates) and efficiency (few assimilations with large updates), inherent to ES-MDA. We then present a new adaptive and accuracy-aware method, ES-MDA-A2, that combines large updates with a "catch-up" mechanism that decreases the update size allowing for additional assimilations if the accuracy is low. ES-MDA-A2 requires only two inputs: a targeted accuracy and a maximum number of data assimilations. We test existing and new ES-MDA variants in systematic numerical experiments with a toy model, two electromagnetic inversions with field data, and a subsurface flow reservoir simulation. We find that ES-MDA-A2 resolves the accuracy-efficiency trade-off differently from existing methods, leading to accurate inversions at a reasonable computational cost in all experiments.
Read the full abstract

All authors Kyle Ivey, Matthias Morzfeld, Chaoyi Wang, Christina Morency, Christopher S. Sherman, Robert Mellors, Joshua A. White

Cryptography and Security

Evaluating the NIST Bugs Framework Against CWE as a Successor for Automated Vulnerability Classification

Vulnerability classification based on root cause weaknesses is essential for numerous cybersecurity activities, where the Common Weakness Enumeration (CWE) serves as a public repository of such flaws. However, its overlapping entries create a non-orthogonal structure. The result is the same vulnerability being mapped to multiple weaknesses, complicating Root Cause Analysis (RCA) and triage. To address this, NIST Special Publication 800-231 introduces the Bugs Framework (BF), which organizes vulnerabilities into <cause, operation, consequence> triples and links such triples into a causal chain, so that a vulnerability carries its root cause and its sink together instead of a single terminal label. To date, however, BF has been specified but not evaluated regarding its performance against the challenges to automated classification. The evidence required for adoption has not been investigated empirically. We evaluate BF as a classification target and a complement to CWE using a systematically screened corpus of automated Common Vulnerabilities and Exposures (CVEs) linked to CWE research. We assess the reproducibility of CVE-to-BF classification through two evaluations. The first is qualitative: an anonymized inter-rater study in which 2 subject-matter experts (SMEs) independently mapped 13 CVEs onto the four BF axes. Annotators showed strong agreement on the cause and operation axes, while the attribute axis indicated fair agreement. We also tested our automated framework across two large language model (LLM) deployments under different budgets for reproducibility analysis. Despite limitations, such as evidence availability and the absence of retrievable fix commits for closed-source software, our findings support the claim that BF is a more structured and automation-friendly framework than CWE. Our exploration reveals specific gaps in BF, including under-specified guidance on attributes.
Read the full abstract

All authors Md Nazmul Hoque, Shaswata Mitra, Subash Neupane, Sudip Mittal, Shahram Rahimi

Human-Computer Interaction

A light-touch AI literacy intervention helps protect against AI political persuasion

Conversations with large language models (LLMs) can substantially shift beliefs and attitudes, raising concerns about manipulation using AI persuasion. Here we test whether a light-touch AI literacy intervention - a brief warning that LLMs can be prompted to persuade and may present information selectively - helps protect users. Across two experiments (total N = 3,208 Americans) in which participants conversed with an LLM instructed to shift their views about different political topics, the presence of a warning reduced belief change by roughly one-half (-48.1%, 95% CI [-59.5%, -36.8%]) relative to the control. Importantly, the warning did not significantly reduce trust in generative AI more broadly. Light-touch literacy interventions can help protect users against AI political persuasion.
Read the full abstract

Theoretical Economics

Feasible Search Behavior

Consider a situation wherein a decision maker sequentially searches for the best alternative among heterogeneous options with an arbitrary search order. The agent partially learns the value of an option when inspecting it. The information structure jointly determines the ex-ante and ex-post value of investigating each option, thereby shaping the entire learning path. We characterize the set of all search behaviors compatible with some information structure, which forms a polytope. A single information structure rationalizes all these search behaviors, which minimizes the agent's welfare among all information structures. Under certain symmetry assumption over primitives, we also examine the set of all feasible pairs of search and choice behaviors, with and without option sellers' price competition, and prove the same results. Our study not only provides a simple framework for analyzing how information shapes ordered learning paths, but also offers sharp insights into information design and identification problems in such environments.
Read the full abstract

Neurons and Cognition

Predictor Construction Can Reverse Multimodal Neural Contrasts

Foundation-model features are increasingly used to ask what information neural activity represents, often by comparing prediction gains between nested encoding models. We show that such multimodal contrasts can change sign when only the conditioning predictor is reconstructed. Using fMRI from the Natural Scenes Dataset, DINOv2 visual features, and MPNet embeddings of MS COCO captions and Localized Narratives, a caption-narrative contrast in the additional predictive contribution of vision favors narratives when one short caption is compared with a long narrative (+0.012/+0.015 in Places), but favors captions after approximate word-count matching (-0.031/-0.023). The shift occurs across every measured ROI in both subjects and is driven primarily by differences in language-only prediction. Comparable contrasts also survive removal of image-specific content-word identity in several ROIs. These results show that nested neural contrasts do not identify represented content by themselves: predictor construction is part of the experimental design, and matched controls are required for representational claims.
Read the full abstract

Neural and Evolutionary Computing

Scaled Hippocampus-inspired Neural Networks on Neuromorphic Memristive Hardware

The hippocampus, a key brain region for learning and memory, exhibits rich structural diversity, sparse communication, and robust dynamics with incredible energy efficiency. It offers promising insights for novel computing capabilities, particularly when co-designed with emerging hardware technologies. In this work, we draw inspiration from the rodent CA3 hippocampal subregion to develop the first spiking neural network with neuronal diversity and biologically-realistic resting state dynamics demonstrated on memristor hardware. We propose a network downscaling methodology utilizing a 4-prong objective function and demonstrate a small-scale CA3-inspired network with 179 Izhikevich-modeled neurons, 3 neuronal types and 17,996 synapses with similar resting-state dynamics as the orders-of-magnitude larger full-scale network. The small-scale network is mapped to an FPGA/memristor platform using a greedy algorithm and 18,316 memristors. Benefiting from memristor noise, the hardware implementation shows continuous periodic behavior, outperforming simulated hardware. This work showcases the potential of biologically-realistic algorithms on emerging hardware for neuromorphic computing.
Read the full abstract

All authors Joseph A. Kilgore, Jeffrey D. Kopsick, Zahin Ahmed, Giorgio A. Ascoli, Gina C. Adam

Operator Algebras

On Generators for $W^{*}$-bundles

We give an explicit example of a $W^{*}$-bundle $M$ over a compact, metrizable space $K$, which has each fiber $M_{p}$ a $\textrm{II}_{1}$-factor with separable predual, and which satisfies the following negation of the generator problem: given any finite family $a_{1},\cdots,a_{n}\in M$ of continuous sections, there is a $p\in K$ (depending upon that family) so that $a_{1,p},\cdots,a_{n,p}$ do not generate $M_{p}$ as a von Neumann algebra. More generally, if $N$ is a sub-bundle of $M$ with the property that each fiber is hyperfinite, or has a Cartan, or is generated by two commuting diffuse subalgebras, or has diffuse central sequence algebra, or is generated by a single sequential commutation orbit, then given any finite family $a_{1},\cdots,a_{n}\in M$ of continuous sections, there is a $p\in K$ (depending upon that family) so that $a_{1,p},\cdots,a_{n,p}$ together with $N_{p}$ do not generate $M_{p}$. We discuss implications for the generator problem for von Neumann algebras: e.g. there is no “continuous" way to take countably many generators for a tracial von Neumann algebra with separable predual and produce a single generator, at least if such a procedure works for all von Neumann algebras simultaneously.
Read the full abstract

Computation and Language

ReMova: Fine-tuning LLMs for English to Belarusian translation

This paper presents a Belarusian-specific data-cleaning pipeline and fine-tuning for English-Belarusian machine translation. Our cleaning pipeline distinguishes itself from others by employing a correction tool that addresses the issue of the two orthographies of the Belarusian language, noise in the training data, interference from other languages and other misspelling issues common in Belarusian on the internet. A matched ablation on unfiltered training data shows substantial benefits from filtering for all fine-tuned models, with the LLM-based models gaining roughly twice as much from filtering as the dedicated encoder-decoder MT system, supporting the view that for Belarusian MT one of the primary bottlenecks is data quality.
Read the full abstract

All authors Mikita Pilinka, Aliaksandr Kliujeŭ, David Samuel, Yves Scherrer

Classical Analysis and ODEs

Sharp bounds in Ionescu–Wainger multiplier theorem for canonical fractions

In this short note, we show that the loss of order $N^{c_p/\log\log N}$ in the version of the Ionescu–Wainger multiplier theorem for canonical fractions, recently established by Kosz, Mirek, Słomian, and Zhang in arXiv:2606.12663, is optimal.

High Energy Astrophysical Phenomena

Right Energy, Wrong Profile: Why the 43 GeV Cluster Line Is Unlikely to Be Dark Matter

A narrow gamma-ray line would be a distinctive signature of dark matter, but its interpretation depends as much on its spatial distribution as on its energy. We reanalyze the reported 43 GeV feature in Fermi-LAT observations of Virgo, Fornax, and Ophiuchus. The excess is reproduced in the same public data and survives event-type partitions, a test using data withheld from the original selection, and detector-coordinate permutation tests. Realistic hadronic and inverse-Compton emission is too broad to explain it. A spatial–spectral likelihood analysis restricted to Good Time Intervals and including diffuse backgrounds and catalogued sources finds a broad line-like component. Uniform surface brightness and substructure-enhanced annihilation are preferred, whereas smooth NFW annihilation and a central point source are unlikely explanations. An independent annular analysis agrees: the events associated with the excess extend through much of the virial region. Calibration over 20–70 GeV and five morphologies gives a conditional global significance of approximately $2.7\sigma$, peaking at 44.5 GeV for uniform brightness. This result is conditional on the preselected three-cluster sample. The broad morphology is the main obstacle to a dark-matter interpretation. Such an interpretation would require photons to be a leading annihilation channel, annihilation to remain efficient in cold subhalos, and subhalos to supply nearly all the cluster luminosity. Yet a boost consistent with $\Lambda$CDM drives the required two-photon cross section into the range most tightly constrained by Galactic-halo line limits. The most likely explanation is a chance fluctuation amplified by analysis and target-selection effects, possibly compounded by residual Galactic diffuse or unresolved-source mismodeling; if celestial, its morphology makes a simple dark-matter interpretation unlikely.
Read the full abstract

Computational Physics

Implicit Lagrangian Hydrodynamics with High-Order Finite Elements

We present an implicit time integration capability for high-order curvilinear finite element Lagrangian hydrodynamics. Starting from an existing explicit formulation, the implicit treatment builds directly on the original discretization and operator structure and does not alter the underlying spatial formulation or physics model. We demonstrate our implementation using the Laghos miniapp, which is built on the MFEM finite element library. To support gradient-based nonlinear solution methods, we compute Jacobian actions automatically using MFEM's $\partial$FEM interface together with Enzyme-based automatic differentiation, and apply the resulting Jacobian in a matrix-free or fully-assembled manner within a Newton-Krylov solver. To ensure robust and differentiable nonlinear solves in the presence of shocks, we introduce a smooth artificial viscosity treatment based on smooth approximations of non-differentiable pointwise operations. The differentiable artificial viscosity presently lacks a limiter to ensure high-order scaling away from shocks, but is sufficient for illustrating the benefits of implicit Lagrangian hydrodynamics. The behavior and performance of the implicit method are demonstrated on several standard benchmark problems. We verify high-order convergence on the smooth Taylor-Green vortex in the absence of artificial viscosity, show correct strong-shock behavior on the Sedov blast problem, and obtain significant improvements in accuracy-per-time-to-solution on the Triple Point problem where explicit stability constraints become increasingly severe for high-order discretizations.
Read the full abstract

All authors Julian Andrej, John Camier, Veselin Dobrev, Tzanio Kolev, Boyan Lazarov, Ketan Mittal, Robert Rieben, Brandon Talamini, Vladimir Z. Tomov

Cryptography and Security

No Bit Left Behind: Using Brute-Force Lifting to Achieve Fully Static Binary Recompilation

Binary recompilation is a technique for operating directly on executable code. It promises to automate two important tasks: retrofitting security mitigations onto legacy binaries, and migrating binaries across instruction set architectures (ISAs). Yet today, there is no fully automated system that can reliably lift arbitrary binary executables to a compiler intermediate representation (IR) such as LLVM IR, or that can fully statically and reliably translate non-trivial binary executables from one ISA to another. The main underlying problem is that recovering a program's control flow graph (CFG) statically is impossible in general: computed branches can jump to targets that cannot be determined without actually running the program. Existing systems resort to runtime fallback mechanisms, requiring a significant portion of the binary translation machinery to accompany the translated program on the target machine. This article presents a fully static, whole-program binary lifting system requiring no runtime translation support on the target. Rather than attempting to distinguish code from data, we treat every byte offset as a potential branch target and lift the entire binary in a brute-force manner, constructing a superset CFG that conservatively contains all feasible control flows. Statically unresolvable computed branches are thereby reduced to lookups in a dispatch table that points to the corresponding translated control flow path. We have implemented this approach as a prototype binary recompiler from x86-64 binaries to LLVM IR, requiring no code/data heuristics. We validate it with a fully static cross-compilation to AArch64, achieved by reusing existing LLVM backends with no modification.
Read the full abstract

All authors Tianjiao Huang, Po-An Chen, Nick Baron, Michael Franz

Instrumentation and Methods for Astrophysics

RAMA: A new agile AO bench for the telescope FEELINGS

The ground-based observation of extended objects such as satellites suffer from severe atmospheric propagation constraints. Specifically, high tracking velocities and low-elevation lines of sight generate non-stationary turbulence alongside strong scintillation. Developing robust wavefront control strategies is therefore critical to maintain stable observations. In this context, we present RAMA, an adaptive optics (AO) testbench deployed on ONERA's 60\,cm FEELINGS telescope. Designed as a pathfinder for future systems like the PROVIDENCE ground station, RAMA evaluates a visible, non-modulated Pyramid Wavefront Sensor (PWFS). The hardware baseline also includes two pupil-conjugated deformable mirrors (DM97 and DM192) driven by the DAO Real-Time Computer (RTC). Inheriting the modular and evolving philosophy of the PAPYRUS project, the bench provides a flexible environment to test new components on-sky and allows for direct comparisons between classical controllers and advanced, data-driven strategies. By implementing Convolutional Neural Networks (CNN) for phase reconstruction and Reinforcement Learning (RL) for loop control, RAMA aims to overcome the specific limitations associated with scintillation and extended-object observations. This paper details the opto-mechanical design, numerical simulations of the bench expected wavefont control performance, preliminary laboratory closed-loop results and the first on-sky optical coupling with the telescope.
Read the full abstract

All authors Matteo Pasinetti, Rodrigo Andres Munoz Gomez, Benjamin Andres Gonzalez Barraza, Francisco Oyarzun, Sylvain Cetre, Jean-François Sauvage, Axel Vincent-Randonnier, Julien Charton, Marie Laslandes, Roméo Roudeix, Nicolas Védrenne, Cyril Petit, Pierre-Louis Mayeur, Esteban Vera Rojas, Andrew Reeves, Perrine Lognoné, Morgan Gray, Thierry Fusco, Benoit Neichel

Astrophysics of Galaxies

CNN-Based Inference of Gaseous Halo Properties from Synthetic X-ray and 21-cm HI Observations

Quantifying the information content in multi-wavelength observations is critical for setting exposure times for upcoming X-ray and 21-cm HI radio surveys. We train convolutional neural networks (CNNs) on mock observations of halos from the IllustrisTNG100 and TNG300 simulations, combining data from soft X-ray channels from a CCD or a microcalorimeter with HI intensity, velocity, and dispersion maps, to infer halo mass, gas fractions, metallicity, and [O/Fe] abundance. Multi-band (X-ray and HI) combinations consistently outperform single-band inference for gas fractions. X-ray outperforms HI observations for measuring halo mass, but both bands contribute similarly when measuring the cool (T<10^5 K) gas fraction in halos with significant cool gas content. Using matched exposure times, a micro-calorimeter improves metallicity inference over the CCD by a factor of 1.75, enabling precise measurements of [O/Fe] alpha-enhancement for the largest halos. The larger volume of TNG300 allows inference of group halo masses, finding an inference RMSE of 0.04 dex with a 100 ksec X-ray exposure time. These results demonstrate how deep learning can evaluate strategies for developing instruments and designing surveys for these expensive observations targeting gaseous halos.
Read the full abstract

All authors Kalvyn N. Poncelet Adams, Benjamin D. Oppenheimer, Naomi Gluck, Caleb Ogle, Matthew Ho, Daisuke Nagai