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

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. Transformer-Empowered Actor-Critic Reinforcement Learning for Sequence-Aware Service Function Chain Partitioning
   Source: cs.NE (Neural and Evolutionary Computing)
   Link: https://arxiv.org/abs/2504.18902
   In the forthcoming era of 6G networks, characterized by unprecedented data rates, ultra-low latency, and ubiquitous connectivity, effective management of Virtualized Network Functions (VNFs) is essential.
2. Clinical Translation of Brain-Computer Interface in China: A Landscape Analysis of Investigator-Initiated Trials, Registered Clinical Trials, and Regulatory
   Source: cs.HC (Human-Computer Interaction)
   Link: https://arxiv.org/abs/2607.07185
   Neurological injury affects hundreds of millions of people worldwide, yet the loss of motor or communication functions resulting from stroke, spinal cord injury, and neurodegenerative disease remains largely irreversible with existing therapies.
3. No, Cake Cutting Really is a Piece of Cake
   Source: cs.GT (Computer Science and Game Theory)
   Link: https://arxiv.org/abs/2606.07238
   We design and analyze a deterministic cake cutting algorithm that achieves proportional fairness using a linear number of cuts.
4. QAgent: An LLM-based Multi-Agent System for Autonomous OpenQASM programming
   Source: cs.ET (Emerging Technologies)
   Link: https://arxiv.org/abs/2508.20134
   Programming quantum circuits at the OpenQASM level is essential for achieving hardware-aware optimization and reliable execution on noisy intermediate-scale quantum (NISQ) devices, yet it remains challenging due to the need for domain-specific planning, iterative code synthesis, and low-level calibration.
5. Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
   Source: cs.DM (Discrete Mathematics)
   Link: https://arxiv.org/abs/2604.05661
   We provide improved space-time tradeoffs for permutation problems over additively idempotent semi-rings.
6. Untied Ulysses: Memory-Efficient Context Parallelism via Headwise Chunking
   Source: cs.DC (Distributed, Parallel, and Cluster Computing)
   Link: https://arxiv.org/abs/2602.21196
   Efficiently processing long sequences with Transformer models usually requires splitting the computations across accelerators via context parallelism.
7. Toward Real-Time Sentence-Level Sign Language Translation
   Source: cs.CL (Computation and Language)
   Link: https://arxiv.org/abs/2607.09611
   Most sign language understanding systems operate at the level of isolated signs, limiting their usefulness in natural communication.
8. A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
   Source: cs.CG (Computational Geometry)
   Link: https://arxiv.org/abs/2604.25397
   We maintain a $(1+\varepsilon)$-spanner over the disk intersection graph of a dynamic set of disks.
9. Evolutionary Intelligence for Scientific Discovery: From Evolutionary Computation to Cumulative Discovery Systems
   Source: cs.CE (Computational Engineering, Finance, and Science)
   Link: https://arxiv.org/abs/2607.09025
   Artificial intelligence (AI) is shifting scientific discovery from task-specific workflows towards autonomous systems that organize exploration with experimental and human feedback in open-ended candidate spaces.
10. Finding matchings in dense hypergraphs
   Source: cs.CC (Computational Complexity)
   Link: https://arxiv.org/abs/2210.12643
   We consider the algorithmic decision problem that takes as input an $n$-vertex $k$-uniform hypergraph $H$ with minimum codegree at least $m-c$ and decides whether it has a matching of size $m$.
11. Accelerating GPU Inference of Large Language Models with Moderately Unstructured Sparse Weight Matrices
   Source: cs.AR (Hardware Architecture)
   Link: https://arxiv.org/abs/2607.08786
   With the growing deployment of large language models (LLMs), LLM inference cost has become a key challenge.
12. Knowledge Graphs and Explainable AI as Complementary Resources for Urban Mining
   Source: cs.AI (Artificial Intelligence)
   Link: https://arxiv.org/abs/2607.09578
   Pre-demolition assessment, the regulated audit process at the heart of urban mining, is an information process in which AI support must serve qualified auditors who remain accountable for the decisions taken.
13. Cascades on Networks with Functional Structure
   Source: cs.SI (Social and Information Networks)
   Link: https://arxiv.org/abs/2505.24631
   We consider a version of the Watts threshold model on directed multiplex configuration model networks, and present a detailed analysis of the cascade size, single-seed cascade probability and cascade condition.
14. Failure as a Process: An Anatomy of CLI Coding Agent Trajectories
   Source: cs.SE (Software Engineering)
   Link: https://arxiv.org/abs/2607.09510
   Large language model (LLM) coding agents are increasingly deployed to autonomously perform software engineering tasks in terminal-based environments, making their reliability a growing concern.
15. Fine-grained Soundscape Control for Augmented Hearing
   Source: cs.SD (Sound)
   Link: https://arxiv.org/abs/2603.00395
   Hearables are becoming ubiquitous, yet their sound controls remain blunt: users can either enable global noise suppression or focus on a single target sound.
16. Towards Detecting Inconsistencies in End-to-end Generated TODs
   Source: cs.SC (Symbolic Computation)
   Link: https://arxiv.org/abs/2607.09338
   Generative AI is profoundly transforming the core technologies behind conversational systems, shifting from component-based to end-to-end approaches.
