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

Friday 11 September

Combinatorics

The Reduced Smith Group of a Kneser Graph and Its Application to Group-Valued Magic Maps

For a finite abelian group $\Gamma$, a map $f\colon V(G)\to\Gamma$ is a $\Gamma$-magic map if the sum of its values over the neighbors of a vertex is independent of the vertex. It is affinely generating if its pairwise differences generate $\Gamma$. When $|\Gamma|=|V(G)|$, a bijective $\Gamma$-magic map is a $\Gamma$-distance magic labeling. For a regular graph $G$ with adjacency matrix $A$, write $\mathbf1$ for the all-ones vector indexed by $V(G)$, and let $\overline A$ denote the endomorphism induced by $A$ on $\Lambda_{\mathbf1}=\mathbb Z^{V(G)}/\mathbb Z\mathbf1$. When $\overline A$ is nonsingular over $\mathbb Q$, define the reduced Smith group by $\mathsf S_{\mathrm{red}}(G)=\operatorname{coker}\overline A$. In previous work, we established that for every regular graph $G$ of positive degree with $\overline A$ nonsingular over $\mathbb Q$, one has \[ G\text{ admits an affinely generating }\Gamma\text{-magic map} \quad\Longleftrightarrow\quad \Gamma\hookrightarrow\mathsf S_{\mathrm{red}}(G). \] We determine this group explicitly for Kneser graphs. If $r\ge1$, $n\ge2r$, and $m_j=\binom nj-\binom n{j-1}$, then \[ \mathsf S_{\mathrm{red}}(K(n,r))\cong \bigoplus_{j=1}^{r} \left(\mathbb Z/\binom{n-r-j}{r-j}\mathbb Z\right)^{m_j}. \] When the labeling group and the Kneser graph have the same order, the resulting embedding criterion leaves only one case in which an affinely generating map exists. More precisely, if $\Gamma$ is an abelian group of order $\binom nr$, then $K(n,r)$ admits an affinely generating $\Gamma$-magic map if and only if $(n,r)=(9,2)$ and $\Gamma\cong\mathbb Z/6\mathbb Z\oplus\mathbb Z/6\mathbb Z$. A weak-Sidon-set bound shows that the affinely generating maps in the exceptional case cannot be bijective. Hence $K(n,r)$ admits no $\Gamma$-distance magic labeling throughout the range $r\ge1$ and $n\ge2r$.
Read the full abstract

Econometrics

Moment Restrictions for Dyadic Network Formation Models with Nontransferable Utility

This paper investigates the construction of moment restrictions in dyadic network formation models with unobserved individual heterogeneity under nontransferable utility. Using observed links and covariates from five-node pentads, we construct moment restrictions that do not depend on individual fixed effects. For a broad class of covariate specifications, the construction is minimal in the sense that it uses the least possible number of nodes and dyads. Based on these moment restrictions, we propose the pentad-GMM estimator. We establish asymptotic normality of the pentad-GMM estimator in dense, sparse, and ultra-sparse network regimes, with regime-specific convergence rates and asymptotic variances. These results provide a basis for inference across all three regimes. To make our method computationally efficient, we develop an algorithm that reduces the computational cost of the estimator from naïve \(O(N^5)\) to \(O(N^3)\). We apply the proposed method to an academic-discussion network, and find academic homophily and a positive association between link formation and a potential partner's openness to different perspectives.
Read the full abstract

Computation and Language

Meddies-PII: A Multilingual Framework for Personally Identifiable Information Extraction in Clinical De-identification

Clinical de-identification relies on accurately identifying personally identifiable information (PII). However, manually annotated datasets are costly to construct, while existing synthetic alternatives often provide limited details about their generation process or rely on relatively simple synthesis strategies. We introduce Meddies-PII-Dataset, a corpus of one million synthetic clinical documents spanning seventeen languages and nine PII labels. The documents are generated using attribute-conditioned prompts and validated through thirteen deterministic gates that enforce structural and annotation consistency. To evaluate the dataset's utility, we train Meddies-PII-Model, a BIOES token classifier, and compare it with existing PII extraction systems using exact-match entity-level F1. Meddies-PII-Model achieves the highest performance among the evaluated systems on all reported benchmarks, with a mean F1 of 0.827 across fifteen external benchmarks, compared with 0.658 for the strongest baseline. Upon acceptance, we will publicly release the dataset, benchmark suite, model, generation framework, and evaluation code to support research on multilingual clinical de-identification.
Read the full abstract

All authors Linh Uyen Le, Ho Dinh Tri, Christian Hoang, Huy Hoang Ha

Theoretical Economics

