Cryptography and Security
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 11 September
Insecure Direct Object Reference (IDOR), often modeled as Broken Object-Level Authorization (BOLA), remains prevalent in Java database applications because identity and authorization checks at the controller or service layer are disconnected from SQL execution based on resource identifiers. Existing work largely detects these vulnerabilities but offers limited low-intrusion runtime protection for legacy Java-SQL applications. We present IDORacle, a template-guided SQL-sink interception and rewriting framework for preventing horizontal privilege escalation at runtime. IDORacle propagates authenticated identity context across HTTP requests, asynchronous tasks, and data-access boundaries through a server-side trace identifier. At the MyBatis/JDBC boundary, it extracts SQL templates, computes dual fingerprints, and performs one-time template analysis to generate reusable mediation plans. During execution, it combines subject context, SQL ASTs, table metadata, and cached authorization proofs to permit, rewrite, or block operations. Its guard model supports direct ownership predicates, join-derived ownership, probes for group-owned resources, role-sensitive state transitions, and sensitive-column mediation. A Java-SQL benchmark grounded in real-world CVE reports shows that IDORacle prevents the tested horizontal authorization violations with a worst-case guard latency of 0.17 ms. Redundancy-aware optimization reduces average per-instance overhead by more than 90%, to 0.017 ms for hot SQL templates.
Materials Science
Mechanical control of competing magnetic order in crystalline MnPtGa membranes
MnPtGa hosts competing magnetic states, including ferromagnetic, canted antiferromagnetic, and spin density wave (SDW) order in the centrosymmetric $P6_3/mmc$ structure, while a related inversion-broken structure supports chiral skyrmions. Controlling this competition motivates materials platforms that enable tunable strain and symmetry breaking, together with probes of SDW order compatible with ultrathin samples. Here, we demonstrate single crystalline MnPtGa membranes grown by molecular beam epitaxy on graphene/Ge(111) and released by mechanical exfoliation. X-ray and electron diffraction confirm high crystalline quality. SQUID magnetometry reveals a 140 K anomaly in the zero-field-cooled $dM/dT$ that persists after exfoliation, while time-resolved reflectivity shows a coincident peak in the electronic relaxation time consistent with a quasiparticle phonon bottleneck associated with a putative SDW gap. Intentional rippling suppresses the $\sim 140$ K magnetic anomaly, demonstrating mechanical control of the low-temperature state. These results establish MnPtGa membranes as a platform for detecting and strain-tuning competing magnetic orders.
Read the full abstract
Machine Learning
Granularity-Adaptive Credit Assignment for Long-Horizon LLM Agent Reinforcement Learning
Long-horizon language-model agents trained with reinforcement learning oftenreceive sparse outcome rewards that do not reveal which decisions along a tra-jectory deserve credit. Episode-level advantages provide coarse trajectory-widecredit, while step-level comparisons offer finer resolution with context-dependentestimation noise. We propose Granularity-Adaptive Credit Assignment (GACA),a critic-free method that adaptively mixes episode- and step-level credit for eachdecision during policy optimization. GACA normalizes the sampled response'smean per-token negative log-likelihood (NLL) within each trajectory and uses theresulting criticality score to determine the step-specific mixture. The computationreuses rollout log-probabilities without additional training rollouts or model eval-uations. Our analysis characterizes optimal score-dependent mixing and derivesconditions linking expected NLL to a lower bound on the preferred step-levelweight. Across ALFWorld and WebShop with 1.5B and 7B backbones, GACAachieves the highest reported mean success rates among the compared methods,while introducing negligible additional computation.
Read the full abstract
Analysis of PDEs
Scattering Across the Long-Range Threshold for One-Dimensional Nonlinear Schrödinger Equations
We study small solutions to the one-dimensional nonlinear Schrödinger family \[ \mathrm{i}\partial_t u_\delta=-\partial_x^2u_\delta+\kappa|u_\delta|^{2+\delta}u_\delta, \qquad 0\leq\delta\leq\delta_0, \] uniformly as $\delta\to0^+$ and $t\to\infty$, across the threshold between cubic modified scattering and nearby-power ordinary scattering. For initial data small in $H^{0,1}(\mathbb{R})$, with one spatial weight and no physical derivative assumed, we prove a joint-limit asymptotic formula governed by an explicit nonlinear clock. The variable $ \delta\log t$ gives three regimes according as it tends to zero, a positive finite limit, or infinity. Within the regime $\delta\log t\to0$, successive Taylor terms of the clock become visible at an infinite hierarchy of time scales, each requiring finer absolute phase accuracy. These scales accumulate at the transition scale, where the exact clock describes them together. In the transition and saturated regimes, the clock is of order $\delta^{-1}$, so the first-order variation of its coefficient contributes a finite phase correction.
Read the full abstract
Artificial Intelligence
Hierarchical Belief Modeling for Zero-Shot Opponent Adaptation in Partially Observable Multi-Agent Navigation
Lux AI Season 3 requires agents to act under partial observability, randomized episode level dynamics, and a best of five match structure that rewards both tactical execution and fast adaptation. We present HORIZON, a hierarchical agent that combines symmetry aware spatial perception, dual memory belief tracking, relic centric graph attention, information gain driven exploration, and an opponent conditioned policy mixture. HORIZON separates short horizon control from cross match meta reasoning, while auxiliary belief and world model objectives stabilize learning. Trained with PPO in a large scale JAX simulator, the resulting agent explicitly infers hidden game parameters and opponent style. Experiments show consistent gains in match win rate, episode win rate, adaptation gain, and league rating over strong recurrent and feed forward baselines.
Read the full abstract
Machine Learning (Statistics)
Inference for Newton Methods with Accelerated Sketch-and-Project via Random Scaling
We study an online sketched Newton method that approximates the Newton direction at each step via a state-of-the-art sketching solver, called the generalized accelerated sketch-and-project solver (GAS), thereby mitigating the computational bottleneck of classical second-order methods. The GAS solver improves upon vanilla, unaccelerated sketch-and-project solvers by achieving accelerated convergence through Nesterov momentum updates, and accommodates a flexible projection metric whose proper choice further reduces computational cost. Building on this design, we establish asymptotic normality of the averaged sketched Newton iterates and characterize their limiting covariance matrix. The resulting covariance recovers that of the unaccelerated sketched Newton method under a specific choice of acceleration parameters, converges more rapidly (in the number of sketching steps) to the minimax-optimal covariance in general, and is smaller than that of the last iterate produced by the accelerated method. Finally, we strengthen these results by establishing a functional central limit theorem for the Newton iterates, which allows us to bypass explicit covariance estimation and develop an online inference procedure based on random scaling. Specifically, we construct a pivotal test statistic by appropriately rescaling the averaged iterates, so that its limiting distribution is free of any unknown parameters, enabling asymptotically valid online inference. Numerical experiments demonstrate superior performance of the proposed inference procedure.
Read the full abstract
Accelerator Physics
Progress in Muon Cooling and Moderation Techniques
Muon beams are essential tools for a wide range of applications such as the search for rare muon decays and muon spectroscopy. However, conventional muon beams produced from pion decay have large emittance and broad momentum spread. Conventional beam-cooling techniques cannot improve the beam quality significantly owing to the 2.2 $\mu$s muon mean lifetime. This has motivated the development of dedicated muon beam cooling and moderation methods. This review surveys the principal approaches, including ionisation cooling for high-brightness muon beams, low-energy muon moderation and frictional cooling for slow muon production, and laser ionisation of thermal muonium for ultra-low-emittance muon sources. The challenges associated with producing slow negative muons and emerging concepts based on cyclotron trapping and muon-catalysed fusion are also discussed. These complementary techniques offer promising pathways towards next-generation muon facilities and precision experiments.
Read the full abstract
Machine Learning
MInTRL: Off-policy Intervention can boost On-policy RL
Reinforcement learning with verifiable rewards is typically performed on-policy, keeping training data close to the current policy but limiting learning to trajectories that the policy can discover itself. Off-policy methods such as supervised fine-tuning, on the other hand, can leverage external knowledge beyond the base model's capabilities, but may suffer from large distribution shift. The key challenge is thus to expand exploration without sacrificing learnability. In this work, we introduce Minimal Intervention Reinforcement Learning (MInTRL), which expands the exploration frontier through sparse, local interventions in otherwise on-policy rollouts. During generation, a judge-intervention policy periodically reviews the current policy's output, replaces erroneous suffixes with short corrections, and immediately returns control to the policy. During training, MInTRL adopts a sequence-level advantage-regression objective that eliminates the need for importance sampling. We show that sparse, local interventions can substantially improve coverage beyond finite-budget on-policy sampling while preserving the overall on-policy nature of the resulting trajectories. Across math and code benchmarks, MInTRL consistently outperforms standard on-policy and off-policy baselines. Ablations show that MInTRL remains effective with self-intervention and across different judge policies, while performance peaks at moderate intervention intensity, highlighting the importance of intervening minimally. These results establish minimal intervention as an effective paradigm for enhancing on-policy RL.
Read the full abstract
Machine Learning
RiPPLE: Cross-Space Performance Prediction from Early Training for Neural Architecture Search
Neural architecture search (NAS) evaluates candidate networks, but fully training enough architectures to rank an entire space is expensive. Zero-cost proxies score architectures at initialization, yet their ranking quality varies across search spaces. Learned predictors reduce evaluation cost but typically require fully trained labels or partial-training features for individual candidates. We introduce $\textbf{RiPPLE}$, $\underline{\textbf{R}}$anking v$\underline{\textbf{i}}$a $\underline{\textbf{P}}$refix-$\underline{\textbf{P}}$ropagated $\underline{\textbf{L}}$abel $\underline{\textbf{E}}$xtrapolation, which treats partial training as a source of labels for a small coverage set of anchors. RiPPLE trains these anchors to an early prefix, extrapolates their learning curves to surrogate labels, and propagates the labels over label-free architecture features. The early-training signal remains a label on the anchors rather than a per-candidate feature. Feature, readout, and encoding rules are selected without held-out accuracy and reused across search spaces. We evaluate the method on twelve benchmark cells from four search-space families and on the larger DARTS space. The results examine ranking quality, label efficiency, architecture selection, and the roles of readout, coverage, and propagation. RiPPLE provides a whole-space ranking from a fractional anchor-training budget, with comparisons interpreted under their respective evaluation and cost protocols.
Read the full abstract
Computer Vision
Spectral Consistency-Guided Multiview Point Cloud Registration for Low-Overlap Scenes
Multiview point cloud registration is particularly challenging in low-overlap scenes, where reliable correspondences are limited and incorrect pairwise transformations can affect global pose estimation. In addition, registering all scan pairs is computationally expensive because many pairs provide weak geometric information. To address these problems, we propose GMPCR, a non-learning-based spectral consistency-guided framework for efficient and robust multiview point cloud registration. GMPCR builds a refined second-order compatibility structure from initial correspondences and uses its dominant spectral response to evaluate both correspondence reliability and scan-pair confidence. This allows unreliable correspondences to be filtered and informative scan pairs to be selected before relative transformation estimation, leading to a sparse pose graph and reduced pairwise registration cost. For each retained scan pair, maximal-clique-based hypothesis generation is used to estimate reliable relative transformations. The resulting pose graph is further refined by an adaptive history-aware synchronization scheme, in which the effect of residual history is adjusted according to changes in the global rotation residual. A recovery mechanism also allows down-weighted edges to regain confidence when their global consistency improves. Experiments on 3DMatch, 3DLoMatch, ScanNet, and ETH demonstrate the effectiveness of GMPCR. It achieves registration recalls of 97.2% and 89.6% on 3DMatch and 3DLoMatch, respectively, while maintaining competitive performance on ScanNet and ETH. The results show that GMPCR provides a favorable balance among registration accuracy, robustness to low overlap, and computational efficiency. The code is publicly available at https://github.com/swccj/gmpcr.
Read the full abstract
Algebraic Geometry
Holomorphic isomonodromic deformations of Higgs bundles: absolute lifting, spectral flatness, and nilpotent rigidity
Let $f:X\to S$ be a smooth projective family, and fix a semisimple flat bundle on a fiber $X_0$. Its isomonodromic deformation determines a holomorphic section $\sigma_{\mathrm{dR}}:S\to M_{\mathrm{dR}}(X/S)$ of the relative de Rham moduli space. Applying the relative non-abelian Hodge correspondence fiberwise gives a section $\sigma_{\mathrm{Dol}}:S\to M_{\mathrm{Dol}}(X/S)$, whose value at each $s\in S$ is the Higgs bundle corresponding to the flat bundle $\sigma_{\mathrm{dR}}(s)$. Unlike $\sigma_{\mathrm{dR}}$, the section $\sigma_{\mathrm{Dol}}$ is in general only real analytic. We study the geometric consequences of its holomorphicity along a complex analytic subvariety. First, we prove an absolute lifting theorem: the relative isomonodromic Higgs bundle admits an absolute Higgs lift, and the fiberwise harmonic metrics can be modified to solve the Hitchin–Simpson equation on the total space. Second, we prove that the spectral one-form on every resolved irreducible component of the relative spectral scheme is Gauss–Manin flat. As an application, we prove the nilpotent rigidity conjecture of Hu–Sun–Yang–Zuo: if the initial Higgs field is nilpotent, then the Higgs field remains nilpotent along the entire holomorphic isomonodromic locus.
Read the full abstract
Human-Computer Interaction
Why User Studies and Participant Experience Reporting Matter for VR Motion Privacy?
Public VR game leaderboards contain tracked motion recordings uploaded by hundreds of thousands of users. Once uploaded, these recordings are accessible to anyone and create privacy risks (i.e., identification and profiling). Prior work has proposed mechanisms that modify tracked movement to reduce these risks. Their utility is commonly evaluated through physical deviation, where smaller deviations indicate better utility, while user studies are less common. However, it remains unclear how well physical deviation explains users' acceptance of a mechanism compared to user studies. We examine this through a user study of three VR motion privacy mechanisms at five physical deviation levels. We find that user studies explain substantially more variation in mechanism acceptance than physical deviation, although physical deviation remains significant. We also find that prior VR experience and exposure to VR privacy mechanisms significantly affect acceptance. We recommend combining physical deviation with user studies and reporting participants' prior experience.
Read the full abstract
Algebraic Geometry
Torus actions on compactified braid varieties and polytopality of subword complexes
Every cluster variety admits an action of its cluster dilation group. We prove that, in the case of braid varieties for simple Lie groups, this action always extends to a regular action on each of the brick compactifications. We explore two applications of this result. First, we show that any closed Richardson variety admits a faithful action of a torus of rank the Kazhdan-Lusztig $d$-invariant, answering affirmatively a recent question of E. Gorsky–S. Kim–M. Sherman-Bennett. The same result holds for projected Richardson varieties. Second, we show that the braid variety is a torus if and only if for each of its brick compactifications, the polar dual of the moment polytope for this action realizes the corresponding subword complex. The braid words satisfying this property turn out to be precisely the double root free words of V. Pilaud and C. Stump. This provides a novel approach to the longstanding open question of the polytopality of spherical subword complexes asked by A. Knutson and E. Miller, and in particular gives infinite families of subword complexes admitting polytopal realizations in dimension higher than the rank of the corresponding Coxeter group. As a common consequence of these two applications, we classify all Bruhat intervals in finite crystallographic Coxeter groups which are isomorphic to face lattices of convex polytopes via certain double root free words.
Read the full abstract
Artificial Intelligence
SoK: Rethinking Jailbreaking in the Era of Agentic AI: Attacks, Defenses, and Practical Consideration
Large language models (LLMs) are rapidly evolving from conversational assistants into agentic AI systems that reason, plan, invoke tools, maintain persistent memory, communicate with other agents, and execute multi-step tasks. At the same time, modern models exhibit substantially stronger native safety alignment than earlier generations on which many jailbreak attacks and defenses were originally studied. This shift raises a fundamental question: which established jailbreak-security findings remain valid in the era of modern LLMs and agentic AI? We address this question through a Systematization of Knowledge (SoK) that reframes jailbreak security around the full agentic execution pipeline. We develop unified taxonomies of attacks and defenses spanning user interaction, planning and reasoning, memory, tool use, and inter-agent communication, and introduce a security–utility–efficiency evaluation framework that separates native harmful-prompt safety, adversarial jailbreak robustness, and agent-level security outcomes. We further conduct a controlled empirical study of representative attacks and defenses within a common agentic framework. Our results reveal three important gaps. First, strong native alignment does not imply robustness to adversarial jailbreaks. Second, defense effectiveness is highly model-, attack-, and component-dependent and can come at substantial cost in over-refusal, utility, and latency. Third, low final-response attack success can mask severe intermediate compromise: planning, memory, and tool interactions may remain unsafe even when the final response is successfully filtered. These findings motivate a shift from response-centric jailbreak defense toward cross-layer, execution-aware security that protects agent state, component transitions, and external actions while preserving practical utility and efficiency.
Read the full abstract
Distributed Computing
HoliBench: A Cross-Platform Benchmarking and Deployment Toolkit for Foundation Models in CPS-IoT Applications
Foundation models, including large language models, vision-language models, and time-series foundation models, are increasingly deployed on embedded and edge platforms for CPS and IoT applications, where energy, latency, and memory are as critical as task accuracy. Existing benchmarking tools evaluate model capability in isolation, reporting accuracy assuming sufficient compute, while hardware profiling tools remain platform-specific and mutually incompatible. As a result, users lack a unified workflow for making deployment decisions across heterogeneous devices. We present HoliBench, a modular benchmarking and deployment toolkit that jointly characterizes accuracy, latency, and energy across platforms from single-board computers to GPU servers. Its platform abstraction layer calibrates cross-device measurement, and the toolkit supports multiple model modalities, inference engines, concurrencies, and existing evaluation harnesses. An interactive interface exposes constraint-aware configuration selection over a design space that is profiled once and reused across studies. Using HoliBench, we characterize 20 models across 7 device types, 3 quantization levels, 8 inference backends, and over 30 tasks, surfacing tradeoffs that existing tools miss: quantization reduces latency only on hardware with low-precision support, accuracy gains show diminishing returns relative to energy, and for autoregressive workloads, average inference power is approximately constant across output lengths. We further find that single-model profiles compose under sequential co-resident execution. In a multi-model CPS deployment, standalone profiles predict combined-pipeline latency and power within 1.2% and 2.5%, enabling deployment exploration without exhaustively profiling every pipeline configuration. We release HoliBench as open-source infrastructure for deployment-aware evaluation of foundation models.
Read the full abstract
Computer Vision
DERA: Detached Edge-Residual Adaptation for Prohibited item Detection
Prohibited-item detection in X-ray imagery remains challenging due to object superposition, weak texture, and material clutter which obscure both semantic appearance and object boundaries. We propose DERA, a Detached Edge-Residual Adaptation framework for prohibited item detection under X-ray imagery. DERA combines hierarchical visual features with a parallel pixel-difference edge pyramid and learns an object-specific boundary prior from training-time contours of the instance masks. The detached prior gates edge-sensitive features, which are injected into the early visual stages through residual heads. This staged design preserves the foundation detector at the start of adaptation, isolates boundary supervision from semantic feature learning, and restricts the final adaptation stage to only \(14.7\)K trainable parameters. Evaluated on PIDray, CLCXray, and STCray, DERA improves the baseline by 3.1, 1.6, and 2.4 AP points, respectively.
Read the full abstract
Computer Vision
A Multimodal Explainable Deep Learning Framework for Alzheimer's Disease Diagnosis using 3D Magnetic Resonance Imaging and Clinical Data
Dementia is a major and growing global health burden, with Alzheimer's disease (AD) accounting for most cases. Timely and accurate diagnosis is central to managing this burden and increasingly depends on integrating complementary clinical and imaging information. Multimodal deep learning can combine these modalities for AD diagnosis, but how its explanations behave across modalities, fusion strategies, and cohorts remains unclear. We developed an explainable multimodal framework pairing a 3D CNN encoder for T1-weighted MRI with a feedforward network for harmonized clinical and demographic data, comparing varied model setups on three-way and pairwise diagnostic tasks using 6,479 internal records from the ADNI and 1,703 independent records from the OASIS-3. On ADNI, the tabular-only model achieved the highest three-class AUC-ROC of 0.879 and best discriminated cognitively normal (CN) versus mild cognitive impairment (MCI; 0.903), while cross-attention performed best for MCI versus AD (0.861); CN versus AD was highly discriminative overall. On OASIS-3, the vision-only model performed best (three-class AUC-ROC 0.910); CN versus MCI remained difficult, and no fusion strategy consistently outperformed single modalities across tasks and cohorts. SHAP and Integrated Gradients identified the MMSE as the dominant tabular feature in both cohorts, with global feature rankings agreeing strongly in ADNI ($\rho=0.94$) and OASIS-3 ($\rho=0.96$); CAM-based explanations, however, changed with model configuration and cohort. These findings show that multimodal performance and explanations are task, modality, fusion, and cohort-dependent: a dominant cognitive signal persisted across cohorts, but feature contributions and CAM explanations did not, underscoring the need to evaluate explainability under cohort shift rather than as a stable, intrinsic property.
Read the full abstract
Computer Vision
OphBiWSSD: Scaling Temporal Action Localization in Ophthalmic Surgeries with Bidirectional Weight-tied State Space Duality
High-frequency surgical maneuvers in ophthalmology necessitate high-fidelity temporal modeling, yet characterizing long-range procedural dependencies remains computationally prohibitive for attention-based architectures. Existing models often require aggressive temporal downsampling, which compromises the detection of fine-grained action boundaries and instrument-tissue interactions. To address these scalability constraints, we present OphBiWSSD, a framework that reformulates surgical temporal action localization leveraging Bidirectional State Space Duality. By employing a weight-tied selective scan mechanism that incorporates both preceding and succeeding surgical contexts, our approach facilitates the global synthesis of non-causal temporal cues with linear complexity. This streamlined architecture is well-suited to capture the bidirectional dependencies present in ophthalmic workflows, effectively bridging the gap between local boundary precision and long-range procedural context without incurring the quadratic memory overhead of traditional Transformers. Extensive experiments on the OphNet benchmark demonstrate that OphBiWSSD achieves state-of-the-art temporal localization performance, with mean Average Precisions of 44.42% on phases and 43.08% on operations, surpassing the baselines by 6.80% and 6.66%, respectively. Empirical validation indicates that our approach ensures precise temporal localization and offers a computationally viable pathway for deploying surgical intelligence systems in clinical environments. The code is publicly available at https://github.com/yo3nglau/OphBiWSSD.
Read the full abstract
Computer Vision
GSO-Net: Visual State Machines for Hazardous Freight Transfer Compliance at Petrochemical Logistics Nodes
Hazardous-freight operations at petrochemical logistics nodes are safety-critical for intelligent transportation systems, yet existing vision benchmarks rarely address procedural compliance under realistic deployment constraints. In large infrastructure networks, cameras often operate under sparse round-robin polling, so transfer status must be inferred from incomplete observations and localized evidence. We present GSO-Net, a large-scale benchmark for visual understanding of standard operating procedures (SOPs) in petrochemical unloading scenarios. To our knowledge, GSO-Net is the first public benchmark dataset dedicated to visual SOP understanding in petrochemical hazardous-freight transfer scenarios. It contains over 50,000 independently sampled frames from 64 real expressway petrochemical logistics nodes and adopts an SOP-derived hierarchy linking 9 macroscopic procedural steps with 15 microscopic operational states. Two tasks are defined: joint detection of microscopic states and macroscopic steps as the core benchmark, and frame-level step classification as a diagnostic reference. Experiments with lightweight, transformer-based, open-vocabulary, and holistic models reveal a clear gap between object perception and transfer-stage understanding. Current models remain weak on contact-level state grounding, transient step recognition, and stage consistency, especially under sparse polling, tiny critical targets, and long-tailed operational evidence. GSO-Net provides a practical benchmark for fine-grained state perception and vision-based safety monitoring in hazardous freight transportation. The dataset is publicly available at https://github.com/yuxieHarrison/GSO-Net
Read the full abstract
Numerical Analysis
3D Computational Modeling of the Vascular Heat-Sink Effect in Microwave Ablation of Tumors Close to the Aorta
Microwave ablation (MWA) is a percutaneous ablation that induces thermal necrosis by generating localized high-temperature regions within tumor tissue. However, when a tumor is located close to a large vessel such as the aorta, blood flow continuously removes heat from the ablation zone. This phenomenon causes the vascular heat-sink effect and thereby increases the risk of incomplete ablation. This study constructs an ANSYS-based numerical framework to investigate the heat-sink effect during MWA of tumors located close to the aorta. The computational model consists of the tumor, surrounding tissue, vessel wall, blood flow domain, and microwave antenna. Microwave-induced heating was represented by an equivalent heat source mapped from the High-Frequency Structure Simulator (HFSS)-derived volume loss density, rather than by direct electromagnetic-thermal coupling within the thermal-fluid solver. Two parametric studies were performed to quantify the heat-sink effect. First, the tumor-aorta distance was varied at D = 0 mm, 4 mm, and 8.5 mm to assess how vessel proximity affects temperature elevation and ablation zone formation. Second, at each tumor-aorta distance, three blood-flow conditions were compared: no blood, stagnant blood V = 0 m/s, and normal aortic blood flow V=0.65 m/s. This comparison enabled the heat-sink effect of blood flow to be independently evaluated. The results highlight the clinical need for simulation-based treatment planning in patients with tumors located close to major vessels.
Read the full abstract
Econometrics
Representation Multiplicity in Causal Forests
Including covariates alongside strictly monotone transformations can change a causal forest's treatment decisions without adding information. Random feature selection favors covariates represented by these multiple columns. Under stated conditions, I show that this imbalance can persist as samples grow. Treatment effect components associated with other covariates are omitted, attenuated, or recovered depending on their inclusion probabilities and tree depth. Simulations and a job-training replication illustrate sensitivity to redundant transformations. Sampling groups of variables that generate identical splits restores prediction invariance on the grouping data when fitting and randomization are held fixed.
Read the full abstract
Combinatorics
The $q$-analogues of $\gamma$-positivity of Eulerian polynomials via group actions
Han, Jouhet and Zeng established $q$-analogues of the $\gamma$-expansion formulas for Eulerian polynomials of types $A$ and $B$. Combinatorial interpretations of the corresponding coefficients$a_{n,k}(q)$ and $b_{n,k}(q)$, however, remained open. In this paper, we provide combinatorial interpretations for thesecoefficients by using the model of increasing binary trees, thereby resolving a problem posed by Han, Jouhet and Zeng. Our combinatorial approach consists of three main steps: 1. construct a Carlitz-type insertion bijection for increasing binary trees and derive a new combinatorial interpretation ofCarlitz's $q$-Eulerian polynomials of type $A$ in terms of such trees; 2. introduce a generalized Foata–Strehl action on increasing binary trees to interpret the coefficients $a_{n,k}(q)$;3. derive a new combinatorial interpretation for the $q$-Eulerianpolynomials of type $B$ introduced by Chow and Gessel in terms of increasing binary trees of type $B$, and develop a generalizedFoata–Strehl action on these trees to interpret the coefficients $b_{n,k}(q)$. We further give combinatorial interpretations for the quotients ${a_{n,k}(q)/(-q;q)_{k-1}}$ and ${b_{n,k}(q)/(1+q)^k(-q;q^2)_k}$ in terms of André trees and a certain class of increasing binary trees of type $B$, respectively. As an application of the latter interpretation, we obtain a combinatorial interpretation for a $q$-analogue of the secant number and prove the positivity conjecture of Han, Jouhet and Zeng.
Read the full abstract
Artificial Intelligence
VRL-Bench: Benchmarking agents on computer control tasks under finite trial budgets
Learning from trial and error is a promising way to improve language agents on complex tasks such as computer control. Reflexion introduced verbal reinforcement learning, which turns failed trials into text that guides later attempts without updating model parameters. We introduce VRL-Bench, a harness for fair evaluation of trial-and-error learning under finite trial budgets. Across three models on MiniWoB and WebShop, we evaluate updates from several prominent verbal-memory methods spanning Reflexion and later work: each improves observed success over memory-free retry in some settings but reduces it in others. Replay experiments show that using reflection can reduce success rates, revealing a trade-off between exploiting experience and continued exploration. We propose VEX$^2$, a verbal exploration–exploitation scheduler that uses a language model to jointly select policies and allocate the remaining trial budget. VEX$^2$ is the only evaluated update to achieve positive observed success-rate gains over retry in all six settings.
Read the full abstract
Artificial Intelligence
Beyond ID Embeddings: Process-Grounded Language Modeling for Cognitive Diagnosis
Cognitive Diagnosis Models (CDMs) play a pivotal role in personalized online learning. Traditional CDMs rely on discrete, ID-based embeddings to represent students, exercises, and concepts. This paradigm diverges from the nature of learner cognition, where knowledge is not stored and retrieved as isolated symbols. As a result, CDMs suffer from semantic limitations when new exercises or concepts appear. In this paper, we propose a Process-aware Language Cognitive Diagnosis (PLCD) framework that uses language-derived structures as cognitive priors and response records to calibrate student posterior states. PLCD leverages large language models (LLMs) to construct concept schemas and cognitive process graphs, and uses target-conditioned semantic memory to retrieve historical responses that are relevant to each target exercise. A process-grounded Language-to-Cognition Mapper with DA-MoE experts and process-level contrastive learning then maps the textual evidence into a unified cognitive space. Experimental results show that PLCD not only outperforms traditional baselines in predicting student performance but also exhibits strong cognitive transfer capabilities. These results connect the computational power of LLMs with the psychometric goal of measuring latent knowledge states, suggesting that structured language priors calibrated by response records can improve cold-start robustness and cognitive grounding.
Read the full abstract
Logic
Effective recurrence for computable measure-preserving transformations
We prove several necessary and sufficient conditions under which a point satisfies the Poincaré Recurrence Theorem for all computable (ergodic) measure-preserving transformations and all sets of a particular complexity. The necessary conditions are obtained by constructing specific measure-preserving transformations which violate recurrence. While some of these conditions pertain to standard notions of algorithmic randomness, others involve new notions of genericity developed in the context of a computable probability space, which we call $\Pi^0_n$-genericity and quasi-$\Pi^0_n$-genericity. We also provide conditions under which points recur at a positive frequency in sets containing them, regarding both simple and multiple recurrence.
Read the full abstract
Statistics Applications
Optimization of ReaxFF parameters for the $\mathrm{Mo-S}$ system using random optimization and coordinate search
ReaxFF is a molecular dynamics method that can be considered a good approximation to quantum methods for investigating reactive molecular systems consisting of ten thousand to one hundred thousand atoms. While ReaxFF is usually a much faster alternative to quantum methods, the force field consists of nearly 100 parameters per element, which makes the force field development a high dimensional optimization problem. In addition to the high-dimensionality, non-convexity and non-continuity make it a hard problem to optimize. We use random optimization along with coordinate search strategies to optimize efficiently and sample new parameter points that yield good molecular properties close to predefined `reference values' obtained from quantum mechanical methods for the $\mathrm{Mo-S}$ system. We also provide empirical error guaranties starting from any random sample of inputs. We discover new points for the $\mathrm{Mo-S}$ system at adjusted error levels of $13{,}000$ as compared to Sengul et al. (2022) at $70{,}000$ levels under the same loss function, registering over $80\%$ improvement. We also extend our algorithm to an out-of-sample system, $\mathrm{W-S}$, with no training data to record over $70\%$ improvement over Sengul et al. (2021).
Read the full abstract
Artificial Intelligence
Decentralized Evolution of Hexapod Gaits with Independent Leg Controllers
This paper presents a novel approach to hexapod locomotion by evolving each leg's gait independently through a decentralized evolutionary algorithm. Using the Webots simulator and the Mantis hexapod robot, we optimize individual leg controllers without centralized coordination, allowing emergent behaviors to drive the development of efficient, coordinated locomotion. Our decentralized method is benchmarked against cooperative coevolution, demonstrating improved efficacy in generating stable and adaptive gaits while showing interesting emergent coordination. By enabling independent evolution of leg controllers, this method reduces the complexity of gait optimization and highlights the potential of decentralized strategies for scalable and adaptive robotic systems.
Read the full abstract
Artificial Intelligence
OneLA: Scaling Linear-Attention Decoding to Large Beams in Generative Recommendation
Generative recommendation (GR) relies on large-beam decoding to generate hundreds of candidate items, creating a new scaling challenge for recurrent linear attention. Existing linear attention serving systems either materialize a full recurrent state for every beam or repeatedly replay shared history, incurring substantial memory and traffic overhead. To address this, we present OneLA, a linear-attention decoding framework that exploits the shared prompt and short divergent suffixes of GR workloads. Specifically, OneLA represents all beam states using a single shared prompt-derived state and compact, append-only records of their divergent transitions. Using this representation, OneLA computes only the state information required at each decoding step, without reconstructing a full recurrent state for every beam. Furthermore, OneLA uses a lightweight ancestry index to track the transition records that make up each beam's history, allowing beams to be updated without moving or copying existing records. A fused GPU kernel further reuses the shared state across beams. Our analysis shows that OneLA achieves 1.54-2.46x end-to-end decode speedups while substantially reducing recurrent-state memory use and data movement.
Read the full abstract
Artificial Intelligence
Niching Agents in The Core
The Core is a unique competitive co-evolution algorithm that allows agents to evolve autonomous control without utilizing a traditional fitness function. The agents evolve via local interactions through tournament selection, crossover, and mutation, producing offspring by evolving better controllers. Previous works have shown The Core's ability to evolve agents capable of combat and navigation in the Xpilot video game. This research expands upon that premise by niching agents to specific subsets of the original environment The Core was tested in. Our results demonstrate the niched agents capacity for success over agents niched to the entire system and agents niched to different sub-environments.
Read the full abstract
Computer Vision
UFO: Chain-of-Evaluation for Omni-Condition Alignment in Multi-Modal Image Generation
Multi-modal image generation, particularly subject-driven customization, has garnered growing attention in recent years. Despite the rapid advancement of generative models, their evaluation remains largely lagging. Existing methods, whether embedding-based or Multi-modal Large Language Model (MLLM)-based, evaluate alignment with each modal condition in isolation, which contradicts the simultaneous condition alignment objective of multi-modal image generation, leading to poor consistency with human judgments. To address this challenge, we propose UFO, the first unified framework for omni-condition alignment simultaneous evaluation. Specifically, UFO introduces a novel Atomized Chain-of-Evaluation paradigm, i.e., it first decomposes omni-condition alignment into a sequential chain of fine-grained, disentangled Atomic Evaluation Units (AEUs), categorizes them into distinct modality-relevance classes, and then employs general or dedicated functional calls for accurate verification of different AEU types. Experimental results demonstrate that UFO achieves the highest correlation with human evaluation preferences, delivering an average improvement of 15.25%. Furthermore, we present UFO-Bench, a dedicated benchmark designed to holistically evaluate the performance of existing customization models under the diverse mutual interactions of textual and visual conditions.