The paper in your inbox every morning
Straight from the source · The week's papers

The Tech Gazette

Papers

Vol. I No. 26 Saturday, October 17, 2026 Closing 12:53 PM UTC · next edition 10:00 AM UTC

164 papers from the last 7 days. Under each, what the authors did and what they found, in sentences taken from its own abstract: nothing is rewritten.

Language models

RSS
  1. arXiv cs.CL · Thursday, October 15 · Bowei Liu, Xinchen Zhang, Xuhuan Li et al.

    OmniVerifier-C1: Decomposed Graded Verifier for Rule-Governed Generative World Modeling

    What they did
    To enhance the robustness of visual verifiers in complex multimodal scenarios involving compositional requirements, we move beyond conventional binary verifiers that produce only True/False discrete judgments and introduce a verifier that automatically decomposes complex prompts or environmental rules into fine-grained components and…
    What they found
    ShowOverall, our findings suggest a key insight: the transition from generative models to structured world-modeling agents critically hinges on the availability of accurate pairwise graded visual verifiers.
  2. arXiv cs.CL · Thursday, October 15 · Manya Wadhwa, Pranav Narayanan Venkit, Hiroaki Hayashi et al.

    Training Reasoning Models to Generate Diverse Scientific Ideas

    What they did
    In our work, we study document-grounded ideation, focusing on increasing the diversity of LLM generated ideas and ensuring they are high quality.
    What they found
    ShowWe show that our trained 8B model achieves higher creative utility (a measure combining quality and diversity) than Claude Opus 4.8 and GPT-6 Astra on our contamination-free benchmark.
  3. arXiv cs.CL · Thursday, October 15 · John Mendonça, Daniel Tschernutter, José Pombal et al.

    MindEval2: Clinically Grounded Patients and Rubrics for Evaluating Language Models in Mental Health Support

    What they did
    To bridge these gaps, we introduce MindEval2, an evaluation framework that consists of two components: Mental Health Quality Rubrics (MHQR), for evaluation, and MindSim, for patient simulation.
    What they found
    ShowWe evaluate 18 proprietary and open-weight models on MindEval2, finding that while frontier models have largely improved on issues related to surface level quality and boundaries, guidance calibration remains the dominant failure mode across all models, accounting for most of the quality gap.
  4. arXiv cs.CL · Thursday, October 15 · Zixiang Xu, Zirui Song, Wanrong Zheng et al.

    Grid-Bench: Can LLMs Predict How Discrete Worlds Change?

    What they did
    We introduce Grid-Bench, an executable benchmark in which eight families of operations transform discrete worlds represented as two-, three-, and four-dimensional grids.
  5. arXiv cs.CL · Thursday, October 15 · Faridoun Mehri, Hinrich Schütze

    Knowledge That Is Linear Before Fine-Tuning Generalizes After It

    What they did
    We study this distinction by constructing new relations from existing ones.
  6. arXiv cs.CL · Thursday, October 15 · Alexey A. Bokov, Ivan I. Panin, Nikolay B. Nechaev et al.

    AI Consilium: a Benchmark of LLM Clinical Multidisciplinary Second Opinions

    What they did
    We developed a multidimensional benchmark using 300 diagnostically resolved NEJM--MedQA cases: 110 for physician reference ratings and Judge calibration and 190 for held-out evaluation.
    What they found
    ShowThese findings show that the benchmark can distinguish model capability, the contribution of multidisciplinary synthesis, criterion-specific effects of response structure, deliberation dynamics, and inference requirements within one common-case evaluation.
  7. arXiv cs.CL · Thursday, October 15 · Anton Xue, Alan Li, Rahul Saha

    Multi-Target Few-Shot Prompting with Diffusion Language Models

    What they did
    We therefore introduce multi-target few-shot prompting with diffusion language models, where examples guide the infilling of multiple masked regions within a shared canvas.
    What they found
    ShowAcross few-shot prompting benchmarks and software refactoring case studies, we find that demonstrations improve infilling accuracy, with example guidance yielding further gains in several settings.
  8. arXiv cs.CL · Thursday, October 15 · Yihang Peng, Yi Jing, Dewen Liu et al.

    Not X, but When: Diagnosing a Mandarin LLM Writing Tic through Contextual Appropriateness

    What they did
    We study it through the Mandarin corrective construction bushi X, ershi Y ("not X, but Y").
    What they found
    ShowOf 307 annotated uses, only 1.30% are defective while 52.8% are optional, that is, correct but unneeded, so models fall short in appropriateness far more often than in correctness.
  9. arXiv cs.CL · Thursday, October 15 · Sebastian-Antonio Toma, Jean de Kernier, Mike Ply et al.

    Beyond Downstream QA: Rethinking How We Evaluate Agent Memory

    What they did
    We show this evaluation paradigm is incomplete: it conflates memory correctness with retrieval and generation quality, producing both false positives where correct responses mask broken memory and false negatives where incorrect responses blame correct memory for retrieval failures.
    What they found
    ShowDiagnostic decomposition reveals that the system correctly classifies memory operations (create, update, reinforce, supersede) only 20% of the time, a failure entirely invisible to extrinsic evaluation, and that failure modes differ systematically by category and difficulty.
  10. arXiv cs.CL · Thursday, October 15 · Tianxiang Fei, Jiazheng Kang, Mao Zheng et al.

    Hy-Memory-30B-A3B: Attributed Reinforcement Learning for Long-Term Memory Writing

    What they did
    We present Hy-Memory-30B-A3B, a compact long-term-memory writer trained across Mem0, MemOS, and Hy-Memory.
    What they found
    ShowOn fixed 20% benchmark subsamples, Hy-Memory-30B-A3B ranks first on all four evaluated harnesses, including held-out EverMemOS, with a 55.49% macro average versus 54.62% for Claude Opus 5.
  11. arXiv cs.CL · Thursday, October 15 · Wonjeong Jo, Gyuwan Kim, Ming Shan Hee

    Change the Number, Change the Answer: Assessing Rating Scale Sensitivity in LLM-Based Text Scoring

    What they did
    To address this gap, we define and systematically investigate scale sensitivity, the variation in LLM-generated scores caused by rating scale design.
    What they found
    ShowWe find that changing one design element shifts normalized scores by about 0.10 on average and changes the category of roughly 20% of texts.
  12. arXiv cs.CL · Thursday, October 15 · Yilong Xu, Minrui Xu, Xinyu Zhou et al.

    Mosaic: Multi-Session Agentic Reinforcement Learning

    What they did
    Therefore, we introduce Multi-Session Agentic Reinforcement Learning, a more general setting that supports an arbitrary number of sessions within a trajectory.
    What they found
    ShowFurther analyses show that our method achieves improvements in session utility and allocation, which we suggested is a promising target for future advances in multi-session agentic RL.
  13. arXiv cs.CL · Thursday, October 15 · Jian Gu, Hongyu Zhang, Chunyang Chen et al.

    Lexical Reference Frames: Interpreting LM Residual Streams in Native Semantics

    What they did
    The vocabulary of a language model is its native semantics: the embedding and the unembedding fix the meaning of a state at the two ends of the residual stream.
  14. arXiv cs.CL · Thursday, October 15 · Chengfei Wu, Zhaoqing Wu, Dan Goldwasser

    CLUE: Uncovering Social Context for Pragmatic Understanding

    What they did
    We propose CLUE, a two-stage training pipeline that combines supervised evidence reasoning with GRPO guided by Grounded Information Utilization ($\mathrm{IU}_{\mathrm{G}}$).
    What they found
    ShowThese gains are accompanied by over 80% fewer reasoning tokens on average in both domains.
  15. arXiv cs.CL · Thursday, October 15 · Wei Xia, Yehui Tang, Zhi-Hong Deng

    EMO: A Closed-Loop Test-Time Computation Framework via Alternating Context Optimization and Logits Steering

    What they did
    We introduce EMO, a training-free framework inspired by expectation--maximization that alternates question-specific context estimation (E-step) and distribution refinement (M-step).
    What they found
    ShowUnder greedy decoding across eight models and six benchmarks, EMO improves the zero-shot baseline in 39 of 40 aggregated settings, averaging $+9.10$ percentage points.
  16. arXiv cs.CL · Thursday, October 15 · Shuo Lin, Jinzhe Li, Chenlu Guo et al.

    PremiseSQL: Evaluating Premise Critique and Abstention in Text-to-SQL Systems

    What they did
    We introduce premise critique ability in NL2SQL, namely the ability to recognize flawed queries and abstain from generating misleading SQL.
    What they found
    ShowStronger critique-oriented prompting improves detection and abstention on flawed queries, but also increases false invalid judgments and suppresses SQL generation on originals.
  17. arXiv (systems & security) cs.CL · Thursday, October 15 · Hanbin Bae, Heejin Choi, Joohyung Lee et al.

    HyCo: Hybrid Drafting for Cost-Efficient Mobile-Cloud Speculative Decoding

    What they did
    We present HyCo, which assigns depth to the server model's native multi-token prediction (MTP) head, executed on the device, and alternative branches to one SLM pass.
    What they found
    ShowWithout relaxation, HyCo exact saves 27.7% and 11.9% on the two datasets.
  18. arXiv (systems & security) cs.CL · Thursday, October 15 · Yufan Zhu, Yangfan Jiang, Yang Fei et al.

    QuasiLeak-Bench: Evaluating LLM-Based Privacy Detectors on Policy-Conditioned Quasi-Evidence Group Recovery

    What they did
    We introduce QuasiLeak-Bench, a benchmark for policy-conditioned quasi-evidence group recovery, which evaluates whether detectors recover complete quasi-evidence groups and flag the disclosures the given policy prohibits.
    What they found
    ShowHowever, a 4B model fine-tuned on our training split surpasses the strongest prompted model on held-out documents, showing that the task is learnable.