Stable Improvement Cycle Mechanism Versus Efficiency-adjusted Deferred Acceptance Mechanism beyond Weak Priority Orders

This paper compares the stable improvement cycles (SIC) mechanism of Erdil and Ergin (2008) with the efficiency-adjusted deferred acceptance (EADA) mechanism of Kesten (2010) in school choice problems with incomplete priorities. When school priorities are strict partial orders, we show that the EADA mechanism produces a constrained efficient matching. Combined with earlier results for the SIC mechanism, this establishes the outcome equivalence of the two mechanisms: the sets of matchings attainable under them coincide. We then move beyond transitivity and consider acyclic priority relations. On this broader domain, neither mechanism is guaranteed to produce a constrained efficient matching, but their failures take opposite forms. The SIC mechanism may under-improve: its outcome is always stable but may be Pareto dominated by another stable matching. By contrast, the EADA mechanism may over-improve: its outcome is never Pareto dominated by any stable matching but may itself be unstable.
Read the full abstract

High Energy Physics (Phenomenology)

Leptogenesis Determined By Low Energy Parameters

We study thermal leptogenesis in three predictive type-I seesaw models in which the neutrino Dirac mass matrix is equal to the mass matrix of up-type quarks, or down-type quarks, or charged leptons. In this framework, the seesaw relation permits a full reconstruction of the heavy right-handed neutrino mass matrix from low-energy neutrino parameters, which greatly reduces the parameter freedom. A systematic numerical scan based on density matrix Boltzmann equations is performed to examine whether the observed baryon asymmetry of the Universe can be obtained. Successful leptogenesis occurs for normal ordering of light neutrino masses with nonzero Majorana phases. In this case, viable solutions are found in model B, associated with down-type quarks, and model C, associated with charged leptons. Both point to a close-mass pair of heavy neutrinos satisfying $|M_i-M_j|/M_i<10^{-3}$, while remaining outside the conventional quasi-degenerate resonant regime. Four representative benchmark points are selected to show the evolution of the asymmetry and the impact of different treatments of spectator effects. Neutrinoless double beta decay is further studied for all parameter points that can generate an acceptable baryon asymmetry $\eta_B = (6.12 \pm 0.20)\times 10^{-10}$. The predicted effective Majorana mass for certain cases can be probed by next generation experiments with sub-10 meV sensitivity, such as LEGEND-1000, nEXO, JUNO 50 tons, and CUPID-1T. This framework therefore provides clear targets for future searches.
Read the full abstract

All authors Xiao-Gang He, Zhong-Lv Huang, Raymond R. Volkas, Yu-Qi Xiao

Computation and Language

Agent as Policy for Robotic Manipulation

We demonstrate that a general-purpose agent can directly drive a physical robot throughout task execution without any task-specific or environment-specific training. We introduce Agent as Policy (AGP), which places task planning and execution under the agent's control. Given a task and a robot interface, the agent interprets visual evidence, writes executable programs, issues motion commands, and revises its actions in response to physical outcomes. This brings the agent's reasoning and programming capabilities into continuous interaction with the physical world. We study AGP across multiple real-world manipulation tasks spanning precision manipulation, dynamic motions, and deformable objects. These include assembly from human videos, block construction from goal images, dice flipping, targeted throwing, and bimanual towel folding. AGP achieves success rates of at least 80% in seven of eight task configurations and significantly outperforms previous agentic robot systems. We further study efficiency through task experience accumulation and find that reusing saved procedures and programs shortens execution time across repeated trials. These findings support a path for general-purpose agents to act as robot policies, extending their autonomy to physical manipulation through runtime reasoning, programming, and interaction.
Read the full abstract

All authors Mengzhao Jia, Yang Lin, Xixin Zhang, Zhihan Zhang, Xiaobai Liu, Meng Jiang

Combinatorics

An upper bound on the number of relevant variables in a bounded degree Boolean function on the Hamming graph

In this work, we prove that any Boolean function of degree $d$ on $\mathbb{Z}_{q}^n$, $q\geq 3$, has at most $m_qq^d$ relevant variables, where $m_q=\frac{2q(q^2+4q+1)}{(q-1)^4}$. For $q\in \{3,4,5,6,7\}$, we improve this bound to $2.854\cdot 3^d$, $1.749\cdot 4^d$, $1.263\cdot 5^d$, $0.994\cdot 6^d$, and $0.814\cdot 7^d$, respectively.
Read the full abstract

High Energy Astrophysical Phenomena

Spin-polarization of the neutron ocean in magnetar crusts

