{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HMBN7VDSWZRUII33EULSM4JJ2V","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"249c6daceca8ab587c850411122733269f8d7e3e0a67830ad815a99b4d1634dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-22T10:22:17Z","title_canon_sha256":"bd0dd40a82d0f88dabfa9dd96806eeeb4cda313b33d7c2534a8d67ff4ef0d28a"},"schema_version":"1.0","source":{"id":"1706.07241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07241","created_at":"2026-05-18T00:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07241v1","created_at":"2026-05-18T00:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07241","created_at":"2026-05-18T00:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"HMBN7VDSWZRU","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HMBN7VDSWZRUII33","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HMBN7VDS","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:3ec870359f736b4550a8010ffc940a08d94d24ce6c7247a14fdba98ad610ce02","target":"graph","created_at":"2026-05-18T00:41:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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$.","authors_text":"Anitha Srinivasan, Pablo Ar\\'es","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-22T10:22:17Z","title":"New upper bounds for Ramanujan primes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07241","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d17c793c5323b7e8f020a623c1b4a6400931203cda84a0adbc0474abe61eb908","target":"record","created_at":"2026-05-18T00:41:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"249c6daceca8ab587c850411122733269f8d7e3e0a67830ad815a99b4d1634dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-22T10:22:17Z","title_canon_sha256":"bd0dd40a82d0f88dabfa9dd96806eeeb4cda313b33d7c2534a8d67ff4ef0d28a"},"schema_version":"1.0","source":{"id":"1706.07241","kind":"arxiv","version":1}},"canonical_sha256":"3b02dfd472b66344237b2517267129d561bf5a5342b1c5313254bc9a92dab17a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b02dfd472b66344237b2517267129d561bf5a5342b1c5313254bc9a92dab17a","first_computed_at":"2026-05-18T00:41:52.255755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:52.255755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oRU2j7PtxfZObehD+ZUGDTNHrJhi0MjPDFcY+OSmml48Lsr8HPUFyiMKD1Q3qGAfrDEDn/9h5oleIPqeBtu/BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:52.256270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.07241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d17c793c5323b7e8f020a623c1b4a6400931203cda84a0adbc0474abe61eb908","sha256:3ec870359f736b4550a8010ffc940a08d94d24ce6c7247a14fdba98ad610ce02"],"state_sha256":"6a2448a1e8514d7e647f072ba7a4d4e367dc5fb649e216cbdf25641c2f459abb"}