{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IR6CDOW673YTL72CATIQOVYQYU","short_pith_number":"pith:IR6CDOW6","canonical_record":{"source":{"id":"1401.3807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-16T01:24:33Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"da669d6884ab02b12a38be9c95dd830ebe6c28c68248939041dd1153f95792ee","abstract_canon_sha256":"e17b3ac3d8f7f7146738b778ee190809f9b4af1951d9d762d168d7544dd561ef"},"schema_version":"1.0"},"canonical_sha256":"447c21badefef135ff4204d1075710c528e52f5ce443181d779c34720bc5f807","source":{"kind":"arxiv","id":"1401.3807","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3807","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3807v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3807","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"IR6CDOW673YT","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IR6CDOW673YTL72C","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IR6CDOW6","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IR6CDOW673YTL72CATIQOVYQYU","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-16T01:24:33Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"da669d6884ab02b12a38be9c95dd830ebe6c28c68248939041dd1153f95792ee","abstract_canon_sha256":"e17b3ac3d8f7f7146738b778ee190809f9b4af1951d9d762d168d7544dd561ef"},"schema_version":"1.0"},"canonical_sha256":"447c21badefef135ff4204d1075710c528e52f5ce443181d779c34720bc5f807","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.918857Z","signature_b64":"Z3/GTV5ElydGrhAUFDvUoba/bpP+bNbBAluftgTsaWWCo7L3SHaMt90mWH00JVCTeMEXshRtciSIGCJDFmcoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"447c21badefef135ff4204d1075710c528e52f5ce443181d779c34720bc5f807","last_reissued_at":"2026-05-18T03:02:06.918198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.918198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3807","source_version":1,"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-18T03:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J6aGLZorWBsgWawBvXC1tJ9P+0+12P9FUXadggGs6/1JTyf6g60A5IEAEHE5VT5elj9TUSaYkQRqNIX4Lq0ECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:44:09.857359Z"},"content_sha256":"9e1a9271387a878897093aed0abb8f7550a2f57ddd19ca02efe41461fc66e849","schema_version":"1.0","event_id":"sha256:9e1a9271387a878897093aed0abb8f7550a2f57ddd19ca02efe41461fc66e849"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IR6CDOW673YTL72CATIQOVYQYU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Existence of MDS Codes Over Small Fields With Constrained Generator Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Son Hoang Dau, Wentu Song","submitted_at":"2014-01-16T01:24:33Z","abstract_excerpt":"We study the existence over small fields of Maximum Distance Separable (MDS) codes with generator matrices having specified supports (i.e. having specified locations of zero entries). This problem unifies and simplifies the problems posed in recent works of Yan and Sprintson (NetCod'13) on weakly secure cooperative data exchange, of Halbawi et al. (arxiv'13) on distributed Reed-Solomon codes for simple multiple access networks, and of Dau et al. (ISIT'13) on MDS codes with balanced and sparse generator matrices. We conjecture that there exist such $[n,k]_q$ MDS codes as long as $q \\geq n + k -"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3807","kind":"arxiv","version":1},"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-18T03:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WBGz11LYAyvBY7McrA9KfedRKWlSnAy7GDMys/t8uRZie07e7hST8baCHc4F6xJwCd+Fi1F9QHgr85AME8CmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:44:09.857704Z"},"content_sha256":"439c238478bd6d6b70b1173709111fd3da5042057bf03d15a25df4beb7d8155e","schema_version":"1.0","event_id":"sha256:439c238478bd6d6b70b1173709111fd3da5042057bf03d15a25df4beb7d8155e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IR6CDOW673YTL72CATIQOVYQYU/bundle.json","state_url":"https://pith.science/pith/IR6CDOW673YTL72CATIQOVYQYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IR6CDOW673YTL72CATIQOVYQYU/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-04T02:44:09Z","links":{"resolver":"https://pith.science/pith/IR6CDOW673YTL72CATIQOVYQYU","bundle":"https://pith.science/pith/IR6CDOW673YTL72CATIQOVYQYU/bundle.json","state":"https://pith.science/pith/IR6CDOW673YTL72CATIQOVYQYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IR6CDOW673YTL72CATIQOVYQYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IR6CDOW673YTL72CATIQOVYQYU","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":"e17b3ac3d8f7f7146738b778ee190809f9b4af1951d9d762d168d7544dd561ef","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-16T01:24:33Z","title_canon_sha256":"da669d6884ab02b12a38be9c95dd830ebe6c28c68248939041dd1153f95792ee"},"schema_version":"1.0","source":{"id":"1401.3807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3807","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3807v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3807","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"IR6CDOW673YT","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IR6CDOW673YTL72C","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IR6CDOW6","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:439c238478bd6d6b70b1173709111fd3da5042057bf03d15a25df4beb7d8155e","target":"graph","created_at":"2026-05-18T03:02:06Z","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":"We study the existence over small fields of Maximum Distance Separable (MDS) codes with generator matrices having specified supports (i.e. having specified locations of zero entries). This problem unifies and simplifies the problems posed in recent works of Yan and Sprintson (NetCod'13) on weakly secure cooperative data exchange, of Halbawi et al. (arxiv'13) on distributed Reed-Solomon codes for simple multiple access networks, and of Dau et al. (ISIT'13) on MDS codes with balanced and sparse generator matrices. We conjecture that there exist such $[n,k]_q$ MDS codes as long as $q \\geq n + k -","authors_text":"Chau Yuen, Son Hoang Dau, Wentu Song","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-16T01:24:33Z","title":"On the Existence of MDS Codes Over Small Fields With Constrained Generator Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3807","kind":"arxiv","version":1},"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:9e1a9271387a878897093aed0abb8f7550a2f57ddd19ca02efe41461fc66e849","target":"record","created_at":"2026-05-18T03:02:06Z","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":"e17b3ac3d8f7f7146738b778ee190809f9b4af1951d9d762d168d7544dd561ef","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-16T01:24:33Z","title_canon_sha256":"da669d6884ab02b12a38be9c95dd830ebe6c28c68248939041dd1153f95792ee"},"schema_version":"1.0","source":{"id":"1401.3807","kind":"arxiv","version":1}},"canonical_sha256":"447c21badefef135ff4204d1075710c528e52f5ce443181d779c34720bc5f807","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"447c21badefef135ff4204d1075710c528e52f5ce443181d779c34720bc5f807","first_computed_at":"2026-05-18T03:02:06.918198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:06.918198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z3/GTV5ElydGrhAUFDvUoba/bpP+bNbBAluftgTsaWWCo7L3SHaMt90mWH00JVCTeMEXshRtciSIGCJDFmcoAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:06.918857Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e1a9271387a878897093aed0abb8f7550a2f57ddd19ca02efe41461fc66e849","sha256:439c238478bd6d6b70b1173709111fd3da5042057bf03d15a25df4beb7d8155e"],"state_sha256":"048336c80563109820d3a1c5307810d221d27a20a5ad20773713965f8d97d58f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tP3A0mRd/Qja7t3d0yD45F+zY/2YT4wbPIURI6jVwyky2xbm/WjpAfqz/cKys5uVzcEqytKkPJcZsW0pOryvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T02:44:09.859746Z","bundle_sha256":"aa1421d2f60327ee29456ea718dd1bef0ddf67687f15134253c8af871f0a3339"}}