{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SOPVLM3KF22LCG7UKHHW3THJXL","short_pith_number":"pith:SOPVLM3K","schema_version":"1.0","canonical_sha256":"939f55b36a2eb4b11bf451cf6dcce9baf74273d40257462cd4dbffd7ae6a56e7","source":{"kind":"arxiv","id":"1410.6210","version":1},"attestation_state":"computed","paper":{"title":"On consecutive primitive elements in a finite field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Stephen D. Cohen, Tim Trudgian, Tom\\'as Oliveira e Silva","submitted_at":"2014-10-22T23:34:05Z","abstract_excerpt":"For $q$ an odd prime power with $q>169$ we prove that there are always three consecutive primitive elements in the finite field $\\mathbb{F}_{q}$. Indeed, there are precisely eleven values of $q \\leq 169$ for which this is false. For $4\\leq n \\leq 8$ we present conjectures on the size of $q_{0}(n)$ such that $q>q_{0}(n)$ guarantees the existence of $n$ consecutive primitive elements in $\\mathbb{F}_{q}$, provided that $\\mathbb{F}_{q}$ has characteristic at least~$n$. Finally, we improve the upper bound on $q_{0}(n)$ for all $n\\geq 3$."},"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":"1410.6210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-10-22T23:34:05Z","cross_cats_sorted":[],"title_canon_sha256":"a1b487690ea307bd49130612971ed4016616f04d1a849557388028ba80cd4f58","abstract_canon_sha256":"3477ad27100d47ea2f9497182e57e138d57b0fc1a46b82613b46b266186f26a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:08.784714Z","signature_b64":"PzaOmSsGJZJpYSxP86dXa5QQ0qxKyhw3W79fmVVr2azxLGPFHbDso9yewpK0cqVUr5+nVchT9GCrnjoHHjfEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"939f55b36a2eb4b11bf451cf6dcce9baf74273d40257462cd4dbffd7ae6a56e7","last_reissued_at":"2026-05-18T00:45:08.784290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:08.784290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On consecutive primitive elements in a finite field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Stephen D. Cohen, Tim Trudgian, Tom\\'as Oliveira e Silva","submitted_at":"2014-10-22T23:34:05Z","abstract_excerpt":"For $q$ an odd prime power with $q>169$ we prove that there are always three consecutive primitive elements in the finite field $\\mathbb{F}_{q}$. Indeed, there are precisely eleven values of $q \\leq 169$ for which this is false. For $4\\leq n \\leq 8$ we present conjectures on the size of $q_{0}(n)$ such that $q>q_{0}(n)$ guarantees the existence of $n$ consecutive primitive elements in $\\mathbb{F}_{q}$, provided that $\\mathbb{F}_{q}$ has characteristic at least~$n$. Finally, we improve the upper bound on $q_{0}(n)$ for all $n\\geq 3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6210","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":"1410.6210","created_at":"2026-05-18T00:45:08.784368+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.6210v1","created_at":"2026-05-18T00:45:08.784368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6210","created_at":"2026-05-18T00:45:08.784368+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOPVLM3KF22L","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOPVLM3KF22LCG7U","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOPVLM3K","created_at":"2026-05-18T12:28:49.207871+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/SOPVLM3KF22LCG7UKHHW3THJXL","json":"https://pith.science/pith/SOPVLM3KF22LCG7UKHHW3THJXL.json","graph_json":"https://pith.science/api/pith-number/SOPVLM3KF22LCG7UKHHW3THJXL/graph.json","events_json":"https://pith.science/api/pith-number/SOPVLM3KF22LCG7UKHHW3THJXL/events.json","paper":"https://pith.science/paper/SOPVLM3K"},"agent_actions":{"view_html":"https://pith.science/pith/SOPVLM3KF22LCG7UKHHW3THJXL","download_json":"https://pith.science/pith/SOPVLM3KF22LCG7UKHHW3THJXL.json","view_paper":"https://pith.science/paper/SOPVLM3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.6210&json=true","fetch_graph":"https://pith.science/api/pith-number/SOPVLM3KF22LCG7UKHHW3THJXL/graph.json","fetch_events":"https://pith.science/api/pith-number/SOPVLM3KF22LCG7UKHHW3THJXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOPVLM3KF22LCG7UKHHW3THJXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOPVLM3KF22LCG7UKHHW3THJXL/action/storage_attestation","attest_author":"https://pith.science/pith/SOPVLM3KF22LCG7UKHHW3THJXL/action/author_attestation","sign_citation":"https://pith.science/pith/SOPVLM3KF22LCG7UKHHW3THJXL/action/citation_signature","submit_replication":"https://pith.science/pith/SOPVLM3KF22LCG7UKHHW3THJXL/action/replication_record"}},"created_at":"2026-05-18T00:45:08.784368+00:00","updated_at":"2026-05-18T00:45:08.784368+00:00"}