{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XMBITKOJX2BDPYPCW2PRMRZOTI","short_pith_number":"pith:XMBITKOJ","canonical_record":{"source":{"id":"2605.14138","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T21:44:25Z","cross_cats_sorted":[],"title_canon_sha256":"c978ff09e75bccabbfd738469fedfd8afbf2fa17bf1ccc7d5dec1d729f2e7e09","abstract_canon_sha256":"0d5a5bdda7f034e4494d2a062413e9bff9c7288f36ed94996f7b347c39677cd7"},"schema_version":"1.0"},"canonical_sha256":"bb0289a9c9be8237e1e2b69f16472e9a2e4f4e7bbe50ffd6ed243b3d8a477632","source":{"kind":"arxiv","id":"2605.14138","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14138","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14138v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14138","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"XMBITKOJX2BD","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"XMBITKOJX2BDPYPC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"XMBITKOJ","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XMBITKOJX2BDPYPCW2PRMRZOTI","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14138","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T21:44:25Z","cross_cats_sorted":[],"title_canon_sha256":"c978ff09e75bccabbfd738469fedfd8afbf2fa17bf1ccc7d5dec1d729f2e7e09","abstract_canon_sha256":"0d5a5bdda7f034e4494d2a062413e9bff9c7288f36ed94996f7b347c39677cd7"},"schema_version":"1.0"},"canonical_sha256":"bb0289a9c9be8237e1e2b69f16472e9a2e4f4e7bbe50ffd6ed243b3d8a477632","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:11.721029Z","signature_b64":"3+u04DUpa6hTkw3F+aBOK4Em40XCEgx7rVJrtvFId8RgXrKvCgB01sP3sgKKItpRHWsD273wj5RxAMjaS2lUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb0289a9c9be8237e1e2b69f16472e9a2e4f4e7bbe50ffd6ed243b3d8a477632","last_reissued_at":"2026-05-17T23:39:11.720455Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:11.720455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14138","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:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bai4M6qXlb5UspviZQCp+ruIfmzXg3Tz/z0nw59iB9qnkQHEtp31XKO5EaSIixsmL0ZjiWlWEbgFFuwzJneDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:51:23.616556Z"},"content_sha256":"bffa1c506415214da9d9a460eb321dd2d5b7f2bb9f41d0e028b9d1a50e5d869a","schema_version":"1.0","event_id":"sha256:bffa1c506415214da9d9a460eb321dd2d5b7f2bb9f41d0e028b9d1a50e5d869a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XMBITKOJX2BDPYPCW2PRMRZOTI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Tournament Anti-Sidorenko Orientations of Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Oriented paths with exactly one non-leaf source or sink are tournament anti-Sidorenko.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Christian Clemen, Hao Chen, Jonathan A. Noel","submitted_at":"2026-05-13T21:44:25Z","abstract_excerpt":"An oriented graph $\\vec{H}$ is said to be tournament anti-Sidorenko if the homomorphism density of $\\vec{H}$ in any tournament $\\vec{T}$ is bounded above by the homomorphism density of $\\vec{H}$ in a large uniformly random tournament. We prove the following:\n  (1) Every oriented path with at least three arcs and exactly one non-leaf source or sink vertex is tournament anti-Sidorenko.\n  (2) An oriented path is tournament anti-Sidorenko if the distance between any leaf vertex and any source or sink vertex is at least two and the distance between any pair of non-leaf source or sink vertices is a "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Every oriented path with at least three arcs and exactly one non-leaf source or sink vertex is tournament anti-Sidorenko. An oriented path is tournament anti-Sidorenko if the distance between any leaf vertex and any source or sink vertex is at least two and the distance between any pair of non-leaf source or sink vertices is a multiple of four. Every spider with exactly three legs admits a tournament anti-Sidorenko orientation.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The proofs for the stated distance conditions and structural properties of the oriented paths and spiders hold without gaps or unstated restrictions on the graphs considered.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Specific orientations of paths with distance conditions and three-legged spiders are tournament anti-Sidorenko, proving conjectures and yielding new families.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Oriented paths with exactly one non-leaf source or sink are tournament anti-Sidorenko.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e425063248ef346e7843a4c7e4a3ad5e6eaf74445beaeadad3593d732c0649b0"},"source":{"id":"2605.14138","kind":"arxiv","version":1},"verdict":{"id":"23160e29-80d9-4091-b7e1-eeb59c8e59f7","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:16:07.669349Z","strongest_claim":"Every oriented path with at least three arcs and exactly one non-leaf source or sink vertex is tournament anti-Sidorenko. An oriented path is tournament anti-Sidorenko if the distance between any leaf vertex and any source or sink vertex is at least two and the distance between any pair of non-leaf source or sink vertices is a multiple of four. Every spider with exactly three legs admits a tournament anti-Sidorenko orientation.","one_line_summary":"Specific orientations of paths with distance conditions and three-legged spiders are tournament anti-Sidorenko, proving conjectures and yielding new families.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The proofs for the stated distance conditions and structural properties of the oriented paths and spiders hold without gaps or unstated restrictions on the graphs considered.","pith_extraction_headline":"Oriented paths with exactly one non-leaf source or sink are tournament anti-Sidorenko."},"references":{"count":30,"sample":[{"doi":"","year":2025,"title":"A. Basit, B. Granet, D. Horsley, A. K¨ undgen, and K. Staden. The semi-inducibility problem. E-print arXiv:2501.09842v2, 2025","work_id":"9637b173-9e80-419a-ba4e-ee914a5490cf","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"N. Behague, G. Crudele, J. A. Noel, and L. M. Simbaqueba. Sidorenko-Type Inequalities for Pairs of Trees.Random Structures Algorithms, 67(1):Paper No. e70026, 2025","work_id":"22515211-e0d0-48a8-862f-6e841cc502ad","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"N. Behague, N. Morrison, and J. A. Noel. Off-diagonal commonality of graphs via entropy.SIAM J. Discrete Math., 38(3):2335–2360, 2024","work_id":"39d76ff8-1c81-44f4-872f-617dd8c6730c","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"V. Bitonti, E. Hogan, J. A. Noel, and D. Tsarev. Relative Sidorenko inequalities in oriented graphs. In preparation, 2026","work_id":"408cb517-1458-4d27-bd5a-7cc07028aa73","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"G. Blekherman and A. Raymond. A path forward: tropicalization in extremal combi- natorics.Adv. Math., 407:Paper No. 108561, 68, 2022","work_id":"9f7ca14d-60f7-4897-95d5-935c98cbcc48","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":30,"snapshot_sha256":"56d637ad18a24d6980082a179058ca11a30ac23253912f425adfc9c40fc69b53","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":"23160e29-80d9-4091-b7e1-eeb59c8e59f7"},"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:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KpiCnHiK7uDHbpUelikw756w5mBZeWU9fmBFx4JjiaN4CPmkMdUlSQZ1KxJYNQuQ6txsoa/jFHDhLRczT4EwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:51:23.617218Z"},"content_sha256":"2d2159ce29c27abc1c50eebfcfe28b52d8e7617ad63e1279e3201bcf1b60588b","schema_version":"1.0","event_id":"sha256:2d2159ce29c27abc1c50eebfcfe28b52d8e7617ad63e1279e3201bcf1b60588b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMBITKOJX2BDPYPCW2PRMRZOTI/bundle.json","state_url":"https://pith.science/pith/XMBITKOJX2BDPYPCW2PRMRZOTI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMBITKOJX2BDPYPCW2PRMRZOTI/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-27T03:51:23Z","links":{"resolver":"https://pith.science/pith/XMBITKOJX2BDPYPCW2PRMRZOTI","bundle":"https://pith.science/pith/XMBITKOJX2BDPYPCW2PRMRZOTI/bundle.json","state":"https://pith.science/pith/XMBITKOJX2BDPYPCW2PRMRZOTI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMBITKOJX2BDPYPCW2PRMRZOTI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XMBITKOJX2BDPYPCW2PRMRZOTI","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":"0d5a5bdda7f034e4494d2a062413e9bff9c7288f36ed94996f7b347c39677cd7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T21:44:25Z","title_canon_sha256":"c978ff09e75bccabbfd738469fedfd8afbf2fa17bf1ccc7d5dec1d729f2e7e09"},"schema_version":"1.0","source":{"id":"2605.14138","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14138","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14138v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14138","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"XMBITKOJX2BD","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"XMBITKOJX2BDPYPC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"XMBITKOJ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:2d2159ce29c27abc1c50eebfcfe28b52d8e7617ad63e1279e3201bcf1b60588b","target":"graph","created_at":"2026-05-17T23:39:11Z","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":"Every oriented path with at least three arcs and exactly one non-leaf source or sink vertex is tournament anti-Sidorenko. An oriented path is tournament anti-Sidorenko if the distance between any leaf vertex and any source or sink vertex is at least two and the distance between any pair of non-leaf source or sink vertices is a multiple of four. Every spider with exactly three legs admits a tournament anti-Sidorenko orientation."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The proofs for the stated distance conditions and structural properties of the oriented paths and spiders hold without gaps or unstated restrictions on the graphs considered."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Specific orientations of paths with distance conditions and three-legged spiders are tournament anti-Sidorenko, proving conjectures and yielding new families."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Oriented paths with exactly one non-leaf source or sink are tournament anti-Sidorenko."}],"snapshot_sha256":"e425063248ef346e7843a4c7e4a3ad5e6eaf74445beaeadad3593d732c0649b0"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"An oriented graph $\\vec{H}$ is said to be tournament anti-Sidorenko if the homomorphism density of $\\vec{H}$ in any tournament $\\vec{T}$ is bounded above by the homomorphism density of $\\vec{H}$ in a large uniformly random tournament. We prove the following:\n  (1) Every oriented path with at least three arcs and exactly one non-leaf source or sink vertex is tournament anti-Sidorenko.\n  (2) An oriented path is tournament anti-Sidorenko if the distance between any leaf vertex and any source or sink vertex is at least two and the distance between any pair of non-leaf source or sink vertices is a ","authors_text":"Felix Christian Clemen, Hao Chen, Jonathan A. Noel","cross_cats":[],"headline":"Oriented paths with exactly one non-leaf source or sink are tournament anti-Sidorenko.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T21:44:25Z","title":"On Tournament Anti-Sidorenko Orientations of Trees"},"references":{"count":30,"internal_anchors":0,"resolved_work":30,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A. Basit, B. Granet, D. Horsley, A. K¨ undgen, and K. Staden. The semi-inducibility problem. E-print arXiv:2501.09842v2, 2025","work_id":"9637b173-9e80-419a-ba4e-ee914a5490cf","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"N. Behague, G. Crudele, J. A. Noel, and L. M. Simbaqueba. Sidorenko-Type Inequalities for Pairs of Trees.Random Structures Algorithms, 67(1):Paper No. e70026, 2025","work_id":"22515211-e0d0-48a8-862f-6e841cc502ad","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"N. Behague, N. Morrison, and J. A. Noel. Off-diagonal commonality of graphs via entropy.SIAM J. Discrete Math., 38(3):2335–2360, 2024","work_id":"39d76ff8-1c81-44f4-872f-617dd8c6730c","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"V. Bitonti, E. Hogan, J. A. Noel, and D. Tsarev. Relative Sidorenko inequalities in oriented graphs. In preparation, 2026","work_id":"408cb517-1458-4d27-bd5a-7cc07028aa73","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"G. Blekherman and A. Raymond. A path forward: tropicalization in extremal combi- natorics.Adv. Math., 407:Paper No. 108561, 68, 2022","work_id":"9f7ca14d-60f7-4897-95d5-935c98cbcc48","year":2022}],"snapshot_sha256":"56d637ad18a24d6980082a179058ca11a30ac23253912f425adfc9c40fc69b53"},"source":{"id":"2605.14138","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:16:07.669349Z","id":"23160e29-80d9-4091-b7e1-eeb59c8e59f7","model_set":{"reader":"grok-4.3"},"one_line_summary":"Specific orientations of paths with distance conditions and three-legged spiders are tournament anti-Sidorenko, proving conjectures and yielding new families.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Oriented paths with exactly one non-leaf source or sink are tournament anti-Sidorenko.","strongest_claim":"Every oriented path with at least three arcs and exactly one non-leaf source or sink vertex is tournament anti-Sidorenko. An oriented path is tournament anti-Sidorenko if the distance between any leaf vertex and any source or sink vertex is at least two and the distance between any pair of non-leaf source or sink vertices is a multiple of four. Every spider with exactly three legs admits a tournament anti-Sidorenko orientation.","weakest_assumption":"The proofs for the stated distance conditions and structural properties of the oriented paths and spiders hold without gaps or unstated restrictions on the graphs considered."}},"verdict_id":"23160e29-80d9-4091-b7e1-eeb59c8e59f7"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bffa1c506415214da9d9a460eb321dd2d5b7f2bb9f41d0e028b9d1a50e5d869a","target":"record","created_at":"2026-05-17T23:39:11Z","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":"0d5a5bdda7f034e4494d2a062413e9bff9c7288f36ed94996f7b347c39677cd7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T21:44:25Z","title_canon_sha256":"c978ff09e75bccabbfd738469fedfd8afbf2fa17bf1ccc7d5dec1d729f2e7e09"},"schema_version":"1.0","source":{"id":"2605.14138","kind":"arxiv","version":1}},"canonical_sha256":"bb0289a9c9be8237e1e2b69f16472e9a2e4f4e7bbe50ffd6ed243b3d8a477632","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb0289a9c9be8237e1e2b69f16472e9a2e4f4e7bbe50ffd6ed243b3d8a477632","first_computed_at":"2026-05-17T23:39:11.720455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:11.720455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3+u04DUpa6hTkw3F+aBOK4Em40XCEgx7rVJrtvFId8RgXrKvCgB01sP3sgKKItpRHWsD273wj5RxAMjaS2lUCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:11.721029Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14138","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bffa1c506415214da9d9a460eb321dd2d5b7f2bb9f41d0e028b9d1a50e5d869a","sha256:2d2159ce29c27abc1c50eebfcfe28b52d8e7617ad63e1279e3201bcf1b60588b"],"state_sha256":"11f962820537bd3e953b762792d8f7dcde97c4e8abb3bf7b93dea091f2cd1516"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GTF1WGsk9jh5qkO5SuhP3dvd8DCOGUFlukMus5PFNZlc6xtwp+bJCbwk1Ap9V56oGPWrkBZNd72yhLmBPfJ2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:51:23.620181Z","bundle_sha256":"e584880d8d02234cf849a2178e984f4b3be54a9d3a46b218c0fb65edd129b440"}}