Peer Revenue Now accepting positions

Papers

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

All of arXiv

Sunday 8 November

Computation and Language

The Average Patient: Do Simulated Psychiatric Patients Answer Like Real People?

Language models are used as simulated psychiatric patients to train clinicians and evaluate AI therapists, and are judged by plausibility or total scores. We give a framework for simulated respondents: an information budget bounds how much simulated patients can differ, and an average-patient hypothesis, that a model answers each item at the level typical of the named condition and severity, implies little variation, a full profile of the condition's typical symptoms and totals at or above the top of the stated severity band. We examine these implications at matched totals on item-level data from eight human samples, including a clinical and an instructed-feigning sample. Across 17 models, simulated patients vary 1.5 to 11 times less than real respondents with the same total and on most questionnaires endorse nearly every symptom at a middling level; on the PHQ-9 their symptoms covary less like real ones. People, honest or feigning, answer "not at all" about as often as genuine patients with the same totals, and more often than every model. Single answers are highly concentrated, and prompt changes, published personas, larger models and reasoning reduce the pattern without removing it. In interviews, patients told a severity are rated as having nearly every symptom, so an assessment agent's recognition of absent symptoms goes untested, and scored against the stated severity the agent places a quarter of them in their band, against about half of patients given a real symptom profile. Having the model word such a profile restores half to two thirds of the variation.
Read the full abstract

All authors Weixiang Sun, Zehong Wang, Kaiwen Shi, Hong Huang, Colby Nelson, Yiyang Li, Yanfang Ye

Computer Vision

SurfScaff3D: Bridging Geometric and Semantic Representations for LLM-based 3D Object Generation

Creating high-quality 3D content has traditionally required specialist expertise and experience with complex tools. The growing ecosystem of AI-assisted creativity demands accessible and intuitive 3D generation systems. Recent advances in Large Language Models (LLMs) offer promising directions, yet extending their generative capabilities to 3D remains fundamentally challenging because existing 3D representations are not naturally compatible with language-based reasoning. Current approaches either depend on expensive fine-tuning or impose restrictive structural priors that sacrifice expressiveness and exclude organic shapes. We argue that the mismatch between LLM-native reasoning and conventional 3D parameterizations is a core bottleneck of LLM-driven 3D generation. To address this, we introduce the Hierarchical Patch Scaffold (HPS), a representation designed around semantically meaningful, interpretable part-level abstractions that are naturally understood by both humans and LLMs, enabling expressive, editable, and open-domain 3D generation without imposing restrictive geometric priors or expensive fine-tuning. Building upon HPS, we introduce SurfScaff3D, an interactive framework for text and image-to-3D generation. HPS inherits the flexibility of B-spline patches, while exposing an interface that leverages open-world capabilities of foundation models to reliably generate 3D. Its hierarchical part-level semantic labels enable targeted, natural-language edits at any level of granularity without re-running generation. Further, HPS offers explicit per-patch control over surface detail, enabling more expressive geometry capable of representing arbitrary objects. Extensive experiments against state-of-the-art LLM-based 3D generation methods demonstrate strong geometric fidelity, semantic alignment, and flexible editing across diverse object categories.
Read the full abstract

All authors Anay Loya, Rishi Gupta, Arnav Samal, Anirban Chakraborty

Group Theory

The cohomology of finite simple groups is unbounded

In every fixed positive degree, we show that the cohomology of finite simple groups, algebraic groups and quantum groups, with coefficients in simple modules, can have arbitrarily large dimension. In particular, we disprove Guralnick's conjecture.
Read the full abstract

All authors Chris Bowman, Damian de la Fuente, Nicolas Libedinsky, David Plaza

Statistical Methodology

ATHOS: Agreement-based Testing of Hypotheses in Overlapping Subgroups

