Clay weekly context brief for the Computer Science category (ISO week 2026-W44).

Clay tracks publications from the Computer Science feed list. Below are recent items from this category, each with its source and a short description of what the publication covers when one is available in the source feed.

Recent publications:
1. PATH: Preference-Aware Traversability Estimation for Robotic Teleoperation in Off-Road Navigation
   Source: cs.RO (Robotics)
   Link: https://arxiv.org/abs/2610.30605
   Traversability estimation is critical for ground vehicle teleoperation, yet existing methods often neglect the human operator's preferences for speed and risk tolerance.
2. Query-Conditioned Liquid Temporal Grounding for Long-Form Audio
   Source: cs.SD (Sound)
   Link: https://arxiv.org/abs/2610.31252
   Long-form temporal audio grounding (TAG) is challenging because target events often occupy only a small portion of a recording, while queries may impose multiple semantic constraints over a large temporal search space.
3. Strategic Arbitrage in Electricity Markets: A Multi-Agent Policy Optimization Framework
   Source: cs.SY (Systems and Control)
   Link: https://arxiv.org/abs/2610.30446
   Grid-scale storage and load aggregators are growing quickly in wholesale electricity markets.
4. X-pressing Intimacy: Mental Health Disclosure After Twitter Acquisition
   Source: cs.SI (Social and Information Networks)
   Link: https://arxiv.org/abs/2610.30413
   Social media platforms provide spaces for individuals to disclose mental health experiences and seek support, yet how these disclosures evolve during major shifts in platform governance remains unclear.
5. Proba: A High-Performance, Low-Traffic Probabilistic Spatial Memory Streaming Prefetcher
   Source: cs.AR (Hardware Architecture)
   Link: https://arxiv.org/abs/2610.30448
   Spatial Memory Streaming (SMS) prefetchers exploit recurring spatial access patterns across memory regions to predict future accesses.
6. A Quadratic Lens on Muon's Polar Update: Benefits, Pitfalls, and the Role of Newton-Schulz
   Source: cs.LG (Machine Learning)
   Link: https://arxiv.org/abs/2610.30280
   Muon updates matrix-valued parameters along approximately orthogonalized directions and often trains large language models faster than AdamW, yet it remains unclear when and why orthogonalization helps.
7. SARIA: Persistence-Aware KV Caching with Coordinated DRAM--SSD Reload for LLM Agents
   Source: cs.OS (Operating Systems)
   Link: https://arxiv.org/abs/2610.31169
   Multi-turn LLM agents usually reuse long context prefixes, making key value (KV) caching crucial for reducing prefill latency.
8. Integrated Sensing and Communication in 3GPP: Evolution from 5G-Advanced to 6G
   Source: cs.NI (Networking and Internet Architecture)
   Link: https://arxiv.org/abs/2608.11606
   Integrated sensing and communication (ISAC) extends mobile networks from information transfer toward perception of passive objects and environments.
9. When Agentic Retrieval Fails Silently: Framework and Production Evidence from a Creative AI Assistant
   Source: cs.IR (Information Retrieval)
   Link: https://arxiv.org/abs/2610.30423
   CTR, MRR, and behavioral NDCG assume the user sees ranked results and acts on them.
10. PointerBench: A Diagnostic Benchmark for Fine-Grained GUI Grounding
   Source: cs.HC (Human-Computer Interaction)
   Link: https://arxiv.org/abs/2610.31274
   Multimodal Large Language Models have shown promising performance in computer-use tasks, from planning user workflows to grounding natural-language actions to precise UI targets.
11. Evaluating Rational Contracting in Natural Language
   Source: cs.GT (Computer Science and Game Theory)
   Link: https://arxiv.org/abs/2608.10475
   The emergence of language-based AI agents promises to transform the scope of machine economic activity.
12. Fast Approximation Algorithms for Balanced Edge and Vertex Separators
   Source: cs.DS (Data Structures and Algorithms)
   Link: https://arxiv.org/abs/2603.15782
   We present a family of fast pseudo-approximation algorithms for the minimum balanced element cut problem in a graph, which includes vertex and edge separators.
13. Almost tight distributed approximation for domination in sparse graph classes
   Source: cs.DC (Distributed, Parallel, and Cluster Computing)
   Link: https://arxiv.org/abs/2610.31203
   We study distributed approximation of Minimum Dominating Set in a very general class of sparse graphs, extending near-optimal approximation results from the minor-free setting to bounded expansion.
14. Contestable Agents for Data Governance: Recording Human Stewardship of AI-Generated Metadata Across Structured and Unstructured Systems
   Source: cs.DB (Databases)
   Link: https://arxiv.org/abs/2610.31553
   Industrial organizations hold operational knowledge in structured records, such as telemetry, point lists, and transactions, and in unstructured sources, such as manuals, service notes, communications, and inspection reports.
15. Initial Evaluation of Potential Bias in Coverage of Humans in Wikidata
   Source: cs.CY (Computers and Society)
   Link: https://arxiv.org/abs/2609.22375
   Introduction.
16. Zero-Shot Domain Generalization via Domain Prompt Learning
   Source: cs.CV (Computer Vision and Pattern Recognition)
   Link: https://arxiv.org/abs/2610.30680
   Domain generalization (DG) aims to improve the generalization of the model to any unseen domains.
17. Compiling Autoregressive LLM Control into Policy-Exact Parallel Inference for Hierarchical RAG
   Source: cs.CL (Computation and Language)
   Link: https://arxiv.org/abs/2610.30664
   Large language models increasingly act as controllers in structured decision pipelines, yet their decisions are still executed by autoregressive text decoding.
