{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:YSZ3Q22HMDNYYUV4NGQGQLRKOW","short_pith_number":"pith:YSZ3Q22H","schema_version":"1.0","canonical_sha256":"c4b3b86b4760db8c52bc69a0682e2a75947dd0fab7f26bcf55edda8b0f8b6e3c","source":{"kind":"arxiv","id":"1009.4375","version":2},"attestation_state":"computed","paper":{"title":"Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","math.MG"],"primary_cat":"math.CO","authors_text":"Amir Yehudayoff, Avi Wigderson, Boaz Barak, Zeev Dvir","submitted_at":"2010-09-22T14:50:25Z","abstract_excerpt":"A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at least k non-zeros and the supports of every two columns intersect in at most t rows. We prove that the rank of any (q,k,t)-design matrix over a field of characteristic zero (or sufficiently large finite characteristic) is at least n - (qtn/2k)^2 . Using this result we derive the following applications:\n  (1) Impossibility results for 2-query LCCs over the complex numbers: A 2-query locally correctable code (LCC) is an er"},"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":"1009.4375","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-22T14:50:25Z","cross_cats_sorted":["cs.CC","cs.CG","math.MG"],"title_canon_sha256":"f1fee4fa9afadce5801d9383288512b211084a5368482cb90b254b06de152e04","abstract_canon_sha256":"d9bbef13c003319fc212eacaf8e043cd3d106ab7d6ef8b7853714b5391ed289f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:03.642194Z","signature_b64":"oUWmvhq9z2qPCcZbqxGTJ4cEn+91d61wBO2nsr1VmssYPwlO4maHvU9VPABQkJvgbu8b1KTfGFG3cUh4fe0hDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4b3b86b4760db8c52bc69a0682e2a75947dd0fab7f26bcf55edda8b0f8b6e3c","last_reissued_at":"2026-05-18T04:27:03.641507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:03.641507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","math.MG"],"primary_cat":"math.CO","authors_text":"Amir Yehudayoff, Avi Wigderson, Boaz Barak, Zeev Dvir","submitted_at":"2010-09-22T14:50:25Z","abstract_excerpt":"A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at least k non-zeros and the supports of every two columns intersect in at most t rows. We prove that the rank of any (q,k,t)-design matrix over a field of characteristic zero (or sufficiently large finite characteristic) is at least n - (qtn/2k)^2 . Using this result we derive the following applications:\n  (1) Impossibility results for 2-query LCCs over the complex numbers: A 2-query locally correctable code (LCC) is an er"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4375","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":"1009.4375","created_at":"2026-05-18T04:27:03.641612+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.4375v2","created_at":"2026-05-18T04:27:03.641612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4375","created_at":"2026-05-18T04:27:03.641612+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSZ3Q22HMDNY","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSZ3Q22HMDNYYUV4","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSZ3Q22H","created_at":"2026-05-18T12:26:17.028572+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/YSZ3Q22HMDNYYUV4NGQGQLRKOW","json":"https://pith.science/pith/YSZ3Q22HMDNYYUV4NGQGQLRKOW.json","graph_json":"https://pith.science/api/pith-number/YSZ3Q22HMDNYYUV4NGQGQLRKOW/graph.json","events_json":"https://pith.science/api/pith-number/YSZ3Q22HMDNYYUV4NGQGQLRKOW/events.json","paper":"https://pith.science/paper/YSZ3Q22H"},"agent_actions":{"view_html":"https://pith.science/pith/YSZ3Q22HMDNYYUV4NGQGQLRKOW","download_json":"https://pith.science/pith/YSZ3Q22HMDNYYUV4NGQGQLRKOW.json","view_paper":"https://pith.science/paper/YSZ3Q22H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.4375&json=true","fetch_graph":"https://pith.science/api/pith-number/YSZ3Q22HMDNYYUV4NGQGQLRKOW/graph.json","fetch_events":"https://pith.science/api/pith-number/YSZ3Q22HMDNYYUV4NGQGQLRKOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSZ3Q22HMDNYYUV4NGQGQLRKOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSZ3Q22HMDNYYUV4NGQGQLRKOW/action/storage_attestation","attest_author":"https://pith.science/pith/YSZ3Q22HMDNYYUV4NGQGQLRKOW/action/author_attestation","sign_citation":"https://pith.science/pith/YSZ3Q22HMDNYYUV4NGQGQLRKOW/action/citation_signature","submit_replication":"https://pith.science/pith/YSZ3Q22HMDNYYUV4NGQGQLRKOW/action/replication_record"}},"created_at":"2026-05-18T04:27:03.641612+00:00","updated_at":"2026-05-18T04:27:03.641612+00:00"}