{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SU5BSH3PWJNCNR7RFBR5Q356Z5","short_pith_number":"pith:SU5BSH3P","canonical_record":{"source":{"id":"2605.16667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T22:05:09Z","cross_cats_sorted":[],"title_canon_sha256":"57353dd4873766a96b6500bbe08c44e97f6efef2ad664ad7f63fd207000e7bbd","abstract_canon_sha256":"2205cce68995b0c5ee54c2ccc334b6e78eed6e21d8b1dd0ca33313b7a349e131"},"schema_version":"1.0"},"canonical_sha256":"953a191f6fb25a26c7f12863d86fbecf63d8fec8ea2884aa45f98266a17ab922","source":{"kind":"arxiv","id":"2605.16667","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16667","created_at":"2026-05-20T00:02:35Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16667v1","created_at":"2026-05-20T00:02:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16667","created_at":"2026-05-20T00:02:35Z"},{"alias_kind":"pith_short_12","alias_value":"SU5BSH3PWJNC","created_at":"2026-05-20T00:02:35Z"},{"alias_kind":"pith_short_16","alias_value":"SU5BSH3PWJNCNR7R","created_at":"2026-05-20T00:02:35Z"},{"alias_kind":"pith_short_8","alias_value":"SU5BSH3P","created_at":"2026-05-20T00:02:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SU5BSH3PWJNCNR7RFBR5Q356Z5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T22:05:09Z","cross_cats_sorted":[],"title_canon_sha256":"57353dd4873766a96b6500bbe08c44e97f6efef2ad664ad7f63fd207000e7bbd","abstract_canon_sha256":"2205cce68995b0c5ee54c2ccc334b6e78eed6e21d8b1dd0ca33313b7a349e131"},"schema_version":"1.0"},"canonical_sha256":"953a191f6fb25a26c7f12863d86fbecf63d8fec8ea2884aa45f98266a17ab922","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:35.361530Z","signature_b64":"qCW793uVP4ZsQV2M31JRVMGrFoCWvpoJpfxZtBZVR4+SRt/gUvx0T9Tvrk8332xAwp++7PX1qJXUUsWsGqA6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"953a191f6fb25a26c7f12863d86fbecf63d8fec8ea2884aa45f98266a17ab922","last_reissued_at":"2026-05-20T00:02:35.360582Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:35.360582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16667","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:02:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UtJli87KHf+R4dpGcwf8XbpBsi5U4YyRvbIL2V0eYrbrMGQOqS4melAAL3uMlwsUWsZpdtSddhOt+ATN+a2zAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:44:49.240088Z"},"content_sha256":"e67dcd8fc0a44d57446b8588b04e988533e668fb49e50cad97c6f0817da1628c","schema_version":"1.0","event_id":"sha256:e67dcd8fc0a44d57446b8588b04e988533e668fb49e50cad97c6f0817da1628c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SU5BSH3PWJNCNR7RFBR5Q356Z5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DialSort: Non-Comparative Integer Sorting via the Self-Indexing Principle: Architecture, Implementation, and Substrate-Aware Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"DialSort sorts bounded-universe integers by treating the histogram of counts as the final ordered sequence, eliminating the prefix-sum step through direct key indexing.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Narvaez","submitted_at":"2026-05-15T22:05:09Z","abstract_excerpt":"Sorting over bounded-universe integer keys has traditionally relied on counting sort and radix sort, both of which incur mandatory prefix-sum passes, auxiliary scatter buffers, or multiple permutation passes. This paper introduces DialSort, a non-comparative sorting architecture based on the self-indexing principle: each integer key simultaneously encodes its value and its canonical position in the ordered address space [0,U-1]. DialSort eliminates the prefix-sum pass entirely by treating the histogram H as the canonical ordered representation, not as an intermediate structure.\n  To support pa"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"DialSort eliminates the prefix-sum pass entirely by treating the histogram H as the canonical ordered representation, not as an intermediate structure. Formal proofs establish O(n+U) sequential and O(n/k + log k + U) parallel time bounds. A software prototype achieves 39.77x speedup over std::sort and wins against Classic Counting Sort in 46 of 48 configurations.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The method presupposes a known bounded universe size U that is small enough to allocate a histogram array of size U and that all input keys are non-negative integers lying in [0, U-1]; this premise is required for the self-indexing principle to map keys directly to canonical positions without additional range checks or dynamic resizing.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"DialSort is a non-comparative integer sorting algorithm that eliminates the prefix-sum pass via self-indexing and uses a Conflict Resolution Network for parallel operation, with reported O(n+U) sequential and O(n/k + log k + U) parallel bounds plus empirical speedups up to 39.77x over std::sort.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"DialSort sorts bounded-universe integers by treating the histogram of counts as the final ordered sequence, eliminating the prefix-sum step through direct key indexing.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a335529e1d83f6682a40d459712417bfb884b9784522869035ec2c4129c81307"},"source":{"id":"2605.16667","kind":"arxiv","version":1},"verdict":{"id":"55e3a0b3-9af3-440c-b720-9e5f49876914","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T20:29:06.706382Z","strongest_claim":"DialSort eliminates the prefix-sum pass entirely by treating the histogram H as the canonical ordered representation, not as an intermediate structure. Formal proofs establish O(n+U) sequential and O(n/k + log k + U) parallel time bounds. A software prototype achieves 39.77x speedup over std::sort and wins against Classic Counting Sort in 46 of 48 configurations.","one_line_summary":"DialSort is a non-comparative integer sorting algorithm that eliminates the prefix-sum pass via self-indexing and uses a Conflict Resolution Network for parallel operation, with reported O(n+U) sequential and O(n/k + log k + U) parallel bounds plus empirical speedups up to 39.77x over std::sort.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The method presupposes a known bounded universe size U that is small enough to allocate a histogram array of size U and that all input keys are non-negative integers lying in [0, U-1]; this premise is required for the self-indexing principle to map keys directly to canonical positions without additional range checks or dynamic resizing.","pith_extraction_headline":"DialSort sorts bounded-universe integers by treating the histogram of counts as the final ordered sequence, eliminating the prefix-sum step through direct key indexing."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16667/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.299749Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T20:41:38.805806Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.393125Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.513069Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"ae100c6ecaa23b6dc6f4bfef751a4d70e288b406b545bdddfa014a5bafafb16e"},"references":{"count":14,"sample":[{"doi":"","year":1998,"title":"D. E. Knuth,The Art of Computer Program- ming, Vol. 3: Sorting and Searching, 2nd ed. Addison-Wesley, 1998","work_id":"5a678c9d-bc06-4da1-8483-d1d311a2548b","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein,Introduction to Algorithms, 3rd ed. MIT Press, 2009","work_id":"0f232ddf-32a5-4753-b30e-e5f071534577","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"In-place parallel super scalar sam- plesort (IPS 4o),","work_id":"34254c91-0646-4145-9181-66f87e6f5a89","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"Super scalar sam- ple sort,","work_id":"f7ebb648-2ede-49d9-aa2a-2cc47a2763ae","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1954,"title":"Information sorting in the application of electronic digital computers to business operations,","work_id":"a9806534-b42f-46a6-88ec-dfc6ecd3254d","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":14,"snapshot_sha256":"222eaea54a1035ad766db9328dd7d2a94f51efa24f06f1653eb2c107ea44f9e0","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"996aa338578a2bcd1e89d5948c20ad1cb0218a3c9b2b90c0acd9cf809ed1339d"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"55e3a0b3-9af3-440c-b720-9e5f49876914"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:02:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LiggS0v+ilK5wnw4BsMkfM7DHcl4b0GMAyu46TQyeup0wHu8XsxxTansr+1nWt0u8Z+ST6tCbtNyjBNpGdD6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:44:49.241198Z"},"content_sha256":"0306aed830e71628395b9f5ce8a39e890acd784e573c5cd1fd629dd1a1c10c87","schema_version":"1.0","event_id":"sha256:0306aed830e71628395b9f5ce8a39e890acd784e573c5cd1fd629dd1a1c10c87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SU5BSH3PWJNCNR7RFBR5Q356Z5/bundle.json","state_url":"https://pith.science/pith/SU5BSH3PWJNCNR7RFBR5Q356Z5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SU5BSH3PWJNCNR7RFBR5Q356Z5/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-05T03:44:49Z","links":{"resolver":"https://pith.science/pith/SU5BSH3PWJNCNR7RFBR5Q356Z5","bundle":"https://pith.science/pith/SU5BSH3PWJNCNR7RFBR5Q356Z5/bundle.json","state":"https://pith.science/pith/SU5BSH3PWJNCNR7RFBR5Q356Z5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SU5BSH3PWJNCNR7RFBR5Q356Z5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SU5BSH3PWJNCNR7RFBR5Q356Z5","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":"2205cce68995b0c5ee54c2ccc334b6e78eed6e21d8b1dd0ca33313b7a349e131","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T22:05:09Z","title_canon_sha256":"57353dd4873766a96b6500bbe08c44e97f6efef2ad664ad7f63fd207000e7bbd"},"schema_version":"1.0","source":{"id":"2605.16667","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16667","created_at":"2026-05-20T00:02:35Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16667v1","created_at":"2026-05-20T00:02:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16667","created_at":"2026-05-20T00:02:35Z"},{"alias_kind":"pith_short_12","alias_value":"SU5BSH3PWJNC","created_at":"2026-05-20T00:02:35Z"},{"alias_kind":"pith_short_16","alias_value":"SU5BSH3PWJNCNR7R","created_at":"2026-05-20T00:02:35Z"},{"alias_kind":"pith_short_8","alias_value":"SU5BSH3P","created_at":"2026-05-20T00:02:35Z"}],"graph_snapshots":[{"event_id":"sha256:0306aed830e71628395b9f5ce8a39e890acd784e573c5cd1fd629dd1a1c10c87","target":"graph","created_at":"2026-05-20T00:02:35Z","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":"DialSort eliminates the prefix-sum pass entirely by treating the histogram H as the canonical ordered representation, not as an intermediate structure. Formal proofs establish O(n+U) sequential and O(n/k + log k + U) parallel time bounds. A software prototype achieves 39.77x speedup over std::sort and wins against Classic Counting Sort in 46 of 48 configurations."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The method presupposes a known bounded universe size U that is small enough to allocate a histogram array of size U and that all input keys are non-negative integers lying in [0, U-1]; this premise is required for the self-indexing principle to map keys directly to canonical positions without additional range checks or dynamic resizing."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"DialSort is a non-comparative integer sorting algorithm that eliminates the prefix-sum pass via self-indexing and uses a Conflict Resolution Network for parallel operation, with reported O(n+U) sequential and O(n/k + log k + U) parallel bounds plus empirical speedups up to 39.77x over std::sort."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"DialSort sorts bounded-universe integers by treating the histogram of counts as the final ordered sequence, eliminating the prefix-sum step through direct key indexing."}],"snapshot_sha256":"a335529e1d83f6682a40d459712417bfb884b9784522869035ec2c4129c81307"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"996aa338578a2bcd1e89d5948c20ad1cb0218a3c9b2b90c0acd9cf809ed1339d"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.299749Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T20:41:38.805806Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.393125Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.513069Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16667/integrity.json","findings":[],"snapshot_sha256":"ae100c6ecaa23b6dc6f4bfef751a4d70e288b406b545bdddfa014a5bafafb16e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sorting over bounded-universe integer keys has traditionally relied on counting sort and radix sort, both of which incur mandatory prefix-sum passes, auxiliary scatter buffers, or multiple permutation passes. This paper introduces DialSort, a non-comparative sorting architecture based on the self-indexing principle: each integer key simultaneously encodes its value and its canonical position in the ordered address space [0,U-1]. DialSort eliminates the prefix-sum pass entirely by treating the histogram H as the canonical ordered representation, not as an intermediate structure.\n  To support pa","authors_text":"Alexander Narvaez","cross_cats":[],"headline":"DialSort sorts bounded-universe integers by treating the histogram of counts as the final ordered sequence, eliminating the prefix-sum step through direct key indexing.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T22:05:09Z","title":"DialSort: Non-Comparative Integer Sorting via the Self-Indexing Principle: Architecture, Implementation, and Substrate-Aware Analysis"},"references":{"count":14,"internal_anchors":0,"resolved_work":14,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"D. E. Knuth,The Art of Computer Program- ming, Vol. 3: Sorting and Searching, 2nd ed. Addison-Wesley, 1998","work_id":"5a678c9d-bc06-4da1-8483-d1d311a2548b","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein,Introduction to Algorithms, 3rd ed. MIT Press, 2009","work_id":"0f232ddf-32a5-4753-b30e-e5f071534577","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"In-place parallel super scalar sam- plesort (IPS 4o),","work_id":"34254c91-0646-4145-9181-66f87e6f5a89","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Super scalar sam- ple sort,","work_id":"f7ebb648-2ede-49d9-aa2a-2cc47a2763ae","year":2004},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Information sorting in the application of electronic digital computers to business operations,","work_id":"a9806534-b42f-46a6-88ec-dfc6ecd3254d","year":1954}],"snapshot_sha256":"222eaea54a1035ad766db9328dd7d2a94f51efa24f06f1653eb2c107ea44f9e0"},"source":{"id":"2605.16667","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T20:29:06.706382Z","id":"55e3a0b3-9af3-440c-b720-9e5f49876914","model_set":{"reader":"grok-4.3"},"one_line_summary":"DialSort is a non-comparative integer sorting algorithm that eliminates the prefix-sum pass via self-indexing and uses a Conflict Resolution Network for parallel operation, with reported O(n+U) sequential and O(n/k + log k + U) parallel bounds plus empirical speedups up to 39.77x over std::sort.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"DialSort sorts bounded-universe integers by treating the histogram of counts as the final ordered sequence, eliminating the prefix-sum step through direct key indexing.","strongest_claim":"DialSort eliminates the prefix-sum pass entirely by treating the histogram H as the canonical ordered representation, not as an intermediate structure. Formal proofs establish O(n+U) sequential and O(n/k + log k + U) parallel time bounds. A software prototype achieves 39.77x speedup over std::sort and wins against Classic Counting Sort in 46 of 48 configurations.","weakest_assumption":"The method presupposes a known bounded universe size U that is small enough to allocate a histogram array of size U and that all input keys are non-negative integers lying in [0, U-1]; this premise is required for the self-indexing principle to map keys directly to canonical positions without additional range checks or dynamic resizing."}},"verdict_id":"55e3a0b3-9af3-440c-b720-9e5f49876914"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e67dcd8fc0a44d57446b8588b04e988533e668fb49e50cad97c6f0817da1628c","target":"record","created_at":"2026-05-20T00:02:35Z","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":"2205cce68995b0c5ee54c2ccc334b6e78eed6e21d8b1dd0ca33313b7a349e131","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T22:05:09Z","title_canon_sha256":"57353dd4873766a96b6500bbe08c44e97f6efef2ad664ad7f63fd207000e7bbd"},"schema_version":"1.0","source":{"id":"2605.16667","kind":"arxiv","version":1}},"canonical_sha256":"953a191f6fb25a26c7f12863d86fbecf63d8fec8ea2884aa45f98266a17ab922","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"953a191f6fb25a26c7f12863d86fbecf63d8fec8ea2884aa45f98266a17ab922","first_computed_at":"2026-05-20T00:02:35.360582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:02:35.360582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qCW793uVP4ZsQV2M31JRVMGrFoCWvpoJpfxZtBZVR4+SRt/gUvx0T9Tvrk8332xAwp++7PX1qJXUUsWsGqA6AA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:02:35.361530Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16667","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e67dcd8fc0a44d57446b8588b04e988533e668fb49e50cad97c6f0817da1628c","sha256:0306aed830e71628395b9f5ce8a39e890acd784e573c5cd1fd629dd1a1c10c87"],"state_sha256":"9a4a68aeab429c5997bddec559c622a6e95ab8b2c802cf019c7f66133399f6b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vNANa/XbbxsofzhMLbiUqsImsbUU7D1dvmXLJfM5Na58q0qNhA9h0CJh5pA9v7BZTuYaBrd3pMipXTZS9oJKDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:44:49.246239Z","bundle_sha256":"68887a5a363f5eb04c05b45a09207c36b008eed6b756dd54a107024260c803fe"}}