Machine learning

RSS
  1. ACM TKDD (Knowledge Discovery from Data) · Yesterday

    Data Optimization for LLMs: A Survey

    What they did
    Numerous survey studies have covered various aspects of LLMs, such as learning strategies, applications, alignment, explainability, and evaluation.
  2. ACM TKDD (Knowledge Discovery from Data) · Yesterday

    Multi-Level Text Alignment for Interpretable and Uncertainty-Aware Time Series Forecasting with LLMs

    What they did
    Adapting large language models (LLMs) for time series forecasting introduces unique challenges due to the mismatch between continuous time series tokens and the discrete word tokens LLMs are trained on.
  3. arXiv cs.LG · Thursday, October 15 · Jiachen Yao, Xiyuan Zhang, Annan Yu et al.

    PathFM: Fast Generative Forecasting of Multivariate Trajectories

    What they did
    To model this dependence, we introduce PathFM, a trajectory-based forecasting model that uses flow matching to generate complete future paths.
    What they found
    ShowExperiments on chaotic systems further show that our flow model sustains long-run variability, while strong baselines rapidly collapse.
  4. arXiv cs.LG · Thursday, October 15 · Bingcong Li, Hao Ma, Michael Muehlebach et al.

    Rethinking Routing Exploration in Modern Mixture-of-Experts

    What they did
    We identify an exploration dilemma between these designs: shared experts can make routing less exploratory by reducing the variability of token representations.
    What they found
    ShowMirrorMoE consistently improves performance across model scales.
  5. arXiv cs.LG · Thursday, October 15 · Yihan Xu, Jia-Chen Gu, Junyi Zhang et al.

    Lean Graph Search for Formal Theorem Proving

    What they did
    To this end, we propose LeanGraphSearch, a graph-based retrieval method for Lean 4 that constructs a graph from Mathlib's forward dependencies and traverses it to uncover supporting lemmas through multi-hop dependency chains.
    What they found
    ShowAcross three theorem proving benchmarks, LeanGraphSearch improves pass rate at {8, 16, 32} reflection turns by as much as 40% compared to vanilla prover and at most 10% compared to LeanSearch v2, showing higher accuracy-cost efficiency.
  6. arXiv cs.LG · Thursday, October 15 · Chengze Xie, Xuan Wang, Ying Ding et al.

    Robust Reinforcement Learning for Dynamic Treatment Regimes under Model and Measurement Uncertainty

    What they did
    We develop a robust reinforcement learning (RL) framework for learning adaptive treatment policies that generalize across patients and remain reliable under errors in the measured biomarker and shifts in the disease dynamics.
    What they found
    ShowOur findings suggest that robust RL holds great promise as a principled methodology for learning reliable adaptive treatment policies.
  7. arXiv cs.LG · Thursday, October 15 · Hedi Zisling, Liran Nochumsohn, Ilan Naiman et al.

    Twice Upon a Time: Complementary Representations for Time-Series Reasoning

    What they did
    We instead introduce complementary representations as a design principle for time-series reasoning.
    What they found
    ShowTogether, these results demonstrate that complementary representations provide an effective design principle for general-purpose TSLMs, enabling models to exploit temporal structure without sacrificing access to the original measurement frame.
  8. arXiv cs.LG · Thursday, October 15 · Leyang Shen, Yaxin Gong, Yang Zhang et al.

    Learning to Steer LLM Agents and Multi-Agent Systems

    What they did
    In this work, we propose a steering agent that supervises execution on the fly and steers the system back on track when drift occurs.
    What they found
    ShowExperiments on information-seeking search tasks show that the steering agent provides effective supervision for both single-agent and multi-agent systems, improving their performance and efficiency.
  9. arXiv cs.LG · Thursday, October 15 · Arnav Chavan, Kusha Sareen, Rishabh Tiwari et al.

    Towards Continual Learning: Mitigating Forgetting With Subspace Tuning

    What they did
    In this work, we introduce Subspace Tuning (SST), which restricts each weight update to the bottom singular subspace, eliminating changes along the principal directions.
    What they found
    ShowWith these mechanisms, protecting as much as 99\% of the weight subspace substantially improves retention while preserving strong target-task performance.
  10. arXiv cs.LG · Thursday, October 15 · Yuan-Chen Chang, Niklas Herbster, Gauthier Gidel et al.

    CAT-alyzing Honesty: Continuous Adversarial Training for Transferable LLM Honesty

    What they did
    We introduce Continuous Adversarial Training for Consistent Honesty (CATCH), inspired by a method originally developed to robustly refuse harmful queries.
    What they found
    ShowHowever, CATCH surpasses honesty steering in maintaining utility, thanks to a novel choice of utility data.
  11. arXiv cs.LG · Thursday, October 15 · Omar Adalat, Edwin Hamel-De le Court, Francesco Belardinelli

    Learning Rational Strategies for Temporal Objectives in Multi-Agent Systems

    What they did
    We study rational synthesis for stochastic multi-agent systems with unknown dynamics, where each agent is equipped with its own probabilistic temporal objective specified using Probabilistic Linear Temporal Logic on Finite Traces ($\mathsf{PLTL}_f}$).
  12. arXiv cs.LG · Thursday, October 15 · Anikait Singh, Teresa Zhang, Yoonho Lee et al.

    Librarian Agents: Training LLMs to Curate Long-Context Workspaces that Anticipate Future Queries

    What they did
    We build on a key asymmetry in modern agentic harnesses (e.g., Claude Code): while LLM agents are adept at navigating existing filesystems to solve an immediate task, they are rarely trained to construct reusable workspaces for future use.
    What they found
    ShowEmpirically, Librarian Agents outperforms the strongest retrieval and precomputation baselines by 33 percentage points on BrowseComp-Plus, amortizes upfront construction costs across repeated queries, and generalizes zero-shot to unseen domains on BRIGHT with a 31-point average accuracy improvement.
  13. arXiv cs.LG · Thursday, October 15 · Shuo Han, Ziqing Hu

    Baselines and Score Centering in Policy Gradient Estimation

    What they did
    Reinforcement learning has become a widely used approach to post-training large language models.
  14. arXiv cs.LG · Thursday, October 15 · Arjun Dadhwal, Brian Summa

    Topology-Inspired Fine-Tuning for Wind-Field Super-Resolution

    What they did
    Scientific super-resolution (SR) models are typically optimized with pointwise reconstruction losses, yet scientific interpretation often hinges on extrema, connected regions, and multiscale scalar structure.
    What they found
    ShowMean MT distance also improves, but on only 91 of those 150 fields, indicating that PD and MT capture complementary structure.
  15. arXiv cs.LG · Thursday, October 15 · Max Zhu, Bohang Sun, Pietro Lio et al.

    BitSparse: Compact Activation Storage for ReLU Feed-Forward Networks

    What they did
    We present BitSparse, a GPU-resident lossless compression format for sparse activations.
  16. arXiv cs.LG · Thursday, October 15 · Spyros Dragazis, Yilei Chen, Aldo Pacchiano

    Explore Once, Evaluate Many: Multiple Policy Evaluation for Stochastic Linear Bandits

    What they did
    We study how to evaluate $K$ target policies simultaneously in stochastic contextual bandits with linear reward structure.
  17. arXiv stat.ML · Thursday, October 15 · Julie Alberge, Linus Bleistein, Judith Abécassis et al.

    SurvICL: a Foundation Model for in-context Survival Analysis

    What they did
    We address this issue by introducing SurvICL, a TFM that predicts survival curves in-context.
    What they found
    ShowOn the 63 datasets held out from all design decisions, SurvICL outperforms 20 tree-based, deep, and foundation-model baselines without any tuning: it wins 82.9\% of pairwise comparisons in integrated Brier score, against 71.3\% for the runner-up, the Cox model, and is the first model to rank above Cox on small datasets.
  18. arXiv cs.LG · Thursday, October 15 · Shiyuan Zhang, Xuheng Li, Qiwei Di et al.

    Query-Efficient Rejection Sampling for Parallel Masked Diffusion

    What they did
    We propose the Single-Increment Rejection Sampler (SIRS), which provides an estimate of the log acceptance probability from a single randomly sampled increment at the cost of one query.
    What they found
    ShowWe show that the KL-divergence between the data distribution and the SIRS output is bounded by a clipping term plus the model's training error.
  19. arXiv cs.LG · Thursday, October 15 · Bangji Yang, Jiajun Fan, Zhaoyu Zhu et al.

    Training-Free On-Policy Distillation

    What they did
    We show that the consolidation does not need training: with forward passes only, the capabilities of separately tuned specialists can be aggregated into one model that is, on average, more accurate than either specialist alone.
  20. arXiv cs.LG · Thursday, October 15 · Bowen Yang, Kaiming Jin, Zichen Ding et al.

    OS-Helix: Unifying GUI Interaction and Code Execution in Native Computer-Using Agents

    What they did
    We present OS-Helix, an end-to-end trained multimodal computer-using agent that unifies GUI actions and code execution in one action space.
    What they found
    ShowOn OSWorld-Verified, OS-Helix-27B and OS-Helix-35B-A3B achieve relative improvements of 35.0% and 33.7% over their matched Qwen3.5 hybrid baselines, while OS-Helix-27B-RL further improves by 42.9% to reach 66.44% success.
  21. arXiv cs.LG · Thursday, October 15 · Ruixi Hu, Liang Wu

    Generalization Guarantees of Randomized Block Coordinate Descent for Nonconvex Learning

    What they did
    Finally, we develop dimension-independent bounds for loss functions of a specific structure, making the generalization guarantees applicable to high-dimensional problems.
  22. arXiv cs.LG · Thursday, October 15 · Max Zhu, Bohang Sun, Pietro Lio et al.

    LCT: Losslessly Compressed Tensors with GPU friendly execution for Training

    What they did
    We introduce Losslessly Compressed Tensors (LCT), a GPU execution framework designed for this repeated encode-decode regime.
    What they found
    ShowOn a 162M-parameter NanoGPT, LCT reduces memory usage by $24.6\%$ for a $7.2\%$ step-time increase.
  23. arXiv cs.LG · Thursday, October 15 · Nahum Banks, Gustavo A. M. de Almeida, Sergio Maldonado

    The importance of tensor handling and implementation of physics-informed DeepONets

    What they did
    Despite these advantages, we show that their application to higher-dimensional problems remains limited by the computational cost of training.
    What they found
    ShowThese results demonstrate that careful consideration of how PI-DeepONets are implemented can yield substantial gains, enhancing the practical performance of PI-DeepONets and enabling their application to otherwise intractable physics-informed learning problems.
  24. arXiv (systems & security) cs.LG · Thursday, October 15 · Ke Xiao, Qiyuan Wang, Christos Anagnostopoulos

    Local Epochs as Optimal Stopping: Theory and Evidence in Federated Learning

    What they did
    We prove that this one-stage look-ahead threshold is optimal whenever stopping decisions are nested, derive closed forms for geometric and power-law returns, and show that an estimated rule loses utility only through wrong-signed decisions.
  25. arXiv (systems & security) cs.LG · Thursday, October 15 · Yukun Tian, Junwei Su, Haofeng Xu et al.

    ReFlow: Replay-Driven Decoupling for Efficient RL Post-Training

    What they did
    This paper presents ReFlow, a system-algorithm co-designed RL framework for efficient LLM post-training.
    What they found
    ShowExperiments across representative single-turn reasoning and multi-turn agentic RL tasks show that ReFlow improves training throughput by up to $2.06\times$ over state-of-the-art synchronous and asynchronous RL systems, while maintaining comparable or better model performance.

