{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XCPSYI2IAXYG2QQVR2F7FQ6IIW","short_pith_number":"pith:XCPSYI2I","canonical_record":{"source":{"id":"2605.15108","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-14T17:25:19Z","cross_cats_sorted":["cs.AI","cs.IR","cs.LG","stat.ME"],"title_canon_sha256":"c73506c0ad7842abfb1fe695bb315a9e053c3265d1179618095f86e06f82aec4","abstract_canon_sha256":"9f7505eea36120ce3ad46d6a4c240d5359cf786c1048687aaab3e1a0196dfcaa"},"schema_version":"1.0"},"canonical_sha256":"b89f2c234805f06d42158e8bf2c3c845b35528d71928e2c46621ab3ef868bccd","source":{"kind":"arxiv","id":"2605.15108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15108","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15108v1","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"XCPSYI2IAXYG","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"XCPSYI2IAXYG2QQV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"XCPSYI2I","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XCPSYI2IAXYG2QQVR2F7FQ6IIW","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15108","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-14T17:25:19Z","cross_cats_sorted":["cs.AI","cs.IR","cs.LG","stat.ME"],"title_canon_sha256":"c73506c0ad7842abfb1fe695bb315a9e053c3265d1179618095f86e06f82aec4","abstract_canon_sha256":"9f7505eea36120ce3ad46d6a4c240d5359cf786c1048687aaab3e1a0196dfcaa"},"schema_version":"1.0"},"canonical_sha256":"b89f2c234805f06d42158e8bf2c3c845b35528d71928e2c46621ab3ef868bccd","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.2","canonical_sha256":"b89f2c234805f06d42158e8bf2c3c845b35528d71928e2c46621ab3ef868bccd","last_reissued_at":"2026-05-17T21:57:19.096160Z","signature_status":"unsigned_v0","first_computed_at":"2026-05-17T21:40:25.768637Z"},"source_kind":"arxiv","source_id":"2605.15108","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-17T21:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UApOuJ3zG+2miuabV0igUEExl+XSpMUeg3VZS1c3RYnY40ZgCwZmjFhL1czGabzSOHmO0SHz5XjqhTWfNomPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:38:10.003112Z"},"content_sha256":"000699823d2241388dfe9f8c27894d44456bafde75fe6fd915619f7af214fa28","schema_version":"1.0","event_id":"sha256:000699823d2241388dfe9f8c27894d44456bafde75fe6fd915619f7af214fa28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XCPSYI2IAXYG2QQVR2F7FQ6IIW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Logging Policy Design for Off-Policy Evaluation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A unifying framework derives optimal logging policies that minimize off-policy evaluation error by balancing reward concentration against action coverage across known, unknown, and partial information regimes.","cross_cats":["cs.AI","cs.IR","cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Connor Douglas, Foster Provost, Joel Persson","submitted_at":"2026-05-14T17:25:19Z","abstract_excerpt":"Off-policy evaluation (OPE) estimates the value of a target treatment policy (e.g., a recommender system) using data collected by a different logging policy. It enables high-stakes experimentation without live deployment, yet in practice accuracy depends heavily on the logging policy used to collect data for computing the estimate. We study how to design logging policies that minimize OPE error for given target policies. We characterize a fundamental reward-coverage tradeoff: concentrating probability mass on high-reward actions reduces variance but risks missing signal on actions the target p"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We propose a unifying framework for logging policy design and derive optimal policies in canonical informational regimes where the target policy and reward distribution are (i) known, (ii) unknown, and (iii) partially known through priors or noisy estimates at logging time.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The reward-coverage tradeoff and optimality results assume that the informational regimes (known, unknown, partial) accurately capture real-world knowledge at logging time and that standard OPE estimators behave according to the modeled variance and bias terms.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Derives optimal logging policies for off-policy evaluation by balancing reward concentration against action coverage in known, unknown, and partially known regimes of target policy and rewards.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A unifying framework derives optimal logging policies that minimize off-policy evaluation error by balancing reward concentration against action coverage across known, unknown, and partial information regimes.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"30a339e8b6e2090b83135beb540d1e7132c44d2118d37a0a66fd48fc44b36655"},"source":{"id":"2605.15108","kind":"arxiv","version":1},"verdict":{"id":"101b4b32-f868-40b1-a2ae-84c6ecd46a55","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T03:04:05.796307Z","strongest_claim":"We propose a unifying framework for logging policy design and derive optimal policies in canonical informational regimes where the target policy and reward distribution are (i) known, (ii) unknown, and (iii) partially known through priors or noisy estimates at logging time.","one_line_summary":"Derives optimal logging policies for off-policy evaluation by balancing reward concentration against action coverage in known, unknown, and partially known regimes of target policy and rewards.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The reward-coverage tradeoff and optimality results assume that the informational regimes (known, unknown, partial) accurately capture real-world knowledge at logging time and that standard OPE estimators behave according to the modeled variance and bias terms.","pith_extraction_headline":"A unifying framework derives optimal logging policies that minimize off-policy evaluation error by balancing reward concentration against action coverage across known, unknown, and partial information regimes."},"references":{"count":86,"sample":[{"doi":"","year":2022,"title":"Proceedings of the 39th International Conference on Machine Learning (ICML) , pages =","work_id":"ac9f865d-5eab-4c6b-afca-bca92f60bb4e","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"arXiv preprint arXiv:2402.08201 , year=","work_id":"17184f5e-3258-4432-961d-38ba813bbe78","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"The Annals of Statistics , volume=","work_id":"632ce3ed-68c7-4e69-b5af-29702996e417","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Advances in neural information processing systems , volume=","work_id":"5b25cb38-d44b-43f4-8522-0e8b0a687e61","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Mathematics of Operations Research , volume=","work_id":"7852c905-4c0f-4397-9a1c-bc56a5968cd1","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":86,"snapshot_sha256":"de00ae94d228c99880f940da094ee3a4a4d0e95925011af04d35a932a19fa772","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"d22e391e70a51d0877e84bc0dcc08e439bf9e66e61e6735dba3b70160bc2d1e1"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"101b4b32-f868-40b1-a2ae-84c6ecd46a55"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T21:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Emq2SPAUCDT722P18CXiiNXlo6w0g0b4onalwJ2LUMQoQXKNVDL3a+1Bb9465OZelJiOz3LWZAut+PDsKzEaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:38:10.004228Z"},"content_sha256":"c82daccb84c5029d59f9f7f230763ee534bbca85df616344e79a88d90f30baee","schema_version":"1.0","event_id":"sha256:c82daccb84c5029d59f9f7f230763ee534bbca85df616344e79a88d90f30baee"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:XCPSYI2IAXYG2QQVR2F7FQ6IIW","target":"integrity","payload":{"note":"URL 'https://doi' returned status transport error (transport error: [Errno -3] Temporary failure in name resolution) at last check.","snippet":null,"arxiv_id":"2605.15108","detector":"external_links","evidence":{"url":"https://doi","final_url":null,"host_kind":"website","status_code":0,"status_text":"transport error: [Errno -3] Temporary failure in name resolution","verdict_class":"incontrovertible","checked_at_unix":1779190494.3494344},"severity":"advisory","ref_index":null,"audited_at":"2026-05-19T11:34:54.350850Z","event_type":"pith.integrity.v1","detected_doi":null,"detector_url":"https://pith.science/pith-integrity-protocol#external_links","external_url":"https://doi","finding_type":"dead_url","evidence_hash":"7a0a71556148af45e79f529e898c30e2b88cbeabacf7da6f421cc7e4070d1e11","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":1128,"payload_sha256":"653b4568133a6793f4223c0c4f95ba9c4b1737b5176d8f948428583e07041e90","signature_b64":"GvG+1xfnqgADVpItnLpLqzFZeKJkx2msMqLI11txOKJ4CNIeQJVx40+AK7Td1Q6ilBrpZebrXyh38TN1HhTJBQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T11:37:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G6l9nxrUDKuF7zTy+X5czLZcNDV7e57Tq/Plt7Ca47ThilqHO8z0YThVm8zxC5u6unL8fvu3v9RfhkFJFkuYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:38:10.005778Z"},"content_sha256":"1eeac3e67eb8b6eff626550df2edc4083b750a3ef0a593e0dd32a5b8ef329eba","schema_version":"1.0","event_id":"sha256:1eeac3e67eb8b6eff626550df2edc4083b750a3ef0a593e0dd32a5b8ef329eba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCPSYI2IAXYG2QQVR2F7FQ6IIW/bundle.json","state_url":"https://pith.science/pith/XCPSYI2IAXYG2QQVR2F7FQ6IIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCPSYI2IAXYG2QQVR2F7FQ6IIW/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-20T14:38:10Z","links":{"resolver":"https://pith.science/pith/XCPSYI2IAXYG2QQVR2F7FQ6IIW","bundle":"https://pith.science/pith/XCPSYI2IAXYG2QQVR2F7FQ6IIW/bundle.json","state":"https://pith.science/pith/XCPSYI2IAXYG2QQVR2F7FQ6IIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCPSYI2IAXYG2QQVR2F7FQ6IIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XCPSYI2IAXYG2QQVR2F7FQ6IIW","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9f7505eea36120ce3ad46d6a4c240d5359cf786c1048687aaab3e1a0196dfcaa","cross_cats_sorted":["cs.AI","cs.IR","cs.LG","stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-14T17:25:19Z","title_canon_sha256":"c73506c0ad7842abfb1fe695bb315a9e053c3265d1179618095f86e06f82aec4"},"schema_version":"1.0","source":{"id":"2605.15108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15108","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15108v1","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"XCPSYI2IAXYG","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"XCPSYI2IAXYG2QQV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"XCPSYI2I","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:c82daccb84c5029d59f9f7f230763ee534bbca85df616344e79a88d90f30baee","target":"graph","created_at":"2026-05-17T21:57:19Z","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 propose a unifying framework for logging policy design and derive optimal policies in canonical informational regimes where the target policy and reward distribution are (i) known, (ii) unknown, and (iii) partially known through priors or noisy estimates at logging time."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The reward-coverage tradeoff and optimality results assume that the informational regimes (known, unknown, partial) accurately capture real-world knowledge at logging time and that standard OPE estimators behave according to the modeled variance and bias terms."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Derives optimal logging policies for off-policy evaluation by balancing reward concentration against action coverage in known, unknown, and partially known regimes of target policy and rewards."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A unifying framework derives optimal logging policies that minimize off-policy evaluation error by balancing reward concentration against action coverage across known, unknown, and partial information regimes."}],"snapshot_sha256":"30a339e8b6e2090b83135beb540d1e7132c44d2118d37a0a66fd48fc44b36655"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"d22e391e70a51d0877e84bc0dcc08e439bf9e66e61e6735dba3b70160bc2d1e1"},"paper":{"abstract_excerpt":"Off-policy evaluation (OPE) estimates the value of a target treatment policy (e.g., a recommender system) using data collected by a different logging policy. It enables high-stakes experimentation without live deployment, yet in practice accuracy depends heavily on the logging policy used to collect data for computing the estimate. We study how to design logging policies that minimize OPE error for given target policies. We characterize a fundamental reward-coverage tradeoff: concentrating probability mass on high-reward actions reduces variance but risks missing signal on actions the target p","authors_text":"Connor Douglas, Foster Provost, Joel Persson","cross_cats":["cs.AI","cs.IR","cs.LG","stat.ME"],"headline":"A unifying framework derives optimal logging policies that minimize off-policy evaluation error by balancing reward concentration against action coverage across known, unknown, and partial information regimes.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-14T17:25:19Z","title":"Logging Policy Design for Off-Policy Evaluation"},"references":{"count":86,"internal_anchors":2,"resolved_work":86,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Proceedings of the 39th International Conference on Machine Learning (ICML) , pages =","work_id":"ac9f865d-5eab-4c6b-afca-bca92f60bb4e","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"arXiv preprint arXiv:2402.08201 , year=","work_id":"17184f5e-3258-4432-961d-38ba813bbe78","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"The Annals of Statistics , volume=","work_id":"632ce3ed-68c7-4e69-b5af-29702996e417","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Advances in neural information processing systems , volume=","work_id":"5b25cb38-d44b-43f4-8522-0e8b0a687e61","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Mathematics of Operations Research , volume=","work_id":"7852c905-4c0f-4397-9a1c-bc56a5968cd1","year":2014}],"snapshot_sha256":"de00ae94d228c99880f940da094ee3a4a4d0e95925011af04d35a932a19fa772"},"source":{"id":"2605.15108","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T03:04:05.796307Z","id":"101b4b32-f868-40b1-a2ae-84c6ecd46a55","model_set":{"reader":"grok-4.3"},"one_line_summary":"Derives optimal logging policies for off-policy evaluation by balancing reward concentration against action coverage in known, unknown, and partially known regimes of target policy and rewards.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A unifying framework derives optimal logging policies that minimize off-policy evaluation error by balancing reward concentration against action coverage across known, unknown, and partial information regimes.","strongest_claim":"We propose a unifying framework for logging policy design and derive optimal policies in canonical informational regimes where the target policy and reward distribution are (i) known, (ii) unknown, and (iii) partially known through priors or noisy estimates at logging time.","weakest_assumption":"The reward-coverage tradeoff and optimality results assume that the informational regimes (known, unknown, partial) accurately capture real-world knowledge at logging time and that standard OPE estimators behave according to the modeled variance and bias terms."}},"verdict_id":"101b4b32-f868-40b1-a2ae-84c6ecd46a55"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:000699823d2241388dfe9f8c27894d44456bafde75fe6fd915619f7af214fa28","target":"record","created_at":"2026-05-17T21:18:33Z","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":"9f7505eea36120ce3ad46d6a4c240d5359cf786c1048687aaab3e1a0196dfcaa","cross_cats_sorted":["cs.AI","cs.IR","cs.LG","stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-14T17:25:19Z","title_canon_sha256":"c73506c0ad7842abfb1fe695bb315a9e053c3265d1179618095f86e06f82aec4"},"schema_version":"1.0","source":{"id":"2605.15108","kind":"arxiv","version":1}},"canonical_sha256":"b89f2c234805f06d42158e8bf2c3c845b35528d71928e2c46621ab3ef868bccd","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b89f2c234805f06d42158e8bf2c3c845b35528d71928e2c46621ab3ef868bccd","first_computed_at":"2026-05-17T21:40:25.768637Z","kind":"pith_receipt","last_reissued_at":"2026-05-17T21:57:19.096160Z","receipt_version":"0.2","signature_status":"unsigned_v0"},"source_id":"2605.15108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:000699823d2241388dfe9f8c27894d44456bafde75fe6fd915619f7af214fa28","sha256:c82daccb84c5029d59f9f7f230763ee534bbca85df616344e79a88d90f30baee","sha256:1eeac3e67eb8b6eff626550df2edc4083b750a3ef0a593e0dd32a5b8ef329eba"],"state_sha256":"e710ad9d841dadf3e960caf0a87f6e0089f738a5966ec109be8acd526a42d1fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9GLzScm6p/LU1zONcc8u+XRLxgm+6C32DzRZCUbnKprNqJ1pQBY8mjy+6m8ssDvQnVf7rtYjW2QZYg/rQiLZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T14:38:10.010126Z","bundle_sha256":"f1d5d89024477453bf314c20098e451d0daf73961258dadf7c2149d074dd275e"}}