{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:C2GBHDCOX2TIQRACEXL6GMCRG4","short_pith_number":"pith:C2GBHDCO","schema_version":"1.0","canonical_sha256":"168c138c4ebea688440225d7e330513729941468481e906041213bd0ee860d02","source":{"kind":"arxiv","id":"1211.6046","version":2},"attestation_state":"computed","paper":{"title":"Proof of Legendre's Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Ankush Goswami","submitted_at":"2012-11-26T18:13:47Z","abstract_excerpt":"Legendre's conjecture states that there exists a prime between $n^2$ and $(n+1)^2$, for every positive integer $n$. Here I prove that for sufficiently large $n$, there is a prime number between $n^2$ and $(n+1)^2$. The proof relies on the idea of counting the maximum power, $o_p(n)$ of a prime $p\\leq n$ such that $p^{o_p(n)}||n$."},"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":"1211.6046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-11-26T18:13:47Z","cross_cats_sorted":[],"title_canon_sha256":"f80c4efcf3c111975b7662254d23dfb17c9d5d17df0c1b01b3b4e77799d0b1aa","abstract_canon_sha256":"cc659144f711247d5f88b627d3f70f17cb61489e8e1ebee6aee7e35c4623f02c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:51.501257Z","signature_b64":"hBoSFSyBhxvlABDtSjB/9k8qfwGQb+exM4A3IsVyi4VpQ4qTwubvAXRJnc5Vx282RdTIjKCC39cZ9qKGFy6yDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"168c138c4ebea688440225d7e330513729941468481e906041213bd0ee860d02","last_reissued_at":"2026-05-18T03:39:51.500841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:51.500841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proof of Legendre's Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Ankush Goswami","submitted_at":"2012-11-26T18:13:47Z","abstract_excerpt":"Legendre's conjecture states that there exists a prime between $n^2$ and $(n+1)^2$, for every positive integer $n$. Here I prove that for sufficiently large $n$, there is a prime number between $n^2$ and $(n+1)^2$. The proof relies on the idea of counting the maximum power, $o_p(n)$ of a prime $p\\leq n$ such that $p^{o_p(n)}||n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6046","kind":"arxiv","version":2},"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":"1211.6046","created_at":"2026-05-18T03:39:51.500903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.6046v2","created_at":"2026-05-18T03:39:51.500903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6046","created_at":"2026-05-18T03:39:51.500903+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2GBHDCOX2TI","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2GBHDCOX2TIQRAC","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2GBHDCO","created_at":"2026-05-18T12:27:01.376967+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/C2GBHDCOX2TIQRACEXL6GMCRG4","json":"https://pith.science/pith/C2GBHDCOX2TIQRACEXL6GMCRG4.json","graph_json":"https://pith.science/api/pith-number/C2GBHDCOX2TIQRACEXL6GMCRG4/graph.json","events_json":"https://pith.science/api/pith-number/C2GBHDCOX2TIQRACEXL6GMCRG4/events.json","paper":"https://pith.science/paper/C2GBHDCO"},"agent_actions":{"view_html":"https://pith.science/pith/C2GBHDCOX2TIQRACEXL6GMCRG4","download_json":"https://pith.science/pith/C2GBHDCOX2TIQRACEXL6GMCRG4.json","view_paper":"https://pith.science/paper/C2GBHDCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.6046&json=true","fetch_graph":"https://pith.science/api/pith-number/C2GBHDCOX2TIQRACEXL6GMCRG4/graph.json","fetch_events":"https://pith.science/api/pith-number/C2GBHDCOX2TIQRACEXL6GMCRG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2GBHDCOX2TIQRACEXL6GMCRG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2GBHDCOX2TIQRACEXL6GMCRG4/action/storage_attestation","attest_author":"https://pith.science/pith/C2GBHDCOX2TIQRACEXL6GMCRG4/action/author_attestation","sign_citation":"https://pith.science/pith/C2GBHDCOX2TIQRACEXL6GMCRG4/action/citation_signature","submit_replication":"https://pith.science/pith/C2GBHDCOX2TIQRACEXL6GMCRG4/action/replication_record"}},"created_at":"2026-05-18T03:39:51.500903+00:00","updated_at":"2026-05-18T03:39:51.500903+00:00"}