{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LADN3ZC5D5ESTCFVARS6BXXLB7","short_pith_number":"pith:LADN3ZC5","schema_version":"1.0","canonical_sha256":"5806dde45d1f492988b50465e0deeb0fc1f16f3972125c9b45472cfeadbdbbe6","source":{"kind":"arxiv","id":"2607.29453","version":1},"attestation_state":"computed","paper":{"title":"Quantum Algorithms for Modular Factorials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Yann Tal","submitted_at":"2026-07-31T14:15:12Z","abstract_excerpt":"We give a bounded-error quantum algorithm that, given a prime $p$, a divisor $q\\mid(p-1)$, and an integer $0<n<p$, computes $n!\\bmod p$ in expected time $\\widetilde{O}(q^c+\\sqrt{p/q})$ for some absolute constant $c\\ge 1$. When $p-1$ has a divisor of size $q\\approx p^{1/(2c+1)}$, this gives the exponent $c/(2c+1)<1/2$. To our knowledge, this is the first algorithm to break the exponent $1/2$ barrier for modular factorials under such a divisor promise. The main technical ingredient is a quantum algorithm that reconstructs the relevant Jacobi sum exactly in compact algebraic form, with polynomial"},"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":"2607.29453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-31T14:15:12Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"66a18e05d61c2f9c7743ef6438d1e955ca09e36bb9acd09f3590790c8d3d560f","abstract_canon_sha256":"66d5bcdf7e9567c374ebabecc084f2dc337965a5629c0361112cd1ab5c6dfb5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:34:36.565028Z","signature_b64":"40BSSwTZMXyvp0T1XG7GPP2vOOwZwzfbrIXIW+cmwiHsviayh2K3Ro/vzKyPNBOWmRBQolvg3krNO6xinBKdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5806dde45d1f492988b50465e0deeb0fc1f16f3972125c9b45472cfeadbdbbe6","last_reissued_at":"2026-08-03T01:34:36.563512Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:34:36.563512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithms for Modular Factorials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Yann Tal","submitted_at":"2026-07-31T14:15:12Z","abstract_excerpt":"We give a bounded-error quantum algorithm that, given a prime $p$, a divisor $q\\mid(p-1)$, and an integer $0<n<p$, computes $n!\\bmod p$ in expected time $\\widetilde{O}(q^c+\\sqrt{p/q})$ for some absolute constant $c\\ge 1$. When $p-1$ has a divisor of size $q\\approx p^{1/(2c+1)}$, this gives the exponent $c/(2c+1)<1/2$. To our knowledge, this is the first algorithm to break the exponent $1/2$ barrier for modular factorials under such a divisor promise. The main technical ingredient is a quantum algorithm that reconstructs the relevant Jacobi sum exactly in compact algebraic form, with polynomial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.29453","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/2607.29453/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":"2607.29453","created_at":"2026-08-03T01:34:36.564378+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.29453v1","created_at":"2026-08-03T01:34:36.564378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.29453","created_at":"2026-08-03T01:34:36.564378+00:00"},{"alias_kind":"pith_short_12","alias_value":"LADN3ZC5D5ES","created_at":"2026-08-03T01:34:36.564378+00:00"},{"alias_kind":"pith_short_16","alias_value":"LADN3ZC5D5ESTCFV","created_at":"2026-08-03T01:34:36.564378+00:00"},{"alias_kind":"pith_short_8","alias_value":"LADN3ZC5","created_at":"2026-08-03T01:34:36.564378+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/LADN3ZC5D5ESTCFVARS6BXXLB7","json":"https://pith.science/pith/LADN3ZC5D5ESTCFVARS6BXXLB7.json","graph_json":"https://pith.science/api/pith-number/LADN3ZC5D5ESTCFVARS6BXXLB7/graph.json","events_json":"https://pith.science/api/pith-number/LADN3ZC5D5ESTCFVARS6BXXLB7/events.json","paper":"https://pith.science/paper/LADN3ZC5"},"agent_actions":{"view_html":"https://pith.science/pith/LADN3ZC5D5ESTCFVARS6BXXLB7","download_json":"https://pith.science/pith/LADN3ZC5D5ESTCFVARS6BXXLB7.json","view_paper":"https://pith.science/paper/LADN3ZC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.29453&json=true","fetch_graph":"https://pith.science/api/pith-number/LADN3ZC5D5ESTCFVARS6BXXLB7/graph.json","fetch_events":"https://pith.science/api/pith-number/LADN3ZC5D5ESTCFVARS6BXXLB7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LADN3ZC5D5ESTCFVARS6BXXLB7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LADN3ZC5D5ESTCFVARS6BXXLB7/action/storage_attestation","attest_author":"https://pith.science/pith/LADN3ZC5D5ESTCFVARS6BXXLB7/action/author_attestation","sign_citation":"https://pith.science/pith/LADN3ZC5D5ESTCFVARS6BXXLB7/action/citation_signature","submit_replication":"https://pith.science/pith/LADN3ZC5D5ESTCFVARS6BXXLB7/action/replication_record"}},"created_at":"2026-08-03T01:34:36.564378+00:00","updated_at":"2026-08-03T01:34:36.564378+00:00"}