Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Sunday 13 September

Robotics

Learning-Based Dynamic Obstacle Avoidance for a UAV Using Only Three Range Sensors

We present a learning-based approach to kinodynamic online motion planning for an Unmanned Aerial Vehicle (UAV) operating at a fixed altitude in unknown dynamic environments, where real-time avoidance of both static and dynamic obstacles must be achieved under conditions of extreme partial observability. The UAV is controlled with a single degree of freedom (yaw only), resulting in constrained, nonholonomic motion similar to fixed-wing platforms. The proposed framework integrates a behavior grid map representation with Deep Reinforcement Learning (DRL), using Proximal Policy Optimization (PPO) for stable policy learning in continuous control. The key idea is the co-design of a state representation and control policy that enables reliable navigation using only three low-cost directional range sensors, without reliance on dense sensing modalities such as LiDAR or vision-based systems. The behavior grid map dynamically aggregates sparse measurements into a structured local representation that supports real-time decision-making for obstacle avoidance and target reaching. Extensive simulations across environments of varying sizes and obstacle densities demonstrate that the proposed standard and enhanced methods achieve higher success rates than PPO variants and Model Predictive Control (MPC) (94% vs. 79–90% in small-scale high-congestion scenarios, and 83% vs. 62–71% in large-scale high-congestion scenarios), while maintaining real-time performance. Real-world experiments across four scenarios further confirm practical feasibility, with consistent target-reaching behaviour and no collisions under the tested conditions.
Read the full abstract

Digital Libraries

Has Scientific Talent Shifted from Depth to Breadth?Evidence across Papers, Knowledge Inputs, Careers, and Teams

Generative artificial intelligence raises a central question for scientific training and organization. Is research shifting from deep specialization toward broad individual knowledge? We examine this proposition across papers, cited knowledge, contributor histories, and teams using 47,959 articles from six fields over 2010-2025, 51,736 resolved cited works, and chronologically reconstructed prior publication histories for 1,754 randomly selected index contributors. From 2010 to 2022, team size increased by an estimated 37.3% (95% confidence interval [34.4%, 40.3%]), while paper topic breadth declined by 0.0144 on a 0-1 hierarchical distance scale. Cited knowledge was stable to modestly broader, revealing a divergence between focused outputs and the reach of knowledge inputs. Established contributors' prior breadth increased by 0.0190 [-0.0078, 0.0459] by 2019-2022, within a +/-0.05 equivalence bound assessed in sensitivity analysis. In mature citation windows, one standard deviation of focal depth was associated with 8.2% higher 1 + FWCI [1.9%, 14.9%]; average breadth and interaction associations were smaller under the specified equivalence bounds. Post-2022 deviations from earlier trends were not systematic, and recent changes did not vary clearly with baseline AI intensity across 83 subfields. The findings support a differentiated structure of scientific expertise in which focused individual accumulation coexists with expanding collaboration and sustained access to diverse knowledge inputs.
Read the full abstract

Quantum Physics

Certification cost of quantum models: measurement correlation, not parameter count

Reporting the Fisher geometry of a trained variational quantum model is routine; quoting the shot budget that would establish it is not. Certifying an empirical Fisher matrix to relative Frobenius error $\varepsilon$ under coordinate-wise parameter shift costs $\Theta(B p^{2} V/(\varepsilon^{2} G))$ circuit executions, where $V$ is the measured readout variance and $G$ the measured squared gradient norm, with uniform allocation optimal in that class. One constant reproduces the cost of two circuit families whose exponents differ by a full power of $p$. The exponent is an identity in how $nV$ and $nG$ scale with the register, holding family by family to $0.001$ across 624 matrix-product-state cells once the finite-$p$ prefactor is removed. The cubic cost is therefore a finite-size window, set by whether the readout light cone grows with the register. A product family to 256 qubits gives $1.966$ (95% CI $1.934$–$1.997$); a brickwork entangler falls from $2.853$ below ten qubits to $1.715$ beyond sixty-four; a blocked entangler gives $1.984$ at a fixed cone width against $3.034$ at a proportional one. Fixed device connectivity fixes the cone, so a cubic budget from a small simulation overestimates a large machine, on top of hardware multipliers $2.07\times$ ($1.41$–$3.02$), $2.38\times$ and $1.91\times$ on ibm_marrakesh, ibm_fez and ibm_kingston. Cost-optimal readout weights cut the measured shot budget by $2.67\times$ ($1.33$–$4.00$) on hardware, flat from four to twelve qubits. A discrepancy model fitted on cheap circuits transfers its mean inside the calibration grid and, at six larger sizes named before the data, does not: nominal 90% intervals cover 36%, and split conformal is the only rung that stays near nominal.
Read the full abstract

High Energy Physics (Theory)

Caterpillar Degenerations of Spectral Curves and Double Gelfand-Zeitlin Geometry

