Peer Revenue Returns subject to peer review

Papers

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

All of arXiv

Monday 31 August

Computer Vision

MEOM: Multi-View Expected-OKS Maximization for Human Pose Triangulation

Conventional algebraic triangulation solves 3D human pose estimation (HPE) from multi-view 2D keypoints. The typical approach, decoding 2D keypoints from predicted heatmaps, is unreliable as heatmaps can be multimodal under occlusion, and collapsing them into single peaks discards their spatial distribution. We seek to use the entire heatmap to estimate 3D poses more accurately, which requires solving two problems: how to robustly fuse heatmaps across views, and how to assess the reliability of heatmaps. For the former, we introduce a novel objective, Multi-viewExpected-OKS Maximization (MEOM), that locates a 3D joint where the views agree in probability mass. For the latter, we adopt highest-density-region (HDR) calibration as a diagnostic of that mass, independently of distance-based metrics. The proposed framework covers two settings, with and without 3D supervision. Without 3D supervision, we optimize 3D poses from pretrained heatmap predictors by maximizing MEOM, achieving comparable performance with state-of-the-art methods that rely on larger backbones, temporal fusion, and simulated 3D data. On ambiguous Human3.6M (H36MA) and occluded CMU Panoptic frames, the advantage is substantial. When 3D labels are available, we train the model end-to-end with a combined MEOM and MSE loss, achieving 19.11 mm absolute MPJPE on Human3.6M outperforming the state-of-the-art volumetric approach on absolute MPJPE at half the inference cost.
Read the full abstract

Artificial Intelligence

Learning-Assisted Congestion-Aware Route Scheduling for Semiconductor Fab Material Control Systems

Automated material handling systems in semiconductor fabs are operated by a material control system (MCS) that must schedule a relay route for every transport command online, before execution. This is a data-driven scheduling problem in which route cost is dominated in the upper tail by queueing at heterogeneous, partially observable relay equipment, so route selection requires estimating both delivery time and congestion risk at the decision moment. This paper proposes a transport-network-aware dynamic congestion representation (TN-DCR). Built on a static directed transport graph induced by historically observed relay segments, TN-DCR combines structural route priors, multi-window network-wide congestion context, route-level bottleneck exposure, and an inductive graph-aware route embedding, all constructed under a prediction-time-safety invariant that admits only information observed strictly before the prediction moment. The representation feeds separate queue- and transfer-time regressors and an ordinal multi-label classifier producing calibrated multi-threshold exceedance scores, with an empirical-Bayes stock-key residual correction reducing systematic queue-time underprediction. The predictions serve as costs in a risk-constrained route-scheduling rule that minimizes predicted delivery time subject to a bound on extreme-congestion probability, embedding the learned predictors within a lightweight operations-research decision model. In a controlled closed-loop evaluation, mean delivery time falls by 16.4% and internal resource waiting time by 22.6% while throughput remains essentially unchanged.
Read the full abstract

All authors Hao Yin, Meiqi Tu, Anbang Liu, Shaochong Lin, Max Z.J. Shen

General Finance

Authority-Inference Separation in Agentic Finance: First-Line Control, Blockchain Enforcement, and Replayable Assurance

AI agents can select tools, counterparties, and transaction parameters, yet inference should not itself confer authority to execute a financial action. This study develops and evaluates Authority-Inference Separation (AIS), an intent-centered architecture for bounded agentic finance. AIS treats a financial action intent as the control object: a machine-generated proposal can receive temporary executable authority only after an independent deterministic control plane validates registered agent identity, accountable ownership, mandate and risk-appetite lineage, policy version, state, approvals, and exact economic semantics. Blockchain can then enforce the operational representation of granted authority and record portable settlement evidence, while institutional legitimacy, service delivery, accounting classification, and human accountability remain off-chain obligations. Evaluation combines four-domain instantiation, official BIS and MAS cases, a 48-fixture executable prototype, and a public-ledger observability test. Across 36 synthetic authorization attacks, a direct-agent baseline accepted 36 attack effects, a prompt-policy baseline accepted 20, and AIS accepted none; all three accepted 8/8 admissible fixtures. AIS also rejected 4/4 token replays and 8/8 recipient or rail substitutions, withheld completion in 4/4 service-delivery failures, and populated all 13 defined evidence fields. A test of 1,700 recent Base transactions associated with public x402 facilitator addresses shows that public ledgers can evidence settlement and selected authorization parameters but cannot establish institutional mandate, legal accountability, service delivery, or accounting treatment. AIS and blockchain are therefore complementary: AIS decides whether a specific intent may act, while blockchain can make granted authority bounded, executable, and independently observable.
Read the full abstract

Analysis of PDEs

Grow-up rates of inhomogeneous semilinear heat equations in the critical dimension

