{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4USCRHB3WZGYJ6GQUFX47VJIRT","short_pith_number":"pith:4USCRHB3","schema_version":"1.0","canonical_sha256":"e524289c3bb64d84f8d0a16fcfd5288cfe273612143c41d6f6973d46b805dd4a","source":{"kind":"arxiv","id":"1703.02473","version":2},"attestation_state":"computed","paper":{"title":"An improved lower bound for Folkman's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Zsolt Wagner, Andrew Treglown, Bhargav Narayanan, J\\'ozsef Balogh, Sean Eberhard","submitted_at":"2017-03-07T17:03:51Z","abstract_excerpt":"Folkman's Theorem asserts that for each $k \\in \\mathbb{N}$, there exists a natural number $n = F(k)$ such that whenever the elements of $[n]$ are two-coloured, there exists a set $A \\subset [n]$ of size $k$ with the property that all the sums of the form $\\sum_{x \\in B} x$, where $B$ is a nonempty subset of $A$, are contained in $[n]$ and have the same colour. In 1989, Erd\\H{o}s and Spencer showed that $F(k) \\ge 2^{ck^2/ \\log k}$, where $c >0$ is an absolute constant; here, we improve this bound significantly by showing that $F(k) \\ge 2^{2^{k-1}/k}$ for all $k\\in \\mathbb{N}$."},"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":"1703.02473","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-07T17:03:51Z","cross_cats_sorted":[],"title_canon_sha256":"2cbbf1f4478a9a81b9d915f858069c26948ece00e9b37bfad045ed1fb943a333","abstract_canon_sha256":"d497675bc07eb789182c57247f6be6c023452b96f0c143269fa18ed7f77251b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:24.644725Z","signature_b64":"tXHG6zNhUeZv2IpBXYACMgjnAtUL3QiV/kzV4iXJi9Ykhf5FCIbWaW3axy294IWdYj4wD+J2NTCd/jmIUqu8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e524289c3bb64d84f8d0a16fcfd5288cfe273612143c41d6f6973d46b805dd4a","last_reissued_at":"2026-05-18T00:41:24.644055Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:24.644055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved lower bound for Folkman's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Zsolt Wagner, Andrew Treglown, Bhargav Narayanan, J\\'ozsef Balogh, Sean Eberhard","submitted_at":"2017-03-07T17:03:51Z","abstract_excerpt":"Folkman's Theorem asserts that for each $k \\in \\mathbb{N}$, there exists a natural number $n = F(k)$ such that whenever the elements of $[n]$ are two-coloured, there exists a set $A \\subset [n]$ of size $k$ with the property that all the sums of the form $\\sum_{x \\in B} x$, where $B$ is a nonempty subset of $A$, are contained in $[n]$ and have the same colour. In 1989, Erd\\H{o}s and Spencer showed that $F(k) \\ge 2^{ck^2/ \\log k}$, where $c >0$ is an absolute constant; here, we improve this bound significantly by showing that $F(k) \\ge 2^{2^{k-1}/k}$ for all $k\\in \\mathbb{N}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02473","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":"1703.02473","created_at":"2026-05-18T00:41:24.644160+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.02473v2","created_at":"2026-05-18T00:41:24.644160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02473","created_at":"2026-05-18T00:41:24.644160+00:00"},{"alias_kind":"pith_short_12","alias_value":"4USCRHB3WZGY","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4USCRHB3WZGYJ6GQ","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4USCRHB3","created_at":"2026-05-18T12:31:00.734936+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/4USCRHB3WZGYJ6GQUFX47VJIRT","json":"https://pith.science/pith/4USCRHB3WZGYJ6GQUFX47VJIRT.json","graph_json":"https://pith.science/api/pith-number/4USCRHB3WZGYJ6GQUFX47VJIRT/graph.json","events_json":"https://pith.science/api/pith-number/4USCRHB3WZGYJ6GQUFX47VJIRT/events.json","paper":"https://pith.science/paper/4USCRHB3"},"agent_actions":{"view_html":"https://pith.science/pith/4USCRHB3WZGYJ6GQUFX47VJIRT","download_json":"https://pith.science/pith/4USCRHB3WZGYJ6GQUFX47VJIRT.json","view_paper":"https://pith.science/paper/4USCRHB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.02473&json=true","fetch_graph":"https://pith.science/api/pith-number/4USCRHB3WZGYJ6GQUFX47VJIRT/graph.json","fetch_events":"https://pith.science/api/pith-number/4USCRHB3WZGYJ6GQUFX47VJIRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4USCRHB3WZGYJ6GQUFX47VJIRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4USCRHB3WZGYJ6GQUFX47VJIRT/action/storage_attestation","attest_author":"https://pith.science/pith/4USCRHB3WZGYJ6GQUFX47VJIRT/action/author_attestation","sign_citation":"https://pith.science/pith/4USCRHB3WZGYJ6GQUFX47VJIRT/action/citation_signature","submit_replication":"https://pith.science/pith/4USCRHB3WZGYJ6GQUFX47VJIRT/action/replication_record"}},"created_at":"2026-05-18T00:41:24.644160+00:00","updated_at":"2026-05-18T00:41:24.644160+00:00"}