We study confirmation of treatment benefit in a prespecified family of overlapping subgroups of a randomized trial. Maximum-statistic procedures exploit the correlation between subgroups' statistics, but calibration decides what they protect. Re-randomization controls error exactly when treatment has no effect, but not when only an average effect is zero, whereas a multiplier bootstrap protects average effects only asymptotically. Our first result characterizes when re-randomization alone protects average effects. It reverses the arms' weights in the statistics' covariance, so with unequal allocation and heterogeneous effects it can overstate their correlations; in one such family of 50 subgroups, its limiting familywise error is 0.064 at nominal 0.025. We propose a step-down procedure called ATHOS, short for agreement-based testing of hypotheses in overlapping subgroups, which confirms a subgroup only when both calibrations reject it. Given assignments exchangeable within strata, ATHOS controls familywise error exactly when treatment has no effect and, under complete randomization, asymptotically for average effects, even in large families. Our second result shows that requiring agreement costs no first-order local power in balanced trials. In a null simulation with 200 patients and 1,497 subgroups, the bootstrap step-down alone made false claims in 40% of trials and ATHOS in 2.6%. In two comparisons in an HIV trial, ATHOS confirmed 188 and 73 subgroups and Holm's procedure 179 and 62.
Read the full abstract

Machine Learning (Statistics)

Query- and Candidate-Aware Long User Sequence Modeling for Sponsored Product Ranking in Search

User sequence modeling is widely used in recommendation and advertising. Search ranking presents an additional challenge: the current query expresses immediate intent, while a candidate product determines which parts of a user's long-term history are relevant. We present a production sequence framework for sponsored-product ranking that augments recent behavior with two retrieval channels over long-term history: candidate-nearest-neighbor retrieval and query-nearest-neighbor retrieval. The selected actions are encoded together with dedicated query and candidate context tokens, while candidate-aware early fusion injects the candidate into every history token. Offline ablations show that dual retrieval improves major ranking metrics relative to the production baseline. In an online A/B test on sponsored-product search traffic, the model increased CTR, attributed conversion rate, and orders per impression.
Read the full abstract

All authors Dongyue Xie, Sergey Kolbin, Manavender Malgireddy, Iurii Shcherbak, Weixing Tang, Arushi Jain, Wanchen Shao, Kurt Zimmer, Raja Hafiz Affandi, Matt Lindsay

Robotics

Brain-Aligned Latent Actions: Imposing Premotor Cortex Geometry on a Robot's Action Vocabulary

Robot policies increasingly act through a small vocabulary of discrete latent actions learned from unlabeled video, yet training leaves open which motion receives which code. We find this choice highly unstable: two independently trained runs of Moto's latent motion tokenizer assign the same robot clips to nearly unrelated codes (adjusted Rand index 0.001), and evaluating one tokenizer in bf16 instead of fp32 reassigns 74% of its tokens. We use this freedom to impose the representational geometry of macaque ventral premotor cortex (PMv), recorded while a monkey drew shapes, on the tokenizer's code assignment, with a straight-through similarity loss trained alongside its reconstruction objective on robot video. In one training run per target, on five shape categories the loss never saw, the PMv-trained tokenizer reaches a representational similarity of 0.52 with PMv, against 0.20-0.26 for released and no-prior tokenizers and 0.42 for the 95th percentile of random kinematic encoders. Kinematic, language, and random targets do not transfer (-0.17 to -0.03). Two results limit the claim: a hand-picked kinematic descriptor, the stroke's initial direction, matches PMv better (0.65), and a label-shuffled PMv control scores 0.41. We specify the downstream manipulation test, on a CALVIN pipeline that reproduces Moto's published results, before running it.
Read the full abstract

Computers and Society

Known Good, Known Bad: A Ground-Truth Calibration Protocol for AI Judgment in Science

