{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RR32FXLIFVMSW46426M6TYMXBV","short_pith_number":"pith:RR32FXLI","canonical_record":{"source":{"id":"1705.07011","kind":"arxiv","version":7},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T14:21:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de184435f0f99e042dc43d5eb1071e51622d70d0bb10003624e68ad7ea27aa10","abstract_canon_sha256":"77bbeab034ae68cf18fb8a1e0c5a97df90b96a840029243f577f3ce7c22a04ce"},"schema_version":"1.0"},"canonical_sha256":"8c77a2dd682d592b73dcd799e9e1970d62aa6046986974f2021ddb451f6b35aa","source":{"kind":"arxiv","id":"1705.07011","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07011","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07011v7","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07011","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"RR32FXLIFVMS","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RR32FXLIFVMSW464","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RR32FXLI","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RR32FXLIFVMSW46426M6TYMXBV","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07011","kind":"arxiv","version":7},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T14:21:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de184435f0f99e042dc43d5eb1071e51622d70d0bb10003624e68ad7ea27aa10","abstract_canon_sha256":"77bbeab034ae68cf18fb8a1e0c5a97df90b96a840029243f577f3ce7c22a04ce"},"schema_version":"1.0"},"canonical_sha256":"8c77a2dd682d592b73dcd799e9e1970d62aa6046986974f2021ddb451f6b35aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:31.116646Z","signature_b64":"TGoeAmSCz2MJ/SDt02FsaAM3IS6028S2PGe68CjIhTL8mwg2ZaWRyQOWC++U1u1IFVAa4NBsIC2i4kuFlXKtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c77a2dd682d592b73dcd799e9e1970d62aa6046986974f2021ddb451f6b35aa","last_reissued_at":"2026-05-18T00:31:31.115970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:31.115970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07011","source_version":7,"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:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYAXFm1ldTcJwuPYeEHkXBNl9atG1eY/nus9HFEj/eNk9G1Dl+PSev07TzTxJRgNEdRNURUwa36Hcxq633mhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:58:43.665584Z"},"content_sha256":"45ab72fd91cb0be801c9dfc9d1639d4e78756ac8296fcdc57a7e9a59f6890b6c","schema_version":"1.0","event_id":"sha256:45ab72fd91cb0be801c9dfc9d1639d4e78756ac8296fcdc57a7e9a59f6890b6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RR32FXLIFVMSW46426M6TYMXBV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achievable Information Rates for Coded Modulation with Hard Decision Decoding for Coherent Fiber-Optic Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Alireza Sheikh, Gianluigi Liva","submitted_at":"2017-05-19T14:21:07Z","abstract_excerpt":"We analyze the achievable information rates (AIRs) for coded modulation schemes with QAM constellations with both bit-wise and symbol-wise decoders, corresponding to the case where a binary code is used in combination with a higher-order modulation using the bit-interleaved coded modulation (BICM) paradigm and to the case where a nonbinary code over a field matched to the constellation size is used, respectively. In particular, we consider hard decision decoding, which is the preferable option for fiber-optic communication systems where decoding complexity is a concern. Recently, Liga \\emph{et"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07011","kind":"arxiv","version":7},"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:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q3PVsv/fQkBjmPwne/bdm2BAntd0qFGy0pijyT7p4EpQBrtwO6Le7ZZyO16Zb9jclxo62ulqFpvx9TZcL/9HAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:58:43.666155Z"},"content_sha256":"1448a7c32b8a797a87e6b3dcfea7fa9456b341d26c4bd15c0cf82b84e5b9505f","schema_version":"1.0","event_id":"sha256:1448a7c32b8a797a87e6b3dcfea7fa9456b341d26c4bd15c0cf82b84e5b9505f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RR32FXLIFVMSW46426M6TYMXBV/bundle.json","state_url":"https://pith.science/pith/RR32FXLIFVMSW46426M6TYMXBV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RR32FXLIFVMSW46426M6TYMXBV/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-28T03:58:43Z","links":{"resolver":"https://pith.science/pith/RR32FXLIFVMSW46426M6TYMXBV","bundle":"https://pith.science/pith/RR32FXLIFVMSW46426M6TYMXBV/bundle.json","state":"https://pith.science/pith/RR32FXLIFVMSW46426M6TYMXBV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RR32FXLIFVMSW46426M6TYMXBV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RR32FXLIFVMSW46426M6TYMXBV","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":"77bbeab034ae68cf18fb8a1e0c5a97df90b96a840029243f577f3ce7c22a04ce","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T14:21:07Z","title_canon_sha256":"de184435f0f99e042dc43d5eb1071e51622d70d0bb10003624e68ad7ea27aa10"},"schema_version":"1.0","source":{"id":"1705.07011","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07011","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07011v7","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07011","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"RR32FXLIFVMS","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RR32FXLIFVMSW464","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RR32FXLI","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:1448a7c32b8a797a87e6b3dcfea7fa9456b341d26c4bd15c0cf82b84e5b9505f","target":"graph","created_at":"2026-05-18T00:31:31Z","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 analyze the achievable information rates (AIRs) for coded modulation schemes with QAM constellations with both bit-wise and symbol-wise decoders, corresponding to the case where a binary code is used in combination with a higher-order modulation using the bit-interleaved coded modulation (BICM) paradigm and to the case where a nonbinary code over a field matched to the constellation size is used, respectively. In particular, we consider hard decision decoding, which is the preferable option for fiber-optic communication systems where decoding complexity is a concern. Recently, Liga \\emph{et","authors_text":"Alexandre Graell i Amat, Alireza Sheikh, Gianluigi Liva","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T14:21:07Z","title":"Achievable Information Rates for Coded Modulation with Hard Decision Decoding for Coherent Fiber-Optic Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07011","kind":"arxiv","version":7},"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:45ab72fd91cb0be801c9dfc9d1639d4e78756ac8296fcdc57a7e9a59f6890b6c","target":"record","created_at":"2026-05-18T00:31:31Z","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":"77bbeab034ae68cf18fb8a1e0c5a97df90b96a840029243f577f3ce7c22a04ce","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T14:21:07Z","title_canon_sha256":"de184435f0f99e042dc43d5eb1071e51622d70d0bb10003624e68ad7ea27aa10"},"schema_version":"1.0","source":{"id":"1705.07011","kind":"arxiv","version":7}},"canonical_sha256":"8c77a2dd682d592b73dcd799e9e1970d62aa6046986974f2021ddb451f6b35aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c77a2dd682d592b73dcd799e9e1970d62aa6046986974f2021ddb451f6b35aa","first_computed_at":"2026-05-18T00:31:31.115970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:31.115970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TGoeAmSCz2MJ/SDt02FsaAM3IS6028S2PGe68CjIhTL8mwg2ZaWRyQOWC++U1u1IFVAa4NBsIC2i4kuFlXKtDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:31.116646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07011","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45ab72fd91cb0be801c9dfc9d1639d4e78756ac8296fcdc57a7e9a59f6890b6c","sha256:1448a7c32b8a797a87e6b3dcfea7fa9456b341d26c4bd15c0cf82b84e5b9505f"],"state_sha256":"edee0dd2a0165cba642440bd14be8ed087e834c1694364b43abca57b0b344c0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RTpYUtslZ1Y2NcgM8qUAliOK4iToqZLLX60tdY5aVaHUmglLgpxWc7OxMndhuFYBclje0hia6cuoC/EWqY/wBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:58:43.668884Z","bundle_sha256":"0893197b022c99ed6b813d68b62b19f4c8741a78b0cf56ce231774902d072865"}}