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

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. ThinkJev: One Thought, Every Budget for Calibrated Typed Decisions
   Source: cs.AI (Artificial Intelligence)
   Link: https://arxiv.org/abs/2610.37732
   Many uses of language models end in a typed decision: a choice among a closed set of options, whose probabilities code can act on.
2. zkDuel: Characterizing SumCheck Prover Kernels across GPU Programming Models
   Source: cs.AR (Hardware Architecture)
   Link: https://arxiv.org/abs/2610.37710
   SumCheck is a central prover primitive in zero-knowledge proofs, exposing table-parallel work that maps naturally to GPUs but becomes increasingly arithmetic-intensive as finite fields widen.
3. Enumeration Complexity of Permutation Classes
   Source: cs.CC (Computational Complexity)
   Link: https://arxiv.org/abs/2610.37940
   We study classes of permutations that are defined by avoidance of forbidden patterns.
4. PyPSA-Libya: An Open-Source Energy System Model for National Decarbonization and Hydrogen Export Pathways
   Source: cs.CE (Computational Engineering, Finance, and Science)
   Link: https://arxiv.org/abs/2610.38094
   Libya possesses significant renewable energy potential that remains largely untapped.
5. Certified Small Well-Separated Pair Decompositions in Practice
   Source: cs.CG (Computational Geometry)
   Link: https://arxiv.org/abs/2610.39521
   Given n points and $\epsilon>0$, a well-separated pair decomposition (WSPD) is a collection of dumbbells {X,Y}, where X and Y have diameter at most $\epsilon$ times their distance, such that every pair of points has one point in X and the other in Y for some dumbbell.
6. FVH-Bench: Evaluating Image Generator Safety Beyond Overtly Harmful Imagery
   Source: cs.CR (Cryptography and Security)
   Link: https://arxiv.org/abs/2610.37722
   Modern image generators can produce complex visual artifacts, including diagrams, interfaces, and records that combine text, graphics, and layout to convey detailed information.
7. Convex Potential Learning for Optimal Transport Between Medical Images
   Source: cs.CV (Computer Vision and Pattern Recognition)
   Link: https://arxiv.org/abs/2610.37844
   Computing optimal transport maps between medical images plays a fundamental role in morphological analysis.
8. Random Centres and the $\varepsilon$-Dependence of Constant-Round Planar Domination
   Source: cs.DC (Distributed, Parallel, and Cluster Computing)
   Link: https://arxiv.org/abs/2610.38020
   It was recently shown (arXiv:2610.09618) that the infimum of the approximation ratios of deterministic constant-round LOCAL algorithms for minimum dominating set on planar graphs is 7.
9. Guidance List for repOrting Bibliometric AnaLyses (GLOBAL): A Reporting Guideline Informed by a Two-Round Modified Delphi Study
   Source: cs.DL (Digital Libraries)
   Link: https://arxiv.org/abs/2610.38748
   Background: Despite the growth of bibliometric analyses, few studies offer guidance on how to report them, resulting in a lack of research transparency and completeness.
10. A Characterization of Functions on the Integer Lattice That Are L-Extendable through Local Convex Extensions
   Source: cs.DM (Discrete Mathematics)
   Link: https://arxiv.org/abs/2610.38287
   L-extendable functions on the integer lattice are functions that admit a $\frac12$UJ-convex relaxation; that is, values can be assigned to the additional half-integral points, while keeping the original values at integer points, so that the resulting function is $\frac12$UJ-convex.
11. Versatile Photonic Encoding Platform with Selectable Back Ends for Automotive Edge Processing
   Source: cs.ET (Emerging Technologies)
   Link: https://arxiv.org/abs/2610.39337
   The increasing diversity and computational demands of automotive edge functions require hardware architectures that support heterogeneous processing while limiting implementation complexity and system overhead.
