{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ","short_pith_number":"pith:YFBGKXOS","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"},"canonical_sha256":"c142655dd2715fa7a7962d26287733b66938336fe7cc2c005aac259dd48d0c01","source":{"kind":"arxiv","id":"1702.01734","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01734","created_at":"2026-05-18T00:44:38Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01734v2","created_at":"2026-05-18T00:44:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01734","created_at":"2026-05-18T00:44:38Z"},{"alias_kind":"pith_short_12","alias_value":"YFBGKXOSOFP2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YFBGKXOSOFP2PJ4W","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YFBGKXOS","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ","target":"record","payload":{"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"},"canonical_sha256":"c142655dd2715fa7a7962d26287733b66938336fe7cc2c005aac259dd48d0c01","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"},"source_kind":"arxiv","source_id":"1702.01734","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-18T00:44:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+8HKGtWsjQaU19iWlzO8exUmNG/bhHjf08mqMKaxcao1/vF/ycW5NRd3su63JEny3KM0RCvbqN2NZdTugndAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:17:10.295621Z"},"content_sha256":"89d823318affb635293a2510b6461dca609d71986e671d45e72c85a71b07e5f8","schema_version":"1.0","event_id":"sha256:89d823318affb635293a2510b6461dca609d71986e671d45e72c85a71b07e5f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ","target":"graph","payload":{"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"},"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-18T00:44:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ck5iU7yvJWCSJjd8B2teyGdPCFB9nAfPfMLR06lalsxX3zogEbYz7Qa6S9bsjfMT9+yEirUq4tXtsGjVWrM3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:17:10.295973Z"},"content_sha256":"4b500858143ae243672fab760b5df0c80925f443ba61a86d2b0d683095268f0a","schema_version":"1.0","event_id":"sha256:4b500858143ae243672fab760b5df0c80925f443ba61a86d2b0d683095268f0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ/bundle.json","state_url":"https://pith.science/pith/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ/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-02T14:17:10Z","links":{"resolver":"https://pith.science/pith/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ","bundle":"https://pith.science/pith/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ/bundle.json","state":"https://pith.science/pith/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YFBGKXOSOFP2PJ4WFUTCQ5ZTWZ","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":"28156adf1824ae51f6cb5a596e276ce5e049f8ed283b53a1a56e163d027f75df","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-06T18:36:10Z","title_canon_sha256":"af9e118cc1a1a5683e01ca58b3fea0c5881a2a63c27a6fd0c51a26056d517aec"},"schema_version":"1.0","source":{"id":"1702.01734","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01734","created_at":"2026-05-18T00:44:38Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01734v2","created_at":"2026-05-18T00:44:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01734","created_at":"2026-05-18T00:44:38Z"},{"alias_kind":"pith_short_12","alias_value":"YFBGKXOSOFP2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YFBGKXOSOFP2PJ4W","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YFBGKXOS","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:4b500858143ae243672fab760b5df0c80925f443ba61a86d2b0d683095268f0a","target":"graph","created_at":"2026-05-18T00:44:38Z","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":"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 ","authors_text":"Alex Sprintson, Anoosheh Heidarzadeh","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-06T18:36:10Z","title":"An Algebraic-Combinatorial Proof Technique for the GM-MDS Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01734","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:89d823318affb635293a2510b6461dca609d71986e671d45e72c85a71b07e5f8","target":"record","created_at":"2026-05-18T00:44:38Z","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":"28156adf1824ae51f6cb5a596e276ce5e049f8ed283b53a1a56e163d027f75df","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-06T18:36:10Z","title_canon_sha256":"af9e118cc1a1a5683e01ca58b3fea0c5881a2a63c27a6fd0c51a26056d517aec"},"schema_version":"1.0","source":{"id":"1702.01734","kind":"arxiv","version":2}},"canonical_sha256":"c142655dd2715fa7a7962d26287733b66938336fe7cc2c005aac259dd48d0c01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c142655dd2715fa7a7962d26287733b66938336fe7cc2c005aac259dd48d0c01","first_computed_at":"2026-05-18T00:44:38.576455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:38.576455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ePyLXRaJw4gLsOZvOWb9Sl0YI3YPDA7rLaaSrF++H/pPRbdkOvpKzmESYCmdCfVF5SmLc9PcPYaI+fCqM24LBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:38.576915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01734","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89d823318affb635293a2510b6461dca609d71986e671d45e72c85a71b07e5f8","sha256:4b500858143ae243672fab760b5df0c80925f443ba61a86d2b0d683095268f0a"],"state_sha256":"144c270e59c5b0fca64a1f345201db130db44a37cd56fa28308fa3de8481e5cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"12zn8vaFymu0N6nrnpfX82eNX9riunO60/wmNlYOWj0cfpfns1UIrBn/qlMWGqpMnnVelDDq0IViyqcriXotBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:17:10.297946Z","bundle_sha256":"2fb69972f8b99fc54fe44c4983b4f8f11c4096c4439056725dbfc222b5e4b74a"}}