{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CCVACGVXCHWVIMOKBGFDIDWW6F","short_pith_number":"pith:CCVACGVX","canonical_record":{"source":{"id":"2605.21945","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.MN","submitted_at":"2026-05-21T03:25:18Z","cross_cats_sorted":[],"title_canon_sha256":"d437afc3f8e90e70edce6eeed217194161c459b45727eed7356e655184404dc1","abstract_canon_sha256":"95e173880eafbabbfdeb1d9f558c98eaa1bca58cc7c0a43cb889ad794a864c88"},"schema_version":"1.0"},"canonical_sha256":"10aa011ab711ed5431ca098a340ed6f14b94ce0b2ae195b780413518b43bf798","source":{"kind":"arxiv","id":"2605.21945","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21945","created_at":"2026-05-22T01:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21945v1","created_at":"2026-05-22T01:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21945","created_at":"2026-05-22T01:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"CCVACGVXCHWV","created_at":"2026-05-22T01:04:16Z"},{"alias_kind":"pith_short_16","alias_value":"CCVACGVXCHWVIMOK","created_at":"2026-05-22T01:04:16Z"},{"alias_kind":"pith_short_8","alias_value":"CCVACGVX","created_at":"2026-05-22T01:04:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CCVACGVXCHWVIMOKBGFDIDWW6F","target":"record","payload":{"canonical_record":{"source":{"id":"2605.21945","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.MN","submitted_at":"2026-05-21T03:25:18Z","cross_cats_sorted":[],"title_canon_sha256":"d437afc3f8e90e70edce6eeed217194161c459b45727eed7356e655184404dc1","abstract_canon_sha256":"95e173880eafbabbfdeb1d9f558c98eaa1bca58cc7c0a43cb889ad794a864c88"},"schema_version":"1.0"},"canonical_sha256":"10aa011ab711ed5431ca098a340ed6f14b94ce0b2ae195b780413518b43bf798","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:16.196657Z","signature_b64":"bLE5qKDa948FsGUqkkEWn2RqhiKyfU3mDIgk18bqXcA2IbDJH0uedHH2LIOlsOjS9zstGDqsGnCBB5CGRoU6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10aa011ab711ed5431ca098a340ed6f14b94ce0b2ae195b780413518b43bf798","last_reissued_at":"2026-05-22T01:04:16.195806Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:16.195806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.21945","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-22T01:04:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BycFTE0kb9LjtlxQhV89buix6kQ/+yQyBy4cMGyV4tsRzqSUyq/vfAUZiAKrngyAHF2ZsL5CYmVMYnrc8N6UDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:50:45.096286Z"},"content_sha256":"aed37519dcb870a8ecaa3fe5d47e84dfe01c7f9fa42d845f60b44ec1439f70d8","schema_version":"1.0","event_id":"sha256:aed37519dcb870a8ecaa3fe5d47e84dfe01c7f9fa42d845f60b44ec1439f70d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CCVACGVXCHWVIMOKBGFDIDWW6F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Characterization of Level-k Realizability for Clustering Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.MN","authors_text":"Shilong Dai, Yangjing Long","submitted_at":"2026-05-21T03:25:18Z","abstract_excerpt":"We give a Hasse-diagram characterization of when a clustering system $\\mathcal C$ on a finite taxa set $X$ is the hardwired clustering system $C_N$ of a rooted level-$k$ network. For each non-trivial block $B$ of $H=\\mathcal H[\\mathcal C]$, we define a parameter $\\mu(B)$ using minimum families of clusters that generate all overlap-intersections inside $B$. The main theorem proves that there exists a rooted level-$k$ network $N$ with $C_N=\\mathcal C$ if and only if $\\mu(B)\\le k$ for every non-trivial block $B$ of $H$. The necessity proof shows that overlap-intersection pieces must be represente"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21945","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21945/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-22T01:04:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/D+vhBCOBPVQW8t0uWDUFYsyII4Y+Tv9XvCTXE0ipxuGO9zN29amYv4ErZ/qeycOHl16lV0yZEmdZHkrXffBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:50:45.096981Z"},"content_sha256":"d3cd681569323740824cfc983d56c9af1a521bccb3058976d8ba5484ef2e78e1","schema_version":"1.0","event_id":"sha256:d3cd681569323740824cfc983d56c9af1a521bccb3058976d8ba5484ef2e78e1"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:CCVACGVXCHWVIMOKBGFDIDWW6F","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s00285-011-0456-y32) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"P. Gambette and K. T. Huber,On encodings of phylogenetic networks of bounded level, Journal of Mathematical Biology, 65 (2012), 157–180. doi:10.1007/s00285- 011-0456-y 32","arxiv_id":"2605.21945","detector":"doi_compliance","evidence":{"ref_index":7,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"P. Gambette and K. T. Huber,On encodings of phylogenetic networks of bounded level, Journal of Mathematical Biology, 65 (2012), 157–180. doi:10.1007/s00285- 011-0456-y 32","reconstructed_doi":"10.1007/s00285-011-0456-y32"},"severity":"advisory","ref_index":7,"audited_at":"2026-05-22T02:52:02.938728Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s00285-011-0456-y32","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"979d0ffc87168b009fe27ca6b5d6b5b01f8fdeefe5c9a8204cb2dcdbdaeb1501","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":6147,"payload_sha256":"42dc32f7fb8e116d06996313fc5d548e318b800dcf2cc29f474763dcef7caed9","signature_b64":"q+lyI+qzAkeW/NuQNY7Y4Kam0krIYjcGFB05CTa7tl3sFwlLZyDVPeGEb+6od1gVd6a6wQGbIJOsD1zN5gHnCg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-22T02:55:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bjEev0mmOHC0B7bfP8+YslUseBJSxKyDf/cHFwXjxgH0qE2Ih9m+kn3WGh34UimnS/9e58DutuwqtRw0epIUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:50:45.098455Z"},"content_sha256":"302fd93f75b4e893b0357fb116e350260d9ca0206e22dd1eee68350a27ca625d","schema_version":"1.0","event_id":"sha256:302fd93f75b4e893b0357fb116e350260d9ca0206e22dd1eee68350a27ca625d"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:CCVACGVXCHWVIMOKBGFDIDWW6F","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/11428848117) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"L. Nakhleh and L.-S. Wang,Phylogenetic networks, trees, and clusters, inCom- putational Science – ICCS 2005, Lecture Notes in Computer Science, Vol. 3515, Springer, Berlin, 2005, pp. 919–926. doi:10.1007/11428848 117","arxiv_id":"2605.21945","detector":"doi_compliance","evidence":{"ref_index":4,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"L. Nakhleh and L.-S. Wang,Phylogenetic networks, trees, and clusters, inCom- putational Science – ICCS 2005, Lecture Notes in Computer Science, Vol. 3515, Springer, Berlin, 2005, pp. 919–926. doi:10.1007/11428848 117","reconstructed_doi":"10.1007/11428848117"},"severity":"advisory","ref_index":4,"audited_at":"2026-05-22T02:52:02.938728Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/11428848117","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"f27874bf7350ac6acd06d064f4be9f64dcd7be4121828e7b0f16b93258c96235","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":6146,"payload_sha256":"bc89e51aa7d037a2ee139cdd6eec3cc26a7b3c1a1dd213cae9b808b156189ee5","signature_b64":"Dskz0RBFsGy+2pKZd6Buzb4RPgQAlTTCRpLFAw5W3k+K83E1lEXKmQ52anroTFEYWQvXLInXRBVTRkO+NWAqDQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-22T02:55:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RfqGz5YKynYm2XtDgnrbjInjSOC760grEy3h/f1HcJQxLQmKawn+VSKvy+tbf6f501G5ngZu+FCpX/Sje472Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:50:45.099011Z"},"content_sha256":"92e2d4caf611bdc398c66c489f3e0cfba21885917d6ab21b2599b580fd128831","schema_version":"1.0","event_id":"sha256:92e2d4caf611bdc398c66c489f3e0cfba21885917d6ab21b2599b580fd128831"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:CCVACGVXCHWVIMOKBGFDIDWW6F","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-662-53622-333) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"R. Diestel,Graph Theory, 5th ed., Springer, Berlin, 2017. doi:10.1007/978-3-662- 53622-3 33","arxiv_id":"2605.21945","detector":"doi_compliance","evidence":{"ref_index":17,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"R. Diestel,Graph Theory, 5th ed., Springer, Berlin, 2017. doi:10.1007/978-3-662- 53622-3 33","reconstructed_doi":"10.1007/978-3-662-53622-333"},"severity":"advisory","ref_index":17,"audited_at":"2026-05-22T02:52:02.938728Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-662-53622-333","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"d02e3d11562be1572ef34c05f1e452df2e92bc5ca7899225b6cc5f6824655fa1","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":6145,"payload_sha256":"4fa72dc446af20e0f57ad502e99f0be52778ce823019d437fe6ed3f8da798fa5","signature_b64":"eEouq3G6WmJhz0RblPgXpZxwP9jdx/UEJfUt4p8XKyxY7tRKY+awCoOGlntzkLuRgxji/4+eCVWttdTwmvhSDw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-22T02:55:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WyTvyE/e+A3dmkQ4R6DhJiW28zRSN+8D+BP/Laq33Dts8mn/iWAU6S8Nk4NVtpXQ7xQJ0ABD/79Bn0qoJqrUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:50:45.099520Z"},"content_sha256":"30fd4e6ba3e645473ac060d28895930755b9762c77c5470cb52f5aa50d4ae51b","schema_version":"1.0","event_id":"sha256:30fd4e6ba3e645473ac060d28895930755b9762c77c5470cb52f5aa50d4ae51b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CCVACGVXCHWVIMOKBGFDIDWW6F/bundle.json","state_url":"https://pith.science/pith/CCVACGVXCHWVIMOKBGFDIDWW6F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CCVACGVXCHWVIMOKBGFDIDWW6F/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-26T13:50:45Z","links":{"resolver":"https://pith.science/pith/CCVACGVXCHWVIMOKBGFDIDWW6F","bundle":"https://pith.science/pith/CCVACGVXCHWVIMOKBGFDIDWW6F/bundle.json","state":"https://pith.science/pith/CCVACGVXCHWVIMOKBGFDIDWW6F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CCVACGVXCHWVIMOKBGFDIDWW6F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CCVACGVXCHWVIMOKBGFDIDWW6F","merge_version":"pith-open-graph-merge-v1","event_count":5,"valid_event_count":5,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"95e173880eafbabbfdeb1d9f558c98eaa1bca58cc7c0a43cb889ad794a864c88","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.MN","submitted_at":"2026-05-21T03:25:18Z","title_canon_sha256":"d437afc3f8e90e70edce6eeed217194161c459b45727eed7356e655184404dc1"},"schema_version":"1.0","source":{"id":"2605.21945","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21945","created_at":"2026-05-22T01:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21945v1","created_at":"2026-05-22T01:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21945","created_at":"2026-05-22T01:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"CCVACGVXCHWV","created_at":"2026-05-22T01:04:16Z"},{"alias_kind":"pith_short_16","alias_value":"CCVACGVXCHWVIMOK","created_at":"2026-05-22T01:04:16Z"},{"alias_kind":"pith_short_8","alias_value":"CCVACGVX","created_at":"2026-05-22T01:04:16Z"}],"graph_snapshots":[{"event_id":"sha256:d3cd681569323740824cfc983d56c9af1a521bccb3058976d8ba5484ef2e78e1","target":"graph","created_at":"2026-05-22T01:04:16Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.21945/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give a Hasse-diagram characterization of when a clustering system $\\mathcal C$ on a finite taxa set $X$ is the hardwired clustering system $C_N$ of a rooted level-$k$ network. For each non-trivial block $B$ of $H=\\mathcal H[\\mathcal C]$, we define a parameter $\\mu(B)$ using minimum families of clusters that generate all overlap-intersections inside $B$. The main theorem proves that there exists a rooted level-$k$ network $N$ with $C_N=\\mathcal C$ if and only if $\\mu(B)\\le k$ for every non-trivial block $B$ of $H$. The necessity proof shows that overlap-intersection pieces must be represente","authors_text":"Shilong Dai, Yangjing Long","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.MN","submitted_at":"2026-05-21T03:25:18Z","title":"A Characterization of Level-k Realizability for Clustering Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21945","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:aed37519dcb870a8ecaa3fe5d47e84dfe01c7f9fa42d845f60b44ec1439f70d8","target":"record","created_at":"2026-05-22T01:04:16Z","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":"95e173880eafbabbfdeb1d9f558c98eaa1bca58cc7c0a43cb889ad794a864c88","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.MN","submitted_at":"2026-05-21T03:25:18Z","title_canon_sha256":"d437afc3f8e90e70edce6eeed217194161c459b45727eed7356e655184404dc1"},"schema_version":"1.0","source":{"id":"2605.21945","kind":"arxiv","version":1}},"canonical_sha256":"10aa011ab711ed5431ca098a340ed6f14b94ce0b2ae195b780413518b43bf798","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10aa011ab711ed5431ca098a340ed6f14b94ce0b2ae195b780413518b43bf798","first_computed_at":"2026-05-22T01:04:16.195806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:16.195806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bLE5qKDa948FsGUqkkEWn2RqhiKyfU3mDIgk18bqXcA2IbDJH0uedHH2LIOlsOjS9zstGDqsGnCBB5CGRoU6Cg==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:16.196657Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.21945","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:302fd93f75b4e893b0357fb116e350260d9ca0206e22dd1eee68350a27ca625d","sha256:30fd4e6ba3e645473ac060d28895930755b9762c77c5470cb52f5aa50d4ae51b","sha256:92e2d4caf611bdc398c66c489f3e0cfba21885917d6ab21b2599b580fd128831"]}],"invalid_events":[],"applied_event_ids":["sha256:aed37519dcb870a8ecaa3fe5d47e84dfe01c7f9fa42d845f60b44ec1439f70d8","sha256:d3cd681569323740824cfc983d56c9af1a521bccb3058976d8ba5484ef2e78e1"],"state_sha256":"a6b555e0ea28e623f735bead395b9163dd6e49f5659c19ac556db44f41f7c125"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qpTM5mrkdjO8zPURm/bo4XdwN4ZH2CS4wwzZZozLpirg58ZRtBbmsY/bcyTyBuJAQU7HUwBVFq+Q0xGp026dCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:50:45.103667Z","bundle_sha256":"6139db0cf59fd5de9da5fa61a31c1e1c44f878a2e096cccbe9ef03226e250b5a"}}