{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OVY6D66BV7RPUHVN4RUPJRFHC7","short_pith_number":"pith:OVY6D66B","canonical_record":{"source":{"id":"2605.13610","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T14:43:31Z","cross_cats_sorted":[],"title_canon_sha256":"c37ac3247b6ba830812a16058fa813dd0e67fc1e62e9cb5f293031f6cba2c188","abstract_canon_sha256":"dd9f425bb3798195939070dfde85670092edb7f3728b54a1797586cf2411d1b2"},"schema_version":"1.0"},"canonical_sha256":"7571e1fbc1afe2fa1eade468f4c4a717c01b27fbb34a352712258ba380fb4901","source":{"kind":"arxiv","id":"2605.13610","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13610","created_at":"2026-05-18T02:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13610v1","created_at":"2026-05-18T02:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13610","created_at":"2026-05-18T02:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"OVY6D66BV7RP","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"OVY6D66BV7RPUHVN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"OVY6D66B","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OVY6D66BV7RPUHVN4RUPJRFHC7","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13610","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T14:43:31Z","cross_cats_sorted":[],"title_canon_sha256":"c37ac3247b6ba830812a16058fa813dd0e67fc1e62e9cb5f293031f6cba2c188","abstract_canon_sha256":"dd9f425bb3798195939070dfde85670092edb7f3728b54a1797586cf2411d1b2"},"schema_version":"1.0"},"canonical_sha256":"7571e1fbc1afe2fa1eade468f4c4a717c01b27fbb34a352712258ba380fb4901","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:18.069610Z","signature_b64":"wRek/TXWWGmLzbL5ZWUO0tVMGSUw0kU7ROZcMX4zIa889QlYRZkL0qTh5XBNcXG+kF9qPGSwqG4ccrkR0lbWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7571e1fbc1afe2fa1eade468f4c4a717c01b27fbb34a352712258ba380fb4901","last_reissued_at":"2026-05-18T02:44:18.069176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:18.069176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13610","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-18T02:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WqlaEzx+fzvi9re/cbR2exP/HF3vKkIxN6P/nwCf7Jqns4ZGGCvYCtDVd3dax40Q2abPS5ayDOmVJ2XrEwK1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:15:12.420838Z"},"content_sha256":"b3d04191ea949cfeb888a9a92e7da355dd66c06b3177cedd789012958d28004b","schema_version":"1.0","event_id":"sha256:b3d04191ea949cfeb888a9a92e7da355dd66c06b3177cedd789012958d28004b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OVY6D66BV7RPUHVN4RUPJRFHC7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A merging procedure for labelings of bipartite graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"A merging procedure produces (A,B)-uniformly ordered labelings for bipartite graphs built by iteratively adding even cycles and pendant paths.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lucia Marino, Paola Bonacini","submitted_at":"2026-05-13T14:43:31Z","abstract_excerpt":"Let $G$ a bipartite graph with vertex bipartition $\\{A,B\\}$ and let $m=|E(G)|$. An $(A,B)$-uniformly ordered labeling of $G$ is a labeling $f\\colon V\\rightarrow [0,2m]$ which, among other conditions, requires that there exists $\\lambda\\in \\mathbb N$ such that $f(a)\\le \\lambda$ and $f(b)>\\lambda$ for all $a\\in A$ and $b\\in B$. The existence of such a labeling for $G$ implies the existence of a cyclic $G$-decomposition of $K_{2mx+1}$ for all positive integers $x$. In this paper, as a starting point, through this type of labeling we prove the existence of a cyclic $G$-decomposition in the case th"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Through a merging procedure, we are able to get this type of labeling for a specific class of bipartite graphs, which are obtained by iteratively adding an even cycle and a pendant path.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the merging operation on two (A,B)-uniformly ordered labelings always produces a valid labeling on the combined graph without violating the separation condition or the range requirements.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A merging procedure produces (A,B)-uniformly ordered labelings for a class of bipartite graphs formed by iteratively adding even cycles and pendant paths, yielding cyclic G-decompositions of K_{2mx+1}.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A merging procedure produces (A,B)-uniformly ordered labelings for bipartite graphs built by iteratively adding even cycles and pendant paths.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5c0cc598618cbf7f8e65720682a772a241d989abbc81f9e9c71d084056ff4cd9"},"source":{"id":"2605.13610","kind":"arxiv","version":1},"verdict":{"id":"c4438964-d3d2-4990-95ce-00a0765e9720","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:05:54.024545Z","strongest_claim":"Through a merging procedure, we are able to get this type of labeling for a specific class of bipartite graphs, which are obtained by iteratively adding an even cycle and a pendant path.","one_line_summary":"A merging procedure produces (A,B)-uniformly ordered labelings for a class of bipartite graphs formed by iteratively adding even cycles and pendant paths, yielding cyclic G-decompositions of K_{2mx+1}.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the merging operation on two (A,B)-uniformly ordered labelings always produces a valid labeling on the combined graph without violating the separation condition or the range requirements.","pith_extraction_headline":"A merging procedure produces (A,B)-uniformly ordered labelings for bipartite graphs built by iteratively adding even cycles and pendant paths."},"references":{"count":5,"sample":[{"doi":"","year":2012,"title":"K. Brewington, R. C. Bunge, L. J. Cross, S. I. El-Zanati, C. K. Pawlak, J. L. Smith, S. M. Zeppetello,On cyclicG-designs whereGis the one-point union of two cycles, J. Combin. Math. Combin. Comput. 83","work_id":"e4da1c90-0691-475c-a388-57a7922d0609","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"R. C. Bunge, S. I. El-Zanati, W. O’Hanlon, C. Vanden Eynden,Onγlabeling the almost bipartite graphP m +e, Ars Combin. 107 (2012), 65–80","work_id":"ef982eba-9f08-4cee-a7ef-9729ca4e4d37","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2001,"title":"S. I. El-Zanati, C. Vanden Eynden, N. Punnim,On the cyclic decomposition of com- plete graphs into bipartite graphs, Australas. J. Combin.24(2001), 209–219","work_id":"a1336c97-6bb1-438a-9c2e-886de94f2d1f","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"J. A. Gallian,A Dynamic Survey of Graph Labeling, Dynamic Survey 6, Electron. J. Combin., (2025), 805 pp","work_id":"2853229b-ee2e-42a7-9acf-8964c48a5cae","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1966,"title":"Rosa,On certain valuations of the vertices of a graph, in:Th´ eorie des graphes, journ´ ees internationales d’´ etudes, Rome 1966 (Dunod, Paris, 1967), 349–355","work_id":"6dc8502b-246e-4598-aed8-7e51a280ec7b","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":5,"snapshot_sha256":"e0436930fa8613090f1c172ed9e0c8feba0da43cc1a648606beedec72f172cf8","internal_anchors":0},"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":"c4438964-d3d2-4990-95ce-00a0765e9720"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qdyj7jnLakdTTDGWATsNcf3PyGNZfqWTCpW2XEQpPesdLqxJDgBIKpIab98FYqJuYfrvLanPoMpwqrXt6CvKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:15:12.422168Z"},"content_sha256":"b29a471e3cfecf10641cc9e60c5d57b37b866223dee742510dfd23e4bcd13a8c","schema_version":"1.0","event_id":"sha256:b29a471e3cfecf10641cc9e60c5d57b37b866223dee742510dfd23e4bcd13a8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVY6D66BV7RPUHVN4RUPJRFHC7/bundle.json","state_url":"https://pith.science/pith/OVY6D66BV7RPUHVN4RUPJRFHC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVY6D66BV7RPUHVN4RUPJRFHC7/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-31T18:15:12Z","links":{"resolver":"https://pith.science/pith/OVY6D66BV7RPUHVN4RUPJRFHC7","bundle":"https://pith.science/pith/OVY6D66BV7RPUHVN4RUPJRFHC7/bundle.json","state":"https://pith.science/pith/OVY6D66BV7RPUHVN4RUPJRFHC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVY6D66BV7RPUHVN4RUPJRFHC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OVY6D66BV7RPUHVN4RUPJRFHC7","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":"dd9f425bb3798195939070dfde85670092edb7f3728b54a1797586cf2411d1b2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T14:43:31Z","title_canon_sha256":"c37ac3247b6ba830812a16058fa813dd0e67fc1e62e9cb5f293031f6cba2c188"},"schema_version":"1.0","source":{"id":"2605.13610","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13610","created_at":"2026-05-18T02:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13610v1","created_at":"2026-05-18T02:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13610","created_at":"2026-05-18T02:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"OVY6D66BV7RP","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"OVY6D66BV7RPUHVN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"OVY6D66B","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:b29a471e3cfecf10641cc9e60c5d57b37b866223dee742510dfd23e4bcd13a8c","target":"graph","created_at":"2026-05-18T02:44:18Z","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":"Through a merging procedure, we are able to get this type of labeling for a specific class of bipartite graphs, which are obtained by iteratively adding an even cycle and a pendant path."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the merging operation on two (A,B)-uniformly ordered labelings always produces a valid labeling on the combined graph without violating the separation condition or the range requirements."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A merging procedure produces (A,B)-uniformly ordered labelings for a class of bipartite graphs formed by iteratively adding even cycles and pendant paths, yielding cyclic G-decompositions of K_{2mx+1}."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A merging procedure produces (A,B)-uniformly ordered labelings for bipartite graphs built by iteratively adding even cycles and pendant paths."}],"snapshot_sha256":"5c0cc598618cbf7f8e65720682a772a241d989abbc81f9e9c71d084056ff4cd9"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Let $G$ a bipartite graph with vertex bipartition $\\{A,B\\}$ and let $m=|E(G)|$. An $(A,B)$-uniformly ordered labeling of $G$ is a labeling $f\\colon V\\rightarrow [0,2m]$ which, among other conditions, requires that there exists $\\lambda\\in \\mathbb N$ such that $f(a)\\le \\lambda$ and $f(b)>\\lambda$ for all $a\\in A$ and $b\\in B$. The existence of such a labeling for $G$ implies the existence of a cyclic $G$-decomposition of $K_{2mx+1}$ for all positive integers $x$. In this paper, as a starting point, through this type of labeling we prove the existence of a cyclic $G$-decomposition in the case th","authors_text":"Lucia Marino, Paola Bonacini","cross_cats":[],"headline":"A merging procedure produces (A,B)-uniformly ordered labelings for bipartite graphs built by iteratively adding even cycles and pendant paths.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T14:43:31Z","title":"A merging procedure for labelings of bipartite graphs"},"references":{"count":5,"internal_anchors":0,"resolved_work":5,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"K. Brewington, R. C. Bunge, L. J. Cross, S. I. El-Zanati, C. K. Pawlak, J. L. Smith, S. M. Zeppetello,On cyclicG-designs whereGis the one-point union of two cycles, J. Combin. Math. Combin. Comput. 83","work_id":"e4da1c90-0691-475c-a388-57a7922d0609","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"R. C. Bunge, S. I. El-Zanati, W. O’Hanlon, C. Vanden Eynden,Onγlabeling the almost bipartite graphP m +e, Ars Combin. 107 (2012), 65–80","work_id":"ef982eba-9f08-4cee-a7ef-9729ca4e4d37","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"S. I. El-Zanati, C. Vanden Eynden, N. Punnim,On the cyclic decomposition of com- plete graphs into bipartite graphs, Australas. J. Combin.24(2001), 209–219","work_id":"a1336c97-6bb1-438a-9c2e-886de94f2d1f","year":2001},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"J. A. Gallian,A Dynamic Survey of Graph Labeling, Dynamic Survey 6, Electron. J. Combin., (2025), 805 pp","work_id":"2853229b-ee2e-42a7-9acf-8964c48a5cae","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Rosa,On certain valuations of the vertices of a graph, in:Th´ eorie des graphes, journ´ ees internationales d’´ etudes, Rome 1966 (Dunod, Paris, 1967), 349–355","work_id":"6dc8502b-246e-4598-aed8-7e51a280ec7b","year":1966}],"snapshot_sha256":"e0436930fa8613090f1c172ed9e0c8feba0da43cc1a648606beedec72f172cf8"},"source":{"id":"2605.13610","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:05:54.024545Z","id":"c4438964-d3d2-4990-95ce-00a0765e9720","model_set":{"reader":"grok-4.3"},"one_line_summary":"A merging procedure produces (A,B)-uniformly ordered labelings for a class of bipartite graphs formed by iteratively adding even cycles and pendant paths, yielding cyclic G-decompositions of K_{2mx+1}.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A merging procedure produces (A,B)-uniformly ordered labelings for bipartite graphs built by iteratively adding even cycles and pendant paths.","strongest_claim":"Through a merging procedure, we are able to get this type of labeling for a specific class of bipartite graphs, which are obtained by iteratively adding an even cycle and a pendant path.","weakest_assumption":"That the merging operation on two (A,B)-uniformly ordered labelings always produces a valid labeling on the combined graph without violating the separation condition or the range requirements."}},"verdict_id":"c4438964-d3d2-4990-95ce-00a0765e9720"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b3d04191ea949cfeb888a9a92e7da355dd66c06b3177cedd789012958d28004b","target":"record","created_at":"2026-05-18T02:44:18Z","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":"dd9f425bb3798195939070dfde85670092edb7f3728b54a1797586cf2411d1b2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T14:43:31Z","title_canon_sha256":"c37ac3247b6ba830812a16058fa813dd0e67fc1e62e9cb5f293031f6cba2c188"},"schema_version":"1.0","source":{"id":"2605.13610","kind":"arxiv","version":1}},"canonical_sha256":"7571e1fbc1afe2fa1eade468f4c4a717c01b27fbb34a352712258ba380fb4901","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7571e1fbc1afe2fa1eade468f4c4a717c01b27fbb34a352712258ba380fb4901","first_computed_at":"2026-05-18T02:44:18.069176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:18.069176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wRek/TXWWGmLzbL5ZWUO0tVMGSUw0kU7ROZcMX4zIa889QlYRZkL0qTh5XBNcXG+kF9qPGSwqG4ccrkR0lbWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:18.069610Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13610","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3d04191ea949cfeb888a9a92e7da355dd66c06b3177cedd789012958d28004b","sha256:b29a471e3cfecf10641cc9e60c5d57b37b866223dee742510dfd23e4bcd13a8c"],"state_sha256":"7551305d8893a3d3492fd0ed83fe4809d03d68c646da44a06f8e96e5c0051918"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FEtlF//NeR8SdrRLH3vKwsoDmfJkRzUsH/4hWLhtFZkXHAwcnsu8GmuQ2PQth7xEuBtOecDyZtnwDhl9I98sAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:15:12.427570Z","bundle_sha256":"0dea66d1c7b6eab2f543267ac58fa9bd0ed4b9ecd93f2f4768e6ddf2c0b69c31"}}