{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CAC5GPPSU3MDSN6DOIJTUUVON7","short_pith_number":"pith:CAC5GPPS","canonical_record":{"source":{"id":"2605.15384","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T20:15:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"364097b5cce5aabdeb141acedf8cdf72d41fcb661b32bd48920619558314aa32","abstract_canon_sha256":"ca2ba03628ac9b5e5f095729398e5284937376cd7c2a8debc3d6f741e0e63d53"},"schema_version":"1.0"},"canonical_sha256":"1005d33df2a6d83937c372133a52ae6fc77e4874a292e064294ab8cb955bc55c","source":{"kind":"arxiv","id":"2605.15384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15384","created_at":"2026-05-20T00:00:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15384v1","created_at":"2026-05-20T00:00:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15384","created_at":"2026-05-20T00:00:55Z"},{"alias_kind":"pith_short_12","alias_value":"CAC5GPPSU3MD","created_at":"2026-05-20T00:00:55Z"},{"alias_kind":"pith_short_16","alias_value":"CAC5GPPSU3MDSN6D","created_at":"2026-05-20T00:00:55Z"},{"alias_kind":"pith_short_8","alias_value":"CAC5GPPS","created_at":"2026-05-20T00:00:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CAC5GPPSU3MDSN6DOIJTUUVON7","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15384","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T20:15:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"364097b5cce5aabdeb141acedf8cdf72d41fcb661b32bd48920619558314aa32","abstract_canon_sha256":"ca2ba03628ac9b5e5f095729398e5284937376cd7c2a8debc3d6f741e0e63d53"},"schema_version":"1.0"},"canonical_sha256":"1005d33df2a6d83937c372133a52ae6fc77e4874a292e064294ab8cb955bc55c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:55.693469Z","signature_b64":"g0L5aEGrHyFLktpDbXdlFJyDXV4Hxws62XwnL+2AUmBp0R/8CfijuOW7qKpzYS/HfF+Uf9uLzEUr52tFqgWTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1005d33df2a6d83937c372133a52ae6fc77e4874a292e064294ab8cb955bc55c","last_reissued_at":"2026-05-20T00:00:55.692719Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:55.692719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15384","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-20T00:00:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iIzSQfWGqZTxXi9FLbst5ETe2UZ5j96zvxZMS9b98hsXN6J/RxmjBIh6M8gwm9HzY6MS6YCc0P3Ziy48Qw4XDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T22:37:24.219971Z"},"content_sha256":"ae700e2945f86ea063f336cadcc887db37a16f5b3ae8a919672fbd7e64666c3e","schema_version":"1.0","event_id":"sha256:ae700e2945f86ea063f336cadcc887db37a16f5b3ae8a919672fbd7e64666c3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CAC5GPPSU3MDSN6DOIJTUUVON7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Is One Score Enough? Rethinking the Evaluation of Sequentially Evolving LLM Memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Aggregate accuracy scores can mask forgetting and negative transfer in sequentially evolving LLM memory.","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chengshuai Shi, Cong Shen, Jundong Li, Peng Wang, Songwei Dong, Zihan Chen","submitted_at":"2026-05-14T20:15:22Z","abstract_excerpt":"Memory plays a central role in enabling large language models (LLMs) to operate over sequential tasks by accumulating and reusing experience over time. However, existing evaluations of LLM memory mostly rely on aggregate metrics such as final hold-out accuracy or cumulative online performance, which can obscure critical failure modes such as forgetting and negative transfer. In this paper, we introduce SeqMem-Eval, a diagnostic evaluation framework for sequentially evolving LLM memory. Drawing inspiration from continual learning, it targets a test-time setting in which memory is external, prom"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"higher final or cumulative accuracy does not necessarily imply better memory quality: many methods exhibit strong performance gains while suffering from substantial forgetting or negative transfer.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The four proposed metrics (online utility, hold-out generalization, backward transfer, and forgetting) provide a meaningfully finer-grained and more informative assessment of memory quality than aggregate metrics in the external prompt-mediated test-time setting.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"SeqMem-Eval reveals that high final accuracy in sequential LLM memory tasks often coexists with substantial forgetting and negative transfer, exposing stability-adaptability trade-offs hidden by standard aggregate metrics.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Aggregate accuracy scores can mask forgetting and negative transfer in sequentially evolving LLM memory.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"04af2676b5bffa0ba59845b62aaf730543f33b288e766c52cb96216bc69af6ac"},"source":{"id":"2605.15384","kind":"arxiv","version":1},"verdict":{"id":"2a6681cb-5a51-4259-b8c5-7c8436c8e9b3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T16:39:48.739830Z","strongest_claim":"higher final or cumulative accuracy does not necessarily imply better memory quality: many methods exhibit strong performance gains while suffering from substantial forgetting or negative transfer.","one_line_summary":"SeqMem-Eval reveals that high final accuracy in sequential LLM memory tasks often coexists with substantial forgetting and negative transfer, exposing stability-adaptability trade-offs hidden by standard aggregate metrics.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The four proposed metrics (online utility, hold-out generalization, backward transfer, and forgetting) provide a meaningfully finer-grained and more informative assessment of memory quality than aggregate metrics in the external prompt-mediated test-time setting.","pith_extraction_headline":"Aggregate accuracy scores can mask forgetting and negative transfer in sequentially evolving LLM memory."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15384/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T17:01:18.288646Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T16:45:40.436550Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T15:51:00.512539Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.175675Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.727689Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"1bbdcb08d6289bec2b71e15b73013ce6e376fb9a6daeda3ed4a33fedca339dc5"},"references":{"count":53,"sample":[{"doi":"","year":2025,"title":"GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning","work_id":"40b60d06-dc1c-4799-b75d-ff1eca653049","ref_index":1,"cited_arxiv_id":"2507.19457","is_internal_anchor":true},{"doi":"","year":2020,"title":"M. Biesialska, K. Biesialska, and M. R. Costa-Jussa. Continual lifelong learning in natu- ral language processing: A survey. InProceedings of the 28th international conference on computational linguis","work_id":"84f5508d-68f2-4f0a-b8f5-029fe6dfce2f","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Efficient lifelong learning with A-GEM.CoRR, abs/1812.00420","work_id":"c1e3aa81-39b5-44a3-a1b5-6fa343e0b956","ref_index":3,"cited_arxiv_id":"1812.00420","is_internal_anchor":true},{"doi":"","year":1902,"title":"Chaudhry et al","work_id":"001da84d-4329-4699-85e9-5431d143af9b","ref_index":4,"cited_arxiv_id":"1902.10486","is_internal_anchor":true},{"doi":"","year":2021,"title":"M. Chen, J. Tworek, H. Jun, Q. Yuan, H. P. de Oliveira Pinto, J. Kaplan, H. Edwards, Y . Burda, N. Joseph, G. Brockman, A. Ray, R. Puri, G. Krueger, M. Petrov, H. Khlaaf, G. Sastry, P. Mishkin, B. Cha","work_id":"b9c15c1f-2877-495d-87c9-02edb64e7362","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":53,"snapshot_sha256":"4227aa16369cbd989a19f7bead8918e118a50298b53070efc2cc8e7fe88913ff","internal_anchors":15},"formal_canon":{"evidence_count":2,"snapshot_sha256":"e3f4621bfcb7d57483ccd653c002bd6ca37d393ca3e187b7254a3985dfab1a61"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"2a6681cb-5a51-4259-b8c5-7c8436c8e9b3"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cS0zWJFj1xq8QTt5re3KVFBx180mE56n74DdgA7eMJygno65GVw5bfHE6Ndbj3L+mwtPsJBMX9w5RFDSJot8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T22:37:24.221277Z"},"content_sha256":"e1fe1db65f00c633143bf7adc715621299dbbdb3105d91337fc409e5e6df780f","schema_version":"1.0","event_id":"sha256:e1fe1db65f00c633143bf7adc715621299dbbdb3105d91337fc409e5e6df780f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CAC5GPPSU3MDSN6DOIJTUUVON7/bundle.json","state_url":"https://pith.science/pith/CAC5GPPSU3MDSN6DOIJTUUVON7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CAC5GPPSU3MDSN6DOIJTUUVON7/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-20T22:37:24Z","links":{"resolver":"https://pith.science/pith/CAC5GPPSU3MDSN6DOIJTUUVON7","bundle":"https://pith.science/pith/CAC5GPPSU3MDSN6DOIJTUUVON7/bundle.json","state":"https://pith.science/pith/CAC5GPPSU3MDSN6DOIJTUUVON7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CAC5GPPSU3MDSN6DOIJTUUVON7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CAC5GPPSU3MDSN6DOIJTUUVON7","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":"ca2ba03628ac9b5e5f095729398e5284937376cd7c2a8debc3d6f741e0e63d53","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T20:15:22Z","title_canon_sha256":"364097b5cce5aabdeb141acedf8cdf72d41fcb661b32bd48920619558314aa32"},"schema_version":"1.0","source":{"id":"2605.15384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15384","created_at":"2026-05-20T00:00:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15384v1","created_at":"2026-05-20T00:00:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15384","created_at":"2026-05-20T00:00:55Z"},{"alias_kind":"pith_short_12","alias_value":"CAC5GPPSU3MD","created_at":"2026-05-20T00:00:55Z"},{"alias_kind":"pith_short_16","alias_value":"CAC5GPPSU3MDSN6D","created_at":"2026-05-20T00:00:55Z"},{"alias_kind":"pith_short_8","alias_value":"CAC5GPPS","created_at":"2026-05-20T00:00:55Z"}],"graph_snapshots":[{"event_id":"sha256:e1fe1db65f00c633143bf7adc715621299dbbdb3105d91337fc409e5e6df780f","target":"graph","created_at":"2026-05-20T00:00:55Z","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":"higher final or cumulative accuracy does not necessarily imply better memory quality: many methods exhibit strong performance gains while suffering from substantial forgetting or negative transfer."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The four proposed metrics (online utility, hold-out generalization, backward transfer, and forgetting) provide a meaningfully finer-grained and more informative assessment of memory quality than aggregate metrics in the external prompt-mediated test-time setting."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"SeqMem-Eval reveals that high final accuracy in sequential LLM memory tasks often coexists with substantial forgetting and negative transfer, exposing stability-adaptability trade-offs hidden by standard aggregate metrics."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Aggregate accuracy scores can mask forgetting and negative transfer in sequentially evolving LLM memory."}],"snapshot_sha256":"04af2676b5bffa0ba59845b62aaf730543f33b288e766c52cb96216bc69af6ac"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"e3f4621bfcb7d57483ccd653c002bd6ca37d393ca3e187b7254a3985dfab1a61"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T17:01:18.288646Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T16:45:40.436550Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T15:51:00.512539Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.175675Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.727689Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15384/integrity.json","findings":[],"snapshot_sha256":"1bbdcb08d6289bec2b71e15b73013ce6e376fb9a6daeda3ed4a33fedca339dc5","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Memory plays a central role in enabling large language models (LLMs) to operate over sequential tasks by accumulating and reusing experience over time. However, existing evaluations of LLM memory mostly rely on aggregate metrics such as final hold-out accuracy or cumulative online performance, which can obscure critical failure modes such as forgetting and negative transfer. In this paper, we introduce SeqMem-Eval, a diagnostic evaluation framework for sequentially evolving LLM memory. Drawing inspiration from continual learning, it targets a test-time setting in which memory is external, prom","authors_text":"Chengshuai Shi, Cong Shen, Jundong Li, Peng Wang, Songwei Dong, Zihan Chen","cross_cats":["cs.AI"],"headline":"Aggregate accuracy scores can mask forgetting and negative transfer in sequentially evolving LLM memory.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T20:15:22Z","title":"Is One Score Enough? Rethinking the Evaluation of Sequentially Evolving LLM Memory"},"references":{"count":53,"internal_anchors":15,"resolved_work":53,"sample":[{"cited_arxiv_id":"2507.19457","doi":"","is_internal_anchor":true,"ref_index":1,"title":"GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning","work_id":"40b60d06-dc1c-4799-b75d-ff1eca653049","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"M. Biesialska, K. Biesialska, and M. R. Costa-Jussa. Continual lifelong learning in natu- ral language processing: A survey. InProceedings of the 28th international conference on computational linguis","work_id":"84f5508d-68f2-4f0a-b8f5-029fe6dfce2f","year":2020},{"cited_arxiv_id":"1812.00420","doi":"","is_internal_anchor":true,"ref_index":3,"title":"Efficient lifelong learning with A-GEM.CoRR, abs/1812.00420","work_id":"c1e3aa81-39b5-44a3-a1b5-6fa343e0b956","year":2018},{"cited_arxiv_id":"1902.10486","doi":"","is_internal_anchor":true,"ref_index":4,"title":"Chaudhry et al","work_id":"001da84d-4329-4699-85e9-5431d143af9b","year":1902},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"M. Chen, J. Tworek, H. Jun, Q. Yuan, H. P. de Oliveira Pinto, J. Kaplan, H. Edwards, Y . Burda, N. Joseph, G. Brockman, A. Ray, R. Puri, G. Krueger, M. Petrov, H. Khlaaf, G. Sastry, P. Mishkin, B. Cha","work_id":"b9c15c1f-2877-495d-87c9-02edb64e7362","year":2021}],"snapshot_sha256":"4227aa16369cbd989a19f7bead8918e118a50298b53070efc2cc8e7fe88913ff"},"source":{"id":"2605.15384","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T16:39:48.739830Z","id":"2a6681cb-5a51-4259-b8c5-7c8436c8e9b3","model_set":{"reader":"grok-4.3"},"one_line_summary":"SeqMem-Eval reveals that high final accuracy in sequential LLM memory tasks often coexists with substantial forgetting and negative transfer, exposing stability-adaptability trade-offs hidden by standard aggregate metrics.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Aggregate accuracy scores can mask forgetting and negative transfer in sequentially evolving LLM memory.","strongest_claim":"higher final or cumulative accuracy does not necessarily imply better memory quality: many methods exhibit strong performance gains while suffering from substantial forgetting or negative transfer.","weakest_assumption":"The four proposed metrics (online utility, hold-out generalization, backward transfer, and forgetting) provide a meaningfully finer-grained and more informative assessment of memory quality than aggregate metrics in the external prompt-mediated test-time setting."}},"verdict_id":"2a6681cb-5a51-4259-b8c5-7c8436c8e9b3"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ae700e2945f86ea063f336cadcc887db37a16f5b3ae8a919672fbd7e64666c3e","target":"record","created_at":"2026-05-20T00:00:55Z","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":"ca2ba03628ac9b5e5f095729398e5284937376cd7c2a8debc3d6f741e0e63d53","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T20:15:22Z","title_canon_sha256":"364097b5cce5aabdeb141acedf8cdf72d41fcb661b32bd48920619558314aa32"},"schema_version":"1.0","source":{"id":"2605.15384","kind":"arxiv","version":1}},"canonical_sha256":"1005d33df2a6d83937c372133a52ae6fc77e4874a292e064294ab8cb955bc55c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1005d33df2a6d83937c372133a52ae6fc77e4874a292e064294ab8cb955bc55c","first_computed_at":"2026-05-20T00:00:55.692719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:55.692719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g0L5aEGrHyFLktpDbXdlFJyDXV4Hxws62XwnL+2AUmBp0R/8CfijuOW7qKpzYS/HfF+Uf9uLzEUr52tFqgWTDQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:55.693469Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae700e2945f86ea063f336cadcc887db37a16f5b3ae8a919672fbd7e64666c3e","sha256:e1fe1db65f00c633143bf7adc715621299dbbdb3105d91337fc409e5e6df780f"],"state_sha256":"4804159c132b8fcc33c9bc86a6134f6c37f8bf0a34263e2257dae67a3fded707"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/bi2zgBu2nbDPT5PTqXVXeGoDyZ05Sok1+A88g9AJw3QaAgSu0Fzcf7g3zmWqywqODSIIEsNQ0I0mnwdsAxcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T22:37:24.226764Z","bundle_sha256":"c5067b34ddc364020a098c688e068d04060f14b53764249a7f7dc576c4d4cc89"}}