{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HMBN7VDSWZRUII33EULSM4JJ2V","short_pith_number":"pith:HMBN7VDS","schema_version":"1.0","canonical_sha256":"3b02dfd472b66344237b2517267129d561bf5a5342b1c5313254bc9a92dab17a","source":{"kind":"arxiv","id":"1706.07241","version":1},"attestation_state":"computed","paper":{"title":"New upper bounds for Ramanujan primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Anitha Srinivasan, Pablo Ar\\'es","submitted_at":"2017-06-22T10:22:17Z","abstract_excerpt":"For $n\\ge 1$, the $n^{\\rm th}$ Ramanujan prime is defined as the smallest positive integer $R_n$ such that for all $x\\ge R_n$, the interval $(\\frac{x}{2}, x]$ has at least $n$ primes. We show that for every $\\epsilon>0$, there is a positive integer $N$ such that if $\\alpha=2n\\left(1+\\dfrac{\\log 2+\\epsilon}{\\log n+j(n)}\\right)$, then $R_n< p_{[\\alpha]}$ for all $n>N$, where $p_i$ is the $i^{\\rm th}$ prime and $j(n)>0$ is any function that satisfies $j(n)\\to \\infty$ and $nj'(n)\\to 0$."},"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":"1706.07241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-22T10:22:17Z","cross_cats_sorted":[],"title_canon_sha256":"bd0dd40a82d0f88dabfa9dd96806eeeb4cda313b33d7c2534a8d67ff4ef0d28a","abstract_canon_sha256":"249c6daceca8ab587c850411122733269f8d7e3e0a67830ad815a99b4d1634dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:52.256270Z","signature_b64":"oRU2j7PtxfZObehD+ZUGDTNHrJhi0MjPDFcY+OSmml48Lsr8HPUFyiMKD1Q3qGAfrDEDn/9h5oleIPqeBtu/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b02dfd472b66344237b2517267129d561bf5a5342b1c5313254bc9a92dab17a","last_reissued_at":"2026-05-18T00:41:52.255755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:52.255755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New upper bounds for Ramanujan primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Anitha Srinivasan, Pablo Ar\\'es","submitted_at":"2017-06-22T10:22:17Z","abstract_excerpt":"For $n\\ge 1$, the $n^{\\rm th}$ Ramanujan prime is defined as the smallest positive integer $R_n$ such that for all $x\\ge R_n$, the interval $(\\frac{x}{2}, x]$ has at least $n$ primes. We show that for every $\\epsilon>0$, there is a positive integer $N$ such that if $\\alpha=2n\\left(1+\\dfrac{\\log 2+\\epsilon}{\\log n+j(n)}\\right)$, then $R_n< p_{[\\alpha]}$ for all $n>N$, where $p_i$ is the $i^{\\rm th}$ prime and $j(n)>0$ is any function that satisfies $j(n)\\to \\infty$ and $nj'(n)\\to 0$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07241","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":"1706.07241","created_at":"2026-05-18T00:41:52.255828+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07241v1","created_at":"2026-05-18T00:41:52.255828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07241","created_at":"2026-05-18T00:41:52.255828+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMBN7VDSWZRU","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMBN7VDSWZRUII33","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMBN7VDS","created_at":"2026-05-18T12:31:18.294218+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/HMBN7VDSWZRUII33EULSM4JJ2V","json":"https://pith.science/pith/HMBN7VDSWZRUII33EULSM4JJ2V.json","graph_json":"https://pith.science/api/pith-number/HMBN7VDSWZRUII33EULSM4JJ2V/graph.json","events_json":"https://pith.science/api/pith-number/HMBN7VDSWZRUII33EULSM4JJ2V/events.json","paper":"https://pith.science/paper/HMBN7VDS"},"agent_actions":{"view_html":"https://pith.science/pith/HMBN7VDSWZRUII33EULSM4JJ2V","download_json":"https://pith.science/pith/HMBN7VDSWZRUII33EULSM4JJ2V.json","view_paper":"https://pith.science/paper/HMBN7VDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07241&json=true","fetch_graph":"https://pith.science/api/pith-number/HMBN7VDSWZRUII33EULSM4JJ2V/graph.json","fetch_events":"https://pith.science/api/pith-number/HMBN7VDSWZRUII33EULSM4JJ2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMBN7VDSWZRUII33EULSM4JJ2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMBN7VDSWZRUII33EULSM4JJ2V/action/storage_attestation","attest_author":"https://pith.science/pith/HMBN7VDSWZRUII33EULSM4JJ2V/action/author_attestation","sign_citation":"https://pith.science/pith/HMBN7VDSWZRUII33EULSM4JJ2V/action/citation_signature","submit_replication":"https://pith.science/pith/HMBN7VDSWZRUII33EULSM4JJ2V/action/replication_record"}},"created_at":"2026-05-18T00:41:52.255828+00:00","updated_at":"2026-05-18T00:41:52.255828+00:00"}