{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4O75SJNUK2ALG2YXZ5CNQ4VDRV","short_pith_number":"pith:4O75SJNU","canonical_record":{"source":{"id":"1209.2542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-12T10:03:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4900adb4f2fcba0d4d0e6acb36a79e4682789c779f0743bb2132afaf40ab5d8a","abstract_canon_sha256":"115657c58832fd12313fae52c5ed0d00b6c41f1d7770dd20d5c45d728cd09c7e"},"schema_version":"1.0"},"canonical_sha256":"e3bfd925b45680b36b17cf44d872a38d74da5b0fdb533ab07ec2d1ee84dfcc0a","source":{"kind":"arxiv","id":"1209.2542","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2542","created_at":"2026-05-18T03:45:42Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2542v1","created_at":"2026-05-18T03:45:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2542","created_at":"2026-05-18T03:45:42Z"},{"alias_kind":"pith_short_12","alias_value":"4O75SJNUK2AL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4O75SJNUK2ALG2YX","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4O75SJNU","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4O75SJNUK2ALG2YXZ5CNQ4VDRV","target":"record","payload":{"canonical_record":{"source":{"id":"1209.2542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-12T10:03:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4900adb4f2fcba0d4d0e6acb36a79e4682789c779f0743bb2132afaf40ab5d8a","abstract_canon_sha256":"115657c58832fd12313fae52c5ed0d00b6c41f1d7770dd20d5c45d728cd09c7e"},"schema_version":"1.0"},"canonical_sha256":"e3bfd925b45680b36b17cf44d872a38d74da5b0fdb533ab07ec2d1ee84dfcc0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:42.824402Z","signature_b64":"WcB5rSWVLIdmMYNa8eVjP8NY74Xfl5dyFH7oyCeVXPVwgJc3bak23cESIZGMcaIpPOxuR7zpBQQGiFCd3AOTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3bfd925b45680b36b17cf44d872a38d74da5b0fdb533ab07ec2d1ee84dfcc0a","last_reissued_at":"2026-05-18T03:45:42.823878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:42.823878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.2542","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-18T03:45:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RPyZsZ/Mn5NZdwMZ466aEeTbXbZ6EtBIlmpovelLss2LCwKTD3c1AvzQfoKaD2ovsAWt4QeYPTEhLLXsS1h2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:10:41.711975Z"},"content_sha256":"b94b0012fca263e970f5ef4efe02bc258e0f5c50e15c5c665a538072895cd243","schema_version":"1.0","event_id":"sha256:b94b0012fca263e970f5ef4efe02bc258e0f5c50e15c5c665a538072895cd243"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4O75SJNUK2ALG2YXZ5CNQ4VDRV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Detection/Decoding Algorithms for Nonbinary LDPC Codes over ISI Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baoming Bai, Shancheng Zhao, Xiao Ma, Zhifei Lu","submitted_at":"2012-09-12T10:03:01Z","abstract_excerpt":"This paper is concerned with the application of nonbinary low-density parity-check (NB-LDPC) codes to binary input inter-symbol interference (ISI) channels. Two low-complexity joint detection/decoding algorithms are proposed. One is referred to as max-log-MAP/X-EMS algorithm, which is implemented by exchanging soft messages between the max-log-MAP detector and the extended min-sum (EMS) decoder. The max-log-MAP/X-EMS algorithm is applicable to general NB-LDPC codes. The other one, referred to as Viterbi/GMLGD algorithm, is designed in particular for majority-logic decodable NB-LDPC codes. The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2542","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-18T03:45:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PuYgX1i7CzCWxvkjn+ILd/qGDSJH8XgFM66ZU5GdBGox9JU3lxslZO1tYRa1uSu/wbgJ57ohbiD4Ag9utoYwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:10:41.712714Z"},"content_sha256":"25578e5253d03a75a84465926bd43141110eb7448571d02faa20250563d27f41","schema_version":"1.0","event_id":"sha256:25578e5253d03a75a84465926bd43141110eb7448571d02faa20250563d27f41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4O75SJNUK2ALG2YXZ5CNQ4VDRV/bundle.json","state_url":"https://pith.science/pith/4O75SJNUK2ALG2YXZ5CNQ4VDRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4O75SJNUK2ALG2YXZ5CNQ4VDRV/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-30T23:10:41Z","links":{"resolver":"https://pith.science/pith/4O75SJNUK2ALG2YXZ5CNQ4VDRV","bundle":"https://pith.science/pith/4O75SJNUK2ALG2YXZ5CNQ4VDRV/bundle.json","state":"https://pith.science/pith/4O75SJNUK2ALG2YXZ5CNQ4VDRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4O75SJNUK2ALG2YXZ5CNQ4VDRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4O75SJNUK2ALG2YXZ5CNQ4VDRV","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":"115657c58832fd12313fae52c5ed0d00b6c41f1d7770dd20d5c45d728cd09c7e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-12T10:03:01Z","title_canon_sha256":"4900adb4f2fcba0d4d0e6acb36a79e4682789c779f0743bb2132afaf40ab5d8a"},"schema_version":"1.0","source":{"id":"1209.2542","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2542","created_at":"2026-05-18T03:45:42Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2542v1","created_at":"2026-05-18T03:45:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2542","created_at":"2026-05-18T03:45:42Z"},{"alias_kind":"pith_short_12","alias_value":"4O75SJNUK2AL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4O75SJNUK2ALG2YX","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4O75SJNU","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:25578e5253d03a75a84465926bd43141110eb7448571d02faa20250563d27f41","target":"graph","created_at":"2026-05-18T03:45:42Z","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 is concerned with the application of nonbinary low-density parity-check (NB-LDPC) codes to binary input inter-symbol interference (ISI) channels. Two low-complexity joint detection/decoding algorithms are proposed. One is referred to as max-log-MAP/X-EMS algorithm, which is implemented by exchanging soft messages between the max-log-MAP detector and the extended min-sum (EMS) decoder. The max-log-MAP/X-EMS algorithm is applicable to general NB-LDPC codes. The other one, referred to as Viterbi/GMLGD algorithm, is designed in particular for majority-logic decodable NB-LDPC codes. The ","authors_text":"Baoming Bai, Shancheng Zhao, Xiao Ma, Zhifei Lu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-12T10:03:01Z","title":"Joint Detection/Decoding Algorithms for Nonbinary LDPC Codes over ISI Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2542","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:b94b0012fca263e970f5ef4efe02bc258e0f5c50e15c5c665a538072895cd243","target":"record","created_at":"2026-05-18T03:45:42Z","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":"115657c58832fd12313fae52c5ed0d00b6c41f1d7770dd20d5c45d728cd09c7e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-12T10:03:01Z","title_canon_sha256":"4900adb4f2fcba0d4d0e6acb36a79e4682789c779f0743bb2132afaf40ab5d8a"},"schema_version":"1.0","source":{"id":"1209.2542","kind":"arxiv","version":1}},"canonical_sha256":"e3bfd925b45680b36b17cf44d872a38d74da5b0fdb533ab07ec2d1ee84dfcc0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3bfd925b45680b36b17cf44d872a38d74da5b0fdb533ab07ec2d1ee84dfcc0a","first_computed_at":"2026-05-18T03:45:42.823878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:42.823878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WcB5rSWVLIdmMYNa8eVjP8NY74Xfl5dyFH7oyCeVXPVwgJc3bak23cESIZGMcaIpPOxuR7zpBQQGiFCd3AOTCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:42.824402Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.2542","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b94b0012fca263e970f5ef4efe02bc258e0f5c50e15c5c665a538072895cd243","sha256:25578e5253d03a75a84465926bd43141110eb7448571d02faa20250563d27f41"],"state_sha256":"57944b61c4a3019cbd502970d3a5cdaa405daec48a2926144b38bda8fa3b9d63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0m2sJ3ipjtsUCC1P9bRWXQmJusc4PjvJendtiCpwaSSpd8H8YFoL6BSDu+cPUS91zttEx/Fga+LWWtYFsboeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:10:41.718028Z","bundle_sha256":"56c879e29df2308268392d3522f19ceec1e1b9d28cca457aaacb69d1b5151c2f"}}