In this paper, we study the decomposition, in the caterpillar or weak-coupling limit, of a spectral curve with two irregular poles of order two, namely a spectral curve of type $(2,2)$, into two spectral curves each having one regular singularity(order-$1$ pole) and one irregular pole of order two, namely spectral curves of type $(1,2)$ or $(2,1)$. Such spectral curves can be identified with a double Gelfand–Zeitlin (DGZ) system. We show that the Duistermaat–Heckman measure on the DGZ side can be identified with the Weyl measure on the gauge-theory side arises from gluing two quivers. Furthermore, the Fourier expansion of the isomonodromic tau function can be interpreted as a Peter–Weyl expansion in the real polarization of the DGZ system. On the other hand, we introduce the nodal caterpillar spectral network. Applying the caterpillar spectral network, we then obtain an explicit expression for the Stokes matrix up to a normalization factor. This expression agrees with the existing analytic formulas. Moreover, we identify the variation of endpoint normalization arising in the Stokes computation with the equivariant Euler class of the fluctuation complex over the Coulomb moduli space. Finally, using the gluing technique for spectral curves and the DGZ system, we conjecturally predict the perturbative coefficients of the higher-rank $P_{\mathrm{III}}$ isomonodromic tau function from the viewpoint of spectral geometry.
Read the full abstract

Artificial Intelligence

Safety Signals to Verify NetOps Agents with Action-Level Granularity

Agentic Network Operations (NetOps) are an emerging paradigm promising to enable workload-aware, self-adjustable, and reliable autonomous networks. While agents have proven their value in incident summarization and telemetry signal extraction, their effectiveness as autonomous control-loop engines heavily relies on their long-horizon reliability. One such setting is the datacenter fabric, where an agent must respond to alarms and operator intents while abstaining from high-risk actions that may cause or extend downtime. Abstention, however, presupposes that an action's impact is known pre-execution, which necessitates a per-action ground truth that NetOps agent benchmarks do not provide. We construct such a ground truth for the network repair task of NetArena. A symbolic replay of the emulated network, validated against the environment at every turn, yields the exact value of every action. From the action-level value, we derive two pre-execution targets, namely whether an action reduces the repair distance (progress) and whether it increases it (harm). We show across 10 agent models, that agent verifiers leveraging internal signals predict both harm and progress more reliably than a baseline using observable signals only. Perspectively, we aim to use these signals as safety feedback to an agent harness to abstain from risky actions and protect the target system.
Read the full abstract

All authors Tobias Labarta, Frederik Pahde, Novak Boškov, Maximilian Dreyer, David Birkenberger, Manzoor Ahmed Khan, Sebastian Lapuschkin, Wojciech Samek

Information Theory

Dependency, Compression, and Synergy: A Unified Information-Theoretic View of Multimodal Learning

Recent advances in multimodal foundation models have intensified the need to understand how different modalities share, preserve, and complement information. Mutual Information (MI), the Information Bottleneck (IB), and Partial Information Decomposition (PID) provide complementary perspectives, yet existing studies often treat them as isolated tools. This survey presents an information-theoretic perspective connecting these principles as progressively refined views of multimodal information processing: MI characterizes inter-modal dependency, IB explains task-oriented information preservation under compression, and PID decomposes preserved information into redundancy, uniqueness, and synergy. We review 170 recent studies (2018–2026) and 12 foundational works, organizing multimodal learning around four challenges: cross-modal alignment, information-efficient fusion, interaction-type characterization, and scaling to multimodal foundation models. Rather than using application domains as primary taxonomy axes, we interpret healthcare, robotics, recommendation systems, affective computing, and wireless communications as empirical validations of these information principles. Beyond taxonomy, we organize existing multimodal paradigms within a single information-theoretic coordinate system – the Generalized Multimodal Information Lagrangian – in which they occupy exact or approximate parameter corners, and whose unoccupied regions name candidate method families the literature has not yet built. We further discuss how emerging multimodal foundation models instantiate these principles at scale and identify open challenges including scalable information estimation in high-dimensional settings, standardized evaluation across information-theoretic methods, combinatorial complexity of multimodal PID, and the transition from post-hoc information analysis toward information-aware multimodal learning.
Read the full abstract

All authors Liangjian Wen, Linjie Li, Jiang Duan, Yong Dai, Jianzhuang Liu, Zhao Kang

High Energy Astrophysical Phenomena

Evolution of the High-Energy Excess in Swift J1727.8-1613 during Its 2023 Flare State

We investigate the evolution of the high-energy excess in Swift J1727.8-1613 during its 2023 flare state using joint Insight-HXMT and INTEGRAL/ISGRI observations covering 2-500 keV. Fits to the broadband spectra with a model including thermal Comptonization and disk reflection leave systematic positive residuals above ~150 keV. Adding a power-law component improves the fits and yields photon indices of 2.08-2.61, demonstrating that the high-energy excess beyond the thermal Comptonization continuum is present throughout the flare state. We also show that all spectra can be well described by the hybrid Comptonization model eqpair, without requiring any additional high-energy component. The fitting results indicate that the energy supply to the electrons transitions from predominantly thermal heating to non-thermal acceleration, and that the electron injection spectrum steepens abruptly near the onset of the flare state. During this evolution, the radio spectral index changes from approximately zero to negative values, accompanied by the ejection of three transient jet knots. Based on this temporal association, we discuss a possible connection between the increase in non-thermal power indicated by our spectral analysis and the ejection of the transient jet.
Read the full abstract

