{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JKTLFNNEX5Z3S7DRYHLSQCOUJG","short_pith_number":"pith:JKTLFNNE","schema_version":"1.0","canonical_sha256":"4aa6b2b5a4bf73b97c71c1d72809d449a2b83cbfb04ac2c3f9d7fbaa0f71d71b","source":{"kind":"arxiv","id":"1605.03172","version":1},"attestation_state":"computed","paper":{"title":"The number of subsets of integers with no $k$-term arithmetic progression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Hong Liu, J\\'ozsef Balogh, Maryam Sharifzadeh","submitted_at":"2016-05-10T19:53:26Z","abstract_excerpt":"Addressing a question of Cameron and Erd\\Ho s, we show that, for infinitely many values of $n$, the number of subsets of $\\{1,2,\\ldots, n\\}$ that do not contain a $k$-term arithmetic progression is at most $2^{O(r_k(n))}$, where $r_k(n)$ is the maximum cardinality of a subset of $\\{1,2,\\ldots, n\\}$ without a $k$-term arithmetic progression. This bound is optimal up to a constant factor in the exponent. For all values of $n$, we prove a weaker bound, which is nevertheless sufficient to transfer the current best upper bound on $r_k(n)$ to the sparse random setting. To achieve these bounds, we es"},"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":"1605.03172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-10T19:53:26Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"8770640eea5e4f5d85d6c16a1d111f1f1533254b51caa859900282305e9ce484","abstract_canon_sha256":"fea8be0322247c87eb624548754eaf695001de1c0ba840520e0b02ff942e61b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:07.341267Z","signature_b64":"d+kBYsrv/Yl6HXL3J6RIkLADdmXvzY0DltBHlRxZYr7m9nxqxKM+WhdXKg8MfkKsHsPh4C1ImHf3fEcdeyQkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aa6b2b5a4bf73b97c71c1d72809d449a2b83cbfb04ac2c3f9d7fbaa0f71d71b","last_reissued_at":"2026-05-18T01:15:07.340497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:07.340497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The number of subsets of integers with no $k$-term arithmetic progression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Hong Liu, J\\'ozsef Balogh, Maryam Sharifzadeh","submitted_at":"2016-05-10T19:53:26Z","abstract_excerpt":"Addressing a question of Cameron and Erd\\Ho s, we show that, for infinitely many values of $n$, the number of subsets of $\\{1,2,\\ldots, n\\}$ that do not contain a $k$-term arithmetic progression is at most $2^{O(r_k(n))}$, where $r_k(n)$ is the maximum cardinality of a subset of $\\{1,2,\\ldots, n\\}$ without a $k$-term arithmetic progression. This bound is optimal up to a constant factor in the exponent. For all values of $n$, we prove a weaker bound, which is nevertheless sufficient to transfer the current best upper bound on $r_k(n)$ to the sparse random setting. To achieve these bounds, we es"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03172","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":"1605.03172","created_at":"2026-05-18T01:15:07.340626+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03172v1","created_at":"2026-05-18T01:15:07.340626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03172","created_at":"2026-05-18T01:15:07.340626+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKTLFNNEX5Z3","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKTLFNNEX5Z3S7DR","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKTLFNNE","created_at":"2026-05-18T12:30:25.849896+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/JKTLFNNEX5Z3S7DRYHLSQCOUJG","json":"https://pith.science/pith/JKTLFNNEX5Z3S7DRYHLSQCOUJG.json","graph_json":"https://pith.science/api/pith-number/JKTLFNNEX5Z3S7DRYHLSQCOUJG/graph.json","events_json":"https://pith.science/api/pith-number/JKTLFNNEX5Z3S7DRYHLSQCOUJG/events.json","paper":"https://pith.science/paper/JKTLFNNE"},"agent_actions":{"view_html":"https://pith.science/pith/JKTLFNNEX5Z3S7DRYHLSQCOUJG","download_json":"https://pith.science/pith/JKTLFNNEX5Z3S7DRYHLSQCOUJG.json","view_paper":"https://pith.science/paper/JKTLFNNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03172&json=true","fetch_graph":"https://pith.science/api/pith-number/JKTLFNNEX5Z3S7DRYHLSQCOUJG/graph.json","fetch_events":"https://pith.science/api/pith-number/JKTLFNNEX5Z3S7DRYHLSQCOUJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKTLFNNEX5Z3S7DRYHLSQCOUJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKTLFNNEX5Z3S7DRYHLSQCOUJG/action/storage_attestation","attest_author":"https://pith.science/pith/JKTLFNNEX5Z3S7DRYHLSQCOUJG/action/author_attestation","sign_citation":"https://pith.science/pith/JKTLFNNEX5Z3S7DRYHLSQCOUJG/action/citation_signature","submit_replication":"https://pith.science/pith/JKTLFNNEX5Z3S7DRYHLSQCOUJG/action/replication_record"}},"created_at":"2026-05-18T01:15:07.340626+00:00","updated_at":"2026-05-18T01:15:07.340626+00:00"}