{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:F53TBSIFROGLI5MBA7VHKO5T67","short_pith_number":"pith:F53TBSIF","schema_version":"1.0","canonical_sha256":"2f7730c9058b8cb4758107ea753bb3f7d70d6a1ae44e013cdf4926dc06902d48","source":{"kind":"arxiv","id":"1610.08923","version":2},"attestation_state":"computed","paper":{"title":"Rank bounds for design matrices with block entries and geometric applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Ankit Garg, J\\'ozsef Solymosi, Rafael Oliveira, Zeev Dvir","submitted_at":"2016-10-27T18:48:01Z","abstract_excerpt":"Design matrices are sparse matrices in which the supports of different columns intersect in a few positions. Such matrices come up naturally when studying problems involving point sets with many collinear triples. In this work we consider design matrices with block (or matrix) entries. Our main result is a lower bound on the rank of such matrices, extending the bounds proved in {BDWY12,DSW12} for the scalar case. As a result we obtain several applications in combinatorial geometry. The first application involves extending the notion of structural rigidity (or graph rigidity) to the setting whe"},"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":"1610.08923","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-27T18:48:01Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"f481915729333185cf25c37cf6c880a480698a9c0be50a1293987347b036df55","abstract_canon_sha256":"f6d2ee6da296cffef9a9d0d0a7efaecd3ec4b14ccd1fac771fed164b0ecfc521"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:35.493808Z","signature_b64":"t5MTjjd1Bra3vCdpRVtvT86sgjg1dbTQQzpfsvX4bBL9AliAYlJksFEZNtEE3gtgSD3kSCSYtWjDwi/h8ZHgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f7730c9058b8cb4758107ea753bb3f7d70d6a1ae44e013cdf4926dc06902d48","last_reissued_at":"2026-05-18T00:21:35.493071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:35.493071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rank bounds for design matrices with block entries and geometric applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Ankit Garg, J\\'ozsef Solymosi, Rafael Oliveira, Zeev Dvir","submitted_at":"2016-10-27T18:48:01Z","abstract_excerpt":"Design matrices are sparse matrices in which the supports of different columns intersect in a few positions. Such matrices come up naturally when studying problems involving point sets with many collinear triples. In this work we consider design matrices with block (or matrix) entries. Our main result is a lower bound on the rank of such matrices, extending the bounds proved in {BDWY12,DSW12} for the scalar case. As a result we obtain several applications in combinatorial geometry. The first application involves extending the notion of structural rigidity (or graph rigidity) to the setting whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08923","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":"1610.08923","created_at":"2026-05-18T00:21:35.493191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08923v2","created_at":"2026-05-18T00:21:35.493191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08923","created_at":"2026-05-18T00:21:35.493191+00:00"},{"alias_kind":"pith_short_12","alias_value":"F53TBSIFROGL","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"F53TBSIFROGLI5MB","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"F53TBSIF","created_at":"2026-05-18T12:30:15.759754+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/F53TBSIFROGLI5MBA7VHKO5T67","json":"https://pith.science/pith/F53TBSIFROGLI5MBA7VHKO5T67.json","graph_json":"https://pith.science/api/pith-number/F53TBSIFROGLI5MBA7VHKO5T67/graph.json","events_json":"https://pith.science/api/pith-number/F53TBSIFROGLI5MBA7VHKO5T67/events.json","paper":"https://pith.science/paper/F53TBSIF"},"agent_actions":{"view_html":"https://pith.science/pith/F53TBSIFROGLI5MBA7VHKO5T67","download_json":"https://pith.science/pith/F53TBSIFROGLI5MBA7VHKO5T67.json","view_paper":"https://pith.science/paper/F53TBSIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08923&json=true","fetch_graph":"https://pith.science/api/pith-number/F53TBSIFROGLI5MBA7VHKO5T67/graph.json","fetch_events":"https://pith.science/api/pith-number/F53TBSIFROGLI5MBA7VHKO5T67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F53TBSIFROGLI5MBA7VHKO5T67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F53TBSIFROGLI5MBA7VHKO5T67/action/storage_attestation","attest_author":"https://pith.science/pith/F53TBSIFROGLI5MBA7VHKO5T67/action/author_attestation","sign_citation":"https://pith.science/pith/F53TBSIFROGLI5MBA7VHKO5T67/action/citation_signature","submit_replication":"https://pith.science/pith/F53TBSIFROGLI5MBA7VHKO5T67/action/replication_record"}},"created_at":"2026-05-18T00:21:35.493191+00:00","updated_at":"2026-05-18T00:21:35.493191+00:00"}