Cryptography and Security
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 3 September
Federated learning enables privacy-conscious collaboration for network intrusion detection without centralizing sensitive traffic data, yet its deployment in operational environments must simultaneously satisfy three competing requirements: formal differential privacy guaranties, tolerance to Byzantine-adversarial participants, and reliable detection coverage across severely imbalanced attack categories. Existing literature treats these properties as independently composable, an assumption that this paper challenges both theoretically and empirically. In this paper, we study how these requirements interact in class-imbalanced federated NIDS and introduce geometric indistinguishability as a conceptual lens for a regime in which privacy-induced dispersion in client updates can make minority-class signals harder for robust aggregation to preserve. Using UNSW-NB15 as a case study, we evaluate DP-SGD combined with coordinate-wise median under label-flip and model-poisoning attacks, with threat coverage assessed across attack categories. Our results provide initial evidence that the joint use of privacy noise and robust aggregation can disproportionately degrade detection of rare attacks relative to majority classes. We also show that part of the observed collapse under strong privacy can arise from training miscalibration, while a residual performance floor may remain for ultra-rare categories even after epsilon-dependent tuning. These findings motivate studying privacy, robustness, and rare-attack coverage jointly rather than as independently composable properties, and suggest that aggregation-aware modeling and sample-aware evaluation are promising directions for trustworthy federated NIDS.
Quantum Physics
In defence of the Ehrenfest mean-field molecular dynamics
Re-visiting the problem of the coupled electronic–nuclear motion, we prove that the so called `mean-field' Ehrenfest picture is an exact theory, rather than an approximation, in the classical limit for nuclei. By establishing its full equivalence to the much more involved Exact Factorization approach to the problem (Abedi et al., Europhys. Lett. 106, 33001 (2014)), our conclusion rehabilitates the mean-field Ehrenfest molecular dynamics as a simple, effective, while formally exact scheme, amenable to the use within the framework of the time-dependent density functional theory.
Read the full abstract
Functional Analysis
Sampling and Density Theorems for the Fractional Opdam-Cherednik Transform
In this paper, we establish sampling and density results for the fractional Opdam-Cherednik transform. Using the Sturm-Liouville structure of Jacobi functions, we construct a Riesz basis associated with the Opdam-Cherednik kernel and derive an explicit sampling formula. The sampling nodes are determined by the zeros of a shifted Jacobi function. We further develop a concentration-operator approach and obtain Landau-type necessary density conditions for sampling and interpolation in fractional Opdam-Cherednik bandlimited spaces. The non-fractional Opdam-Cherednik sampling formula is recovered when $\theta=\pi/2$.
Read the full abstract
Instrumentation and Methods for Astrophysics
Reconstruction of Shower-like Events in NEON Using Likelihood and Graph Neural Network Methods
The Neutrino Observatory in the Nanhai (NEON) is a proposed deep-sea neutrino telescope deployed in the South China Sea. Accurate reconstruction of shower-like events is crucial for neutrino energy measurements and multi-messenger astronomy, yet it poses significant challenges due to seawater optical attenuation, irregular detector geometry, and substantial $^{40}\mathrm{K}$ ambient background. In this work, we present the first comprehensive reconstruction framework for shower-like events in NEON, encompassing both a physics-driven maximum likelihood estimation (MLE) method and a data-driven Graph Neural Network (GNN). The traditional MLE framework integrates spatial-isochronic hit selection, vertex reconstruction via time-residual M-estimator minimization, and decoupled directional and energy estimation based on pre-computed photon distribution tables. Physical calibrations, including PMT angular acceptance, hit-level time slewing corrections, and an effective line-source shower extension, are incorporated into the likelihood formulation. In parallel, a two-stage GNN is developed to capture intra-DOM PMT correlations and distance-weighted inter-DOM topological patterns. Simulation studies show that the MLE method achieves an overall median angular resolution of $4.19^\circ$ and an energy resolution of 25%-37% over 1 TeV to 1 PeV with negligible systematic bias. The GNN further improves reconstruction fidelity in the low-to-intermediate energy regime, achieving a median angular resolution of $1.8^\circ$ at 30 TeV and an energy resolution of $\sim$ 20% between 40 and 300 TeV. Based on these reconstruction performances, the effective area and point-source discovery potential of NEON are evaluated. This framework establishes an essential reconstruction benchmark for NEON and provides practical methodologies for future next-generation deep-sea neutrino telescopes.
Read the full abstract
Artificial Intelligence
Dude: A Dual-Detection Multi-Agent System for Paper-Code Discrepancy Detection
LLM-empowered paper-code discrepancy detection has received growing concern since the scaling of research submissions exceeds the manual review capability. However, the limited context capacity and one-sided discrepancy detection of existing single-agent LLM paradigms lead to an inferior recall performance in detecting discrepancies. In this paper, we propose Dude, the first Dual-Detection Multi-Agent System for paper-code discrepancy detection. We discover that the granularity asymmetry of the paper-language and code-language introduces over-interpretation and over-reporting challenges in a multi-agent system design for discrepancy detection, resulting in increasing false positives. To address this, we propose a granularity-aligned negotiation and a two-stage salience-filtering mechanism in Dude, which effectively prevents agents from falsely reporting discrepancies. Experimental results in real-world paper-code discrepancy datasets showcase Dude's significant recall and precision improvement by up to 22.8%, increasing F1 score by up to 18.7% compared to baseline methods.
Read the full abstract
Computer Vision
Mudragen: Geometrically Supervised Generation of Interacting Two-Hand Mudras for Preserving Indian Classical Dance Heritage
Automatic generation of hand gestures is essential for the transmission of Indian classical dance and critical for its preservation. Indian classical dance gesture datasets are inherently low-resource, and the canonical Sanskrit definitions of many mudras lack precise textual descriptions, limiting the effectiveness of conventional text-conditioned image generation models. We present MudraGen, a conditional diffusion framework that synthesizes realistic RGB images of Samyukta Hasta Mudras – interactive two-hand gestures from Bharatanatyam (an Indian classical dance form). Unlike prior work on simple hand signs or single-hand gestures, MudraGen introduces geometry-aware supervision to capture the precise coordination, anatomical validity, and cultural nuance of interacting hands. We formulate three geometry-aware objectives: Keypoint Loss for 3D joint alignment, Joint Offset Loss for inter-hand spatial coherence, and Shape Consistency, which serves as an anatomical regularizer by encouraging consistent hand morphology while allowing independent hand poses. Together, these objectives guide the diffusion model toward anatomically plausible and well-coordinated hand configurations, enabling the synthesis of photorealistic and pose-accurate gesture images. Experimental results show that MudraGen surpasses existing state-of-the-art generative approaches in visual realism, anatomical correctness, and preservation of fine hand-pose structure, enabling faithful reproduction of complex Samyukta Hasta mudras. Beyond quantitative gains, its ability to generate culturally grounded and structurally consistent gestures highlights practical applications in cultural preservation and dance education.
Read the full abstract
Sound
StrixAE: An Intelligent Agent for Audio Enhancement under Complex Distortion Coupling in Real-World Scenarios
Audio enhancement in real-world scenarios involves complex distortion couplings and requires personalized enhancement. Existing solutions struggle to address both simultaneously. To improve robustness and enable autonomous operation in such scenarios, we propose StrixAE, an agent based on a multimodal large language model (MLLM). StrixAE leverages the MLLM as a controller to coordinate multiple audio enhancement and personalization models. To further enhance system robustness, reduce artifacts, and improve generalization across diverse real-world scenarios, StrixAE is trained through a two-stage process: first, CoT supervised fine-tuning on AcoustBench to ground basic reasoning and tool invocation; second, Audio Perception Reinforcement Learning (APRL), a reward design specifically tailored for audio restoration pipelines that jointly optimizes format validity, structural coherence, and perceptual quality. Unlike generic RL fine-tuning, APRL introduces structured rewards that enforce executable pipelines and logical section ordering, enabling the agent to produce reliable, interpretable enhancement plans without hallucinated tools. Based on real-world test datasets, our proposed method outperforms most existing open-source and proprietary solutions, achieving state-of-the-art performance across multiple perceptual metrics and demonstrating strong generalization robustness.
Read the full abstract
Computers and Society
The 5P Reflection Model for Education in the Generative Artificial Intelligence (GenAI) Era
Contributions: A reflection model suitable for the era of Generative Artificial Intelligence (GenAI) is introduced. The proposed model is an integrated model that extracts features from various existing models and also incorporates technological aspects of GenAI. Background: Universities worldwide are facing challenges in adopting GenAI into their curricula, as it has impacted academic integrity and the scholarship of teaching and research. Traditional reflection models are struggling to authenticate student reflection as GenAI is incorporated in education. This requires a GenAI-aware model to enable the opportunities that address the associated challenges with GenAI. Research Questions: Does the academic ecosystem require a GenAI-aware reflection model to adopt GenAI into education? How to make a reflection model structured to ensure student authenticity and cognitive engagement within a GenAI-aware learning environment? Methodology: This study employs a design-based research methodology, assisted by a critical inquiry approach, to analyse existing reflection models in the era of GenAI and examine the technological aspects of GenAI. Additionally, it identifies a gap and the absence of a comprehensive reflection model that enhances reflection in the era of GenAI and supports the effective integration of GenAI in education. Findings: The literature survey indicates there is a greater need for reflection in the era of GenAI to ensure learning, but the existing reflection models lack proper strategies to manage the problem introduced by GenAI. A standard GenAI-aware reflection model, called 5P (Purpose, Process, Product, Pitfalls and Plan), is proposed i) to manage greater demand for reflection, ii) to address the limitations of the existing reflection models, iii) to consider technological aspects of GenAI.
Read the full abstract
Combinatorics
Toughness Bounds for Fractional Hamiltonicity and Resistance Positivity
A graph is fractionally Hamiltonian if it admits a nonnegative edge weighting in $[0,1]$ of total weight equal to its order such that every nontrivial edge cut has weight at least two. Motivated by Chvátal's Toughness Conjecture, Scheinerman and Ullman conjectured that every $2$-tough graph is fractionally Hamiltonian. In this paper, we show that every connected graph on at least three vertices that is not fractionally Hamiltonian has a non-Hamiltonian chordal spanning supergraph. Since adding edges does not decrease toughness, a theorem of Kabela and Kaiser that every $10$-tough chordal graph on at least three vertices is Hamiltonian yields that every $10$-tough graph on at least three vertices is fractionally Hamiltonian. We apply this result to resistance curvature. We prove that every fractionally Hamiltonian graph is resistance positive (RP), and consequently every $10$-tough graph is RP, confirming a conjecture of Devriendt. In the other direction, for every $\varepsilon>0$, we construct a graph that is not resistance nonnegative and has toughness greater than $3/2-\varepsilon$, extending a recent construction of Agrahari, Bibby, Boros, Garcia, Heidercheidt, and Wang.
Read the full abstract
Combinatorics
Adjacent vertex distinguishing total chromatic number of graph products
The adjacent vertex distinguishing (AVD)-total chromatic number $\chi''_{a}(G)$ of a graph $G$ is the least integer $k$ for which $G$ has a proper total coloring $f$ with $k$ colors such that $C_G(u)\neq C_G(v)$ for every edge $uv\in E(G)$, where $C_G(u)=\{f(u)\}\cup\{f(uw):uw\in E(G)\}$. The AVD-total coloring conjecture (AVD-TCC) asserts that $\chi''_{a}(G)\leq \Delta(G)+3$ for every simple graph $G$, where $\Delta(G)$ is the maximum degree of $G$. In this paper, we prove the AVD-TCC for certain classes of graph products, including Cartesian products, lexicographic products, skew products, cover products, comb products, and Indu–Bala products.
Read the full abstract
Computation and Language
To What Extent Do Large Language Models Understand Bangla Idioms?
Idiomatic expressions are an integral part of natural language, reflecting cultural nuances and posing unique challenges for computational models, particularly in low-resource languages. In this paper, we present the first large-scale benchmark dataset of Bangla idioms, complemented by a synthetic multiple-choice question (MCQ) dataset for idiom meaning identification. We conduct a comprehensive evaluation of recent large language models (LLMs) across three idiom-related tasks: paraphrasing, idiom span detection, and meaning identification, leveraging zero-shot and few-shot prompting strategies. Our results reveal substantial variability in model performance, with no single LLM consistently outperforming others across all tasks. Notably, Phi-4-mini-instruct excels in paraphrasing, Kimi-K2-32b-instruct in span detection, and Gemini-2.5-flash in meaning identification. We believe that our datasets and analyses will provide valuable resources to guide future research in improving LLM comprehension of idiomatic expressions, particularly in Bangla and other low-resource languages.
Read the full abstract
Quantum Physics
An interpretation-independent formulation of the measurement problem
In this paper, we do not try to solve the measurement problem, but rather to properly formulate it. One of the reasons why it still lacks a precise, agreed definition is that the problem may take very different aspects depending on the interpretation of quantum mechanics embraced. Inspired by the methodology of theory-independent results like Bell's theorem, we propose to identify the common root of the puzzle in an interpretation-independent way i.e. as a property of the empirical statistics only, before deriving its philosophical consequences. The key observation is that quantum matter can not be described by a Kolmogorovian probabilistic theory. Arguing that the Kolmogorov axioms of probability theory are the postulates of epistemic uncertainty leads us to reformulate the measurement problem as the impossibility to build an ontology independent of epistemology for quantum matter. Said differently, there exists no God's-eye view on quantum systems. Although it is meaningless to solve the measurement problem as defined in this way, insofar as it is a feature of the universe's statistics, such a formulation may on the other hand bring side benefits. In particular, we argue that it allows to: (i) shed a new light on the variety of interpretations; (ii) propose a fundamental reason why quantum mechanics and general relativity are so incompatible, not relying on purely mathematical or technical arguments; (iii) guide the quest for quantum gravity.
Read the full abstract
Astrophysics of Galaxies
Search for intranight optical variability in a large sample of intermediate-mass black holes
Using the extensive archival database of the Zwicky Transient Facility (ZTF) survey, we have investigated intranight optical variability (INOV) in a large sample of low-mass active galactic nuclei (LMAGN) powered by intermediate-mass black holes (IMBHs). After applying a sequence of well-motivated selection filters, we constructed an unbiased, representative sample of 62 IMBHs for which $r$-band intranight photometric sequences are available in the ZTF database, yielding 167 sessions with a minimum duration of 2 h. By performing aperture photometry on the sequence of exposures in each session, we derived differential light curves (DLCs) of the target LMAGN relative to two carefully selected non-varying comparison stars monitored simultaneously with the LMAGN in the same exposure sequence. Application of the widely used test based on $F$-statistics to all these DLCs revealed no case of statistically significant INOV. We discuss this result for the present large sample of LMAGN in the context of an earlier report of INOV detections in another, albeit much smaller and differently selected, sample of LMAGN that had been monitored in targeted observations.
Read the full abstract
Artificial Intelligence
Caught in the Story: Narrative Captivity in Multi-turn LLMs Conversation
People increasingly turn to large language models (LLMs) for everyday advice, making ethically charged interpersonal problems a practical moral-advisory context. Most prior work has studied this context through single-turn judgments or pressure-laden rebuttals, assumptions that poorly match how guidance is sought in real-world contexts. These assumptions leave unclear whether narration alone, without an explicit opposing position, can shift model judgments during multi-turn moral consultation. Yet real-world moral-conflict conversation often elicits one party's self-justifying account, which can unfold over multiple turns and create information asymmetry. We introduce narrative captivity, a failure mode in which a model treats an unopposed one-sided account as complete and aligns with the narrator's interpretation without seeking missing perspectives. To measure this phenomenon, we build a benchmark of $5{,}078$ interpersonal-conflict scenarios spanning six moral dimensions. Across 17 LLMs, narrative captivity is widespread: end-state judgments under multi-turn narration shift by 25 percentage points on average beyond the matched single-turn baseline. Stage-level analysis identifies preference optimization as a major contributor, while four inference-time strategies provide only partial mitigation. We hope our project fosters LLM advisors that preserve independent judgment in real-world consultation.
Read the full abstract
Computer Vision
Neural-Collapse-guided Task-Free Continual Anomaly Detection
Recent years have witnessed growing interest in continual anomaly detection for industrial visual inspection. However, real-world manufacturing environments exhibit unpredictable shifts in data distributions, rendering task-dependent continual learning assumptions impractical. To address this limitation, we formulate industrial anomaly detection as a task-free continual learning problem and propose NC-TFAD, a neural-collapse-inspired, geometry-driven framework for learning from non-stationary data streams without task boundaries. NC-TFAD freezes a pretrained backbone and aligns streaming features to a simplex Equiangular Tight Frame (ETF) prototype space to stabilize representation geometry under non-stationary streams. To satisfy the NC-inspired geometric construction in the absence of real anomalies, we generate synthetic anomaly samples as auxiliary anchors during training. Building on this geometry, we further introduce inter- and intra-class regularization together with a Focal Neural Collapse Contrastive (FNCC) loss to suppress representation drift and improve normal-anomaly separability. Finally, a normal-patch-prototype-guided localization branch constructs calibrated patch-wise deviation maps from normal training samples and fuses them with a weak self-attention prior, producing anomaly heatmaps without pixel-level annotations. Extensive experiments on MVTec AD and VisA show that NC-TFAD consistently outperforms representative task-free continual learning methods adapted from general vision, as well as unified anomaly detection baselines, in both image-level detection and pixel-level localization under the task-free continual learning protocol. These results highlight that geometry-driven modeling offers an effective and robust solution for task-free continual anomaly detection in real-world industrial applications.
Read the full abstract
Numerical Analysis
Semi-discrete quadratic Wasserstein energy and state-dependent Langevin exploration
We study the semi-discrete quadratic Wasserstein energy. The energy is nonsmooth at collisions of sites. We prove local Lipschitz continuity on the full configuration space, together with global semiconcavity, coercivity, and dissipativity; show that every global minimizer is interior and collision free; and establish $C^2$ regularity on the collision-free configuration space. The gradient is expressed through the barycenters of the balanced Laguerre cells, while the Hessian is given by an explicit facet formula and satisfies a global one-sided bound. We also solve the one-dimensional problem explicitly in each ordering chamber and give a two-site example on the unit square with non-minimizing Lloyd fixed points. For $d\ge 2$, we then formulate an entropy-regularized relaxed control of the Langevin temperature. The controlled dynamics is strongly well posed, nonexplosive, and collision free. Its value function is a classical interior solution of the exploratory Hamilton-Jacobi-Bellman equation; the Laplacian of the value function is locally $C^1$, which yields a locally Lipschitz optimal temperature feedback. Independently of this optimal-control result, for every fixed Borel temperature rule bounded away from zero, and every sufficiently small step size, the associated Gaussian Euler chain is geometrically ergodic with a full-support invariant law. The raw iterates do not converge, whereas the best-so-far energy converges almost surely to the global minimum and the running record approaches the set of global minimizers.
Read the full abstract
Signal Processing
Detecting Interbrain Synchronization in EEG Hyperscanning with MUSE-S EEG headband
In this study preliminary results on the classification of EEG hyperscanning data acquired using MUSE-S consumer-level EEG headband are presented. Five pairs of subjects were involved and the recording protocol contained three two-person tetris game sessions alternating with relaxation periods. The data were segmented and ten spectral and cross-coherence features were calculated. The features were arranged into feature matrices and Convolutional Neural Network model was trained to discriminate between the relaxation and gaming. Two different feature sets - the full set and a set containing only inter subject cross-coherence features were tested. The results indicate that using the full feature set, relaxation and gaming periods were perfectly discriminated. Using only inter-subject cross-coherence features 94 % and 79 % classification accuracy for training and testing data was obtained, respectively.
Read the full abstract
Functional Analysis
Hyperpositive functions, sector bounded functions and a trace formula
We study an indexed family of functions closely related to functions ana- lytic and with a real positive part in the right open half plane (the so-called positive functions) and to the functions analytic in the right open half-plane and bounded in modulus by one there (the so-called bounded functions). These two families are related by the Cayley transform. In the present paper we introduce an affine linear relation- ship between a subclass of positive functions and the family of bounded functions, and study the corresponding connections with passivity of linear systems, interpolation and operator models. This is therefore a multidisciplinary paper, with potential readers from engineering, linear system theory and operator theory, and some repetitions of known results are given to allow various audiences to read the work. Reproducing kernel Hilbert spaces of analytic functions are a key tool in the arguments. A special role is played by the de Branges-Rovnyak spaces associated to bounded functions, and we prove a related trace formula connecting an underlying pair of operators.
Read the full abstract
Artificial Intelligence
A Prompt-Engineering Approach to Develop Scalable, Flexible, and Real-Time Hybrid Micro-Level Personalization in a General Purpose AI Teaching Assistant
Artificial intelligence (AI) teaching assistants powered by large language models (LLMs) offer scalable educational support but often provide limited personalization. This study presents a prompt-engineering-based framework for personalizing general-purpose LLM/RAG-based AI teaching assistants such as Jill Watson across academic disciplines and courses. The framework adapts responses using six learner-specific dimensions: self-assessment, abstraction preference, verbosity preference, perceptual orientation, information processing style, and level of understanding, yielding 96 distinct learner profiles. Student queries are additionally analyzed using Bloom's Taxonomy to estimate cognitive complexity at the interaction level. Learner attributes and cognitive assessments are encoded in structured prompts that condition the LLM without requiring model retraining. The framework is evaluated through experiments using NLP metrics and a human study with five participants. Results show perceived differences in response style and structure across personalization conditions, with statistical analyses identifying learner attributes associated with measurable response changes. These findings provide preliminary evidence that prompt-based personalization can support adaptive behavior in LLM-powered educational agents.
Read the full abstract
Numerical Analysis
Spectral Convergence of Random Feature Method in Multiple Dimensions
We first prove spectral convergence of the random feature method (RFM) for multidimensional targets in Sobolev, Gevrey, ultra-analytic, and bandlimited classes. The analysis establishes general high-probability approximation estimates in the interpolation scale generated by a kernel integral operator. On a single event determined only by the sampled features, one random space approximates every target in a prescribed source ball; moreover, for each target, a single coefficient vector defines an approximant that attains spectral accuracy simultaneously in all admissible error norms. For both regularity-adapted frequency distributions and uniform distributions on growing frequency windows, the resulting rates range from super-exponential to algebraic, depending on the regularity of the target. Second, we establish abstract error estimates for strong- and weak-form RFM discretizations, thereby converting the preceding approximation bounds into convergence estimates for multidimensional second-order elliptic boundary value and eigenvalue problems. Finally, for random feature matrices (RFMtxs), we prove super-exponential singular-value decay with Fourier features and exponential decay with $\tanh$ features, together with corresponding condition-number lower bounds. The analysis identifies a common mechanism: the same spectral approximation that yields high accuracy also drives severe ill-conditioning.
Read the full abstract
Classical Analysis and ODEs
A thickness boundary and modular obstructions for two-set radial projections
Let $K_{a,m}$ and $K_{b,n}$ be missing-digit Cantor sets with initial consecutive digit sets, and write $c_a=m/(a-1)$ and $c_b=n/(b-1)$. We prove that if $c_a+c_b\geq 1$, then the radial projection of $K_{a,m}\times K_{b,n}$ from every observer has nonempty interior; no multiplicative-independence assumption is needed for this implication. Conversely, when the bases are multiplicatively independent and $c_a+c_b<1$, we exhibit explicit unbounded open sets of observers for which the radial image is compact and nowhere dense. Rational observers with the same property are dense in each exterior corner region and occur arbitrarily close to the four corners of the product. Thus $c_a+c_b=1$ is the exact threshold for the all-observers interior property within the multiplicatively independent initial-block family. In particular, this supplies an explicit two-set counterexample to the nonempty-interior conclusions of two conjectures of Yu. We also establish a sufficient modular phase obstruction for affine translates of such sets. Combining it with a fixed-pin positive-measure theorem of Banaji and Yu yields consecutive-block division sets that are compact, perfect, of positive Lebesgue measure, and nowhere dense, with both factor dimensions tending to one. For the same family, Fourier $l^1$-dimension estimates and the incidence argument used in Yu's product theorem imply that the two self-products contain intervals for all sufficiently large $r$ and $s$, while the cross-division set remains nowhere dense.
Read the full abstract
High Energy Physics (Phenomenology)
Exploring millicharged particles in laboratory and astrophysical strong-field regimes
The probe of light dark particles beyond the Standard Model (SM) under a strong-field environment has drawn significant attention. In this work, we investigate the potential to search for and constrain light millicharged particles (MCPs) via strong electromagnetic fields in both laboratory laser experiments and astrophysical environments such as magnetars. We propose the MCP pair production from nonlinear Compton scattering through the interaction of a relativistic electron beam with a high-intensity laser pulse. The Furry picture and Volkov solution of Dirac equation in a background electromagnetic field are used to describe the electrons and MCPs under an external classical laser field. We calculate the cross sections of nonlinear Compton scattering to MCP pairs and take into account the irreducible SM background with missing neutrinos. We also revisit the MCP pair production via the Schwinger mechanism from magnetars with ultra-strong magnetic field and parallel electric field in polar gap. The energy loss due to the Schwinger pair production of MCPs and electric field acceleration is evaluated based on Ruderman-Sutherland model for confirmed magnetars. We find that the constraints from highly magnetized magnetars and the search potential in laboratory laser experiments are complementary.
Read the full abstract
Complex Variables
Quantitatively hyper-positive real rational functions IV: The canonical case
In the linear time-invariant framework, passive systems are modeled by positive real functions. Dissipative systems can be modeled by the subset of quantita- tively Hyper-positive real functions, related through nested inclusions. This family was introduced and studied in our three previous works. Here, we further focus our attention on the proper subset of canonical Hyper-Positive functions. Although this family is "small", its exploration is well motivated: First, this set turns to be associated with absolute stability (the Lurie problem). Then, a systematic parametrization of all canonical Hyper-Positive functions is introduced. Moreover each canonical Hyper-Positive function can be viewed as an extreme point of the convex set of Hyper-Positive functions. Specifically a convex combination of canonical Hyper-Positive is Hyper-Positive, but not canonical. These observations hold in both frameworks: of analytic functions and of state-space realization arrays. Technically, some of the analysis is facilitated by employing Quadratic Matrix Inclusions of both, matrices and of matrix-valued rational functions.
Read the full abstract
Analysis of PDEs
The exterior Dirichlet problem for special Lagrangian equations
We establish the existence and uniqueness theorem for the exterior Dirichlet problem for the special Lagrangian equation with prescribed asymptotic behavior at infinity, in both the viscosity setting for all the phases and classical setting for the critical and supercritical phases. These results generalize previous work by the second author by removing restrictive assumptions on the asymptotic matrix and improving the decay rate to the order $2-n$. We also solve the interior Dirichlet problem for the critical special Lagrangian equation and, as applications, all the above-mentioned corresponding problems for the three dimensional quadratic Hessian equation without any admissibility condition.
Read the full abstract
Fluid Dynamics
Interface-resolved simulations of boiling heat transfer
Boiling heat transfer underpins many applications where large heat fluxes must be dissipated. Boiling is characterized by a wide range of coupled multiscale transport phenomena, making its accurate numerical prediction a long-standing challenge. In this context, interface-resolved simulation approaches - where the liquid-vapor interface is either explicitly or implicitly described - have undergone significant advancements, driven by improved numerical formulations, more complete thermodynamic and compressibility modeling, and the growing availability of computational resources. Here, we provide a comprehensive overview of the state of the art in interface-resolved simulations of boiling flows. We examine the different formulations governing the flow and temperature field, strategies for coupling heat and mass transfer at the interface, and current modeling approaches for small-scale physics such as nucleation, microlayer evaporation, and contact-line dynamics. By analyzing insights from recent high-fidelity simulations, a central observation is that interface-resolved simulations of boiling are hydrodynamically resolved but microscopically modeled: their predictive accuracy depends on the sub-grid closures for nucleation, microlayer, and contact-line physics no less than on the fidelity of the hydrodynamic solver. We discuss the strengths and limitations of available methods on this basis, together with the open challenges in the accurate description of boiling heat transfer.
Read the full abstract
Computation and Language
TabScope: Question-Adaptive Scope Selection for Table Question Answering
Large Language Models (LLMs) have shown strong performance on table question answering, yet their accuracy often degrades as table size increases. We find that this degradation is not uniform across question types. Localization-sensitive questions are particularly affected by irrelevant table content, while questions requiring broader evidence may still benefit from full-table reasoning. Based on this observation, we propose a question-adaptive framework that dynamically selects between localized and full-table reasoning. The framework constructs question-specific sub-tables through operation-aware table decomposition and uses the predicted question type to determine the appropriate reasoning mode. We further introduce silver reference sub-tables for evaluating evidence selection and construct SLQA, a benchmark based on real-world long tables. Experiments on WikiTQ and SLQA show that localization is particularly effective for lookup and local reasoning questions, while adaptive selection between localized and full-table reasoning achieves the best overall performance. These results highlight that long-table QA requires deciding not only how to localize, but also when to localize. Our code and datasets will be made available upon publication of the paper.
Read the full abstract
Computation and Language
Chiaroscuro for Emotions: A Contrastive Emotion Benchmark Grounded in Appraisal Theory
Emotion recognition benchmarks often predict one emotion per text, missing many real-world scenarios where two people arrive at opposing emotions from a single shared event. For example, a child kicks the seat in front of her in excitement while the passenger ahead grows angry. We introduce CHIARO, a 1,000 human-annotated sentence benchmark for contrastive emotion inference grounded in appraisal theory. Each scene describes one causal trigger eliciting a positive emotion in one person and a negative emotion in the other, drawn from a ten-class taxonomy. We benchmark seven frontier LLMs and four off-the-shelf emotion classifiers. The strongest LLM reaches 67.3 macro-F1, well below human agreement, while existing emotion classifiers score near chance. Beyond evaluation, CHIARO also serves as a training signal. When combined with an existing emotion corpus, the resulting downstream classifier improves on CHIARO itself and on six of ten external emotion benchmarks, which positions our dataset as a complementary signal for emotion recognition.
Read the full abstract
General Relativity and Quantum Cosmology
Solutions for neutron stars in General Relativity from a complexity structure scalar boundary condition
A new condition involving the complexity factor, a structure scalar arising from the orthogonal splitting of the Riemann tensor, is generated at the boundary of a spherically symmetric anisotropic fluid. This condition leads to the generation of a model, without invoking any further constraints on geometry or matter variables. The model generated is physically reasonable and suggests that there is a non-zero, positive minimum constraint on the complexity scalar value evaluated at the surface. This suggests that vanishing complexity is a globalized constraint which does not apply at the boundary, specifically for compact objects in the strong-gravity regime.
Read the full abstract
Robotics
Programming and execution of skill-based human-robot-crane collaborative tasks
Highly varying production sets increasing challenges for robotic manufacturing and indoor logistics. New capabilities for agility, flexibility, and robustness are needed. Robot skills, integrating motions, tool operations, and sensor perceptions consistently provide an execution mechanism for a versatile set of tasks with varying parameters. In this paper, easy-to-use CAD-model based programming and execution system for parametrized skills and skill monitors is showcased. The execution control structure is dynamic and parametrized, based on a modified Behavior Tree, where only event based communication is used. A human-robot-crane collaborative skill is shown as a test example, where a human instructs an overhead crane and a manipulator in inserting a heavy object supported by the crane, and guided by the manipulator, into the goal.
Read the full abstract
Computer Vision
Exploring the Potential of Contrastive Language-Image Pre-training for Multi-Source Remote Sensing Data
Contrastive language-image learning (CLIP) has become a key paradigm for remote sensing vision-language understanding. However, existing remote sensing contrastive learning methods are mostly built on RGB-oriented CLIP architectures, making it difficult to exploit heterogeneous sensors such as SAR, multi-spectral imaging (MSI), and hyperspectral imaging (HSI). To address this limitation, we propose OmniRSCLIP, an end-to-end contrastive learning framework that supports multi-source sensor inputs for remote sensing vision-language modeling. The key idea is to extend CLIP beyond its fixed RGB input interface without breaking the pretrained visual knowledge. To this end, OmniRSCLIP introduces Spectral-Spatial Basis Decomposition (SSBD), which formulates arbitrary-channel adaptation as a basis recomposition problem: pretrained CLIP patch embeddings provide transferable spatial bases, while wavelength-conditioned coefficients span sensor-specific embedding kernels within a constrained visual prior space. This design avoids forcing heterogeneous sensors into a fixed-channel input space, while aligning them in a unified image-text semantic space. We further introduce a spectral-context-aware mask-based contrastive learning scheme to suppress modality-specific redundant features and enhance fine-grained image-text alignment. Finally, to support multi-modal training, we construct OmniRS5M, the first large-scale remote sensing image-text corpus covering RGB, SAR, MSI, and HSI. Experiments on retrieval, zero-shot classification, and semantic localization show that OmniRSCLIP preserves strong RGB-domain performance while effectively extending CLIP to heterogeneous remote sensing modalities.