{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FOWWRGIZC4N5GQYTN3REZ2OQI4","short_pith_number":"pith:FOWWRGIZ","canonical_record":{"source":{"id":"2605.12658","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-12T19:05:14Z","cross_cats_sorted":[],"title_canon_sha256":"0ea198727da8698694d785d7661462098fc7f5049e3a7616a7966f378a75cdc1","abstract_canon_sha256":"47a978c785c92c39d171a8a9d322b0c978525bf8e8bb0a56a24945ffd48608b5"},"schema_version":"1.0"},"canonical_sha256":"2bad689919171bd343136ee24ce9d0470fc673f8355c61f01895f7c11902ea47","source":{"kind":"arxiv","id":"2605.12658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12658","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12658v1","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12658","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"pith_short_12","alias_value":"FOWWRGIZC4N5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"FOWWRGIZC4N5GQYT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"FOWWRGIZ","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FOWWRGIZC4N5GQYTN3REZ2OQI4","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12658","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-12T19:05:14Z","cross_cats_sorted":[],"title_canon_sha256":"0ea198727da8698694d785d7661462098fc7f5049e3a7616a7966f378a75cdc1","abstract_canon_sha256":"47a978c785c92c39d171a8a9d322b0c978525bf8e8bb0a56a24945ffd48608b5"},"schema_version":"1.0"},"canonical_sha256":"2bad689919171bd343136ee24ce9d0470fc673f8355c61f01895f7c11902ea47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:50.590882Z","signature_b64":"0uceDmtJGIveMQI+84lyCSp9GC//YF1Jq6omW8mbXJcb4pt7gPP9+eT9Ae0GwBWqqHI2GhoFtKVlDc0ww21+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bad689919171bd343136ee24ce9d0470fc673f8355c61f01895f7c11902ea47","last_reissued_at":"2026-05-18T03:09:50.590052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:50.590052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12658","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-18T03:09:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCNG+s01TAwmCuQjkkLE4HSjEHuJ+4FIHvOiXxkNcs+7lQjzeUn1nCCiftyKAWp0bJ1wUK6wMXp9Sd2glT9sDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:24:31.627672Z"},"content_sha256":"1b238c315ba2ad2b3d45b9942d46c7179b9ffd18b443824ad4bfd05a32b85d87","schema_version":"1.0","event_id":"sha256:1b238c315ba2ad2b3d45b9942d46c7179b9ffd18b443824ad4bfd05a32b85d87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FOWWRGIZC4N5GQYTN3REZ2OQI4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiconic Optimization for Symmetric Cones and Hyperbolic Coupling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A new interior-point algorithm using hyperbolic coupling solves multiconic optimization over symmetric cones with complexity matching linear programming.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marianna E.-Nagy, Petra Ren\\'ata Rig\\'o, Yurii Nesterov","submitted_at":"2026-05-12T19:05:14Z","abstract_excerpt":"We develop a new interior-point algorithm for solving multiconic optimization problems using the parabolic target space approach. The feasible cone in these problems is composed as a direct product of many small-dimensional cones. Our approach is based on a new concept, called the hyperbolic coupling. This provides a new framework that has an advantage of interdependent pairs of primal-dual variables. In this way, their behaviour is much more controllable. We justify all main steps in the complexity analysis of the algorithm and prove that the overall complexity of solving this type of large-s"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We justify all main steps in the complexity analysis of the algorithm and prove that the overall complexity of solving this type of large-scale nonlinear problems by our algorithm is comparable with the best known complexity for solving linear programming problems of the same dimension.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The hyperbolic coupling provides a controllable framework for interdependent primal-dual pairs that enables the claimed complexity analysis without hidden gaps or additional assumptions on cone dimensions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A new interior-point method for multiconic problems achieves LP-level complexity through hyperbolic coupling of primal-dual variables in a parabolic target space.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A new interior-point algorithm using hyperbolic coupling solves multiconic optimization over symmetric cones with complexity matching linear programming.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b3d68c206c0261b9585f96e54a6a6f525880e17ef443ceae4c300294ffda7603"},"source":{"id":"2605.12658","kind":"arxiv","version":1},"verdict":{"id":"f1228005-0bb4-4986-b77d-705913a50b2a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T20:33:03.805864Z","strongest_claim":"We justify all main steps in the complexity analysis of the algorithm and prove that the overall complexity of solving this type of large-scale nonlinear problems by our algorithm is comparable with the best known complexity for solving linear programming problems of the same dimension.","one_line_summary":"A new interior-point method for multiconic problems achieves LP-level complexity through hyperbolic coupling of primal-dual variables in a parabolic target space.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The hyperbolic coupling provides a controllable framework for interdependent primal-dual pairs that enables the claimed complexity analysis without hidden gaps or additional assumptions on cone dimensions.","pith_extraction_headline":"A new interior-point algorithm using hyperbolic coupling solves multiconic optimization over symmetric cones with complexity matching linear programming."},"references":{"count":20,"sample":[{"doi":"","year":2020,"title":"S. Asadi, N. Mahdavi-Amiri, Z. Darvay, and P. R. Rig´ o. Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asym","work_id":"67a066f6-08d7-4bfa-90b4-7aa4f9ed139b","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"S. Asadi, H. Mansouri, Z. Darvay, and M. Zangiabadi. On theP ∗(κ) horizontal linear com- plementarity problems over Cartesian product of symmetric cones.Optim. Methods Softw., 31(2):233–257, 2016","work_id":"415fd8e8-c1bf-430d-bfc5-abe317e3f42b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2031,"title":"S. Asadi, H. Mansouri, G. Lesaja, and M. Zangiabadi. A long-step interior-point algorithm for symmetric cone CartesianP ∗(κ)-HLCP.Optimization, 67(11):2031–2060, 2018","work_id":"54c78bf5-bf72-4cfd-acc9-24ad6deacb40","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/s10107-025-02260-x","year":2025,"title":"M. E.-Nagy, T. Ill´ es, Yu. Nesterov, and P.R. Rig´ o. Parabolic target space interior-point algorithms for weighted monotone linear complementarity problem.Math. Program., 2025. https://doi.org/10.10","work_id":"da6fcf47-9345-4741-9da5-4e884e9ea2d4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"M. E.-Nagy, T. Ill´ es, Yu. Nesterov, and P.R. Rig´ o. New interior-point algorithm for linear op- timization based on a universal tangent direction.SIAM J. Optim., 36(1):185–203, 2026","work_id":"4d10f41b-ff29-4837-9a6e-6e5315d29480","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":20,"snapshot_sha256":"63c1c719cf3ce9a23ea8aefc5a14bba5bae030db295a3111270e1254e19a7567","internal_anchors":0},"formal_canon":{"evidence_count":3,"snapshot_sha256":"993c8ff771325926884f22e11d59358720c1f1526907be9a96e1d4ea73fd0777"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"f1228005-0bb4-4986-b77d-705913a50b2a"},"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:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQKddgN1a95yiQHYxfW2J7f716bFm/vQprsFgwIpp0FVnw0kSjqQL+HfXCqDueNZpPwy7WxcIiBt3Nhoe8W2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:24:31.628926Z"},"content_sha256":"4755d6929410976bab30450a4c0bdf4340cfb782dab937ccfaedd5140eae5936","schema_version":"1.0","event_id":"sha256:4755d6929410976bab30450a4c0bdf4340cfb782dab937ccfaedd5140eae5936"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOWWRGIZC4N5GQYTN3REZ2OQI4/bundle.json","state_url":"https://pith.science/pith/FOWWRGIZC4N5GQYTN3REZ2OQI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOWWRGIZC4N5GQYTN3REZ2OQI4/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-27T12:24:31Z","links":{"resolver":"https://pith.science/pith/FOWWRGIZC4N5GQYTN3REZ2OQI4","bundle":"https://pith.science/pith/FOWWRGIZC4N5GQYTN3REZ2OQI4/bundle.json","state":"https://pith.science/pith/FOWWRGIZC4N5GQYTN3REZ2OQI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOWWRGIZC4N5GQYTN3REZ2OQI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FOWWRGIZC4N5GQYTN3REZ2OQI4","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":"47a978c785c92c39d171a8a9d322b0c978525bf8e8bb0a56a24945ffd48608b5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-12T19:05:14Z","title_canon_sha256":"0ea198727da8698694d785d7661462098fc7f5049e3a7616a7966f378a75cdc1"},"schema_version":"1.0","source":{"id":"2605.12658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12658","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12658v1","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12658","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"pith_short_12","alias_value":"FOWWRGIZC4N5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"FOWWRGIZC4N5GQYT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"FOWWRGIZ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:4755d6929410976bab30450a4c0bdf4340cfb782dab937ccfaedd5140eae5936","target":"graph","created_at":"2026-05-18T03:09:50Z","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 justify all main steps in the complexity analysis of the algorithm and prove that the overall complexity of solving this type of large-scale nonlinear problems by our algorithm is comparable with the best known complexity for solving linear programming problems of the same dimension."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The hyperbolic coupling provides a controllable framework for interdependent primal-dual pairs that enables the claimed complexity analysis without hidden gaps or additional assumptions on cone dimensions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A new interior-point method for multiconic problems achieves LP-level complexity through hyperbolic coupling of primal-dual variables in a parabolic target space."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A new interior-point algorithm using hyperbolic coupling solves multiconic optimization over symmetric cones with complexity matching linear programming."}],"snapshot_sha256":"b3d68c206c0261b9585f96e54a6a6f525880e17ef443ceae4c300294ffda7603"},"formal_canon":{"evidence_count":3,"snapshot_sha256":"993c8ff771325926884f22e11d59358720c1f1526907be9a96e1d4ea73fd0777"},"paper":{"abstract_excerpt":"We develop a new interior-point algorithm for solving multiconic optimization problems using the parabolic target space approach. The feasible cone in these problems is composed as a direct product of many small-dimensional cones. Our approach is based on a new concept, called the hyperbolic coupling. This provides a new framework that has an advantage of interdependent pairs of primal-dual variables. In this way, their behaviour is much more controllable. We justify all main steps in the complexity analysis of the algorithm and prove that the overall complexity of solving this type of large-s","authors_text":"Marianna E.-Nagy, Petra Ren\\'ata Rig\\'o, Yurii Nesterov","cross_cats":[],"headline":"A new interior-point algorithm using hyperbolic coupling solves multiconic optimization over symmetric cones with complexity matching linear programming.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-12T19:05:14Z","title":"Multiconic Optimization for Symmetric Cones and Hyperbolic Coupling"},"references":{"count":20,"internal_anchors":0,"resolved_work":20,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"S. Asadi, N. Mahdavi-Amiri, Z. Darvay, and P. R. Rig´ o. Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asym","work_id":"67a066f6-08d7-4bfa-90b4-7aa4f9ed139b","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"S. Asadi, H. Mansouri, Z. Darvay, and M. Zangiabadi. On theP ∗(κ) horizontal linear com- plementarity problems over Cartesian product of symmetric cones.Optim. Methods Softw., 31(2):233–257, 2016","work_id":"415fd8e8-c1bf-430d-bfc5-abe317e3f42b","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"S. Asadi, H. Mansouri, G. Lesaja, and M. Zangiabadi. A long-step interior-point algorithm for symmetric cone CartesianP ∗(κ)-HLCP.Optimization, 67(11):2031–2060, 2018","work_id":"54c78bf5-bf72-4cfd-acc9-24ad6deacb40","year":2031},{"cited_arxiv_id":"","doi":"10.1007/s10107-025-02260-x","is_internal_anchor":false,"ref_index":4,"title":"M. E.-Nagy, T. Ill´ es, Yu. Nesterov, and P.R. Rig´ o. Parabolic target space interior-point algorithms for weighted monotone linear complementarity problem.Math. Program., 2025. https://doi.org/10.10","work_id":"da6fcf47-9345-4741-9da5-4e884e9ea2d4","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"M. E.-Nagy, T. Ill´ es, Yu. Nesterov, and P.R. Rig´ o. New interior-point algorithm for linear op- timization based on a universal tangent direction.SIAM J. Optim., 36(1):185–203, 2026","work_id":"4d10f41b-ff29-4837-9a6e-6e5315d29480","year":2026}],"snapshot_sha256":"63c1c719cf3ce9a23ea8aefc5a14bba5bae030db295a3111270e1254e19a7567"},"source":{"id":"2605.12658","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T20:33:03.805864Z","id":"f1228005-0bb4-4986-b77d-705913a50b2a","model_set":{"reader":"grok-4.3"},"one_line_summary":"A new interior-point method for multiconic problems achieves LP-level complexity through hyperbolic coupling of primal-dual variables in a parabolic target space.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A new interior-point algorithm using hyperbolic coupling solves multiconic optimization over symmetric cones with complexity matching linear programming.","strongest_claim":"We justify all main steps in the complexity analysis of the algorithm and prove that the overall complexity of solving this type of large-scale nonlinear problems by our algorithm is comparable with the best known complexity for solving linear programming problems of the same dimension.","weakest_assumption":"The hyperbolic coupling provides a controllable framework for interdependent primal-dual pairs that enables the claimed complexity analysis without hidden gaps or additional assumptions on cone dimensions."}},"verdict_id":"f1228005-0bb4-4986-b77d-705913a50b2a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1b238c315ba2ad2b3d45b9942d46c7179b9ffd18b443824ad4bfd05a32b85d87","target":"record","created_at":"2026-05-18T03:09:50Z","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":"47a978c785c92c39d171a8a9d322b0c978525bf8e8bb0a56a24945ffd48608b5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-12T19:05:14Z","title_canon_sha256":"0ea198727da8698694d785d7661462098fc7f5049e3a7616a7966f378a75cdc1"},"schema_version":"1.0","source":{"id":"2605.12658","kind":"arxiv","version":1}},"canonical_sha256":"2bad689919171bd343136ee24ce9d0470fc673f8355c61f01895f7c11902ea47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bad689919171bd343136ee24ce9d0470fc673f8355c61f01895f7c11902ea47","first_computed_at":"2026-05-18T03:09:50.590052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:50.590052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0uceDmtJGIveMQI+84lyCSp9GC//YF1Jq6omW8mbXJcb4pt7gPP9+eT9Ae0GwBWqqHI2GhoFtKVlDc0ww21+DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:50.590882Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b238c315ba2ad2b3d45b9942d46c7179b9ffd18b443824ad4bfd05a32b85d87","sha256:4755d6929410976bab30450a4c0bdf4340cfb782dab937ccfaedd5140eae5936"],"state_sha256":"ea080f932a494bf114fa3e6239e70193f812e9d9a2b5e6165d84c4251b6d76a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DeBZEp5abpWlKOiQ8oCVJudHh09xZkgtQu4wmuPkQaCwo5w90rbSZvNPV13fR3U12rpOs8EyWLdIU3F0kQkyCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:24:31.633537Z","bundle_sha256":"79bdee9ba31be58b6b959f076e17dfc35f8b37b5e96cb1d384e9ea97242403ce"}}