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

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. A Wavelength Borrowing Architecture for Optical Data Center Networks - Extended Version
   Source: cs.NI (Networking and Internet Architecture)
   Link: https://arxiv.org/abs/2609.04874
   The growth of east-west traffic, along with the cost and power consumption of electronic switching, is motivating the integration of a low-power, high-rate, all-optical layer within the data center network.
2. Refer-CityFlow and M3Track: A Benchmark Dataset and Reference Framework for Language-Driven Multi-Target Multi-Camera Tracking
   Source: cs.MM (Multimedia)
   Link: https://arxiv.org/abs/2611.08976
   Referring multi-object tracking enables users to specify targets through natural language, but existing Refer-MOT benchmarks primarily focus on single-camera settings.
3. AURA: A Reinforcement Learning Framework for AI-Driven Adaptive Conversational Surveys
   Source: cs.HC (Human-Computer Interaction)
   Link: https://arxiv.org/abs/2510.27126
   Conventional online surveys provide limited personalization, often resulting in low engagement and superficial responses.
4. Beyond Bayesian Nash: Learning Minimax-Regret Equilibria for Adversarial Team Games under Asymmetric Information
   Source: cs.GT (Computer Science and Game Theory)
   Link: https://arxiv.org/abs/2607.09993
   Adversarial team games (ATGs) with asymmetric information, such as adversarial path-finding, goal search, and reachability games on graphs, require strategies that are robust to hidden opponent types, such as a hidden goal flag, and to deception.
5. A quadratic lower bound for 2DFAs against one-way liveness
   Source: cs.FL (Formal Languages and Automata Theory)
   Link: https://arxiv.org/abs/2602.24279
   We show that every two-way deterministic finite automaton (2DFA) that solves one-way liveness on height h has Omega(h^2) states.
6. Bounded Relative Boundary Implies Narrow DNF Approximation
   Source: cs.DM (Discrete Mathematics)
   Link: https://arxiv.org/abs/2609.00240
   We prove Friedgut's conjecture (J.
7. Consensus-Constrained Dual-Federated Optimization with Client-Side Dynamic Weighting for Distributed Android Device Threat Defense
   Source: cs.DC (Distributed, Parallel, and Cluster Computing)
   Link: https://arxiv.org/abs/2611.09470
   Smartphones, smart-home hubs, and wearables are increasingly exposed to sophisticated Android malware, while centralized threat-detection pipelines raise privacy and scalability concerns.
8. RACORN: Robust Predicate-Agnostic Filtered Vector Search under Extreme Selectivity
   Source: cs.DB (Databases)
   Link: https://arxiv.org/abs/2607.00768
   Filtered vector search returns the nearest neighbors among the vectors that pass a predicate.
9. Decomposing Yes-No Bias in LLM Moral Judgment: Stance, Position, Word, and Verdict
   Source: cs.CY (Computers and Society)
   Link: https://arxiv.org/abs/2607.05552
   Large language models (LLMs) increasingly issue binary verdicts - safety gates, judge decisions, value probes - and the answer is read as the model's judgment.
10. A Cross-Domain TARA-to-NAC Rule Mapping Methodology: From Automotive OEM Networks to Energy Storage Systems
   Source: cs.CR (Cryptography and Security)
   Link: https://arxiv.org/abs/2611.09771
   Threat analysis and risk assessment under ISO/SAE 21434 ends with cybersecurity goals, but existing methods give little structured guidance for turning those goals into enforceable network access control rules.
11. Representational drift in a code model: behaviour settles, which neurons carry it does not
   Source: cs.CL (Computation and Language)
   Link: https://arxiv.org/abs/2611.09204
   In neuroscience, representational drift is a change in which neurons carry a representation while behaviour stays the same; we measure its analogue in OpenCoder-1.5B during pretraining, for 169 Python constructs over two trillion tokens at a constant learning rate, with a noise unit on every change, at checkpoints as close as 1,000 training steps.
12. Multiscale Closing Index (MCI) for measuring structural similarity between 2D point sets
   Source: cs.CG (Computational Geometry)
   Link: https://arxiv.org/abs/2611.09745
   We introduce Multi-scale Closing Index (MCI), a new dissimilarity measure for evaluating the alignment of two 2D point sets.
13. EPIC: Differentiable Energy-Force Consistent Uncertainty Quantification and Propagation for Machine-Learned Interatomic Potentials
   Source: cs.CE (Computational Engineering, Finance, and Science)
   Link: https://arxiv.org/abs/2611.00942
   Machine-learned interatomic potentials (MLIPs) now rival density functional theory in accuracy and are increasingly used to screen vast crystal databases, yet they can produce unreliable predictions for chemistries outside their training distribution without clear warning.
14. From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
   Source: cs.CC (Computational Complexity)
   Link: https://arxiv.org/abs/2608.14845
   In a landmark JACM paper recognized with the 2021 G\"odel Prize, Cai and Chen established a complexity dichotomy for counting CSPs over arbitrary finite domains with algebraic complex weights.
15. Atik: A Shared-Mesh Transformer Accelerator for RISC-V
   Source: cs.AR (Hardware Architecture)
   Link: https://arxiv.org/abs/2611.09522
   Transformer inference repeatedly invokes dense matrix multiplication and attention, including its data-dependent softmax normalization.
