{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:J34ADX5O2SFBZPXHFGRUDTBKIY","short_pith_number":"pith:J34ADX5O","schema_version":"1.0","canonical_sha256":"4ef801dfaed48a1cbee729a341cc2a4637491df05c917996cf22c6a28d61a7e3","source":{"kind":"arxiv","id":"1501.06528","version":2},"attestation_state":"computed","paper":{"title":"High-Girth Matrices and Polarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emmanuel Abbe, Yuval Wigderson","submitted_at":"2015-01-26T19:14:33Z","abstract_excerpt":"The girth of a matrix is the least number of linearly dependent columns, in contrast to the rank which is the largest number of linearly independent columns. This paper considers the construction of {\\it high-girth} matrices, whose probabilistic girth is close to its rank. Random matrices can be used to show the existence of high-girth matrices with constant relative rank, but the construction is non-explicit. This paper uses a polar-like construction to obtain a deterministic and efficient construction of high-girth matrices for arbitrary fields and relative ranks. Applications to coding and "},"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":"1501.06528","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-26T19:14:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bb7d6b42c2c5ae7f1e3cc98a4620e34a3c6186c7192d7eee7c8649a631f7695f","abstract_canon_sha256":"bb72796a64381ea12481071ef06a5c43a72ee8dffb5e03f9370e386212c4477e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:56.738812Z","signature_b64":"dLIGGIZCIHOy0cnEHPWkJPw8tyckLJ4txUmDkBw/zcTACgr+jxlKq1bw1zn+j0BxrNAoKpsYuLnI2uYg6kq5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ef801dfaed48a1cbee729a341cc2a4637491df05c917996cf22c6a28d61a7e3","last_reissued_at":"2026-05-18T02:27:56.738305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:56.738305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Girth Matrices and Polarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emmanuel Abbe, Yuval Wigderson","submitted_at":"2015-01-26T19:14:33Z","abstract_excerpt":"The girth of a matrix is the least number of linearly dependent columns, in contrast to the rank which is the largest number of linearly independent columns. This paper considers the construction of {\\it high-girth} matrices, whose probabilistic girth is close to its rank. Random matrices can be used to show the existence of high-girth matrices with constant relative rank, but the construction is non-explicit. This paper uses a polar-like construction to obtain a deterministic and efficient construction of high-girth matrices for arbitrary fields and relative ranks. Applications to coding and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06528","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":"1501.06528","created_at":"2026-05-18T02:27:56.738398+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06528v2","created_at":"2026-05-18T02:27:56.738398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06528","created_at":"2026-05-18T02:27:56.738398+00:00"},{"alias_kind":"pith_short_12","alias_value":"J34ADX5O2SFB","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"J34ADX5O2SFBZPXH","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"J34ADX5O","created_at":"2026-05-18T12:29:27.538025+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/J34ADX5O2SFBZPXHFGRUDTBKIY","json":"https://pith.science/pith/J34ADX5O2SFBZPXHFGRUDTBKIY.json","graph_json":"https://pith.science/api/pith-number/J34ADX5O2SFBZPXHFGRUDTBKIY/graph.json","events_json":"https://pith.science/api/pith-number/J34ADX5O2SFBZPXHFGRUDTBKIY/events.json","paper":"https://pith.science/paper/J34ADX5O"},"agent_actions":{"view_html":"https://pith.science/pith/J34ADX5O2SFBZPXHFGRUDTBKIY","download_json":"https://pith.science/pith/J34ADX5O2SFBZPXHFGRUDTBKIY.json","view_paper":"https://pith.science/paper/J34ADX5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06528&json=true","fetch_graph":"https://pith.science/api/pith-number/J34ADX5O2SFBZPXHFGRUDTBKIY/graph.json","fetch_events":"https://pith.science/api/pith-number/J34ADX5O2SFBZPXHFGRUDTBKIY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J34ADX5O2SFBZPXHFGRUDTBKIY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J34ADX5O2SFBZPXHFGRUDTBKIY/action/storage_attestation","attest_author":"https://pith.science/pith/J34ADX5O2SFBZPXHFGRUDTBKIY/action/author_attestation","sign_citation":"https://pith.science/pith/J34ADX5O2SFBZPXHFGRUDTBKIY/action/citation_signature","submit_replication":"https://pith.science/pith/J34ADX5O2SFBZPXHFGRUDTBKIY/action/replication_record"}},"created_at":"2026-05-18T02:27:56.738398+00:00","updated_at":"2026-05-18T02:27:56.738398+00:00"}