Clay weekly context brief for the Computer Science category (ISO week 2026-W37). 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. Compressing Streaming Neural Audio Encoders via Latent-Space Distillation Source: cs.SD (Sound) Link: https://arxiv.org/abs/2609.04102 System-wide Dictation on Apple devices runs entirely on-device, and the speech it transcribes reaches the foundation model through a tokenizer: an encoder that maps short windows of waveform onto the representation the language model reads. 2. Large Language Models and Language Server Protocol: a match made in context Source: cs.SE (Software Engineering) Link: https://arxiv.org/abs/2609.03086 This article introduces Eiffel-tools, a language server protocol (LSP) implementation for the Eiffel programming language that uses Large Language Models (LLMs) to aid the development of statically verified software. 3. Statistical Feature Augmentation for Anomaly Detection in Dynamic Graphs Source: cs.SI (Social and Information Networks) Link: https://arxiv.org/abs/2609.02965 Dynamic networks are being applied in many domains, from social media to logistics systems, each with their own set of special characteristics. 4. Dynamic Operational Reserve Margin Assessment from Risk-Constrained Unit Commitment States Source: cs.SY (Systems and Control) Link: https://arxiv.org/abs/2609.03066 We propose Dynamic Reserve Margin (DRM) as a time-varying operational adequacy metric derived from risk-constrained unit commitment (RCUC) states. 5. Toward an~Integrated Cognitive--Ergonomic Architecture for~Human--Machine Interaction: Combining Cognitive Models with~Human Factors Ergonomics Source: cs.RO (Robotics) Link: https://arxiv.org/abs/2609.03704 This paper presents an integrated approach to modeling human competencies by combining the theoretical foundations of cognitive architectures with principles from Human Factors Ergonomics (HFE). 6. Quantisation of Abstract Data Types Source: cs.PL (Programming Languages) Link: https://arxiv.org/abs/2609.03778 In this paper, we introduce a notion of abstract quantum data type within the framework of universal algebra. 7. Thermodynamic Human-Computer Interaction Source: cs.PF (Performance) Link: https://arxiv.org/abs/2608.07123 Target acquisition is often modeled separately for desktop, mobile, and other interaction modalities. 8. Ossim: OS-Driven Live Simulation for Cluster-Scale Full-Stack Evaluation Source: cs.OS (Operating Systems) Link: https://arxiv.org/abs/2606.18958 Cluster-scale full-stack simulation is essential for evaluating distributed software stacks and emerging hardware components before deployment. 9. Unified Pitch Graphs for Diagnosing Pitching Strategy Source: cs.IR (Information Retrieval) Link: https://arxiv.org/abs/2609.03810 Pitching strategy in baseball is expressed through both physical execution and the ordered context in which pitches are used, yet common representations collapse pitches into discrete types or aggregate statistics. 10. The Timing Dependencies of Trust: Speed, Accuracy, and cBCI Neuro-Decoupling in Human-AI Teams Source: cs.HC (Human-Computer Interaction) Link: https://arxiv.org/abs/2605.25868 The speed and accuracy of an artificial teammate fundamentally alter the failure states of Human-AI integration. 11. On the Laplacian spectral gap of generalized pancake graphs Source: cs.DM (Discrete Mathematics) Link: https://arxiv.org/abs/2608.15398 The generalized pancake graph $P(m,n)$ is the Cayley graph of the group of colored permutations $\mathbb{Z}_m\wr S_n=(\mathbb{Z}_m)^n\rtimes S_n$ generated by generalized prefix reversals. 12. Property Testing for Recursive Query Languages Source: cs.DB (Databases) Link: https://arxiv.org/abs/2609.03908 In the context of database querying, property testing provides a framework for testing query answers with high confidence while inspecting only a sublinear part of the database, through completion queries and size queries. 13. FoRIS: Progressive Foreground Refinement for Training-Free In-Context Segmentation Source: cs.CV (Computer Vision and Pattern Recognition) Link: https://arxiv.org/abs/2609.03384 In-Context Segmentation (ICS) aims to precisely segment arbitrary semantic concepts, such as objects or parts, given one or a few annotated visual exemplars. 14. Flip, Don't Shuffle: Watermarking LLMs at the Speed of Inference Source: cs.CR (Cryptography and Security) Link: https://arxiv.org/abs/2609.03844 We introduce Stateless Bernoulli Watermarking (SBW), a new statistical watermark for Large Language Models that determines green list membership through independent per-token Bernoulli trials. 15. Counterfactual Fairness Audits of Multi-Step Clinical LLM Agents Require a Measured Per-Action Instability Floor Source: cs.CL (Computation and Language) Link: https://arxiv.org/abs/2609.03221 Counterfactual audits are the standard tool for checking whether a clinical agent treats demographically distinct but clinically identical patients differently. 16. Algorithmic exploration of the unit distance problem in the rational plane Source: cs.CG (Computational Geometry) Link: https://arxiv.org/abs/2606.29415 This paper presents reproducible experimental evidence on unit-distance graph density. 17. SNAP-FM: Sparse Nonlinear Accelerated Projection for Physics-Constrained Generative Modeling Source: cs.CE (Computational Engineering, Finance, and Science) Link: https://arxiv.org/abs/2607.00095 Generative models have emerged as scalable surrogates for physical simulation, yet they offer no guarantee that their outputs respect the conservation laws, boundary conditions, and nonlinear invariants that govern the underlying physics. 18. An Adversarial Zero-Shot Learning Approach for Anomaly Detection in Multivariate IoT Traffic Data Source: cs.NI (Networking and Internet Architecture) Link: https://arxiv.org/abs/2609.03505 Anomaly detection in Internet of Things (IoT) networks presents unique challenges due to the diversity of devices, lack of labeled data, and domain variability across environments. 19. Transfer Safety Awareness for Cross-Modal Safety Drift in Multimodal Large Language Models Source: cs.MM (Multimedia) Link: https://arxiv.org/abs/2609.02082 Visual modality enhances the capabilities of multimodal large language models (MLLMs) but also introduces a safety concern: a benign textual query may convey harmful intent when grounded in a visual image. 20. A computable representation of the physical laboratory enables verifiable workflows Source: cs.AI (Artificial Intelligence) Link: https://arxiv.org/abs/2609.03621 Making science computable requires representations of both scientific knowledge and the physical world in which scientific claims are tested. 21. Hospitals/Residents with Inseparable Couples: Finding a Coalition-Stable Assignment Is NP-Hard Source: cs.GT (Computer Science and Game Theory) Link: https://arxiv.org/abs/2607.18634 In recent work on course allocation, Rodr\'{i}guez and Manlove consider the complexity of finding a stable assignment under four notions of stability, including two coalitional notions. 22. ProAct: Harnessing Streaming Motion Generation and Agentic Reasoning for Real-Time Embodied Social Interaction Source: cs.GR (Graphics) Link: https://arxiv.org/abs/2602.14048 Real-time embodied social interaction places two equally demanding requirements on an agent: continuously generating fluent multimodal interaction behavior, and proactively reasoning over accumulated dialogue and visual context to decide when to take initiative. 23. Target Discounted Sum Problem on Markov Chains with Applications to Markov Decision Processes Source: cs.FL (Formal Languages and Automata Theory) Link: https://arxiv.org/abs/2609.03670 The discounted sum is a way to aggregate a sequence of weights from a finite alphabet $\Sigma$, i.e., for a discount factor $\lambda$, the discounted sum of a sequence $w_0 w_1 w_2 \cdots$ over $\Sigma$ is $\sum_{i \in \mathbb{N}} w_i \lambda^i$. 24. Two-State Max-Plus Comparison Is Decidable Source: cs.DS (Data Structures and Algorithms) Link: https://arxiv.org/abs/2609.00678 Daviaud, Guillon, and Merlet proved that comparison of max-plus automata is undecidable under a fixed state bound of 553 and explicitly left the range from 2 to 552 states open. 25. Towards Affordable Energy: A Gymnasium Environment for Electric Utility Demand-Response Programs Source: cs.CY (Computers and Society) Link: https://arxiv.org/abs/2605.12462 Extreme weather and volatile wholesale electricity markets expose residential consumers to catastrophic financial risks, yet demand response at the distribution level remains an underutilized tool for grid flexibility and energy affordability. 26. Equality cases of the Stanley--Yan log-concave matroid inequality Source: cs.CC (Computational Complexity) Link: https://arxiv.org/abs/2407.19608 The \emph{Stanley--Yan} (SY) \emph{inequality} gives the ultra-log-concavity for the numbers of bases of a matroid which have given sizes of intersections with $k$ fixed disjoint sets. 27. Sim-FA: A GPGPU Simulator Framework for Fine-Grained Asynchronous Pipeline Analysis Source: cs.AR (Hardware Architecture) Link: https://arxiv.org/abs/2605.00555 To efficiently support Large Language Models (LLMs), modern GPGPU architectures have introduced new features and programming paradigms, such as warp specialization. 28. From local kernels to global form: modeling the emergence of musical content Source: cs.SD (Sound) Link: https://arxiv.org/abs/2608.24660 Markov models are established tools for symbolic music, including non-homogeneous formulations. 29. Compound Prompt Constraints in LLM Code Generation: A Factorial Study of Format, Persona, and Urgency Source: cs.SE (Software Engineering) Link: https://arxiv.org/abs/2609.03156 Large language models (LLMs) are increasingly used in software engineering pipelines for code generation, where production prompts often combine multiple constraints. 30. Toward Collective-Centric Evaluation of Preference Inference for Participatory Democracy Source: cs.SI (Social and Information Networks) Link: https://arxiv.org/abs/2609.02990 To scale up collective decision-making, participatory democracy platforms such as Polis and Remesh enable online deliberation among thousands of participants. 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.DM (Discrete Mathematics); cs.DS (Data Structures and Algorithms); cs.FL (Formal Languages and Automata Theory); cs.GR (Graphics); cs.GT (Computer Science and Game Theory); cs.HC (Human-Computer Interaction); cs.IR (Information Retrieval); 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 30 of 328 available items for this weekly brief.