{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:OKTQCBDTPJKW2QR7ODFV24CYRL","short_pith_number":"pith:OKTQCBDT","canonical_record":{"source":{"id":"2409.10516","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-16T17:59:52Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"6b3207f8eac4cff796384b2296086e6413c94bc9c5595b083c7dfcf161b0042e","abstract_canon_sha256":"72d989fd6a990aeb62ae8f0732d7818eb28aced7250e298cb63f0f369a0d3e5a"},"schema_version":"1.0"},"canonical_sha256":"72a70104737a556d423f70cb5d70588ac562663add87800618b446cf2e67deae","source":{"kind":"arxiv","id":"2409.10516","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.10516","created_at":"2026-07-05T09:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"2409.10516v3","created_at":"2026-07-05T09:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10516","created_at":"2026-07-05T09:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"OKTQCBDTPJKW","created_at":"2026-07-05T09:55:34Z"},{"alias_kind":"pith_short_16","alias_value":"OKTQCBDTPJKW2QR7","created_at":"2026-07-05T09:55:34Z"},{"alias_kind":"pith_short_8","alias_value":"OKTQCBDT","created_at":"2026-07-05T09:55:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:OKTQCBDTPJKW2QR7ODFV24CYRL","target":"record","payload":{"canonical_record":{"source":{"id":"2409.10516","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-16T17:59:52Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"6b3207f8eac4cff796384b2296086e6413c94bc9c5595b083c7dfcf161b0042e","abstract_canon_sha256":"72d989fd6a990aeb62ae8f0732d7818eb28aced7250e298cb63f0f369a0d3e5a"},"schema_version":"1.0"},"canonical_sha256":"72a70104737a556d423f70cb5d70588ac562663add87800618b446cf2e67deae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:34.751342Z","signature_b64":"1QO98m6N47VK7J/p6lF+5YrCR4MJZv0fr2nWgCT5tYZQEXf0Q56qky904jmd0kXlDFrO0DTH00MVVEJGVDz+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72a70104737a556d423f70cb5d70588ac562663add87800618b446cf2e67deae","last_reissued_at":"2026-07-05T09:55:34.750814Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:34.750814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.10516","source_version":3,"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-07-05T09:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jzBOWyBe0er+qseR6lWsHc1b0ojJ8IFs+NKMgrjO+Jpi2w6Ji+1ExbDYNtfObHc6xCDraECh5Hk000CkhfBcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:09:37.445356Z"},"content_sha256":"2c5e6d33f664f7eb7fa80cfe4180b349b0df4830b3a2515a5af3a869b228bab8","schema_version":"1.0","event_id":"sha256:2c5e6d33f664f7eb7fa80cfe4180b349b0df4830b3a2515a5af3a869b228bab8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:OKTQCBDTPJKW2QR7ODFV24CYRL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RetrievalAttention: Accelerating Long-Context LLM Inference via Vector Retrieval","license":"http://creativecommons.org/licenses/by/4.0/","headline":"RetrievalAttention approximates full attention accuracy by retrieving only 1-3% of KV vectors through an attention-aware search on CPU-stored indexes.","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Bailu Ding, Baotong Lu, Chen Chen, Chengruidong Zhang, Di Liu, Fan Yang, Huiqiang Jiang, Kai Zhang, Lili Qiu, Meng Chen, Qianxi Zhang, Qi Chen, Yuqing Yang, Zhenhua Han","submitted_at":"2024-09-16T17:59:52Z","abstract_excerpt":"Transformer-based Large Language Models (LLMs) have become increasingly important. However, due to the quadratic time complexity of attention computation, scaling LLMs to longer contexts incurs extremely slow inference speed and high GPU memory consumption for caching key-value (KV) vectors. This paper proposes RetrievalAttention, a training-free approach to both accelerate attention computation and reduce GPU memory consumption. By leveraging the dynamic sparsity of attention mechanism, RetrievalAttention proposes to build approximate nearest neighbor search (ANNS) indexes for KV vectors in C"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"RetrievalAttention achieves near full attention accuracy while only requiring access to 1--3% of the data. This leads to a significant reduction in the inference cost of long-context LLMs, with a much lower GPU memory footprint. In particular, RetrievalAttention only needs a single NVIDIA RTX4090 (24GB) to serve 128K tokens for LLMs with 8B parameters, which is capable of generating one token in 0.188 seconds.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that an attention-aware vector search algorithm can reliably overcome the out-of-distribution gap between query vectors and key vectors so that retrieving 1-3% of KV entries preserves near-full attention accuracy. This premise is introduced when the abstract states that off-the-shelf ANNS indexes are ineffective due to OOD and that the new algorithm addresses it.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"RetrievalAttention approximates full attention in long-context LLMs by retrieving relevant KV vectors from CPU-based ANNS indexes with an attention-aware algorithm, achieving near-full accuracy while accessing only 1-3% of the data.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"RetrievalAttention approximates full attention accuracy by retrieving only 1-3% of KV vectors through an attention-aware search on CPU-stored indexes.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2c7a527d3e819a71933773aa0e9da3d800e43da5e47a7fc2967b63a3a7f35e18"},"source":{"id":"2409.10516","kind":"arxiv","version":3},"verdict":{"id":"7608ae72-6855-4ae6-ae1a-7e1b11c4b25e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T08:07:03.608351Z","strongest_claim":"RetrievalAttention achieves near full attention accuracy while only requiring access to 1--3% of the data. This leads to a significant reduction in the inference cost of long-context LLMs, with a much lower GPU memory footprint. In particular, RetrievalAttention only needs a single NVIDIA RTX4090 (24GB) to serve 128K tokens for LLMs with 8B parameters, which is capable of generating one token in 0.188 seconds.","one_line_summary":"RetrievalAttention approximates full attention in long-context LLMs by retrieving relevant KV vectors from CPU-based ANNS indexes with an attention-aware algorithm, achieving near-full accuracy while accessing only 1-3% of the data.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that an attention-aware vector search algorithm can reliably overcome the out-of-distribution gap between query vectors and key vectors so that retrieving 1-3% of KV entries preserves near-full attention accuracy. This premise is introduced when the abstract states that off-the-shelf ANNS indexes are ineffective due to OOD and that the new algorithm addresses it.","pith_extraction_headline":"RetrievalAttention approximates full attention accuracy by retrieving only 1-3% of KV vectors through an attention-aware search on CPU-stored indexes."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.10516/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":118,"sample":[{"doi":"","year":null,"title":"Scaling Learning Algorithms Towards","work_id":"bb2761cc-98d0-411b-92f6-803773d64460","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"and Osindero, Simon and Teh, Yee Whye , journal =","work_id":"0a5921e3-ac4e-46f1-85ae-866119a87be0","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"Deep learning , author=. 2016 , publisher=","work_id":"cf0899e0-53ee-4591-aae4-f38fa5ac12ad","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1979,"title":"IEEE Transactions on Computers , volume=","work_id":"4ac530da-dbef-449e-b295-22c7fb0c09fc","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"IEEE Transactions on Big Data , volume=","work_id":"8ed12345-c3b3-4305-8795-6b590df21d35","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":118,"snapshot_sha256":"11ecbb670e034a52e9b938094ffac1bd975383f73e9c30bb84532c7de92c8557","internal_anchors":10},"formal_canon":{"evidence_count":1,"snapshot_sha256":"8a8e38d17fcebe87badf25daf19a62e48176208e73fe5d9c76cf41faf719f7e7"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"7608ae72-6855-4ae6-ae1a-7e1b11c4b25e"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2T90bLvqI1UTjGKxRxlcJE8MYsl5Nb5MzkwjUnM5nHPZBr0qKg3HcU0rDYJmaQgqXcS03AKvKgX8RBiAOOcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:09:37.446284Z"},"content_sha256":"e7c3b8856a74160f8e74e56d7a84e36ee13e2c15983299564aae90124995fde0","schema_version":"1.0","event_id":"sha256:e7c3b8856a74160f8e74e56d7a84e36ee13e2c15983299564aae90124995fde0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKTQCBDTPJKW2QR7ODFV24CYRL/bundle.json","state_url":"https://pith.science/pith/OKTQCBDTPJKW2QR7ODFV24CYRL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKTQCBDTPJKW2QR7ODFV24CYRL/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-08-05T22:09:37Z","links":{"resolver":"https://pith.science/pith/OKTQCBDTPJKW2QR7ODFV24CYRL","bundle":"https://pith.science/pith/OKTQCBDTPJKW2QR7ODFV24CYRL/bundle.json","state":"https://pith.science/pith/OKTQCBDTPJKW2QR7ODFV24CYRL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKTQCBDTPJKW2QR7ODFV24CYRL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OKTQCBDTPJKW2QR7ODFV24CYRL","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":"72d989fd6a990aeb62ae8f0732d7818eb28aced7250e298cb63f0f369a0d3e5a","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-16T17:59:52Z","title_canon_sha256":"6b3207f8eac4cff796384b2296086e6413c94bc9c5595b083c7dfcf161b0042e"},"schema_version":"1.0","source":{"id":"2409.10516","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.10516","created_at":"2026-07-05T09:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"2409.10516v3","created_at":"2026-07-05T09:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10516","created_at":"2026-07-05T09:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"OKTQCBDTPJKW","created_at":"2026-07-05T09:55:34Z"},{"alias_kind":"pith_short_16","alias_value":"OKTQCBDTPJKW2QR7","created_at":"2026-07-05T09:55:34Z"},{"alias_kind":"pith_short_8","alias_value":"OKTQCBDT","created_at":"2026-07-05T09:55:34Z"}],"graph_snapshots":[{"event_id":"sha256:e7c3b8856a74160f8e74e56d7a84e36ee13e2c15983299564aae90124995fde0","target":"graph","created_at":"2026-07-05T09:55:34Z","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":"RetrievalAttention achieves near full attention accuracy while only requiring access to 1--3% of the data. This leads to a significant reduction in the inference cost of long-context LLMs, with a much lower GPU memory footprint. In particular, RetrievalAttention only needs a single NVIDIA RTX4090 (24GB) to serve 128K tokens for LLMs with 8B parameters, which is capable of generating one token in 0.188 seconds."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that an attention-aware vector search algorithm can reliably overcome the out-of-distribution gap between query vectors and key vectors so that retrieving 1-3% of KV entries preserves near-full attention accuracy. This premise is introduced when the abstract states that off-the-shelf ANNS indexes are ineffective due to OOD and that the new algorithm addresses it."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"RetrievalAttention approximates full attention in long-context LLMs by retrieving relevant KV vectors from CPU-based ANNS indexes with an attention-aware algorithm, achieving near-full accuracy while accessing only 1-3% of the data."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"RetrievalAttention approximates full attention accuracy by retrieving only 1-3% of KV vectors through an attention-aware search on CPU-stored indexes."}],"snapshot_sha256":"2c7a527d3e819a71933773aa0e9da3d800e43da5e47a7fc2967b63a3a7f35e18"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"8a8e38d17fcebe87badf25daf19a62e48176208e73fe5d9c76cf41faf719f7e7"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.10516/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Transformer-based Large Language Models (LLMs) have become increasingly important. However, due to the quadratic time complexity of attention computation, scaling LLMs to longer contexts incurs extremely slow inference speed and high GPU memory consumption for caching key-value (KV) vectors. This paper proposes RetrievalAttention, a training-free approach to both accelerate attention computation and reduce GPU memory consumption. By leveraging the dynamic sparsity of attention mechanism, RetrievalAttention proposes to build approximate nearest neighbor search (ANNS) indexes for KV vectors in C","authors_text":"Bailu Ding, Baotong Lu, Chen Chen, Chengruidong Zhang, Di Liu, Fan Yang, Huiqiang Jiang, Kai Zhang, Lili Qiu, Meng Chen, Qianxi Zhang, Qi Chen, Yuqing Yang, Zhenhua Han","cross_cats":["cs.CL"],"headline":"RetrievalAttention approximates full attention accuracy by retrieving only 1-3% of KV vectors through an attention-aware search on CPU-stored indexes.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-16T17:59:52Z","title":"RetrievalAttention: Accelerating Long-Context LLM Inference via Vector Retrieval"},"references":{"count":118,"internal_anchors":10,"resolved_work":118,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Scaling Learning Algorithms Towards","work_id":"bb2761cc-98d0-411b-92f6-803773d64460","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"and Osindero, Simon and Teh, Yee Whye , journal =","work_id":"0a5921e3-ac4e-46f1-85ae-866119a87be0","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Deep learning , author=. 2016 , publisher=","work_id":"cf0899e0-53ee-4591-aae4-f38fa5ac12ad","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"IEEE Transactions on Computers , volume=","work_id":"4ac530da-dbef-449e-b295-22c7fb0c09fc","year":1979},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"IEEE Transactions on Big Data , volume=","work_id":"8ed12345-c3b3-4305-8795-6b590df21d35","year":2019}],"snapshot_sha256":"11ecbb670e034a52e9b938094ffac1bd975383f73e9c30bb84532c7de92c8557"},"source":{"id":"2409.10516","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-18T08:07:03.608351Z","id":"7608ae72-6855-4ae6-ae1a-7e1b11c4b25e","model_set":{"reader":"grok-4.3"},"one_line_summary":"RetrievalAttention approximates full attention in long-context LLMs by retrieving relevant KV vectors from CPU-based ANNS indexes with an attention-aware algorithm, achieving near-full accuracy while accessing only 1-3% of the data.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"RetrievalAttention approximates full attention accuracy by retrieving only 1-3% of KV vectors through an attention-aware search on CPU-stored indexes.","strongest_claim":"RetrievalAttention achieves near full attention accuracy while only requiring access to 1--3% of the data. This leads to a significant reduction in the inference cost of long-context LLMs, with a much lower GPU memory footprint. In particular, RetrievalAttention only needs a single NVIDIA RTX4090 (24GB) to serve 128K tokens for LLMs with 8B parameters, which is capable of generating one token in 0.188 seconds.","weakest_assumption":"The assumption that an attention-aware vector search algorithm can reliably overcome the out-of-distribution gap between query vectors and key vectors so that retrieving 1-3% of KV entries preserves near-full attention accuracy. This premise is introduced when the abstract states that off-the-shelf ANNS indexes are ineffective due to OOD and that the new algorithm addresses it."}},"verdict_id":"7608ae72-6855-4ae6-ae1a-7e1b11c4b25e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2c5e6d33f664f7eb7fa80cfe4180b349b0df4830b3a2515a5af3a869b228bab8","target":"record","created_at":"2026-07-05T09:55:34Z","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":"72d989fd6a990aeb62ae8f0732d7818eb28aced7250e298cb63f0f369a0d3e5a","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-16T17:59:52Z","title_canon_sha256":"6b3207f8eac4cff796384b2296086e6413c94bc9c5595b083c7dfcf161b0042e"},"schema_version":"1.0","source":{"id":"2409.10516","kind":"arxiv","version":3}},"canonical_sha256":"72a70104737a556d423f70cb5d70588ac562663add87800618b446cf2e67deae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72a70104737a556d423f70cb5d70588ac562663add87800618b446cf2e67deae","first_computed_at":"2026-07-05T09:55:34.750814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:55:34.750814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1QO98m6N47VK7J/p6lF+5YrCR4MJZv0fr2nWgCT5tYZQEXf0Q56qky904jmd0kXlDFrO0DTH00MVVEJGVDz+BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:55:34.751342Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.10516","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c5e6d33f664f7eb7fa80cfe4180b349b0df4830b3a2515a5af3a869b228bab8","sha256:e7c3b8856a74160f8e74e56d7a84e36ee13e2c15983299564aae90124995fde0"],"state_sha256":"bacbd64bec92a6c847224675f360f21cdc1b3dd22a522f32f6b26d4578d28bc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hu5XfYNO5jF4XZSdwIGO5nlB+TtBFkcxQOFyWscITwYIbkcdVu+9j121yNuvoAEE4g+5s6n/yy2jY6MuHmT0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T22:09:37.451375Z","bundle_sha256":"6a151a90ca4ca1a53ce79165875b17a3434fcb0ef301ca4979a38e42310b4bf8"}}