{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ","short_pith_number":"pith:YFBGKXOS","schema_version":"1.0","canonical_sha256":"c142655dd2715fa7a7962d26287733b66938336fe7cc2c005aac259dd48d0c01","source":{"kind":"arxiv","id":"1702.01734","version":2},"attestation_state":"computed","paper":{"title":"An Algebraic-Combinatorial Proof Technique for the GM-MDS Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Sprintson, Anoosheh Heidarzadeh","submitted_at":"2017-02-06T18:36:10Z","abstract_excerpt":"This paper considers the problem of designing maximum distance separable (MDS) codes over small fields with constraints on the support of their generator matrices. For any given $m\\times n$ binary matrix $M$, the GM-MDS conjecture, due to Dau et al., states that if $M$ satisfies the so-called MDS condition, then for any field $\\mathbb{F}$ of size $q\\geq n+m-1$, there exists an $[n,m]_q$ MDS code whose generator matrix $G$, with entries in $\\mathbb{F}$, fits $M$ (i.e., $M$ is the support matrix of $G$). Despite all the attempts by the coding theory community, this conjecture remains still open "},"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":"1702.01734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-06T18:36:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"af9e118cc1a1a5683e01ca58b3fea0c5881a2a63c27a6fd0c51a26056d517aec","abstract_canon_sha256":"28156adf1824ae51f6cb5a596e276ce5e049f8ed283b53a1a56e163d027f75df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:38.576915Z","signature_b64":"ePyLXRaJw4gLsOZvOWb9Sl0YI3YPDA7rLaaSrF++H/pPRbdkOvpKzmESYCmdCfVF5SmLc9PcPYaI+fCqM24LBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c142655dd2715fa7a7962d26287733b66938336fe7cc2c005aac259dd48d0c01","last_reissued_at":"2026-05-18T00:44:38.576455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:38.576455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algebraic-Combinatorial Proof Technique for the GM-MDS Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Sprintson, Anoosheh Heidarzadeh","submitted_at":"2017-02-06T18:36:10Z","abstract_excerpt":"This paper considers the problem of designing maximum distance separable (MDS) codes over small fields with constraints on the support of their generator matrices. For any given $m\\times n$ binary matrix $M$, the GM-MDS conjecture, due to Dau et al., states that if $M$ satisfies the so-called MDS condition, then for any field $\\mathbb{F}$ of size $q\\geq n+m-1$, there exists an $[n,m]_q$ MDS code whose generator matrix $G$, with entries in $\\mathbb{F}$, fits $M$ (i.e., $M$ is the support matrix of $G$). Despite all the attempts by the coding theory community, this conjecture remains still open "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01734","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":"1702.01734","created_at":"2026-05-18T00:44:38.576513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01734v2","created_at":"2026-05-18T00:44:38.576513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01734","created_at":"2026-05-18T00:44:38.576513+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFBGKXOSOFP2","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFBGKXOSOFP2PJ4W","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFBGKXOS","created_at":"2026-05-18T12:31:56.362134+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/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ","json":"https://pith.science/pith/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ.json","graph_json":"https://pith.science/api/pith-number/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ/graph.json","events_json":"https://pith.science/api/pith-number/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ/events.json","paper":"https://pith.science/paper/YFBGKXOS"},"agent_actions":{"view_html":"https://pith.science/pith/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ","download_json":"https://pith.science/pith/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ.json","view_paper":"https://pith.science/paper/YFBGKXOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01734&json=true","fetch_graph":"https://pith.science/api/pith-number/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ/action/storage_attestation","attest_author":"https://pith.science/pith/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ/action/author_attestation","sign_citation":"https://pith.science/pith/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ/action/citation_signature","submit_replication":"https://pith.science/pith/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ/action/replication_record"}},"created_at":"2026-05-18T00:44:38.576513+00:00","updated_at":"2026-05-18T00:44:38.576513+00:00"}