All authors Xiao Fan, Bei You, Yi Long, Han He, Liang Chen

Computer Vision

A Generative AI Integrated Multimodal Framework for Low-Latency Multi-Camera Person Re-Identification

Person re-identification (ReID) is essential for multi-camera surveillance and tracking, yet remains difficult due to viewpoint and illumination changes, occlusion, background clutter, and low resolution imagery. We propose a generative AI integrated multimodal ReID framework designed explicitly for robustness under missing cues and low latency deployment. The key idea is a cost aware early-exit cascade that prioritizes inexpensive, high confidence evidence and only triggers expensive modalities for ambiguous cases. Our system integrates (i) global visual embeddings from segmented person regions, (ii) automatically generated fine grained semantic attribute descriptions generated by vision-language models (VLMs), and (iii) optional facial embeddings when face observations are reliable. To optimize the balance between accuracy and latency, we use a cost aware early-exit cascade instead of fusing all modalities. Specifically, we first inspect the top-k retrieval results to determine whether the query is unambiguous. If the best match is clearly separated from the remaining candidates, we stop early and return the result to minimize latency; in ambiguous cases, we keep multiple hypotheses and invoke additional modalities (face/semantic) with adaptive reliability weighting to refine the decision. We report person re-identification performance using mAP and Rank-1 accuracy on the Market-1501 and DukeMTMC-reID benchmarks. The proposed adaptive early-exit cascade resolves 60.7% of DukeMTMC-reID queries and 68.4% of Market-1501 queries without invoking semantic reasoning, reducing computational overhead while maintaining competitive retrieval performance.
Read the full abstract

All authors Leon Fernando, C Dombawala, P. Hettigoda, Vanodhya G. Warnasooriya, Ishara Neranjana, Rashmika Nawaratne

Neural and Evolutionary Computing

Surrogate-Assisted Genetic Programming with Phenotypic Characterisation in Dynamic Multi-Mode Project Scheduling

Dynamic multi-mode resource-constrained project scheduling requires decisions to be made under precedence constraints, limited resources, multiple execution modes, and uncertain activity durations. Genetic programming (GP) can automatically evolve heuristic rules for such problems, but its simulation-based fitness evaluation is computationally expensive. This study investigates phenotypic characterisation (PC) in surrogate-assisted GP to evolve higher-quality scheduling heuristics under a fixed budget of full simulation-based fitness evaluations. A key question is how GP individuals should be encoded into phenotypic characterisations to support effective fitness estimation. To answer this question, three PC encoding schemes with different levels of information richness are designed: priority-value encoding, which preserves raw rule outputs; rank encoding, which captures candidate ordering; and binary encoding, which represents final scheduling decisions. These encodings are combined with different distance metrics to measure behavioural similarity between GP individuals. The experimental results show that binary encoding with Euclidean distance provides the most effective and robust surrogate guidance. Further analyses show that surrogate estimation accuracy alone does not fully explain the performance differences. The PC representation also determines how effectively phenotypically redundant offspring are removed and how much behavioural diversity is retained after preselection. Ablation experiments further demonstrate that duplicate removal and surrogate preselection provide complementary benefits, with their combination producing the largest improvement. These findings highlight that effective surrogate-assisted GP depends not only on identifying promising offspring, but also on controlling redundancy and preserving useful diversity during evolutionary search.
Read the full abstract

High Energy Physics (Phenomenology)

Chiral symmetry breaking for large "Nf" and the properties of the "rho" meson near the conformal window

We study how the ground-state properties of the rho meson respond when the number of light-quark flavors N_f is driven towards the conformal window. The interaction is a symmetry-preserving, confining vector–vector contact interaction whose effective coupling carries a flavor dependence designed to encode the screening produced by fermion loops in the deep infrared. That interaction feeds the Schwinger–Dyson equation for the dressed-quark propagator and the homogeneous Bethe–Salpeter equation in the rainbow-ladder truncation, regularized in the Schwinger proper-time scheme so that quark production thresholds are absent while chiral symmetry remains broken. Raising N_f weakens the coupling, suppresses the dynamically generated mass and restores chiral symmetry together with deconfinement at a critical flavor number N^{c}_{f}. The vector channel responds differently from the pseudoscalar one. Because the $\rho$ is not a Goldstone boson, its mass is not protected by the symmetry that is being restored, and it simply follows the shrinking constituent scale, while the canonically normalized amplitude E_rho and the leptonic decay constant f_rho soften along the way. In this framework the rho sits above the nominal q\bar{q} threshold for every flavor number examined, so the state survives only as long as confinement removes that threshold. Dissociation is therefore governed by the divergence of the confinement length scale rather than by a crossing of the bound-state mass, and we contrast both criteria. The three elastic electromagnetic form factors G_E, G_M and G_Q, computed in the generalized impulse approximation, flatten as N_f grows, the zero crossing of G_E migrates towards the infrared and the charge radius expands, whereas the magnitude of the quadrupole moment decreases. The rho thus becomes a larger and rounder object as the theory approaches conformality.
Read the full abstract

