{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:W5TXDENBMIXO2F26MJ3NBRYV7G","short_pith_number":"pith:W5TXDENB","canonical_record":{"source":{"id":"2605.12954","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-13T03:40:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b19eb8c9b0772b3c7d646a6b05cf2808298dfc8664910e53fc693adce349ce5c","abstract_canon_sha256":"0721734a9b04f9ec320b89e48c436ad45051e6b51dca5d0413bbd952de1ab46d"},"schema_version":"1.0"},"canonical_sha256":"b7677191a1622eed175e6276d0c715f9ad347ca20e9771c7a8c04eb571bb8d20","source":{"kind":"arxiv","id":"2605.12954","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12954","created_at":"2026-05-18T03:09:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12954v1","created_at":"2026-05-18T03:09:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12954","created_at":"2026-05-18T03:09:09Z"},{"alias_kind":"pith_short_12","alias_value":"W5TXDENBMIXO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"W5TXDENBMIXO2F26","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"W5TXDENB","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:W5TXDENBMIXO2F26MJ3NBRYV7G","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12954","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-13T03:40:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b19eb8c9b0772b3c7d646a6b05cf2808298dfc8664910e53fc693adce349ce5c","abstract_canon_sha256":"0721734a9b04f9ec320b89e48c436ad45051e6b51dca5d0413bbd952de1ab46d"},"schema_version":"1.0"},"canonical_sha256":"b7677191a1622eed175e6276d0c715f9ad347ca20e9771c7a8c04eb571bb8d20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:09.315464Z","signature_b64":"shNOn90FjoaMisr6MCbUsm9ZXxbHVBM7BUjtrEwFCLyPgZQRqTvpLe7ECAcGiNV8ZoKU+WQ72nWue0RgH2roCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7677191a1622eed175e6276d0c715f9ad347ca20e9771c7a8c04eb571bb8d20","last_reissued_at":"2026-05-18T03:09:09.314870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:09.314870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12954","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-18T03:09:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5tYOcP5cbnu8YgBJ37BebtAFoRseOAx6WaQRfNFz1I+JZaKUsULUxauKajiCyLd2+ViFmb027mYqT9VwP0TAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:39:31.941967Z"},"content_sha256":"f0c8cdbf83f9531d5dcf1206bc6e54e9759ef341550b01b48034ff56fdec2485","schema_version":"1.0","event_id":"sha256:f0c8cdbf83f9531d5dcf1206bc6e54e9759ef341550b01b48034ff56fdec2485"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:W5TXDENBMIXO2F26MJ3NBRYV7G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AdaFocus: Adaptive Relevance-Diversity Sampling with Zero-Cache Look-back for Efficient Long Video Understanding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"AdaFocus improves long-video accuracy while cutting visual tokens by about 33 times through adaptive preview sampling and on-demand disk retrieval.","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Haoxuan Yu, Ning Qin, Xiao Yang, Yingzhe Ma, Zixin Li","submitted_at":"2026-05-13T03:40:21Z","abstract_excerpt":"Long video understanding is heavily bottlenecked by a rigid one-shot paradigm: existing methods either densely encode videos at prohibitive memory and latency costs, or aggressively compress them into sparse frame sets that irreversibly discard fine-grained evidence needed for downstream reasoning. Consequently, current models struggle to simultaneously balance temporal coverage, visual details, and computational efficiency.\n  We propose AdaFocus, an efficient framework that rethinks long-video understanding as progressive evidence acquisition rather than one-pass encoding. AdaFocus relies on "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"AdaFocus delivers a substantially better efficiency-accuracy trade-off than strong baselines. Compared with conventional dense encoding, AdaFocus achieves improved task performance (e.g., +2.59 accuracy on VideoMME, +8.39 mIoU on Charades-STA over single-pass inference) while reducing visual token consumption by ~33x and eliminating the need for in-memory frame pre-caching through its zero-cache disk retrieval design.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The uncertainty-triggered refinement mechanism can reliably identify when and which high-resolution evidence is needed from the initial low-cost preview, without missing critical details that would require exhaustive preloading.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"AdaFocus achieves better accuracy on long-video benchmarks with roughly 33 times fewer visual tokens by combining query-aware adaptive sampling and zero-cache disk-based refinement.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"AdaFocus improves long-video accuracy while cutting visual tokens by about 33 times through adaptive preview sampling and on-demand disk retrieval.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"149ae7405348385853575b2a38e602ea91834d89db54625b86404a9a30957ce3"},"source":{"id":"2605.12954","kind":"arxiv","version":1},"verdict":{"id":"2d444176-e987-4148-9205-cafd94888b09","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:39:53.060195Z","strongest_claim":"AdaFocus delivers a substantially better efficiency-accuracy trade-off than strong baselines. Compared with conventional dense encoding, AdaFocus achieves improved task performance (e.g., +2.59 accuracy on VideoMME, +8.39 mIoU on Charades-STA over single-pass inference) while reducing visual token consumption by ~33x and eliminating the need for in-memory frame pre-caching through its zero-cache disk retrieval design.","one_line_summary":"AdaFocus achieves better accuracy on long-video benchmarks with roughly 33 times fewer visual tokens by combining query-aware adaptive sampling and zero-cache disk-based refinement.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The uncertainty-triggered refinement mechanism can reliably identify when and which high-resolution evidence is needed from the initial low-cost preview, without missing critical details that would require exhaustive preloading.","pith_extraction_headline":"AdaFocus improves long-video accuracy while cutting visual tokens by about 33 times through adaptive preview sampling and on-demand disk retrieval."},"references":{"count":33,"sample":[{"doi":"","year":2017,"title":"Lisa Anne Hendricks, Oliver Wang, Eli Shechtman, Josef Sivic, Trevor Darrell, and Bryan Russell. 2017. Localizing moments in video with natural language. In Proceedings of the IEEE international confe","work_id":"a050ad1f-bc2f-410c-a773-37094bb7af2b","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Qwen3-VL Technical Report","work_id":"1fe243aa-e3c0-4da6-b391-4cbcfc88d5c0","ref_index":2,"cited_arxiv_id":"2511.21631","is_internal_anchor":true},{"doi":"","year":2024,"title":"VideoLLaMA 2: Advancing Spatial-Temporal Modeling and Audio Understanding in Video-LLMs","work_id":"ccfc3f89-c510-45f1-8a35-ed1a56c0ae5c","ref_index":3,"cited_arxiv_id":"2406.07476","is_internal_anchor":true},{"doi":"","year":2022,"title":"Tri Dao, Dan Fu, Stefano Ermon, Atri Rudra, and Christopher Ré. 2022. Flashat- tention: Fast and memory-efficient exact attention with io-awareness.Advances in neural information processing systems35 ","work_id":"15271a55-5c79-4cdd-b2cb-9ad910540658","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Video-R1: Reinforcing Video Reasoning in MLLMs","work_id":"0ce88332-564c-4361-8e2a-3850eb1ace9c","ref_index":5,"cited_arxiv_id":"2503.21776","is_internal_anchor":true}],"resolved_work":33,"snapshot_sha256":"55ce5452aad1530c14d7dea2c266a8ec2d187431d7a16fce547b8554ca71bd6e","internal_anchors":9},"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":"2d444176-e987-4148-9205-cafd94888b09"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"llmYy78UJkNVC26YCEF7P5p4/UYY5x/dAKi6ey4XgXeqi3f08ShXtoZOdGkS++IcBQyvfQIRjnUQ2oCyfNqzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:39:31.942896Z"},"content_sha256":"31a65536925a7506dfdae3666bee401dcca774901bcd6484a5a349d75693eb55","schema_version":"1.0","event_id":"sha256:31a65536925a7506dfdae3666bee401dcca774901bcd6484a5a349d75693eb55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5TXDENBMIXO2F26MJ3NBRYV7G/bundle.json","state_url":"https://pith.science/pith/W5TXDENBMIXO2F26MJ3NBRYV7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5TXDENBMIXO2F26MJ3NBRYV7G/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-26T23:39:31Z","links":{"resolver":"https://pith.science/pith/W5TXDENBMIXO2F26MJ3NBRYV7G","bundle":"https://pith.science/pith/W5TXDENBMIXO2F26MJ3NBRYV7G/bundle.json","state":"https://pith.science/pith/W5TXDENBMIXO2F26MJ3NBRYV7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5TXDENBMIXO2F26MJ3NBRYV7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:W5TXDENBMIXO2F26MJ3NBRYV7G","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":"0721734a9b04f9ec320b89e48c436ad45051e6b51dca5d0413bbd952de1ab46d","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-13T03:40:21Z","title_canon_sha256":"b19eb8c9b0772b3c7d646a6b05cf2808298dfc8664910e53fc693adce349ce5c"},"schema_version":"1.0","source":{"id":"2605.12954","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12954","created_at":"2026-05-18T03:09:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12954v1","created_at":"2026-05-18T03:09:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12954","created_at":"2026-05-18T03:09:09Z"},{"alias_kind":"pith_short_12","alias_value":"W5TXDENBMIXO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"W5TXDENBMIXO2F26","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"W5TXDENB","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:31a65536925a7506dfdae3666bee401dcca774901bcd6484a5a349d75693eb55","target":"graph","created_at":"2026-05-18T03:09:09Z","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":"AdaFocus delivers a substantially better efficiency-accuracy trade-off than strong baselines. Compared with conventional dense encoding, AdaFocus achieves improved task performance (e.g., +2.59 accuracy on VideoMME, +8.39 mIoU on Charades-STA over single-pass inference) while reducing visual token consumption by ~33x and eliminating the need for in-memory frame pre-caching through its zero-cache disk retrieval design."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The uncertainty-triggered refinement mechanism can reliably identify when and which high-resolution evidence is needed from the initial low-cost preview, without missing critical details that would require exhaustive preloading."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"AdaFocus achieves better accuracy on long-video benchmarks with roughly 33 times fewer visual tokens by combining query-aware adaptive sampling and zero-cache disk-based refinement."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"AdaFocus improves long-video accuracy while cutting visual tokens by about 33 times through adaptive preview sampling and on-demand disk retrieval."}],"snapshot_sha256":"149ae7405348385853575b2a38e602ea91834d89db54625b86404a9a30957ce3"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Long video understanding is heavily bottlenecked by a rigid one-shot paradigm: existing methods either densely encode videos at prohibitive memory and latency costs, or aggressively compress them into sparse frame sets that irreversibly discard fine-grained evidence needed for downstream reasoning. Consequently, current models struggle to simultaneously balance temporal coverage, visual details, and computational efficiency.\n  We propose AdaFocus, an efficient framework that rethinks long-video understanding as progressive evidence acquisition rather than one-pass encoding. AdaFocus relies on ","authors_text":"Haoxuan Yu, Ning Qin, Xiao Yang, Yingzhe Ma, Zixin Li","cross_cats":["cs.AI"],"headline":"AdaFocus improves long-video accuracy while cutting visual tokens by about 33 times through adaptive preview sampling and on-demand disk retrieval.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-13T03:40:21Z","title":"AdaFocus: Adaptive Relevance-Diversity Sampling with Zero-Cache Look-back for Efficient Long Video Understanding"},"references":{"count":33,"internal_anchors":9,"resolved_work":33,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Lisa Anne Hendricks, Oliver Wang, Eli Shechtman, Josef Sivic, Trevor Darrell, and Bryan Russell. 2017. Localizing moments in video with natural language. In Proceedings of the IEEE international confe","work_id":"a050ad1f-bc2f-410c-a773-37094bb7af2b","year":2017},{"cited_arxiv_id":"2511.21631","doi":"","is_internal_anchor":true,"ref_index":2,"title":"Qwen3-VL Technical Report","work_id":"1fe243aa-e3c0-4da6-b391-4cbcfc88d5c0","year":2025},{"cited_arxiv_id":"2406.07476","doi":"","is_internal_anchor":true,"ref_index":3,"title":"VideoLLaMA 2: Advancing Spatial-Temporal Modeling and Audio Understanding in Video-LLMs","work_id":"ccfc3f89-c510-45f1-8a35-ed1a56c0ae5c","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Tri Dao, Dan Fu, Stefano Ermon, Atri Rudra, and Christopher Ré. 2022. Flashat- tention: Fast and memory-efficient exact attention with io-awareness.Advances in neural information processing systems35 ","work_id":"15271a55-5c79-4cdd-b2cb-9ad910540658","year":2022},{"cited_arxiv_id":"2503.21776","doi":"","is_internal_anchor":true,"ref_index":5,"title":"Video-R1: Reinforcing Video Reasoning in MLLMs","work_id":"0ce88332-564c-4361-8e2a-3850eb1ace9c","year":2025}],"snapshot_sha256":"55ce5452aad1530c14d7dea2c266a8ec2d187431d7a16fce547b8554ca71bd6e"},"source":{"id":"2605.12954","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:39:53.060195Z","id":"2d444176-e987-4148-9205-cafd94888b09","model_set":{"reader":"grok-4.3"},"one_line_summary":"AdaFocus achieves better accuracy on long-video benchmarks with roughly 33 times fewer visual tokens by combining query-aware adaptive sampling and zero-cache disk-based refinement.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"AdaFocus improves long-video accuracy while cutting visual tokens by about 33 times through adaptive preview sampling and on-demand disk retrieval.","strongest_claim":"AdaFocus delivers a substantially better efficiency-accuracy trade-off than strong baselines. Compared with conventional dense encoding, AdaFocus achieves improved task performance (e.g., +2.59 accuracy on VideoMME, +8.39 mIoU on Charades-STA over single-pass inference) while reducing visual token consumption by ~33x and eliminating the need for in-memory frame pre-caching through its zero-cache disk retrieval design.","weakest_assumption":"The uncertainty-triggered refinement mechanism can reliably identify when and which high-resolution evidence is needed from the initial low-cost preview, without missing critical details that would require exhaustive preloading."}},"verdict_id":"2d444176-e987-4148-9205-cafd94888b09"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f0c8cdbf83f9531d5dcf1206bc6e54e9759ef341550b01b48034ff56fdec2485","target":"record","created_at":"2026-05-18T03:09:09Z","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":"0721734a9b04f9ec320b89e48c436ad45051e6b51dca5d0413bbd952de1ab46d","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-13T03:40:21Z","title_canon_sha256":"b19eb8c9b0772b3c7d646a6b05cf2808298dfc8664910e53fc693adce349ce5c"},"schema_version":"1.0","source":{"id":"2605.12954","kind":"arxiv","version":1}},"canonical_sha256":"b7677191a1622eed175e6276d0c715f9ad347ca20e9771c7a8c04eb571bb8d20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7677191a1622eed175e6276d0c715f9ad347ca20e9771c7a8c04eb571bb8d20","first_computed_at":"2026-05-18T03:09:09.314870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:09.314870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"shNOn90FjoaMisr6MCbUsm9ZXxbHVBM7BUjtrEwFCLyPgZQRqTvpLe7ECAcGiNV8ZoKU+WQ72nWue0RgH2roCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:09.315464Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12954","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0c8cdbf83f9531d5dcf1206bc6e54e9759ef341550b01b48034ff56fdec2485","sha256:31a65536925a7506dfdae3666bee401dcca774901bcd6484a5a349d75693eb55"],"state_sha256":"a9de319f8016ec24b5b4c639cb6bc007682d4e92357a50d309671e64f36f7722"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZhnP+509v23fl9CnVhBWmoL5ILhICKCO1QD3eJUnHR/gIwAR76uOjhequ7gQsGSWvhCpLhw8ZW64yIqTokiAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:39:31.947568Z","bundle_sha256":"b9b700a4be165bd154bade36c0c03464347bd5820a38098d6833892e76e85302"}}