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

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. InSPECtor: Improving SLEIGH Processor Specification Veracity via Proxy
   Source: cs.PL (Programming Languages)
   Link: https://arxiv.org/abs/2608.13042
   Processor specifications underpin critical security and program- analysis tools such as disassemblers, decompilers, and emulators, yet, their correctness is rarely examined.
2. When Does Trace-Driven Evaluation Mislead MoE Expert Caching? Replay Semantics, Workload Contamination, and Operating Regimes
   Source: cs.PF (Performance)
   Link: https://arxiv.org/abs/2608.07911
   Mixture-of-Experts (MoE) models have outgrown accelerator memory, and offloading expert weights to host memory is now standard.
3. NestDex: Nested Policy Learning with Copilot Assisted Teleoperation for Dexterous Manipulation
   Source: cs.RO (Robotics)
   Link: https://arxiv.org/abs/2608.13362
   Dexterous manipulation promises substantially richer robot interaction with the physical world, but learning these behaviours remains constrained by the difficulty of collecting consistent, complete-task demonstrations.
4. EgoPHI: Estimating Contact and Force from Egocentric Vision
   Source: cs.GR (Graphics)
   Link: https://arxiv.org/abs/2608.13014
   Understanding hand-object interaction from egocentric vision is essential for modeling how people physically engage with the surrounding world.
5. The energetic cost of mitigating AI attacks in cellular networks
   Source: cs.CR (Cryptography and Security)
   Link: https://arxiv.org/abs/2608.12431
   The integration of Artificial Intelligence (AI), generally as Machine Learning (ML) algorithms, in all levels and aspects of cellular networks demonstrates the success of data-driven algorithms; for example, the Radio Intelligence Controller (RIC) of the O-RAN paradigm bestows the network with optimised radio resource allocation, load balancing or energy efficiency functions, among others.
6. Mimicry without understanding: the origins of decision bias in large language models
   Source: cs.CL (Computation and Language)
   Link: https://arxiv.org/abs/2608.12339
   Large Language models (LLMs) were found to be susceptible to a host of social, affective, and cognitive biases.
7. Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii
   Source: cs.CG (Computational Geometry)
   Link: https://arxiv.org/abs/2603.05358
   For a fixed graph class $\Pi$, the goal of $\Pi$-Modification is to transform an input graph $G$ into a graph $H\in\Pi$ using at most $k$ modifications.
8. On the Importance of Geometric Nonlinearity and Temperature-Dependent Properties in Multi-Material Thermo-Mechanical Topology Optimization
   Source: cs.CE (Computational Engineering, Finance, and Science)
   Link: https://arxiv.org/abs/2608.10344
   Thermo-mechanical compliant devices are commonly designed with small-strain linear elasticity and temperature-independent material properties, even though they might operate hundreds of kelvin above ambient where both assumptions are questionable.
9. Testing Properties of Edge Distributions
   Source: cs.CC (Computational Complexity)
   Link: https://arxiv.org/abs/2603.22702
   We initiate the study of distribution testing for probability distributions over the edges of a graph, motivated by the closely related question of ``edge-distribution-free'' graph property testing.
10. HBF Sucks! A Full-Stack Characterization of High-Bandwidth Flash for KV-Centric LLM Serving
   Source: cs.AR (Hardware Architecture)
   Link: https://arxiv.org/abs/2608.11668
   A faster storage device should make serving faster.
11. Trie Automata for Constrained Decoding over Large Finite Sets
   Source: cs.AI (Artificial Intelligence)
   Link: https://arxiv.org/abs/2608.12574
   Large language models increasingly need to generate structured outputs that conform to predefined schemas, with one common constraint being selection from a finite set of valid strings.
12. Moral Hazard in Multi-Agent Language Models
   Source: cs.MA (Multiagent Systems)
   Link: https://arxiv.org/abs/2607.23982
   Cooperation can fail when socially valuable effort is costly, hard to observe, and benefits mainly someone else.
13. A Comprehensive Empirical Evaluation of Vector Database Systems for Approximate Nearest Neighbor Search: Performance, Quality, and Resource Trade-offs
   Source: cs.IR (Information Retrieval)
   Link: https://arxiv.org/abs/2608.12812
   Vector databases have emerged as critical infrastructure for modern artificial intelligence applications, particularly retrieval-augmented generation (RAG), semantic search, and recommendation systems.
14. Co-leading Teams Drive Scientific Novelty in Large-scale Research Infrastructures
   Source: cs.DL (Digital Libraries)
   Link: https://arxiv.org/abs/2608.13195
   Large-scale research infrastructures (LSRIs) have become the engine of modern scientific discovery.
15. Certifiable Semantic Agreement Among LLM Agents: What the Admissibility Instrument Decides
   Source: cs.DC (Distributed, Parallel, and Cluster Computing)
   Link: https://arxiv.org/abs/2606.07316
   Can a committee of LLM agents reach agreement that is certifiable at the level of meaning, not only at the level of a label?
16. Guided Table Retrieval for Structured Data Search
   Source: cs.DB (Databases)
   Link: https://arxiv.org/abs/2608.11644
   Answering natural language questions over structured databases requires identifying the relevant tables and determining how to join them---a task that demands both schema knowledge and semantic understanding of the user's intent.
