{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ACBDFCMOFHNP27TIE4KEPE2QIY","short_pith_number":"pith:ACBDFCMO","schema_version":"1.0","canonical_sha256":"008232898e29dafd7e682714479350461ec6a48288d4c058a33f99bf086088a3","source":{"kind":"arxiv","id":"2212.09857","version":4},"attestation_state":"computed","paper":{"title":"Computing $\\pi(N)$: An elementary approach in $\\tilde{O}(\\sqrt{N})$ time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Dean Hirsch, Ido Kessler, Uri Mendlovic","submitted_at":"2022-12-19T21:05:14Z","abstract_excerpt":"We present an efficient and elementary algorithm for computing the number of primes up to $N$ in $\\tilde{O}(\\sqrt N)$ time, improving upon the existing combinatorial methods that require $\\tilde{O}(N ^ {2/3})$ time. Our method has a similar time complexity to the analytical approach to prime counting, while avoiding complex analysis and the use of arbitrary precision complex numbers. While the most time-efficient version of our algorithm requires $\\tilde{O}(\\sqrt N)$ space, we present a continuous space-time trade-off, showing, e.g., how to reduce the space complexity to $\\tilde{O}(\\sqrt[3]{N}"},"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":"2212.09857","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2022-12-19T21:05:14Z","cross_cats_sorted":[],"title_canon_sha256":"8160fdfaa71ddf372d61a6af18913dec70052139abaa4e831dc99de653511cf0","abstract_canon_sha256":"edeac8b6be0413a2eddf509d89256705a51db75e2bbfd155da180790d0bbc276"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:40:31.087086Z","signature_b64":"m2sReFQJoYwJbQsAExXuOFdEBKmQ9wBP8wVu46wfTxtasnaE254CYMBJ9dgkMSnFA4tUcBOla9+8nQ8DjazKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"008232898e29dafd7e682714479350461ec6a48288d4c058a33f99bf086088a3","last_reissued_at":"2026-07-05T06:40:31.086345Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:40:31.086345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing $\\pi(N)$: An elementary approach in $\\tilde{O}(\\sqrt{N})$ time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Dean Hirsch, Ido Kessler, Uri Mendlovic","submitted_at":"2022-12-19T21:05:14Z","abstract_excerpt":"We present an efficient and elementary algorithm for computing the number of primes up to $N$ in $\\tilde{O}(\\sqrt N)$ time, improving upon the existing combinatorial methods that require $\\tilde{O}(N ^ {2/3})$ time. Our method has a similar time complexity to the analytical approach to prime counting, while avoiding complex analysis and the use of arbitrary precision complex numbers. While the most time-efficient version of our algorithm requires $\\tilde{O}(\\sqrt N)$ space, we present a continuous space-time trade-off, showing, e.g., how to reduce the space complexity to $\\tilde{O}(\\sqrt[3]{N}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.09857","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.09857/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2212.09857","created_at":"2026-07-05T06:40:31.086425+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.09857v4","created_at":"2026-07-05T06:40:31.086425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.09857","created_at":"2026-07-05T06:40:31.086425+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACBDFCMOFHNP","created_at":"2026-07-05T06:40:31.086425+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACBDFCMOFHNP27TI","created_at":"2026-07-05T06:40:31.086425+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACBDFCMO","created_at":"2026-07-05T06:40:31.086425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07566","citing_title":"Practical Computations of the Mertens Function: $M(10^{24})$ and $M(10^{25})$","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ACBDFCMOFHNP27TIE4KEPE2QIY","json":"https://pith.science/pith/ACBDFCMOFHNP27TIE4KEPE2QIY.json","graph_json":"https://pith.science/api/pith-number/ACBDFCMOFHNP27TIE4KEPE2QIY/graph.json","events_json":"https://pith.science/api/pith-number/ACBDFCMOFHNP27TIE4KEPE2QIY/events.json","paper":"https://pith.science/paper/ACBDFCMO"},"agent_actions":{"view_html":"https://pith.science/pith/ACBDFCMOFHNP27TIE4KEPE2QIY","download_json":"https://pith.science/pith/ACBDFCMOFHNP27TIE4KEPE2QIY.json","view_paper":"https://pith.science/paper/ACBDFCMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.09857&json=true","fetch_graph":"https://pith.science/api/pith-number/ACBDFCMOFHNP27TIE4KEPE2QIY/graph.json","fetch_events":"https://pith.science/api/pith-number/ACBDFCMOFHNP27TIE4KEPE2QIY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACBDFCMOFHNP27TIE4KEPE2QIY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACBDFCMOFHNP27TIE4KEPE2QIY/action/storage_attestation","attest_author":"https://pith.science/pith/ACBDFCMOFHNP27TIE4KEPE2QIY/action/author_attestation","sign_citation":"https://pith.science/pith/ACBDFCMOFHNP27TIE4KEPE2QIY/action/citation_signature","submit_replication":"https://pith.science/pith/ACBDFCMOFHNP27TIE4KEPE2QIY/action/replication_record"}},"created_at":"2026-07-05T06:40:31.086425+00:00","updated_at":"2026-07-05T06:40:31.086425+00:00"}