Magnetars, neutron stars harboring the strongest magnetic fields known in the Universe, are associated with a broad range of observational phenomena, from giant flares to fast radio bursts, and have also been proposed as potential sites of heavy-element nucleosynthesis. These phenomena are thought to be closely linked to the structure and composition of magnetar crusts. The outer crust consists of fully ionized nuclei embedded in a degenerate electron gas, while the inner crust additionally contains free neutrons. We investigate how strong magnetic fields modify magnetar crusts, accounting for the spin polarization of free neutrons. Arising from the coupling between the magnetic field and the neutron magnetic moment, neutron spin polarization lowers both the pressure and matter density marking the boundary between the outer and inner crusts for magnetic field strengths $B \gtrsim 10^{17}~\mathrm{G}$. As a consequence, the outer crust becomes thinner, the formation of the superheavy nuclei predicted in previous studies is suppressed, and the neutron ocean permeating the inner crust becomes spin-polarized. These effects may have important implications for the diverse manifestations of magnetars and for $r$-process nucleosynthesis in the ejecta of magnetar giant flares.
Read the full abstract

Statistical Mechanics

Efficient kinetic Monte Carlo simulations with long-range electrostatic interactions

Charge transport in solid-state materials is often governed by charge carrier hopping processes in the presence of long-range electrostatic interactions. Kinetic Monte Carlo (kMC) simulations provide a framework for describing such rare-event dynamics over extended timescales. However, the efficient treatment of long-range interactions remains a major computational challenge, since each particle jump modifies the energy landscape globally and, in principle, requires updating all transition rates after every carrier motion. We present an efficient and generally applicable update process for these transition rates in the presence of long-range electrostatic interactions. To illustrate the method, we study charge diffusion on a simple cubic host lattice under an external electric field. The transport behavior is investigated in high states of charge (SOC), and the influence of temperature, electric field strength, and SOC is examined. Our simulations show strongly suppressed transport at 100\,% SOC (50\,% occupation) caused by a freezing of the charge carriers into a Coulomb superlattice. Slight deviations from this reference in terms of charge carrier concentration lead to a rapid increase in conductivity. A deeper analysis reveals that this behavior can be rationalized as transport of non-interacting defects in the Coulomb superlattice. These results demonstrate the capability of the proposed update procedure to efficiently capture non-equilibrium transport phenomena in interacting charged systems and provide a foundation for simulations of more complex charge diffusion problems.
Read the full abstract

All authors Roya Ebrahimi Viand, Bat-Amgalan Bat-Erdene, Karsten Reuter, Sebastian Matera

Computation and Language

The House with a Million Windows: Interactive Fiction for Narrative Restorying

AI-assisted writing can flatten meaning in human storytelling, enabling the production of homogeneous outputs without the intentional effort and sense-making writing entails. To address this challenge, we present The House with a Million Windows (HWAMW), an LLM-based interactive fiction system designed to help users explore both the breadth and depth of potential meanings within their personal stories – drawing on a psychological paradigm called the restorying intervention. In HWAMW, users play through a text-based narrative in which they tell a story, then encounter a set of LLM-generated "windows" reframing it according to different literary styles. Empirical evidence shows that HWAMW increases users' sense of narrative identity, while an expert review explores how this effect is achieved. Our findings suggest that HWAMW facilitates restorying and offers a valuable paradigm for AI-assisted writing, wherein LLMs do not tell our stories but rather help us see greater potential in the stories we tell.
Read the full abstract

All authors Cody Kommers, Sarah G Immel, Drew Hemment, Mina Lee

Computational Engineering

When Is Inaction a Mistake? Continuation-Aware Auditing of PPO Trading Policies

An optimal reference may recommend trading when a learned policy chooses inaction, but the recommendation depends on information and future decisions. We introduce a four-stage audit for frozen proximal policy optimization policies without retraining. It examines deployment occupancy, matches current information, tests isolated deviations under incumbent continuation, and evaluates repeated deployment of observation-based alternatives. In controlled linear-Gaussian simulations, information matching explains part of the disagreement, while continuation changes its interpretation. At unit observation noise, incumbent continuation reverses 99.3% of projected-hard missed-advantage mass; repeated projected-rule deployment improves all 50 policies. These comparisons distinguish isolated action changes from policy replacement. Historical Bitcoin/Tether (BTCUSDT) replay applies this deployment perspective to a hand-specified intervention selected using 2024 data and frozen for 2025. Daily net reward improves by 135.03 basis points, with gains in 46 of 50 policies, primarily through lower turnover costs. The audit clarifies what oracle-flagged inaction implies for deployed decision making.
Read the full abstract

All authors Xingfei Zeng, Xin Zhong, Nanting Li, Ziyang Zhong, Lei Xiao, Guanghui Lu

Databases

QEmbed: A Deep Learning Based Cardinality Estimator for Efficient Query Processing