16. When F1 Is Not Enough: Auditing Codebooks for LLM-Assisted Annotation
   Source: cs.AI (Artificial Intelligence)
   Link: https://arxiv.org/abs/2611.08846
   Large language models (LLMs) are increasingly used for text annotation in social science, but standard performance metrics do not explain why errors occur.
17. MORTIS: Compiler-Guided KV-Cache Management for LLM Agent Programs
   Source: cs.OS (Operating Systems)
   Link: https://arxiv.org/abs/2611.08638
   Existing agent serving systems divide each prompt into a reusable prefix and an opaque suffix, managing the KV-cache at this coarse granularity without distinguishing the components within each part.
18. Spiking neuromodulation: a linear control perspective
   Source: cs.SY (Systems and Control)
   Link: https://arxiv.org/abs/2611.08571
   Neuronal excitability is a nonlinear phenomenon, and the complexity of spiking experimental traces sometimes looks defeating.
19. Target PageRank: Matching Prescribed PageRank Scores via Budgeted Edge Additions
   Source: cs.SI (Social and Information Networks)
   Link: https://arxiv.org/abs/2611.06782
   PageRank is widely used to quantify the importance of nodes in directed networks.
20. Aegis OS: A Transactional Multi-Tenant Operating System Runtime for Eliminating Authorization Fatigue in Autonomous Coding Agents
   Source: cs.SE (Software Engineering)
   Link: https://arxiv.org/abs/2611.08516
   Autonomous coding agents such as Google Antigravity (agy), Anthropic Claude Code (claude), and OpenAI Codex CLI (codex) execute multi-step software engineering workflows on workstations and cloud hosts.
21. VoxCanvas-41M: A Large-Scale Bilingual Dataset for Instruction-Based Speech Editing and Its Learning Dynamics
   Source: cs.SD (Sound)
   Link: https://arxiv.org/abs/2611.08251
   Recent advances in speech generation have spurred the development of speech editing techniques.
22. VLA Handover: Failure-Prediction-Based Switching from On-Robot to Server VLA Models
   Source: cs.RO (Robotics)
   Link: https://arxiv.org/abs/2611.08987
   Large vision-language-action (VLA) models generalize well but are difficult to run in real time on a robot, and small VLAs that run there fail more often.
23. A Physically-Realisable Quantum Programming Language with Quantum-Controlled Quantum Channels
   Source: cs.PL (Programming Languages)
   Link: https://arxiv.org/abs/2607.15873
   In contrast to a classical bit, which can only take the value $0$ or $1$, its quantum counterpart---a qubit---can exist in a superposition of $0$ and $1$.
24. BitDecoding-FP4: Native FP4 KV Cache Decoding via Algorithm-System Co-Design
   Source: cs.PF (Performance)
   Link: https://arxiv.org/abs/2611.09825
   The key-value (KV) cache dominates memory capacity and bandwidth in long-context LLM serving.
25. BRAVR: An AP-Assisted Online DRL Mechanism for Interactive VR Bitrate Adaptation over Wi-Fi
   Source: cs.NI (Networking and Internet Architecture)
   Link: https://arxiv.org/abs/2606.24389
   Interactive virtual reality (VR) streaming over Wi-Fi requires stringent latency and reliability guarantees, which become increasingly difficult to achieve under dynamic channel conditions and shared-medium contention.
26. Situating the Development of Conversational Artificial Intelligence in the Social and Structural Contexts of People with Visual Impairments
   Source: cs.HC (Human-Computer Interaction)
   Link: https://arxiv.org/abs/2510.12268
   People with visual impairments (PVI) increasingly adopt conversational AI (CAI) in their daily practices.
27. Infinite lexicographic products of positional objectives
   Source: cs.GT (Computer Science and Game Theory)
   Link: https://arxiv.org/abs/2506.14544
   This paper contributes to the study of positional determinacy of infinite duration games played on potentially infinite graphs with neutral transitions.
28. Fast and General Automatic Differentiation for Finite-State Methods
   Source: cs.FL (Formal Languages and Automata Theory)
   Link: https://arxiv.org/abs/2602.12300
   We propose a new method, that we coined the ``morphism-trick'', to integrate custom implementations of vector-Jacobian products in automatic differentiation softwares, applicable to a wide range of semiring-based computations.
29. Matroid products via submodular coupling
   Source: cs.DM (Discrete Mathematics)
   Link: https://arxiv.org/abs/2411.02197
   The study of matroid products traces back to the 1970s, when Lov\'asz and Mason studied the existence of various types of matroid products with different strengths.

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.CY (Computers and Society); cs.DB (Databases); cs.DC (Distributed, Parallel, and Cluster Computing); cs.DM (Discrete Mathematics); cs.FL (Formal Languages and Automata Theory); cs.GT (Computer Science and Game Theory); cs.HC (Human-Computer Interaction); cs.MM (Multimedia); cs.NI (Networking and Internet Architecture); cs.OS (Operating Systems); cs.PF (Performance); cs.PL (Programming Languages); cs.RO (Robotics); cs.SD (Sound); cs.SE (Software Engineering); cs.SI (Social and Information Networks); cs.SY (Systems and Control).
Selected 29 of 300 available items for this weekly brief.