Peer Revenue Play credits. Real papers.

Papers

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

All of arXiv

Thursday 10 September

Logic

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.
Read the full abstract

Strongly Correlated Electrons

Optically induced metallic state with persistent monoclinic symmetry in NdNiO$_3$

Understanding whether electronic and structural order remain coupled under nonequilibrium conditions is a central challenge in correlated materials. Here, we simultaneously track metallicity and symmetry across the photoinduced insulator-to-metal transition in NdNiO$_3$ using time-resolved optical reflectivity and symmetry-sensitive second-harmonic generation. We find that metallic reflectivity emerges at significantly lower excitation fluence than restoration of the orthorhombic high-temperature symmetry. As a result, optical excitation stabilizes a metastable state that combines the reflectivity of the metallic phase with the monoclinic symmetry of the insulating phase, revealing an optically induced monoclinic metal. Only at substantially higher fluences does the symmetry fully recover to that of the high-temperature phase. These results demonstrate a nonequilibrium decoupling of metallicity and structural symmetry and establish simultaneous multiprobe spectroscopy as a powerful approach for identifying emergent phases in correlated materials.
Read the full abstract

All authors Christian Tzschaschel, Felix Utsch, Qi Song, Spencer Doyle, Grace A. Pan, Charles M. Brooks, Julia A. Mundy, Clemens von Korff Schmising, Stefan Eisebitt

Computer Vision

SCINTILLA-SNN: A Spiking Multi-Scale Selective Aggregation Network for Perineural Invasion Prediction

Preoperative prediction of perineural invasion (PNI) in cholangiocarcinoma (CCA) is clinically valuable but remains challenging because PNI-related cues on magnetic resonance imaging (MRI) are subtle, sparse, and spatially localized around the tumor boundary. Standard 3D CNN and transformer architectures process volumetric data in a dense or spatially uniform manner, which can dilute subtle PNI-related evidence while requiring a large number of multiply-accumulate operations over 3D feature grids. To address these limitations, we propose SCINTILLA-SNN, a 3D spiking network composed of a four-stage hierarchical backbone and a Multi-Scale Spike Aggregation (MSSA) module for PNI prediction. The backbone extracts hierarchical volumetric representations through spiking convolutional stages and local spike window modulation stages. Given the resulting stage-wise representations, MSSA maps each spatial token to a learnable content value and modulates it with a spike-dynamics gate derived from firing rate and timestep-wise membrane-potential variability. The resulting score, referred to as the diagnostic token score, is used to selectively aggregate sparse PNI-related evidence. Experiments on a 10-year retrospective cohort of 182 CCA patients show that SCINTILLA-SNN achieves an AUROC of 0.748 under 5-fold cross-validation, while reducing the estimated inference energy by 23.18$\times$ compared with dense MAC-only computation of the same network.
Read the full abstract

All authors Youngung Han, Yului Jeong, Kyeonghun Kim, Dohyun Kweon, Suah Park, Hyunsu Go, Sungha Park, Anna Jung, Jinyong Jun, Yunho Choe, Yunjin Seo, Ken Ying-Kai Liao, Hyuk-Jae Lee, Nam-Joon Kim

Computer Vision

HALDETECT at ImageEval 2026 Shared Tasks: Answer-First Contrastive Grounding with QLoRA

Large multimodal models tend to hallucinate visual detail fluently, which limits their deployment for fine-grained interpretation. We present HALDETECT, our system for the English hallucination-detection track (Task 1b) of ImageEval 2026, in which a system must identify, from an image and three culturally plausible statements, the single visually grounded one. We frame the item as one contrastive decision, emit the answer before its explanation, and structure reasoning around colour/texture, shape/form, and context. Our best submitted adapter fine-tunes Qwen2.5-VL-7B-Instruct with 4-bit QLoRA while freezing the vision encoder and reaches Contrastive Instability (CI) 0.035 on the 1,000-item test set; we placed third of eight teams. Development experiments show that answer order can matter more than model scale and that adaptation beats prompting alone. Retrospective paired analysis of the released gold labels confirms the QLoRA gain over the best prompt but not the small gap between the devtest-selected and best-test adapters, and reseeding all four training sizes shows that the apparent data-scaling curve does not survive a seed change. The 35 residual errors are culturally plausible function, material, and recognition distinctions; naive adapter voting does not help.
Read the full abstract

Computer Vision

When is Test-Time Adaptation Identifiable From Unlabeled Evidence?

