Robotics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 11 September
Continuous target sensing by uncrewed aerial vehicles (UAVs) is constrained by limited flight endurance, motivating the transfer of tracking responsibility between cooperating UAVs. Such a handoff requires the receiver to identify the same physical target currently tracked by the sender despite differences in viewpoint, scale, and target appearance. Existing approaches based on global target localization or appearance-based cross-view association are limited by positioning uncertainty or ambiguous visual features. This paper presents Perspective Alignment & Tracking Handoff (PATH), a platform-agnostic, geometry-assisted sensing and verification framework for target handoff between two moving UAVs. The sender reconstructs the tracked target as a metric 3D point using RGB-D sensing, while the receiver estimates its relative pose from a fiducial observation and projects the transmitted target point into its own image as a spatial prior for target acquisition. The receiver-generated candidate is then returned to the sender and verified through a cross-view Mutual Agreement Handshake before tracking responsibility is transferred. Real-world UAV experiments show mean relative-position and target-position errors of 0.047~m and 0.030~m, respectively. Under visually ambiguous conditions, PATH achieves 96.0% frame-level receiver-side target acquisition accuracy, with 2.0% false-positive and 2.0% false-negative rates. A sensor-error sensitivity analysis shows that relative-pose uncertainty is the dominant contributor to receiver-view projection error. The implementation operates at video rate with compact inter-UAV communication below 16~kB/s at 60~Hz, demonstrating the feasibility of lightweight geometry-assisted target handoff on resource-constrained UAV platforms.
Machine Learning
SAGE-Loop: Reliable Closed-Loop LLM-Driven AutoML with Trial-and-Correction and Adaptive Ensembling
Automated machine learning (AutoML) is reshaping data-driven science and industrial practice, and as large language models are introduced into AutoML, pipeline reliability becomes as important as automation efficiency. However, existing AutoML still struggles to realize instant feedback and adaptive optimization during execution, so once a run drifts into a suboptimal or failed state, it lacks a process-level correction mechanism. The fundamental pathology lies in its one-way pipeline: intermediate failures are typically terminated or bypassed, while fixed paradigms often strengthen model generation but leave ensemble decisions static, weakening both execution reliability and the controlled use of structural diversity. This indicates that LLM-driven AutoML needs a closed-loop ability for trial-correction-improvement together with evidence-based use of model diversity. To this end, we propose SAGE-Loop, a reliable closed-loop, self-adaptive, LLM-driven AutoML framework that performs multi-round generation and validation for trial-and-repair, and adaptively selects ensemble strategies in both supervised and unsupervised tasks, thereby unifying how to generate with how to use models. Across 20 public datasets, SAGE-Loop consistently improves performance and stability on classification, regression, and clustering tasks. Additional results further show its ability to recover from execution failures and maintain robust pipeline behavior.
Read the full abstract
Computer Vision
Bridging Vision Foundation Model Priors with CLIP for Spatial-aware Few-shot Anomaly Detection in Medical Images
Vision-Language Models such as CLIP enable effective few-shot medical anomaly detection (AD) via strong image-text semantic alignment. However, their globally contrastive pretraining lacks explicit spatial supervision, limiting precise lesion localization. In contrast, Vision Foundation Models (VFMs) such as DINO learn spatially coherent patch representations via self-distillation and local-to-global consistency, better capturing fine-grained anatomical structures. Leveraging this complementarity, we propose Spatial-FAD, a spatial-aware few-shot medical AD framework that improves lesion localization by combining VFM spatial priors with CLIP semantics. Specifically, we introduce a VFM-enhanced adapter that injects a structural affinity prior derived from DINO into CLIP features. This structure-guided refinement encourages visual embeddings to better adhere to lesion boundaries while maintaining semantic alignment. To address the loss of spatial detail from patchification and the limited input resolution of CLIP, we adopt a sliding-window aggregation strategy. This generates high-resolution, spatially dense embeddings to further enhance localization granularity. Moreover, we introduce a prototype-enhanced support memory scheme to efficiently exploit the few-shot support set. This module stores compact prototypes for normal and abnormal patterns, reducing memory costs while boosting performance by fusing patch-to-prototype and image-text similarities. Extensive experiments on three benchmark datasets, including Liver CT, Retinal OCT, and Brain MRI, demonstrate that Spatial-FAD significantly outperforms state-of-the-art methods, especially in lesion segmentation. Notably, in the 4-shot scenario, our method achieves an average improvement of over 11.4% in Dice score and 1.8% in AUC. Code is available at: https://github.com/JuzhengMiao/Spatial-FAD.
Read the full abstract
Human-Computer Interaction
From the Task Boundaries of Narrative Text to Structural Anchoring, Uncertainty Triggers, and Cross-Calibration
Causal graphs represent structural relationships among variables, yet users must still interpret direction, mechanism, and adjustment conditions in relation to the task at hand. Prior work often compares explanation formats as fixed conditions and pays less attention to how users distribute reasoning across graphs, direct explanations, and stories. We developed CoNS-Explorer, which uses reviewed instructional DAGs/SCMs to maintain a shared causal-fact ledger and generate fact-matched direct explanations and contextualized stories. A controlled survey experiment ($N=240$) compared the two texts as complete presentation packages. In the primary GLMM, the Story condition had a positive but uncertain overall association with accuracy (OR $=1.55$, 95% CI $[0.34,7.10]$, $p=.572$); a population-averaged GEE showed a significant positive effect (OR $=1.89$, 95% CI $[1.02,3.48]$, $p=.042$). Task-type interactions localized the clearest advantage to total-effect adjustment. Story also significantly increased situational presence. In a separate system-task and interview study ($N=24$), participants freely used graphs, direct explanations, and stories across three causal models. They established structural anchors with graphs and numerical results, consulted text when direction was unclear, mechanisms were unfamiliar, or multiple paths competed, and checked their judgments against other representations or external evidence. Integrating the two studies, we develop a process framework of structural anchoring, uncertainty triggering, explanation routing, and cross-calibration, together with four testable design propositions for adaptive causal explanation.
Read the full abstract
Materials Science
Enhanced anomalous Nernst effect in Pr-doped kagome and honeycomb magnet LaCo$_5$
In this work, we report the successful synthesis of La$_{1-x}$Pr$_x$Co$_5$ ($x = 0.09, 0.21, 0.45$) single crystals. Magnetic field-dependent magnetization measurements reveal that Pr substitution induces negligible changes in the magnetic properties of LaCo$_5$, with the ferromagnetic ordering predominantly governed by the Co sublattices. Remarkably, the doped systems exhibit significant enhancements in the anomalous Nernst effect. At 300~K, the anomalous Nernst thermopower $S^A_{yx}$ reaches 6.5~$\mathrm{\mu V/K}$ in La$_{0.55}$Pr$_{0.45}$Co$_5$, corresponding to a $\sim$ 40 % enhancement compared to the parent compound. This significant improvement can be predominantly attributed to Pr-doping-induced Fermi level modification, which directly leads to a redistribution of Berry curvature across the Fermi surface. This work highlights the effectiveness of Pr doping in boosting the anomalous Nernst effect of La$_{1-x}$Pr$_x$Co$_5$, offering a practical strategy to design advanced materials for room-temperature energy-harvesting technologies and high-efficiency thermal sensing devices.
Read the full abstract
Earth and Planetary Astrophysics
KMT-2026-BLG-0083L: A Two-Jovian-Planet System Orbiting an M Dwarf Discovered by Microlensing
We present the analysis of the microlensing event KMT-2026-BLG-0083, which was independently detected by the KMTNet, OGLE, and PRIME surveys and also monitored by the DREAMS survey. The combined data provide dense coverage of two distinct short-duration anomalies in the light curve that cannot be reproduced by a standard binary-lens model. Independent analyses of the two anomalies indicate that each is produced by a planetary companion to the lens, motivating a triple-lens interpretation. The modeling yields two pairs of degenerate solutions arising from the well-known inner–outer degeneracy, with each pair exhibiting two local solutions depending on whether the source passes above or below the distant planetary companion. The preferred model indicates two giant planets with mass ratios $q_2=(5.25\pm 0.08)\times 10^{-3}$ and $q_3=(3.04\pm 0.24)\times10^{-3}$ orbiting a common host. Bayesian analysis indicates that the host is an M-dwarf star with a mass of $0.48^{+0.36}_{-0.28}~M_\odot$, hosting two giant planets with masses of $2.65^{+1.96}_{-1.55}~M_{\rm J}$ and $1.54^{+1.14}_{-0.90}~M_{\rm J}$. The projected planet–host separations are $10.6^{+1.7}_{-2.2}$~au and $1.7^{+0.3}_{-0.3}$~au, placing the inner planet near the host's snow line and the outer planet at a substantially larger separation. Thus, KMT-2026-BLG-0083L becomes the seventh confirmed multiple-planet system discovered through gravitational microlensing, providing another example of a cold giant planetary system orbiting a subsolar-mass star.
Read the full abstract
Cryptography and Security
PDoS: A Profitable Denial-of-Service Attack against Proof-of-Work Blockchain Liveness
The security and liveness of Proof-of-Work (PoW) blockchains fundamentally depend on the economic rationality of miners. Existing incentive-driven denial-of-service attacks, such as BDoS, can deter rational miners from participating, but require the attacker to continuously absorb substantial economic losses and are therefore difficult to sustain in high-value networks. Meanwhile, prior infiltration-based withholding attacks are designed to extract revenue rather than to directly disrupt chain liveness. We present PDoS, a hybrid attack that combines block header signal deterrence with parasitic revenue extraction. PDoS disrupts blockchain liveness while exploiting the victim pool's share-reward mechanism to subsidize the attack cost, thereby lowering the adversarial hash-power threshold required to induce rational miners to shut down. We further show a counterintuitive result: in high-fee or high-MEV environments, higher block value can make PoW systems less secure by increasing the attacker's parasitic revenue and pushing the attack across the break-even point into a self-sustaining, or even profitable, regime. To the best of our knowledge, PDoS is the first attack to demonstrate that disrupting PoW blockchain liveness can be economically self-sustaining and even profitable.
Read the full abstract
Distributed Computing
HeatCache: Thermal-aware Energy-efficient LLM Inference Scheduling for Chassis-level Liquid Cooling in Sustainable Edge Server Rooms
LLM inference is increasingly deployed at institution-scale edges to meet service requirements. However, multi-GPU inference consumes a large amount of electricity and produces substantial heat. To improve sustainability, operators and regulations often demand raising the ambient setpoint to reduce cooling electricity. This can increase thermal throttling and hardware aging, leading to Service-Level Objective violations. In this paper, we present HeatCache, a thermal-aware, energy-efficient LLM inference scheduler for commercial chassis-level AIO liquid-cooled GPUs at sustainable ambient temperatures. HeatCache treats AIO loops as a temporary heat buffer, measured by heat budget and schedules requests to minimize energy subject to thermal safety and SLO constraints, based on an electrical-informed heat-demand estimation from HeatiTS. We implement HeatCache atop vLLM and show that it reduces computing energy by up to 18.0%, decreases thermal-throttle exposure by 81.7%, and maintains SLO violation rates below 0.9% even up to $48~^{\circ}\mathrm{C}$.
Read the full abstract
Computation and Language
GraphProfiler: Source-Linked Sensitive Attribute Inference via Personal Knowledge Graphs
Sensitive attributes such as age, income, and occupation can be inferred from user-generated content by aggregating indirect cues across many ordinary posts. LLM-based profilers can perform this aggregation automatically and with high accuracy, which makes large-scale personal attribute inference a major privacy threat. Existing LLM-based profilers, however, offer limited insight into which specific posts, concepts, and relationships made an inference possible, which is key to targeted privacy mitigation, i.e., redacting or rewriting only the few posts that actually leak an attribute, rather than perturbing entire histories. We introduce GraphProfiler, an auditable LLM-based profiler that represents each user's post history as a source-linked personal knowledge graph where nodes and edges trace back to the originating post and resolves attribute predictions to cited graph records and source texts. GraphProfiler reaches 86.7% attack success rate on the eight-attribute SynthPAI benchmark, within two points of strong text-only baselines, and 84.6% on PANDORA, while citing supporting evidence for over 98% of predictions. Our controlled ablation experiments provide evidence that the cited posts contribute to attack success, as removing them reduces the attack success rate substantially more than removing an equal number of random posts.
Read the full abstract
Social and Information Networks
Informational Help-Seeking on Reddit Did Not Decline After ChatGPT
Did people stop asking other people for advice online once generative AI could answer their questions? Prior work on ChatGPT's effect on online help-seeking disagrees in both size and sign, in part because no study has compared affected communities against similar communities that AI cannot easily substitute for, over the same months. In this paper, we track monthly post counts in 26 Reddit informational communities against 90 size-comparable hobby communities over the same six calendar months before and after the launch of ChatGPT. We also repeat the entire analysis at 66 earlier dates, before ChatGPT existed, to see what our method reports when no ChatGPT-effect exists. We find that informational help-seeking did not decline. Our results rule out any decline in posting larger than 3.4%, far smaller than the 8% to 25% declines documented in prior work. Steady post counts could still be misleading if AI-written posts had replaced human ones. We test this possibility by scoring 274,411 posts and 223,775 comments with AI-text detectors, compared in a way that cancels out detector false-positives on human-written text. AI-written posts rose only 2-3 percentage points more in informational communities than in hobby communities, short of the 5.1 points that would be needed to hide even the smallest decline previously reported for Reddit. In addition, the comments people receive show no such rise at all. Why, then, do published studies disagree? Reddit community types were already drifting apart before ChatGPT existed, at rates comparable to every published estimate, and without same-time controls, that drift can look like an effect of generative AI. Our own largest estimate, an 18% fall in posts to low-stakes curiosity communities, matches its pre-existing trend. Humans still ask humans for help, and, as far as detection can tell, humans still answer them.
Read the full abstract
Artificial Intelligence
Do LLMs Trust the Accuser or the Accusation? Measuring Belief Shifts in Werewolf
Social-deduction games such as Werewolf are increasingly used to evaluate LLM agents, but existing evaluations often rely on final game outcomes. We propose a belief-shift evaluation benchmark in Werewolf for analyzing communication skills through belief updating. Using LLM-played games, we annotate suspicion and accusation messages and measure how an observing village-side model's beliefs change after each message. We evaluate 40 open-weight LLM configurations on 1,224 annotated messages. Our results show that larger models better distinguish true wolves from villagers based on game history, but accusations still strongly influence their beliefs. Models become more suspicious of the accused target and less suspicious of the accuser, especially when the accuser is trusted, even if the accuser is wolf-aligned. Larger models better resist accusations from accusers they already distrust. Overall, our findings suggest that current open-weight LLMs up to 120B parameters still struggle to integrate accusation content with source trust in strategic communication. Our benchmark and code are available at https://rlg.iis.sinica.edu.tw/papers/werewolf-accusation-benchmark.
Read the full abstract
Social and Information Networks
Exact Community Recovery in Bipartite Networks
Community detection in bipartite networks is a fundamental problem in modern data analysis, with applications in recommendation systems, biological networks, and social network analysis. Unlike conventional unipartite graphs, bipartite networks consist of two distinct types of nodes with edges only connecting across types, so recovering latent communities requires estimating labels on the two node types. The stochastic co-blockmodel is a classical probabilistic framework for such networks, yet theoretical guarantees for exact community recovery in this setting remain limited, especially when the number of communities grows, the community sizes are unbalanced, or the degrees are heterogeneous. In this work, we prove that a simple spectral clustering algorithm based on the diagonal-deleted Gram matrix achieves exact recovery with high probability under mild conditions on sparsity, community balance, and the number of clusters. We further extend the result to the degree-corrected stochastic co-blockmodel, where each node carries its own degree heterogeneity parameter, and show that a row-normalized version of the same algorithm maintains the exact recovery guarantee. Extensive experiments validate our theoretical findings.
Read the full abstract
Physics and Society
Diverse Minds, Divided Networks? Personality Composition, Polarization, and Collective Intelligence in LLM-Based Social Simulations
Simulated societies of large language model agents are used to study online polarization, and separately to study collective intelligence, but the two are rarely measured in the same system. It is therefore difficult to say whether a society's personality composition shapes both, or whether reducing polarization costs collective competence. We present TraitMix, an experimental design in which the Big Five composition of a simulated social network, both trait levels and trait heterogeneity, is a controlled experimental variable, and in which polarization and collective performance are measured in the same runs. Across 991 simulations of hundred-agent societies, spanning six contested topics and six language models, trait heterogeneity has the largest measured effects, acting in opposite directions on two faces of polarization: varied societies hold more dispersed opinions while being less segregated into camps, so homogeneous societies are not moderate but consensual echo chambers. Trait effects are not additive, as Agreeableness determines the sign of Openness, an interaction that replicates across models although the primary model's estimate is influence-driven. Contrary to the trade-off the study was designed to measure, no polarization measure predicts poorer collective performance, and cross-cutting interaction is the only one of four whose association with collective accuracy survives partialling on the aggregation identity. We report ablations removing two potential measurement circularities, an induction gate applied to every model, and the measures that failed them.
Read the full abstract
Signal Processing
Through-Wall Detection using Software-Defined Radio based on adaptive Principal Component Analysis
Through-Wall Detection (TWD) using opportunistic WiFi signals enables non-invasive sensing for security and rescue applications; however many existing approaches rely on controlled access points or specialised hardware. This paper presents a TWD system that extracts Channel State Information (CSI) from ambient WiFi packets using a customised software-defined radio (SDR), Bluebottle, without requiring transmitter control. The key contribution is a spectral-domain scoring mechanism for adaptively selecting motion-relevant principal components from a Principal Component Analysis (PCA) decomposition of the CSI, using Welch power spectral density estimates to quantify each component's signal-to-noise ratio and spectral concentration within the frequency band associated with human motion. The selected components are then analysed using a continuous wavelet transform to robustly identify time-localised motion events. Experimental results demonstrate that the proposed adaptive component-selection method consistently reduces false detections and produces sharper time-frequency energy ridges compared to conventional fixed-component PCA.
Read the full abstract
Machine Learning
3D Digital Twin Visualization of Multiclass GRF-Based Gait Disorder Classification
Automated gait analysis requires accurate classification and interpretable outputs. We propose an integrated framework for classifying healthy gait and multiple musculoskeletal impairment groups using bilateral ground reaction force (GRF) and center-of-pressure (COP) signals. The signals were normalized over the stance phase and standardized using training-set statistics. The model achieved a validation accuracy of 99.00% and a test accuracy of 90.07% under a session-level split. Class-specific $\epsilon$-LRP identified positive and negative contributions across both sides, multiple signal components, and different stance phases. Separately, the processed GRF signals and model predictions were synchronized within a Blender-based 3D visualization, enabling sample-level inspection of gait trials and classification results. The proposed framework integrates classification, explainability, and 3D visualization to improve model transparency. The source code is available in the following repository: https://github.com/nyoico/grf-gait-3d-visualization.git
Read the full abstract
Robotics
IMPLY: Physically Anchored Consistency for World-Model Rollouts
A world model asked what happens if an object is pushed at several speeds produces several futures. If the model has the object in mind, those futures agree about it: each implies the same mass and friction. The consistency checks now used to vet world-action models ask whether a model's futures agree with each other, and none of them knows any physics. We show that this is not enough, and what to do instead. IMPLY reads the physics each rollout implies by inverting a simulator and scores a set of rollouts by how well one object explains all of them, anchored to two calibration pushes the model has observed. In a controlled setting, self-consistency gives a perfect score to a model that ignores the object and always predicts a typical push; anchoring exposes it (AUROC 0.70 versus 1.00). On a real model, V-JEPA 2-AC adapted to the scene, the same thing happens. Given its own calibration pushes the model tracks the object (per-object correlation with the truth 0.91); given another object's, it does not (0.05). Self-consistency cannot tell these apart, preferring the right evidence on 52% of objects, chance level, while anchored disagreement prefers it on 73% and correlates 0.92-0.99 with the rollouts' error. Used to choose among candidate rollout sets, it comes within 0.003 of an oracle that sees the truth. A model that has internalised the wrong object is exactly as self-consistent as one that has internalised the right one; consistency has to be anchored to evidence.
Read the full abstract
Classical Analysis and ODEs
The norm of the centered Hardy–Littlewood maximal operator
We determine the exact $L^p(\mathbb{R})$ norm of the centered Hardy–Littlewood maximal operator for every $1<p<\infty$, proving that it equals $p/(p-1)$. This settles the sharp strong-type problem for the centered maximal operator on the real line. For every $p$ in this range, the norm is strictly larger than the constant associated with the critical power $|x|^{-1/p}$, thereby disproving the conjecture of Dror, Ganguli, and Strichartz that this profile determines the unrestricted norm.
Read the full abstract
Digital Libraries
Debiasing as a Measurement Intervention: Calibrated Ties and Resolution Loss in LLM-as-a-Judge Evaluation
LLM-as-a-judge protocols are commonly debiased by instructing judges to ignore presentation cues such as citation formatting, source labels, and evidence-display style. We show that this intervention can suppress bias while damaging the resolution of the measurement instrument. We introduce TraceJudgeBench, a diagnostic benchmark for auditing citation-like artifacts in RAG and agent-workflow evaluation, covering content-equivalent pairs, citation ablations, correctness conflicts, human-validated soft and moderate quality gaps, prompt-strength ladders, decoupled judging, and a controlled workflow-ranking probe. Across GPT-5.5, Claude Sonnet 4.6, and DeepSeek V4-Flash, stronger anti-citation prompts reduce worse-cited wins from up to 50.5% to 0%; yet some operating points already convert validated moderate-gap decisions into Tie before the strict stress-test endpoint, while correctness-conflict accuracy remains at or above 93.0%. A second, 50-pair FinQA moderate-gap construction reproduces the qualitative frontier, and open-weight Qwen2.5-14B-Instruct-AWQ and Gemma-3-12B-IT runs reproduce the central HotpotQA frontier. TRACE-style decoupling recovers 96.5-100.0% better-plain resolution across the reported settings. Human validation separates three meanings of Tie: correct equivalence Tie, calibrated soft-boundary Tie, and resolution-destroying Tie on validated quality gaps. We frame debiasing as a measurement intervention whose bias suppression, resolution retention, Tie cost, and protocol cost must be reported jointly. The supplementary artifact contains benchmark splits, prompts, raw judge outputs, validation summaries, and analysis.
Read the full abstract
Human-Computer Interaction
ForkSCOPE: Charting the Agentic Garden of Forking Paths
Even with a fixed dataset and research question, data analysis involves many defensible decisions. Understanding how these choices influence the results is scientifically important but remains challenging. Crowdsourcing and agentic AI can generate hundreds of end-to-end analyses, but scaling generation alone can create a processing bottleneck and an analytic “black hole.” A common workaround is to impose a shared fixed decision taxonomy, which can limit insight and understate uncertainty. We present ForkSCOPE, a human-AI collaboration framework that induces structure bottom-up from the code corpus of end-to-end analyses, without a taxonomy fixed before or after generation, so the organization and evaluation of the garden can scale with the corpus. ForkSCOPE surfaces the charted garden of forking paths through a human-AI collaboration pipeline and an evidence-linked interactive viewer for steering and verification: it spotlights organically identified forks and structures and produces a derived taxonomy and decision map compatible with existing multiverse tools.
Read the full abstract
Machine Learning
Beyond the Query: Do Retrieval Signals Improve Adaptive Multimodal RAG Routing?
Adaptive RAG often uses retrieval-time signals to decide whether another retrieval, reranking, or multimodal step should run. We ask whether these signals add routing value once the query itself is already known. Across document, audio, and video RAG, we compare matched query-only and query+retrieval routers while holding the optional actions, router family, training procedure, and evaluation fixed. On the held-out final evaluation, adding the tested retrieval signals does not produce a reliable routing improvement over the query-only baseline. Some retrieval signals are associated with whether a later step will help, but that predictability does not consistently lead to bet- ter RUN/SKIP decisions. The main lesson is therefore methodological: retrieval-state features should not be credited with routing value unless they improve over a matched query-only control. Our results do not show that routing or retrieval state is generally useless; they show that the incremental value of retrieval signals must be demonstrated rather than assumed.
Read the full abstract
Artificial Intelligence
LifeFuse-Mem: Lifecycle-Aware State Fusion Against Temporary Overwriting for Long-Term Memory
Long-running LLM agents require memory mechanisms that maintain coherent internal states across interactions. We study a lifecycle-labeled memory setting in which write episodes provide lifecycle metadata during training, and phase-aware readout is used during evaluation. This setting reflects the need to distinguish information that should remain influential across future interactions from information that should affect only the current context. A mismatch between these lifecycles can cause temporary information to overwrite durable knowledge, leading to behavioral drift in persistent agents. Within this setting, we introduce LifeFuse-Mem, a lifecycle-aware neural memory framework that separates information according to its temporal commitment. LifeFuse-Mem uses dedicated memory components and lifecycle-aware updates to allow stable and transient knowledge to evolve locally without converting temporary context into durable state. On the controlled anti-overwrite benchmark, LifeFuse-Mem improves acquisition-controlled retention and reduces temporary overwrite; on two public long-memory benchmarks, it remains broadly competitive. These results suggest that explicit lifecycle signals can help diagnose and mitigate overwrite in compact online memory.
Read the full abstract
Machine Learning
Observation-Anchored Selective Assimilation for Longitudinal Tumor-State Proxy Forecasting in Post-Treatment Glioma
Post-treatment MRI in patients with glioma provides serial observations for updating patient-specific tumor-state proxy estimates, but variable appearances and trajectories complicate forecasting. We formulate forecasting as an observation-aware digital-twin update in which an intermediate observation anchors the patient-specific state. Among 203 patients and 594 follow-up time points, a predefined no-new-treatment criterion retained 120 of 236 candidate triplets, split into 81/24/15 training/validation/test triplets at the patient level. Each time point was represented by a continuous voxel-wise tumor-state proxy map in [0,1] derived from MRI lesion labels. A SegMamba-based single-step forecaster predicted update proposals from multimodal source-state tensors. Observation-Anchored Selective Assimilation (OASA) retained the observed intermediate proxy as the state anchor and selectively applied updates through a validation-selected tiered case-level rule and voxel-wise soft gate. We compared initial-scan forecasting, rollout without assimilation, latest-observation persistence, direct prediction, OASA, OASA + calibration, and morphological dilation. Checkpoints, OASA rules, and calibration thresholds were selected using validation data only. Across three seeds on 15 held-out test triplets, OASA maintained Dice at $\tau$ = 0.2 comparable to persistence (0.6071 $\pm$ 0.0025 vs. 0.6070) while yielding numerically higher Dice at $\tau$ = 0.5 (0.4269 $\pm$ 0.0079 vs. 0.3981), with a small RMSE increase. Calibration increased Dice at $\tau$ = 0.2 to 0.6178 $\pm$ 0.0025, increased false-positive (FP) support (11,836$\rightarrow$18,663), and reduced false-negative (FN) support (22,107$\rightarrow$17,536). This reflects near-threshold support calibration rather than improved biological predictive capability. Code is publicly available at https://github.com/jsudg436/longitudinal-proxy-forecasting.
Read the full abstract
Mesoscale and Nanoscale Physics
Chirality in Condensed Matter: Symmetry, Waves, and Quasiparticles
Chirality has become a recurring concept throughout condensed-matter physics, appearing in contexts ranging from optical activity and chiral phonons to magnetic excitations and hybrid quasiparticles. As its use has expanded, however, the concept has often become intertwined with related notions such as angular momentum, polarization, helicity, and nonreciprocity, obscuring its precise symmetry-based meaning. Although chirality is universally associated with broken spatial-inversion ($\mathcal{P}$) symmetry and preserved time-reversal ($\mathcal{T}$) symmetry, its physical manifestation and quantitative characterization strongly depend on the system and phenomenon under consideration. In this review, we examine chirality across photons, phonons, magnons, and hybrid excitations. We show that, while no universal measure of chirality exists, different physical systems admit different $\mathcal{P}$-odd and $\mathcal{T}$-even quantities that characterize specific chiral phenomena. We further argue that chirality is often best understood through chirality-selective interactions between waves, matter, and quasiparticles rather than as an intrinsic property of isolated excitations. From this perspective, hybridization provides a particularly promising setting for the emergence, transfer, and control of chirality in condensed-matter systems.
Read the full abstract
Robotics
FoldNet++: a Large-Scale Synthetic Dataset for Robotic T-Shirt Folding and Unfolding
Due to the highly deformable nature of garments, training a generalizable policy for robotic T-shirt folding and unfolding remains a significant challenge. In this work, we present a large-scale synthetic dataset for robotic T-shirt folding and unfolding, covering 6 robotic embodiments, 1K T-shirts, 1K environmental assets, and 120K episodes with rich annotations, which can be used to train a wide range of manipulation policies. We first follow the FoldNet pipeline to generate a large-scale dataset of physically simulatable T-shirts with diverse appearances and annotated semantic keypoints. Based on these semantic keypoints, we then generate manipulation demonstrations for different robotic embodiments through a unified rule-based framework. We use these demonstrations to train visuomotor policies, and experimental results demonstrate that models trained solely on our synthetic data can achieve over 90% end-to-end task success rates when directly deployed to unseen real-world environments and previously unseen T-shirts from arbitrary initial configurations. Project URL: https://pku-epic.github.io/FoldNetXX/.
Read the full abstract
Audio and Speech Processing
VoxTubeS: Distributable Speaker-Anonymized Synthetic Speech Corpora and Their Analysis
Large speech corpora support research, but recordings can expose speaker identity because voice remains a recognizable biometric. Meanwhile, speech data derived from media can be difficult to redistribute reliably. We present VoxTubeS, a family of speaker-anonymized synthetic speech corpora designed for redistribution, comprising three method families and seven variants derived from the VoxTube corpus, which is distributed under CC BY-NC-SA 4.0, using 1.29M quality-filtered English utterances from 1,511 speakers. The synthesis methods span voice conversion, latent-space anonymization, and controllable text-to-speech. We evaluate VoxTubeS using utterance-level unlinkability, conversation-level linkability and singling-out, downstream speaker verification, linguistic consistency, speaker diversity, and fairness metrics for gender and accents. Our comprehensive analysis exposes a complex trade-off: stronger identity suppression often reduces linkability but sacrifices utility and population diversity, whereas speaker consistency training improves both utterance- and conversation-level privacy while retaining comparable utility and a broader speaker space. Fairness varies independently of aggregate performance. No method dominates; VoxTubeS therefore treats corpus construction as a choice among operating points that balances privacy, utility, diversity, fairness, and responsible redistribution under the source license.
Read the full abstract
Computer Vision
An End-to-End Automated Pipeline for Controllable Crack Data Synthesis
Vision-based crack inspection depends on segmentation networks whose reliability depends on the quantity, diversity and label quality of their training data. Pixel-level annotations are costly, and crack images of specific structures are scarce. Generative augmentation can supply additional data, but existing methods address isolated steps. They reuse annotated masks, offer limited control over crack geometry, and adopt the conditioning mask as the label without checking it. This paper presents an end-to-end pipeline that produces labelled crack data without manual annotation and assesses the reliability of these data and of the detectors trained on them. Procedurally sampled Bézier skeletons with guaranteed geometric properties are converted into crack masks by a generative adversarial network (GAN). A dual-ControlNet Stable Diffusion model renders the masks as crack images, either on text-described surfaces or on user-provided backgrounds. An ensemble of segmentation networks trained on real images combines its agreement with the inherited label and its internal disagreement into a pixel-wise label confidence. This confidence weights the training loss instead of removing samples with a threshold. The trained detectors are evaluated with image-space probability of detection (POD) and calibration analyses. On CRACK500 and CrackTree200, the pipeline improves five segmentation networks over conventional, diffusion-based and flow-matching-based augmentation, and on CRACK500 confidence weighting yields a higher accuracy than threshold filtering at every tested threshold. On CRACK500, the crack width that U-Net detects with 90% probability at 95% confidence decreases from 8.0 to 4.3 pixels, and the expected calibration error decreases from 14.2% to 9.6%.
Read the full abstract
Instrumentation and Detectors
An integrated readout system for parallel-plate avalanche counter and multi-wire drift chamber at HIAF-HIRIBL
A newly developed, highly-integrated multi-channel front-end readout system – FEAM-256 – is presented for use with position-sensitive gaseous detectors, including parallel-plate avalanche counters (PPACs) and multi-wire drift chambers (MWDCs). The system's position resolution was characterized using both an $\alpha$ source and cosmic-ray muons. Intrinsic position resolutions of 320 $\mu$m for the PPAC, and 424 $\mu$m for the MWDC were achieved. Designed specifically for integration into the data-acquisition infrastructure at the High-Rigidity radioactive Ion Beam Line (HIRIBL) of China's High Intensity heavy-ion Accelerator Facility (HIAF), FEAM-256 enables seamless incorporation of PPAC and MWDC detectors into the HIRIBL experimental setup.
Read the full abstract
Analysis of PDEs
Regularity theory and low Mach number limit for the fractional Euler-alignment system
We study the compressible Euler-alignment system with pressure under a singular pressure scaling, where the hypersingular communication weight induces a fractional alignment operator of order $2\alpha$, $0<\alpha<1$. The scaling corresponds to a large-time and small-velocity regime and leads to a low Mach number problem in which the density is forced to remain close to a constant state. Our main result is a uniform regularity theory for this scaled pressure system. We establish uniform estimates with respect to the scaling parameter and construct global strong solutions near the constant state. A key feature of the analysis is that, in the low-order fractional regime $0<\alpha\le\frac12$, the estimates close under the lower Sobolev condition $s>\frac d2+1-2\alpha$, gaining $\alpha$ derivatives over the threshold $s>\frac d2 + 1 - \alpha$ arising from a direct use of the fractional alignment dissipation. This is achieved by combining refined commutator estimates for the singular alignment operator with the density dissipation induced by the pressure scaling. As an application of the uniform estimates, we justify the low Mach number limit toward the incompressible Navier–Stokes system with fractional dissipation. For general small, possibly ill-prepared initial data, a Helmholtz decomposition combined with dispersive estimates for the acoustic component yields subsequential strong convergence locally in space-time to a distributional solution of the limiting system. For well-prepared initial data, a relative-energy argument further identifies the limit with a prescribed sufficiently regular solution and yields global strong convergence in the fractional dissipation norm.
Read the full abstract
Mathematical Physics
Quasi-exactly solvable deformations of quantum systems associated with exceptional orthogonal polynomials
Quasi-exactly solvable (QES) deformations of harmonic and singular oscillators have been widely studied via a range of approaches. In this paper, we obtain families of new QES deformations of solvable quantum systems associated with exceptional orthogonal polynomials (EOPs). The construction builds upon the theory of Darboux-Crum transformations and the classification of exactly solvable quantum systems associated with EOPs of Hermite type. It is shown that the deformations break the exact solvability of the undeformed systems and introduce model parameters into the deformed systems that permit the existence of a finite number of polynomial solutions whose roots satisfy systems of algebraic equations. The new families presented and studied consist of deformations of quantum systems related to Hermite EOPs of type III with arbitrary codimensions. We present polynomial and rational deformations and analyze, in each case, the conditions for quasi-exact solvability in terms of Bethe ansatz equations and parameter constraints. In general, the structures of the underlying polynomial solutions are no longer associated with well-known classical orthogonal polynomials. So for the general cases, we mainly focus on presenting the new approach as well as the Bethe ansatz equations and the constraints for model parameters. As applications, we construct particular families of QES deformations related to solvable models allowing one, two, and up to four gaps, and obtain the closed form expressions for their wavefunctions and spectra. We analyze the existence of QES solutions in the spaces of model parameters, providing information on the number of solutions for given parameters.
Read the full abstract
Functional Analysis
Polynomial growth of Bohnenblust–Hille constants on the Hamming cube
We prove that the Bohnenblust–Hille constants for Walsh polynomials on the Hamming cube grow at most polynomially in the degree. More precisely, there is an absolute constant $K$ such that every $f :\{-1,1\}^{n} \to \mathbb{C}$ of degree at most $m$ satisfies $$ \left(\sum_{|S|\le m}|\widehat f(S)|^{2m/(m+1)}\right)^{(m+1)/(2m)} \le Km^{27}\|f\|_\infty. $$ The estimate is uniform in the dimension. The exponent $27$ is not optimized.