Algebraic Geometry
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 6 November
This paper addresses the birational geometry of three-dimensional algebraic varieties admitting a conic bundle structure. The central focus is on tetragonal transformations – a special class of birational maps between standard conic bundles that are not fiberwise and play a key role in the birational geometry of such varieties.
Artificial Intelligence
SafeOrchestrate: Runtime Checked Intent-Driven Orchestration for Cyber-Physical Systems
Modern cyber physical systems (CPS) integrate heterogeneous sensors, actuators, controllers, and services, composed at runtime rather than at design time. Orchestrating such systems through natural language (NL) is attractive, but unconstrained large language model (LLM) tool use is risky because actions must respect device capabilities, runtime state, and safety constraints. We present Safe Orchestrate, a reference architecture for runtime checked, intent driven CPS orchestration. Given an NL intent, it derives atomic goals, generates a runtime checkable specification for each, grounds the specifications to device affordances, and verifies every candidate action against runtime state and safety constraints before execution. In a Web of Things (WoT) instantiation, the architecture produces Linear Temporal Logic (LTL) style specifications from the NL intent, grounds them to Thing Description (TD) affordances exposed through the Model Context Protocol (MCP), and checks candidate actions against satisfiability modulo theories (SMT) backed guardrails. We evaluate this instantiation on simulated smart home, greenhouse, and industrial automation tasks against a direct LLM to MCP baseline. Safe Orchestrate maintains 100% required action accuracy on every task and 100% MCP Execution Similarity (MCP ES) on all but one, where MCP ES is 92%. By contrast, the baseline degrades on multi device, event triggered, and ordered tasks, with MCP ES falling to 13%. These results suggest that combining LLM based specification generation with role aware grounding and runtime constraint checking improves reliability for open CPS orchestration without enriched TD annotations or planning domain expertise.
Read the full abstract
High Energy Physics (Phenomenology)
Nucleon-resonance contributions to the $p\bar{p}\to\eta_c\eta$ reaction
Within an effective Lagrangian approach, we investigate the associated charmonium production reaction $p\bar{p}\to\eta_c\eta$ from threshold up to $\sqrt{s}=5.00\,\mathrm{GeV}$, incorporating intermediate contributions from the ground-state nucleon and the nucleon resonances $N(1535)$, $N(1650)$, $N(1895)$, and $N(1710)$. The effective resonance parameters are constrained by the BESIII measurement of the crossed decay $\eta_c\to p\bar{p}\eta$ for both the constructive (Solution C) and destructive (Solution D) radiative-interference solutions. Using these decay-constrained parameters, we predict the total and differential Born cross sections for the $p\bar{p}\to\eta_c\eta$ reaction. We show that coherent resonance exchanges dominate the near-threshold production dynamics and significantly enhance the total cross section compared to the pure nucleon-exchange contribution, which suffers from a strong dynamical cancellation. As the collision energy increases, the rapidly growing nucleon contribution progressively dilutes the resonance terms, reducing the relative difference between the total cross sections for Solutions C and D. Furthermore, while the pure nucleon-exchange amplitude exhibits an exact dynamical zero at $\theta=90^\circ$ due to the pseudoscalar coupling structure, resonance exchanges fill this node in the predicted angular distributions, providing an observable test of the underlying exchange mechanisms. These predictions can be tested in future antiproton annihilation experiments at $\bar{\mathrm{P}}\mathrm{ANDA}$.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Primordial non-Gaussianity as a large-scale cosmic-web bias
Primordial non-Gaussianity is a unique probe of the physics of inflation, but its large-scale-structure signature is difficult to measure because it appears on the largest, most cosmic-variance-limited modes. The standard view of local-type primordial non-Gaussianity is isotropic: it induces a scale-dependent correction to tracer bias, $\Delta b(k)\propto f_{\rm NL}k^{-2}$, on large scales. Here we show that the same large-scale response can be reformulated as an anisotropic, nonlocal environmental-bias effect. Motivated by the spectral cosmic-web hierarchy of Kitaura and Sinigaglia, we define a Hessian field $\mathcal{H}_{ij}(\bf{x})\equiv\partial_i\partial_j\nabla^{-4}\delta(\bf{x})$, whose trace obeys $\mathrm{Tr}\mathcal{H}=\nabla^{-2}\delta$ and therefore carries the same $k^{-2}$ enhancement that appears in the Dalal et al. scale-dependent-bias term. Diagonalizing $\mathcal{H}_{ij}$ defines four large-scale web environments, analogous to knots, filaments, sheets, and voids, although operating on scales much larger than the conventional nonlinear cosmic web. We assign one weight to each environment and test the construction with the AbacusPNG suite of local-PNG $N$-body simulations, using $f_{\rm NL}=\{-100,-30,30,100\}$. We show that these four weights reproduce the large-scale $k^{-2}$ rise of the tracer bias. We further show that existing halo catalogs without PNG can be post-processed to imprint an effective $f_{\rm NL}$ signature. Beyond mock generation, the resulting cosmic-web response motivates an observational statistic based on changes in tracer occupation of large-scale environments relative to a matched Gaussian reference, complementary to the conventional low-$k$ power spectrum.
Read the full abstract
Dynamical Systems
Positivity of metric entropy of the standard map at large parameters
We prove that the standard map $f_k(x,y)=(x+y+k\sin2\pi x,\,y+k\sin2\pi x)$ of the two-torus satisfies $\log(2\pi k+4)-2^{430}\le h_m(f_k)\le\log(2\pi k+4)$ for every $k\ge\exp(2^{50000})$, where $h_m$ is the metric entropy with respect to area. Thus $h_m(f_k)=\log k+O(1)$, the order of growth observed numerically since Chirikov; in particular $h_m(f_k)>0$ for all large $k$ and $h_m(f_k)\to\infty$, as conjectured by Sinai. Moreover, for each fixed $c<1$ the points whose top Lyapunov exponent is below $c\log k$ fill an area $O(1/\log k)$. Positivity of $h_m(f_k)$ for all sufficiently large $k$, with a threshold that is not effective, was obtained in a recent preprint by OpenAI. We keep some of its architecture and follow it closely in about a third of the results. New here are an explicit covering argument for cancellations and a balance across scales at a fixed parameter, an inequality between mean shortfalls that replaces the compactness argument over limits of rescaled orbit geometries; together they yield the explicit constants and the entropy bound.
Read the full abstract
Rings and Algebras
The center of an associative crossed module
In this paper, we define a Drinfeld-type center for an associative crossed module and prove that it is canonically the internal category of an explicit crossed module constructed from Mac Lane's bimultiplications. The resulting center carries a canonical multiplicative lifting, which induces a natural strict braiding, establishing its correspondence to a braided crossed module. We also examine the relationship between this center and Huq's categorical center. Finally, we obtain a canonical comparison morphism with Pirashvili's center of Lie crossed modules via the (braided) Liezation functors, which preserves braidings under an injectivity condition.
Read the full abstract
Optics
TwinLight: A Multi-Timescale Physical-Layer-Aware T-API-Compliant Optical Domain Controller Digital Twin
We demonstrate TwinLight, an open-source optical-network digital twin acting as an optical domain controller. Its T-API REST and telemetry streaming interfaces expose a physical-layer engine that combines a GNPy steady-state baseline with four analytical transients.
Read the full abstract
Audio and Speech Processing
GTCRN-SS: Lightweight Causal Speech Separation with Residual Allocation and Reconstruction Refinement
Low-complexity causal speech separation must preserve speaker information and allocate residual mixture energy without relying on future feature frames. We present GTCRN-SS, a two-stage time-frequency separator that adapts the compact GTCRN enhancement backbone to fixed-output speech separation. The model combines internal residual allocation, reconstruction-conditioned refinement, and frame-aligned recurrent-state transfer. Its complex-mask estimator assigns non-target content to an unreturned residual branch, while the complementary speech estimate conditions a second stage whose final masks remain anchored to the original mixture. A lightweight low-rank adapter transfers causal recurrent evidence between recursive executions without adding another recurrent memory network. The neural graph excludes future feature frames and incurs only the fixed analysis look-ahead of the centered short-time Fourier transform. On noisy Libri2Mix, GTCRN-SS achieves 10.1 dB SDRi and 9.5 dB SI-SNRi with fewer than one million parameters and a low computational footprint. Independently trained ablations confirm the benefits of recurrent-state transfer and reconstruction conditioning, and corpus-level diagnostics show that the internal branch primarily captures residual rather than target-speech content. These results establish GTCRN-SS as an effective quality-efficiency operating point for causal monaural speech separation.
Read the full abstract
Combinatorics
On the Motzkin-Straus theorem and clique number for k-uniform hypergraphs
In this paper, we establish a Motzkin-Straus type equality for k-uniform hypergraphs under certain conditions, which extends the classical Motzkin–Straus theorem for graphs. Using this equality, we present several spectral bounds for the clique number of k-uniform hypergraphs in terms of the spectral radii of the adjacency, signless Laplacian, and Laplacian tensors. When k=2, the bounds coincide with the corresponding known results for graphs.
Read the full abstract
Artificial Intelligence
Challenges, Opportunities, and Misconceptions in Neurosymbolic AI
We examine opportunities for neurosymbolic AI alongside increasingly powerful neural models, particularly with regards to efficiency, safety and interpretability. We identify two major challenges: ensuring semantic alignment between neural and symbolic components, and managing the computational cost of symbolic inference and learning. We discuss representative methodological approaches to these challenges and address several common misconceptions concerning differentiability, independence assumptions, and scalability. This paper synthesizes perspectives developed through discussions in the Neurosymbolic Programming and Reasoning (NPR) working group at the 2026 CNRS workshop Neurosymbolic Methods and Their Applications in Data Science, rather than providing an exhaustive survey.
Read the full abstract
Computer Vision
HiMEM: Hippocampus-Inspired Memory Consolidation, Pruning, and Composition for Vision-Language-Action Models in 3D Scenes
Memory plays a crucial role in long-horizon task execution and cross-task generalization for Vision-Language-Action (VLA) models operating in complex 3D scenes. However, existing VLA memory mechanisms suffer from memory noise, particularly in complex 3D scenes, as stored episodic memories contain extensive redundant details about scene layouts, object configurations, and robot-specific states, which obscure generalizable manipulation principles and hinder cross-task transfer. To address this challenge, we first introduce a hippocampus-inspired memory consolidation mechanism that synthesizes extensive episodic experiences into a compact set of essential semantic memories, enabling VLA models to derive generalizable principles from practical experience. Second, we propose an episodic memory pruning mechanism that removes redundant episodic memories whose contents are captured by consolidated semantic memories, thereby increasing effective memory capacity and improving long-horizon task execution. Finally, to handle complex task scenarios, we develop a flexible memory composition mechanism that jointly leverages multiple episodic and semantic memories to enhance cross-scenario generalization. Experiments on LIBERO, LIBERO-Plus demonstrate the effectiveness of HiMEM across different VLA backbones, improving the average success rate of pi_0 from 91.88% to 98.20% on LIBERO.
Read the full abstract
Solar and Stellar Astrophysics
Existence of Distinct Strong and Weak Shear Regimes of Self-Generated Turbulent Magnetic Reconnection
Magnetic reconnection can become fast in three-dimensional turbulent layers. However, the parameters and mechanisms that control the fast state are not yet fully clear. Existing guide-field simulations of self-generated turbulent reconnection show locally coherent flux-rope structures embedded in a stochastic layer, motivating a flux-rope-mediated picture, with reconnection rates of order $V_{\rm rec}/V_A \sim 0.01$ in MHD. Here, we test whether and how magnetic shear changes the reconnection regime, using 3D resistive-MHD simulations at $S_L=10^5$. We vary the guide field while keeping the initial reconnecting field strength and rate normalization fixed, comparing a guide-field, weaker-shear configuration with the anti-parallel, strong-shear limit. We find that the strong-shear regime is qualitatively distinct from the flux-rope-mediated guide-field regime. Rather than retaining a narrow layer and locally coherent flux-rope structures, the current layer develops short-wavelength corrugations that broaden it substantially, and the reconnection layer electric field is sustained by fluctuation EMF. The reconnection rate increases to $V_{\rm rec}/V_A \sim 0.03$, about three times the guide-field value. These results indicate that magnetic shear can select the mechanism controlling fast 3D turbulent reconnection, shifting the system from a guide-field regime consistent with flux-rope mediation toward a very fast turbulence-broadened regime. This transition provides a novel explanation for the sudden switch-on of fast reconnection in eruptive solar flares.
Read the full abstract
Software Engineering
comfort-db: A Python toolkit to access, preprocess and explore the oceanographic COMFORT dataset
comfort-db is a Python library that facilitates working with the COMFORT SQLite dataset, version 2. The dataset assembles global oceanographic measurements from ten datasets and contains a total of 458,724,734 in situ measurements from the years 1772 to 2020. comfort-db enables easy access to the database and provides preprocessing and exploratory analysis utilities. Preprocessing supports variable scaling and filtering by space, time and quality. Unit conversions can be applied during data loading or separately via a converter object. Gridding is supported and optionally works with bathymetry data to exclude grid cells on land. Moreover, the library supports general and field-specific exploratory data analysis through plotting functions, an interactive Dash app and functions to compute oceanographic profile and water mass statistics. comfort-db is open source (MIT license) and available from PyPI and GitHub.
Read the full abstract
Dynamical Systems
On the existence of automorphisms acting expansively on the space of one-parameter subgroups of connected Lie groups
For a connected Lie group $G$, we consider the action of Aut$(G)$ on Sub$_G$, the set of all closed subgroups of $G$ endowed with the Chabauty topology. We study the action of automorphisms of $G$ on Sub$^p_G$, the closure of the set of all closed one-parameter subgroups of $G$ in Sub$_G$, in terms of expansivity. We show that a nontrivial connected Lie group $G$ with dim$(G)\geq 2$ does not admit any automorphism which acts expansively on Sub$^p_G$. We also show that a certain class of subgroups of Aut$(G)$, which include all one-parameter groups of automorphisms in Aut$(G)$, do not act expansively on Sub$^p_G$. These results generalise a results of Chatterjee, Lekharu and Shah on tori and those of Prajapati and Shah on connected Lie groups of dimension greater than $1$.
Read the full abstract
Artificial Intelligence
AUTEUR: Acoustic Plan Learning for Red-Teaming Text-to-Audio Models
Automated red-teaming of text-to-audio models requires test prompts that pass textual screening and expose harmful acoustic content. The central challenge is to connect the sounds produced by the target model to both reusable test generation and prompt revision. Our key idea is to represent test descriptions as structured acoustic plans that organize foreground sounds, context, and vocal attributes. To this end, we propose acoustic plan learning, a framework that learns and refines these plans using waveform feedback. We train the plan generator through supervised fine-tuning followed by reinforcement learning with audio feedback while keeping the target audio model fixed. At inference time, the same trained model generates initial plans and uses feedback to revise their context and vocal attributes while preserving the foreground. Experiments across four target systems show attack success rates of 79.4% on TangoFlux and 95.6% on Kling. The resulting test prompts also transfer across open-source and closed-source models, indicating shared acoustic vulnerabilities.
Read the full abstract
Machine Learning
Open-world Reconstruction-based Classifier with Concept Drift Adaptation
Data stream processing has become central to modern machine learning applications, with concept drifts and novel class appearances posing the primary challenges faced by recognition methods. Adapting to concept drifts while also being able to detect novel classes and distinguish groups of unknown observations can be seen as a step towards effective method employment in an open-world setting. This work proposes a classification method that can detect and learn the distributions of new, unknown classes, as well as adapt to concept drifts once the distribution of known classes shifts. The proposed method uses the autoencoders' reconstruction errors and the KDE that models their distribution. The autoencoders incrementally adapt to the changing distributions of known classes via weight fine-tuning, resulting in continuous adjustment to evolving concepts. Conducted experiments used a diverse set of synthetic data streams, embeddings of a real-world static CIFAR dataset arranged into a stream to simulate concept drifts and the emergence of unknowns, as well as real-world datasets where novelty is observed. The methodology was compared with state-of-the-art approaches with three-criterion recognition quality assessment and resource consumption evaluation. The results indicate that the proposed method is competitive with reference approaches in stationary environments and performs best when concept drifts occur.
Read the full abstract
Multiagent Systems
ReSUM: Reasoning-Driven Multi-Agent Framework for Query-Focused Summarization
LLMs excel at language tasks, but long-meeting QFS remains difficult due to complex speaker dynamics, sparse key information, and limited data. Meetings involve disfluencies, long transcripts and complex discourse. QFS have high risk of information omission, hallucination, even for advanced models such as GPT-4-mini and Gemini. Existing end-to-end methods compress retrieval, evidence extraction, and summary generation into a single pass, failing to handle the complex reasoning required for targeted meeting summaries. We propose ReSUM, a modular multi-LLM framework coordinated by a planner that orchestrates retrieval and summarization agents. By distilling teacher reasoning into query- and plan-conditioned retrievers and summarizers, ReSUM enhances long-context robustness, minimizes irrelevant exploration, and generates more faithful and comprehensive query-focused summaries. Experiments show consistent gains on query-focused meeting summarization benchmarks.
Read the full abstract
Cryptography and Security
When Feedback Becomes a Backdoor: Tracing Backdoor Skill Formation in Text-Space Skill Optimization
Reference answers are a supervision channel in text-space Skill optimization, which produces reusable text artifacts called Skills that guide future agent behavior. Poisoning those answers can induce a persistent trigger-conditioned rule without giving the attacker access to the model, optimizer, or Skill file. We study this reference-feedback poisoning in SkillOpt by tracing an attacker-supplied trigger–payload mapping from reflection to held-out activation. In SearchQA, where the payload replaces a short answer, the natural attack retains an exact rule in all three seeds; each final Skill emits the payload on 200/200 triggered questions and 0/200 clean questions. In seed 42, removing the rule eliminates activation, and an in-run comparison shows similar clean accuracy to benign SkillOpt (169/200 versus 171/200). In SpreadsheetBench, where the payload requires an additional workbook edit, no natural run retains an exact rule across three seeds. Diagnostic interventions locate two successive bottlenecks: the Analyst abstracts away required literals, and, once literal preservation is enabled, edit-budget ranking can remove exact edits before candidate construction. Poisoned references can therefore create persistent backdoors, but exposure alone does not ensure that the induced rule is formed, selected, and retained.
Read the full abstract
Combinatorics
A Structural Lower Bound for the Ramsey Number of the Petersen Graph
In this note, we investigate the diagonal Ramsey number of the Petersen graph, denoted by \(R(\mathcal{P}, \mathcal{P})\). To the best of our knowledge, the dynamic survey Small Ramsey Numbers (Revision \#18, 2026) records the lower bound as 19, established by Harborth and Krause. We construct a novel 2-coloring on the complete graph \(K_{20}\) that avoids any monochromatic Petersen graph. By defining the blue graph as the complement of the red graph, we utilize a specific join graph structure \(K_{9,9} \vee \overline{K_2}\). We rigorously prove its Petersen-free property, thereby improving the previously documented lower bound to \(R(\mathcal{P}, \mathcal{P}) \ge 21\). Furthermore, we demonstrate the limit of this structural family by showing that the natural extension \(K_{9,9} \vee \overline{K_3}\) contains a Petersen subgraph.
Read the full abstract
Databases
Logical Scalability in Big Data Architectures: Impact of Data Modeling on the Database Layer
In modern Big Data architectures, scalability is often addressed through infrastructural expansion, involving vertical or horizontal scaling to manage growing data volumes. However, this hardware-centric perspective overlooks the logical scalability of the storage layer. A central challenge lies in how data modeling choices affect the storage layer of big data architectures. Specifically, when the data model is misaligned with the underlying query patterns, performance bottlenecks emerge and persist regardless of the available computational resources. This paper investigates the concept of logical scalability by conducting a comparative performance analysis of Document, Graph and Multi-Model database paradigms under varying workloads, queries and dataset scales. Our results demonstrate that performance degradation caused by model misalignment cannot be mitigated by additional computational resources alone. Increasing the number of machines while retaining a structurally inadequate data model yields performance equivalent to or worse than a single-machine configuration, as distributed coordination overhead compounds the inefficiencies of the underlying logical model. We demonstrate that efficiency is maximized when the logical structure of the database aligns with the inherent nature of the data and the intended analysis scope, a condition that proves to be more decisive than any infrastructural scaling strategy.
Read the full abstract
Machine Learning
Reliable Prerequisite-Aware Learning Path Recommendation under Uncertain Knowledge Structures: Long-Horizon Evaluation and Cross-Dataset Validation
Learning-path recommendation often depends on knowledge and prerequisite structures whose reliability is uncertain, while high accuracy in predicting the next resource does not necessarily establish reliable long-horizon path behaviour. This study develops a reliability-oriented prerequisite-aware framework that jointly examines immediate next-resource ranking, uncertain prerequisite structures, hard, soft and hybrid constraint semantics, graph robustness, and autoregressive path generation under course-level confirmatory evaluation and independent cross-dataset validation. Development used 3,187 MOOCCubeX courses, followed by a frozen confirmatory evaluation on 541 held-out courses and 37,747 transitions. The primary MOOCCubeX task is structural and course-prefix-conditioned rather than learner-personalised. Junyi provides independent structure-/hierarchy-aware external validation, uses hierarchy metadata rather than an explicit prerequisite graph and is not a zero-shot transfer setting. On the frozen MOOCCubeX evaluation, XGBoost pairwise was the strongest observed immediate ranker, with mean reciprocal rank (MRR) of 0.9048, whereas the proposed prerequisite-aware graph model achieved 0.7707. In the controlled graph-variant development ablation, the no-graph condition produced the strongest immediate ranking result, and immediate prediction showed strong dependence on permitted title/path-similarity information. Autoregressive evaluation exposed path properties not captured by one-step ranking. On Junyi, Markov achieved the strongest observed MRR of 0.4453, compared with 0.3954 for the proposed graph model, with metric-specific differences across ranking measures. Overall, immediate predictive accuracy, prerequisite-structure reliability, and long-horizon path quality should be treated as complementary rather than interchangeable evaluation dimensions in educational recommendation.
Read the full abstract
Machine Learning
Probably Safe Sim-to-Real Transfer with Lifetime Validity
We present Dejavu, a method that makes sim-to-real transfer of reinforcement learning policies in constrained Markov decision processes probably safe over an unbounded sequence of policy updates. An anytime valid test using per-decision importance sampling and a betting confidence sequence certifies each candidate trained in simulation before deployment using only trajectories collected by a safe baseline policy operating in production. Simulation quality does not affect the safety guarantee, only the production sample efficiency of the method. Finally, a summable per-test failure probability yields the lifetime valid property. Empirical results across three sim-to-real benchmarks support the theoretical work.
Read the full abstract
High Energy Astrophysical Phenomena
Activity of the ejected galactic nuclei and cosmic rays
The double and triple approaches of supermassive central black holes are a fairly common process in the hierarchical picture of galaxy formation. In this case, the ejection of a black hole is possible; it may carry the accretion disk and some amount of stars with it. The activity of the galactic nucleus can be restored after the ejection. One consequence of this activity is an ultrafast gas outflow, accompanied by a shock wave. We show that the acceleration of cosmic rays at such a shock is more effective than in the case of a stationary galactic nucleus due to the lower density of the surrounding gas and the higher velocity of the shock front. In this case, proton acceleration can occur up to energies of ~10^{19} eV, which is an order of magnitude higher than in an ordinary nucleus in the centers of galaxies.
Read the full abstract
Computation and Language
Syn2DRE: Synergistic Dual Teacher-Student Framework for Document-level Relation Extraction
Document-level Relation Extraction (DocRE) aims to identify relations between entities across a document but typically relies on costly large-scale annotations. While pseudo-labelling enables the use of low-quality data, existing methods often suffer from inefficiency and confirmation bias. To address these challenges, we propose Syn2DRE, a semi-supervised framework that combines self-supervised learning with cross-supervision in a lightweight teacher-student architecture to produce more reliable pseudo-labels. Additionally, we introduce a unified end-to-end training strategy to further improve efficiency of the framework. Experiments on multiple benchmarks show that Syn2DRE consistently outperforms prior state-of-the-art semi-supervised DocRE methods.
Read the full abstract
Complex Variables
Period bounds for Bergman kernel variation and the Suita defect
The periods of holomorphic differentials give an explicit lower bound for the curvature of Bergman evaluation matrices. We prove this bound along the Green sublevels of a smooth plane domain. For scalar evaluation at the Green pole, equality at one regular level holds precisely when that sublevel is simply connected. For complete jets at the Green pole, the matrices have continuous first derivatives, including at critical levels, and their logarithmic determinant defects are integrals of nonnegative curvature densities. A further estimate bounds the accumulated period energy by the determinant defect, with a constant independent of the jet order. On a multiply connected domain, all these defects vanish up to the first critical Green value and become strictly positive above it.
Read the full abstract
Robotics
Horizon-Coupled Obstacle Guidance for Relative-Action Diffusion Policies
Real-world robot deployment requires adapting learned policies to unseen obstacles without collecting new demonstrations or retraining. Existing policy-level guidance often applies obstacle corrections independently at individual horizon steps, which may address local obstacle violations but fail to coordinate the action sequence into a complete, task-directed detour. How obstacle responses should be propagated across the action horizon to coordinate complete, task-directed avoidance motion remains underexplored. We introduce an inferencetime obstacle-guidance framework for pretrained relative-action diffusion policies. It rolls out cumulative relative actions into a workspace trajectory, evaluates obstacle interactions along the trajectory with an SDF-based obstacle model, and propagates each obstacle response to all contributing action increments during denoising. Real-robot experiments across seven obstacleconstrained scenarios spanning four manipulation tasks show that our method achieves 105/140 (75.0%) collision-free task successes, compared with 8/140 (5.7%) for absolute-action pointwise guidance. Ablations show that the relative-action horizoncoupled formulation provides the larger observed improvement across both obstacle models.
Read the full abstract
Numerical Analysis
A scaled TW-PINN framework for soliton solutions of the Korteweg–de Vries equation
Accurate approximation of soliton solutions of the Korteweg–de Vries (KdV) equation remains challenging for physics-informed neural networks (PINNs) due to localized wave structures, high-order spatial derivatives, nonlinear interactions between solitons, and difficulties in long-time prediction. In this work, we address these challenges using a scaling PINN framework to approximate KdV soliton solutions. The framework transforms the governing equation into a normalized form, approximates its solution using a PINN solver, and reconstructs the solution in the original variables through inverse scaling. We introduce scaling transformations and PINN solvers tailored to one- and two-soliton problems. For the one-soliton case, we employ a PINN solver that incorporates a traveling-wave coordinate to capture soliton propagation. For the two-soliton case, we employ a two-step training procedure for the PINN solver. The first step learns the individual soliton profiles and estimates their propagation speeds, while the second step uses the estimated speeds to construct traveling-wave coordinates in the PINN solver and approximate the full two-soliton solution, including nonlinear interactions. We also introduce soliton-informed sampling (SIS), which places additional collocation points around the soliton trajectories. Numerical results show that the scaling PINN framework accurately captures one-soliton propagation, resolves two-soliton interactions, and preserves soliton profiles during long-time extrapolation in both cases. An additional three-soliton experiment suggests the applicability of the proposed two-step training procedure to multi-soliton solutions.
Read the full abstract
High Energy Astrophysical Phenomena
GW230729\_082317 and GW231118\_005626: A Candidate of Hierarchical Triple Mergers
Hierarchical triple mergers denote a sequential merger process in which the black hole remnant from an initial binary merger subsequently merges with a third black hole. In this study, we identify a related pair of binary black hole mergers, GW230729\_082317 and GW231118\_005626, which exhibit consistent sky localization and luminosity distances; the latter is identified as a candidate hierarchical merger binary back holes. The Bayes factor in favor of a hierarchical triple merger origin over the non-association hypothesis is $110$. However, after accounting for the priors odds, the corresponding odds ratio decreases to $0.1$, indicating that the current evidence is insufficient to favor the hierarchical triple merger scenario. GW230720\_0823 show no detectable signatures of orbit eccentricity or line-of-sight acceleration. The inferred properties of these two gravitational wave events suggest a dynamical formation channel, such as few-body scattering or gas-assisted mergers, while a primordial triple origin is disfavored. Among the proposed dynamical environments, the accretion disk of an active galactic nucleus provides the most plausible site. We further derive constraints on the local rate of hierarchical triple mergers rate under both the null and candidate scenarios. Under the assumption of no detected hierarchical triple mergers, the most stringent $90\%$ confidence upper limit is $4.2\,{\rm Gpc^{-3}yr^{-1}}$ for $t_{\rm max}=10$ years using the GWTC-4 catalog.
Read the full abstract
General Economics
Sanctions, Evasion, and Deterrence: Evidence from Speeding Enforcement
The design of sanctions plays a central role in shaping reoffending behavior. We study the effects of fixed monetary fines and accumulating penalty points on speeding recidivism and liability transfer. Exploiting a large increase in sanctions in Queensland, Australia, we estimate the causal effects of these sanctions on subsequent offending and nomination of other drivers. Higher demerit points increase fine renomination, consistent with strategic blame shifting. Estimated reductions in reoffending are small among offenders facing higher fines alone. Reoffending falls by a substantial 4.6 percentage points when higher fines are accompanied by additional penalty points.
Read the full abstract
Computer Vision
RegNC-Mamba3: Shared Structural Feature Learning Using Non-Causal State Space Principles for Multi-Modal Image Registration
The main challenge of multi-modal image registration is shared structural feature extraction with higher accuracy and lower computational complexity. Compared with a State Space Model (SSM), the State Space Principles (SSP) formulation of Mamba-3 uses a more accurate discretization with lower truncation error while maintaining linear complexity. However, vanilla SSP is designed for natural language processing (NLP) and is not directly suitable for images. To address this issue, we propose a novel non-causal SSP (NC-SSP) with shared structure awareness and develop a coarse-to-fine registration method named RegNC-Mamba3. First, NC-SSP is designed to eliminate the dependence of the integral computation on the scanning path. By combining relative-weight normalization with aggregation over all circular scan paths, NC-SSP constructs a globally hidden state without long-range decay, which provides a wider receptive field and higher efficiency than the original Mamba-3. Second, NC-SSP is modified to strengthen the extraction of cross-modal structural features. When computing hidden states and feature interactions, we construct complex-valued sequences in NC-SSP by applying learnable Log-Gabor kernels, with different orientations to each head for frequency-domain modulation. This improves the perception of shared structural information across modalities and increases both registration accuracy and quality. Experiments on VIS-SAR and VIS-IR demonstrate that RegNC-Mamba3 outperforms the compared detector-based and semi-dense multi-modal registration methods.