{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4OJ67HDZVRG2PU5AV3NYVPVWSO","short_pith_number":"pith:4OJ67HDZ","canonical_record":{"source":{"id":"1409.5141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-17T20:40:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3690742c66de95be808cfb44c23fbec64c631cece919ad619d25343525cd6e8e","abstract_canon_sha256":"d88c13f932e4306197feab771f3be61f250098fc3ef7ac52a2c1e44bf8c5e0db"},"schema_version":"1.0"},"canonical_sha256":"e393ef9c79ac4da7d3a0aedb8abeb693ad23f646f5b1d80d0bfe704c6226d2b0","source":{"kind":"arxiv","id":"1409.5141","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5141","created_at":"2026-05-18T01:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5141v2","created_at":"2026-05-18T01:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5141","created_at":"2026-05-18T01:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"4OJ67HDZVRG2","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4OJ67HDZVRG2PU5A","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4OJ67HDZ","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4OJ67HDZVRG2PU5AV3NYVPVWSO","target":"record","payload":{"canonical_record":{"source":{"id":"1409.5141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-17T20:40:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3690742c66de95be808cfb44c23fbec64c631cece919ad619d25343525cd6e8e","abstract_canon_sha256":"d88c13f932e4306197feab771f3be61f250098fc3ef7ac52a2c1e44bf8c5e0db"},"schema_version":"1.0"},"canonical_sha256":"e393ef9c79ac4da7d3a0aedb8abeb693ad23f646f5b1d80d0bfe704c6226d2b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:13.959018Z","signature_b64":"9ceRsdvx/E0pJrKj3OLG4MTxl35xalBj/rbEZQAU2s8qZ9Ht9N+6QRlt+9q53Wq98JWQXI9RCI7TDNkDGK/iDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e393ef9c79ac4da7d3a0aedb8abeb693ad23f646f5b1d80d0bfe704c6226d2b0","last_reissued_at":"2026-05-18T01:36:13.958526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:13.958526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.5141","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-18T01:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gu0smVX/x334VqXX8J6MHDu4Lrm0usMQuFe6CfZYpKC1G+9+QM1UwpchscAilLLdViLuqKY0GpCjJOjJ1hnBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:47:03.917742Z"},"content_sha256":"2a334d5e8f95db985685d1a1e92a6403951ec1d21312e1c682014274e3141659","schema_version":"1.0","event_id":"sha256:2a334d5e8f95db985685d1a1e92a6403951ec1d21312e1c682014274e3141659"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4OJ67HDZVRG2PU5AV3NYVPVWSO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ADMM LP decoding of non-binary LDPC codes in $\\mathbb{F}_{2^m}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Stark C. Draper, Xishuo Liu","submitted_at":"2014-09-17T20:40:47Z","abstract_excerpt":"In this paper, we develop efficient decoders for non-binary low-density parity-check (LDPC) codes using the alternating direction method of multipliers (ADMM). We apply ADMM to two decoding problems. The first problem is linear programming (LP) decoding. In order to develop an efficient algorithm, we focus on non-binary codes in fields of characteristic two. This allows us to transform each constraint in $\\mathbb{F}_{2^m}$ to a set of constraints in $\\mathbb{F}_{2}$ that has a factor graph representation. Applying ADMM to the LP decoding problem results in two types of non-trivial sub-routines"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5141","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-18T01:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9a5Ox9FAKd6k79S1C4ybp7/mR3EP3Hd9rjVaG88CvTTyV+C/Si2+4dAxkSAU/DFlzBJqZeOAn6SUpoG/b1EMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:47:03.918091Z"},"content_sha256":"40a1247d727947853ddc9399583d2a519d4e4b6a846ba490ab15cd390d32e8b6","schema_version":"1.0","event_id":"sha256:40a1247d727947853ddc9399583d2a519d4e4b6a846ba490ab15cd390d32e8b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4OJ67HDZVRG2PU5AV3NYVPVWSO/bundle.json","state_url":"https://pith.science/pith/4OJ67HDZVRG2PU5AV3NYVPVWSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4OJ67HDZVRG2PU5AV3NYVPVWSO/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-05T00:47:03Z","links":{"resolver":"https://pith.science/pith/4OJ67HDZVRG2PU5AV3NYVPVWSO","bundle":"https://pith.science/pith/4OJ67HDZVRG2PU5AV3NYVPVWSO/bundle.json","state":"https://pith.science/pith/4OJ67HDZVRG2PU5AV3NYVPVWSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4OJ67HDZVRG2PU5AV3NYVPVWSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4OJ67HDZVRG2PU5AV3NYVPVWSO","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":"d88c13f932e4306197feab771f3be61f250098fc3ef7ac52a2c1e44bf8c5e0db","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-17T20:40:47Z","title_canon_sha256":"3690742c66de95be808cfb44c23fbec64c631cece919ad619d25343525cd6e8e"},"schema_version":"1.0","source":{"id":"1409.5141","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5141","created_at":"2026-05-18T01:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5141v2","created_at":"2026-05-18T01:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5141","created_at":"2026-05-18T01:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"4OJ67HDZVRG2","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4OJ67HDZVRG2PU5A","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4OJ67HDZ","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:40a1247d727947853ddc9399583d2a519d4e4b6a846ba490ab15cd390d32e8b6","target":"graph","created_at":"2026-05-18T01:36:13Z","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 develop efficient decoders for non-binary low-density parity-check (LDPC) codes using the alternating direction method of multipliers (ADMM). We apply ADMM to two decoding problems. The first problem is linear programming (LP) decoding. In order to develop an efficient algorithm, we focus on non-binary codes in fields of characteristic two. This allows us to transform each constraint in $\\mathbb{F}_{2^m}$ to a set of constraints in $\\mathbb{F}_{2}$ that has a factor graph representation. Applying ADMM to the LP decoding problem results in two types of non-trivial sub-routines","authors_text":"Stark C. Draper, Xishuo Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-17T20:40:47Z","title":"ADMM LP decoding of non-binary LDPC codes in $\\mathbb{F}_{2^m}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5141","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:2a334d5e8f95db985685d1a1e92a6403951ec1d21312e1c682014274e3141659","target":"record","created_at":"2026-05-18T01:36:13Z","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":"d88c13f932e4306197feab771f3be61f250098fc3ef7ac52a2c1e44bf8c5e0db","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-17T20:40:47Z","title_canon_sha256":"3690742c66de95be808cfb44c23fbec64c631cece919ad619d25343525cd6e8e"},"schema_version":"1.0","source":{"id":"1409.5141","kind":"arxiv","version":2}},"canonical_sha256":"e393ef9c79ac4da7d3a0aedb8abeb693ad23f646f5b1d80d0bfe704c6226d2b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e393ef9c79ac4da7d3a0aedb8abeb693ad23f646f5b1d80d0bfe704c6226d2b0","first_computed_at":"2026-05-18T01:36:13.958526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:13.958526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9ceRsdvx/E0pJrKj3OLG4MTxl35xalBj/rbEZQAU2s8qZ9Ht9N+6QRlt+9q53Wq98JWQXI9RCI7TDNkDGK/iDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:13.959018Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.5141","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a334d5e8f95db985685d1a1e92a6403951ec1d21312e1c682014274e3141659","sha256:40a1247d727947853ddc9399583d2a519d4e4b6a846ba490ab15cd390d32e8b6"],"state_sha256":"ce4c76b7c93089a4d14685a058a65d3f0ce35d6fecf17966d8e8c6cac0122dbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"agv3KxYHIXAuzl8tD5dqPjQxbkiaf9FbNfL0uS9znDkB+9gU1C8Wyp+aO8NhKLqx+b3qMgA3jtDLZ0Xdn96FDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:47:03.920063Z","bundle_sha256":"5a38cc637fb8d852ba0dfcddad0039df84b2d83fa47eb9f73f81d9054495e063"}}