{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MAWKRSRTK7TQ3YQVTFA2DC5IJN","short_pith_number":"pith:MAWKRSRT","schema_version":"1.0","canonical_sha256":"602ca8ca3357e70de2159941a18ba84b74ca116b213074f1d27ee8fba12ac940","source":{"kind":"arxiv","id":"1205.0413","version":2},"attestation_state":"computed","paper":{"title":"When the sieve works","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Andrew Granville, Dimitris Koukoulopoulos, Kaisa Matom\\\"aki","submitted_at":"2012-05-02T12:56:04Z","abstract_excerpt":"We are interested in classifying those sets of primes $\\mathcal{P}$ such that when we sieve out the integers up to $x$ by the primes in $\\mathcal{P}^c$ we are left with roughly the expected number of unsieved integers. In particular, we obtain the first general results for sieving an interval of length $x$ with primes including some in $(\\sqrt{x},x]$, using methods motivated by additive combinatorics."},"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":"1205.0413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-05-02T12:56:04Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"749fb3090369fc67f57b958a99071967a21168f5bc67df9192316f9237c60534","abstract_canon_sha256":"50bf6fe4c5292e054c0f520bbde56ae798afb4345a34e7ff0b1a27935b35c684"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:21.764363Z","signature_b64":"YWhnpyj2rAGVQH3aG/TPMjQpCM2mOk0xE9jdzp6GepCZ3odE4qBi/qGKWNUn7c1SDmdwdsC6+yzhOIsJWnHSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"602ca8ca3357e70de2159941a18ba84b74ca116b213074f1d27ee8fba12ac940","last_reissued_at":"2026-05-18T01:28:21.761273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:21.761273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When the sieve works","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Andrew Granville, Dimitris Koukoulopoulos, Kaisa Matom\\\"aki","submitted_at":"2012-05-02T12:56:04Z","abstract_excerpt":"We are interested in classifying those sets of primes $\\mathcal{P}$ such that when we sieve out the integers up to $x$ by the primes in $\\mathcal{P}^c$ we are left with roughly the expected number of unsieved integers. In particular, we obtain the first general results for sieving an interval of length $x$ with primes including some in $(\\sqrt{x},x]$, using methods motivated by additive combinatorics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0413","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":"1205.0413","created_at":"2026-05-18T01:28:21.763328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0413v2","created_at":"2026-05-18T01:28:21.763328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0413","created_at":"2026-05-18T01:28:21.763328+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAWKRSRTK7TQ","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAWKRSRTK7TQ3YQV","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAWKRSRT","created_at":"2026-05-18T12:27:14.488303+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/MAWKRSRTK7TQ3YQVTFA2DC5IJN","json":"https://pith.science/pith/MAWKRSRTK7TQ3YQVTFA2DC5IJN.json","graph_json":"https://pith.science/api/pith-number/MAWKRSRTK7TQ3YQVTFA2DC5IJN/graph.json","events_json":"https://pith.science/api/pith-number/MAWKRSRTK7TQ3YQVTFA2DC5IJN/events.json","paper":"https://pith.science/paper/MAWKRSRT"},"agent_actions":{"view_html":"https://pith.science/pith/MAWKRSRTK7TQ3YQVTFA2DC5IJN","download_json":"https://pith.science/pith/MAWKRSRTK7TQ3YQVTFA2DC5IJN.json","view_paper":"https://pith.science/paper/MAWKRSRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0413&json=true","fetch_graph":"https://pith.science/api/pith-number/MAWKRSRTK7TQ3YQVTFA2DC5IJN/graph.json","fetch_events":"https://pith.science/api/pith-number/MAWKRSRTK7TQ3YQVTFA2DC5IJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAWKRSRTK7TQ3YQVTFA2DC5IJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAWKRSRTK7TQ3YQVTFA2DC5IJN/action/storage_attestation","attest_author":"https://pith.science/pith/MAWKRSRTK7TQ3YQVTFA2DC5IJN/action/author_attestation","sign_citation":"https://pith.science/pith/MAWKRSRTK7TQ3YQVTFA2DC5IJN/action/citation_signature","submit_replication":"https://pith.science/pith/MAWKRSRTK7TQ3YQVTFA2DC5IJN/action/replication_record"}},"created_at":"2026-05-18T01:28:21.763328+00:00","updated_at":"2026-05-18T01:28:21.763328+00:00"}