Test-time adaptation (TTA) offers many ways to update a deployed model without labels, but choosing the wrong update can make a strong source model worse. Recent methods therefore try to predict which adaptation will work from unlabeled test data. We ask a prior question: does the evidence given to the selector contain enough information to determine the best action at all? We show that this is not guaranteed, even with a perfect selector. If an observation channel makes two deployments look the same while their TTA rankings differ, reliable selection is impossible from that channel; richer evidence can restore the decision only when it resolves the relevant ambiguity. We make this boundary exact in a finite-batch Gaussian TTA model, where doing nothing beats mean recentering for small shifts, recentering wins beyond a unique critical shift, and the boundary shrinks as $1/\sqrt n$. Public benchmark studies on CIFAR-100-C and DomainNet-126 show the same failure mode with modern TTA methods: changing only deployment structure can reverse the oracle action while global order-blind evidence remains unchanged. The result is a practical way to separate two failure modes that are usually mixed together: a weak selector versus an information channel that cannot support the desired decision in the first place.
Read the full abstract

Artificial Intelligence

NovGauge: A Fine-Grained Benchmark for Diagnosing LLMs' Capability in Paper Novelty Assessment

Large language models (LLMs) are increasingly used in peer review at major AI conferences, yet novelty remains a persistent weak point. Existing benchmarks assess novelty as a single holistic score, making it difficult to diagnose which dimension a model misjudges or whether its evidence is faithful. We present NovGauge, a human-anchored benchmark for fine-grained novelty assessment diagnosis. The benchmark contains 619 paper pairs and 50 multi-paper sets, drawn from two expert sources: ICLR reviewer overlap claims and survey co-citations. Instances are independently labeled along three dimensions: task, problem, and method, capturing application goals, technical challenges, and solution approaches. We propose a cascading diagnostic pipeline that verifies per-dimension correctness, evidence grounding, and logical support. Evaluation of 18 LLMs shows hallucination rates ranging from 0% to 39% across dimensions, and among non-hallucinated correct-positive judgments, over 70% cite evidence fails to logically support the stated reason. The best-performing model, GPT-5.5, achieves 43-72% Verified F1 across dimensions, while most models retain less than half of their raw F1 after faithfulness verification. These results suggest that current LLMs remain far from reliable scientific novelty assessment, particularly when correctness is conditioned on faithful evidence grounding.
Read the full abstract

All authors Guoqiang Zhang, Kexin Tan, Ming Zhang, Li Ju, Wenqing Jing, Zhonghan Yue, Jiayi Chen, Shiqiang Wu, Shaofan Liu, Yue Zhang, Yuankai Ying, Yang Shi, Tao Gui, Qi Zhang, Xuanjing Huang

Combinatorics

Crystal operators and a sign-reversing involution on semistandard set-valued tableaux of skew shape

We prove commutation relations between the ordinary type A crystal operators and a sign-reversing involution on semistandard set-valued tableaux of skew shape. We describe the involution by Boolean fibers with fixed maximum entries. It commutes with every raising operator except the one indexed by the entry changed by the involution. We characterize commutation at this exceptional raising operator and for lowering operators away from the two colors involving that entry using the box where the involution acts and reduced signatures. We construct a bijection from these tableaux to decorated five-vertex states that preserves weight and excess, subject to a restriction on nontrivial bumps determined by the inner partition. Rotation with alphabet reversal yields the dual statements.
Read the full abstract

Optimization and Control

Sequential Extremal Principle: Refinements and Applications

Sequential extremality and stationarity properties are discussed with the emphasis on those corresponding to fixed sequences of translations. Exact quantitative characterisations of the properties are provided. We show, in particular, that the sequential (as well as conventional) extremality and approximate stationarity properties possess certain stability, while the (non-approximate) stationarity does not. Dual necessary conditions for the sequential extremality and stationarity properties with fixed and non-fixed sequences of translations are established. A version of the sequential extended extremal principle is formulated. In the statements, we employ certain generalised separation conditions $(GS)$ and $(GS_\alpha)$ as well as a complementary primal-dual condition $(PD)$. To illustrate the model, we prove dual optimality/stationarity conditions for a constrained minimisation problem in which the minimal value is not necessarily attained.
Read the full abstract

Artificial Intelligence

A Voice-Interactive Multi-Agent System for Smart Operating Rooms: Architecture Design and Key Technologies

