{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:J34ADX5O2SFBZPXHFGRUDTBKIY","short_pith_number":"pith:J34ADX5O","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"},"canonical_sha256":"4ef801dfaed48a1cbee729a341cc2a4637491df05c917996cf22c6a28d61a7e3","source":{"kind":"arxiv","id":"1501.06528","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06528","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06528v2","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06528","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"J34ADX5O2SFB","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J34ADX5O2SFBZPXH","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J34ADX5O","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:J34ADX5O2SFBZPXHFGRUDTBKIY","target":"record","payload":{"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"},"canonical_sha256":"4ef801dfaed48a1cbee729a341cc2a4637491df05c917996cf22c6a28d61a7e3","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"},"source_kind":"arxiv","source_id":"1501.06528","source_version":2,"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-18T02:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18tQKVB9Jsvz+Rbj6j6BLhnJb87Gm1tGxpm4fz7Ba7ixvv0H8/cynl/HsHGHeHpETckkpU87wajMs+slJGxnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:34:30.672993Z"},"content_sha256":"093608e16a43b30dab40706a5b8c4b5c6836707cb909579a1617a836e908cbb9","schema_version":"1.0","event_id":"sha256:093608e16a43b30dab40706a5b8c4b5c6836707cb909579a1617a836e908cbb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:J34ADX5O2SFBZPXHFGRUDTBKIY","target":"graph","payload":{"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"},"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-18T02:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxjHo48VTzELIQKbffOyJkp/9Lx4en9YrRb989xVVx2CrAP2aktTfjRWhHVH+4hq2zV5cgV6doBQ/jee2uU+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:34:30.673662Z"},"content_sha256":"af433cac39655755e4065f3773ce0ab3eeb45b43ceb7abfaebc30167918ab5dd","schema_version":"1.0","event_id":"sha256:af433cac39655755e4065f3773ce0ab3eeb45b43ceb7abfaebc30167918ab5dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J34ADX5O2SFBZPXHFGRUDTBKIY/bundle.json","state_url":"https://pith.science/pith/J34ADX5O2SFBZPXHFGRUDTBKIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J34ADX5O2SFBZPXHFGRUDTBKIY/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-08T16:34:30Z","links":{"resolver":"https://pith.science/pith/J34ADX5O2SFBZPXHFGRUDTBKIY","bundle":"https://pith.science/pith/J34ADX5O2SFBZPXHFGRUDTBKIY/bundle.json","state":"https://pith.science/pith/J34ADX5O2SFBZPXHFGRUDTBKIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J34ADX5O2SFBZPXHFGRUDTBKIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:J34ADX5O2SFBZPXHFGRUDTBKIY","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":"bb72796a64381ea12481071ef06a5c43a72ee8dffb5e03f9370e386212c4477e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-26T19:14:33Z","title_canon_sha256":"bb7d6b42c2c5ae7f1e3cc98a4620e34a3c6186c7192d7eee7c8649a631f7695f"},"schema_version":"1.0","source":{"id":"1501.06528","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06528","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06528v2","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06528","created_at":"2026-05-18T02:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"J34ADX5O2SFB","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J34ADX5O2SFBZPXH","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J34ADX5O","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:af433cac39655755e4065f3773ce0ab3eeb45b43ceb7abfaebc30167918ab5dd","target":"graph","created_at":"2026-05-18T02:27:56Z","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":"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 ","authors_text":"Emmanuel Abbe, Yuval Wigderson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-26T19:14:33Z","title":"High-Girth Matrices and Polarization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06528","kind":"arxiv","version":2},"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:093608e16a43b30dab40706a5b8c4b5c6836707cb909579a1617a836e908cbb9","target":"record","created_at":"2026-05-18T02:27:56Z","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":"bb72796a64381ea12481071ef06a5c43a72ee8dffb5e03f9370e386212c4477e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-26T19:14:33Z","title_canon_sha256":"bb7d6b42c2c5ae7f1e3cc98a4620e34a3c6186c7192d7eee7c8649a631f7695f"},"schema_version":"1.0","source":{"id":"1501.06528","kind":"arxiv","version":2}},"canonical_sha256":"4ef801dfaed48a1cbee729a341cc2a4637491df05c917996cf22c6a28d61a7e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ef801dfaed48a1cbee729a341cc2a4637491df05c917996cf22c6a28d61a7e3","first_computed_at":"2026-05-18T02:27:56.738305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:56.738305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dLIGGIZCIHOy0cnEHPWkJPw8tyckLJ4txUmDkBw/zcTACgr+jxlKq1bw1zn+j0BxrNAoKpsYuLnI2uYg6kq5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:56.738812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06528","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:093608e16a43b30dab40706a5b8c4b5c6836707cb909579a1617a836e908cbb9","sha256:af433cac39655755e4065f3773ce0ab3eeb45b43ceb7abfaebc30167918ab5dd"],"state_sha256":"46e96a124b2d07b142732c0a7822e5e5ac28c61701b661190323399b5dd996b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+RmEDTMywHYE0V8vO6fbm2oEnBjPVmx323VhvqRyesCQ9fn+jI0mjtIsb0sZpmuoVi2I8uRNJkGxfC0Ffi8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:34:30.676420Z","bundle_sha256":"eb90864690e418804b52d6567d4cf342318837d650df1b2f0c55864d3bd89dd5"}}