{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GTJFGNAFJSMEO7DQCQW43UMJ66","short_pith_number":"pith:GTJFGNAF","schema_version":"1.0","canonical_sha256":"34d25334054c98477c70142dcdd189f7aaea59ff97a599648c249252eb99af16","source":{"kind":"arxiv","id":"1907.01449","version":1},"attestation_state":"computed","paper":{"title":"Formalizing the Solution to the Cap Set Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.LO","authors_text":"Johannes H\\\"olzl, Robert Y. Lewis, Sander R. Dahmen","submitted_at":"2019-07-02T15:29:31Z","abstract_excerpt":"In 2016, Ellenberg and Gijswijt established a new upper bound on the size of subsets of $\\mathbb{F}^n_q$ with no three-term arithmetic progression. This problem has received much mathematical attention, particularly in the case $q = 3$, where it is commonly known as the \\emph{cap set problem}. Ellenberg and Gijswijt's proof was published in the \\emph{Annals of Mathematics} and is noteworthy for its clever use of elementary methods. This paper describes a formalization of this proof in the Lean proof assistant, including both the general result in $\\mathbb{F}^n_q$ and concrete values for the ca"},"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":"1907.01449","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-02T15:29:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"db57cb42305c96b0386a8648d9672913cd5fde904d85d2fa514891e4a3a1a10f","abstract_canon_sha256":"7a6bb1f480804c4060ad7ca65828d7ebcb21b3d984e2ebcebb0192f77e83a42a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:40.375616Z","signature_b64":"Vb/ALGGVTJsgxD1arnDBQtCYygl8EKAyS0QXieRx63lERpSNIxl6SVmaCyaMTUnblEoe9KFeLtO9AiJ7IN4pCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34d25334054c98477c70142dcdd189f7aaea59ff97a599648c249252eb99af16","last_reissued_at":"2026-05-17T23:41:40.375132Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:40.375132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formalizing the Solution to the Cap Set Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.LO","authors_text":"Johannes H\\\"olzl, Robert Y. Lewis, Sander R. Dahmen","submitted_at":"2019-07-02T15:29:31Z","abstract_excerpt":"In 2016, Ellenberg and Gijswijt established a new upper bound on the size of subsets of $\\mathbb{F}^n_q$ with no three-term arithmetic progression. This problem has received much mathematical attention, particularly in the case $q = 3$, where it is commonly known as the \\emph{cap set problem}. Ellenberg and Gijswijt's proof was published in the \\emph{Annals of Mathematics} and is noteworthy for its clever use of elementary methods. This paper describes a formalization of this proof in the Lean proof assistant, including both the general result in $\\mathbb{F}^n_q$ and concrete values for the ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01449","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":"1907.01449","created_at":"2026-05-17T23:41:40.375202+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01449v1","created_at":"2026-05-17T23:41:40.375202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01449","created_at":"2026-05-17T23:41:40.375202+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTJFGNAFJSME","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTJFGNAFJSMEO7DQ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTJFGNAF","created_at":"2026-05-18T12:33:18.533446+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/GTJFGNAFJSMEO7DQCQW43UMJ66","json":"https://pith.science/pith/GTJFGNAFJSMEO7DQCQW43UMJ66.json","graph_json":"https://pith.science/api/pith-number/GTJFGNAFJSMEO7DQCQW43UMJ66/graph.json","events_json":"https://pith.science/api/pith-number/GTJFGNAFJSMEO7DQCQW43UMJ66/events.json","paper":"https://pith.science/paper/GTJFGNAF"},"agent_actions":{"view_html":"https://pith.science/pith/GTJFGNAFJSMEO7DQCQW43UMJ66","download_json":"https://pith.science/pith/GTJFGNAFJSMEO7DQCQW43UMJ66.json","view_paper":"https://pith.science/paper/GTJFGNAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01449&json=true","fetch_graph":"https://pith.science/api/pith-number/GTJFGNAFJSMEO7DQCQW43UMJ66/graph.json","fetch_events":"https://pith.science/api/pith-number/GTJFGNAFJSMEO7DQCQW43UMJ66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTJFGNAFJSMEO7DQCQW43UMJ66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTJFGNAFJSMEO7DQCQW43UMJ66/action/storage_attestation","attest_author":"https://pith.science/pith/GTJFGNAFJSMEO7DQCQW43UMJ66/action/author_attestation","sign_citation":"https://pith.science/pith/GTJFGNAFJSMEO7DQCQW43UMJ66/action/citation_signature","submit_replication":"https://pith.science/pith/GTJFGNAFJSMEO7DQCQW43UMJ66/action/replication_record"}},"created_at":"2026-05-17T23:41:40.375202+00:00","updated_at":"2026-05-17T23:41:40.375202+00:00"}