{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DGB6V6WGUHMEE7BORMFJHLC7RD","short_pith_number":"pith:DGB6V6WG","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"},"canonical_sha256":"1983eafac6a1d8427c2e8b0a93ac5f88c41c567b9e68e15c360c89e7a22d9f48","source":{"kind":"arxiv","id":"2605.14421","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14421","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14421v1","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14421","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"DGB6V6WGUHME","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"DGB6V6WGUHMEE7BO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"DGB6V6WG","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DGB6V6WGUHMEE7BORMFJHLC7RD","target":"record","payload":{"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"},"canonical_sha256":"1983eafac6a1d8427c2e8b0a93ac5f88c41c567b9e68e15c360c89e7a22d9f48","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"},"source_kind":"arxiv","source_id":"2605.14421","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:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2uUr1DeELJ/SFOi1fSjKvWjlzx+ctGIfNJYpib0l2APJUsAdDqfyLmC3FaM54ldtQxOss4VKEtvYiq1P90KRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:33:37.069711Z"},"content_sha256":"7650ca8e3f05297fd9ebfc5161b2dda7b9dd4ed08f059d1daaaa306423dccf6a","schema_version":"1.0","event_id":"sha256:7650ca8e3f05297fd9ebfc5161b2dda7b9dd4ed08f059d1daaaa306423dccf6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DGB6V6WGUHMEE7BORMFJHLC7RD","target":"graph","payload":{"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"},"verdict_id":"bb11cb12-9545-447d-acb4-271d22f042c3"},"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:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zp4h3xWTmrHYTEGF5ehJXWRWb5z6RY2erFev3oryxxO2nBxhdfHCo8eWvr/dF2dSHBFGPx+hIslpvePKbsFCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:33:37.070712Z"},"content_sha256":"a7fd899ba8d9e408dbc9a49a80983fe1de100787cf9c7d423ab2b825be8598b2","schema_version":"1.0","event_id":"sha256:a7fd899ba8d9e408dbc9a49a80983fe1de100787cf9c7d423ab2b825be8598b2"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:DGB6V6WGUHMEE7BORMFJHLC7RD","target":"integrity","payload":{"note":"Identifier '10.5555/3361338.3361435' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Santiago Torres-Arias, Hammad Afzali, Tris- hank Karthik Kuppusamy, Reza Curtmola, and Justin Cappos. in-toto: Providing farm-to-table guaran- tees for bits and bytes. In28th USENIX Security Symposium (USENIX Security 19), pages 1393–1410. ","arxiv_id":"2605.14421","detector":"doi_compliance","evidence":{"doi":"10.5555/3361338.3361435","arxiv_id":null,"ref_index":20,"raw_excerpt":"Santiago Torres-Arias, Hammad Afzali, Tris- hank Karthik Kuppusamy, Reza Curtmola, and Justin Cappos. in-toto: Providing farm-to-table guaran- tees for bits and bytes. In28th USENIX Security Symposium (USENIX Security 19), pages 1393–1410. USENIX Association, 2019. Verified via USENIX page; ACM DL DOI 10.5555/3361338.3361435. Page numbers are conservative (USENIX 2019 proceedings range)","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":20,"audited_at":"2026-05-19T05:37:14.664121Z","event_type":"pith.integrity.v1","detected_doi":"10.5555/3361338.3361435","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"a0e174616fc5e9a6bd1858c57a8193352b7886a1c046aac7fe3c62d69ba8e0c3","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":33,"payload_sha256":"b2fb0221f2461244841ff423613c90b24eb395e2ba04459b4bc36cf7d82730e8","signature_b64":"5TKpLqmSebyn86fJyFLehSdwsJ05g/TTVyhOQkEjYfIJNfruNaENCWT7c3saH3OM+WOOxAxj0u6rjcUp+vuKCg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T05:41:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+0C2XbjXIJMLs619V0BjMpy+i/Y/gW+mIHH9DocKe9oBC15UngPitmVcVMb0A/E9CnCoBVpWHzinCxIdl1tDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:33:37.072421Z"},"content_sha256":"b36fe32237d9ca84e620321f774e2f40509a5f6ff8dc528a7f83c532c72baffa","schema_version":"1.0","event_id":"sha256:b36fe32237d9ca84e620321f774e2f40509a5f6ff8dc528a7f83c532c72baffa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DGB6V6WGUHMEE7BORMFJHLC7RD/bundle.json","state_url":"https://pith.science/pith/DGB6V6WGUHMEE7BORMFJHLC7RD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DGB6V6WGUHMEE7BORMFJHLC7RD/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-05-22T15:33:37Z","links":{"resolver":"https://pith.science/pith/DGB6V6WGUHMEE7BORMFJHLC7RD","bundle":"https://pith.science/pith/DGB6V6WGUHMEE7BORMFJHLC7RD/bundle.json","state":"https://pith.science/pith/DGB6V6WGUHMEE7BORMFJHLC7RD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DGB6V6WGUHMEE7BORMFJHLC7RD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DGB6V6WGUHMEE7BORMFJHLC7RD","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9f1abe1c73cf4768664ab401964f8df2d0771eed2e33a5dde2583b6ffda0c7ff","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-14T06:07:54Z","title_canon_sha256":"15306b4c326d885ef26a00ac830272d9ef9a1c8653a8bc235c9ebc8badf2f445"},"schema_version":"1.0","source":{"id":"2605.14421","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14421","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14421v1","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14421","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"DGB6V6WGUHME","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"DGB6V6WGUHMEE7BO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"DGB6V6WG","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:a7fd899ba8d9e408dbc9a49a80983fe1de100787cf9c7d423ab2b825be8598b2","target":"graph","created_at":"2026-05-17T23:39:07Z","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":"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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"By tracking derivation lineage in agent memory, MemLineage prevents poisoned entries from justifying sensitive actions while preserving useful recall."}],"snapshot_sha256":"decad05529b50f232af0cd2fec79b00fed7020d7e7f5cc4334e7a687a8c87be1"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ciyan Ouyang, Rui Hou","cross_cats":["cs.AI"],"headline":"By tracking derivation lineage in agent memory, MemLineage prevents poisoned entries from justifying sensitive actions while preserving useful recall.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-14T06:07:54Z","title":"MemLineage: Lineage-Guided Enforcement for LLM Agent Memory"},"references":{"count":20,"internal_anchors":6,"resolved_work":20,"sample":[{"cited_arxiv_id":"","doi":"10.1007/s13389-","is_internal_anchor":false,"ref_index":1,"title":"Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, and Bo-Yin Yang","work_id":"e809c0cd-0970-4e40-b811-25d8a5c611cb","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"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","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Verified via IETF datatracker","work_id":"7db9ca18-7a88-4d20-a89c-f3c333da7930","year":null},{"cited_arxiv_id":"2604.23374","doi":"","is_internal_anchor":true,"ref_index":5,"title":"Ghost in the Agent: Redefining Information Flow Tracking for LLM Agents","work_id":"8010c538-559e-41c9-940f-4c2d0ca50745","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":6,"title":"Agentpoison: Red-teaming llm agents via poisoning memory or knowledge bases","work_id":"fd576f32-99d7-40a6-866a-ad86ad47565d","year":2024}],"snapshot_sha256":"f43824361a36b58213c109f2f9d3a09d2877d6a97447518abb5a68d8cab512e5"},"source":{"id":"2605.14421","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:15:45.125607Z","id":"bb11cb12-9545-447d-acb4-271d22f042c3","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"By tracking derivation lineage in agent memory, MemLineage prevents poisoned entries from justifying sensitive actions while preserving useful recall.","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.","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."}},"verdict_id":"bb11cb12-9545-447d-acb4-271d22f042c3"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7650ca8e3f05297fd9ebfc5161b2dda7b9dd4ed08f059d1daaaa306423dccf6a","target":"record","created_at":"2026-05-17T23:39:07Z","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":"9f1abe1c73cf4768664ab401964f8df2d0771eed2e33a5dde2583b6ffda0c7ff","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-14T06:07:54Z","title_canon_sha256":"15306b4c326d885ef26a00ac830272d9ef9a1c8653a8bc235c9ebc8badf2f445"},"schema_version":"1.0","source":{"id":"2605.14421","kind":"arxiv","version":1}},"canonical_sha256":"1983eafac6a1d8427c2e8b0a93ac5f88c41c567b9e68e15c360c89e7a22d9f48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1983eafac6a1d8427c2e8b0a93ac5f88c41c567b9e68e15c360c89e7a22d9f48","first_computed_at":"2026-05-17T23:39:07.248373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:07.248373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tWyaHg9st+7dJfznNixBxSkCFSESpuRN9iQuMr7SOKFYyE1aGTx+NMutLPtJORnqmSrjaJepl+ehdSrrumivDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:07.249091Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14421","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7650ca8e3f05297fd9ebfc5161b2dda7b9dd4ed08f059d1daaaa306423dccf6a","sha256:a7fd899ba8d9e408dbc9a49a80983fe1de100787cf9c7d423ab2b825be8598b2","sha256:b36fe32237d9ca84e620321f774e2f40509a5f6ff8dc528a7f83c532c72baffa"],"state_sha256":"dae0b3f3eea0f3d0f6f83757c9f003f2646a5192d769485e6594fb95c0250502"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWeMA+EFtQ0FiN9EymYdTldny7ODv7KZPTDzvKLqrRpmmYxEzknF+ZfuwQFcREgdi5wVoN/jYrtKgW7McWY9BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T15:33:37.076924Z","bundle_sha256":"6b28f810a4d3a1491ccd721365627b9509d532bec5b9122ffa113ebf0c538717"}}