Cardinality estimation is at the core of any commercial database system for efficient query processing. Over the decades, non-learning-based estimation techniques (e.g., histogram-based, sampling-based) have been widely used in both commercial and open-source database platforms. However, these techniques are only effective when the number of columns in a table is small, as they cannot properly capture dependencies between multiple attributes. Recently, learning-based approaches have been shown to perform significantly better than the heuristic methods that have been used for the past three decades. Despite this success, existing learned models often struggle to balance memory efficiency and accuracy when dealing with datasets that mix high and low cardinality attributes. In this paper, we propose a deep learning model formally called QEmbed. Our model is built upon the Masked Autoencoder for Distribution Estimation (MADE) auto-regressive framework to learn joint data distributions for selectivity estimation. To improve data representation and overcome the limitations of using a single encoding method, we design a hybrid encoding scheme that combines one-hot and embedding encodings. This hybrid design enables QEmbed to retain fine-grained attribute information for smaller domains while capturing compact semantic patterns for large, sparse domains. We capture attribute correlations by factoring the joint data distribution into a series of conditional probabilities. This approach naturally accommodates both point and range queries. Through extensive experiments, we show that while QEmbed faces a latency trade-off on extremely wide schemas, it provides highly reliable cardinality estimates overall. A key advantage of our model is that it reduces extreme tail errors (maximum Q-errors), avoiding catastrophic estimation failures on complex, highly correlated workloads.
Read the full abstract

Optics

Autonomous multifunctional image processing via programmable multimode lasing

Optical image processing offers a promising pathway to overcome the latency and energy limitations of conventional electronic image processors. However, existing approaches based on passive photonic devices are often constrained by signal attenuation, lack of nonlinearity, fixed functionality, and heavy training overhead. Here, we introduce a programmable image processor based on a highly multimode degenerate cavity laser (DCL), shifting the computational framework from passive extracavity transformation to active intracavity evolution. By manipulating the intracavity loss distribution and exploiting the nonlinear lasing dynamics, we map computational tasks to the spontaneous mode selection within the DCL, realizing image processing directly at the source. We experimentally demonstrate that by simply altering the encoding scheme of input images, the platform can be flexibly reconfigured for multifunctional tasks, including high-fidelity edge detection and robust image denoising. The computation proceeds autonomously without dataset training, featuring an intrinsically low latency ($\sim$90 $\mu\mathrm{s}$) with $\mathcal{O}(1)$ complexity. Furthermore, the high intensity sustained within the resonator enables intracavity nonlinear upconversion of the processed image. This work extends the frontiers of laser applications, providing a compelling candidate for next-generation optical processors.
Read the full abstract

All authors Jiawei Wu, Yue Yin, Jianqi Hu, Hao Wang, Xing Fu, Qiang Liu

Computer Vision

Earth-Agent-Pro: Towards Real-World Full-Chain Earth Observation with Agents

Real-world Earth observation (EO) agents must translate high-level scientific questions into executable workflows to acquire observations, prepare data, perform domain computations, and derive conclusions from runtime evidence. Existing EO agents typically start from supplied observations, while benchmarks typically provide prepared inputs or candidate answers, leaving full-chain open-world EO execution largely untested. We present Earth-Agent-Pro, an execution-adaptive Plan-and-Execute framework using expert-authored skills to constrain planning and runtime tool use. Workflow-centered structured memory records planned steps, accepted evidence, and their dependencies, enabling repair of only the affected workflow suffix when runtime evidence invalidates a step. Separate large language model adapters use sequence-level supervised fine-tuning for planner workflow composition and node-level group relative policy optimization with locally verifiable rewards for executor tool-argument grounding. Earth-Bench-Pro instantiates 248 expert-curated task cores as 744 questions under three matched regimes. Its 248 Open-World Execution questions span RGB imagery, spectral observations, and remote sensing products, pairing high-level requests with runtime data requirements, executable trajectories, and open-ended answers grounded in execution evidence. With a shared GPT-5 backbone, Earth-Agent-Pro achieves 66.13% LLM-as-Judge accuracy, exceeding ReAct by 20.95 points in this metric and 24.44 points in Tools-In-Order. Joint adapter tuning raises Qwen3.5-9B LLM-as-Judge accuracy from 38.31% to 50.00%, an 11.69-point gain over the untuned configuration. Planning-only evaluation and execution with the reference workflow show that the adapters improve workflow composition and argument grounding, respectively. Code and datasets will be released soon.
Read the full abstract

All authors Zhutao Lv, Chenhao Dang, Yi Feng, Yanpei Gong, Xiaolei Wang, Junyan Ye, Conghui He, Weijia Li

