{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5AU5MFWDYKELKBFHWTKKSYNRDV","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":"97ed8f8ba6b07805dcb6b0a9dc13f02dedf35be7a967d7797e962c25a66fd210","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-11-12T00:21:33Z","title_canon_sha256":"4a52b84b1b8015c1396ee181e4c531e6e08e44aee55488593b93b881e846ea2d"},"schema_version":"1.0","source":{"id":"1811.06831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06831","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06831v1","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06831","created_at":"2026-05-18T00:00:33Z"},{"alias_kind":"pith_short_12","alias_value":"5AU5MFWDYKEL","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5AU5MFWDYKELKBFH","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5AU5MFWD","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:bcfe899be439fd3df219d1bdaf08dca3d0046b287a9ed114d78a49b80417880a","target":"graph","created_at":"2026-05-18T00:00:33Z","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"},"paper":{"abstract_excerpt":"Assume a polynomial-time algorithm for factoring integers, Conjecture~\\ref{conj}, $d\\geq 3,$ and $q$ and $p$ are prime numbers, where $p\\leq q^A$ for some $A>0$. We develop a polynomial-time algorithm in $\\log(q)$ that lifts every $\\mathbb{Z}/q\\mathbb{Z}$ point of $S^{d-2}\\subset S^{d}$ to a $\\mathbb{Z}[1/p]$ point of $S^d$ with the minimum height. We implement our algorithm for $d=3 \\text{ and }4$. Based on our numerical results, we formulate a conjecture which can be checked in polynomial-time and gives the optimal bound on the diophantine exponent of the $\\mathbb{Z}/q\\mathbb{Z}$ points of $","authors_text":"Mostafa W. Hassan, Naser T. Sardari, Rodrigo Smith, Xiaohan Zhu, Yuchen Mao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-11-12T00:21:33Z","title":"The diophantine exponent of the $\\mathbb{Z}/q\\mathbb{Z}$ points of $S^{d-2}\\subset S^d$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06831","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:65170fbc86c4be049db7c80f5d9029651ba4b1dac2901d42db8900b60b5703cf","target":"record","created_at":"2026-05-18T00:00:33Z","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":"97ed8f8ba6b07805dcb6b0a9dc13f02dedf35be7a967d7797e962c25a66fd210","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-11-12T00:21:33Z","title_canon_sha256":"4a52b84b1b8015c1396ee181e4c531e6e08e44aee55488593b93b881e846ea2d"},"schema_version":"1.0","source":{"id":"1811.06831","kind":"arxiv","version":1}},"canonical_sha256":"e829d616c3c288b504a7b4d4a961b11d4aca8fe0462eb129c63cbf65be02f113","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e829d616c3c288b504a7b4d4a961b11d4aca8fe0462eb129c63cbf65be02f113","first_computed_at":"2026-05-18T00:00:33.768063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:33.768063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NNKXK14XKIyNKgFNdaNRo2SaJYUQ+NMbWGp7w7S1yp6+O/8DkPwrD+XBt+oc98Byryrw85v9cA59L4eQYWttDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:33.768572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65170fbc86c4be049db7c80f5d9029651ba4b1dac2901d42db8900b60b5703cf","sha256:bcfe899be439fd3df219d1bdaf08dca3d0046b287a9ed114d78a49b80417880a"],"state_sha256":"0692a3c2559a8e4444c39bcd74421ea42a9dc72ef0fa6bdbd02676e28c2c6581"}