AI and agents

RSS
  1. ACM TIST (Intelligent Systems) · Yesterday

    CodaRAG: Connecting the Dots with Associativity Inspired by Complementary Learning

    What they did
    Large Language Models (LLMs) struggle with knowledge-intensive tasks due to hallucinations and fragmented reasoning over dispersed information.
  2. arXiv cs.AI · Thursday, October 15 · Dongxu Yang, Hongda Yan, Renxin Wang et al.

    FDE-Gym: The Last Mile of AI Delivery

    What they did
    We introduce FDE-Gym, a benchmark of 95 end-to-end delivery tasks from 20 customer scenarios across 18 sectors, each adapted by industry experts from real-world delivery projects.
    What they found
    ShowThese results reveal a substantial gap between solving well-specified tasks and delivering effective AI systems for real customers.
  3. arXiv cs.AI · Thursday, October 15 · Shangheng Du, Jinxin Shi, Shuaiyu Zhang et al.

    MLExpert: Towards a Generalist Agentic Model for Autonomous Machine Learning Engineering

    What they did
    We propose a post-training method for autonomous long-horizon MLE optimization and apply it to train MLExpert, a 35B Mixture-of-Experts agentic model.
    What they found
    ShowFurther experiments show that MLExpert improves performance on NatureBench Lite, agent scaffold optimization, and algorithm optimization, suggesting that the learned optimization capability generalizes to other tasks.
  4. arXiv cs.AI · Thursday, October 15 · Trizal Garg, Sibayan Mitra, Arya Karanjkar et al.

    Evaluation Awareness Beyond English: Do LLMs Act Differently When Tested in Indic Languages?

    What they did
    We release all 47,880 judged responses to support further work.
    What they found
    ShowThese results suggest that safety evaluations in Indic languages may not reflect how models treat their everyday users.
  5. arXiv cs.AI · Thursday, October 15 · Siqi Chen, Zhengxi Lu, Yuchen Yan et al.

    KnowGPO: Knowledge-Grouped Policy Optimization for Search Agents

    What they did
    We propose KnowGPO, a reinforcement learning framework that aligns trajectories by the task-relevant knowledge they have acquired rather than by their surface observations.
    What they found
    ShowExperiments on Xbench, BrowseComp-ZH, and GAIA show KnowGPO consistently outperforms outcome-only (GRPO) and process-supervision baselines (GiGPO, IGPO) by 3.8 to 4.2 points, with our 8B model rivaling or exceeding most 32B open-source systems.
  6. arXiv cs.AI · Thursday, October 15 · Weijian Luo, Yujian Chen, Hao Jiang et al.

    Designing Transformers for Continuous Diffusion Language Models

    What they did
    In this paper, we conduct a systematic study on Transformer architectures for CDLMs and introduce Language Diffusion Transformer (LangDiT), combining feature and query-key normalization, wider noise conditioning, likelihood-shortcut gradient routing and calibration, and confidence-gated training self-conditioning.
    What they found
    ShowOur study identifies architectural design as an important source of improvement in continuous diffusion language models.
  7. arXiv cs.MA · Thursday, October 15 · Guowei Xu, Zhenting Qi, Amani Kiruga et al.

    Learning Self-Orchestration in Decentralized Agent Swarms

    What they did
    We introduce market-based post-training (MPT), a framework for jointly learning action policies and self-orchestration in decentralized agent swarms.
    What they found
    ShowAblations show that both action and bidding benefit from learning, and that learned bids provide more effective action-training signals.
  8. arXiv cs.AI · Thursday, October 15 · Maxence Faldor, Satinder Singh, Roberta Raileanu

    A team of Gemini 4 Argon agents beats Minecraft

    What they did
    We describe the setup, how the run unfolded, the team's strategies (dividing the work, sharing what they learned, recovering each other's items), and the limits of the result.
  9. arXiv cs.AI · Thursday, October 15 · Dixi Yao, Tahseen Rabbani, Tian Li

    Private Retrieval Augmented Generation via Random Projection

    What they did
    We propose a simple method to preserve datastore privacy in RAG systems via random projection.
    What they found
    ShowOur results for the first time suggest that random projection can serve as a competitive and practical baseline for privacy-preserving RAG systems.
  10. arXiv cs.AI · Thursday, October 15 · Hanane Nour Moussa, Doeun Lee, Sachin Kumar

    EliteReplay: Preserving Diverse Solutions in RL Post-Training via Quality-Diversity Search

    What they did
    We propose EliteReplay, a post-training recipe that pairs GRPO with an "elite" archive built by quality-diversity search.
    What they found
    ShowIt preserves most of the base model's correct strategies, outperforming existing methods in strategy retention.
  11. arXiv cs.AI · Thursday, October 15 · Sergey Rodionov

    Improving Environment-Agnostic Coding Agents: The Role of Scaffolding

    What they did
    We investigate why this advantage persists and whether an environment-agnostic agent can be improved without environment-specific engineering.
    What they found
    ShowA complementary AGI Maze experiment shows that additional tutorial experience can reduce performance.
  12. arXiv cs.AI · Thursday, October 15 · Qingni Wang, Changdae Oh, Yuzhe Yang et al.

    LEASH: Uncertainty-Aware Weak-to-Strong Escalation and Oversight for Computer-Use Agents

    What they did
    To this end, we propose LEASH, a training-free framework that unleashes the strong agent only when the weak agent's latent uncertainty signals it is needed, and keeps it on a leash afterward.
    What they found
    ShowWith Qwen3.5-35B-A3B, LEASH achieves 73.66% task success at $0.4117 per task, matching always-on Claude Opus 5 (72.90%) while reducing inference cost by 19.2%.
  13. arXiv (vision, retrieval & HCI) cs.MA · Thursday, October 15 · Florian Lercher, Karan Mahesh, Yujun Huang et al.

    Auditable and Deployable Multi-Agent Motion Planning via Posetal Games from Legal Guidelines

    What they did
    We present a framework for multi-agent motion planning under legal requirements based on games with partially ordered preferences (posetal games).
    What they found
    ShowThese results indicate that guideline-based posetal games offer an auditable route from partially specified laws to multi-agent motion planning.
  14. arXiv cs.AI · Thursday, October 15 · Adhwaa Al-Chaab, Ayman Younis, Dario Pompili

    X-RIC: An Agentic RAN-Intelligent Controller Benchmark for Enhancing Reinforcement Learning

    What they did
    We propose eXplainable RIC (X-RIC), a novel framework integrating agentic AI into O-RAN architectures.
    What they found
    ShowX-RIC achieves 89% operational cost reduction while maintaining SLA compliance, converging 75% faster with 50% fewer training steps and 46% lower variance.
  15. arXiv cs.AI · Thursday, October 15 · Sima Noorani, Shayan Kiyani, George Pappas et al.

    Disagreement-Guided Weak-to-Strong Routing

    What they did
    In particular, we introduce a notion of model disagreement that can be measured directly from model-generated responses, without ground-truth supervision.
    What they found
    ShowMoreover, even when ground-truth correctness signals are available for training, disagreement-based routing can outperform methods trained directly to predict correctness
  16. arXiv cs.AI · Thursday, October 15 · Hasan Demirkiran, Jens Ernstberger

    Shortcut Sensitivity in Agent-Safety Evaluations

    What they did
    We introduce a three-level shortcut-auditing framework and audit completed LinuxArena trajectories and two TS-Bench-derived step datasets.
    What they found
    ShowBoth effects remain nonzero after subtracting the formatting-placebo effect, with exploratory 95% ranges excluding zero.
  17. arXiv cs.AI · Thursday, October 15 · Yu Feng, Liyi Zhou, Haoyu Wang et al.

    GNN-Guided Local Refinement for Efficient Layout Decomposition with DSA-MP

    What they did
    To address these issues, we introduce a new conflict graph model capturing the previously overlooked constraints and develop a local refinement strategy powered by the graph neural network, enabling efficient and scalable layout decomposition.
    What they found
    ShowExperiments demonstrate that our method achieves higher solution quality with faster convergence than state-of-the-art methods, while maintaining robustness across layout scales, design styles, technology nodes, and varying mask counts.
  18. arXiv cs.AI · Thursday, October 15 · Yanchen Deng, Jianguo Huang, Yao Long Teng et al.

    HTN-Orchestrate: A Hierarchical Task Network Framework for Multi-Agent Orchestration

    What they did
    Therefore, we introduce HTN-Orchestrate, a two-layer framework that separates these responsibilities through a hierarchical task network (HTN).
    What they found
    ShowOn five benchmarks spanning web research, scientific reasoning, and research workflows, HTN-Orchestrate outperforms ReAct, Agent Team, and DeepSeek Harness using the same base model, achieving 89.73% accuracy on BrowseComp and 73.44% on SUPERChem, exceeding Agent Team by 2.45 and 4.69 percentage points, respectively.
  19. arXiv cs.AI · Thursday, October 15 · Bingxiang He, Pengqi Sun, Shihao Peng et al.

    AutoSFT: An Agentic System for Automated Data Research in Supervised Fine-Tuning

    What they did
    We design a data action space for these changes and ask whether an automated system can make the full range rather than one of them, and what structure that requires.
    What they found
    ShowOur findings suggest that automating SFT data research depends more on covering diverse data actions than on a stronger single action.
  20. arXiv cs.AI · Thursday, October 15 · Junyao Yang, Zongxia Li, Yucheng Shi et al.

    Terminal-RSI: Recursive Self-Improving Terminal Agents via Recursive Self-Rewrite and Policy-Refine

    What they did
    We present Terminal-RSI, which alternates Recursive Self-Rewrite (RSR) of verified trajectories with critic-inheriting Recursive Policy-Refine (RPR).
    What they found
    ShowOn LHTB, process reward rises from 0.21 to 0.37 and strict completion from 0/46 to 5/46; SWR100 success doubles from 3.00% to 6.00%.
  21. arXiv cs.AI · Thursday, October 15 · Yiyin Shen, Xinyi Ai, Weibing Wang et al.

    Multi-sourced AI Tutor for Non-Native English Speaker Students

    What they did
    To aid such students, we developed a general-purpose AI tutor system that can process student questions in foreign languages (currently focused on Mandarin) and provide bilingual responses.
    What they found
    ShowThe tutor also provided high-quality translations for 76.92% of the questions and generated technical term glossaries for 64.47% of them.
  22. arXiv cs.AI · Thursday, October 15 · Jingyu Tang, Xu Yang, Zhehao Zhang et al.

    Realtime-Bench: Can Frontier Models Solve Real-time Interactive Problems?

    What they did
    We introduce Realtime-Bench, a suite of carefully curated dynamic tasks where delayed actions directly affect success.
    What they found
    ShowThese findings suggest directions for improving real-time multimodal agents, including adaptive reasoning with temporal awareness and continuous perception and action.
  23. arXiv (systems & security) cs.AI · Thursday, October 15 · Ali Mohammadi Shanghooshabad

    FAOPs: Normal Forms and an Algebra for AI Agent Workflows

    What they did
    We present Functional Agent Operating Procedures (FAOP), a formal theory that brings database-grade discipline to AI agent workflows.
  24. ACM TIST (Intelligent Systems) · Thursday, October 15

    Density-Assisted Adaptive Alignment Network for Video Individual Counting

    What they did
    Video Individual Counting (VIC), which aims to enumerate unique individuals in a video sequence, is a vital problem with key applications in urban analytics, including transportation management and public safety.
  25. ACM TIST (Intelligent Systems) · Wednesday, October 14

    Synthetic Hate Speech Data Underrepresents Minority Groups

    What they did
    The use of synthetic data is becoming increasingly widespread in a variety of applications.

