{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PTU3QP5SC5T2XGNWWYNDPOIKOD","short_pith_number":"pith:PTU3QP5S","schema_version":"1.0","canonical_sha256":"7ce9b83fb21767ab99b6b61a37b90a70f707140f31f6ca2100b346bcacbb9c02","source":{"kind":"arxiv","id":"1902.10632","version":2},"attestation_state":"computed","paper":{"title":"Bias implies low rank for quartic polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amichai Lampert","submitted_at":"2019-02-27T16:52:47Z","abstract_excerpt":"We investigate the structure of polynomials of degree four in many variables over a fixed prime field $\\mathbb{F}=\\mathbb{F}_{p}$. In 2007, Green and Tao proved that if a polynomial $f:\\mathbb{F}^{n}\\rightarrow\\mathbb{F}$ is poorly distributed, then it is a function of a few polynomials of smaller degree. In 2009, Haramaty and Shpilka found an effective bound for $f$ of degree four: If $bias\\left(f\\right)\\geq\\delta$, then the number of lower degree polynomials required is at most polynomial in $1/\\delta$ and $f$ has a simple presentation as a sum of their products. We make a step towards showi"},"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":"1902.10632","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-27T16:52:47Z","cross_cats_sorted":[],"title_canon_sha256":"159d01bca70d147fcf94fe0b827155f71093a8fe871b6a3f29261808c0797a70","abstract_canon_sha256":"f68bfa00c75fde36991bd15201fdb4f8f7519764a2e4c7fa842d243a5de8b0bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:14.460428Z","signature_b64":"Tpq9nvIPtxl9yeMYaZWKvyDz8Q4JSopmmKBniWmCttqPWqhhIzHFas88oTT4/uxkb6XRhe2szDpVrgLSj6mNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ce9b83fb21767ab99b6b61a37b90a70f707140f31f6ca2100b346bcacbb9c02","last_reissued_at":"2026-05-17T23:52:14.459746Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:14.459746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bias implies low rank for quartic polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amichai Lampert","submitted_at":"2019-02-27T16:52:47Z","abstract_excerpt":"We investigate the structure of polynomials of degree four in many variables over a fixed prime field $\\mathbb{F}=\\mathbb{F}_{p}$. In 2007, Green and Tao proved that if a polynomial $f:\\mathbb{F}^{n}\\rightarrow\\mathbb{F}$ is poorly distributed, then it is a function of a few polynomials of smaller degree. In 2009, Haramaty and Shpilka found an effective bound for $f$ of degree four: If $bias\\left(f\\right)\\geq\\delta$, then the number of lower degree polynomials required is at most polynomial in $1/\\delta$ and $f$ has a simple presentation as a sum of their products. We make a step towards showi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10632","kind":"arxiv","version":2},"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":"1902.10632","created_at":"2026-05-17T23:52:14.459845+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10632v2","created_at":"2026-05-17T23:52:14.459845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10632","created_at":"2026-05-17T23:52:14.459845+00:00"},{"alias_kind":"pith_short_12","alias_value":"PTU3QP5SC5T2","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PTU3QP5SC5T2XGNW","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PTU3QP5S","created_at":"2026-05-18T12:33:24.271573+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/PTU3QP5SC5T2XGNWWYNDPOIKOD","json":"https://pith.science/pith/PTU3QP5SC5T2XGNWWYNDPOIKOD.json","graph_json":"https://pith.science/api/pith-number/PTU3QP5SC5T2XGNWWYNDPOIKOD/graph.json","events_json":"https://pith.science/api/pith-number/PTU3QP5SC5T2XGNWWYNDPOIKOD/events.json","paper":"https://pith.science/paper/PTU3QP5S"},"agent_actions":{"view_html":"https://pith.science/pith/PTU3QP5SC5T2XGNWWYNDPOIKOD","download_json":"https://pith.science/pith/PTU3QP5SC5T2XGNWWYNDPOIKOD.json","view_paper":"https://pith.science/paper/PTU3QP5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10632&json=true","fetch_graph":"https://pith.science/api/pith-number/PTU3QP5SC5T2XGNWWYNDPOIKOD/graph.json","fetch_events":"https://pith.science/api/pith-number/PTU3QP5SC5T2XGNWWYNDPOIKOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PTU3QP5SC5T2XGNWWYNDPOIKOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PTU3QP5SC5T2XGNWWYNDPOIKOD/action/storage_attestation","attest_author":"https://pith.science/pith/PTU3QP5SC5T2XGNWWYNDPOIKOD/action/author_attestation","sign_citation":"https://pith.science/pith/PTU3QP5SC5T2XGNWWYNDPOIKOD/action/citation_signature","submit_replication":"https://pith.science/pith/PTU3QP5SC5T2XGNWWYNDPOIKOD/action/replication_record"}},"created_at":"2026-05-17T23:52:14.459845+00:00","updated_at":"2026-05-17T23:52:14.459845+00:00"}