{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PZL2UPBX63PEA5YHHJBLBPAFFP","short_pith_number":"pith:PZL2UPBX","canonical_record":{"source":{"id":"1709.04440","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-13T17:35:19Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"1236eb463f01de687ae32732375230501589a21c280c1e411c5c4649f278f1ee","abstract_canon_sha256":"f9fd3d69bcf9eaee48d04a49d439a0d4fb4754699977f4b7c0d00d163bdd2baa"},"schema_version":"1.0"},"canonical_sha256":"7e57aa3c37f6de4077073a42b0bc052bd132d11074e5ae67290fb4f4ef3a9a52","source":{"kind":"arxiv","id":"1709.04440","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04440","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04440v3","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04440","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"pith_short_12","alias_value":"PZL2UPBX63PE","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PZL2UPBX63PEA5YH","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PZL2UPBX","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PZL2UPBX63PEA5YHHJBLBPAFFP","target":"record","payload":{"canonical_record":{"source":{"id":"1709.04440","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-13T17:35:19Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"1236eb463f01de687ae32732375230501589a21c280c1e411c5c4649f278f1ee","abstract_canon_sha256":"f9fd3d69bcf9eaee48d04a49d439a0d4fb4754699977f4b7c0d00d163bdd2baa"},"schema_version":"1.0"},"canonical_sha256":"7e57aa3c37f6de4077073a42b0bc052bd132d11074e5ae67290fb4f4ef3a9a52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:41.488759Z","signature_b64":"z6wak/Ek4AOovacHe6aqsXK6cXyp/TYmtQxqTMr8eKh2eH7CxSue58haCwE3Y4dPggWyllc2oJ6fAizJ21ryBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e57aa3c37f6de4077073a42b0bc052bd132d11074e5ae67290fb4f4ef3a9a52","last_reissued_at":"2026-05-18T00:06:41.488379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:41.488379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.04440","source_version":3,"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:06:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4pnt59jD8/RRBPAmQQN51zZtgM//4MJUGLF52tuN+fytBBv3EINdbTMge3k2A9i9nylaWebx0ghSA1r14bzUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:14:36.483014Z"},"content_sha256":"3ac5bdab1e7cc4c555ffd50a53ad376add9d5c0d99b2c1e5c8f8b19c839947fb","schema_version":"1.0","event_id":"sha256:3ac5bdab1e7cc4c555ffd50a53ad376add9d5c0d99b2c1e5c8f8b19c839947fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PZL2UPBX63PEA5YHHJBLBPAFFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A polynomial bound for the arithmetic $k$-cycle removal lemma in vector spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Jacob Fox, L\\'aszl\\'o Mikl\\'os Lov\\'asz, Lisa Sauermann","submitted_at":"2017-09-13T17:35:19Z","abstract_excerpt":"For each $k\\geq 3$, Green proved an arithmetic $k$-cycle removal lemma for any abelian group $G$. The best known bounds relating the parameters in the lemma for general $G$ are of tower-type. For $k>3$, even in the case $G=\\mathbb{F}_2^n$ no better bounds were known prior to this paper. This special case has received considerable attention due to its close connection to property testing of boolean functions. For every $k\\geq 3$, we prove a polynomial bound relating the parameters for $G=\\mathbb{F}_p^n$, where $p$ is any fixed prime. This extends the result for $k=3$ by the first two authors. D"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04440","kind":"arxiv","version":3},"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:06:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sEx7aFRVeEJTlbOOocgfvx4F7HmsO16dT8RKdEMzuSJ2PeZdO/lQqO1GM0Zef7aNt5UpjpQmHO0dQvlY+pk0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:14:36.483386Z"},"content_sha256":"96ef0c5ba3de5532a971a22b800f6ca872cf218591123ee5553f008e6f225af7","schema_version":"1.0","event_id":"sha256:96ef0c5ba3de5532a971a22b800f6ca872cf218591123ee5553f008e6f225af7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZL2UPBX63PEA5YHHJBLBPAFFP/bundle.json","state_url":"https://pith.science/pith/PZL2UPBX63PEA5YHHJBLBPAFFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZL2UPBX63PEA5YHHJBLBPAFFP/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-28T14:14:36Z","links":{"resolver":"https://pith.science/pith/PZL2UPBX63PEA5YHHJBLBPAFFP","bundle":"https://pith.science/pith/PZL2UPBX63PEA5YHHJBLBPAFFP/bundle.json","state":"https://pith.science/pith/PZL2UPBX63PEA5YHHJBLBPAFFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZL2UPBX63PEA5YHHJBLBPAFFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PZL2UPBX63PEA5YHHJBLBPAFFP","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":"f9fd3d69bcf9eaee48d04a49d439a0d4fb4754699977f4b7c0d00d163bdd2baa","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-13T17:35:19Z","title_canon_sha256":"1236eb463f01de687ae32732375230501589a21c280c1e411c5c4649f278f1ee"},"schema_version":"1.0","source":{"id":"1709.04440","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04440","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04440v3","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04440","created_at":"2026-05-18T00:06:41Z"},{"alias_kind":"pith_short_12","alias_value":"PZL2UPBX63PE","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PZL2UPBX63PEA5YH","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PZL2UPBX","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:96ef0c5ba3de5532a971a22b800f6ca872cf218591123ee5553f008e6f225af7","target":"graph","created_at":"2026-05-18T00:06:41Z","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":"For each $k\\geq 3$, Green proved an arithmetic $k$-cycle removal lemma for any abelian group $G$. The best known bounds relating the parameters in the lemma for general $G$ are of tower-type. For $k>3$, even in the case $G=\\mathbb{F}_2^n$ no better bounds were known prior to this paper. This special case has received considerable attention due to its close connection to property testing of boolean functions. For every $k\\geq 3$, we prove a polynomial bound relating the parameters for $G=\\mathbb{F}_p^n$, where $p$ is any fixed prime. This extends the result for $k=3$ by the first two authors. D","authors_text":"Jacob Fox, L\\'aszl\\'o Mikl\\'os Lov\\'asz, Lisa Sauermann","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-13T17:35:19Z","title":"A polynomial bound for the arithmetic $k$-cycle removal lemma in vector spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04440","kind":"arxiv","version":3},"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:3ac5bdab1e7cc4c555ffd50a53ad376add9d5c0d99b2c1e5c8f8b19c839947fb","target":"record","created_at":"2026-05-18T00:06:41Z","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":"f9fd3d69bcf9eaee48d04a49d439a0d4fb4754699977f4b7c0d00d163bdd2baa","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-13T17:35:19Z","title_canon_sha256":"1236eb463f01de687ae32732375230501589a21c280c1e411c5c4649f278f1ee"},"schema_version":"1.0","source":{"id":"1709.04440","kind":"arxiv","version":3}},"canonical_sha256":"7e57aa3c37f6de4077073a42b0bc052bd132d11074e5ae67290fb4f4ef3a9a52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e57aa3c37f6de4077073a42b0bc052bd132d11074e5ae67290fb4f4ef3a9a52","first_computed_at":"2026-05-18T00:06:41.488379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:41.488379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z6wak/Ek4AOovacHe6aqsXK6cXyp/TYmtQxqTMr8eKh2eH7CxSue58haCwE3Y4dPggWyllc2oJ6fAizJ21ryBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:41.488759Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04440","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ac5bdab1e7cc4c555ffd50a53ad376add9d5c0d99b2c1e5c8f8b19c839947fb","sha256:96ef0c5ba3de5532a971a22b800f6ca872cf218591123ee5553f008e6f225af7"],"state_sha256":"196b37475dfe4fddd1edd877c442a6fae98baf41ab574b33d012113cd2162afa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dos6VIbr/ccpjv/wIiIwpAzK9oPihm1a4QymMReIgNnQ+XL/GMyvpoGOwRxpsiLkM1L27/FUyHs5g8XWp88IAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:14:36.485646Z","bundle_sha256":"087d88f0c005235b1dbb5234488c5fc3c29637b58f55dc11e66a28ccffada3cc"}}