All authors Aftab Ahmad, Samreen Fatima, Muhammad Shahbaz, Marco Antonio Bedolla, Alfredo Raya, Muhammad Imran

Group Theory

Hierarchical hyperbolicity, ball quotients, and the moduli space of smooth cubic surfaces

We prove that the orbifold fundamental group of the moduli space of smooth complex cubic surfaces is a hierarchically hyperbolic group. This places it within a powerful geometric framework whose prototypical examples are mapping class groups. The proof uses a known incomplete complex hyperbolic metric on the moduli space, and applies in a broader setting which includes a number of other moduli spaces.
Read the full abstract

Soft Condensed Matter

Dynamical Anisotropy of a Colloidal Glass Under Pressure

Pressure is a critical thermodynamic parameter that profoundly influences the physical properties of glasses. Pressure-induced densification and structural transformation endow glasses manufactured under such conditions with exceptional mechanical and optical properties. Although pressure-treated glasses have been characterized by ensemble-averaged methods such as X-ray diffraction and Raman spectroscopy, their microscopic dynamics have rarely been addressed, limiting our understanding of the coupling among structure, dynamics, and mechanics. Here, using a binary hard-sphere colloidal glass confined in cylindrical capillary tubes, we impose a constant pressure on the particles through the tangential component of gravity. This approach enables the first investigation of pressure effects on colloidal glasses. We find that the dynamics are substantially frozen, whereas the structural change remains comparatively mild. At low pressure, spatial correlations among structural, dynamical, and local elastic heterogeneities are observed. Remarkably, dynamical anisotropy emerges in response to pressure, characterized by faster motion parallel to the pressure direction than perpendicular to it. This anisotropy is attributed to an instability induced by the strong pressure force. Concurrently, structural and dynamical heterogeneities are strongly suppressed under pressure. Our experiments characterize the microscopic dynamics of colloidal glasses under pressure and offer design principles for the manufacturing protocol of glass materials.
Read the full abstract

General Topology

A New Approach to Universal Measurability

V. Fedorchuk, A. Chigogidze and T. Banakh in 2003 and V. Bogachev in 2024 posed the following questions: (i) is it true that $P_\tau(X)$ is $C$-embedded in $P_\sigma(X)$; (ii) is it true that $P_R(X)$ is $C$-embedded in $P_R(\beta X)$ if and only if $X$ is pseudocompact, where $P_\sigma$, $P_\tau$ and $P_R$ are the functors of probability measures on the space $X$ that are, respectively, $\sigma$-additive on the Baire $\sigma$-algebra, $\tau$-additive, and Radon? The answers to these questions are negative. In this paper the questions are put into a general framework: for spaces of measures $Q_p(X)\subset Q_q(X)$ of various types we study when $Q_p(X)$ is $C$-embedded ($C^*$-embedded) in $Q_q(X)$. It is proved that for spaces of alternating measures $M_p(X)\subset M_q(X)$ the $C$-embeddedness, the $C^*$-embeddedness and the $G_\delta$-density of $M_p(X)$ in $M_q(X)$ are equivalent, and a criterion in terms of sequences of continuous functions is given. The question of $C$-embedding of measure spaces is an extension of the question of coincidence of measure spaces, which is a development of the classical concepts of universally measurable and universal measure zero sets. Note (corrected version): incorrect statements of the previous versions are marked or removed; see the last section of the paper.
Read the full abstract

Logic in Computer Science

A Hybrid Dependency-Aware Framework for Task Decomposition and Dynamic Agent Generation in Oracle-to-PostgreSQL Migration

Large language model (LLM)-based database migration is often treated as direct code transformation, although enterprise Oracle systems contain heterogeneous SQL and PL/SQL artifacts with different dependencies, execution order, complexity, and validation needs. This paper proposes a hybrid dependency-aware framework that identifies migration tasks, builds a cross-file dependency graph, condenses cyclic dependencies, and uses task specifications to generate specialized migration agents at runtime. The deterministic path combines ANTLR-based parsing with typed dependency extraction, while an LLM fallback is invoked only for units that cannot be parsed reliably. On a corpus of 116 Oracle files, the pipeline produced 1,037 units with zero coverage gaps and 1,271 AST-derived dependencies. The fallback processed 165 parse-error units, recovered 496 additional validated dependencies, eliminated unresolved-dependency units, and increased resolved internal edges from 446 to 527. The graph contained four dependency-respecting phases, while cycle handling was validated separately using Tarjan SCC condensation. A complementary experiment on 1,006 PL/SQL files regenerated 623 scripts (~62%), of which 380 (~61%) executed successfully in PostgreSQL 16. Tables achieved about 85% regeneration success, whereas no query regenerations succeeded under the evaluated specification-mediated baseline, and procedural objects remained strongly dependent on schema context. These results motivate dependency-aware context delivery, task-specific validation, and differentiated agent routing. The paper also formalizes task-to-agent mapping, introduces monitoring and diagnostics for execution feedback, and defines a controlled comparison of monolithic, static-decomposition, dependency-aware, and dynamically orchestrated migration strategies.
Read the full abstract

