{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GTJFGNAFJSMEO7DQCQW43UMJ66","short_pith_number":"pith:GTJFGNAF","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"},"canonical_sha256":"34d25334054c98477c70142dcdd189f7aaea59ff97a599648c249252eb99af16","source":{"kind":"arxiv","id":"1907.01449","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01449","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01449v1","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01449","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"GTJFGNAFJSME","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GTJFGNAFJSMEO7DQ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GTJFGNAF","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GTJFGNAFJSMEO7DQCQW43UMJ66","target":"record","payload":{"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"},"canonical_sha256":"34d25334054c98477c70142dcdd189f7aaea59ff97a599648c249252eb99af16","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"},"source_kind":"arxiv","source_id":"1907.01449","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tdAfxbAk47nek6oFgtiEL9kOG9U/jiMwFh09I1avETqHMd639Zecq4CYj229bgw0tiEibn+9mK4pO+rSeRKUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:47:34.568790Z"},"content_sha256":"ae0b2facf3b128256294235d520eba31d7ad937829a32ad24541b36dd228bfb3","schema_version":"1.0","event_id":"sha256:ae0b2facf3b128256294235d520eba31d7ad937829a32ad24541b36dd228bfb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GTJFGNAFJSMEO7DQCQW43UMJ66","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YzI3wJ4wzdzeZrW4CxiSG0bu4yDHayZSq3ujxNthLu3RdW86gSKOsFtADL9tUxqnz/RnMcN5FtTK5bmw1PReBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:47:34.569132Z"},"content_sha256":"45046f6e1bcfd9c555f3fa4eafc66d1d8747467bf73b39c6c758b5c95500fe78","schema_version":"1.0","event_id":"sha256:45046f6e1bcfd9c555f3fa4eafc66d1d8747467bf73b39c6c758b5c95500fe78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTJFGNAFJSMEO7DQCQW43UMJ66/bundle.json","state_url":"https://pith.science/pith/GTJFGNAFJSMEO7DQCQW43UMJ66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTJFGNAFJSMEO7DQCQW43UMJ66/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T09:47:34Z","links":{"resolver":"https://pith.science/pith/GTJFGNAFJSMEO7DQCQW43UMJ66","bundle":"https://pith.science/pith/GTJFGNAFJSMEO7DQCQW43UMJ66/bundle.json","state":"https://pith.science/pith/GTJFGNAFJSMEO7DQCQW43UMJ66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTJFGNAFJSMEO7DQCQW43UMJ66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GTJFGNAFJSMEO7DQCQW43UMJ66","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7a6bb1f480804c4060ad7ca65828d7ebcb21b3d984e2ebcebb0192f77e83a42a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-02T15:29:31Z","title_canon_sha256":"db57cb42305c96b0386a8648d9672913cd5fde904d85d2fa514891e4a3a1a10f"},"schema_version":"1.0","source":{"id":"1907.01449","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01449","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01449v1","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01449","created_at":"2026-05-17T23:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"GTJFGNAFJSME","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GTJFGNAFJSMEO7DQ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GTJFGNAF","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:45046f6e1bcfd9c555f3fa4eafc66d1d8747467bf73b39c6c758b5c95500fe78","target":"graph","created_at":"2026-05-17T23:41:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Johannes H\\\"olzl, Robert Y. Lewis, Sander R. Dahmen","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-02T15:29:31Z","title":"Formalizing the Solution to the Cap Set Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01449","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ae0b2facf3b128256294235d520eba31d7ad937829a32ad24541b36dd228bfb3","target":"record","created_at":"2026-05-17T23:41:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7a6bb1f480804c4060ad7ca65828d7ebcb21b3d984e2ebcebb0192f77e83a42a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-02T15:29:31Z","title_canon_sha256":"db57cb42305c96b0386a8648d9672913cd5fde904d85d2fa514891e4a3a1a10f"},"schema_version":"1.0","source":{"id":"1907.01449","kind":"arxiv","version":1}},"canonical_sha256":"34d25334054c98477c70142dcdd189f7aaea59ff97a599648c249252eb99af16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34d25334054c98477c70142dcdd189f7aaea59ff97a599648c249252eb99af16","first_computed_at":"2026-05-17T23:41:40.375132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:40.375132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vb/ALGGVTJsgxD1arnDBQtCYygl8EKAyS0QXieRx63lERpSNIxl6SVmaCyaMTUnblEoe9KFeLtO9AiJ7IN4pCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:40.375616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01449","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae0b2facf3b128256294235d520eba31d7ad937829a32ad24541b36dd228bfb3","sha256:45046f6e1bcfd9c555f3fa4eafc66d1d8747467bf73b39c6c758b5c95500fe78"],"state_sha256":"db66bda290fb69ca9460c2582f68f535dc3f1f40d80426b458e332d3e6e7c55a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aWvmdvCdACF16NeX3xI/vMuxVcGlZFh43E/PQA5+VpBAxBmi8VsKfY08HRxcVgM7atBuSJNm7a5D6UXRkCMsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:47:34.571282Z","bundle_sha256":"56a6de9c5c4da63b89c3296c09e53209fc41cfde6bd1efd9402df13f9b17551b"}}