{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KGQJR3ET7QYK5PL4XTCB5GDYQI","short_pith_number":"pith:KGQJR3ET","schema_version":"1.0","canonical_sha256":"51a098ec93fc30aebd7cbcc41e98788237fe4a5529205dd6bce758fba344d9d2","source":{"kind":"arxiv","id":"1506.00448","version":1},"attestation_state":"computed","paper":{"title":"A structure theorem for sets of small popular doubling, revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Przemys{\\l}aw Mazur","submitted_at":"2015-06-01T11:20:18Z","abstract_excerpt":"We prove that every set $A\\subset\\mathbb{Z}/p\\mathbb{Z}$ with $\\mathbb{E}_x\\min(1_A*1_A(x),t)\\le(2+\\delta)t\\mathbb{E}_x 1_A(a)$ is very close to an arithmetic progression. Here $p$ stands for a large prime and $\\delta,t$ are small real numbers. This shows that the Vosper theorem is stable in the case of a single set."},"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.00448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-01T11:20:18Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"27b1fc0361dfe5286294e5c3323f5d04c01d707b82ffede84ba2cc445b8e5531","abstract_canon_sha256":"29bfb13f77db21c9c6c09cb753ac63c252bdb6defa1c52035b723f9921f72564"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:54.547753Z","signature_b64":"4thlRnGSLjFglhukXZHasmN0PsWnMVNiFTakf4U0ZeziP961bzw5yPCQTm/DkCZSJnwGFQy5jsKAg8BV319KDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51a098ec93fc30aebd7cbcc41e98788237fe4a5529205dd6bce758fba344d9d2","last_reissued_at":"2026-05-18T01:59:54.547230Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:54.547230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A structure theorem for sets of small popular doubling, revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Przemys{\\l}aw Mazur","submitted_at":"2015-06-01T11:20:18Z","abstract_excerpt":"We prove that every set $A\\subset\\mathbb{Z}/p\\mathbb{Z}$ with $\\mathbb{E}_x\\min(1_A*1_A(x),t)\\le(2+\\delta)t\\mathbb{E}_x 1_A(a)$ is very close to an arithmetic progression. Here $p$ stands for a large prime and $\\delta,t$ are small real numbers. This shows that the Vosper theorem is stable in the case of a single set."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00448","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.00448","created_at":"2026-05-18T01:59:54.547311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00448v1","created_at":"2026-05-18T01:59:54.547311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00448","created_at":"2026-05-18T01:59:54.547311+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGQJR3ET7QYK","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGQJR3ET7QYK5PL4","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGQJR3ET","created_at":"2026-05-18T12:29:27.538025+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/KGQJR3ET7QYK5PL4XTCB5GDYQI","json":"https://pith.science/pith/KGQJR3ET7QYK5PL4XTCB5GDYQI.json","graph_json":"https://pith.science/api/pith-number/KGQJR3ET7QYK5PL4XTCB5GDYQI/graph.json","events_json":"https://pith.science/api/pith-number/KGQJR3ET7QYK5PL4XTCB5GDYQI/events.json","paper":"https://pith.science/paper/KGQJR3ET"},"agent_actions":{"view_html":"https://pith.science/pith/KGQJR3ET7QYK5PL4XTCB5GDYQI","download_json":"https://pith.science/pith/KGQJR3ET7QYK5PL4XTCB5GDYQI.json","view_paper":"https://pith.science/paper/KGQJR3ET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00448&json=true","fetch_graph":"https://pith.science/api/pith-number/KGQJR3ET7QYK5PL4XTCB5GDYQI/graph.json","fetch_events":"https://pith.science/api/pith-number/KGQJR3ET7QYK5PL4XTCB5GDYQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGQJR3ET7QYK5PL4XTCB5GDYQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGQJR3ET7QYK5PL4XTCB5GDYQI/action/storage_attestation","attest_author":"https://pith.science/pith/KGQJR3ET7QYK5PL4XTCB5GDYQI/action/author_attestation","sign_citation":"https://pith.science/pith/KGQJR3ET7QYK5PL4XTCB5GDYQI/action/citation_signature","submit_replication":"https://pith.science/pith/KGQJR3ET7QYK5PL4XTCB5GDYQI/action/replication_record"}},"created_at":"2026-05-18T01:59:54.547311+00:00","updated_at":"2026-05-18T01:59:54.547311+00:00"}