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

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. Who Pays for a Connected Public Good?
   Source: cs.GT (Computer Science and Game Theory)
   Link: https://arxiv.org/abs/2609.10565
   Connectivity can turn separate contributions into a public good that benefits participants and nonparticipants alike.
2. Halo: Improving forecast accuracy through heteroscedastic estimation
   Source: cs.LG (Machine Learning)
   Link: https://arxiv.org/abs/2609.10589
   Heteroscedastic forecasting, where a network estimates a scale parameter alongside a location parameter, is normally motivated by uncertainty quantification.
3. A Four-Valued Graph Model for Conflict Resolution: Core Framework and a Machine-Checked Formalization in Lean 4
   Source: cs.LO (Logic in Computer Science)
   Link: https://arxiv.org/abs/2609.11174
   This note consolidates the core of the Quasi-Closed World Graph Model for Conflict Resolution (QCW-GMCR), which extends the standard Graph Model for Conflict Resolution with Belnap's four-valued logic to represent option-level epistemic ambiguity, and pairs the framework with a machine-checked Lean 4 formalization.
4. UniRec: Cross-stage Multi-Task Fusion with Preference Alignment for Cascaded Recommender Systems
   Source: cs.IR (Information Retrieval)
   Link: https://arxiv.org/abs/2609.11052
   Industrial recommender systems use cascaded stages with different objectives, feature spaces, and latency constraints.
5. SimSkill: A Self-Evolving LLM Agent for Skill and Knowledge Accumulation in Traffic Simulation
   Source: cs.MA (Multiagent Systems)
   Link: https://arxiv.org/abs/2609.03753
   Cumulative culture enables humans to preserve, reuse, and extend knowledge and skills across experiences and generations.
6. Multimodal Temporal Modeling for Continuous Group Emotion Recognition in Multi-party Dialogues
   Source: cs.MM (Multimedia)
   Link: https://arxiv.org/abs/2609.11164
   To realize natural behavior in dialogue agents in multi-party dialogue scenarios, it is important to understand group emotion such as valence and arousal as a whole.
7. Breaking the Central Bias: Spatially Partitioned Experts for Coordinate-Based Neuroevolution
   Source: cs.NE (Neural and Evolutionary Computing)
   Link: https://arxiv.org/abs/2609.11518
   Evolvable-Substrate HyperNEAT (ES-HyperNEAT), a bio-inspired indirect encoding that determines neuron placement and connection weights from spatial coordinates, exhibits a failure mode on MNIST as a diagnostic benchmark.
8. IPv6 Hitlist Service: Lessons Learned From 10 Years of Operation
   Source: cs.NI (Networking and Internet Architecture)
   Link: https://arxiv.org/abs/2609.11475
   After becoming an Internet Draft more than 30 years ago, IPv6 has seen an increase in deployment and use in the past years.
9. Towards Continuous Profiling and Optimization of Quantum-Classical Pipelines
   Source: cs.OS (Operating Systems)
   Link: https://arxiv.org/abs/2609.05814
   Quantum applications increasingly execute as multi-stage quantum-classical pipelines, interleaving QPU computation with classical stages like circuit generation, transpilation, layout mapping, quantum error mitigation (QEM), and post-processing.
10. Copying Versus Randomization in Lempel-Ziv Music Synthesis
   Source: cs.SD (Sound)
   Link: https://arxiv.org/abs/2609.11353
   We utilize Lempel-Ziv universal compression for music note generation. We control the algorithm's tendency to over-copy or under-copy training data by manipulating the average sequence length saved in the dictionary.
11. Quasilinear multiplication in the real Cayley--Dickson tower
   Source: cs.SC (Symbolic Computation)
   Link: https://arxiv.org/abs/2609.11588
   Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity.
12. Predefined-Time Resilient Integral Reinforcement Learning for Input-Constrained Unknown Nonlinear Systems Under FDI Attacks and Disturbances: A Fully
   Source: cs.SY (Systems and Control)
   Link: https://arxiv.org/abs/2609.11815
   This paper investigates optimal control for nonlinear systems with unknown dynamics, input constraints, disturbances, and adversarial signals.
13. Safety-aware Skill Adaptation for Reinforcement Learning in Dynamic Environments
   Source: cs.RO (Robotics)
   Link: https://arxiv.org/abs/2609.11433
   Skill adaptation frameworks based on reinforcement learning often require restrictive assumptions to maintain stability, such as fixed observations or tightly controlled exploration schedules.
14. 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.
15. ChurnBench: A Drift-Aware Benchmark Demonstrating That Refresh Scheduling, Not Cache Age, Governs Staleness in Agentic AI
   Source: cs.SE (Software Engineering)
   Link: https://arxiv.org/abs/2609.11515
   In production, agentic systems answer questions over data that lives in several places and keeps changing: licenses are reassigned, users offboarded, prices changed, contracts renewed.