This paper presents SurgicalRoomAgent, a voice-interactive multi-agent system for smart operating rooms based on large language models (LLMs). The system achieves natural language understanding, device control, intraoperative recording, and surgical report generation through a layered architecture comprising a voice interaction pipeline (wake, ASR, turn detection, agent reasoning, TTS) and an agent core (skill registry, task planner, device manager). Three key technologies are investigated: (1) KV Cache prefix warming for low-latency inference, reducing recomputation overhead from approximately 500 ms to tens of milliseconds via byte-level Longest Common Prefix reuse; (2) streaming partial JSON parsing with early parallel task execution, reducing end-to-end latency by approximately 30%; and (3) progressive skill prompt disclosure, which dynamically filters system prompts based on user role, connected devices, and surgical phase to maximize information density within limited context windows. The system is implemented using the Qwen3-27B model with llama.cpp/sglang inference engines. Experimental analysis demonstrates effective operation within a 16,384-token context limit and multi-device parallel control response times meeting OR real-time requirements.
Read the full abstract

Atmospheric and Oceanic Physics

KiloDA: Reconstructing kilometer-scale near-surface wind states from sparse station observations

Accurate kilometer-scale near-surface winds are important for understanding atmospheric processes over complex terrain, yet remain difficult to reconstruct from sparse and unevenly distributed observations. Here we introduce KiloDA, a diffusion framework for hourly kilometer-scale wind reconstruction from surface stations. KiloDA learns the statistical distribution and spatial structure of wind fields from historical 3-km Weather Research and Forecasting (WRF) model forecasts. At each reconstruction time, no contemporaneous WRF field is used. Instead, station observations provide the only constraints on the current atmospheric state and guide posterior sampling from the learned prior. In idealized WRF experiments, KiloDA recovers localized wind structures when only 0.24% of grid cells are observed and shows an overall advantage over conventional interpolation across terrain conditions and wind speed regimes. This capability largely transfers to real observations. In a fully withheld region, KiloDA reduces the median wind speed root mean square error (RMSE) by 19% relative to ERA5 reanalysis, using only observations outside the region, with the largest improvements over high-elevation and high-relief terrain. A random station holdout further confirms that this advantage extends across different complex-terrain locations and holdout configurations. These results show that historical model archives can provide useful structural knowledge for reconstructing kilometer-scale wind fields from sparse observations without requiring an accurate model estimate of the current atmospheric state.
Read the full abstract

All authors Yihan Zheng, Ya Wang, Gang Huang, Shenming Fu, Haijie Li, Yujiang Cai

Probability

The hydrodynamic limit for the energy transport in a stochastically perturbed harmonic chain of oscillators

We consider a pinned harmonic chain perturbed by random velocity flips, which conserve the total energy. Previous results have established the diffusive hydrodynamic limit for the energy profile at the level of expectations. In this article, under suitable fourth-moment bounds on the initial data, we prove for the first time a law of large numbers for the empirical energy distribution. Our approach is based on the Wigner distribution and shows that its random fluctuations vanish in the macroscopic limit. Consequently, the empirical energy profile converges in probability to the deterministic solution of the corresponding heat equation.
Read the full abstract

Machine Learning

Solving Few-Shot Multiobjective Multitask Optimization via Iterative Sequential Transfer

Applying knowledge transfer across multiple optimization tasks, multitask optimization (MTO) emerges as a promising approach to solving synergistic optimization tasks simultaneously. However, the development of effective knowledge transfer mechanisms in MTO fundamentally relies on aligning elite solution distributions across tasks. This dependency creates a critical bottleneck in few-shot optimization regimes, as restricted evaluation budgets impede the identification of elite solution distributions required for beneficial transfer. This challenge is exacerbated in multiobjective multitask problems, where each optimizer must approximate a continuous Pareto manifold rather than a single optimal point. This paper introduces Iterative Sequential Transfer (IST) to circumvent this bottleneck. We model MTO as a sequence of sequential transfer optimization problems, concentrating evaluations on a single target per iteration. We propose a likelihood-informed task prioritization mechanism to maximize transfer utility by identifying the task most likely ready for knowledge integration. Empirical results on benchmark and real-world problems verify the effectiveness of the proposed method under tight budgets.
Read the full abstract

All authors Tingyang Wei, Haofeng Wu, Ananda Phan Iman, Zhao Wei, Jiao Liu, Yew-Soon Ong

Machine Learning

Polyhedral Geometry of Time-to-First-Spike Neural Networks

We study the expressivity of spiking neural networks, which provide a natural framework for asynchronous, event-driven computation complementary to conventional feedforward neural networks. We consider the time-to-first-spike model in a setting for which the input-output map is continuous and piecewise linear, with affine pieces governed by causal feasibility constraints that determine which presynaptic spikes occur before a neuron fires. We first show that each neuron's firing time admits a maxout-like representation with exponentially many, highly constrained affine pieces. We then formalize causal regions as polyhedral regions with fixed causal sets and derive upper and lower bounds on the maximal number of causal regions in both shallow and multilayer feedforward spiking networks. Our theoretical and experimental results show that spiking networks can generate richer partitions of the input space than conventional feedforward ReLU networks.
Read the full abstract

