{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XBZ2XDU6JCEBIFQZ4N3ZWRVHFT","short_pith_number":"pith:XBZ2XDU6","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"},"canonical_sha256":"b873ab8e9e4888141619e3779b46a72cc0280eb8633395e9db219f8098afbea1","source":{"kind":"arxiv","id":"1503.02592","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02592","created_at":"2026-05-17T23:53:13Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02592v1","created_at":"2026-05-17T23:53:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02592","created_at":"2026-05-17T23:53:13Z"},{"alias_kind":"pith_short_12","alias_value":"XBZ2XDU6JCEB","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XBZ2XDU6JCEBIFQZ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XBZ2XDU6","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XBZ2XDU6JCEBIFQZ4N3ZWRVHFT","target":"record","payload":{"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"},"canonical_sha256":"b873ab8e9e4888141619e3779b46a72cc0280eb8633395e9db219f8098afbea1","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"},"source_kind":"arxiv","source_id":"1503.02592","source_version":1,"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-17T23:53:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"irZYt0MKcHOSG4T4HpsKoww3SrMW6xnYlM6FfBJMDlBqIeb7EpROfFA7O+uGeFnnUXxtGaG8psmrXYWW5gxyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:25:56.666643Z"},"content_sha256":"d759c5a47a1b60aaff4b476f599d3c6b5707be98c434e0915b2031d0f026b632","schema_version":"1.0","event_id":"sha256:d759c5a47a1b60aaff4b476f599d3c6b5707be98c434e0915b2031d0f026b632"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XBZ2XDU6JCEBIFQZ4N3ZWRVHFT","target":"graph","payload":{"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"},"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-17T23:53:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9JrRxApWtgQhV2FeiyXustqVOrF54kK3YdwT05Qgnrdw76DMB9koHEuVSZPzByz9eWbnn1614UpAHajDTDU+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:25:56.666986Z"},"content_sha256":"ec187506888c297363f55d1446a18595988b97bf26f1b82fd515438d2a928f02","schema_version":"1.0","event_id":"sha256:ec187506888c297363f55d1446a18595988b97bf26f1b82fd515438d2a928f02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT/bundle.json","state_url":"https://pith.science/pith/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT/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-06-27T03:25:56Z","links":{"resolver":"https://pith.science/pith/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT","bundle":"https://pith.science/pith/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT/bundle.json","state":"https://pith.science/pith/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XBZ2XDU6JCEBIFQZ4N3ZWRVHFT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XBZ2XDU6JCEBIFQZ4N3ZWRVHFT","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":"b7ad74cad93ced8521e28fe4eaf89c2e4b26ce2528e41d410502333aabb93bd1","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-09T18:02:51Z","title_canon_sha256":"f77932afd8140fd5ddaff931e04ea111bee7c6b5f2407af7e76edf2191ebd4fa"},"schema_version":"1.0","source":{"id":"1503.02592","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02592","created_at":"2026-05-17T23:53:13Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02592v1","created_at":"2026-05-17T23:53:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02592","created_at":"2026-05-17T23:53:13Z"},{"alias_kind":"pith_short_12","alias_value":"XBZ2XDU6JCEB","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XBZ2XDU6JCEBIFQZ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XBZ2XDU6","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:ec187506888c297363f55d1446a18595988b97bf26f1b82fd515438d2a928f02","target":"graph","created_at":"2026-05-17T23:53:13Z","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":"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","authors_text":"Jonathan P. Sorenson","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-09T18:02:51Z","title":"Two Compact Incremental Prime Sieves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02592","kind":"arxiv","version":1},"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:d759c5a47a1b60aaff4b476f599d3c6b5707be98c434e0915b2031d0f026b632","target":"record","created_at":"2026-05-17T23:53:13Z","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":"b7ad74cad93ced8521e28fe4eaf89c2e4b26ce2528e41d410502333aabb93bd1","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-09T18:02:51Z","title_canon_sha256":"f77932afd8140fd5ddaff931e04ea111bee7c6b5f2407af7e76edf2191ebd4fa"},"schema_version":"1.0","source":{"id":"1503.02592","kind":"arxiv","version":1}},"canonical_sha256":"b873ab8e9e4888141619e3779b46a72cc0280eb8633395e9db219f8098afbea1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b873ab8e9e4888141619e3779b46a72cc0280eb8633395e9db219f8098afbea1","first_computed_at":"2026-05-17T23:53:13.916296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:13.916296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cvB0ugbnP6sD/o54QfLgNdRf0+KmYTQQtbV4ZB/IVGKuMEANIMFPgzDnUXOBUvL34VwiGb4zpMM15fvcfoj9Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:13.916846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02592","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d759c5a47a1b60aaff4b476f599d3c6b5707be98c434e0915b2031d0f026b632","sha256:ec187506888c297363f55d1446a18595988b97bf26f1b82fd515438d2a928f02"],"state_sha256":"45200aa98b13965edae59bc439f6075e2b154acc893fac04924172ad524db884"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lHPULXRdknTKsrBcxUc/mIKntmH1xozXV2goGlrNRe6kr4oA1EulV02Fo3n95Rs+JlxOF5i/TuTs21pFrYiWCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:25:56.668846Z","bundle_sha256":"1d024c9687ea454c076af1a1d85268f37e897d0611181676ca4748018f63b3c5"}}