{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ETMYOS7MLM2COSK4VAVRD6XTHJ","short_pith_number":"pith:ETMYOS7M","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"},"canonical_sha256":"24d9874bec5b3427495ca82b11faf33a5d7ecebdb960ef0785b6f3df45169cdd","source":{"kind":"arxiv","id":"2406.12290","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.12290","created_at":"2026-07-05T08:33:43Z"},{"alias_kind":"arxiv_version","alias_value":"2406.12290v1","created_at":"2026-07-05T08:33:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.12290","created_at":"2026-07-05T08:33:43Z"},{"alias_kind":"pith_short_12","alias_value":"ETMYOS7MLM2C","created_at":"2026-07-05T08:33:43Z"},{"alias_kind":"pith_short_16","alias_value":"ETMYOS7MLM2COSK4","created_at":"2026-07-05T08:33:43Z"},{"alias_kind":"pith_short_8","alias_value":"ETMYOS7M","created_at":"2026-07-05T08:33:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ETMYOS7MLM2COSK4VAVRD6XTHJ","target":"record","payload":{"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"},"canonical_sha256":"24d9874bec5b3427495ca82b11faf33a5d7ecebdb960ef0785b6f3df45169cdd","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"},"source_kind":"arxiv","source_id":"2406.12290","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-07-05T08:33:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"73IM7YNt4ryG3RB2eRYnq0NjcCAMKcIu+eMGJ05X64qbwRmJuCM6wQGqeEJYKuLrn1TZJMl6vH/L+Zqs/dbRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:35:57.240998Z"},"content_sha256":"15f48582cd7166dd3d2839dcb40bc374e759c2537b9a9ea5f551096d0ab4c661","schema_version":"1.0","event_id":"sha256:15f48582cd7166dd3d2839dcb40bc374e759c2537b9a9ea5f551096d0ab4c661"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ETMYOS7MLM2COSK4VAVRD6XTHJ","target":"graph","payload":{"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"},"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-07-05T08:33:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tF3nkOVF5GQCRWixWzGfqU6/5yr27pi99VAct+PIA+Pa9Nwu+KV3zXsh+MR+dMJsufrBHCEKvfqY+2PZGKgfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:35:57.241506Z"},"content_sha256":"234bb28c6189c8c9ccab5cc214688de12b43ff160a9b1dad8bb394c904c0bf6c","schema_version":"1.0","event_id":"sha256:234bb28c6189c8c9ccab5cc214688de12b43ff160a9b1dad8bb394c904c0bf6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ/bundle.json","state_url":"https://pith.science/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ/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-08-08T07:35:57Z","links":{"resolver":"https://pith.science/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ","bundle":"https://pith.science/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ/bundle.json","state":"https://pith.science/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETMYOS7MLM2COSK4VAVRD6XTHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ETMYOS7MLM2COSK4VAVRD6XTHJ","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":"0c421b86dad768b4b14472d6cac738efb60768f94937e2e5723fd352e5703cd0","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2024-06-18T05:53:09Z","title_canon_sha256":"b9054278254cca6fd664a01ad88a0cb1b41f2557a1cbbb27dc8b3136b06a7088"},"schema_version":"1.0","source":{"id":"2406.12290","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.12290","created_at":"2026-07-05T08:33:43Z"},{"alias_kind":"arxiv_version","alias_value":"2406.12290v1","created_at":"2026-07-05T08:33:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.12290","created_at":"2026-07-05T08:33:43Z"},{"alias_kind":"pith_short_12","alias_value":"ETMYOS7MLM2C","created_at":"2026-07-05T08:33:43Z"},{"alias_kind":"pith_short_16","alias_value":"ETMYOS7MLM2COSK4","created_at":"2026-07-05T08:33:43Z"},{"alias_kind":"pith_short_8","alias_value":"ETMYOS7M","created_at":"2026-07-05T08:33:43Z"}],"graph_snapshots":[{"event_id":"sha256:234bb28c6189c8c9ccab5cc214688de12b43ff160a9b1dad8bb394c904c0bf6c","target":"graph","created_at":"2026-07-05T08:33:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.12290/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Christian Elsholtz, Laura Proske, Lisa Sauermann, Zach Hunter","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2024-06-18T05:53:09Z","title":"Improving Behrend's construction: Sets without arithmetic progressions in integers and over finite fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.12290","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:15f48582cd7166dd3d2839dcb40bc374e759c2537b9a9ea5f551096d0ab4c661","target":"record","created_at":"2026-07-05T08:33:43Z","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":"0c421b86dad768b4b14472d6cac738efb60768f94937e2e5723fd352e5703cd0","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2024-06-18T05:53:09Z","title_canon_sha256":"b9054278254cca6fd664a01ad88a0cb1b41f2557a1cbbb27dc8b3136b06a7088"},"schema_version":"1.0","source":{"id":"2406.12290","kind":"arxiv","version":1}},"canonical_sha256":"24d9874bec5b3427495ca82b11faf33a5d7ecebdb960ef0785b6f3df45169cdd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24d9874bec5b3427495ca82b11faf33a5d7ecebdb960ef0785b6f3df45169cdd","first_computed_at":"2026-07-05T08:33:43.747859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:33:43.747859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6s8hZqdlVoEKj3dBY7tPMuqy2QCzJyDfefK70TEUAkcrutba2awMZbRsnC8RV7fni9VY4jYlNyWVCVuSgYi9Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:33:43.748338Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.12290","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15f48582cd7166dd3d2839dcb40bc374e759c2537b9a9ea5f551096d0ab4c661","sha256:234bb28c6189c8c9ccab5cc214688de12b43ff160a9b1dad8bb394c904c0bf6c"],"state_sha256":"7c59fc9c981a3bde1137a5b55fcdd0df2b939618f09477469ca0c30b1575944b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s12JkmloQBfyd4zFSenNNj1IQXrRgQQiv+Z3LdcK1r2fpYwom1CGxLs7/O1aSdHYX7n6jkGYiIHywj9KGpREBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T07:35:57.247001Z","bundle_sha256":"736335b07d5cd35a99d48928d84cac36ca12a4decaa99a3022227fda93b2ee48"}}