{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:J2EC7UTWGB6ESSNMTHPGMKFDTQ","short_pith_number":"pith:J2EC7UTW","schema_version":"1.0","canonical_sha256":"4e882fd276307c4949ac99de6628a39c2db0c04c40248458959f5ac26dcb0a81","source":{"kind":"arxiv","id":"1612.07491","version":1},"attestation_state":"computed","paper":{"title":"Cube vs. Cube Low Degree Test","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Amey Bhangale, Inbal Livni Navon, Irit Dinur","submitted_at":"2016-12-22T08:54:49Z","abstract_excerpt":"We revisit the Raz-Safra plane-vs.-plane test and study the closely related cube vs. cube test. In this test the tester has access to a \"cubes table\" which assigns to every cube a low degree polynomial. The tester randomly selects two cubes (affine sub-spaces of dimension $3$) that intersect on a point $x\\in \\mathbf{F}^m$, and checks that the assignments to the cubes agree with each other on the point $x$.\n  Our main result is a new combinatorial proof for a low degree test that comes closer to the soundness limit, as it works for all $\\epsilon \\ge poly(d)/{\\mathbf{F}}^{1/2}$, where $d$ is the"},"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":"1612.07491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-22T08:54:49Z","cross_cats_sorted":[],"title_canon_sha256":"a726f6ed0929e17e31acb6b715e1eb49ce4530c3eb5393edb433ded418dac9b9","abstract_canon_sha256":"7aec1701f79092632004f6a7dfd1b3032971fa2cd470df7be014d98937c874d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:09.912895Z","signature_b64":"bwx4xf4WUyEEi7jridQdaN0+wdCltUlqmd6u+/6g6PVJW57QGbxwY6o8zS+94i0i/GAqPjOI/2GdfzgX/riGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e882fd276307c4949ac99de6628a39c2db0c04c40248458959f5ac26dcb0a81","last_reissued_at":"2026-05-18T00:54:09.912527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:09.912527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cube vs. Cube Low Degree Test","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Amey Bhangale, Inbal Livni Navon, Irit Dinur","submitted_at":"2016-12-22T08:54:49Z","abstract_excerpt":"We revisit the Raz-Safra plane-vs.-plane test and study the closely related cube vs. cube test. In this test the tester has access to a \"cubes table\" which assigns to every cube a low degree polynomial. The tester randomly selects two cubes (affine sub-spaces of dimension $3$) that intersect on a point $x\\in \\mathbf{F}^m$, and checks that the assignments to the cubes agree with each other on the point $x$.\n  Our main result is a new combinatorial proof for a low degree test that comes closer to the soundness limit, as it works for all $\\epsilon \\ge poly(d)/{\\mathbf{F}}^{1/2}$, where $d$ is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07491","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.07491","created_at":"2026-05-18T00:54:09.912583+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07491v1","created_at":"2026-05-18T00:54:09.912583+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07491","created_at":"2026-05-18T00:54:09.912583+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2EC7UTWGB6E","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2EC7UTWGB6ESSNM","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2EC7UTW","created_at":"2026-05-18T12:30:22.444734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.22813","citing_title":"Optimal Testing of Reed-Muller Codes with an Online Adversary","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J2EC7UTWGB6ESSNMTHPGMKFDTQ","json":"https://pith.science/pith/J2EC7UTWGB6ESSNMTHPGMKFDTQ.json","graph_json":"https://pith.science/api/pith-number/J2EC7UTWGB6ESSNMTHPGMKFDTQ/graph.json","events_json":"https://pith.science/api/pith-number/J2EC7UTWGB6ESSNMTHPGMKFDTQ/events.json","paper":"https://pith.science/paper/J2EC7UTW"},"agent_actions":{"view_html":"https://pith.science/pith/J2EC7UTWGB6ESSNMTHPGMKFDTQ","download_json":"https://pith.science/pith/J2EC7UTWGB6ESSNMTHPGMKFDTQ.json","view_paper":"https://pith.science/paper/J2EC7UTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07491&json=true","fetch_graph":"https://pith.science/api/pith-number/J2EC7UTWGB6ESSNMTHPGMKFDTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/J2EC7UTWGB6ESSNMTHPGMKFDTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2EC7UTWGB6ESSNMTHPGMKFDTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2EC7UTWGB6ESSNMTHPGMKFDTQ/action/storage_attestation","attest_author":"https://pith.science/pith/J2EC7UTWGB6ESSNMTHPGMKFDTQ/action/author_attestation","sign_citation":"https://pith.science/pith/J2EC7UTWGB6ESSNMTHPGMKFDTQ/action/citation_signature","submit_replication":"https://pith.science/pith/J2EC7UTWGB6ESSNMTHPGMKFDTQ/action/replication_record"}},"created_at":"2026-05-18T00:54:09.912583+00:00","updated_at":"2026-05-18T00:54:09.912583+00:00"}