{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QIAUWHK22SMX5RAYHNUAAWRGIY","short_pith_number":"pith:QIAUWHK2","canonical_record":{"source":{"id":"1404.1601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-06T17:27:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1bf970022af2aa28bc1efc52e14adf519470777ac650e52923c0c121e624a010","abstract_canon_sha256":"8502a3443ace241cb55da8d32746039a2cdcbad96415e1ea9e18a0c561737380"},"schema_version":"1.0"},"canonical_sha256":"82014b1d5ad4997ec4183b68005a264636077db9544a1867f430d7c974e771d4","source":{"kind":"arxiv","id":"1404.1601","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1601","created_at":"2026-05-18T02:54:45Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1601v1","created_at":"2026-05-18T02:54:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1601","created_at":"2026-05-18T02:54:45Z"},{"alias_kind":"pith_short_12","alias_value":"QIAUWHK22SMX","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QIAUWHK22SMX5RAY","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QIAUWHK2","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QIAUWHK22SMX5RAYHNUAAWRGIY","target":"record","payload":{"canonical_record":{"source":{"id":"1404.1601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-06T17:27:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1bf970022af2aa28bc1efc52e14adf519470777ac650e52923c0c121e624a010","abstract_canon_sha256":"8502a3443ace241cb55da8d32746039a2cdcbad96415e1ea9e18a0c561737380"},"schema_version":"1.0"},"canonical_sha256":"82014b1d5ad4997ec4183b68005a264636077db9544a1867f430d7c974e771d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:45.952007Z","signature_b64":"wXKoNDer8bYJfGPNVUbBsX2epSAJcmt6VpwSUHgiAt4GFQaZl3VmVlfSz3BsksE4PvFEl/Op4EOsY7OMK01+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82014b1d5ad4997ec4183b68005a264636077db9544a1867f430d7c974e771d4","last_reissued_at":"2026-05-18T02:54:45.951610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:45.951610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.1601","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-18T02:54:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U6ImN6Tkt8xwJlzmjxCKrs+32TPVLTUuCMuO1pD68SxmNHgC4UGwTlmqENoEg8dK/itdkSd05vBi7ui+mAYOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:35:37.658905Z"},"content_sha256":"ab694406bde412ec5a520ad26e7212c756e00ddfd587d49386475fe8ca8fbc77","schema_version":"1.0","event_id":"sha256:ab694406bde412ec5a520ad26e7212c756e00ddfd587d49386475fe8ca8fbc77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QIAUWHK22SMX5RAYHNUAAWRGIY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Density Evolution for Min-Sum Decoding of LDPC Codes Under Unreliable Message Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg","submitted_at":"2014-04-06T17:27:57Z","abstract_excerpt":"We analyze the performance of quantized min-sum decoding of low-density parity-check codes under unreliable message storage. To this end, we introduce a simple bit-level error model and show that decoder symmetry is preserved under this model. Subsequently, we formulate the corresponding density evolution equations to predict the average bit error probability in the limit of infinite blocklength. We present numerical threshold results and we show that using more quantization bits is not always beneficial in the context of faulty decoders."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1601","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-18T02:54:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2gPNo1uuQ8wkfhj8TMBkITppP4/MCu2elw/0lPyuO0W7UD1NPVXBLjYRUV5+9elBcuatg27Gjvd62eN8287CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:35:37.659630Z"},"content_sha256":"999ffd61e7163ff950df899db3ba2c968f29925edc360e37c209cf88f7db9c1a","schema_version":"1.0","event_id":"sha256:999ffd61e7163ff950df899db3ba2c968f29925edc360e37c209cf88f7db9c1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QIAUWHK22SMX5RAYHNUAAWRGIY/bundle.json","state_url":"https://pith.science/pith/QIAUWHK22SMX5RAYHNUAAWRGIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QIAUWHK22SMX5RAYHNUAAWRGIY/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-26T11:35:37Z","links":{"resolver":"https://pith.science/pith/QIAUWHK22SMX5RAYHNUAAWRGIY","bundle":"https://pith.science/pith/QIAUWHK22SMX5RAYHNUAAWRGIY/bundle.json","state":"https://pith.science/pith/QIAUWHK22SMX5RAYHNUAAWRGIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QIAUWHK22SMX5RAYHNUAAWRGIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QIAUWHK22SMX5RAYHNUAAWRGIY","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":"8502a3443ace241cb55da8d32746039a2cdcbad96415e1ea9e18a0c561737380","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-06T17:27:57Z","title_canon_sha256":"1bf970022af2aa28bc1efc52e14adf519470777ac650e52923c0c121e624a010"},"schema_version":"1.0","source":{"id":"1404.1601","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1601","created_at":"2026-05-18T02:54:45Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1601v1","created_at":"2026-05-18T02:54:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1601","created_at":"2026-05-18T02:54:45Z"},{"alias_kind":"pith_short_12","alias_value":"QIAUWHK22SMX","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QIAUWHK22SMX5RAY","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QIAUWHK2","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:999ffd61e7163ff950df899db3ba2c968f29925edc360e37c209cf88f7db9c1a","target":"graph","created_at":"2026-05-18T02:54:45Z","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":"We analyze the performance of quantized min-sum decoding of low-density parity-check codes under unreliable message storage. To this end, we introduce a simple bit-level error model and show that decoder symmetry is preserved under this model. Subsequently, we formulate the corresponding density evolution equations to predict the average bit error probability in the limit of infinite blocklength. We present numerical threshold results and we show that using more quantization bits is not always beneficial in the context of faulty decoders.","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-06T17:27:57Z","title":"Density Evolution for Min-Sum Decoding of LDPC Codes Under Unreliable Message Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1601","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:ab694406bde412ec5a520ad26e7212c756e00ddfd587d49386475fe8ca8fbc77","target":"record","created_at":"2026-05-18T02:54:45Z","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":"8502a3443ace241cb55da8d32746039a2cdcbad96415e1ea9e18a0c561737380","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-06T17:27:57Z","title_canon_sha256":"1bf970022af2aa28bc1efc52e14adf519470777ac650e52923c0c121e624a010"},"schema_version":"1.0","source":{"id":"1404.1601","kind":"arxiv","version":1}},"canonical_sha256":"82014b1d5ad4997ec4183b68005a264636077db9544a1867f430d7c974e771d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82014b1d5ad4997ec4183b68005a264636077db9544a1867f430d7c974e771d4","first_computed_at":"2026-05-18T02:54:45.951610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:45.951610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wXKoNDer8bYJfGPNVUbBsX2epSAJcmt6VpwSUHgiAt4GFQaZl3VmVlfSz3BsksE4PvFEl/Op4EOsY7OMK01+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:45.952007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1601","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab694406bde412ec5a520ad26e7212c756e00ddfd587d49386475fe8ca8fbc77","sha256:999ffd61e7163ff950df899db3ba2c968f29925edc360e37c209cf88f7db9c1a"],"state_sha256":"db8df1c32333d45f917d7a709df5487a79298da6be02593865364a5e5d906c3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5kCeE9qABSoN7Mc1UyxWYBsNmY6S4qMvhAIw3fhD015pUnAhYkH1ewsLhIW4FgIRpw6NnUpHyWVuJI4qkkTrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:35:37.663199Z","bundle_sha256":"7031cb97e3c61243624be12b918f6844816ac5df2efc11bdf138314af68f01b5"}}