Soft Condensed Matter

Kinetics of ferritin crystal formation and melting in acoustically levitated droplets

Understanding protein crystallization pathways is essential for controlling crystallization in structural biology, materials science, and pharmaceutical applications. Classical nucleation theory does not fully capture crystallization processes for several proteins, including ferritin. Here, we combine acoustic levitation with small- and wide-angle X-ray scattering (SAXS and WAXS) to monitor ferritin crystallization in evaporating aqueous polyethylene glycol (PEG) solutions. Acoustic levitation rapidly drives the droplets through a broad range of protein and polymer concentrations, enabling time-resolved measurements of crystallization during evaporation. The scattering data show that ferritin crystals form during evaporation and subsequently lose their crystalline order upon further dehydration. Varying the PEG molecular weight switches between distinct crystallization pathways: one dominated by attractive protein-protein interactions and another dominated by repulsive interactions and excluded-volume effects. Furthermore, we find that lower molecular weight PEG (1000 g/mol) suppresses the dehydration-induced loss of crystalline order observed for higher molecular weight PEG (6000 g/mol), providing a simple strategy for improving protein crystal stability.
Read the full abstract

All authors Anita Girelli, Iason Andronis, Aigerim Karina, Sampad Bag, Lennart Bergström, Tomás Plivelic, Felix Roosen-Runge, Fivos Perakis

Robotics

Harness Robotic OS: A Unified Embodied-Agent Runtime for Closed-Loop Quadruped Inspection

Autonomous property inspection requires more than robust robot navigation: a deployable system must connect heterogeneous sensing, reusable autonomy capabilities, multimodal scene understanding, human interaction, and enterprise response within a traceable operational loop. Existing quadruped inspection systems commonly integrate these functions through task-specific interfaces, making contextual coordination, knowledge reuse, and controlled adaptation difficult. This paper presents Harness Robotic OS (HROS), a unified embodied-agent runtime, and Argos, its realization for residential-community inspection. HROS organizes the system into robot runtime, embodied autonomy skills, cognitive agent runtime, and interaction and operations planes. A shared context connects physical state with agent reasoning; streaming ASR/TTS supports voice-based mission interaction; hierarchical working, episodic, and semantic memory preserves operational knowledge; and a safety-gated self-evolution loop converts execution traces into versioned candidate updates without permitting unconstrained online modification. The Argos prototype integrates a Vbot quadruped, Fast-LIO2 localization and mapping, Hobot-Stereo depth perception, PCT-Planner global planning, EGO-Planner local motion generation, and OpenClaw-orchestrated Qwen3-VL inspection analysis. Experiments in a residential property environment achieved 100% waypoint reachability, outdoor localization error below 10~cm, local obstacle-response latency below 200~ms, representative hazard-detection rates of 85–95%, and 99% success in alarm delivery and structured-report generation. These results validate the deployed navigation and inspection closed loop, while HROS provides an extensible software foundation for memory-augmented, voice-aware, and continuously improvable embodied inspection agents.
Read the full abstract

All authors Yaoyuan Yan, Zhiyou Heng, Haoxiang Jie, Gang Liu, Hongjie Yan, Wei Zhou

Human-Computer Interaction

AI Soccer Analyst: Stage-Aware and Verifiable Human-AI Collaboration for Soccer Data Analysis

Sports data analysts translate domain questions into insights by combining computation with sport-specific domain expertise. Large language models ease programming, but prompt-to-report workflows may obscure decisions and evidence. We present AI Soccer Analyst, a mixed-initiative system with revisable stages: Data Understanding, Problem Definition, Structured Planning, Execution, Evidence-Grounded Reporting, and Interaction and Refinement. A formative study with five analysts first informed design goals for automation, verifiability, human control, and accessibility. Subsequently, a task-based evaluation with 16 participants combined system logs, retained artifacts, ratings, and open responses; 33 of 48 tasks met the operational completion criteria. Exploratory tests supported favorable participant perceptions of completed-task output quality, task achievement, reliability, and verifiability after Holm correction. Interaction records showed domain knowledge emerging through clarification, planning, and refinement. These findings position stage-aware human-AI collaboration as a practical approach for producing inspectable, revisable, and verifiable analyses while retaining domain-expert involvement in consequential decisions.
Read the full abstract

Computer Vision

Tri-DehazeGS: Scene–Medium Decoupled Gaussian Splatting with Transmittance-Aware Optimization

