{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:466EONN65Q3VKMONLL34OZ5XK4","short_pith_number":"pith:466EONN6","canonical_record":{"source":{"id":"1512.00210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-01T10:34:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7164b77fd996cf70d5a9a535d1639888080d59140dca13eba139b2b566f48508","abstract_canon_sha256":"b1ae1cf0f820555b4e33315cca79c76cd1ac57068cb4178cef48364555305e10"},"schema_version":"1.0"},"canonical_sha256":"e7bc4735beec375531cd5af7c767b75705900abbe9f9763b8f4174c9f98b6546","source":{"kind":"arxiv","id":"1512.00210","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00210","created_at":"2026-05-18T01:25:32Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00210v1","created_at":"2026-05-18T01:25:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00210","created_at":"2026-05-18T01:25:32Z"},{"alias_kind":"pith_short_12","alias_value":"466EONN65Q3V","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"466EONN65Q3VKMON","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"466EONN6","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:466EONN65Q3VKMONLL34OZ5XK4","target":"record","payload":{"canonical_record":{"source":{"id":"1512.00210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-01T10:34:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7164b77fd996cf70d5a9a535d1639888080d59140dca13eba139b2b566f48508","abstract_canon_sha256":"b1ae1cf0f820555b4e33315cca79c76cd1ac57068cb4178cef48364555305e10"},"schema_version":"1.0"},"canonical_sha256":"e7bc4735beec375531cd5af7c767b75705900abbe9f9763b8f4174c9f98b6546","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:32.458660Z","signature_b64":"Gru1E9NJ1pG4lBf4OJr8pOH4smtzrTU9a/bkszPY6W3XH660zePQIxQOzdi/Vc03ucXaIjRJB+Ieu7Uszl3zAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7bc4735beec375531cd5af7c767b75705900abbe9f9763b8f4174c9f98b6546","last_reissued_at":"2026-05-18T01:25:32.458162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:32.458162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.00210","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-18T01:25:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQ/NROo73PMJcJoR+JxFzfVDl3BWM2KajzIctYc+5H1Svtq+vEkohUzXINZWRmNdjFzuYOHuVaiYBAGI6dbTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:34:06.070629Z"},"content_sha256":"52c9cc44ed54dfc39fb2a13c4feaf0ea4aacde6a948a9d254ee0b628cc3b2bca","schema_version":"1.0","event_id":"sha256:52c9cc44ed54dfc39fb2a13c4feaf0ea4aacde6a948a9d254ee0b628cc3b2bca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:466EONN65Q3VKMONLL34OZ5XK4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantized Message Passing for LDPC Codes","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, Gerald Matz, Michael Meidlinger","submitted_at":"2015-12-01T10:34:05Z","abstract_excerpt":"We propose a quantized decoding algorithm for low- density parity-check codes where the variable node update rule of the standard min-sum algorithm is replaced with a look-up table (LUT) that is designed using an information-theoretic criterion. We show that even with message resolutions as low as 3 bits, the proposed algorithm can achieve better error rates than a floating-point min-sum decoder. Moreover, we study in detail the effect of different decoder design parameters, like the design SNR and the LUT tree structure on the performance of our decoder, and we propose some complexity reducti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00210","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-18T01:25:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cPqgl2zK3DcjORN6Zq85zLYDRs4v/ckGXBVHgB3goeMtMDDhQcGsRnulVBQMOOkqqKNFHvzaehcE3P14oGYIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:34:06.071274Z"},"content_sha256":"ae37c1f1d1f25817df2182394384e00be2ed2eee82c29b5d2e68c57e0f06e8ed","schema_version":"1.0","event_id":"sha256:ae37c1f1d1f25817df2182394384e00be2ed2eee82c29b5d2e68c57e0f06e8ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/466EONN65Q3VKMONLL34OZ5XK4/bundle.json","state_url":"https://pith.science/pith/466EONN65Q3VKMONLL34OZ5XK4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/466EONN65Q3VKMONLL34OZ5XK4/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-27T01:34:06Z","links":{"resolver":"https://pith.science/pith/466EONN65Q3VKMONLL34OZ5XK4","bundle":"https://pith.science/pith/466EONN65Q3VKMONLL34OZ5XK4/bundle.json","state":"https://pith.science/pith/466EONN65Q3VKMONLL34OZ5XK4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/466EONN65Q3VKMONLL34OZ5XK4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:466EONN65Q3VKMONLL34OZ5XK4","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":"b1ae1cf0f820555b4e33315cca79c76cd1ac57068cb4178cef48364555305e10","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-01T10:34:05Z","title_canon_sha256":"7164b77fd996cf70d5a9a535d1639888080d59140dca13eba139b2b566f48508"},"schema_version":"1.0","source":{"id":"1512.00210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00210","created_at":"2026-05-18T01:25:32Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00210v1","created_at":"2026-05-18T01:25:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00210","created_at":"2026-05-18T01:25:32Z"},{"alias_kind":"pith_short_12","alias_value":"466EONN65Q3V","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"466EONN65Q3VKMON","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"466EONN6","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:ae37c1f1d1f25817df2182394384e00be2ed2eee82c29b5d2e68c57e0f06e8ed","target":"graph","created_at":"2026-05-18T01:25:32Z","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 propose a quantized decoding algorithm for low- density parity-check codes where the variable node update rule of the standard min-sum algorithm is replaced with a look-up table (LUT) that is designed using an information-theoretic criterion. We show that even with message resolutions as low as 3 bits, the proposed algorithm can achieve better error rates than a floating-point min-sum decoder. Moreover, we study in detail the effect of different decoder design parameters, like the design SNR and the LUT tree structure on the performance of our decoder, and we propose some complexity reducti","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg, Gerald Matz, Michael Meidlinger","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-01T10:34:05Z","title":"Quantized Message Passing for LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00210","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:52c9cc44ed54dfc39fb2a13c4feaf0ea4aacde6a948a9d254ee0b628cc3b2bca","target":"record","created_at":"2026-05-18T01:25:32Z","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":"b1ae1cf0f820555b4e33315cca79c76cd1ac57068cb4178cef48364555305e10","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-01T10:34:05Z","title_canon_sha256":"7164b77fd996cf70d5a9a535d1639888080d59140dca13eba139b2b566f48508"},"schema_version":"1.0","source":{"id":"1512.00210","kind":"arxiv","version":1}},"canonical_sha256":"e7bc4735beec375531cd5af7c767b75705900abbe9f9763b8f4174c9f98b6546","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7bc4735beec375531cd5af7c767b75705900abbe9f9763b8f4174c9f98b6546","first_computed_at":"2026-05-18T01:25:32.458162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:32.458162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gru1E9NJ1pG4lBf4OJr8pOH4smtzrTU9a/bkszPY6W3XH660zePQIxQOzdi/Vc03ucXaIjRJB+Ieu7Uszl3zAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:32.458660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52c9cc44ed54dfc39fb2a13c4feaf0ea4aacde6a948a9d254ee0b628cc3b2bca","sha256:ae37c1f1d1f25817df2182394384e00be2ed2eee82c29b5d2e68c57e0f06e8ed"],"state_sha256":"dbedbc89a5cd9c46f7716e0e35f9a1980950ec17566cd1f9059885f6a041c08d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFHyF1RJ5XTKOJLkOj7dT3wKmhgGAzvhCbD/2Ib65YWqxwiGld+oO0A2kW45W8ji2VJCQTw+u8Px/BcIosFPAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:34:06.075015Z","bundle_sha256":"1b10ff5c3ed00416be2c2478d8a1d54b1aa76a709445fe9f40f75491f80ba135"}}