{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SNC6FWOUVFZ3DLJJGSV6RN3BB5","short_pith_number":"pith:SNC6FWOU","schema_version":"1.0","canonical_sha256":"9345e2d9d4a973b1ad2934abe8b7610f7424bbc664cea75090b2692b3f280f60","source":{"kind":"arxiv","id":"2606.31761","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Algorithm for Estimating Prime Counts","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Artur Samojluk, Artur Siemaszko","submitted_at":"2026-06-30T14:49:55Z","abstract_excerpt":"We propose an efficient algorithm for approximating the prime counting function $\\pi(x)$ using a structured non-uniform partition derived from generalized triangular numbers. The method yields an incremental estimator whose updates require only local computations, resulting in amortized $O(1)$ update complexity and total complexity $O(\\sqrt x)$.\n  A correction term obtained through extensive numerical experimentation significantly improves the approximation accuracy. Computational tests for values up to $10^{19}$\n  show strong agreement with known values of $\\pi(x)$, with accuracy comparable t"},"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":"2606.31761","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2026-06-30T14:49:55Z","cross_cats_sorted":[],"title_canon_sha256":"7982f07f4b01860be4c1673c7b6213dc6eb8e91944ae1ea7ddee9c354a3c0eb1","abstract_canon_sha256":"725e76f96a60b4d08e03e377f5cd00196a06d8523b8b2758c476e9705b7a9240"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:13.975328Z","signature_b64":"nXQLoKCrfhjB7wHN0fEj+m7AJlHgQChq/QrfFbG5cTmFK0Z5YiAsetowqDflfw72Iv7ybTVrOhl+n0Rq5bUHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9345e2d9d4a973b1ad2934abe8b7610f7424bbc664cea75090b2692b3f280f60","last_reissued_at":"2026-07-01T01:18:13.974882Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:13.974882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for Estimating Prime Counts","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Artur Samojluk, Artur Siemaszko","submitted_at":"2026-06-30T14:49:55Z","abstract_excerpt":"We propose an efficient algorithm for approximating the prime counting function $\\pi(x)$ using a structured non-uniform partition derived from generalized triangular numbers. The method yields an incremental estimator whose updates require only local computations, resulting in amortized $O(1)$ update complexity and total complexity $O(\\sqrt x)$.\n  A correction term obtained through extensive numerical experimentation significantly improves the approximation accuracy. Computational tests for values up to $10^{19}$\n  show strong agreement with known values of $\\pi(x)$, with accuracy comparable t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31761","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.31761/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":"2606.31761","created_at":"2026-07-01T01:18:13.974943+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.31761v1","created_at":"2026-07-01T01:18:13.974943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31761","created_at":"2026-07-01T01:18:13.974943+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNC6FWOUVFZ3","created_at":"2026-07-01T01:18:13.974943+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNC6FWOUVFZ3DLJJ","created_at":"2026-07-01T01:18:13.974943+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNC6FWOU","created_at":"2026-07-01T01:18:13.974943+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5","json":"https://pith.science/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5.json","graph_json":"https://pith.science/api/pith-number/SNC6FWOUVFZ3DLJJGSV6RN3BB5/graph.json","events_json":"https://pith.science/api/pith-number/SNC6FWOUVFZ3DLJJGSV6RN3BB5/events.json","paper":"https://pith.science/paper/SNC6FWOU"},"agent_actions":{"view_html":"https://pith.science/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5","download_json":"https://pith.science/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5.json","view_paper":"https://pith.science/paper/SNC6FWOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.31761&json=true","fetch_graph":"https://pith.science/api/pith-number/SNC6FWOUVFZ3DLJJGSV6RN3BB5/graph.json","fetch_events":"https://pith.science/api/pith-number/SNC6FWOUVFZ3DLJJGSV6RN3BB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5/action/storage_attestation","attest_author":"https://pith.science/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5/action/author_attestation","sign_citation":"https://pith.science/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5/action/citation_signature","submit_replication":"https://pith.science/pith/SNC6FWOUVFZ3DLJJGSV6RN3BB5/action/replication_record"}},"created_at":"2026-07-01T01:18:13.974943+00:00","updated_at":"2026-07-01T01:18:13.974943+00:00"}