{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_c4e635647fd384758e9966921ff3e79d310d401fcdcab51f0e5725db861f8f25","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_arxiv_retraction_v1","root_at_anchor":"spider_arxiv_retraction_v1"}],"axiom_id":"axm_c4e635647fd384758e9966921ff3e79d310d401fcdcab51f0e5725db861f8f25","axiom_type":"AX.OBS","body":{"axiom_subtype":"research.arxiv_retraction.v1","category":"research","fingerprint":"a8d3cf13705f133b7c13db5e5a308b99d8d515566ccf9be86c0eecc36a94798c","published":"2026-06-15T18:19:34Z","receipt_hash":"a8d3cf13705f133b7c13db5e5a308b99d8d515566ccf9be86c0eecc36a94798c","schema":"spider.research.arxiv_retraction.v1","spider":"arxiv_retraction","spider_record":{"axiom_subtype":"research.arxiv_retraction.v1","category":"research","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"a8d3cf13705f133b7c13db5e5a308b99d8d515566ccf9be86c0eecc36a94798c","observed_at":"2026-06-17T05:51:54.273295Z","parent_run_hash":"86cc16f821718428ed61d301a2b5187a369c3d88c62e56cee39640ea6166d24f","published":"2026-06-15T18:19:34Z","runtime_version":"0.1.0","schema":"spider.research.arxiv_retraction.v1","source_status":200,"source_url":"http://export.arxiv.org/api/query?search_query=cat:cs.LG+AND+%28abs:withdrawn+OR+abs:retracted%29&max_results=20&sortBy=submittedDate&sortOrder=descending","spider":"arxiv_retraction","summary_excerpt":"Multi-agent LLM systems share state through memory stores, vector indices, and tool registries. We model such sharing as long-running read-generate-write operations under deterministic-generation semantics -- the regime durable-execution engines enforce by deterministic replay -- and formalize four concurrency anomalies in TLA+: stale-generation, phantom-tool, causal-cascade, and tool-effect reordering, structural analogues of classical isolation anomalies, each with a TLC counter-example. The exclusion lattice over these anomalies is trivial; the contribution is the mechanically verified realizability and strict separation of one maximal chain within it, $L_0 \\subsetneq \\cdots \\subsetneq L_4$, to our knowledge the first machine-checked consistency hierarchy for such runtimes. A development of 274 Verus obligations (zero assume, zero admit; trust base: two structural axioms and a mutex correspondence) proves the detectors sound and complete against the specifications and each runtime i","title":"Verified Detection and Prevention of Concurrency Anomalies in Multi-Agent Large Language Model Systems","url":"https://arxiv.org/pdf/2606.17182v1","vendor":"arxiv"},"summary":"Multi-agent LLM systems share state through memory stores, vector indices, and tool registries. We model such sharing as long-running read-generate-write operations under deterministic-generation semantics -- the regime durable-execution engines enforce by deterministic replay -- and formalize four concurrency anomalies in TLA+: stale-generation, phantom-tool, causal-cascade, and tool-effect reordering, structural analogues of classical isolation anomalies, each with a TLC counter-example. The exclusion lattice over these anomalies is trivial; the contribution is the mechanically verified realizability and strict separation of one maximal chain within it, $L_0 \\subsetneq \\cdots \\subsetneq L_4$, to our knowledge the first machine-checked consistency hierarchy for such runtimes. A development of 274 Verus obligations (zero assume, zero admit; trust base: two structural axioms and a mutex correspondence) proves the detectors sound and complete against the specifications and each runtime i","title":"Verified Detection and Prevention of Concurrency Anomalies in Multi-Agent Large Language Model Systems","vendor":"arxiv"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-17T05:51:54Z","notes":"Spider arxiv_retraction (research) research.arxiv_retraction.v1","object":{"captured_by":"crovia.spider.arxiv_retraction","primary_source_url":"https://arxiv.org/pdf/2606.17182v1"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:eaca74e12f01d461e0e2aacf72953e108b8f565626b39e9ccf1320929dfa6c54e71c3b475b4bf5ce7f981093a0e48504605c34e54ea4396b2dd36486f371ac0e","signer":"crovia.substrate","subject":{"observed_at":"2026-06-17T05:51:54Z","source_collector":"spider:arxiv_retraction","target_id":"https://arxiv.org/pdf/2606.17182v1"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/research/arxiv_retraction_v1.jsonl\",\"source_seal_merkle_root\":\"spider_arxiv_retraction_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"9f01fa4aad20b091cd4e74acedcabe498dbc4d0a53fab6b00ee512322dd44693","leaf_index":231193,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"a942540dad7402588150e804353529b5b3bda4d3514db895e46e159a7f84523b","side":"left"},{"sibling":"57e87558e51d8436f5a5089cffba1627d573575e2a8de117e8a44f9a936c2854","side":"right"},{"sibling":"af2e910fd442812a1696bac47e149756f0e455b304c57cb1c6016f38b4e4fff2","side":"right"},{"sibling":"17a413578df0e501dd1a1b0ff91e9c364dcfbe843f5329ef970afc84b0466eb0","side":"left"},{"sibling":"02c145791776374586e6b2a425035ee578f6462374be1145294397cfbabba8fe","side":"left"},{"sibling":"87bd0b56358fe9ae69937485a52bece1be580be28340c6c6fc2becf4e2ebecdf","side":"right"},{"sibling":"e2d681af25ba885ba6bc2d1eb6a410702db53eade7d0e2d790e3236c9a2d7732","side":"right"},{"sibling":"0ae860e290945c64890d55dc28095f562490a099df8e59b2d2e5f2b2d1be56e5","side":"right"},{"sibling":"bfbeb449d4d2bbc468cec9557e739a5a85f1f2ef7969fe3e05fbc5a1774f3fa8","side":"left"},{"sibling":"1d74941c32baeab8cad08f8700cb49427d8256f231534f2a225b2bb3e84e4ff8","side":"left"},{"sibling":"d5b9f8b1a2c9f6a46e17982dfbe6ce1f3b5fa4e730220397f2253d114dcc8486","side":"left"},{"sibling":"d10d772a4984cae00e65ab24af21d1d260e475bbaae3f17871859eb705bd3999","side":"right"},{"sibling":"e79159853f2f35ddae8e3247d515e433c534277b287d65bbd77ae989aa4992fa","side":"right"},{"sibling":"3054319f1840cce0eaaf0bc4b1ae38e5bf8b6210927d924a750775cc7d77cca6","side":"right"},{"sibling":"0fd8b5059f279c4a4a6688de2472fdbc25543fee183df19b21dacca880354cff","side":"right"},{"sibling":"a04392fb9f2a3a620840e3b3fecd93d12e6d224e481c162389d8ae64e7194599","side":"left"},{"sibling":"c300cf0154c136afc09b1702a0be98f4ba5b6dc5cf57e8cc714ec1eaf4196eff","side":"left"},{"sibling":"d841ad93efda0869e5eb97678f348f03f5caab4353e05ff4bf18f47fb945b822","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":232015,"merkle_root":"62bfb7809bb55667ad7eeebdb48267b9b2c1ee89bb808ea1e6d3a814a15aa402","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260617T133701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-17T13:39:59Z","sig_algorithm":"ed25519","signature":"930a3563c643cc7518d048b12a1f5392a96a5edce49533ba0a56f11b6cc69319bb1c800aacc46b52a6941c4d05dae255a45cac757d6093c971b96852c24f140e","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_c4e635647fd384758e9966921ff3e79d310d401fcdcab51f0e5725db861f8f25"}}