{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:AF6JWETJLXAD67NDCBMLHL42UZ","short_pith_number":"pith:AF6JWETJ","canonical_record":{"source":{"id":"2605.14494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T07:34:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ec451db23e60b61ad1cdd981c72a5581de602871af5773a5a00e2d7288e53a0a","abstract_canon_sha256":"dc7b776b403ca60d4e413501b78d26aab85d5902bc49f584bd2f1eff5c565664"},"schema_version":"1.0"},"canonical_sha256":"017c9b12695dc03f7da31058b3af9aa6721e19271ef55e9fa5ab0402f64edf90","source":{"kind":"arxiv","id":"2605.14494","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14494","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14494v1","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14494","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"AF6JWETJLXAD","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"AF6JWETJLXAD67ND","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"AF6JWETJ","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:AF6JWETJLXAD67NDCBMLHL42UZ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T07:34:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ec451db23e60b61ad1cdd981c72a5581de602871af5773a5a00e2d7288e53a0a","abstract_canon_sha256":"dc7b776b403ca60d4e413501b78d26aab85d5902bc49f584bd2f1eff5c565664"},"schema_version":"1.0"},"canonical_sha256":"017c9b12695dc03f7da31058b3af9aa6721e19271ef55e9fa5ab0402f64edf90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:06.398522Z","signature_b64":"zGif5kYktsQHJbZFIogmqES5bnJ6DgMFwtyS6vy21CL10LQvz6GFRn8bFnAphnQ8eQFnJd7C4Ku/SwM/vOpHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"017c9b12695dc03f7da31058b3af9aa6721e19271ef55e9fa5ab0402f64edf90","last_reissued_at":"2026-05-17T23:39:06.397775Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:06.397775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14494","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:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xyqzb7jyg55qtXPQcKDbCPeYHBvOtcTslIWewwqhsIOtuwAukCiF3wnOgBLT8xrHWqGaFwwIm3H31ejPuSuZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T17:53:42.068173Z"},"content_sha256":"33b063fd2cd018a6f29a22ea3c5987b3048fbe7deff2a446a84610ebbd2ef905","schema_version":"1.0","event_id":"sha256:33b063fd2cd018a6f29a22ea3c5987b3048fbe7deff2a446a84610ebbd2ef905"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:AF6JWETJLXAD67NDCBMLHL42UZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Scenario Reduction for Two-Stage Robust Optimization with Discrete Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A GNN-Transformer trained to imitate a lookahead heuristic selects reduced scenarios for two-stage robust optimization while matching quality at 7-200x higher speed.","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Jianan Zhou, Jieyi Bi, Jie Zhang, Tianjue Lin, Wen Song, Yaoxin Wu, Zhiguang Cao","submitted_at":"2026-05-14T07:34:13Z","abstract_excerpt":"Two-Stage Robust Optimization (2RO) with discrete uncertainty is challenging, often rendering exact solutions prohibitive. Scenario reduction alleviates this issue by selecting a small, representative subset of scenarios to enable tractable computation. However, existing methods are largely problem-agnostic, operating solely on the uncertainty set without consulting the feasible region or recourse structure. In this paper, we introduce PRISE, a problem-driven sequential lookahead heuristic that constructs reduced scenario sets by evaluating the marginal impact of each scenario. While PRISE yie"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"NeurPRISE consistently achieves competitive regret relative to comprehensive methods, maintains strong scalability with varying numbers of scenarios, and delivers 7-200x speedup over PRISE. NeurPRISE also exhibits strong zero-shot generalization, effectively handling instances with larger problem scales (up to 5x), more scenarios (up to 4x), and distribution shifts.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the marginal impact of each scenario on the recourse cost can be accurately approximated by a GNN-Transformer trained only on PRISE's selections, without needing to solve the full subproblems at inference time, and that this approximation transfers across problem scales and distributions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"NeurPRISE trains a GNN-Transformer via imitation learning to mimic a lookahead heuristic for scenario reduction in 2RO, delivering 7-200x speedups with competitive regret on three test problems and zero-shot generalization.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A GNN-Transformer trained to imitate a lookahead heuristic selects reduced scenarios for two-stage robust optimization while matching quality at 7-200x higher speed.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"57f20ffff208781e1992a28627b8486606ca447d3768eddf4cbd52b165fc65e5"},"source":{"id":"2605.14494","kind":"arxiv","version":1},"verdict":{"id":"62f87a8e-2a1d-46b5-8c7f-f73965a6069c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:00:16.509140Z","strongest_claim":"NeurPRISE consistently achieves competitive regret relative to comprehensive methods, maintains strong scalability with varying numbers of scenarios, and delivers 7-200x speedup over PRISE. NeurPRISE also exhibits strong zero-shot generalization, effectively handling instances with larger problem scales (up to 5x), more scenarios (up to 4x), and distribution shifts.","one_line_summary":"NeurPRISE trains a GNN-Transformer via imitation learning to mimic a lookahead heuristic for scenario reduction in 2RO, delivering 7-200x speedups with competitive regret on three test problems and zero-shot generalization.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the marginal impact of each scenario on the recourse cost can be accurately approximated by a GNN-Transformer trained only on PRISE's selections, without needing to solve the full subproblems at inference time, and that this approximation transfers across problem scales and distributions.","pith_extraction_headline":"A GNN-Transformer trained to imitate a lookahead heuristic selects reduced scenarios for two-stage robust optimization while matching quality at 7-200x higher speed."},"references":{"count":37,"sample":[{"doi":"","year":2000,"title":"Robust solutions of linear programming problems contaminated with uncertain data.Mathematical programming, 88(3):411–424, 2000","work_id":"dd148461-db5f-48e9-a94a-5830912210c7","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"Adjustable robust solutions of uncertain linear programs.Mathematical programming, 99(2):351–376, 2004","work_id":"2fd54eec-a62e-4aa2-8c28-a355dd7bb338","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Princeton University Press","work_id":"58a27603-78b1-4098-b51c-1b4ea23e8fa8","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"Finite adaptability in multistage linear optimization.IEEE Transactions on Automatic Control, 55(12):2751–2766, 2010","work_id":"24327f44-5d9f-4805-a4cb-40d9b227382f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"Design of near optimal decision rules in multistage adaptive mixed-integer optimization.Operations Research, 63(3):610–627, 2015","work_id":"dd3882c4-c615-43f7-bf55-efc5178e92f2","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":37,"snapshot_sha256":"883ce7cab3cd6071d374c4d27beb2ac16c5122a84a7bd1643847ae00a2d20ec5","internal_anchors":1},"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":"62f87a8e-2a1d-46b5-8c7f-f73965a6069c"},"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:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4akVuAUuWOhsxg3U4drb5Wq7E5uYEDR9rzV6ZknDGOjIg8soKrjnYTTeOGWGx3wtSgb2EWTIGOBJy+QavnoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T17:53:42.069449Z"},"content_sha256":"7ec8a72798a76e223a9f12f2ecb7e8458f3974a988202f45470f73c5f55124c0","schema_version":"1.0","event_id":"sha256:7ec8a72798a76e223a9f12f2ecb7e8458f3974a988202f45470f73c5f55124c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AF6JWETJLXAD67NDCBMLHL42UZ/bundle.json","state_url":"https://pith.science/pith/AF6JWETJLXAD67NDCBMLHL42UZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AF6JWETJLXAD67NDCBMLHL42UZ/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-23T17:53:42Z","links":{"resolver":"https://pith.science/pith/AF6JWETJLXAD67NDCBMLHL42UZ","bundle":"https://pith.science/pith/AF6JWETJLXAD67NDCBMLHL42UZ/bundle.json","state":"https://pith.science/pith/AF6JWETJLXAD67NDCBMLHL42UZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AF6JWETJLXAD67NDCBMLHL42UZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:AF6JWETJLXAD67NDCBMLHL42UZ","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":"dc7b776b403ca60d4e413501b78d26aab85d5902bc49f584bd2f1eff5c565664","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T07:34:13Z","title_canon_sha256":"ec451db23e60b61ad1cdd981c72a5581de602871af5773a5a00e2d7288e53a0a"},"schema_version":"1.0","source":{"id":"2605.14494","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14494","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14494v1","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14494","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"AF6JWETJLXAD","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"AF6JWETJLXAD67ND","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"AF6JWETJ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:7ec8a72798a76e223a9f12f2ecb7e8458f3974a988202f45470f73c5f55124c0","target":"graph","created_at":"2026-05-17T23:39:06Z","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":"NeurPRISE consistently achieves competitive regret relative to comprehensive methods, maintains strong scalability with varying numbers of scenarios, and delivers 7-200x speedup over PRISE. NeurPRISE also exhibits strong zero-shot generalization, effectively handling instances with larger problem scales (up to 5x), more scenarios (up to 4x), and distribution shifts."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the marginal impact of each scenario on the recourse cost can be accurately approximated by a GNN-Transformer trained only on PRISE's selections, without needing to solve the full subproblems at inference time, and that this approximation transfers across problem scales and distributions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"NeurPRISE trains a GNN-Transformer via imitation learning to mimic a lookahead heuristic for scenario reduction in 2RO, delivering 7-200x speedups with competitive regret on three test problems and zero-shot generalization."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A GNN-Transformer trained to imitate a lookahead heuristic selects reduced scenarios for two-stage robust optimization while matching quality at 7-200x higher speed."}],"snapshot_sha256":"57f20ffff208781e1992a28627b8486606ca447d3768eddf4cbd52b165fc65e5"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Two-Stage Robust Optimization (2RO) with discrete uncertainty is challenging, often rendering exact solutions prohibitive. Scenario reduction alleviates this issue by selecting a small, representative subset of scenarios to enable tractable computation. However, existing methods are largely problem-agnostic, operating solely on the uncertainty set without consulting the feasible region or recourse structure. In this paper, we introduce PRISE, a problem-driven sequential lookahead heuristic that constructs reduced scenario sets by evaluating the marginal impact of each scenario. While PRISE yie","authors_text":"Jianan Zhou, Jieyi Bi, Jie Zhang, Tianjue Lin, Wen Song, Yaoxin Wu, Zhiguang Cao","cross_cats":["cs.LG"],"headline":"A GNN-Transformer trained to imitate a lookahead heuristic selects reduced scenarios for two-stage robust optimization while matching quality at 7-200x higher speed.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T07:34:13Z","title":"Learning Scenario Reduction for Two-Stage Robust Optimization with Discrete Uncertainty"},"references":{"count":37,"internal_anchors":1,"resolved_work":37,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Robust solutions of linear programming problems contaminated with uncertain data.Mathematical programming, 88(3):411–424, 2000","work_id":"dd148461-db5f-48e9-a94a-5830912210c7","year":2000},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Adjustable robust solutions of uncertain linear programs.Mathematical programming, 99(2):351–376, 2004","work_id":"2fd54eec-a62e-4aa2-8c28-a355dd7bb338","year":2004},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Princeton University Press","work_id":"58a27603-78b1-4098-b51c-1b4ea23e8fa8","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Finite adaptability in multistage linear optimization.IEEE Transactions on Automatic Control, 55(12):2751–2766, 2010","work_id":"24327f44-5d9f-4805-a4cb-40d9b227382f","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Design of near optimal decision rules in multistage adaptive mixed-integer optimization.Operations Research, 63(3):610–627, 2015","work_id":"dd3882c4-c615-43f7-bf55-efc5178e92f2","year":2015}],"snapshot_sha256":"883ce7cab3cd6071d374c4d27beb2ac16c5122a84a7bd1643847ae00a2d20ec5"},"source":{"id":"2605.14494","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:00:16.509140Z","id":"62f87a8e-2a1d-46b5-8c7f-f73965a6069c","model_set":{"reader":"grok-4.3"},"one_line_summary":"NeurPRISE trains a GNN-Transformer via imitation learning to mimic a lookahead heuristic for scenario reduction in 2RO, delivering 7-200x speedups with competitive regret on three test problems and zero-shot generalization.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A GNN-Transformer trained to imitate a lookahead heuristic selects reduced scenarios for two-stage robust optimization while matching quality at 7-200x higher speed.","strongest_claim":"NeurPRISE consistently achieves competitive regret relative to comprehensive methods, maintains strong scalability with varying numbers of scenarios, and delivers 7-200x speedup over PRISE. NeurPRISE also exhibits strong zero-shot generalization, effectively handling instances with larger problem scales (up to 5x), more scenarios (up to 4x), and distribution shifts.","weakest_assumption":"That the marginal impact of each scenario on the recourse cost can be accurately approximated by a GNN-Transformer trained only on PRISE's selections, without needing to solve the full subproblems at inference time, and that this approximation transfers across problem scales and distributions."}},"verdict_id":"62f87a8e-2a1d-46b5-8c7f-f73965a6069c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:33b063fd2cd018a6f29a22ea3c5987b3048fbe7deff2a446a84610ebbd2ef905","target":"record","created_at":"2026-05-17T23:39:06Z","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":"dc7b776b403ca60d4e413501b78d26aab85d5902bc49f584bd2f1eff5c565664","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T07:34:13Z","title_canon_sha256":"ec451db23e60b61ad1cdd981c72a5581de602871af5773a5a00e2d7288e53a0a"},"schema_version":"1.0","source":{"id":"2605.14494","kind":"arxiv","version":1}},"canonical_sha256":"017c9b12695dc03f7da31058b3af9aa6721e19271ef55e9fa5ab0402f64edf90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"017c9b12695dc03f7da31058b3af9aa6721e19271ef55e9fa5ab0402f64edf90","first_computed_at":"2026-05-17T23:39:06.397775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:06.397775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zGif5kYktsQHJbZFIogmqES5bnJ6DgMFwtyS6vy21CL10LQvz6GFRn8bFnAphnQ8eQFnJd7C4Ku/SwM/vOpHCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:06.398522Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14494","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33b063fd2cd018a6f29a22ea3c5987b3048fbe7deff2a446a84610ebbd2ef905","sha256:7ec8a72798a76e223a9f12f2ecb7e8458f3974a988202f45470f73c5f55124c0"],"state_sha256":"d8be05d8a88dce8b2eb3cf780164f5aa50e55d23ba1d0606f93872ccd683a56f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uf5nTjGGVlVOI8O+HqZ6mZUREQaIHuAQYmdZz8qUTm7P58fAIGUCFBnTK5BytDjjOhw8I0a172W6Dxac07J4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T17:53:42.075472Z","bundle_sha256":"8b058619b767c1ad7ce13d415e402f623faac545437d0752925a37b4863fcf12"}}