{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:EBNC2SE4QL2GL554QWJ3SBXSBW","short_pith_number":"pith:EBNC2SE4","schema_version":"1.0","canonical_sha256":"205a2d489c82f465f7bc8593b906f20d8147aa27928097f04438eebe2c73c397","source":{"kind":"arxiv","id":"2608.11563","version":1},"attestation_state":"computed","paper":{"title":"Efficient Quantum Modular Reduction: Crandall reduction and its Fault-tolerant resource analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Changyeol Lee, Ilkwon Sohn, Kwangil Bae, Sungyeon Kook, Wonhyuk Lee, Wooyeong Song","submitted_at":"2026-08-12T02:07:24Z","abstract_excerpt":"Modular arithmetic is central to quantum algorithms for cryptographic problems, including Shor's algorithm and Grover-based cryptanalysis, with modular reduction contributing substantially to circuit cost. Pseudo-Mersenne moduli $q=2^n-c$ allow classical Crandall reduction to replace division with folding and constant arithmetic, providing a structural opportunity for more efficient quantum modular reduction than Barrett reduction. We translate this advantage into a reversible quantum setting by deriving explicit folding and normalization conditions for $2n$-bit inputs. To the best of our know"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2608.11563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-12T02:07:24Z","cross_cats_sorted":[],"title_canon_sha256":"afd420f9b5a1878a32c6fb2a036a3bd021ebb2a641ef898e8300a78e705b208f","abstract_canon_sha256":"7c2d28f72464cb36dd91536a4acfb29c857945b55fd13599014c7296d1d68f5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-13T00:22:11.686810Z","signature_b64":"UtbBO4Gg8gBnCwDFO1U5ymaJ5LrDP79OU3U3CU24dZbgSy7Dbmh9YhsKViPD9jB6Wiklf9X3do4vj/1pj4C+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"205a2d489c82f465f7bc8593b906f20d8147aa27928097f04438eebe2c73c397","last_reissued_at":"2026-08-13T00:22:11.685219Z","signature_status":"signed_v1","first_computed_at":"2026-08-13T00:22:11.685219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Quantum Modular Reduction: Crandall reduction and its Fault-tolerant resource analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Changyeol Lee, Ilkwon Sohn, Kwangil Bae, Sungyeon Kook, Wonhyuk Lee, Wooyeong Song","submitted_at":"2026-08-12T02:07:24Z","abstract_excerpt":"Modular arithmetic is central to quantum algorithms for cryptographic problems, including Shor's algorithm and Grover-based cryptanalysis, with modular reduction contributing substantially to circuit cost. Pseudo-Mersenne moduli $q=2^n-c$ allow classical Crandall reduction to replace division with folding and constant arithmetic, providing a structural opportunity for more efficient quantum modular reduction than Barrett reduction. We translate this advantage into a reversible quantum setting by deriving explicit folding and normalization conditions for $2n$-bit inputs. To the best of our know"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11563","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/2608.11563/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.11563","created_at":"2026-08-13T00:22:11.685530+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.11563v1","created_at":"2026-08-13T00:22:11.685530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11563","created_at":"2026-08-13T00:22:11.685530+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBNC2SE4QL2G","created_at":"2026-08-13T00:22:11.685530+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBNC2SE4QL2GL554","created_at":"2026-08-13T00:22:11.685530+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBNC2SE4","created_at":"2026-08-13T00:22:11.685530+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EBNC2SE4QL2GL554QWJ3SBXSBW","json":"https://pith.science/pith/EBNC2SE4QL2GL554QWJ3SBXSBW.json","graph_json":"https://pith.science/api/pith-number/EBNC2SE4QL2GL554QWJ3SBXSBW/graph.json","events_json":"https://pith.science/api/pith-number/EBNC2SE4QL2GL554QWJ3SBXSBW/events.json","paper":"https://pith.science/paper/EBNC2SE4"},"agent_actions":{"view_html":"https://pith.science/pith/EBNC2SE4QL2GL554QWJ3SBXSBW","download_json":"https://pith.science/pith/EBNC2SE4QL2GL554QWJ3SBXSBW.json","view_paper":"https://pith.science/paper/EBNC2SE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.11563&json=true","fetch_graph":"https://pith.science/api/pith-number/EBNC2SE4QL2GL554QWJ3SBXSBW/graph.json","fetch_events":"https://pith.science/api/pith-number/EBNC2SE4QL2GL554QWJ3SBXSBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBNC2SE4QL2GL554QWJ3SBXSBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBNC2SE4QL2GL554QWJ3SBXSBW/action/storage_attestation","attest_author":"https://pith.science/pith/EBNC2SE4QL2GL554QWJ3SBXSBW/action/author_attestation","sign_citation":"https://pith.science/pith/EBNC2SE4QL2GL554QWJ3SBXSBW/action/citation_signature","submit_replication":"https://pith.science/pith/EBNC2SE4QL2GL554QWJ3SBXSBW/action/replication_record"}},"created_at":"2026-08-13T00:22:11.685530+00:00","updated_at":"2026-08-13T00:22:11.685530+00:00"}