{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OYPAPRI26Z2U3U23GKJAYVLUFU","short_pith_number":"pith:OYPAPRI2","canonical_record":{"source":{"id":"1102.3390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T18:13:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8b019ec091f9cc324475e05c5437f8b4bec13646f1cf8620f0936de2b465cef0","abstract_canon_sha256":"dcc6c4c6221c64e26b599dbb357c3994b68a612eb14a9dc1e1637e5dab603f76"},"schema_version":"1.0"},"canonical_sha256":"761e07c51af6754dd35b32920c55742d0f7d14ba1f62c91029280010c8eaa5e8","source":{"kind":"arxiv","id":"1102.3390","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3390","created_at":"2026-05-18T04:28:30Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3390v1","created_at":"2026-05-18T04:28:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3390","created_at":"2026-05-18T04:28:30Z"},{"alias_kind":"pith_short_12","alias_value":"OYPAPRI26Z2U","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OYPAPRI26Z2U3U23","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OYPAPRI2","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OYPAPRI26Z2U3U23GKJAYVLUFU","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T18:13:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8b019ec091f9cc324475e05c5437f8b4bec13646f1cf8620f0936de2b465cef0","abstract_canon_sha256":"dcc6c4c6221c64e26b599dbb357c3994b68a612eb14a9dc1e1637e5dab603f76"},"schema_version":"1.0"},"canonical_sha256":"761e07c51af6754dd35b32920c55742d0f7d14ba1f62c91029280010c8eaa5e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:30.338405Z","signature_b64":"KihytzDx01YjR/Xj6LGoXOUezpoJTpf3kX69gH5O9vs6/2dw5EKfdcCEyvqu3vu7qgA629eFUn2yG1lvtd8HDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"761e07c51af6754dd35b32920c55742d0f7d14ba1f62c91029280010c8eaa5e8","last_reissued_at":"2026-05-18T04:28:30.337979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:30.337979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3390","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-18T04:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omdPiprr7D++umtYLvCY3y/tgcvc617bgHQecxyao6/UHYdKuTq7j1ZU6UZYTEI0CKlOUM/AF+B7YbZb1U8YCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:24:03.493506Z"},"content_sha256":"69e7f458d5e8856b43bf02567f60c9827f500de41ca0b8bde5780bb8ec697630","schema_version":"1.0","event_id":"sha256:69e7f458d5e8856b43bf02567f60c9827f500de41ca0b8bde5780bb8ec697630"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OYPAPRI26Z2U3U23GKJAYVLUFU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Trellis-Based Check Node Processing for Low-Complexity Nonbinary LP Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mark F. Flanagan, Mayur Punekar","submitted_at":"2011-02-16T18:13:38Z","abstract_excerpt":"Linear Programming (LP) decoding is emerging as an attractive alternative to decode Low-Density Parity-Check (LDPC) codes. However, the earliest LP decoders proposed for binary and nonbinary LDPC codes are not suitable for use at moderate and large code lengths. To overcome this problem, Vontobel et al. developed an iterative Low-Complexity LP (LCLP) decoding algorithm for binary LDPC codes. The variable and check node calculations of binary LCLP decoding algorithm are related to those of binary Belief Propagation (BP). The present authors generalized this work to derive an iterative LCLP deco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3390","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-18T04:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tIwc6JouFoERIq0gKOLbORR+7N3JSV1uzbe9/6wI1kK23/EayupKwLJ6YjBg7u7yAiQXDoNYSF18ohvxIE4sDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:24:03.494216Z"},"content_sha256":"3e95723f797b9a650d9674ca80782717deee9160577359a40424d6b5c757bd65","schema_version":"1.0","event_id":"sha256:3e95723f797b9a650d9674ca80782717deee9160577359a40424d6b5c757bd65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYPAPRI26Z2U3U23GKJAYVLUFU/bundle.json","state_url":"https://pith.science/pith/OYPAPRI26Z2U3U23GKJAYVLUFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYPAPRI26Z2U3U23GKJAYVLUFU/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-08T03:24:03Z","links":{"resolver":"https://pith.science/pith/OYPAPRI26Z2U3U23GKJAYVLUFU","bundle":"https://pith.science/pith/OYPAPRI26Z2U3U23GKJAYVLUFU/bundle.json","state":"https://pith.science/pith/OYPAPRI26Z2U3U23GKJAYVLUFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYPAPRI26Z2U3U23GKJAYVLUFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OYPAPRI26Z2U3U23GKJAYVLUFU","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":"dcc6c4c6221c64e26b599dbb357c3994b68a612eb14a9dc1e1637e5dab603f76","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T18:13:38Z","title_canon_sha256":"8b019ec091f9cc324475e05c5437f8b4bec13646f1cf8620f0936de2b465cef0"},"schema_version":"1.0","source":{"id":"1102.3390","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3390","created_at":"2026-05-18T04:28:30Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3390v1","created_at":"2026-05-18T04:28:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3390","created_at":"2026-05-18T04:28:30Z"},{"alias_kind":"pith_short_12","alias_value":"OYPAPRI26Z2U","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OYPAPRI26Z2U3U23","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OYPAPRI2","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:3e95723f797b9a650d9674ca80782717deee9160577359a40424d6b5c757bd65","target":"graph","created_at":"2026-05-18T04:28:30Z","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":"Linear Programming (LP) decoding is emerging as an attractive alternative to decode Low-Density Parity-Check (LDPC) codes. However, the earliest LP decoders proposed for binary and nonbinary LDPC codes are not suitable for use at moderate and large code lengths. To overcome this problem, Vontobel et al. developed an iterative Low-Complexity LP (LCLP) decoding algorithm for binary LDPC codes. The variable and check node calculations of binary LCLP decoding algorithm are related to those of binary Belief Propagation (BP). The present authors generalized this work to derive an iterative LCLP deco","authors_text":"Mark F. Flanagan, Mayur Punekar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T18:13:38Z","title":"Trellis-Based Check Node Processing for Low-Complexity Nonbinary LP Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3390","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:69e7f458d5e8856b43bf02567f60c9827f500de41ca0b8bde5780bb8ec697630","target":"record","created_at":"2026-05-18T04:28:30Z","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":"dcc6c4c6221c64e26b599dbb357c3994b68a612eb14a9dc1e1637e5dab603f76","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T18:13:38Z","title_canon_sha256":"8b019ec091f9cc324475e05c5437f8b4bec13646f1cf8620f0936de2b465cef0"},"schema_version":"1.0","source":{"id":"1102.3390","kind":"arxiv","version":1}},"canonical_sha256":"761e07c51af6754dd35b32920c55742d0f7d14ba1f62c91029280010c8eaa5e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"761e07c51af6754dd35b32920c55742d0f7d14ba1f62c91029280010c8eaa5e8","first_computed_at":"2026-05-18T04:28:30.337979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:30.337979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KihytzDx01YjR/Xj6LGoXOUezpoJTpf3kX69gH5O9vs6/2dw5EKfdcCEyvqu3vu7qgA629eFUn2yG1lvtd8HDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:30.338405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3390","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69e7f458d5e8856b43bf02567f60c9827f500de41ca0b8bde5780bb8ec697630","sha256:3e95723f797b9a650d9674ca80782717deee9160577359a40424d6b5c757bd65"],"state_sha256":"9e07bea13dcb7b09e0c9e67cac392867908b4014709d22c632eb5a13e1516abe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5JQKdlyTBQdGP6n1kDGa/ei/qzzlhQg4l9UU1IN2IZKZbjqZFYtp2H+2iq8j1IGFZ7eSdXZ7JEsbHd6BGcu6Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:24:03.497786Z","bundle_sha256":"6203a2d6497a03aac727142f79ba6f6f1c6dd76596bc5aa0a919b64cb87b667b"}}