{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3CUTUM34CE6YKZVR37QEX55LWN","short_pith_number":"pith:3CUTUM34","schema_version":"1.0","canonical_sha256":"d8a93a337c113d8566b1dfe04bf7abb36ce294de00169003324f64972e355257","source":{"kind":"arxiv","id":"1204.3795","version":2},"attestation_state":"computed","paper":{"title":"A Sieve for Cousin Primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"H. J. Weber","submitted_at":"2012-04-17T13:56:29Z","abstract_excerpt":"A sieve is constructed for twin primes at distance 4, which are of the form 3(2m+1)+/-2, and are characterized by their twin-4 rank 2m+1. It has no parity problem. Non-ranks are identified as all other odd numbers and counted using odd primes p>=5. Twin-4 ranks and non-ranks make up the set of odd numbers. Regularities of non-ranks allow gathering information on them to obtain a Legendre-type sum for the number of twin-4 ranks. Due to considerable cancellations in it, the asymptotic law of its main term has the expected form and magnitude of its coefficient."},"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":"1204.3795","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-04-17T13:56:29Z","cross_cats_sorted":[],"title_canon_sha256":"099a8f261ddbe233c31bedaa5843359ed44c44d8faed71d16f1d447342d57a7c","abstract_canon_sha256":"671b15bd47444e136cd07030ae5a0368d026717a5f7f68ba2401a24c4080cfcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:13.819836Z","signature_b64":"7OCB3Cd3eLr5v6i8g4yV1l/06u3zfhOyMCWg1szMOkeVGnSVSMW3yw3n0SZCODZkAx6iiGYdLQmQ+qCr3KgHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8a93a337c113d8566b1dfe04bf7abb36ce294de00169003324f64972e355257","last_reissued_at":"2026-05-18T03:57:13.819169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:13.819169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sieve for Cousin Primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"H. J. Weber","submitted_at":"2012-04-17T13:56:29Z","abstract_excerpt":"A sieve is constructed for twin primes at distance 4, which are of the form 3(2m+1)+/-2, and are characterized by their twin-4 rank 2m+1. It has no parity problem. Non-ranks are identified as all other odd numbers and counted using odd primes p>=5. Twin-4 ranks and non-ranks make up the set of odd numbers. Regularities of non-ranks allow gathering information on them to obtain a Legendre-type sum for the number of twin-4 ranks. Due to considerable cancellations in it, the asymptotic law of its main term has the expected form and magnitude of its coefficient."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3795","kind":"arxiv","version":2},"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":"1204.3795","created_at":"2026-05-18T03:57:13.819266+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.3795v2","created_at":"2026-05-18T03:57:13.819266+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3795","created_at":"2026-05-18T03:57:13.819266+00:00"},{"alias_kind":"pith_short_12","alias_value":"3CUTUM34CE6Y","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3CUTUM34CE6YKZVR","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3CUTUM34","created_at":"2026-05-18T12:26:50.516681+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/3CUTUM34CE6YKZVR37QEX55LWN","json":"https://pith.science/pith/3CUTUM34CE6YKZVR37QEX55LWN.json","graph_json":"https://pith.science/api/pith-number/3CUTUM34CE6YKZVR37QEX55LWN/graph.json","events_json":"https://pith.science/api/pith-number/3CUTUM34CE6YKZVR37QEX55LWN/events.json","paper":"https://pith.science/paper/3CUTUM34"},"agent_actions":{"view_html":"https://pith.science/pith/3CUTUM34CE6YKZVR37QEX55LWN","download_json":"https://pith.science/pith/3CUTUM34CE6YKZVR37QEX55LWN.json","view_paper":"https://pith.science/paper/3CUTUM34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.3795&json=true","fetch_graph":"https://pith.science/api/pith-number/3CUTUM34CE6YKZVR37QEX55LWN/graph.json","fetch_events":"https://pith.science/api/pith-number/3CUTUM34CE6YKZVR37QEX55LWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3CUTUM34CE6YKZVR37QEX55LWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3CUTUM34CE6YKZVR37QEX55LWN/action/storage_attestation","attest_author":"https://pith.science/pith/3CUTUM34CE6YKZVR37QEX55LWN/action/author_attestation","sign_citation":"https://pith.science/pith/3CUTUM34CE6YKZVR37QEX55LWN/action/citation_signature","submit_replication":"https://pith.science/pith/3CUTUM34CE6YKZVR37QEX55LWN/action/replication_record"}},"created_at":"2026-05-18T03:57:13.819266+00:00","updated_at":"2026-05-18T03:57:13.819266+00:00"}