All authors Oleg Grynets, Oleg Kaskun, Alona Seletska, Daryna Tukalo, Vasyl Lyashkevych

Artificial Intelligence

Question's Gambit: The First Move Matters in Agentic Deep Search

Deep research agents answer complex questions through iterative loops of searching, reading, and reasoning. Recent work on reasoning-intensive benchmarks such as BrowseComp-Plus shows that well-configured lexical retrieval can surface high-quality evidence, yet agents may still fail to connect documents carrying evidence to the gold documents. We identify a deep research agent's first retrieval move as an important design decision for this setting. We introduce Question's Gambit, a first-move retrieval module that decomposes the question into a set of clues, reformulates them into complementary searches, consolidates the retrieved results, and reranks the candidate pool before the agent begins its iterative search-and-reasoning process. This produces an opening context designed to support both clue aggregation and final-answer verification. We further evaluate on MultiHop-RAG to test whether these benefits transfer beyond BrowseComp-Plus to a more conventional multi-hop question structure. Experiments on BrowseComp-Plus show that Question's Gambit improves retrieval recall and downstream agent accuracy over strong baselines, improving answer accuracy from 83.1% to 90.5% with gpt-5.5 over Pi-Serini, the strongest reported agentic baseline. Our results confirm that effective agentic deep research depends not only on the tools available inside the loop, but also on the quality of the first move. We published our implementation publicly at https://github.com/radinhamidi/Question-s-Gambit.
Read the full abstract

All authors Radin Hamidi Rad, Amin Bigdeli, Negar Arabzadeh, Sajad Ebrahimi, Charles L. A. Clarke, Benjamin C. M. Fung, Ebrahim Bagheri

High Energy Astrophysical Phenomena

High-energy spectral cutoffs in the prompt emission of Fermi gamma-ray bursts: bulk Lorentz factors, emission radii, and a cutoff-peak energy relation

The high-energy end of the gamma-ray burst (GRB) prompt spectrum carries information on the physical conditions of the relativistic outflow, but the number of well-characterized spectral cutoffs is small. We present a systematic search for high-energy spectral cutoffs in the time-integrated prompt spectra of 139 GRBs observed by Fermi between 2008 July and 2025 December, selected to have broadband coverage either through a LAT detection or through bright BGO emission. Joint GBM, LLE, and LAT spectra over $T_{90}$ are fitted with four empirical models and compared using the Bayesian information criterion, yielding 106 bursts with well-constrained cutoff energies $E_c$. An empirical two-component Gaussian mixture model applied to $\log_{10}(E_c/\mathrm{MeV})$ separates a low-$E_c$ group from the main distribution at $E_c=2.12$ MeV; the 77 bursts lying firmly above this boundary are interpreted within the internal $\gamma\gamma$ pair-opacity framework. Combining $E_c$ with wavelet-based minimum variability timescales (median $0.119$ s), we infer bulk Lorentz factors of $11.7$ to $2.78\times10^{3}$ (median 145) and emission radii of $\sim10^{13}$ to $10^{15}\,\mathrm{cm}$. Neither the $\Gamma$-$L_{\mathrm{iso}}$ nor the $\Gamma$-$E_{\mathrm{iso}}$ relation is statistically significant for the full sample, whereas the 27 bursts with measured redshifts show a moderate $\Gamma$-$L_{\mathrm{iso}}$ correlation with a slope of $0.36_{-0.23}^{+0.22}$. We further find a strong rest-frame correlation between the cutoff and peak energies, $E_{c,z}\propto E_{p,z}^{2.15_{-0.97}^{+0.96}}$, for the 26 bursts with measured redshifts, which persists after controlling for redshift.
Read the full abstract

Disordered Systems and Neural Networks

Anderson localization in periodic elastic systems with random perturbations

This paper investigates Anderson localization in subwavelength elastic periodic systems with random perturbations. For the unperturbed system, we use layer potential techniques to reformulate the eigenvalue problem as boundary integral equations, and derive asymptotic formulas for the subwavelength eigenvalues. For perturbed systems, we apply the Floquet transform to obtain a periodic formulation and derive equations determining the resonant frequencies under general perturbations. Numerical experiments for perturbed periodic monomers and dimers agree with the theoretical predictions. We further demonstrate Anderson localization by increasing the strength and number of random perturbations. These results provide a mathematical foundation for understanding subwavelength localization in elastic metamaterials.
Read the full abstract

Combinatorics

Sharp stability for cross $t$-intersecting families of permutations in the linear range

