{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6MO44I24QFBYTTOVXT3LACKVDR","short_pith_number":"pith:6MO44I24","canonical_record":{"source":{"id":"1212.6465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-28T05:18:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a227738300c7e0f9f5e1d5b5fb77d7e81754af6b2c328bf1cc6e82ca58ee6ec2","abstract_canon_sha256":"eb3a000d53a2e08f78a439346c883e5ccc5cba4ea1967695c6d50cf330d42e19"},"schema_version":"1.0"},"canonical_sha256":"f31dce235c814389cdd5bcf6b009551c5de52bc1f2c87db6c8019a4162f2dd38","source":{"kind":"arxiv","id":"1212.6465","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6465","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6465v2","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6465","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"6MO44I24QFBY","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6MO44I24QFBYTTOV","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6MO44I24","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6MO44I24QFBYTTOVXT3LACKVDR","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-28T05:18:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a227738300c7e0f9f5e1d5b5fb77d7e81754af6b2c328bf1cc6e82ca58ee6ec2","abstract_canon_sha256":"eb3a000d53a2e08f78a439346c883e5ccc5cba4ea1967695c6d50cf330d42e19"},"schema_version":"1.0"},"canonical_sha256":"f31dce235c814389cdd5bcf6b009551c5de52bc1f2c87db6c8019a4162f2dd38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:46.283437Z","signature_b64":"+juyFks/w5hNQh8irNEw/oOPzLUoiCqvcn6mbyMZH3SFSB1KokEwmo3ppr7fJLPawRU+SWRdplucd1Jonfq8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f31dce235c814389cdd5bcf6b009551c5de52bc1f2c87db6c8019a4162f2dd38","last_reissued_at":"2026-05-18T03:13:46.282766Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:46.282766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6465","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-18T03:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wd4NghYEUvgmKo/7FXu3eMFzQ84oCrrwgRBrAwqGgxHt25gQ0o1bkdwVUwFLFof5QqW3USTaENHZu3H9A8qwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:09:33.035021Z"},"content_sha256":"02c25fee7c15ed7eb4501d66193b61e131b9fb56bb21c922a11fb1085b4b7083","schema_version":"1.0","event_id":"sha256:02c25fee7c15ed7eb4501d66193b61e131b9fb56bb21c922a11fb1085b4b7083"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6MO44I24QFBYTTOVXT3LACKVDR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Paul H. Siegel, Xiaojie Zhang","submitted_at":"2012-12-28T05:18:43Z","abstract_excerpt":"The error floor phenomenon observed with LDPC codes and their graph-based, iterative, message-passing (MP) decoders is commonly attributed to the existence of error-prone substructures -- variously referred to as near codewords, trapping sets, absorbing sets, or pseudocodewords -- in a Tanner graph representation of the code. Many approaches have been proposed to lower the error floor by designing new LDPC codes with fewer such substructures or by modifying the decoding algorithm. Using a theoretical analysis of iterative MP decoding in an idealized trapping set scenario, we show that a contri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6465","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-18T03:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yUp/z2ZpZtkIADqV4muwvKsfrFW0y/E5rMrzl5wil3bvCVavWIPmi9Z2zqtCRybPHtT7XbjyUCgSDQrMi5DmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:09:33.035696Z"},"content_sha256":"679c2ce535d07ebac53f1feb419b57f6d2475789ae523025eb1f38bca5f2e2d5","schema_version":"1.0","event_id":"sha256:679c2ce535d07ebac53f1feb419b57f6d2475789ae523025eb1f38bca5f2e2d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6MO44I24QFBYTTOVXT3LACKVDR/bundle.json","state_url":"https://pith.science/pith/6MO44I24QFBYTTOVXT3LACKVDR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6MO44I24QFBYTTOVXT3LACKVDR/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-29T15:09:33Z","links":{"resolver":"https://pith.science/pith/6MO44I24QFBYTTOVXT3LACKVDR","bundle":"https://pith.science/pith/6MO44I24QFBYTTOVXT3LACKVDR/bundle.json","state":"https://pith.science/pith/6MO44I24QFBYTTOVXT3LACKVDR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6MO44I24QFBYTTOVXT3LACKVDR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6MO44I24QFBYTTOVXT3LACKVDR","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":"eb3a000d53a2e08f78a439346c883e5ccc5cba4ea1967695c6d50cf330d42e19","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-28T05:18:43Z","title_canon_sha256":"a227738300c7e0f9f5e1d5b5fb77d7e81754af6b2c328bf1cc6e82ca58ee6ec2"},"schema_version":"1.0","source":{"id":"1212.6465","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6465","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6465v2","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6465","created_at":"2026-05-18T03:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"6MO44I24QFBY","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6MO44I24QFBYTTOV","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6MO44I24","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:679c2ce535d07ebac53f1feb419b57f6d2475789ae523025eb1f38bca5f2e2d5","target":"graph","created_at":"2026-05-18T03:13:46Z","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":"The error floor phenomenon observed with LDPC codes and their graph-based, iterative, message-passing (MP) decoders is commonly attributed to the existence of error-prone substructures -- variously referred to as near codewords, trapping sets, absorbing sets, or pseudocodewords -- in a Tanner graph representation of the code. Many approaches have been proposed to lower the error floor by designing new LDPC codes with fewer such substructures or by modifying the decoding algorithm. Using a theoretical analysis of iterative MP decoding in an idealized trapping set scenario, we show that a contri","authors_text":"Paul H. Siegel, Xiaojie Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-28T05:18:43Z","title":"Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6465","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:02c25fee7c15ed7eb4501d66193b61e131b9fb56bb21c922a11fb1085b4b7083","target":"record","created_at":"2026-05-18T03:13:46Z","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":"eb3a000d53a2e08f78a439346c883e5ccc5cba4ea1967695c6d50cf330d42e19","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-28T05:18:43Z","title_canon_sha256":"a227738300c7e0f9f5e1d5b5fb77d7e81754af6b2c328bf1cc6e82ca58ee6ec2"},"schema_version":"1.0","source":{"id":"1212.6465","kind":"arxiv","version":2}},"canonical_sha256":"f31dce235c814389cdd5bcf6b009551c5de52bc1f2c87db6c8019a4162f2dd38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f31dce235c814389cdd5bcf6b009551c5de52bc1f2c87db6c8019a4162f2dd38","first_computed_at":"2026-05-18T03:13:46.282766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:46.282766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+juyFks/w5hNQh8irNEw/oOPzLUoiCqvcn6mbyMZH3SFSB1KokEwmo3ppr7fJLPawRU+SWRdplucd1Jonfq8Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:46.283437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6465","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02c25fee7c15ed7eb4501d66193b61e131b9fb56bb21c922a11fb1085b4b7083","sha256:679c2ce535d07ebac53f1feb419b57f6d2475789ae523025eb1f38bca5f2e2d5"],"state_sha256":"289184a3f2e9b213bbbbb08f92d3e6c1ce63afbcd04d92d63ed09b83b94bbd8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mcOHgTpjNn8TW0CCzXGHQ+HS261cyL1/ezTX3Ed6c7qJPObxejXAXQ05fPvSnobS8OYM6a2v/EStXAMckVWtDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:09:33.039143Z","bundle_sha256":"c53afb72b7a5b0211fdf43f2e7c0b88a847122faee090a3817d5e34beb431c40"}}