{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BEUTUBECRMHUE53WCHXZ5IY3F5","short_pith_number":"pith:BEUTUBEC","schema_version":"1.0","canonical_sha256":"09293a04828b0f42777611ef9ea31b2f4a460c6697203ecc4074d782c97a0d4a","source":{"kind":"arxiv","id":"1712.07179","version":1},"attestation_state":"computed","paper":{"title":"A note on Linnik's Theorem on quadratic non-residues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"B\\'ela Bollob\\'as, Jonathan D. Lee, Oliver Riordan, Paul Balister, Robert Morris","submitted_at":"2017-12-19T19:53:12Z","abstract_excerpt":"We present a short, self-contained, and purely combinatorial proof of Linnik's theorem: for any $\\varepsilon > 0$ there exists a constant $C_\\varepsilon$ such that for any $N$, there are at most $C_\\varepsilon$ primes $p \\leqslant N$ such that the least positive quadratic non-residue modulo $p$ exceeds $N^\\varepsilon$."},"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":"1712.07179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-12-19T19:53:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9a4ce895384a56309a28a7cd148330f3883958c3bc71f8798c377ad149836eef","abstract_canon_sha256":"c3dfadc9dcd3dfa0fe41100f33a492ab68461e0eaa629c4d6be2877adac3438d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:35.347351Z","signature_b64":"gEA/RQuVRPiyZpowFlqmCwNTHydqVm2i9WEHOisMVHEXc/oJ/NyYFFrJbFHfhiYHMyVuSnID+EuDLz83S/iGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09293a04828b0f42777611ef9ea31b2f4a460c6697203ecc4074d782c97a0d4a","last_reissued_at":"2026-05-18T00:27:35.346725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:35.346725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on Linnik's Theorem on quadratic non-residues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"B\\'ela Bollob\\'as, Jonathan D. Lee, Oliver Riordan, Paul Balister, Robert Morris","submitted_at":"2017-12-19T19:53:12Z","abstract_excerpt":"We present a short, self-contained, and purely combinatorial proof of Linnik's theorem: for any $\\varepsilon > 0$ there exists a constant $C_\\varepsilon$ such that for any $N$, there are at most $C_\\varepsilon$ primes $p \\leqslant N$ such that the least positive quadratic non-residue modulo $p$ exceeds $N^\\varepsilon$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07179","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":"1712.07179","created_at":"2026-05-18T00:27:35.346839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07179v1","created_at":"2026-05-18T00:27:35.346839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07179","created_at":"2026-05-18T00:27:35.346839+00:00"},{"alias_kind":"pith_short_12","alias_value":"BEUTUBECRMHU","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BEUTUBECRMHUE53W","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BEUTUBEC","created_at":"2026-05-18T12:31:08.081275+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/BEUTUBECRMHUE53WCHXZ5IY3F5","json":"https://pith.science/pith/BEUTUBECRMHUE53WCHXZ5IY3F5.json","graph_json":"https://pith.science/api/pith-number/BEUTUBECRMHUE53WCHXZ5IY3F5/graph.json","events_json":"https://pith.science/api/pith-number/BEUTUBECRMHUE53WCHXZ5IY3F5/events.json","paper":"https://pith.science/paper/BEUTUBEC"},"agent_actions":{"view_html":"https://pith.science/pith/BEUTUBECRMHUE53WCHXZ5IY3F5","download_json":"https://pith.science/pith/BEUTUBECRMHUE53WCHXZ5IY3F5.json","view_paper":"https://pith.science/paper/BEUTUBEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07179&json=true","fetch_graph":"https://pith.science/api/pith-number/BEUTUBECRMHUE53WCHXZ5IY3F5/graph.json","fetch_events":"https://pith.science/api/pith-number/BEUTUBECRMHUE53WCHXZ5IY3F5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BEUTUBECRMHUE53WCHXZ5IY3F5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BEUTUBECRMHUE53WCHXZ5IY3F5/action/storage_attestation","attest_author":"https://pith.science/pith/BEUTUBECRMHUE53WCHXZ5IY3F5/action/author_attestation","sign_citation":"https://pith.science/pith/BEUTUBECRMHUE53WCHXZ5IY3F5/action/citation_signature","submit_replication":"https://pith.science/pith/BEUTUBECRMHUE53WCHXZ5IY3F5/action/replication_record"}},"created_at":"2026-05-18T00:27:35.346839+00:00","updated_at":"2026-05-18T00:27:35.346839+00:00"}