Computer Vision
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 15 September
Annotating large radiology datasets is bottlenecked by the manual effort of delineating structures slice-by-slice in 3D volumes. Interactive methods reduce this effort but stay interaction-inefficient: slice-wise methods (including many foundation models) ignore inter-slice continuity, while 3D and video-based methods propagate a prompt with a fixed propagator that never adapts to the target volume, so it drifts on low-contrast or pathological structures and must be re-prompted. We present IMVS, a human-in-the-loop annotation framework that composes three components into a closed loop rather than a new segmentation primitive: a lightweight 2D Slice Mask Adapter (SMA) fine-tuned online from user scribbles, a frozen Volume Mask Tracker (VMT) that propagates corrected masks across adjacent slices, and a soft teacher–student alignment that limits forgetting. The SMA is backbone-agnostic (UNet++, DeepLabV3, TransUNet). Across 8 public CT/MRI datasets, IMVS matches strong interactive baselines in quality while sharply cutting annotation effort: $14.4\times$ faster than a proficient copy-based manual workflow ($22.3\times$ over naive manual), $4.6\times$ over slice-wise and $1.9\times$ over 3D interactive methods. MedSAM2 and ScribblePrompt stay competitive or stronger on well-delineated organs; IMVS's advantage is largest on challenging targets and on interaction efficiency. Source code and Demo Video: https://github.com/AbhilakshSinghReen/imvs.
Systems and Control
Explainable Post-Disaster Grid Observability Recovery Using Human-Oversight Agentic LLMs
Post-disaster phasor measurement unit (PMU) outages reduce power-system observability and degrade operator situational awareness, requiring sequential restoration under limited resources. Existing PMU restoration methods based on optimization or heuristics can generate restoration schedules, but they often provide limited support for explanation, traceability, and operator interaction. This paper proposes an agentic tool-calling framework orchestrated by a large language model (LLM) for post-disaster PMU restoration and grid observability recovery. In this framework, the LLM does not directly solve the restoration optimization problem; instead, it coordinates validated backend tools required for post-disaster restoration, including observability assessment, restoration planning, state updates, and operator verification. The framework also maintains a structured tool-call history and execution context that keep restoration decisions traceable and explainable, while enabling context-aware operator question answering during the restoration process. Simulation results on IEEE 30-bus and IEEE 57-bus systems show that the proposed framework achieves observability recovery comparable to a mixed-integer linear programming (MILP) solution, while providing tool-grounded explanations, interactive operator support, and human-overseen execution.
Read the full abstract
Computer Vision
FSANet: Frequency-Spatial Aware Network for Image Segmentation
Image segmentation remains challenging due to occlusions, poor lighting, and irregular structures. Although transformer-based methods achieve high accuracy, they rely heavily on long-range spatial features, leading to high computational costs and neglecting prior knowledge or noise patterns, resulting in missing details and unclear boundaries. To address these issues, we propose Frequency Spatial Aware Network (FSANet), which integrates prior knowledge with a dual-domain solver to sequentially adapt to diverse segmentation tasks. Specifically, we design three key modules: (1) Structure Prior Module, which recovers overlooked details; (2) Dual-Domain Awareness Module, which captures salient features while disentangling noise; and (3) Edge Estimation Module, which enhances edge awareness for more precise segmentation. In addition, the limited availability of comprehensive segmentation datasets covering various real-world scenarios hinders the performance of existing methods. To address this, we introduce SceneX, a novel open-source dataset featuring 10 challenging non-ideal scenarios, establishing a new benchmark for evaluating and improving the robustness and real-world applicability of the segmentation models. Extensive experiments demonstrate the efficiency and effectiveness of FSANet.
Read the full abstract
Computer Vision
Robust 3D Reconstruction from Multi-View Optical Satellite Imagery via Reliability-Aware Height-Evidence Fusion in Gaussian Splatting
Robust 3D reconstruction from multi-view optical satellite imagery requires fusing complementary but sometimes conflicting geometric evidence. Digital surface models (DSMs) are the primary elevation representations for satellite-based 3D reconstruction, making reliable height estimation essential. However, in a Gaussian scene representation jointly optimized from multiple views, Gaussian responses at different elevations can support competing height hypotheses at the same rendered location, while conventional alpha-weighted elevation aggregation may produce intermediate elevations that do not correspond to physical surfaces. To address this challenge, we formulate DSM reconstruction as a reliability-aware height-hypothesis fusion problem and propose HLC-GS, a reliability-aware Height-Layer Consistency Gaussian Splatting framework for multi-view satellite 3D reconstruction. HLC-GS organizes projected Gaussian responses into candidate height hypotheses and evaluates their relative support using layer competition and Gaussian footprint support. A continuous height-layer risk map guides dominant-layer reliability correction and secondary-layer suppression during optimization. The proposed training strategy regulates conflicting Gaussian responses within the shared representation to improve the reliability of reconstructed surface elevations. Experiments on seven scenes from the DFC2019 and IARPA2016 datasets demonstrate improved DSM reconstruction accuracy. Compared with EOGS, HLC-GS reduces the average DSM MAE from 1.46~m to 1.18~m and RMSE from 2.78~m to 2.58~m, while increasing PAG$_{2.5}$ from 86.09% to 88.61%, with comparable computational cost.
Read the full abstract
Materials Science
Interplay between Interlayer Shift and Twist: Twisted van der Waals Nanowires Driven by Rotational Twinning
In van der Waals(vdW) layered materials, interlayer shift and twist have enabled the control of material properties through polytype and moire engineering. Various approaches, including bottom-up synthesis and manual layer-by-layer stacking, have been utilized to engineer targeted stacking configurations. However, the interplay between interlayer shift and twist, as well as reliable mechanisms for fine-tuning these parameters, remains largely unexplored. Here, we report a previously unrecognized twisting mechanism arising from preferred tilted stacking and twinning in vdW crystals. Electron diffraction and atomic-resolution scanning transmission electron microscopy(STEM) imaging reveal that the lattice planes of group-IV chalcogenide GeSe_{2-x}Te_x rotate continuously along the nanowire growth axis, with twist rates depending systematically on nanowire radius. Atomic-scale imaging further identifies a continuous rotational twin boundary extending along the central region of the nanowire. First-principles calculations and structural relaxation simulations confirm that the twisting deformation originates from energetic competition between the preferred interlayer stacking registry and the strain cost imposed by rotational twinning. These findings establish rotational twinning as an intrinsic route to spontaneous twist formation and provide a design principle for realizing twist-engineered vdW crystals with compatible crystal symmetries and stacking motifs.
Read the full abstract
High Energy Physics (Phenomenology)
Weak Decays of the $\Lambda_{b}$ Baryon in Light-Front Dynamics
We investigate the exclusive semileptonic and nonleptonic $\Lambda_{b} \to \Lambda_{c}(p)$ decays within the Standard Model by using the light-front quark model. To determine the behavior of the $\Lambda_{b} \to \Lambda_{c}(p)$ transition form factors, we employ the Bethe-Salpeter formalism in the timelike region, effectively accounting for both valence and nonvalence contributions. Using these form factors, including nonvalence contributions, we obtain branching fractions of $\Lambda_b \to \Lambda_c\,\ell\,\bar{\nu}_{\ell}$, $\Lambda_b \to \Lambda_c\,\tau\,\bar{\nu}_{\tau}$, $\Lambda_b \to p\,\ell\,\bar{\nu}_{\ell}$ and $\Lambda_b \to p\,\tau\,\bar{\nu}_{\tau}$~($\ell=e$ or $\mu$) are found to be around $5.39\%$, $1.41\%$, $3.33\times 10^{-4}$ and $2.08\times 10^{-4}$, respectively, which are consistent with the experimental measurements. The ratios of $R^{\ell\tau}(\Lambda_{c})=\frac{{\cal B}({\Lambda_b}\to {\Lambda_c}\,\tau\,\bar{\nu}_\tau)} {{\cal B}({\Lambda_b}\to {\Lambda_c}\,\ell\,\bar{\nu}_l)}$ and $R^{\ell\tau}(p)=\frac{{\cal B}({\Lambda_b}\to p\,\tau\,\bar{\nu}_\tau)} {{\cal B}({\Lambda_b}\to p\,\ell\,\bar{\nu}_l)}$, are given by $0.261^{+0.097}_{-0.117}$ and $0.624^{+0.119}_{-0.129}$, respectively. The forward-backward asymmetries in the above semilepton decays are also examined. Our results indicate that, within the light-front framework, the nonvalence contributions to the asymmetries are negligible compared to the $\beta$-induced uncertainties. In addition, we calculate the branching ratios for the nonleptonic decays of $\Lambda_{b}\to \Lambda_{c}(p)\,M$ with $M$ being the pseudo scalar and vector mesons with the results found to be consistent with the current experimental data.
Read the full abstract
High Energy Physics (Phenomenology)
Probing the Tau Neutrino Magnetic Moment via the $\mu^{-}\gamma \rightarrow \mu^{-}\nu\bar{\nu}$ Process at Future Muon Colliders
We investigate the sensitivity of future muon colliders to the anomalous magnetic moment of the tau neutrino within a model-independent effective field theory framework. The analysis is performed through the subprocess $\mu^{-}\gamma \rightarrow \mu^{-}\nu\bar{\nu}$ where the initial-state photon is described using the Equivalent Photon Approximation. Signal and background events are generated with MadGraph5$\_$aMC$@$NLO, followed by parton showering and hadronization with PYTHIA8. Detector effects are simulated using DELPHES3, while the event reconstruction and analysis are carried out via the MadAnalysis5 framework. Optimized kinematic selection criteria are determined for center-of-mass energies of 3, 10 and 30 TeV muon colliders. The expected sensitivities are evaluated using the Asimov significance method. The best sensitivity is obtained for the 30 TeV muon collider option, where the anomalous magnetic moment of the tau neutrino can be probed down to $\mu_{\tau\tau}=5.21\times10^{-8}\,\mu_B$ at the 5$\sigma$ significance level assuming a 1% systematic uncertainty. Our sensitivity bounds improve the current direct experimental limit reported by the DONUT Collaboration up to one order of magnitude and demonstrate the strong potential of future muon colliders for probing neutrino electromagnetic interactions.
Read the full abstract
Artificial Intelligence
Coverage-Aware Virtual IMU Augmentation for Low-Resource Human Activity Recognition
IMU-based human activity recognition (HAR) enables continuous, privacy-friendly monitoring of daily activities using wearable sensors. However, building reliable HAR models that generalize across diverse users and real-world conditions requires large amounts of labeled IMU data, which are expensive and difficult to collect. Existing approaches mainly rely on augmentation or synthesis to expand available data, but indiscriminately adding virtual samples may provide little new coverage and introduce unreliable supervision. To overcome these challenges, we propose a novel coverage-aware virtual IMU augmentation framework that decides where to supplement real data, how to generate and select virtual candidates, and how strongly to weight them during training. Specifically, we select diversity and scarcity anchors in a learned sensor embedding space, convert anchor dynamics into prompts, and generate virtual IMU candidates for each anchor. We then rank candidates by a selection cost combining anchor proximity and label consistency, and incorporate the selected candidates into HAR training with reliability-based weights. Experiments on public HAR benchmarks show that our method consistently improves recognition performance over competitive baselines, and ablation studies confirm the effectiveness of the proposed framework design.
Read the full abstract
Combinatorics
Ordered Ramsey numbers of 3-uniform hypergraphs with bounded weak degeneracy
The ordered Ramsey number $r_<(G,H)$ of ordered $k$-graphs $G$ and $H$ is the least integer $N$ such that every red-blue edge-coloring of the naturally ordered complete $k$-graph on $[N]$ contains a blue ordered copy of $G$ or a red ordered copy of $H$. We prove that there is an absolute constant $c>0$ such that, for every integer $d\ge1$, there is a constant $C_d>0$ for which every weakly $d$-degenerate ordered $3$-graph $H$ on $t$ vertices satisfies \[ r_<\bigl(H,K_3^{(3)}(n)\bigr) \le t\,2^{C_d n^{2-c/d}} \] for every positive integer $n$. This resolves a problem posed by Balko and Vizer (SIAM J. Discrete Math., 2022) in a stronger form. Furthermore, we show that the weak-degeneracy hypothesis cannot be replaced by bounded standard degeneracy. In particular, for every sufficiently large $n$, there exists a $1$-degenerate ordered $3$-graph $F$ on at most $2^{O(n)}$ vertices such that $r_<\bigl(F,K_3^{(3)}(n)\bigr)>2^{\Omega(n^2)}.$
Read the full abstract
Human-Computer Interaction
EgoAsk: Egocentric Teaching of Personalized Object Knowledge for Household Robots
Unlike users, who know their own belongings and routines, household robots cannot easily acquire such personalized object knowledge automatically and depend on users to teach them. User-initiated teaching requires users to arrange dedicated teaching sessions and decide what to teach, even when they are unsure what the robot needs to learn. We introduce EgoAsk, a smart-glasses-based system that proactively embeds personalized object teaching into everyday activities. EgoAsk shares the user's first-person view with the robot, identifies gaps in personalized object knowledge, and analyzes ongoing activity to ask context-relevant questions that support future household assistance. To examine how teaching initiative and question timing affect users' teaching experiences, we conducted a within-subjects study with 18 participants and found lower reported knowledge-gap monitoring burden with robot-initiated questioning and less need for context reconstruction with EgoAsk. These findings characterize teaching burdens and timing preferences, offering design implications for egocentric robot-teaching systems.
Read the full abstract
Combinatorics
Ehrhart reciprocity and forced factors in three plane-partition enumerators
We study three plane-partition enumerators arising from Schreier-Aigner's quasi-symmetry classes. Their realizations as lattice-point enumerators, together with staircase translations of interior lattice points, yield factorizations by Ehrhart-Macdonald reciprocity. We determine the consecutive linear factors, the parity and degree of the residual polynomials, and explicit divisibility bounds for their coefficient denominators. The denominator argument includes the half-integral translation required by the second-kind classes. We also derive a corrected size-five formula for the symmetric second-kind class. Exact computations verify irreducibility of the quasi-symmetric residual polynomials for every size from $3$ to $24$.
Read the full abstract
Software Engineering
RECTIFY: An Interactive Workbench for Post-Evaluation RAG Diagnosis, Repair, and Verification
Retrieval-Augmented Generation (RAG) evaluators can identify failures such as weak retrieval, poor grounding, incomplete answers, and unsupported generation, but they rarely help developers decide what to repair next. We present RECTIFY, an interactive Streamlit workbench that turns evaluated RAG cases into auditable repair workflows. RECTIFY filters cases that do not require repair, routes remaining failures into actionable families and finegrained repair slices, and generates editable repair cards that developers can approve, reject, or verify through sandbox reruns. On a controlled RAG benchmark, RECTIFY surfaces interpretable failure profiles across BM25, dense, and hybrid retrieval: BM25 mainly triggers noisy-retrieval repairs, while dense and hybrid retrieval leave smaller sets of multi-part underretrieval and underused-evidence cases. Additional analyses show that pre-filtering reduces unnecessary repair candidates and that slicelevel routing yields more targeted repair cards than broad family-level diagnosis. RECTIFY is publicly available as an open-source Streamlit workbench 1 for helping developers turn evaluation results into inspectable repair decisions.
Read the full abstract
Spectral Theory
Irreducibility of the Bloch variety for periodic Schrödinger operators in arbitrary dimension
Let $d\ge1$ and $V\in C(\mathbb{T}^d;\mathbb{C})$. We prove that the Bloch variety of $-\Delta+V$ is irreducible modulo periodicity. The proof combines holomorphic continuation of spectral band functions with integer translations of quasimomentum. Using analytic geometry and perturbation estimates along imaginary rays, we show that, after suitable integer translations, all irreducible components contain the same holomorphic spectral branch.
Read the full abstract
Statistical Methodology
Equitable Partition Realizability for Dynamics-preserving and Privacy-aware Network Reconstruction
Degree-sequence realizability is the combinatorial basis of configuration models, but degree constraints alone do not ensure the preservation of graph dynamics. Hence, configuration models are unable to recover centrality measures, unless these are strongly correlated with the degree sequence. To address this matter, we introduce EP-realizability, the analogue problem induced by an equitable partition (EP): given the EP of a graph, decide whether the partition is realized by a simple undirected loopless graph and therefore construct such a graph. After defining the problem, we solve it by reducing it to sub-problems related to Havel–Hakimi and the Gale–Ryser theorem. We also face the challenge of solving the problem with an Approximate Equitable Partition ($\varepsilon$-EP), so that it is possible to reconstruct a network starting from partial and more privacy-preserving information. We evaluate privacy with edge overlap, deriving also, for our proposed $\varepsilon$-EP-realizability solution, a predictor for this metric. Experiments on Karate, Cora, CiteSeer and PubMed datasets show that our algorithm achieves a favourable and tunable privacy–utility trade-off, comparing the results with Havel–Hakimi algorithm, Newman's configuration model and a stochastic block model. Finally, both with real data and random graphs, we show that our algorithm has approximately linear time complexity with respect to the number of edges.
Read the full abstract
Atomic Physics
Second-Order Rayleigh-Schrödinger Perturbation Theory for the GRASP2018 Package: Core Correlations
The paper presents a further development of the method G. Gaigalas, P. Rynkun, L. Kitovienė, Second-Order of Rayleigh-Schrödinger Perturbation Theory for the Grasp2018 Package: Core-Valence Correlations, Lithuanian Journal of Physics, 64, No. 1, 20-39 (2024) (https://doi.org/10.3952/physics.2024.64.1.3), based on a combination of the relativistic configuration interaction method and on the stationary second-order Rayleigh-Schrödinger many-body perturbation theory in an irreducible tensorial form. In this extension the perturbation theory accounts for both electron core-valence and core correlations when an atom or ion has any number of valence electrons meanwhile relativistic configuration interaction accounts for the rest of correlations. This allows a significant reduction of the space of the configuration state function for complex atoms and ions. We also demonstrate how this method works for energy structure calculation of Fe XV ion.
Read the full abstract
Artificial Intelligence
Turn-level Multiscale Density Ratio Estimation for LLM Agents
With the rapid development of Large language model (LLM), agent systems enhanced by LLMs show huge potential in being able to deal with complex tasks, especially involving multi-step thinking or interaction with tools. For applying LLM techniques with a well-designed agent paradigm, post-training of LLM in multiple agent scenarios is necessary to achieve better performance. Among the variable post-training techniques, alignment methods such as PPO, DPO, DIL, and GRPO become popular because many papers show a significant positive impact on the model's performance by punishing negative samples while keeping acceptable training complexity. However, most alignment methods address simple single-turn tasks, and there remains room for improvement for complex multi-turn tasks. We propose Turn-level Multiscale Density Ratio Estimation (tlm-DRE), which assigns different weights on corresponding turns and proposes asymmetric token-level training based on the positive-negative space gaps across multiple turns of tasks. The results of the experiment on a wide range of agent benchmarks show that the proposed method performs competitively compared to traditional alignment methods. The proposed training method enables LLMs to perform robustly in multi-turn reasoning tasks with both in-domain and out-of-domain conditions.
Read the full abstract
Analysis of PDEs
Double-logarithmic stability for a parabolic inverse problem on CTA manifolds
We establish a double-logarithmic stability estimate for the recovery of a time-dependent potential in the parabolic equation $(c^{-1}\partial_t-\Delta_g+q)u=0$ on a conformally transversally anisotropic manifold. The partial input–output map associates an initial state and lateral Dirichlet data supported in a prescribed open set with the terminal state and the Neumann trace on another open set. These sets contain the positive and negative boundary parts determined by a limiting Carleman weight, respectively. The measurement discrepancy is the operator norm of the difference of two such maps, whose range has improved Sobolev regularity. We prove stability under a uniform stability assumption for the attenuated geodesic ray transform on a family of non-tangential geodesics. This assumption is verified when the transversal manifold is simple and for regular families on certain non-simple manifolds. The proof uses Gaussian beam quasimodes with a uniform $O(h^{1/2})$ concentration estimate, geometric optics solutions obtained from boundary Carleman estimates, and stability of the geodesic ray transform for small attenuation. Quantitative analytic continuation for Hilbert-space-valued Fourier transforms and Sobolev interpolation yield the double-logarithmic modulus.
Read the full abstract
Materials Science
Floquet Spin-Antiferroelectricity in Collinear Antiferromagnets
Multiferroics combining magnetic and polar orders offer opportunities for optical control of spin and electric degrees of freedom. Here, using symmetry analysis and Floquet theory, we establish Floquet spin-antiferroelectricity coexisting with unconventional magnetism in periodically driven collinear antiferromagnets, qualifying it as an unconventional multiferroic. This driven phase supports compensated, spin-resolved in-plane electric polarizations perpendicular to the vertical rotation axis, which are strictly forbidden by crystalline symmetry in equilibrium. Using a tight-binding model, we elucidate how light polarization controls the emergence of polar order and spin responses. Moreover, first-principles-based Floquet calculations predict its realization in monolayer $\text{MnPS}_3$, identifying a realistic two-dimensional antiferromagnetic platform. These findings establish a nonequilibrium route to spin-antiferroelectricity beyond equilibrium symmetry constraints and connect Floquet engineering, unconventional magnetism, and multiferroicity through optical control of spin and polar degrees of freedom.
Read the full abstract
Combinatorics
Counterexamples and symmetry for uneven orthogonal mass partitions in the plane
Grünbaum asked whether every planar convex body admits, for every $0\leq t\leq 1/4$, two orthogonal lines cutting it into pieces with cyclically ordered areas $t,t,1/2-t,1/2-t$. Bárány posed the analogous question for well-behaved planar measures and conjectured that the answer there is negative. We confirm Bárány's conjecture in a particularly robust form: for every fixed $0<t<1/4$ we construct smooth, strictly positive, centrally symmetric, strongly log-concave measures arbitrarily close to the standard Gaussian for which the prescribed partition does not exist. In contrast, we prove that the partition exists for every $t$ whenever the measure is invariant under an orientation-reversing affine involution. We also exhibit a $96$-point counterexample for which no pair of perpendicular lines produces cyclic counts $8,8,40,40$.
Read the full abstract
Combinatorics
Mathieu groups as flag-transitive automorphism groups of block designs
In this article, we study $2$-$(v,k,\lambda)$ designs $\mathcal{D}$ admitting a flag-transitive almost simple automorphism group $G$ with socle one of the Mathieu groups. In conclusion, we obtain all such $2$-designs with explicit constructions with appropriate references to known designs. To our knowledge, we obtain $101$ newly-constructed flag-transitive $2$-designs.
Read the full abstract
Computer Vision
De-GAN - Dynamic Parameter Tuned GAN for 3D Medical Image Segmentation: A Step Towards Generalisation
Brain tumor segmentation remains difficult because enhancing tumor (ET) has low contrast and overlaps surrounding tissue, while scanner and site variation causes domain shift. We propose DE-GAN, a contrast-enhancing conditional GAN that combines input-adaptive dynamic convolutions, style-aware feature mixing, and coordinate encoding to synthesize slice-adaptive FLAIR images. A label-guided, class-conditional target separates tumor-core (TC) and ET intensities while preserving anatomy. The generated FLAIR is concatenated with the original MR modalities and used to train a 3D U-Net. Across BraTS 2015, 2018, and 2019, DE-GAN improves segmentation over the baseline and static EnhGAN replacement on most reported TC/ET metrics, with the largest gains from retaining both original and enhanced FLAIR. Code and pretrained models are available at https://github.com/zkhansuri-ui/DE-GAN.
Read the full abstract
Machine Learning
TAME: Token Attribution and Masking for Emergent misalignment
Fine-tuning an aligned language model on narrow, flawed data can induce harmful behavior far outside the training domain, known as emergent misalignment (EM). Prior work has localized EM in model weights, activations, and training documents, but it remains unclear which training tokens carry the relevant fine-tuning signal. We introduce TAME (Token Attribution and Masking for Emergent Misalignment), a three-stage framework: token attribution scores how strongly the fine-tuning update raises each response token's likelihood, using forward passes through a released LoRA adapter; signal characterization finds patterns among high-attribution tokens; and causal validation tests them by attribution-guided loss masking. On released EM organisms and a 6,849-example medical-advice split, attribution is concentrated (the top 5% of tokens hold 32% of the mass) and, in Llama, depleted for medical vocabulary but enriched for a register of unwarranted certainty, even after controlling for token rarity. Masking high-attribution tokens during fresh fine-tuning cuts EM by 23x in Llama and 36x in Qwen, with the perplexity cost concentrated on the targeted register rather than on medical content; an equal random mask leaves EM unchanged. In Llama, the attribution pattern suggests that EM-relevant signal lies more in how confidently flawed content is expressed than in its domain vocabulary; the causal masking effect itself holds across both model families.
Read the full abstract
High Energy Physics (Phenomenology)
Probing Local Charm Hadronization Dynamics with Hadron-Anchored Energy Correlators
We introduce the hadron-anchored energy correlator (HAEC), a jet-restricted realization of the fragmentation energy correlator and the semi-inclusive energy correlator frameworks, and apply it to heavy-flavor-tagged jets in hadron collisions. Using Pythia~8 simulations of ${\rm D}^0$- and $\Lambda_c^+$-tagged jets, we find a pronounced, localized suppression of energy flow around the $\Lambda_c^+$ relative to the ${\rm D}^0$, followed by a sharp transition scaling as $\theta_0\propto1/p_{\rm T}^{\rm jet}$ with little tune dependence. The conventional jet-axis radial profile shows qualitatively different color-reconnection dependence, suggesting reduced sensitivity of HAEC to jet-axis effects. A beauty-sector study can distinguish a heavy-quark-mass origin from a local fragmentation-vertex origin.
Read the full abstract
Artificial Intelligence
Beyond Episodic AI: Cognitive Field Networks for Biologically Inspired Persistent Cognition
Cognitive Field Theory describes cognition as memory-dressed collective dynamics, in which slow relaxation modes support a persistent cognitive field. By connecting non-Markovian memory dynamics to discrete recurrent state evolution through an extended state, we develop a Cognitive Field Network (CFN), a recurrent Transformer architecture with hidden-field re-entry, \( \Phi_{n+1} = F_\theta(X_{n+1},\Phi_n) \). Rather than prescribing an explicit memory operation, the CFN allows the full token-resolved hidden field to re-enter the next computational cycle. We find that learning organizes this pathway into a functional channel for persistent, content-dependent internal states, with temporal persistence systematically controlled by the recurrent training horizon. The learned dynamics generalize beyond this horizon: semantic continuation sustains the recurrent state without explicit answer replay, whereas unsupported states exhibit finite passive relaxation. Periodic re-exposure to relevant input renews the surviving field, producing an approximately stationary nonzero regime over extended recurrent trajectories. Unrelated-input and recurrence-off controls fail to reproduce this behavior, while near-paraphrased input produces weaker renewal, revealing the dependence of persistence on both field re-entry and input relevance. These findings connect memory-dressed field formation, input-driven reorganization, and recurrent state continuity within a unified dynamical framework. The CFN thus provides an experimentally controllable platform for studying persistent, history-dependent cognition without a separately prescribed memory system.
Read the full abstract
Game Theory
Constant Swap Regret in General-Sum Games via Two-Scale Higher-Order Optimism
We give deterministic and uncoupled learning dynamics for finite multiplayer general-sum games under full-information feedback that achieve constant individual swap regret in self-play, independent of the horizon $T$. With $n$ players and at most $m$ actions each, every player's individual swap regret is $O(\sqrt n\,m\log m\log^{5/2}(nm))$ at every finite horizon. The dynamics use the classical Blum-Mansour framework with optimism. Each player predicts the deviation gains, uses these predictions to update a row-stochastic transition matrix, and plays its stationary distribution. Our new ingredients include a tailored row normalization map and a two-scale higher-order predictor. An adversarially robust variant, obtained through a generic common-prefix switching wrapper, preserves the self-play bound up to a universal constant and guarantees individual swap regret at most $7\sqrt{mT\log m}$ in the adversarial setting.
Read the full abstract
Number Theory
Prime-power congruences for level-one eigenforms
We study prime-power congruences for the prime-to-\(p\) Hecke eigensystems of normalized cuspidal level-one eigenforms as the weight varies, and we address the problem of classifying such systems for small prime powers. We construct Hecke-equivariant transfer maps between level-one modular-symbol modules via multiplication by suitable lifts of Dickson invariants; these maps reduce the problem to finite computation and propagate Hecke operator relations through all weights. For \(p=2,3,5,7\), we obtain all-weight classifications modulo \(2^8\), \(3^4\), \(5^3\), and \(7^2\), respectively.
Read the full abstract
Materials Science
Electric-Field-Switchable Altermagnetism via Ligand Rotation in a d0 Metal-Organic Framework
Altermagnetism combines vanishing net magnetization with momentum-dependent spin splitting. While altermagnetic signatures have been identified in metal-organic frameworks (MOFs), non-invasive reversible control remains challenging. Here we report a route to electric-field-switchable altermagnetism in a flexible d0-MOF, in which polar substituents couple the external field to ligand rotation. In the planar ground state, pz orbitals mediate 180-degree ligand-metal-ligand superexchange (J2), stabilizing antiferromagnetic order. Rotating ligands out of plane activates px/py orbitals, enhances 90-degree pathways (J1), and reverses J1/J2 competition. The antiferromagnetic-to-altermagnetic crossover occurs at approx. 34 degrees, with spin splitting of 84 meV at 90 degrees. The 90-degree altermagnetic state is switched on by the electric field and switched off upon field removal, as the constrained-rotation landscape decreases monotonically back toward 0 degrees, enabling barrierless relaxation to the antiferromagnetic state and reversible on/off operation. Ab initio molecular dynamics at 300 K shows thermal fluctuations alone cannot synchronize ligand rotation. Polar substituents provide the required coupling for electric-field control; for fluorinated substituents, the critical field is approx. 0.22 V/Angstrom, comparable to field-effect devices. This work establishes ligand p orbitals, rather than transition-metal d orbitals, as the origin of altermagnetic order and shows that polar substituents enable electric-field control for organic spintronics.
Read the full abstract
Computation and Language
TIAO: Token Importance-Aware Policy Optimization for Text Summarization
Text summarization requires models to condense content while preserving key qualities such as consistency and coherence. Large language models (LLMs) have shown strong performance on this task and can be further improved through reinforcement learning (RL). However, most existing methods apply reward signals directly to undifferentiated token sequences, overlooking the varying importance of individual tokens to word and sentence level quality in summarization. In this paper, we propose Token Importance-Aware Policy Optimization (TIAO), a novel reinforcement learning strategy that explicitly leverages token-importance awareness. Specifically, TIAO identifies core tokens based on token dependency and reweights a trajectory's advantage according to its overall dependencies. Experiments on the real world dataset show that our TIAO achieves highly competitive results, and that a 7B foundation model enhanced by TIAO performs comparably to GPT-4 and GPT-5-nano. Code is available at https://github.com/TechCloud-x/TIAO
Read the full abstract
Combinatorics
Linear matroid products: a synthetic approach
The recently established duality between tensor, symmetric and exterior products of uniform matroids on the one hand, and abstract (bi-)rigidity matroids on the other hand, connects theorems and open questions from both areas, previously thought unrelated. In particular, a 1981 question of Mason asks if any two uniform matroids admit a freest product. Via duality, its reformulation due to Cruickshank, Jackson, Jordán and Tanigawa asks if the generic birigidity matroid is the freest abstract birigidity matroid for its parameters. A related conjecture of Jackson and Tanigawa asks if the generic $2$-hyperconnectivity matroid is the freest $\{K_4,K_{3,3}\}$-matroid. We show that these problems can be addressed effectively, and often solved completely for the class of linearly representable matroids. To this end, we introduce star-basis normal forms that allow to compare representations of abstract (bi-)rigidity matroids over the same field, resulting in a refinement of the weak order relation on the underlying matroids. Utilizing it, we prove that the generic birigidity matroid is the freest linearly representable abstract $(a,b)$-birigidity matroid. This confirms Mason's conjecture for linear matroids. We prove that every representable abstract $2$-rigidity matroid admits a rigidity matrix representation. This is a strengthening of the maximality property of the generic $2$-rigidity matroid. We also prove that every representable abstract $2$-rigidity matroid in which every copy of $K_{3,3}$ is a circuit admits a hyperconnectivity matrix representation. It follows that the generic rigidity and hyperconnectivity families $\mathcal{R}_2$ and $\mathcal{H}_2$ are the only linearly representable $2$-rigidity families.
Read the full abstract
Spectral Theory
Weighted heat traces of the Dirichlet Laplacian on Lipschitz domains
We prove an asymptotic expansion of a weighted heat trace of the Dirichlet Laplacian on a bounded Lipschitz domain. The weight is given by a power of the distance to the boundary times a bounded function that is continuous near the boundary. Depending on the exponent of the weight, we obtain one-term or two-term asymptotics. We present two applications, namely a version of one-term asymptotics of weighted Riesz means for arbitrary orders, as well as convergence results for a family of measures that describes localization of Laplace eigenfunctions.