{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TXRTHO7A4U4HFDG2XK2SOS6XT4","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":"407f5bc53cd6d92fde80b0483bded1eea0c5a22d03b45cd07aed8c3a521f327d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-21T09:28:55Z","title_canon_sha256":"e6144dbf04fd1a77625249fbea3f0ae134f27c2f7a1b5ad15de9a989a04f5696"},"schema_version":"1.0","source":{"id":"2501.11993","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.11993","created_at":"2026-07-05T10:03:17Z"},{"alias_kind":"arxiv_version","alias_value":"2501.11993v1","created_at":"2026-07-05T10:03:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11993","created_at":"2026-07-05T10:03:17Z"},{"alias_kind":"pith_short_12","alias_value":"TXRTHO7A4U4H","created_at":"2026-07-05T10:03:17Z"},{"alias_kind":"pith_short_16","alias_value":"TXRTHO7A4U4HFDG2","created_at":"2026-07-05T10:03:17Z"},{"alias_kind":"pith_short_8","alias_value":"TXRTHO7A","created_at":"2026-07-05T10:03:17Z"}],"graph_snapshots":[{"event_id":"sha256:15e965f36ba07dab7339213c52f341e5dcaad3bf029dadbf51c219f3442efb4a","target":"graph","created_at":"2026-07-05T10:03:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.11993/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Low-density parity-check (LDPC) codes together with belief propagation (BP) decoding yield exceptional error correction capabilities in the large block length regime. Yet, there remains a gap between BP decoding and maximum likelihood decoding for short block length LDPC codes. In this context, ensemble decoding schemes yield both reduced latency and good error rates. In this paper, we propose subcode ensemble decoding (SCED), which employs an ensemble of decodings on different subcodes of the code. To ensure that all codewords are decodable, we use the concept of linear coverings and explore ","authors_text":"Holger J\\\"akel, Jonathan Mandelbaum, Laurent Schmalen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11993","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:faa18f113bf572428b333c65a5e98d8bce2f9e0667019d78cafa9f2a41424ea5","target":"record","created_at":"2026-07-05T10:03:17Z","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":"407f5bc53cd6d92fde80b0483bded1eea0c5a22d03b45cd07aed8c3a521f327d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-21T09:28:55Z","title_canon_sha256":"e6144dbf04fd1a77625249fbea3f0ae134f27c2f7a1b5ad15de9a989a04f5696"},"schema_version":"1.0","source":{"id":"2501.11993","kind":"arxiv","version":1}},"canonical_sha256":"9de333bbe0e538728cdabab5274bd79f21066e492e92cea7aa5d6994b5a6ea37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9de333bbe0e538728cdabab5274bd79f21066e492e92cea7aa5d6994b5a6ea37","first_computed_at":"2026-07-05T10:03:17.162012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:03:17.162012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b+wYEpYdUWSAPULh4CiRqAdPkGPz4vUnyVEGHQ8HJn8MPKrCos3Sagkd8Wfngx3I5KLTfTHqjJsPrCSXvN/nCA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:03:17.162531Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.11993","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faa18f113bf572428b333c65a5e98d8bce2f9e0667019d78cafa9f2a41424ea5","sha256:15e965f36ba07dab7339213c52f341e5dcaad3bf029dadbf51c219f3442efb4a"],"state_sha256":"e1039e5aadd22f812e85c90dc53fb7aa27829aaa4c580e675d7d9a1d6298e893"}