{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:PGTH4TWTFEMCE25GMQGOZAFTLS","short_pith_number":"pith:PGTH4TWT","canonical_record":{"source":{"id":"1009.4352","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-22T13:13:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"192632fca30ae159268ea39158e79eb2653dec3a056acc24d099bb89f6994af5","abstract_canon_sha256":"b3d5e0bb2b54ea1effbcb212504eef2a9011633df6cb0964a56766a0b74b127f"},"schema_version":"1.0"},"canonical_sha256":"79a67e4ed32918226ba6640cec80b35ca32e62686da01ba30fb482edad974d89","source":{"kind":"arxiv","id":"1009.4352","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4352","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4352v2","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4352","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"PGTH4TWTFEMC","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PGTH4TWTFEMCE25G","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PGTH4TWT","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:PGTH4TWTFEMCE25GMQGOZAFTLS","target":"record","payload":{"canonical_record":{"source":{"id":"1009.4352","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-22T13:13:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"192632fca30ae159268ea39158e79eb2653dec3a056acc24d099bb89f6994af5","abstract_canon_sha256":"b3d5e0bb2b54ea1effbcb212504eef2a9011633df6cb0964a56766a0b74b127f"},"schema_version":"1.0"},"canonical_sha256":"79a67e4ed32918226ba6640cec80b35ca32e62686da01ba30fb482edad974d89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.361569Z","signature_b64":"ZwGgxe/kKiEAFaiv1kfR3amwFkkX31w7LDqy6d4YYcjkCRK76Asy0PLCog27AHhYvMfsQYshxiGUEaIB2rQuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79a67e4ed32918226ba6640cec80b35ca32e62686da01ba30fb482edad974d89","last_reissued_at":"2026-05-18T00:58:19.360858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.360858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.4352","source_version":2,"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-18T00:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/eECcDmZb6CnDk/yJ35lSbtn/noKkWFOj6eY0yF9rPfmtmWredSg68gh97lyGvshLEMvWXxJr/d/xWgMmHUaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:49:37.669132Z"},"content_sha256":"17a7188c56e7f4bda469da7ce513647461d7060dbd7d5ca421ab24abaf1fccc4","schema_version":"1.0","event_id":"sha256:17a7188c56e7f4bda469da7ce513647461d7060dbd7d5ca421ab24abaf1fccc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:PGTH4TWTFEMCE25GMQGOZAFTLS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Iterative Joint Linear-Programming Decoding of LDPC Codes and Finite-State Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Byung-Hak Kim, Henry D. Pfister","submitted_at":"2010-09-22T13:13:00Z","abstract_excerpt":"In this paper, we introduce an efficient iterative solver for the joint linear-programming (LP) decoding of low-density parity-check (LDPC) codes and finite-state channels (FSCs). In particular, we extend the approach of iterative approximate LP decoding, proposed by Vontobel and Koetter and explored by Burshtein, to this problem. By taking advantage of the dual-domain structure of the joint decoding LP, we obtain a convergent iterative algorithm for joint LP decoding whose structure is similar to BCJR-based turbo equalization (TE). The result is a joint iterative decoder whose complexity is s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4352","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":""},"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-18T00:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gXYVMVhBqMBxZGzYjnXC22673XSdW2ovrOM0Tf14Svqs0R0uRbVXSIjJ97XBbgMvZL6ROP3RAyGBky0/t9rBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:49:37.669818Z"},"content_sha256":"17a1109e26d5a7b4498e7c836c96089eae5aa7e33bb994896645c3dae3f584ea","schema_version":"1.0","event_id":"sha256:17a1109e26d5a7b4498e7c836c96089eae5aa7e33bb994896645c3dae3f584ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGTH4TWTFEMCE25GMQGOZAFTLS/bundle.json","state_url":"https://pith.science/pith/PGTH4TWTFEMCE25GMQGOZAFTLS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGTH4TWTFEMCE25GMQGOZAFTLS/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-05-27T13:49:37Z","links":{"resolver":"https://pith.science/pith/PGTH4TWTFEMCE25GMQGOZAFTLS","bundle":"https://pith.science/pith/PGTH4TWTFEMCE25GMQGOZAFTLS/bundle.json","state":"https://pith.science/pith/PGTH4TWTFEMCE25GMQGOZAFTLS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGTH4TWTFEMCE25GMQGOZAFTLS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PGTH4TWTFEMCE25GMQGOZAFTLS","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":"b3d5e0bb2b54ea1effbcb212504eef2a9011633df6cb0964a56766a0b74b127f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-22T13:13:00Z","title_canon_sha256":"192632fca30ae159268ea39158e79eb2653dec3a056acc24d099bb89f6994af5"},"schema_version":"1.0","source":{"id":"1009.4352","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4352","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4352v2","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4352","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"PGTH4TWTFEMC","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PGTH4TWTFEMCE25G","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PGTH4TWT","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:17a1109e26d5a7b4498e7c836c96089eae5aa7e33bb994896645c3dae3f584ea","target":"graph","created_at":"2026-05-18T00:58:19Z","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":"In this paper, we introduce an efficient iterative solver for the joint linear-programming (LP) decoding of low-density parity-check (LDPC) codes and finite-state channels (FSCs). In particular, we extend the approach of iterative approximate LP decoding, proposed by Vontobel and Koetter and explored by Burshtein, to this problem. By taking advantage of the dual-domain structure of the joint decoding LP, we obtain a convergent iterative algorithm for joint LP decoding whose structure is similar to BCJR-based turbo equalization (TE). The result is a joint iterative decoder whose complexity is s","authors_text":"Byung-Hak Kim, Henry D. Pfister","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-22T13:13:00Z","title":"An Iterative Joint Linear-Programming Decoding of LDPC Codes and Finite-State Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4352","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:17a7188c56e7f4bda469da7ce513647461d7060dbd7d5ca421ab24abaf1fccc4","target":"record","created_at":"2026-05-18T00:58:19Z","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":"b3d5e0bb2b54ea1effbcb212504eef2a9011633df6cb0964a56766a0b74b127f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-22T13:13:00Z","title_canon_sha256":"192632fca30ae159268ea39158e79eb2653dec3a056acc24d099bb89f6994af5"},"schema_version":"1.0","source":{"id":"1009.4352","kind":"arxiv","version":2}},"canonical_sha256":"79a67e4ed32918226ba6640cec80b35ca32e62686da01ba30fb482edad974d89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79a67e4ed32918226ba6640cec80b35ca32e62686da01ba30fb482edad974d89","first_computed_at":"2026-05-18T00:58:19.360858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.360858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZwGgxe/kKiEAFaiv1kfR3amwFkkX31w7LDqy6d4YYcjkCRK76Asy0PLCog27AHhYvMfsQYshxiGUEaIB2rQuDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.361569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4352","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17a7188c56e7f4bda469da7ce513647461d7060dbd7d5ca421ab24abaf1fccc4","sha256:17a1109e26d5a7b4498e7c836c96089eae5aa7e33bb994896645c3dae3f584ea"],"state_sha256":"9895e53b13de4dc8abaf88b2225c112e29b25e09e6550cf649479d36299cb45f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xDrL/MoBvYa+gJ54GVChR5o3XAHrk5k7oXEBHBcMoMmMDUK4CCflrghauhQHTTwMQ0mN4c7ngGzvDkzJ4WVDBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:49:37.673554Z","bundle_sha256":"e981514ea126174fa0da4920318cdcadec40ab35ac5891380786df9244e25b7c"}}