Papers

Development and evaluation of computational pathology methods require access to large and diverse datasets. Over the past decade, various initiatives invested significantly into collecting, centralizing, and sharing pathology imaging data. In contrast, sharing of image-derived data such as region-of-interest delineations or segmentation masks is less well developed. In this work, we describe our approach to encoding and sharing image-derived pathology data in a standardized manner within the National Cancer Institute (NCI) Imaging Data Commons (IDC), a platform that hosts and provides public access to de-identified radiology and pathology data. The IDC relies on the Digital Imaging and Communications in Medicine (DICOM) standard for data harmonization, yet the adoption of DICOM for pathology image-derived content has remained largely unexplored until now. Here, we present five representative datasets harmonized by conversion from their original representations into DICOM and shared publicly in the IDC. We demonstrate the benefits of this harmonization, describe contributions to critical open-source tooling, and discuss technical considerations relevant to broader adoption of DICOM for pathology image-derived data.

Rigorous empirical validation of quantum machine learning on natural language tasks remains scarce. We evaluate a 10-qubit hybrid quantum-classical variational circuit (2,148 parameters) for paraphrase detection across three benchmarks: MRPC, Quora Question Pairs (QQP), and adversarial PAWS. On QQP (n = 10 seeds), the circuit achieves 75.53% +/- 0.75%. accuracy, statistically outperforming parameter-matched classical baselines (DeepMLP: p = 0.015, Cohen's d = 1.20; F1: p < 0.001, d = 2.32) and surpassing DistilBERT-4bit with 31,191 fewer parameters. On MRPC the optimal 2-layer variant reaches 92% of BERT-base accuracy at 54,000 lower parameter cost. Circuit depth analysis reveals a dataset-depth scaling effect; entanglement analysis via the Meyer-Wallach measure identifies multi-qubit entanglement as the primary performance driver (r = 0.85 across four variants). Adversarial evaluation on PAWS reveals emergent robustness: 98.2% recall versus 81.6% classical (+16.6 pp, d = 1.24, p < 0.001), without adversarial training. These results constitute the first systematic parameter-matched multi-benchmark empirical validation of hybrid variational circuits for NLP. All results are from classical simulation; hardware validation is future work.

Multi-Hop Knowledge Graph Question Answering (KGQA) tasks require models to assemble relational evidence along paths in a KG to answer natural-language questions. However, existing KGQA systems typically focus on predicting the final answer without explicitly modeling or validating the intermediate reasoning steps, obscuring whether the correct answers arise from faithful multi-hop reasoning. To address this limitation, we re-frame multi-hop KGQA as a question-conditioned graph navigation problem. We refer to this formulation as THESEUS - Traceable Hop-wise Evidence SEarch in a Unified Semantics. In this setting, an agent receives a KG, a question, and a topic entity, and traverses a sequence of relations towards the answer, making the reasoning path explicit. To systematically study this formulation, we provide three key contributions. (i) We augment the existing KINSHIP and MQuAKE resources into navigation-ready KGQA datasets with annotated evidence paths and paraphrased questions. (ii) We design evaluation protocols to measure path fidelity, robustness to linguistic variation, and performance across multi-hop and multi-answer questions. (iii) We adapt established path-based KG completion agents - MINERVA, MultiHopKG, and SQUIRE - to operate on full question embeddings rather than symbolic single-relation queries, enabling their trajectories to be guided by natural-language semantics. Together, these contributions advance KGQA research toward systems where traceability is fundamental: answers are accompanied by explicit reasoning paths whose agreement with reference evidence can be systematically evaluated.

Rewrite rules are critical in equality saturation, an increasingly popular technique in optimizing compilers, synthesizers, and verifiers. Unfortunately, developing high-quality rulesets is difficult and error-prone. Recent work to automatically infer rewrite rules does not scale to large terms or grammars. Users struggle to guide inference and incrementally construct rulesets because existing rule inference tools are monolithic and opaque. As a result, most equality saturation users still manually develop and maintain rulesets. This paper proposes Enumo, a new domain-specific language for programmable theory exploration. Enumo provides a small set of core operators that enable users to strategically guide rule inference and incrementally build rulesets. Short Enumo programs easily replicate results from state-of-the-art tools like Ruler, but Enumo programs can also scale to infer deeper rules from larger grammars than prior approaches. Enumo's composable operators even facilitate developing new strategies for ruleset inference. We introduce a new fast-forwarding strategy which does not require evaluating terms in the target language, and thus supports domains that were out of scope for prior work. Enumo is also easy to extend: two new operators suffice to incorporate large language models into rule inference, where they complement guided search. We evaluate Enumo and fast-forwarding across a variety of domains. Compared to state-of-the-art techniques, Enumo can synthesize better rulesets over a diverse set of domains, in some cases matching the effects of manually developed rulesets in systems driven by equality saturation.

Change visual question answering (Change VQA) requires understanding semantic changes across bi-temporal remote sensing images. Although vision language models (VLMs) have shown promising performance on this task, they remain unreliable when answering questions that require explicit transition statistics, area measurements, or spatial information. To address this limitation, we propose a selective tool use framework in which a single VLM either answers directly or invokes a deterministic change analysis tool to obtain question specific evidence. Specifically, the selected tool operates on bi-temporal semantic maps and returns a structured observation, which the same VLM uses to generate its final answer. To support this framework, we construct a tool augmented extension of CDVQA covering eight question families and three tools for transition, spatial, and temporal analysis. Tool use supervision and observations are derived automatically from the original semantic annotations, without additional manual labeling. We then adapt Qwen3.5-4B using Low Rank Adaptation (LoRA) to jointly learn direct answering, tool invocation, and evidence conditioned answering. Experiments on 7,164 test questions show that selective tool use with reference semantic maps improves overall accuracy from 73.77% to 88.79% and average family accuracy from 69.11% to 89.65%. When the semantic maps are predicted automatically, the framework achieves 77.47% overall accuracy and 75.06% average family accuracy. These results demonstrate the benefit of question-specific semantic evidence for Change VQA, while highlighting the influence of semantic prediction quality on the resulting performance. Code and tool-augmented annotations will be made publicly available at https://github.com/yakoubbazi/ToolChangeVQA.

Recovering editable 3D parametric curves from 2D images is a fundamental challenge in computer graphics, bridging pixel-based perception and vector-based CAD modeling. Existing NeRF- and 3DGS-based methods often rely on dense calibrated views, precomputed 2D edge maps, and costly per-scene optimization, limiting their applicability to casually captured real-world inputs. We propose CGGT, a Curve-Grounded Geometry Transformer that directly grounds 3D-consistent 2D curve instances in the image space from sparse, unposed multi-view images. CGGT combines a geometry-aware transformer encoder for multi-view feature learning with a curve-aware masked-attention decoder for cross-view instance association. In a single forward pass, it predicts camera parameters, dense depth maps, and instance-level 2D curve masks, which are then lifted into 3D and refined through a fast parametric optimization stage to recover compact, editable 3D curve primitives. To support structured curve learning, we introduce Wireframe-100K, a large-scale dataset comprising 100,000 CAD models with diverse topologies, realistic multi-view renderings, and accurate parametric curve annotations. Extensive experiments show that our framework achieves substantial improvements in both reconstruction accuracy and efficiency, particularly under challenging sparse-view settings and in separating persistent 3D structural edges from view-dependent image edges caused by silhouettes, textures, and appearance variations. Despite being trained solely on synthetic data, CGGT generalizes well to real-world images, demonstrating its potential for practical CAD-style wireframe reconstruction from unconstrained visual inputs.

3GPP has progressively expanded AI/ML lifecycle management in the radio access network, from one-sided model control to Release 20 support for two-sided CSI-feedback model pairing. Yet a basic control question remains: when monitoring detects degradation, how quickly must a corrective action take effect? To expose this dependency, we stress-test three activation and rollback strategies in a surrogate regime-shift environment using 150 independently trained PPO candidate policies, each evaluated over 20 matched noise realizations. We add 0-40 control-step delay only to corrective lifecycle commands. With no added delay, stability-gated blending reduces mean post-shift cumulative SLA deficit from 47.02 to 7.57 violation-steps relative to hard cutover; at 40 steps, the deficit rises to 44.38, only 5.6% below the hard-cutover baseline. KPI-threshold rollback loses its advantage within only a few control intervals, while blending degrades more gradually. These results do not set a physical 6G latency bound. They show why timing requirements matter for corrective actions: lifecycle performance depends on when the command takes effect. Motivated by Layer-1/Layer-2 Triggered Mobility, we examine a standards split in which Layer 3 retains lifecycle configuration while a compact Layer 2 trigger is considered only for the latency-critical subset, together with pair-consistency, local-fallback, and security/freshness requirements.

A tensor randomized average block coordinate descent method with heavy-ball momentum is proposed for the tensor least squares problem with respect to the t-product. Theoretical analysis for tensor block coordinate descent method is established and average techniques are applied to avoid the computation of tensor Moore–Penrose inverse. To further accelerate convergence, a heavy-ball momentum scheme is incorporated into the block coordinate descent method, where the step size and momentum parameters are adaptively determined by a two-dimensional minimal residual projection. Theoretical analyses give the convergence of the new method and provide an improved bound on the linear convergence rate. Numerical experiments further verify the efficiency of the proposed method in terms of the number of iterations and the better video recovery performance.

A child with reduced distance vision often does not know that anything is wrong. Children adapt, move closer, and rarely report the difficulty, so the problem can survive years of schooling before an adult notices. School screening addresses part of this, but it runs on a schedule, depends on staffing, and is separated from the classroom moments where the difficulty appears. Smartphone and web-based acuity tests have widened access, yet every one of them still needs somebody to start a test. We present SightSentinel, an architecture that turns a wall display a child already reads from into a recurring screening site. Ordinary educational content carries short calibrated optotype probes, and eight specialized agents divide the work. Perception agents recover viewing distance, recognition accuracy, approach behavior, gaze stability, response latency, and interocular difference from each encounter. A quality agent discards observations taken under bad geometry, poor lighting, or inattention. A longitudinal agent accumulates only the surviving evidence against the child's own baseline, and an orchestrator reports a Vision Concern Score routed through a safety gate whose output range excludes diagnosis, refraction, prescription, and reassurance. The design question is whether many cheap, noisy, well-gated encounters can reach a referral decision that one scheduled test reaches late or misses. We state the formulation, the architecture, a four-stage validation protocol against clinical reference standards, and the conditions under which the approach should be rejected.

Virtual worlds now host classrooms, meetings, conferences, shops, and social venues, and nearly every interaction they expose assumes a user who can scan a three-dimensional scene, follow avatars, and read floating panels. Blind and visually impaired (BVI) users are left with assistive tools that each solve one task in isolation: naming an object, reading text, describing a scene, or planning a route. A live virtual room defeats that model: obstacles, speakers, gestures, chat, slides, and notifications arrive together, and a tool that narrates all of them trades a visual barrier for an auditory one. This paper presents MetaBlind, an architecture that distributes nonvisual access across eight specialized agents, spanning perception, navigation, social and object interaction, communication, safety and trust, memory, and personalization, and that places an Accessibility Orchestrator between those agents and the user. Agents publish candidate information into a shared accessibility context instead of speaking to the user directly. The orchestrator scores each candidate on safety relevance, goal relevance, urgency, confidence, user relevance, and estimated listening load, then releases only the items it judges relevant at that moment through speech, structured audio, or haptic output. We give the selection step a formal statement, specify the orchestration cycle as an algorithm, and define an evaluation protocol against a single-agent assistant. MetaBlind is reported at the design stage, with no prototype measurement or user study, and the protocol states which outcomes would support the design and which would refute it.

Single-GPU long-context inference with Mixture-of-Experts (MoE) models requires spilling the key-value cache (KVCache) to CPU memory. The spilled KV serves two complementary purposes—transferring to the GPU for attention computation, or computing in-place on the CPU—which demand opposing physical states. The optimal split between them varies with workload, yet existing KVCache abstractions offer only storage semantics over a monolithic object of a single physical state, and cannot express dynamic load balancing. We propose InplaceKVCache, the first KVCache abstraction whose format fixes each byte's physical residency at write time, so that the CPU–GPU load balance can be adjusted without moving data after placement. It realizes this as a four-region layout along two dimensions—device affinity and access pattern—turning load balancing into pure scheduling. Built on this abstraction, WriteScope splits CPU–GPU shares along the sequence dimension, and a portable roofline performance model determines the optimal CPU share as sequence length evolves, with online feedback tracking CPU cost drift. On three MoE models (DeepSeek-V2-Lite, Qwen3-30B-A3B, Mixtral-8$\times$7B) with a 32~GB VRAM budget, WriteScope supports end-to-end inference at the 1M-token aggregate scale. In the long-context regime ($\ge$8K), it achieves geometric-mean speedups of $1.5\times$–$2.5\times$ on A100 and $1.4\times$–$1.7\times$ on V100 over four reproduced baselines, while vLLM, SGLang, and KTransformers fail even with a doubled KV budget. A DeepSeek-V4-Flash case study validates composition with native sparse attention.

Geophysical data collected from active field sites are often contaminated by complex and heterogeneous noise, obscuring weak seismic events, and complicating automated interpretation. Although deep learning offers promising solutions for seismic processing, its performance is highly sensitive to the nature of training noise, especially under out-of-distribution (OOD) conditions. This study investigates the influence of noise parameters, such as type, scale, and complexity on the performance, generalization and robustness of neural networks in two geophysical tasks: first break picking and denoising. We simulate seismic-while-drilling data and apply controlled input source noise augmentation using stochastic generators to vary the noise characteristics. Different neural networks are trained on fixed noise types and scales, then evaluated across both seen and unseen noise scenarios. We incrementally increase the complexity of the noise by introducing compound noise mixtures and assess the performance of the model under increasingly challenging OOD conditions. This yields a robustness matrix that captures the generalizability of each model relative to its training configuration. Results indicate that larger noise scales boost generalization, and that effective alignment between noise type, task complexity, and architecture is key for maximizing generalization gains. In addition, training with compound noises mitigate weaknesses associated with single-noise training, acting as an additional implicit regularizer to improving robustness. These findings highlight key factors influencing model resilience in noisy geophysical environments and offer guidance for developing deep learning models that generalize effectively across diverse and unpredictable noise conditions.

Finite-horizon prediction is challenging when observations are limited and a quantity of interest depends on several coupled nonlinear measurement channels. This paper develops a three-phase data-driven twin framework that integrates finite-horizon Hankel–Koopman energy decomposition, inverse-calibrated reconstruction using nonlinear autoregressive models with exogenous inputs, and forecast composition. Channel dynamics are identified and simulated in Hankel coefficient space, with candidate models assessed after reconstruction in physical measurement space. The resulting reduced-order model of the channel dynamics drives recursive prediction of the quantity of interest. Three theorems support the framework, establishing the energy decomposition and modal orthogonality; existence, uniqueness, and inverse stability of the auxiliary continuous inverse-calibration solution; and finite-horizon stability of the composed forecast for a fixed selected model under stated assumptions. A retrospective solar-power case study yields high correlations between predicted and reference trajectories across the considered forecast horizons, demonstrating reproduction of a constructed channels-dependent quantity of interest.

AI scaling studies increasingly evaluate systems that combine a pretrained model with retrieval, search, verification, tools, and interaction. Yet a higher score under a larger budget does not by itself show where additional resources are best spent. This critical integrative review asks when a reported scaling result supports a resource-allocation decision. It compares evidence across pretraining, test-time computation, retrieval, and agent evaluation, distinguishing the performance of a tested procedure from the best performance achievable under a resource limit. The synthesis shows that three mismatches recur across this evidence: success counted before an answer is chosen, information a deployed system will not have, and costs left out of the comparison. A capability surface expresses performance as a function of budgets, mechanisms, and available information. Worked analytical examples show how the evaluation metric, deployment volume, selection rule, and stopping policy can alter an allocation conclusion. A resource envelope provides a structured record of the task, development and run-time resources, information access, and procedure behind a reported score. Its application to a published comparison illustrates which conclusions the evidence supports and which deployment questions remain unresolved. The resulting framework specifies the comparisons needed to choose among feasible systems and motivates experiments on the transfer of allocation rules across tasks and operating conditions. It does not propose a universal scaling law or infer general intelligence from benchmark gains.

Sensor-based human activity recognition (HAR) is fundamental to ubiquitous and wearable computing, yet existing foundation models are largely designed for cloud-scale deployment and struggle with real-world sensing shifts, including unseen users, devices, sampling rates, and sensor placements. We present EdgeHAR, an edge-native compact sensor foundation model designed for wearable intelligence. Unlike conventional models that entangle activity knowledge with acquisition variations, EdgeHAR learns transferable representations by factorizing sensor signals into three latent codes: an (i)Activity-Semantic Code capturing reusable activity knowledge, a (ii)Motion-Dynamics Code modeling temporal patterns, and an (iii)Acquisition-Context Code representing sensor-specific variations. This disentangled design enables efficient adaptation to new users, devices, placements, and activity classes with limited target-domain data. By incorporating lightweight adaptation modules, EdgeHAR achieves foundation-model-level transferability while satisfying edge constraints in computation, memory, latency, and privacy. Experiments across heterogeneous HAR datasets demonstrate that EdgeHAR maintains competitive recognition performance under distribution shifts with substantially reduced deployment cost. EdgeHAR establishes a practical paradigm for compact, edge-first foundation models for ubiquitous sensing systems.

We develop a graph-compatible batched wavefront formulation for upwind discontinuous Galerkin discretisations of linear transport. For sweepable discretisations, the cell equations form a block lower-triangular system under a topological ordering of the directed upwind dependency graph. This causal structure can be shared across families of fixed-source problems whose local operators, sources and inflow data vary. We exploit this observation by grouping channels with a common dependency graph into graph-compatible sweep classes and carrying samples, right-hand sides, energy groups and sign-compatible angular ordinates as tensor dimensions within a common wavefront schedule. We prove that the resulting batched wavefront algorithm is algebraically equivalent to independent classical DG sweeps for every channel in a class, while exposing parallelism simultaneously across wavefront cells and channel dimensions. We realise the formulation as a GPU tensor program based on batched cell-local solves and quantify its work, depth and storage requirements, including the throughput–memory tradeoff introduced by sample microbatching. We further characterise the discrete parameter-to-observable map on fixed face-sign branches and show that reverse-mode differentiation through the wavefront algorithm reproduces the corresponding discrete adjoint action. Numerical experiments verify the expected DG convergence and adjoint consistency, demonstrate substantial GPU execution gains from sample batching, and illustrate the method in a material-shadowing uncertainty-quantification problem and a coupled multigroup C5G7/KAIST-inspired power-iteration workload.

Image colorization is an inherently ill-posed task, since a single grayscale image may correspond to multiple plausible colorized results. Consequently, conventional full-reference image quality assessment (IQA) metrics fail to accurately reflect human perceptual preferences for colorized images. In this paper, we present MCIQA-2K, a large-scale multi-dimensional benchmark specifically designed for no-reference quality assessment of colorized images. We construct a dataset containing 2,000 colorized images generated by five representative colorization models, together with human annotations across three perceptual dimensions: color smearing, semantic color misalignment, and global naturalness. Building upon the proposed benchmark, we further introduce MCIQA, a dedicated multi-branch NR-IQA framework for colorized images. Extensive experiments demonstrate that MCIQA significantly outperforms existing full-reference and no-reference IQA methods on the proposed benchmark, while also exhibiting competitive generalization capability on several widely-used IQA datasets. The dataset and code are publicly available at https://github.com/ARBEZ-ZEBRA/MCIQA.

Integrating recall and pre-ranking in e-commerce search requires candidate generation to account for relevance, personalization, and business value before final ranking. To this end, we present VARG, a generative retrieval system for Tmall App search that directly admits generated item candidates to the existing final ranker. VARG-ID constructs semantic prefixes using RQ-VAE, enhances search relevance through bidirectional query-item contrastive learning, and combines these prefixes with a value-ordered third token to provide fine-grained item addresses and a business-value prior. Three-stage supervised fine-tuning progressively learns item-to-identifier mappings, query-semantic retrieval, and personalized retrieval. Personalized model training combines value-aware and hierarchy-aligned supervision with expanded user context, and uses local ordinal supervision (LO-SFT) to learn the local within-cluster ordering encoded by the third token. Prefix-GRPO combines gated rewards based on output legality, user behavior, ranker advantage, and search relevance with prefix-aware token weighting to align candidate generation with business value and ranking objectives. Coordinated daily product and model updates preserve existing item addresses while incorporating new products and behavioral feedback. Offline experiments on tens of millions of products validate identifier stability and demonstrate gains in retrieval quality and head-level value recall from SFT strategies and Prefix-GRPO over their respective baselines. In a 14-day online A/B test covering 20% of search traffic, VARG directly admits generated candidates to the final ranker and improves GMV by 1.45%, per-user IPV by 0.22%, and PCTR by 0.31%. Online shopping-guide query evaluations further show that VARG maintains competitive relevance with a smaller candidate quota.

It is shown that the (scattered) subsequence problem for two words represented by straight-line programs is $\mathsf{PSPACE}$-complete, even over a binary alphabet. The lower bound is obtained by a polynomial-time reduction from quantified subset sum. If the two words are given explicitly, i.e., uncompressed, then the subsequence problem is hard for uniform $\mathsf{NC}^1$ and in deterministic logspace.

We study edge-weighted online bipartite matching under random arrival order, parameterized by the maximum offline degree $d$ and sampling fraction $\theta$. We analyze two sampling-based frameworks. For Deterministic Greedy Sampling, which computes prices from a fixed-size initial sample and then applies a local threshold rule, we derive an explicit worst-case competitive ratio and prove it tight within this policy family for every fixed $d\ge2$ and $\theta\in[0,1]$. The optimal sampling choice interpolates between no sampling for $d=1,2$ and a dense-limit guarantee of approximately $0.2562$, improving on the classical $1/8$ analysis while retaining linear per-arrival time. We also derive worst-case bounds on the variance of the number of matched offline agents, including order-tight behavior as $\theta\to1_-$ and an $O(\theta)$ bound as $\theta\to0_+$ for fixed $m,d$. For Black-Box Sampling–Matching, we introduce prefix-dependent reweighting followed by an arbitrary approximate offline matching solver and prove a transfer theorem whose guarantee is the offline approximation ratio times an explicit function of $d$ and $\theta$. With exact matching, the framework recovers the classical $1/e$ guarantee in the unbounded-degree limit.

Retrieval-Guided Fine-Tuning (RAG-FT) incorporates retrieved data directly into the training objective, but the statistical consequences of noisy retrieval during training remain theoretically undercharacterized. We study this question by modeling RAG-FT as an estimation problem in a multi-task linear regression framework, using an OLS proxy for single-layer linear self-attention to obtain finite-sample risk bounds. Under homoscedastic retrieval noise, we show that retrieval failure decays exponentially with task separation relative to noise, and derive explicit finite-sample conditions under which RAG-FT achieves lower risk than both target-only and full-corpus training. We then introduce a Distance-Proportional Noise (DPN) model, in which retrieval quality degrades with rank, and compare two estimators under the same retrieval process: the OLS proxy and the literal, uniform-weight forward pass of linear self-attention. We prove that the attention estimator's bias diverges as $\Theta(n^{2q})$ even under exact retrieval, while OLS risk remains $\Theta(d/n)$ for every noise exponent $q>0$. These results locate the instability not in noisy retrieval itself, but in the fixed, unweighted aggregation of the literal LSA forward pass, which reweighting by reliability empirically removes. We validate the predicted rate separation through direct simulation of the DPN model.

We classify all smallest sets of edge deletions that destroy every nonnested perfect matching in a complete ordered graph. The vertices have a fixed linear order. A perfect matching selects edges that use each vertex exactly once; it is nonnested when no selected edge has both endpoints strictly between those of another. On $2k$ vertices, exactly $k$ deletions are necessary, and we describe all $2^k+k-2$ minimum deletion sets for every $k\ge2$. Allowing a matching to leave vertices unused changes the extremal problem. Barát, Freschi and Tóth proposed that an $n$-vertex ordered graph avoiding a nonnested $k$-edge matching can have at most $(k-1)n$ edges. We construct counterexamples for every $k\ge5$ and $n\ge2k+1$. For $n\ge3k$, our constructions exceed the proposed value by a number of edges proportional to $k^2$, matching the order of the known upper bound on this excess. The classification follows from cuts between consecutive intervals; the larger constructions coordinate deletions at the two ends of the vertex order. The exact extremal value remains open in general.

Layer-2 rollups have reshaped Ethereum's transaction economy by replacing mempool competition with deterministic sequencing, sub-second block times, and negligible gas fees. While these properties suppress classical Miner/Maximal Extractable Value (MEV), they give rise to a new and previously unrecognized behavioral regime. In this paper, we introduce the concept of High-Frequency Swapping (HFS), referring to continuous single-hop swaps at machine cadence within decentralized exchanges. Despite its growing footprint, this phenomenon has not been systematically identified or quantified in prior work. We conduct a large-scale measurement of HFS on Arbitrum, using 18 months of full-chain data (Jan. 2023–Jun. 2024). Specifically, we construct a reproducible pipeline that isolates voluntary single-swap transactions, attributes them to the swapper level, and classifies HFS behavior through inter-arrival dynamics. The analysis uncovers 477 distinct HFS swappers responsible for nearly 30 million swaps and over $10^{11}$ USD in notional volume. Our study conducts a comprehensive empirical investigation of HFS from multiple perspectives. We begin with a global overview of activity patterns, and then examine temporal dynamics, swapper identity, token coverage, and venue concentration, and explore swap size, time gap, and order direction. Finally, we explore case-level behavior, including stablecoin arbitrage, CEX-DEX execution gaps, and short-horizon round-trip trading. Across these dimensions, we identify consistent structural regularities that distinguish HFS from conventional retail or arbitrage activity. This work provides a large-scale address-level empirical characterization of High-Frequency Swapping on Arbitrum and a broad empirical foundation for future research on decentralized market microstructure.

Technological advances in neutral-atom platforms have opened a new path toward designing efficient protocols for fault-tolerant quantum computing (FTQC). However, each physical operation is still orders of magnitude slower than on other platforms, such as superconducting qubits. Therefore, architects must identify fast and efficient FTQC architectures, which require reliable modeling tools to explore various design choices across the software, classical hardware, and quantum device stacks of neutral-atom platforms. In this paper, we propose NAQsim, an open-source simulation framework for neutral-atom FTQC architectures based on transversal gates. As its key feature, NAQsim enables detailed full-stack architecture evaluation that opens opportunities to explore previously overlooked performance bottlenecks. As a first use case for NAQsim, we identify one such bottleneck, patch rotations, perform full-stack co-optimization, and finally derive a near-rotation-free architecture (D3-ROT). For practical FTQC benchmark workloads, D3-ROT achieves a 2.27x speedup from this single bottleneck alone, with minimal footprint overhead. These results point to a much broader space of full-stack optimizations that NAQsim makes accessible for transversal surface-code architectures and beyond.

The minimum distance and the covering radius are two fundamental properties of the code. Both have been extended: the former to the generalized Hamming weights hierarchy, and the latter to the generalized covering radii hierarchy. In both cases, the lowest level of the hierarchies corresponds to the classical minimum distance and covering radius, respectively. From a geometric point of view, the minimum distance of the code determines the packing radius, which is upper bounded by the covering radius. It was conjectured this relation extends to all other orders of the hierarchy, namely, that the generalized packing radii are upper bounded by the generalized covering radii of the same order. In this paper we prove this conjecture is true for the second order radii. We also prove the conjecture holds for all orders when the code rate is at most $3/5$. Finally, we show that for any code rate in $(0,1)$, for all sufficiently long codes the conjecture holds for all orders.

Uncrewed Aerial Vehicle (UAV)-assisted Mobile Edge Computing (MEC) is a key technology for future 6G networks, providing wide coverage and flexible computing services. However, the limited resources of UAVs and the dynamic changes in the network structure make it difficult to maintain high efficiency. Existing methods often ignore the semantic information of tasks and the complex relationships among UAVs and mobile terminals, resulting in poor coordination. This paper proposes a joint optimization framework for task offloading, task migration, and trajectory control in semantic communication-enabled multi-UAV edge computing systems, aiming to maximize semantic similarity while minimizing task latency and system energy consumption. To tackle the resultant problem, we develop a Heterogeneous Graph Attention Network-based Multi-Agent Twin Delayed Deep Deterministic Policy Gradient (HAN-MATD3) algorithm. Specifically, we use a heterogeneous graph to model the network topology and apply HAN to extract important semantic features. These features are then integrated into the MATD3 framework to support joint optimization.

Smart contracts, serving as the cornerstone of decentralized applications, autonomously manage trillion-dollar digital assets, making them attractive targets for attacks. Fuzzing has emerged as a promising technique for detecting vulnerabilities in smart contracts, yet existing methods face two main challenges. (1) The logical gap in state transitions and combinatorial redundancy hinders effective tradeoffs between bug detection efficiency and state space exploration cost, leading to critical execution paths to be overlooked. (2) Rule-based sequence mutation strategies suffer from path redundancy and inadequate guidance from contract logic, resulting in performance bottlenecks that stall the exploration of in-depth vulnerability-oriented paths. To tackle these challenges, we propose EchoFuzz, an LLM-guided fuzzing framework introducing Vulnerable Function Call Sequences (VFCS) - minimal, behavior-preserving execution paths that expose bugs through key state transitions. EchoFuzz consists of two key procedures. First, we develop a chain-guided LLM approach, that combines static analysis with logical understanding to generate contract-specific VFCS candidates that eliminate combinatorial redundancy. Second, we adopt an iterative fuzzing strategy that uses LLMs with real-time feedback to adaptively steer fuzzer toward uncovered branches. Experiments show EchoFuzz outperforms state-of-the-art methods, achieving 29% higher branch coverage and detecting 62% more vulnerabilities. It also found 37 previously unknown vulnerabilities in real contracts, showing strong practicality.

Online attention is commonly summarized using cumulative volume, peak activity, or arithmetic averages, but such measures can obscure differences between activity that is sustained over time, concentrated near the present, or renewed after dormancy. This paper introduces the Time-Horizon Engagement Effectiveness (TH-EE) framework, which constructs interpretable temporal profiles of online attention by distinguishing three related but non-equivalent properties: persistence, recency, and re-emergence. We evaluate the framework through controlled engagement traces, a proof-of-concept application to 1,850 YouTube videos across 37 topics (18 cohorts selected a priori as exemplars of persistent, acute, cyclical, and recently originating attention, and 19 cohorts corresponding to authoritatively debunked claims), and an event-level validation on eleven years of daily Wikipedia pageview series for the same topics. The controlled analyses show that the framework distinguishes distributed activity from concentrated bursts, introduces temporal-order sensitivity through recency weighting, and identifies renewed activity after a defined dormant interval. On the event-level series, the framework's reactivations co-locate with Kleinberg burst onsets, and PELT change points far more often than chance. The YouTube application shows that debunked-claim cohorts do not occupy a unique region of temporal-profile space; they exhibit heterogeneous patterns that overlap substantially with benign topics. These results support treating persistence, recency, and re-emergence as separate dimensions of online attention. TH-EE is a descriptive and comparative measurement framework, not a classifier of misinformation, coordination, intent, or content veracity.

Personal AI assistants hold the potential to evolve from digital interfaces into embodied companions capable of guiding users through complex physical activities. For these assistants to become integral to daily life, they must do more than identify objects; they must provide precise, step-by-step instructions that align with a user's real-time progress. While Multimodal Large Language Models (MLLMs) show promise in general visual understanding, their ability to deliver grounded, sequential guidance for fine-grained manipulation tasks remains largely unverified. In this paper, we choose the jigsaw puzzle as a strategic testbed for this capability. Unlike general object recognition, puzzle solving demands high-precision spatial reasoning, the ability to distinguish between minute geometric variations, and a rigorous adherence to sequential logic. We investigate this capability through PuzzleMate, a novel framework focused on jigsaw puzzle solving captured through an egocentric viewpoint. We deploy PuzzleMate in a user-in-the-loop study to evaluate how well state-of-the-art MLLMs perceive the current puzzle state and generate actionable next-step instructions. Our analysis reveals seven key bottlenecks that limit their effectiveness. Building on these insights, we propose a benchmark that enables systematic evaluation of MLLMs' reasoning capabilities for puzzle solving. Our findings reveal a substantial performance gap in current models like GPT-5.2 and Gemini-2.5-Pro; while these MLLMs are highly capable, they struggle to navigate the intricate reasoning and sequential logic essential for jigsaw puzzle assistance.

Accurate 3D localization of unmanned aerial vehicles (UAVs) remains challenging for existing multimodal approaches due to sparse LiDAR geometry, modality-imbalanced fusion, and redundant feature transmission over constrained edge-to-server links. To address these limitations, we propose PRI-Net, an efficient and lightweight multimodal fusion framework for UAV localization that integrates point cloud splatting, residual attention fusion, and an information bottleneck. Specifically, a 3D point cloud splatting (3DPCS) strategy is introduced to transform sparse LiDAR observations into geometrically consistent dense depth maps. A residual attention fusion (RAF) module is then designed to alleviate modal bias by using an image branch for coarse estimation and a gated fusion branch for refinement. In addition, a multimodal information bottleneck (MIB) module compacts features by filtering task-irrelevant redundancy. Experiments show that PRI-Net achieves high localization accuracy with lightweight architectures, while reducing feature dimensionality and improving edge-to-server UAV sensing efficiency and robustness.