{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CAEHLHPW5ZBQOJRTIGXYQNHUKM","short_pith_number":"pith:CAEHLHPW","schema_version":"1.0","canonical_sha256":"1008759df6ee4307263341af8834f453161d171a831ee17d62be597a84fb24b8","source":{"kind":"arxiv","id":"1211.0330","version":1},"attestation_state":"computed","paper":{"title":"Improved rank bounds for design matrices and a new proof of Kelly's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"math.CO","authors_text":"Avi Wigderson, Shubhangi Saraf, Zeev Dvir","submitted_at":"2012-11-02T00:07:29Z","abstract_excerpt":"We study the rank of complex sparse matrices in which the supports of different columns have small intersections. The rank of these matrices, called design matrices, was the focus of a recent work by Barak et. al. (BDWY11) in which they were used to answer questions regarding point configurations. In this work we derive near-optimal rank bounds for these matrices and use them to obtain asymptotically tight bounds in many of the geometric applications. As a consequence of our improved analysis, we also obtain a new, linear algebraic, proof of Kelly's theorem, which is the complex analog of 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":"1211.0330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-02T00:07:29Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"21d125db50d66fdb63c24fbdb780c5560027f33402f71094c3be87b412339f5c","abstract_canon_sha256":"7051ca6be377f485b3eeec83ab789a800966ac4ccd53fe2d4f1513a75f146820"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:41.537140Z","signature_b64":"NOnbT32Ihw04646T8fcR+baTMAjqYzKQeO7MLGo0a/jz03Po74xHSG9MrLu1QsaWpK1ouYkbo5/PXMwDFq7xBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1008759df6ee4307263341af8834f453161d171a831ee17d62be597a84fb24b8","last_reissued_at":"2026-05-18T03:41:41.536165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:41.536165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved rank bounds for design matrices and a new proof of Kelly's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"math.CO","authors_text":"Avi Wigderson, Shubhangi Saraf, Zeev Dvir","submitted_at":"2012-11-02T00:07:29Z","abstract_excerpt":"We study the rank of complex sparse matrices in which the supports of different columns have small intersections. The rank of these matrices, called design matrices, was the focus of a recent work by Barak et. al. (BDWY11) in which they were used to answer questions regarding point configurations. In this work we derive near-optimal rank bounds for these matrices and use them to obtain asymptotically tight bounds in many of the geometric applications. As a consequence of our improved analysis, we also obtain a new, linear algebraic, proof of Kelly's theorem, which is the complex analog of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0330","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":"1211.0330","created_at":"2026-05-18T03:41:41.536335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.0330v1","created_at":"2026-05-18T03:41:41.536335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0330","created_at":"2026-05-18T03:41:41.536335+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAEHLHPW5ZBQ","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAEHLHPW5ZBQOJRT","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAEHLHPW","created_at":"2026-05-18T12:27:01.376967+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/CAEHLHPW5ZBQOJRTIGXYQNHUKM","json":"https://pith.science/pith/CAEHLHPW5ZBQOJRTIGXYQNHUKM.json","graph_json":"https://pith.science/api/pith-number/CAEHLHPW5ZBQOJRTIGXYQNHUKM/graph.json","events_json":"https://pith.science/api/pith-number/CAEHLHPW5ZBQOJRTIGXYQNHUKM/events.json","paper":"https://pith.science/paper/CAEHLHPW"},"agent_actions":{"view_html":"https://pith.science/pith/CAEHLHPW5ZBQOJRTIGXYQNHUKM","download_json":"https://pith.science/pith/CAEHLHPW5ZBQOJRTIGXYQNHUKM.json","view_paper":"https://pith.science/paper/CAEHLHPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.0330&json=true","fetch_graph":"https://pith.science/api/pith-number/CAEHLHPW5ZBQOJRTIGXYQNHUKM/graph.json","fetch_events":"https://pith.science/api/pith-number/CAEHLHPW5ZBQOJRTIGXYQNHUKM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAEHLHPW5ZBQOJRTIGXYQNHUKM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAEHLHPW5ZBQOJRTIGXYQNHUKM/action/storage_attestation","attest_author":"https://pith.science/pith/CAEHLHPW5ZBQOJRTIGXYQNHUKM/action/author_attestation","sign_citation":"https://pith.science/pith/CAEHLHPW5ZBQOJRTIGXYQNHUKM/action/citation_signature","submit_replication":"https://pith.science/pith/CAEHLHPW5ZBQOJRTIGXYQNHUKM/action/replication_record"}},"created_at":"2026-05-18T03:41:41.536335+00:00","updated_at":"2026-05-18T03:41:41.536335+00:00"}