Peer Revenue Returns subject to peer review

Papers

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

All of arXiv

Wednesday 2 September

Computation and Language

The Bairong System for MLC-SLM 2026: Dynamic Question-Aware Evidence Routing for Multilingual Conversational Speech Understanding

Long multilingual conversational spoken question answering requires systems to balance long-range transcript semantics with sparse acoustic and speaker-sensitive cues. We present the Bairong system for the MLC-SLM 2026 Challenge, where a diarization-ASR front-end produces speaker-attributed transcripts and a dynamic evidence router constructs question-specific inputs for answer prediction. Instead of applying a fixed transcript-only or audio-only policy, the router infers the required evidence type and context scope from the question and answer options, and selects among full transcript context, local audio-text fusion, speaker-linked evidence, and compact global acoustic samples. This transcript-backbone design keeps discourse context available while activating audio only when it provides complementary evidence. Our Task 1 system achieves 25.70% and 18.44% tcpMER on the development and evaluation sets. For Task 2, the final system obtains 94.84% devel?opment accuracy, outperforming the full-transcript baseline by 1.68 points and the best audio-centric diagnostic system by 2.77 points. These results support dynamic question-aware routing as an effective evidence allocation strategy for conversational spoken QA.
Read the full abstract

All authors Shangkun Huang, Junchao Hu, Huan Shen, Guoji Wang, Yingao Wang, Shaosai Li, Wei Zou, Yunzhang Chen

Computation and Language

SCoP: Structured Constraint Parsing for Evidence-Space Control in Temporal Knowledge Graph Question Answering

Temporal Knowledge Graph Question Answering (TKGQA) requires answer inference from evidence that is both structurally valid and temporally admissible. Existing methods often leave anchor-event binding, temporal admissibility, and ordinal selection implicit in model reasoning, task-specific training, or similarity-driven retrieval, allowing locally relevant but invalid facts to enter the answer context. We formulate complex TKGQA as evidence-space control and propose SCoP (Structured Constraint Parsing), a constraint-centric framework that externalizes temporal decisions before answer inference. Instead of treating retrieved facts as admissible evidence by default, SCoP separates answer-seeking event patterns from temporal anchor events, conservatively grounds them to canonical TKG entities and relations, and translates temporal intent into executable constraints with optional ranking requirements. These constraints operate over normalized point and interval ranges, enabling deterministic filtering of structurally compatible candidates and producing a compact evidence space for generation. Experiments on MultiTQ and TimelineCronQ-R assess SCoP across timestamped point-fact and interval-oriented settings with richer temporal relations and ordering dependencies. Without task-specific parameter updates, SCoP achieves 0.825 Hits@1 on MultiTQ and 0.761 Hits@1 on TimelineCronQ-R, with gains on constraint-intensive question types. These results support explicit evidence-space control over unconstrained retrieval or implicit temporal reasoning.
Read the full abstract

All authors Xiaokun Guo, Zhen Xu, Dongdong Huo, Yanqiu Zhang, Dongjin Yu, Yu Wang

Computation and Language

A Channel-Boosted Multi-Agent System with Iterative Consultation for Document Sensitivity Classification

