{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:W3QIRNS3TBOHHRFNBHJN3MZYF6","short_pith_number":"pith:W3QIRNS3","schema_version":"1.0","canonical_sha256":"b6e088b65b985c73c4ad09d2ddb3382f8120ed73e50df460442ecd6cf2eb3329","source":{"kind":"arxiv","id":"1203.5413","version":2},"attestation_state":"computed","paper":{"title":"The n-th prime asymptotically","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Juan Arias de Reyna, Toulisse Jeremy","submitted_at":"2012-03-24T13:43:19Z","abstract_excerpt":"A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994).\n  Realistic bounds for the error with $\\li^{-1}(n)$, after having retained the first m terms, for $1\\le m\\le 11$, are given. Finally, assuming the Riemann Hypothesis, we give estimations of the best possible $r_3$ such that, for $n\\ge r_3$, we have $p_n> s_3(n)$ where $s_3(n)$ is the sum of the first four terms of the asymptotic expansion."},"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":"1203.5413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-03-24T13:43:19Z","cross_cats_sorted":[],"title_canon_sha256":"ad5a648e58604b7a986368a2b23093b3602f0f705278c5a42ce014c0246ef3e8","abstract_canon_sha256":"8a6c543c37a6e751bdf5e6e079bc27b432cb1d721d4c0909c9ae7cc48337b15d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:50.076891Z","signature_b64":"D4AWql3nYpuEGypoBoKkmObBxyB4INgklxitHVAzUOFnudBnAnRFVIQ/ak44rG4CkhUlofXHTxpO/pqVquL7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6e088b65b985c73c4ad09d2ddb3382f8120ed73e50df460442ecd6cf2eb3329","last_reissued_at":"2026-05-18T02:55:50.076334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:50.076334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The n-th prime asymptotically","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Juan Arias de Reyna, Toulisse Jeremy","submitted_at":"2012-03-24T13:43:19Z","abstract_excerpt":"A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994).\n  Realistic bounds for the error with $\\li^{-1}(n)$, after having retained the first m terms, for $1\\le m\\le 11$, are given. Finally, assuming the Riemann Hypothesis, we give estimations of the best possible $r_3$ such that, for $n\\ge r_3$, we have $p_n> s_3(n)$ where $s_3(n)$ is the sum of the first four terms of the asymptotic expansion."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5413","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":"1203.5413","created_at":"2026-05-18T02:55:50.076435+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.5413v2","created_at":"2026-05-18T02:55:50.076435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5413","created_at":"2026-05-18T02:55:50.076435+00:00"},{"alias_kind":"pith_short_12","alias_value":"W3QIRNS3TBOH","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"W3QIRNS3TBOHHRFN","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"W3QIRNS3","created_at":"2026-05-18T12:27:25.539911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.14458","citing_title":"The n-th prime exponentially","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W3QIRNS3TBOHHRFNBHJN3MZYF6","json":"https://pith.science/pith/W3QIRNS3TBOHHRFNBHJN3MZYF6.json","graph_json":"https://pith.science/api/pith-number/W3QIRNS3TBOHHRFNBHJN3MZYF6/graph.json","events_json":"https://pith.science/api/pith-number/W3QIRNS3TBOHHRFNBHJN3MZYF6/events.json","paper":"https://pith.science/paper/W3QIRNS3"},"agent_actions":{"view_html":"https://pith.science/pith/W3QIRNS3TBOHHRFNBHJN3MZYF6","download_json":"https://pith.science/pith/W3QIRNS3TBOHHRFNBHJN3MZYF6.json","view_paper":"https://pith.science/paper/W3QIRNS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.5413&json=true","fetch_graph":"https://pith.science/api/pith-number/W3QIRNS3TBOHHRFNBHJN3MZYF6/graph.json","fetch_events":"https://pith.science/api/pith-number/W3QIRNS3TBOHHRFNBHJN3MZYF6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W3QIRNS3TBOHHRFNBHJN3MZYF6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W3QIRNS3TBOHHRFNBHJN3MZYF6/action/storage_attestation","attest_author":"https://pith.science/pith/W3QIRNS3TBOHHRFNBHJN3MZYF6/action/author_attestation","sign_citation":"https://pith.science/pith/W3QIRNS3TBOHHRFNBHJN3MZYF6/action/citation_signature","submit_replication":"https://pith.science/pith/W3QIRNS3TBOHHRFNBHJN3MZYF6/action/replication_record"}},"created_at":"2026-05-18T02:55:50.076435+00:00","updated_at":"2026-05-18T02:55:50.076435+00:00"}