{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FV2WFS5OUOOT7QE2VTPYQ7FJV4","short_pith_number":"pith:FV2WFS5O","schema_version":"1.0","canonical_sha256":"2d7562cbaea39d3fc09aacdf887ca9af272ba2f067a42d271f93c6f70a8488c0","source":{"kind":"arxiv","id":"1703.04953","version":1},"attestation_state":"computed","paper":{"title":"Square-full primitive roots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Marc Munsch, Tim Trudgian","submitted_at":"2017-03-15T06:21:18Z","abstract_excerpt":"We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod $p$ less than $p^{2/3 + 3/(4 \\sqrt{e})+ \\epsilon}$, and we give some conditional bounds."},"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":"1703.04953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-03-15T06:21:18Z","cross_cats_sorted":[],"title_canon_sha256":"f41f21114a8cda0deb138a8711ed46ce810291f100f81b765e0dbb52f9654cae","abstract_canon_sha256":"63bb0a9c859f94f781d31f9e42084f174bdaf8aa5839bf881f41360161bbeeea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:38.755570Z","signature_b64":"UgQvM5Uy9bPl3Kpd0tCXe+m+Km+uKHW600pCYzTUFQUTn4pOd8HpjTm6Wd/xuT3jzKXhHIdiU6dbh4lUmkpZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d7562cbaea39d3fc09aacdf887ca9af272ba2f067a42d271f93c6f70a8488c0","last_reissued_at":"2026-05-18T00:48:38.754831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:38.754831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Square-full primitive roots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Marc Munsch, Tim Trudgian","submitted_at":"2017-03-15T06:21:18Z","abstract_excerpt":"We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod $p$ less than $p^{2/3 + 3/(4 \\sqrt{e})+ \\epsilon}$, and we give some conditional bounds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04953","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":"1703.04953","created_at":"2026-05-18T00:48:38.754954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.04953v1","created_at":"2026-05-18T00:48:38.754954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04953","created_at":"2026-05-18T00:48:38.754954+00:00"},{"alias_kind":"pith_short_12","alias_value":"FV2WFS5OUOOT","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FV2WFS5OUOOT7QE2","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FV2WFS5O","created_at":"2026-05-18T12:31:15.632608+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/FV2WFS5OUOOT7QE2VTPYQ7FJV4","json":"https://pith.science/pith/FV2WFS5OUOOT7QE2VTPYQ7FJV4.json","graph_json":"https://pith.science/api/pith-number/FV2WFS5OUOOT7QE2VTPYQ7FJV4/graph.json","events_json":"https://pith.science/api/pith-number/FV2WFS5OUOOT7QE2VTPYQ7FJV4/events.json","paper":"https://pith.science/paper/FV2WFS5O"},"agent_actions":{"view_html":"https://pith.science/pith/FV2WFS5OUOOT7QE2VTPYQ7FJV4","download_json":"https://pith.science/pith/FV2WFS5OUOOT7QE2VTPYQ7FJV4.json","view_paper":"https://pith.science/paper/FV2WFS5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.04953&json=true","fetch_graph":"https://pith.science/api/pith-number/FV2WFS5OUOOT7QE2VTPYQ7FJV4/graph.json","fetch_events":"https://pith.science/api/pith-number/FV2WFS5OUOOT7QE2VTPYQ7FJV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FV2WFS5OUOOT7QE2VTPYQ7FJV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FV2WFS5OUOOT7QE2VTPYQ7FJV4/action/storage_attestation","attest_author":"https://pith.science/pith/FV2WFS5OUOOT7QE2VTPYQ7FJV4/action/author_attestation","sign_citation":"https://pith.science/pith/FV2WFS5OUOOT7QE2VTPYQ7FJV4/action/citation_signature","submit_replication":"https://pith.science/pith/FV2WFS5OUOOT7QE2VTPYQ7FJV4/action/replication_record"}},"created_at":"2026-05-18T00:48:38.754954+00:00","updated_at":"2026-05-18T00:48:38.754954+00:00"}