16. Ceci n'est pas une pipe: AI systems as semantic abstractions
   Source: cs.PL (Programming Languages)
   Link: https://arxiv.org/abs/2607.09489
   An AI system's output is not the fact or world state it appears to describe, but rather an engineered representation.
17. Taming Bitwise Behavior in GPU Kernels with Tensor Core: Black-Box Reconstruction, Compiler Enforcement, and Static Verification
   Source: cs.PF (Performance)
   Link: https://arxiv.org/abs/2609.11356
   Determinism and numerical reproducibility are increasingly required of GPU kernels in machine learning systems, yet deterministic implementations of the same kernel can still differ bit for bit.
18. Automating Quadratic Unconstrained Binary Optimization (QUBO) Formulation Generation from Natural Language
   Source: cs.AI (Artificial Intelligence)
   Link: https://arxiv.org/abs/2609.10629
   Quadratic Unconstrained Binary Optimization (QUBO) is a central formulation for combinatorial optimization and has gained increasing attention due to its compatibility with quantum, hybrid quantum-classical, and quantum-inspired solvers.
19. Fengshui: Demystifying Chiplet Ecosystem and Bespoke Neural Network Accelerator Codesign
   Source: cs.AR (Hardware Architecture)
   Link: https://arxiv.org/abs/2609.10970
   Modern ML workloads, with stringent latency and energy constraints, are increasingly hard to run efficiently on homogeneous commodity hardware.
20. Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor
   Source: cs.CC (Computational Complexity)
   Link: https://arxiv.org/abs/2609.11285
   We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs.
21. Node-Shift-Encoding Genetic Algorithm with fuzzy-enhanced reference tour to solve the bi-objective service-oriented TSP
   Source: cs.CE (Computational Engineering, Finance, and Science)
   Link: https://arxiv.org/abs/2609.11257
   The Travelling Salesman Problem (TSP) remains a key area of research in combinatorial optimization, with applications in logistics, manufacturing, and service delivery.
22. Some results on Archdeacon's conjecture for rotation systems
   Source: cs.CG (Computational Geometry)
   Link: https://arxiv.org/abs/2609.11599
   A rotation system on $n$ elements assigns to each element a cyclic order of the other $n-1$ elements.
23. NCP-ArchPreview Technical Report: Moving towards Latent Space Language Models through Next Concept Prediction
   Source: cs.CL (Computation and Language)
   Link: https://arxiv.org/abs/2609.10715
   We introduce NCP-ArchPreview, a latent-space language model that pushes autoregressive pretraining beyond standard next-token prediction (NTP).
24. Threshold Choice, Not Sample Size, Bounds Trustless Verification of Nondeterministic Compound AI Workflows
   Source: cs.CR (Cryptography and Security)
   Link: https://arxiv.org/abs/2609.10601
   Compound AI pipelines chain LLM calls, retrievers, and tools and are nondeterministic: sampling, model updates, and volatile tool responses make one input yield different outputs across runs.
25. Designing Technology for Social Wellbeing in Built Environments: A Conceptual Framework
   Source: cs.CY (Computers and Society)
   Link: https://arxiv.org/abs/2609.10779
   Digital technologies are deployed in urban built environments with the aim of supporting social dimensions.
26. You've Got a BUD in Me: Authenticated Reads from Per-Block Write Logs
   Source: cs.DB (Databases)
   Link: https://arxiv.org/abs/2609.11251
   Blockchains usually pay for authenticated reads by maintaining a structure that spans the entire state.
27. MUC-FL: Block-Wise Marginal Utility Contribution for Communication-Efficient Federated Learning
   Source: cs.DC (Distributed, Parallel, and Cluster Computing)
   Link: https://arxiv.org/abs/2609.10545
   Federated Learning (FL) enables distributed model training without centralizing data but suffers from high communication overhead.
28. Approximation guarantees for Hub Covering Problems
   Source: cs.DM (Discrete Mathematics)
   Link: https://arxiv.org/abs/2503.02566
   Hub Covering Problems are a subclass of Hub Location Problems.
29. Lower Bounds for Private Graph Optimization Problems using Reconstruction Attacks
   Source: cs.DS (Data Structures and Algorithms)
   Link: https://arxiv.org/abs/2609.10877
   This paper studies fundamental graph optimization problems under differential privacy (DP) and shows new, reconstruction-based lower bounds.
30. But How Would AI Agents Run a Town's Economy?
   Source: cs.ET (Emerging Technologies)
   Link: https://arxiv.org/abs/2609.11108
   We placed 100 memory-equipped large language model (LLM) agents in charge of a closed, money-conserving spatial economy on real Pokhara Lakeside geography (earning wages, running businesses, setting prices) and ran this multi-agent simulation for up to 26 simulated weeks, well past the 1-2 weeks typical of agent-society studies.

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.DS (Data Structures and Algorithms); cs.ET (Emerging Technologies); cs.GT (Computer Science and Game Theory); 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.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 30 of 342 available items for this weekly brief.