Forskningsradar

Science Journals

Peer-reviewade publikationer — 56233 artiklar

A Secure, Manifest-Based Framework for Delegated Privilege Promotion
arXiv:2605.28991v1 Announce Type: new Abstract: Large-scale enterprise software systems commonly run as unprivileged service accounts to enforce least privilege, yet still depend on a small set of privileged components -- such as executables with elevated ownership, permissions, or capabilities -- for narrowly scoped operations. This creates a persistent security and operational conflict during maintenance. Automated patching tools running without elevated privileges cannot safely update privileged components without either executing the entire patch with full administrative rights or requiring manual administrator intervention. We present a secure, manifest-based infrastructure for delegated promotion of privileged software components, deployed in production as part of a large-scale enterprise database system serving both cloud and on-premises installations. The design centers on a minimal privileged mediator that validates cryptographically protected metadata and allows an unprivileged process to promote only vendor-approved files. The system explicitly mitigates Time-of-Check-to-Time-of-Use (TOCTOU) attacks using file-descriptor-bound validation and promotion, supports offline key rotation and revocation, and enables zero-downtime self-update via atomic replacement.
TelecomTS: A Multi-Modal Observability Dataset for Time Series and Language Analysis
arXiv:2510.06063v3 Announce Type: replace Abstract: Modern enterprises generate vast streams of time series metrics when monitoring complex systems, known as observability data. Unlike conventional time series from domains such as climate, observability data are zero-inflated, highly stochastic, and exhibit minimal temporal structure. Despite their importance, observability datasets remain underrepresented in public benchmarks due to proprietary restrictions and privacy concerns. Existing datasets are often anonymized and normalized, removing scale information and limiting their use for tasks such as anomaly detection, root cause analysis, and multi-modal reasoning. To address this gap, we introduce TelecomTS, a large-scale observability dataset derived from a 5G telecommunications network. TelecomTS features heterogeneous, de-anonymized covariates with explicit absolute scale information and provides a diverse suite of downstream tasks, including anomaly detection, root cause analysis, and multi-modal question-answering. Benchmarking state-of-the-art time series, language, reasoning, and multi-modal foundation models reveals that existing approaches struggle with the abrupt, noisy, and high-variance dynamics characteristic of observability data. Our experiments further underscore the importance of preserving covariates' absolute scale, emphasizing the need for foundation time series models that natively leverage scale information for practical real-world observability applications. The code is available at: https://github.com/Ali-maatouk/TelecomTS.
ElegantVLA: Learning When to Think for Efficient Vision-Language-Action Models
arXiv:2605.29438v1 Announce Type: new Abstract: Vision-Language-Action (VLA) models are a powerful paradigm for generalist robotic control. However, their high computational cost and limited control frequency hinder real-time robotic manipulation, especially when large vision-language backbones and iterative action heads run at every control step. Existing VLA acceleration methods often optimize individual components or rely on fixed acceleration rules, treating different control steps with largely fixed computation and overlooking the non-uniform reasoning demands of sequential embodied control. Inspired by human motor control, where cognitive and feedback resources concentrate on goal-sensitive stages, we argue that VLA models should learn when to invest full computation and when to reuse prior computation. We propose ElegantVLA, a plug-in phase-adaptive inference framework that accelerates VLA models through intra-model dynamic compute scheduling. ElegantVLA introduces a lightweight scheduler that observes temporal representation similarity, robot-motion cues, and episode progress to jointly allocate computation across the vision encoder, LLM, and action head. For perception-language reasoning, the scheduler selects a five-level Vision-LLM compute mode, from full recomputation to multi-step temporal reuse, based on visual-language representation stability. For action generation, it selects a three-level denoising mode, reusing intermediate denoising states during stable motion while preserving full refinement for goal-sensitive stages. By coordinating these decisions, ElegantVLA offers a general acceleration framework for modern VLA pipelines with explicit action-generation modules, without modifying or retraining the base model. Experiments on GR00T and CogACT achieve up to 2.55x and 3.77x speedup, and on six real-world GR00T tasks ElegantVLA cuts computation by 2.18x while raising control frequency from 13.8 Hz to 26.3 Hz.
Can It Reach the Generator? Investigating the Survival of Prompt-Injection Attacks in Realistic RAG Settings
arXiv:2605.28017v2 Announce Type: replace Abstract: Recent generative engine optimisation (GEO) research has shown that prompt-injection attacks can push a target product to the top of an LLM's recommendation list, with the strongest attacks reporting around $80\%$ success and raising serious security concerns about RAG-based recommendation. However, these results assume the attacked document is always fed directly to the generator, bypassing the retriever and reranker. This is unrealistic: in deployed RAG systems, the attack modifies the document content, which can in turn change whether the document is retrieved and reranked highly enough to reach the generator at all. In this paper, we re-evaluate seven GEO attacks under a realistic three-stage pipeline (retriever\,$\to$\,LLM reranker\,$\to$\,LLM generator). We find that prior protocols substantially overstate attack effectiveness: gradient-based and instruction override attacks largely collapse before reaching the generator, and only LLM-driven prompt injections remain effective end-to-end. Our analysis further reveals that current GEO attacks are easily detectable: a lightweight prompt-injection guard finetuned on a small attack dataset already detects every attack. Our code and data are available at https://github.com/ielab/geo_injection_rag_survival.
Meta-Quantum Ensemble Framework for Robust Network Intrusion Detection
arXiv:2605.28879v1 Announce Type: cross Abstract: Intrusion Detection Systems (IDSs) must maintain high detection sensitivity while operating under strict false-positive constraints, a challenge intensified by class imbalance and heterogeneous IoT traffic. This work investigates whether heterogeneous quantum learners can provide useful and non-redundant decision information for IDS tasks. We study Quantum Support Vector Machines (QSVMs) and Quantum Neural Networks (QNNs), which rely on different learning mechanisms and exhibit distinct prediction behaviors. To combine these models, we propose the System-Level Meta-Quantum Ensemble (MQE), a hybrid quantum-classical framework that fuses QSVM and QNN outputs using a Random Forest meta-learner. The meta-learner captures agreement and disagreement patterns between the quantum branches to improve prediction stability and detection performance. Experiments on TON IoT and CICIDS2017 show that MQE improves selected performance, low-FPR, and reliability metrics over several standalone quantum learners, with gains depending on the dataset, metric, and fusion representation. The results highlight meta-level fusion as a practical strategy for building more reliable QML-based IDS pipelines.
A Training-Time Diagnostic for Generalization via the Log-Alignment Ratio
arXiv:2605.28975v1 Announce Type: new Abstract: We study the log-alignment ratio (LAR), a measure of parameter-activation alignment, introduced in parameterization theory. We reformulate it as the overlap between a weight spectrum $p$ of the normalized squared singular values of a matrix and an activation spectrum $q$ of the normalized squared projections of inputs onto its singular directions. We show that unembedding LAR tracks the transition between memorization and generalization in two different settings by capturing the spread of $p$ and $q$ during training. In grokking, LAR predicts the effective dimension of the learned function: $k \approx n^{2(1-\text{LAR})}$, where $n$ is the input dimension of the matrix. In 3B-parameter language model pre-training, its deviation from a non-overfitting baseline tracks the generalization gap, and its rate of decline increases as overfitting approaches. LAR is computable from quantities available during the forward pass with negligible computational overhead, and requires no held-out validation data.
Fingerprinting Inference Systems of Large Language Models
arXiv:2605.29979v1 Announce Type: new Abstract: The behavior of LLMs does not depend solely on the model itself. Components of the inference system, such as the inference engine, attention backend, and hardware platform, subtly influence how inputs are processed. These components differ in their implementations and thereby induce small numerical deviations across systems when running the same model. While prior work has established the theoretical existence of such deviations, their security implications have remained unexplored. In this paper, we show that these deviations are characteristic of specific components and propagate to observable textual outputs, exposing the inference system to any party that can query the model. Building on this observation, we introduce a fingerprinting method that analyzes the prompt-response behavior of LLMs to identify components of the inference system. Our empirical evaluation demonstrates that the inference engine, attention backend, and underlying hardware platform can be identified reliably, even when the LLM is operated at non-zero temperature. We show that preventing fingerprinting is fundamentally hard, as it would require eliminating numerical differences between hardware and software stacks. We therefore propose partial mitigations and discuss their impact.
Paper Agents, Paper Gains: An Empirical Analysis of DeFi Investment Agents
arXiv:2605.29174v1 Announce Type: new Abstract: DeFi investment agents, systems that use AI for autonomous on-chain trading, have attained over USD 3 billion in combined token valuations since late 2024. We survey over 1,900 AI-tagged crypto projects, filter to investment-focused agents, and curate 10 representative projects spanning strategy and observability dimensions. We then conduct a deep-dive architectural analysis of two prominent agent frameworks, ElizaOS and Virtuals Protocol, and a quantitative on-chain performance analysis of 11 Solana-based agent treasuries with publicly attributable trading activity, covering 925,323 token holders. We find that current deployments remain early and heterogeneous: (1) in our sample, many projects do not yet provide clear evidence of autonomous trade execution, and developer interviews suggest that many visible deployments remain basic API integrations; (2) agent treasuries retain over USD 30M in paper gains while token holders collectively lost USD 191.7M, with the top 1% of wallets capturing 81.4% of all gains (USD 1.81B); (3) token valuations are weakly connected to treasury fundamentals, with market-cap-to-AUM ratios exceeding 10,000x versus below 1x for established DeFi protocols; and (4) aggregate user gains peaked at USD 2.4B before declining to net losses, with median returns negative on every platform and tokens declining 93% on average from all-time highs. We interpret these outcomes as characteristic of a permissionless, first-generation market in which open infrastructure enables rapid experimentation but also allows naive or speculative agents to launch before robust standards for autonomy, performance, and stakeholder alignment emerge. We therefore propose a maturity framework along three dimensions: autonomous execution, risk-adjusted profitability, and stakeholder alignment, to characterize the gap between current deployments and future investment-grade agent systems.
Near surface donor-acceptor pairs in hydrogenated homoepitaxial diamond nanolayers
arXiv:2605.29492v1 Announce Type: cross Abstract: Hydrogen-terminated diamond is known for its p-type surface conductivity, which arises from a near-surface hole accumulation layer induced by adsorbed acceptor species. Here, we demonstrate that these surface acceptors also form optically active donor-acceptor pairs (DAP) with substitutional nitrogen donors in diamond. The insertion of a nominally undoped CVD interlayer between a nitrogen-rich HPHT substrate and a hydrogen-terminated surface enables the precise tuning of the donor-acceptor separation with nanometer precision. Radiative DAP recombination appears as bright, spectrally narrow lines whose intensity, energy, and decay dynamics depend systematically on interlayer thickness. Individual lines show single-photon statistics, while ensembles exhibit strong polarization anisotropy reflecting the planar donor-acceptor geometry. These findings reveal an optical counterpart of hydrogen-induced surface transfer doping in diamond and establish a surface-defined, nanometer-tunable platform for engineering DAP-based quantum emitters.
Extending QuAK with Nested Quantitative Automata
arXiv:2605.12418v4 Announce Type: replace Abstract: Quantitative automata (QAs) extend finite-state automata on infinite words with weighted transitions to specify quantitative system properties. However, their finite weight sets rule out properties like average response time, where response times can be arbitrarily large. Nested quantitative automata (NQAs) overcome this limitation: a parent automaton spawns child automata to compute unbounded values over finite infixes and aggregates them into a final result. Despite this expressiveness, NQAs have lacked practical tool support to date. We close this gap by extending the Quantitative Automata Kit (QuAK), a software tool for QA analysis, to support NQAs. Our core contribution is implementing a suite of flattening procedures that reduce NQAs to QAs, leveraging QuAK's existing decision procedures. These reductions preserve the answers to threshold decision problems, while allowing users to specify properties in the more expressive NQA formalism. The tool handles all combinations of parent aggregators (including limits and averages) and child functions (extrema and monotonic or bounded summations) for which emptiness and universality are known to be decidable. Experiments on response-time and resource-consumption benchmarks demonstrate QuAK's effectiveness.
Nanoparticle manipulation with a carbon fiber tip in an electron microscope for $\mu$-SQUID magnetometry
arXiv:2605.29550v1 Announce Type: cross Abstract: We report a carbon-fiber-tip based nanomanipulation system integrated into a scanning electron microscope for individual nanoparticle (NP) manipulation on a surface. Electrochemically etched amorphous carbon fiber tips with excellent mechanical rigidity and sub-100 nm apex radii effectively reduce the van der Waals adhesion and enable reliable positioning of about 100 nm size NPs with about 100 nm precision. This system combines a piezoelectric bimorph for vertical tip motion, a four-quadrant piezo-tube for two-dimensional fine tip control and a two-dimensional piezoelectric walker for coarse lateral translation. Using this setup, we successfully position single Fe$_3$O$_4$ magnetic NPs on micron sized superconducting quantum interference devices for optimal magnetic coupling between them and probe a NP's magnetism.
Automated design of soft-rigid hybrid robots for dynamic locomotion
arXiv:2605.29389v1 Announce Type: new Abstract: Rigid-bodied robots often lack compliance needed to adapt to unstructured environments, while fully soft robots, though highly adaptable, struggle with scalability and load capacity. In nature, musculoskeletal systems balance strength and flexibility by integrating hard and soft tissues. Inspired by this principle, we present an automated design method for soft-rigid hybrids that optimizes a freeform soft-body shape, a stiff truss layout, and multi-channel actuation. Our differentiable simulator couples the material point method (MPM) for deformable bodies with extended position-based dynamics (XPBD) for truss elements, enabling gradient-based search. The optimization generates truss skeletons that transmit actuation forces to the soft body. We fabricate the optimized design and evaluate it on a walking task. Experiments reproduce the walking mode predicted by the optimization, which does not emerge without the skeleton. Modal analysis further suggests that the skeleton enables deformation modes near the actuation frequency that promote effective stride generation.
A Progress-Aware Leader-Follower Midair Docking System for Dual-Drone Aerial Manipulation
arXiv:2605.29410v1 Announce Type: new Abstract: Reliable midair docking between small unmanned aerial vehicles (UAVs) is essential for modular aerial cooperation and manipulation, but it requires precise relative-pose control and repeatable platform under tight thrust and payload constraints. We present a dual-drone docking platform where two quadrotors operate in a leader-follower formation and dock using a lightweight modular frame with passive magnetic latching. A progress-aware mission supervisor manages phase transitions: approach, alignment, capture, and settle. This platform integrates a complete hardware-software stack (ROS 2 with Crazyflie/PX4 interfaces) and synchronized logging for benchmark evaluation. We evaluate the platform in simulation and real-world experiments using quantitative metrics such as formation error, baseline and yaw consistency, docking success rate, time-to-dock, and failure-mode statistics. The platform enables statistically grounded comparison of docking supervision and synchronization strategies and provides a practical testbed for modular aerial cooperation and repeatable midair aerial manipulation.
Label-Free Reinforcement Learning via Cross-Model Entropy
arXiv:2605.29009v1 Announce Type: new Abstract: Post-training large language models with reinforcement learning is bottlenecked by the reward signal. Existing approaches require either ground-truth verifiable rewards, restricting training to domains with automatic correctness checks (e.g., mathematics, code execution), or human preference labels, which are expensive to collect and prone to reward hacking. Recent label-free methods replace ground-truth verifiers with self-referential signals like majority voting or token entropy over a model's own outputs, but risk reinforcing a model's own errors. In this work we propose Cross-Model Entropy (CME), the mean log-likelihood of a generator's response under a separate verifier model, as a label-free reward signal for RL post-training. CME is continuous, training-free, and grounded in the principle that responses a verifier finds unsurprising are likely correct or high quality. Because the verifier is independent of the generator, the signal cannot be gamed through self-consistency. We integrate CME into GRPO with no other changes to the training loop, extending label-free RL to open-ended instruction following -- a regime where self-referential signals are inapplicable or poorly suited. On open-ended instruction following (UltraFeedback prompts, evaluated on AlpacaEval 2.0), CME rewards beat the untrained base in head-to-head LLM-as-Judge comparisons across four model families (Qwen, Llama, Gemma, OLMo) and three training regimes (pretrained, SFT, and instruction-tuned), with tie-adjusted win rates ranging from 52.5% to 71.4%. Code will be released upon publication.
Structure-Preserving Discretization and Model Reduction for Energy-Based Models
arXiv:2507.21552v2 Announce Type: replace Abstract: We investigate discretization strategies for a recently introduced class of energy-based models. The model class encompasses classical port-Hamiltonian systems, generalized gradient flows, and certain systems with algebraic constraints. Our framework combines existing ideas from the literature and systematically addresses temporal discretization, spatial discretization, and model order reduction, ensuring that all resulting schemes are dissipation-preserving in the sense of a discrete dissipation inequality. For this, we use a Petrov--Galerkin ansatz together with appropriate projections. Numerical results for a nonlinear circuit model, the Cahn--Hilliard equation, and a doubly nonlinear parabolic equation illustrate the effectiveness of the approach.
Trajectory Constraints for Imaging Inverse Problems
arXiv:2605.29012v1 Announce Type: new Abstract: Diffusion-based and iterative methods have become effective tools for solving imaging inverse problems. Their reconstruction process naturally forms a trajectory of intermediate estimates. Although these intermediate estimates define a reconstruction trajectory, most methods do not explicitly regularize the transitions between consecutive states. To address this limitation, we introduce TRACE, a training-free TRAjectory-Constrained rEconstruction framework that stabilizes the reconstruction path by coupling adjacent states along the trajectory. This gives a trajectory-level model that can be interpreted as a sequence of proximal updates. Since the exact proximal update is generally intractable, we approximate it with a neural mapping. This yields a diffusion-like reconstruction process with an explicit coupling between neighboring states. We provide a stability analysis showing that temporal coupling bounds trajectory variation and that this control is preserved under untrained network updates. Experiments on linear and nonlinear image reconstruction tasks show that TRACE improves reconstruction quality. Trajectory-level analyses and ablations confirm that temporal coupling directly affects state transitions along the reconstruction path.
When and How Human Curation Backfires: Preference Alignment under Multi-Model Self-Consuming Loop
arXiv:2605.29267v1 Announce Type: new Abstract: Foundation models are increasingly trained on synthetic data generated by prior model iterations rather than exclusively on real data. This self-consuming training paradigm can lead to model collapse, divergence, or bias amplification. Recent work (Ferbach et al., 2024) shows that incorporating human curation into the loop can steer a self-consuming model toward human-aligned behavior, but these analyses focus on a single, isolated model that solely consumes its own outputs. In practice, however, models often interact and train on input-output pairs produced by other models. This paper studies self-consuming training in the multi-model regime. We first formalize a framework for interacting self-consuming models and characterize when the resulting dynamical system converges to a stable point. We then examine how human curation of one model affects its own alignment (self-influence) and how such effects propagate to other models (cross-influence). Unlike isolated settings where human curation always enhances model alignment, we show that cross-model interactions can dampen or even invert this effect, ultimately degrading long-term alignment.
Effect of increased DCR on the detection of minimum-ionizing particles with SiPMs
arXiv:2605.29600v1 Announce Type: new Abstract: Radiation damage to a Silicon Photomultiplier (SiPM), as it occurs during the lifetime of the planned CMS high-granularity calorimeter detector, increases the dark current and degrades the signal-to-noise separation for minimum-ionizing particles (MIPs) and their detection efficiency. To investigate these effects, a plastic scintillator tile air-coupled to a SiPM is used to detect MIPs from a 90Sr source, in a single-channel design similar to the tiles of the CMS high-granularity calorimeter upgrade. We compared the SiPM responses after actual radiation exposure with responses simulated in the laboratory by increasing the dark-count rate (DCR) through optical illumination with an LED light source. This optical method induces no structural damage or deep defects, thus isolating the effect of increased dark-count rate. Our results show that both radiation-induced damage and LED-induced dark-count rate increases lead to similar reductions in the MIP signal and the signal-to-noise ratio. This indicates that the primary factor for the performance degradation is the elevated dark-count rate itself, rather than additional defects in the silicon. The results demonstrate that the key effects of radiation damage on SiPMs can be effectively replicated using controlled optical illumination, providing a practical and easily accessible approach for evaluating and optimizing SiPM performance under radiation-like conditions in the laboratory.
ESPO: Early-Stopping Proximal Policy Optimization
arXiv:2605.29860v1 Announce Type: new Abstract: When a large language model under reinforcement learning commits a wrong reasoning step early in a trajectory, standard algorithms force it to keep generating until the maximum horizon, spending compute on tokens that never receive positive reward and polluting advantage estimates with post-failure noise. We propose ESPO (Early-Stopping Proximal Policy Optimization), which detects trajectory failure on-the-fly and terminates rollouts early. At each generation step, ESPO computes a surrogate regret using only the logits already computed during sampling, and terminates when the smoothed cumulative regret significantly exceeds its estimated values. Truncated trajectories are treated as absorbing failure states with a terminal reward, concentrating negative temporal-difference (TD) errors near the detected failure step without any additional reward model or human annotation. On DeepSeek-R1-Distill-Qwen-7B trained for mathematical reasoning, ESPO surpasses PPO on AIME~2024 (46.28% vs. 45.25%), AMC~2023 (85.83% vs. 82.94%), and MATH-500 (87.42% vs. 85.43%), while saving more than 20% rollout tokens cumulatively.
KairosAgent: Agentic Time Series Forecasting with Fused Semantic Reasoning
arXiv:2605.30002v1 Announce Type: new Abstract: Cross-domain multimodal time series forecasting is a challenging task, requiring models to integrate precise numerical comprehension, cross-domain semantic understanding, and effective multimodal fusion. Existing approaches either build Time Series Foundation Models (TSFMs) from scratch or leverage pretrained Large Language Models (LLMs). However, TSFMs often overlook semantic understanding and lack the ability to perform future-oriented semantic reasoning, and LLMs struggle with numerical comprehension and accurate quantitative forecasting. To overcome these limitations, we propose KairosAgent, a novel agentic framework for multimodal time series forecasting, including an LLM-based reasoner and a TSFM-based forecaster. KairosAgent unifies textual reasoning and numerical forecasting by dynamically invoking analytical tools to enhance the numerical understanding and semantic reasoning capabilities of LLMs. The reasoning results are subsequently fused into the TSFM pipeline, enabling more accurate and reliable future predictions. To further improve the reasoning, we curate a large-scale corpus of high-quality trajectories, alongside a reinforcement learning from forecasting paradigm with multi-turn refinement and turn-level credit assignment. Experiments demonstrate that KairosAgent achieves superior zero-shot forecasting performance while maximizing the utility of pretrained LLMs and TSFMs, presenting a promising direction for efficient and interpretable time series agents. The project page is at https://foundation-model-research.github.io/KairosAgent .
A Survey of OAM-Encoded High-Dimensional Quantum Key Distribution: Foundations, Experiments, and Recent Trends
arXiv:2512.11286v2 Announce Type: replace-cross Abstract: High-dimensional quantum key distribution (HD-QKD) enhances information efficiency and noise tolerance by encoding data in large Hilbert spaces. The orbital angular momentum (OAM) of light provides a scalable basis for such encoding and supports high-dimensional photonic communication. Practical OAM-based implementations remain constrained by challenges in state generation, transmission, and detection. This survey offers a consolidated overview of OAM-encoded HD-QKD, outlining fundamental principles, representative experiments, and system-level limitations. Recent progress in hybrid encodings, mode sorting, adaptive optics, and TF, CV, MDI, and DI frameworks is summarized with emphasis on practical feasibility.
Understanding the Ability of LLMs to Handle Character-Level Perturbation
arXiv:2510.14365v4 Announce Type: replace Abstract: This work investigates the resilience of contemporary large language models (LLMs) against frequent character-level perturbations. We examine three types of character-level perturbations including introducing numerous typos within words, shuffling the characters in each word, and inserting a large number of invisible characters into the text. Surprisingly, even under severe perturbation, such as shuffling nearly all words character-wise to produce text that is almost unreadable to humans, or inserting invisible characters which are several times more than the visible ones as noise, many LLMs still maintain notable performance. We explore the underlying causes of this robustness and find that LLMs exhibit remarkable resilience to chaotic segmentation and fragmented tokenization. Furthermore, we examine the mechanisms by which LLMs remove perturbations to correctly comprehend text, including both implicit and explicit mechanisms for character-level perturbation. We hope that our findings on the low-level robustness of LLMs will unveil their inherent architectural strengths, reveal the potential risks of their misuse, and inform the reliable deployment of LLMs across diverse application scenarios.
One-Positron Quantum Cyclotron
arXiv:2605.08147v2 Announce Type: replace Abstract: A one-positron quantum cyclotron is realized with a single positron suspended indefinitely in the magnetic field of a Penning trap. This opens the way to quantum measurements of the positron magnetic moment, to a precision much higher than attained with classical cyclotron motion. Comparing the magnetic moments measured using positron and electron quantum cyclotrons should provide the most stringent test of the fundamental CPT invariance of the Standard Model of particle physics in the lepton sector.
Diagnosing and Correcting Concept Omission in Multimodal Diffusion Transformers
arXiv:2605.14270v2 Announce Type: replace Abstract: Multimodal Diffusion Transformers (MM-DiTs) have achieved remarkable progress in text-to-image generation, yet they frequently suffer from concept omission, where specified objects or attributes fail to emerge in the generated image. By performing linear probing on text tokens, we demonstrate that text embeddings can distinguish a characteristic `omission signal' representing the absence of target concepts. Leveraging this insight, we propose Omission Signal Intervention (OSI), which amplifies the omission signal to actively catalyze the generation of missing concepts. Comprehensive experiments on FLUX.1-Dev and SD3.5-Medium demonstrate that OSI significantly alleviates concept omission even in extreme scenarios.
CT Imaging with Helium and Carbon Ions for Hadron Therapy
arXiv:2605.29593v1 Announce Type: new Abstract: Objective: To perform a comprehensive comparative analysis of proton, helium-ion, and carbon-ion computed tomography (CT) as direct imaging modalities for hadron therapy treatment planning, focusing on Relative Stopping Power (RSP) reconstruction accuracy and patient radiation dose. Approach: High-fidelity Monte Carlo simulations were conducted using the GATE/Geant4 platform to model a standard CTP404 phantom. RSP maps were reconstructed using an iterative Richardson-Lucy deconvolution algorithm. Imaging performance was evaluated by comparing reconstructed RSP values against ground truth data for various tissue-equivalent inserts, while integral doses were estimated for a human head geometry. Main results: All investigated particle modalities demonstrated a significant dose reduction compared to conventional X-ray CT protocols (which are approximately 40 mGy). The estimated imaging doses were 1.6 mGy for protons, 3.9 mGy for helium ions, and 22.7 mGy for carbon ions. In terms of accuracy, carbon-ion imaging achieved the highest fidelity for soft-tissue materials (mean absolute error <0.5\%). Helium ions offered a balanced performance with sub-1\% errors for most materials and a dose burden significantly lower than carbon ions. Protons exhibited the widest range of RSP deviations (-1.8\% to +3.1\%). Significance: Direct particle imaging eliminates the systematic uncertainties inherent in photon-to-hadron conversion. While carbon ions provide superior RSP reconstruction precision essential for complex treatment plans in heterogeneous anatomy, helium and proton imaging offer exceptional dose sparing, making them particularly advantageous for pediatric patients and frequent adaptive replanning scenarios.