Software engineering

RSS
  1. ACM TOSEM · Yesterday

    LLMSA-MC: Bridging LLM Reasoning and Static Analysis for Detecting Missing-Check Bugs in Linux Kernels

    What they did
    Missing security checks on critical variables are an important class of semantic bugs in the Linux kernel and can lead to severe vulnerabilities.
  2. arXiv (systems & security) cs.SE · Thursday, October 15 · Asif Mohammed Saad, Ahsanul Ameen Sabit, Jonah Brandenburgh et al.

    Are We Testing the Wrong Quantum Bugs? A Study of Fault Representation Gaps in Quantum Software Testing

    What they did
    We investigate how well the faults represented by these artifacts reflect those encountered in modern quantum software.
    What they found
    ShowYet only 56 of the 410 real-world bugs (13.7%) belong to families represented by either source; the remaining 354 (86.3%) belong to families absent from both.
  3. ACM TOSEM · Thursday, October 15

    Model Context Protocol (MCP) Tool Descriptions Are Smelly! Towards Improving AI Agent Efficiency with Augmented MCP Tool Descriptions,

    What they did
    The Model Context Protocol (MCP) introduces a standard specification that defines how Foundation Model (FM)-based agents should interact with external systems by invoking tools.
  4. ACM TOSEM · Wednesday, October 14

    DefectReviewer: Towards Generating Defect-Focused Review Comment Based on Fine-Grained Defect Localization

    What they did
    Code review is critical to software quality assurance, with defect detection as a primary objective.
  5. ACM TOSEM · Sunday, October 11

    Agile in the Hybrid Era: Unpacking Meetings in Software Development

    What they did
    Hybrid work has become firmly established as a standard practice in software development in the post-pandemic era.
  6. ACM TOSEM · Sunday, October 11

    BHunter: Generating Blind-Spot Driving Scenarios for Robustness Testing of Perception Systems

    What they did
    For widespread deployment of autonomous driving systems (ADS), perception robustness plays a fundamental role.
  7. ACM TOSEM · Sunday, October 11

    Detecting Vulnerabilities in EOSIO Smart Contracts via Joint Static and Dynamic Feature Learning

    What they did
    This paper addresses the security challenges of EOSIO smart contracts, which are deployed in WebAssembly bytecode, frequently targeted by attacks, and inherently difficult to analyze.

Security

