{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XBZ2XDU6JCEBIFQZ4N3ZWRVHFT","short_pith_number":"pith:XBZ2XDU6","schema_version":"1.0","canonical_sha256":"b873ab8e9e4888141619e3779b46a72cc0280eb8633395e9db219f8098afbea1","source":{"kind":"arxiv","id":"1503.02592","version":1},"attestation_state":"computed","paper":{"title":"Two Compact Incremental Prime Sieves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.DS","authors_text":"Jonathan P. Sorenson","submitted_at":"2015-03-09T18:02:51Z","abstract_excerpt":"A prime sieve is an algorithm that finds the primes up to a bound $n$. We say that a prime sieve is incremental, if it can quickly determine if $n+1$ is prime after having found all primes up to $n$. We say a sieve is compact if it uses roughly $\\sqrt{n}$ space or less. In this paper we present two new results:\n  (1) We describe the rolling sieve, a practical, incremental prime sieve that takes $O(n\\log\\log n)$ time and $O(\\sqrt{n}\\log n)$ bits of space, and\n  (2) We show how to modify the sieve of Atkin and Bernstein (2004) to obtain a sieve that is simultaneously sublinear, compact, and incr"},"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":"1503.02592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-09T18:02:51Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"f77932afd8140fd5ddaff931e04ea111bee7c6b5f2407af7e76edf2191ebd4fa","abstract_canon_sha256":"b7ad74cad93ced8521e28fe4eaf89c2e4b26ce2528e41d410502333aabb93bd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:13.916846Z","signature_b64":"cvB0ugbnP6sD/o54QfLgNdRf0+KmYTQQtbV4ZB/IVGKuMEANIMFPgzDnUXOBUvL34VwiGb4zpMM15fvcfoj9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b873ab8e9e4888141619e3779b46a72cc0280eb8633395e9db219f8098afbea1","last_reissued_at":"2026-05-17T23:53:13.916296Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:13.916296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two Compact Incremental Prime Sieves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.DS","authors_text":"Jonathan P. Sorenson","submitted_at":"2015-03-09T18:02:51Z","abstract_excerpt":"A prime sieve is an algorithm that finds the primes up to a bound $n$. We say that a prime sieve is incremental, if it can quickly determine if $n+1$ is prime after having found all primes up to $n$. We say a sieve is compact if it uses roughly $\\sqrt{n}$ space or less. In this paper we present two new results:\n  (1) We describe the rolling sieve, a practical, incremental prime sieve that takes $O(n\\log\\log n)$ time and $O(\\sqrt{n}\\log n)$ bits of space, and\n  (2) We show how to modify the sieve of Atkin and Bernstein (2004) to obtain a sieve that is simultaneously sublinear, compact, and incr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02592","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.02592","created_at":"2026-05-17T23:53:13.916390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02592v1","created_at":"2026-05-17T23:53:13.916390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02592","created_at":"2026-05-17T23:53:13.916390+00:00"},{"alias_kind":"pith_short_12","alias_value":"XBZ2XDU6JCEB","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XBZ2XDU6JCEBIFQZ","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XBZ2XDU6","created_at":"2026-05-18T12:29:50.041715+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/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT","json":"https://pith.science/pith/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT.json","graph_json":"https://pith.science/api/pith-number/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT/graph.json","events_json":"https://pith.science/api/pith-number/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT/events.json","paper":"https://pith.science/paper/XBZ2XDU6"},"agent_actions":{"view_html":"https://pith.science/pith/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT","download_json":"https://pith.science/pith/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT.json","view_paper":"https://pith.science/paper/XBZ2XDU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02592&json=true","fetch_graph":"https://pith.science/api/pith-number/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT/graph.json","fetch_events":"https://pith.science/api/pith-number/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT/action/storage_attestation","attest_author":"https://pith.science/pith/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT/action/author_attestation","sign_citation":"https://pith.science/pith/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT/action/citation_signature","submit_replication":"https://pith.science/pith/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT/action/replication_record"}},"created_at":"2026-05-17T23:53:13.916390+00:00","updated_at":"2026-05-17T23:53:13.916390+00:00"}