{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TXLEAXS2DPVFP4H3LRFIUUH6U4","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":"313aa7f50452760fac35f7c61d7db57b715d3dc986b935b51a9b926f761ee37e","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-14T08:09:50Z","title_canon_sha256":"1a16cd4e586d9f3a1604607834b145b1a3ac12ee01b8d2a0c32f45b16c12925b"},"schema_version":"1.0","source":{"id":"1906.06066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06066","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06066v1","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06066","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"pith_short_12","alias_value":"TXLEAXS2DPVF","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TXLEAXS2DPVFP4H3","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TXLEAXS2","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:5ed1e66765b68d698d24c1df3bf4382ea4f2566f8cd6e9a75e1f1e2bbb4f19e0","target":"graph","created_at":"2026-05-17T23:43:19Z","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":"Codes that can correct up to $t$ symmetric errors and detect all unidirectional errors, known as $t$-EC-AUED codes, are studied in this paper. Given positive integers $q$, $a$ and $t$, let $n_q(a,t+1)$ denote the length of the shortest $q$-ary $t$-EC-AUED code of size $a$. We introduce combinatorial constructions for $q$-ary $t$-EC-AUED codes via one-factorizations of complete graphs, and concatenation of MDS codes and codes from resolvable set systems. Consequently, we determine the exact values of $n_q(a,t+1)$ for several new infinite families of $q,a$ and $t$.","authors_text":"Xiande Zhang, Yeow Meng Chee","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-14T08:09:50Z","title":"Optimal $q$-Ary Error Correcting/All Unidirectional Error Detecting Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06066","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:26fd9ca361a673e02c61ad58e9710ddbf5f11302d5fac2473678805a07548686","target":"record","created_at":"2026-05-17T23:43:19Z","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":"313aa7f50452760fac35f7c61d7db57b715d3dc986b935b51a9b926f761ee37e","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-14T08:09:50Z","title_canon_sha256":"1a16cd4e586d9f3a1604607834b145b1a3ac12ee01b8d2a0c32f45b16c12925b"},"schema_version":"1.0","source":{"id":"1906.06066","kind":"arxiv","version":1}},"canonical_sha256":"9dd6405e5a1bea57f0fb5c4a8a50fea730b489db564cd67cb763abfce651fad3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9dd6405e5a1bea57f0fb5c4a8a50fea730b489db564cd67cb763abfce651fad3","first_computed_at":"2026-05-17T23:43:19.847109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:19.847109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gawta8jnvfAxiNN4kGJupT2QluyBoeRWuU46t3M+2Iw+pGet8tGiKchYvAzf7XAfFn/kM7oqw2N9C0swAYmRDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:19.847781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.06066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26fd9ca361a673e02c61ad58e9710ddbf5f11302d5fac2473678805a07548686","sha256:5ed1e66765b68d698d24c1df3bf4382ea4f2566f8cd6e9a75e1f1e2bbb4f19e0"],"state_sha256":"c2608917db88f60e4df649bb8306200db6cc4f480a8e7caf60a92125a1fa8079"}