{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:R7JUD5LRXOBXPN3PD6LNXVQECS","short_pith_number":"pith:R7JUD5LR","canonical_record":{"source":{"id":"1207.5555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-23T22:46:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f9d213c4754329191eb192a6161094dee8e779cef19a5b9a4986ccc6f823b180","abstract_canon_sha256":"598ad0b1547595409746561925a0eb5610b4ce496f1552345d0289e77e86003c"},"schema_version":"1.0"},"canonical_sha256":"8fd341f571bb8377b76f1f96dbd60414b13e29e2972a404e4541280d983ec18c","source":{"kind":"arxiv","id":"1207.5555","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5555","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5555v1","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5555","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"R7JUD5LRXOBX","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"R7JUD5LRXOBXPN3P","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"R7JUD5LR","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:R7JUD5LRXOBXPN3PD6LNXVQECS","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-23T22:46:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f9d213c4754329191eb192a6161094dee8e779cef19a5b9a4986ccc6f823b180","abstract_canon_sha256":"598ad0b1547595409746561925a0eb5610b4ce496f1552345d0289e77e86003c"},"schema_version":"1.0"},"canonical_sha256":"8fd341f571bb8377b76f1f96dbd60414b13e29e2972a404e4541280d983ec18c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:56.841104Z","signature_b64":"LA3PULujLCLeOpBNuYjV4Bp55wvk24ZqCcfhiBk5RxqRGXNk9vSoR4FuElzQEy5q9STyF7CWbvzo4DLd1M30Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fd341f571bb8377b76f1f96dbd60414b13e29e2972a404e4541280d983ec18c","last_reissued_at":"2026-05-18T00:57:56.840484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:56.840484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5555","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-18T00:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fu7xukq04UDJ273GHBL5AimaxhAN8u1cXz4Yv5mQOqLgMRGHNmfmyEmYX7isUtbTHfl5i9Tx1zdHTSUYJvgjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T21:20:11.075210Z"},"content_sha256":"2a4a8e3db9f0f51ecf24deb59bcb10da55e69cf6fefccb3ac0ebf4e9b9ee2284","schema_version":"1.0","event_id":"sha256:2a4a8e3db9f0f51ecf24deb59bcb10da55e69cf6fefccb3ac0ebf4e9b9ee2284"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:R7JUD5LRXOBXPN3PD6LNXVQECS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simplified Min-Sum Decoding Algorithm for Non-Binary LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chung-Li Wang, Shaohua Yang, Xiaoheng Chen, Zongwang Li","submitted_at":"2012-07-23T22:46:38Z","abstract_excerpt":"Non-binary low-density parity-check codes are robust to various channel impairments. However, based on the existing decoding algorithms, the decoder implementations are expensive because of their excessive computational complexity and memory usage. Based on the combinatorial optimization, we present an approximation method for the check node processing. The simulation results demonstrate that our scheme has small performance loss over the additive white Gaussian noise channel and independent Rayleigh fading channel. Furthermore, the proposed reduced-complexity realization provides significant "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5555","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-18T00:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5If/yHqFSvxamfhylXycfY8MYCRqXO6RFyg1MIzY+lzBebBeWdQR4Ds8F/IMQBRinRvNZkxQSn/ITotwbRVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T21:20:11.075495Z"},"content_sha256":"274ace16438d80fb4308bfcc3f91049f05ca16dcfc8429b89add691c573e6c92","schema_version":"1.0","event_id":"sha256:274ace16438d80fb4308bfcc3f91049f05ca16dcfc8429b89add691c573e6c92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7JUD5LRXOBXPN3PD6LNXVQECS/bundle.json","state_url":"https://pith.science/pith/R7JUD5LRXOBXPN3PD6LNXVQECS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7JUD5LRXOBXPN3PD6LNXVQECS/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-08-14T21:20:11Z","links":{"resolver":"https://pith.science/pith/R7JUD5LRXOBXPN3PD6LNXVQECS","bundle":"https://pith.science/pith/R7JUD5LRXOBXPN3PD6LNXVQECS/bundle.json","state":"https://pith.science/pith/R7JUD5LRXOBXPN3PD6LNXVQECS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7JUD5LRXOBXPN3PD6LNXVQECS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:R7JUD5LRXOBXPN3PD6LNXVQECS","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":"598ad0b1547595409746561925a0eb5610b4ce496f1552345d0289e77e86003c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-23T22:46:38Z","title_canon_sha256":"f9d213c4754329191eb192a6161094dee8e779cef19a5b9a4986ccc6f823b180"},"schema_version":"1.0","source":{"id":"1207.5555","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5555","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5555v1","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5555","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"R7JUD5LRXOBX","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"R7JUD5LRXOBXPN3P","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"R7JUD5LR","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:274ace16438d80fb4308bfcc3f91049f05ca16dcfc8429b89add691c573e6c92","target":"graph","created_at":"2026-05-18T00:57:56Z","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":"Non-binary low-density parity-check codes are robust to various channel impairments. However, based on the existing decoding algorithms, the decoder implementations are expensive because of their excessive computational complexity and memory usage. Based on the combinatorial optimization, we present an approximation method for the check node processing. The simulation results demonstrate that our scheme has small performance loss over the additive white Gaussian noise channel and independent Rayleigh fading channel. Furthermore, the proposed reduced-complexity realization provides significant ","authors_text":"Chung-Li Wang, Shaohua Yang, Xiaoheng Chen, Zongwang Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-23T22:46:38Z","title":"A Simplified Min-Sum Decoding Algorithm for Non-Binary LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5555","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:2a4a8e3db9f0f51ecf24deb59bcb10da55e69cf6fefccb3ac0ebf4e9b9ee2284","target":"record","created_at":"2026-05-18T00:57:56Z","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":"598ad0b1547595409746561925a0eb5610b4ce496f1552345d0289e77e86003c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-23T22:46:38Z","title_canon_sha256":"f9d213c4754329191eb192a6161094dee8e779cef19a5b9a4986ccc6f823b180"},"schema_version":"1.0","source":{"id":"1207.5555","kind":"arxiv","version":1}},"canonical_sha256":"8fd341f571bb8377b76f1f96dbd60414b13e29e2972a404e4541280d983ec18c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fd341f571bb8377b76f1f96dbd60414b13e29e2972a404e4541280d983ec18c","first_computed_at":"2026-05-18T00:57:56.840484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:56.840484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LA3PULujLCLeOpBNuYjV4Bp55wvk24ZqCcfhiBk5RxqRGXNk9vSoR4FuElzQEy5q9STyF7CWbvzo4DLd1M30Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:56.841104Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5555","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a4a8e3db9f0f51ecf24deb59bcb10da55e69cf6fefccb3ac0ebf4e9b9ee2284","sha256:274ace16438d80fb4308bfcc3f91049f05ca16dcfc8429b89add691c573e6c92"],"state_sha256":"9629a900b06ccd43c2f8dbdc4fb49fee1b8383f75d9a964b143cd4bd27d73c8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dNlXFZjL5elW3G/1NafIkODvcbltNH/xQ9J5PvE2fEWBWp8+JRqmGtev/wLPUAvhuvVfXtKrL/eIyXL8+F7BBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T21:20:11.078019Z","bundle_sha256":"8cc2cc149109ab41ee71552541d4c23ddb92922315e9983923043d1e4c5b0efc"}}