{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WM7MTQMPHRMRSQMXUN5KL77VAK","short_pith_number":"pith:WM7MTQMP","canonical_record":{"source":{"id":"2605.14261","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T02:04:26Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"ab6dfbb22e7ab7e2bdfe20d0f4886f2f5c33c566f624112e167eecd5912d6471","abstract_canon_sha256":"c43d33b7d07dc3ab06000cedcc56c348c5204a29ce2b93b11efa12dc815c454f"},"schema_version":"1.0"},"canonical_sha256":"b33ec9c18f3c59194197a37aa5fff502b2dbe2336ead81683e2a36d1d3f7f89e","source":{"kind":"arxiv","id":"2605.14261","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14261","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14261v1","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14261","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"WM7MTQMPHRMR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"WM7MTQMPHRMRSQMX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"WM7MTQMP","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WM7MTQMPHRMRSQMXUN5KL77VAK","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14261","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T02:04:26Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"ab6dfbb22e7ab7e2bdfe20d0f4886f2f5c33c566f624112e167eecd5912d6471","abstract_canon_sha256":"c43d33b7d07dc3ab06000cedcc56c348c5204a29ce2b93b11efa12dc815c454f"},"schema_version":"1.0"},"canonical_sha256":"b33ec9c18f3c59194197a37aa5fff502b2dbe2336ead81683e2a36d1d3f7f89e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:10.481647Z","signature_b64":"OWHCKeVghhryvu2P7FYN3dcu6rAro7eTpzl5a8OYvVe28rQr3z7vRY/bcWO4OJPY6YhFN8eOxaitOUKGg+QzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b33ec9c18f3c59194197a37aa5fff502b2dbe2336ead81683e2a36d1d3f7f89e","last_reissued_at":"2026-05-17T23:39:10.481164Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:10.481164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14261","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-17T23:39:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xMVUFTB32cyhrPZkPcCuknobpCDvgWWYap3WEvC+OTX2M4hJ0HxRIhuSmgC3sZPom9tCnLmnJvPxmIJO1wVqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:22:44.259982Z"},"content_sha256":"504d7df9b9ca31defcd79bf45aec41ff0cd50ffae87ee269a982d3d7987d5151","schema_version":"1.0","event_id":"sha256:504d7df9b9ca31defcd79bf45aec41ff0cd50ffae87ee269a982d3d7987d5151"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WM7MTQMPHRMRSQMXUN5KL77VAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heuristic Pathologies and Further Variance Reduction via Uncertainty Propagation in the AIVAT Family of Techniques","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Fix the heuristic value function before seeing evaluation data to avoid setting AIVAT sample variance pathologically low or enabling p-hacking via gradient descent on the test statistic.","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Juho Kim, Tuomas Sandholm","submitted_at":"2026-05-14T02:04:26Z","abstract_excerpt":"How should an agent's performance in a multiagent environment be evaluated when there is a limited sample size or a high cost of running a trial? The AIVAT family of variance reduction techniques was proposed to address this challenge by introducing unbiased low-variance estimators of agents' expected payoffs. An important component of AIVAT is a heuristic value function that discriminates between potentially low- and high-value counterfactual histories. A notable gap in the literature is that there is little to no constraint or guideline on how the heuristic value function should be chosen or"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The heuristic value function should be fixed prior to observing the evaluation data to prevent setting sample variance pathologically low or p-hacking via gradient descent; uncertainty propagation then enables further variance reduction via inverse-variance weighted averaging, yielding a 43.0% reduction in samples needed on 10,000 poker hands.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the heuristic uncertainty can be quantified and propagated in a way that produces meaningful further variance reduction without introducing biases or errors that invalidate the overall estimator, and that the poker dataset and parameterization choices generalize beyond the specific experiments.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"AIVAT heuristics can be gamed for pathological low variance or p-hacking unless fixed before data observation, and uncertainty propagation yields additional variance reduction at possible cost to unbiasedness.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Fix the heuristic value function before seeing evaluation data to avoid setting AIVAT sample variance pathologically low or enabling p-hacking via gradient descent on the test statistic.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"0eb2c595a219774f41dbaf587879ac75238a7c8c4b24e2cd014d281c676440aa"},"source":{"id":"2605.14261","kind":"arxiv","version":1},"verdict":{"id":"31915378-a19d-4330-bcb5-42870937a410","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:25:12.937142Z","strongest_claim":"The heuristic value function should be fixed prior to observing the evaluation data to prevent setting sample variance pathologically low or p-hacking via gradient descent; uncertainty propagation then enables further variance reduction via inverse-variance weighted averaging, yielding a 43.0% reduction in samples needed on 10,000 poker hands.","one_line_summary":"AIVAT heuristics can be gamed for pathological low variance or p-hacking unless fixed before data observation, and uncertainty propagation yields additional variance reduction at possible cost to unbiasedness.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the heuristic uncertainty can be quantified and propagated in a way that produces meaningful further variance reduction without introducing biases or errors that invalidate the overall estimator, and that the poker dataset and parameterization choices generalize beyond the specific experiments.","pith_extraction_headline":"Fix the heuristic value function before seeing evaluation data to avoid setting AIVAT sample variance pathologically low or enabling p-hacking via gradient descent on the test statistic."},"references":{"count":15,"sample":[{"doi":"","year":2013,"title":"N. Bard, J. Hawkin, J. Rubin, and M. Zinkevich. The annual computer poker competition.AI Magazine, 34(2):112–114, 2013","work_id":"5aaa6f67-ee08-45eb-b004-b264fe5e3c40","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2006,"title":"D. Billings and M. Kan. A tool for the direct assessment of poker decisions.ICGA Journal, 29 (3):119–142, 2006","work_id":"a228e639-4ad0-487f-be26-1b5fa900237b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2008,"title":"M. Bowling, M. Johanson, N. Burch, and D. Szafron. Strategy evaluation in extensive games with importance sampling. InProceedings of the International Conference on Machine Learning (ICML), 2008","work_id":"47b9e524-79ae-4bdf-8263-e69204421d12","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"N. Brown and T. Sandholm. Superhuman AI for heads-up no-limit poker: Libratus beats top professionals.Science, 359(6374):418–424, 2018","work_id":"ef7b56a3-56e6-44b7-91f5-2599930721da","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"N. Brown and T. Sandholm. Superhuman AI for multiplayer poker.Science, 365(6456):885–890, 2019","work_id":"deee810e-0e04-44e2-a5ee-100c7117dc2d","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":15,"snapshot_sha256":"0983a5c845ad995a549d0df9964cc8955e22861b0059fc30ff04cfb60e23a397","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"061b76ccae3d6150967142fc882c726f96a2c584a9135cfb9ff84827a2f5100b"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"31915378-a19d-4330-bcb5-42870937a410"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k02tZV0UCG2t/u6xUolyvLj79bjMj8jLfkznXArJiK/WRO5XdVMxo01OU53VrgAexq1Edtx9cQD2laYXYk0+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:22:44.261173Z"},"content_sha256":"b7b7ee769570310ab9cded5cb168ab931b5b94c96374de1eb9a2373d8afdbd4f","schema_version":"1.0","event_id":"sha256:b7b7ee769570310ab9cded5cb168ab931b5b94c96374de1eb9a2373d8afdbd4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WM7MTQMPHRMRSQMXUN5KL77VAK/bundle.json","state_url":"https://pith.science/pith/WM7MTQMPHRMRSQMXUN5KL77VAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WM7MTQMPHRMRSQMXUN5KL77VAK/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-26T15:22:44Z","links":{"resolver":"https://pith.science/pith/WM7MTQMPHRMRSQMXUN5KL77VAK","bundle":"https://pith.science/pith/WM7MTQMPHRMRSQMXUN5KL77VAK/bundle.json","state":"https://pith.science/pith/WM7MTQMPHRMRSQMXUN5KL77VAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WM7MTQMPHRMRSQMXUN5KL77VAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WM7MTQMPHRMRSQMXUN5KL77VAK","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":"c43d33b7d07dc3ab06000cedcc56c348c5204a29ce2b93b11efa12dc815c454f","cross_cats_sorted":["cs.GT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T02:04:26Z","title_canon_sha256":"ab6dfbb22e7ab7e2bdfe20d0f4886f2f5c33c566f624112e167eecd5912d6471"},"schema_version":"1.0","source":{"id":"2605.14261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14261","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14261v1","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14261","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"WM7MTQMPHRMR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"WM7MTQMPHRMRSQMX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"WM7MTQMP","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:b7b7ee769570310ab9cded5cb168ab931b5b94c96374de1eb9a2373d8afdbd4f","target":"graph","created_at":"2026-05-17T23:39:10Z","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":"The heuristic value function should be fixed prior to observing the evaluation data to prevent setting sample variance pathologically low or p-hacking via gradient descent; uncertainty propagation then enables further variance reduction via inverse-variance weighted averaging, yielding a 43.0% reduction in samples needed on 10,000 poker hands."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the heuristic uncertainty can be quantified and propagated in a way that produces meaningful further variance reduction without introducing biases or errors that invalidate the overall estimator, and that the poker dataset and parameterization choices generalize beyond the specific experiments."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"AIVAT heuristics can be gamed for pathological low variance or p-hacking unless fixed before data observation, and uncertainty propagation yields additional variance reduction at possible cost to unbiasedness."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Fix the heuristic value function before seeing evaluation data to avoid setting AIVAT sample variance pathologically low or enabling p-hacking via gradient descent on the test statistic."}],"snapshot_sha256":"0eb2c595a219774f41dbaf587879ac75238a7c8c4b24e2cd014d281c676440aa"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"061b76ccae3d6150967142fc882c726f96a2c584a9135cfb9ff84827a2f5100b"},"paper":{"abstract_excerpt":"How should an agent's performance in a multiagent environment be evaluated when there is a limited sample size or a high cost of running a trial? The AIVAT family of variance reduction techniques was proposed to address this challenge by introducing unbiased low-variance estimators of agents' expected payoffs. An important component of AIVAT is a heuristic value function that discriminates between potentially low- and high-value counterfactual histories. A notable gap in the literature is that there is little to no constraint or guideline on how the heuristic value function should be chosen or","authors_text":"Juho Kim, Tuomas Sandholm","cross_cats":["cs.GT"],"headline":"Fix the heuristic value function before seeing evaluation data to avoid setting AIVAT sample variance pathologically low or enabling p-hacking via gradient descent on the test statistic.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T02:04:26Z","title":"Heuristic Pathologies and Further Variance Reduction via Uncertainty Propagation in the AIVAT Family of Techniques"},"references":{"count":15,"internal_anchors":0,"resolved_work":15,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"N. Bard, J. Hawkin, J. Rubin, and M. Zinkevich. The annual computer poker competition.AI Magazine, 34(2):112–114, 2013","work_id":"5aaa6f67-ee08-45eb-b004-b264fe5e3c40","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"D. Billings and M. Kan. A tool for the direct assessment of poker decisions.ICGA Journal, 29 (3):119–142, 2006","work_id":"a228e639-4ad0-487f-be26-1b5fa900237b","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"M. Bowling, M. Johanson, N. Burch, and D. Szafron. Strategy evaluation in extensive games with importance sampling. InProceedings of the International Conference on Machine Learning (ICML), 2008","work_id":"47b9e524-79ae-4bdf-8263-e69204421d12","year":2008},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"N. Brown and T. Sandholm. Superhuman AI for heads-up no-limit poker: Libratus beats top professionals.Science, 359(6374):418–424, 2018","work_id":"ef7b56a3-56e6-44b7-91f5-2599930721da","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"N. Brown and T. Sandholm. Superhuman AI for multiplayer poker.Science, 365(6456):885–890, 2019","work_id":"deee810e-0e04-44e2-a5ee-100c7117dc2d","year":2019}],"snapshot_sha256":"0983a5c845ad995a549d0df9964cc8955e22861b0059fc30ff04cfb60e23a397"},"source":{"id":"2605.14261","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:25:12.937142Z","id":"31915378-a19d-4330-bcb5-42870937a410","model_set":{"reader":"grok-4.3"},"one_line_summary":"AIVAT heuristics can be gamed for pathological low variance or p-hacking unless fixed before data observation, and uncertainty propagation yields additional variance reduction at possible cost to unbiasedness.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Fix the heuristic value function before seeing evaluation data to avoid setting AIVAT sample variance pathologically low or enabling p-hacking via gradient descent on the test statistic.","strongest_claim":"The heuristic value function should be fixed prior to observing the evaluation data to prevent setting sample variance pathologically low or p-hacking via gradient descent; uncertainty propagation then enables further variance reduction via inverse-variance weighted averaging, yielding a 43.0% reduction in samples needed on 10,000 poker hands.","weakest_assumption":"That the heuristic uncertainty can be quantified and propagated in a way that produces meaningful further variance reduction without introducing biases or errors that invalidate the overall estimator, and that the poker dataset and parameterization choices generalize beyond the specific experiments."}},"verdict_id":"31915378-a19d-4330-bcb5-42870937a410"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:504d7df9b9ca31defcd79bf45aec41ff0cd50ffae87ee269a982d3d7987d5151","target":"record","created_at":"2026-05-17T23:39:10Z","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":"c43d33b7d07dc3ab06000cedcc56c348c5204a29ce2b93b11efa12dc815c454f","cross_cats_sorted":["cs.GT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T02:04:26Z","title_canon_sha256":"ab6dfbb22e7ab7e2bdfe20d0f4886f2f5c33c566f624112e167eecd5912d6471"},"schema_version":"1.0","source":{"id":"2605.14261","kind":"arxiv","version":1}},"canonical_sha256":"b33ec9c18f3c59194197a37aa5fff502b2dbe2336ead81683e2a36d1d3f7f89e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b33ec9c18f3c59194197a37aa5fff502b2dbe2336ead81683e2a36d1d3f7f89e","first_computed_at":"2026-05-17T23:39:10.481164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:10.481164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OWHCKeVghhryvu2P7FYN3dcu6rAro7eTpzl5a8OYvVe28rQr3z7vRY/bcWO4OJPY6YhFN8eOxaitOUKGg+QzAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:10.481647Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:504d7df9b9ca31defcd79bf45aec41ff0cd50ffae87ee269a982d3d7987d5151","sha256:b7b7ee769570310ab9cded5cb168ab931b5b94c96374de1eb9a2373d8afdbd4f"],"state_sha256":"dedc72299f2c32d89a007cdf8e4fc0df0d8ed9cdfbe49a3b406672d3b74601f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rovaN3/pljPkDi5jcFag3WIgVrX2VuHqpmLpWd7icLTZ31QvpUTQ2OX8e0xQ118mZZcOYErC1J5Wk0qxPeDVDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:22:44.266468Z","bundle_sha256":"1c6fb7c469c987b469c932c57c962335af5641f39dd859188506a8763be36d14"}}