{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OZVTR5TLOLRNCV6XH5EYUA33GF","short_pith_number":"pith:OZVTR5TL","schema_version":"1.0","canonical_sha256":"766b38f66b72e2d157d73f498a037b31433b89fbe42e0a3e1854e0fb13a5b59f","source":{"kind":"arxiv","id":"2202.08688","version":1},"attestation_state":"computed","paper":{"title":"Improved Optimal Testing Results from Global Hypercontractivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Dor Minzer, Tali Kaufman","submitted_at":"2022-02-17T14:44:29Z","abstract_excerpt":"The problem of testing low-degree polynomials has received significant attention over the years due to its importance in theoretical computer science, and in particular in complexity theory. The problem is specified by three parameters: field size $q$, degree $d$ and proximity parameter $\\delta$, and the goal is to design a tester making as few as possible queries to a given function, which is able to distinguish between the case the given function has degree at most $d$, and the case the given function is $\\delta$-far from any degree $d$ function.\n  A tester is called optimal if it makes $O(q"},"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":"2202.08688","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2022-02-17T14:44:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c1a1c570405e32102aac20b472a298ce75063781fe4dbb0cb281585a4c0574af","abstract_canon_sha256":"cf3f4aca0250d5024da40cef2aba2cc9bd2ff5cd31ad7998aa5009a90785a955"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:57:56.767826Z","signature_b64":"l/C7MFrU2YoscOYGtmkYJXyl478WiBpTlg/G+QTeUfUR9g4TFrUFI6QdkADsm8YYepSCeo0QAzu0tAebgAN2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"766b38f66b72e2d157d73f498a037b31433b89fbe42e0a3e1854e0fb13a5b59f","last_reissued_at":"2026-07-05T03:57:56.767270Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:57:56.767270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Optimal Testing Results from Global Hypercontractivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Dor Minzer, Tali Kaufman","submitted_at":"2022-02-17T14:44:29Z","abstract_excerpt":"The problem of testing low-degree polynomials has received significant attention over the years due to its importance in theoretical computer science, and in particular in complexity theory. The problem is specified by three parameters: field size $q$, degree $d$ and proximity parameter $\\delta$, and the goal is to design a tester making as few as possible queries to a given function, which is able to distinguish between the case the given function has degree at most $d$, and the case the given function is $\\delta$-far from any degree $d$ function.\n  A tester is called optimal if it makes $O(q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.08688","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.08688/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2202.08688","created_at":"2026-07-05T03:57:56.767345+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.08688v1","created_at":"2026-07-05T03:57:56.767345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.08688","created_at":"2026-07-05T03:57:56.767345+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZVTR5TLOLRN","created_at":"2026-07-05T03:57:56.767345+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZVTR5TLOLRNCV6X","created_at":"2026-07-05T03:57:56.767345+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZVTR5TL","created_at":"2026-07-05T03:57:56.767345+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.16288","citing_title":"A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs","ref_index":82,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OZVTR5TLOLRNCV6XH5EYUA33GF","json":"https://pith.science/pith/OZVTR5TLOLRNCV6XH5EYUA33GF.json","graph_json":"https://pith.science/api/pith-number/OZVTR5TLOLRNCV6XH5EYUA33GF/graph.json","events_json":"https://pith.science/api/pith-number/OZVTR5TLOLRNCV6XH5EYUA33GF/events.json","paper":"https://pith.science/paper/OZVTR5TL"},"agent_actions":{"view_html":"https://pith.science/pith/OZVTR5TLOLRNCV6XH5EYUA33GF","download_json":"https://pith.science/pith/OZVTR5TLOLRNCV6XH5EYUA33GF.json","view_paper":"https://pith.science/paper/OZVTR5TL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.08688&json=true","fetch_graph":"https://pith.science/api/pith-number/OZVTR5TLOLRNCV6XH5EYUA33GF/graph.json","fetch_events":"https://pith.science/api/pith-number/OZVTR5TLOLRNCV6XH5EYUA33GF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZVTR5TLOLRNCV6XH5EYUA33GF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZVTR5TLOLRNCV6XH5EYUA33GF/action/storage_attestation","attest_author":"https://pith.science/pith/OZVTR5TLOLRNCV6XH5EYUA33GF/action/author_attestation","sign_citation":"https://pith.science/pith/OZVTR5TLOLRNCV6XH5EYUA33GF/action/citation_signature","submit_replication":"https://pith.science/pith/OZVTR5TLOLRNCV6XH5EYUA33GF/action/replication_record"}},"created_at":"2026-07-05T03:57:56.767345+00:00","updated_at":"2026-07-05T03:57:56.767345+00:00"}