{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XZK5YT5J6H5OSMMCRKPFTS2E3H","short_pith_number":"pith:XZK5YT5J","schema_version":"1.0","canonical_sha256":"be55dc4fa9f1fae931828a9e59cb44d9dd853215326be1a7745e0467591bda3b","source":{"kind":"arxiv","id":"1511.02032","version":2},"attestation_state":"computed","paper":{"title":"An analytic method for bounding $\\psi(x)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.NT","authors_text":"Jan B\\\"uthe","submitted_at":"2015-11-06T11:10:12Z","abstract_excerpt":"In this paper we present an analytic altorithm which calculates almost sharp bounds for the normalized error term $(t-\\psi(t))/\\sqrt{t}$ for $t\\leq x$ in expected run time $O(x^{1/2+\\varepsilon})$ for every $\\varepsilon>0$. The method has been implemented and used to calculate the bound $|\\psi(t) - t| \\leq 0.94 \\sqrt{t}$ for $11< t\\leq 10^{19}$. In particular, this bound implies that $\\operatorname{li}(t) - \\pi(t) > 0$ for $t\\in [2,10^{19}]$, which gives an improved lower bound for the Skewes number."},"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":"1511.02032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-06T11:10:12Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"d41755419d5e8b4d333ed006764fe2afe5091f62161fe1fb8938d3f714957608","abstract_canon_sha256":"a89daea114b8e3a4f6cf301e2a5e01891566e69eca694fd348b939d15c6ecb78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:21.608636Z","signature_b64":"r1fTlJCixm8FnYx9EJ8R8vsUKSQBOVLW4m7U7iN2migqxpsZvdSbHSZp9BErCGH7YP7+BensQz1GmxE3W/fmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be55dc4fa9f1fae931828a9e59cb44d9dd853215326be1a7745e0467591bda3b","last_reissued_at":"2026-05-18T00:32:21.607991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:21.607991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An analytic method for bounding $\\psi(x)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.NT","authors_text":"Jan B\\\"uthe","submitted_at":"2015-11-06T11:10:12Z","abstract_excerpt":"In this paper we present an analytic altorithm which calculates almost sharp bounds for the normalized error term $(t-\\psi(t))/\\sqrt{t}$ for $t\\leq x$ in expected run time $O(x^{1/2+\\varepsilon})$ for every $\\varepsilon>0$. The method has been implemented and used to calculate the bound $|\\psi(t) - t| \\leq 0.94 \\sqrt{t}$ for $11< t\\leq 10^{19}$. In particular, this bound implies that $\\operatorname{li}(t) - \\pi(t) > 0$ for $t\\in [2,10^{19}]$, which gives an improved lower bound for the Skewes number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02032","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":"1511.02032","created_at":"2026-05-18T00:32:21.608092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02032v2","created_at":"2026-05-18T00:32:21.608092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02032","created_at":"2026-05-18T00:32:21.608092+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZK5YT5J6H5O","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZK5YT5J6H5OSMMC","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZK5YT5J","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.31761","citing_title":"An Efficient Algorithm for Estimating Prime Counts","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XZK5YT5J6H5OSMMCRKPFTS2E3H","json":"https://pith.science/pith/XZK5YT5J6H5OSMMCRKPFTS2E3H.json","graph_json":"https://pith.science/api/pith-number/XZK5YT5J6H5OSMMCRKPFTS2E3H/graph.json","events_json":"https://pith.science/api/pith-number/XZK5YT5J6H5OSMMCRKPFTS2E3H/events.json","paper":"https://pith.science/paper/XZK5YT5J"},"agent_actions":{"view_html":"https://pith.science/pith/XZK5YT5J6H5OSMMCRKPFTS2E3H","download_json":"https://pith.science/pith/XZK5YT5J6H5OSMMCRKPFTS2E3H.json","view_paper":"https://pith.science/paper/XZK5YT5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02032&json=true","fetch_graph":"https://pith.science/api/pith-number/XZK5YT5J6H5OSMMCRKPFTS2E3H/graph.json","fetch_events":"https://pith.science/api/pith-number/XZK5YT5J6H5OSMMCRKPFTS2E3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZK5YT5J6H5OSMMCRKPFTS2E3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZK5YT5J6H5OSMMCRKPFTS2E3H/action/storage_attestation","attest_author":"https://pith.science/pith/XZK5YT5J6H5OSMMCRKPFTS2E3H/action/author_attestation","sign_citation":"https://pith.science/pith/XZK5YT5J6H5OSMMCRKPFTS2E3H/action/citation_signature","submit_replication":"https://pith.science/pith/XZK5YT5J6H5OSMMCRKPFTS2E3H/action/replication_record"}},"created_at":"2026-05-18T00:32:21.608092+00:00","updated_at":"2026-05-18T00:32:21.608092+00:00"}