Information Retrieval
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 29 August
Reasoning-intensive retrieval remains difficult for small models. Compact public ColBERTs are usually trained on general-purpose corpora and underperform reasoning-tuned 150M+ baselines on BRIGHT~\cite{bright} by several nDCG@10 points. However, no public reasoning-tuned ColBERT exists at edge scale. We introduce SmallReason-ColBERT, a 32M late-interaction retriever that closes much of this gap with three components: a varied-length contrastive warmup on ReasonIR-VL, a hard-negative contrastive polish on merged ReasonIR-HQ and BGE-Reasoner data, and a single-layer per-query-token importance head trained on top of the frozen base. The head is trained with an un-normalised weighted MaxSim score and evaluated with its length-normalised form. In a controlled re-training, replacing this training objective with the symmetric normalised score causes the loss to stall and costs $3.59$ nDCG@10. The full recipe reaches 21.41 mean nDCG@10 on BRIGHT, within $1.21$ of the 150M Reason-ModernColBERT (22.62) and above all $\le 33$M ColBERTs we evaluate. Through ablations on capacity, initialisation, and score variants, we further show that the learned head outperforms fixed IDF weighting and that simply thresholding the learned gates is harmful. https://github.com/DataScienceUIBK/SmallReason-ColBERT
Computer Vision
VG-TIE: An interpretable tabular-to-image encoding method based on visibility graphs
Tabular-to-image encoding methods enable the application of models based on both convolutional neural networks and vision transformers to tabular data, transforming feature vectors into images. Existing methods employ linear and nonlinear dimensionality reduction techniques (e.g., Principal Component Analysis (PCA), t-SNE, and UMAP) to determine pixel positions, resulting in images whose spatial layout do not inherently reflect feature relationships. This paper introduces Visibility Graphs for Tabular-to-Image Encoding (VG-TIE), a novel method that encodes the structure of feature values using Natural Visibility Graph (NVG) and Horizontal Visibility Graph (HVG) into a two-dimensional space obtained through PCA. The resulting images are model-agnostic and intrinsically interpretable. Each pixel corresponds to an input feature, its intensity reflects the magnitude and direction of deviation from the population mean, and edges represent formally defined visibility relationships between features. VG-TIE provides two interpretability methods: (i) feature ranking from node degree distributions; and (ii) local and global feature importance from pixel intensity combined with Grad-CAM. Experiments on six public tabular datasets show that VG-TIE is competitive with other tabular-to-image methods while providing interpretability on feature importance and ranking similar to intrinsic interpretable methods. The results highlight the potential of the proposed image-based transformation to provide an effective framework that expands the use of deep learning across tabular data domains.
Read the full abstract
Computer Vision
Albireo: Adaptive, Energy-Efficient Inference Framework for Video Object Detection on the Edge
Video object detection on edge devices runs computationally expensive detectors over long frame streams, causing high energy consumption and sustained GPU utilization. Although consecutive frames are highly redundant, naive frame skipping is content-blind: it skips during critical moments such as object entry, occlusion recovery, and abrupt motion, degrading detection quality. We present Albireo, a detector-agnostic, codec-free adaptive inference framework that wraps off-the-shelf detectors and decides when detector invocation can be safely skipped based on scene content and per-object temporal state, requiring no detector modification or retraining. Albireo maintains a 10-dimensional Kalman filter (KF) per active object and invokes the detector only when prediction uncertainty exceeds a threshold; on skipped frames, boxes are predicted from the KF state at near-zero GPU cost. A KF-based rescue mechanism preserves confirmed objects through brief detector misses to prevent output fragmentation, while a lightweight empty-scene screen avoids detector calls on objectless frames. We evaluate Albireo on the BDD100K MOT validation split with three architecturally distinct detectors (YOLO11x, YOLO26x, RF-DETR-Large) on two NVIDIA Jetson platforms (AGX Thor, AGX Orin). Across all configurations, Albireo keeps AP@50 within +/-1.2 pp of per-frame inference while reducing total energy by 12.1-17.6%. On YOLO26x, it improves AP@50 by +0.8 pp while reducing energy by 17.6% (Thor) and 14.4% (Orin) and per-frame energy-delay product by 24.9% and 26.1%, respectively. Thus, the default operating point improves accuracy, energy, and latency together. In contrast, FixedSkip-2, a fixed-interval baseline with a 50% skip rate, loses 8.6 pp AP@50. Source code, evaluation pipeline, and per-clip results are available at https://github.com/amirtaherin/albireo
Read the full abstract
Cryptography and Security
AgentKernel: The Trust-Native Agentic Operating System
Modern AI agents routinely cross trust boundaries: they ingest untrusted content, combine it with privileged instructions, persist intermediate beliefs in long-term memory, and invoke privileged tools. This creates an attack surface in which malicious payloads can enter through model inputs and cause harmful tool actions. Yet current governance stacks remain application-level middleware that share a process trust boundary with the agents they monitor. We argue that agents need an operating-system substrate providing mandatory, non-bypassable services for identity, input mediation, memory governance, and execution control. We introduce AgentKernel, a trust-native agent operating system built around the premise that security must be a first-class design constraint. AgentKernel wraps the agent lifecycle in a mandatory enforcement boundary organized into four pillars: Identity, Perception, Cognition, and Execution. Each pillar adapts classical OS security principles to failures at the semantic plane, including delegation abuse, prompt injection, memory poisoning, and tool misuse. AgentKernel treats structural security as a capability multiplier. Kernel-managed identity supports trustworthy cross-organization collaboration; graduated perception replaces brittle single-point filters; information-flow-controlled memory improves retrieval fidelity while limiting poisoning; and semantic-to-kernel enforcement permits broader tool privileges behind a non-bypassable boundary. We position AgentKernel as the missing OS layer beneath orchestration frameworks, agent runtimes, governance platforms, and execution sandboxes, and use systematic comparison and security analysis to show how a single integrated architecture can enforce security across the full agent lifecycle.
Read the full abstract
Classical Analysis and ODEs
Critical Hausdorff Measure for Higher-Dimensional Bedford-McMullen Subshifts
Let $\Lambda=\operatorname{diag}(m_1,\ldots,m_d)$ be a diagonal expanding integer matrix with $m_1\ge\cdots\ge m_d\ge2$ and at least two distinct diagonal entries, and let $X\subset\mathcal A^{\mathbb N}$ be a subshift with weak specification over $\mathcal A=\prod_{r=1}^d\{0,1,\ldots,m_r-1\}$. Let $K=R(X)$ be the corresponding self-affine set. Writing $\gamma=\dim_{\mathrm H} K$, we prove a sharp critical-measure dichotomy: \begin{align*} \dim_{\mathrm H} K=\dim_{\mathrm B} K \Longleftrightarrow 0<\mathcal H^\gamma(K)<\infty,\quad \dim_{\mathrm H} K<\dim_{\mathrm B} K \Longleftrightarrow \mathcal H^\gamma(K)=\infty. \end{align*} In the second case, $\mathcal H^\gamma$ is not $\sigma$-finite on $K$. This resolves Peres' 1994 conjecture for planar systems and extends to higher dimensions. For sofic subshifts, we prove the existence of the box dimension and show that dimension equality implies that the critical Hausdorff measure is positive and $\sigma$-finite, although it may be infinite. We also construct two examples with $\dim_{\mathrm H} K<\dim_{\mathrm B} K$: in one example the critical Hausdorff measure is positive and finite, whereas in the other it is infinite but $\sigma$-finite.
Read the full abstract
Logic
Two questions on $E_0$-like generic equivalence
We answer Problems 8.1 and 8.3 from \cite{Tianyuan2026}. We first note that the condition attributed there to ordinary Prikry forcing is not correct as written: the appropriate formulation uses finite symmetric difference of the ranges of the generic sequences, rather than eventual equality at the same coordinates. We record answers to the two problems for both formulations. A length-$\omega$ Magidor forcing gives a genuinely Prikry-type example satisfying both conditions. Rigid real-adding forcing gives a broad source of further examples, and a forcing of Jech and Shelah shows that the condition does not carry any large cardinal strength. An $E_0$-invariant Jensen-type forcing of Kanovei and Lyubetsky gives a stronger nontrivial example in which the generic reals in a fixed extension form exactly one full $E_0$-class. Finally, a simple recoding turns the real-forcing previous examples into answers for the version of the problems with corrected condition.
Read the full abstract
Systems and Control
Distributed Algorithms for Filtering, Estimation, and Fault Detection over Cyber-Physical-Systems: A Tutorial and Survey
This survey provides overview of distributed estimation, filtering, and fault detection techniques in the context of cyber-physical systems (CPS). To establish a strong foundation, we first define essential aspects of linear dynamical systems and related graph theoretic concepts, emphasizing observability conditions that are key for local state estimation. After discussing consensus algorithms, this survey highlights single-time and double-time-scale consensus-based estimation and filtering approaches. We provide a detailed comparative analysis of these methodologies, examining their computational requirements, communication overhead, and performance characteristics in resource-constrained environments. We further explore different diffusion-based estimation techniques and observationally redundant designs to enhance resilience and robustness against failures and adversarial attacks. In addition, we investigate distributed fault detection methods that enable local isolation of faults over large-scale CPS. We present both stateless and stateful detection mechanisms, along with threshold-based techniques that balance detection accuracy and false alarm rates. These approaches are essential for maintaining system integrity and preventing cascading failures in critical infrastructure. This survey concludes with an exploration of diverse real-world applications. We examine implementation challenges and algorithm adaptations in smart grid and power networks, social systems, target tracking and localization, and intelligent transportation systems. By bridging theoretical insights with practical applications, this survey and tutorial provides valuable understanding and research directions in the field of distributed algorithm design for CPS, offering both newcomers and experienced researchers a comprehensive resource for addressing current challenges and future opportunities.
Read the full abstract
Social and Information Networks
Measuring Healthcare Accessibility and Resilience for Smart and Connected Rural Communities: A Florida Panhandle Case Study
Rural communities in the United States face persistent healthcare disparities, with fewer providers and facilities, longer trips to care, lower health literacy, and weaker transportation and broadband infrastructure than their non-rural counterparts. Beyond any single barrier, healthcare accessibility is shaped jointly by the geographic availability of services, residents' ability to reach those services, realized utilization, and the capacity of local systems to remain operational during disruptions, which are often examined separately and at coarse spatial scales, limiting their usefulness for community planning. We present a fine-grained, multi-source longitudinal measurement study of healthcare accessibility in Florida, with a focus on the hurricane-prone Florida Panhandle. We integrate healthcare-facility points of service, monthly mobility records from January 2018 through April 2021, Census Block Group (CBG)-level demographic data, and road-network data to compare rural and non-rural communities from supply, travel, utilization, and resilience perspectives. We find that 95.57% of the Panhandle's land area is rural and that 46.7% of rural CBGs contain no healthcare facility in the pooled inventory. Rural residents have less than half the per-capita facility availability of non-rural residents. These disparities remain after measured demographic adjustment, while longitudinal patterns reveal substantial disruptions around Hurricane Michael and COVID-19. Building on this evidence, we formulate an actionable planning framework that combines E2SFCA-based access estimation, stakeholder-weighted prioritization, and constrained deployment models for mobile clinics, non-emergency medical transportation, telehealth, and disaster-resilient services. The study demonstrates how community-oriented spatial intelligence can support equitable and resilient healthcare planning in rural regions.
Read the full abstract
Computer Vision
SpectralCTGaussians: Projection-Domain Reconstruction and Basis Material Decomposition for Spectral CT using 3D Gaussian Splatting
Spectral computed tomography (CT) extends conventional CT by measuring attenuation across multiple energy channels, allowing improved modeling of physical X-ray interactions and energy-dependent material behavior and leading to richer scene understanding. We present a novel method for spectral CT reconstruction and basis material decomposition using 3D Gaussian Splatting by adding per-Gaussian basis material fractions to the set of learnable parameters, which together with a set of energy-dependent basis functions define the attenuation across the full spectral range. The basis functions represent various physical attenuation models such as photoelectric absorption and Compton scattering, and are jointly optimized across all energy channels through a differentiable polychromatic forward model, with material decomposition performed via mean-shift clustering of the resulting coefficients. We evaluate our method on a baseline real-world dataset as well as a synthetic dataset that we introduce, comparing against traditional reconstruction algorithms and state-of-the-art learning-based CT reconstruction methods. Our approach outperforms all traditional baselines in novel view synthesis and achieves the best PSNR among all compared methods for spectral CT volume reconstruction, while describing all energy channels with a single shared representation that requires a number of Gaussians comparable to single-channel Gaussian splatting-based CT reconstruction approaches. For basis material decomposition, no traditional or learning-based baseline offers one-step decomposition with direct RGB material segmentation, and our method additionally recovers the photoelectric basis with higher PSNR than traditional pipelines.
Read the full abstract
Materials Science
Exact benchmarks for the plasmon-pole approximation: Multi-scale screening and the breakdown of the quasiparticle picture
The $GW$ approximation is the gold standard for calculating quasiparticle band structures, yet its computational cost frequently necessitates the use of the plasmon-pole approximation (PPA). While PPA is known to be highly accurate for simple metals and weakly correlated semiconductors, its regime of validity in materials with competing energy scales remains poorly quantified. Here, we construct an exact, numerical benchmark of the PPA using the Lehmann representation of the density response on finite one-dimensional Hubbard clusters. By analytically convolving the exact non-interacting Green's function $G_0$ with the exact pole representation of the screened interaction $W$, we compute the $GW$ self-energy without numerical frequency integration. We demonstrate that in single-scale Mott insulators, the moment-conserving PPA is essentially exact. However, in multi-band semiconductors where interband transitions introduce a low-energy screening channel that competes with high-energy Mott fluctuations, the PPA systematically misjudges the quasiparticle gap by several electron-volts. Furthermore, we show that strong multi-pole screening can drive the exact quasiparticle weight $Z \to 0$, destroying the quasiparticle picture-an effect entirely missed by the PPA, which artificially stabilizes sharp quasiparticles. Finally, we propose a computationally inexpensive diagnostic based on the polydispersity of the loss function's spectral weight, which accurately predicts PPA failure ab initio. Our results provide a rigorous framework for assessing the validity of dynamical screening approximations in strongly correlated materials.
Read the full abstract
Machine Learning
A Manifold-Aware Topic Modeling Approach via Rank-Based Prototypes
Recent topic models leverage pretrained embeddings, but neural architectures produce latent representations without grounding in specific texts, and clustering-based pipelines assign representative documents only post hoc, relying on absolute distances distorted by hubness and anisotropy in high-dimensional spaces. We introduce MARETopic, a training-free framework that casts topic discovery as rank-based prototype selection. After projecting embeddings onto a low-dimensional manifold, MARETopic builds ranked lists encoding ordinal neighborhood structure. A greedy algorithm selects exactly K exemplar documents, real corpus texts, whose neighborhoods cover the corpus. Two variants share this criterion. MARETopic$_\text{Corr}$ scores candidates with a query performance predictor and a rank correlation measure, leading Purity and NMI on the two benchmarks with the most categories, ahead of both neural and clustering-based topic models. MARETopic$_\text{Diff}$ scores them with a rank-based diffusion matrix, needs neither measure, and runs 1.7 to 1.9 times faster. Without a single gradient update, MARETopic leads topic coherence on two of three datasets. A novel inter-topic Maximal Marginal Relevance step raises vocabulary diversity at little cost in coherence. Our code is available at https://github.com/thcastilho/maretopic.
Read the full abstract
Machine Learning (Statistics)
Optimal Recovery Meets Bayesian Learning: Where Worst-Case Bounds Pay Off
Worst-case Optimal Recovery (OR) and Bayesian learning describe the same Gaussian-quadratic-Hilbert problems in two vocabularies. We sharpen the correspondence - the radius of information equals a nugget-optimized GP posterior variance and is attained by the posterior mean at a closed-form balance nugget - and measure, inside three published Bayesian systems, where the worst-case side pays. The ledger is two-sided: the losses instruct as much as the wins. Morozov calibration tracks a test-access oracle within $1.00$-$1.19\times$ where $\sigma$-blind rules fail, is $4.9$-$6.3\times$ more reproducible across noise draws ($p=0.002$-$0.004$), and is the only deployable rule whose selection survives a change of backend ($1.36\times$ against $12$-$30\times$ for the released weight, ML-II and GCV); tight certificates cover at the information-theoretic floor with no numerical slack. But on exchangeable data split-conformal beats the OR head on interval score, a water-filling prior adds nothing without an oracle noise hint, and under covariate shift the OR band keeps coverage on every dataset yet loses interval score to split-conformal, and to a feature-free constant band, on most cells; what pays is not shift but shift on a learnable target, which a training-free audit statistic predicts before any model is fitted. In Bayesian optimization the certified width is a validity floor whose scalar inflation we prove inert under a checkable margin condition and check at every step. Inertness is graded, not binary, and in the size of the inflation as much as in the objective: $\kappa{=}2$ is inert wherever $\kappa{=}5$ is and on more cells besides, while $\kappa{=}5$ moves half the Ackley seeds and every Griewank seed. Exploration is a shape problem, not a scale one. The design rule: match the guarantee tool to the data regime, and audit the regime first.
Read the full abstract
Robotics
Free the Language Model From the Vision Encoder: Semantic Serialization as a Perception Interface for Small Language Models
End-to-end vision-language models (VLMs) bind visual competence to the scale of their language model: as the language model shrinks, perception and reasoning degrade together. We study an embodied scene question-answering (QA) interface in which vision never enters the language model. A frozen perception stack detects and ranges objects; a deterministic semantic serializer compiles the perceived state, errors included, into decision-aligned text; an unmodified text-only large language model (LLM) answers. On a visible-scope-matched, occlusion-audited campus-robot benchmark, under a prospectively frozen criterion, the serialized interface, using detectors fine-tuned in-domain within each fold, outperforms a zero-shot VLM whose language model has the same 7B scale (0.7892 vs 0.7462), with a larger margin at 3B (0.7673 vs 0.6913). Preregistered decoupling experiments show the gain survives paraphrase, attributing it to decision-aligned computation rather than answer-string leakage, while novel judgment vocabularies bound its scope. The advantage grows as the reader shrinks to 1.5B and reverses at 0.5B, and a ground-truth oracle locates the reader-capability floor. Under matched task supervision the interfaces converge: a VLM fine-tuned with low-rank adaptation (LoRA) overtakes the zero-shot system but only ties an equally supervised text reader (0.8441 vs 0.8396, no statistically resolved difference), and both routes remain perception-bound. Reported perception parameters are comparable to those of the VLM's vision tower, and total compute is not smaller.
Read the full abstract
Quantum Physics
Encrypted Redundancy as a Diagnostic Resource: Relational Diagnosis in Quantum Encrypted Cloning
Quantum encrypted cloning encodes an unknown state into several encrypted components, each offering an alternative way to recover it later. We show that this redundancy can also serve for one-shot fault diagnosis: instead of inspecting the encrypted state, we measure relational Pauli observables testing consistency conditions imposed by the encoding. The canonical Yamaguchi–Kempf scheme encodes the input into \(n\) signal–key pairs, all carrying the same coherent Bell label, plus a transformed copy of the input qubit. Comparing the labels of two pairs yields a deterministic check that localizes an anomalous pair and identifies its Pauli-error class without revealing the label. Such checks cannot tell whether the signal or the key of that pair is faulty, and no measurement on the pairs can (we prove that they already generate the whole group of deterministic state-blind observables supported there, of rank \(2(n-1)\)). This ambiguity matters: a faulty signal costs one redemption path, a faulty key threatens them all. However, retaining also the transformed input qubit contributes exactly two further independent checks, at any multiplicity, and these suffice to identify any single fault drawn from the single-qubit Pauli set. For three clones this gives six checks in all, and we prove that no smaller set of state-blind observables achieves the same resolution. Across clone multiplicities, parity governs how many components must be measured jointly to reach this resolution, not the resolution itself. These findings are then abstracted into a general framework — state-blind observables, deterministic healthy references, syndrome-induced fault partitions, redemption-oriented sufficiency — yielding relational diagnosability: a syndrome need not identify every fault, only enough of it to select a safe redemption path.
Read the full abstract
Machine Learning
A Pinch of SFT, A Dash of RL: When Reinforcement Learning Helps Long-Horizon Advertising Agents
Enterprise analytics agents solve long-horizon tool-use problems over distributed business data, requiring retrieval, reasoning, API calls, code execution, and adaptation to intermediate observations. Supervised fine-tuning (SFT) calibrates tool syntax and teacher-supported behavior, whereas reinforcement learning (RL) can explore reward-supported behaviors beyond demonstrations; applied uniformly, however, RL can perturb already-calibrated skills. We study how to balance SFT and RL under production-mirroring beta APIs. We observe that, in our controlled experiment, checkpoint trajectories retrospectively separated into three regimes: Imitation, where SFT captured reliable teacher behavior; Lift, where both stages helped; and Discovery, where useful reward-observable behavior lay outside reliable teacher support. We leverage this prospectively, using teacher support and reward-observable headroom to route features to SFT only, SFT then RL, increased RL allocation, or further environment development. Across 18 subsequent feature-specific experiments, the diagnostic predicted 15/18 observed trajectories. On GPT-OSS 120B, targeted SFT then RL produced positive point estimates on 7/8 advertiser skills relative to a frontier Control; five positive gains had paired 95% confidence intervals excluding zero, while one skill had a confidence-supported regression. The largest gain was non-disclosure (+11.27 points; 95% CI [+9.72, +12.82]). A separate SME audit surfaced that targeted RL reduces standard leakage from 11.8% to 2.9% and adversarial leakage from 22.9% to 6.8% relative to SFT while preserving actionability (86.2% to 85.7%). In a matched uniform-versus-targeted comparison with shared rewards and optimization, targeted RL improved the seven-skill mean delta from +1.62 to +3.57 while using 43% less incremental RL compute.
Read the full abstract
Signal Processing
Quantum-Stable Robust Principal Component Analysis: Theory and Evidence from NISQ Regimes
Robust Principal Component Analysis (RPCA) is a fundamental technique for extracting low-rank structures from data corrupted by sparse anomalies and noise. While classical RPCA and its stable variants have been widely studied, their computational cost grows prohibitively with data dimensionality. Motivated by emerging trends in quantum machine learning, this paper introduces Quantum-Stable RPCA, the first quantum algorithm for robust low-rank and sparse decomposition under noisy intermediate-scale quantum (NISQ) constraints. Our approach integrates Quantum Singular Value Thresholding (QSVT) for low-rank recovery with Quantum Sparse Approximation (QSA) for anomaly detection, while explicitly modeling gate, decoherence, and measurement errors inherent in quantum hardware. We establish six theoretical results covering recovery guarantees, identifiability, robustness to approximate structure, quantum noise resilience, convergence of alternating minimization, and generalization bounds, thereby extending classical RPCA theory to the quantum regime. Extensive Qiskit-based simulations confirm that Quantum-Stable RPCA delivers significant runtime improvements over classical solvers while maintaining competitive reconstruction accuracy, even under realistic NISQ noise levels. This work provides a blueprint for quantum-enhanced robust learning, bridging machine learning and signal processing paradigms.
Read the full abstract
Machine Learning
SegTSim: A Big Data Driven Segmented Temporal Simulation Framework for Heterogeneous Multivariate Systems
Heterogeneous multivariate time-series systems exhibit segment-specific nonlinear dynamics that challenge monolithic forecasting architectures. We propose SegTSim, a big-data-driven segmented temporal simulation framework that integrates segment-specific elasticity modeling with adaptive min-gating, dynamic production relocation optimization, multi-factor data fusion with exchange-rate propagation, and a deep ensemble validation pipeline. The framework is validated on US–Japan automotive trade data from USITC repositories spanning 2015 to 2025, comprising approximately 13000 annual records. Under a 25% perturbation scenario, Japanese import volume declines by 20.4% to 0.93 billion USD, while all output variables maintain coefficients of variation below 3.5% across 1000 ensemble inference runs.
Read the full abstract
Machine Learning
WildfireSpreadBench: The Metric Decides the Model in Wildfire Spread Prediction
Machine learning is being increasingly used to predict where active wildfires will burn the following day, helping inform evacuation boundaries and containment lines. Most models are evaluated using Average Precision (AP), which summarizes performance across all decision thresholds, although acting on a forecast requires choosing one. We benchmarked five discriminative architectures and one generative model on WildfireSpreadTS using a shared evaluation pipeline and two input configurations. We found that model rankings varied depending on whether performance was measured by AP or by threshold-dependent metrics like F1 and IoU. At the default 0.5 threshold, the highest-AP model flagged 4 to 5 times the observed active-fire area and ranked fifth of six on F1 and IoU, and the most recall-heavy model flagged 16 to 23 times. The three models whose flagged area stayed close to the observed area had AP scores 24 to 37% lower. Across models, we identified three distinct prediction profiles: over-predicting, balanced, and under-predicting, which AP alone could not distinguish. Expanding the input from 7 to 23 channels changed AP by 0.03 on average, against a 0.21 to 0.24 spread across models. Ultimately, these results show that AP alone can favor models whose predictions are poorly suited for operational wildfire forecasting.
Read the full abstract
Quantum Physics
Non-Markovian Quantum Decay in Complex Environments: A Hyperstatistical Approach
The exponential decay of an unstable quantum state, as described by standard Markovian theories such as Fermi's Golden Rule, assumes a simple, structureless environment. However, in complex environments characterized by disorder, long-range interactions, or strong fluctuations, local decay rates fluctuate, leading to non-Markovian dynamics and power-law “long-time tails.” In this paper, we apply the recently proposed hyperstatistics framework to the problem of quantum decay in such complex environments. By considering a $\gamma$-distribution of local decay rates across mesoscopic domains, we derive a macroscopic survival probability governed by a $q$-exponential function. We then use the $q$-generalized Gamma function, defined via the Mellin transform of the $q$-exponential, to calculate the moments of the decay-time distribution. We show that the mean quantum lifetime is $\langle t\rangle = \int_0^\infty P(t)\,dt= [\langle\Gamma\rangle(2-q)]^{-1},$ and is therefore finite for $q<2$. The convergence of the second moment, and hence of the lifetime variance, instead requires the stricter condition $q<3/2$. These results provide a refined physical interpretation: for $1<q<3/2$ both the mean lifetime and its variance are finite; for $3/2\le q<2$ the mean lifetime remains finite but lifetime fluctuations become infinitely broad; and for $q\ge2$ the mean lifetime itself diverges, corresponding to a truly trapped, localized, or Griffiths-like regime.
Read the full abstract
Digital Libraries
Cortex: Content Analysis Support Software, a Resource for Qualitative Research
Qualitative research is widely used in the human and social sciences, characterized by a deep understanding of phenomena through the interpretation of meanings and contexts. Among qualitative data analysis methods, content analysis stands out as a consolidated technique, which allows for the systematic description and interpretation of textual contents. However, as data volume increases, the time required for organization, reading, and categorization becomes a significant challenge, potentially delaying research development. Therefore, this work aimed to develop a web application to support content analysis, based on Bardin's methodology, targeted at academic researchers. The methodology adopted a mixed approach, combining bibliographic research on content analysis with semi-structured interviews with four experienced researchers, aiming to identify real needs and requirements. Based on these inputs, the Cortex software was developed to assist the researcher in the pre-analysis and material exploration stages, generating suggestions for indices, indicators, and categories with full traceability to original documents. The results demonstrate that Cortex is capable of guiding the researcher through the entire methodological workflow, from corpus configuration to results exportation, acting as a methodological collaborator without replacing the researcher's interpretative autonomy.
Read the full abstract
Computer Vision
Evidence-Order Calibration for Selective Visual Reasoning under Progressive Loss of Question-Critical Evidence
Vision-language model (VLM) confidence may change in aggregate when visual evidence is degraded while remaining structurally inconsistent within individual examples. We study answer-level reliability along five-step, question-conditioned evidence-loss trajectories. Using a frozen Qwen2.5-VL-3B-Instruct model, we construct 176 accepted GQA-derived trajectories (880 masking conditions) by progressively masking scene-graph-localized question-critical regions. Native sequence confidence has an evidence monotonicity violation rate (EMVR) of 0.436, and 92.0% of trajectories contain at least one adjacent violation. A matched non-critical-region control shows that full critical masking reduces accuracy by 28.2 percentage points, compared with 0.6 points for equally sized non-critical masks; the paired difference is 27.6 points (95% CI [20.0, 34.7]). We train a lightweight post-hoc reliability head on frozen hidden states, sequence confidence, and entropy. Adding evidence-order supervision to binary cross-entropy (BCE) reduces masking EMVR from 0.330 to 0.303 (paired difference -0.027, 95% CI [-0.044, -0.010]). The same mask-trained objective reduces EMVR from 0.449 to 0.402 on held-out question IDs under unseen local Gaussian blur (difference -0.0468, 95% CI [-0.0739, -0.0199]). AUROC, Brier, and AURC differences between the two learned heads are statistically inconclusive, and native confidence remains stronger for selective-risk ranking. The results separate evidence-order consistency from conventional correctness discrimination rather than establishing generic confidence superiority.
Read the full abstract
Rings and Algebras
A note on idempotents in quandle rings
It was conjectured that the nonzero idempotents of the integral quandle ring of a finite latin quandle are trivial. We prove this holds for latin dihedral quandles. Furthermore, we discuss counterexamples against this conjecture.
Optics
Reliable iToF Depth Sensing via Sensor-Intrinsic Uncertainty Modeling and State-Space Restoration
Indirect time-of-flight (iToF) cameras provide compact and cost-effective dense depth measurements, but their ranging accuracy is often degraded by sensor-intrinsic uncertainty under practical imaging conditions. Spatially uniform or range-only Gaussian perturbations cannot accurately reproduce the range-dependent and signal-dependent noise characteristics of real iToF measurements, leading to a synthetic-to-real gap for learning-based restoration. To address this problem, we propose a joint depth-uncertainty modeling and restoration framework for reliable iToF sensing. A sensor-intrinsic depth-uncertainty model is first developed from calibrated tap responses, returned-signal levels, and sensor noise statistics through a depth-oriented weighted least-squares formulation. The resulting pixel-wise uncertainty is used for heteroscedastic depth synthesis and uncertainty-aware restoration supervision. Based on this heteroscedastic data synthesis, we further develop a U-shaped restoration network with Depth Visual State Space (DVSS) blocks, which combine long-range state-space modeling with convolutional spatial-channel refinement for structure-preserving depth recovery. Experiments on synthetic data and measurements captured by an in-house iToF prototype validate the proposed uncertainty model under varying range and returned-signal conditions. Controlled comparisons with fixed and range-aware Gaussian noise, together with evaluations on U-Net, Restormer, and DVSS, further demonstrate that the proposed synthesis consistently benefits different restoration backbones. The complete framework achieves 40.85~dB PSNR and 2.54 mm MAE on the synthetic test set, and 35.42 dB PSNR and 4.87 mm MAE on real iToF measurements.
Read the full abstract
Graphics
ECHO: Dyadic 3D Facial Motion Generation with Asymmetric Deterministic Articulation and Stochastic Reaction
We propose ECHO for dyadic 3D facial motion generation under a strict dual-stream audio-only setting, formulating the problem as an asymmetric task involving speech-constrained articulation and one-to-many listener reactions. To address this asymmetry, ECHO decomposes motion into a deterministic anchor that captures stable speech-correlated structure and a stochastic residual that models the remaining one-to-many interaction dynamics. On top of this backbone, Motion Memory acts as a training-only regularizer during brief late-stage fine-tuning to provide local priors for weakly conditioned listening windows, while semantic-group scaling controls residual injection across expression, jaw, and neck. This design balances speaking-side articulatory fidelity with listening-side realism and diversity in a single generation process. Results from unified, state-wise, and ablation evaluations show that conversational 3D motion benefits from decomposing stable and uncertain components rather than applying stochasticity uniformly. ECHO provides a practical formulation and technical basis for deployable conversational digital humans under strict audio-only conditions.
Read the full abstract
Artificial Intelligence
SciLitBench: Benchmark and Design Principles for LLM-Powered Systematic Literature Reviews
Systematic reviews require sustained human judgment across thousands of records, yet existing evaluations of large language models (LLMs) typically examine review stages in isolation. We introduce SciLitBench, a multi-stage benchmark spanning title and abstract screening, full-text screening, and schema-guided data extraction, with 42,981 retrieved records, 1,012 full texts, and annotations for 888 included papers. Across 22 open-weight LLMs from six model families, explicit inclusion and exclusion criteria improve title and abstract screening $F_2$ by 28.8%, while researcher-authored rationales improve full-text screening by 15%. Data extraction reveals a different reliability regime: performance declines from 0.97 accuracy for publication year to 0.37 Jaccard overlap for computational approach, while the strongest models recover only 30% of annotated evaluation evidence and 25% of limitations. SciLitBench identifies a practical boundary between high-recall screening and evidence-complete extraction and provides a reproducible resource for evaluating LLM-assisted evidence synthesis.
Read the full abstract
Complex Variables
On the Kobayashi isometries of a class of 2-dimensional Lempert manifolds
We prove that every Kobayashi distance isometry between $2$-dimensional Lempert manifolds having finite universal set (with atleast three elements) is holomorphic or anti-holomorphic. It is shown that every such isometry is $C_{loc}^{1,1}$ without any regularity assumption on the isometry.
Read the full abstract
Classical Physics
The Schwitters Memorial Problem: A Car Speeds Across a Triangular Bump
Most drivers slow down for speed bumps, sometimes to almost a stop, as if each speed bump were a stop or yield sign. The late Roy Schwitters and I shared the view (here called the Schwitters Doctrine) that one should take the bumps at a speed of at least 60 or 70 kph (35 to 45 mph), not because we were scofflaws, but because we found, based on informal experiments, that the traverse was less jarring at high speeds than at low. Here, the problem is worked in terms of the geometry of the wheels on the road and two coupled, damped harmonic oscillators representing the suspension of the car and the driver's cushioned seat. The Schwitters Doctrine is recovered, but not in the way that one expects.
Read the full abstract
Classical Physics
Free Precession Revisited: A Vector-Only Analysis of Gyroscopic Dynamic Equilibrium
This paper presents a self-contained, vector-only formulation of gyroscope precession about a fixed pivot – gravity-driven, not the torque-free Euler-Poinsot case. The derivation of its governing equation uses vector integrals and cross products of intrinsic vectors, with no component decomposition; no tensor or dyadic formalism, matrix or Euler angle enters. Inertia about the center of mass enters through two mass integrals alone: the polar second moment of mass $J_0$ (isotropic) and the vector operator $\vec F$ (the rest, including all non-isotropic inertia). Using material time derivatives referenced to the inertial observer, the torque about the pivot is assembled once from the complete acceleration of each mass element, giving an exact, unified vector equation for steady precession. The balance of the gravity torque against this inertia torque reproduces the classical steady-precession relation of the heavy symmetric top exactly at non-vertical tilts, on both the slow and fast branches, with the horizontal-shaft case exact rather than approximate. Closed forms are given for the disk, sphere, and circular and rectangular toruses. The constant tilt angle of dynamic equilibrium is explained as torque equalization: the two torques about the pivot balance exactly at that tilt and unequally on either side of it, treated throughout as a geometric function of the tilt under constant precession and self-spin rates, and never as a function of time. Informationally equivalent to the classical description, the work contributes, in order, an interpretation (the classical balance read in torque vectors throughout) and the vector method as its tool. The exact relation predates this work: Klein and Sommerfeld stated it in 1897, Brand in 1930. Begun by the author in 1975 and re-verified symbolically, the work is intended for undergraduate readers, with every step of the derivation stated.
Read the full abstract
Machine Learning
Efficient Context-Limited Telescope Bibliography Classification for the WASP-2025 Shared Task Using SciBERT
The creation of telescope bibliographies is a crucial part of assessing the scientific impact of observatories and ensuring reproducibility in astronomy. This task involves identifying, categorizing, and linking scientific publications that reference or use specific telescopes. However, this process remains largely manual and resource intensive. In this work, we present an efficient SciBERT-based approach for automatic classification of scientific papers into four categories - science, instrumentation, mention, and not telescope. Despite strict context-length constraints (maximum 512 tokens) and limited compute resources, our approach achieved a macro F1 score of 0.89, ranking at the top of the WASP-2025 leaderboard. We analyze the effect of truncation and show that even with half the samples exceeding the token limit, SciBERT's domain alignment enables robust classification. We discuss trade-offs between truncation, chunking, and long-context models, providing insights into the efficiency frontier for scientific text curation.
Read the full abstract
Software Engineering
What Is a System? An Interaction-Based Account of Structure-Behavior Coalescence in General Systems Theory
The question of what constitutes a system remains fundamental to General Systems Theory. Existing definitions commonly characterize a system in terms of elements, relationships, boundaries, functions, or interactions, but these perspectives do not always provide a unified account of how system structure and system behavior constitute one another. This paper proposes Structure-Behavior Coalescence (SBC) as an interaction-based account of what a system is. From the SBC perspective, a system is not merely a collection of elements or relationships, nor is it adequately characterized by behavior considered independently of structure. Rather, a system is a structured entity whose behavior arises through interactions among its constituent entities, with those interactions simultaneously contributing to both its structural organization and behavioral realization. The paper develops this perspective by distinguishing system structure, interaction, and behavior while treating them as inseparable aspects of a unified system representation. It argues that interactions provide the essential link through which structural relationships become behavioral processes and through which behavioral processes reveal and instantiate system structure. This perspective provides a basis for representing systems in a manner that maintains consistency between what a system is and what a system does. The paper further considers the implications of SBC for General Systems Theory, particularly for system identity, system boundaries, behavioral emergence, and the representation of complex systems. SBC is presented as a general conceptual foundation that complements existing systems theories by placing the coalescence of structure and behavior through interaction at the center of the definition of a system.