The Flow has not summarised this story yet — read it at arXiv AI.
arXiv:2608. 02630v1 Announce Type: new Abstract: Knowledge graph engineering often distributes accepted state, observations, constraints, processes, and hypothetical scenarios across artifacts whose combined execution contract remains external.
arXiv:2609.33123v2 Announce Type: replace Abstract: Self-evolving agent harnesses continually update persistent components such as memory, prompts, skills, and tools. We call this process harness evo...
arXiv:2607. 11226v1 Announce Type: new Abstract: LLM agents today are caught in an awkward bind.
The paper investigates how tool‑using language‑model agents can safely commit changes to infrastructure when external state may change between read and commit. By distinguishing invalidating races from predicate‑preserving and irrelevant ones, the authors evaluate three commit‑time guard granularities—global epoch, read‑set version, and semantic commit predicate—using a deterministic simulator and three quantized model families. The study finds that only the complete predicate guard consistently eliminates unsafe commits, while freshness‑based guards block a large proportion of benign races and model‑side signals fail to replace precise semantic enforcement.
The paper demonstrates that a verifier used in closed‑loop agent debugging can inadvertently reveal the answer it is meant to test, rendering solver comparisons meaningless. In a study of 12 development cases, both exact minimum hitting set and a greedy method returned identical supports, and an audit showed that exact‑anchor predicates always produced the planted fault pair. The authors propose a support‑gated verification contract that requires a clean reference map and runtime evidence before an independently calibrated signal can confirm a detection, and validate this approach on 1,440 held‑out cases with a low false‑admission rate.
The paper presents a design-time verification framework for truly fearless concurrent and distributed systems. It describes a compiler that tracks wait‑for edges, preserves proofs while lowering code directly to native CPU, GPU, NPU, and FPGA targets, and uses a Program Semantic Graph to maintain the values and relationships that justify boundary contracts. Four verification tiers—structural inference, local arithmetic checks, reusable domain lemmas, and probabilistic relational proofs—enable comprehensive verification without developer annotations, supporting distributed proofs with Iris, Actris, and Aneris.