12. Exact Avoid-or-Compress Extrema for Dense Reachable Images: Defects Four and Five
   Source: cs.FL (Formal Languages and Automata Theory)
   Link: https://arxiv.org/abs/2610.39833
   Let $S$ be a reachable image of a strongly connected synchronizing automaton and $\varnothing\ne A\subsetneq S$.
13. HyperIntent: Tracking Intent Shifts for Efficient Reasoning on Dynamic Textual Graphs
   Source: cs.GR (Graphics)
   Link: https://arxiv.org/abs/2610.38182
   Dynamic web interactions continuously evolve as new edges arrive, offering large language models (LLMs) great potential for reasoning over edge-level temporal semantics.
14. Toward Understanding the Value of Anarchy: Empirical Studies on Best Response Dynamics
   Source: cs.GT (Computer Science and Game Theory)
   Link: https://arxiv.org/abs/2610.38081
   We study experimental results of best response dynamics (BRD) in randomly generated weighted action networked multiagent optimization problems where agent utility is the agent's marginal contribution to the system objective.
15. Advisor, Co-pilot, or Guardian? AI Role Framing and Human Decision Behavior in Automated Vehicle Takeovers
   Source: cs.HC (Human-Computer Interaction)
   Link: https://arxiv.org/abs/2610.37892
   Artificial intelligence (AI) technology has gradually been integrated into automated vehicles.
16. DuQUAD: A Dual-View Framework with Quality-Aware Evidence Pruning for Multi-Document Question Answering
   Source: cs.IR (Information Retrieval)
   Link: https://arxiv.org/abs/2610.37701
   Large language models with retrieval-augmented generation systematically underutilize evidence in the middle of multi-document contexts, a phenomenon known as Lost in the Middle.
17. What a Weight Update Buys: Leverage Across Training Stages
   Source: cs.LG (Machine Learning)
   Link: https://arxiv.org/abs/2610.37719
   Post-training moves a language model's weights by about a thousandth of their norm and changes its behavior sharply; pretraining moves them by a third and buys a slow drift.
18. CoWalk: Cooperative Walks for Agentic Batch Queries on Disk-Resident Graphs
   Source: cs.DB (Databases)
   Link: https://arxiv.org/abs/2610.38404
   Workloads such as query rewriting, deep research and group-relative policy optimization (GRPO) issue batches of semantically related vector queries.
19. Extending Higher-Order Critical Pairs
   Source: cs.LO (Logic in Computer Science)
   Link: https://arxiv.org/abs/2610.38576
   Confluence is a fundamental property of computation which implies that the nondeterminism of a system does not affect its outcomes.
20. Network Topology Does Not Matter: The Breakdown of Classical Consensus in LLM Populations
   Source: cs.MA (Multiagent Systems)
   Link: https://arxiv.org/abs/2610.37699
   As multi-agent language model networks become widely deployed, predicting their collective behavior is a critical challenge.
21. Generating pivot Gray codes for spanning arborescences of complete digraphs and split digraphs in constant amortized time
   Source: cs.DS (Data Structures and Algorithms)
   Link: https://arxiv.org/abs/2610.37783
   We present the first known efficient algorithm to generate pivot Gray codes for spanning arborescences of complete digraphs, listing all spanning arborescences such that consecutive arborescences differ by reassigning the outgoing edge of exactly one vertex.
22. NLP-based Message Prioritisation for Opportunistic Routing: A Case Study of Nepal Earthquake Emergency Communication
   Source: cs.NI (Networking and Internet Architecture)
   Link: https://arxiv.org/abs/2610.37933
   This dissertation investigates whether Natural Language Processing (NLP) based semantic message prioritisation can improve the treatment of urgent disaster messages in opportunistic emergency communication, using the 2015 Nepal earthquake as a case study.
23. TSM diff: A new Parallel-Tree-Traversal Algorithm for the Comparison of Music Score Files
   Source: cs.MM (Multimedia)
   Link: https://arxiv.org/abs/2610.38545
   Music score files are more difficult to compare than their text-based equivalents, as their content is more complex and organised into hierarchical structures.
