{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3RZVEQWXUNW3VDR2H4Q6G4B4EB","short_pith_number":"pith:3RZVEQWX","canonical_record":{"source":{"id":"1906.09220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-06-21T16:08:49Z","cross_cats_sorted":[],"title_canon_sha256":"3c795b43e3e0055cf8d812e09777e953563210f13af78f8cc06dd21b06f18716","abstract_canon_sha256":"6fb144bb7aabab53d355c2db9a802fa9d825713040180467628412f44fba756a"},"schema_version":"1.0"},"canonical_sha256":"dc735242d7a36dba8e3a3f21e3703c2079071c3a2c9955d6beb94cf729e610bf","source":{"kind":"arxiv","id":"1906.09220","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09220","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09220v1","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09220","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"3RZVEQWXUNW3","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3RZVEQWXUNW3VDR2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3RZVEQWX","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3RZVEQWXUNW3VDR2H4Q6G4B4EB","target":"record","payload":{"canonical_record":{"source":{"id":"1906.09220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-06-21T16:08:49Z","cross_cats_sorted":[],"title_canon_sha256":"3c795b43e3e0055cf8d812e09777e953563210f13af78f8cc06dd21b06f18716","abstract_canon_sha256":"6fb144bb7aabab53d355c2db9a802fa9d825713040180467628412f44fba756a"},"schema_version":"1.0"},"canonical_sha256":"dc735242d7a36dba8e3a3f21e3703c2079071c3a2c9955d6beb94cf729e610bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:44.119020Z","signature_b64":"qX38Aa3rqmgPVTVcBf98NkntjZq6A/rRvhYE7ct1wLxIRisTW4NKyoFD5aXpUOLVvneTJJBfuieFmCyuq7fmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc735242d7a36dba8e3a3f21e3703c2079071c3a2c9955d6beb94cf729e610bf","last_reissued_at":"2026-05-17T23:42:44.118444Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:44.118444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.09220","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:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cVcms7Ie7EQ8aHrN/Xd3uUpm3QCiApJtdLIhoOiQqwMNmlwXaS2/ZC4cP21TWFgxj6ul6ZH0NRolxMnbYntZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:36:35.300955Z"},"content_sha256":"9bd62d62e33b07451287e34015480bc4bf1dd6f2c3e92bb5f8e9d4dedbe6a8f7","schema_version":"1.0","event_id":"sha256:9bd62d62e33b07451287e34015480bc4bf1dd6f2c3e92bb5f8e9d4dedbe6a8f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3RZVEQWXUNW3VDR2H4Q6G4B4EB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Sieve for Twin Primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Geza Schay, Jon S. Birdsey","submitted_at":"2019-06-21T16:08:49Z","abstract_excerpt":"We present an algorithm analogous to the sieve of Eratosthenes that produces the list of twin primes. Next, we count the number of twin primes resulting from the construction with two different heuristic arguments. The first method is essentially the same as the one in Hardy and Wright. However, the second method is novel. It results in the same asymptotic formula but it uses a simpler correction factor than theirs. Though we have no theory for the accuracy of our estimates, we compute them both without and with the correction factor and they turn out to be close to the actual counts up to 800"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09220","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:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j0dstFfnlsnF9nvT9BsByr7IUciOEKR7UGVQd7phKDRAN81p63YQOjiTYwNnuxbh5Xf/g0NkCqVWhoG+McIFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:36:35.301291Z"},"content_sha256":"8964416c950f1083b5e70787a7a751d3a9727a4d908f4797f29455e6405af1c4","schema_version":"1.0","event_id":"sha256:8964416c950f1083b5e70787a7a751d3a9727a4d908f4797f29455e6405af1c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RZVEQWXUNW3VDR2H4Q6G4B4EB/bundle.json","state_url":"https://pith.science/pith/3RZVEQWXUNW3VDR2H4Q6G4B4EB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RZVEQWXUNW3VDR2H4Q6G4B4EB/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-27T06:36:35Z","links":{"resolver":"https://pith.science/pith/3RZVEQWXUNW3VDR2H4Q6G4B4EB","bundle":"https://pith.science/pith/3RZVEQWXUNW3VDR2H4Q6G4B4EB/bundle.json","state":"https://pith.science/pith/3RZVEQWXUNW3VDR2H4Q6G4B4EB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RZVEQWXUNW3VDR2H4Q6G4B4EB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3RZVEQWXUNW3VDR2H4Q6G4B4EB","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":"6fb144bb7aabab53d355c2db9a802fa9d825713040180467628412f44fba756a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-06-21T16:08:49Z","title_canon_sha256":"3c795b43e3e0055cf8d812e09777e953563210f13af78f8cc06dd21b06f18716"},"schema_version":"1.0","source":{"id":"1906.09220","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09220","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09220v1","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09220","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"3RZVEQWXUNW3","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3RZVEQWXUNW3VDR2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3RZVEQWX","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:8964416c950f1083b5e70787a7a751d3a9727a4d908f4797f29455e6405af1c4","target":"graph","created_at":"2026-05-17T23:42:44Z","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":"We present an algorithm analogous to the sieve of Eratosthenes that produces the list of twin primes. Next, we count the number of twin primes resulting from the construction with two different heuristic arguments. The first method is essentially the same as the one in Hardy and Wright. However, the second method is novel. It results in the same asymptotic formula but it uses a simpler correction factor than theirs. Though we have no theory for the accuracy of our estimates, we compute them both without and with the correction factor and they turn out to be close to the actual counts up to 800","authors_text":"Geza Schay, Jon S. Birdsey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-06-21T16:08:49Z","title":"A Sieve for Twin Primes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09220","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:9bd62d62e33b07451287e34015480bc4bf1dd6f2c3e92bb5f8e9d4dedbe6a8f7","target":"record","created_at":"2026-05-17T23:42:44Z","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":"6fb144bb7aabab53d355c2db9a802fa9d825713040180467628412f44fba756a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-06-21T16:08:49Z","title_canon_sha256":"3c795b43e3e0055cf8d812e09777e953563210f13af78f8cc06dd21b06f18716"},"schema_version":"1.0","source":{"id":"1906.09220","kind":"arxiv","version":1}},"canonical_sha256":"dc735242d7a36dba8e3a3f21e3703c2079071c3a2c9955d6beb94cf729e610bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc735242d7a36dba8e3a3f21e3703c2079071c3a2c9955d6beb94cf729e610bf","first_computed_at":"2026-05-17T23:42:44.118444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:44.118444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qX38Aa3rqmgPVTVcBf98NkntjZq6A/rRvhYE7ct1wLxIRisTW4NKyoFD5aXpUOLVvneTJJBfuieFmCyuq7fmDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:44.119020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.09220","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bd62d62e33b07451287e34015480bc4bf1dd6f2c3e92bb5f8e9d4dedbe6a8f7","sha256:8964416c950f1083b5e70787a7a751d3a9727a4d908f4797f29455e6405af1c4"],"state_sha256":"653842eb28f70bc4746b10243313e5a1dbecfa412f28fcb5f9ef1019087acc61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UlTxZ/TdtQdUhcFvZQg53Qzjow2z8IjNOPWHQ1ylzBLd3KRK5j3nfvF5/HltzLyFmhy0YewttFrLlttv9pfyDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T06:36:35.303570Z","bundle_sha256":"a1464ac236480134c88768c9d9da631b18f1f6da6cd876bdf35bb954af054591"}}