17. How Mobile Gas Sensor Trajectories Govern Hydrogen Leak Detection: A Safety Gap in Manual Leak Inspection of Hydrogen System Components
   Source: cs.RO (Robotics)
   Link: https://arxiv.org/abs/2607.09527
   The integrity of hydrogen infrastructure relies on reliable leak detection, performed almost exclusively via manual tracer gas sniffing in electrolyzer manufacturing.
18. JustAct: A Framework for Auditable Multi-Agent Systems Regulated by Inter-Organisational Policies
   Source: cs.PL (Programming Languages)
   Link: https://arxiv.org/abs/2502.00138
   In open multi-agent agent systems that cross organisational boundaries, agent actions must be regulated by complex policies.
19. On-Device Adaptive Battery Power Prediction for Electric Vehicles
   Source: cs.PF (Performance)
   Link: https://arxiv.org/abs/2607.09400
   Adaptive power management in Electric Vehicles (EVs) requires accurate power prediction.
20. RIS-Assisted Downlink Pinching-Antenna Systems: GNN-Enabled Optimization Approaches
   Source: cs.NI (Networking and Internet Architecture)
   Link: https://arxiv.org/abs/2511.20305
   This paper investigates a reconfigurable intelligent surface (RIS)-assisted multi-waveguide pinching-antenna (PA) system (PASS) for multi-user downlink information transmission, motivated by the unknown impact of the integration of emerging PASS and RIS on wireless communications.
21. Offline Nash Solvers Meet Online Tree Search in Multi-Agent Games on Graphs
   Source: cs.MA (Multiagent Systems)
   Link: https://arxiv.org/abs/2607.08892
   Computing Nash equilibrium policies in multi-agent Pursuit-Evasion games (PEG) is challenging due to the exponential growth of the joint state and action spaces with the number of agents.
22. Correlation-Aware Contextual Bandits with Surrogate Rewards for LLM Routing
   Source: cs.LG (Machine Learning)
   Link: https://arxiv.org/abs/2607.09015
   We study contextual bandit problems with correlated arms and access to surrogate reward signals produced by a machine learning model, motivated by applications such as large language model (LLM) routing.
23. Mining and searching association relation of scientific papers based on deep learning
   Source: cs.IR (Information Retrieval)
   Link: https://arxiv.org/abs/2204.11488
   There is a complex correlation among the data of scientific papers.
24. Temporal Path Covers: Dilworth Properties and Parameterized Complexity
   Source: cs.DS (Data Structures and Algorithms)
   Link: https://arxiv.org/abs/2607.00118
   The Minimum Temporal Path Cover (TPC) and Minimum Temporally Disjoint Path Cover (TDPC) problems were introduced by [Chakraborty, Dailly, Foucaud, Klasing, MFCS '24].
25. Human Vision Constrained Super-Resolution
   Source: cs.GR (Graphics)
   Link: https://arxiv.org/abs/2411.17513
   Modern deep-learning super-resolution (SR) techniques process images and videos independently of the underlying content and viewing conditions.
26. When to Repair a Graph ANN Index: A Matched-Budget Negative Result, and the Interpolated-Baseline Trap That Hid It
   Source: cs.DB (Databases)
   Link: https://arxiv.org/abs/2607.00728
   Graph approximate-nearest-neighbor (ANN) indexes (HNSW, DiskANN/Vamana) lose recall under insert/delete churn, because deletions orphan the greedy-search paths that route through removed nodes.
27. Tuning Derivatives for Causal Fairness in Machine Learning
   Source: cs.CY (Computers and Society)
   Link: https://arxiv.org/abs/2605.05882
   Artificial-intelligence systems are becoming ubiquitous in society, yet their predictions typically inherit biases with respect to protected attributes such as race, gender, or age.
28. DETRAM: End-to-end DEtection, Tracking and Recovery of HumAn Meshes
   Source: cs.CV (Computer Vision and Pattern Recognition)
   Link: https://arxiv.org/abs/2607.09089
   In the task of human mesh recovery (HMR), multi-person scenes are particularly difficult to handle due to the many entities that appear and occlusions between them over time.
29. Statistically Undetectable Backdoors in Deep Neural Networks
   Source: cs.CR (Cryptography and Security)
   Link: https://arxiv.org/abs/2607.09532
   We show how an adversarial model trainer can plant backdoors in a large class of deep, feedforward neural networks.

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.DM (Discrete Mathematics); cs.DS (Data Structures and Algorithms); cs.ET (Emerging Technologies); cs.GR (Graphics); cs.GT (Computer Science and Game Theory); cs.HC (Human-Computer Interaction); cs.IR (Information Retrieval); cs.LG (Machine Learning); cs.MA (Multiagent Systems); cs.NE (Neural and Evolutionary Computing); cs.NI (Networking and Internet Architecture); cs.PF (Performance); cs.PL (Programming Languages); cs.RO (Robotics); cs.SC (Symbolic Computation); cs.SD (Sound); cs.SE (Software Engineering); cs.SI (Social and Information Networks).
Selected 29 of 317 available items for this weekly brief.