{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:KCFU3JOKWK3QAPFASF33VZCP4A","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":"2ca0bac55416b2337fef8f775e1ba50b8cf71ff87969f01a356e62224ab4d75b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-10T18:17:30Z","title_canon_sha256":"0a0a6e08f9030e8348b70b311378e02fbdeddf27654a76812f0ad471ca586c05"},"schema_version":"1.0","source":{"id":"0909.2009","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.2009","created_at":"2026-05-18T02:24:47Z"},{"alias_kind":"arxiv_version","alias_value":"0909.2009v2","created_at":"2026-05-18T02:24:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.2009","created_at":"2026-05-18T02:24:47Z"},{"alias_kind":"pith_short_12","alias_value":"KCFU3JOKWK3Q","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"KCFU3JOKWK3QAPFA","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"KCFU3JOK","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:6ebb2a4a14be00ab97f968c33de9fb4dfff9668d0827245610d5fefe3a9e11bd","target":"graph","created_at":"2026-05-18T02:24:47Z","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 studies coding schemes for the $q$-ary symmetric channel based on binary low-density parity-check (LDPC) codes that work for any alphabet size $q=2^m$, $m\\in\\mathbb{N}$, thus complementing some recently proposed packet-based schemes requiring large $q$. First, theoretical optimality of a simple layered scheme is shown, then a practical coding scheme based on a simple modification of standard binary LDPC decoding is proposed. The decoder is derived from first principles and using a factor-graph representation of a front-end that maps $q$-ary symbols to groups of $m$ bits connected to","authors_text":"Claudio Weidmann, Gottfried Lechner","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-10T18:17:30Z","title":"A Fresh Look at Coding for q-ary Symmetric Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.2009","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:0672d74874468819e53cfdb783bde9cd84a296dac3f52c80d82fa1893bc7a10c","target":"record","created_at":"2026-05-18T02:24:47Z","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":"2ca0bac55416b2337fef8f775e1ba50b8cf71ff87969f01a356e62224ab4d75b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-10T18:17:30Z","title_canon_sha256":"0a0a6e08f9030e8348b70b311378e02fbdeddf27654a76812f0ad471ca586c05"},"schema_version":"1.0","source":{"id":"0909.2009","kind":"arxiv","version":2}},"canonical_sha256":"508b4da5cab2b7003ca09177bae44fe007a4d1da717d148a2946d4c394609e5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"508b4da5cab2b7003ca09177bae44fe007a4d1da717d148a2946d4c394609e5b","first_computed_at":"2026-05-18T02:24:47.217915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:47.217915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oSKjfXXRUfQxSij+PrBFuhvAHj6R/kBRNyuZnqKi4B6nOo57jckZNJx0svuueHh6+O7xzo1qlUG/nweGcxxkAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:47.218702Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.2009","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0672d74874468819e53cfdb783bde9cd84a296dac3f52c80d82fa1893bc7a10c","sha256:6ebb2a4a14be00ab97f968c33de9fb4dfff9668d0827245610d5fefe3a9e11bd"],"state_sha256":"d41942623c417ad59e03ca5922c65631b2608ba2f1db0e95ca017877f6cffdeb"}