{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CICMOOS5TDQMXMAIOMNDCLXLGQ","short_pith_number":"pith:CICMOOS5","canonical_record":{"source":{"id":"1806.10903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-28T12:02:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"20e4c8d2ffea8109445e14992c20a7e1c693b36789af16fe58761212b537063f","abstract_canon_sha256":"4db69e584157dc41d96730737f8704a4b45f7aa74a7fc930f140469433fc35a7"},"schema_version":"1.0"},"canonical_sha256":"1204c73a5d98e0cbb008731a312eeb342b95854171c2ac5ffd5efef5ca75c361","source":{"kind":"arxiv","id":"1806.10903","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10903","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10903v1","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10903","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"CICMOOS5TDQM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CICMOOS5TDQMXMAI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CICMOOS5","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CICMOOS5TDQMXMAIOMNDCLXLGQ","target":"record","payload":{"canonical_record":{"source":{"id":"1806.10903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-28T12:02:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"20e4c8d2ffea8109445e14992c20a7e1c693b36789af16fe58761212b537063f","abstract_canon_sha256":"4db69e584157dc41d96730737f8704a4b45f7aa74a7fc930f140469433fc35a7"},"schema_version":"1.0"},"canonical_sha256":"1204c73a5d98e0cbb008731a312eeb342b95854171c2ac5ffd5efef5ca75c361","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:07.658391Z","signature_b64":"oD6PD6V20DMuhop1SP493pz1aVZJiTcaLxCr4rg2sj5Tcuycg9x2zYmf8WhGNbgnRBNLZutW/Rd3h7gGLjc6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1204c73a5d98e0cbb008731a312eeb342b95854171c2ac5ffd5efef5ca75c361","last_reissued_at":"2026-05-18T00:12:07.657761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:07.657761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.10903","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-18T00:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nj8jb5B64zc1VyDWVHtaEVWa7QcJN5+ly0KIwRX/PwTBeS0AoZ3Y2bqXgT7ed/85vDvxkE46G5/E5htp+c74DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:10:49.083131Z"},"content_sha256":"8852898f67a60643f58330097248e9e8d40a37b54aa5e6832cf73489e5d8f060","schema_version":"1.0","event_id":"sha256:8852898f67a60643f58330097248e9e8d40a37b54aa5e6832cf73489e5d8f060"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CICMOOS5TDQMXMAIOMNDCLXLGQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Alireza Sheikh, Christian H\\\"ager, Gianluigi Liva, Henry D. Pfister","submitted_at":"2018-06-28T12:02:43Z","abstract_excerpt":"We study low-complexity iterative decoding algorithms for product codes. We revisit two algorithms recently proposed by the authors based on bounded distance decoding (BDD) of the component codes that improve the performance of conventional iterative BDD (iBDD). We then propose a novel decoding algorithm that is based on generalized minimum distance decoding of the component codes. The proposed algorithm closes over 50% of the performance gap between iBDD and turbo product decoding (TPD) based on the Chase-Pyndiah algorithm. Moreover, the algorithm only leads to a limited increase in complexit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10903","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-18T00:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IbndCJXC7Jm6jaUWrpLHxYsNo8t8U1VeNzfERZ6QtZ1P2ihd+2oTGclsHdZQN6owUW+AHPkhGjCkgenfXeY3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:10:49.083837Z"},"content_sha256":"f9495eb9ac3dd8e3e171940be20cf463b282478e4011fca1622dd80a6977297c","schema_version":"1.0","event_id":"sha256:f9495eb9ac3dd8e3e171940be20cf463b282478e4011fca1622dd80a6977297c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CICMOOS5TDQMXMAIOMNDCLXLGQ/bundle.json","state_url":"https://pith.science/pith/CICMOOS5TDQMXMAIOMNDCLXLGQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CICMOOS5TDQMXMAIOMNDCLXLGQ/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-27T16:10:49Z","links":{"resolver":"https://pith.science/pith/CICMOOS5TDQMXMAIOMNDCLXLGQ","bundle":"https://pith.science/pith/CICMOOS5TDQMXMAIOMNDCLXLGQ/bundle.json","state":"https://pith.science/pith/CICMOOS5TDQMXMAIOMNDCLXLGQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CICMOOS5TDQMXMAIOMNDCLXLGQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CICMOOS5TDQMXMAIOMNDCLXLGQ","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":"4db69e584157dc41d96730737f8704a4b45f7aa74a7fc930f140469433fc35a7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-28T12:02:43Z","title_canon_sha256":"20e4c8d2ffea8109445e14992c20a7e1c693b36789af16fe58761212b537063f"},"schema_version":"1.0","source":{"id":"1806.10903","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10903","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10903v1","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10903","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"CICMOOS5TDQM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CICMOOS5TDQMXMAI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CICMOOS5","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:f9495eb9ac3dd8e3e171940be20cf463b282478e4011fca1622dd80a6977297c","target":"graph","created_at":"2026-05-18T00:12:07Z","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 study low-complexity iterative decoding algorithms for product codes. We revisit two algorithms recently proposed by the authors based on bounded distance decoding (BDD) of the component codes that improve the performance of conventional iterative BDD (iBDD). We then propose a novel decoding algorithm that is based on generalized minimum distance decoding of the component codes. The proposed algorithm closes over 50% of the performance gap between iBDD and turbo product decoding (TPD) based on the Chase-Pyndiah algorithm. Moreover, the algorithm only leads to a limited increase in complexit","authors_text":"Alexandre Graell i Amat, Alireza Sheikh, Christian H\\\"ager, Gianluigi Liva, Henry D. Pfister","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-28T12:02:43Z","title":"On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10903","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:8852898f67a60643f58330097248e9e8d40a37b54aa5e6832cf73489e5d8f060","target":"record","created_at":"2026-05-18T00:12:07Z","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":"4db69e584157dc41d96730737f8704a4b45f7aa74a7fc930f140469433fc35a7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-28T12:02:43Z","title_canon_sha256":"20e4c8d2ffea8109445e14992c20a7e1c693b36789af16fe58761212b537063f"},"schema_version":"1.0","source":{"id":"1806.10903","kind":"arxiv","version":1}},"canonical_sha256":"1204c73a5d98e0cbb008731a312eeb342b95854171c2ac5ffd5efef5ca75c361","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1204c73a5d98e0cbb008731a312eeb342b95854171c2ac5ffd5efef5ca75c361","first_computed_at":"2026-05-18T00:12:07.657761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:07.657761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oD6PD6V20DMuhop1SP493pz1aVZJiTcaLxCr4rg2sj5Tcuycg9x2zYmf8WhGNbgnRBNLZutW/Rd3h7gGLjc6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:07.658391Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.10903","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8852898f67a60643f58330097248e9e8d40a37b54aa5e6832cf73489e5d8f060","sha256:f9495eb9ac3dd8e3e171940be20cf463b282478e4011fca1622dd80a6977297c"],"state_sha256":"42ce567d2e70b0d6802df0d8e141c8b27858a16b7db2c858b171142818f27434"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6bAa8qcVGFz14vQ9n/wC+QGA8OnmEfsYITVReIZ47Iy2FwKhIzIY+xK9mwBwow6BRGIAbAScgXWSE2OKd5pXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:10:49.087364Z","bundle_sha256":"954e17dda4cf184bd57cbb3b9b430a32cdfcdc41e966e982e418b36b516a640d"}}