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

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. Host Attack Graph for Botnet Propagation
   Source: cs.GT (Computer Science and Game Theory)
   Link: https://arxiv.org/abs/2610.11640
   Botnets represent the backbone of most modern cybersecurity attacks through which botmasters deploy distributed denial of service and advanced persistent threats against legitimate computer networks.
2. SAIL: Scientific Agentic Intelligence via a Science-Aware Loop
   Source: cs.DL (Digital Libraries)
   Link: https://arxiv.org/abs/2610.11451
   We introduce SAIL, an open model with 35B total and 3B active parameters for literature research, scientific coding, and multi-step research workflows.
3. Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors
   Source: cs.DC (Distributed, Parallel, and Cluster Computing)
   Link: https://arxiv.org/abs/2610.09618
   For every fixed proper minor-closed class $\mathscr C$ and every $\epsilon>0$, we give a deterministic LOCAL algorithm that returns a dominating set of size at most $(2a(\mathscr C)+1+\epsilon)\gamma_f(G)$ on every $G\in\mathscr C$.
4. Truly Sub-$3^n$ Min-Sum Subset Convolution and Join Ordering
   Source: cs.DB (Databases)
   Link: https://arxiv.org/abs/2610.10282
   We present a deterministic reduction from min-sum subset convolution to min-plus matrix product.
5. The One-Word Census: Answer-Choice Conformity Across 44 Language Models
   Source: cs.CY (Computers and Society)
   Link: https://arxiv.org/abs/2607.12796
   When a language model must choose one answer from a large space of equally valid options, which answer does it choose, and how often is it the answer every other model chooses?
6. A Camera-Native Stereo VR180 Dataset
   Source: cs.CV (Computer Vision and Pattern Recognition)
   Link: https://arxiv.org/abs/2610.10607
   Immersive VR180 video is increasingly produced with professional stereo fisheye cameras, yet public VR180 research resources are mostly collected from online platforms such as YouTube: already stitched, projected and compressed by unknown pipelines, and without lens calibration.
7. Can a System-One LLM Perform Knowledge Tracing When Few or No Learners Are Logged?
   Source: cs.CL (Computation and Language)
   Link: https://arxiv.org/abs/2610.11135
   Knowledge tracing (KT) models need many logged learners, so a new course or platform starts without a usable model.
8. Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
   Source: cs.CG (Computational Geometry)
   Link: https://arxiv.org/abs/2603.14293
   In the online hitting set problem, sets arrive over time, and the algorithm has to maintain a subset of elements that hit all the sets seen so far.
9. $\Omega((\log n/\log\log n)^2)$ Lower Bounds for Dynamic Graph Problems
   Source: cs.CC (Computational Complexity)
   Link: https://arxiv.org/abs/2610.10904
   We prove an $\Omega((\log n/\log\log n)^2)$ unconditional lower bound on the maximum of the query time and update time for dynamic data structures supporting reachability queries in $n$-node directed acyclic graphs under edge insertions.
10. A Survey on LLM-Integrated Hardware Design Verification
   Source: cs.AR (Hardware Architecture)
   Link: https://arxiv.org/abs/2610.10580
   Large language models (LLMs) are increasingly being integrated into hardware verification to automate specification interpretation, verification-artifact generation, debugging, formal reasoning, and tool orchestration.
11. Self-Supervised Keyframe Discovery for Horizon-Invariant Behavior Cloning
   Source: cs.AI (Artificial Intelligence)
   Link: https://arxiv.org/abs/2610.10857
   Behavior cloning (BC) in non-Markovian environments is a challenging problem because policies have to reason over contextual information over long horizons.
12. Secure Over-the-Air Computation Against Multiple Eavesdroppers using Correlated Artificial Noise
   Source: cs.NI (Networking and Internet Architecture)
   Link: https://arxiv.org/abs/2512.01778
   Over-the-air (OtA) computation enables scalable analog aggregation by exploiting the superposition property of wireless channels, making it an attractive joint communication and computation paradigm for distributed sensing and learning.
13. BiomedXPro: Prompt Optimization for Explainable Diagnosis with Biomedical Vision Language Models
   Source: cs.NE (Neural and Evolutionary Computing)
   Link: https://arxiv.org/abs/2510.15866
   The clinical adoption of biomedical vision-language models is hindered by prompt optimization techniques that produce either uninterpretable latent vectors or single textual prompts.
14. Humanity's Sixth Sense: Benchmarking Intuitive Visual Reasoning in Multimodal Models
   Source: cs.MM (Multimedia)
   Link: https://arxiv.org/abs/2610.08966
   Humans perceive far more in a scene than what is explicitly depicted: a single glance captures past causes and future trajectories; a quick peek determines if a vehicle can fit between two parked cars; a few seconds of video reveals who holds authority in a room; and a fleeting clip highlights subtle abstract patterns like unwritten rules or hidden labels.
15. Self-Referenced Social Preferences: Cooperation without Observing Others Rewards
   Source: cs.MA (Multiagent Systems)
   Link: https://arxiv.org/abs/2610.07881
   Social preferences can promote cooperation in multi-agent reinforcement learning, but existing approaches often require agents to observe the rewards of their peers.
16. Identification of Bivariate Causal Directionality Based on Anticipated Asymmetric Geometries
   Source: cs.LO (Logic in Computer Science)
   Link: https://arxiv.org/abs/2603.26024
   Identification of causal directionality in bivariate numerical data is a fundamental research problem with important practical implications.