RSS
  1. arXiv (systems & security) cs.CR · Thursday, October 15 · Zeqian Huang, Mingyue Tang, Aonan Guan et al.

    My Credentials, Please: Detecting Filesystem Capability Laundering in MCP Servers at Scale

    What they did
    We study the resulting vulnerability class, filesystem capability laundering, where attacker-steered arguments cause a tool to access sensitive host files outside its declared contract and deployment scope.
    What they found
    ShowAcross 21,097 MCP servers from nine registries, 787 of 4,806 triaged servers (16.4%) exhibit filesystem capabilities despite non-filesystem functional classifications.
  2. arXiv cs.CR · Thursday, October 15 · Hasan Demirkiran, Jens Ernstberger

    Language Is a Security Surface for Agent Guards

    What they did
    We build LinguaGuardBench from the 1,220 labelled steps of TS-Bench AgentDojo-Traj: we translate only the user instruction into German, French, Turkish, Swahili and Amharic, and keep every tool call, observation and label byte-identical, so any change in a verdict is attributable to language alone.
  3. arXiv (systems & security) cs.CR · Thursday, October 15 · Tao Duan, Junzhou Zhao, Jianglong Li et al.

    MAppPrint: Robust and Real-time Mobile App Fingerprinting via Traffic Behavior Correlation Graphs

    What they did
    In this paper, we propose MAppPrint, a robust and real-time app fingerprinting framework.
    What they found
    ShowMeanwhile, MAppPrint is robust in dynamic networking conditions, while achieving a throughput of 10.5 GB/s and a prediction latency of 0.68 seconds.
  4. arXiv (systems & security) cs.CR · Thursday, October 15 · Christian Skalka, Steven Baldasty, Yeonhee Yeh et al.

    SMT-Boosted Security Types and Correctness for Low-Level MPC

    What they did
    We develop a new Hoare logic and type theory to automatically enforce correctness, confidentiality, and integrity properties of protocols written in the Prelude/Overture language framework.
  5. arXiv (systems & security) cs.CR · Thursday, October 15 · Linda Beková, Rodrigo Alves

    Encoded but Exposed: Language Embeddings can Reveal More Than They Should in Recommender Systems

    What they did
    We study whether item embeddings can reveal item identities when an adversary has access to auxiliary item text from external sources.
    What they found
    ShowWe show that a simple cosine-similarity attack can recover item identities with high mean reciprocal rank across language models and candidate-set settings on two real-world datasets.
  6. arXiv (systems & security) cs.CR · Thursday, October 15 · Zhiyuan Wang, Yuezhi Zhou, Ziqi Zhang et al.

    BiShield-TEE: On the (In-)Security of Unilateral Weight Obfuscation in On-Device TEE-Shielded LLM Partition

    What they did
    We identify a vulnerability in this design, termed the \emph{Solution Determinacy Property (SDP)}: the obfuscation secret is uniquely determined, exposing the structure of the true key and enabling attackers to break the protection.
    What they found
    ShowExperiments across diverse models and datasets show that \textsc{BiShield-TEE} confines attack accuracy to the full-shielding black-box baseline, while achieving higher inference efficiency than prior methods on real hardware.Our code is available at https://github.com/laduiw/BiShield-TEE.
  7. arXiv (systems & security) cs.CR · Thursday, October 15 · Wenting Li, Jannik Albrecht, Frederik Armknecht et al.

    On the Robustness of Gossip Protocols in Modern Blockchains

    What they did
    In this paper, we study the robustness of widely deployed gossip protocols used in committee-based blockchains against realistic network adversaries.
    What they found
    ShowOur results reveal surprising tradeoffs: Solana's dynamic trees are bandwidth-efficient in benign settings but fragile under adaptive attacks; Polkadot's grid achieves strong robustness at the cost of high bandwidth overhead; GossipSub is both bandwidth-efficient and resilient to adaptive adversaries, yet highly sensitive to parameter…
  8. arXiv (systems & security) cs.CR · Thursday, October 15 · Yufei Chen, Yao Wang, Haibin Zhang

    Poisoning the Neighborhood: A Topology-Aware Topic-Level Attack on Large-Scale HNSW-based RAG Systems

    What they did
    We present a topology-aware topic-level poisoning attack against large-scale HNSW-RAG that generalizes to unseen topic queries.
    What they found
    ShowStructural analyses show that the Hub-Satellite topology forms in HNSW, indicating that graph structure contributes to improved poisoned-document retrieval.
  9. arXiv (systems & security) cs.CR · Thursday, October 15 · Jieyu Li, Jingya Li, Sheng Li et al.

    What Survives Self-Evolution: Provenance Marks in Copied Agent Harnesses

    What they did
    We give the first measurement of marks under this attack, with three evolvers, five proposers and two environments.
    What they found
    ShowA scheme-aware plagiarist reshuffles the ties at no measurable cost, and a plagiarist who asks the proposer for more general code removes the key in 75-100% of rewrites.
  10. arXiv (systems & security) cs.CR · Thursday, October 15 · Revanth Reddy Lingala, K. Gangadhara Rao, Padigela Srujan et al.

    Benchmarking Post-Quantum Key Encapsulation in S3-Compatible Object Storage under Client Concurrency

    What they did
    We address this problem by measuring per-object ML-KEM against classical key exchange on an S3-compatible object store, with two client implementations, two processor types and up to 500 concurrent workers, using pre-registered experiments and statistical equivalence tests.
    What they found
    ShowControlled experiments on one processor type traced most of that loss to the way the software library was called, and a second, native client showed that the size of the loss depends on the implementation.
  11. arXiv (systems & security) cs.CR · Thursday, October 15 · Zexun Wang

    Matoi: Selective Revalidation of Consequence Evidence for Agent Authorization

    What they did
    Matoi separates reusable consequence evidence from current execution authority and durable occurrence history.
    What they found
    ShowCombined representation/reuse reductions against full proof are 10.87 and 16.53 percent; five of twelve family intervals for the matched comparison cross one in each language.
  12. arXiv (systems & security) cs.CR · Thursday, October 15 · Huaien Zhang, Zhengjie Zhao, Yu Pei et al.

    Evaluating and Improving Static Application Security Testing Tools for Rust

    What they did
    In this paper, we first conduct an empirical evaluation of mainstream Rust SAST tools using security vulnerabilities identified in real-world Rust applications.
  13. arXiv (systems & security) cs.CR · Thursday, October 15 · Huaien Zhang, Yu Pei, Hao Chen et al.

    Combining LLM and Dynamic Analysis for Universal Testing of Static Application Security Testing Tools

    What they did
    We present LLM4SAST, the first universal framework detecting faults in SAST tools using large language models and dynamic feedback.
    What they found
    ShowThe proposed heuristics eliminate 47.8% of false positives, and LLM4SAST detects 3.4 times more faults while requiring only 39.8% of the variants compared to existing approaches.
  14. arXiv (systems & security) cs.CR · Thursday, October 15 · Daniel Gilkarov, Ran Dubin

    When Rotation Bounds Nothing: Streaming Image Classifiers to Field Nodes Under Physical Capture

    What they did
    Field nodes run image classifiers locally, exposing a first-class asset, the trained model, to theft.
    What they found
    ShowAgainst the same architecture sliced from a public pretrained backbone, the adversary downloads those stages, recovering at least 90% of maximum accuracy at all depths, taking usable CIFAR-100 seizures from 0.0% to 97.3% at 5 s, given the victim's full labelled training set.
  15. arXiv (systems & security) cs.CR · Thursday, October 15 · Tri Budi Sabdo Utomo, Kazushi Okamoto, Koki Karube et al.

    Trigger Value Selection in Clean-Label Malware Backdoors: An Effectiveness-Detectability Analysis

    What they did
    In this paper, we study trigger value selection as an independent design factor in clean-label backdoor attacks against feature-based malware classifiers.
    What they found
    ShowThese findings show that trigger value selection is not merely an implementation detail, but an important design choice that shapes the effectiveness and detectability profile of clean-label malware backdoor attacks.
  16. arXiv (systems & security) cs.CR · Thursday, October 15 · Zhiyuan Zhang

    From One Query to Many: A Critical Survey of Privacy Accounting in RAG

    What they did
    We analyze their underlying assumptions and privacy--utility trade-offs.

Systems and databases