Two families $\mathcal{F},\mathcal{G}\subseteq S_n$ are cross $t$-intersecting if every $\sigma\in\mathcal{F}$ and $\tau\in\mathcal{G}$ agree on at least $t$ points. A $t$-coset is a coset of the stabilizer of $t$ points. A subset of $S_n$ is non-trivial if it is not contained in any $t$-coset. Let $d_m$ denote the $m$-th derangement number. We prove that, for all $t\geq1$ and $n\geq400t$, every pair of cross $t$-intersecting families $\mathcal{F},\mathcal{G}\subseteq S_n$ satisfies the following: (i) $|\mathcal{F}||\mathcal{G}|\leq((n-t)!-d_{n-t}-d_{n-t-1})((n-t)!+t)$ if $\mathcal{F}\cup\mathcal{G}$ is non-trivial. (ii) $|\mathcal{F}||\mathcal{G}|\leq((n-t)!-d_{n-t}-d_{n-t-1}+t)^2$ if both $\mathcal{F}$ and $\mathcal{G}$ are non-trivial. (iii) $\min\{|\mathcal{F}\setminus\mathcal{C}|,|\mathcal{G}\setminus\mathcal{C}|\}\leq t((n-t-1)!-(n-t-2)!)$ for some $t$-coset $\mathcal{C}$ if $t\geq2$. We also characterize all extremal configurations. The first result extends a theorem of Ellis (2011) to an exponentially wider range and sharpens the stability theorem of Keller, Lifshitz, Minzer and Sheinfeld (2024); the second gives a product version of the classical Hilton–Milner–Frankl theorem for permutations; and the third settles the remaining cases $t\geq2$ of a conjecture of Ellis (2011) in a stronger form. In all three results, the linear dependence on $t$ is essentially optimal. Our proofs are based on the spread approximation method introduced by Kupavskii and Zakharov and on an approach to cross $t$-intersection problems developed by the present authors, with several essential refinements. As an application of our approach, we prove a product version of the Hilton–Milner–Frankl theorem for the alternating group.
Read the full abstract

Artificial Intelligence

Dynamic Learning Solutions: A System for Personalized Educational Video Generation

We present an automated pipeline that converts NCERT textbooks into interactive video explanations that respond directly to user queries. A user uploads a PDF and asks a question; the system then generates a video-based explanation as output, handling both text and visual elements from the PDF for multi-modal retrieval and response generation. The pipeline combines a Retrieval-Augmented Generation (RAG) model with generative multimedia components. The RAG stage is optimized for the structure of NCERT textbooks and performs best on content from those books. Given a user query, the RAG model retrieves relevant content from the PDF and generates a multi-scene script containing narrative explanations and structured visual prompts aligned with the textbook's explanatory style. These prompts are passed to a Stable Diffusion module, implemented layer by layer for interpretability and control, which generates contextually relevant images. The images are then processed by DynamiCrafter to produce animated sequences. Finally, a Google Text-to-Speech module generates synchronized narration, aligning speech with the visual scenes through time-based control. The result is a coherent video explanation integrating animation, narration, and textbook-aligned visuals, transforming static educational material into an engaging learning experience. By combining multi-modal document retrieval, generative visual models, animation frameworks, and speech synthesis, this pipeline demonstrates a scalable approach to delivering interactive, personalized digital education content.
Read the full abstract

All authors Siddhanth Sridhar, Shreya Chaurasia, Baddela Sai Yaswantha Reddy, Deepak Parmar, Shylaja S S

Analysis of PDEs

A note on existence of smooth solution to Jacobian equation for compactly supported smooth data in $\mathbb{R}^2$

In this note, we give an explicit construction of global solutions to the prescribed Jacobian equation \[ \det(\nabla u)=f\mbox{ in }\mathbb{R}^2, \] for a class of data. For every $f\in C_c^1(\mathbb{R}^2)$ and $p>1$, we construct a solution $u\in \dot W^{1,2p}(\mathbb{R}^2)\cap L^\infty(\mathbb{R}^2)$. In particular, no sign condition or integral constraint is imposed on the compactly supported data. For $f\in C_c^\infty(\mathbb{R}^2)$, the construction yields a smooth solution. We also consider rapidly decaying data and prove the existence of global solutions with bounded gradient for every $f\in\mathcal{S}(\mathbb{R}^2)$. Finally, we extend the construction to compactly supported data that are measurable in one variable and $C^1$ in the other. Our proof relies on a similar idea as in [Moser, Trans. Amer. Math. Soc. 1965].
Read the full abstract

Soft Condensed Matter

Avalanches can increase stored energy in a granular fault

Slowly sheared granular materials generally store mechanical energy and dilate between abrupt failures that release energy and compact the material. Here, simultaneous measurements of torque, layer thickness, acoustic emission, and photoelastic force networks reveal all four combinations of energy release or storage with contraction or dilation in a compressed granular fault. Most strikingly, some avalanches both dilate the layer and increase the elastic energy transmitted to the resisting boundary. These events reorganize force chains beyond the shear band and produce a distinct acoustic response. The results show that an avalanche need not relax a driven disordered material; it can instead redistribute stress into a more highly loaded configuration, a mechanism with potential relevance to the physics of both laboratory and natural faults.
Read the full abstract

All authors A. Douin, E. Saurety, V. Levy dit Vehel, L. Combe, L. Vanel, O. Cochet-Escartin, O. Ramos

Optics

Chirped Bragg Gratings as Passive Photonic Reservoirs: An Experimental Proof-of-Concept for Temporal Information Processing

