{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:AOCFJRKNWFOQWHTC3BMWC774CO","short_pith_number":"pith:AOCFJRKN","canonical_record":{"source":{"id":"2605.14175","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-13T22:54:16Z","cross_cats_sorted":[],"title_canon_sha256":"6a10eb7e5fd14f6f704a3df7d0ff85ed96631150f1d75c250dd168f5c26a2220","abstract_canon_sha256":"7bd9f77485be8aa79f5105ec72fc64a448f963d7cfb871b05da8320bfe58d972"},"schema_version":"1.0"},"canonical_sha256":"038454c54db15d0b1e62d859617ffc13883d789f8be2b9417efe96e2136eaba5","source":{"kind":"arxiv","id":"2605.14175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14175","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14175v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14175","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"AOCFJRKNWFOQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"AOCFJRKNWFOQWHTC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"AOCFJRKN","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:AOCFJRKNWFOQWHTC3BMWC774CO","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14175","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-13T22:54:16Z","cross_cats_sorted":[],"title_canon_sha256":"6a10eb7e5fd14f6f704a3df7d0ff85ed96631150f1d75c250dd168f5c26a2220","abstract_canon_sha256":"7bd9f77485be8aa79f5105ec72fc64a448f963d7cfb871b05da8320bfe58d972"},"schema_version":"1.0"},"canonical_sha256":"038454c54db15d0b1e62d859617ffc13883d789f8be2b9417efe96e2136eaba5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:11.309629Z","signature_b64":"NAZz0DE5AV6HLJ2dMsYjHZ2RvCRFbpU5dSTL3RnTUm66WM+eLZiu9z8jQqi2om1xgQITfMnQqL2cG+8Vs/HMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"038454c54db15d0b1e62d859617ffc13883d789f8be2b9417efe96e2136eaba5","last_reissued_at":"2026-05-17T23:39:11.308891Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:11.308891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14175","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sRdvaU+bYiyHdJaOaXGRzYvjtycCoDA/h2BAcZxgGau+a5i0I0IgPQJk4pWlHznAuRfN2HS3WRkr1g/n4pCZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:38:32.013916Z"},"content_sha256":"eb34cbf12abd95acf4c210957981f819dc50beb4d9ec38dd6aee217ebd1460d0","schema_version":"1.0","event_id":"sha256:eb34cbf12abd95acf4c210957981f819dc50beb4d9ec38dd6aee217ebd1460d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:AOCFJRKNWFOQWHTC3BMWC774CO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Grounded Continuation: A Linear-Time Runtime Verifier for LLM Conversations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A runtime verifier builds a dependency graph from eight formal update operations to keep LLM continuations grounded on active premises.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Qisong He, Xiaowei Huang, Yi Dong","submitted_at":"2026-05-13T22:54:16Z","abstract_excerpt":"In long conversations, an LLM can produce a next utterance that sounds plausible but rests on premises the conversation has already abandoned. Context-manipulation attacks against deployed agents now actively exploit this gap. We close it with a runtime verifier that maintains an explicit dependency graph: an LLM classifies each turn into one of 8 update operations drawn from four formalisms (dynamic epistemic logic, abductive reasoning, awareness logic, argumentation), and a symbolic engine records which claims depend on which evidence. Checking whether a continuation is supported reduces to "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"On LongMemEval-KU the verifier reaches 89.7% accuracy with linear per-turn cost and a formal conflict-free guarantee; on the 15-item stale-premise subset it reaches 100% accuracy.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The LLM can be prompted to classify each conversation turn into one of the eight update operations drawn from dynamic epistemic logic, abductive reasoning, awareness logic, and argumentation with sufficient faithfulness for the dependency graph to remain accurate.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A hybrid LLM-symbolic verifier maintains a dependency graph over conversation turns classified into eight formal update operations, enabling linear-time groundedness checks and precise retraction propagation with a conflict-free guarantee.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A runtime verifier builds a dependency graph from eight formal update operations to keep LLM continuations grounded on active premises.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d4ff32e26d0edb8ecf07722ab4d90ab43574b2056a0526f1a8b38252b4344f88"},"source":{"id":"2605.14175","kind":"arxiv","version":1},"verdict":{"id":"bc3eda71-7e76-4894-8300-3d9f94ada6d5","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T04:43:51.131353Z","strongest_claim":"On LongMemEval-KU the verifier reaches 89.7% accuracy with linear per-turn cost and a formal conflict-free guarantee; on the 15-item stale-premise subset it reaches 100% accuracy.","one_line_summary":"A hybrid LLM-symbolic verifier maintains a dependency graph over conversation turns classified into eight formal update operations, enabling linear-time groundedness checks and precise retraction propagation with a conflict-free guarantee.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The LLM can be prompted to classify each conversation turn into one of the eight update operations drawn from dynamic epistemic logic, abductive reasoning, awareness logic, and argumentation with sufficient faithfulness for the dependency graph to remain accurate.","pith_extraction_headline":"A runtime verifier builds a dependency graph from eight formal update operations to keep LLM continuations grounded on active premises."},"references":{"count":47,"sample":[{"doi":"","year":null,"title":"International Conference on Learning Representations (ICLR) , year =","work_id":"c06d5126-b559-4ae3-81b0-084108553a24","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Wang, Peiran and Liu, Yang and Lu, Yunfei and Cai, Yifeng and Chen, Hongbo and Yang, Qingyou and Zhang, Jie and Hong, Jue and Wu, Ye , journal =","work_id":"4aef8ce8-3437-4e88-8b83-1f0068c0ffcc","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Logic and the Foundations of Game and Decision Theory (","work_id":"077d462a-8f56-44c3-919c-2e8ba6b43b3b","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Moss and Slawomir Solecki , title =","work_id":"4656eeb7-ca30-4268-b440-a68df38fe7dc","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Halpern and Yoram Moses and Moshe Y","work_id":"1ecd7a7d-615f-43a5-aeff-a125e033ffdd","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":47,"snapshot_sha256":"6d41d9eb7cc5caa4def2fa00320e1ddfbcfed202cb319b7f2b3ed9742a29cb23","internal_anchors":3},"formal_canon":{"evidence_count":2,"snapshot_sha256":"288edb9a7e03051126e5373828016f35cda374cfeeeac1f1ec82f2cd018f11e7"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"bc3eda71-7e76-4894-8300-3d9f94ada6d5"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5NIC3XRYW675zvjceucYEu+fUDsBxzLQqi/e8Q2s1Ro8Ty4NT3vvYnYAY285bg8XUQBqqkjSQ23+CdZa7keaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:38:32.014958Z"},"content_sha256":"67c69f24b7091bed571b4080000a3079479b5aa07d150cac3229c615b6e85778","schema_version":"1.0","event_id":"sha256:67c69f24b7091bed571b4080000a3079479b5aa07d150cac3229c615b6e85778"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOCFJRKNWFOQWHTC3BMWC774CO/bundle.json","state_url":"https://pith.science/pith/AOCFJRKNWFOQWHTC3BMWC774CO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOCFJRKNWFOQWHTC3BMWC774CO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T15:38:32Z","links":{"resolver":"https://pith.science/pith/AOCFJRKNWFOQWHTC3BMWC774CO","bundle":"https://pith.science/pith/AOCFJRKNWFOQWHTC3BMWC774CO/bundle.json","state":"https://pith.science/pith/AOCFJRKNWFOQWHTC3BMWC774CO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOCFJRKNWFOQWHTC3BMWC774CO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:AOCFJRKNWFOQWHTC3BMWC774CO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7bd9f77485be8aa79f5105ec72fc64a448f963d7cfb871b05da8320bfe58d972","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-13T22:54:16Z","title_canon_sha256":"6a10eb7e5fd14f6f704a3df7d0ff85ed96631150f1d75c250dd168f5c26a2220"},"schema_version":"1.0","source":{"id":"2605.14175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14175","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14175v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14175","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"AOCFJRKNWFOQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"AOCFJRKNWFOQWHTC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"AOCFJRKN","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:67c69f24b7091bed571b4080000a3079479b5aa07d150cac3229c615b6e85778","target":"graph","created_at":"2026-05-17T23:39:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"On LongMemEval-KU the verifier reaches 89.7% accuracy with linear per-turn cost and a formal conflict-free guarantee; on the 15-item stale-premise subset it reaches 100% accuracy."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The LLM can be prompted to classify each conversation turn into one of the eight update operations drawn from dynamic epistemic logic, abductive reasoning, awareness logic, and argumentation with sufficient faithfulness for the dependency graph to remain accurate."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A hybrid LLM-symbolic verifier maintains a dependency graph over conversation turns classified into eight formal update operations, enabling linear-time groundedness checks and precise retraction propagation with a conflict-free guarantee."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A runtime verifier builds a dependency graph from eight formal update operations to keep LLM continuations grounded on active premises."}],"snapshot_sha256":"d4ff32e26d0edb8ecf07722ab4d90ab43574b2056a0526f1a8b38252b4344f88"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"288edb9a7e03051126e5373828016f35cda374cfeeeac1f1ec82f2cd018f11e7"},"paper":{"abstract_excerpt":"In long conversations, an LLM can produce a next utterance that sounds plausible but rests on premises the conversation has already abandoned. Context-manipulation attacks against deployed agents now actively exploit this gap. We close it with a runtime verifier that maintains an explicit dependency graph: an LLM classifies each turn into one of 8 update operations drawn from four formalisms (dynamic epistemic logic, abductive reasoning, awareness logic, argumentation), and a symbolic engine records which claims depend on which evidence. Checking whether a continuation is supported reduces to ","authors_text":"Qisong He, Xiaowei Huang, Yi Dong","cross_cats":[],"headline":"A runtime verifier builds a dependency graph from eight formal update operations to keep LLM continuations grounded on active premises.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-13T22:54:16Z","title":"Grounded Continuation: A Linear-Time Runtime Verifier for LLM Conversations"},"references":{"count":47,"internal_anchors":3,"resolved_work":47,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"International Conference on Learning Representations (ICLR) , year =","work_id":"c06d5126-b559-4ae3-81b0-084108553a24","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Wang, Peiran and Liu, Yang and Lu, Yunfei and Cai, Yifeng and Chen, Hongbo and Yang, Qingyou and Zhang, Jie and Hong, Jue and Wu, Ye , journal =","work_id":"4aef8ce8-3437-4e88-8b83-1f0068c0ffcc","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Logic and the Foundations of Game and Decision Theory (","work_id":"077d462a-8f56-44c3-919c-2e8ba6b43b3b","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Moss and Slawomir Solecki , title =","work_id":"4656eeb7-ca30-4268-b440-a68df38fe7dc","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Halpern and Yoram Moses and Moshe Y","work_id":"1ecd7a7d-615f-43a5-aeff-a125e033ffdd","year":null}],"snapshot_sha256":"6d41d9eb7cc5caa4def2fa00320e1ddfbcfed202cb319b7f2b3ed9742a29cb23"},"source":{"id":"2605.14175","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T04:43:51.131353Z","id":"bc3eda71-7e76-4894-8300-3d9f94ada6d5","model_set":{"reader":"grok-4.3"},"one_line_summary":"A hybrid LLM-symbolic verifier maintains a dependency graph over conversation turns classified into eight formal update operations, enabling linear-time groundedness checks and precise retraction propagation with a conflict-free guarantee.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A runtime verifier builds a dependency graph from eight formal update operations to keep LLM continuations grounded on active premises.","strongest_claim":"On LongMemEval-KU the verifier reaches 89.7% accuracy with linear per-turn cost and a formal conflict-free guarantee; on the 15-item stale-premise subset it reaches 100% accuracy.","weakest_assumption":"The LLM can be prompted to classify each conversation turn into one of the eight update operations drawn from dynamic epistemic logic, abductive reasoning, awareness logic, and argumentation with sufficient faithfulness for the dependency graph to remain accurate."}},"verdict_id":"bc3eda71-7e76-4894-8300-3d9f94ada6d5"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eb34cbf12abd95acf4c210957981f819dc50beb4d9ec38dd6aee217ebd1460d0","target":"record","created_at":"2026-05-17T23:39:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7bd9f77485be8aa79f5105ec72fc64a448f963d7cfb871b05da8320bfe58d972","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-13T22:54:16Z","title_canon_sha256":"6a10eb7e5fd14f6f704a3df7d0ff85ed96631150f1d75c250dd168f5c26a2220"},"schema_version":"1.0","source":{"id":"2605.14175","kind":"arxiv","version":1}},"canonical_sha256":"038454c54db15d0b1e62d859617ffc13883d789f8be2b9417efe96e2136eaba5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"038454c54db15d0b1e62d859617ffc13883d789f8be2b9417efe96e2136eaba5","first_computed_at":"2026-05-17T23:39:11.308891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:11.308891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NAZz0DE5AV6HLJ2dMsYjHZ2RvCRFbpU5dSTL3RnTUm66WM+eLZiu9z8jQqi2om1xgQITfMnQqL2cG+8Vs/HMCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:11.309629Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb34cbf12abd95acf4c210957981f819dc50beb4d9ec38dd6aee217ebd1460d0","sha256:67c69f24b7091bed571b4080000a3079479b5aa07d150cac3229c615b6e85778"],"state_sha256":"d2b4d0ca56acd401046aeb9025fbcf61710ec6e350a9855670b4f1567d0e186d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qQ0aaOdgu6QT/R46W7eSW8p9NbTKtCwkQ5EwCFQWjsKbgOIAQ4oE2hclUY37QjDLP0CKuYfV4uXjLhi91SW7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:38:32.019342Z","bundle_sha256":"d9b7f80f8703706527f165a01a01c223ce2221fb66f14839addd1b608f51f31b"}}