Machine Learning

$\text{GSF-}\chi$: Global Stereochemical Fields for Chiral Graph Transformers

Enantiomers share atoms, bonds, and pairwise distances yet can behave differently in chiral environments, so molecular encoders must respect atom relabelings and proper rotations without becoming blind to reflection. We introduce GSF-$\chi$, a graph transformer in which stereogenic units modulate all pairwise interactions rather than single out one atom as special. Each central or axial stereogenic unit creates a reflection-even phase field over all atoms, a handedness pseudoscalar $\chi$ sets the direction of a relative rotation on latent query–key blocks, giving a Chiral-RoPE that reflection inverts rather than leaves fixed. A $C_2$ projection separates mirror-even ECD peak counts and positions from mirror-odd peak signs. We prove the operator's even–odd decomposition and its annotation-inversion, permutation, and unit-order identities under explicit canonical-role conditions; property tests and a coordinate-reflection audit verify the laws end to end. GSF-$\chi$ leads every central-ECD output and improves axial Rotation and Symbol by $12.6\%$ and $7.9\%$ over the strongest baseline. Equal-budget controls attribute the Rotation advantage to global signed support rather than parameter or edge count; the $C_2$ projection yields exact enantiomer-pair consistency at a small raw-accuracy cost under complete supervision and becomes predictive when mirror supervision is scarce.
Read the full abstract

Machine Learning

Temporal Recurrence Favors Fewer Layers

In streaming tasks, recurrent models can carry latent computation across time, allowing each update to build on representations produced earlier. This raises a basic question: once temporal recurrence provides sequential computation across steps, how much depth is still needed within each step? Prior work has shown that recurrence can make shallow models competitive. We instead study this question as a compute-allocation problem, varying within-step depth, expert width, and the number of parallel experts per layer across several compute budgets. For each budget, we compare the best observed recurrent and non-recurrent allocations and the performance they achieve under approximately matched per-step computation. Across Sokoban and autoregressive FineWeb language modeling, we find that temporal recurrence shifts the best observed compute allocation toward substantially fewer layers, with comparable or better performance.
Read the full abstract

All authors Ivan Anokhin, Johan Obando-Ceron, Irina Rish, Sebastian Risi

Robotics

Autonomous Precision Milling of Biological Structures via Generic Anatomical Priors and Active Boundary Perception

Autonomous precision milling of biological structures is challenged by incomplete knowledge of target geometry, local material thickness, and critical internal boundaries. Subject-specific preoperative models can address geometric and thickness variations, but static models cannot determine boundary status encountered during execution, while repeated target-specific imaging limits scalability. This article presents a state-adaptive autonomous milling framework that assigns complementary roles to generic anatomical priors and active boundary perception. A generic anatomical prior provides conservative global guidance and is transformed through semantic-guided registration and hybrid vision-force calibration into robot-executable guidance for individual targets. As milling approaches uncertain boundaries, the robot actively probes the remaining structure and uses relative stiffness changes to estimate boundary status and structural detachability. A state-adaptive controller governs transitions between active perception and spatially selective incremental refinement, repeating this cycle until the termination criterion is satisfied. Hierarchical experiments on biological surrogates and in vivo mouse cranial window creation demonstrate accurate anatomical prior transfer, reliable boundary adaptation, and autonomous precision milling of biological structures.
Read the full abstract

All authors Enduo Zhao, Xiaofeng Lin, Yifan Wang, Yuhan Song, Weihan Li, Saul Alexis Heredia Perez, Kanako Harada

Mesoscale and Nanoscale Physics

Efficient non-volatile electric control of magnetosensing in CrSBr

In two-dimensional crystals, electrostatic gating can modulate the charge carrier density, thereby tuning their electrical properties. In magnetic materials such as CrSBr, this approach can also enable direct electrical control of magnetoresistance. Non-volatile gating is particularly attractive since it allows the carrier density to be maintained at a desired level without the need for a continuous gate bias, offering significant advantages for technological applications. Here, we demonstrate a simple device architecture in which a solution-processed ferroelectric P(VDF-TrFE) layer is integrated directly onto a CrSBr channel, enabling non-volatile control of its magnetoresistance. We investigate the magnetotransport response over a broad temperature range and demonstrate a reproducible and robust gate dependence. Notably, the ferroelectric gate achieves a gating efficiency approximately one order of magnitude higher than that of a conventional SiO$_2$ dielectric, highlighting the potential of ferroelectric gating for electrical control of 2D magnetic materials.
Read the full abstract

