{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LADN3ZC5D5ESTCFVARS6BXXLB7","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"66d5bcdf7e9567c374ebabecc084f2dc337965a5629c0361112cd1ab5c6dfb5f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-31T14:15:12Z","title_canon_sha256":"66a18e05d61c2f9c7743ef6438d1e955ca09e36bb9acd09f3590790c8d3d560f"},"schema_version":"1.0","source":{"id":"2607.29453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.29453","created_at":"2026-08-03T01:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"2607.29453v1","created_at":"2026-08-03T01:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.29453","created_at":"2026-08-03T01:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"LADN3ZC5D5ES","created_at":"2026-08-03T01:34:36Z"},{"alias_kind":"pith_short_16","alias_value":"LADN3ZC5D5ESTCFV","created_at":"2026-08-03T01:34:36Z"},{"alias_kind":"pith_short_8","alias_value":"LADN3ZC5","created_at":"2026-08-03T01:34:36Z"}],"graph_snapshots":[{"event_id":"sha256:7297e25504b79748e437b156f26201a1343107725aa64f00dbe59ae4deae43dd","target":"graph","created_at":"2026-08-03T01:34:36Z","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/2607.29453/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Yann Tal","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.29453","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:63767b638b993b95c77e1f2c4f6f0f1949cdfd6e5b933a73e54c3306e774870b","target":"record","created_at":"2026-08-03T01:34:36Z","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":"66d5bcdf7e9567c374ebabecc084f2dc337965a5629c0361112cd1ab5c6dfb5f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-31T14:15:12Z","title_canon_sha256":"66a18e05d61c2f9c7743ef6438d1e955ca09e36bb9acd09f3590790c8d3d560f"},"schema_version":"1.0","source":{"id":"2607.29453","kind":"arxiv","version":1}},"canonical_sha256":"5806dde45d1f492988b50465e0deeb0fc1f16f3972125c9b45472cfeadbdbbe6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5806dde45d1f492988b50465e0deeb0fc1f16f3972125c9b45472cfeadbdbbe6","first_computed_at":"2026-08-03T01:34:36.563512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-03T01:34:36.563512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"40BSSwTZMXyvp0T1XG7GPP2vOOwZwzfbrIXIW+cmwiHsviayh2K3Ro/vzKyPNBOWmRBQolvg3krNO6xinBKdDg==","signature_status":"signed_v1","signed_at":"2026-08-03T01:34:36.565028Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.29453","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:5b553ddeb605666aa2e93dbfd7faf0f9048231a1871399558d9c889392486279","sha256:bb739c2830dc56ad6a4aef76e7830d172b348d24fd139b2ee4d9063fcb4e3ae2"]}],"invalid_events":[],"applied_event_ids":["sha256:63767b638b993b95c77e1f2c4f6f0f1949cdfd6e5b933a73e54c3306e774870b","sha256:7297e25504b79748e437b156f26201a1343107725aa64f00dbe59ae4deae43dd"],"state_sha256":"08b2a0b3a3d67c8915f3c37bb0edba29c525cc2ebfef679dc648c97579ac89bd"}