Scientific use of generative AI requires evaluation against cases with independently checkable answers. We present a ground truth calibration protocol that compares a verified reference case with reference deviant variants through neutral evaluation, an authority framed recheck, and a line by line audit. Human adjudication distinguishes deviation detection, premise accommodation, unsupported doubt, and correctness of the resulting calculation. An instructor generated organic chemistry demonstration comprises six conversations and 18 responses from an unidentified backend served through the free logged out ChatGPT interface in July 2026. Neutral evaluation detected three of five intended deviations. Both initial misses, involving oxidant stoichiometry and experimental scale, were detected at the authority framed second turn; all five detections persisted at the third turn audit. The fixed sequence supports a descriptive account of recovery across turns. In the scale case, the model initially produced a locally coherent peroxide limited yield. After recognizing the unit problem, it incorrectly retained that limiting reagent conclusion for the corrected scale. Detection and numerical repair therefore require separate assessment. The verified reference attracted speculative concerns while retaining its correct yield calculation. The protocol connects documentary verification of scientific claims and citations with empirical verification of laboratory interpretations. It supplies inspectable transcripts, reference calculations, behavior codes, and a reusable calibration architecture for AI literacy instruction. The pilot demonstrates the protocol's measures in one case family; replicated model evaluation and learner assessment are the next validation steps.
Read the full abstract

Quantum Algebra

Pointed Hopf Algebras from Pale Braidings in Characteristic 2

We determine Nichols algebras associated with several families of pale braidings over an algebraically closed field of characteristic $2$. For the rank-$4$ families under consideration, we obtain presentations by generators and relations, explicit monomial bases and dimension formulas. We also study families of arbitrary rank consisting of a two-dimensional pale block and several points, including cases with both vanishing and nonvanishing interaction parameters. Realizations as Yetter–Drinfeld modules over suitable finite abelian groups yield finite-dimensional pointed Hopf algebras by bosonization.
Read the full abstract

General Topology

Universal and Reciprocating Domains in Classes of Continua and Beyond

We introduce and study the notions of reciprocating domains in classes of topological spaces. A reciprocating domain is a member of a class that maps onto every member which maps onto it. We provide general characterizations, showing in particular that in upward directed classes reciprocating domains coincide with universal domains. We investigate these domains in several classes of compact metrizable spaces and continua. We also construct a chainable universal domain admitting a continuous monotone surjection onto a pseudoarc although every nondegenerate subcontinuum of the domain contains an arc. In particular, a chainable reciprocating domain need not contain a pseudoarc.
Read the full abstract

All authors Iztok Banič, Goran Erceg, Judy Kennedy, Chris Mouron, Van Nall

Mathematical Physics

Projective symmetries and differential recursions for the large-$N$ Gross–Witten–Wadia and one-dimensional QCD matrix models

We compare the fixed-charge planar Gross–Witten–Wadia (GWW) model with source-free one-dimensional QCD at large $N$ and $N_f/N$ fixed. In both models the resolvent and one-cut condition give an algebraic equation for a derivative of the free energy: a quartic for GWW and a sextic for QCD. Finite-$N$ Toeplitz determinants independently check the selected QCD branch. Signed permutations of homogeneous parameter triples realize $S_4$; the resulting action on the algebraic branches and operator labels gives a common projective description of the two models. For QCD, the sextic yields a differential recurrence linking small-charge rows two apart. The same second-order PDE gives a finite-width column recursion that reconstructs the coefficient pyramid from its GWW boundary. A distinct boundary, obtained from the first resummed coefficient, is the Narayana triangle. A formally collapsed slice counts decorated bipartite plane trees and admits an exact symmetric product formula. The many-flavor scaling reduces the sextic to the quartic and retains transverse projective data: the QCD divided-difference triple coalesces at this boundary, whereas the limiting quartic satisfies the full standard GWW third-order system. We distinguish algebraic degree, mixed differential order, and fixed-parameter ordinary differential order throughout.
Read the full abstract

Physics and Society

Toward Self-Evolving Geospatial Algorithms: An LLM-Driven Framework with a Case Study on Spatial Regime Discovery