All authors Bálint Fülöp, Yeonsu Jeong, Sofia Ferreira-Teixeira, Covadonga Álvarez-García, Tamás Prok, Xiaomin Guo, Endre Tóvári, Jong Hoon Jung, Luis Hueso, Paolo Samori, Marco Gobbi, Péter Makk, Szabolcs Csonka

Atmospheric and Oceanic Physics

Optimizing Geoengineering Interventions Using Differentiable Climate Models

The deployment of a geoengineering program to cool Earth's climate may be imminent. It is crucial that tools be developed to ensure that such a program would achieve its objectives while minimizing disruption. Here we exploit recently developed differentiable atmospheric models to demonstrate a novel geoengineering control strategy. In the differentiable primitive-equation atmospheric model JAX-GCM we impose a uniform $+4$\,K ocean warming and ask what pattern of sea-surface temperature cooling – in five ocean-masked zonal bands of prescribed SST forcings whose amplitudes are free – returns land near-surface air temperature closest to the model's own unwarmed climatology. This idealized set-up represents a cooling pattern that could be delivered physically either by marine cloud brightening or stratospheric aerosol injection. Gradients through chaotic dynamics decorrelate from the true sensitivity beyond the Lyapunov horizon, so we optimize greedily over segments of 8 to 14 days, following receding-horizon control. The learned strategy removes $92.3 \pm 0.4\%$ of the realized land warming across a ten-member ensemble of two-year rollouts, and a three-year run sustains it. If we use the spatial pattern of land temperature as the optimization objective, the distributions of precipitation, evaporation, and specific humidity over land are restored as well, even though they are not included in the objective function. The learned strategy from JAX-GCM replayed in the AI emulators LUCIE and NeuralGCM without re-optimization is successful, suggesting robustness. These promising results demonstrate a strategy for designing optimal climate interventions that can be applied broadly for geoengineering scenarios under consideration.
Read the full abstract

Quantum Physics

Extended Wigner's Friend Scenarios with Agent-like Observers on Quantum Computers

The Wigner's friend thought experiment raises the question of whether quantum theory can be applied consistently to systems that include observers. Extended Wigner's Friend Scenarios develop this question by considering several observers who may assign different descriptions to the same experiment. In the Local Friendliness (LF) framework, these scenarios lead to experimentally testable inequalities derived from assumptions such as Absoluteness of Observed Events and Local Agency. Motivated by the "Thoughtful" version of the Local Friendliness no-go theorem, which points towards future LF tests with human-level artificial agents implemented on quantum computers, this work implements the "friend" with explicit agent-like functionality within a reversible quantum circuit. Drawing from the literature on Artificial Intelligence, we construct rudimentary agent-like systems and embed them into a one-friend Extended Wigner's Friend Scenario. These agents store measurement outcomes, condition later operations on stored information, and, in the most structured case, use Born-rule probabilities to bet on the outcomes of their own future observations based on past observations. The circuits are simulated ideally and with an IBM-device noise model and executed on ibm_marrakesh. Ideal simulations reproduce the maximal quantum violation of a Local Friendliness inequality up to finite-shot fluctuations, while hardware runs show positive LF violations for all implemented agents. These results provide a first step towards more structured agent-like friend models in LF experiments on quantum computers.
Read the full abstract

Analysis of PDEs

Least energy sign-changing solutions for asymptotically cubic Kirchhoff equations on locally finite graphs

We obtain the existence results of least energy sign-changing solutions and ground state solutions for a class of asymptotically cubic Kirchhoff equations with Dirichlet boundary value on a locally finite graph $G=(V,E)$, and obtain the least energy of sign-changing solutions is strictly larger than twice of the ground state energy.
Read the full abstract

Differential Geometry

Spectral almost rigidity on Kähler manifolds with positive Ricci lower bound

In this work, a sharp Kähler spectral almost-rigidity theorem was established, resolving Conjecture 1.8 of Chu–Wang–Zhang. For compact Kähler manifolds satisfying $\Ric(\omega)\geq\omega$, pinching the first $n^2+3$ nonzero complex eigenvalues to one forces the manifolds to be Gromov Hausdorff close to normalized complex projective space and determines the biholomorphism type. The smaller index $n^2+1$ is the sharp threshold for noncollapsing. More generally, if a normalized measured limit has essential real dimension $r$, then the multiplicity of the critical eigenvalue is at most $r+\lfloor r/2\rfloor^2$, with equality attained in every dimension. A uniform energy estimate for kernel projections of complex gradient Gram matrices leads to a Lie algebra action on the whole spectral resolution.
Read the full abstract

Optimization and Control

Learning-Augmented Optimization for Strategic Two-Echelon Spare Parts Network Design

