{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y67NMZRRHKUX6UWEQBZXAAMLID","short_pith_number":"pith:Y67NMZRR","schema_version":"1.0","canonical_sha256":"c7bed666313aa97f52c4807370018b40e0d1eb53a6f4083d0669e21885faac1f","source":{"kind":"arxiv","id":"1705.02283","version":1},"attestation_state":"computed","paper":{"title":"Probabilistically-Shaped Coded Modulation with Hard Decision Decoding for Coherent Optical 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, Gianluigi Liva","submitted_at":"2017-05-05T16:13:08Z","abstract_excerpt":"We consider probabilistic shaping to maximize the achievable information rate of coded modulation (CM) with hard decision decoding. The proposed scheme using binary staircase codes outperforms its uniform CM counterpart by more than 1.3 dB for 64-QAM and 5 bits/symbol."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1705.02283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-05T16:13:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fce6f1d25cbc4b8ad38677310a7ac8d1026e18b68cbe7b897a55aaf9709998c2","abstract_canon_sha256":"c4567ebbf4be4b71413a0fd054b8c288d2ea8dc5826513776259f33727b93e28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:58.666718Z","signature_b64":"OBtGt/4htQwKjzVFeccy8VBGaDjBbpU5XOVFl+vhJI+uPeMAKCPU3qb8W8iQBevGbJE0ABQmOP5MTD/gnRcTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7bed666313aa97f52c4807370018b40e0d1eb53a6f4083d0669e21885faac1f","last_reissued_at":"2026-05-18T00:44:58.666334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:58.666334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistically-Shaped Coded Modulation with Hard Decision Decoding for Coherent Optical 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, Gianluigi Liva","submitted_at":"2017-05-05T16:13:08Z","abstract_excerpt":"We consider probabilistic shaping to maximize the achievable information rate of coded modulation (CM) with hard decision decoding. The proposed scheme using binary staircase codes outperforms its uniform CM counterpart by more than 1.3 dB for 64-QAM and 5 bits/symbol."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02283","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.02283","created_at":"2026-05-18T00:44:58.666394+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02283v1","created_at":"2026-05-18T00:44:58.666394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02283","created_at":"2026-05-18T00:44:58.666394+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y67NMZRRHKUX","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y67NMZRRHKUX6UWE","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y67NMZRR","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y67NMZRRHKUX6UWEQBZXAAMLID","json":"https://pith.science/pith/Y67NMZRRHKUX6UWEQBZXAAMLID.json","graph_json":"https://pith.science/api/pith-number/Y67NMZRRHKUX6UWEQBZXAAMLID/graph.json","events_json":"https://pith.science/api/pith-number/Y67NMZRRHKUX6UWEQBZXAAMLID/events.json","paper":"https://pith.science/paper/Y67NMZRR"},"agent_actions":{"view_html":"https://pith.science/pith/Y67NMZRRHKUX6UWEQBZXAAMLID","download_json":"https://pith.science/pith/Y67NMZRRHKUX6UWEQBZXAAMLID.json","view_paper":"https://pith.science/paper/Y67NMZRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02283&json=true","fetch_graph":"https://pith.science/api/pith-number/Y67NMZRRHKUX6UWEQBZXAAMLID/graph.json","fetch_events":"https://pith.science/api/pith-number/Y67NMZRRHKUX6UWEQBZXAAMLID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y67NMZRRHKUX6UWEQBZXAAMLID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y67NMZRRHKUX6UWEQBZXAAMLID/action/storage_attestation","attest_author":"https://pith.science/pith/Y67NMZRRHKUX6UWEQBZXAAMLID/action/author_attestation","sign_citation":"https://pith.science/pith/Y67NMZRRHKUX6UWEQBZXAAMLID/action/citation_signature","submit_replication":"https://pith.science/pith/Y67NMZRRHKUX6UWEQBZXAAMLID/action/replication_record"}},"created_at":"2026-05-18T00:44:58.666394+00:00","updated_at":"2026-05-18T00:44:58.666394+00:00"}