24. PhOSv1: Efficient Scaling of Model Sleeping on a Single Server for Autoscaling with GPU-Context Deduplication
   Source: cs.OS (Operating Systems)
   Link: https://arxiv.org/abs/2610.39999
   Autoscaling is a key mechanism in model-as-a-service systems, where fast scale-up is essential because the scale-up time directly determines how long a model service remains overloaded, which in turn governs serving quality.
25. Scrambled Multiply-with-Carry Pseudorandom Number Generators
   Source: cs.MS (Mathematical Software)
   Link: https://arxiv.org/abs/2610.27313
   Multiply-with-carry (MWC) generators are very fast pseudorandom number generators whose quality depends on the choice of a multiplier, and is usually assessed by applying the spectral test to an associated multiplicative congruential generator.
26. Understanding Post-Quantum Cryptography Adoption: Practices, Challenges, and Evolution in Open-Source Software
   Source: cs.SE (Software Engineering)
   Link: https://arxiv.org/abs/2610.38054
   Post-quantum cryptography (PQC) standards establish algorithms for quantum-safe systems, but empirical evidence about how software projects implement and maintain PQC support remains limited.
27. New Election, Same Old Story: How Tropes Form a Grammar of Election Rumors
   Source: cs.SI (Social and Information Networks)
   Link: https://arxiv.org/abs/2610.37804
   Recent elections in the United States have seen online rumors become a regular feature of election discourse as voters and election officials work to navigate a sea of digitally spread claims and propaganda.
28. Efficient Joint Trajectory Optimization and Resource Allocation for Secure UAV Networks: A Deep Reinforcement Learning Approach
   Source: cs.SY (Systems and Control)
   Link: https://arxiv.org/abs/2610.37897
   Unmanned Aerial Vehicles (UAVs) are increasingly deployed in wireless networks; however, ensuring secure communication and efficient energy usage remains challenging.
29. Discovering Interpretable Acoustic Features in Autoregressive Voice-Cloning TTS Models
   Source: cs.SD (Sound)
   Link: https://arxiv.org/abs/2610.40505
   Voice-cloning TTS models synthesize an unseen speaker's voice from brief speech prompts, but it remains unclear which acoustic properties they represent and use.
30. Hamming Ideals and Grobner Bases for ISD-like Syndrome Decoding
   Source: cs.SC (Symbolic Computation)
   Link: https://arxiv.org/abs/2609.18866
   We investigate an algebraic approach to the Syndrome Decoding Problem, based on a reformulation of the Hamming weight constraint and its integration with the Information Set Decoding paradigm.
31. SimRetract: Zero-Shot Sim-to-Real Robotic Assistance for Retractor Take-Over in Open Surgery
   Source: cs.RO (Robotics)
   Link: https://arxiv.org/abs/2610.38234
   We demonstrate the first zero-shot sim-to-real transfer for a surgeon-robot collaboration task in open surgery: retractor take-over.
32. crush: Extensible Proof Automation for Lean
   Source: cs.PL (Programming Languages)
   Link: https://arxiv.org/abs/2610.40538
   Lean's rich expressiveness supports higher-order functions, inductive datatypes, and user-defined abstractions, making it challenging to translate proof obligations into first-order Satisfiability Modulo Theory (SMT) queries and reconstruct kernel checked proofs.
33. Trigger Timing, Deadline Readiness, and Event-Aligned Accounting for Dynamic Ad Insertion
   Source: cs.PF (Performance)
   Link: https://arxiv.org/abs/2609.19899
   An ad break in a live stream is a hard deadline.

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.CR (Cryptography and Security); cs.CV (Computer Vision and Pattern Recognition); 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.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.MS (Mathematical Software); cs.NI (Networking and Internet Architecture); cs.OS (Operating Systems); 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 33 of 477 available items for this weekly brief.