Numerical Analysis
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 7 September
Connectors are ubiquitous in technical systems and frequently combine mechanical contact with electric current transfer and heat generation. To capture these interacting processes, an electro-thermo-mechanical contact formulation based on the third-medium concept is proposed. Mechanical contact, electric current flow, and heat conduction are represented within a unified finite element framework without explicit contact-surface tracking. Deformation-dependent switching functions govern the onset of electrical and thermal transport during interface closure. Electrical conduction is coupled to the transient thermal problem through Joule heating, while the temperature dependence of the electrical conductivity provides the corresponding feedback on the current flow. The coupled displacement, electric potential, and temperature fields are solved monolithically and combined with an independently interpolated deformation-gradient-like field for robust third-medium regularization under severe compression. Numerical examples demonstrate contact-induced current transfer, subsequent Joule heating and transient temperature evolution, as well as localized current paths during progressive closure of rough interfaces.
Medical Physics
Reducing Hydrocephalus Shunt Revision Rates: A Computational Fluid Dynamics Study on Catheter Hole Design
Proximal shunt obstruction is the leading cause of ventriculoperitoneal (VP) shunt failure in pediatric hydrocephalus and is closely tied to the near-wall shear environment at drainage holes. We used computational fluid dynamics (COMSOL) to decouple local wall-shear-stress (WSS) control via catheter-tip geometry from global drainage control via a valve opening. A cylindrical ventricle domain with Newtonian CSF ($\rho$ = 1000 kg/m$^3$, $\mu$ = 1 mPa$\cdot$s) and $\Delta P \approx$ 10 mmHg was solved under laminar Navier-Stokes flow while sweeping distal hole spacing, hole count/diameter, and a simplified valve constriction. Mesh-independence was achieved (minimum element size $\approx$ 0.021 mm; distal-hole velocity converged to $\approx$ 1.18$\times10^{-3}$ m/s). Perpendicular separation of the two most distal holes increased total outflow by $\approx$ 22% (2 mm vs 0.5 mm) and raised distal lateral-wall WSS by $\approx$ 19%, whereas longitudinal shifts of upstream holes produced only small changes. A valve opening near 0.166-0.17 mm set system drainage to $\approx$ 20 mL/h across geometries, indicating capacity is valve-limited while local WSS is geometry-controlled. The selected tip uses two conical holes (0.5 mm ID) in four rows with 1.4 mm spacing, concentrating WSS at the distal lateral walls, the surfaces where obstruction occurs, without exceeding clinical drainage targets. These findings yield design rules: prioritize distal-pair spacing, reduce hole count with smaller conical openings to elevate protective WSS, and regulate outflow with the valve. The framework provides a clear path to benchtop validation, long-term adhesion assays under mapped WSS, and anatomically realistic CFD.
Read the full abstract
Computation and Language
BanglaMemeX: Advancing Cultural Metaphoric Image Interpretation in Bangla with a Multimodal Explainable Dataset
Vision Language Models have achieved strong performance on multimodal benchmarks, yet their ability to reason about culturally grounded and metaphor-rich content remains insufficiently studied. Internet memes present a challenging setting where meaning emerges from implicit interactions between image, overlaid text, sarcasm, and shared socio-cultural knowledge rather than literal visual recognition. This challenge is amplified in low-resource languages such as Bangla, where code-mixing, stylized scripts, and culturally specific symbolism introduce substantial distribution shift. In this work, we introduce BanglaMemeX, a culturally grounded multimodal benchmark comprising 3,000 Bangla memes annotated with multi-dimensional labels (humor, sarcasm, offensiveness, motivational intent, and overall sentiment) and human-written explanations that explicitly describe textual and visual metaphors. We systematically evaluate modern VLMs on both classification and explanation generation, revealing that current models struggle to interpret implicit cultural cues despite reasonable surface-level accuracy. Our results highlight the need for culturally-aware multimodal systems capable of grounded reasoning under linguistic and cultural distribution shift.
Read the full abstract
Dynamical Systems
New Symbolic Procedures in the Study of Dynamical Systems
The thesis develops symbolic representations of dynamical systems in finite-dimensional commutative real algebras. The algebraic framework (orthogonal idempotents, zero divisors, and the structure of finite-order algebras) supports algebra-valued Fourier and Laplace transforms and Walsh-function-based system identification. The methods yield exact, coordinate-free vectorial solutions for motion in non-inertial reference frames, including a generalized Larmor theorem, the Foucault pendulum, motion in central positional-force fields, and the two-body problem in arbitrarily rotating reference frames. This English edition is an audited LaTeX reconstruction of the 1995 original, with an editorial note documenting provenance.
Read the full abstract
Human-Computer Interaction
Delusions and Harms Associated with AI Chatbot Use: Early Evidence from 185 Real-World Reports
Importance: Reports have raised concerns that AI chatbots may validate or elaborate delusional beliefs, respond inappropriately to suicidal ideation, and contribute to mental health harms, but real-world data on reported harms remain limited. Objective: To characterize psychopathological features, chatbot behaviors, timing, and outcomes in first- and second-hand accounts of mental health harm linked with AI chatbot use. Design: Cross-sectional secondary analysis of deidentified online survey responses gathered between August 7, 2025, and February 2, 2026. Main Outcomes and Measures: The primary quantitative outcome was the presence of delusional beliefs, coded by paired raters with relevant clinical experience. Additional variables included reason for chatbot use, current episode features, delusional content, chatbot validation of beliefs, harms, social and occupational consequences, healthcare use, and timing. Results: 95 first-hand and 90 second-hand accounts were analyzed. Median age was 35.0 (IQR 27.0 - 45.0). Raters coded descriptions consistent with delusional beliefs in 102 reports (55.1%), with chatbot validation of beliefs in 50/102 (49.0%). Common outcomes included isolation, relationship breakdown, hospital admission, job loss, and financial loss. Four second-hand reports described death by suicide. Conclusions: In this self-selected convenience sample, AI-chatbot-associated harms were frequently described in relation to delusional beliefs, perceived chatbot validation, intensive use, and substantial social, occupational, and clinical consequences. Because reports were retrospective, unverified, and collected from individuals seeking to report harm, our findings should be interpreted as preliminary signal detection rather than as suggesting prevalence or providing evidence of causality. Prospective surveillance and trajectory-based safety evaluations are needed.
Read the full abstract
Sound
Geometry-Informed Distributed Acoustic Scene Understanding
Acoustic scene understanding in multi-room environments is a difficult task. Most existing systems use a single centralized microphone array, and they often fail because walls and doors block sound signals. To address this challenge, we propose a geometry-informed distributed acoustic scene understanding framework. Our system leverages distributed microphones and uses an audio spectrogram transformer and a topology-aware graph neural network to fuse spatio-temporal acoustic features. Then, these features are decoded into discrete semantic triplets. Finally, a frozen large language model combines these symbolic observations with the environmental geometry. This allows the system to perform spatial understanding, infer plausible missing transitions, and generate a physically consistent narrative of the scene. Experiments on a custom multi-room simulator demonstrate that our framework outperforms centralized baselines and improves spatial consistency under simulated occlusion.
Read the full abstract
Artificial Intelligence
Eliciting Self-Verification in Multimodal Reasoning Agents with Reinforcement Learning
Reasoning agents increasingly rely on external tools such as web search to answer complex queries. Reinforcement learning (RL) finetuning algorithms such as GRPO have improved long-form reasoning in text-only language models, particularly for coding and mathematics. Reliable tool use in multimodal agents, however, remains challenging because models must interpret text and images while integrating noisy retrieved evidence, often under sparse outcome-level supervision without explicit verification signals. We present Self-Verification via Reinforcement Learning (SVRL), an RL-only finetuning framework that trains multimodal agents to verify and filter retrieved evidence within their own reasoning traces, reducing reliance on external verifiers at inference time. SVRL also introduces a search-aware penalty that discourages unnecessary tool calls and a query-diversity reward that encourages diverse, well-formed search queries, providing fine-grained feedback on when and what to search. Finetuning Qwen-2.5-VL-7B with SVRL on only 5{,}000 visual question answering examples yields consistent gains in multi-hop VQA generalization and tool efficiency across benchmarks. Overall, SVRL narrows the gap between compact agents and much larger proprietary models while requiring substantially lower training and inference cost.
Read the full abstract
Representation Theory
Atomic Decompositions of Lie Characters and the Dominant Weight Poset
Let $\mathfrak{g}$ be a complex semisimple Lie algebra and, for a dominant integral weight $\lambda$, let $\Theta_\lambda$ be the multiplicity-free sum of the weights of the irreducible module $V(\lambda)$. The $\Theta_\mu$ form a $\mathbb{Z}$-basis of the $W$-invariants, so there are unique integers $a(\mu,\lambda)$, the atomic numbers, with $\mathrm{ch}\,V(\lambda) = \sum_\mu a(\mu,\lambda)\Theta_\mu$ over dominant $\mu$. We ask when they are nonnegative. They are the Moebius transform of the weight-multiplicity function on the dominant-weight poset, which the crosscut theorem turns into an alternating sum of at most $2^{\mathrm{rank}\,\Phi}$ multiplicities indexed by subsets of the covers of $\mu$ in $[\mu,\lambda]$. We prove that $a(\mu,\lambda)\ge 0$ whenever every connected component of the Dynkin diagram is a path, and identify the coefficient with the dimension of an explicit weight space: it is cut out of $V(\lambda)$ by alternately taking kernels of raising operators and cokernels of lowering operators, one per cover, in order along the path. Type $D_4$ shows the hypothesis is necessary. Put $\beta = \alpha_1 + 2\alpha_2 + 2\alpha_3 + 2\alpha_4$; for every dominant $\mu$ with $\langle\mu,\alpha_2^\vee\rangle = 1$ and $\mu+\beta$ dominant, $a(\mu,\mu+\beta)$ is $-2$ if $\langle\mu,\alpha_1^\vee\rangle = 0$ and $-1$ otherwise. Restriction to the support of $\lambda-\mu$ carries this family into every irreducible type with a trivalent node. Thus an irreducible finite root system has all atomic numbers nonnegative exactly when its Dynkin diagram is a path, namely in types $A_n$, $B_n$, $C_n$, $F_4$, $G_2$. Deep in the dominant chamber, in an explicit range, $a(\mu,\lambda)$ is the Kostant partition number of $\lambda-\mu$ for the nonsimple positive roots; negative atomic numbers are therefore confined to boundary slabs.
Read the full abstract
Statistical Methodology
Risk-Aware Goal-Oriented Bayesian Optimal Experimental Design
Traditional Bayesian optimal experimental design (OED) selects measurements that best inform a model's parameters. However, such measurements can be suboptimal for downstream predictions. Goal-oriented OED targets the prediction directly. However, the existing goal-oriented criteria value all reductions in predictive uncertainty equally, with no way to prioritize rare, high-consequence outcomes. In this article, we develop a risk-aware framework that composes risk at three levels, each generalizing an ingredient of classical $I$- and $G$-optimal design: a deviation measure of the posterior predictive uncertainty (generalizing the predictive variance), a risk measure across the prediction domain (interpolating $I$-optimal averaging and $G$-optimal worst-case selection), and a risk measure over datasets (generalizing the expectation). We generate each level from a regret function in the risk quadrangle, so that one triple specifies a practitioner's risk preference. We relax the design to continuous weights on the unit simplex and construct a nested-quadrature estimator that is differentiable in the design variable. This enables solving the optimal design problem with gradient-based methods, avoiding a combinatorial search over candidate designs. For a linear-Gaussian lognormal model and a nonlinear extension, we derive closed-form objectives. These give exact references against which we verify that the estimator converges. We demonstrate this framework for finding optimal sensor placements in an inverse problem governed by an advection-diffusion equation. We find that the risk-aware designs substantially outperform the expected-information-gain baseline, which is statistically indistinguishable from a random allocation.
Read the full abstract
Mesoscale and Nanoscale Physics
Nonlinear Topological Orbital Responses of Antiferromagnetic Skyrmions
Antiferromagnetic skyrmions evade the skyrmion Hall effect, but compensation suppresses their conventional topological charge Hall signal. We predict a semiclassical nonlinear topological orbital response of an isolated skyrmion in a $\mathcal{PT}$-symmetric hexagonal antiferromagnet without spin-orbit coupling. In the diffusive, weak-emergent-field regime, the spin-dependent emergent Lorentz force reshapes the carrier distribution, generating a local orbital Hall-current correction and a local orbital accumulation, both quadratic in the applied electric field. The current correction requires spin-asymmetric longitudinal scattering, whereas the accumulation survives spin-symmetric scattering. When the spin-diffusion length greatly exceeds the strip width, the current correction persists while the accumulation approaches zero. Both signals are even under electric-field reversal, odd under reversal of the skyrmion topological charge $Q$, and helicity independent within this model. These symmetries enable rectified detection and distinguish this mechanism from the $Q$-even quantum-regime topological orbital Hall effect.
Read the full abstract
Optimization and Control
Bi-ZOL: Bilevel Zeroth-Order Learning with Nonsmooth Responses
This paper studies lower-level-constrained bilevel optimization in a response-oracle setting, where lower-level model information is unavailable and the induced response mapping is locally Lipschitz but potentially nonsmooth. In this setting, the classical response Jacobian and reduced hypergradient may fail to exist. We propose Bilevel Zeroth-Order Learning (Bi-ZOL), a structure-guided zeroth-order method for finding stationary points of the nonsmooth reduced problem. Instead of estimating the gradient of a fully smoothed reduced hyperobjective, Bi-ZOL separates the bilevel chain-rule structure: it keeps the exact upper-level partial gradients at the queried response and uses zeroth-order sampling only to estimate the response Jacobian. This construction yields an approximate hypergradient that is more directly aligned with the Clarke chain-rule subdifferential. We show that the Bi-ZOL direction admits a partial-smoothing interpretation, quantify its pointwise structural bias, and prove finite-time convergence to a $(\delta,\epsilon)$-Bi-ZOL Frank–Wolfe stationary point. The bias is $O(\delta)$ for piecewise $C^{1,1}$ responses under local regularity and vanishes for piecewise affine responses on active-cell neighborhoods. Experiments on incentive-based tracking problems show that Bi-ZOL achieves smaller stationarity gaps and lower hyperobjective values than vanilla zeroth-order smoothing under comparable response-oracle budgets.
Read the full abstract
Software Engineering
Service Health Engineering for Distributed Systems
Distributed systems support many critical business workflows, but service health is often judged through component dashboards rather than through end-to-end user outcomes. This article presents service health engineering as a practical reliability discipline that connects telemetry, workflow completion, dependency behavior, operational readiness, and recovery validation. Using a document approval workflow as a running example, it describes how service promises, service-level indicators and objectives, watchdogs, incident measures, resiliency testing, and weekly service-health reviews can reveal silent failures and stranded asynchronous work. It also presents a human-reviewed, AI-assisted reporting architecture for assembling service-health evidence without making AI an autonomous decision-maker. The approach brings established reliability practices together around whether user journeys complete as promised.
Read the full abstract
Digital Libraries
URL Extraction from Scholarly Documents: A Cross-Format Comparative Analysis
URLs in scholarly documents link to rich external resources such as datasets, software, publications, and websites. Extracting these URLs is crucial in the data preparation stage of many downstream tasks, such as link rot analysis, web crawling, and building knowledge graphs. However, existing studies often downplay this phase, simply extracting URLs from a single format, usually text directly converted from PDFs. We present a systematic study evaluating URL extraction across six input formats (text with annotation layer, LaTeX, HTML, XML, Markdown, and PNG converted from PDF). To support the evaluation, we compiled a benchmark dataset consisting of 2,338 manually annotated URLs from 200 arXiv papers spanning a wide range of domains over a 33-year period. In addition to evaluating individual file formats, we also compared 63 composite input-format combinations. Our extensive evaluations indicate that TEXTWAL achieves the best performance among single-format inputs, while TEXTWAL+LaTeX achieves the best overall URL extraction performance. The same trend is observed for URLs linking to open-access datasets and software. To further validate these findings, we apply our format-specific URL extraction pipelines to a longitudinal random sample of 364,744 arXiv papers spanning 33 years. We observe a sharp increase in URL density after 2015, along with remarkable differences in URL extraction across file formats over time. Overall, our study highlights the importance of selecting an appropriate format for URL extraction from scholarly documents. The dataset and code are publicly available at: https://github.com/lamps-lab/arxiv-url-bench .
Read the full abstract
Probability
Resolvent characteristics and quadratic mixing of Kac's walk on $SO(n)$
We study the coordinate-plane Kac walk on $\mathrm{SO}(n)$ with independent uniform rotation angles. For the unnormalized Hilbert-Schmidt Riemannian distance, we prove that the Wasserstein-$2$ Lipschitz coefficient of a block of $2\binom n2$ steps is at most $2n^{-1/200}$ for sufficiently large $n$. This gives a fixed-accuracy $O(n^2)$ Wasserstein mixing bound and inverse-polynomial accuracy in a constant number of blocks. We also obtain an $O(n^2)$ total-variation upper bound. The coupling averages each component of a regularized-inverse angle correction over its own angle, so its exact flow preserves the joint angle law. A deterministic decreasing regularization parameter cancels the main scalar and matrix-valued resolvent drifts. Its stability factor is polynomial in the inverse regularization, and the matrix estimates close on two partial traces. The same scalar estimate bounds the fraction of deficient covariance directions; independent cores and a cutoff integration-by-parts argument give the total-variation transfer. We provide the parameter estimates, conditioning arguments, and finite-time singular-mass treatment explicitly. The results imply total-variation pre-cutoff on the quadratic scale, but do not establish either the presence or the absence of cutoff.
Read the full abstract
Dynamical Systems
The Bernoulli property for $PSL_2\mathbb{R}$ skew products over exponentially mixing base
We study the Bernoulli property for skew products of the form $f(x,y)=(g(x),A(x)y)$ on $M\times PSL_2(\mathbb{R})/\Gamma$, where $g$ is a smooth, measure-preserving, exponentially mixing diffeomorphism, $\Gamma<PSL_2(\mathbb{R})$ is a cocompact lattice, and $A\colon M\to \operatorname{PSL}_2(\mathbb{R})$ is a $C^{1+\alpha}$ cocycle. We prove that if $A$ has a nonzero Lyapunov exponent, then $f$ is Bernoulli. The proof does not require that $f$ be exponentially mixing. This provides a new method for establishing the Bernoulli property, which applies to a large class of skew products.
Read the full abstract
Artificial Intelligence
What Does Multi-Agent Debate Actually Change?
Multi-agent debate, in which several LLMs exchange arguments before producing an answer, raises a basic question: does expressed disagreement reflect changes in the members' own positions? No single signal can settle this question, so we organize the analysis around five questions: (A) does the debater say it disagrees; (B) does its reply text actually argue; (C) does its own position change after each debate turn; (D) how much, quantitatively, does the position change; and (E) how do members' final positions compare with their initial ones? We evaluate two- and three-member committees on 50 curated opinion questions from GlobalOpinionQA, using same-model, same-family, and mixed-family configurations with friendly, neutral, and hostile instructions assigned at each turn. (A) Tone changes reported agreement: the share of replies reporting strong agreement is 70.7-96.3% under friendly instructions, compared with 9.5-19.3% under hostile ones, varying with model choice. (B) Self-reports broadly align with text judgments, but consistency varies by agreement level and model choice. (C) Position changes depend on the interaction: after a peer's leaning-disagree reply, members reporting strong agreement switch options more often than those reporting leaning disagreement. (D) For open-weight members, the probability of the option a member already holds stays near saturation, even after a peer's pushback, while endorsement of its earlier position text drops after a peer's argument relative to neutral filler, more for Qwen3.8-27B than Inkling. (E) The selected option is unchanged from members' initial to final positions in over 90% of comparisons in every configuration. Taken together, expressed disagreement need not translate into position revision, either within individual exchanges or over a complete debate.
Read the full abstract
Artificial Intelligence
From Version Conflicts to Decision Conflicts: Selective Revalidation for Long-Running AI Agents
Long-running AI agents may read state, reason, wait for tools or human approval, and perform an external action much later. The state that justified the action can change in the meantime. For example, after an agent proposes an 80 GBP refund under a limit of 100, a customer-name change affects only presentation metadata, a new limit of 90 still permits the refund, a limit of 50 invalidates it, and a refund issued by another worker must prevent a duplicate. Standard optimistic concurrency control and version checks can detect that previously read state has changed, but by themselves do not determine whether that change invalidates the pending action's justification. We call any detected version change a version conflict; when that change invalidates the action's justification, it is also a decision conflict. ATR records the explicit, executable conditions that justify a pending action and rechecks only the conditions affected by a change before releasing the external operation. It can retain the action, refresh non-decisive metadata, require replanning, or block execution; a target-side transaction or compare-and-set binds checked state to commit. Across 210,000 controlled executions over 15 mutation cases, ATR matched every developer-specified outcome with no false allows or blocks. In ten durable SQLite checkpoint/resume cells, it evaluated 0.6 conditions per change versus 6.0 for FullScan. At 4,093 recorded reads, ATR took 9.3 microseconds versus 2595.9 microseconds for FullScan. These deterministic results establish controlled feasibility, not production generality or automatic extraction of the required conditions.
Read the full abstract
Quantum Physics
Learned Diffractive Optics for Quantum-Optimal Inference
Quantum mechanics sets the ultimate bounds on photon-limited sensing, yet practical measurements attaining these bounds are known only in special cases. This is particularly the case for visual sensing problems, where the goal is to infer features of a distant object based on the spatial structure of the light field it emits or reflects. Because of the potentially complex structure of such objects and fields, constructing optimal measurements on them is a challenging task. Here, we apply learned diffractive optics to state discrimination and parameter estimation of coherent and diffraction-limited incoherent light fields under a restricted photon budget. Optimized directly on each task's figure of merit, without prior knowledge of the optimal measurement, the physically realizable diffractive optical neural networks substantially outperform standard measurements and approach the quantum limits for a given number of photons as well as in the asymptotic limit.
Read the full abstract
Computer Vision
A Black-Box Adversarial Attack on Human Pose Estimation and Keypoint-Based Action Recognition Models
Human pose estimation and keypoint-based action recognition models are increasingly deployed as components of video understanding pipelines, yet their vulnerability to adversarial attacks remains insufficiently studied. Temporally coherent black-box attacks have been previously studied in visual object tracking, where the attack feedback can be defined using bounding-box overlap measures such as Intersection over Union (IoU). However, human pose estimation produces keypoint configurations rather than enclosing boxes, making box-level similarity poorly suited for measuring pose degradation. We propose OKS Attack, a decision-based black-box attack that uses Object Keypoint Similarity (OKS) as the attack feedback signal, directly targeting the spatial structure of human poses rather than their enclosing boxes. Experiments on the Penn Action dataset show that OKS Attack consistently reduces pose quality across evaluated pose estimators, with mean OKS decreases ranging from 0.0802 to 0.1494. In a downstream cross-dataset action-recognition evaluation, the attack reduces accuracy by 6.18 to 13.86 percentage points and outperforms query-matched random-noise perturbations. The attack is effective across both top-down and single-stage pose estimation models. The source code will be made publicly available at https://github.com/KacperM33/OKS_attack
Read the full abstract
Combinatorics
Kalai's Conjecture for Tight Trees
Let $r \ge 2$ and $t \ge 1$. It is shown that if $T$ is an $r$-uniform tight tree with $t$ edges and $H$ is a $T$-free $r$-uniform hypergraph, then $|E(H)|\le (t-1)|\sh H|/r$, where $\sh H$ is the $(r-1)$-shadow of $H$. \iffalse Equality holds only for $(n,t + r - 2,r)$-designs.\fi The bound is tight infinitely often, and establishes Kalai's Conjecture, whose $r=2$ case is the Erd\H os-Sós Conjecture. The proof was found by GPT-6 Astra, extending its method of proof for the Erd\H os-Sós conjecture to the hypergraph setting. It is noteworthy that previous proofs of special cases of the Erd\H os-Sós conjecture do not extend to give tights bounds in the hypergraph setting. A strengthening of the Erd\H os-Sós conjecture due to the authors about tight lower bounds on the number of copies of a tree in a graph with average degree $d \ge t-1\ge 0$ remains open.
Read the full abstract
Computer Vision
TaskGuard: Task-Conditioned Restoration Utility for Risk-Aware Object Detection
Image restoration is commonly applied before object detection under adverse conditions, yet a visually improved image need not improve the downstream task. We study this mismatch as restoration utility prediction: given a degraded image and its candidate restoration, should the restoration be used or should the original observation be preserved? We introduce TaskGuard, a post-hoc controller for frozen restoration and detection pipelines. TaskGuard characterizes the realized restoration residual through its interaction with detector sensitivity and predicts whether the intervention is task-beneficial. Exact regional counterfactuals reveal substantial within-image utility heterogeneity, while a deployable pseudo-gradient preserves statistically reliable directional information. Feature-group ablation further shows that task-conditioned evidence contributes information beyond detector-response and residual statistics. The TaskGuard utility predictor is trained only on Gaussian degradation and frozen before final evaluation, then transferred to unseen motion blur, rain, and defocus. Across these unseen families, TaskGuard reduces lossnegative interventions by 54.2% (family macro) and practical per-image detection deteriorations by 37.0% (pooled), while preserving 98.8% of the Always-Restore COCO AP. On natural-rain DAWN, it reduces loss-negative interventions by 97.9% while retaining 77.8% of the AP improvement obtained by deraining. These results support restoration utility as a task-conditioned property of the specific intervention rather than image appearance alone.
Read the full abstract
Robotics
mjorbit: A Simulation Framework for Space Robotics
This paper presents a general framework for simulating multi-body space robots with contact. We bring efficient, large-scale robot simulation to in-space servicing, assembly, and manufacturing applications. First, we perform an empirical trade study of methods for coupling orbit propagation with existing robotics simulation frameworks. Next, we present mjorbit, a general, flexible, and performant framework built on the MuJoCo engine widely used in robotics, to which we add key spacecraft dynamics, actuators, and sensors. We provide a low-latency C++ CPU backend and a high-throughput GPU backend behind a simple Python API. We demonstrate mjorbit by solving several realistic on-orbit case studies with both model-predictive control and reinforcement learning. Open-source code and examples are available at: https://johnzhang3.github.io/mjorbit/
Read the full abstract
Cryptography and Security
"Shut Up and Let Me Enjoy My Otome": Understanding and Measuring the Toxicity in Otome Game Communities
Otome games, a romance simulation genre primarily targeting female, have emerged as a major force in the global gaming market, attracting hundreds of millions of players and billions in revenue. Despite their popularity, otome game communities face pervasive online toxicity, which has been largely unexplored. In this work, we present the first large-scale measurement of toxicity in otome game communities across social platforms. We introduce OtomeSCAN, a framework for collecting, evaluating, and analyzing 620,045 posts from Weibo and Reddit spanning 18 months. To support robust analysis, we manually annotated a ground-truth dataset of 4,308 posts, identifying eight target groups such as players and game developers. We evaluate seven toxicity detectors on the dataset, including general-purpose models and our proposed LLM-based detectors, with our best model achieving F1-scores of 0.82 (Weibo) and 0.78 (Reddit). Our analysis reveals significant platform-based differences in toxicity: 22.20% of otome-related posts on Weibo are toxic, compared to 3.71% on Reddit. Besides, real-world events like in-community conflicts can rapidly escalate toxicity, with toxicity ratios increasing to 37.09% in just 72 hours during an external attack on Weibo. We also flag 191 potential-coordination clusters in otome game communities, 64.40% of which target game developers, with several accounts participating repeatedly across multiple clusters. We hope our work inspires further research on community-specific toxicity and contributes to building healthier online spaces for marginalized gaming communities.
Read the full abstract
Systems and Control
Koopman-Based Model Predictive Control for Simultaneous State of Charge and Temperature Balancing of Lithium-Ion Cells
Cell-to-cell electrical and thermal variations produce nonuniform state of charge (SoC) and temperature distributions in lithium-ion battery packs. This paper proposes a Koopman-operator-based framework for simultaneous SoC and temperature balancing of series-connected cells. Cell-specific Koopman predictors identified using extended dynamic mode decomposition are assembled into neighboring-cell error dynamics that retain heterogeneity and thermal-disturbance effects. A Tikhonov-regularized feedforward controller provides numerically robust compensation without excessive current amplification, while constrained Koopman-based model predictive control (KMPC) regulates the residual errors through a convex quadratic program. Three-cell simulations validate the controller under two consecutive Urban Dynamometer Driving Schedule cycles. KMPC achieves balancing performance comparable to nonlinear model predictive control (NMPC). Relative to the uncontrolled case, KMPC reduces the RMSEs of the neighboring-cell SoC and core temperature differences by 66-81% and 57-76%, respectively, while reducing the computation time per optimization from 0.0259s for NMPC to 0.0028s for KMPC.
Read the full abstract
Combinatorics
Maximal Hamiltonicity of realization graphs of degree sequences
We prove that the realization graph of every graphical degree sequence is maximally Hamiltonian: it is Hamilton-laceable when bipartite on more than one vertex, and Hamilton-connected otherwise. This answers Problem P59 of Mütze's survey of combinatorial Gray codes, and the Hamiltonicity question recorded as open by Barrus, in the strongest form either admits. The argument is an induction on the number of ground vertices, cutting the realization graph at a single ground vertex into fibers and the quotient they lie over. The proof is formalized in Lean 4 and checked by its kernel, with seven results cited from the literature and nothing else assumed. Its engine is a classification. The realizable neighborhoods of a ground vertex form a shifted family – one closed under replacing an element by a smaller one – and the quotient is the Johnson graph of that family. Such a Johnson graph can fail to be Hamilton-connected, and we determine exactly when: the failures are one explicit family of examples, the Y-families, and each of them fails between a single pair of its members. A shifted family with a greatest member never fails, and those families are exactly the shifted matroids, where the conclusion already follows from the theorem of Naddef and Pulleyblank on the graphs of 0/1-polytopes. The obstruction lives entirely outside the matroid case, which is why it has not been met before.
Read the full abstract
Signal Processing
Performance Analysis of RSMA-Enabled Bistatic ISAC in LEO Networks with Holographic Apertures and Fluid-Antenna Users
This paper develops an ergodic performance framework for rate-splitting multiple access (RSMA)-enabled bistatic integrated sensing and communication (ISAC) in a low-Earth-orbit (LEO) satellite network with an amplitude-constrained reconfigurable holographic surface (RHS) and fluid-antenna-system (FAS) users. Deterministic angle-based common and zero-forcing private reference beams are realized through one shared multi-feed RHS amplitude state and stream-specific feed-domain precoders, and the resulting self-, leakage-, and target-direction gains are retained explicitly. Conservative private- and common-rate lower bounds are derived for both reference-port and best-of-$P$ FAS reception while preserving the same-port selection coupling. For sensing, a closed-form average bistatic sensing signal-to-noise ratio (SNR) is obtained under nearest-receiver association and a finite target–receiver guard distance, with extensions to angle-conditioned footprint averaging and angular scheduling. Monte Carlo results confirm the tightness of the analytical rate bounds and validate the sensing expressions. Benchmarks show that scalar RHS-efficiency models can miss strong direction-dependent effects and that nearest-ground-receiver bistatic sensing provides a $17.7$–$25.7$~dB mean SNR advantage over a favorable monostatic LEO reference for $N_{\rm RHS}=16384$ over LEO altitudes of $400$–$1000$~km. FAS gains are largest in scattering-rich regimes, while the realized shared-state RHS target gain need not vary monotonically with aperture size.
Read the full abstract
Information Theory
Algorithmic List Decoding of Reed-Solomon Codes up to Capacity
We give a deterministic polynomial-time list-decoding algorithm for Reed-Solomon codes over prime fields that approaches list-decoding capacity for every evaluation set and every constant rate.
Read the full abstract
Solar and Stellar Astrophysics
Investigating Potential Relationships Between Mass Transfer Indicators and $\delta$ Scuti Pulsations in oEA Systems
We explored potential associations between ongoing mass transfer and the pulsation properties of $\delta$ Scuti primaries in a sample of 17 oscillating eclipsing Algol systems. For this purpose, we combined binary modelling, updated O-C analyses, and frequency characterization based on TESS photometry. To ensure homogeneity, the $T_{\rm eff}$ of the components were derived using a consistent SED fitting approach. From the binary solutions and O-C diagrams, we determined the mass transfer indicators (Q, dP/dt, and dM/dt) and examined their relations with the dominant pulsation period and amplitude. For the full sample, the results indicate weak to moderate positive trends, with the strongest relation found between logdP/dt and logPpuls, while the relations involving dM/dt and pulsation amplitudes are weaker and statistically insignificant. After excluding the two prominent outliers, R CMa and BW Del, the correlations between logPpuls and the mass transfer indicators become statistically more significant, including relations with dP/dt, Q, and dM/dt under both conservative and non-conservative assumptions. These relationships may reflect the indirect effects of mass transfer on the structure of the accreting primary and on the orbital configuration, potentially reducing tidal constraints and allowing shifts toward longer pulsation periods. However, the large dispersion and limited sample size indicate that these relationships remain poorly constrained. Our results suggest that pulsation properties are primarily governed by intrinsic stellar parameters and the well established Porb-Ppuls relation, while ongoing mass transfer may contribute as a secondary factor. Although the present sample does not allow firm conclusions regarding the role of mass transfer, this study provides a homogeneous observational framework for future investigations based on larger samples and improved constraints.
Read the full abstract
Artificial Intelligence
Sparks of In Silico Cognitive Science: Theories from Simulated Data Can Generalize to Humans
Behavioral foundation models have been proposed as stand-ins for human participants across settings, but it is unclear whether theories discovered on them generalize to humans or merely characterize the simulator. We ran the Automated Cognitive Scientist (AutoCog), a closed-loop discovery system in which LLM agents design theory-discriminating experiments, collect responses, arbitrate between competing theories, and synthesize successors, entirely on behavior simulated by Centaur, a foundation model of human behavior. In a multi-attribute decision-making setting, the theories AutoCog found on Centaur generalized to human data: they outperformed canonical theories on ten held-out experiments and were rivaled only by theories found by running the same loop on people. We argue that this succeeds despite the simulator's inevitable imperfections because a discovery loop that arbitrates between competing theories demands less of its simulator than estimation does. The simulator only needs to capture the regularities that distinguish the theories, and not necessarily reproduce behavior precisely. Imperfect simulators can therefore widen the search over theories, with human data then testing whether the surfaced theories generalize.
Read the full abstract
Optimization and Control
A New Perspective on Clustering: A Mixed-norm Model and its Solution by Progressive Integer Programming
Extending the classical $K$-means and $K$-medians models, this paper introduces an $\ell_{p,q}$ mixed-norm clustering model where the centroid updates and cluster assignments are under the $\ell_p$ and $\ell_q$ norms, respectively. The model is formulated as a mixed-integer program (MIP) with Heaviside composite constraints that describe the nearest-center assignments. The framework recovers $K$-means and $K$-medians when $p=q=2$ and $p=q=1$, respectively, and yields new models when $p\ne q$. To address the computational challenges, we develop a progressive integer programming (PIP) method that adaptively fixes confident assignments and solves restricted mixed-integer subproblems. For $q=1$, we develop a convex inner approximation of the difference-of-convex constraints in the restricted subproblems, for which a global solution can be computed. Importantly, we establish the connection between the local minimizer and the strong center-local minimizer of the mixed-norm clustering problem and the global optimal solution of the restricted subproblems under certain assumptions. This connection provides a practical certificate of a local minimizer of the nonconvex mixed-norm clustering model. We further develop techniques for constructing adaptive fixing sets and working sets for $q=1$. Extensive numerical experiments demonstrate the superior performance of the mixed-norm clustering model and the efficiency of PIP for solving the MIP model, which may be intractable otherwise. In particular, the $\ell_{2,1}$ mixed-norm clustering model is effective under coordinate-sparse, mean-balanced contamination, whereas the $\ell_{1,2}$ model is preferred under dense coordinatewise Cauchy contamination. The numerical results also show that PIP can escape poor alternating solutions and obtain substantially better feasible clustering, while preserving strong warm starts when no improvement is found.