{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:G7JVWCF7HAP27HN3I25TCYOTUM","short_pith_number":"pith:G7JVWCF7","canonical_record":{"source":{"id":"2605.17613","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-17T19:18:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f17e8e43a9a9b82cf8e4f1ecc1104f52d5fe1fbd1ea5049711c2adf10a457ff9","abstract_canon_sha256":"e959bc3e2213d0ef4b3f5827bce07ced4011e605cc285e908904109d420dc309"},"schema_version":"1.0"},"canonical_sha256":"37d35b08bf381faf9dbb46bb3161d3a309ffa9da2bfcdc609f0ac473be4a05f4","source":{"kind":"arxiv","id":"2605.17613","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17613","created_at":"2026-05-20T00:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17613v1","created_at":"2026-05-20T00:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17613","created_at":"2026-05-20T00:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"G7JVWCF7HAP2","created_at":"2026-05-20T00:04:48Z"},{"alias_kind":"pith_short_16","alias_value":"G7JVWCF7HAP27HN3","created_at":"2026-05-20T00:04:48Z"},{"alias_kind":"pith_short_8","alias_value":"G7JVWCF7","created_at":"2026-05-20T00:04:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:G7JVWCF7HAP27HN3I25TCYOTUM","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17613","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-17T19:18:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f17e8e43a9a9b82cf8e4f1ecc1104f52d5fe1fbd1ea5049711c2adf10a457ff9","abstract_canon_sha256":"e959bc3e2213d0ef4b3f5827bce07ced4011e605cc285e908904109d420dc309"},"schema_version":"1.0"},"canonical_sha256":"37d35b08bf381faf9dbb46bb3161d3a309ffa9da2bfcdc609f0ac473be4a05f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:48.584649Z","signature_b64":"vnMPqg9N6UMMDSThztjZNxwQt5GjQrk0NumSEDKr8fjBb5Qk+rDTuHN7hqS4n+fvur4p1yvTAlYMvcm3odTLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37d35b08bf381faf9dbb46bb3161d3a309ffa9da2bfcdc609f0ac473be4a05f4","last_reissued_at":"2026-05-20T00:04:48.583788Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:48.583788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17613","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:04:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bn0kDTRThf1S3SQXy2CzMrG/nXDG/LNfRLeOSvs6XhHBEylmVukirawqdW7UdG5Xv5povba4Ffviujj1MShFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T02:17:41.394658Z"},"content_sha256":"2cbb404c7cbd9ab95ff7c2a17f61fd98ee5655ad2e4d4d4f97484c16abfbef84","schema_version":"1.0","event_id":"sha256:2cbb404c7cbd9ab95ff7c2a17f61fd98ee5655ad2e4d4d4f97484c16abfbef84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:G7JVWCF7HAP27HN3I25TCYOTUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"VeriCache: Turning Lossy KV Cache into Lossless LLM Inference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"VeriCache achieves identical outputs to full-KV-cache decoding at up to 4 times higher throughput by drafting with compressed caches and verifying in parallel.","cross_cats":["cs.LG"],"primary_cat":"cs.AR","authors_text":"Dongjoo Seo, Jiayi Yao, Junchen Jiang, Kuntai Du, Rui Zhang, Samuel Shen, Shan Lu, Shaoting Feng, Yuhan Liu, Yuyang Huang","submitted_at":"2026-05-17T19:18:39Z","abstract_excerpt":"The large size of the KV cache has become a major bottleneck for serving LLMs with increasing context lengths. In response, many KV cache compression methods, such as token dropping and quantization, have been proposed. However, almost all of these methods are inherently lossy-despite minimal accuracy degradation for short outputs, their outputs increasingly diverge from full-KV-cache outputs as more tokens are decoded, which leads to catastrophic failures in code generation and tool calling.\n  We present VeriCache, the first inference framework that ensures the same output as full-KV-cache de"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"VeriCache achieves up to 4X higher throughput than full-KV inference while producing identical outputs.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"Compressed-KV decoding can be parallelized with full-KV swap because one is HBM-bandwidth-bound and the other is PCIe/network-bound, and the compressed KV cache often produces output similar to the full KV cache allowing a long drafting horizon to amortize each swap.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"VeriCache turns lossy KV cache compression into lossless LLM inference by drafting with compressed cache and verifying drafts with full cache, achieving up to 4x throughput with identical outputs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"VeriCache achieves identical outputs to full-KV-cache decoding at up to 4 times higher throughput by drafting with compressed caches and verifying in parallel.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"76d4a115aecdda3ed1b65f890680beb1cbb919a3115221bae0103b94fc0b2def"},"source":{"id":"2605.17613","kind":"arxiv","version":1},"verdict":{"id":"9b146464-f6f9-4075-a2a4-7d6e66e371f7","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T22:05:21.069105Z","strongest_claim":"VeriCache achieves up to 4X higher throughput than full-KV inference while producing identical outputs.","one_line_summary":"VeriCache turns lossy KV cache compression into lossless LLM inference by drafting with compressed cache and verifying drafts with full cache, achieving up to 4x throughput with identical outputs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"Compressed-KV decoding can be parallelized with full-KV swap because one is HBM-bandwidth-bound and the other is PCIe/network-bound, and the compressed KV cache often produces output similar to the full KV cache allowing a long drafting horizon to amortize each swap.","pith_extraction_headline":"VeriCache achieves identical outputs to full-KV-cache decoding at up to 4 times higher throughput by drafting with compressed caches and verifying in parallel."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17613/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"cited_work_retraction","ran_at":"2026-05-19T22:53:08.706915Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T22:31:19.524577Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T22:12:15.832523Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.568308Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T21:21:57.495643Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"0f2447e08995f82ea73f88460ee5f23eb50b0756959d3163734bebf559604a01"},"references":{"count":85,"sample":[{"doi":"","year":2024,"title":"Muhammad Adnan, Akhil Arunkumar, Gaurav Jain, Prashant J Nair, Ilya Soloveychik, and Purushotham Kamath. 2024. Keyformer: Kv cache reduction through key tokens selection for efficient generative infer","work_id":"8b13a4cf-5c29-44a2-a47c-1c078c30d788","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"arXiv preprint arXiv:2410.18351","work_id":"cd1590ed-f2d0-4073-8f43-82b78e685e0c","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Amazon Web Services. 2025. Performance specifications for Amazon S3. https://docs.aws.amazon.com/AmazonS3/latest/ userguide/s3-files-performance.html. Accessed: 2026-04-16","work_id":"3f9624b5-a629-4b65-ba14-8213415e3b1a","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Yuxuan Cai, Xiaozhuan Liang, Xinghua Wang, Jin Ma, Haijin Liang, Jinwen Luo, Xinyu Zuo, Lisheng Duan, Yuyang Yin, and Xi Chen","work_id":"14e12d86-f1ad-4a91-b111-4e61d5551aa4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"arXiv:2509.18362 [cs.LG] https://arxiv.org/ abs/2509.18362","work_id":"9fd0aa26-edb2-43b1-a57e-c9af37775651","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":85,"snapshot_sha256":"4f3abca3308e3f5f7886442f10a3df9fa3a04a24a1093f42f6a334d2f0a3bc28","internal_anchors":12},"formal_canon":{"evidence_count":2,"snapshot_sha256":"5b0af8869b7a9838c25c1489281db18fab65f633a3df31acb3929dab4cb12cae"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"9b146464-f6f9-4075-a2a4-7d6e66e371f7"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:04:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OAJKLxvza58sxvQHq7j8OH0QH7rZiyjbqN0AoiAZsIo0Ob93gZ2Tu4P2mQHbbhul1LRoOIgiV6fqoVpLaUuOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T02:17:41.396176Z"},"content_sha256":"86e6aa9bf57b377591658518d6f40c88c8886e8817852349bcbc6ac8a0175f79","schema_version":"1.0","event_id":"sha256:86e6aa9bf57b377591658518d6f40c88c8886e8817852349bcbc6ac8a0175f79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G7JVWCF7HAP27HN3I25TCYOTUM/bundle.json","state_url":"https://pith.science/pith/G7JVWCF7HAP27HN3I25TCYOTUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G7JVWCF7HAP27HN3I25TCYOTUM/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-22T02:17:41Z","links":{"resolver":"https://pith.science/pith/G7JVWCF7HAP27HN3I25TCYOTUM","bundle":"https://pith.science/pith/G7JVWCF7HAP27HN3I25TCYOTUM/bundle.json","state":"https://pith.science/pith/G7JVWCF7HAP27HN3I25TCYOTUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G7JVWCF7HAP27HN3I25TCYOTUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:G7JVWCF7HAP27HN3I25TCYOTUM","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":"e959bc3e2213d0ef4b3f5827bce07ced4011e605cc285e908904109d420dc309","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-17T19:18:39Z","title_canon_sha256":"f17e8e43a9a9b82cf8e4f1ecc1104f52d5fe1fbd1ea5049711c2adf10a457ff9"},"schema_version":"1.0","source":{"id":"2605.17613","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17613","created_at":"2026-05-20T00:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17613v1","created_at":"2026-05-20T00:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17613","created_at":"2026-05-20T00:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"G7JVWCF7HAP2","created_at":"2026-05-20T00:04:48Z"},{"alias_kind":"pith_short_16","alias_value":"G7JVWCF7HAP27HN3","created_at":"2026-05-20T00:04:48Z"},{"alias_kind":"pith_short_8","alias_value":"G7JVWCF7","created_at":"2026-05-20T00:04:48Z"}],"graph_snapshots":[{"event_id":"sha256:86e6aa9bf57b377591658518d6f40c88c8886e8817852349bcbc6ac8a0175f79","target":"graph","created_at":"2026-05-20T00:04:48Z","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":"VeriCache achieves up to 4X higher throughput than full-KV inference while producing identical outputs."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Compressed-KV decoding can be parallelized with full-KV swap because one is HBM-bandwidth-bound and the other is PCIe/network-bound, and the compressed KV cache often produces output similar to the full KV cache allowing a long drafting horizon to amortize each swap."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"VeriCache turns lossy KV cache compression into lossless LLM inference by drafting with compressed cache and verifying drafts with full cache, achieving up to 4x throughput with identical outputs."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"VeriCache achieves identical outputs to full-KV-cache decoding at up to 4 times higher throughput by drafting with compressed caches and verifying in parallel."}],"snapshot_sha256":"76d4a115aecdda3ed1b65f890680beb1cbb919a3115221bae0103b94fc0b2def"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"5b0af8869b7a9838c25c1489281db18fab65f633a3df31acb3929dab4cb12cae"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T22:53:08.706915Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T22:31:19.524577Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:12:15.832523Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.568308Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:21:57.495643Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.17613/integrity.json","findings":[],"snapshot_sha256":"0f2447e08995f82ea73f88460ee5f23eb50b0756959d3163734bebf559604a01","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The large size of the KV cache has become a major bottleneck for serving LLMs with increasing context lengths. In response, many KV cache compression methods, such as token dropping and quantization, have been proposed. However, almost all of these methods are inherently lossy-despite minimal accuracy degradation for short outputs, their outputs increasingly diverge from full-KV-cache outputs as more tokens are decoded, which leads to catastrophic failures in code generation and tool calling.\n  We present VeriCache, the first inference framework that ensures the same output as full-KV-cache de","authors_text":"Dongjoo Seo, Jiayi Yao, Junchen Jiang, Kuntai Du, Rui Zhang, Samuel Shen, Shan Lu, Shaoting Feng, Yuhan Liu, Yuyang Huang","cross_cats":["cs.LG"],"headline":"VeriCache achieves identical outputs to full-KV-cache decoding at up to 4 times higher throughput by drafting with compressed caches and verifying in parallel.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-17T19:18:39Z","title":"VeriCache: Turning Lossy KV Cache into Lossless LLM Inference"},"references":{"count":85,"internal_anchors":12,"resolved_work":85,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Muhammad Adnan, Akhil Arunkumar, Gaurav Jain, Prashant J Nair, Ilya Soloveychik, and Purushotham Kamath. 2024. Keyformer: Kv cache reduction through key tokens selection for efficient generative infer","work_id":"8b13a4cf-5c29-44a2-a47c-1c078c30d788","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"arXiv preprint arXiv:2410.18351","work_id":"cd1590ed-f2d0-4073-8f43-82b78e685e0c","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Amazon Web Services. 2025. Performance specifications for Amazon S3. https://docs.aws.amazon.com/AmazonS3/latest/ userguide/s3-files-performance.html. Accessed: 2026-04-16","work_id":"3f9624b5-a629-4b65-ba14-8213415e3b1a","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Yuxuan Cai, Xiaozhuan Liang, Xinghua Wang, Jin Ma, Haijin Liang, Jinwen Luo, Xinyu Zuo, Lisheng Duan, Yuyang Yin, and Xi Chen","work_id":"14e12d86-f1ad-4a91-b111-4e61d5551aa4","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"arXiv:2509.18362 [cs.LG] https://arxiv.org/ abs/2509.18362","work_id":"9fd0aa26-edb2-43b1-a57e-c9af37775651","year":null}],"snapshot_sha256":"4f3abca3308e3f5f7886442f10a3df9fa3a04a24a1093f42f6a334d2f0a3bc28"},"source":{"id":"2605.17613","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T22:05:21.069105Z","id":"9b146464-f6f9-4075-a2a4-7d6e66e371f7","model_set":{"reader":"grok-4.3"},"one_line_summary":"VeriCache turns lossy KV cache compression into lossless LLM inference by drafting with compressed cache and verifying drafts with full cache, achieving up to 4x throughput with identical outputs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"VeriCache achieves identical outputs to full-KV-cache decoding at up to 4 times higher throughput by drafting with compressed caches and verifying in parallel.","strongest_claim":"VeriCache achieves up to 4X higher throughput than full-KV inference while producing identical outputs.","weakest_assumption":"Compressed-KV decoding can be parallelized with full-KV swap because one is HBM-bandwidth-bound and the other is PCIe/network-bound, and the compressed KV cache often produces output similar to the full KV cache allowing a long drafting horizon to amortize each swap."}},"verdict_id":"9b146464-f6f9-4075-a2a4-7d6e66e371f7"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2cbb404c7cbd9ab95ff7c2a17f61fd98ee5655ad2e4d4d4f97484c16abfbef84","target":"record","created_at":"2026-05-20T00:04:48Z","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":"e959bc3e2213d0ef4b3f5827bce07ced4011e605cc285e908904109d420dc309","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-17T19:18:39Z","title_canon_sha256":"f17e8e43a9a9b82cf8e4f1ecc1104f52d5fe1fbd1ea5049711c2adf10a457ff9"},"schema_version":"1.0","source":{"id":"2605.17613","kind":"arxiv","version":1}},"canonical_sha256":"37d35b08bf381faf9dbb46bb3161d3a309ffa9da2bfcdc609f0ac473be4a05f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37d35b08bf381faf9dbb46bb3161d3a309ffa9da2bfcdc609f0ac473be4a05f4","first_computed_at":"2026-05-20T00:04:48.583788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:48.583788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vnMPqg9N6UMMDSThztjZNxwQt5GjQrk0NumSEDKr8fjBb5Qk+rDTuHN7hqS4n+fvur4p1yvTAlYMvcm3odTLCg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:48.584649Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17613","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cbb404c7cbd9ab95ff7c2a17f61fd98ee5655ad2e4d4d4f97484c16abfbef84","sha256:86e6aa9bf57b377591658518d6f40c88c8886e8817852349bcbc6ac8a0175f79"],"state_sha256":"b49709cfb6539796a40b5144078e78bb69eb709167b146da9642c5a02e1014d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EJ+aNtV7UcgdjSXFzbVIokxiAPztR/5sGd2zSxNV6DCTX+Ebza4OffUHcm7IbnNjOdzOz+fSUyK4jU3+dt7/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T02:17:41.400802Z","bundle_sha256":"2c92466d4505523ea351185981b108e47cc583f6585ade98635fcbad9b206b1c"}}