Passive photonic structures offer a potential route toward reservoir computing by exploiting intrinsic optical propagation, delay, interference, and memory effects for temporal information processing. This work investigates whether a chirped Bragg grating (CBG) can exhibit fundamental physical properties relevant to a passive photonic reservoir. Rather than presenting the CBG as a complete reservoir computer, the study provides an early proof-of-concept assessment based on experimentally measured device characteristics. Wavelength-dependent group delay and reflection coefficient measurements obtained from a silicon photonic CBG are incorporated into a distributed delay model in which multiple delayed contributions form the reservoir states. The resulting system is examined with respect to distributed delay, fading memory, temporal mixing, and memory capacity using a linear readout based on the standard memory capacity formulation. The results demonstrate that the measured CBG response provides a distributed temporal memory over the experimentally observed delay range and produces temporal mixing through the superposition of multiple delayed contributions. The memory capacity analysis further indicates that past input symbols can be reconstructed from the distributed delay states, providing quantitative evidence of temporal information retention in the measured CBG response. These results suggest that a passive CBG possesses several physical characteristics relevant to reservoir computing and may therefore provide a simple photonic substrate for reservoir-like temporal processing. The study is intended as an initial proof-of-concept, providing a foundation for future experimental and task specific investigations of passive CBG-based photonic reservoirs.
Read the full abstract

Information Theory

Successive Refinement Under Strong-Sense Perfect Perception

We revisit a multiterminal lossy source coding problem named successive refinement and derive the rate-distortion-perception region under the strong-sense perfect perception constraint in the presence of unlimited common randomness. Specifically, in successive refinement, one aims to compress a source sequence and allows two distinct decoders to recover the source sequence at different distortion levels. By imposing the strong-sense perfect perception constraint, our results refine the previous result by analyzing the impact of the perceptual quality. Our achievability proof is inspired by output constrained lossy source coding and our converse proof adapts the proof steps of the standard successive refinement problem. Furthermore, we provide a numerical example of the Bernoulli source to illustrate our result and show that the Bernoulli source under Hamming distortion is successively refinable even with the strong-sense perfect perception constraint.
Read the full abstract

All authors Yu Yang, Changhong Liu, Weijie Yuan, Lin Zhou

Geometric Topology

Gluing $\partial$-Morin maps on manifolds with boundary and its applications

We study $\partial$-Morin maps, a class of smooth maps from manifolds with boundary such that both the maps themselves and their restrictions to the boundary have only Morin singular points, and the singular point sets of the maps are disjoint from the boundary. We develop a gluing construction that provides a unified framework for studying maps from manifolds with boundary through corresponding maps from closed manifolds. Using this framework, we derive Euler characteristic formulas for $\partial$-Morin maps and a congruence relating the signature to the self-intersection number of the singular point set for $\partial$-fold maps from $4$-manifolds to $3$-manifolds. We also establish an inequality relating singular fibers of stable maps from a $3$-manifold to the plane to the simplicial volume of the source manifold. We further apply these results to the existence problem for $\partial$-fold maps and to the non-singular extension problem.
Read the full abstract

Computational Physics

Neural Modal Decomposition: Architectural Priors from Observables

Many engineering building blocks behave as multi-port linear time-invariant systems. RF cavities, photonic devices, and superconducting quantum chips, despite their different underlying physics, all share a common mathematical structure for their port-level response. Each entry of the response matrix is a sum of contributions from a small number of intrinsic resonant modes, the pole-residue form. A model capable of predicting such responses for arbitrary geometries and arbitrary port configurations, while simultaneously extracting the underlying eigenmode structure, could therefore offer a design principle potentially applicable across all these domains. We propose a neural framework that learns this modal decomposition end-to-end, supervised only by system-level observables and without supervising the modal parameters themselves. The architecture decomposes into a port-independent pole predictor and two port-dependent coupling predictors whose outputs are combined entry-wise, separating intrinsic from port-dependent features. This factorization yields a single trained model that generalizes to port counts unseen during training, whereas direct regression needs a separate model for each port count, with an output size that grows as $\mathcal{O}(N^2)$. Although the modal parameters are never supervised, the freely parameterized poles converge to the physical resonances, in agreement with poles extracted by the AAA rational approximation algorithm. We instantiate the framework in radio-frequency electromagnetic surrogate modeling. A model trained only on 2-port data accurately predicts $N$-port responses unseen during training.
Read the full abstract

High Energy Physics (Theory)

Entanglement Harvesting Landscapes: A Common Computational Framework

