{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GPP5VNA2XEL6R72YY3T6OCADVK","short_pith_number":"pith:GPP5VNA2","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"},"canonical_sha256":"33dfdab41ab917e8ff58c6e7e70803aaa5d9715039d1157024624bd10da0976b","source":{"kind":"arxiv","id":"1805.05549","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05549","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05549v1","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05549","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"pith_short_12","alias_value":"GPP5VNA2XEL6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GPP5VNA2XEL6R72Y","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GPP5VNA2","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GPP5VNA2XEL6R72YY3T6OCADVK","target":"record","payload":{"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"},"canonical_sha256":"33dfdab41ab917e8ff58c6e7e70803aaa5d9715039d1157024624bd10da0976b","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"},"source_kind":"arxiv","source_id":"1805.05549","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-18T00:16:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wwgu1UXsiarGLBeDBRVWa3jx1bt/VTtGjAlYXiFL8trPHR0hT4GgDjClBCzahlUsQN05HSJ7pwZf/CVlGK0JBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:14:45.836483Z"},"content_sha256":"590dd03d25f2ffea63b65c6f637649ff4e446cedeaf36a26cc610c1ff3679c21","schema_version":"1.0","event_id":"sha256:590dd03d25f2ffea63b65c6f637649ff4e446cedeaf36a26cc610c1ff3679c21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GPP5VNA2XEL6R72YY3T6OCADVK","target":"graph","payload":{"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"},"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-18T00:16:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"koeVM41jEc7OrSDF30g2b4HqYof9qHXtFV9JKbzj6Q/543CW+JczqKmbSON3mf5DETOU8xNEPbM8XnzgHF38Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:14:45.836843Z"},"content_sha256":"d888881ba2e6e51517e56e13369f0f06fc10413565e95c6b77deee04e2561048","schema_version":"1.0","event_id":"sha256:d888881ba2e6e51517e56e13369f0f06fc10413565e95c6b77deee04e2561048"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPP5VNA2XEL6R72YY3T6OCADVK/bundle.json","state_url":"https://pith.science/pith/GPP5VNA2XEL6R72YY3T6OCADVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPP5VNA2XEL6R72YY3T6OCADVK/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-06-01T04:14:45Z","links":{"resolver":"https://pith.science/pith/GPP5VNA2XEL6R72YY3T6OCADVK","bundle":"https://pith.science/pith/GPP5VNA2XEL6R72YY3T6OCADVK/bundle.json","state":"https://pith.science/pith/GPP5VNA2XEL6R72YY3T6OCADVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPP5VNA2XEL6R72YY3T6OCADVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GPP5VNA2XEL6R72YY3T6OCADVK","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":"bb00fbcaf088a7eea202b60f75a487535710e979af1b5c52a2c2e807748ae844","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T03:39:48Z","title_canon_sha256":"cbee965e3ed7564e891e18baaf21f6d7f6011febb8189a48f5bf51048aec07cc"},"schema_version":"1.0","source":{"id":"1805.05549","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05549","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05549v1","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05549","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"pith_short_12","alias_value":"GPP5VNA2XEL6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GPP5VNA2XEL6R72Y","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GPP5VNA2","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:d888881ba2e6e51517e56e13369f0f06fc10413565e95c6b77deee04e2561048","target":"graph","created_at":"2026-05-18T00:16:00Z","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":"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","authors_text":"Cosmin Pohoata, Fedor Petrov","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T03:39:48Z","title":"Improved Bounds for Progression-Free Sets in $C_{8}^{n}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05549","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:590dd03d25f2ffea63b65c6f637649ff4e446cedeaf36a26cc610c1ff3679c21","target":"record","created_at":"2026-05-18T00:16:00Z","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":"bb00fbcaf088a7eea202b60f75a487535710e979af1b5c52a2c2e807748ae844","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-15T03:39:48Z","title_canon_sha256":"cbee965e3ed7564e891e18baaf21f6d7f6011febb8189a48f5bf51048aec07cc"},"schema_version":"1.0","source":{"id":"1805.05549","kind":"arxiv","version":1}},"canonical_sha256":"33dfdab41ab917e8ff58c6e7e70803aaa5d9715039d1157024624bd10da0976b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33dfdab41ab917e8ff58c6e7e70803aaa5d9715039d1157024624bd10da0976b","first_computed_at":"2026-05-18T00:16:00.239934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:00.239934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LvoQrYBi3IOMGj9TXejL9bIRLDOfn7qQ860f+kWuc+Xew9lrmq9lSgC2PK8kbd5Ru5e4mdIr6woxE2ydqymYBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:00.240366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05549","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:590dd03d25f2ffea63b65c6f637649ff4e446cedeaf36a26cc610c1ff3679c21","sha256:d888881ba2e6e51517e56e13369f0f06fc10413565e95c6b77deee04e2561048"],"state_sha256":"23a0a586f0c45535470f68f8a2f1cc42699355bb928346232bb8d4f1c3d7c6f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ZQhVH6Y4HMOtQBm4k4ebjU/BUOyJV2/7f5t6J+H4A4z3AAfsiPSdF6+zQEsIxNCtZkqq9avs+43HCa8D8c2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:14:45.838896Z","bundle_sha256":"e8bdcab9e639a8d9f3100620efd3a3ba2dc463fe23f6b40eec7f6f2fa2754b58"}}