{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DGB6V6WGUHMEE7BORMFJHLC7RD","short_pith_number":"pith:DGB6V6WG","schema_version":"1.0","canonical_sha256":"1983eafac6a1d8427c2e8b0a93ac5f88c41c567b9e68e15c360c89e7a22d9f48","source":{"kind":"arxiv","id":"2605.14421","version":1},"attestation_state":"computed","paper":{"title":"MemLineage: Lineage-Guided Enforcement for LLM Agent Memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"By tracking derivation lineage in agent memory, MemLineage prevents poisoned entries from justifying sensitive actions while preserving useful recall.","cross_cats":["cs.AI"],"primary_cat":"cs.CR","authors_text":"Ciyan Ouyang, Rui Hou","submitted_at":"2026-05-14T06:07:54Z","abstract_excerpt":"We introduce MemLineage, a defense for LLM agent memory that attaches both cryptographic provenance and LLM-mediated derivation lineage to every entry. Recent and concurrent work shows that untrusted content can be written into persistent agent state and re-enter later sessions as an instruction; the remaining systems question is how to preserve useful memory recall while preventing such state from justifying sensitive actions. MemLineage treats this as a chain-of-custody problem rather than a filtering problem. It is a six-module design around an RFC-6962 Merkle log over per-principal Ed25519"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.14421","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-14T06:07:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"15306b4c326d885ef26a00ac830272d9ef9a1c8653a8bc235c9ebc8badf2f445","abstract_canon_sha256":"9f1abe1c73cf4768664ab401964f8df2d0771eed2e33a5dde2583b6ffda0c7ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:07.249091Z","signature_b64":"tWyaHg9st+7dJfznNixBxSkCFSESpuRN9iQuMr7SOKFYyE1aGTx+NMutLPtJORnqmSrjaJepl+ehdSrrumivDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1983eafac6a1d8427c2e8b0a93ac5f88c41c567b9e68e15c360c89e7a22d9f48","last_reissued_at":"2026-05-17T23:39:07.248373Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:07.248373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MemLineage: Lineage-Guided Enforcement for LLM Agent Memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"By tracking derivation lineage in agent memory, MemLineage prevents poisoned entries from justifying sensitive actions while preserving useful recall.","cross_cats":["cs.AI"],"primary_cat":"cs.CR","authors_text":"Ciyan Ouyang, Rui Hou","submitted_at":"2026-05-14T06:07:54Z","abstract_excerpt":"We introduce MemLineage, a defense for LLM agent memory that attaches both cryptographic provenance and LLM-mediated derivation lineage to every entry. Recent and concurrent work shows that untrusted content can be written into persistent agent state and re-enter later sessions as an instruction; the remaining systems question is how to preserve useful memory recall while preventing such state from justifying sensitive actions. MemLineage treats this as a chain-of-custody problem rather than a filtering problem. It is a six-module design around an RFC-6962 Merkle log over per-principal Ed25519"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"MemLineage is the only configuration in that harness that drives all three columns to zero ASR, while sub-millisecond per-operation overhead keeps it well below the noise floor of any LLM call.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the LLM-mediated derivation lineage accurately identifies which prior entries influenced each new memory and that the max-of-strong-edges propagation rule correctly captures all paths that could justify sensitive actions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"MemLineage enforces untrusted-path persistence in LLM agent memory through Merkle logs, per-principal signatures, and max-of-strong-edges lineage propagation, achieving zero ASR on three poisoning workloads with sub-millisecond overhead.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"By tracking derivation lineage in agent memory, MemLineage prevents poisoned entries from justifying sensitive actions while preserving useful recall.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"decad05529b50f232af0cd2fec79b00fed7020d7e7f5cc4334e7a687a8c87be1"},"source":{"id":"2605.14421","kind":"arxiv","version":1},"verdict":{"id":"bb11cb12-9545-447d-acb4-271d22f042c3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:15:45.125607Z","strongest_claim":"MemLineage is the only configuration in that harness that drives all three columns to zero ASR, while sub-millisecond per-operation overhead keeps it well below the noise floor of any LLM call.","one_line_summary":"MemLineage enforces untrusted-path persistence in LLM agent memory through Merkle logs, per-principal signatures, and max-of-strong-edges lineage propagation, achieving zero ASR on three poisoning workloads with sub-millisecond overhead.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the LLM-mediated derivation lineage accurately identifies which prior entries influenced each new memory and that the max-of-strong-edges propagation rule correctly captures all paths that could justify sensitive actions.","pith_extraction_headline":"By tracking derivation lineage in agent memory, MemLineage prevents poisoned entries from justifying sensitive actions while preserving useful recall."},"references":{"count":20,"sample":[{"doi":"10.1007/s13389-","year":2012,"title":"Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, and Bo-Yin Yang","work_id":"e809c0cd-0970-4e40-b811-25d8a5c611cb","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Carsten Bormann and Paul E. Hoffman. Concise binary object representation (CBOR). RFC 8949, Internet Engineering Task Force (IETF), December","work_id":"946b0a60-0415-4f2c-a43e-0e8b573a2abf","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Verified via IETF datatracker","work_id":"7db9ca18-7a88-4d20-a89c-f3c333da7930","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Ghost in the Agent: Redefining Information Flow Tracking for LLM Agents","work_id":"8010c538-559e-41c9-940f-4c2d0ca50745","ref_index":5,"cited_arxiv_id":"2604.23374","is_internal_anchor":true},{"doi":"","year":2024,"title":"Agentpoison: Red-teaming llm agents via poisoning memory or knowledge bases","work_id":"fd576f32-99d7-40a6-866a-ad86ad47565d","ref_index":6,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":20,"snapshot_sha256":"f43824361a36b58213c109f2f9d3a09d2877d6a97447518abb5a68d8cab512e5","internal_anchors":6},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.14421","created_at":"2026-05-17T23:39:07.248501+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14421v1","created_at":"2026-05-17T23:39:07.248501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14421","created_at":"2026-05-17T23:39:07.248501+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGB6V6WGUHME","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGB6V6WGUHMEE7BO","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGB6V6WG","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DGB6V6WGUHMEE7BORMFJHLC7RD","json":"https://pith.science/pith/DGB6V6WGUHMEE7BORMFJHLC7RD.json","graph_json":"https://pith.science/api/pith-number/DGB6V6WGUHMEE7BORMFJHLC7RD/graph.json","events_json":"https://pith.science/api/pith-number/DGB6V6WGUHMEE7BORMFJHLC7RD/events.json","paper":"https://pith.science/paper/DGB6V6WG"},"agent_actions":{"view_html":"https://pith.science/pith/DGB6V6WGUHMEE7BORMFJHLC7RD","download_json":"https://pith.science/pith/DGB6V6WGUHMEE7BORMFJHLC7RD.json","view_paper":"https://pith.science/paper/DGB6V6WG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14421&json=true","fetch_graph":"https://pith.science/api/pith-number/DGB6V6WGUHMEE7BORMFJHLC7RD/graph.json","fetch_events":"https://pith.science/api/pith-number/DGB6V6WGUHMEE7BORMFJHLC7RD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGB6V6WGUHMEE7BORMFJHLC7RD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGB6V6WGUHMEE7BORMFJHLC7RD/action/storage_attestation","attest_author":"https://pith.science/pith/DGB6V6WGUHMEE7BORMFJHLC7RD/action/author_attestation","sign_citation":"https://pith.science/pith/DGB6V6WGUHMEE7BORMFJHLC7RD/action/citation_signature","submit_replication":"https://pith.science/pith/DGB6V6WGUHMEE7BORMFJHLC7RD/action/replication_record"}},"created_at":"2026-05-17T23:39:07.248501+00:00","updated_at":"2026-05-17T23:39:07.248501+00:00"}