We study the strategic design of a two-echelon spare-parts inventory network where evaluating each candidate topology requires an expensive inventory optimization model. The design partitions hundreds of sites into feasible clusters and selects a central replenishment site for each cluster to reduce costs while maintaining service levels. Because the optimizer favors candidates with high predicted savings, it can exploit optimistic surrogate errors. We develop a conservative framework combining a graph neural network ensemble, variable neighborhood search, and set-partitioning recombination. The surrogate is trained on exact cluster evaluations, while a lower quantile of ensemble-predicted savings guides the search to limit optimism. Clusters found during the search are recombined through set partitioning using surrogate-based objective coefficients. The resulting network is evaluated with the exact inventory model, and only this evaluation is used to report performance. In a case study of 246 fulfillment centers in Amazon's North American network, the framework improves combined savings by 30.5% over an optimization baseline based entirely on exact cluster evaluations, while maintaining approximately 99.8% service across six independent replications. Under equal computational budgets, graph-surrogate-guided search achieves higher mean exact savings than a tabular alternative under both scoring schemes. Conservative scoring improves mean savings for both surrogate classes and reduces the share of final-network clusters overestimated by the graph surrogate from 68% to 28%. Predictive and ranking accuracy deteriorate among search-generated candidates with high surrogate scores, indicating that random holdout performance can incompletely characterize surrogate quality during optimization.
Read the full abstract

All authors Donato Maragno, Marco Caserta, Alberto Sinigaglia, Komlanvi Ametana, David Corredor Montenegro, Luca D'Angelo

Superconductivity

Universal transverse diode effects in superconducting unconventional magnet hybrids

We demonstrate that superconducting unconventional magnet junctions harbor transverse spin and charge diode effects with perfect rectification efficiencies. This nonreciprocal transverse transport is governed by the interplay of mirror reflections and spin rotation with respect to the Néel vector, a mechanism that is universally applicable to all unconventional magnets. Interestingly, the transverse spin diode features pure spin currents, while the charge diode yields spin-polarized charge currents, both exhibiting highly controllable rectification functionalities at vanishing net magnetization. Our results position superconducting unconventional magnets at the forefront of orthogonal engineering in next-generation transverse superconducting spintronics.
Read the full abstract

Algebraic Geometry

Crepant resolutions of fiber products and Kummer fibrations of rational elliptic surfaces with non-reduced fibers

Let $S_1$ and $S_2$ be rational elliptic surfaces with section over an algebraically closed field of characteristic zero, and let $X=S_1\times_{\mathbb{P}^1}S_2$. We determine the local equations produced by pairs of Kodaira fibers, including non-reduced fibers, and construct crepant resolutions for the admissible local models. For every construction we record whether it is projective and compute the number of irreducible components and the Euler characteristic of the resolved central fiber. Non-existence is asserted only in the normal Gorenstein cases covered by the terminal factorial obstruction; the remaining entries are stated as open for the methods of this paper. Under an explicit global compatibility hypothesis, the local data give formulas for the Hodge numbers of a smooth projective resolved fiber product. We also study Kummer quotients by fiberwise involutions. Their fixed curves are analyzed through the monodromy-orbit description of normalized fiber products of multisections. The final section records what the same constructions imply after reduction in characteristics $5$ and $7$, without interpreting characteristic-$p$ Euler and Picard data as complex Hodge numbers.
Read the full abstract

Computer Vision

Aligned Radiometric RGB-Thermal Fusion for UAV Facade Anomaly Screening

Unmanned aerial vehicle facade inspection can combine red, green, and blue (RGB) imagery with thermal measurements to screen surface and subsurface anomalies. However, geometric discrepancies between the sensors and thermal image rendering can obscure spatial correspondence and weak temperature contrasts. This article presents a sensor-level pipeline comprising per-sensor correction, RGB-to-thermal registration, common-support cropping, and signed local contrast encoding of 16-bit radiometric measurements. The encoding preserves the distinction between locally hotter and colder regions and supplies the fourth input channel of a compact single-stream detector. We introduce M3T, a dataset of 674 paired RGB and radiometric thermal samples from five facade-inspection projects covering eight component and anomaly categories. The median residual registration error is 3.384 pixels, and a controlled-displacement analysis characterizes how the local contrast response changes under controlled displacement. Project-grouped four-fold evaluation yields mean average precision of 0.168 over intersection-over-union thresholds from 0.5 to 0.95, using 28.50 billion floating-point operations per image. A separate single-split ablation shows improved delamination detection over RGB-only and alternative thermal inputs, although aggregate accuracy does not improve over RGB alone. Evaluation on RGBT-Tiny shows mixed performance with rendered thermal imagery. These results characterize the category-specific benefits and limitations of aligned radiometric contrast for compact facade screening.
Read the full abstract

