{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PZL2UPBX63PEA5YHHJBLBPAFFP","short_pith_number":"pith:PZL2UPBX","schema_version":"1.0","canonical_sha256":"7e57aa3c37f6de4077073a42b0bc052bd132d11074e5ae67290fb4f4ef3a9a52","source":{"kind":"arxiv","id":"1709.04440","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.04440","created_at":"2026-05-18T00:06:41.488434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.04440v3","created_at":"2026-05-18T00:06:41.488434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04440","created_at":"2026-05-18T00:06:41.488434+00:00"},{"alias_kind":"pith_short_12","alias_value":"PZL2UPBX63PE","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PZL2UPBX63PEA5YH","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PZL2UPBX","created_at":"2026-05-18T12:31:37.085036+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/PZL2UPBX63PEA5YHHJBLBPAFFP","json":"https://pith.science/pith/PZL2UPBX63PEA5YHHJBLBPAFFP.json","graph_json":"https://pith.science/api/pith-number/PZL2UPBX63PEA5YHHJBLBPAFFP/graph.json","events_json":"https://pith.science/api/pith-number/PZL2UPBX63PEA5YHHJBLBPAFFP/events.json","paper":"https://pith.science/paper/PZL2UPBX"},"agent_actions":{"view_html":"https://pith.science/pith/PZL2UPBX63PEA5YHHJBLBPAFFP","download_json":"https://pith.science/pith/PZL2UPBX63PEA5YHHJBLBPAFFP.json","view_paper":"https://pith.science/paper/PZL2UPBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.04440&json=true","fetch_graph":"https://pith.science/api/pith-number/PZL2UPBX63PEA5YHHJBLBPAFFP/graph.json","fetch_events":"https://pith.science/api/pith-number/PZL2UPBX63PEA5YHHJBLBPAFFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PZL2UPBX63PEA5YHHJBLBPAFFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PZL2UPBX63PEA5YHHJBLBPAFFP/action/storage_attestation","attest_author":"https://pith.science/pith/PZL2UPBX63PEA5YHHJBLBPAFFP/action/author_attestation","sign_citation":"https://pith.science/pith/PZL2UPBX63PEA5YHHJBLBPAFFP/action/citation_signature","submit_replication":"https://pith.science/pith/PZL2UPBX63PEA5YHHJBLBPAFFP/action/replication_record"}},"created_at":"2026-05-18T00:06:41.488434+00:00","updated_at":"2026-05-18T00:06:41.488434+00:00"}