Recovering clean 3D scenes from hazy multi-view images is challenging because haze attenuates scene radiance and introduces atmospheric scattering. Recent scattering-aware Gaussian Splatting methods introduce physical haze models into reconstruction, but they often apply degradation in image space or bind medium-related variables to Gaussian primitives, which can entangle clean scene radiance with atmospheric effects. Moreover, low-transmittance regions provide weakened supervision for Gaussian optimization, causing distant or dense-haze areas to be under-reconstructed. We argue that clean reconstruction under haze requires both scene–medium disentanglement and transmittance-aware optimization rebalancing. To this end, we propose Tri-DehazeGS, a scene–medium decoupled Gaussian Splatting framework. It represents the clean scene with Gaussian primitives, models the participating medium using an independent view-shared tri-plane field, and composes hazy observations through a physical scattering model. We further introduce Medium-Decoupled Transmittance Gradient Compensation (MD-TGC), which compensates haze-suppressed gradients after medium freezing without altering forward rendering. Experiments on real and synthetic haze benchmarks show that Tri-DehazeGS improves clean novel-view reconstruction. Code is available at https://github.com/aptx46/Tri-DehazeGS.
Read the full abstract

All authors Kui Jiang, Yang Gu, Jiacheng Liu, Shiyu Liu, Youyu Chen, Hui Liu

Statistical Methodology

Optimal Covariate Adjustment beyond the Average Treatment Effect: Treated-Population and Overlap-Weighted Estimands

Graphical causal inference supplies a complete theory of efficient covariate adjustment for the average treatment effect: one adjustment set, computable from the graph, is optimal under every compatible distribution. We show that this is a property of the average treatment effect's inverse-prevalence weights, not of causal estimands in general. For the average treatment effect on the treated we index the efficiency bound by the adjustment set and derive exact identities for its change under treatment-side and outcome-side extensions of a valid set. Covariates that predict only the treated-arm outcome are exactly efficiency-neutral, and covariates that predict the control-arm outcome can strictly increase the bound when the propensity is below one half – a reversal of the supplementation lemma whose source is an arithmetic-geometric-mean inequality that holds for the average treatment effect and fails for the treated-population estimand. A construction with two faithful distributions on one graph proves that no graphical optimality criterion exists for the treated-population estimand; under no effect modification the ATE-optimal set is nonetheless optimal among the graphically valid sets, with an exact expression for its advantage. The results extend to weighted average treatment effects with propensity-dependent weights, yielding symmetric thresholds for overlap weights, an estimand-drift phenomenon under instrument adjustment, and a characterization of constant weights as the only smooth positive weights for which outcome-side supplementation never increases the bound. Simulations and the LaLonde data provide illustrations.
Read the full abstract

2609.11222 · 10 Sep · 45 pages, 1 figure, 3 tables; proofs and numerical verification in the appendices. v2: states the 1 percent penalty threshold of the random-structure scan (Appendix B) and updates the replication archive to version 1.1. Replication code and data: https://github.com/sokubo/paper-estimand-adjustment-replication

General Relativity and Quantum Cosmology

Constraining Modified Mass-to-Horizon Cosmology Through Primordial Inflationary Observables

We investigate slow-roll inflation in a modified cosmological framework inspired by a generalized mass-to-horizon relation (MHR), $M=\gamma {c^2 L^n}/{G}$, where $n$ is a real parameter and $\gamma$ a dimensional constant. Using Padmanabhan's emergence paradigm, we derive the modified Friedmann equations for a flat FRW universe and analyze the dynamics of a canonical scalar field (inflaton) under the slow-roll approximation. We study the resulting inflationary phenomenology for power-law and Starobinsky potentials. For power-law potentials, the MHR modification fails to reconcile these models with current CMB constraints on $r$ and $n_s$. In contrast, Starobinsky inflation exhibits significant sensitivity to deviations from $n=1$. A perturbative analysis ($n=1+\Delta$) yields corrections to inflationary observables. We observe that the scalar power-spectrum normalization, under a fixed-Starobinsky prescription, imposes the stringent constraint $0.960 \lesssim n \lesssim 1.040$ for $N=60$ efolds. This is considerably tighter than spectral-index bounds. Our results establish inflation, particularly Starobinsky-like models, as a sensitive probe of generalized horizon thermodynamics and departures from standard MHR scaling.
Read the full abstract

High Energy Astrophysical Phenomena

Nonbirefringent model of orthogonal polarization modes in radio pulsars - New view on S swing and mode structure in pulsar beam

