{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZA7WHSHBS32KQAYKXJVWNKVKU7","short_pith_number":"pith:ZA7WHSHB","schema_version":"1.0","canonical_sha256":"c83f63c8e196f4a8030aba6b66aaaaa7db51f923eae57930c64161c48eaa9ef9","source":{"kind":"arxiv","id":"1105.3895","version":2},"attestation_state":"computed","paper":{"title":"Prescribing the binary digits of primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jean Bourgain","submitted_at":"2011-05-19T14:48:42Z","abstract_excerpt":"We present a new result on counting primes $p<N=2^n$ for which $r$ (arbitrarily placed) digits in the binary expansion of $p$ are specified. Compared with earlier work of Harman and Katai, the restriction on $r$ is relaxed to $r< c\\Big(\\frac n{\\log n}\\Big)^{4/7}$. This condition results from the estimates of Gallagher and Iwaniec on zero-free regions of $L$-functions with `powerful' conductor."},"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":"1105.3895","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-05-19T14:48:42Z","cross_cats_sorted":[],"title_canon_sha256":"0c6b3bd4d8659570f30de86c263b0fae844173436c78a033f37c29b5e21a4a71","abstract_canon_sha256":"cde352be61683f33c49f8098c43c1afaf59879dfb72bd4337ec50e6d45631009"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:03.925914Z","signature_b64":"AK76vSXVTSCAFLPA+yU8bBajLZDsW5ZX5dM89CSOus5rPBmJOa5E+aAK7ErxBlHYBC1F7vQXQVzdXt6tB5ltBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c83f63c8e196f4a8030aba6b66aaaaa7db51f923eae57930c64161c48eaa9ef9","last_reissued_at":"2026-05-18T04:05:03.924087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:03.924087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prescribing the binary digits of primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jean Bourgain","submitted_at":"2011-05-19T14:48:42Z","abstract_excerpt":"We present a new result on counting primes $p<N=2^n$ for which $r$ (arbitrarily placed) digits in the binary expansion of $p$ are specified. Compared with earlier work of Harman and Katai, the restriction on $r$ is relaxed to $r< c\\Big(\\frac n{\\log n}\\Big)^{4/7}$. This condition results from the estimates of Gallagher and Iwaniec on zero-free regions of $L$-functions with `powerful' conductor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3895","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":"1105.3895","created_at":"2026-05-18T04:05:03.925124+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.3895v2","created_at":"2026-05-18T04:05:03.925124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3895","created_at":"2026-05-18T04:05:03.925124+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZA7WHSHBS32K","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZA7WHSHBS32KQAYK","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZA7WHSHB","created_at":"2026-05-18T12:26:47.523578+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/ZA7WHSHBS32KQAYKXJVWNKVKU7","json":"https://pith.science/pith/ZA7WHSHBS32KQAYKXJVWNKVKU7.json","graph_json":"https://pith.science/api/pith-number/ZA7WHSHBS32KQAYKXJVWNKVKU7/graph.json","events_json":"https://pith.science/api/pith-number/ZA7WHSHBS32KQAYKXJVWNKVKU7/events.json","paper":"https://pith.science/paper/ZA7WHSHB"},"agent_actions":{"view_html":"https://pith.science/pith/ZA7WHSHBS32KQAYKXJVWNKVKU7","download_json":"https://pith.science/pith/ZA7WHSHBS32KQAYKXJVWNKVKU7.json","view_paper":"https://pith.science/paper/ZA7WHSHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.3895&json=true","fetch_graph":"https://pith.science/api/pith-number/ZA7WHSHBS32KQAYKXJVWNKVKU7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZA7WHSHBS32KQAYKXJVWNKVKU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZA7WHSHBS32KQAYKXJVWNKVKU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZA7WHSHBS32KQAYKXJVWNKVKU7/action/storage_attestation","attest_author":"https://pith.science/pith/ZA7WHSHBS32KQAYKXJVWNKVKU7/action/author_attestation","sign_citation":"https://pith.science/pith/ZA7WHSHBS32KQAYKXJVWNKVKU7/action/citation_signature","submit_replication":"https://pith.science/pith/ZA7WHSHBS32KQAYKXJVWNKVKU7/action/replication_record"}},"created_at":"2026-05-18T04:05:03.925124+00:00","updated_at":"2026-05-18T04:05:03.925124+00:00"}