{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GPP5VNA2XEL6R72YY3T6OCADVK","short_pith_number":"pith:GPP5VNA2","schema_version":"1.0","canonical_sha256":"33dfdab41ab917e8ff58c6e7e70803aaa5d9715039d1157024624bd10da0976b","source":{"kind":"arxiv","id":"1805.05549","version":1},"attestation_state":"computed","paper":{"title":"Improved Bounds for Progression-Free Sets in $C_{8}^{n}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Cosmin Pohoata, Fedor Petrov","submitted_at":"2018-05-15T03:39:48Z","abstract_excerpt":"Let $G$ be a finite group, and let $r_{3}(G)$ represent the size of the largest subset of $G$ without non-trivial three-term progressions. In a recent breakthrough, Croot, Lev and Pach proved that $r_{3}(C_{4}^{n}) \\leqslant (3.61)^{n}$, where $C_{m}$ denotes the cyclic group of order $m$. For finite abelian groups $G \\cong \\prod_{i=1}^{n} C_{m_{i}}$, where $m_{1},\\ldots,m_{n}$ denote positive integers such that $m_{1} | \\ldots | m_{n}$, this also yields a bound of the form $r_{3}(G) \\leqslant (0.903)^{\\operatorname{rk}_{4}(G)} |G|$, with $\\operatorname{rk}_{4}(G)$ representing the number of i"},"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":"1805.05549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T03:39:48Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"cbee965e3ed7564e891e18baaf21f6d7f6011febb8189a48f5bf51048aec07cc","abstract_canon_sha256":"bb00fbcaf088a7eea202b60f75a487535710e979af1b5c52a2c2e807748ae844"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:00.240366Z","signature_b64":"LvoQrYBi3IOMGj9TXejL9bIRLDOfn7qQ860f+kWuc+Xew9lrmq9lSgC2PK8kbd5Ru5e4mdIr6woxE2ydqymYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33dfdab41ab917e8ff58c6e7e70803aaa5d9715039d1157024624bd10da0976b","last_reissued_at":"2026-05-18T00:16:00.239934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:00.239934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Bounds for Progression-Free Sets in $C_{8}^{n}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Cosmin Pohoata, Fedor Petrov","submitted_at":"2018-05-15T03:39:48Z","abstract_excerpt":"Let $G$ be a finite group, and let $r_{3}(G)$ represent the size of the largest subset of $G$ without non-trivial three-term progressions. In a recent breakthrough, Croot, Lev and Pach proved that $r_{3}(C_{4}^{n}) \\leqslant (3.61)^{n}$, where $C_{m}$ denotes the cyclic group of order $m$. For finite abelian groups $G \\cong \\prod_{i=1}^{n} C_{m_{i}}$, where $m_{1},\\ldots,m_{n}$ denote positive integers such that $m_{1} | \\ldots | m_{n}$, this also yields a bound of the form $r_{3}(G) \\leqslant (0.903)^{\\operatorname{rk}_{4}(G)} |G|$, with $\\operatorname{rk}_{4}(G)$ representing the number of i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05549","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":"1805.05549","created_at":"2026-05-18T00:16:00.240001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.05549v1","created_at":"2026-05-18T00:16:00.240001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05549","created_at":"2026-05-18T00:16:00.240001+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPP5VNA2XEL6","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPP5VNA2XEL6R72Y","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPP5VNA2","created_at":"2026-05-18T12:32:25.280505+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/GPP5VNA2XEL6R72YY3T6OCADVK","json":"https://pith.science/pith/GPP5VNA2XEL6R72YY3T6OCADVK.json","graph_json":"https://pith.science/api/pith-number/GPP5VNA2XEL6R72YY3T6OCADVK/graph.json","events_json":"https://pith.science/api/pith-number/GPP5VNA2XEL6R72YY3T6OCADVK/events.json","paper":"https://pith.science/paper/GPP5VNA2"},"agent_actions":{"view_html":"https://pith.science/pith/GPP5VNA2XEL6R72YY3T6OCADVK","download_json":"https://pith.science/pith/GPP5VNA2XEL6R72YY3T6OCADVK.json","view_paper":"https://pith.science/paper/GPP5VNA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.05549&json=true","fetch_graph":"https://pith.science/api/pith-number/GPP5VNA2XEL6R72YY3T6OCADVK/graph.json","fetch_events":"https://pith.science/api/pith-number/GPP5VNA2XEL6R72YY3T6OCADVK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPP5VNA2XEL6R72YY3T6OCADVK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPP5VNA2XEL6R72YY3T6OCADVK/action/storage_attestation","attest_author":"https://pith.science/pith/GPP5VNA2XEL6R72YY3T6OCADVK/action/author_attestation","sign_citation":"https://pith.science/pith/GPP5VNA2XEL6R72YY3T6OCADVK/action/citation_signature","submit_replication":"https://pith.science/pith/GPP5VNA2XEL6R72YY3T6OCADVK/action/replication_record"}},"created_at":"2026-05-18T00:16:00.240001+00:00","updated_at":"2026-05-18T00:16:00.240001+00:00"}