Neurons and Cognition
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 8 September
Electroencephalography (EEG) microstate analysis commonly converts each scalp topography into a winner-take-all hard label and summarises the resulting sequence using duration, occurrence, coverage, transitions, and symbolic complexity. Although interpretable, this readout discards evidence strength, assignment ambiguity, and low-confidence periods. We introduce a template evidence trajectory framework that retains, at each sampled Global Field Power (GFP) peak, the evidence for all templates or subject-specific topographic communities. Conventional hard labels are treated as a compressed readout of this multivariate trajectory. We derive two evidence-aware extensions of classical descriptors: high-evidence episode duration and episode rate, which quantify temporal clustering and fragmentation of strong state evidence, and null-state Lempel-Ziv complexity (LZC), which explicitly encodes insufficient-evidence periods. We evaluated the framework across four resting-state EEG datasets spanning Alzheimer's disease and age-related variation. Fixed-state models included K-means, AAHC, and HMMs at K = 4 and K = 7, together with adaptive subject-specific Leiden and Infomap communities. Across 32 dataset-model cases, trajectory-derived duration effects exceeded matched hard-label effects in all cases at the representative setting and in 30-32 cases across a broader parameter grid. Null-state LZC improved over traditional LZC in most cases, while classification showed modest but consistent gains for trajectory or combined features. Retaining template evidence therefore provides a more sensitive readout of EEG topographic state dynamics while remaining compatible with conventional microstate analysis.
High Energy Physics (Phenomenology)
Gravitational transverse momentum dependent distributions for the gluons
We investigate the momentum-space structure of the gauge-invariant gluon energy-momentum tensor (EMT) for spin-$0$ and spin-$\tfrac{1}{2}$ hadrons in the light-front formalism. We parameterize the nonlocal gluon EMT in terms of so-called gluon gravitational transverse-momentum-dependent distributions (gravitational TMDs) and derive their connections to twist-2 and twist-3 gluon TMDs. Moreover, we demonstrate that particular components of the gluon EMT encode information about the average kinetic four-momentum of gluons and the internal mechanical properties of hadrons-such as pressure and shear distributions.
Read the full abstract
Strongly Correlated Electrons
High-resolution angle-resolved photoemission spectroscopy with tunable magnetic field
The control and perturbation of quantum phenomena with magnetic fields is an indispensable tool in materials research. Recently, in-situ field tuning was implemented into angle-resolved photoemission spectroscopy (magneto-ARPES), which provides direct momentum and energy-resolved information of the field-dependent electronic structure. However, aberrations of the electron trajectories were shown to be substantial, leading to significant spectral distortions and broadening even in small fields. Here we show that the electronic structure can be recovered from magneto-ARPES spectra with high accuracy while maintaining high momentum resolution even when strong trajectory aberrations are present. We studied Bi$_2$Se$_3$ in a dipole field of a coil using a laser-based ARPES system. The electronic structure was reconstructed in post-processing using detailed electron trajectory simulations. We identify two-dimensional (2D) momentum mapping, a micron beam spot size, and precise numerical field simulations as critical technical requirements for high-resolution magneto-ARPES. We show how circular dichroism can provide additional information about the coupling of the magnetic field to the spin. The experimental achievements and the scaling laws from our simulations provide a road map towards magneto-ARPES in larger fields.
Read the full abstract
Graphics
Neural Centroidal Voronoi Tessellations
Centroidal Voronoi tessellation (CVT) is a fundamental primitive for high-quality surface sampling and isotropic remeshing in computer graphics. However, computing surface CVTs with classical solvers remains expensive: each optimization step repeatedly constructs restricted Voronoi diagrams (RVDs) and integrates quantities over their surface cells. We introduce Neural CVT, a learning-based surface-CVT solver that replaces these costly geometric computations with a recurrent neural optimizer, accelerating CVT optimization by one to two orders of magnitude in our benchmarks while preserving geometric fidelity. Given an input surface, we sample a dense point cloud and extract multi-scale geometric descriptors with a graph neural encoder. A lightweight recurrent optimizer then refines seed positions over a small number of iterations, aggregating interpolated surface features and optimization history to predict per-seed displacements. The framework is trained self-supervised using CVT objectives that promote uniform distributions and, when desired, feature alignment. Across diverse organic and CAD-like shapes, Neural CVT generalizes to unseen geometry, initialization strategies, and seed densities, producing isotropic, feature-preserving remeshes comparable to state-of-the-art offline optimization methods at a fraction of the computational cost. Code and trained models will be released.
Read the full abstract
Computer Vision
SignRefine: Adapting Foundational Video Models for Sign Language Generation
Sign language video generation demands precise hand and facial articulation, yet modern video diffusion models, trained predominantly on spoken-language video, produce artifacts that render signing unintelligible. We propose SignRefine, a sign language video generation model that produces comprehensible signing from 2D keypoint conditioning alone, generalizing across appearances and visual conditions. Our approach builds on a pretrained video diffusion transformer and introduces local adapters with spatial grounding to selectively refine hand and face regions, steering the strong base model's prior toward accurate articulation. To enable this work and support broader sign language research, we present NVSign, a large-scale dataset of video content natively produced in sign language, offering diverse signer appearances, environments, and natural conversational settings. Trained on this data, our model shows up to 30% improvement in hand pose precision metrics over the strongest baseline and is preferred by sign language users for visual quality and comprehensibility in more than 80% of comparisons.
Read the full abstract
Metric Geometry
A very short unified proof of Dar's conjecture and Log-Brunn–Minkowski in the plane
This short note gives a very short unified proof of both Dar's conjecture and the log-Brunn–Minkowski inequality in the plane. A planar $L_p$-Brunn-Minkowski inequality for $p\in [-\infty,0]$ is established and gives the two key inequalities at $p=0$ and $p=-\infty$. Motivated by this new proof, the author proposes a related conjecture in $\tr^3$, to attack the two conjectures in higher dimensions.
Read the full abstract
Statistical Methodology
Nonparametric framework for the definition, adaptive detection and probabilistic interpretation of outliers
Outlier detection is a fundamental challenge in data processing, with critical implications for robustness across statistical modeling, machine learning and exploratory data analysis. However, existing proposals rarely offer a universal, domain-agnostic definition of an outlier, often relying on heuristic trimming quotas that lack a statistical interpretation. To address this, we propose a nonparametric framework built on a pseudo-isolation outlier score. This score enables a formal, probabilistic definition of an anomaly tied to a false-alarm rate $\alpha$, which extends into a rigorous geometric classification of internal and external outliers. We show that this mechanism seamlessly embeds into any objective-based clustering framework to identify cluster-specific outliers. Here, we integrate it into $K$-means to create ODK-means. The inferential capabilities and topological properties of this framework are explored both theoretically through formal propositions and empirically through extensive simulations and methodological tutorials, highlighting the practical actionability and intuitive appeal of the proposed outlier detection logic.
Read the full abstract
Robotics
AURORA: Active Uncertainty-Driven Re-Orientation for In-Hand Reconstruction
Observing objects grasped by a robot hand is challenging due to severe visual occlusions. Although in-hand manipulation can expose hidden surfaces, existing approaches often rely on predefined or open-loop reorientation strategies that do not explicitly target under-observed regions. We propose AURORA, an active 3D reconstruction framework that closes the loop between online object-centric reconstruction and in-hand reorientation. At its core, Ray-GPIS estimates direction-wise reconstruction uncertainty along candidate viewing rays and selects next-best-view targets using an uncertainty–novelty objective, which are realized through an axis-conditioned in-hand rotation policy. The resulting RGB-D observations are fused incrementally using CAD-free 6D pose tracking and lightweight geometric reconstruction. Experiments demonstrate that AURORA improves reconstruction quality and information-acquisition efficiency over non-active rotation strategies, while Ray-GPIS also outperforms active view-planning baselines in reconstruction performance, action-ranking quality, and planning efficiency. Targeted ablations further validate its robustness to hand occlusion and pose errors. The project webpage is available at https://aurorahand.github.io/
Read the full abstract
Analysis of PDEs
Dimension free weak-type endpoint estimates for the vectors of the Dunkl–Riesz transform
Let $R\subset\mathbb{R}^d$ be a reduced root system, $G$ the associated finite reflection group, and $k\ge0$ a $G$-invariant multiplicity function. We develop a Dunkl analogue of the obstacle/partial-balayage method of Ouyang, Spector, and Stockdale (https://arxiv.org/abs/2608.18068) for the Euclidean fractional Laplacian. For $0<s<2$, nonnegative $f\in L^1(\nu_k)\cap L^2(\nu_k)$, and $\lambda>0$, we obtain a decomposition \[ f=\mu+(-\Delta_k)^{s/2}u, \qquad 0\le\mu\le\lambda, \] with $\mu=\lambda$ on $\Omega=\{u>0\}$ and \[ \lambda\nu_k(\Omega)\le\|f\|_{L^1(\nu_k)}. \] As an application, we prove that the vector Dunkl–Riesz transform $\mathcal R_k=\nabla_k(-\Delta_k)^{-1/2}$ is of weak type $(1,1)$ with constant at most $(M_k+2)$, where \[ M_k=\#\{\alpha\in R_+:k(\alpha)>0\}. \] For $G$-invariant functions, the reflection terms vanish and the same argument gives the universal constant $2$. We further establish a dimension-free weak-type $(1,1)$ estimate for the Dunkl–Schrödinger Riesz transform.
Read the full abstract
Algebraic Geometry
The contraherent version of the theorem of Slavik and Stovicek
This is a paper about contraherent cosheaves on non-semi-separated schemes. We prove two theorems, a negative one and a positive one. On the negative side, let $X$ be a quasi-compact, quasi-separated scheme that is not semi-separated. We present a locally cotorsion contraherent cosheaf on $X$ that does not have an admissible monomorphism into any locally injective locally contraherent cosheaf. The construction and proof follow the arguments of Slavik and Stovicek in arXiv:1902.05740. On the positive side, let $X$ be a Noetherian scheme of finite Krull dimension. We prove that every $\mathbf W$-locally contraherent cosheaf on $X$ has an admissible monomorphism into a locally cotorsion $\mathbf W$-locally contraherent cosheaf. Moreover, the cokernel is a flat contraherent cosheaf. The proof is based on the theorem of Raynaud-Gruson about the projective dimensions of flat modules and Enochs' classification of flat cotorsion modules.
Read the full abstract
Robotics
Multi-bounce Drum Roll with Optimized Active Tricks to Leverage Soft Embodiment
This paper presents a soft robotic drummer for accurate and efficient drum rolls. High-frequency drum rolls require the "multi-bounce technique," where a drumstick bounces multiple times with a single stroke. In robotic reproduction of this technique, the body's elasticity is key, while the fine motion during the stroke is also crucial for maximizing the potential of that elasticity. Therefore, we design two tricks: i) Tap-Pull (TP) trick to increase the number of rebounds by adding a pulling motion after impact; and ii) Micro-Pulse (MP) trick to keep the drumming volume by injecting small oscillations during the stroke. Due to the nonlinear complexity of soft embodiment, both tricks are efficiently tuned using Bayesian optimization in a data-driven manner for accomplishing the respective objectives quantified. We evaluated the optimized behaviors with soft and rigid end-effectors. As a result, the soft TP achieved the highest bounce count (12.25 per stroke) with uniform intervals. The soft MP suppressed the volume decay, yielding 6.8-times higher acoustic efficiency compared to the rigid MP. These results indicate that the proposed tricks with the combination of elasticity and optimization can make robots play excellent drum rolls.
Read the full abstract
Signal Processing
SCALE-X: A Systematic Complexity-Aware Low-Precision Approach for Digital Predistortion
This letter presents SCALE-X, a systematic, complexity-aware, low-precision, model-based digital predistortion (DPD) technique for power amplifiers with enhanced capabilities. The proposed approach employs a novel complexity-aware coefficient pruning method, which, when combined with optimized fixed-point modeling, enables more accurate capture of quantization effects and supports better informed decisions for implementation. Targeted configuration of model order, memory depth, and coefficient bitwidth delivers dramatic cuts in computational overhead without much sacrificing accuracy. Field-programmable gate array implementation demonstrates practical trade-offs with improved overall efficiency.
Read the full abstract
Game Theory
Strategyproof Mechanisms for Connecting Impassable Regions
We study strategyproof mechanisms for building a pathway between two regions of a line segment separated by an obstacle. Each of the $n$ agents has a private location within its region and may use either its original route to a facility or the new pathway, whose traversal cost is a fraction $k\in[0,1)$ of its length. We seek strategyproof (SP) and group-strategyproof (GSP) mechanisms that approximately minimize maximum cost or social cost. After characterizing optimal pathways for both objectives, we establish a tight deterministic maximum-cost approximation ratio of $\frac{2}{1+k}$ and a deterministic social-cost upper bound of $\frac{n}{1+k(n-1)}$, together with complementary lower bounds. Both upper bounds are achieved by GSP mechanisms. We then study randomized mechanisms under strategyproofness in expectation. A power-proportional mechanism achieves a social-cost approximation ratio at most $5$, independent of $n$ and $k$, with a tight guarantee of $3$ for this mechanism when $k=0$. We prove randomized lower bounds of $\frac{3+2k}{2+3k}$ for maximum cost and $\max\big\{1,\frac{285}{263+385k}\big\}$ for social cost, the latter for $n\ge7$. Finally, we improve several bounds for the real-line pathway model of [Chan and Wang, AAMAS 2023]. Our deterministic maximum-cost lower bound of $2$ matches the upper bound obtainable from [Qin, Fang, and Liu, COCOA 2024]. We strengthen the deterministic social-cost lower bound from $\frac32$ to $2$ under SP and to $\max\{2,n-1\}$ under GSP. For randomized social cost, we sharpen the guarantee of Chan and Wang's proportional mechanism from $6$ to $3$ and raise their lower bound from $1.02$ to $\frac{285}{263}\approx1.08365$ for $n\ge7$.
Read the full abstract
Statistical Methodology
Structure-based Transfer Learning
Transfer learning improves estimation in a target study using information from related sources. Classical transfer learning is typically data-based, requiring access to the source data or to a model fitted on them. Neither is available in many modern studies, as both are often proprietary or unreported. What can be transferred instead is structure: summarized information derived from a source, such as the supports of predictors, which is available and interpretable without access to the source data or model. The prevalence of the Large Language Model (LLM) provides a rich source of such structure information. However, data-based transfer learning can not well utilize it as accessing the data and model of the LLM is often infeasible. In this paper, we propose a novel transfer learning framework based on structure. In particular, we focus on linear model and aim to use supports generated by multiple agents, such as LLM, to improve estimation in the target study. Our procedure maps each support into the target parameter space, aggregates the results with data-driven weights, and applies a sparse correction against inaccurate supports. We establish interpretable conditions for retaining the target-only Lasso rate and for a faster convergence rate, together with minimax optimality under joint coverage. Simulations and a DNA-methylation application illustrate gains and robustness.
Read the full abstract
Human-Computer Interaction
Enhancing Communication in Speech Therapy: Exploring the Cognitive Synergy Between Gesture and Speech
This paper examines the adaptation of a rhythm-based interface, originally designed for manual dexterity rehabilitation, for use in speech therapy. The interface allows users to control synthesized vocal phrases through finger tapping, leveraging the cognitive link between gesture and speech. Through interviews with four therapists and pilot tests with one speech therapist and eight children with speech impairments (autism, Down syndrome, verbal apraxia, dyslexia), we found that the interface improves motivation and therapeutic outcomes by facilitating more interactions between verbally challenged patients and the therapist. Our findings suggest that rhythmic gestures can enhance verbal communication, offering potential for broader therapeutic and educational applications.
Read the full abstract
General Economics
AI Innovation and Firm Performance in the Medical Device Industry
Whether artificial intelligence pays off for the firms that build it into their products is hard to establish, because AI innovation is itself hard to observe. The medical technology sector is a rare exception: an AI-enabled device must obtain clearance from a national health authority before it can reach a patient, leaving a dated, firm-attributable record of AI innovation output that can be observed directly rather than proxied. We exploit this setting with a three-stage recursive model estimated on a novel firm-level dataset linking FDA premarket clearances, USPTO patents, Scopus publications, and Orbis financials, tracing the full innovation chain from external collaboration through AI device introduction to firm performance. We find that external AI research collaboration is a robust driver of AI device introduction across firm sizes and estimators, with a larger effect for small firms, consistent with external knowledge ties substituting for limited internal R&D capacity. Decomposing by partner type, the effect is largest for industry and clinical collaborations and smallest for academic ties, consistent with the former being closer to the regulatory and commercialisation process. Firms that bring AI devices to market display higher labour productivity, an effect robust for small firms and the full sample that holds under both sequential and joint maximum-likelihood estimation and accumulates across successive device introductions. Effects on profit margins are present but weaker and do not survive all specifications, a pattern consistent with competitive entry eroding pricing power as AI devices diffuse through the sector.
Read the full abstract
Combinatorics
Sequence b-colorings in graphs
We introduce and begin the study of sequence b-colorings, a natural generalization of the classical notion of b-colorings introduced by Irving and Manlove in 1999. In a sequence b-coloring, each color class is required to contain a prescribed minimum number of color-dominating vertices (CDVs). We establish several fundamental properties of the associated parameters, prove that every sequence is realizable, and show that the problem of deciding whether a particular graph realizes a particular sequence is NP-complete. We also characterize the sequences realized by cycles, obtain results on regular graphs with prescribed girth, and investigate colorings requiring one additional CDV, including a characterization of connected graphs with chromatic number $3$ for which no such coloring exists.
Read the full abstract
Nuclear Experiment
News from NA61/SHINE
NA61/SHINE is a multi-purpose, fixed-target hadron spectrometer at the CERN SPS. Its research program includes studies of strong interactions, as well as reference measurements for neutrino and cosmic-ray physics. A significant advantage of NA61/SHINE over collider experiments is its extended coverage of phase space available for particle production. This contribution summarizes recent selected results from our strong interaction program. These include rapidity spectra of $K^+$ and $\pi^-$ mesons in Xe+La reactions compared to other collision systems, energy dependence of the scaled $\pi^-$ total yield (the `kink` plot) in Xe+La compared to other collision systems and models, $\phi$(1020) rapidity spectra in Ar+Sc collisions compared to models, $\Lambda$ transverse polarization in p+p reactions, energy dependence of intensive quantities of net-electric charge distribution in Ar+Sc collisions compared to p+p results, as well as an update on the evidence of large violation of isospin symmetry in kaon production — the excess of charged over neutral kaons.
Read the full abstract
Signal Processing
A Foundation Model for Large-Scale Wireless Network Planning , Operation and Optimization
Wireless cellular networks form the connective tissue of human society, sustained by a continuous physical dialogue between engineered infrastructure and its surroundings. Radio signals emitted from base stations traverse terrain, diffract around buildings and scatter through streets before reaching billions of users. Together, these interactions produce the city-wide radio environment on which every network decision rests. Shaping this environment through deployment and optimization determines the connectivity societies rely on, yet learning it effectively at city scale and generalizing across diverse cities and deployments remain open challenges. Here we answer positively by introducing ChaRT, a foundation model that learns transferable radio representations from measurement reports generated by deployed cellular networks. These reports provide abundant multi-cell, multi-beam observations without dedicated campaigns, forming a scalable data foundation for city-scale learning. ChaRT embeds beam-level angular structure, network hierarchy and propagation-regime diversity in its architecture, and is pretrained through context-aware masked beam modelling and self-distillation with channel-model-constrained augmentation. We pretrain ChaRT on over one billion reports comprising 18.2 billion beam-level observations from 3,503 cells in one city. With a single set of weights, ChaRT reconstructs radio environments in unseen cities and transfers to radio map construction, new-site prediction and network parameter tuning. With only 1% of labelled data, it supports user localization, beam prediction, propagation scenario classification and estimation of the signal-to-interference-plus-noise ratio. The learned representation further enables beamspace clustering for reusable radio-grid construction. These results establish ChaRT as a transferable foundation for network-wide intelligence.
Read the full abstract
Cryptography and Security
An Evidence Model for Agentic Processes: Evidence Claims, Trust Assumptions, and Policy Assessment
Agentic AI systems increasingly exchange messages, invoke tools, request approvals, hold structured decision sessions, and modify shared artifacts. Logs and anchors can make selected records tamper-evident, but they can also mislead if their evidentiary meaning is implicit: a hash does not establish semantic truth, a signature does not establish authorization, and an external anchor does not establish capture completeness. This paper proposes an evidence claim model for agentic processes. It distinguishes artifact integrity, temporal existence, provenance, approval evidence, declared ordering, capture claim, relevance claim, deliberation traceability, monitoring claim, anchoring authorization claim, policy assessment claim, risk treatment claim, mitigation implementation claim, and management response claim. Semantic validity is treated as a recurring limitation. The model maps these claims to mechanisms, assumptions, limitations, and threats, and situates them in an agent organization with functional CEO agent, executive, operational, evidence, and audit roles, plus a plan-do-check-act-inspired management response loop. The contribution is conceptual: it does not validate a particular implementation, prevent all failures, or automate legal compliance. It provides a vocabulary for stating which claims an agentic black box can support, which claims it cannot establish, and which controls are required around it.
Read the full abstract
Classical Analysis and ODEs
Symmetric products of Laguerre zeros
We prove and substantially extend a conjecture of Gazeau, Josse-Michaux, and Monceau concerning the extreme positive zeros of Hermite polynomials, which arose from a finite-dimensional quantisation of the phase plane. For the generalised Laguerre polynomial $L_m^{(\alpha)}$ of degree $m$ and parameter $\alpha>-1$, the product of its $j$th smallest and $j$th largest zeros is strictly increasing with $m$ for each fixed positive integer $j$, once $m\ge2j-1$. The classical Hermite-Laguerre identities then prove the original conjecture for the degree-$N$ Hermite polynomial $H_N$, in both parities and for every $N\ge4$. As a further consequence, a one-parameter extension involving a deformation of the corresponding Jacobi matrix is settled.
Read the full abstract
Numerical Analysis
Cahn-Hilliard phase-field modeling of tumor growth via locally adaptive isogeometric analysis with THB-splines
Predicting tumor dynamics in biological systems under physiologically relevant conditions using mathematical and computational models remains a challenging problem. Continuum models based on phase-field (diffuse-interface) formulations have proven to be an effective modeling strategy to govern tumor dynamics and interactions of multiple species. Within this framework, the present work investigates a tumor growth model based on the Cahn-Hilliard (CH) equation. The formulation involves a fourth-order differential operator that imposes higher continuity requirement on approximation spaces for a well-defined primal variational formulation. To address this challenge, we use isogeometric analysis (IGA), which inherently satisfies this requirement through spline-based basis functions and eliminates the need for mixed or auxiliary-variable approaches commonly used in standard finite element discretizations. Additionally, a locally adaptive IGA scheme with truncated hierarchical B-splines (THB-splines) is used to reduce computational cost while maintaining accuracy. The model is first evaluated on standard benchmark cases and then applied to an organ-scale, patient-specific geometric model of the breast reconstructed from magnetic resonance imaging (MRI) data. Our results show that the model reproduces known tumor morphologies, ranging from a spheroidal pattern to fingered growth. A series of numerical experiments further shows the diversity of tumor dynamics produced by different model parameter choices. Our findings demonstrate the predictive potential of the CH-based phase-field tumor growth model integrated with a locally adaptive IGA framework.
Read the full abstract
Materials Science
Phonon-Programmable Hidden Unconventional Magnetism in Two-Dimensional Spin-Degenerate Antiferromagnets
Spin-degenerate antiferromagnets can host hidden unconventional magnetism in their lattice degrees of freedom. We show that coherent phonons activate this magnetism by removing the spin-layer operations that enforce equilibrium band degeneracy without changing the collinear Néel order. The frequency and polarization of a pump electric field select a resonant \(\Gamma\)-point optical phonon and, within a doublet, its coordinate direction. This choice fixes the residual spin-layer symmetry. In monolayer MnPSe$_3$, an \(A_{2u}\) mode produces \(i\)-wave splitting odd in the mass-weighted phonon coordinate $Q$, reversing sign under $Q\to-Q$, whereas two orthogonal directions of the same doubly degenerate \(E_u\) doublet produce \(d\)- and \(s\)-wave splitting at a common resonance. Rotating the in-plane pump field \(\bm E_\parallel\) therefore programs both the spin-splitting texture and the thermoelectric spin current, continuously tuning the response between transverse pure-spin and longitudinal spin-polarized currents. A complete classification of two-dimensional collinear spin layer groups identifies the \(\Gamma\)-point coordinates that remove the degeneracy-enforcing operations and activate such unconventional magnetism.
Read the full abstract
Statistical Mechanics
Nonequilibrium stochastic thermodynamics of boundary functionals: From Zubarev's ensemble to stochastic particle separation
This paper develops a generalization of Zubarev's nonequilibrium statistical operator method for the case of simultaneous inclusion of additive and nonlocal boundary functionals of trajectories. Using a unified thermodynamic approach, a three-parameter model of nonequilibrium systems is constructed, including the first-passage time, the dwell time above a given level, and the absolute extremum of the process. A correspondence is demonstrated between the maximum information entropy method for trajectories and the Donsker-Varadan large deviation formalism. Using the Doob`s h-transform, it is demonstrated that fixing extremal functionals of history induces efficient non-Markovian transport in the system with dynamic adaptation to historical records. Criteria for the applicability of the developed apparatus in the "large time" domain and the possibilities of its use for optimizing stochastic particle separation in periodic potentials are discussed.
Read the full abstract
Cryptography and Security
When Topology Betrays Privacy: Lattice-Based Reconstruction Attacks on Secure Aggregation in Decentralized Federated Learning
Secure Aggregation (SA) is widely regarded as a strong defense against model-update leakage in Federated Learning (FL), as it reveals only aggregate results while hiding individual updates. In Decentralized Federated Learning (DFL), SA is commonly instantiated as local neighborhood aggregation, where each node obtains a weighted aggregate over its neighbors. We show that this locality creates a structural leakage surface: sparse decentralized topologies provide colluding semi-honest nodes with asymmetric aggregate views, exposing multiple hidden linear combinations of honest participants' private states. Reconstructing private states from these aggregate views is fundamentally challenging, as both the private states and the aggregation coefficients are hidden. We tackle this challenge by establishing a formal connection to the Hidden Subset Sum Problem, a long-studied problem in cryptography. Building on this formulation, we design a lattice-based reconstruction approach that combines lattice reduction with structural filtering to reconstruct protected model states. We evaluate our attack on image, tabular, and text tasks under sparse DFL topologies. Our results show that colluding semi-honest nodes can recover the original local updates of honest nodes, enabling downstream reconstruction of private training data. These findings demonstrate that SA alone does not guarantee privacy in DFL when local aggregation induces asymmetric observations.
Read the full abstract
Computation and Language
Do Reviewers Still Reward Lexical Complexity? A Frozen-Rater Study of Preference Drift in 124K ICLR Reviews
Large language models have collapsed the cost of producing lexically elaborate prose, and whether peer reviewers still reward it is a question about the evaluator, not about the text. When the association between a writing cue and review scores moves across years, the reviewers may have changed, the submissions may have changed, or both, and a regression of scores on text cannot say which. We separate the two with a frozen rater: 81,850 machine reviews of ICLR submissions from 2018 to 2025, all generated in one February-April 2025 window with one model family and one prompt, so that its year-to-year coefficients track submission composition alone and the human-minus-frozen trend difference identifies reviewer preference drift. On 32,638 submissions with 124,615 human reviews, the human coefficient on non-domain lexical complexity falls from +0.142 to -0.015 while the frozen rater moves from +0.080 to +0.082; the three-way difference-in-differences is -0.0100 (q=0.013), and forty random-wordlist placebos through the same specification centre on zero. Humans still reward sentence-length variability, which the frozen rater never registers, while the frozen rater still pays for lexical complexity at its earlier rate. Every claim is held to a double gate of false-discovery control and interval exclusion, and the findings that failed adversarial re-testing are reported. Reviewers discounted a cue whose production cost collapsed, as models of manipulable signals prescribe; an LLM judge calibrated to historical human preferences inherits the earlier schedule and drifts out of alignment while its agreement with humans on totals stays ordinary.
Read the full abstract
Biomolecules
Predicting directional flexibility in proteins
Predicting protein dynamics is a long-standing problem in computational structural biology. Often, protein function critically depends on local directed motions, such as hinge movements, catalytic loop rearrangements and domain reorientations, which can be characterized by directional flexibility and correlated structural motions of the protein backbone. While Molecular Dynamics (MD) simulations provide an established but often prohibitively expensive approach, recent deep generative models aim to reduce this cost by directly predicting conformational ensembles, emulating MD. However, due to their large size and the need to generate several states until the derived dynamical properties converge, these models remain expensive. In this work, we propose BackFlip-2: a fast SE(3)-equivariant graph neural network trained to directly predict dynamical descriptors, such as directional backbone flexibility and pairwise dynamic correlations, from an equilibrium structure. In a series of experiments, we show that our model matches the accuracy of substantially larger ensemble generation models while being orders of magnitude faster, and demonstrate that the proposed equivariant architecture is especially well-suited for capturing anisotropic motions in proteins. BackFlip-2 model weights, training and inference code are available at https://github.com/graeter-group/backflip.
Read the full abstract
Materials Science
Thermal response of an in-situ STEM MEMS chip under rapid pulse heating
In-situ rapid solidification studies demand measurements of thermal histories with high temporal resolution. We present a simple, effective setup to quantify the cooling response of an uncoated commercial Protochips Fusion MEMS chip in an in-situ scanning transmission electron microscopy (STEM) context. We drive user-defined temperature programs via an arbitrary waveform generator (AWG), while recording the voltage drops across a series shunt to reconstruct chip resistance and temperature at sub-millisecond resolution. We confirm the response times inferred from the current; however, the temperature obtained from the physically linked resistance, $T(R)$, evolves more slowly. Analysis of the maximum cooling step reveals an exponential-like relaxation with time constant $\tau=1.80$ ms, consistent with reported thermal lag constants for fast scanning calorimetry. From the time to reach $95\%$ of the temperature difference $\Delta T$, we measure an average cooling rate of $\approx 7.9\times 10^{4}$ K/s. Robustness checks include repeated $R(T)$ measurements (revealing a modest downward drift approaching an asymptote), a 10 k$\Omega$ test load, and characterization of small off-duty arbitrary waveform generator leakage/offsets. These findings define practical bounds on achievable thermal-path rates when planning in-situ electron microscopy experiments with this chip platform.
Read the full abstract
Multiagent Systems
From Evidence to Effect: Authority Semantics and Runtime Infrastructure for Stateful Agents
Stateful agents reuse artifacts after producing executions and permissions change. We formalize authority-sufficient observations and durable effects bound to execution and material identities. WTB implements this interface through runtime adapters, shared evidence, and transactional publication/recovery. Six study families separate the mechanism from its integration. Raw and typed evidence both solve 32/32 authority cases, with model-dependent planning effects. Fixed-intent enforcement blocks six unsafe proposals and executes 12 eligible authorized intents. Complete controls match WTB's capability. Paid integration yields 176/210 accepted benchmark-source stages, including 19/30 publication stages, recovery on 8/8 primary SWE repositories, and the most complete continuous trajectories on each of three source tasks. The findings connect authority information, effect admission, and infrastructure reuse in stateful agents.
Read the full abstract
Analysis of PDEs
Second-order regularity for weighted widely degenerate problems with explicit $u$-dependence
We consider local weak solutions of widely degenerate elliptic PDEs of the type \begin{equation} \label{equazione mia} \mathrm{div}\Biggl(|x|^\beta(|Du|-1)^{p-1}_+\frac{Du}{|Du|}\Biggr)=\frac{|u|^{q-2}u}{|x|^\alpha} \ \ \text{ in }\Omega, \end{equation} where $2\leq p<n$, $\alpha,\beta>0$ are fixed exponents, $\Omega$ is an open subset of $\mathbb{R}^n,$ that contains the origin, $n>2,$ and $( \ \cdot \ )_+$ stands for the positive part. We establish a higher differentiability result for the composition of the gradient with a suitable function that vanishes in the unit ball for the gradient, under appropriate assumptions on the datum. The novelty here with respect to previous papers on the subject is that the right-hand side explicitly depends on the solution $u$ and we have a mismatch between the weight on the left-hand side and the right-hand side.