Statistical Mechanics

Thermodynamic Speed Limits in Isolated Quantum Systems

We derive thermodynamic speed limits for isolated quantum systems undergoing finite-time unitary driving. The key ingredient is a set of generalized second-law inequalities: for the Gibbs entropy and for several thermodynamically motivated observational entropies, the entropy production is bounded from below by a function of the Vu–Saito quantum Wasserstein distance between the initial and final coarse-grained states. These inequalities yield lower bounds on the operation time in terms of the average entropy-production rate. We apply the framework to system–bath coarse-graining, local-energy coarse-graining, and diagonal entropy, and illustrate the resulting bounds with numerical and analytically solvable examples. Our results provide a thermodynamic characterization of finite-time state transformations in isolated quantum systems and clarify how coarse-grained entropy production constrains macroscopic reachability.
Read the full abstract

Combinatorics

B-coloring of $K_{2,t}$-free planar graphs

A B-coloring of a graph $G$ is a proper edge-coloring in which every $4$-cycle receives four distinct colors; let $q_B(G)$ be the minimum number of colors in such a coloring. Every graph of maximum degree $\Delta$ is $K_{2,\Delta+1}$-free; hence the known $2\Delta$ bound for planar graphs with $\Delta\ge38$ (Kong et al., 2026) motivates our study of $K_{2,t}$-free planar graphs, where $t\ge2$ is an integer. We prove $q_B(G)=\Delta(G)$ when $t=2$ and $\Delta(G)\ge7$, or when $t\ge3$ and $\Delta(G)\ge14(t-1)$. For $t\ge35$, the bound $q_B(G)\le\Delta(G)+t-1$ holds regardless of $\Delta(G)$; for every $t\ge2$, it also holds when $\Delta(G)>428$. Finally, for every integer $k\ge1$, every $k$-degenerate $K_{2,t}$-free graph satisfies $q_B(G)\le\Delta(G)+(k-1)\min\{t-1,\Delta(G)\}$, with equality for $K_{k,t-1}$ when $k\ge2$ and $t-1\ge k$.
Read the full abstract

Analysis of PDEs

Large-data modified wave operators for the defocusing nonlinear Schrödinger equation in one space dimension with subcritical long-range nonlinearity

We study long-time behavior of the solutions to the final state problem for the defocusing nonlinear Schrödinger equation (NLS) in one space dimension with the power nonlinearity $|u|^{2\sigma}u$ in the subcritical long-range regime $\frac{2}{\sqrt{7}}<\sigma<1$. Given a prescribed asymptotic profile in a weighted $L^2$-space, without size restriction, obtained by modifying the free solution with a nonlinear polynomial phase correction, we construct a unique global solution of the NLS that scatters to this profile, thereby proving the existence of modified wave operators. The proof relies on two new ingredients. Extending our previous work for the cubic case, we incorporate the leading part of the nonlinear term into the linear part as a linear potential by linearizing the NLS around the asymptotic profile and prove a global modified energy estimate for the linearized equation. We also exploit a specific structure of the nonlinearity arising from the linearization, which gives rise to a crucial cancellation when estimating the nonlinear terms in the modified energy space and enables us to control the polynomial growth of the nonlinear phase correction in the subcritical case.
Read the full abstract

Computer Vision

One Skill Does Not Fit All: Automatic Discovery and Taxonomy-Guided Routing of Frame-Selection Skills for Long-Video Question Answering

Long-Video Question Answering (LVQA) requires locating decisive evidence in hour-scale videos under a limited frame budget. Most training-free methods apply the same frame-selection strategy to all questions, despite substantial variation in the evidence required by different question types. Our analysis shows that the relative effectiveness of frame-selection strategies varies across semantic categories and benchmarks, motivating adaptive evidence acquisition. In this paper, we introduce AutoSkill, a source-supervised framework for automatically discovering and routing executable frame-selection skills. Starting from a small labelled source pool, LLM agents iteratively propose, implement, evaluate, and refine candidate skills. For a target benchmark, AutoSkill uses only unlabelled question and option text to induce a shared semantic taxonomy, rewrite labelled source examples into the target style, and estimate a category-to-skill mapping. Neither target videos nor target answers are used in this process. At inference time, each question is assigned one skill, which selects the frames used in a single inference of the frozen video MLLM. Across five long-video benchmark splits, AutoSkill improves Qwen2.5-VL-7B and Qwen3.5-4B by 2.4% and 1.2%, respectively, demonstrating the effectiveness of our AutoSkill.
Read the full abstract

All authors Jian Hu, Zixu Cheng, Da Li, Wei Li, Ziquan Liu, Shaogang Gong