{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QHZ7TN4HRJOEPQA52ZZ2QS3VB5","short_pith_number":"pith:QHZ7TN4H","schema_version":"1.0","canonical_sha256":"81f3f9b7878a5c47c01dd673a84b750f6f3537f21be06600635541a2c8fe9587","source":{"kind":"arxiv","id":"1506.00445","version":1},"attestation_state":"computed","paper":{"title":"A structure theorem for sets of small popular doubling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Przemys{\\l}aw Mazur","submitted_at":"2015-06-01T11:16:08Z","abstract_excerpt":"In this paper we prove that every set $A\\subset\\mathbb{Z}$ satisfying the inequality $\\sum_{x}\\min(1_A*1_A(x),t)\\le(2+\\delta)t|A|$ for $t$ and $\\delta$ in suitable ranges, then $A$ must be very close to an arithmetic progression. We use this result to improve the estimates of Green and Morris for the probability that a random subset $A\\subset\\mathbb{N}$ satisfies $|\\mathbb{N}\\setminus(A+A)|\\ge k$; specifically we show that $\\mathbb{P}(|\\mathbb{N}\\setminus(A+A)|\\ge k)=\\Theta(2^{-k/2})$."},"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":"1506.00445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-01T11:16:08Z","cross_cats_sorted":[],"title_canon_sha256":"9b5e4b2a7449f504e09bbe1a72c6d40fa9a07d4e6d2d575732799e7c6ba61aa1","abstract_canon_sha256":"70e90f4e6e1e7bf65bbfd1f8af3118802dc43df3b96d594fb036bd073fcf3cc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:54.560409Z","signature_b64":"mJxI3bbhogd7EhXXEvb0VbJrbzZCmsuGutSaGNIydwVfbZxRigvLwXlcLSFiX84kEDNmfS/lNKC/h76ldePDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81f3f9b7878a5c47c01dd673a84b750f6f3537f21be06600635541a2c8fe9587","last_reissued_at":"2026-05-18T01:59:54.559960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:54.559960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A structure theorem for sets of small popular doubling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Przemys{\\l}aw Mazur","submitted_at":"2015-06-01T11:16:08Z","abstract_excerpt":"In this paper we prove that every set $A\\subset\\mathbb{Z}$ satisfying the inequality $\\sum_{x}\\min(1_A*1_A(x),t)\\le(2+\\delta)t|A|$ for $t$ and $\\delta$ in suitable ranges, then $A$ must be very close to an arithmetic progression. We use this result to improve the estimates of Green and Morris for the probability that a random subset $A\\subset\\mathbb{N}$ satisfies $|\\mathbb{N}\\setminus(A+A)|\\ge k$; specifically we show that $\\mathbb{P}(|\\mathbb{N}\\setminus(A+A)|\\ge k)=\\Theta(2^{-k/2})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00445","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.00445","created_at":"2026-05-18T01:59:54.560025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00445v1","created_at":"2026-05-18T01:59:54.560025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00445","created_at":"2026-05-18T01:59:54.560025+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHZ7TN4HRJOE","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHZ7TN4HRJOEPQA5","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHZ7TN4H","created_at":"2026-05-18T12:29:37.295048+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/QHZ7TN4HRJOEPQA52ZZ2QS3VB5","json":"https://pith.science/pith/QHZ7TN4HRJOEPQA52ZZ2QS3VB5.json","graph_json":"https://pith.science/api/pith-number/QHZ7TN4HRJOEPQA52ZZ2QS3VB5/graph.json","events_json":"https://pith.science/api/pith-number/QHZ7TN4HRJOEPQA52ZZ2QS3VB5/events.json","paper":"https://pith.science/paper/QHZ7TN4H"},"agent_actions":{"view_html":"https://pith.science/pith/QHZ7TN4HRJOEPQA52ZZ2QS3VB5","download_json":"https://pith.science/pith/QHZ7TN4HRJOEPQA52ZZ2QS3VB5.json","view_paper":"https://pith.science/paper/QHZ7TN4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00445&json=true","fetch_graph":"https://pith.science/api/pith-number/QHZ7TN4HRJOEPQA52ZZ2QS3VB5/graph.json","fetch_events":"https://pith.science/api/pith-number/QHZ7TN4HRJOEPQA52ZZ2QS3VB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHZ7TN4HRJOEPQA52ZZ2QS3VB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHZ7TN4HRJOEPQA52ZZ2QS3VB5/action/storage_attestation","attest_author":"https://pith.science/pith/QHZ7TN4HRJOEPQA52ZZ2QS3VB5/action/author_attestation","sign_citation":"https://pith.science/pith/QHZ7TN4HRJOEPQA52ZZ2QS3VB5/action/citation_signature","submit_replication":"https://pith.science/pith/QHZ7TN4HRJOEPQA52ZZ2QS3VB5/action/replication_record"}},"created_at":"2026-05-18T01:59:54.560025+00:00","updated_at":"2026-05-18T01:59:54.560025+00:00"}