Graphics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 10 September
In scientific simulation, regular grids, unstructured meshes, and particle-based formats are chosen to represent field data for computational efficiency, geometry/adaptive flexibility, and following motion/deformation, respectively. Each of these field data formats is often handled through separate data-specific processing pipelines. We present a unified sample-based Gaussian encoding method that represents these data forms under a single fixed-budget formulation. The method initializes and refines Gaussian primitives directly from the input samples while preserving a prescribed primitive count and encoded size to achieve a desired level of data reduction. Across structured, unstructured, and particle data, the sample-based formulation improves reconstruction accuracy with measurably fewer primitives in comparison to prior formulations, achieving up to 4.8 dB higher PSNR with an approximate 44x reduction in primitive count. For time-varying data, warm-starting from the previous timestep reduces the optimization required to reach independently trained reconstruction quality. Together, these results demonstrate a unified fixed-budget Gaussian encoding framework for structured, particle, unstructured, and time-varying scientific data with predictable storage, higher reconstruction accuracy, and improved temporal encoding efficiency.
Computation and Language
Are We Grading Properly? Understanding Failure Modes in Medical Benchmarks
Medical evaluation is shifting from static option-based questioning to realistic clinical scenarios with open-ended output modes. Grading these at scale naively, however, is expensive, and rubric-based evaluation has become the dominant scalable alternative. We ask what happens when the rubrics themselves are not airtight, and whether such flaws can be detected and corrected. We apply RIFT, a global rubric failure taxonomy, to two clinical benchmarks (HealthBench Professional and LiveMedBench), and find failure modes are meaningful: on HealthBench Professional an LLM judge flags 29.6% of criteria as non-atomic and 65.4% as misaligned/rigid. Then, we show that these flaws are meaningful and not simply cosmetic. As an example, rewriting bundled criteria of the form "at least one of / all of the following" as equally weighted children and regrading identical responses shifts scores by up to 15.9 percentage points on affected conversations, with disjunctive bundles inflating scores and conjunctive bundles deflating them. We also find that RIFT generally under-detects bundling on clinical rubrics, flagging 3.3% of LiveMedBench criteria as non-atomic where surface-form analysis finds structure in 25.8%.
Read the full abstract
Exactly Solvable and Integrable Systems
Existence Conditions for Darboux Curves and Analytic First Integrals of a Liénard-Type Quadratic Vector Field
We study the rational quadratic differential equation \[ \frac{\mathrm{d}y}{\mathrm{d}x} = \frac{ay^2+by+cx}{y^2}, \qquad a,b,c\in\C, \] under the non-degeneracy assumptions \[ c\neq 0,\qquad 2ay+b\not\equiv 0. \] Equivalently, after clearing the denominator, we consider the polynomial vector field \[ \dot{x}=y^2,\qquad \dot{y}=ay^2+by+cx. \] We give a complete, directly checkable classification of its Darboux curves. If $a=0$, no non-constant Darboux polynomial exists. If $a\neq 0$, a non-constant Darboux polynomial exists if and only if \[ c=-ab\qquad\text{or}\qquad c=-2ab. \] In these two cases the unique irreducible Darboux polynomials, up to non-zero constant multiples, are respectively \[ y-ax,\qquad y^2-2bx. \] Consequently every non-constant Darboux polynomial is a non-zero constant multiple of a positive integral power of the corresponding irreducible factor. We then place this classification in the framework of Riccati (R-)integrability and rational potentials. Excluding the exceptional branch $c=-2ab$, the analytic integrability theorem identifies $c=-ab$ as the branch admitting a global Riccati-type analytic first integral. For $c=-2ab$, we compute the first four transverse variational groups along the transformed Darboux divisor over the rational function field. Their dimensions are $1,2,3,4$; the fourth is the full group of invertible fourth-order transverse jets. We prove that this exceptional branch admits no Riccati first integral and hence is not R-integrable. Finally, we relate the branch $c=-ab$ to the Quartic Inverse Riccati (QIR) class and discuss an invariant-based classification problem for quartic Abel equations.
Read the full abstract
Information Retrieval
Decoupling Error Attribution in Cloud-Native Graph-RAG: A Data Integrity Diagnostic Framework
Graph-RAG systems often assume pristine data quality, overlooking the severe impact of perturbations in cloud-native databases. This paper proposes a three-layer decoupled diagnostic framework to orthogonally attribute system errors to reasoning loss, Knowledge Graph (KG) defects, and Cypher generation errors. Evaluated on a spatio-temporal ecological KG of the Southeastern Tibet region with eight defect types, results reveal that data integrity, rather than algorithmic reasoning, is the dominant performance bottleneck, with structural defects degrading system accuracy from 0.93 to 0.39. Crucially, we observe a masking-like phenomenon termed the Parametric Knowledge Masking Effect (PKME), suggesting LLMs compensate for broken retrieval paths using internal memory. This shrinks apparent query generation errors by over 70 percent, obscuring actual storage deterioration and increasing the risk of false negatives for automated monitoring. This work provides a quantitative foundation for auditing and optimizing data integrity in cloud-based information fusion systems.
Read the full abstract
Instrumentation and Methods for Astrophysics
An X-ray Data Primer: What I Wish I Knew When Starting X-ray Astronomy
This guide is intended for astronomers new to X-ray astronomy. It provides a brief overview of the data products typically encountered by the user and highlights analysis considerations usually not discussed in more formal introductions to the discipline. In X-ray and $\gamma$-ray astronomy the primary data set is an event list (a table of individually detected photons with position, arrival time, and an instrumental energy estimate) rather than the image or visibility array familiar from other wavelength bands. We describe the files a user typically encounters, including: event lists, the aspect solution, spectra, instrumental responses, exposure maps, lightcurves, source lists, and calibration databases. These data are generally photon-limited and follow Poisson rather than Gaussian statistics. Combined with the coarse energy resolution of X-ray instruments, this means physical models must be fitted by "forward-folding"; we outline this technique and the systematic uncertainties introduced by calibration. Additional topics include: point spread function morphology, cosmic and instrumental backgrounds, pileup, contamination, binning conventions, the Chandra X-Ray Observatory focal plane, and sub-pixel event repositioning. This primer is intended to be generalized, not specific to any telescope or science subject area, although examples draw on Chandra. It was inspired by interactions with the astronomical community over several conferences and through the Chandra X-ray Center (CXC) HelpDesk.
Read the full abstract
Other Quantitative Biology
SenSASP: A Unified, Multi-Layer Database of Senescence and SASP Genes
Research on cellular senescence and the senescence-associated secretory phenotype (SASP) draws on independently curated gene resources that differ in scope, identifiers, and update cycles, making cross-resource integration error-prone. We unified four widely used resources, CellAge, GenAge, the SenMayo signature, and the Reactome Cellular Senescence pathway, onto a single canonical identifier (the Ensembl gene ID) and enriched every gene with three annotation layers absent from all four inputs: cross-species conservation, tissue and cell-type expression, and high-confidence protein-protein interactions. Unification collapsed 1,460 summed source entries into 1,250 unique genes (210 redundant entries removed, 14.4%) while preserving full source provenance: 173 genes are corroborated by two or more resources and two (IL6, JUN) by all four. The three annotation layers reach 95.8%, 97.9%, and 93.0% of genes, with 89.4% annotated across all three. A 500-gene random sample of identifier mappings was validated against HGNC and Ensembl (98.0% exact match). The result, SenSASP, is a single, machine-readable, provenance-tracked database of harmonized identifiers and net-new functional context, illustrated here with a gene-prioritization score and a tissue-expression atlas. SenSASP is freely available at https://xuan13hao.github.io/sensasp/
Read the full abstract
Software Engineering
SkillSeam: Six Principles for Auditing Agent Skill Collections
A folder of competent skills is not yet a reliable system. Skills rarely fail alone; they fail at the seams of a collection. As an agent's skill library grows, procedures compete for attention, aliases double-load, boundaries blur, and poorly sized skills turn routing errors into task failures. We introduce SkillSeam, a method that audits the relationships through which individual skill files become a system. It maps each collection-level principle to a failure mechanism, its strongest observable, and a controlled perturbation test. From one sealed skill system, SkillSeam perturbs six design principles: persistence gradient, system coherence, regime gating, orthogonal coverage, flow, and granularity discipline. Crucially, each principle is evaluated through the channel its failure mechanism predicts rather than through accuracy alone. Flattening the persistence hierarchy increases loaded-skill tokens by 60%; a dangling anchor raises total tokens by 64% and shifts accuracy by -3.1pp; with skill count and context size held fixed, replacing an unrelated control with a synonymous alias raises noncanonical routes from 0/32 to 15/32 and flips half of matched paraphrase pairs; in a candidate-ownership audit, overlapping lanes raise reported ownership conflicts from 0/16 to 14/16; bland triggers drive routing conflicts from 3/32 to 30/32 and inflate loaded-skill tokens 3.7x; and one granularity mis-mix produces the largest accuracy drop, -12.5pp. These outcomes turn six pieces of authoring advice into testable system properties without treating every probe as confirmation. We release the byte-differenced variants, task slices, rollups, and a one-screen design checklist so that other skill systems can measure the same failure channels.
Read the full abstract
Probability
Malliavin Smoothness of Hermite Processes of Arbitrary Order and Their Wiener Integrals
We establish Malliavin nondegeneracy for every weighted integral against a singular Hermite kernel, with all negative moments of the Malliavin derivative norm finite, uniformly over admissible compact families of bounded deterministic weights. In particular, all finite-dimensional distributions of Hermite processes of every fixed finite order have Schwartz densities, as do vectors of non-overlapping increments and, more generally, finite families of Wiener integrals with respect to a Hermite process. For such vectors, linear independence of the weights is both necessary and sufficient for absolute continuity; under this condition, all inverse Malliavin determinant moments exist and the joint density belongs to the Schwartz space, with bounds that are again uniform over compact families. The proof rests on a nonvanishing condition on compact weight families that is preserved under directional differentiation. An analytic-tail property of fractional transforms of the directions verifies this condition at every chaos level. Uniform Malliavin estimates then convert lower-order gradient bounds into bounded joint densities of arbitrarily many first directional derivatives, and Bessel's inequality closes the induction. The argument works directly with fixed non-Gaussian laws and singular kernels, without a Gaussian-limit assumption and without a separate local-nondeterminism transfer.
Read the full abstract
Statistics Applications
Bayesian Semiparametric Hidden Markov Random Partition Fields for Factor Collapse on Graphs: A Study of Cortical Mapping of Fingertips
Understanding how the brain's cortical regions respond to stimuli like fingertip tapping is a significant challenge in neuroscience, especially with high-resolution functional magnetic resonance imaging data. To address this, we propose a new statistical method for evaluating how a factor's influence locally varies across a complex graph, such as the brain's cortex. Our approach is designed to handle the complexities of large graph sizes and computational demands. Our method uses a novel Bayesian hidden Markov random field to partition the factor's influence into collapsed states with similar effects on the outcome at each node. This unique model promotes sparsity in the partitions and penalizes large variations across adjacent nodes. The result is a highly detailed local influence map that captures subtle changes in the patterns and magnitudes of a factor's influence across the graph. To ensure efficient analysis of large datasets, we developed a specialized Markov chain Monte Carlo algorithm. Our simulation experiments demonstrate significant improvements over existing techniques in both accuracy and scalability. Ultimately, our method provides a powerful new framework for exploring the intricate relationship between stimuli and brain activity, offering a clearer picture of the cortical mapping of fingertips.
Read the full abstract
Robotics
Attention-DP3: Spatially Object-aware 3D Diffusion Policy via Geometry-aligned Attentional Conditioning
3D point-cloud observations are inherently ambiguous in complex, cluttered manipulation scenes, where target objects may be partially occluded or tightly intermingled with visually similar distractors. As a result, standard 3D diffusion policies often struggle to localize and exploit task-relevant geometry as scene complexity grows. We propose Attention-DP3, a spatially object-aware 3D diffusion policy that injects object-level geometric cues via attention while keeping the DP3 diffusion backbone unchanged. Our pipeline performs open-vocabulary 2D segmentation on RGB images, then lifts predicted target masks into 3D using calibrated camera geometry to obtain object-centric geometric priors. We incorporate these cues through Tri-field Attentional Conditioning, which constructs three complementary fields: (i) a targetness field to anchor the target object, (ii) an intra-target saliency field to emphasize task-relevant geometry within the target, and (iii) a backgroundness field to suppress distractors and clutter. Experiments on Adroit, DexArt, MetaWorld, and the real-world SO101 platform show consistent improvements over DP3, achieving state-of-the-art performance across benchmarks. Notably, as distractor objects increase, DP3 drops sharply, whereas Attention-DP3 remains stable and outperforms DP3 by up to 31% under heavy clutter. The code is publicly available at https://github.com/zhangzhongbo2213/Attention-DP3.
Read the full abstract
Logic in Computer Science
A Catalogue of Properties of Binary Relations: Entailments, Incompatibilities, and Independence Results
We study fifteen properties of binary relations that have established uses in modal logic, order and preference theory, and relation algebra. The organising question is pragmatic: once some properties of a relation are known, which further properties follow, which combinations force degeneracy, and which properties remain independent? We give a proved Horn basis of elementary and compound entailments, explicit countermodels for non-entailments, and a relation-algebraic translation of all fifteen properties. The modal discussion includes the usual Scott–Lemmon correspondences and the logic of transitive dense frames studied by Ghilardi and Mints. Exhaustive finite enumeration and targeted model search are used for discovery, while the catalogue is certified in Lean. A kernel-checked coverage calculation ranges over all 2^15 = 32,768 antecedent sets and all fifteen possible consequents. Its 51-rule Horn manifest is coupled definitionally to Lean proofs of semantic soundness, and its 49 witness rows are coupled definitionally to Lean-certified finite or infinite relations. Consequently, over non-empty domains, the Horn closure is complete for positive entailment among the fifteen selected properties, and the consistency classification is complete for their positive combinations.
Read the full abstract
Statistics Theory
A new six parameters generalized Weibull-Kumaraswamy-{Lomax) Distribution with a Novel Linear Series Expansion of Its Probability Density
One method of generalizing a distribution is to add new parameter to the baseline distribution. In this paper the author discusses this methodology to create a new six parameters generalized Weibull-Kumaraswamy-{Lomax) Distribution. The author utilizes the approach of the T-X{Y} family to add new parameters the baseline distribution Kumaraswamy distribution defined on the unit interval with two shape parameters a & b>0. The author used the Lomax distribution with two parameters {\alpha} & {\lambda}>0 , scale and shape parameters respectively, to link the baseline distribution with the generator distribution. The generator distribution is the Weibull distribution with the two parameters, c & {\gamma}>0 , shape and scale parameters respectively as will be explained in the paper. The result is a new distribution with six parameters. The author derived the PDF, CDF, and quantile functions. The author used a new technique to expand the pdf in a linear series expansion that is simple and does not require special function. This makes the computational statistics for the raw moments easier and simpler. The author discusses the Shannon entropy and the paper contains figures for the PDF, CDF and the quantile functions.
Read the full abstract
Emerging Technologies
Beyond density snapshots: Dynamical memory in Chern-Simons reservoirs
How a reservoir encodes input history jointly in density and geometric degrees of freedom remains insufficiently understood. We address this mechanistic gap with a continuous density on an internal manifold coupled to an independently evolving Chern-Simons (CS) connection through a conserved current. On the same internal manifold, we compare reciprocal transport, instantaneous transverse reconstruction, local nonlinear feedback, and coupled CS evolution. These controls isolate how transport and independent connection evolution contribute to memory. We identify a current-generated exact connection component that the tested instantaneous reconstruction and scalar local closure miss. Resetting this component at fixed density and Gauss-law curl changes the future density response within the chosen gauge and drift law and the small effect persists under numerical refinement. We then distinguish dynamical memory from its readout accessibility. Although the four models have similar scalar-memory scores and density traces of pulse order, their circulating and longitudinal traces differ. With all measured features, coupled CS improves pulse-order decoding by \(6.5\pm1.9\) percentage points over the instantaneous-transverse control in paired seedwise comparisons, while remaining comparable to local feedback. Coupled CS shows less lag than the instantaneous and local-feedback controls on the first cycle, but more on subsequent cycles, revealing a dependence on preparation. We thus connect a field-theoretic mechanism of history retention to controlled tests of its dynamical role and computational use. The four-model framework provides a way to determine what an evolving transport field contributes when density snapshots and aggregate performance alone leave the memory mechanism unresolved.
Read the full abstract
Exactly Solvable and Integrable Systems
Riemann spaces associated with the Navier-Stokes equations: a survey of the geometric approach
We survey a geometric approach to the Navier-Stokes equations developed by the author over the past fifteen years. The central object is a Riemannian space of fourteen dimensions whose metric is Ricci-flat precisely on the solutions of the Navier-Stokes system, so that the behaviour of a viscous incompressible fluid becomes a property of curvature. The space decomposes into a flat six-dimensional part and two dual quadruples of coordinates, Eulerian and Lagrangian, which exhibits the two classical descriptions of a fluid as two halves of a single geometry. We also recall the associated six-dimensional metric, whose integrability condition is the incompressibility of the fluid; the link with the projective geometry of second-order ordinary differential equations in the sense of E. Cartan; and the use of Cartan's invariants to construct a three-dimensional analogue of the Taylor-Green vortex. An application of the same construction to the equations of rotation of a rigid body is indicated.
Read the full abstract
Classical Analysis and ODEs
A Lower Bound on the Blob
A blob grows on the plane (as in films called "The Blob" of 1958 and 1988). Suppose that it grows in all directions at unit rate, and can be stopped only by a certain kind of fence that can be manufactured at rate $\lambda$. What is the critical value $\lambda_C$ for this rate, above which the blob can be surrounded and contained, and below which we are all doomed? This problem, introduced by Bressan in 2007 and independently by Barghi and Winkler in 2013, was in both cases motivated by consideration of strategies in fighting forest fires. In particular, does it pay to place "gambit" barriers which will subsequently be overwhelmed by the fire, in order to slow it down enabling later containment? A non-gambit strategy, which will be described, succeeds when $\lambda > 2$ and is widely believed to be optimal; but up until now no one has succeeded in obtaining a lower bound greater than 1 for $\lambda_C$. We introduce a novel weakened version of the blob which is used to raise the lower bound to 1.5.
Read the full abstract
Quantum Physics
Wigner entropy below vacuum: physical counterexamples and stability limits
Positive Wigner functions can have less Shannon entropy than the vacuum, even arbitrarily close to the vacuum state. We construct physical counterexamples and identify the competition that controls their entropy: the relative entropy to the vacuum phase-space density can exceed twice the mean photon number. A two-level family exhibits a finite window in which coherence lowers entropy while preserving global Wigner positivity. A complementary construction repairs a remote negative tail with an exponentially small thermal admixture; an explicit mixing weight of $2\times10^{-21}$ preserves a rigorously established entropy decrease. Optimisation over all one-mode Wigner-nonnegative states gives the sharp low-energy scale $E^\gamma/[\ln(1/E)]^\beta$, with $\gamma\simeq0.7412$ and $\beta\simeq0.5861$. Because $\gamma<1$, tensor products can have vanishing total energy and trace distance from vacuum while their entropy deficit diverges. We derive the exact half-transmission threshold for universal Shannon-entropy recovery and connect it to companion results showing residual non-Gaussian structure. The counterexamples reveal distinct controls on entropy: coherence sets the local descent, mode number amplifies it, and loss restores the vacuum bound.
Read the full abstract
Hardware Architecture
SIMT-Aware Lockstep Verification and Functional-Coverage Closure Methodology for an Open-Source RISC-V GPGPU: A UVM 1.2 Environment
Open-source RISC-V GPGPUs such as Vortex ship with directed-kernel regressions but no reference-model checking, functional-coverage model, or sign-off discipline. This paper presents a UVM 1.2 environment and methodology that closes that gap. The environment wraps a bus-master SIMT DUT with role-inverted agents, integrates Vortex's functional simulator (SimX) as a per-configuration golden model over DPI-C, and renders verdicts via two injection-qualified checkers: a bidirectional end-state scoreboard and a per-instruction, per-lane lockstep comparator under five SIMT alignment rules. A two-pass load-value feed makes racy fenceless multi-core programs instruction-granularity verifiable (residual zero over 5,432 retirements), with the interrupt-timing boundary stated. A three-layer coverage model adds, to our knowledge, the first published SIMT functional-coverage layer for RTL GPU verification (divergence depth, bank conflicts, coalescing classes), closing its own layers at 98.1% covergroup-bin / 94.7% total (ISA layer separately: 83.1% bins / 89.3% weighted) under machine-generated, RTL-cited exclusions and a blocking waiver-integrity gate; an unstimulated D-extension elaboration affects no functional bin, only lowering totals. The checking depth surfaced real defects on both sides of the comparison: a JALR LSB ISA deviation, a non-scaling watchdog constant (since fixed upstream), a reset-relay X window found by restoring a silenced assertion, a missing AXI error path proven by fault injection, and a reference-model fetch bug found by the lockstep itself. FuzzGPU (USENIX Security 2026), a concurrent RTL GPU fuzzer on the same DUT, is complementary: fuzzing finds bugs, this methodology quantifies sign-off; both independently found the JALR deviation. All findings ship in an evidence-cited register; every number carries provenance and the method's boundaries are stated rather than waived.
Read the full abstract
Populations and Evolution
Polymerase-mediated quasispecies dynamics: bifurcations, complementation, and robustness of {\tau}-tipping
Quasispecies theory describes how mutation and selection shape highly variable RNA virus populations, but most models explicitly consider neither RNA-dependent RNA polymerases nor the delays associated with their synthesis and functional activation. A recent minimal model showed that delayed polymerase availability can induce extinction by reorganizing basins of attraction, a mechanism termed {\tau}-tipping. Here, we extend this framework to a delay differential equation model in which master and mutant genomes encode distinct functional polymerases. We characterize its equilibrium and bifurcation structure, identifying master-mutant coexistence, mutant-only persistence (error catastrophe), and complete extinction governed by transcritical and saddle-node bifurcations. Although delays leave the equilibria unchanged, they reorganize their basins of attraction and can redirect populations that would otherwise persist at fixed mutation and replication parameters toward extinction, thereby extending {\tau}-tipping to systems with autonomous mutant replication. We also recover the previously studied complementation model as a limiting case in which defective genomes depend on master-derived polymerase, providing a comprehensive analysis of the bifurcation structure. Comparing the two models shows that the ability of mutant genomes to encode functional polymerases determines whether loss of the master sequence results in mutant replacement or complete population extinction. The occurrence of delay-induced extinction in both settings demonstrates the robustness of {\tau}-tipping and connects intracellular replication kinetics, complementation, and quasispecies extinction. Finally, we translate this mechanism into concrete virological predictions and propose experimental strategies to test the effects of replicase timing, RNA degradation, and functional complementation on viral persistence.
Read the full abstract
Computer Vision
Task-Based CT Protocol Optimization Using Reinforcement Learning and Virtual Imaging Trials
Protocol optimization in computed tomography (CT) aims to improve diagnostic image quality while reducing radiation dose, but the interdependence of acquisition and reconstruction parameters makes exhaustive testing impractical. We propose a virtual imaging trial framework with reinforcement learning for efficient CT protocol optimization. Sixty-three computational human models with liver lesions were imaged using a validated CT simulator across 468 combinations of acquisition and reconstruction parameters, including tube voltage, tube current, reconstruction kernel, slice thickness, and pixel size. The optimization objective balanced liver lesion detectability, quantified by detectability index d-prime, against radiation dose. A Proximal Policy Optimization agent was trained and conditioned on patient-specific CT localizer embeddings derived from a pretrained vision transformer. On held-out patients, evaluating only 8 protocols per patient, about 2% of exhaustive testing, recovered 98.2% of the exhaustive-search oracle objective. With no patient-specific simulation, surrogate scoring alone achieved 89.7% recovery. Conditioning on the localizer improved zero-simulation recovery by 10.7 percentage points over the localizer-blind policy (paired 95% CI 2.9-19.5; p=0.02). These results show that the proposed framework can substantially reduce exhaustive protocol testing while enabling task-based, dose-aware protocol selection before the diagnostic scan.
Read the full abstract
Computer Vision
GroundBench: A Factorized, Counterfactual Benchmark for Locating VLM Affordance Failures
A companion evaluation found that naming the target part in a manipulation prompt increased action accuracy by 0.32-0.63 across eight vision-language models, with no model outperforming a constant baseline until the part was named. However, naming the part supplies information that a real system must infer, confounding visual grounding, mechanical reasoning, and category-to-action association. We introduce GroundBench, a diagnostic benchmark that separates these explanations through six branch-and-merge conditions, each adding a controlled information bundle, and a counterfactual re-ask targeting a real alternate part visible in the same image. Across three OpenAI models and 1,068 predictions, supplying the target region without its identity leaves action accuracy at or below the 0.53 majority baseline (0.26, 0.26, and 0.53), although the models largely reproduce the supplied region. Supplying identity without location instead yields 0.74, 0.68, and 0.68. Every above-baseline gain in this curated set occurs where the supplied part category itself determines the action. A no-vision control leaves GPT-5's scores unchanged or improved, providing evidence consistent with substantial category-to-action association. GPT-4o mini declines on one condition, so this interpretation is not universal. Adding joint type and motion axis does not improve accuracy across six model-stratum comparisons. On 74 counterfactual pairs from 32 objects, GPT-5 achieves 0.86 pair-weighted compliance with a 0.07 shortcut rate but fails all observed push-to-lift-vertical cases. GroundBench identifies which supplied information changes affordance behavior and tests whether apparently grounded performance can be reproduced through textual shortcuts.
Read the full abstract
Robotics
IMM-based Multiple Object Tracking using a State Prediction Neural Network
Object tracking is essential for autonomous vehicles to avoid obstacles and plan routes. Radar maintains detection performance even in adverse weather and can measure relative velocity through the Doppler effect, making it well suited for object tracking. In this paper, we propose a data-driven state PRedictor-based Interacting Multiple Model tracking method (PR-IMM) that improves nonlinear object-motion representation while preserving the stability and interpretability of physics-based motion models. The proposed method employs a transformer-based PRediction model (PR) that incorporates radar Doppler measurements to predict object displacement. The PR model is integrated into the IMM as a mode alongside the CV, CA, and CT motion models, and their prior positions are dynamically combined according to the mode probabilities. Experimental results show that PR-IMM reduces position-estimation error by 57.3% over the IMM and by 16.5% over the PR, while reducing ID switches by 25.3% and improving IDF1 by 9.6% over the IMM.
Read the full abstract
Computer Vision
HGSQ: Heatmap-Guided Sparse Query Detector for Real-Time Aerial Small Object Detection
Real-time aerial small object detection is an important visual signal and image processing problem, requiring a detector to preserve fine-grained localization while avoiding redundant computation on large background regions. This paper focuses on this deployment-oriented aerial/UAV setting rather than claiming a universal detector for all object detection scenarios. Existing Transformer-based detectors provide strong global modeling, but their dense query initialization and multi-layer decoder still spend substantial computation on background tokens, which is inefficient when small objects occupy only sparse image regions. To address this problem, this paper proposes HGSQ, a Heatmap-Guided Sparse Query Detector for real-time aerial small object detection. HGSQ uses a lightweight Heatmap Budget Predictor (HBP) to predict a foreground budget map in a single forward pass. The predicted heatmap is then used by three fixed components: Heatmap-Guided Sparse Query Selection (HSQS), which initializes decoder queries from high-confidence foreground positions; Heatmap-Gated Lite Snake Convolution (HGLSConv), which performs local shape refinement only on heatmap-activated small-object regions; and Adaptive Query-Decoder Budgeting (AQDB), which adjusts the query budget and decoder depth according to the estimated object density. Unlike post-hoc heatmap generation, HGSQ treats the heatmap as a real-time computation budget rather than a visualization map during deployment. Experiments on NWPU VHR-10 and VisDrone2019 show that HGSQ achieves 95.10 mAP50 on NWPU VHR-10 and 54.8 mAP50 on VisDrone2019, while reducing GFLOPs to 48.6 and running at 96.0 FPS on an RTX 4070 under our TensorRT FP16 deployment protocol.
Read the full abstract
Combinatorics
Rationality and Quasipolynomiality of Restricted Rectangle Partitions
This paper proves Conjecture 5.10 of Gajdzica, Visser, and Zakarczemny on restricted partitions of a rectangle. For every fixed positive integer k, the generating function for feasible multisets of bars of lengths at most k tiling a 2 x n rectangle has denominator dividing the product of (1 - x^j) for j = 1,...,k. Its coefficients are eventually quasipolynomial of degree k - 1 and period dividing the least common multiple of 1,...,k. The key observation is that appending a two-bar slab makes feasibility upward closed within each parity class of multiplicities. Dickson's lemma and finite inclusion-exclusion then give the precise denominator.
Read the full abstract
Multiagent Systems
Conceptualization and experimentation of asset market with price manipulation
The primary goal of this work is to reproduce the behavior of a human trader, detailing his or her psychological processes to understand the effects of his or her decisions on the final value of an asset. The second goal is to use a formal language to detail this behavior as a tool for improving and simplifying the communication between all actors involved in the project, such as specialists from disciplines as diverse as computing, economics and psychology. As a starting point, we use a paper that shows an experiment that analyzes the influence on other trader's behavior when an agent handler and a trading robot attempt to distort the market. This work reproduces this experiment, using virtual traders that belong to a multi-agent simulation model, showing the feasibility to reproduce complex human behaviors and showing the convenience of use formal and graphical languages to simplify the understanding and the validation of the complex behaviors involved in an economic process.
Read the full abstract
Computer Vision
Adaptive Conformal Redistribution for Inter-class Transitional Uncertainty in Medical Image Classification
Medical image classification is frequently complicated by transitional categories whose feature distributions overlap those of adjacent classes, producing ambiguous decision boundaries. Conformal prediction returns uncertainty-aware prediction sets, but these are not directly actionable in clinical screening, where a single decision is required. This work proposes adaptive conformal redistribution (AdaConRed), a label-free post-conformal decision rule that converts ambiguous prediction sets into refined class assignments. A five-stage pipeline is developed. Vision-language generative augmentation addresses minority-class scarcity; a frozen DermFoundation encoder provides embeddings; a lightweight multi-layer perceptron performs classification; an entropy-modulated, margin-aware nonconformity score constructs adaptive prediction sets; samples predicted as transitional with multi-label sets are reassigned to the most probable alternative class within the set, using only model outputs at inference. Evaluation uses the OSCC oral lesion and ISIC skin lesion benchmarks at a miscoverage level of 0.2. On the 3-class OSCC benchmark, overall accuracy improves from 73.54% to 77.38%, with oral cancer accuracy rising from 64.29% to 82.14% and benign accuracy from 56.57% to 70.20%. Reassignment of transitional samples reduces OPMD accuracy from 84.78% to 80.16%, consistent with the asymmetric cost of missed malignancy. On ISIC, overall accuracy improves from 85.83% to 87.19%, melanoma accuracy rising from 66.04% to 68.34%. AdaConRed outperforms LAC, APS and RAPS under an identical backbone and redistribution rule. Conformal prediction can be extended beyond uncertainty quantification toward actionable decision support where transitional disease categories are present, with gains concentrated in the clinically critical malignant categories. Code repository: https://github.com/saibal436ghosh/AdaConRed.
Read the full abstract
Human-Computer Interaction
AI Use Conditions and Perspective Diversity in Ethical Decision-Making: A Pilot Study of Human Reasoning Processes
Generative artificial intelligence (AI) is increasingly used to support human decision-making, yet less attention has been paid to how AI may influence the reasoning processes that precede final judgments. This pilot study explored whether different AI-use conditions were associated with differences in reasoning breadth during ethical decision-making. Twenty-nine participants completed an ethical dilemma under one of three conditions: AI-Prohibited (n = 10), AI-Optional (n = 10), or AI-Mandatory (n = 9). Responses were evaluated by three independent blind coders using two exploratory measures: the Counterargument Diversity Score (CDS) and Perspective Diversity Index (PDI). Participants across conditions generally converged on similar ethical conclusions, most commonly favoring disclosure and customer protection. However, participants in the AI-Mandatory condition considered a broader range of perspectives, including legal, regulatory, organizational, technical, and ethical viewpoints. A statistically significant overall difference in PDI scores was observed across the three conditions, whereas differences in CDS were not statistically significant. These findings suggest that generative AI may not necessarily alter final ethical judgments but may be associated with broader exploration of perspectives prior to reaching those judgments. Given the small sample size, the findings should be interpreted cautiously and examined in larger studies.
Read the full abstract
Instrumentation and Methods for Astrophysics
Astrophysics in the Era of Artificial Intelligence powered by Large Language Models
In recent times there is considerable unease about the way Artificial Intelligence (AI) powered by large language models is used to do astrophysics, and, assuming that these AIs will get far better in future, several alarming situations are also discussed. In a “white paper,” Hogg argues that extreme cases like allowing AI to write all astrophysics papers or strictly controlling AI are not good choices and posits that it is difficult to adopt moderate policies. I examine the impact of AI on astrophysics by making two rather extreme assumptions: first, that the modern astrophysicist has become increasingly preoccupied with the administrative task of publication over the act of physical discovery (astrophysicists are busy writing papers and have stopped doing astrophysics); and second, that while AI possesses the capacity to synthesize literature and generate manuscripts, they lack the intrinsic ability to perform original astrophysical inquiry (AI can write papers but cannot do astrophysics). I provide some plausible reasons for adopting these assumptions, but, more importantly, extrapolate the implications of these assumptions to argue that AI can have a very positive impact on astrophysics. By situating AI as agents of publication rather than discovery, the focus of the human researcher can be directed towards fundamental astrophysics, leading to very positive growth in the field.
Read the full abstract
Exactly Solvable and Integrable Systems
Poisson Pencils, Lie Symmetries and Hamiltonian Reductions of a Coupled Nonlinear Wave System:Tangent KdV Geometry and Elliptic Moduli
We study the two-field nonlinear dispersive system \[ u_t=u_{xxx}+6uu_x,\qquad v_t=v_{xxx}+6(uv)_x, \] viewed simultaneously as a coupled wave equation, as the tangent covering of Korteweg–de Vries (KdV), and as a Hamiltonian flow on a tangent Poisson manifold. The main purpose is to make these viewpoints interact at theorem level. First, we prove that the Magri Poisson pencil of KdV admits a complete tangent lift to an explicit compatible pair of matrix Hamiltonian operators. The corresponding recursion operator has triangular tangent form and generates the lifted KdV hierarchy. Second, we identify a five-dimensional point-symmetry algebra together with the infinite hierarchy of tangent generalized symmetries. Third, reduction by the traveling-wave subgroup produces a four-dimensional Hamiltonian system that is the complete tangent lift of the scalar KdV profile dynamics. On the nonsingular elliptic locus, the base profile is written in Weierstrass form and every tangent traveling wave is classified explicitly by derivatives with respect to the energy and integration constants.
Read the full abstract
Software Engineering
From Experiments to Decisions: Reusing Evidence in Autonomous Coding Research
Autonomous coding agents can remember an experiment yet carry forward a conclusion it does not justify. We reconstruct how evidence is reused in a 400-task NeuroGolf campaign, with selected wellbore-prediction records from the same operator as cross-domain comparisons. A numerical counterexample exposes an overbroad exclusion; other episodes distinguish what failed, incomplete and revised programs justify doing next. The wellbore records reveal an additional weakness: a coordinator correctly acknowledges a novelty-only rejection, then summarizes it as measured closure. Separately, a prefix-based acceptance gate at three thresholds yields worse target scores than ungated adaptation in the retained experiment. These cases motivate an inspectable handoff linking the tested proposition, its scope, candidate and evaluator identity, check statuses, and reopening condition. A dispatch tree separates investigation, repair, reopening and stopping; a promotion predicate requires that each check both passes and has evidence supporting its use for the requested decision. The practical lesson is to preserve not just experimental results, but their limits on subsequent action.
Read the full abstract
Computer Vision
Variational Template Matching with Statistical Fusion for Anomaly Detection in Patterned Structures
Anomaly detection in structured images is challenging in small-data settings where deep learning approaches are costly or impractical. Classical template matching is simple and interpretable but lacks robustness to geometric variations such as scale, rotation, and perspective. We propose a variational template matching framework that represents anomaly templates as a family of transformed instances and performs detection via normalized cross-correlation over this transformation space. To further improve robustness, we introduce a density-based statistical anomaly score derived from local intensity distributions using kernel density estimation (KDE). This produces a smooth representation that captures distributional concentration and tail behavior more robustly than histogram-based methods. The structural and statistical signals are integrated through a unified fusion formulation, enabling complementary modeling of geometric similarity and distributional deviation. Experiments on biological cell images demonstrate that the proposed method outperforms classical baselines and achieves competitive performance with ResNet-50 under a fully training-free setting, while providing explicit localization. The approach offers an efficient, interpretable, and practical solution for anomaly detection in structured image domains.