RSS
  1. ACM TACO (Architecture and Code Optimization) · Today

    AdaFuse: Adaptive Function Fusion for Dynamic Serverless Workflows

    What they did
    Serverless workflows are commonly modeled as directed acyclic graphs (DAGs) composed of fine-grained functions.
  2. arXiv (systems & security) cs.DB · Thursday, October 15 · Yujeong Jo, Incheol Baek, Changbeom Shim et al.

    TraHist: Fast and Accurate Cardinality Estimation for Trajectory Data (Extended Version)

    What they did
    To this end, we propose TraHist, a histogram-based estimator approximating density-aligned partitioning via efficient grid-based propagation.
    What they found
    ShowExperiments on large-scale real-world datasets show that TraHist reduces estimation error by over 20x relative to the strongest competing estimator in query regimes where trajectory fragmentation is a dominant source of estimation error, while maintaining sub-millisecond query latency and competitive construction cost.
  3. arXiv cs.DC · Thursday, October 15 · Haoyu Zhang, Arshad Rahman, Adnan Aziz et al.

    Architecting for Hardware Diversity: Meta's End-to-End Co-Design for High-Performance AI Training on AMD GPUs

    What they did
    This paper presents our methods for optimizing alternative accelerators, using AMD Instinct MI350X versus NVIDIA B200 for recommendation model training as a case study.
    What they found
    ShowCompared to the directly ported baseline, these methods deliver up to 1.5x improvement in end-to-end training throughput.
  4. arXiv (systems & security) cs.DC · Thursday, October 15 · Mingjin Zhang, Jiannong Cao, Tao Wu et al.

    Efficient KV Cache Migration for Geo-Distributed LLM Inference in Collaborative Edge Computing

    What they did
    In this work, we propose EdgeFlow, a novel hybrid KV cache migration scheme that integrates direct KV cache transmission with activation-based recomputation, leveraging parallel computation and communication to minimize migration time.
    What they found
    ShowExtensive experiments on a real-world distributed LLM inference platform demonstrate that EdgeFlow reduces migration time by up to 45%, significantly enhancing the robustness and efficiency of distributed LLM inference in collaborative edge computing.
  5. arXiv (systems & security) cs.DC · Thursday, October 15 · Mianjie Yu, Zhongmin Zhao, Zizhao Mo et al.

    ETH: Data-Balanced Heterogeneous Pipeline Parallelism for Training Large Models

    What they did
    In this paper, we propose Heterogeneous Pipeline Parallelism (HPP), a novel approach enabling efficient and fine-grained data balance across heterogeneous pipelines.
    What they found
    ShowEvaluations demonstrate ETH achieves up to 2x training speedup while reducing configuration generation overhead by up to 56x compared to state-of-the-art systems.
  6. arXiv (systems & security) cs.DC · Thursday, October 15 · Zhuojun Tian, Ming Xiao, Mikael Skoglund

    Resource-aware Sub-network Allocation for Heterogeneous Decentralized Learning

    What they did
    We propose RASA-DL, a resource-aware sub-network allocation framework that treats the maximum sub-network width assigned to each node as a deployment variable.
    What they found
    ShowUnder the Moderate and Severe regimes, the minimum-latency operating point improves accuracy over the largest globally feasible uniform deployment by 2.80 and 2.43 percentage points, respectively, at the same modeled round latency.
  7. arXiv (systems & security) cs.DC · Thursday, October 15 · Zhu Wenbo

    Exact Makespan Bounds and the GPipe Homogeneity Bias for Heterogeneous LLM Inference Pipelines

    What they did
    We give an exact critical-path characterization of the makespan of micro-batch pipelines serving LLMs on heterogeneous GPU clusters, quantifying how the classic homogeneous GPipe formula errs.
    What they found
    ShowThese results quantify the GPipe overestimate, decompose the bias into a homogeneity term Sum_j (tau_max - tau_j) and a communication-ignoring term Sum_j d_j, and imply that balancing per-stage compute dominates communication reduction for steady-state throughput.
  8. arXiv (systems & security) cs.DB · Thursday, October 15 · Isabelle Mohr, John Dujany, Andre Freitas

    Reflective Compositional Grounding for Natural-Language-to-SPARQL

    What they did
    We present an NL2SPARQL framework that places conceptual compositionality at the center of query interpretation and connects it to the relational composition required for binding and query construction.
  9. ACM TACO (Architecture and Code Optimization) · Thursday, October 15

    Fast Forgiving Base64 Decoding with SIMD Instructions

    What they did
    On the Internet, we use the Base64 format to represent binary data (e.g., images or cryptographic keys) as text.
  10. ACM TACO (Architecture and Code Optimization) · Thursday, October 15

    LOAD: Enabling Low-Bit Group Quantization for Vision Transformers via Adaptive Data Formats

    What they found
    Vision Transformers (ViTs) achieve state-of-the-art performance across various vision tasks but pose significant deployment challenges due to their high computational complexity and memory footprint.
  11. arXiv (systems & security) cs.DB · Thursday, October 15 · Zhutao Zhuang, Nong Xiao, Zhiguang Chen et al.

    ConStore: Search-Overlapped Prefetch and Co-Retrieval-Aware Content Storage for Disk-Based ANNS

    What they did
    We present ConStore, a content storage engine combining two complementary techniques to reduce end-to-end retrieval latency.
    What they found
    ShowSeparate experiments on 100M- and billion-vector indexes demonstrate SICP's applicability at larger scales.
  12. arXiv (systems & security) cs.DC · Thursday, October 15 · Muhammad Ibrahim

    When the KV Cache Is Slower Than the GPU: Scaling Remote KV Tiers for Context-Parallel Prefill

    What they did
    We study such a tier in a disaggregated deployment of GLM-5.3, an FP8 mixture-of-experts model with multi-head latent attention (MLA), on 8xB300 nodes running prefill context parallelism (PCP8).
    What they found
    ShowThe sharded store raises prefill throughput by 14%, and by 34% together with an upstream kernel fix.
  13. arXiv (systems & security) cs.DB · Thursday, October 15 · Xiangrui Yang, Yifan Lei, Jiawei Yang et al.

    AdaBool: Sparse Boolean Matrix Processing with Adaptive Data Representation

    What they did
    We present AdaBool, a SpBMM framework designed to reconcile this tension through an adaptive data representation.
    What they found
    ShowWe implement AdaBool end to end with low-level system optimizations, evaluate it on both production and public workloads, and show that it outperforms representative baselines by over an order of magnitude.
  14. arXiv (systems & security) cs.OS · Thursday, October 15 · Ying He, Dingsen Shi, Yanbo Dai et al.

    Characterizing Predictability-Latency Trade-offs of KV-Cache SSD Offloading in LMCache for LLM Serving Systems

    What they did
    In this paper, we study LMCache through realworld multi-session workloads that span same/different context x same/different prompt, using over 100 stateless requests per workload.
    What they found
    ShowSecond, deduplication delivers a dramatic write reduction only for the exact-repeat workload: one set collapses from 1.62 GB to 11.75 MB of writes, while the other three sets remain in the 2-5 GB range.
  15. ACM TACO (Architecture and Code Optimization) · Wednesday, October 14

    PRIOR-I/O: Real-time Performance Improvement through Dynamic Resource Allocation for Virtual I/O

  16. ACM TACO (Architecture and Code Optimization) · Wednesday, October 14

    Q-GMRES: Quantized Data Transmission Optimization for Distributed GMRES Algorithm

    What they did
    The generalized minimal residual (GMRES) algorithm is one of the key iterative algorithms for solving large-scale sparse linear systems, which finds extensive application in scientific and engineering computations.
  17. ACM TACO (Architecture and Code Optimization) · Wednesday, October 14

    ReHGNN: A Digital-Analog Processing-in-Memory Architecture for Sparse-Dense Matrix Multiplication in Hypergraph Neural Networks

    What they did
    Resistive random access memory (ReRAM) based analog processing-in-memory (APIM) architectures have been extensively explored for accelerating matrix multiplication in various artificial neural networks (ANNs).
  18. ACM TACO (Architecture and Code Optimization) · Wednesday, October 14

    StrataJ: Enhancing File System Journaling Scalability via Adaptive Concurrency Control and Full-Stack Optimizations

    What they did
    The scalability of file system journaling faces significant challenges due to the increasing concurrency demands of modern multi-core CPUs and high throughput NVMe SSDs.
  19. ACM TACO (Architecture and Code Optimization) · Tuesday, October 13

    GPU-Accelerated Gate-Level Time-Based Power Analysis via Event-Density-Aware Partitioning and Kernel Fusion

    What they did
    Power analysis is crucial in modern chip design flow.

Programming languages

RSS
  1. ACM TOPLAS · Wednesday, October 14

    Denotational Semantics for Probabilistic and Concurrent Programs

    What they did
    We develop a denotational model for probabilistic and concurrent imperative programs , a class of programs with standard control flow via conditionals and while-loops, as well as probabilistic actions and parallel composition.

Vision