This paper concerns the grow-up rate of solutions to a semilinear heat equation in the unit ball with the exponential nonlinearity and an inhomogeneous term $f$. When $f=0$, it is known that the large-time behavior of a solution changes at the critical dimension $N=10$, and the grow-up phenomenon occurs for the case $N\ge 10$. For the inhomogeneous case with $N\ge 10$, the present author and a coauthor showed in [12] that the grow-up phenomenon disappears once $f$ exceeds a threshold. In this paper, we provide a quantitative characterization of the disappearance of the grow-up phenomenon by obtaining the grow-up rate in the critical dimension. Our result shows that a qualitatively different type of grow-up behavior occurs in the critical dimension compared with the case $N\ge 11$ studied in [12]. The difference is caused by a change in the outer behavior of the solution. Even in the case $f=0$, our result is new in that it provides a rigorous justification of the formal computation by Galaktionov and King [10].
Read the full abstract

Artificial Intelligence

ScienceArena: Benchmarking LLMs on Latest Scientific Olympiad Competitions

Benchmark saturation and data contamination increasingly obscure genuine scientific reasoning in frontier LLMs. We introduce ScienceArena, an olympiad-style benchmark from thirteen public science competitions in physics, chemistry, and biology, including IPhO and IChO 2025–2026, IBO 2023, USAPhO 2026, and USNCO 2025. Its open-ended, multi-step problems use process-credit rubrics, making faithful scoring difficult. We build ScienceArena through an expert-audited digitization pipeline that converts official exams, figures, solutions, and rubrics into structured items verified by olympiad medalists. To scale evaluation beyond costly human grading, we calibrate LLM-as-judge against medalist ground truth on archived answers from five models across IPhO and IChO; two strong judges stay within one point of expert total scores. Medalist notes show that failures often stem from visual grounding, structure fidelity, and global problem control rather than missing terminology. Evaluating fourteen recent LLMs with interleaved solving, we find that top models obtain medal-equivalent rubric scores on several public international exams, while chemistry and long-horizon consistency remain key bottlenecks. We provide an interactive \href{https://science-arena.onrender.com/}{demo}.
Read the full abstract

All authors Guangxiang Zhao, Qilong Shi, Xusen Xiao, Wenpu Liu, Yaoming Li, Linfeng Hao, Shuyang Hou, Zijian Guo, Xinrui Zhang, Yuntian Zhao, Zhengyang Wang, Wenrui Liu, Yuhan Wu, Tong Yang, Lin Sun, Xiangzheng Zhang

Optics

Complex-gate all-optical frequency-resolved optical gating for ultrabroadband isolated attosecond pulse characterization

We experimentally demonstrate all-optical frequency-resolved optical gating (AO-FROG) for the characterization of ultrabroadband isolated attosecond pulses (IAPs) generated by a mid-infrared sub-cycle laser field. By extending the AO-FROG framework beyond the conventional phase-only modulation approximation, we develop a strong-field approximation (SFA)-based theoretical framework and show that the weak perturbing field induces both phase and amplitude modulations during high-order harmonic generation. A complex-valued gate function is therefore required for accurate pulse reconstruction. Using a 2.26-$\mu$m sub-cycle driving laser, we characterize IAPs spanning 100-180 eV in argon. The measured AO-FROG traces exhibit delay-dependent spectral modulations arising from perturbation-induced modifications of the electron trajectories and ionization probability. SFA simulations reproduce the experimental observations and confirm the importance of including ionization-induced amplitude modulation. The reconstructed temporal and spectral properties reveal an IAP duration of approximately 300 as and its spectral phase, providing access to the attosecond chirp of the generated pulses. Our results establish AO-FROG as a promising approach for temporal characterization of ultrabroadband attosecond sources driven by long-wavelength infrared fields.
Read the full abstract

All authors Minshuang Xia, Kaito Nishimiya, Dianhong Dong, Yuxi Fu, Eiji J. Takahashi

High Energy Physics (Phenomenology)

Exploring possible $^3_{\Lambda_c}\text{H}$ bound states through $p\Lambda_c$ femtoscopic correlations

The femtoscopic correlation technique in relativistic heavy-ion collisions provides a unique opportunity to investigate hadron-hadron interactions and possible exotic states. In this work, we study the $p\Lambda_c$ correlation function and its sensitivity to the low-energy $N\Lambda_c$ interaction related to possible $^3_{\Lambda_c}\mathrm{H}$ bound states. Based on the quark delocalization color screening model, three interaction scenarios with different strengths are constructed, and the corresponding spin-averaged $p\Lambda_c$ correlation functions are calculated within the Koonin–Pratt formalism. The results demonstrate that the correlation function is sensitive to the $p\Lambda_c$ interaction strength, with coupled-channel effects and $S$-$D$ wave mixing producing additional enhancements in the correlation signal. These findings suggest that future $p\Lambda_c$ femtoscopic measurements at relativistic heavy-ion collision experiments can provide valuable constraints on the interaction between charmed baryons and nucleons and offer guidance for exploring possible heavy-flavor hypernuclei.
Read the full abstract

All authors Ye Yan, Qi Huang, Qian Wu, Hongxia Huang, Jialun Ping

Human-Computer Interaction

TSExplorer: An interactive data annotation and exploration tool for time-series data

We present TSExplorer, a cross-platform tool for interactive annotation and exploration of time-series data. The tool enables users to inspect high-dimensional datasets through multiple complementary 2D visualizations derived from high-dimensional feature representations. TSExplorer is designed as a general-purpose research tool supporting a wide range of workflows, including exploratory data analysis, annotation of unlabeled or partially-labeled datasets, comparison of feature representations, and post-hoc inspection and refinement of existing labels with interactive visual feedback.
Read the full abstract

Geometric Topology

Brieskorn spheres bound orbit spaces of torus manifolds

We construct a smooth, equivariantly formal, simply connected torus $8$-manifold over a contractible $4$-manifold with the boundary a Brieskorn homology $3$-sphere having a nontrivial fundamental group. We prove extension to a torus graph for GKM graphs of GKM$_{4}$ manifolds in complexity $2$, and $3$ under a finite fundamental group assumption (that is not satisfied, in general).
Read the full abstract

Machine Learning

Trajectory-Initialized Neural Double Q-Routing for Large-Scale Overhead Hoist Transport Systems

Large-scale industrial robot fleets share constrained physical infrastructure, making vehicle travel times dependent on safety separation, intersection access, downstream blocking, and station contention. We study this problem in overhead hoist transport (OHT) systems, a representative ceiling-mounted material-handling system used in semiconductor fabs. Static shortest-path routing cannot account for these time-varying traffic costs, whereas tabular Q-routing adapts online but learns each destination–node–action value independently, limiting information sharing across sparsely visited routing contexts and making startup behavior sensitive to inaccurate value estimates. We propose Neural Double Q-routing, which replaces destination-indexed tables with a shared state–action value network. The network is warm-started through return-to-go regression on mixed simulator-generated routing trajectories and then refined online using Double-Q updates, local congestion correction, and event-stratified structured replay. Across nine matched fleet-size–arrival-rate settings with 100, 150, and 200 OHTs, the proposed framework reduces mean completion time relative to tabular Double Q-routing by $0.8\%$–$8.8\%$. It achieves the lowest mean completion time among all compared methods in the six 150- and 200-OHT settings, whereas Dijkstra remains best in the three 100-OHT settings. Completed-task counts remain within $1\%$ of tabular Double Q-routing in eight of nine settings, and 95th-percentile completion time decreases in eight settings. In two matched startup scenarios, offline initialization increases the number of completed tasks by up to $23\%$ and reduces tail completion time by up to $15\%$.
Read the full abstract

All authors Cheng Gu, Qiusheng Zhao, Anbang Liu, Shaochong Lin, Max Z.J. Shen

Mesoscale and Nanoscale Physics

Dynamics of a nanoscale ferromagnetic vortex

We propose a ferromagnetic vortex stabilized by the interfacial Dzyaloshinskii–Moriya interaction (iDMI) and investigate its properties through theoretical analysis and micromagnetic simulations. Our results demonstrate that this vortex can remain stable even in nanoscale ferromagnetic disks with radii below $5\,\text{nm}$—far smaller than those of conventional nanodot vortices having about $1\,\mu\text{m}$ radius. We analytically solve the nonlinear equation of motion describing the anharmonic vortex oscillation, and identify the critical frequency that determines the stability of the driven oscillation of the vortex. This nanoscale vortex exhibits conventional properties of microscale vortices, including gyrotropic oscillation and resonance frequency shift under an out-of-plane magnetic field. It also exhibits unconventional behaviors, such as a strongly anharmonic potential, nonlinear oscillations, and a Duffing-oscillator-like response under the external AC bias.
Read the full abstract

Computer Vision

Lot Machine: Multimodal Lot Extraction from Auction Catalogs

For provenance research and art market studies, auction catalogs are an essential resource to trace specific objects over time and space. While historical auction catalogs follow established domain conventions, their internal formatting remains highly variable, and their large-scale analysis is currently restricted by the lack of machine-readable representations of the auction lots. We propose a pipeline to automatically extract structured lot-level metadata from German Sales, a large database of historical auction and sales catalogs from the 19th and 20th centuries. Using a manually annotated test set of representative catalog pages, we evaluate Vision-Language Models (VLMs) under varying prompt strategies and constrained decoding frameworks. To reflect the practical constraints faced by cultural heritage institutions, including budget, compute resources, and data privacy requirements, we benchmark the methods across different deployment modes ranging from commercial providers to locally hosted, quantized models. We find that commercial endpoints establish the performance ceiling, while institutional gateways offer a viable, privacy-preserving alternative. Local deployments remain feasible, but strictly require enforcing the output structure during generation to guarantee a valid JSON format. While varying degrees of human-in-the-loop correction are still necessary, this work demonstrates that a VLM-based pipeline can successfully unlock historical auction catalogs for large-scale automated analysis.
Read the full abstract

All authors Mathias Zinnen, Alisha Mund, Sabine Lang, Lukas Hüttner, Thomas Gorges, Vincent Christlein

Hardware Architecture

CHIPSMORE: Compute-in-Interconnect and -Memory Chiplets for Multi-Mode Multi-Request LLM Inference Acceleration

Large language model (LLM) inference exhibits substantial variability across adaptation modes, context lengths, and request concurrency, creating challenges for maintaining high utilization, memory efficiency, and scalable performance on compute-in-memory (CIM) accelerators. This paper presents CHIPSMORE, a multi-mode and multi-request LLM inference accelerator that integrates compute-in-interconnect and CIM to support both base-mode and low-rank adaptation (LoRA) inference under diverse workloads. CHIPSMORE employs heterogeneous processing elements consisting of resistive RAM analog compute-in-memory (RRAM-ACIM) and static RAM digital compute-in-memory (SRAM-DCIM) interconnected through a programmable Inter-PE computational network (IPCN). A composable hierarchical key-value (KV) memory scheme dynamically allocates router scratchpad, SRAM-DCIM, and embedded DRAM (eDRAM) resources according to workload requirements, enabling scalable support for long-context and batched inference. Furthermore, a non-replicated multi-request execution pipeline exploits request-level parallelism without duplicating pretrained weights, while a state-aware resource reconfiguration mechanism selectively retains runtime states and power-gates inactive resources to improve energy efficiency. Evaluation using cycle-accurate hardware-software co-simulation demonstrates that CHIPSMORE effectively sustains high throughput across varying model sizes, context lengths, and batch sizes while maintaining favorable power scaling. Compared with Nvidia H100, CHIPSMORE achieves up to $2.38\times$ higher throughput and $27\times$ higher energy efficiency on Mistral-7B inference while eliminating weight replication for multi-request serving.
Read the full abstract

All authors Yue Jiet Chong, Yimin Wang, Zhen Wu, Zixuan Wang, Wei Zhang, Xuanyao Fong

Computation and Language

UTILMEM: Benchmarking Evidence Utilization in Long-Term Conversational Memory

Long-term memory is increasingly important for conversational agents, yet existing benchmarks primarily measure memory through pointwise factual recall: whether a system can recover isolated facts or event-level details from prior interactions. Real-world memory use, however, often requires a more demanding capability: integrating distributed, implicit, and noisy evidence across extended interaction histories into coherent, task-oriented outputs. We call this capability memory utilization. Here, we introduce UtilMem, a diagnostic benchmark comprising 1,717 instances across five domains, designed to evaluate four underexplored aspects of memory utilization: reasoning over dense histories, identifying implicitly relevant memories, synthesizing distributed evidence into summaries, analyses, or plans, and resisting interference from semantically similar distractors. Evaluating a diverse set of retrieval-based and memory-augmented systems, we find that strong performance on conventional factual-memory benchmarks does not reliably translate into effective memory utilization. Moreover, retrieval alone is insufficient: even when relevant evidence is successfully recovered, systems frequently fail to integrate information across sessions or to distinguish useful evidence from plausible distractors. These findings expose a substantial gap between accessing stored information and using it effectively, and suggest that progress in long-term conversational memory will require architectures that explicitly support evidence integration and robustness to retrieval interference. Code is available at https://github.com/peijunallin/UtilMem.
Read the full abstract

Operator Algebras

Quantum non-local games: Quantum relations, projection lattices and rule operators

Quantum non-local games with quantum inputs or outputs have been formulated in several different languages, including rank-one and quantum XOR games, support maps between projection lattices, probabilistic quantum hypergraphs, and Frobenius-algebraic rule operators on finite quantum sets. We give a unified operator-algebraic comparison of these models by assigning to each rule its winning transformation space: the operator space of transformations accepted with certainty. We introduce \(\mathcal R\)-projection-test quantum games with finite-dimensional input and output von Neumann algebras and an arbitrary, possibly infinite-dimensional, referee von Neumann algebra \(\mathcal R\). Their winning transformation spaces are precisely operator spaces with a natural bimodule structure, equivalently rectangular quantum relations. We compare this formalism with projection-lattice games, hypergraph quantum games, and the graphical rule-operator definition. Projection-lattice games capture exactly the reflexive winning bimodules. Hypergraph quantum games admit value-preserving projection-test realisations, and, after passing to perfect transformations, describe the same reflexive part as projection-lattice games. Using Daws' technique, we also translate rule operators to projections in tensor products of finite-dimensional von Neumann algebras. This identification places graphical rules in the same operator-bimodule framework and preserves both values and perfectness. Finally, we compare concurrency with the synchronicity conditions of Goldberg and of Bochniak–Kasprzak–Sołtan. The framework is illustrated by classical, rank-one, quantum XOR, colouring, and quantum graph homomorphism and isomorphism games.
Read the full abstract

Robotics

Anomaly Detection on Small Industrial Components via Vision-Based Tactile Sensing

Automated inspection of small industrial components, including sub-centimetre-scale parts where defects are geometry-driven and poorly resolved by standard optical cameras, calls for sensing modalities that can directly capture fine surface geometry. Vision-based tactile sensors address this need by converting contact imprints into high-resolution image-like data compatible with existing deep-learning pipelines, yet their effective use for industrial anomaly detection (AD) remains largely unexplored. This work systematically evaluates unsupervised AD methods on a real tactile dataset covering five genuine industrial components acquired with a GelSight Mini sensor mounted on a collaborative robot. Four feature-embedding methods, SPADE, PaDiM, FAPM, and InReaCh, are compared under three validations explicitly motivated by the deployment constraints of contact-based sensing: a Good Fraction analysis establishing the minimum number of nominal contacts for stable performance, directly bounded by gel wear since every acquisition degrades the soft interface; a cross-position evaluation assessing generalization across different contact locations observing the same recurring surface pattern; and a low- versus high-resolution comparison evaluating the cost-benefit of higher-resolution tactile acquisition. Overall, this systematic benchmarking study provides practical guidance for researchers and practitioners adopting vision-based tactile sensing for industrial AD and shows how this modality can serve as a viable alternative for industrial quality-control tasks.
Read the full abstract

All authors G. F. Preziosa, M. Casiglia, M. Faroni, A. M. Zanchettin, P. Rocco

Machine Learning

Tensor Methods for Language Models: From Token Representation to Training, Adaptation, Inference, Compression, and Interpretability

Large language models (LLMs) are built from structured high-dimensional objects such as token representations, weights, adaptation updates, caches, and activations, whose multilinear structure is underexploited by the conventional matrix-centric view. Tensor decompositions and tensor networks provide a principled algebraic language for this structure, yet the literature often treats them as isolated compression mechanisms. This survey organizes tensor methods for LLMs through two complementary views: a seven-stage lifecycle taxonomy covering tokenization, embeddings, pre-training, adaptation, compression, inference, and interpretability, and a component view covering embeddings, attention, and feed-forward networks. We provide unified notation and theoretical foundations, analyze tensorization strategies for individual Transformer components, and compare methods at each lifecycle stage while making differences in evaluation protocols and model scales explicit. We further connect tensor methods to neighboring efficiency techniques and probabilistic tensor networks. Finally, we synthesize open challenges and introduce $\rho_{\rm gap}$, a metric for the compression-realization gap between theoretical memory reduction and measured system-level speedup. By treating tensorization as a common structural principle, the survey provides a structured entry point to tensorized language models and clarifies when parameter savings can plausibly translate into memory efficiency, computational efficiency, or interpretability. The GitHub page dedicated to this paper is accessible at \href{https://github.com/ma-tt-a/awesome-tensor-methods-for-llms}{this https URL}.
Read the full abstract

All authors Matvei Tarasov, Salman Ahmadi-Asl, Andre L. F. de Almeida, Andrzej Cichocki

Materials Science

Dark exciton signatures in the infrared transient absorption of MoS$_2$ monolayer

Dark excitons play a central role in the nonequilibrium dynamics of two-dimensional semiconductors, but remain difficult to characterize. Transient-absorption experiments, with probes tuned in exciton-exciton transitions energy range (exc-tr-abs), can detect excitations from any populated dark excitons, including symmetry-forbidden, spin-forbidden, and finite-momentum ones. In this work, we develop a $GW$+BSE scheme for computing exc-tr-abs spectra from arbitrary populated exciton distributions. These dark excitons are included equally by evaluating exciton-exciton dipoles in a locally smooth gauge, including intra- and inter-band contributions. For monolayer MoS$_2$, the exc-tr-abs signal arises from the $\Gamma$, $K$, $M$, and $Q$ valleys, differing substantially from the $\Gamma$-only interpretation. Exciton-exciton dipoles show similar intensities across these valleys, while their weights are dictated by initial excitonic populations. State- and spin-resolved analyses assign the peaks to $1s \rightarrow 2p$ and $1s \rightarrow 3p$ transitions from both spin-flip and spin-conserving A and B excitons across valleys and momenta.
Read the full abstract

All authors Tian-Xiang Qian, Marco D'Alessandro, Claudio Attaccalite, Tian-Yi Cai, Sheng Ju, Davide Sangalli

Instrumentation and Methods for Astrophysics

DINOspec: Efficient Multimodal Alignment of Vision and Spectral Foundation Models for Astronomy

Astronomical observations provide multimodal views of physical systems, with images and spectra capturing complementary properties of celestial objects. Scientific foundation models can learn powerful representations from these observations, but representations learned by separate models remain difficult to combine. We investigate whether laten space representations learned by separate vision and spectral models can be aligned without retraining their encoders. We introduce DINOspec, a multimodal framework that aligns a frozen DINOv3 image encoder with a pre-trained AION-1 spectral encoder using lightweight adapters and contrastive learning on 20,472 paired images and spectra of astronomical objects. DINOspec improves galaxy morphology classification (F1: 0.72$\rightarrow$0.78) and spectral type classification (F1: 0.70$\rightarrow$0.74) while training at few as 21M parameters. Redshift prediction shows no consistent improvement over the AION-1 baseline of $R^2\approx0.9$, demonstrating that potential benefits of alignment depends on the configuration and downstream task. These results provide an empirical study of composing astronomical representations from independently pretrained foundation models through lightweight alignment modules.
Read the full abstract

All authors Erica Lastufka, Mariia Drozdova, Daniel Schaerer, Svyatoslav Voloshynovskiy

Machine Learning

When the Martingale Never Stops Firing: Anytime-Valid Gating on Real Forecast Streams

Machine learning systems are increasingly corrected while they run, and the decision of when to intervene is increasingly delegated to statistical monitors. Anytime-valid inference promises evidence that can be acted on at any moment, exactly the guarantee this setting needs, and it is moving from theory into deployed monitoring. Conformal test martingales are the change-detection instrument, and Ville's inequality caps their false-alarm probability on exchangeable data. The guarantee is conditional. A deployment inherits it only if the stream it monitors behaves exchangeably. The premise is hardest to satisfy where these monitors are most useful, on dependent data and inside loops where the monitor modifies the learner whose scores it reads. It is also rarely measured. We measure it in a pre-specified case study, where such a monitor gates the online updates of a Kalman adapter correcting frozen time-series foundation models on five forecasting streams. On exchangeable synthetic streams, the same implementation fires in at most 1 of 60 runs. On the real streams, at alpha = 0.05, 135 of 135 clean-stream runs fired. The construction does not explain the firing; the failure comes from the deployed score stream itself. Repeated fires hold the gate's drift response active, and the gated filter amplifies the very transient it was designed to prevent. The component worth keeping makes no validity claim. Huber-style gating of the filter's own updates cuts isolated-spike degradation by an order of magnitude with no dataset specific tuning. Anytime-valid methods proposed for dependent data should therefore be accompanied by null-calibration controls and mechanism traces.
Read the full abstract

Soft Condensed Matter

Polymer Membrane Tensegrity: Inverse Design of Polymer Films Morphing into Freeform 3D Surfaces with Digital Photopatterning Technique

In Metamorphosis of Plants (1790), Goethe traced diverse plant organs to transformations of a common leaf-like structure – a principle modern mechanics attributes to two material ingredients: non-uniform in-plane strain from differential growth or shrinkage, and spatially patterned stiffness. Here we translate this principle into a synthetic fabrication framework called Polymer Membrane Tensegrity (PMT). A flat elastomeric film swollen with a second monomer is selectively UV-cured through a liquid-crystal display (LCD) photomask in a single-side digital photopatterning step, producing rigid rods embedded in a soft, shrinkable membrane. After the unreacted monomer is extracted with a solvent and the film is dried, the membrane shrinks far more than the rods, generating a ~50% in-plane strain differential and a ~2,000-fold modulus contrast – conditions under which the contracting membrane is held in tension by mutually unconnected rods, a tensegrity-inspired arrangement within a single film. An origami-based inverse design algorithm computes the rod layout that morphs the film into a prescribed 3D surface. We demonstrate PMT on a dome, a hyperbolic surface, and a gyroid unit cell – positively and negatively curved targets – reproducing all three with mean deviations of 1.0-2.1% of the target size; perimeter curve optimization halves the mean deviation of the gyroid. Because patterning occurs on one side only, PMT eliminates the front-to-back alignment demanded by bilayer methods, offering a scalable route from flat polymer films to freeform 3D surfaces.
Read the full abstract

All authors Shuto Ito, Yuta Shimoda, Haruka Fukunishi, Mikihiro Hayashi

Cosmology and Nongalactic Astrophysics

Thermodynamic reconstruction in observationally constrained dynamical dark energy models

We perform an observational and thermodynamic analysis of four cosmological models $\Lambda$CDM, CPL, MPL, and the three-parameter MmAH parametrization. All dynamical models improve the fit relative to $\Lambda$CDM, with $\Delta\chi^2 \sim 6$-$6.5$, with MPL providing the best fit, while MmAH remains viable. Although Bayesian evidence mildly favors $\Lambda$CDM due to its lower complexity, the dynamical dark energy models remain competitive alternatives given current observations. We then reconstruct thermodynamic quantities within observationally constrained cosmological models, extending previous theoretical studies. The bestfit heat capacity reconstruction indicates that the divergence associated with a second order thermodynamic phase transition coincides with the deceleration-acceleration transition only in $\Lambda$CDM, whereas for the dynamical dark energy models it occurs at distinct redshifts, suggesting that this coincidence is not universal. The generalized second law is satisfied for all models over $0 \le z \le 1$, while the Hessian analysis reveals a transient instability at the phase transition; however, the late time thermodynamic stability is model dependent, with CPL and MPL remaining stable and $\Lambda$CDM and MmAH failing to satisfy both stability conditions simultaneously. These results show that thermodynamic properties reconstructed within observationally constrained cosmological models provide a complementary probe of dark energy, with the thermodynamic phase transition emerging as an intrinsically model dependent phenomenon.
Read the full abstract

Computational Engineering

Sensitivity Hot Spot Penalization: A Robust Topology Optimization Framework against First-Order Worst-Case Perturbations

Deterministic topology optimization can efficiently generate high-performance structural designs, but it does not explicitly control localized fragility induced by manufacturing variations and geometric uncertainties. Such fragility often appears as stress concentrations or hinge-like deformation mechanisms. Conventional robust topology optimization can suppress these features, but typically requires multiple design realizations and substantially increased computational cost. Recent work by Sigmund et al. (2026) introduced sensitivity hot spot penalization (SHoSP), which augments the nominal objective by a smooth maximum of its sensitivities and suppresses localized fragile features at low additional cost while promoting more even stress distributions. This paper establishes a general connection between SHoSP and a first-order worst-case robust approximation under a material-mass perturbation budget using a Taylor expansion and H{"o}lder's duality. The original penalty weight is identified as a dimensionless norm-bounded perturbation budget relative to the area (2D) or volume (3D) of the design domain. This interpretation explains the suppression of sensitivity hot spots, hinge localization, and stress concentrations by limiting the maximum first-order degradation under budgeted perturbations. It is investigated for compliance minimization and compliant mechanism design. Robustness is assessed using a relaxed worst-case density perturbation and by comparing deterministic and SHoSP designs under equivalent perturbation budgets. Stress-related effects observed on structured meshes are cross-validated by stress-oriented topology optimization and body-fitted finite element analyses. Extensions to porous infill optimization, multiple load cases, and large-scale 3D examples further demonstrate the applicability and superior scalability of the SHoSP framework.
Read the full abstract

Artificial Intelligence

CM2: Multimodal Cultural Reasoning via an Integrated Multi-Agent Framework

Multimodal Large Language Models (MLLMs) have shown remarkable success in STEM domains, where progress is often driven by vertical, step-by-step deduction under relatively stable symbol systems. Their horizontal, interdisciplinary cultural reasoning, however, remains underexplored.We propose CM2, a multi-agent framework grounded in the cognitive pathway of human cultural interpretation. CM2 integrates multimodal perception, retrieval-augmented generation, networked reasoning, gated fusion, and reward-driven feedback.Experiments on CM2D across multiple MLLM backbones show consistent gains over CoT and typical reasoning paradigms; ablations validate each module's contribution, and conflict analyses confirm genuine cross-modal arbitration.
Read the full abstract

All authors Qi Li, Zhaojie Kang, Yingjie He, Zheng Lin, Hao Zhang, Guangxin Wu, Yan Gong, Rong Fu, Jianyuan Ni

Software Engineering

Bridge: Automatically Mining Ecosystem-Scale API Update Mappings and Client Update Instances

Library updates often require adapting client code to API changes. API update mappings that identify relations between legacy and replacement APIs, version transitions that these mappings apply, and client update instances that capture concrete API call changes are essential for developing and evaluating automated library update techniques. Existing library evolution datasets capture only subsets of this information and typically cover few third-party libraries. In this paper, we present Bridge, a client-driven framework for automatically constructing ecosystem-scale library update datasets that connect API update mappings, version transitions, and client update instances. Bridge first mines candidate update instances from client dependency update commits at scale, validates them using library-side evidence, and then derives API update mappings from validated instances. This design grounds each retained mapping in at least one client update instance. On a manually annotated ground truth dataset, Bridge achieves 91.6% precision and 88.7% recall for Java and 90.1% precision and 64.0% recall for Python. Applied to WoC V3, Bridge mines 381,661 Java and 277,259 Python client update instances, representing 18,900 and 4,456 API update mappings across 2,557 and 999 libraries, respectively. The mined mappings exhibit a pronounced long-tail distribution, with most appearing in only a few client update instances. As one application of the dataset, we evaluate four large language models on replacement API recommendation, a key step in library updates. The best recommendation accuracy reaches only 37.1% for Java and 44.4% for Python, and all evaluated models perform substantially better on frequently observed mappings than on mappings observed in only a few client update instances, highlighting the difficulty current LLMs face in recommending replacements for mappings in the long tail.
Read the full abstract

Quantum Physics

Cross-Spectral Reservoir Correlations as a Resource for Finite-Time Quantum Otto Engines

We investigate the thermodynamic consequences of longitudinal-transverse cross-spectral reservoir correlations in a finite-time quantum Otto engine with a two-level working medium. Each reservoir couples through excitation-relaxation and dephasing channels whose fluctuations are characterized by a Hermitian positive-semidefinite spectral-density matrix, with the off-diagonal elements encoding their cross correlations. The finite-time isochoric dynamics is derived within the second-order time-convolutionless framework, without imposing the Markov limit at the outset, so that finite reservoir-memory effects can enter through time-dependent dissipative and reservoir-induced coherent contributions. The resulting dynamics is then recast in Bloch-vector form to construct the stroke-resolved cycle dynamics. At fixed auto-spectral densities, cross-spectral correlations modify the populations and coherences of the working medium and thereby its thermodynamic performance. Increasing the correlation strength can enhance the output power, with the enhancement controlled by the cross-spectral phase and characteristic frequency scale. The correlations also reshape the transient cycle-to-cycle evolution and the approach to periodic operation, while the limit-cycle efficiency remains fixed at the Otto value for the population-preserving unitary strokes considered here. These results establish off-diagonal reservoir spectra as an additional resource for controlling finite-time quantum thermal machines.
Read the full abstract

All authors Siddhartha Dutta, Sujay Mondal, Ankush Das, Anumita Mukhopadhyay, Abhijit Bandyopadhyay

Instrumentation and Detectors

In-situ suppression of surface radon emanation using an HDPE barrier at the Stawell Underground Physics Laboratory (SUPL)

Radon-induced backgrounds remain a limiting factor in low-background experiments conducted in underground laboratories. The enclosed nature of these laboratories can result in elevated radon levels, with emanation from the surrounding rock representing the primary source of radon. In this work, we present an in-situ study of radon emanation from the floor of the main experimental hall at the Stawell Underground Physics Laboratory (SUPL) and investigate the use of a high-density polyethylene (HDPE) barrier to suppress emanation. Surface emanation was measured using an AIRTHINGS Corentium Pro passive detector before and after installation of the barrier. The equilibrium radon concentration within the surface emanation setup was reduced from 5840 $\pm$ 50 Bq m $^{-3}$ to 259 $\pm$ 3 Bq m$^{-3}$, corresponding to a suppression of $\sim$96%. These results demonstrate the potential to retrofit radon barriers to suppress surface emanation under realistic underground conditions, supporting their use in planned low-background infrastructure at SUPL and future applications at other underground laboratories.
Read the full abstract

All authors R.R. Marcelo Gregorio, K. Mintern-Lane, S. Rushbrook, A.G. McLean, L.J. Bignell, J.M.C. Brown, G.J. Lane, N.J.C. Spooner

Astrophysics of Galaxies

Photometric redshifts for active galactic nuclei with LePHARE for the Vera C. Rubin Observatory

Active Galactic Nuclei (AGN) play a crucial role in galaxy evolution, but they are a minority of extragalactic sources with diverse Spectral Energy Distributions (SEDs), which depend on their means of selection. Upcoming large-scale surveys such as LSST will identify many AGN, but analysis tools are not optimized for them. The limited number of photometric bands in these surveys impacts the calculation of photometric redshifts for AGN, which are essential for scientific advancement. We use LePHARE to demonstrate the impact that a limited number of bands and erroneous assumptions have on the determination of the photometric redshifts of AGN. We conduct tests on six AGN samples selected using X-ray, radio, infrared, variability, color, and spectroscopic criteria in the COSMOS field, using photometry from HSC-CLAUDS, which is closest in depth and wavelength coverage to LSST. We present the LSST pipeline for LePHARE within the Redshift Assessment Infrastructure Layers (RAIL), facilitating comparison between SED fitting and machine learning algorithms. AGN that appear as point-like sources in optical data will be assigned highly unreliable photometric redshifts if they are processed using galaxy templates. Additionally, shallow all-sky surveys (like eROSITA, WISE, and ZTF) miss many AGN. As a result, these "hidden" AGN are often misidentified as galaxies in public survey data, leading to incorrect photometric redshift. We provide the configurations that are suggested for each type of AGN alongside measures of expected performance as a function of redshift, magnitude, and selection. To facilitate studies with a panchromatic view of AGN, we also release photometric redshifts and posterior distributions for all AGN sources identified in the COSMOS field using the six criteria, based on 28-band photometry.
Read the full abstract

All authors R. Shirley, M. Salvato, J. Cohen-Tanugi, O. Ilbert, S. Arnouts, R. Ansari, R. Assef, M. Banerji, A. Bongiorno, W. N. Brandt, J. Buchner, J. Comparat, D. Ilić, A. Kovačević, J. Kubica, B. Laloux, O. Lynn, A. Malz, L. Marchetti, C. Mazzucchelli, T. Mkrtchyan, K. Nandra, D. Oldag, C. Ricci, W. Roster, E. Saremi, S. Satheesh-Sheeba, T. Tasnim. Ananna, M. J. Temple, M. Vaccari, A. Viitanen, C. Wolf, Z. Yu, T. Zhang

Probability

McKean-Vlasov Differential Equations: An introduction and a focus on some kinetic models

These notes were prepared for a series of lectures delivered at the 43rd Finnish Summer School on Probability and Statistics, held in Lammi, Finland, from May 26 to 30, 2025. They provide an introduction to McKean-Vlasov stochastic differential equations and their connections with non-linear Fokker-Planck equations and mean-field interacting particle systems. Particular attention is devoted to density-dependent equations and to kinetic-type models with degenerate noise. For the latter, we introduce the underlying non-Euclidean geometry and the associated anisotropic and intrinsic Hölder spaces, and present well-posedness and regularity results based on Schauder estimates and superposition principles.
Read the full abstract

High Energy Physics (Phenomenology)

Polarized jet anisotropy at the Electron-Ion Collider

Jets provide a powerful probe of the three-dimensional spin structure of the nucleon, a central goal of the Electron-Ion Collider. Yet the observed jet defines an axis that breaks the azimuthal isotropy of soft-gluon radiation, thereby reshaping the very asymmetries used to extract that structure. Using transverse-momentum-dependent (TMD) QCD factorization, we show for the first time that this jet-induced anisotropy imposes a parity selection rule on polarized asymmetries. Expanding the transversely polarized structure functions in harmonics $\cos(n\phi_{qJ})$, where $\phi_{qJ}$ is the angle between the jet and the lepton-jet momentum imbalance, makes this rule explicit: the symmetry of each harmonic is fixed by the parity of $n$, independently of the magnitudes of the harmonic coefficients. For the Sivers function, the canonical left-right asymmetry about the proton spin survives for even $n$ but is replaced by a counterintuitive left-right symmetry for odd $n$. The worm-gear function retains its up-down asymmetry at every harmonic while being left-right symmetric for even $n$ and asymmetric for odd $n$. At EIC kinematics, the higher harmonics studied here are predicted to be individually measurable, providing new observables for the azimuthal dynamics of soft radiation and an essential ingredient in precision extractions of nucleon structure.
Read the full abstract

All authors Zhong-Bo Kang, Hongxi Xing, Fanyi Zhao, Yiyu Zhou