17. Evaluating Rubric Generation with Interventional Transfer
   Source: cs.LG (Machine Learning)
   Link: https://arxiv.org/abs/2610.10809
   Instance-specific rubrics are common in AI benchmarks where reliable evaluation requires specific expert knowledge.
18. Retrieval-Augmented Generation for Predicting Cellular Responses to Gene Perturbation
   Source: cs.IR (Information Retrieval)
   Link: https://arxiv.org/abs/2603.07233
   Predicting transcriptional responses to genetic perturbations is fundamental to functional genomics and therapeutic discovery.
19. Before Bringing It Up: When and How AI Companions Should Use Memory
   Source: cs.HC (Human-Computer Interaction)
   Link: https://arxiv.org/abs/2610.09470
   Memory can sustain AI companionship, yet even accurate recollection can be inappropriate to use.
20. ASV3D: Adapting Diffusion-Based Single-View 3D Reconstruction with Extra Imagery
   Source: cs.GR (Graphics)
   Link: https://arxiv.org/abs/2608.08132
   Reconstruction of 3D objects from a single image is a fundamental research topic in computer vision.
21. Parameterized Reachability for Register Machines with Data
   Source: cs.FL (Formal Languages and Automata Theory)
   Link: https://arxiv.org/abs/2610.08009
   We investigate the parameterized reachability problem for concurrent register machines over infinite data domains.
22. Sufficient quantum provenance: retained fields and certified recording precision
   Source: cs.ET (Emerging Technologies)
   Link: https://arxiv.org/abs/2610.09931
   Which execution details must a quantum computation retain, and to what precision, to support a declared comparison?
23. Minimum blockers and extremal graphs for nonnested matchings
   Source: cs.DM (Discrete Mathematics)
   Link: https://arxiv.org/abs/2609.14484
   We classify all smallest sets of edge deletions that destroy every nonnested perfect matching in a complete ordered graph.
24. Characterizing Overconfident Failure in LLM-Based Code Generation
   Source: cs.SE (Software Engineering)
   Link: https://arxiv.org/abs/2610.11300
   Large language models (LLMs) are increasingly used for automated code generation, but generated programs can appear syntactically plausible while still failing execution-based correctness checks.
25. Compactness and Consistency: A Conjoint Framework for Deep Graph Clustering
   Source: cs.SI (Social and Information Networks)
   Link: https://arxiv.org/abs/2610.11506
   Graph clustering is a fundamental task in data analysis, aiming at grouping nodes with similar characteristics in the graph into clusters.
26. Compute-Constrained Safety Filters with Neuromorphic Event Triggering
   Source: cs.SY (Systems and Control)
   Link: https://arxiv.org/abs/2610.10797
   Safety filters that rely on control barrier function (CBF) quadratic programs (QPs) are typically analyzed under the assumption that the QP is solved instantaneously, although nonzero computation time can render a computed input unsafe by the time it is applied.
27. Breaking the Group Size Barrier: Parameter-Efficient Group Dance Generation with Chain-of-Dancers
   Source: cs.SD (Sound)
   Link: https://arxiv.org/abs/2610.11237
   Group dance generation aims to synthesize coordinated multi-dancer choreography from music, with broad applications in animation and interactive content creation.
28. Existence Conditions for Darboux Curves and Analytic First Integrals of a Li\'enard-Type Quadratic Vector Field
   Source: cs.SC (Symbolic Computation)
   Link: https://arxiv.org/abs/2609.13325
   We study the rational quadratic differential equation \[ \frac{\mathrm{d}y}{\mathrm{d}x} = \frac{ay^2+by+cx}{y^2}, \qquad a,b,c\in\C, \] under the non-degeneracy assumptions \[ c\neq 0,\qquad 2ay+b\not\equiv 0.
29. PMTRM: Pseudo-Memory Temporal Re-encoding Module for Embodied Policy Learning
   Source: cs.RO (Robotics)
   Link: https://arxiv.org/abs/2610.11168
   Robotic manipulation often contains repeated motions whose local observations look similar at different phases.
30. ShannonProver: Towards Automating Formal Cryptographic Proofs
   Source: cs.PL (Programming Languages)
   Link: https://arxiv.org/abs/2607.02847
   Cryptographic proofs are produced at a scale that increasingly exceeds the community's ability to verify them manually.
31. Hardware-Software Co-Design for Energy-Efficient Neural Recording in Wireless Implantable BCIs
   Source: cs.PF (Performance)
   Link: https://arxiv.org/abs/2604.21247
   Implantable Brain-Computer Interfaces (iBCIs) are increasingly pivotal in clinical and daily applications.
32. An Autonomous AI Security Agent for Banking: Multi-Vector Fraud and AML Detection Across Retail and Corporate Accounts
   Source: cs.CE (Computational Engineering, Finance, and Science)
   Link: https://arxiv.org/abs/2606.17555
   Banks face two threat families with fundamentally different detection requirements: signature-based fraud (card-not-present attacks, account takeover, ATM cloning) and behavioural financial crime (structuring, layering, mule networks, business email compromise).

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.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.ET (Emerging Technologies); 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.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.SC (Symbolic Computation); cs.SD (Sound); cs.SE (Software Engineering); cs.SI (Social and Information Networks); cs.SY (Systems and Control).
Selected 32 of 417 available items for this weekly brief.