Geospatial algorithms have been developed through expert-driven discovery: a researcher spots a limitation, proposes a structural fix, and checks it by hand. With LLM-driven multi-agent systems becoming practical, much of the candidate-generation, evaluation, and selection work can now be largely automated, while the researcher's role shifts upstream toward problem formulation, evaluation design, and interpretation. We refer to this paradigm as Self-Evolving Geospatial Algorithms (SEGA) and propose a framework with three required modules: a two-loop architecture with embedded geographic knowledge as the inner-loop engine; an automatic code formatter that converts any raw geospatial algorithm into the standardized triple required by the inner loop; and a simulation-driven training protocol, in which evolution runs only on synthetic data with known ground truth, and the discovered algorithm is applied unchanged to real data, keeping real-world results out-of-sample. We use spatial regime discovery as a case study, seeded with the Two-stage K-Models algorithm. Evolution uses the Rand Index against the ground-truth partition as fitness signal; the frozen algorithm is then evaluated on 150 simulated grids and 11 real-world datasets across climate, health, hydrology, and politics. The evolved algorithm outperforms its seed, knowledge-free baselines, and four classical regionalization methods. Ablations further indicate that the channel of geographic-knowledge injection, structured retrieval versus prompt-level hints, is itself load-bearing. In this case study, LLM-assisted search sped up the inner loop; whether it does so for other seeds and task families remains open. The geographer's role – asking the right questions, designing trustworthy evaluation – grows more central.
Read the full abstract

Numerical Analysis

Optimal adaptive finite element methods in $W^{1,p}$

We prove linear convergence and algebraic rate optimality of an adaptive finite element method for the Dirichlet Poisson problem in W1p. We assume well-posedness of the continuous problem and discrete inf-sup stability over the refinement family. We verify both hypotheses when p is sufficiently close to 2, without requiring convexity of the domain. The Galerkin equations remain unchanged, while the residual estimator and Dörfler marking use the target exponent p. Linear convergence holds for every fixed marking fraction between zero and one. For sufficiently small marking fractions and marked sets of nearly minimal cardinality, the method attains the best algebraic rates for W1p approximation together with data oscillation. The main ingredient is a Banach-space extension of Feischl's relaxed quasi-orthogonality, proved under discrete inf-sup stability.
Read the full abstract

Statistical Methodology

Nonasymptotic causal structure learning in generalized linear DAGs with continuous optimization

We study the problem of learning directed acyclic graphs from observational data in nonlinear models and provide finite-sample, nonasymptotic statistical guarantees in these models. Although widely studied, statistical guarantees for gradient-based methods in nonlinear models are missing from the literature. Under a generalized linear model for each node, we analyze a global nonsmooth objective combining an exact acyclicity constraint with a quasi-minimax concave penalty, which can be optimized via standard gradient-based solvers. We establish finite-sample guarantees under this model, including the most widely used logistic and Poisson models. Experiments corroborate structure recovery accuracy and computational performance, including both standardized data and negative controls as baselines.
Read the full abstract

Differential Geometry

Collapsing flat manifolds with totally geodesic boundary

We study volume collapse of compact connected flat manifolds with nonempty totally geodesic boundary and uniformly bounded diameter. We prove subsequential Gromov–Hausdorff convergence to compact flat orbifolds, allowing reflector loci, and describe the limit using the canonical involutions of the doubles. We distinguish the cases in which the maximal distance to the boundary tends to zero or to a positive limit, and classify all possible limits in dimension three.
Read the full abstract

Robotics

HINT-VLM: Humanoid Interactive Navigation over Rough Terrain with Embodiment-Grounded Vision-Language Model

Humanoid robots have achieved significant progress in locomotion and manipulation, enabling traversal over rough terrain and richer interaction with the environment, such as moving obstacles. However, most traditional navigation methods assume non-interactive environments and focus only on traversal. While Navigation Among Movable Obstacles (NAMO) approaches relax this assumption, prior efforts have largely focused on flat environments and reactive interaction, rather than predicting object movability and planning ahead. These limitations become critical in outdoor rough-terrain scenarios, where robots must jointly reason about terrain traversability and object movability. In this work, we address NAMO for humanoid robots in cluttered outdoor rough terrain by proposing a hybrid planning framework that combines semantic priors from a Vision-Language Model (VLM) with embodied robot interaction data through a Gaussian process (GP) residual model. The GP corrects the VLM-derived movability prior to produce embodiment-grounded probabilistic movability estimates, which are then incorporated into hierarchical uncertainty-aware planning. The proposed approach allows humanoids to jointly leverage locomotion and manipulation for efficient and safe navigation, representing the first solution to NAMO in rough terrain through predictive movability reasoning and probabilistic VLM integration.
Read the full abstract

