{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CAEHLHPW5ZBQOJRTIGXYQNHUKM","short_pith_number":"pith:CAEHLHPW","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"},"canonical_sha256":"1008759df6ee4307263341af8834f453161d171a831ee17d62be597a84fb24b8","source":{"kind":"arxiv","id":"1211.0330","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0330","created_at":"2026-05-18T03:41:41Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0330v1","created_at":"2026-05-18T03:41:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0330","created_at":"2026-05-18T03:41:41Z"},{"alias_kind":"pith_short_12","alias_value":"CAEHLHPW5ZBQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CAEHLHPW5ZBQOJRT","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CAEHLHPW","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CAEHLHPW5ZBQOJRTIGXYQNHUKM","target":"record","payload":{"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"},"canonical_sha256":"1008759df6ee4307263341af8834f453161d171a831ee17d62be597a84fb24b8","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"},"source_kind":"arxiv","source_id":"1211.0330","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:41:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nnNpyKvw01Jhv7Lt9KJjOU+Q6RETKGMADTHRZ9G2Djme/rxMEL+AIRqkpYtV0aIjI00/O/ApJitXs+duokoVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:45:31.996175Z"},"content_sha256":"c6c625d5e76830267673b5ebc635b60232ce78a111954f3fdccef67dce65ab9a","schema_version":"1.0","event_id":"sha256:c6c625d5e76830267673b5ebc635b60232ce78a111954f3fdccef67dce65ab9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CAEHLHPW5ZBQOJRTIGXYQNHUKM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:41:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"twdYKLx6qW6a0Escsd+ifRPjQ5wDHVMz519iJo9TUFktG9Wbz+s0zs1J0NMSLP1AwT/15UKZpmAILXCPEJ6XBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:45:31.996842Z"},"content_sha256":"a89e1de07c6ee5eec953950379f06d1890e1f73c6f720d8ab699a288a9106e7d","schema_version":"1.0","event_id":"sha256:a89e1de07c6ee5eec953950379f06d1890e1f73c6f720d8ab699a288a9106e7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CAEHLHPW5ZBQOJRTIGXYQNHUKM/bundle.json","state_url":"https://pith.science/pith/CAEHLHPW5ZBQOJRTIGXYQNHUKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CAEHLHPW5ZBQOJRTIGXYQNHUKM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T07:45:31Z","links":{"resolver":"https://pith.science/pith/CAEHLHPW5ZBQOJRTIGXYQNHUKM","bundle":"https://pith.science/pith/CAEHLHPW5ZBQOJRTIGXYQNHUKM/bundle.json","state":"https://pith.science/pith/CAEHLHPW5ZBQOJRTIGXYQNHUKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CAEHLHPW5ZBQOJRTIGXYQNHUKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CAEHLHPW5ZBQOJRTIGXYQNHUKM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7051ca6be377f485b3eeec83ab789a800966ac4ccd53fe2d4f1513a75f146820","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-02T00:07:29Z","title_canon_sha256":"21d125db50d66fdb63c24fbdb780c5560027f33402f71094c3be87b412339f5c"},"schema_version":"1.0","source":{"id":"1211.0330","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0330","created_at":"2026-05-18T03:41:41Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0330v1","created_at":"2026-05-18T03:41:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0330","created_at":"2026-05-18T03:41:41Z"},{"alias_kind":"pith_short_12","alias_value":"CAEHLHPW5ZBQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CAEHLHPW5ZBQOJRT","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CAEHLHPW","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:a89e1de07c6ee5eec953950379f06d1890e1f73c6f720d8ab699a288a9106e7d","target":"graph","created_at":"2026-05-18T03:41:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Avi Wigderson, Shubhangi Saraf, Zeev Dvir","cross_cats":["cs.CC","cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-02T00:07:29Z","title":"Improved rank bounds for design matrices and a new proof of Kelly's theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0330","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c6c625d5e76830267673b5ebc635b60232ce78a111954f3fdccef67dce65ab9a","target":"record","created_at":"2026-05-18T03:41:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7051ca6be377f485b3eeec83ab789a800966ac4ccd53fe2d4f1513a75f146820","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-02T00:07:29Z","title_canon_sha256":"21d125db50d66fdb63c24fbdb780c5560027f33402f71094c3be87b412339f5c"},"schema_version":"1.0","source":{"id":"1211.0330","kind":"arxiv","version":1}},"canonical_sha256":"1008759df6ee4307263341af8834f453161d171a831ee17d62be597a84fb24b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1008759df6ee4307263341af8834f453161d171a831ee17d62be597a84fb24b8","first_computed_at":"2026-05-18T03:41:41.536165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:41.536165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NOnbT32Ihw04646T8fcR+baTMAjqYzKQeO7MLGo0a/jz03Po74xHSG9MrLu1QsaWpK1ouYkbo5/PXMwDFq7xBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:41.537140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0330","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6c625d5e76830267673b5ebc635b60232ce78a111954f3fdccef67dce65ab9a","sha256:a89e1de07c6ee5eec953950379f06d1890e1f73c6f720d8ab699a288a9106e7d"],"state_sha256":"cc7a6c118189dcf7628d418f2cfaeeba535e3305098325f97b51a111fe3a3384"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S57kvZB4ddmsyGt3Eu7HyuoPNSMH34tpNooMkDD0xduJ3LqWKhlVjf2lPSSPWkO7nqLHxIF9cQOC+GdoicigDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:45:32.000716Z","bundle_sha256":"4c1d37f3e62007718b2915bb19971f91f6734af84131bcfa9bb8a24583a9c0b7"}}