18. DGA$_2$D: Directed Graph-Guided Automated Algorithm Design with Large Language Models
   Source: cs.NE (Neural and Evolutionary Computing)
   Link: https://arxiv.org/abs/2608.00700
   The rapid development of Large Language Models (LLMs) has opened new avenues for Automated Heuristic Design (AHD) for solving NP-hard combinatorial optimization problems (COPs).
19. OACap: Caption-Guided Active Observation for Detailed Video Captioning
   Source: cs.MA (Multiagent Systems)
   Link: https://arxiv.org/abs/2610.29327
   Unlike question answering, where a query specifies a perceptual target, open-ended detailed captioning must determine what evidence to acquire and how to integrate it into a coherent global description.
20. Beyond LLM Judge: Mechanical Verification for Agentic Autoformalization
   Source: cs.LO (Logic in Computer Science)
   Link: https://arxiv.org/abs/2610.20573
   We introduce a novel method for verifying Lean formalizations that goes beyond LLM-judged faithfulness.
21. Behavioral Consistency in Machine Learning
   Source: cs.ET (Emerging Technologies)
   Link: https://arxiv.org/abs/2606.07581
   A trained model is usually described by its weights, as if the weights fixed its behavior.
22. Kronecker Products, Polarity Quotients and Large Graph Constructions
   Source: cs.DM (Discrete Mathematics)
   Link: https://arxiv.org/abs/2608.27253
   In this paper, we establish a structural compatibility between the Kronecker product of bipartite graphs that admit polarity and their polarity quotients, and provide a sharp upper bound on the diameter of these graphs.
23. FLAWS: A Benchmark for Error Identification and Localization in Scientific Papers
   Source: cs.DL (Digital Libraries)
   Link: https://arxiv.org/abs/2511.21843
   The identification and localization of errors is a core task in peer review, yet the exponential growth of scientific output has made it increasingly difficult for human reviewers to reliably detect errors given the limited pool of experts.
24. Your Token Is Gone: A Token-Consumption Countermeasure for Disrupting LLM-Based Scam Systems
   Source: cs.CR (Cryptography and Security)
   Link: https://arxiv.org/abs/2610.30666
   LLM-based scam systems increasingly combine adaptive dialogue, persistent context, external tools, and multi-agent coordination to automate personalized fraud.
25. Logarithmic edge-length ratios for planar drawings of 2-trees
   Source: cs.CG (Computational Geometry)
   Link: https://arxiv.org/abs/2610.28030
   For a planar graph $G$ with at least one edge, let $\rho(G)$ be the infimum of the ratio of the longest to the shortest edge length over all planar straight-line drawings of $G$.
26. CENIC: Convex Error-controlled Numerical Integration for Contact
   Source: cs.CE (Computational Engineering, Finance, and Science)
   Link: https://arxiv.org/abs/2511.08771
   State-of-the-art robotics simulators operate in discrete time.
27. An Optimal Gap-Majority Lemma for Bounded-Round Communication
   Source: cs.CC (Computational Complexity)
   Link: https://arxiv.org/abs/2610.22313
   Recent work of Sawettamalya and Yu (FOCS 2026) initiated the study of \emph{gap-majority} composition in randomized communication.
28. Governed Self-Evolution for Autonomous Investing: A Multi-Agent LLM System with an Invariant Core
   Source: cs.AI (Artificial Intelligence)
   Link: https://arxiv.org/abs/2610.30557
   LLM agents that act on live Web data must combine heterogeneous evidence, remember what they have done and improve from outcomes without weakening their own safeguards.
29. Procrustes-Bering-Sheaft: Automated Model Discovery and Virtual Crash Tests for Microservices
   Source: cs.PF (Performance)
   Link: https://arxiv.org/abs/2610.31444
   Procrustes-Bering-Sheaft automates lightweight model discovery and virtual crash tests for microservices.
30. Finitely Verifiable Segmentation: Decidability for Every Tokenizer with a Finite-State Verifier
   Source: cs.PL (Programming Languages)
   Link: https://arxiv.org/abs/2610.30168
   A segmentation policy assigns to each byte string at most one segmentation into tokens.

Sources in this brief: cs.AI (Artificial Intelligence); cs.AR (Hardware Architecture); cs.CC (Computational Complexity); cs.CE (Computational Engineering, Finance, and Science); cs.CG (Computational Geometry); cs.CL (Computation and Language); cs.CR (Cryptography and Security); cs.CV (Computer Vision and Pattern Recognition); cs.CY (Computers and Society); cs.DB (Databases); cs.DC (Distributed, Parallel, and Cluster Computing); cs.DL (Digital Libraries); cs.DM (Discrete Mathematics); cs.DS (Data Structures and Algorithms); cs.ET (Emerging Technologies); cs.GT (Computer Science and Game Theory); cs.HC (Human-Computer Interaction); cs.IR (Information Retrieval); cs.LG (Machine Learning); cs.LO (Logic in Computer Science); cs.MA (Multiagent Systems); cs.NE (Neural and Evolutionary Computing); cs.NI (Networking and Internet Architecture); cs.OS (Operating Systems); cs.PF (Performance); cs.PL (Programming Languages); cs.RO (Robotics); cs.SD (Sound); cs.SI (Social and Information Networks); cs.SY (Systems and Control).
Selected 30 of 353 available items for this weekly brief.