All authors Ziwon Yoon, Seok Hwan Kim, Yiyu Chen, Quan Nguyen, Lu Gan, Ye Zhao

Solar and Stellar Astrophysics

A Census of Novae in the Small Magellanic Cloud, 1897-2026

A census of nova candidates in the Small Magellanic Cloud (SMC) is presented. Twenty-six optical transients have been reported as novae or nova-like eruptions from the discovery of HV 849 in 1897 through 2026 October. Twenty-three are probable classical novae. Two, MAXI J0158$-$744 and CXOU J005245.0$-$722844, are very fast, super-Eddington eruptions that have been interpreted as novae on white dwarfs with Be-star companions, while a third, SMCN 2002-10a, is a possible Be+WD event identified only from its quiescent counterpart. Four additional Be+WD candidates that have been detected only in X-rays are briefly discussed.
Read the full abstract

Social and Information Networks

The AI research space shapes country academic performance

Recent advances in Artificial Intelligence (AI) have demonstrated great potential across diverse domains, prompting increasing attention to understanding the AI ecosystem. As knowledge production is often perceived as a process of connecting existing pieces of knowledge, mapping the interconnections of AI knowledge is crucial for unraveling the dynamics of scientific production in AI. However, maps created so far have fallen short of capturing knowledge relatedness, focusing instead on citation relationships between subfields. Here, we build an AI research space by connecting pairs of AI research topics based on their proximity measured through author-topic coupling. Projections of country level performances onto the space reveal that countries exhibit distinct baskets of specializations. We further examine the role of the structure of the AI research space in the scientific development of nations. We find that countries are more likely to gain specialization in topics that have high proximity to already specialized neighbor topics, and that publications whose topics align more with the developed topics in the country are more likely to become high impact. Our results highlight the AI development gaps across nations and the path-dependence in the development induced by the AI research space.
Read the full abstract

Robotics

Enhancing Balance and Posture in Material Handling Tasks with a Wearable Robotic Tail

Frequent heavy lifting is linked to musculoskeletal strain, with lower back pain affecting up to 40% of manual labourers. Inspired by animals using tails for balance, we developed a wearable robotic tail as a dynamic counterbalance. Ten participants performed an imitated shelf loading/unloading task across three conditions: active tail, passive tail, and no tail. Kinematics, centre of pressure, and muscle activation (gastrocnemius, erector spinae, tibialis anterior, biceps brachii) were measured. Compared with no tail, the active tail achieved >20 mm reduction in centre of pressure peak displacement, 4.3 degree reduction in trunk motion, and >9% and >20% reductions in erector spinae and gastrocnemius activity, respectively. The passive tail produced smaller reductions, suggesting passive counterbalancing helps while active movement augments it further. Biceps brachii activation increased with the active versus passive tail. The ankle kinematics and tibialis anterior activation were unchanged. These findings support wearable robotic tails for improving balance during material handling.
Read the full abstract

All authors Eisa Anwar, Sajeeva Abeywardena, Stuart C. Miller, Ildar Farkhatdinov

Analysis of PDEs

Local well-posedness for viscous heat-conducting fluids with discontinuous densities

