{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QCKY74JWBIX3LDQYNN343XVIV5","short_pith_number":"pith:QCKY74JW","canonical_record":{"source":{"id":"2602.17346","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-02-19T13:29:09Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"695a92b78e77fc37f9ef05d8ddb2e12edb48a7b5ea86df176d7b57860370d08f","abstract_canon_sha256":"0fa4c8b34fa7d1a18933b0dc385c84faf486a8d14c73bbdca3b4192c0cfc9daa"},"schema_version":"1.0"},"canonical_sha256":"80958ff1360a2fb58e186b77cddea8af78558d4938622af9c572f0f6212527c1","source":{"kind":"arxiv","id":"2602.17346","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.17346","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"2602.17346v2","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.17346","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"QCKY74JWBIX3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"QCKY74JWBIX3LDQY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"QCKY74JW","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QCKY74JWBIX3LDQYNN343XVIV5","target":"record","payload":{"canonical_record":{"source":{"id":"2602.17346","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-02-19T13:29:09Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"695a92b78e77fc37f9ef05d8ddb2e12edb48a7b5ea86df176d7b57860370d08f","abstract_canon_sha256":"0fa4c8b34fa7d1a18933b0dc385c84faf486a8d14c73bbdca3b4192c0cfc9daa"},"schema_version":"1.0"},"canonical_sha256":"80958ff1360a2fb58e186b77cddea8af78558d4938622af9c572f0f6212527c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:31.121765Z","signature_b64":"qExIi0Aq/ld2nhaIza8As43gg2vOX/wQzzqz4ewS5Y3bQZVvsroVbdjG3omz0Evb/N33qjkFZ48L2eRCSgb4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80958ff1360a2fb58e186b77cddea8af78558d4938622af9c572f0f6212527c1","last_reissued_at":"2026-05-18T02:44:31.121163Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:31.121163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.17346","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-18T02:44:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ojTOlYitlOMgHxf2HTKmtPd15RVvhnII5gwFOGECK5TTJKNFZRWZdIHx9EhYZmK+B7ax8j04osKR5I/qaEBpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:28:34.274376Z"},"content_sha256":"eec229ec1bcd23e462567cce7ee7931b44581e921e0732bd8abfbdefe11a79bb","schema_version":"1.0","event_id":"sha256:eec229ec1bcd23e462567cce7ee7931b44581e921e0732bd8abfbdefe11a79bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QCKY74JWBIX3LDQYNN343XVIV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partial Optimality in the Preordering Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"New partial optimality conditions decide more pairs that cannot appear in any optimal preorder.","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.DM","authors_text":"Bjoern Andres, David Stein, Jannik Irmai","submitted_at":"2026-02-19T13:29:09Z","abstract_excerpt":"Preordering is a generalization of clustering and partial ordering with applications in bioinformatics and social network analysis. Given a finite set $V$ and a value $c_{ab} \\in \\mathbb{R}$ for every ordered pair $ab$ of elements of $V$, the preordering problem asks for a preorder $\\lesssim$ on $V$ that maximizes the sum of the values of those pairs $ab$ for which $a \\lesssim b$. Building on the state of the art in solving this NP-hard problem partially, we contribute new partial optimality conditions and efficient algorithms for deciding these conditions. In experiments with real and synthet"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Building on the state of the art in solving this NP-hard problem partially, we contribute new partial optimality conditions and efficient algorithms for deciding these conditions. In experiments with real and synthetic data, these new conditions increase, in particular, the fraction of pairs ab for which it is decided efficiently that a ≰ b in an optimal preorder.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The new conditions are valid partial optimality conditions that correctly identify pairs that cannot be related in any optimal preorder, and the algorithms correctly decide them without false negatives.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"New partial optimality conditions for the preordering problem increase the fraction of pairs decidable as unrelated in an optimal preorder.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"New partial optimality conditions decide more pairs that cannot appear in any optimal preorder.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5259b08b75d6efd88996d26adad6c28deef6caa8975ceb403f7ce53c1c0f7e1f"},"source":{"id":"2602.17346","kind":"arxiv","version":2},"verdict":{"id":"edac19d3-461a-446a-afbd-5a22fc1b340e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T20:53:25.864883Z","strongest_claim":"Building on the state of the art in solving this NP-hard problem partially, we contribute new partial optimality conditions and efficient algorithms for deciding these conditions. In experiments with real and synthetic data, these new conditions increase, in particular, the fraction of pairs ab for which it is decided efficiently that a ≰ b in an optimal preorder.","one_line_summary":"New partial optimality conditions for the preordering problem increase the fraction of pairs decidable as unrelated in an optimal preorder.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The new conditions are valid partial optimality conditions that correctly identify pairs that cannot be related in any optimal preorder, and the algorithms correctly decide them without false negatives.","pith_extraction_headline":"New partial optimality conditions decide more pairs that cannot appear in any optimal preorder."},"references":{"count":13,"sample":[{"doi":"10.1093/bioinformatics/btn056","year":2008,"title":"Jacob, J., Jentsch, M., Kostka, D., Bentink, S., and Spang, R","work_id":"93efed30-6e84-4083-9cce-b4ee10fca2d9","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.11606/resimeusp.v3i3.74876","year":null,"title":"doi: 10.11606/resimeusp.v3i3.74876. Weller, M., Komusiewicz, C., Niedermeier, R., and Uhlmann, J. On making directed graphs transitive. Jour- nal of Computer and System Sciences , 78(2):559–574,","work_id":"50ac508c-86ee-44e7-8ac4-a7691c9f7799","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.jcss.2011.07.001","year":2011,"title":"9 Partial Optimality in the Preordering Problem A","work_id":"2daa4f32-67be-41ec-92ea-78a5c2b3904b","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"6.2 is fulfilled for every ij ∈ δ(U, V \\ U) as c− ij ≥ X pq∈δ(U,V \\U )\\ˆx−1(0) c+ pq = 0","work_id":"24e8b3b3-9228-404e-b961-a062380dd434","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Since γij|1(x)ij = 1 for all x ∈ XV [ˆx], there is an optimal solu- tion x∗ to POPV,c[ˆx] such that x∗ ij = 1","work_id":"76a7e046-757f-4c02-8c3b-ad3610c18bf5","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":13,"snapshot_sha256":"fb60cb7e9ac0ffa52163fbb6ae8a78d7e53b163a9d901486a9d7ea5b9f913d5b","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"fa62a3fa04d361370452d314fbef530b2a58050be25d4feffd7c44cc1f072ef7"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"edac19d3-461a-446a-afbd-5a22fc1b340e"},"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:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKwTRyF1FBi1zIyfoYbuETMHVy8EyDBEY+UI12tx6K7q+Z1TtkLBJfx2TV3nmKKgvagL3mDVDot4Yd2920+IAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:28:34.275651Z"},"content_sha256":"73e7a1b4c7861a8a391b8fd620f8afbd02242018716f81803c9c08280d51c50b","schema_version":"1.0","event_id":"sha256:73e7a1b4c7861a8a391b8fd620f8afbd02242018716f81803c9c08280d51c50b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QCKY74JWBIX3LDQYNN343XVIV5/bundle.json","state_url":"https://pith.science/pith/QCKY74JWBIX3LDQYNN343XVIV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QCKY74JWBIX3LDQYNN343XVIV5/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-10T12:28:34Z","links":{"resolver":"https://pith.science/pith/QCKY74JWBIX3LDQYNN343XVIV5","bundle":"https://pith.science/pith/QCKY74JWBIX3LDQYNN343XVIV5/bundle.json","state":"https://pith.science/pith/QCKY74JWBIX3LDQYNN343XVIV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QCKY74JWBIX3LDQYNN343XVIV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QCKY74JWBIX3LDQYNN343XVIV5","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":"0fa4c8b34fa7d1a18933b0dc385c84faf486a8d14c73bbdca3b4192c0cfc9daa","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-02-19T13:29:09Z","title_canon_sha256":"695a92b78e77fc37f9ef05d8ddb2e12edb48a7b5ea86df176d7b57860370d08f"},"schema_version":"1.0","source":{"id":"2602.17346","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.17346","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"2602.17346v2","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.17346","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"QCKY74JWBIX3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"QCKY74JWBIX3LDQY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"QCKY74JW","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:73e7a1b4c7861a8a391b8fd620f8afbd02242018716f81803c9c08280d51c50b","target":"graph","created_at":"2026-05-18T02:44:31Z","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":"Building on the state of the art in solving this NP-hard problem partially, we contribute new partial optimality conditions and efficient algorithms for deciding these conditions. In experiments with real and synthetic data, these new conditions increase, in particular, the fraction of pairs ab for which it is decided efficiently that a ≰ b in an optimal preorder."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The new conditions are valid partial optimality conditions that correctly identify pairs that cannot be related in any optimal preorder, and the algorithms correctly decide them without false negatives."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"New partial optimality conditions for the preordering problem increase the fraction of pairs decidable as unrelated in an optimal preorder."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"New partial optimality conditions decide more pairs that cannot appear in any optimal preorder."}],"snapshot_sha256":"5259b08b75d6efd88996d26adad6c28deef6caa8975ceb403f7ce53c1c0f7e1f"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"fa62a3fa04d361370452d314fbef530b2a58050be25d4feffd7c44cc1f072ef7"},"paper":{"abstract_excerpt":"Preordering is a generalization of clustering and partial ordering with applications in bioinformatics and social network analysis. Given a finite set $V$ and a value $c_{ab} \\in \\mathbb{R}$ for every ordered pair $ab$ of elements of $V$, the preordering problem asks for a preorder $\\lesssim$ on $V$ that maximizes the sum of the values of those pairs $ab$ for which $a \\lesssim b$. Building on the state of the art in solving this NP-hard problem partially, we contribute new partial optimality conditions and efficient algorithms for deciding these conditions. In experiments with real and synthet","authors_text":"Bjoern Andres, David Stein, Jannik Irmai","cross_cats":["cs.DS","cs.LG"],"headline":"New partial optimality conditions decide more pairs that cannot appear in any optimal preorder.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-02-19T13:29:09Z","title":"Partial Optimality in the Preordering Problem"},"references":{"count":13,"internal_anchors":0,"resolved_work":13,"sample":[{"cited_arxiv_id":"","doi":"10.1093/bioinformatics/btn056","is_internal_anchor":false,"ref_index":1,"title":"Jacob, J., Jentsch, M., Kostka, D., Bentink, S., and Spang, R","work_id":"93efed30-6e84-4083-9cce-b4ee10fca2d9","year":2008},{"cited_arxiv_id":"","doi":"10.11606/resimeusp.v3i3.74876","is_internal_anchor":false,"ref_index":2,"title":"doi: 10.11606/resimeusp.v3i3.74876. Weller, M., Komusiewicz, C., Niedermeier, R., and Uhlmann, J. On making directed graphs transitive. Jour- nal of Computer and System Sciences , 78(2):559–574,","work_id":"50ac508c-86ee-44e7-8ac4-a7691c9f7799","year":null},{"cited_arxiv_id":"","doi":"10.1016/j.jcss.2011.07.001","is_internal_anchor":false,"ref_index":3,"title":"9 Partial Optimality in the Preordering Problem A","work_id":"2daa4f32-67be-41ec-92ea-78a5c2b3904b","year":2011},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"6.2 is fulfilled for every ij ∈ δ(U, V \\ U) as c− ij ≥ X pq∈δ(U,V \\U )\\ˆx−1(0) c+ pq = 0","work_id":"24e8b3b3-9228-404e-b961-a062380dd434","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Since γij|1(x)ij = 1 for all x ∈ XV [ˆx], there is an optimal solu- tion x∗ to POPV,c[ˆx] such that x∗ ij = 1","work_id":"76a7e046-757f-4c02-8c3b-ad3610c18bf5","year":null}],"snapshot_sha256":"fb60cb7e9ac0ffa52163fbb6ae8a78d7e53b163a9d901486a9d7ea5b9f913d5b"},"source":{"id":"2602.17346","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-15T20:53:25.864883Z","id":"edac19d3-461a-446a-afbd-5a22fc1b340e","model_set":{"reader":"grok-4.3"},"one_line_summary":"New partial optimality conditions for the preordering problem increase the fraction of pairs decidable as unrelated in an optimal preorder.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"New partial optimality conditions decide more pairs that cannot appear in any optimal preorder.","strongest_claim":"Building on the state of the art in solving this NP-hard problem partially, we contribute new partial optimality conditions and efficient algorithms for deciding these conditions. In experiments with real and synthetic data, these new conditions increase, in particular, the fraction of pairs ab for which it is decided efficiently that a ≰ b in an optimal preorder.","weakest_assumption":"The new conditions are valid partial optimality conditions that correctly identify pairs that cannot be related in any optimal preorder, and the algorithms correctly decide them without false negatives."}},"verdict_id":"edac19d3-461a-446a-afbd-5a22fc1b340e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eec229ec1bcd23e462567cce7ee7931b44581e921e0732bd8abfbdefe11a79bb","target":"record","created_at":"2026-05-18T02:44:31Z","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":"0fa4c8b34fa7d1a18933b0dc385c84faf486a8d14c73bbdca3b4192c0cfc9daa","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-02-19T13:29:09Z","title_canon_sha256":"695a92b78e77fc37f9ef05d8ddb2e12edb48a7b5ea86df176d7b57860370d08f"},"schema_version":"1.0","source":{"id":"2602.17346","kind":"arxiv","version":2}},"canonical_sha256":"80958ff1360a2fb58e186b77cddea8af78558d4938622af9c572f0f6212527c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80958ff1360a2fb58e186b77cddea8af78558d4938622af9c572f0f6212527c1","first_computed_at":"2026-05-18T02:44:31.121163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:31.121163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qExIi0Aq/ld2nhaIza8As43gg2vOX/wQzzqz4ewS5Y3bQZVvsroVbdjG3omz0Evb/N33qjkFZ48L2eRCSgb4AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:31.121765Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.17346","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eec229ec1bcd23e462567cce7ee7931b44581e921e0732bd8abfbdefe11a79bb","sha256:73e7a1b4c7861a8a391b8fd620f8afbd02242018716f81803c9c08280d51c50b"],"state_sha256":"7024324a5dd92eadec330e9151f6834e2ea07a1ee25862f67c892bb41beb742c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Duxegjzxqloj6UjpQD0KQG6T0/utScdhv8BKsMX4rRa+iY8+lUI/brXdP8SbBl6LtCFG7Gt8NarjFw07wRNRAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T12:28:34.281087Z","bundle_sha256":"e79a749651860ececa973d215d265d1671262ed86b838afa54ba76cb81c72a43"}}