Organizations in critical national infrastructure sectors must assess heterogeneous documents for sensitivity before routing or storage. Manual assessment is slow, inconsistent, and unscalable. Extending our prior leakage-controlled benchmark, BERT established the top single-encoder baseline (89.14% accuracy, 89.33% F1-score under 5-fold cross-validation on the Strategic 16K corpus). However, transformer baselines suffer from a structural limitation: fixed input length truncation discards evidence beyond the retained window-precisely where sensitive cables tend to be longest. We present Channel-Boosted MAS (CB-MAS) and instantiate it as IC-MAS (Iterative Consultation Multi-Agent System) to solve this without long-context computational costs. A Channel Critic Agent learns document-adaptive trust weights governing Gated Channel Boosting between two first-window encoders, while paired Consultation Agents iteratively exchange belief states to reconcile evidence from the beginning and end of long documents. IC-MAS holds computation constant regardless of document length by reconciling fixed windows in a compact representation space. Ablation studies show critic-controlled Channel Boosting provides the bulk of accuracy gains, while consultation recovers recall without precision collapse. Critic-Controlled Gated Channel Boosting with Max-Pool fusion and Blackboard Adaptive Consultation achieves 90.72% accuracy, 91.23% F1-score, 92.01% sensitive recall, and 90.46% sensitive precision, using about 54% less average computation than a fixed-round baseline. Gains over the single-encoder baseline are statistically significant (McNemar's test, p less than 0.000001; paired t-test). We include LIME/SHAP explainability, multi-agent evaluation, and an honest accounting of limitations.
Read the full abstract

All authors Aleesha Zainab, Asifullah Khan, Muhammad Ahmed Khalid, Faheem Ullah Khan

Instrumentation and Detectors

An extensible software platform for automated operational and characterization testing of scientific cameras

Multi-detector programs such as Earth 2.0 (ET) require detector characterization across different technologies, operating conditions, and production batches, together with consistent procedures for operation, characterization, and device selection. Traditional laboratory workflows often distribute camera control, illumination, image analysis, and report generation across detector-specific programs and manual steps, slowing iterative development and hindering standardized characterization. We address this gap with PixelXVision, a layered software platform that combines a common camera SDK, preset-based configuration, and a runtime plugin system. Detector-specific behavior is configured through declarative presets, allowing the same host interface to operate CCD, CMOS, and infrared detectors without model-specific core changes. Characterization procedures are implemented as plugins that use a shared object manager to access camera, illumination, storage, and database services. Each run links raw frames, measured operating conditions, configuration, analysis products, and reports into a traceable archive with a queryable index. The platform supports lightweight deployment for iterative single-detector development and structured workflows for multi-detector campaigns. The platform has been applied in characterization testing across CMOS, CCD, and HgCdTe cameras, and its configurable architecture can accommodate additional camera models for subsequent CCD testing for WFST without model-specific changes to the core host software. For operational troubleshooting, the platform integrates ChatPixel, a knowledge-base assistant that provides answers with cited sources when it has relevant information.
Read the full abstract

All authors Baolong Chen, Hongfei Zhang, Wei Liu, Zihao Xia, Xin Luo, Qi Feng, Zhe Geng, Jian Wang

Information Theory

Conflict-Free Color-Clustered Sequential Belief-Propagation Decoding of Quantum LDPC Codes via Reinforcement Learning

Belief-propagation (BP) decoding for quantum low-density parity-check (QLDPC) codes is attractive due to its low complexity and low latency, but it is often limited by short cycles, degeneracy, and convergence failures. Reinforcement-learning-based sequential BP decoding (RL-S) improves BP by learning a syndrome-dependent variable-node (VN) update order, but its VN-by-VN schedule has limited within-iteration parallelism. In this paper, we propose a conflict-free color-clustered extension of RL-S. We construct a VN conflict graph in which two VNs are adjacent if they share an X-type or Z-type check, and color this graph so that same-color VNs have disjoint check neighborhoods. This also prevents VNs from the same Tanner 4- or 6-cycle from being updated simultaneously. During decoding, the trained VN-level Q-table selects a seed VN, and all remaining VNs with the same color are updated in parallel using the same pre-batch messages. For the [[288,12,18]] bivariate-bicycle code over the depolarizing channel, our proposed decoder achieves block-error-rate performance close to VN-level RL-S while reducing the scheduling decisions from 288 VNs to 11 color classes per BP iteration.
Read the full abstract

Nuclear Theory

Projective Origin of the Spin Hydrodynamic Attractor and Its Resurgent Repellor

We investigate the projective and resurgent structure of a spin hydrodynamic attractor in Bjorken expansion. We show that the nonlinear spin solution family is determined by the projective classes of the two dimensional linear solution space, with the attractor and repellor corresponding to two distinguished projective directions and the linear modes ratio generating the full one-parameter transseries tower. Using the projective transseries structure, we show analytically that the data of repellor are encoded in the Borel-Stokes structure of the attractor expansion. These results provide an explicit analytic realization of resurgence relations that are often extracted through high order expansions and numerical Borel analysis, and yield a unified description of the attractor, the repellor, and their Borel-Stokes connection in minimal causal spin hydrodynamics.
Read the full abstract

General Relativity and Quantum Cosmology

Exceptional points and the breaking of Schwarzschild isospectrality under local potential perturbations

The odd- and even-parity gravitational perturbations of a Schwarzschild black hole are governed by the distinct Regge-Wheeler and Zerilli potentials, yet their quasinormal-mode (QNM) spectra are identical in vacuum. Building on our previous study of the odd-parity Regge-Wheeler spectrum [M. Ould El Hadj and S. R. Dolan, arXiv:2608.16283], we investigate the corresponding even-parity Zerilli problem and compare the two sectors under the same perturbation of amplitude $\epsilon$ at radius $r_0$. Using the Chandrasekhar-Detweiler relation, we derive an exact relation between the normalized Wronskians and show that Schwarzschild QNM isospectrality is not preserved under an identical nonzero localized defect. We find that the even- and odd-parity repelling-point branches approach the same Schwarzschild QNM frequencies at large $r_0$, with their first parity-dependent separation appearing at order $1/\mathcal R^2$, where $\mathcal R=r_{0*}/M$ is the dimensionless tortoise-coordinate location of the defect. The corresponding exceptional points (EPs) form two shifted sequences with the same asymptotic spacing in the tortoise coordinate, while their relative displacement is fixed by the phase of the asymptotic Chandrasekhar-Detweiler factor. The critical perturbation amplitudes share the same exponential decay rate in the two sectors, whereas the ratio of their asymptotic prefactors is fixed by the modulus of the same factor. We further find that the even- and odd-parity EPs connect the same neighboring QNM overtones, with nearly identical arclengths for the corresponding spectral bridges. Finally, the exceptional degeneracy is parity selective: at identical values of $(r_0,\epsilon)$, a pair of QNMs may coalesce at an EP in one parity sector while remaining distinct in the other, leading to a corresponding difference in the local pole structure of the ringdown response.
Read the full abstract

Computation and Language

Clinical Reasoning Under a Partially Observed Objective in Cone Beam CT Report Generation

Maxillofacial report generation from cone beam computed tomography is scored here by a composite objective placing 80% of its weight on a large language model judgement of factual entailment and 20% on lexical overlap, of which only the lexical fifth is visible during development. The grader's BLEU-4 and METEOR routines are reproduced in pure Python and match the reference to machine precision, and an offline entailment surrogate, which tells a report written for one patient from one written for another at an area under the curve of 0.987, makes the composite objective cheap enough to optimise directly. Over the 622-case public release, a report selected against the visible lexical ranking scores 0.2909, whereas one selected against the composite objective scores 0.4122, because pursuing n-gram overlap drives entailment precision from 0.522 down to 0.266. A 29 million parameter encoder fine-tuned on the release reaches a prevalence-weighted out-of-fold area under the curve of 0.486 over 985 statements, indistinguishable from the corpus prior, while nine numbers read from the image header reach 0.945 for mandible coverage and 0.872 for condyle coverage, and acquisition centre alone predicts sentence choice at 0.718 against 0.663 for the image-derived model, identifying dictation convention rather than anatomy as the quantity the lexical metrics reward. The delivered system emits eight unconditional statements and five gated on header geometry under polarity, laterality and tooth-level consistency constraints, and reaches METEOR 0.3542 over 50 held-out cases from an unseen centre. The dataset and code are available at https://github.com/GIND123/CBCT-Clinical-Reasoner
Read the full abstract

All authors Ajo Babu George, Govind Arun, Sidharth N Krishna, Uma Ranjan

Computer Vision

Occlusal Geometry in Closed Form for Orthodontic Report Generation

Orthodontic report generation from intraoral data is normally cast as multimodal captioning, yet the released Bite2Text scan pairs are supplied already registered in occlusion, which makes several core occlusal quantities directly measurable rather than inferable. The system reported here exploits that property: an anatomical frame is recovered per case from arch taper and arch closure instead of the stated RAS convention, which does not hold across the release, and each arch is reduced to an occlusal ridge profile in arch-angle coordinates yielding overbite, overjet, midline deviation, transverse overlap, crossbite extent, cusp interdigitation lag, and the occlusal curves in closed form. Gradient boosting maps 31 such measurements onto 13 template fields, a field being predicted only where patient-level cross-validation beats its own majority baseline, and a deterministic renderer emits the corpus six-part narrative; a ConvNeXt-Tiny classifier over the five standardised photographic views is fused per field, raising mean field accuracy from 0.601 to 0.683. Reimplementation of the challenge evaluator shows that its BLEU-4 and METEOR are local variants whose F-mean weights recall nine to one, that two clinicians agree on 47 percent of findings for the same patient, and that a constant report consequently outscores a genuine second clinician report by 0.165 captioning. Held-out scores reach BLEU-4 0.458 and METEOR 0.677 against intraoral scan references and 0.278 and 0.507 against photograph references, and the submitted system placed third in the ODIN 2026 Bite2Text test phase at 0.2680 and 0.4629, within 0.022 BLEU-4 of first, running on CPU in under ten seconds per case. The dataset and code are available at https://github.com/GIND123/ODIN_toothfairy4
Read the full abstract

All authors Ajo Babu George, Govind Arun, Sidharth N Krishna, Uma Ranjan

Robotics

Self-Evolving AI for Humanoids: Mechanisms, Safety, and Evaluation of Post-Deployment Self-Improvement

Humanoid robots are becoming an important part of embodied artificial intelligence, driven by advances in reinforcement learning for locomotion, world models for prediction, and vision-language-action models for general control. However, most of these systems remain static after deployment. A policy is trained offline for a fixed objective and then frozen, even though the tasks, environments, and robot bodies keep drifting over time. An emerging paradigm of self-evolving agents aims to address this problem by allowing systems to improve from their own post-deployment experience. Since most existing studies focus on disembodied software agents, this survey examines how self-evolution changes when an agent has a physical body. We first define self-evolution for humanoids and represent a deployed robot using a state tuple that includes its policy, perception, memory, workflow, and body. This state is updated by an evolution operator in a slow outer loop with a lifelong objective. We then organize the literature into four complementary mechanisms of self-evolution, presented in increasing order of autonomy: self-learning, self-adaptation, self-optimization, and self-generation. Since changes to a humanoid can introduce physical hazards, we treat safety and uncertainty as key design dimensions of the evolution operator, and further formulate admissible evolution as a constraint enforced by a world-model verification gate within a human-oversight envelope. Finally, we present that evaluation should track the robot's evolving trajectory rather than a fixed checkpoint, and we identify the lack of a benchmark designed specifically for self-evolving humanoids. Moreover, we outline open challenges spanning AI algorithms, on-board systems, and governance.
Read the full abstract

All authors Loc X. Nguyen, Avi Deb Raha, Huy Q. Le, Eui-Nam Huh, Dusit Niyato, Choong Seon Hong

Robotics

Pose accuracy is not grasp reliability: residual pose posteriors improve simulated robotic grasp planning

Model-based robotic grasping estimates an object's six-dimensional (6D) pose and plans on its mesh as if that pose were exact. We show that this assumption reduces simulated grasp success even when the pose passes the standard accuracy test. We built LM-Grasp, a benchmark of 15{,}800 real LINEMOD RGB-D images with grasp outcomes simulated on scanned meshes. FoundationPose meets the ADD(-S) criterion (mean model-point error below 10% of the object diameter) on 0.997 of test scenes, yet planning on its estimate succeeds in 0.791 of scenes, compared with 0.856 using the annotated pose. Because the estimator reports no uncertainty, we build a pose posterior from its own errors on annotated training frames, resampled from frames with similar observable fit, and score each grasp by its mean success across sampled poses and four equally weighted physics scenarios. Without retraining the estimator, posterior planning yields 0.859 (difference from the annotated-pose result +0.003; 95% scene-wise paired-bootstrap interval [$-$0.003, +0.009]). This interval is compatible with no difference and a small shortfall; we did not conduct an equivalence test. For pose errors of 5 to 10% of the diameter, simulated success rises from 0.796 to 0.984. Among test scenes assigned singleton-success conformal prediction sets, observed held-out precision is 0.972, compared with 0.904 for the point-estimate planner; these are empirical precision estimates, not conditional guarantees. On occluded LM-O scenes never used for tuning, posterior planning closes 66% of the gap to the annotated pose.
Read the full abstract

Robotics

Harnessing human expertise for high-precision robotic assembly in industrialized construction: A sample-efficient installer-in-the-loop interactive reinforcement learning framework

Industrialized construction imposes stringent precision requirements on robotic assembly of modular components such as prefabricated window units. In tolerance-critical operations, the central bottleneck is not only mechanical clearance but also converting tacit installer expertise into data-efficient autonomy under sparse acceptance feedback, contact variability, and millimeter-scale constraints. We present an installer-in-the-loop interactive reinforcement learning framework that acquires expertise through offline teleoperated demonstrations, sparse event-driven binary takeovers at contact-failure boundaries, and acceptance-aligned terminal rewards, logged under a unified schema for traceable offline-to-online adaptation. A temporally abstract action-sequence policy built on Q-chunking with Flow Q-Learning captures multimodal recovery maneuvers under sparse terminal rewards, while a non-updating warm-start phase stabilizes the offline-to-online transition. The framework is evaluated in MuJoCo across the workflow from suction acquisition through clearance-limited seating, under structured staging and end-to-end randomized placement. Within a defined stress-test regime with 2 mm per-side clearance, bounded pose perturbations, and friction randomization, the pipeline attains 100% autonomous seating with 12–15 min of cumulative installer supervision over 3.0 h of online training, and reaches the 95% success milestone in approximately 0.5 h and 1.5 h in the two experiments. We also report wall-clock adaptation time, cumulative takeover minutes, intervention-rate decay, and stage-wise failure attribution to inform supervision budgeting. Ablations isolate the complementary contributions of temporal abstraction, installer intervention, and warm-start value calibration.
Read the full abstract

All authors Zekai Jin, Huiguang Wang, Xiaoning Sun, Yi Shao

Computer Vision

EMCStereo: Attention-Enhanced Stereo Matching for Thin-Structure Depth Estimation with a Synthetic Tree-Branch Benchmark

Thin structures such as tree branches are among the hardest cases for stereo matching: a branch is only a few pixels wide, the background is cluttered, and dense ground truth for real branches is nearly impossible to label by hand. We make three contributions. First, EMCStereo integrates three lightweight attention modules into a PSMNet-style cost-volume backbone: Efficient Multi-scale Attention (EMA) on deep semantic features, a Multi-Scale Fusion block (MSFblock) learning spatial pyramid weights instead of concatenating them, and Coordinate Attention (CoordAtt) on final matching features. Because MSFblock collapses four pyramid branches into one, the modules leave the network 2.0% smaller and add only 1.7% inference time overhead. Second, VirtualTree is a synthetic stereo dataset rendered in Unreal Engine 5 with a simulated ZED Mini rig, providing 5,520 pairs with exact disparity for thin branches. Third, an eight-way ablation establishes a run-to-run noise floor of 0.009 px end-point error (EPE). EMCStereo achieves 1.31 px EPE (5.96% D1-all) on the VirtualTree test split, 1.00 px on SceneFlow, and 0.80, 0.73, 0.62, and 3.19 px on KITTI 2012, KITTI 2015, ETH3D, and Middlebury, with depth accuracy delta_1 from 92.6% to 98.7%. Evaluated against the noise floor, the attention stack is accuracy-neutral at a 100-epoch budget, while MSFblock and CoordAtt cost 0.03-0.05 px unless EMA is present.
Read the full abstract

All authors Yida Lin, Bing Xue, Mengjie Zhang, Sam Schofield, Richard Green

Computer Vision

What Does the Encoder Actually Decide? A Controlled Comparison of Vision Backbones on Joint Tree Segmentation and Stereo Depth

A robot pruning trees needs two facts per pixel: whether it belongs to a tree, and its distance. Both are usually obtained via task heads attached to a vision backbone chosen by reputation rather than measurement. Holding dataset, decoders, losses, schedule, and evaluation fixed, we ask: how much does the encoder choice change joint semantic segmentation and stereo depth on thin vegetation? We build a hard parameter-sharing network with one encoder feeding both branches, swapping only the encoder without downstream retuning. We evaluate [N] encoders across [M] architecture families (CNNs, transformers, hybrids, MLP-mixers, state-space models) near a ~25M budget, trained from scratch. Depth is evaluated on tree pixels only; segmentation uses boundary F1 and background IoU to prevent "label-everything-tree" shortcuts. Three findings stand out. First, the strongest encoders are convolutional and hybrid, not transformers: [BestEncoder] leads with [MIoU] segmentation mIoU and [Delta] depth $\delta_1$, while [X] of [Y] plain vision transformers collapse when trained from scratch. Second, parameter count does not predict quality — [SmallEncoder] at only [P]M parameters outranks models two orders of magnitude larger. Third, segmentation and depth rankings agree strongly (Spearman $\rho$ = [RhoValue]), showing no task conflict. Finally, [K] of [N] encoders collapse to degenerate all-tree segmentation — exposed by boundary F1 but hidden by region IoU.
Read the full abstract

All authors Yida Lin, Bing Xue, Mengjie Zhang, Sam Schofield, Richard Green

Robotics

ShieldVLA: Feasibility-Aware Safety Alignment for Vision-Language-Action Models

Vision-Language-Action (VLA) models demonstrate strong generalization in robotic manipulation and navigation, but existing fine-tuning methods provide limited safety guarantees. Current approaches primarily rely on Lagrangian optimization that enforces safety through soft penalties on expected cumulative cost, often resulting in residual constraint violations or overly conservative behavior. Moreover, learning safety in visual domains is challenging due to the absence of dense per-step safety annotations. We propose ShieldVLA, a safety-aligned fine-tuning framework for VLA models based on Hamilton-Jacobi (HJ) reachability. ShieldVLA learns a model-free approximation of the HJ reachability value function directly from visual observations to estimate the safe operating region. The learned safety critic gates policy optimization by separating reward maximization within feasible regions from recovery near unsafe states, avoiding persistent reward-cost trade-offs. To enable scalable supervision in visual environments, we introduce rubric-based VLM safety scores that convert semantic safety feedback into structured critic targets without requiring manual cost labels. Across five navigation and manipulation benchmarks spanning multiple VLA backbones, ShieldVLA reduces cumulative safety cost by 57% on average and improves task success rate by +0.13 over SafeVLA.
Read the full abstract

Biomolecules

Chemical and geometric representation fidelity improves drug–target affinity prediction

Predicting drug–target binding affinity (DTA) requires models to distinguish subtle chemical and structural determinants underlying molecular recognition. Although recent approaches increasingly incorporate richer drug and protein information, such information may be compressed, homogenized or discretized during representation construction, causing affinity-relevant distinctions to be lost before interaction modelling. We hypothesized that this representation-stage information loss constitutes an upstream bottleneck that cannot be reliably overcome by increasingly complex interaction predictors. To test this hypothesis, we developed ReGeoDTA, a representation-preserving framework that maintains affinity-relevant chemical heterogeneity in molecular representations and continuous geometric relationships in protein structures. Across three benchmark datasets, ReGeoDTA consistently improved affinity prediction, and the proposed representation-preserving strategies retained their benefits across diverse DTA architectures. Controlled representation degradation progressively reduced predictive performance, whereas increasing downstream predictor complexity failed to recover information lost during representation construction. These findings identify representation fidelity as an upstream design principle for accurate and generalizable drug–target affinity prediction, with potential implications for computational compound prioritization.
Read the full abstract

All authors Yixiao Li, Yining Qian, Yefan Chen, Zenghui Chen, Jiayue Sun, Yuhai Zhao, Cheng Tan, An-Yang Lu

Atmospheric and Oceanic Physics

Adjoint-based Inversion for the Diffusion Coefficient in Marine Lake Models

Marine lakes offer a unique opportunity to study how physical processes, such as turbulent mixing, biomixing, and tidal exchanges, regulate the vertical transport of heat, oxygen, and nutrients in relatively isolated ecosystems. The effective diffusion coefficient characterizes the overall mixing and is critical in models of marine lakes, but it is difficult to measure directly. This paper addresses the problem of inferring the depth-dependent diffusion coefficient from synthetic and real measurements of vertical temperature and salinity profiles. To do so, an inverse problem governed by a marine lake model described by the screened-Poisson equation (similar to Helmholtz) is formulated. The inverse problem is formulated as a nonlinear least-squares optimization problem, where the cost functional quantifies the misfit between the observed and recovered profiles. A Tikhonov regularization term is added to improve the conditioning of the discretized problem, with a regularization parameter chosen using the L-curve method. We solve this problem using an adjoint-based inexact Gauss-Newton method. To leverage the complementary information in these profiles, the formulation optimizes the fit across both datasets simultaneously. The accuracy of the reconstructed diffusion coefficient and the method's robustness to noise are investigated through comprehensive synthetic studies. Additionally, we contrast this framework with physics-informed neural networks, highlighting the advantages and limitations of each. When applied to real marine lake data, the adjoint method reconstructed a smaller diffusion coefficient in regions of strong density stratification, in line with physical expectations. The results indicate that the proposed approach provides a foundation for accurate modeling of marine lake dynamics.
Read the full abstract

All authors Alex Ho, François Blanchette, Noémi Petra, Michael N Dawson

General Physics

Role of viscous fluid in FLRW model with observational constraints

In this study, we investigate the role of bulk viscosity in the evolution of a spatially flat Friedmann-Lemaitre-Robertson-Walker (FLRW) universe dominated by dust. We parameterize the bulk viscosity as p_tilde = -3[l + m(H'(t) + H^2) + nH^2]H, derive the modified Einstein field equations, and reformulate them in terms of redshift z. Using 46 Hubble parameter measurements and the Pantheon+ compilation of 1701 supernovae, we estimate the model parameters (H0, l, m, n) through chi2 minimization and refine them using Markov chain Monte Carlo (MCMC) simulations. The analysis gives a transition redshift z_t = 0.585 and a present deceleration parameter q0 = -0.705, consistent with Lambda CDM. The present age of the universe is estimated as t0 = 14.5734 Gyr. We obtain H0 = 68 km/s/Mpc from the Hubble datasets and approximately 73 km/s/Mpc from Pantheon+. These results illustrate the Hubble tension between late- and early-universe determinations of H0. We further investigate the evolution of the equation-of-state parameter omega(z), energy density rho(z), and pressure p(z). Statefinder diagnostics (r,s) demonstrate deviations from and convergence toward Lambda CDM at different epochs. The results highlight the potential role of bulk viscosity in describing the accelerated expansion of the universe and provide a useful framework for studying cosmological models.
Read the full abstract

Computer Vision

Rethinking Handwritten Character Recognition

Non-Latin handwritten character recognition (HCR) remains understudied. Dominant methods consider it as generic image classification, which uses model scale to implicitly learn stroke structure. Structural-prior efficiency—the principle that explicitly encoding script-geometric regularities as architectural inductive biases can be both more accurate and require fewer parameters. We introduce GraphemeNet, a unified multi-script architecture, governed by two orthogonal binary axes. Axis 1 operationalises stroke-level geometric regularity via Persistent Scaffold Injection (PSI): a script-specific asymmetric convolution injects a stroke scaffold as a weighted residual at every encoder stage, continuously anchoring learned features to script geometry—distinct from skip connections, auxiliary losses, or attention reweighting. Axis 2 selects between global average pooling with gated fusion and cross-scale attention with a Stroke Topology Module (STM), depending on whether glyph discrimination requires spatial relational reasoning. A Linear Capsule Routing (LCR) with $O(n)$ routing is shared universally. On fourteen benchmarks across eight writing systems, the architecture generalises with only scaffold and decoder topology varying per script, consistently challenging, outperforming published baselines, and establishing structural-prior efficiency as a broadly applicable principle for multi-script HCR.
Read the full abstract

General Physics

Critical emergence of quantum theory, spacetime and gravity from generalised trace dynamics

Generalized trace dynamics (GTD) is a deterministic dynamics of aikyons (atoms of space-time-matter) whose near-equilibrium statistical mechanics yields quantum dynamics, while large anti-self-adjoint fluctuations drive spontaneous localisation and emergent classical spacetime. We separate two independent large limits: long-Connes-time coarse-graining of a finite system, which conditionally yields the quantum Ward identities, and the extensive many-aikyon/large-matrix limit required for a collective singularity. We turn the condensed-matter analogy of the E8 x omega E8 programme into a quantitative, falsifiable effective framework. Four coupled composite channels (bifermionic localisation, geometric soldering/Lorentz-Higgs, gauge-invariant electroweak, and matrix-valued flavour) define an exact susceptibility matrix and Legendre effective action, giving zero-mode and free-energy criteria for a common continuous or first-order transition. We pose the nonequilibrium problem in Schwinger-Keldysh form, define a projected fluctuation-dissipation defect and the martingale condition for Born probabilities, identify Newton's constant with the stiffness of the ordered geometric phase, and give conditions under which the Sakharov, constrained-BF, Jacobson, Padmanabhan and Verlinde descriptions of gravity are limits of one substrate. A regulated two-sector surrogate ensemble (a Myers-deformed geometric triple coupled to a matter matrix, with a Grassmann-regulated fermionic extension) shows that selected diagnostics are calculable: exact Adler-Millard charge conservation, a multi-channel first-order jump, a verified fluctuation-dissipation relation and its quench defect, and a fermionic spectral dimension d_s = 1.96 on the emergent two-sphere. The result is a calculational programme, not a completed derivation; the next step is the many-aikyon composite two-point matrix for GTD itself.
Read the full abstract

General Physics

A quantum theory of gravity

We develop a covariant Hamiltonian formalism in which evolution is measured along the proper-time flow of an observer congruence, replacing the external coordinate-time derivative with the Lie derivative. Our formalism keeps the Hamiltonian split between evolution and configuration variables and expresses it through spacetime tensors projected relative to the chosen congruence. After quantization, the resulting observer-congruent brackets lead to relativistic Heisenberg and Schrödinger equations whose evolution parameter is proper time. We then apply this framework to gravity by taking the projected spatial metric and its conjugate momentum as canonical variables, obtaining a complete model of canonical quantum gravity. Among the predictions of this theory we find a resolution to the singularity problems in cosmology, black holes and black hole thermodynamics.
Read the full abstract

General Physics

Sedenions, Clifford Algebras, and Three Fermion Generations: A Focused Review

The existence of three fermion generations remains one of the unexplained structural features of the Standard Model. This article reviews an algebraic framework in which an intrinsic $S_3$ family symmetry relates three gauge-equivalent fermion sectors. The framework is motivated by division- and Clifford-algebra constructions in which the complex octonions and $\mathbb{C}\ell(6)$ organise the colour and electromagnetic quantum numbers of one generation. Continuing the Cayley–Dickson sequence, the sedenions provide an intrinsic $S_3$ automorphism structure, while their complexified left-multiplication operators generate an associative algebra isomorphic to $\mathbb{C}\ell(8)$. In the $\mathbb{C}\ell(8)$ formulation, the order-three family action generates three linearly independent fermion sectors while leaving a single $\mathfrak{su}(3)_C\oplus\mathfrak{u}(1)_{\mathrm{em}}$ gauge algebra. Extension to $\mathbb{C}\ell(10)$ incorporates a single $\mathfrak{su}(3)_C\oplus\mathfrak{su}(2)_L\oplus\mathfrak{u}(1)_Y$ gauge algebra, with each generation including a right-handed neutrino sterile under the SM gauge interactions. We place the construction in context by comparing it with representative algebraic and family-symmetry approaches to three generations, including triality-based proposals, and clarify why the family symmetry used here is distinct from standard $\operatorname{Spin}(8)$ triality despite the common appearance of $\mathbb{C}\ell(8)$ and $S_3$. The framework remains algebraic and representation theoretic rather than a complete dynamical theory; family-symmetry breaking, realistic fermion masses and mixing, and a dynamical account of the gauge and matter sectors remain open problems.
Read the full abstract

High Energy Physics (Phenomenology)

Feasibility of a collider-based detector search for upward-going fermions produced from gravitationally-bound dark matter within the Earth

Dark matter is theorized to be gravitationally captured within the Earth and to subsequently annihilate into dark photons. The dark photons kinetically mix with the Standard Model photons which would allow the decay of the dark photon to pairs of observable fermions near Earth's surface. We examine the feasibility and sensitivity of an LHC-class general-purpose detector to observe muons originating from these dark matter models. We calculate the expected signal rates at a hypothetical general-purpose detector and examine the effect of significant backgrounds on sensitivity. We also consider experimental efficiencies of such a detector to determine expected limits for the proposed analysis. We find these expected limits constitute a significant improvement over existing ones, strongly motivating a search for upward-going muons stemming from dark matter bound within the Earth.
Read the full abstract

All authors Tamas Almos Vami, Sanjit Masanam, Matt Bellis, Josephine Swann, Philip Tanedo, Adam Green

General Relativity and Quantum Cosmology

Evolving wormhole cosmology: modified Friedmann dynamics and observational constraints

We construct an evolving wormhole cosmological model from a Morris–Thorne metric with a separable, time-dependent shape function in a spatially flat Friedmann–Lemaitre–Robertson–Walker background, deriving the corrected wormhole energy-momentum tensor and a volume-averaging procedure that yields a modified Friedmann equation with a redshift-dependent wormhole correction term. We show that the shape-function index and throat-evolution exponent combine into a single macroscopic exponent $\beta$, and we demonstrate that the resulting wormhole equation of state is consistent with this geometric averaging. All traversability conditions are verified. Confronting the model with cosmic chronometer, DESI Data Release~2 BAO, and standard BAO data across seven dataset combinations, our findings show that all combinations are mutually consistent, with the joint fit giving a present-day expansion rate intermediate between local and CMB-inferred values, a deceleration-to-acceleration transition consistent with independent determinations, and an effective dark-energy equation of state close to, but distinguishable from, a pure cosmological constant. The evolving throat radius offers a novel, geometry-specific observable for discriminating wormhole spacetimes from phenomenological dark-energy parametrisations.
Read the full abstract

Information Theory

Recursive overlap Bernoulli distributions and an entropy concavity conjecture

We introduce a family of recursively generated finite probability distributions obtained from left and right embeddings with overlaps. The construction interpolates between the classical binomial distribution and the non-overlapping Bernoulli product distribution. We derive explicit formulas for the expectation, variance, and the generating function of higher moments, and formulate a conjecture asserting that the Shannon entropy is concave. The conjecture is proved in the two extremal cases and supported by symbolic computations for numerous overlap sequences.
Read the full abstract

General Mathematics

Exact Minima of Finite Absolute Cosine Sums

For a positive integer \(n\), let \(M_n=\min_{x\in\mathbb R}\sum_{k=1}^n |\cos(kx)|\). We determine \(M_n\) exactly. Apart from the exceptional values \(M_2=1/\sqrt2\), \(M_4=1+\sqrt3/2\), and \(M_6=(-1+3\sqrt5+2\sqrt{5+2\sqrt5})/4\), one has \(M_n=\lfloor n/2\rfloor\). The minimizers are also classified: for \(n\notin\{2,4,6\}\), equality is attained only at \(x\equiv \pi/2\pmod{\pi}\), while the exceptional cases are attained at \(x\equiv\pm\pi/4\), \(\pm\pi/6\), and \(\pm\pi/10\pmod{\pi}\), respectively. The proof is elementary and uses piecewise concavity, a permutation modulo \(2q\), and two finite trigonometric estimates.
Read the full abstract

2609.05545 · 2 Sep · 9 pages. Revised the introduction and expanded the references to clarify prior results and the attribution of the proof reductions. Added explicit estimates for the small-parameter cases and further details of the minimizer classification. The main theorem and all stated minimum values remain unchanged

Fluid Dynamics

A Gauge Theory of Turbulence:

We formalize the gauge structure of the Navier–Stokes equation for incompressible fluids, interpreting $\nabla\cdot\mathbf{v}=0$ as a gauge fixing analogous to the Coulomb gauge in electromagnetism. We construct the Martin–Siggia–Rose action and its full BRST symmetry, introducing BRST doublets for the Gribov parameter $\gamma$ and the monodromy phase $\theta$. Through a Higgs mechanism, $\gamma$ acquires a vacuum expectation value $\gamma_{0}$, generating a mass scale for the vorticity and the ghosts; we compute the one-loop effective potential and analyze vacuum stability. Intermittency — measured by the exponents $\zeta_{n}$ — is described by fluctuations of the Higgs field $\sigma$ around the condensate, via a Gribov-inspired log-Poisson hierarchy that satisfies exactly $\zeta_{3}=1$ (Kolmogorov's four-fifths law). Fits to DNS data favor filamentary vorticity structures, with $D_{f}\approx1$ (one parameter) or $D_{f}\approx2.1$, $\Delta\approx0.44$ (two parameters). The one-loop anomalous dimension in $d=3$, $\Delta_{\sigma}\approx0.50$, supports the identification $D_{f}=2\Delta_{\sigma}$. The formalism unifies classical hydrodynamics with gauge theory and spontaneous symmetry breaking, opening the study of turbulence and intermittency to quantum field theory methods.
Read the full abstract

Computer Vision

Do Depressive Facial Patterns Transfer Across Cultures and Contexts? Evidence from a German RCT and E-DAIC

Automated assessment of depression from facial dynamics holds promise for scalable mental health monitoring, yet cross-corpus generalization of learned biomarkers remains an open challenge. We present a systematic bidirectional transfer study pairing the EmpkinS-EKSpression randomized controlled trial (RCT; N = 256, SCID-5-CV diagnoses) with the Extended Distress Analysis Interview Corpus (E-DAIC; N = 275, semi-structured clinical interviews), predicting depression severity and binary diagnostic status from facial action units, head pose, and gaze. Cross-corpus binary classification proves more robust than continuous PHQ-8 severity regression, with forward transfer achieving AUC = 0.70. Regression transfer is governed by functional context alignment: passive observation phases yield the most transferable models, while active emotion regulation phases elicit stronger within-corpus signals. These findings establish functional context alignment as the primary determinant of cross-corpus generalization, with passive elicitation contexts offering the best trade-off between within-corpus sensitivity and cross-corpus robustness.
Read the full abstract

All authors Misha Sadeghi, Robert Richer, Lydia Helene Rupp, Lena Schindler-Gmelch, Marie Keinert, Farnaz Rahimi, Malin Hager, Bernhard Egger, Matthias Berking, Bjoern M. Eskofier

Soft Condensed Matter

Physics-Informed Neural Networks for Depth-Averaged Granular Avalanche Dynamics on Curved Topography

Physics-informed neural networks (PINNs) provide a mesh-free framework for solving governing equations, but their application to granular avalanche dynamics over curved terrain remains largely unexplored. This study extends a depth-averaged PINN formulation based on the Savage-Hutter equations to an exponentially curved chute with spatially varying inclination and a strain-rate-dependent Mohr-Coulomb earth-pressure closure. The model is validated against measured front- and rear-edge trajectories from a laboratory granular-avalanche experiment, with selected observations withheld from training. A staged temporal curriculum proved essential for accurate prediction, reducing the held-out trajectory error by approximately two orders of magnitude compared with training over the full time domain from the outset. Sparse-data experiments further showed that observation placement was more influential than observation number within the configurations tested. Four observations bracketing the transition from acceleration to deceleration achieved nearly the same accuracy as the eight-observation reference configuration, whereas observations clustered at early or late times performed poorly. The results demonstrate the importance of both training strategy and informative data placement when applying PINNs to granular flows over curved topography.
Read the full abstract

All authors Pujan Pranavkumar Purohit, Pradyumn Singh Sikarwar, Vishal Sharma, Gaurav Bhutani

Computer Vision

Video Compression with Graph-inspired Neural Representation

Implicit Neural Representations (INR) provide a compact and content-adaptive paradigm for video compression, typically representing a video through shared network parameters and frame-indexed embeddings. Compared to conventional or autoencoder-based codecs, these approaches exploit temporal redundancy within videos in an implicit manner, which potentially results in sub-optimal compression performance. In this paper, we propose G-NeRV, a graph-inspired INR that explicitly improves temporal redundancy exploitation in the implicit latent space. Motivated by the total correlation principles in information theory, we construct a temporal neighborhood over frame embeddings and perform message passing to aggregate reusable information from neighboring frames through an adaptive gate controlling the injection of neighboring information. Inspired by the reference frame buffer in conventional video coding, a memory bank mechanism has been further designed to enable efficient temporal-neighbor retrieval under random frame-index sampling in INR training. This new representation model has been integrated into an advanced representation compression framework and compared with existing conventional and neural video codecs. The results show that the G-NeRV codec outperforms the state-of-the-art INR-based codec, NVRC, and the latest standard video codec, VVC VTM, by 8.86% and 14.68% (in BD-rate), respectively, measured by PSNR on the UVG dataset.
Read the full abstract

All authors Changqi Wang, Ge Gao, Fan Zhang, Yue Li, Kai Zhang, Li Zhang, David Bull