17. Algorithmic Gender Prediction Is Illegitimate, But Gender Imputation Can Yield Valid Measurements
   Source: cs.CY (Computers and Society)
   Link: https://arxiv.org/abs/2608.13444
   Machine learning ethics researchers and critical HCI scholars have argued that algorithmically predicting gender is wrong.
18. Gradient-Free Warm-Start Library Recovery: an Amortized-Regret Separation
   Source: cs.NE (Neural and Evolutionary Computing)
   Link: https://arxiv.org/abs/2606.21253
   Continual learning that is gradient-free, local, online, and append-only is attractive for edge and streaming deployment, but its value is usually argued informally.
19. StrAD: A Streaming Method and Benchmark for Audio Description Generation for Long-form Videos
   Source: cs.CV (Computer Vision and Pattern Recognition)
   Link: https://arxiv.org/abs/2608.12549
   Visual content is the dominant medium of communication, yet without audio descriptions (ADs), it remains inaccessible to blind and low-vision people.
20. Perturbation-based Regional Interpretability through Subtraction Mapping (PRISM): naming-error dissociations in language models and post-stroke aphasia
   Source: cs.LG (Machine Learning)
   Link: https://arxiv.org/abs/2608.12717
   Mechanistic interpretability of large language models lacks spatially resolved, falsifiable tools for testing whether internal components are specialized for distinct cognitive operations.
21. Metric Distortion of Small-group Deliberation
   Source: cs.GT (Computer Science and Game Theory)
   Link: https://arxiv.org/abs/2502.01380
   We consider models for social choice where voters rank a set of choices (or alternatives) by deliberating in small groups of size at most $k$, and these outcomes are aggregated by a social choice rule to find the winning alternative.
22. Finite-State Transducers in the Wheeler Setting
   Source: cs.FL (Formal Languages and Automata Theory)
   Link: https://arxiv.org/abs/2606.29405
   Finite-state transducers and Wheeler automata are two well-established frameworks in formal language theory.
23. Commutator-Governed Energy Exchange in Single-Ancilla Coherent Feedback
   Source: cs.ET (Emerging Technologies)
   Link: https://arxiv.org/abs/2512.14701
   A common route to ground-state preparation couples a system to one ancilla qubit, applies a conditional feedback operation, and resets the ancilla.
24. Enforcing Application-Layer Policies in eBPF
   Source: cs.NI (Networking and Internet Architecture)
   Link: https://arxiv.org/abs/2605.31084
   Service meshes have recently emerged as the de-facto standard for deploying microservices.
25. NARU: A Benchmark for NARrative Evolution and Cultural Nuance Understanding in Japanese Extreme Long Video
   Source: cs.MM (Multimedia)
   Link: https://arxiv.org/abs/2608.13210
   Long-form video understanding encompasses tasks that go beyond retrieving isolated events, including tracking an evolving narrative and interpreting social meaning that may remain implicit.
26. Finite-valuation approximable structures: a solution to the Jung--Tix problem of probabilistic powerdomains
   Source: cs.LO (Logic in Computer Science)
   Link: https://arxiv.org/abs/2608.03073
   We introduce the category \(\FVA\) of finite-valuation approximable domains, a full subcategory of continuous domains contained in the category of pointed countably based FS-domains.
27. Minimum eccentricity shortest paths of $K_{2,3}$-minor-free graphs
   Source: cs.DS (Data Structures and Algorithms)
   Link: https://arxiv.org/abs/2608.13158
   Given a simple, undirected, and unweighted graph $G$, and an integer $R$, the objective of the \textsc{Minimum Eccentricity Shortest Path (MESP)} is to decide whether there exists an \emph{isometric path} $P$ in $G$ such that the distance from every vertex in the graph to its nearest vertex in $P$ is at most $R$.
28. Asymptotically Faster Algorithms for Recognizing $(k,\ell)$-Sparse Graphs
   Source: cs.DM (Discrete Mathematics)
   Link: https://arxiv.org/abs/2604.13025
   The family of $(k,\ell)$-sparse graphs, introduced by Lorea, plays a central role in combinatorial optimization and has a wide range of applications, particularly in rigidity theory.
29. Alignment Drift in Single-Model Speculative Decoding for ASR: Mechanism, Correction, and Cost
   Source: cs.SD (Sound)
   Link: https://arxiv.org/abs/2608.12703
   Speculative decoding speeds up generation by letting a cheap draft propose several tokens that a target model checks in one pass.
30. Specification-first convergence with an AI coding agent: a case study of dismantling a core architectural invariant across 189 files in a 717k-line codebase
   Source: cs.SE (Software Engineering)
   Link: https://arxiv.org/abs/2608.12440
   This paper reports a single, fully instrumented case study of a large-scale architectural refactoring by an AI coding agent under a specification-first protocol, with no human review of the generated code and no pre-existing oracle to validate the target behaviour.

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.FL (Formal Languages and Automata Theory); cs.GR (Graphics); cs.GT (Computer Science and Game Theory); cs.IR (Information Retrieval); cs.LG (Machine Learning); cs.LO (Logic in Computer Science); cs.MA (Multiagent Systems); cs.MM (Multimedia); cs.NE (Neural and Evolutionary Computing); cs.NI (Networking and Internet Architecture); cs.PF (Performance); cs.PL (Programming Languages); cs.RO (Robotics); cs.SD (Sound); cs.SE (Software Engineering).
Selected 30 of 354 available items for this weekly brief.