{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SK4TTR35OL2MBOW2DD5RLNLXQY","short_pith_number":"pith:SK4TTR35","canonical_record":{"source":{"id":"1711.04588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-13T14:02:57Z","cross_cats_sorted":[],"title_canon_sha256":"94293fa11e9f8c8b062f61140d943b3be9afba4e342187bfd914ddd4a12f5622","abstract_canon_sha256":"39125abaab70817da10765ef4f21588857bbd8e1b6d5e4b1947598e72b5af73e"},"schema_version":"1.0"},"canonical_sha256":"92b939c77d72f4c0bada18fb15b577861dda718dde1cdf292b82ab27f4f5d4c4","source":{"kind":"arxiv","id":"1711.04588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04588","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04588v1","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04588","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"pith_short_12","alias_value":"SK4TTR35OL2M","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SK4TTR35OL2MBOW2","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SK4TTR35","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SK4TTR35OL2MBOW2DD5RLNLXQY","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-13T14:02:57Z","cross_cats_sorted":[],"title_canon_sha256":"94293fa11e9f8c8b062f61140d943b3be9afba4e342187bfd914ddd4a12f5622","abstract_canon_sha256":"39125abaab70817da10765ef4f21588857bbd8e1b6d5e4b1947598e72b5af73e"},"schema_version":"1.0"},"canonical_sha256":"92b939c77d72f4c0bada18fb15b577861dda718dde1cdf292b82ab27f4f5d4c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:36.267133Z","signature_b64":"Ehincq2W215aaFWqBP4+25KCrn2zU/7lzNKpQ85Q+CZ2yzwn0QYC6Ap4lcgr7PLhNyW2HpCINlz5sdknZx3tCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92b939c77d72f4c0bada18fb15b577861dda718dde1cdf292b82ab27f4f5d4c4","last_reissued_at":"2026-05-18T00:30:36.266276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:36.266276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04588","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o3hXetcYfi7ZMHguS93lRU6EQNV+5vNmneiG1NEoWz4fEaC5uFy9/evpHVzdA07ibID9EaJNDJ0gpaJUryMbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T21:52:45.147376Z"},"content_sha256":"311c947e0a4a4864fae907fc3d1fba5521c74e794217a7d387d88c8e58d21a14","schema_version":"1.0","event_id":"sha256:311c947e0a4a4864fae907fc3d1fba5521c74e794217a7d387d88c8e58d21a14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SK4TTR35OL2MBOW2DD5RLNLXQY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of primes up to the $n$th Ramanujan prime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Christian Axler","submitted_at":"2017-11-13T14:02:57Z","abstract_excerpt":"The $n$th Ramanujan prime is the smallest positive integer $R_n$ such that for all $x \\geq R_n$ the interval $(x/2, x]$ contains at least $n$ primes. In this paper we undertake a study of the sequence $(\\pi(R_n))_{n \\in \\mathbb{N}}$, which tells us where the $n$th Ramanujan prime appears in the sequence of all primes. In the first part we establish new explicit upper and lower bounds for the number of primes up to the $n$th Ramanujan prime, which imply an asymptotic formula for $\\pi(R_n)$ conjectured by Yang and Togb\\'e. In the second part of this paper, we use these explicit estimates to deri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04588","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Qgut3Q1q6SzvnEWWXAlaT9AA/680sICpqbzuB5bp/sTkbMdJfUWXcxiJcA3uX1TaITw8UaAE43+PGbj+GPLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T21:52:45.147718Z"},"content_sha256":"3d87eb04b438c8e2b110064dd33ca511e07ac2498ac5db2f55844a8a3a830159","schema_version":"1.0","event_id":"sha256:3d87eb04b438c8e2b110064dd33ca511e07ac2498ac5db2f55844a8a3a830159"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SK4TTR35OL2MBOW2DD5RLNLXQY/bundle.json","state_url":"https://pith.science/pith/SK4TTR35OL2MBOW2DD5RLNLXQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SK4TTR35OL2MBOW2DD5RLNLXQY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T21:52:45Z","links":{"resolver":"https://pith.science/pith/SK4TTR35OL2MBOW2DD5RLNLXQY","bundle":"https://pith.science/pith/SK4TTR35OL2MBOW2DD5RLNLXQY/bundle.json","state":"https://pith.science/pith/SK4TTR35OL2MBOW2DD5RLNLXQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SK4TTR35OL2MBOW2DD5RLNLXQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SK4TTR35OL2MBOW2DD5RLNLXQY","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":"39125abaab70817da10765ef4f21588857bbd8e1b6d5e4b1947598e72b5af73e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-13T14:02:57Z","title_canon_sha256":"94293fa11e9f8c8b062f61140d943b3be9afba4e342187bfd914ddd4a12f5622"},"schema_version":"1.0","source":{"id":"1711.04588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04588","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04588v1","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04588","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"pith_short_12","alias_value":"SK4TTR35OL2M","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SK4TTR35OL2MBOW2","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SK4TTR35","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:3d87eb04b438c8e2b110064dd33ca511e07ac2498ac5db2f55844a8a3a830159","target":"graph","created_at":"2026-05-18T00:30:36Z","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":"The $n$th Ramanujan prime is the smallest positive integer $R_n$ such that for all $x \\geq R_n$ the interval $(x/2, x]$ contains at least $n$ primes. In this paper we undertake a study of the sequence $(\\pi(R_n))_{n \\in \\mathbb{N}}$, which tells us where the $n$th Ramanujan prime appears in the sequence of all primes. In the first part we establish new explicit upper and lower bounds for the number of primes up to the $n$th Ramanujan prime, which imply an asymptotic formula for $\\pi(R_n)$ conjectured by Yang and Togb\\'e. In the second part of this paper, we use these explicit estimates to deri","authors_text":"Christian Axler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-13T14:02:57Z","title":"On the number of primes up to the $n$th Ramanujan prime"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04588","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:311c947e0a4a4864fae907fc3d1fba5521c74e794217a7d387d88c8e58d21a14","target":"record","created_at":"2026-05-18T00:30:36Z","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":"39125abaab70817da10765ef4f21588857bbd8e1b6d5e4b1947598e72b5af73e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-13T14:02:57Z","title_canon_sha256":"94293fa11e9f8c8b062f61140d943b3be9afba4e342187bfd914ddd4a12f5622"},"schema_version":"1.0","source":{"id":"1711.04588","kind":"arxiv","version":1}},"canonical_sha256":"92b939c77d72f4c0bada18fb15b577861dda718dde1cdf292b82ab27f4f5d4c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92b939c77d72f4c0bada18fb15b577861dda718dde1cdf292b82ab27f4f5d4c4","first_computed_at":"2026-05-18T00:30:36.266276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:36.266276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ehincq2W215aaFWqBP4+25KCrn2zU/7lzNKpQ85Q+CZ2yzwn0QYC6Ap4lcgr7PLhNyW2HpCINlz5sdknZx3tCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:36.267133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:311c947e0a4a4864fae907fc3d1fba5521c74e794217a7d387d88c8e58d21a14","sha256:3d87eb04b438c8e2b110064dd33ca511e07ac2498ac5db2f55844a8a3a830159"],"state_sha256":"328010b6d2ea7c6579e00bf32014cd03973a6ab9c4883589fd1c28418e14f2b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MlPVT9Tp7P+cxyqQtDyuEXKT9wIf63zztIguFnk/UH3gArM6tkfo7wwmQxg5AOZ4/2OuOnnbYcHg830UKnkaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T21:52:45.149587Z","bundle_sha256":"a5c5bbc807c32b84cbfa5f9a3149c0e4d985e59c24275921617c3b8d8cbfcdf6"}}