{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NRNMVKESZMF2KZ2MZRAW3DPT2J","short_pith_number":"pith:NRNMVKES","canonical_record":{"source":{"id":"1409.5685","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-09-19T14:57:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c4f23bda89bdde28ca037c9afdcf91461a3c5f56c103ca488455e71e9538a7a4","abstract_canon_sha256":"69405e24f3f0e75c3bdcaf5631e074e4e58373163edd1218d27ac046dc75443f"},"schema_version":"1.0"},"canonical_sha256":"6c5acaa892cb0ba5674ccc416d8df3d246a4aa3bacb2f131eebd2c003c1e32de","source":{"kind":"arxiv","id":"1409.5685","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5685","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5685v6","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5685","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"pith_short_12","alias_value":"NRNMVKESZMF2","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NRNMVKESZMF2KZ2M","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NRNMVKES","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NRNMVKESZMF2KZ2MZRAW3DPT2J","target":"record","payload":{"canonical_record":{"source":{"id":"1409.5685","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-09-19T14:57:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c4f23bda89bdde28ca037c9afdcf91461a3c5f56c103ca488455e71e9538a7a4","abstract_canon_sha256":"69405e24f3f0e75c3bdcaf5631e074e4e58373163edd1218d27ac046dc75443f"},"schema_version":"1.0"},"canonical_sha256":"6c5acaa892cb0ba5674ccc416d8df3d246a4aa3bacb2f131eebd2c003c1e32de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:10.950351Z","signature_b64":"FUVcFOHYZK0XNcUnGYmORS9Bho3zuEbOrI9e7qvUg+k/ZeeWlWlzFN8SpDUAxqi2mm/LBvMOTlvJ9igRbaDRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c5acaa892cb0ba5674ccc416d8df3d246a4aa3bacb2f131eebd2c003c1e32de","last_reissued_at":"2026-05-18T00:53:10.949724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:10.949724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.5685","source_version":6,"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:53:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3sV1BAI7kaOJbB2dL3IH2+zeccqrY/7GDaUIaP7SOvOZTQvq3yU/d1FQ0rIX7cr9On/YvsS9PNpOXxBjcle8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:37:17.047350Z"},"content_sha256":"f33e231de03f123a6b12823b0782e9bc25effaed9b10ef5d9f245d2d5002c149","schema_version":"1.0","event_id":"sha256:f33e231de03f123a6b12823b0782e9bc25effaed9b10ef5d9f245d2d5002c149"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NRNMVKESZMF2KZ2MZRAW3DPT2J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new theorem on the prime-counting function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Zhi-Wei Sun","submitted_at":"2014-09-19T14:57:22Z","abstract_excerpt":"For $x>0$ let $\\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\\le\\lceil e^{m-1}/(m-1)\\rceil$ there is an integer $n>1$ with $\\pi(n)=(n+a)/m$. Consequently, for any integer $m>4$ there is a positive integer $n$ with $\\pi(mn)=m+n$. We also pose several conjectures for further research; for example, we conjecture that for each $m=1,2,3,\\ldots$ there is a positive integer $n$ such that $m+n$ divides $p_m+p_n$, where $p_k$ denotes the $k$-th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5685","kind":"arxiv","version":6},"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:53:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajI1DLf4jxs7W9RPEgtjKfOQZV6UXkEqic4JxYAMeJ4gQVKYwlYQKYs/MS4JLgXftgWA0GeunEQN1ykRK0WyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:37:17.047952Z"},"content_sha256":"e78d3a6fdb648fac24ed176adc5ae51cb712ed4aaea898bdab1f41c1c16f035f","schema_version":"1.0","event_id":"sha256:e78d3a6fdb648fac24ed176adc5ae51cb712ed4aaea898bdab1f41c1c16f035f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRNMVKESZMF2KZ2MZRAW3DPT2J/bundle.json","state_url":"https://pith.science/pith/NRNMVKESZMF2KZ2MZRAW3DPT2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRNMVKESZMF2KZ2MZRAW3DPT2J/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-05-23T23:37:17Z","links":{"resolver":"https://pith.science/pith/NRNMVKESZMF2KZ2MZRAW3DPT2J","bundle":"https://pith.science/pith/NRNMVKESZMF2KZ2MZRAW3DPT2J/bundle.json","state":"https://pith.science/pith/NRNMVKESZMF2KZ2MZRAW3DPT2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRNMVKESZMF2KZ2MZRAW3DPT2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NRNMVKESZMF2KZ2MZRAW3DPT2J","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":"69405e24f3f0e75c3bdcaf5631e074e4e58373163edd1218d27ac046dc75443f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-09-19T14:57:22Z","title_canon_sha256":"c4f23bda89bdde28ca037c9afdcf91461a3c5f56c103ca488455e71e9538a7a4"},"schema_version":"1.0","source":{"id":"1409.5685","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5685","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5685v6","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5685","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"pith_short_12","alias_value":"NRNMVKESZMF2","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NRNMVKESZMF2KZ2M","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NRNMVKES","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:e78d3a6fdb648fac24ed176adc5ae51cb712ed4aaea898bdab1f41c1c16f035f","target":"graph","created_at":"2026-05-18T00:53:10Z","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 $x>0$ let $\\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\\le\\lceil e^{m-1}/(m-1)\\rceil$ there is an integer $n>1$ with $\\pi(n)=(n+a)/m$. Consequently, for any integer $m>4$ there is a positive integer $n$ with $\\pi(mn)=m+n$. We also pose several conjectures for further research; for example, we conjecture that for each $m=1,2,3,\\ldots$ there is a positive integer $n$ such that $m+n$ divides $p_m+p_n$, where $p_k$ denotes the $k$-th","authors_text":"Zhi-Wei Sun","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-09-19T14:57:22Z","title":"A new theorem on the prime-counting function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5685","kind":"arxiv","version":6},"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:f33e231de03f123a6b12823b0782e9bc25effaed9b10ef5d9f245d2d5002c149","target":"record","created_at":"2026-05-18T00:53:10Z","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":"69405e24f3f0e75c3bdcaf5631e074e4e58373163edd1218d27ac046dc75443f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-09-19T14:57:22Z","title_canon_sha256":"c4f23bda89bdde28ca037c9afdcf91461a3c5f56c103ca488455e71e9538a7a4"},"schema_version":"1.0","source":{"id":"1409.5685","kind":"arxiv","version":6}},"canonical_sha256":"6c5acaa892cb0ba5674ccc416d8df3d246a4aa3bacb2f131eebd2c003c1e32de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c5acaa892cb0ba5674ccc416d8df3d246a4aa3bacb2f131eebd2c003c1e32de","first_computed_at":"2026-05-18T00:53:10.949724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:10.949724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FUVcFOHYZK0XNcUnGYmORS9Bho3zuEbOrI9e7qvUg+k/ZeeWlWlzFN8SpDUAxqi2mm/LBvMOTlvJ9igRbaDRBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:10.950351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.5685","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f33e231de03f123a6b12823b0782e9bc25effaed9b10ef5d9f245d2d5002c149","sha256:e78d3a6fdb648fac24ed176adc5ae51cb712ed4aaea898bdab1f41c1c16f035f"],"state_sha256":"be59af9cc7faf6c803e09135a497ccb7d311739d478f60c54ddb6104bfac0d61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u19OkDfN6mIIe0AyXupQsClLFn1pXp4I2tEjq2cxd7f70cEjy/WVBHn9+XQR4QG9/A3exTJbR3qa+QTmmZu/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T23:37:17.053866Z","bundle_sha256":"fd7c19cc74d83aa02196da91c090f1fb0fd084731e66654f0fd7396cb7d2dab2"}}