{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NLJ4OXOROXTQPTGP7DAM4PVF2Y","short_pith_number":"pith:NLJ4OXOR","canonical_record":{"source":{"id":"2605.15819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T10:18:25Z","cross_cats_sorted":[],"title_canon_sha256":"a7757e44fdf0b7ae8619919c42e629761e0d744a0c2c2782901b62b87bb95a6d","abstract_canon_sha256":"9e28a28d65babbffb79d93c0d21113a5d4759ee8f01077e73c5e18fea4e862aa"},"schema_version":"1.0"},"canonical_sha256":"6ad3c75dd175e707cccff8c0ce3ea5d6059c71bed60554c0d4cb58bfca358159","source":{"kind":"arxiv","id":"2605.15819","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15819","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15819v1","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15819","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"NLJ4OXOROXTQ","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"pith_short_16","alias_value":"NLJ4OXOROXTQPTGP","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"pith_short_8","alias_value":"NLJ4OXOR","created_at":"2026-05-20T00:01:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NLJ4OXOROXTQPTGP7DAM4PVF2Y","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T10:18:25Z","cross_cats_sorted":[],"title_canon_sha256":"a7757e44fdf0b7ae8619919c42e629761e0d744a0c2c2782901b62b87bb95a6d","abstract_canon_sha256":"9e28a28d65babbffb79d93c0d21113a5d4759ee8f01077e73c5e18fea4e862aa"},"schema_version":"1.0"},"canonical_sha256":"6ad3c75dd175e707cccff8c0ce3ea5d6059c71bed60554c0d4cb58bfca358159","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:20.190247Z","signature_b64":"buEThFBFQyfTbZGh1c/bvommA4GIDwz2mFkx0IUeLydj1cDuSKLNMjpYDYGz/Ese1p2agTwr7ukPPKOCTBFbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ad3c75dd175e707cccff8c0ce3ea5d6059c71bed60554c0d4cb58bfca358159","last_reissued_at":"2026-05-20T00:01:20.189492Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:20.189492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15819","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-20T00:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jEV9vOzwBJ7E/w3hY4dBMWPfT2/cpWquFaK9JC5bwBi0F+eyH+9AE88R5dt3/JEueThG8Qk37zEvzCvGdUWOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T11:56:01.229728Z"},"content_sha256":"23ce1007bb584425b413b28adc9a46b1ff0ac778f85d4b2c0b46f963ba6068c1","schema_version":"1.0","event_id":"sha256:23ce1007bb584425b413b28adc9a46b1ff0ac778f85d4b2c0b46f963ba6068c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NLJ4OXOROXTQPTGP7DAM4PVF2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"More efficient PBWT prefix-array access via batching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Batching queries to the PBWT prefix array allows constant-time haplotype reporting using O(r log h) bits when batch sizes meet specified logarithmic thresholds.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Travis Gagie","submitted_at":"2026-05-15T10:18:25Z","abstract_excerpt":"The positional Burrows-Wheeler Transform (PBWT) is commonly used to store haplotype panels compactly in such a way that, given a query haplotype, we can quickly find the set maximal exact matches (SMEMs) between the query and the haplotypes in a panel. There are generally two steps in this process: first we find the maximal substrings of the query that occur in the same positions in haplotypes in the panel and then, for each such substring, report the haplotypes in the panel in which the substring occurs in the same position as in the query. Very recently, Bonizzoni, Gagie and Gao (2026) gave "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"if we can batch queries until we have found r lg (h) / lg r such substrings and we report an average of at least lg (r) / lg h haplotypes in the panel per substring, for example, then for the second step we can easily use O (r log h) bits and constant time to report each haplotype.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The premise that it is practical to batch queries until r lg(h)/lg(r) substrings have been identified and that the average number of haplotypes reported per substring will be at least lg(r)/lg(h); this workload-dependent condition is required for the constant-time claim to hold.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Batching queries to accumulate r lg(h)/lg(r) substrings with average lg(r)/lg(h) haplotypes reported per substring enables O(r log h) bits and constant time per haplotype in PBWT prefix-array access.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Batching queries to the PBWT prefix array allows constant-time haplotype reporting using O(r log h) bits when batch sizes meet specified logarithmic thresholds.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"133f348adbef109346ad433f8e613a2b79a16eab908e4a728357ee8591384926"},"source":{"id":"2605.15819","kind":"arxiv","version":1},"verdict":{"id":"61acb65f-05de-4c04-bdd9-57e59f50eef0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:21:01.355044Z","strongest_claim":"if we can batch queries until we have found r lg (h) / lg r such substrings and we report an average of at least lg (r) / lg h haplotypes in the panel per substring, for example, then for the second step we can easily use O (r log h) bits and constant time to report each haplotype.","one_line_summary":"Batching queries to accumulate r lg(h)/lg(r) substrings with average lg(r)/lg(h) haplotypes reported per substring enables O(r log h) bits and constant time per haplotype in PBWT prefix-array access.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The premise that it is practical to batch queries until r lg(h)/lg(r) substrings have been identified and that the average number of haplotypes reported per substring will be at least lg(r)/lg(h); this workload-dependent condition is required for the constant-time claim to hold.","pith_extraction_headline":"Batching queries to the PBWT prefix array allows constant-time haplotype reporting using O(r log h) bits when batch sizes meet specified logarithmic thresholds."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15819/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:19.093942Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:31:12.019108Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:48.725840Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:21:55.875485Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"18b8c2c5525699f7e2834e40bac6f0c2551250991bdee761dfd56fb34105b25a"},"references":{"count":12,"sample":[{"doi":"","year":2026,"title":"Compressing Suffix Trees by Path Decompositions","work_id":"b7e176a3-8349-4fd8-85da-1005539ecf62","ref_index":1,"cited_arxiv_id":"2506.14734","is_internal_anchor":true},{"doi":"","year":2026,"title":"Optimal-time mapping in run-length compressed PBWT.arXiv preprint 2602.13461, 2026","work_id":"775b6540-e810-47ef-93f6-1440a1dce536","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"Faster Iterative $\\phi$ Queries on the Positional BWT","work_id":"cf9fbfba-2229-431f-a9f1-deb09567c963","ref_index":3,"cited_arxiv_id":"2605.04244","is_internal_anchor":true},{"doi":"","year":2026,"title":"Paola Bonnizoni and Younan Gao. Personal communication, 2026","work_id":"5b56457a-ca4f-4313-ba3d-670f7ec6bdff","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"RLBWT tricks.arXiv preprint arXiv:2112.04271v1, 2021","work_id":"9dd0fec4-8f57-45d4-b952-1f800f2be726","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":12,"snapshot_sha256":"e499cef77e71f6b444158edae722c5b2bc658dae8a5286e3dda873b677aa843c","internal_anchors":2},"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":"61acb65f-05de-4c04-bdd9-57e59f50eef0"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouppstAVyyW/QQTYsY5qbz+EjnD9k6bbrXvBj8O4gR1zRn3YVPWgZQeiDeGM9oL4Tih8hgSx9zzX4tAbsS3XDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T11:56:01.230546Z"},"content_sha256":"84fb00ac5dfcf91df912ff2b6dc66ff7c072d1c136fd3a111b7f3bf4fe489b88","schema_version":"1.0","event_id":"sha256:84fb00ac5dfcf91df912ff2b6dc66ff7c072d1c136fd3a111b7f3bf4fe489b88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLJ4OXOROXTQPTGP7DAM4PVF2Y/bundle.json","state_url":"https://pith.science/pith/NLJ4OXOROXTQPTGP7DAM4PVF2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLJ4OXOROXTQPTGP7DAM4PVF2Y/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-21T11:56:01Z","links":{"resolver":"https://pith.science/pith/NLJ4OXOROXTQPTGP7DAM4PVF2Y","bundle":"https://pith.science/pith/NLJ4OXOROXTQPTGP7DAM4PVF2Y/bundle.json","state":"https://pith.science/pith/NLJ4OXOROXTQPTGP7DAM4PVF2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLJ4OXOROXTQPTGP7DAM4PVF2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NLJ4OXOROXTQPTGP7DAM4PVF2Y","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":"9e28a28d65babbffb79d93c0d21113a5d4759ee8f01077e73c5e18fea4e862aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T10:18:25Z","title_canon_sha256":"a7757e44fdf0b7ae8619919c42e629761e0d744a0c2c2782901b62b87bb95a6d"},"schema_version":"1.0","source":{"id":"2605.15819","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15819","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15819v1","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15819","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"NLJ4OXOROXTQ","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"pith_short_16","alias_value":"NLJ4OXOROXTQPTGP","created_at":"2026-05-20T00:01:20Z"},{"alias_kind":"pith_short_8","alias_value":"NLJ4OXOR","created_at":"2026-05-20T00:01:20Z"}],"graph_snapshots":[{"event_id":"sha256:84fb00ac5dfcf91df912ff2b6dc66ff7c072d1c136fd3a111b7f3bf4fe489b88","target":"graph","created_at":"2026-05-20T00:01:20Z","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":"if we can batch queries until we have found r lg (h) / lg r such substrings and we report an average of at least lg (r) / lg h haplotypes in the panel per substring, for example, then for the second step we can easily use O (r log h) bits and constant time to report each haplotype."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The premise that it is practical to batch queries until r lg(h)/lg(r) substrings have been identified and that the average number of haplotypes reported per substring will be at least lg(r)/lg(h); this workload-dependent condition is required for the constant-time claim to hold."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Batching queries to accumulate r lg(h)/lg(r) substrings with average lg(r)/lg(h) haplotypes reported per substring enables O(r log h) bits and constant time per haplotype in PBWT prefix-array access."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Batching queries to the PBWT prefix array allows constant-time haplotype reporting using O(r log h) bits when batch sizes meet specified logarithmic thresholds."}],"snapshot_sha256":"133f348adbef109346ad433f8e613a2b79a16eab908e4a728357ee8591384926"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:19.093942Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:31:12.019108Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:48.725840Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:21:55.875485Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15819/integrity.json","findings":[],"snapshot_sha256":"18b8c2c5525699f7e2834e40bac6f0c2551250991bdee761dfd56fb34105b25a","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The positional Burrows-Wheeler Transform (PBWT) is commonly used to store haplotype panels compactly in such a way that, given a query haplotype, we can quickly find the set maximal exact matches (SMEMs) between the query and the haplotypes in a panel. There are generally two steps in this process: first we find the maximal substrings of the query that occur in the same positions in haplotypes in the panel and then, for each such substring, report the haplotypes in the panel in which the substring occurs in the same position as in the query. Very recently, Bonizzoni, Gagie and Gao (2026) gave ","authors_text":"Travis Gagie","cross_cats":[],"headline":"Batching queries to the PBWT prefix array allows constant-time haplotype reporting using O(r log h) bits when batch sizes meet specified logarithmic thresholds.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T10:18:25Z","title":"More efficient PBWT prefix-array access via batching"},"references":{"count":12,"internal_anchors":2,"resolved_work":12,"sample":[{"cited_arxiv_id":"2506.14734","doi":"","is_internal_anchor":true,"ref_index":1,"title":"Compressing Suffix Trees by Path Decompositions","work_id":"b7e176a3-8349-4fd8-85da-1005539ecf62","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Optimal-time mapping in run-length compressed PBWT.arXiv preprint 2602.13461, 2026","work_id":"775b6540-e810-47ef-93f6-1440a1dce536","year":2026},{"cited_arxiv_id":"2605.04244","doi":"","is_internal_anchor":true,"ref_index":3,"title":"Faster Iterative $\\phi$ Queries on the Positional BWT","work_id":"cf9fbfba-2229-431f-a9f1-deb09567c963","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Paola Bonnizoni and Younan Gao. Personal communication, 2026","work_id":"5b56457a-ca4f-4313-ba3d-670f7ec6bdff","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"RLBWT tricks.arXiv preprint arXiv:2112.04271v1, 2021","work_id":"9dd0fec4-8f57-45d4-b952-1f800f2be726","year":2021}],"snapshot_sha256":"e499cef77e71f6b444158edae722c5b2bc658dae8a5286e3dda873b677aa843c"},"source":{"id":"2605.15819","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:21:01.355044Z","id":"61acb65f-05de-4c04-bdd9-57e59f50eef0","model_set":{"reader":"grok-4.3"},"one_line_summary":"Batching queries to accumulate r lg(h)/lg(r) substrings with average lg(r)/lg(h) haplotypes reported per substring enables O(r log h) bits and constant time per haplotype in PBWT prefix-array access.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Batching queries to the PBWT prefix array allows constant-time haplotype reporting using O(r log h) bits when batch sizes meet specified logarithmic thresholds.","strongest_claim":"if we can batch queries until we have found r lg (h) / lg r such substrings and we report an average of at least lg (r) / lg h haplotypes in the panel per substring, for example, then for the second step we can easily use O (r log h) bits and constant time to report each haplotype.","weakest_assumption":"The premise that it is practical to batch queries until r lg(h)/lg(r) substrings have been identified and that the average number of haplotypes reported per substring will be at least lg(r)/lg(h); this workload-dependent condition is required for the constant-time claim to hold."}},"verdict_id":"61acb65f-05de-4c04-bdd9-57e59f50eef0"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:23ce1007bb584425b413b28adc9a46b1ff0ac778f85d4b2c0b46f963ba6068c1","target":"record","created_at":"2026-05-20T00:01:20Z","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":"9e28a28d65babbffb79d93c0d21113a5d4759ee8f01077e73c5e18fea4e862aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T10:18:25Z","title_canon_sha256":"a7757e44fdf0b7ae8619919c42e629761e0d744a0c2c2782901b62b87bb95a6d"},"schema_version":"1.0","source":{"id":"2605.15819","kind":"arxiv","version":1}},"canonical_sha256":"6ad3c75dd175e707cccff8c0ce3ea5d6059c71bed60554c0d4cb58bfca358159","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ad3c75dd175e707cccff8c0ce3ea5d6059c71bed60554c0d4cb58bfca358159","first_computed_at":"2026-05-20T00:01:20.189492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:20.189492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"buEThFBFQyfTbZGh1c/bvommA4GIDwz2mFkx0IUeLydj1cDuSKLNMjpYDYGz/Ese1p2agTwr7ukPPKOCTBFbBA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:20.190247Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15819","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23ce1007bb584425b413b28adc9a46b1ff0ac778f85d4b2c0b46f963ba6068c1","sha256:84fb00ac5dfcf91df912ff2b6dc66ff7c072d1c136fd3a111b7f3bf4fe489b88"],"state_sha256":"fdd836e31940c609e8c75ca441dac19d6e0bdf397331d8ab258fd5124fbbde95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IHHKimF7WFWL1+rg/y75qw8l+poTLf4a2kH0O9uN6ZxNVwHrR8Dw4H/x0lnWQuw+N7/DZ+0sufupc2TxZU0EAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T11:56:01.234333Z","bundle_sha256":"c8c2cc10c06114652612a02aca97322283cdce07a3464242190de240bd6bc849"}}