{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MK37VDOPHC4DGB3VR645HOZPOF","short_pith_number":"pith:MK37VDOP","canonical_record":{"source":{"id":"1905.10502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-05-25T02:46:19Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3d3b3f2703e5be354e64ab8982c03ee367a2c4d324d5440e7f3aece43da1026f","abstract_canon_sha256":"7e8dcc6304c459c32b57fcd0938f0edbab06e5c93e03a383cc0448961ae873f1"},"schema_version":"1.0"},"canonical_sha256":"62b7fa8dcf38b83307758fb9d3bb2f714a98b834b13795292121420a64656002","source":{"kind":"arxiv","id":"1905.10502","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10502","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10502v1","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10502","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"MK37VDOPHC4D","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MK37VDOPHC4DGB3V","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MK37VDOP","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MK37VDOPHC4DGB3VR645HOZPOF","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-05-25T02:46:19Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3d3b3f2703e5be354e64ab8982c03ee367a2c4d324d5440e7f3aece43da1026f","abstract_canon_sha256":"7e8dcc6304c459c32b57fcd0938f0edbab06e5c93e03a383cc0448961ae873f1"},"schema_version":"1.0"},"canonical_sha256":"62b7fa8dcf38b83307758fb9d3bb2f714a98b834b13795292121420a64656002","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:08.305964Z","signature_b64":"giDu4osjWyyrfHcz8zIw2SRUi3AX8fq7EPXAZb35I+EOuMHA+ktfVUTQLOR+WT/WLNZ+++G8tx4bCgfLKBdAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62b7fa8dcf38b83307758fb9d3bb2f714a98b834b13795292121420a64656002","last_reissued_at":"2026-05-17T23:45:08.305303Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:08.305303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10502","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+cQK8fH2bGGY/RJUui8ysNHxekR8REka7PXNmSXIqucw7UPS/evqRBRbpuk7NW1iiEKAgfNxgaH1CP4lECrJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:50:01.699748Z"},"content_sha256":"a06c57a3edca279b1b352142d3750db95a42875465f21fc4c3143450af78776c","schema_version":"1.0","event_id":"sha256:a06c57a3edca279b1b352142d3750db95a42875465f21fc4c3143450af78776c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MK37VDOPHC4DGB3VR645HOZPOF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TurboNet: A Model-driven DNN Decoder Based on Max-Log-MAP Algorithm for Turbo Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Chao-Kai Wen, Jing Zhang, Shi Jin, Yunfeng He","submitted_at":"2019-05-25T02:46:19Z","abstract_excerpt":"This paper presents TurboNet, a novel model-driven deep learning (DL) architecture for turbo decoding that combines DL with the traditional max-log-maximum a posteriori (MAP) algorithm. To design TurboNet, we unfold the original iterative structure for turbo decoding and replace each iteration by a deep neural network (DNN) decoding unit. In particular, the DNN decoding unit is obtained by parameterizing the max-log-MAP algorithm rather than replace the whole decoder with a black box fully connected DNN architecture. With the proposed architecture, the parameters can be efficiently learned fro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10502","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VaUnS1cdAnz5NnCcOyo6NAU7zatI5lw8XnWJp7lHNzxBYr4ctv5axLfGjVkUzbYuap5+f/wUpszB3fljAJbgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:50:01.700086Z"},"content_sha256":"876d88dba1acbb629385449d9fc6dd5031423b9b69e8ab66fc064da40c4f7858","schema_version":"1.0","event_id":"sha256:876d88dba1acbb629385449d9fc6dd5031423b9b69e8ab66fc064da40c4f7858"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MK37VDOPHC4DGB3VR645HOZPOF/bundle.json","state_url":"https://pith.science/pith/MK37VDOPHC4DGB3VR645HOZPOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MK37VDOPHC4DGB3VR645HOZPOF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T04:50:01Z","links":{"resolver":"https://pith.science/pith/MK37VDOPHC4DGB3VR645HOZPOF","bundle":"https://pith.science/pith/MK37VDOPHC4DGB3VR645HOZPOF/bundle.json","state":"https://pith.science/pith/MK37VDOPHC4DGB3VR645HOZPOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MK37VDOPHC4DGB3VR645HOZPOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MK37VDOPHC4DGB3VR645HOZPOF","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":"7e8dcc6304c459c32b57fcd0938f0edbab06e5c93e03a383cc0448961ae873f1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-05-25T02:46:19Z","title_canon_sha256":"3d3b3f2703e5be354e64ab8982c03ee367a2c4d324d5440e7f3aece43da1026f"},"schema_version":"1.0","source":{"id":"1905.10502","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10502","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10502v1","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10502","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"MK37VDOPHC4D","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MK37VDOPHC4DGB3V","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MK37VDOP","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:876d88dba1acbb629385449d9fc6dd5031423b9b69e8ab66fc064da40c4f7858","target":"graph","created_at":"2026-05-17T23:45:08Z","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 presents TurboNet, a novel model-driven deep learning (DL) architecture for turbo decoding that combines DL with the traditional max-log-maximum a posteriori (MAP) algorithm. To design TurboNet, we unfold the original iterative structure for turbo decoding and replace each iteration by a deep neural network (DNN) decoding unit. In particular, the DNN decoding unit is obtained by parameterizing the max-log-MAP algorithm rather than replace the whole decoder with a black box fully connected DNN architecture. With the proposed architecture, the parameters can be efficiently learned fro","authors_text":"Chao-Kai Wen, Jing Zhang, Shi Jin, Yunfeng He","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-05-25T02:46:19Z","title":"TurboNet: A Model-driven DNN Decoder Based on Max-Log-MAP Algorithm for Turbo Code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10502","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:a06c57a3edca279b1b352142d3750db95a42875465f21fc4c3143450af78776c","target":"record","created_at":"2026-05-17T23:45:08Z","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":"7e8dcc6304c459c32b57fcd0938f0edbab06e5c93e03a383cc0448961ae873f1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-05-25T02:46:19Z","title_canon_sha256":"3d3b3f2703e5be354e64ab8982c03ee367a2c4d324d5440e7f3aece43da1026f"},"schema_version":"1.0","source":{"id":"1905.10502","kind":"arxiv","version":1}},"canonical_sha256":"62b7fa8dcf38b83307758fb9d3bb2f714a98b834b13795292121420a64656002","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62b7fa8dcf38b83307758fb9d3bb2f714a98b834b13795292121420a64656002","first_computed_at":"2026-05-17T23:45:08.305303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:08.305303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"giDu4osjWyyrfHcz8zIw2SRUi3AX8fq7EPXAZb35I+EOuMHA+ktfVUTQLOR+WT/WLNZ+++G8tx4bCgfLKBdAAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:08.305964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10502","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a06c57a3edca279b1b352142d3750db95a42875465f21fc4c3143450af78776c","sha256:876d88dba1acbb629385449d9fc6dd5031423b9b69e8ab66fc064da40c4f7858"],"state_sha256":"eff1125468b4f5dbdf942faa80684e64e88218d0dbb28cf1675e34cd690c6c26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtUE7WT5ebiXKaHCdpE9H+NuvHRGjQyoSLez7rhqP2AC73X1+MKu+Tinw7atmlisomivp8YLVItyOsriaAxSDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:50:01.701988Z","bundle_sha256":"c32d33503f9620dce358ac58e1d812927f51f24dd669c4c2685cee1c5e22f91e"}}