{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:V7MX236TZ2S4HLFD5O2F77E7WQ","short_pith_number":"pith:V7MX236T","canonical_record":{"source":{"id":"2605.14273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T02:16:35Z","cross_cats_sorted":[],"title_canon_sha256":"fb09c54635444a322876ee09066f21a0a83b1c48b95a93518ac8ed682afc5e89","abstract_canon_sha256":"b55f687bd2df8a52d66940a969abf4edec87815454fc7275e19c9ec8a7a32f4c"},"schema_version":"1.0"},"canonical_sha256":"afd97d6fd3cea5c3aca3ebb45ffc9fb41ea626c36a7fe48e881312a4daf31d8c","source":{"kind":"arxiv","id":"2605.14273","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14273","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14273v1","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14273","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"V7MX236TZ2S4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"V7MX236TZ2S4HLFD","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"V7MX236T","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:V7MX236TZ2S4HLFD5O2F77E7WQ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T02:16:35Z","cross_cats_sorted":[],"title_canon_sha256":"fb09c54635444a322876ee09066f21a0a83b1c48b95a93518ac8ed682afc5e89","abstract_canon_sha256":"b55f687bd2df8a52d66940a969abf4edec87815454fc7275e19c9ec8a7a32f4c"},"schema_version":"1.0"},"canonical_sha256":"afd97d6fd3cea5c3aca3ebb45ffc9fb41ea626c36a7fe48e881312a4daf31d8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:10.373413Z","signature_b64":"OvgbBS3Dcz2grY+vFHGEZFjYhQpBW8mvnyiT0Dv2644PTBPAtV610THYEmQcag5woCjq7qJ/ziXUrLsaXU2ACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afd97d6fd3cea5c3aca3ebb45ffc9fb41ea626c36a7fe48e881312a4daf31d8c","last_reissued_at":"2026-05-17T23:39:10.372901Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:10.372901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14273","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":"XPQhiJ2oCO9D+yNIVGYJSPlSPEZ3ws+rSbw3P9gG6RszdCOEyCTp5/vUcBhMZUUKaUPRw1S5uLHYejzTNngNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:45:44.134783Z"},"content_sha256":"8aa1ecdb7ac31c59daaeba2fa7a0e95548052779a4a6cafc688b0f91dde9a142","schema_version":"1.0","event_id":"sha256:8aa1ecdb7ac31c59daaeba2fa7a0e95548052779a4a6cafc688b0f91dde9a142"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:V7MX236TZ2S4HLFD5O2F77E7WQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Dual Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Generalized dual decomposition replaces the linear regularizer with a nonlinear one to restore strong duality while keeping parallel subproblem solves in two-stage mixed-integer stochastic programs.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Pengyu Zhang, Ruiwei Jiang","submitted_at":"2026-05-14T02:16:35Z","abstract_excerpt":"We study two-stage stochastic optimization models with mixed-integer decision variables appearing in both stages. For these models, dual decomposition enables parallel computing implementation and can quickly provide a lower bound for the optimal value. However, the lower bound thus obtained is not exact in general due to the lack of strong duality. In this paper, we propose a generalized dual decomposition (GDD) that extends the linear regularizer used in dual decomposition to a general nonlinear one, which still admits parallelization while exhibiting strong duality. By encoding the nonlinea"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we propose a generalized dual decomposition (GDD) that extends the linear regularizer used in dual decomposition to a general nonlinear one, which still admits parallelization while exhibiting strong duality... we establish the convergence of a GDD algorithm to achieve global optimum.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That nonlinear regularizers can be encoded through parameterization and cutting planes in a way that preserves both parallelizability and strong duality without introducing post-hoc data-dependent choices that invalidate the global-optimality guarantee.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Generalized Dual Decomposition replaces linear regularizers with nonlinear ones in dual decomposition to achieve strong duality and global optimality for mixed-integer two-stage stochastic programs while retaining parallelization.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Generalized dual decomposition replaces the linear regularizer with a nonlinear one to restore strong duality while keeping parallel subproblem solves in two-stage mixed-integer stochastic programs.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5e05d054898f1bfd30ab3be7776a9295e04a6479c2db0e5b3f611948c2e684a2"},"source":{"id":"2605.14273","kind":"arxiv","version":1},"verdict":{"id":"e8c54fcf-7a78-490e-b25e-ca7223286593","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:49:21.756687Z","strongest_claim":"we propose a generalized dual decomposition (GDD) that extends the linear regularizer used in dual decomposition to a general nonlinear one, which still admits parallelization while exhibiting strong duality... we establish the convergence of a GDD algorithm to achieve global optimum.","one_line_summary":"Generalized Dual Decomposition replaces linear regularizers with nonlinear ones in dual decomposition to achieve strong duality and global optimality for mixed-integer two-stage stochastic programs while retaining parallelization.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That nonlinear regularizers can be encoded through parameterization and cutting planes in a way that preserves both parallelizability and strong duality without introducing post-hoc data-dependent choices that invalidate the global-optimality guarantee.","pith_extraction_headline":"Generalized dual decomposition replaces the linear regularizer with a nonlinear one to restore strong duality while keeping parallel subproblem solves in two-stage mixed-integer stochastic programs."},"references":{"count":17,"sample":[{"doi":"","year":null,"title":"Defineg ′ i(x) := PN i′=1 fi′(x) N −f i(x),∀i∈[N]","work_id":"906402d9-85f9-4e05-a41a-a0d709a5d1d8","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"inf x∈X lim infh(x) = inf x∈X limϵ→0 inf x′∈X∩B(x,ϵ) h(x′) ≥inf x∈X limϵ→0 (inf x′∈X h(x′)) = inf x∈X h(x)","work_id":"e09e17de-8f94-4dcd-ad95-395a00899b34","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Thus inf x∈X h(x) = infx∈X lim infh(x)","work_id":"1d631f4d-2e90-4422-acc5-d0f58a5ca7b7","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Thus,∥c(x i (r))− ˜xi∗∥ ≤ ∥c(xi (r))−x i (r)∥+∥x i (r) − ˜xi∗∥ ≤ ∥xi (R′) −x i (r)∥+∥x i (r) − ˜xi∗∥ ≤ 2ϵ 3 + ϵ 3 =ϵ. It follows that lim inf r→∞ gi(X t(r),x i (r)) = lim inf r→∞ g∗ i (c(xi (r))) (4) ","work_id":"ae7fdeb9-9a8b-4b86-a6ba-a491da8bd9d6","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Zhang and Jiang:Generalized Dual Decomposition 39","work_id":"13dee3c1-82ff-4475-a687-989a946a2125","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":17,"snapshot_sha256":"d5fe11ab4756564efba4239855135204387af85964107206f2b0988049520adf","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8638753b0ee1312f44314799dc11d1993d330b00b080e3304ae9e6f7ef068c03"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"e8c54fcf-7a78-490e-b25e-ca7223286593"},"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":"LhroDSATYyGltylRmSnJG23pAaLkK6yL3VqFsEeXADLaqrboy1q4vzWA0hhfmAuaXkfesToQhVUuN1TkAha/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:45:44.135511Z"},"content_sha256":"ad48df359845700de84015fdd1c193296b25167bf5307aeca06f6e857fb9b286","schema_version":"1.0","event_id":"sha256:ad48df359845700de84015fdd1c193296b25167bf5307aeca06f6e857fb9b286"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7MX236TZ2S4HLFD5O2F77E7WQ/bundle.json","state_url":"https://pith.science/pith/V7MX236TZ2S4HLFD5O2F77E7WQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7MX236TZ2S4HLFD5O2F77E7WQ/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-21T17:45:44Z","links":{"resolver":"https://pith.science/pith/V7MX236TZ2S4HLFD5O2F77E7WQ","bundle":"https://pith.science/pith/V7MX236TZ2S4HLFD5O2F77E7WQ/bundle.json","state":"https://pith.science/pith/V7MX236TZ2S4HLFD5O2F77E7WQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7MX236TZ2S4HLFD5O2F77E7WQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:V7MX236TZ2S4HLFD5O2F77E7WQ","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":"b55f687bd2df8a52d66940a969abf4edec87815454fc7275e19c9ec8a7a32f4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T02:16:35Z","title_canon_sha256":"fb09c54635444a322876ee09066f21a0a83b1c48b95a93518ac8ed682afc5e89"},"schema_version":"1.0","source":{"id":"2605.14273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14273","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14273v1","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14273","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"V7MX236TZ2S4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"V7MX236TZ2S4HLFD","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"V7MX236T","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:ad48df359845700de84015fdd1c193296b25167bf5307aeca06f6e857fb9b286","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":"we propose a generalized dual decomposition (GDD) that extends the linear regularizer used in dual decomposition to a general nonlinear one, which still admits parallelization while exhibiting strong duality... we establish the convergence of a GDD algorithm to achieve global optimum."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That nonlinear regularizers can be encoded through parameterization and cutting planes in a way that preserves both parallelizability and strong duality without introducing post-hoc data-dependent choices that invalidate the global-optimality guarantee."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Generalized Dual Decomposition replaces linear regularizers with nonlinear ones in dual decomposition to achieve strong duality and global optimality for mixed-integer two-stage stochastic programs while retaining parallelization."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Generalized dual decomposition replaces the linear regularizer with a nonlinear one to restore strong duality while keeping parallel subproblem solves in two-stage mixed-integer stochastic programs."}],"snapshot_sha256":"5e05d054898f1bfd30ab3be7776a9295e04a6479c2db0e5b3f611948c2e684a2"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8638753b0ee1312f44314799dc11d1993d330b00b080e3304ae9e6f7ef068c03"},"paper":{"abstract_excerpt":"We study two-stage stochastic optimization models with mixed-integer decision variables appearing in both stages. For these models, dual decomposition enables parallel computing implementation and can quickly provide a lower bound for the optimal value. However, the lower bound thus obtained is not exact in general due to the lack of strong duality. In this paper, we propose a generalized dual decomposition (GDD) that extends the linear regularizer used in dual decomposition to a general nonlinear one, which still admits parallelization while exhibiting strong duality. By encoding the nonlinea","authors_text":"Pengyu Zhang, Ruiwei Jiang","cross_cats":[],"headline":"Generalized dual decomposition replaces the linear regularizer with a nonlinear one to restore strong duality while keeping parallel subproblem solves in two-stage mixed-integer stochastic programs.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T02:16:35Z","title":"Generalized Dual Decomposition"},"references":{"count":17,"internal_anchors":0,"resolved_work":17,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Defineg ′ i(x) := PN i′=1 fi′(x) N −f i(x),∀i∈[N]","work_id":"906402d9-85f9-4e05-a41a-a0d709a5d1d8","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"inf x∈X lim infh(x) = inf x∈X limϵ→0 inf x′∈X∩B(x,ϵ) h(x′) ≥inf x∈X limϵ→0 (inf x′∈X h(x′)) = inf x∈X h(x)","work_id":"e09e17de-8f94-4dcd-ad95-395a00899b34","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Thus inf x∈X h(x) = infx∈X lim infh(x)","work_id":"1d631f4d-2e90-4422-acc5-d0f58a5ca7b7","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Thus,∥c(x i (r))− ˜xi∗∥ ≤ ∥c(xi (r))−x i (r)∥+∥x i (r) − ˜xi∗∥ ≤ ∥xi (R′) −x i (r)∥+∥x i (r) − ˜xi∗∥ ≤ 2ϵ 3 + ϵ 3 =ϵ. It follows that lim inf r→∞ gi(X t(r),x i (r)) = lim inf r→∞ g∗ i (c(xi (r))) (4) ","work_id":"ae7fdeb9-9a8b-4b86-a6ba-a491da8bd9d6","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Zhang and Jiang:Generalized Dual Decomposition 39","work_id":"13dee3c1-82ff-4475-a687-989a946a2125","year":null}],"snapshot_sha256":"d5fe11ab4756564efba4239855135204387af85964107206f2b0988049520adf"},"source":{"id":"2605.14273","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:49:21.756687Z","id":"e8c54fcf-7a78-490e-b25e-ca7223286593","model_set":{"reader":"grok-4.3"},"one_line_summary":"Generalized Dual Decomposition replaces linear regularizers with nonlinear ones in dual decomposition to achieve strong duality and global optimality for mixed-integer two-stage stochastic programs while retaining parallelization.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Generalized dual decomposition replaces the linear regularizer with a nonlinear one to restore strong duality while keeping parallel subproblem solves in two-stage mixed-integer stochastic programs.","strongest_claim":"we propose a generalized dual decomposition (GDD) that extends the linear regularizer used in dual decomposition to a general nonlinear one, which still admits parallelization while exhibiting strong duality... we establish the convergence of a GDD algorithm to achieve global optimum.","weakest_assumption":"That nonlinear regularizers can be encoded through parameterization and cutting planes in a way that preserves both parallelizability and strong duality without introducing post-hoc data-dependent choices that invalidate the global-optimality guarantee."}},"verdict_id":"e8c54fcf-7a78-490e-b25e-ca7223286593"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8aa1ecdb7ac31c59daaeba2fa7a0e95548052779a4a6cafc688b0f91dde9a142","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":"b55f687bd2df8a52d66940a969abf4edec87815454fc7275e19c9ec8a7a32f4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T02:16:35Z","title_canon_sha256":"fb09c54635444a322876ee09066f21a0a83b1c48b95a93518ac8ed682afc5e89"},"schema_version":"1.0","source":{"id":"2605.14273","kind":"arxiv","version":1}},"canonical_sha256":"afd97d6fd3cea5c3aca3ebb45ffc9fb41ea626c36a7fe48e881312a4daf31d8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afd97d6fd3cea5c3aca3ebb45ffc9fb41ea626c36a7fe48e881312a4daf31d8c","first_computed_at":"2026-05-17T23:39:10.372901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:10.372901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OvgbBS3Dcz2grY+vFHGEZFjYhQpBW8mvnyiT0Dv2644PTBPAtV610THYEmQcag5woCjq7qJ/ziXUrLsaXU2ACQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:10.373413Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8aa1ecdb7ac31c59daaeba2fa7a0e95548052779a4a6cafc688b0f91dde9a142","sha256:ad48df359845700de84015fdd1c193296b25167bf5307aeca06f6e857fb9b286"],"state_sha256":"b595b5effa4fb9a93fc81bc2c2485443bbd13a35bc07a7888964736245c4445f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uv40nC1Ng6UL9/00S2CC2w6anxR4K3gDb4OU5CFT4v39+7jnKkxH62S+GjkWvd92NjlhcpW1UunOM+NX4pwPCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T17:45:44.139345Z","bundle_sha256":"27423aa21b78f09280654a507871ec5453558a503b6ec6260468a842412da600"}}