{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ETMYOS7MLM2COSK4VAVRD6XTHJ","short_pith_number":"pith:ETMYOS7M","schema_version":"1.0","canonical_sha256":"24d9874bec5b3427495ca82b11faf33a5d7ecebdb960ef0785b6f3df45169cdd","source":{"kind":"arxiv","id":"2406.12290","version":1},"attestation_state":"computed","paper":{"title":"Improving Behrend's construction: Sets without arithmetic progressions in integers and over finite fields","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Christian Elsholtz, Laura Proske, Lisa Sauermann, Zach Hunter","submitted_at":"2024-06-18T05:53:09Z","abstract_excerpt":"We prove new lower bounds on the maximum size of subsets $A\\subseteq \\{1,\\dots,N\\}$ or $A\\subseteq \\mathbb{F}_p^n$ not containing three-term arithmetic progressions. In the setting of $\\{1,\\dots,N\\}$, this is the first improvement upon a classical construction of Behrend from 1946 beyond lower-order factors (in particular, it is the first quasipolynomial improvement). In the setting of $\\mathbb{F}_p^n$ for a fixed prime $p$ and large $n$, we prove a lower bound of $(cp)^n$ for some absolute constant $c>1/2$ (for $c = 1/2$, such a bound can be obtained via classical constructions from the 1940s"},"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":"2406.12290","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2024-06-18T05:53:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b9054278254cca6fd664a01ad88a0cb1b41f2557a1cbbb27dc8b3136b06a7088","abstract_canon_sha256":"0c421b86dad768b4b14472d6cac738efb60768f94937e2e5723fd352e5703cd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:33:43.748338Z","signature_b64":"6s8hZqdlVoEKj3dBY7tPMuqy2QCzJyDfefK70TEUAkcrutba2awMZbRsnC8RV7fni9VY4jYlNyWVCVuSgYi9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24d9874bec5b3427495ca82b11faf33a5d7ecebdb960ef0785b6f3df45169cdd","last_reissued_at":"2026-07-05T08:33:43.747859Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:33:43.747859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Behrend's construction: Sets without arithmetic progressions in integers and over finite fields","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Christian Elsholtz, Laura Proske, Lisa Sauermann, Zach Hunter","submitted_at":"2024-06-18T05:53:09Z","abstract_excerpt":"We prove new lower bounds on the maximum size of subsets $A\\subseteq \\{1,\\dots,N\\}$ or $A\\subseteq \\mathbb{F}_p^n$ not containing three-term arithmetic progressions. In the setting of $\\{1,\\dots,N\\}$, this is the first improvement upon a classical construction of Behrend from 1946 beyond lower-order factors (in particular, it is the first quasipolynomial improvement). In the setting of $\\mathbb{F}_p^n$ for a fixed prime $p$ and large $n$, we prove a lower bound of $(cp)^n$ for some absolute constant $c>1/2$ (for $c = 1/2$, such a bound can be obtained via classical constructions from the 1940s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.12290","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.12290/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.12290","created_at":"2026-07-05T08:33:43.747918+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.12290v1","created_at":"2026-07-05T08:33:43.747918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.12290","created_at":"2026-07-05T08:33:43.747918+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETMYOS7MLM2C","created_at":"2026-07-05T08:33:43.747918+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETMYOS7MLM2COSK4","created_at":"2026-07-05T08:33:43.747918+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETMYOS7M","created_at":"2026-07-05T08:33:43.747918+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05823","citing_title":"Large Sets of Integers with No Harmonic Triples","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2606.12194","citing_title":"Beating Product Constructions for Linear Equations Over Finite Fields","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02541","citing_title":"Three-color van der Waerden numbers grow super-exponentially","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23437","citing_title":"A superlinear improvement on line-free sets in $\\mathbb{F}_p^3$","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05768","citing_title":"On the Furstenberg-Katznelson constant for the IP Szemeredi theorem over finite fields","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ","json":"https://pith.science/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ.json","graph_json":"https://pith.science/api/pith-number/ETMYOS7MLM2COSK4VAVRD6XTHJ/graph.json","events_json":"https://pith.science/api/pith-number/ETMYOS7MLM2COSK4VAVRD6XTHJ/events.json","paper":"https://pith.science/paper/ETMYOS7M"},"agent_actions":{"view_html":"https://pith.science/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ","download_json":"https://pith.science/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ.json","view_paper":"https://pith.science/paper/ETMYOS7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.12290&json=true","fetch_graph":"https://pith.science/api/pith-number/ETMYOS7MLM2COSK4VAVRD6XTHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ETMYOS7MLM2COSK4VAVRD6XTHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ/action/storage_attestation","attest_author":"https://pith.science/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ/action/author_attestation","sign_citation":"https://pith.science/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ/action/citation_signature","submit_replication":"https://pith.science/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ/action/replication_record"}},"created_at":"2026-07-05T08:33:43.747918+00:00","updated_at":"2026-07-05T08:33:43.747918+00:00"}