{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PAMN7CEN4L77QHYLKYDXKY7EJA","short_pith_number":"pith:PAMN7CEN","canonical_record":{"source":{"id":"2605.14428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-14T06:19:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"743d7b221a935709ce8f8cfb67302c1eda5b538bf470f57d87828c0003839287","abstract_canon_sha256":"b7f4e11a10bba13fc6b6bb3f43f7fd9c6fa38975a53f388d654bdfed7f7af182"},"schema_version":"1.0"},"canonical_sha256":"7818df888de2fff81f0b56077563e44803a03f94f442e280d4371793bd0acb38","source":{"kind":"arxiv","id":"2605.14428","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14428","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14428v1","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14428","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"PAMN7CEN4L77","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"PAMN7CEN4L77QHYL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"PAMN7CEN","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PAMN7CEN4L77QHYLKYDXKY7EJA","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-14T06:19:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"743d7b221a935709ce8f8cfb67302c1eda5b538bf470f57d87828c0003839287","abstract_canon_sha256":"b7f4e11a10bba13fc6b6bb3f43f7fd9c6fa38975a53f388d654bdfed7f7af182"},"schema_version":"1.0"},"canonical_sha256":"7818df888de2fff81f0b56077563e44803a03f94f442e280d4371793bd0acb38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:07.168625Z","signature_b64":"53DNU9Hrcn3c8OBeWD0icv0jOQe7MIr9EK/OzSbpc+6+vMOCtKrmKshbZnfhmMyC1O9dWmtld2F2U+p7VT/vCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7818df888de2fff81f0b56077563e44803a03f94f442e280d4371793bd0acb38","last_reissued_at":"2026-05-17T23:39:07.167883Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:07.167883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14428","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:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFmnJK2liuyKeBNL/mCJ0hKbALMnU6vGsaHNMuqSv+83KRWrF8X4ipfFYcBtw7e7uKoL/HVabblZ00tUsg3ZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:48:16.069803Z"},"content_sha256":"5346cc87add8126d76e7567069a9f7b438553624cf5990207ac1a4e7cb0c1ffb","schema_version":"1.0","event_id":"sha256:5346cc87add8126d76e7567069a9f7b438553624cf5990207ac1a4e7cb0c1ffb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PAMN7CEN4L77QHYLKYDXKY7EJA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Branch-width of represented matroids in matrix multiplication time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A matroid given by an n by n matrix over a finite field has a branch-decomposition of width at most k found in O(n²) time plus one matrix multiplication, or the algorithm reports that branch-width exceeds k.","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Mujin Choi, Sang-il Oum, Tuukka Korhonen","submitted_at":"2026-05-14T06:19:53Z","abstract_excerpt":"For an $n$-element matroid $M$ given by an $n \\times n$ matrix representation over a finite field $\\mathbb F$ and an integer $k$, we present an $(O_{k,\\mathbb F}(n^2)+O(n^\\omega))$-time algorithm that either finds a branch-decomposition of $M$ of width at most $k$, or confirms that the branch-width of $M$ is more than $k$, where $\\omega < 2.3714$ is the matrix multiplication exponent, and the $O_{k,\\mathbb F}(\\cdot)$-notation hides factors that depend on $k$ and $\\mathbb F$ in a computable manner. All previous algorithms including Hlin\\v{e}n\\'y and Oum [SIAM J. Comput. (2008)] and Jeong, Kim, "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For an n-element matroid M given by an n × n matrix representation over a finite field F and an integer k, we present an (O_{k,F}(n²)+O(n^ω))-time algorithm that either finds a branch-decomposition of M of width at most k, or confirms that the branch-width of M is more than k.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The input matroid is supplied as a matrix representation over a finite field F; the algorithm's hidden factors that depend on k and F are computable, and the overhead of converting to standard form is accounted for when the matrix is not already in that form.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"O(n² + n^ω)-time algorithm decides if branch-width of a matrix-represented matroid over a finite field is at most k.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A matroid given by an n by n matrix over a finite field has a branch-decomposition of width at most k found in O(n²) time plus one matrix multiplication, or the algorithm reports that branch-width exceeds k.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"82238c72c1a35c93b378baf7d72b579a7e77bcff8ffba9be5bc5988b70a410be"},"source":{"id":"2605.14428","kind":"arxiv","version":1},"verdict":{"id":"e7344d5a-9e34-4e59-b693-e8c0aeb037f3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:10:41.184580Z","strongest_claim":"For an n-element matroid M given by an n × n matrix representation over a finite field F and an integer k, we present an (O_{k,F}(n²)+O(n^ω))-time algorithm that either finds a branch-decomposition of M of width at most k, or confirms that the branch-width of M is more than k.","one_line_summary":"O(n² + n^ω)-time algorithm decides if branch-width of a matrix-represented matroid over a finite field is at most k.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The input matroid is supplied as a matrix representation over a finite field F; the algorithm's hidden factors that depend on k and F are computable, and the overhead of converting to standard form is accounted for when the matrix is not already in that form.","pith_extraction_headline":"A matroid given by an n by n matrix over a finite field has a branch-decomposition of width at most k found in O(n²) time plus one matrix multiplication, or the algorithm reports that branch-width exceeds k."},"references":{"count":24,"sample":[{"doi":"","year":2025,"title":"Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, and Renfei Zhou, More asymmetry yields faster matrix multiplication , Proceedings of the 2025 Annual ACM-SIAM Symposium on D","work_id":"18e4ac5d-932c-4976-b76a-0a51dd7daadc","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1996,"title":"Hans L. Bodlaender and Ton Kloks, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, J. Algorithms 21 (1996), no. 2, 358–402. MR 98g:68122 27","work_id":"ba12edc2-b80f-4ea0-817a-3181d9be3418","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1974,"title":"Bunch and John E","work_id":"99e4b3aa-36c7-47ca-8096-47203d78bf5a","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1990,"title":"Bruno Courcelle, The monadic second-order logic of graphs I: Recognizable sets of finite graphs , Inform. and Comput. 85 (1990), no. 1, 12–75. MR 91g:05107","work_id":"8c7cd507-89ff-4a11-bb8d-950d73f93adf","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"138, Cambridge University Press, Cam- bridge, 2012","work_id":"0e78156c-f856-44b0-b617-5ee5ac7f89fa","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":24,"snapshot_sha256":"5e82240e5d05514ddf012d38e448e8cc2281a60dd018705b37e95ca9c5406a0b","internal_anchors":0},"formal_canon":{"evidence_count":3,"snapshot_sha256":"38d655cb42d60aaa3bef112e2594cb916e93aecf3d2dff7f6fbbafb4052609d6"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"e7344d5a-9e34-4e59-b693-e8c0aeb037f3"},"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:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t8rtcEyo/vmVd5NWjEtCOpQst4qsmymihULilgoKKlGIDqn2FGl+dS28JWJ/pVe4Qwhr7oqEvbbiLbzApgSoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:48:16.071009Z"},"content_sha256":"33373a4af94ab58be9a6ca8aacc42569ce6361253430d7fcb53c61217fac7de6","schema_version":"1.0","event_id":"sha256:33373a4af94ab58be9a6ca8aacc42569ce6361253430d7fcb53c61217fac7de6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PAMN7CEN4L77QHYLKYDXKY7EJA/bundle.json","state_url":"https://pith.science/pith/PAMN7CEN4L77QHYLKYDXKY7EJA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PAMN7CEN4L77QHYLKYDXKY7EJA/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-31T19:48:16Z","links":{"resolver":"https://pith.science/pith/PAMN7CEN4L77QHYLKYDXKY7EJA","bundle":"https://pith.science/pith/PAMN7CEN4L77QHYLKYDXKY7EJA/bundle.json","state":"https://pith.science/pith/PAMN7CEN4L77QHYLKYDXKY7EJA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PAMN7CEN4L77QHYLKYDXKY7EJA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PAMN7CEN4L77QHYLKYDXKY7EJA","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":"b7f4e11a10bba13fc6b6bb3f43f7fd9c6fa38975a53f388d654bdfed7f7af182","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-14T06:19:53Z","title_canon_sha256":"743d7b221a935709ce8f8cfb67302c1eda5b538bf470f57d87828c0003839287"},"schema_version":"1.0","source":{"id":"2605.14428","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14428","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14428v1","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14428","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"PAMN7CEN4L77","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"PAMN7CEN4L77QHYL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"PAMN7CEN","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:33373a4af94ab58be9a6ca8aacc42569ce6361253430d7fcb53c61217fac7de6","target":"graph","created_at":"2026-05-17T23:39:07Z","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":"For an n-element matroid M given by an n × n matrix representation over a finite field F and an integer k, we present an (O_{k,F}(n²)+O(n^ω))-time algorithm that either finds a branch-decomposition of M of width at most k, or confirms that the branch-width of M is more than k."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The input matroid is supplied as a matrix representation over a finite field F; the algorithm's hidden factors that depend on k and F are computable, and the overhead of converting to standard form is accounted for when the matrix is not already in that form."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"O(n² + n^ω)-time algorithm decides if branch-width of a matrix-represented matroid over a finite field is at most k."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A matroid given by an n by n matrix over a finite field has a branch-decomposition of width at most k found in O(n²) time plus one matrix multiplication, or the algorithm reports that branch-width exceeds k."}],"snapshot_sha256":"82238c72c1a35c93b378baf7d72b579a7e77bcff8ffba9be5bc5988b70a410be"},"formal_canon":{"evidence_count":3,"snapshot_sha256":"38d655cb42d60aaa3bef112e2594cb916e93aecf3d2dff7f6fbbafb4052609d6"},"paper":{"abstract_excerpt":"For an $n$-element matroid $M$ given by an $n \\times n$ matrix representation over a finite field $\\mathbb F$ and an integer $k$, we present an $(O_{k,\\mathbb F}(n^2)+O(n^\\omega))$-time algorithm that either finds a branch-decomposition of $M$ of width at most $k$, or confirms that the branch-width of $M$ is more than $k$, where $\\omega < 2.3714$ is the matrix multiplication exponent, and the $O_{k,\\mathbb F}(\\cdot)$-notation hides factors that depend on $k$ and $\\mathbb F$ in a computable manner. All previous algorithms including Hlin\\v{e}n\\'y and Oum [SIAM J. Comput. (2008)] and Jeong, Kim, ","authors_text":"Mujin Choi, Sang-il Oum, Tuukka Korhonen","cross_cats":["math.CO"],"headline":"A matroid given by an n by n matrix over a finite field has a branch-decomposition of width at most k found in O(n²) time plus one matrix multiplication, or the algorithm reports that branch-width exceeds k.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-14T06:19:53Z","title":"Branch-width of represented matroids in matrix multiplication time"},"references":{"count":24,"internal_anchors":0,"resolved_work":24,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, and Renfei Zhou, More asymmetry yields faster matrix multiplication , Proceedings of the 2025 Annual ACM-SIAM Symposium on D","work_id":"18e4ac5d-932c-4976-b76a-0a51dd7daadc","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Hans L. Bodlaender and Ton Kloks, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, J. Algorithms 21 (1996), no. 2, 358–402. MR 98g:68122 27","work_id":"ba12edc2-b80f-4ea0-817a-3181d9be3418","year":1996},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Bunch and John E","work_id":"99e4b3aa-36c7-47ca-8096-47203d78bf5a","year":1974},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Bruno Courcelle, The monadic second-order logic of graphs I: Recognizable sets of finite graphs , Inform. and Comput. 85 (1990), no. 1, 12–75. MR 91g:05107","work_id":"8c7cd507-89ff-4a11-bb8d-950d73f93adf","year":1990},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"138, Cambridge University Press, Cam- bridge, 2012","work_id":"0e78156c-f856-44b0-b617-5ee5ac7f89fa","year":2012}],"snapshot_sha256":"5e82240e5d05514ddf012d38e448e8cc2281a60dd018705b37e95ca9c5406a0b"},"source":{"id":"2605.14428","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:10:41.184580Z","id":"e7344d5a-9e34-4e59-b693-e8c0aeb037f3","model_set":{"reader":"grok-4.3"},"one_line_summary":"O(n² + n^ω)-time algorithm decides if branch-width of a matrix-represented matroid over a finite field is at most k.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A matroid given by an n by n matrix over a finite field has a branch-decomposition of width at most k found in O(n²) time plus one matrix multiplication, or the algorithm reports that branch-width exceeds k.","strongest_claim":"For an n-element matroid M given by an n × n matrix representation over a finite field F and an integer k, we present an (O_{k,F}(n²)+O(n^ω))-time algorithm that either finds a branch-decomposition of M of width at most k, or confirms that the branch-width of M is more than k.","weakest_assumption":"The input matroid is supplied as a matrix representation over a finite field F; the algorithm's hidden factors that depend on k and F are computable, and the overhead of converting to standard form is accounted for when the matrix is not already in that form."}},"verdict_id":"e7344d5a-9e34-4e59-b693-e8c0aeb037f3"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5346cc87add8126d76e7567069a9f7b438553624cf5990207ac1a4e7cb0c1ffb","target":"record","created_at":"2026-05-17T23:39:07Z","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":"b7f4e11a10bba13fc6b6bb3f43f7fd9c6fa38975a53f388d654bdfed7f7af182","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-14T06:19:53Z","title_canon_sha256":"743d7b221a935709ce8f8cfb67302c1eda5b538bf470f57d87828c0003839287"},"schema_version":"1.0","source":{"id":"2605.14428","kind":"arxiv","version":1}},"canonical_sha256":"7818df888de2fff81f0b56077563e44803a03f94f442e280d4371793bd0acb38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7818df888de2fff81f0b56077563e44803a03f94f442e280d4371793bd0acb38","first_computed_at":"2026-05-17T23:39:07.167883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:07.167883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"53DNU9Hrcn3c8OBeWD0icv0jOQe7MIr9EK/OzSbpc+6+vMOCtKrmKshbZnfhmMyC1O9dWmtld2F2U+p7VT/vCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:07.168625Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14428","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5346cc87add8126d76e7567069a9f7b438553624cf5990207ac1a4e7cb0c1ffb","sha256:33373a4af94ab58be9a6ca8aacc42569ce6361253430d7fcb53c61217fac7de6"],"state_sha256":"aa75190234aa650d75e96f133270c0b26db2f986861791c0574d19b753563ba4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PshOUEjgcsVK0pBeOPI+HFbUMMNKsZRlP39OZ9UhR3s4IY5pywjQ2x6mcS276Z+tRbym6iLLg4AgZVAjTLf7Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:48:16.076328Z","bundle_sha256":"23c5ecb4b304838d67134462fdd5687a352c63d973e2d8cab75884e2fc932af0"}}