{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IQALMRN2KGOZJEGPQYOXVOJRTJ","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":"7cd0a43658870cc3fb5a6d10d9b373927bd3990372dcb4005ff8a9c9887f2d43","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T19:46:19Z","title_canon_sha256":"aac8e2b905fdcaa09bf40d974257fccb501982edfff5ba857ce5a0538c3f7520"},"schema_version":"1.0","source":{"id":"1901.02914","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02914","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02914v2","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02914","created_at":"2026-05-17T23:55:38Z"},{"alias_kind":"pith_short_12","alias_value":"IQALMRN2KGOZ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IQALMRN2KGOZJEGP","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IQALMRN2","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:b4df8f96841ec854661be6cf7cb4701ac2bf4c2bafaff79f12a6bd7ef769ff54","target":"graph","created_at":"2026-05-17T23:55:38Z","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 binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the GMDD makes a decision based on the Hamming distance metric. The proposed algorithm closes half of the gap between conventional iterative bounded distance decoding (iBDD) and turbo product decoding based on the Chase--Pyndiah algorithm, at the expense of some increase in complexity. Furthermore, the proposed algorithm entails only a limited increase in data flow compared to iBDD.","authors_text":"Alexandre Graell i Amat, Alireza Sheikh, Gianluigi Liva","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T19:46:19Z","title":"Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02914","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:07313d557fed7bee025f7f54a894c6edf57c59a262771181f6ebab95755182eb","target":"record","created_at":"2026-05-17T23:55:38Z","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":"7cd0a43658870cc3fb5a6d10d9b373927bd3990372dcb4005ff8a9c9887f2d43","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-09T19:46:19Z","title_canon_sha256":"aac8e2b905fdcaa09bf40d974257fccb501982edfff5ba857ce5a0538c3f7520"},"schema_version":"1.0","source":{"id":"1901.02914","kind":"arxiv","version":2}},"canonical_sha256":"4400b645ba519d9490cf861d7ab9319a5b8ddb271c6877bd64ce2e8b2b133886","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4400b645ba519d9490cf861d7ab9319a5b8ddb271c6877bd64ce2e8b2b133886","first_computed_at":"2026-05-17T23:55:38.130484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:38.130484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hnibfalwn1VJKbour3FQ3zkqrVQ+XatTDAmecfby/60g4R9sjXsxu12pnosJhRFjTNxLQ0ZZ0oGoVmTN4k3ZDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:38.130995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02914","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07313d557fed7bee025f7f54a894c6edf57c59a262771181f6ebab95755182eb","sha256:b4df8f96841ec854661be6cf7cb4701ac2bf4c2bafaff79f12a6bd7ef769ff54"],"state_sha256":"90fa9adec85311d925d53a4249cbeaeebefa0e619ae9b0f2393f0ef04618b16d"}