RSS
  1. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Yitong Xia, Zeren Jiang, Chuanxia Zheng

    Gen4P: Video Generators are 4D Perceivers

    What they did
    We introduce Gen4P, a unified framework for recovering 4D geometry and motion from monocular video.
    What they found
    ShowTogether, these results demonstrate the potential of video generative pretraining for unified 4D perception.
  2. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · SeungJu Cha, Ye-Chan Kim, HyunGee Kim et al.

    Which Tokens to Merge? Diffusion Dynamics for Efficient Image Generation

    What they did
    In this work, we propose Dynamics-aware Token Merging (DaTMe), a training-free framework that grounds token merging in the underlying diffusion dynamics.
    What they found
    ShowExperiments on PixArt-a and FLUX demonstrate that DaTMe maintains visual fidelity across the entire image, highlighting diffusion dynamics as an effective token-level merging decision in efficient generation.
  3. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Shimon Malnick, Nadav Orenstein, Ohad Fried et al.

    SoftCache: Adaptive Step Size Caching for Diffusion Transformers

    What they did
    We propose SoftCache, which performs soft caching: instead of a binary switch, the headroom sets how far each cached step goes.
    What they found
    ShowSoftCache requires no training and adds no per-backbone settings: on FLUX for images and on HunyuanVideo and Wan2.1 for video, at speedups from $3.5\times$ to $6.9\times$, it is ahead of every baseline on all four fidelity metrics.
  4. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Zirui Wu, Chen Guo, Tianjian Jiang et al.

    Perceive, Predict, and Plan: a Unified World Action Model for Egocentric Dexterous Manipulation

    What they did
    We introduce P$^{3}$-WAM, a unified world action model for egocentric dexterous manipulation that learns 3D perception, action-conditioned prediction, and goal-directed planning through three complementary modes: Perceive, which reconstructs articulated hand motion and camera trajectories from video; Predict, which generates visual…
    What they found
    ShowThrough unified training, our model outperforms specialized baselines on 3D hand reconstruction and action-conditioned video prediction across four datasets, while producing goal-directed manipulation videos with stronger instruction adherence and action progression than video-generation baselines.
  5. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Shuanglin Li, Jiaying Lin, Shuquan Ye

    Grounding Generative Verification in 3D Content

    What they did
    We argue that building reliable 3D systems requires not only stronger generation and reasoning, but also verification feedback that identifies unmet requirements and explains their violations, allowing systems to reflect on and refine their outputs.
    What they found
    ShowIn human-labeled sixteen-candidate pools, oracle selection improves complete factual success from 26.7% to 90.0%.
  6. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Han Su, Meng Tian, Tianyu Huang et al.

    DK-VLM: Geometry as Position for Spatial Reasoning in Vision-Language Models

    What they did
    We propose DK-VLM with Dual-Kernel Attention, which computes attention from both a visual token's input position and its geometric position in the scene.
    What they found
    ShowRC supervision further improves multi-step spatial reasoning, while the full model preserves general video understanding.
  7. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Chen Yang, Jiemin Fang, Fanpeng Meng et al.

    SUPRA-TEX: 3D Generation with Super-Aligned Texture

    What they did
    To resolve these challenges, we introduce SUPRA-Tex, built on the principle of decoupling visible-material estimation, surface alignment, and observation-guided 3D completion.
    What they found
    ShowTrained solely on public datasets, SUPRA-Tex achieves SOTA performance in both geometry-conditioned texturing and end-to-end asset generation, matching or even exceeding leading commercial systems on in-the-wild images.
  8. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Hyunwook Choi, Seungryong Kim, Dongyoon Han et al.

    Speculative Forcing for Efficient Autoregressive Video Generation

    What they did
    We introduce Speculative Forcing, a framework that treats intermediate clean estimates as drafts and predicts when individual tokens can be safely accepted early.
    What they found
    ShowOn Lingbot-World 2.0, where camera motion continually changes the visible content, it maintains quality with ~2.5 denoising steps per token and runs 1.35x faster at 24.5 fps.
  9. arXiv cs.CV · Thursday, October 15 · Hongchang Liu, Jian Liu, Yujuan Ding et al.

    GeoState: Learning View-Decoupled Geometry States for 3D World Modeling

    What they did
    We propose GeoState, a view-decoupled geometry representation for predictive 3D world modeling that separates scene-state evolution from camera-dependent observation.
    What they found
    ShowExperiments show that GeoState outperforms prior 3D world models on Waymo, supports geometrically consistent cross-view querying, and generalizes zero-shot to KITTI and nuScenes.
  10. arXiv cs.CV · Thursday, October 15 · Yipeng Gao, Ziyao Zeng, Jinfa Huang et al.

    3DCodeVerse: Exploring 3D Worlds as Code

    What they did
    We introduce 3DCodeVerse, a research ecosystem that enables coding agents to create editable and verifiable 3D content at scale. 3DCodeVerse comprises large-scale, high-quality datasets of executable 3D code, a coding harness for spatial reasoning and automated verification, and practical guidance for 3D coding.
    What they found
    ShowNotably, our 3DCodeVerse harness achieves a 90% win rate against Claude Design (3D Object) in pairwise human evaluations, when both are utilized by Claude Opus 5.5.
  11. arXiv cs.CV · Thursday, October 15 · Sara Dorfman, Nir Goren, Gal Barak et al.

    ACEdit: Stable Multi-Turn Image Editing via Asymmetric Conditioning

    What they did
    We introduce a training scheme that makes multi-turn image editing stable under this accumulating distribution shift.
    What they found
    ShowExperiments show substantially reduced degradation over long multi-turn sequences while maintaining editing quality and instruction adherence.
  12. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Rıza Alp Güler

    Dense4D: Pixel-Level 4D Human Correspondence

    What they did
    We introduce Dense4D, to our knowledge the first feed-forward model dedicated to dense 4D correspondence across the body, clothing and hair from a set of monocular RGB images, without a body template.
    What they found
    ShowExperiments on real people demonstrate substantially higher tracking accuracy and closer agreement with scanned surfaces than the evaluated baselines.
  13. arXiv cs.CV · Thursday, October 15 · Yuruo Wu, Kaihang Pan, Kai Shen et al.

    AVC-Reward: Event-Centric Audio-Video Consistency Evaluation

    What they did
    We propose an event-centric evaluation framework that disentangles audio and visual events at the event level, analyzes each event independently, cross-validates relations across modalities, and aggregates the judgments into a coarse-to-fine, three-level consistency metric.
    What they found
    ShowAVC-Reward achieves state-of-the-art alignment with human judgment among automatic methods, provides interpretable rationales that localize failures, and improves the audio-video consistency of a joint generation model when used as an online reinforcement-learning signal.
  14. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · SeungJu Cha, Ye-Chan Kim, Kwanyoung Lee et al.

    Not Just a Subject: Capturing Adaptive Scene-Specific Variance for Visual Storytelling

    What they did
    We propose EOS-Story, a training-free framework that harmonizes identity consistency with scene-specific adaptation across text and vision spaces.
    What they found
    ShowExtensive experiments show that EOS-Story achieves competitive or superior performance on both benchmarks.
  15. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Qiuhong Shen, Shizun Wang, Xinchao Wang

    Velox: Spatial Memory Makes World Models Efficient

    What they did
    To address this bottleneck, we introduce Velox, a training-free attention router for region-level context selection using frustum slab correspondences from streaming geometry.
    What they found
    ShowThe fixed token-block granularity matches FlashAttention-style tiled execution and reduces the attention term that grows with rollout length.
  16. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Girish Kumar Adari

    ARC-SORT: Adaptive, Robust, Compensated Multi-Object Tracking with Interacting Multiple Models

    What they did
    We present ARC-SORT (Adaptive, Robust, Compensated SORT), a tracking-by-detection tracker that trains nothing and runs in real time.
  17. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Jay N. Paranjape, Jurijs Nazarovs, Rohan Sarkar et al.

    Grounded Human-Attributed Description and Activity Recognition in Videos

    What they did
    In this work, we introduce the task of Grounded Human-Attributed Description and Activity Recognition (GHADAR), which involves describing the characteristics and activity descriptions of \textbf{every} person in a video, provided the location of the person in the video, which is more practical for real-world applications.
    What they found
    ShowFinally, we demonstrate the limitations of existing evaluation metrics, which are overly reliant on human-annotations and exact text-text matching.
  18. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Qiuhong Shen, Yiding Yang, Yuxin Zhang et al.

    Routing Policy Optimization for Online Diffusion Reinforcement Learning

    What they did
    We instead ask whether stochastic exploration can be introduced inside the generator while preserving its original sampler.
    What they found
    ShowExperiments on text-to-image and text-to-video generation show that RPO improves generation quality while achieving nearly 4x higher training efficiency than Flow-GRPO-style methods.
  19. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Luozheng Qin, Yuhan Zhu, Changhai Zhou et al.

    MJev-Spatial: System One Spatial Intelligence via Native Attention Matching

    What they did
    In light of this, we introduce MJev-Spatial, a System 1 multimodal decision model that tackles all three types of spatial understanding tasks within a unified classification framework.
    What they found
    ShowBuilt on Qwen3.5-4B and trained on 12.3M question-answer pairs converted from existing spatial datasets, MJev-Spatial achieves the highest overall score (65.64%) among eight tested models, ranks first on seven of twelve benchmarks, and outperforms its unmodified autoregressive base model on all twelve, while running 2.5 times faster than…
  20. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Juan Irving Vasquez

    Unsupervised Clustering of Public Transport Vehicles Using Deep Morphological Features and Color Histograms

    What they did
    This study presents an unsupervised clustering methodology for public transport vehicles that combines morphological features extracted with a frozen DINOv2 Vision Transformer and handcrafted HSV color histograms through weighted early fusion, followed by UMAP projection and K-Means clustering.
    What they found
    ShowThese results show that color complements self-supervised features for route-level clustering, provided that it does not dominate the representation.
  21. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Kwanyoung Lee, SeungJu Cha, Yebin Ahn et al.

    Beyond Pairwise Repulsion: Collective Diversity via Determinant Maximization in Diffusion Sampling

    What they did
    We propose DetNO (Determinant Noise Optimization), which formulates diverse generation as RKHS volume maximization on the initial noise, maximizing the log-determinant of an RBF Gram matrix over one-step Tweedie predictions.
    What they found
    ShowFixing the pipeline and varying only the batch objective, both RBF-based aggregators outperform InfoNCE, and the log-determinant attains the best downstream accuracy on both benchmarks.
  22. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Yufei Jiao, Jinfa Huang, Zeyue Xue et al.

    SCOPE: Semantic Bounded Credit Optimization for Prompt Engineering in Text-to-image Generation

    What they did
    We propose SCOPE, an objective based on Group Relative Policy Optimization (GRPO) that aligns update weighting with this structure.
    What they found
    ShowAblation studies show that both semantic boundaries and pooling within spans contribute to these gains, supporting semantic structure as a practical inductive bias for prompt engineering with RL.
  23. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · James Willoughby, Irina Voiculescu

    FPG-Seg: Annotation-free Retinal Vessel Topology Segmentation

    What they did
    We present FPG-Seg, an annotation-free pipeline for retinal vessel segmentation combining classical vesselness filtering, Bayesian deep learning and topology-aware graph reconstruction to segment retinal vessel topology without manual labels.
  24. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Huanyao Zhang, Jiepeng Zhou, Jiaye Lin et al.

    MMSearch-OPD: Easy Made Hard, Hard Made Learnable for Long-Horizon Multimodal Search Agents

    What they did
    We introduce MMSearch-OPD, combining controllable data refinement with joint reinforcement learning (RL) and on-policy distillation (OPD).
    What they found
    ShowExperiments show gains from data refinement and further improvements from joint training after SFT, indicating stronger long-horizon multimodal deep search capabilities.
  25. arXiv (vision, retrieval & HCI) cs.CV · Thursday, October 15 · Yue Yu, Bowei Kang, Changsheng Gao et al.

    WaveLLM: Wavelet-Domain LLM Entropy Modeling for Lossless Image Compression

    What they did
    Motivated by this insight, we propose WaveLLM, a wavelet-domain LLM-based entropy model for lossless image compression.
    What they found
    ShowBuilt on Llama-3.2-3B with LoRA adaptation, WaveLLM achieves 2.51, 2.24, and 2.27 bpsp on Kodak, CLIC.pro, and DIV2K, respectively, outperforming the PixelCNN-based codec using the same wavelet transform by 0.43, 0.36, and 0.46 bpsp, and surpassing recent LLM-based lossless compressors on all three benchmarks.

Search and retrieval

RSS
  1. ACM TOIS (Information Systems) · Yesterday

    Learning Popularity-Aware User Representations for Sequential Recommendation via Retrieval-Augmentation

    What they did
    Sequential recommendation methods are important in recommender systems, as they capture users’ dynamic interests from their historical behavior sequences.
  2. ACM TOIS (Information Systems) · Sunday, October 11

    Distilling Transitional Patterns to Multimodal Large Language Models for Session-based Recommendation

    What they did
    Session-based recommendation (SBR) predicts the next item based on anonymous sessions.
  3. ACM TOIS (Information Systems) · Sunday, October 11

    GaCLLM: Large Language Model with Graph Convolution for Recommendation

    What they did
    Leveraging auxiliary textual data can help with user profiling and item characterization in recommender systems (RSs).

Journals and labs

