{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:EM2A7KL7DVBG3VHQBSRAVTUMG5","short_pith_number":"pith:EM2A7KL7","canonical_record":{"source":{"id":"2310.01801","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-03T05:17:08Z","cross_cats_sorted":[],"title_canon_sha256":"67dcb3a627ccfd1e7e1ed9f026f773a287848ff13092ed123185a24c13fd96f3","abstract_canon_sha256":"0e193d84667f6bfe1d3dd00a5dcff1a21a7121bcb148bb9dae7ceb420b7365e4"},"schema_version":"1.0"},"canonical_sha256":"23340fa97f1d426dd4f00ca20ace8c37532352596ea1ea91a591c8ed76947c51","source":{"kind":"arxiv","id":"2310.01801","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.01801","created_at":"2026-05-17T23:38:14Z"},{"alias_kind":"arxiv_version","alias_value":"2310.01801v4","created_at":"2026-05-17T23:38:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01801","created_at":"2026-05-17T23:38:14Z"},{"alias_kind":"pith_short_12","alias_value":"EM2A7KL7DVBG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"EM2A7KL7DVBG3VHQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"EM2A7KL7","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:EM2A7KL7DVBG3VHQBSRAVTUMG5","target":"record","payload":{"canonical_record":{"source":{"id":"2310.01801","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-03T05:17:08Z","cross_cats_sorted":[],"title_canon_sha256":"67dcb3a627ccfd1e7e1ed9f026f773a287848ff13092ed123185a24c13fd96f3","abstract_canon_sha256":"0e193d84667f6bfe1d3dd00a5dcff1a21a7121bcb148bb9dae7ceb420b7365e4"},"schema_version":"1.0"},"canonical_sha256":"23340fa97f1d426dd4f00ca20ace8c37532352596ea1ea91a591c8ed76947c51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:14.272943Z","signature_b64":"1bxxoaXwe1Mwqf+CPlzVeM2HKq3bowiy42jP8jddzjH1XhDjcpDRbRoOw2kepLZfcSa+df6SbReEnb1IsrQMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23340fa97f1d426dd4f00ca20ace8c37532352596ea1ea91a591c8ed76947c51","last_reissued_at":"2026-05-17T23:38:14.272361Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:14.272361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.01801","source_version":4,"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:38:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wVubrXJSD99KPEECEUkDPIOx0N5wBstuinQCvFpPap5DOBJ6GH2tbbOgUyLpRb1QhJv/bMxUh/NcoGcQaySEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:51:40.216590Z"},"content_sha256":"4bf9a9bf7c856987ed913906a0aa4f495f4e8848152dc749c24519d4f4829c41","schema_version":"1.0","event_id":"sha256:4bf9a9bf7c856987ed913906a0aa4f495f4e8848152dc749c24519d4f4829c41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:EM2A7KL7DVBG3VHQBSRAVTUMG5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"LLMs can cut KV cache memory by profiling attention heads once and evicting tokens selectively per head type.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jianfeng Gao, Jiawei Han, Liyuan Liu, Minjia Zhang, Suyu Ge, Yunan Zhang","submitted_at":"2023-10-03T05:17:08Z","abstract_excerpt":"In this study, we introduce adaptive KV cache compression, a plug-and-play method that reduces the memory footprint of generative inference for Large Language Models (LLMs). Different from the conventional KV cache that retains key and value vectors for all context tokens, we conduct targeted profiling to discern the intrinsic structure of attention modules. Based on the recognized structure, we then construct the KV cache in an adaptive manner: evicting long-range contexts on attention heads emphasizing local contexts, discarding non-special tokens on attention heads centered on special token"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we conduct targeted profiling to discern the intrinsic structure of attention modules. Based on the recognized structure, we then construct the KV cache in an adaptive manner: evicting long-range contexts on attention heads emphasizing local contexts, discarding non-special tokens on attention heads centered on special tokens, and only employing the standard KV cache for attention heads that broadly attend to all tokens. Moreover, with the lightweight attention profiling used to guide the construction of the adaptive KV cache, FastGen can be deployed without resource-intensive fine-tuning or re-training. In our experiments across various tasks, FastGen demonstrates substantial reduction on GPU memory consumption with negligible generation quality loss.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the attention-head structures identified by a single lightweight profiling pass remain stable and sufficient to guide token eviction across diverse generation tasks and contexts without materially degrading output quality or requiring any model updates.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"FastGen adaptively compresses LLM KV caches via lightweight attention profiling: evicting long-range contexts on local heads, non-special tokens on special-token heads, and retaining full caches on broad-attention heads, yielding substantial memory savings with negligible quality loss.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"LLMs can cut KV cache memory by profiling attention heads once and evicting tokens selectively per head type.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"6ae7930f67e9daa039255d1e86d06154a593ea28dd20a97521548c155b260ab8"},"source":{"id":"2310.01801","kind":"arxiv","version":4},"verdict":{"id":"354e0abe-3f5d-4c5a-9813-4e1b8d71d6e4","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-17T11:06:14.885468Z","strongest_claim":"we conduct targeted profiling to discern the intrinsic structure of attention modules. Based on the recognized structure, we then construct the KV cache in an adaptive manner: evicting long-range contexts on attention heads emphasizing local contexts, discarding non-special tokens on attention heads centered on special tokens, and only employing the standard KV cache for attention heads that broadly attend to all tokens. Moreover, with the lightweight attention profiling used to guide the construction of the adaptive KV cache, FastGen can be deployed without resource-intensive fine-tuning or re-training. In our experiments across various tasks, FastGen demonstrates substantial reduction on GPU memory consumption with negligible generation quality loss.","one_line_summary":"FastGen adaptively compresses LLM KV caches via lightweight attention profiling: evicting long-range contexts on local heads, non-special tokens on special-token heads, and retaining full caches on broad-attention heads, yielding substantial memory savings with negligible quality loss.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the attention-head structures identified by a single lightweight profiling pass remain stable and sufficient to guide token eviction across diverse generation tasks and contexts without materially degrading output quality or requiring any model updates.","pith_extraction_headline":"LLMs can cut KV cache memory by profiling attention heads once and evicting tokens selectively per head type."},"references":{"count":85,"sample":[{"doi":"","year":2017,"title":"2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , year=","work_id":"b4b7109a-a8e3-49f5-8c2a-d4245838468b","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"2019 , journal =","work_id":"41c879fa-f0bb-4f50-b5be-c2b0d1b21ffa","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Tom B. Brown and Benjamin Mann and Nick Ryder and Melanie Subbiah and Jared Kaplan and Prafulla Dhariwal and Arvind Neelakantan and Pranav Shyam and Girish Sastry and Amanda Askell and Sandhini Agarwa","work_id":"d2f65ea3-f1ff-4ac1-9647-f11876755e31","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"SC22: International Conference for High Performance Computing, Networking, Storage and Analysis , year=","work_id":"d8d392d0-72d7-4c83-b302-9d2e830cf8d8","ref_index":8,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"International Conference on Machine Learning , year=","work_id":"dad3ccf2-8849-4fbf-ab94-d710a8f18169","ref_index":9,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":85,"snapshot_sha256":"0ffa89237fb670f8bc441ecec5ef75412a025a175638a720026a498e4716b10f","internal_anchors":18},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b24d1e411a837688e7fe815d189cbc6c833d073526ad00ae35b19b3dba4d8236"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"354e0abe-3f5d-4c5a-9813-4e1b8d71d6e4"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5hk4T6ZQ8muvA9oZsC/tR7fMO0P+yonAG4L1BYUcqSDdz1hxxfVS1z08RAaa2tbzXe5m5B2y/fofgwkHJT5HDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:51:40.217347Z"},"content_sha256":"5ebfc9a6c065a60c0dca4d5e60e195ecf318eb34fe2bb1119b9e205ee2e2f077","schema_version":"1.0","event_id":"sha256:5ebfc9a6c065a60c0dca4d5e60e195ecf318eb34fe2bb1119b9e205ee2e2f077"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EM2A7KL7DVBG3VHQBSRAVTUMG5/bundle.json","state_url":"https://pith.science/pith/EM2A7KL7DVBG3VHQBSRAVTUMG5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EM2A7KL7DVBG3VHQBSRAVTUMG5/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-27T02:51:40Z","links":{"resolver":"https://pith.science/pith/EM2A7KL7DVBG3VHQBSRAVTUMG5","bundle":"https://pith.science/pith/EM2A7KL7DVBG3VHQBSRAVTUMG5/bundle.json","state":"https://pith.science/pith/EM2A7KL7DVBG3VHQBSRAVTUMG5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EM2A7KL7DVBG3VHQBSRAVTUMG5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:EM2A7KL7DVBG3VHQBSRAVTUMG5","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":"0e193d84667f6bfe1d3dd00a5dcff1a21a7121bcb148bb9dae7ceb420b7365e4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-03T05:17:08Z","title_canon_sha256":"67dcb3a627ccfd1e7e1ed9f026f773a287848ff13092ed123185a24c13fd96f3"},"schema_version":"1.0","source":{"id":"2310.01801","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.01801","created_at":"2026-05-17T23:38:14Z"},{"alias_kind":"arxiv_version","alias_value":"2310.01801v4","created_at":"2026-05-17T23:38:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01801","created_at":"2026-05-17T23:38:14Z"},{"alias_kind":"pith_short_12","alias_value":"EM2A7KL7DVBG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"EM2A7KL7DVBG3VHQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"EM2A7KL7","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:5ebfc9a6c065a60c0dca4d5e60e195ecf318eb34fe2bb1119b9e205ee2e2f077","target":"graph","created_at":"2026-05-17T23:38:14Z","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":"we conduct targeted profiling to discern the intrinsic structure of attention modules. Based on the recognized structure, we then construct the KV cache in an adaptive manner: evicting long-range contexts on attention heads emphasizing local contexts, discarding non-special tokens on attention heads centered on special tokens, and only employing the standard KV cache for attention heads that broadly attend to all tokens. Moreover, with the lightweight attention profiling used to guide the construction of the adaptive KV cache, FastGen can be deployed without resource-intensive fine-tuning or re-training. In our experiments across various tasks, FastGen demonstrates substantial reduction on GPU memory consumption with negligible generation quality loss."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the attention-head structures identified by a single lightweight profiling pass remain stable and sufficient to guide token eviction across diverse generation tasks and contexts without materially degrading output quality or requiring any model updates."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"FastGen adaptively compresses LLM KV caches via lightweight attention profiling: evicting long-range contexts on local heads, non-special tokens on special-token heads, and retaining full caches on broad-attention heads, yielding substantial memory savings with negligible quality loss."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"LLMs can cut KV cache memory by profiling attention heads once and evicting tokens selectively per head type."}],"snapshot_sha256":"6ae7930f67e9daa039255d1e86d06154a593ea28dd20a97521548c155b260ab8"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b24d1e411a837688e7fe815d189cbc6c833d073526ad00ae35b19b3dba4d8236"},"paper":{"abstract_excerpt":"In this study, we introduce adaptive KV cache compression, a plug-and-play method that reduces the memory footprint of generative inference for Large Language Models (LLMs). Different from the conventional KV cache that retains key and value vectors for all context tokens, we conduct targeted profiling to discern the intrinsic structure of attention modules. Based on the recognized structure, we then construct the KV cache in an adaptive manner: evicting long-range contexts on attention heads emphasizing local contexts, discarding non-special tokens on attention heads centered on special token","authors_text":"Jianfeng Gao, Jiawei Han, Liyuan Liu, Minjia Zhang, Suyu Ge, Yunan Zhang","cross_cats":[],"headline":"LLMs can cut KV cache memory by profiling attention heads once and evicting tokens selectively per head type.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-03T05:17:08Z","title":"Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs"},"references":{"count":85,"internal_anchors":18,"resolved_work":85,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , year=","work_id":"b4b7109a-a8e3-49f5-8c2a-d4245838468b","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"2019 , journal =","work_id":"41c879fa-f0bb-4f50-b5be-c2b0d1b21ffa","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Tom B. Brown and Benjamin Mann and Nick Ryder and Melanie Subbiah and Jared Kaplan and Prafulla Dhariwal and Arvind Neelakantan and Pranav Shyam and Girish Sastry and Amanda Askell and Sandhini Agarwa","work_id":"d2f65ea3-f1ff-4ac1-9647-f11876755e31","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":8,"title":"SC22: International Conference for High Performance Computing, Networking, Storage and Analysis , year=","work_id":"d8d392d0-72d7-4c83-b302-9d2e830cf8d8","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":9,"title":"International Conference on Machine Learning , year=","work_id":"dad3ccf2-8849-4fbf-ab94-d710a8f18169","year":null}],"snapshot_sha256":"0ffa89237fb670f8bc441ecec5ef75412a025a175638a720026a498e4716b10f"},"source":{"id":"2310.01801","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-17T11:06:14.885468Z","id":"354e0abe-3f5d-4c5a-9813-4e1b8d71d6e4","model_set":{"reader":"grok-4.3"},"one_line_summary":"FastGen adaptively compresses LLM KV caches via lightweight attention profiling: evicting long-range contexts on local heads, non-special tokens on special-token heads, and retaining full caches on broad-attention heads, yielding substantial memory savings with negligible quality loss.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"LLMs can cut KV cache memory by profiling attention heads once and evicting tokens selectively per head type.","strongest_claim":"we conduct targeted profiling to discern the intrinsic structure of attention modules. Based on the recognized structure, we then construct the KV cache in an adaptive manner: evicting long-range contexts on attention heads emphasizing local contexts, discarding non-special tokens on attention heads centered on special tokens, and only employing the standard KV cache for attention heads that broadly attend to all tokens. Moreover, with the lightweight attention profiling used to guide the construction of the adaptive KV cache, FastGen can be deployed without resource-intensive fine-tuning or re-training. In our experiments across various tasks, FastGen demonstrates substantial reduction on GPU memory consumption with negligible generation quality loss.","weakest_assumption":"That the attention-head structures identified by a single lightweight profiling pass remain stable and sufficient to guide token eviction across diverse generation tasks and contexts without materially degrading output quality or requiring any model updates."}},"verdict_id":"354e0abe-3f5d-4c5a-9813-4e1b8d71d6e4"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4bf9a9bf7c856987ed913906a0aa4f495f4e8848152dc749c24519d4f4829c41","target":"record","created_at":"2026-05-17T23:38:14Z","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":"0e193d84667f6bfe1d3dd00a5dcff1a21a7121bcb148bb9dae7ceb420b7365e4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-03T05:17:08Z","title_canon_sha256":"67dcb3a627ccfd1e7e1ed9f026f773a287848ff13092ed123185a24c13fd96f3"},"schema_version":"1.0","source":{"id":"2310.01801","kind":"arxiv","version":4}},"canonical_sha256":"23340fa97f1d426dd4f00ca20ace8c37532352596ea1ea91a591c8ed76947c51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23340fa97f1d426dd4f00ca20ace8c37532352596ea1ea91a591c8ed76947c51","first_computed_at":"2026-05-17T23:38:14.272361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:14.272361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1bxxoaXwe1Mwqf+CPlzVeM2HKq3bowiy42jP8jddzjH1XhDjcpDRbRoOw2kepLZfcSa+df6SbReEnb1IsrQMBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:14.272943Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.01801","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4bf9a9bf7c856987ed913906a0aa4f495f4e8848152dc749c24519d4f4829c41","sha256:5ebfc9a6c065a60c0dca4d5e60e195ecf318eb34fe2bb1119b9e205ee2e2f077"],"state_sha256":"b078f9394f61f76a3b94636628397f5bc78437012e458979fac405f9217d9746"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Pjp576WCOyZlHfnGb5mn1acJ/IeYVMtuGFjK/Irmh1/oMMoqHp9G9S3SqveLKj6pihczMPP4Hp67XAwaLx6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:51:40.220697Z","bundle_sha256":"b52febdd49bf064c6532bc14a73c94927a3bcff27bd9efa229fa2e2a39322505"}}