{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XWSWNKWBTKAD7J2VIKYGNTTNTU","short_pith_number":"pith:XWSWNKWB","canonical_record":{"source":{"id":"1211.5757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-25T11:38:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e069f1a3c8efd6c3033d8a436625131580f88e10ec4040238cd0ce9363eee13d","abstract_canon_sha256":"7fab0e0915a9189b22681eb9d91b4e5707a2a044305a97ffdbc0a36fefacb81d"},"schema_version":"1.0"},"canonical_sha256":"bda566aac19a803fa75542b066ce6d9d217f6b0340497860036b598c1700b7bc","source":{"kind":"arxiv","id":"1211.5757","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5757","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5757v2","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5757","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"XWSWNKWBTKAD","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XWSWNKWBTKAD7J2V","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XWSWNKWB","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XWSWNKWBTKAD7J2VIKYGNTTNTU","target":"record","payload":{"canonical_record":{"source":{"id":"1211.5757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-25T11:38:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e069f1a3c8efd6c3033d8a436625131580f88e10ec4040238cd0ce9363eee13d","abstract_canon_sha256":"7fab0e0915a9189b22681eb9d91b4e5707a2a044305a97ffdbc0a36fefacb81d"},"schema_version":"1.0"},"canonical_sha256":"bda566aac19a803fa75542b066ce6d9d217f6b0340497860036b598c1700b7bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.775683Z","signature_b64":"QDgQxS08s22yijHRXVrDwa37wglfYXPAsSOHKeegbAeeaidezNwmMFXCg4Ai4l1Qs4RPp8pnpGYE5v51pN/4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bda566aac19a803fa75542b066ce6d9d217f6b0340497860036b598c1700b7bc","last_reissued_at":"2026-05-18T00:58:42.775271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.775271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.5757","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:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GJnsatQ+4ls4s5tntap8eEPkopEBbTFcy2cHvcG2Vie6pOj1QeqzD1Wk+zyWP41M+JvKm43JdHbuxSHCtz9uDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:05:35.370751Z"},"content_sha256":"0d030d508274ea141c20448c669bf8aaec592b71fffb6c4ed35d8e963085a920","schema_version":"1.0","event_id":"sha256:0d030d508274ea141c20448c669bf8aaec592b71fffb6c4ed35d8e963085a920"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XWSWNKWBTKAD7J2VIKYGNTTNTU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity LP Decoding of Nonbinary Linear Codes","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, Pascal O. Vontobel","submitted_at":"2012-11-25T11:38:12Z","abstract_excerpt":"Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. LP decoding has been derived for binary and nonbinary linear codes. However, the most important problem with LP decoding for both binary and nonbinary linear codes is that the complexity of standard LP solvers such as the simplex algorithm remains prohibitively large for codes of moderate to large block length. To address this problem, two low-complexity LP (LCLP) decoding algorithms for binary linear codes have been proposed by Vontobel and Ko"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5757","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:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZgF+ENdssFs4Of9P7wGpwerjDQApw+ni603/Cd6VEAn+DuxA7yzOiHRM5/uKYyFjCG9OXnaSh6jt4A/93AFJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:05:35.371443Z"},"content_sha256":"4c439b26974043878d342074cb40938df98c88c2ccf05337357ff674bf6e49d0","schema_version":"1.0","event_id":"sha256:4c439b26974043878d342074cb40938df98c88c2ccf05337357ff674bf6e49d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWSWNKWBTKAD7J2VIKYGNTTNTU/bundle.json","state_url":"https://pith.science/pith/XWSWNKWBTKAD7J2VIKYGNTTNTU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWSWNKWBTKAD7J2VIKYGNTTNTU/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-26T18:05:35Z","links":{"resolver":"https://pith.science/pith/XWSWNKWBTKAD7J2VIKYGNTTNTU","bundle":"https://pith.science/pith/XWSWNKWBTKAD7J2VIKYGNTTNTU/bundle.json","state":"https://pith.science/pith/XWSWNKWBTKAD7J2VIKYGNTTNTU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWSWNKWBTKAD7J2VIKYGNTTNTU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XWSWNKWBTKAD7J2VIKYGNTTNTU","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":"7fab0e0915a9189b22681eb9d91b4e5707a2a044305a97ffdbc0a36fefacb81d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-25T11:38:12Z","title_canon_sha256":"e069f1a3c8efd6c3033d8a436625131580f88e10ec4040238cd0ce9363eee13d"},"schema_version":"1.0","source":{"id":"1211.5757","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5757","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5757v2","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5757","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"XWSWNKWBTKAD","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XWSWNKWBTKAD7J2V","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XWSWNKWB","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:4c439b26974043878d342074cb40938df98c88c2ccf05337357ff674bf6e49d0","target":"graph","created_at":"2026-05-18T00:58: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":"Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. LP decoding has been derived for binary and nonbinary linear codes. However, the most important problem with LP decoding for both binary and nonbinary linear codes is that the complexity of standard LP solvers such as the simplex algorithm remains prohibitively large for codes of moderate to large block length. To address this problem, two low-complexity LP (LCLP) decoding algorithms for binary linear codes have been proposed by Vontobel and Ko","authors_text":"Mark F. Flanagan, Mayur Punekar, Pascal O. Vontobel","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-25T11:38:12Z","title":"Low-Complexity LP Decoding of Nonbinary Linear Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5757","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:0d030d508274ea141c20448c669bf8aaec592b71fffb6c4ed35d8e963085a920","target":"record","created_at":"2026-05-18T00:58: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":"7fab0e0915a9189b22681eb9d91b4e5707a2a044305a97ffdbc0a36fefacb81d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-25T11:38:12Z","title_canon_sha256":"e069f1a3c8efd6c3033d8a436625131580f88e10ec4040238cd0ce9363eee13d"},"schema_version":"1.0","source":{"id":"1211.5757","kind":"arxiv","version":2}},"canonical_sha256":"bda566aac19a803fa75542b066ce6d9d217f6b0340497860036b598c1700b7bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bda566aac19a803fa75542b066ce6d9d217f6b0340497860036b598c1700b7bc","first_computed_at":"2026-05-18T00:58:42.775271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:42.775271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QDgQxS08s22yijHRXVrDwa37wglfYXPAsSOHKeegbAeeaidezNwmMFXCg4Ai4l1Qs4RPp8pnpGYE5v51pN/4BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:42.775683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5757","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d030d508274ea141c20448c669bf8aaec592b71fffb6c4ed35d8e963085a920","sha256:4c439b26974043878d342074cb40938df98c88c2ccf05337357ff674bf6e49d0"],"state_sha256":"1630a7c5afc8d465c05bc1e117987ed87b3cb2bdc1c83559ed054efa0f12bf4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zUovo63oYRpP68QkO3piz17ka6GyeVMLvUMDCz770GRWZBlW0Mg6rmvXZUCLrtzPcZRY7XiWT+7qBYgTgCS4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:05:35.374795Z","bundle_sha256":"597715fda84d38d60d054f5abefa473060507fb3bc7ba68d43e4ceff1be78ae5"}}