RSS
  1. Anthropic Research · Yesterday

    Designing more efficient quantum circuits with Claude

    What they did
    Working largely on its own, Claude designed quantum circuits that improve on the best published versions, in some cases by an order of magnitude or more.
  2. Communications of the ACM · Yesterday

    AI and Communications of the ACM

  3. Communications of the ACM · Yesterday

    Is Recursive Self-Improvement Really Here?

    What they did
    Frontier labs say their AI models now help build their own successors.
  4. NVIDIA Research · Yesterday

    Imitation Learning of Avoidance Modes for Efficient Multimodal Model Predictive Control

  5. NVIDIA Research · Yesterday

    EdgeWise: Bringing Long-Horizon Agents to the Edge via Selective Cloud Delegation

    What they did
    EdgeWise: Bringing Long-Horizon Agents to the Edge via Selective Cloud Delegation Complex and long-horizon agent tasks often rely on frontier models deployed in the cloud to achieve strong performance.
  6. Nature: Computer Science · Thursday, October 15

    History’s long-secret codes are being cracked by amateurs using AI

  7. arXiv cs.RO · Thursday, October 15 · Zhixu Li, Keqian Tang, Litian Gong et al.

    LIBERO-PeRM: Benchmarking Personalized Robotic Manipulation

    What they did
    We introduce LIBERO-PeRM, a benchmark for preference learning in embodied agents.
    What they found
    ShowMixed training achieves better no-preference retention than sequential adaptation and improves performance with contextual prompts compared with preference-only training, but can weaken motion-preference learning; preference generalization, decomposition, and conflict handling remain difficult.
  8. arXiv quant-ph · Thursday, October 15 · Andi Gu, Alek H. Kemeny, Susanne F. Yelin et al.

    Discovering state-of-the-art quantum circuits with large language models

    What they did
    Here we introduce an evolutionary framework in which large language models (LLMs) propose circuit designs and an independent evaluator verifies and scores them.
    What they found
    ShowBy handling reversibility differently, the architecture makes divsteps -- a classical algorithm previously impractical for reversible integer arithmetic -- viable and substantially improves the Toffoli-qubit trade-off for modular inversion.
  9. arXiv cs.RO · Thursday, October 15 · Chenyuan Zhou, Yining Hong, Huang Huang et al.

    T2-z: Test-Time Optimization of Environment Latents for Robotic World Models

    What they did
    We introduce T2-Z for test-time optimization of environment latents, which augments a robotic world model with a learnable environment latent to condition world predictions.
    What they found
    ShowAblations further show that T2-Z can efficiently infer environment latents from as little as a single test-time interaction trajectory.
  10. arXiv cs.RO · Thursday, October 15 · Tianjiao Yu, Zhilin Ou, Yifan Shen et al.

    CoDA: Co-Evolution of Data Engines and Action Policies

    What they did
    We introduce CoDA, a framework in which a simulation data engine and an action policy co-evolve through a shared heterogeneous memory of environment construction, policy failures, and learning progress.
    What they found
    ShowOn LIBERO-Pro, 15 rounds of generation and training raise success from 25% to 84% under position perturbations and from 1% to 76% under instruction perturbations.
  11. arXiv cs.RO · Thursday, October 15 · Botao He, Yiming Dou, Yiannis Aloimonos et al.

    Dexterity from Supervised Play

    What they did
    We present DSP: Dexterity from supervised play, a framework in which a robot learns a play policy from minutes of human play through behavior cloning, then deploys it autonomously to collect hours of interaction data to train a world model.
    What they found
    ShowThese results demonstrate that supervised play can autonomously collect interaction data, guide model-based planning, and enable policy learning without any task-specific demonstrations or sim-to-real transfer.
  12. arXiv cs.SD · Thursday, October 15 · Admir Krnić, Kosta Pavlović, Petar Nedić et al.

    Backward Compatibility in Zero-Bit Neural Audio Watermarking

    What they did
    In this paper the concept of backward compatibility in zero-bit audio watermarking is formalized.
  13. arXiv cs.RO · Thursday, October 15 · Helena Merker, Nick Walker, Andreea Bobu

    Asking Smarter Questions: Targeted Active Preference Learning for Underspecified Rewards

    What they did
    We propose shifting this burden to the robot.
    What they found
    ShowIn simulation, the informed prior beats the standard active preference learning baseline by up to $30.8\%$ in the low-query regime, where reducing human effort matters most.
  14. arXiv (systems & security) cs.DS · Thursday, October 15 · Sofya Raskhodnikova, Adam Smith, Connor Wagaman et al.

    Subgraph Counting with Local Node Differential Privacy

    What they did
    We study the problem of approximately counting subgraphs under local node differential privacy (LNDP), a recently introduced model that enforces strong privacy guarantees in analyses of distributed social networks.
    What they found
    ShowThus, our algorithm achieves optimal error for counting constant-size subgraphs, up to $\mathrm{poly}(1/\varepsilon)$ factors.
  15. arXiv (vision, retrieval & HCI) eess.IV · Thursday, October 15 · Saptarshi Mandal, Oindrila Haldar, Chirayata Bhattacharya et al.

    Denoising Textures is a Different Ballgame Altogether!

    What they did
    In this paper, we analyze the behavior of state-of-the-art (SOTA) denoisers on texture datasets and show that performance improvements are possible only by fine-tuning the denoisers on the texture datasets.
  16. arXiv cs.GT · Thursday, October 15 · Ian Gemp, Shubhendu Trivedi, Adam Fisch et al.

    Decentralized LLM Workflows via Sequential Auctions

    What they did
    We present a scalable framework for solving multi-step tasks through a decentralized market of self-interested agents.
    What they found
    ShowAcross a diverse set of domains, we demonstrate that imperfect competition successfully sustains necessary agent profit margins while maintaining high task success rates at low costs.
  17. arXiv (vision, retrieval & HCI) eess.SY · Thursday, October 15 · Madison Book, Justin Bradley

    Robust Multi-Agent Pursuit with Preemptive Communication via Reachability-Based Control Barrier Functions

    What they did
    In this work, we propose a unified control/communication strategy that provides safe control to guarantee inter-agent safety under intermittent communication and demonstrate its effectiveness in a pursuit-evasion scenario.
    What they found
    ShowWe implement and simulate a variety of pursuit-evasion scenarios and show that preemptive communication reduces messages by 77.5% compared to periodic and event-triggered baselines with zero collisions.
  18. arXiv cond-mat.dis-nn · Thursday, October 15 · Francesco Alemanno

    Attention over noisy examples: generalization and memorization in the exponential Hopfield network

    What they did
    In Hebbian learning from examples a Hopfield network of $N$ neurons is not supplied with the $K$ archetypes it has to retrieve but with $M$ blurred examples of each, of quality $r$, and whether it can infer them depends on the load $α=K/N$ (interference among them) and on the dataset entropy $ρ=(1-r^2)/(Mr^2)$ (how little the examples…
  19. arXiv cs.RO · Thursday, October 15 · Conor Mc Gartoll, An Dang, Pranay Thangeda et al.

    Whole-Body Dexterity

    What they did
    We introduce Whole-Body Dexterity (WBD), a general framework that uses the robot's body and appendages as contact surfaces to grasp and manipulate objects.
    What they found
    ShowAcross real-world whole-body manipulation tasks, the distilled controller completes 90% of trials, compared with 18% for direct retargeting and 4% for a generalist whole-body controller.
  20. arXiv cs.RO · Thursday, October 15 · Juliette Marrie, Paul Pacaud, Adrien Ramanana Rahary et al.

    REKI: Registering Knowledge in VLAs

    What they did
    We introduce REKI, a 2.4B vision-language-action model (VLA) pretrained exclusively on public data that sets a new Pareto frontier between performance and model size: on LIBERO-Plus, RoboTwin Clean2Rand and RoboCasa365, it is outperformed only by models about twice its size.
    What they found
    ShowThis memory improves success in simulation and on real robots, and makes oscillations between poses about four times rarer.
  21. ACM Computing Surveys · Thursday, October 15

    Facial Expression and Behavior Modeling from Digital Avatars to Expressive Humanoid Robots: A Review

    What they did
    Endowing humanoid robots with expressive, controllable, and robust facial expressions and behaviors is essential for advancing human-like humanoid-human interaction across social, healthcare, and service domains.
  22. Communications of the ACM · Thursday, October 15

    Tailoring Elective Courses to Enhance Women’s Participation in Computing

    What they did
    Women remain underrepresented in computing programs globally, despite the growing relevance and reach of the field.
  23. arXiv (systems & security) q-fin.TR · Thursday, October 15 · Doohwi Cha, Hanhee Kim, Hyeonjun Yeo et al.

    Pricing the Unprovable: Ambiguity, Turnstile Runs, and the Verifiability Discount in Crypto Protocols

    What they did
    We introduce VDISC, a reproducible framework that records reported loss, exposed value, public evidence, returns, and pool flows separately.
  24. arXiv (systems & security) q-fin.TR · Thursday, October 15 · Doohwi Cha, Minsuk Sung, Minjae Lee et al.

    NEST: Stale-Robust Tokenized-Stock Measurement for a Crypto-Treasury LETF Stack

    What they did
    We develop NEST, a stale-robust protocol that separates this shared-history fit from conditional measurement value.
    What they found
    ShowA trade-level reconstruction on Gate gives 25.2%; NVDAX and AAPLX clear their frontiers, whereas TSLAX does not.
  25. arXiv (systems & security) math.NT · Thursday, October 15 · Yi Ouyang, Wei Wei, Zheng Xu

    Smoothness of Shortest Isogenies to Frobenius Conjugates

    What they did
    Let $E$ be chosen uniformly from the geometric isomorphism classes of supersingular elliptic curves over $\overline{\mathbb{F}}_p$ and $δ_E$ be the minimum degree of isogenies from $E$ to its Frobenius conjugate $E^{(p)}$.