{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AAYVG6MGDCUG4OJL3MGHKJMRL6","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":"e6fef8bf8b0f20c1b6046d51cd76ac1f05f91ed0a6ee55400d5aa7a404677e2b","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-22T07:48:24Z","title_canon_sha256":"c6915f113bd891aaabf3fa7d5f443962f55407127bfc7e0e0ec9df664fc9e6bd"},"schema_version":"1.0","source":{"id":"2405.13413","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.13413","created_at":"2026-07-05T09:35:32Z"},{"alias_kind":"arxiv_version","alias_value":"2405.13413v2","created_at":"2026-07-05T09:35:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.13413","created_at":"2026-07-05T09:35:32Z"},{"alias_kind":"pith_short_12","alias_value":"AAYVG6MGDCUG","created_at":"2026-07-05T09:35:32Z"},{"alias_kind":"pith_short_16","alias_value":"AAYVG6MGDCUG4OJL","created_at":"2026-07-05T09:35:32Z"},{"alias_kind":"pith_short_8","alias_value":"AAYVG6MG","created_at":"2026-07-05T09:35:32Z"}],"graph_snapshots":[{"event_id":"sha256:6b22aa4b0141c3301bc61ee675f78adf4c1debe9bbe1292dfe8fe3b37bdf42e5","target":"graph","created_at":"2026-07-05T09:35:32Z","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/2405.13413/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ensuring extremely high reliability in channel coding is essential for 6G networks. The next-generation of ultra-reliable and low-latency communications (xURLLC) scenario within 6G networks requires frame error rate (FER) below $10^{-9}$. However, low-density parity-check (LDPC) codes, the standard in 5G new radio (NR), encounter a challenge known as the error floor phenomenon, which hinders to achieve such low rates. To tackle this problem, we introduce an innovative solution: boosted neural min-sum (NMS) decoder. This decoder operates identically to conventional NMS decoders, but is trained ","authors_text":"Dae-Young Yun, Hee-Youl Kwak, Jong-Seon No, Sang-Hyo Kim, Yongjune Kim","cross_cats":["cs.LG","eess.SP","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-22T07:48:24Z","title":"Boosted Neural Decoders: Achieving Extreme Reliability of LDPC Codes for 6G Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.13413","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:a524520135c832971785bffdf1ac4b6a660ab7753d229f25820bb987db785240","target":"record","created_at":"2026-07-05T09:35:32Z","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":"e6fef8bf8b0f20c1b6046d51cd76ac1f05f91ed0a6ee55400d5aa7a404677e2b","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-22T07:48:24Z","title_canon_sha256":"c6915f113bd891aaabf3fa7d5f443962f55407127bfc7e0e0ec9df664fc9e6bd"},"schema_version":"1.0","source":{"id":"2405.13413","kind":"arxiv","version":2}},"canonical_sha256":"003153798618a86e392bdb0c7525915f9c6b0ea176b5338204038d4cfae469d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"003153798618a86e392bdb0c7525915f9c6b0ea176b5338204038d4cfae469d1","first_computed_at":"2026-07-05T09:35:32.830056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:35:32.830056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"88LHzDSGtRUqwtfgFGKRP77YOuQUXIFUylDmZ8JEx5aXpgMWwnLNh6wxCBSZeVz3MzfeQo/PAOsQonFHhy4DDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:35:32.830503Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.13413","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a524520135c832971785bffdf1ac4b6a660ab7753d229f25820bb987db785240","sha256:6b22aa4b0141c3301bc61ee675f78adf4c1debe9bbe1292dfe8fe3b37bdf42e5"],"state_sha256":"231ac6e38ef637f5faf6cb7d00bf770e3141f3a5dead27abd8dd685c819059ab"}