{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6H2AGSMLBRBC5SXEN767FEQXDX","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":"89996f575eda6b97ab77ebed119f8817b498109c8bef2ac93aa5c2bbcf50f335","cross_cats_sorted":["cs.LG","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-13T04:32:57Z","title_canon_sha256":"141903350b65ef1dc6685e02b666750a619fdc2f971fea504f347cc9334044bf"},"schema_version":"1.0","source":{"id":"1906.06172","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06172","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06172v1","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06172","created_at":"2026-05-17T23:43:19Z"},{"alias_kind":"pith_short_12","alias_value":"6H2AGSMLBRBC","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6H2AGSMLBRBC5SXE","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6H2AGSML","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:376dd6ded15aa8110d3b4eefc687c3744b47b5c8ade03d798f4bd62b5c27306c","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":"Constrained sequence (CS) codes, including fixed-length CS codes and variable-length CS codes, have been widely used in modern wireless communication and data storage systems. Sequences encoded with constrained sequence codes satisfy constraints imposed by the physical channel to enable efficient and reliable transmission of coded symbols. In this paper, we propose using deep learning approaches to decode fixed-length and variable-length CS codes. Traditional encoding and decoding of fixed-length CS codes rely on look-up tables (LUTs), which is prone to errors that occur during transmission. W","authors_text":"Congzhe Cao, Duanshun Li, Ivan Fair","cross_cats":["cs.LG","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-13T04:32:57Z","title":"Deep Learning-Based Decoding of Constrained Sequence Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06172","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:9323238d540cb09c7b11085fb5bfccde0c8cfad0c78edb467a9f7d9455d9eae9","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":"89996f575eda6b97ab77ebed119f8817b498109c8bef2ac93aa5c2bbcf50f335","cross_cats_sorted":["cs.LG","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-13T04:32:57Z","title_canon_sha256":"141903350b65ef1dc6685e02b666750a619fdc2f971fea504f347cc9334044bf"},"schema_version":"1.0","source":{"id":"1906.06172","kind":"arxiv","version":1}},"canonical_sha256":"f1f403498b0c422ecae46ffdf292171dd44c3c3f981ebd3a260e0dfa073635a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1f403498b0c422ecae46ffdf292171dd44c3c3f981ebd3a260e0dfa073635a8","first_computed_at":"2026-05-17T23:43:19.486006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:19.486006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kgRb7LM/MMicocS4DOE704DbEK28DpvI/KNvIuhOHbrw5lbRvq36L2bfzW5ipHG7lz8D8ZmzhwO5CWMkhK10Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:19.486663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.06172","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9323238d540cb09c7b11085fb5bfccde0c8cfad0c78edb467a9f7d9455d9eae9","sha256:376dd6ded15aa8110d3b4eefc687c3744b47b5c8ade03d798f4bd62b5c27306c"],"state_sha256":"13341460abe631a13c701488a3508f66ad4b23bb13f0f86e11422583fe98ab87"}