{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KZ4SUYF6EXNY7VC4S7UA32DVHX","short_pith_number":"pith:KZ4SUYF6","schema_version":"1.0","canonical_sha256":"56792a60be25db8fd45c97e80de8753dc07625c0d4bf0a7f3ecf74028407705a","source":{"kind":"arxiv","id":"1207.0842","version":1},"attestation_state":"computed","paper":{"title":"On Gaps Between Primitive Roots in the Hamming Metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Christian Elsholtz, Igor E. Shparlinski, Rainer Dietmann","submitted_at":"2012-07-03T21:52:54Z","abstract_excerpt":"We consider a modification of the classical number theoretic question about the gaps between consecutive primitive roots modulo a prime $p$, which by the well-known result of Burgess are known to be at most $p^{1/4+o(1)}$. Here we measure the distance in the Hamming metric and show that if $p$ is a sufficiently large $r$-bit prime, then for any integer $n \\in [1,p]$ one can obtain a primitive root modulo $p$ by changing at most $0.11002786...r$ binary digits of $n$. This is stronger than what can be deduced from the Burgess result. Experimentally, the number of necessary bit changes is very sm"},"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":"1207.0842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-07-03T21:52:54Z","cross_cats_sorted":[],"title_canon_sha256":"4db501c4467facc4cb98d047545c4b7e9eca610761166f25b847e5ccd8b81dd2","abstract_canon_sha256":"54f018a617bf0d02d76515fff8333b1f290c994fd30b04768189cbf3c23054fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:48.267778Z","signature_b64":"WD02q7KRJGzeb2ntK2V0ALOHgK58Kcsn+DSiT8ZisBX4n+0+pjOhLiw017hxtmtIuBtN422VjhFVy63PKbacBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56792a60be25db8fd45c97e80de8753dc07625c0d4bf0a7f3ecf74028407705a","last_reissued_at":"2026-05-18T03:51:48.267075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:48.267075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Gaps Between Primitive Roots in the Hamming Metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Christian Elsholtz, Igor E. Shparlinski, Rainer Dietmann","submitted_at":"2012-07-03T21:52:54Z","abstract_excerpt":"We consider a modification of the classical number theoretic question about the gaps between consecutive primitive roots modulo a prime $p$, which by the well-known result of Burgess are known to be at most $p^{1/4+o(1)}$. Here we measure the distance in the Hamming metric and show that if $p$ is a sufficiently large $r$-bit prime, then for any integer $n \\in [1,p]$ one can obtain a primitive root modulo $p$ by changing at most $0.11002786...r$ binary digits of $n$. This is stronger than what can be deduced from the Burgess result. Experimentally, the number of necessary bit changes is very sm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0842","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":""},"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":"1207.0842","created_at":"2026-05-18T03:51:48.267183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0842v1","created_at":"2026-05-18T03:51:48.267183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0842","created_at":"2026-05-18T03:51:48.267183+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZ4SUYF6EXNY","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZ4SUYF6EXNY7VC4","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZ4SUYF6","created_at":"2026-05-18T12:27:11.947152+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/KZ4SUYF6EXNY7VC4S7UA32DVHX","json":"https://pith.science/pith/KZ4SUYF6EXNY7VC4S7UA32DVHX.json","graph_json":"https://pith.science/api/pith-number/KZ4SUYF6EXNY7VC4S7UA32DVHX/graph.json","events_json":"https://pith.science/api/pith-number/KZ4SUYF6EXNY7VC4S7UA32DVHX/events.json","paper":"https://pith.science/paper/KZ4SUYF6"},"agent_actions":{"view_html":"https://pith.science/pith/KZ4SUYF6EXNY7VC4S7UA32DVHX","download_json":"https://pith.science/pith/KZ4SUYF6EXNY7VC4S7UA32DVHX.json","view_paper":"https://pith.science/paper/KZ4SUYF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0842&json=true","fetch_graph":"https://pith.science/api/pith-number/KZ4SUYF6EXNY7VC4S7UA32DVHX/graph.json","fetch_events":"https://pith.science/api/pith-number/KZ4SUYF6EXNY7VC4S7UA32DVHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZ4SUYF6EXNY7VC4S7UA32DVHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZ4SUYF6EXNY7VC4S7UA32DVHX/action/storage_attestation","attest_author":"https://pith.science/pith/KZ4SUYF6EXNY7VC4S7UA32DVHX/action/author_attestation","sign_citation":"https://pith.science/pith/KZ4SUYF6EXNY7VC4S7UA32DVHX/action/citation_signature","submit_replication":"https://pith.science/pith/KZ4SUYF6EXNY7VC4S7UA32DVHX/action/replication_record"}},"created_at":"2026-05-18T03:51:48.267183+00:00","updated_at":"2026-05-18T03:51:48.267183+00:00"}