{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Z3WY2U7RPSUGVNGPMDCUC6263T","short_pith_number":"pith:Z3WY2U7R","canonical_record":{"source":{"id":"1102.1480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-08T00:21:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dd0af6505aaaed042cf537284103bade7c6283933ec902080f47e3f983dc172a","abstract_canon_sha256":"53e25312a8cb25a30c155dfcb276ee36e4b87c479422d79dff93cdac0ea2c275"},"schema_version":"1.0"},"canonical_sha256":"ceed8d53f17ca86ab4cf60c5417b5edceabb2fb9a81ce0fdb069a3fca593114a","source":{"kind":"arxiv","id":"1102.1480","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1480","created_at":"2026-05-18T02:03:15Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1480v2","created_at":"2026-05-18T02:03:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1480","created_at":"2026-05-18T02:03:15Z"},{"alias_kind":"pith_short_12","alias_value":"Z3WY2U7RPSUG","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Z3WY2U7RPSUGVNGP","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Z3WY2U7R","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Z3WY2U7RPSUGVNGPMDCUC6263T","target":"record","payload":{"canonical_record":{"source":{"id":"1102.1480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-08T00:21:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dd0af6505aaaed042cf537284103bade7c6283933ec902080f47e3f983dc172a","abstract_canon_sha256":"53e25312a8cb25a30c155dfcb276ee36e4b87c479422d79dff93cdac0ea2c275"},"schema_version":"1.0"},"canonical_sha256":"ceed8d53f17ca86ab4cf60c5417b5edceabb2fb9a81ce0fdb069a3fca593114a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:15.630750Z","signature_b64":"10/1VzOzws77cduigiFhYBqkNBthVCCt6//j/FozS3jvqd+4IpV/XThzqmxQ/GPRvNEEE8Gtpr/jir+jxNSLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceed8d53f17ca86ab4cf60c5417b5edceabb2fb9a81ce0fdb069a3fca593114a","last_reissued_at":"2026-05-18T02:03:15.630269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:15.630269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.1480","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-18T02:03:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OzkYR4O0go1umlRxo5A8AVfwv/0C+GNMi8CXTqFkJiy/mtIVP0T3IVvQBykJ4oWNl9WfvqBgpl/+SbMEprAQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:52:52.563728Z"},"content_sha256":"642659f8e1c43969921e6766ff98bc8c1d1848afb4e5121a4f5e10b865729b65","schema_version":"1.0","event_id":"sha256:642659f8e1c43969921e6766ff98bc8c1d1848afb4e5121a4f5e10b865729b65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Z3WY2U7RPSUGVNGPMDCUC6263T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Decoding of LDPC Codes and Finite-State Channels via Linear-Programming","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":"2011-02-08T00:21:38Z","abstract_excerpt":"This paper considers the joint-decoding (JD) problem for finite-state channels (FSCs) and low-density parity-check (LDPC) codes. In the first part, the linear-programming (LP) decoder for binary linear codes is extended to JD of binary-input FSCs. In particular, we provide a rigorous definition of LP joint-decoding pseudo-codewords (JD-PCWs) that enables evaluation of the pairwise error probability between codewords and JD-PCWs in AWGN. This leads naturally to a provable upper bound on decoder failure probability. If the channel is a finite-state intersymbol interference channel, then the join"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1480","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-18T02:03:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vjEDNLUMr7S4+44Xi7UZD+oUoJHBizDOpVG8tlhPvqR1FPkkDiMFJCAyD//t3D4yn25IJtLEWuzCEuuTgE6fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:52:52.564085Z"},"content_sha256":"0d36f4d6826835ce268294ccf26c4e9ab0b4707efadabd6320eb811a7042584d","schema_version":"1.0","event_id":"sha256:0d36f4d6826835ce268294ccf26c4e9ab0b4707efadabd6320eb811a7042584d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z3WY2U7RPSUGVNGPMDCUC6263T/bundle.json","state_url":"https://pith.science/pith/Z3WY2U7RPSUGVNGPMDCUC6263T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z3WY2U7RPSUGVNGPMDCUC6263T/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-27T11:52:52Z","links":{"resolver":"https://pith.science/pith/Z3WY2U7RPSUGVNGPMDCUC6263T","bundle":"https://pith.science/pith/Z3WY2U7RPSUGVNGPMDCUC6263T/bundle.json","state":"https://pith.science/pith/Z3WY2U7RPSUGVNGPMDCUC6263T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z3WY2U7RPSUGVNGPMDCUC6263T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Z3WY2U7RPSUGVNGPMDCUC6263T","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":"53e25312a8cb25a30c155dfcb276ee36e4b87c479422d79dff93cdac0ea2c275","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-08T00:21:38Z","title_canon_sha256":"dd0af6505aaaed042cf537284103bade7c6283933ec902080f47e3f983dc172a"},"schema_version":"1.0","source":{"id":"1102.1480","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1480","created_at":"2026-05-18T02:03:15Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1480v2","created_at":"2026-05-18T02:03:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1480","created_at":"2026-05-18T02:03:15Z"},{"alias_kind":"pith_short_12","alias_value":"Z3WY2U7RPSUG","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Z3WY2U7RPSUGVNGP","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Z3WY2U7R","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:0d36f4d6826835ce268294ccf26c4e9ab0b4707efadabd6320eb811a7042584d","target":"graph","created_at":"2026-05-18T02:03:15Z","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 considers the joint-decoding (JD) problem for finite-state channels (FSCs) and low-density parity-check (LDPC) codes. In the first part, the linear-programming (LP) decoder for binary linear codes is extended to JD of binary-input FSCs. In particular, we provide a rigorous definition of LP joint-decoding pseudo-codewords (JD-PCWs) that enables evaluation of the pairwise error probability between codewords and JD-PCWs in AWGN. This leads naturally to a provable upper bound on decoder failure probability. If the channel is a finite-state intersymbol interference channel, then the join","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":"2011-02-08T00:21:38Z","title":"Joint Decoding of LDPC Codes and Finite-State Channels via Linear-Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1480","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:642659f8e1c43969921e6766ff98bc8c1d1848afb4e5121a4f5e10b865729b65","target":"record","created_at":"2026-05-18T02:03:15Z","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":"53e25312a8cb25a30c155dfcb276ee36e4b87c479422d79dff93cdac0ea2c275","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-08T00:21:38Z","title_canon_sha256":"dd0af6505aaaed042cf537284103bade7c6283933ec902080f47e3f983dc172a"},"schema_version":"1.0","source":{"id":"1102.1480","kind":"arxiv","version":2}},"canonical_sha256":"ceed8d53f17ca86ab4cf60c5417b5edceabb2fb9a81ce0fdb069a3fca593114a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ceed8d53f17ca86ab4cf60c5417b5edceabb2fb9a81ce0fdb069a3fca593114a","first_computed_at":"2026-05-18T02:03:15.630269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:15.630269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"10/1VzOzws77cduigiFhYBqkNBthVCCt6//j/FozS3jvqd+4IpV/XThzqmxQ/GPRvNEEE8Gtpr/jir+jxNSLDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:15.630750Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1480","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:642659f8e1c43969921e6766ff98bc8c1d1848afb4e5121a4f5e10b865729b65","sha256:0d36f4d6826835ce268294ccf26c4e9ab0b4707efadabd6320eb811a7042584d"],"state_sha256":"02638cb58a272dcb3679ffeb3bb80d9b4930ac16fad9a25cd035cd703e9e94d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"avhup+5I1tv8HaAb/6swGWOiIFvzuP6+jAbkn7vOwTPPaJiAhdCuWeI40AECOu2UnN8hgwrmwIEO4TNyEIoKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:52:52.566900Z","bundle_sha256":"796bd2eb78f1b36f71f1fb8e352edbbc321e84e8d42d5b5d3ae02d09d9d806b0"}}