Entanglement harvesting provides an operational means of probing the nonlocal correlation structure of quantum fields through localized detector-field interactions. Although harvesting has been investigated in a wide variety of spacetime backgrounds and quantum field states, existing studies largely focus on individual detector configurations or specific physical settings. In this work, we develop a unified perturbative framework for entanglement harvesting with localized Unruh-DeWitt detectors that is applicable to arbitrary detector trajectories and quantum field states through the corresponding Wightman function. By expressing the detector response in terms of dimensionless variables and analytically reducing the perturbative integrals to numerically efficient representations, the framework enables a systematic exploration of multidimensional harvesting landscapes, phase boundaries, and harvesting robustness. As representative applications, we investigate inertial detectors in the Minkowski vacuum, thermal field states, and uniformly accelerated observers. We show that finite temperature enhances both the local detector response and the nonlocal exchange amplitude, leading, within the perturbative Gaussian-switching framework considered here, to an enlargement of the harvesting region in parameter space. The resulting harvesting landscapes provide a global characterization of detector-field interactions and demonstrate how temperature and observer motion reshape the competition between local detector noise and nonlocal field correlations. The framework developed here provides a unified and readily extensible methodology for investigating entanglement harvesting across a broad class of relativistic quantum systems.
Read the full abstract

Computation and Language

Policy Loopholes in Agent Evaluation: When Policy Ambiguity Masquerades as Agent Error

Agent benchmarks evaluate policy compliance but assume each policy determines a unique correct action. Natural-language policies can violate this assumption through silence, ambiguity, or contradiction, admitting multiple defensible readings that a single gold trajectory cannot capture. Auditing two $\tau^2$-bench domains, we develop a taxonomy of such policy loopholes and show that affected tasks produce unreliable scores: they lower scores across different models in different ways and make every model less consistent across repeated trials. A cross-domain comparison reveals that exploitability requires both policy ambiguity and tool permissiveness: when policy complexity exceeds what tools can enforce, agents resolve gaps inconsistently and scores become unreliable. Policy specification quality sets the ceiling on evaluation quality. Benchmark developers should audit policies before collecting gold annotations.
Read the full abstract

Artificial Intelligence

MOSCOPT: Mixture-of-Skills Collective Optimization for LLM Agents

Natural language prompts and skills serve as the strategic backbone of LLM-based agents. Recent advances in prompt and skill optimization have achieved notable gains, yet all existing methods optimize a single text template—missing the synergy among multiple complementary strategies. We propose MOSCOPT, a text-native, parameter-free algorithm that jointly optimizes a pool of $N$ skills and a gating skill $G$ that dynamically selects $K$ skills per step. To effectively optimize the skills, we build the EditAdam with internally maintained dual states. Through the three-phase interleaved updates with EditAdam, the system monotonically improves without gradient or parameter tuning. Extensive experiments and detailed ablations across 5 benchmarks and 3 target LLMs demonstrate that MOSCOPT consistently outperforms all baselines, and confirm that both the mixture-of-skills architecture with selective activation and the collective evolution with three-phase interleaving are essential to its superior performance. Code is released https://github.com/zhangzhenyu13/SummerClaw/tree/master/summerclaw/agent_trainer/algorithms/moscopt.
Read the full abstract

Econometrics

Identification and Inference in proxy-SVARs with non-Gaussian shocks

Two frequent approaches for identifying structural VARs are external instruments, which carry economic content but are often weak, and non-Gaussianity of the shocks, which provides statistical identification but carries no economic meaning. We combine the two strategies in a single generalized method of moments framework. This hybrid approach point-identifies the target shocks while also identifying the non-target shocks up to sign and ordering. Under suitable rank conditions, the higher-order moments of the structural shocks anchor the identification uniformly over the instrument strength. Consequently, under local-to-zero proxy relevance, estimators of the dynamic causal effects remain consistent, and standard asymptotic inference remains valid. Moreover, the Anderson-Rubin confidence sets are substantially narrower than their instrument-only counterparts. The hybrid estimator is also more efficient than either source of identification used in isolation: at any fixed proxy relevance, even a weak instrument increases the efficiency of the estimator through its covariance with the non-Gaussian moment block. Under local deviations from proxy exogeneity, we provide asymptotic bias bounds and show that stronger non-Gaussianity of the shocks compresses the bias. Finally, the over-identified structure yields two mutually orthogonal specification tests for proxy exogeneity and the validity of the higher-order moment conditions. We derive their limiting distributions and provide a bootstrap procedure for finite-sample critical values. Monte Carlo simulations and two applications with identification of oil news-shock and a Euro-area MP shock demonstrate the potential of our framework.
Read the full abstract

Systems and Control

Angle-Based Formation Tracking of Underactuated Planar Agents

This paper addresses the angle-based formation tracking problem for a class of heterogeneous planar underactuated agents subject to disturbances. A representative example is a group of underactuated surface vessels (USVs) operating in the surge-sway-yaw plane, in which each vessel has three degrees of freedom but only two independent control inputs, which are surge force and yaw moment. The desired formation is characterized by a set of longitudinal offset points, referred to as hand points, together with prescribed angular constraints among triplets of these points. The formation tracking problem is studied on a leader-follower interaction graph, assuming the leader moves at constant velocity. Under the assumption that relative velocity measurements are available, the first control law achieves asymptotic formation tracking with internal stability guarantees. Moreover, a second algorithm that does not rely on relative velocity information is introduced, which successfully drives the followers' hand points to their desired configuration. Numerical simulations involving USVs are presented to validate the effectiveness of the proposed approaches.
Read the full abstract

All authors Nhat-Minh Le-Phan, Yali Fan, Thien-Minh Nguyen, Lihua Xie