Two orthogonal polarization modes observed in radio pulsar signals have long been attributed to proper modes of wave oscillation in strongly magnetized plasma. Yet it has been shown recently that they show up readily for extended emission regions that produce incoherently-superposed polarization signal. In this paper we present a two-dimensional polarization model based on incoherent superposition of radio signals. The model involves a single proper mode, say the O mode, but leads to the appearance of two orthogonal polarization tracks and naturally produces the triple form of polarization mode segregation in averaged profiles (central mode flanked on boths sides by another mode), as well as the displacement of modes in latitude, previously inferred from beam mapping. In the case of conal emission regions, the modelled polarization tends to mimic general polarization properties of the rotating vector model (RVM). However, the reason for this is the symmetry of the emission region - not the usual projection of dipolar magnetic azimuths. Thus the emerging RVM parameters reveal geometry of the emission region, not of the dipolar magnetic field. The results strongly support the vital role of nonbirefringent modal effects in radio pulsar profiles. Two proper modes may not be needed to explain observations of two orthogonal polarization tracks.
Read the full abstract

Commutative Algebra

Multigraded Local Cohomology Categories: Homological Structure and Canonical Sources

Let $S=\kk[x_1,\ldots,x_n]$ with its standard $\mathbb N^n$-grading, and let $\mathfrak m=(x_1,\ldots,x_n)$. We study the essential images of the functors $M\mapsto H^i_{\mathfrak m}(M(-\mathbf1))$ on categories of positively determined $S$-modules, where $\mathbf1=(1,\ldots,1)$. For a fixed determining bound $\mathbf t\in\mathbb N^n$ and $0\le i<n$, we identify the image in degree $i$ with the category of finite-dimensional representations of the subposet of $[\mathbf0,\mathbf t]$ consisting of multidegrees with at least $n-i$ positive coordinates. These images are Serre subcategories of the category of negatively $\mathbf t$-determined modules. The top-degree image consists precisely of second cosyzygies in that category and is extension-closed, but is not abelian when $\mathbf t\ne\mathbf0$. For the non-top image categories, we determine attached primes from projective covers and compute the Bass numbers at $\mathfrak m$ and the injective dimensions over $S$ of projective and injective objects. In every non-top degree, we construct an exact functorial section selecting, for each nonzero target, a source of minimal projective dimension $n-i$ and maximal depth $i$ among all its sources. If $n\ge2$ and $\mathbf t\ge\mathbf1$, no fully faithful section exists in degrees $1$ and $n-1$, even without requiring exactness. In top degree, graded Matlis duality followed by $S$-duality gives a fully faithful functorial section. We also describe the global images obtained by varying the determining bound. The non-top global categories have enough injectives and no nonzero projective objects, while the top category corresponds to second cosyzygies in the category of finite-support representations of $\mathbb N^n$.
Read the full abstract

Cryptography and Security

You Get What You Sample: Evaluating Sampling Strategies for Web Security Measurements

Web measurement studies rely on domain datasets such as Tranco to quantify the prevalence and impact of security issues at scale, but exhaustively analyzing these datasets is often infeasible because of the cost of advanced analysis techniques, requiring the use of sampling. Despite its widespread use, sampling remains largely guided by convention—most commonly \emph{Top $N$} domain selection—rather than evidence, and its influence on the validity and generalizability of security findings has received little systematic evaluation. Consequently, it remains unclear whether common sampling strategies introduce systematic bias, distort observed vulnerability rates, or limit comparability across studies. In this work, we undertake, to the best of our knowledge, the first comprehensive investigation into how sampling methodologies affect the measurements and the conclusions. Through a comprehensive literature review and large-scale measurements of 500k Tranco and 24.8M Common Crawl hosts, we perform a comparative evaluation of datasets and sampling strategies. We show that, while Top $N$ sampling may be a rational strategy, the researchers have to bear in mind that Top $N$ does not reflect the overall distribution of the web. Instead, probability-based strategies yield stable, unbiased estimates for prevalence and many impact objectives. Hybrid sampling provides no advantages over pure probability sampling, as its deterministic prefix consistently contributes negatively to accuracy. Building on these results, we provide data-backed guidance for future studies, proposing to use an adaptive probability-based sampling strategy that remains effective even when the prevalence of the target issue is unknown.
Read the full abstract

General Relativity and Quantum Cosmology

Quasi-isotropic Asymptotic Expansions in Varying Speed of Light Cosmologies