In this paper, we consider the Navier-Stokes-Fourier system in space dimension $d\geq2$. We prove local well-posedness of solutions having density only in $L^p\cap L^\infty$, for suitable $p\in\,]1,+\infty[\,$, with no further regularity requirements. In particular, our result yields existence and uniqueness of solutions in the case of discontinuous densities presenting a jump across a smooth interface. The existence proof is based on the use of the Hoff effective viscous flux and on a combination of both maximal regularity and Chemin's striated regularity arguments. Uniqueness, under the assumption of slightly more regular initial velocity fields and temperatures, relies on a Lagrangian approach, supplemented with an original bootstrap argument which shows improved time integrability properties of the solution.
Read the full abstract

Symplectic Geometry

On sinks and mirrors

Given a full rank sink recurrent cluster $\mathcal{A}$ variety, we prove that its wrapped Fukaya category is equivalent to the category of coherent sheaves on a stacky elaboration of the dual Fock-Goncharov cluster $\mathcal{X}$ variety. In particular, braid varieties for a semisimple group are mirror to the braid varieties for the Langlands dual group. Another example: for compact surfaces with no interior marked points, a least one marked point on each boundary component, and at least two marked points in total, the Fock-Goncharov moduli for SL(2) and PGL(2) are homologically mirror. The results were obtained in communion with ChatGPT Astra.
Read the full abstract

Artificial Intelligence

RADE: Risk-Adjusted Deployment Efficiency, A Framework for Routing, Memory, and Escalation in Safe LLM Systems

A deployed language model does not merely answer questions. It spends computation, consumes time, consults evidence, exposes memory, invites or avoids human review, and sometimes makes mistakes whose consequences are radically unequal. Yet LLM systems are still commonly compared as if the relevant object were a single model and the relevant outcome were a single benchmark score. This paper argues that the unit of analysis should instead be the deployment policy: the mechanism that decides when to retrieve, when to remember, when to call a larger model, when to verify, and when not to answer at all. We introduce risk-adjusted deployment efficiency (RADE), a system-level objective that scores the utility a deployment delivers net of inference, retry, oversight, and priced expected failure cost, while treating harms that cannot be priced as hard budgets alongside constraints on latency, privacy, and resources. The framework brings selective routing, retrieval and governed memory, efficient specialization, uncertainty estimation, abstention, and human escalation into a common account. We then examine five deployment regimes in which the same nominal LLM capability leads to different rational architectures, and propose a reporting protocol based on risk-coverage behavior, end-to-end cost, update drift, memory exposure, evidence quality, and escalation load. The central claim is modest but consequential: frontier capability should be treated as a resource to allocate, not a default state to maintain. A safe and sustainable system is not the one that always uses the strongest model; it is the one that spends capability where the reduction in risk or increase in utility justifies the cost.
Read the full abstract

Artificial Intelligence

Measuring Generative AI Content in Political Campaigns: Evidence of Rising Adoption and Non-Disclosure

The use of generative AI in political campaigns has drawn public concern and policy attention. Public concerns range from distrust of candidates to skepticism about the authenticity and accuracy of political advertising, including AI-generated images and video. Nearly half of U.S. states have enacted laws that prohibit, or require disclosure of, "materially deceptive" AI-generated content (AIGC) in elections to guard against these concerns. This study measures how candidates and their campaigns produce and circulate AIGC during an election cycle. We develop two measures that estimate not only wether campaigns use AIGC, but how much they produce (magnitude) and in what forms (modality). We apply these measures to a novel dataset of text and images from the campaign websites, X accounts, and emails of 12,977 candidates for U.S. political office from 2023 to 2025. We report three findings. First, detectable AIGC from campaigns increased significantly across modalities over the observation window, and campaigns that use AIGC frequently do not disclose it. Second, incumbents' campaigns produced significantly less AIGC than challengers' campaigns. Third, candidates in states with AIGC disclosure or prohibition laws do not produce measurably less AIGC than candidates in other states. Our method and findings have implications for transparency and trust in elections, and on state laws that regulate AI use in campaigns. Because current state laws largely target mainly "materially deceptive" content, we identify additional policy mechanisms that could increase electoral transparency and improve trust as AIGC becomes more prevalent.
Read the full abstract

Artificial Intelligence

Inside the Trading Loop: Markets, Models, and Moves with LLM Agents

We built a hybrid multi-agent trading system that combines large language model (LLM) analysts with momentum-based portfolio construction and rule-based execution. Company-news and macroeconomic agents return structured reports to a coordinator that sets stock weights and cash reserves. We evaluate the portfolio engine using its broker-recorded paper account, which operated with deterministic fallbacks, and compare LLM-enabled configurations through retrospective replays. From March 11 to August 28, 2026, the account returned 34.5%, compared with 14.4% for the S&P 500 fund SPY over the same dates. This raw return advantage came with a larger maximum drawdown. Reconstructed policies also finish above matched SPY and QQQ references when assessments are used in the same session or deferred to the next. Design comparisons examine cash authority, selective invocation, and response contracts. A constant-cash control gives a return estimate close to stance-based sizing, and shorter report contracts improve observed parsing but can change recommendations.
Read the full abstract

All authors Renee Jia, Di Mu, Yao Yu, Tianrui Liu

Machine Learning

Means vs. Foundation Models for Emergency Call Forecasting

This study investigates whether generalized means can achieve forecasting performance comparable to that of TimeGPT for daily emergency call volume prediction. Specifically, two families of generalized means, the Hölder means (HM) and the Lehmer means (LM), are evaluated against fine-tuned TimeGPT across forecasting horizons ranging from one to seven days. Forecasting performance is assessed on a real-world emergency call dataset using multiple error metrics, and Diebold-Mariano test. Experimental results show that HM and LM achieve nearly identical predictive performance across all forecasting horizons. For short-term forecasting, both generalized means outperform TimeGPT, with reductions of mean absolute error (MAE) approximately 1.24% and 2.48% at horizons of one and three days, respectively. Conversely, TimeGPT achieves a lower error at the seven-day horizon, with an descresing of MAE by 1.98%. However, Diebold-Mariano tests reveal no statistically significant differences between the methods at the evaluated horizons. These findings suggest that generalized means can provide competitive forecasting performance compared with a energyvore foundation model.
Read the full abstract

Mathematical Physics

Lieb-Robinson bound for one-dimensional continuum fermions

The central difficulty in quantum many-body physics is that the Hilbert space dimension grows exponentially with the total degrees of freedom. A key feature to circumvent this problem is locality, which manifests dynamically through an approximate causal structure in the form of a Lieb-Robinson bound (LRB). LRBs have been proved for quantum spin systems and certain lattice boson systems, but so far never for realistic continuum systems. We present the first LRB that applies to a standard system of one-dimensional continuum fermions. It applies to initial states with controlled moments of local particle number and energy and is thus thermodynamically stable. Our result breaks the main technical barrier that has existed for using the vast locality toolbox on continuum systems.
Read the full abstract

Mesoscale and Nanoscale Physics

Giant magnetoresistance rectification by Néel vector dynamics

We observe room-temperature giant magnetoresistance (GMR) rectification driven by Néel vector dynamics in synthetic antiferromagnets. During spin-torque ferromagnetic resonance, the out-of-phase (optical) mode makes the relative angle between the two sub-moments oscillate, producing a rectified voltage due to GMR. This component is isolated from anisotropic and spin Hall magnetoresistance contributions by its angular symmetry, with its voltages scaling linearly with microwave power. We extract a GMR coefficient of 0.18-0.20 % from the rectification, which agrees with independently measured dc magnetoresistance. Reversing the Néel vector with a dc current changes the sign of the GMR rectification voltage in a non-volatile and controlled manner.
Read the full abstract

All authors Zhiyi Che, Yifang Hao, Aakanksha Sud, Murat Cubukcu, Charlie W. F. Freeman, Chenghao Yang, Daniel Prestwood, Troy Dion, Shunsuke Fukami, Shigemi Mizukam, Hidekazu Kurebayashi

Human-Computer Interaction

Exploring Mixed-Reality for Enhancing Driver Warning Systems: A Preliminary Study on Attention-Shifting Methods and Hazard Perception

Modern vehicles are equipped with advanced sensors and capabilities, yet engaging human drivers effectively in hazard perception remains a challenging research area. This paper investigates the potential of mixed reality (MR) to enhance driver warning systems. The study examines the impact of attention-shifting methods, including visual cues, audio cues, and a combination of both, on drivers' hazard perception. A preliminary study involving six participants was conducted, and the NASA-TLX analysis did not yield significant differences. However, through the use of functional near-infrared spectroscopy (fNIRS), we unveil distinct brain activation patterns associated with visual and sound cues. Further research with larger sample sizes and diverse driving scenarios is required to validate and expand upon these preliminary results.
Read the full abstract

All authors Shih-Yu Ma, Nolan Robert Brady, Xu Han, Neng-Hao Yu, Tom Yeh

Mathematical Finance

Adjoint Kernel Sensitivity of the Rough Heston Characteristic Exponent

Multi-factor approximations of rough volatility kernels affect the characteristic exponents used in Fourier-based derivative valuation. We derive an adjoint representation for the first-order sensitivity of the rough Heston characteristic exponent with respect to its memory kernel, with model parameters and the input variance curve held fixed. The Volterra–Riccati functional $\mathcal L_T(K,z)$ admits a local real-analytic extension, jointly in the kernel perturbation and the transform parameter. The Fréchet derivative of this extension with respect to the kernel in $L^1$ is represented by integration against a continuous sensitivity kernel $B_K(u,z)$, obtained from a backward linear Volterra equation and independent of the perturbation direction. This representation resolves the leading-order contributions of kernel perturbations across memory lags. On the structural kernel class, which contains the fractional kernel and its multi-factor approximations and has empty interior in $L^1$, the extension yields Hadamard directional differentiability and a first-order expansion with a quadratic $L^1$-remainder for all sufficiently close structural kernels, uniformly on compact subsets of the strip of transform parameters. The same sensitivity kernel yields multi-factor weight and decay-rate derivatives. Numerical experiments at multi-factor reference kernels assess the finite-resolution implementation and illustrate how the lag distribution of positive perturbations with equal $L^1$ mass affects the first-order response.
Read the full abstract

Artificial Intelligence

Optimizing Multi-Tier Intermediation in Programmatic Advertising: A DAG-Based Mechanism for Supply Path Optimization

Digital programmatic advertising operates through complex, multi-hop supply chains. The opacity of these intermediary networks leads to significant efficiency losses, often referred to as the “ad-tech tax.” While current industry practices utilize heuristic Supply Path Optimization (SPO) to trim inefficient routes, they fail to optimize the equilibrium of the entire network. This paper extends previous work on Directed Acyclic Graph (DAG) intermediation models by applying them to traceable programmatic supply chains mapped via the OpenRTB SupplyChain object. We introduce multi-attribute utility functions and Mixed-Integer Linear Programming (MILP) to account for substitutable routing (OR nodes) and percentage-based fee structures. Furthermore, we outline a computational methodology and experimental framework using public schain and sellers.json data to benchmark optimal Nash social welfare against current uncoordinated market outcomes.
Read the full abstract

Robotics

FlowEval: How Much Adaptation Does an Embodied Foundation Model Need at Deployment?

Large-scale pretraining is reducing the amount of adaptation required to deploy embodied foundation models, but it is not guaranteed that a pretrained model already provide the level of performance required in every deployment. Practitioners therefore need to understand how well a pretrained model matches a target deployment and how much adaptation data is left to be collected. We study whether a small set of successful target-domain demonstrations can reveal whether and how much target-domain data will be required before any adaptation. We introduce FlowEval, a set of training-free metrics that use the flow-matching objective to probe an embodied foundation model with a set of demonstrations. FlowEval quantifies predictive disagreement on successful target demonstrations to assess how well a pretrained model fits a target deployment. Across four embodied foundation model families: Pi-0.5, MolmoAct2, GR00T, and DreamZero, FlowEval distinguishes seen from unseen deployments across real-world and simulated manipulation. Further, by finetuning Pi-0.5 and GR00T on 17 RoboCasa365 manipulation tasks, we showed that FlowEval correlates with how success rate improves as additional adaptation data is provided. Together, these results suggest that FlowEval can serve as a lightweight, training-free diagnostic of how much model–deployment adaptation may be required.
Read the full abstract

All authors Zhang Xi-Jia, Roman Yakunin, Shivang Chopra, Chengyue Huang, Che Chen, Siddharth Karamcheti, Zsolt Kira