{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:NCAMCIFFGX4UDNI3SCJIJNOVO4","short_pith_number":"pith:NCAMCIFF","canonical_record":{"source":{"id":"2212.02144","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-12-05T10:34:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bd35e8e74d24dae5366c3d88ece126192b3a1af27d2586fc299f3da6e946c088","abstract_canon_sha256":"3b638339b548d14301aa7d0fbae9be7469ddb0561295beb67832d48bd3d943f2"},"schema_version":"1.0"},"canonical_sha256":"6880c120a535f941b51b909284b5d57736898c1c19e70194e96791b145495008","source":{"kind":"arxiv","id":"2212.02144","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.02144","created_at":"2026-07-05T05:25:51Z"},{"alias_kind":"arxiv_version","alias_value":"2212.02144v2","created_at":"2026-07-05T05:25:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02144","created_at":"2026-07-05T05:25:51Z"},{"alias_kind":"pith_short_12","alias_value":"NCAMCIFFGX4U","created_at":"2026-07-05T05:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"NCAMCIFFGX4UDNI3","created_at":"2026-07-05T05:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"NCAMCIFF","created_at":"2026-07-05T05:25:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:NCAMCIFFGX4UDNI3SCJIJNOVO4","target":"record","payload":{"canonical_record":{"source":{"id":"2212.02144","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-12-05T10:34:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bd35e8e74d24dae5366c3d88ece126192b3a1af27d2586fc299f3da6e946c088","abstract_canon_sha256":"3b638339b548d14301aa7d0fbae9be7469ddb0561295beb67832d48bd3d943f2"},"schema_version":"1.0"},"canonical_sha256":"6880c120a535f941b51b909284b5d57736898c1c19e70194e96791b145495008","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:25:51.948188Z","signature_b64":"TLNxtEn1T7ot3L7zBzZ+MZRiPaI7yIvnfkJlJxf4UgwUaSQTmIiP7FW0CG95ziXiEA4Lyjp2iOsZ8Y1eJ9EZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6880c120a535f941b51b909284b5d57736898c1c19e70194e96791b145495008","last_reissued_at":"2026-07-05T05:25:51.947734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:25:51.947734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.02144","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-07-05T05:25:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23V/vP3AMBxMb2UDaLF3xkw5XhVg11L4ndkB+dQ/10Pueru5ROpfYVibzeJfQgzQmrc1Gewk8q+wbJbJYdoCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:19:25.900330Z"},"content_sha256":"e4d2702b6efc4fed5a53c03b1650860672ddb9df5f6048bf99f5c61b026e4a8c","schema_version":"1.0","event_id":"sha256:e4d2702b6efc4fed5a53c03b1650860672ddb9df5f6048bf99f5c61b026e4a8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:NCAMCIFFGX4UDNI3SCJIJNOVO4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Resolution Horizontal and Vertical Layered Mutual Information Maximizing LDPC Decoding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gerhard Bauch, Philipp Mohr","submitted_at":"2022-12-05T10:34:34Z","abstract_excerpt":"We investigate iterative low-resolution message-passing algorithms for quasi-cyclic LDPC codes with horizontal and vertical layered schedules. Coarse quantization and layered scheduling are highly relevant for hardware implementations to reduce the bit width of messages and the number of decoding iterations. As a novelty, this paper compares the two scheduling variants in combination with mutual information maximizing compression operations in variable and check nodes. We evaluate the complexity and error rate performance for various configurations. Dedicated hardware architectures for regular"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02144","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.02144/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:25:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m/2HqoFAPLGQk5Pk/ec10BuBotCQvxuU/cb44z51HZ7fI3buphVeOvwOJQ39dYxF7mJPUMXK4spdRgCbhuVFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:19:25.900682Z"},"content_sha256":"0c5bc85bb2d835b318d230cfc407866a8f8b3de2d4e80b22a4fac5c9e781e541","schema_version":"1.0","event_id":"sha256:0c5bc85bb2d835b318d230cfc407866a8f8b3de2d4e80b22a4fac5c9e781e541"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NCAMCIFFGX4UDNI3SCJIJNOVO4/bundle.json","state_url":"https://pith.science/pith/NCAMCIFFGX4UDNI3SCJIJNOVO4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NCAMCIFFGX4UDNI3SCJIJNOVO4/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-22T13:19:25Z","links":{"resolver":"https://pith.science/pith/NCAMCIFFGX4UDNI3SCJIJNOVO4","bundle":"https://pith.science/pith/NCAMCIFFGX4UDNI3SCJIJNOVO4/bundle.json","state":"https://pith.science/pith/NCAMCIFFGX4UDNI3SCJIJNOVO4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NCAMCIFFGX4UDNI3SCJIJNOVO4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:NCAMCIFFGX4UDNI3SCJIJNOVO4","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":"3b638339b548d14301aa7d0fbae9be7469ddb0561295beb67832d48bd3d943f2","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-12-05T10:34:34Z","title_canon_sha256":"bd35e8e74d24dae5366c3d88ece126192b3a1af27d2586fc299f3da6e946c088"},"schema_version":"1.0","source":{"id":"2212.02144","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.02144","created_at":"2026-07-05T05:25:51Z"},{"alias_kind":"arxiv_version","alias_value":"2212.02144v2","created_at":"2026-07-05T05:25:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02144","created_at":"2026-07-05T05:25:51Z"},{"alias_kind":"pith_short_12","alias_value":"NCAMCIFFGX4U","created_at":"2026-07-05T05:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"NCAMCIFFGX4UDNI3","created_at":"2026-07-05T05:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"NCAMCIFF","created_at":"2026-07-05T05:25:51Z"}],"graph_snapshots":[{"event_id":"sha256:0c5bc85bb2d835b318d230cfc407866a8f8b3de2d4e80b22a4fac5c9e781e541","target":"graph","created_at":"2026-07-05T05:25:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2212.02144/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate iterative low-resolution message-passing algorithms for quasi-cyclic LDPC codes with horizontal and vertical layered schedules. Coarse quantization and layered scheduling are highly relevant for hardware implementations to reduce the bit width of messages and the number of decoding iterations. As a novelty, this paper compares the two scheduling variants in combination with mutual information maximizing compression operations in variable and check nodes. We evaluate the complexity and error rate performance for various configurations. Dedicated hardware architectures for regular","authors_text":"Gerhard Bauch, Philipp Mohr","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-12-05T10:34:34Z","title":"Low-Resolution Horizontal and Vertical Layered Mutual Information Maximizing LDPC Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02144","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:e4d2702b6efc4fed5a53c03b1650860672ddb9df5f6048bf99f5c61b026e4a8c","target":"record","created_at":"2026-07-05T05:25:51Z","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":"3b638339b548d14301aa7d0fbae9be7469ddb0561295beb67832d48bd3d943f2","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-12-05T10:34:34Z","title_canon_sha256":"bd35e8e74d24dae5366c3d88ece126192b3a1af27d2586fc299f3da6e946c088"},"schema_version":"1.0","source":{"id":"2212.02144","kind":"arxiv","version":2}},"canonical_sha256":"6880c120a535f941b51b909284b5d57736898c1c19e70194e96791b145495008","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6880c120a535f941b51b909284b5d57736898c1c19e70194e96791b145495008","first_computed_at":"2026-07-05T05:25:51.947734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:25:51.947734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TLNxtEn1T7ot3L7zBzZ+MZRiPaI7yIvnfkJlJxf4UgwUaSQTmIiP7FW0CG95ziXiEA4Lyjp2iOsZ8Y1eJ9EZBw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:25:51.948188Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.02144","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4d2702b6efc4fed5a53c03b1650860672ddb9df5f6048bf99f5c61b026e4a8c","sha256:0c5bc85bb2d835b318d230cfc407866a8f8b3de2d4e80b22a4fac5c9e781e541"],"state_sha256":"197970f07c2acd000076b37201815e8802b9bbbed70dfa1c8f0483ade0c4fbf2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ejBqz4I+p6ivsC/KXPwRsJ0XqWoCrn5pB8waOU9nfRzKavX5NjqyJ0NOwEnNsYGH7iUmB4XNMSVoS8g9rVjMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T13:19:25.904457Z","bundle_sha256":"e8f1ee355ad55938dd87d2c66e26e70b7bdc0b7cdeb795b0afcfec80805f411f"}}