{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AAYVG6MGDCUG4OJL3MGHKJMRL6","short_pith_number":"pith:AAYVG6MG","schema_version":"1.0","canonical_sha256":"003153798618a86e392bdb0c7525915f9c6b0ea176b5338204038d4cfae469d1","source":{"kind":"arxiv","id":"2405.13413","version":2},"attestation_state":"computed","paper":{"title":"Boosted Neural Decoders: Achieving Extreme Reliability of LDPC Codes for 6G Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Dae-Young Yun, Hee-Youl Kwak, Jong-Seon No, Sang-Hyo Kim, Yongjune Kim","submitted_at":"2024-05-22T07:48:24Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2405.13413","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-22T07:48:24Z","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"title_canon_sha256":"c6915f113bd891aaabf3fa7d5f443962f55407127bfc7e0e0ec9df664fc9e6bd","abstract_canon_sha256":"e6fef8bf8b0f20c1b6046d51cd76ac1f05f91ed0a6ee55400d5aa7a404677e2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:35:32.830503Z","signature_b64":"88LHzDSGtRUqwtfgFGKRP77YOuQUXIFUylDmZ8JEx5aXpgMWwnLNh6wxCBSZeVz3MzfeQo/PAOsQonFHhy4DDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"003153798618a86e392bdb0c7525915f9c6b0ea176b5338204038d4cfae469d1","last_reissued_at":"2026-07-05T09:35:32.830056Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:35:32.830056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boosted Neural Decoders: Achieving Extreme Reliability of LDPC Codes for 6G Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Dae-Young Yun, Hee-Youl Kwak, Jong-Seon No, Sang-Hyo Kim, Yongjune Kim","submitted_at":"2024-05-22T07:48:24Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.13413","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.13413/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2405.13413","created_at":"2026-07-05T09:35:32.830118+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.13413v2","created_at":"2026-07-05T09:35:32.830118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.13413","created_at":"2026-07-05T09:35:32.830118+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAYVG6MGDCUG","created_at":"2026-07-05T09:35:32.830118+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAYVG6MGDCUG4OJL","created_at":"2026-07-05T09:35:32.830118+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAYVG6MG","created_at":"2026-07-05T09:35:32.830118+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.06622","citing_title":"FuDoBa: Fusing Document and Knowledge Graph-based Representations with Bayesian Optimisation","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AAYVG6MGDCUG4OJL3MGHKJMRL6","json":"https://pith.science/pith/AAYVG6MGDCUG4OJL3MGHKJMRL6.json","graph_json":"https://pith.science/api/pith-number/AAYVG6MGDCUG4OJL3MGHKJMRL6/graph.json","events_json":"https://pith.science/api/pith-number/AAYVG6MGDCUG4OJL3MGHKJMRL6/events.json","paper":"https://pith.science/paper/AAYVG6MG"},"agent_actions":{"view_html":"https://pith.science/pith/AAYVG6MGDCUG4OJL3MGHKJMRL6","download_json":"https://pith.science/pith/AAYVG6MGDCUG4OJL3MGHKJMRL6.json","view_paper":"https://pith.science/paper/AAYVG6MG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.13413&json=true","fetch_graph":"https://pith.science/api/pith-number/AAYVG6MGDCUG4OJL3MGHKJMRL6/graph.json","fetch_events":"https://pith.science/api/pith-number/AAYVG6MGDCUG4OJL3MGHKJMRL6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAYVG6MGDCUG4OJL3MGHKJMRL6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAYVG6MGDCUG4OJL3MGHKJMRL6/action/storage_attestation","attest_author":"https://pith.science/pith/AAYVG6MGDCUG4OJL3MGHKJMRL6/action/author_attestation","sign_citation":"https://pith.science/pith/AAYVG6MGDCUG4OJL3MGHKJMRL6/action/citation_signature","submit_replication":"https://pith.science/pith/AAYVG6MGDCUG4OJL3MGHKJMRL6/action/replication_record"}},"created_at":"2026-07-05T09:35:32.830118+00:00","updated_at":"2026-07-05T09:35:32.830118+00:00"}