{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:G3QBDEDJEZXJ44MZV7JDAPJ3IE","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":"c3592f8b4d36d63ad4e57d20ce3d211046f46a19b3d7d89d9cda1d402e24898e","cross_cats_sorted":["cs.DS","cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-22T04:54:20Z","title_canon_sha256":"d8e0cfb6eecf51f16ba84f369b1a6e80e906a40e278dde63d4876dd794e7b99a"},"schema_version":"1.0","source":{"id":"2606.22851","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22851","created_at":"2026-06-23T03:14:01Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22851v1","created_at":"2026-06-23T03:14:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22851","created_at":"2026-06-23T03:14:01Z"},{"alias_kind":"pith_short_12","alias_value":"G3QBDEDJEZXJ","created_at":"2026-06-23T03:14:01Z"},{"alias_kind":"pith_short_16","alias_value":"G3QBDEDJEZXJ44MZ","created_at":"2026-06-23T03:14:01Z"},{"alias_kind":"pith_short_8","alias_value":"G3QBDEDJ","created_at":"2026-06-23T03:14:01Z"}],"graph_snapshots":[{"event_id":"sha256:df098ff9c3ea676f17fec2e90af7bfb3be5407834d8982044d795969fdc9630f","target":"graph","created_at":"2026-06-23T03:14:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.22851/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We describe several new algorithms for finding all prime numbers up to a given bound $N$, achieving the first ever speedup by a positive power of $\\log N$ over the ancient sieve of Eratosthenes. The fastest version, which is not fully rigorous, runs in \\[ N (\\log \\log N)^{1+o(1)} \\] bit operations when analysed in the multitape Turing model. This improves on the best existing algorithms due to Pritchard (1981), Atkin--Bernstein (2004) and Sergeev (2016) by a factor of almost $\\log N$. We also present a rigorous randomised (Las Vegas) variant that is slower by a factor of $(\\log \\log N)^{1+o(1)","authors_text":"David Harvey","cross_cats":["cs.DS","cs.SC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22851","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:bc3dea896a1eb853f153d85f93d073b051d669bb3ff437f3fef51da0d205c9c5","target":"record","created_at":"2026-06-23T03:14:01Z","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":"c3592f8b4d36d63ad4e57d20ce3d211046f46a19b3d7d89d9cda1d402e24898e","cross_cats_sorted":["cs.DS","cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-06-22T04:54:20Z","title_canon_sha256":"d8e0cfb6eecf51f16ba84f369b1a6e80e906a40e278dde63d4876dd794e7b99a"},"schema_version":"1.0","source":{"id":"2606.22851","kind":"arxiv","version":1}},"canonical_sha256":"36e0119069266e9e7199afd2303d3b4131eb8607fb2fb6a3902d51415887a7f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36e0119069266e9e7199afd2303d3b4131eb8607fb2fb6a3902d51415887a7f7","first_computed_at":"2026-06-23T03:14:01.449441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T03:14:01.449441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mggVEfxrE1cx586xelhGDK6YpD8eMqsRCEm3W40qnblZhpNLcmr+q4qLVzWUtDH9MpY4rqMyHKiGKHPtMaf3BQ==","signature_status":"signed_v1","signed_at":"2026-06-23T03:14:01.449908Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.22851","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc3dea896a1eb853f153d85f93d073b051d669bb3ff437f3fef51da0d205c9c5","sha256:df098ff9c3ea676f17fec2e90af7bfb3be5407834d8982044d795969fdc9630f"],"state_sha256":"b8364a5d11935e52626b2c817c39e20f92131af59ad482663cee41d3d46b4c5f"}