{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:N56PKYT7743JGCVVYLPMU23V3O","short_pith_number":"pith:N56PKYT7","canonical_record":{"source":{"id":"2512.10366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-12-11T07:31:09Z","cross_cats_sorted":[],"title_canon_sha256":"2ee6f86678f21abdd1a61d210d1b581b22df302b60ed8042fb2f543f93aa3a1a","abstract_canon_sha256":"1dbf514ddd1edeeb0d0ad1608b4a2e86e73a15e7c956a5e47897f5b01b3c0530"},"schema_version":"1.0"},"canonical_sha256":"6f7cf5627fff36930ab5c2deca6b75dbbbe8bb3996d617477fbffdebb2d8c5fe","source":{"kind":"arxiv","id":"2512.10366","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.10366","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"2512.10366v2","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.10366","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"N56PKYT7743J","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"N56PKYT7743JGCVV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"N56PKYT7","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:N56PKYT7743JGCVVYLPMU23V3O","target":"record","payload":{"canonical_record":{"source":{"id":"2512.10366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-12-11T07:31:09Z","cross_cats_sorted":[],"title_canon_sha256":"2ee6f86678f21abdd1a61d210d1b581b22df302b60ed8042fb2f543f93aa3a1a","abstract_canon_sha256":"1dbf514ddd1edeeb0d0ad1608b4a2e86e73a15e7c956a5e47897f5b01b3c0530"},"schema_version":"1.0"},"canonical_sha256":"6f7cf5627fff36930ab5c2deca6b75dbbbe8bb3996d617477fbffdebb2d8c5fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:32.712739Z","signature_b64":"whUH2istdKv0m9Q09H/p3SHUwTRZQup0dzrp+Y7pJK0/2kQAblhisBY4sicrtHI24VoXkB61Aca6/vWTu8IXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f7cf5627fff36930ab5c2deca6b75dbbbe8bb3996d617477fbffdebb2d8c5fe","last_reissued_at":"2026-05-18T03:09:32.712226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:32.712226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2512.10366","source_version":2,"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:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7vLD72pnC1/nZNAwv633Wsnd07UY5QxZNAAE+TjTaa5Z+qyfOTs9PRxNmSsdjw9NqKWCjUdax/VuJMHl0EY4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:02:48.586277Z"},"content_sha256":"79572a7b21c805eb3e7c36fccaf711a7fdfdcb55dd56428f28cee37cdffc726c","schema_version":"1.0","event_id":"sha256:79572a7b21c805eb3e7c36fccaf711a7fdfdcb55dd56428f28cee37cdffc726c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:N56PKYT7743JGCVVYLPMU23V3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Primal-dual splitting for structured composite monotone inclusions with or without cocoercivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A primal-dual splitting algorithm solves structured monotone inclusions without requiring cocoercivity on single-valued operators.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hung M. Phan, Matthew K. Tam, Minh N. Dao, Thang D. Truong","submitted_at":"2025-12-11T07:31:09Z","abstract_excerpt":"In this paper, we propose a primal-dual splitting algorithm for a broad class of structured composite monotone inclusions that involve finitely many set-valued operators, compositions of set-valued operators with bounded linear operators, and single-valued operators possibly without cocoercivity. The proposed algorithm is not only a unification for several contemporary algorithms but also a blueprint to generate new algorithms with graph-based structures using a single transparent convergence analysis. Our approach reduces dimensionality compared with the standard product space technique, whic"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The proposed algorithm is not only a unification for several contemporary algorithms but also a blueprint to generate new algorithms with graph-based structures using a single transparent convergence analysis. It reduces dimensionality compared with the standard product space technique and yields a larger allowable stepsize range than recent methods.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The set-valued operators are monotone (typically maximally monotone), the linear operators are bounded, and the algorithm parameters (stepsizes and resolvent parameters) can be chosen to satisfy the stated inequalities that guarantee convergence even when single-valued operators lack cocoercivity.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A new primal-dual splitting algorithm unifies methods for monotone inclusions, handles non-cocoercive operators, reduces dimensionality, and allows larger stepsizes via a single convergence analysis.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A primal-dual splitting algorithm solves structured monotone inclusions without requiring cocoercivity on single-valued operators.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f762593c5087968d79abe26c60bbb0d7bacc8a4084863dd2b7c56ede4c842a1c"},"source":{"id":"2512.10366","kind":"arxiv","version":2},"verdict":{"id":"0c076bf8-ea1d-41ac-8567-54d10261ab9a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T23:43:45.236999Z","strongest_claim":"The proposed algorithm is not only a unification for several contemporary algorithms but also a blueprint to generate new algorithms with graph-based structures using a single transparent convergence analysis. It reduces dimensionality compared with the standard product space technique and yields a larger allowable stepsize range than recent methods.","one_line_summary":"A new primal-dual splitting algorithm unifies methods for monotone inclusions, handles non-cocoercive operators, reduces dimensionality, and allows larger stepsizes via a single convergence analysis.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The set-valued operators are monotone (typically maximally monotone), the linear operators are bounded, and the algorithm parameters (stepsizes and resolvent parameters) can be chosen to satisfy the stated inequalities that guarantee convergence even when single-valued operators lack cocoercivity.","pith_extraction_headline":"A primal-dual splitting algorithm solves structured monotone inclusions without requiring cocoercivity on single-valued operators."},"references":{"count":33,"sample":[{"doi":"","year":null,"title":"A. Åkerman, E. Chenchene, P. Giselsson, and E. Naldi, Splitting the forward-backward algo- rithm: A full characterization, arXiv:2504.10999","work_id":"980b1a5f-8c97-405d-9b6e-ad1b01451f5f","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"F.J. Aragón-Artacho, R.I. Boţ, and D. Torregrosa-Belén, A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting,Numer. Algorithms93, 103–130 (2023)","work_id":"2931ab74-a4b0-4b65-95b8-00a5dd7c6dbd","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"F.J. Aragón-Artacho, R. Campoy, and C. López-Pastor, Forward-backward algorithms devised by graphs,SIAM J. Optim.35(4), 2423–2451 (2025)","work_id":"0b656eaf-c0cc-4851-8dec-5e16f34255f8","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"F.J. Aragón-Artacho, Y. Malitsky, M.K. Tam, and D. Torregrose-Belén, Distributed forward- backward methods for ring networks,Comput Optim Appl.86, 845–870 (2023)","work_id":"b6364ec5-b018-4fb9-8e7c-28c60923be29","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1996,"title":"H. Attouch and M. Théra, A general duality principle for the sum of two operators,J. Convex Anal.3, 1–24 (1996)","work_id":"1ea4e09c-74f9-4724-acb8-768983d4977f","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":33,"snapshot_sha256":"8745082a8873ddbe9a6d906252448f680934becaf61d011a10896c9acc125638","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":"0c076bf8-ea1d-41ac-8567-54d10261ab9a"},"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:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YS0+ji+XR9yOkDeP4/skrSZ3kYq3lWGUi8hdL+PZLrmOoSRapiYYl1MxJz6rsCP2P8JXPd+InbRmPr1g0r97CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:02:48.587522Z"},"content_sha256":"4b28e69b2fde830b3ae1c1a3381a9206e9cad3d6170600c92f623dfcc2cdea25","schema_version":"1.0","event_id":"sha256:4b28e69b2fde830b3ae1c1a3381a9206e9cad3d6170600c92f623dfcc2cdea25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N56PKYT7743JGCVVYLPMU23V3O/bundle.json","state_url":"https://pith.science/pith/N56PKYT7743JGCVVYLPMU23V3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N56PKYT7743JGCVVYLPMU23V3O/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-06-09T08:02:48Z","links":{"resolver":"https://pith.science/pith/N56PKYT7743JGCVVYLPMU23V3O","bundle":"https://pith.science/pith/N56PKYT7743JGCVVYLPMU23V3O/bundle.json","state":"https://pith.science/pith/N56PKYT7743JGCVVYLPMU23V3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N56PKYT7743JGCVVYLPMU23V3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:N56PKYT7743JGCVVYLPMU23V3O","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":"1dbf514ddd1edeeb0d0ad1608b4a2e86e73a15e7c956a5e47897f5b01b3c0530","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-12-11T07:31:09Z","title_canon_sha256":"2ee6f86678f21abdd1a61d210d1b581b22df302b60ed8042fb2f543f93aa3a1a"},"schema_version":"1.0","source":{"id":"2512.10366","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.10366","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"2512.10366v2","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.10366","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"N56PKYT7743J","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"N56PKYT7743JGCVV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"N56PKYT7","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:4b28e69b2fde830b3ae1c1a3381a9206e9cad3d6170600c92f623dfcc2cdea25","target":"graph","created_at":"2026-05-18T03:09:32Z","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 proposed algorithm is not only a unification for several contemporary algorithms but also a blueprint to generate new algorithms with graph-based structures using a single transparent convergence analysis. It reduces dimensionality compared with the standard product space technique and yields a larger allowable stepsize range than recent methods."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The set-valued operators are monotone (typically maximally monotone), the linear operators are bounded, and the algorithm parameters (stepsizes and resolvent parameters) can be chosen to satisfy the stated inequalities that guarantee convergence even when single-valued operators lack cocoercivity."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A new primal-dual splitting algorithm unifies methods for monotone inclusions, handles non-cocoercive operators, reduces dimensionality, and allows larger stepsizes via a single convergence analysis."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A primal-dual splitting algorithm solves structured monotone inclusions without requiring cocoercivity on single-valued operators."}],"snapshot_sha256":"f762593c5087968d79abe26c60bbb0d7bacc8a4084863dd2b7c56ede4c842a1c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we propose a primal-dual splitting algorithm for a broad class of structured composite monotone inclusions that involve finitely many set-valued operators, compositions of set-valued operators with bounded linear operators, and single-valued operators possibly without cocoercivity. The proposed algorithm is not only a unification for several contemporary algorithms but also a blueprint to generate new algorithms with graph-based structures using a single transparent convergence analysis. Our approach reduces dimensionality compared with the standard product space technique, whic","authors_text":"Hung M. Phan, Matthew K. Tam, Minh N. Dao, Thang D. Truong","cross_cats":[],"headline":"A primal-dual splitting algorithm solves structured monotone inclusions without requiring cocoercivity on single-valued operators.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-12-11T07:31:09Z","title":"Primal-dual splitting for structured composite monotone inclusions with or without cocoercivity"},"references":{"count":33,"internal_anchors":1,"resolved_work":33,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A. Åkerman, E. Chenchene, P. Giselsson, and E. Naldi, Splitting the forward-backward algo- rithm: A full characterization, arXiv:2504.10999","work_id":"980b1a5f-8c97-405d-9b6e-ad1b01451f5f","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"F.J. Aragón-Artacho, R.I. Boţ, and D. Torregrosa-Belén, A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting,Numer. Algorithms93, 103–130 (2023)","work_id":"2931ab74-a4b0-4b65-95b8-00a5dd7c6dbd","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"F.J. Aragón-Artacho, R. Campoy, and C. López-Pastor, Forward-backward algorithms devised by graphs,SIAM J. Optim.35(4), 2423–2451 (2025)","work_id":"0b656eaf-c0cc-4851-8dec-5e16f34255f8","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"F.J. Aragón-Artacho, Y. Malitsky, M.K. Tam, and D. Torregrose-Belén, Distributed forward- backward methods for ring networks,Comput Optim Appl.86, 845–870 (2023)","work_id":"b6364ec5-b018-4fb9-8e7c-28c60923be29","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"H. Attouch and M. Théra, A general duality principle for the sum of two operators,J. Convex Anal.3, 1–24 (1996)","work_id":"1ea4e09c-74f9-4724-acb8-768983d4977f","year":1996}],"snapshot_sha256":"8745082a8873ddbe9a6d906252448f680934becaf61d011a10896c9acc125638"},"source":{"id":"2512.10366","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T23:43:45.236999Z","id":"0c076bf8-ea1d-41ac-8567-54d10261ab9a","model_set":{"reader":"grok-4.3"},"one_line_summary":"A new primal-dual splitting algorithm unifies methods for monotone inclusions, handles non-cocoercive operators, reduces dimensionality, and allows larger stepsizes via a single convergence analysis.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A primal-dual splitting algorithm solves structured monotone inclusions without requiring cocoercivity on single-valued operators.","strongest_claim":"The proposed algorithm is not only a unification for several contemporary algorithms but also a blueprint to generate new algorithms with graph-based structures using a single transparent convergence analysis. It reduces dimensionality compared with the standard product space technique and yields a larger allowable stepsize range than recent methods.","weakest_assumption":"The set-valued operators are monotone (typically maximally monotone), the linear operators are bounded, and the algorithm parameters (stepsizes and resolvent parameters) can be chosen to satisfy the stated inequalities that guarantee convergence even when single-valued operators lack cocoercivity."}},"verdict_id":"0c076bf8-ea1d-41ac-8567-54d10261ab9a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:79572a7b21c805eb3e7c36fccaf711a7fdfdcb55dd56428f28cee37cdffc726c","target":"record","created_at":"2026-05-18T03:09:32Z","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":"1dbf514ddd1edeeb0d0ad1608b4a2e86e73a15e7c956a5e47897f5b01b3c0530","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-12-11T07:31:09Z","title_canon_sha256":"2ee6f86678f21abdd1a61d210d1b581b22df302b60ed8042fb2f543f93aa3a1a"},"schema_version":"1.0","source":{"id":"2512.10366","kind":"arxiv","version":2}},"canonical_sha256":"6f7cf5627fff36930ab5c2deca6b75dbbbe8bb3996d617477fbffdebb2d8c5fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f7cf5627fff36930ab5c2deca6b75dbbbe8bb3996d617477fbffdebb2d8c5fe","first_computed_at":"2026-05-18T03:09:32.712226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:32.712226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"whUH2istdKv0m9Q09H/p3SHUwTRZQup0dzrp+Y7pJK0/2kQAblhisBY4sicrtHI24VoXkB61Aca6/vWTu8IXBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:32.712739Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.10366","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79572a7b21c805eb3e7c36fccaf711a7fdfdcb55dd56428f28cee37cdffc726c","sha256:4b28e69b2fde830b3ae1c1a3381a9206e9cad3d6170600c92f623dfcc2cdea25"],"state_sha256":"47c0be669448ef8a14bb09a1058caddcee49dde7462dd5b2e2b55d99f883df3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"okpYn5dfRHrNlDGHNQgsoEvpmIcBQSlI9DbmzzP+7Mxh/SZkYA1rwgimjN0NQBhD6wIM5/xTdbjd0Tj5dqEZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:02:48.592161Z","bundle_sha256":"0ec740a748f1357c56827f28fd43131b1cd5fbd1cf28cc122674d40438cbc712"}}