{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ICAGFCN44CPENBRZY3QERHQN33","short_pith_number":"pith:ICAGFCN4","schema_version":"1.0","canonical_sha256":"40806289bce09e468639c6e0489e0dded8667c4718029e10991c7e88645b8310","source":{"kind":"arxiv","id":"1308.5248","version":2},"attestation_state":"computed","paper":{"title":"Arithmetic progressions in sets of small doubling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Kevin Henriot","submitted_at":"2013-08-23T21:27:46Z","abstract_excerpt":"We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all equal, and A + A must contain an arithmetic progression or a coset of a subgroup, either of which of size at least exp^[ c (log |A|)^{delta} ]. This extends analogous results obtained by Sanders and, respectively, by Croot, Laba and Sisask in the case where the group is that of the integers or a finite field."},"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":"1308.5248","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-23T21:27:46Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"7c0feb4e580da99fc27e8d5aec41bf169e9c9b3473b18a7d2dfd7d377058dd6f","abstract_canon_sha256":"aa8522d94c0b365fd45e4332f15153028f450928e3312c206f7e2f735e3585f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:12.522050Z","signature_b64":"Mly2vFvW+Vdi7/A0gwM3KpSCUDRixTpkUiIXFm+TYQl6d+hSEc2C117v1QIiIbeufILwVFaELFmXtNmelz3ZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40806289bce09e468639c6e0489e0dded8667c4718029e10991c7e88645b8310","last_reissued_at":"2026-05-18T01:20:12.521582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:12.521582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arithmetic progressions in sets of small doubling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Kevin Henriot","submitted_at":"2013-08-23T21:27:46Z","abstract_excerpt":"We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all equal, and A + A must contain an arithmetic progression or a coset of a subgroup, either of which of size at least exp^[ c (log |A|)^{delta} ]. This extends analogous results obtained by Sanders and, respectively, by Croot, Laba and Sisask in the case where the group is that of the integers or a finite field."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5248","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":"1308.5248","created_at":"2026-05-18T01:20:12.521654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.5248v2","created_at":"2026-05-18T01:20:12.521654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5248","created_at":"2026-05-18T01:20:12.521654+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICAGFCN44CPE","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICAGFCN44CPENBRZ","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICAGFCN4","created_at":"2026-05-18T12:27:46.883200+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/ICAGFCN44CPENBRZY3QERHQN33","json":"https://pith.science/pith/ICAGFCN44CPENBRZY3QERHQN33.json","graph_json":"https://pith.science/api/pith-number/ICAGFCN44CPENBRZY3QERHQN33/graph.json","events_json":"https://pith.science/api/pith-number/ICAGFCN44CPENBRZY3QERHQN33/events.json","paper":"https://pith.science/paper/ICAGFCN4"},"agent_actions":{"view_html":"https://pith.science/pith/ICAGFCN44CPENBRZY3QERHQN33","download_json":"https://pith.science/pith/ICAGFCN44CPENBRZY3QERHQN33.json","view_paper":"https://pith.science/paper/ICAGFCN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.5248&json=true","fetch_graph":"https://pith.science/api/pith-number/ICAGFCN44CPENBRZY3QERHQN33/graph.json","fetch_events":"https://pith.science/api/pith-number/ICAGFCN44CPENBRZY3QERHQN33/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICAGFCN44CPENBRZY3QERHQN33/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICAGFCN44CPENBRZY3QERHQN33/action/storage_attestation","attest_author":"https://pith.science/pith/ICAGFCN44CPENBRZY3QERHQN33/action/author_attestation","sign_citation":"https://pith.science/pith/ICAGFCN44CPENBRZY3QERHQN33/action/citation_signature","submit_replication":"https://pith.science/pith/ICAGFCN44CPENBRZY3QERHQN33/action/replication_record"}},"created_at":"2026-05-18T01:20:12.521654+00:00","updated_at":"2026-05-18T01:20:12.521654+00:00"}