We generalize the quasi-isotropic solution of the Einstein equations near a cosmological initial singularity to models with a varying speed of light and/or a varying gravitational 'constant'. We construct a formal asymptotic series expansion in a synchronous reference system, taking into account the additional degrees of freedom introduced by the two varying 'constants'. By applying the Landau-Lifshitz quasi-isotropic method, we go beyond the standard results of previous studies that based on the Friedmann-Lemaître-Robertson-Walker (FLRW) model, providing a more general asymptotic analysis of varying speed of light cosmologies. We show that the resulting solutions do not contain the required number of arbitrary functions to qualify as general solutions of these theories.
Read the full abstract

Machine Learning

Legible Failures: Detecting and Repairing In-Context Binding Errors

A wrong answer does not show whether the model lacked the needed information or held it and failed to use it. On an entity-obligation binding task, a language model can emit an incorrect prompt-supplied binding while a linear probe can recover the correct one from its frozen hidden state. We measure how often this occurs across 16 public checkpoints, each evaluated with three seeds. We fit a probe on a training fold, select its layer on a validation fold, and report results on a disjoint test fold. On the trials each model gets wrong, probe accuracy exceeds the strict present-obligation baseline, 1/K = 0.125, by +0.196 (95% CI [+0.101, +0.296], bootstrapped over models). A query-entity counterfactual rules out token presence and recency. A score built from the sign of probe-output disagreement improves failure detection over the model's own confidence by +0.079 AUROC (95% CI [+0.036, +0.126]). Raw probe confidence gives no measurable improvement over model confidence. Steering the residual stream toward the probe-decoded binding, with no gold label, raises accuracy on all eight models tested by a mean of +0.168 (95% CI [+0.066, +0.280]). Where recent studies report that probe-detected errors are resistant to interventions, we find that in-context binding is a setting in which probes are actionable.
Read the full abstract

Signal Processing

Sparse Approximation via Polynomial Equations

We consider the problem of finding sparse solutions of an underdetermined linear system $Ax=b$. In contrast to conventional approaches based on greedy algorithms or convex relaxation, we reformulate sparse approximation as a structured system of polynomial equations and connect with the literature on tensor methods. We develop an eigenvalue decomposition based method that formally guarantees recovery of all sparse solutions if there is more than one. We also develop two optimization-based methods achieving favorable computational complexity. The new methods allow explicit control of the target sparsity. Numerical experiments illustrate the performance and compare to basis pursuit (denoising) and orthogonal matching pursuit.
Read the full abstract

Mesoscale and Nanoscale Physics

Enhancing charge stability of Ge quantum well heterostructures via SiGe layer composition engineering

Composition modulation is a powerful technique for designing materials with tailored properties, fueling the development of advanced semiconductor devices. In this work, we have implemented this technique into Ge quantum well heterostructures, offering a promising avenue to address the critical challenge of charge stability in spin qubit devices. Harnessing the atomic-scale precision of molecular beam epitaxy, we have engineered the band structure of the SiGe top barrier via graded composition modulation, thereby reducing charge accumulation states at the SiGe-dielectric interface and strengthening the effective confinement to the hole gases in the Ge quantum wells. The enhanced charge stability of composition-modulated SiGe/Ge quantum well heterostructures is confirmed in Hall devices, featuring an enlarged stable gate voltage range. We have further fabricated quantum dot devices from the composition-modulated SiGe/Ge quantum well heterostructures and observed remarkably low charge noise with an averaged amplitude of $0.46\,\mathrm{\mu eV}/\mathrm{\sqrt{Hz}}$ at $1\,\mathrm{Hz}$—the lowest reported value for Ge quantum wells grown on silicon. This exceptional charge stability of the quantum dots persists in the few-hole regime, with no observable voltage drift over $\sim$hours. With reduced charge noise and enhanced energy stability, composition-modulated SiGe/Ge heterostructures exhibit significant potential for applications in building high-performance quantum devices, including spin qubits with a long coherence time.
Read the full abstract

All authors Ding-Ming Huang, Jun-Hang Liu, Han Gao, Jie-Yin Zhang, Jian-Huan Wang, Fang-Ze Liu, Xin-Yu Zhou, Yi Luo, Bin-Xiao Fu, Xiao-Fei Liu, Ji-Yin Wang, Jian-Jun Zhang, H. Q. Xu

Optimization and Control

Optimal chemo-immunotherapy scheduling: A hybrid QPSO-SQP approach with Michaelis-Menten pharmacodynamics

