{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5SCIFHDGTWA2R4KPZ4WJA2Q3ZC","short_pith_number":"pith:5SCIFHDG","canonical_record":{"source":{"id":"2605.18415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-18T13:52:39Z","cross_cats_sorted":[],"title_canon_sha256":"3a18c8523780390119c8f32bd1730542200afae6a64384efb4e942f2b946cef6","abstract_canon_sha256":"4b20af858c549afc828ed5b5a57fe9b807f94268a487162b1bf930c9deee1869"},"schema_version":"1.0"},"canonical_sha256":"ec84829c669d81a8f14fcf2c906a1bc8b29e62295540be8b9693d52812a9b952","source":{"kind":"arxiv","id":"2605.18415","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18415","created_at":"2026-05-20T00:05:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18415v1","created_at":"2026-05-20T00:05:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18415","created_at":"2026-05-20T00:05:59Z"},{"alias_kind":"pith_short_12","alias_value":"5SCIFHDGTWA2","created_at":"2026-05-20T00:05:59Z"},{"alias_kind":"pith_short_16","alias_value":"5SCIFHDGTWA2R4KP","created_at":"2026-05-20T00:05:59Z"},{"alias_kind":"pith_short_8","alias_value":"5SCIFHDG","created_at":"2026-05-20T00:05:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5SCIFHDGTWA2R4KPZ4WJA2Q3ZC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.18415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-18T13:52:39Z","cross_cats_sorted":[],"title_canon_sha256":"3a18c8523780390119c8f32bd1730542200afae6a64384efb4e942f2b946cef6","abstract_canon_sha256":"4b20af858c549afc828ed5b5a57fe9b807f94268a487162b1bf930c9deee1869"},"schema_version":"1.0"},"canonical_sha256":"ec84829c669d81a8f14fcf2c906a1bc8b29e62295540be8b9693d52812a9b952","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:59.586579Z","signature_b64":"aqPERYTa01LsVqpcJGXsQDSdhqASgTKqBALAXMd96ud2yCACpFDORWzUAJSB+2WVgbbbdhvw659sDZKR30coCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec84829c669d81a8f14fcf2c906a1bc8b29e62295540be8b9693d52812a9b952","last_reissued_at":"2026-05-20T00:05:59.585843Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:59.585843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.18415","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:05:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uyk6k2WmkO70M8JeFj5a9TSu33jxiSqs896FCY2ZkekpjaMLd4gw/LhQWy1wyWRR9Oh05zVF/C6LK7NG33ZtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:21:57.166682Z"},"content_sha256":"12e71070d0bff2832ef844e9982056d0c93bad5b5d2945a1af1f695cc15499c1","schema_version":"1.0","event_id":"sha256:12e71070d0bff2832ef844e9982056d0c93bad5b5d2945a1af1f695cc15499c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5SCIFHDGTWA2R4KPZ4WJA2Q3ZC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Residue Number System Comparison revisited, a software perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A Residue Number System comparison method works over the full dynamic range using one mixed-radix conversion and an extra modulus.","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jean-Marc Robert (UTLN), Laurent-St\\'ephane Didier (UTLN), L\\'ea Glandus (UTLN), Nadia El Mrabet","submitted_at":"2026-05-18T13:52:39Z","abstract_excerpt":"This paper presents a novel method to compare two numbers in Residue Number System (RNS) using an additional modulus, which is often already available because it is required in modular computations and digital signal processing scaling.Our method provides the comparison of two integers in the full range of the RNS base. It does not require moduli of a special form, unlike other state-of-the-art methods that are restricted to specific RNS bases or require bounds on input numbers. Our approach only requires one single conversion to a mixed radix representation with a complexity of O(n2), which c"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our method provides the comparison of two integers in the full range of the RNS base. It does not require moduli of a special form, unlike other state-of-the-art methods that are restricted to specific RNS bases or require bounds on input numbers. Our approach only requires one single conversion to a mixed radix representation with a complexity of O(n2), which can be reduced to O(log(n)) in time with parallelization.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The additional modulus is available without conflicting with the existing RNS base and that the single mixed-radix conversion step correctly determines the ordering for any pair of numbers in the full dynamic range.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Presents an RNS comparison technique using an additional modulus for full-range comparison via one mixed-radix conversion with O(n²) complexity.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A Residue Number System comparison method works over the full dynamic range using one mixed-radix conversion and an extra modulus.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c4f094fba09af2b1db3d30e3efa19c330a8b08d9a36ccc2a806d852b0a8cda21"},"source":{"id":"2605.18415","kind":"arxiv","version":1},"verdict":{"id":"5baa9006-d77b-4825-9d8d-faffd22d8a85","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T23:39:39.560572Z","strongest_claim":"Our method provides the comparison of two integers in the full range of the RNS base. It does not require moduli of a special form, unlike other state-of-the-art methods that are restricted to specific RNS bases or require bounds on input numbers. Our approach only requires one single conversion to a mixed radix representation with a complexity of O(n2), which can be reduced to O(log(n)) in time with parallelization.","one_line_summary":"Presents an RNS comparison technique using an additional modulus for full-range comparison via one mixed-radix conversion with O(n²) complexity.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The additional modulus is available without conflicting with the existing RNS base and that the single mixed-radix conversion step correctly determines the ordering for any pair of numbers in the full dynamic range.","pith_extraction_headline":"A Residue Number System comparison method works over the full dynamic range using one mixed-radix conversion and an extra modulus."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.18415/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-20T00:01:20.283744Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T23:51:35.567906Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T23:49:57.541340Z","status":"completed","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:27.597014Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T23:31:36.028673Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T23:22:00.670718Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.693906Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"70785d8b4872e5c4913ffa1838ebaee8e841f20b20c0bf74c3cb4a8b03a2adc9"},"references":{"count":24,"sample":[{"doi":"","year":1977,"title":"A new positional characte ristic of non-positional codes and its application","work_id":"7ee47e0d-a919-4038-89a1-0ba951d90b3d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2001,"title":"Modular multiplication and base extensions in residue numbersystems","work_id":"bed68fce-3fce-49be-890c-063c8d5a1516","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"A new euclidean division algorithm for residue number systems","work_id":"8487aebd-a3cb-4e80-b03f-6b0db8acce9d","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1993,"title":"A ne w technique for fast number com- parison in the residue number system","work_id":"0007d8bd-3447-4ad8-a58a-08a868886c02","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1969,"title":"Residue arithmetic and its application to computer te chnology (Nicholas S","work_id":"1c6437fd-12b0-4560-b04f-d0d7721288cc","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":24,"snapshot_sha256":"108dda7169ac75a29ef06d0b9650139d06967a7e0d8fe3901dfe45581236cad7","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"fa893ef16b2f00e6b31538065d46ed2882f44d02e41b4a89df4a781e6f7ef0ab"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"5baa9006-d77b-4825-9d8d-faffd22d8a85"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:05:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4RMTWNhhgGdFd5/9jCWAWsOe03w+pv3K5A8+GHP+fTS/N+bRTlq2C41YXt3MrJdgA2qmXdXc4WxUt1euTGOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:21:57.167345Z"},"content_sha256":"0ad72dc23d13c5d453c0a0a64513ca5c23f253f019a33ad38f5c99ec71367db8","schema_version":"1.0","event_id":"sha256:0ad72dc23d13c5d453c0a0a64513ca5c23f253f019a33ad38f5c99ec71367db8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SCIFHDGTWA2R4KPZ4WJA2Q3ZC/bundle.json","state_url":"https://pith.science/pith/5SCIFHDGTWA2R4KPZ4WJA2Q3ZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SCIFHDGTWA2R4KPZ4WJA2Q3ZC/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-05T12:21:57Z","links":{"resolver":"https://pith.science/pith/5SCIFHDGTWA2R4KPZ4WJA2Q3ZC","bundle":"https://pith.science/pith/5SCIFHDGTWA2R4KPZ4WJA2Q3ZC/bundle.json","state":"https://pith.science/pith/5SCIFHDGTWA2R4KPZ4WJA2Q3ZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SCIFHDGTWA2R4KPZ4WJA2Q3ZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5SCIFHDGTWA2R4KPZ4WJA2Q3ZC","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":"4b20af858c549afc828ed5b5a57fe9b807f94268a487162b1bf930c9deee1869","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-18T13:52:39Z","title_canon_sha256":"3a18c8523780390119c8f32bd1730542200afae6a64384efb4e942f2b946cef6"},"schema_version":"1.0","source":{"id":"2605.18415","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18415","created_at":"2026-05-20T00:05:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18415v1","created_at":"2026-05-20T00:05:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18415","created_at":"2026-05-20T00:05:59Z"},{"alias_kind":"pith_short_12","alias_value":"5SCIFHDGTWA2","created_at":"2026-05-20T00:05:59Z"},{"alias_kind":"pith_short_16","alias_value":"5SCIFHDGTWA2R4KP","created_at":"2026-05-20T00:05:59Z"},{"alias_kind":"pith_short_8","alias_value":"5SCIFHDG","created_at":"2026-05-20T00:05:59Z"}],"graph_snapshots":[{"event_id":"sha256:0ad72dc23d13c5d453c0a0a64513ca5c23f253f019a33ad38f5c99ec71367db8","target":"graph","created_at":"2026-05-20T00:05:59Z","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":"Our method provides the comparison of two integers in the full range of the RNS base. It does not require moduli of a special form, unlike other state-of-the-art methods that are restricted to specific RNS bases or require bounds on input numbers. Our approach only requires one single conversion to a mixed radix representation with a complexity of O(n2), which can be reduced to O(log(n)) in time with parallelization."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The additional modulus is available without conflicting with the existing RNS base and that the single mixed-radix conversion step correctly determines the ordering for any pair of numbers in the full dynamic range."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Presents an RNS comparison technique using an additional modulus for full-range comparison via one mixed-radix conversion with O(n²) complexity."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A Residue Number System comparison method works over the full dynamic range using one mixed-radix conversion and an extra modulus."}],"snapshot_sha256":"c4f094fba09af2b1db3d30e3efa19c330a8b08d9a36ccc2a806d852b0a8cda21"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"fa893ef16b2f00e6b31538065d46ed2882f44d02e41b4a89df4a781e6f7ef0ab"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T00:01:20.283744Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T23:51:35.567906Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T23:49:57.541340Z","status":"completed","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:27.597014Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"external_links","ran_at":"2026-05-19T23:31:36.028673Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T23:22:00.670718Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.693906Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.18415/integrity.json","findings":[],"snapshot_sha256":"70785d8b4872e5c4913ffa1838ebaee8e841f20b20c0bf74c3cb4a8b03a2adc9","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a novel method to compare two numbers in Residue Number System (RNS) using an additional modulus, which is often already available because it is required in modular computations and digital signal processing scaling.Our method provides the comparison of two integers in the full range of the RNS base. It does not require moduli of a special form, unlike other state-of-the-art methods that are restricted to specific RNS bases or require bounds on input numbers. Our approach only requires one single conversion to a mixed radix representation with a complexity of O(n2), which c","authors_text":"Jean-Marc Robert (UTLN), Laurent-St\\'ephane Didier (UTLN), L\\'ea Glandus (UTLN), Nadia El Mrabet","cross_cats":[],"headline":"A Residue Number System comparison method works over the full dynamic range using one mixed-radix conversion and an extra modulus.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-18T13:52:39Z","title":"Residue Number System Comparison revisited, a software perspective"},"references":{"count":24,"internal_anchors":0,"resolved_work":24,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A new positional characte ristic of non-positional codes and its application","work_id":"7ee47e0d-a919-4038-89a1-0ba951d90b3d","year":1977},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Modular multiplication and base extensions in residue numbersystems","work_id":"bed68fce-3fce-49be-890c-063c8d5a1516","year":2001},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A new euclidean division algorithm for residue number systems","work_id":"8487aebd-a3cb-4e80-b03f-6b0db8acce9d","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A ne w technique for fast number com- parison in the residue number system","work_id":"0007d8bd-3447-4ad8-a58a-08a868886c02","year":1993},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Residue arithmetic and its application to computer te chnology (Nicholas S","work_id":"1c6437fd-12b0-4560-b04f-d0d7721288cc","year":1969}],"snapshot_sha256":"108dda7169ac75a29ef06d0b9650139d06967a7e0d8fe3901dfe45581236cad7"},"source":{"id":"2605.18415","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T23:39:39.560572Z","id":"5baa9006-d77b-4825-9d8d-faffd22d8a85","model_set":{"reader":"grok-4.3"},"one_line_summary":"Presents an RNS comparison technique using an additional modulus for full-range comparison via one mixed-radix conversion with O(n²) complexity.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A Residue Number System comparison method works over the full dynamic range using one mixed-radix conversion and an extra modulus.","strongest_claim":"Our method provides the comparison of two integers in the full range of the RNS base. It does not require moduli of a special form, unlike other state-of-the-art methods that are restricted to specific RNS bases or require bounds on input numbers. Our approach only requires one single conversion to a mixed radix representation with a complexity of O(n2), which can be reduced to O(log(n)) in time with parallelization.","weakest_assumption":"The additional modulus is available without conflicting with the existing RNS base and that the single mixed-radix conversion step correctly determines the ordering for any pair of numbers in the full dynamic range."}},"verdict_id":"5baa9006-d77b-4825-9d8d-faffd22d8a85"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:12e71070d0bff2832ef844e9982056d0c93bad5b5d2945a1af1f695cc15499c1","target":"record","created_at":"2026-05-20T00:05:59Z","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":"4b20af858c549afc828ed5b5a57fe9b807f94268a487162b1bf930c9deee1869","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-18T13:52:39Z","title_canon_sha256":"3a18c8523780390119c8f32bd1730542200afae6a64384efb4e942f2b946cef6"},"schema_version":"1.0","source":{"id":"2605.18415","kind":"arxiv","version":1}},"canonical_sha256":"ec84829c669d81a8f14fcf2c906a1bc8b29e62295540be8b9693d52812a9b952","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec84829c669d81a8f14fcf2c906a1bc8b29e62295540be8b9693d52812a9b952","first_computed_at":"2026-05-20T00:05:59.585843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:59.585843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aqPERYTa01LsVqpcJGXsQDSdhqASgTKqBALAXMd96ud2yCACpFDORWzUAJSB+2WVgbbbdhvw659sDZKR30coCw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:59.586579Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18415","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12e71070d0bff2832ef844e9982056d0c93bad5b5d2945a1af1f695cc15499c1","sha256:0ad72dc23d13c5d453c0a0a64513ca5c23f253f019a33ad38f5c99ec71367db8"],"state_sha256":"9d9e7a241586eddfa4a6f799c9bfb191f170fd4339868495dc39855c4d673108"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mqBxgI/9I6Ixug2oRo/umdKKujaUZ6P/JEVpqbBxFU/vsmCHXYOks1S6Rej33aYrAxAnG5+MM1GIi3FEn6BWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:21:57.170024Z","bundle_sha256":"6170d8a8994dfad14f87e282c39acc88cfa4a5153e93c86c5314c59d941e2ae4"}}