{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UW7RN2DDFHDGC3ZCBJXUMYEE4R","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":"7749fc4afbae4ac53a5a11ce4dd3c43982e9445ab80cc962267c48bd184f2757","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-14T16:35:05Z","title_canon_sha256":"b3e729e792a59006e7dcf3553c860bba2b4137fa0960170eeaa3336e9a95388c"},"schema_version":"1.0","source":{"id":"1805.05270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05270","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05270v1","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05270","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"UW7RN2DDFHDG","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UW7RN2DDFHDGC3ZC","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UW7RN2DD","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:3e1189894c43efcdeb41c5265b36efdc7b939c7fe4626679d9fc9e4064a5e0d6","target":"graph","created_at":"2026-05-18T00:16:03Z","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 modified iterative bounded distance decoding of product codes. The proposed algorithm is based on exchanging hard messages iteratively and exploiting channel reliabilities to make hard decisions at each iteration. Performance improvements up to 0.26 dB are achieved.","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":"2018-05-14T16:35:05Z","title":"Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05270","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:022fde365ee065499fc6f0e868f44496119bf55e06694c19f796b72fff82f0f8","target":"record","created_at":"2026-05-18T00:16:03Z","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":"7749fc4afbae4ac53a5a11ce4dd3c43982e9445ab80cc962267c48bd184f2757","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-14T16:35:05Z","title_canon_sha256":"b3e729e792a59006e7dcf3553c860bba2b4137fa0960170eeaa3336e9a95388c"},"schema_version":"1.0","source":{"id":"1805.05270","kind":"arxiv","version":1}},"canonical_sha256":"a5bf16e86329c6616f220a6f466084e452b1cf0106920b4eac17235f1d2bcabe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5bf16e86329c6616f220a6f466084e452b1cf0106920b4eac17235f1d2bcabe","first_computed_at":"2026-05-18T00:16:03.567094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:03.567094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mPy9p/RQif9WgvmzpL7RAAY86Rf1a/B8+k56jGMOYgETYx1nNKpNkUlJFeTBfKSNyWWmvA093VQOFQinaQFDCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:03.567502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:022fde365ee065499fc6f0e868f44496119bf55e06694c19f796b72fff82f0f8","sha256:3e1189894c43efcdeb41c5265b36efdc7b939c7fe4626679d9fc9e4064a5e0d6"],"state_sha256":"97668497f0c685e84579f24eee844286997dbe36feda12339fdecb21c3780885"}