Optimal scheduling of combined chemo-immunotherapy is often formulated as a control-affine optimal control problem, which generically yields boundary-selected (bang-bang-type) protocols unless singular arcs occur. This structure, while convenient, neglects saturating pharmacodynamics at high dose rates. We incorporate Michaelis-Menten saturation directly into the therapy channels, making the dynamics non-control-affine and the Hamiltonian nonlinear in each control. With strictly positive exposure penalties, the Hamiltonian admits an explicit three-regime pointwise minimization law: each input is chosen at the lower bound, the upper bound, or as a unique interior minimizer. On interior intervals the strict Legendre condition holds, so continuously modulated dosing arises as a regular interior extremal rather than a singular-arc or smoothing artifact. The resulting transcription is nonconvex; we therefore use a hybrid Quantum Particle Swarm Optimization (QPSO)-Sequential Quadratic Programming (SQP) pipeline, where QPSO provides a constraint-aware warm start and SQP enforces feasibility and Karush-Kuhn-Tucker (KKT) optimality on a collocation grid. Costate reconstruction corroborates the Pontryagin Minimum Principle (PMP) structure and the predicted boundary/interior regime transitions.
Read the full abstract

Software Engineering

TripleBound: Triplet-Guided Heterogeneous Graph Learning for Microservice Decomposition

Cloud computing and DevOps have made microservices a common architecture for scalable, maintainable software systems. However, migrating monoliths to microservices remains challenging due to tight coupling and unclear service boundaries. Existing decomposition approaches typically rely on either structural dependencies or semantic similarity signals, but rarely integrate both within a unified representation learning objective. This paper proposes TripleBound, a hybrid framework for automated monolith-to-microservices decomposition that augments a heterogeneous graph neural network with weakly supervised triplet constraints derived from parser-inferred service groups based on package structure, naming conventions, and code location. TripleBound injects triplet-based constraints directly into the shared structural latent space, enabling both signals to be jointly optimized during representation learning. Structural dependencies are captured using CHGNN, which models the monolith as a heterogeneous graph with program nodes, resource nodes, CALL edges, and CRUD edges. Semantic relationships are incorporated through triplet constraints generated from parser-inferred service groups. Evaluation on AcmeAir, DayTrader, PlantsByWebSphere, and JPetStore shows that TripleBound achieves the highest composite decomposition score under the selected weighting on AcmeAir, DayTrader, and JPetStore compared to CHGNN and MonoEmbed, while CHGNN remains stronger on PlantsByWebSphere. Per-metric analysis reveals trade-offs: gains in structural modularity and inter-partition coupling are accompanied by higher entity distribution imbalance on some datasets. Alternative composite weightings preserve TripleBound's first-place ranking on AcmeAir and DayTrader but not on JPetStore, showing that the aggregate ranking is metric-dependent.
Read the full abstract

All authors Mineth Weerasinghe, Himindu Kularathne, Methmini Madhushika, Danuka Lakshan, Nisansa de Silva, Adeesha Wijayasiri, Srinath Perera

Signal Processing

X-RACE: XAI-assisted Recurrent neural network Attribution for Channel Estimation

Deep learning models, notably Long Short-Term Memory (LSTM), have demonstrated promising performance in channel estimation for high-mobility vehicular environments. However, their black-box nature and architectural overhead limit trustworthiness and efficiency. Classical explainable AI (XAI) methods rely on costly iterative processes, offering only input-level filtering without addressing architectural fine-tuning. To overcome these limitations, this paper proposes the XAI-assisted Recurrent neural network Attribution for Channel Estimation (X-RACE) framework. X-RACE uses a low-complexity, one-shot dual-optimization strategy to simultaneously evaluate and prune irrelevant input subcarriers and internal hidden units. Furthermore, we propose novel temporal XAI metrics: Saturation Time, Importance Drift, and Relevance Contrast to characterize the LSTM's learning dynamics and memory convergence. Extensive simulations demonstrate that X-RACE reduces inference complexity by at least 44.1% while improving or preserving Bit Error Rate (BER) performance, outperforming classical XAI schemes.
Read the full abstract

Symbolic Computation

Diversity of EML-type operators

The discovery of the EML operator, sufficient to evaluate the standard explicit purely transcendental elementary functions, has led to considerable interest and discussion across multiple scientific disciplines. However, most authors have focused on the binary EML itself, while numerous similar variants with slightly different properties are now known. This article attempts to close this gap by enumerating and classifying them. We also take this opportunity to clarify common misconceptions related to the EML operator. The principal goal, symbolic regression within an architecture as close as possible to proven neural networks which combine matrix multiplication with a single univariate non-linear activation function, remains beyond reach. Instead, we propose a Möbius layer, with rational functions replacing matrix operations, and showcase the recently discovered activation function eml(x,1/x), which allows exp(x) and ln(x) to be recovered separately, and hence all elementary functions to be evaluated within a rational generalization of the neural network.
Read the full abstract