{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WQWEQMGALZQJARK4SLZHQVQJLE","short_pith_number":"pith:WQWEQMGA","schema_version":"1.0","canonical_sha256":"b42c4830c05e6090455c92f27856095938c9b983aa3273f8aeeaeec4f6d5e8ec","source":{"kind":"arxiv","id":"1804.07675","version":2},"attestation_state":"computed","paper":{"title":"Achievable Information Rates for Nonlinear Fiber Communication via End-to-end Autoencoder Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Christian H\\\"ager, Henk Wymeersch, Nil Garcia, Shen Li","submitted_at":"2018-04-20T15:30:06Z","abstract_excerpt":"Machine learning is used to compute achievable information rates (AIRs) for a simplified fiber channel. The approach jointly optimizes the input distribution (constellation shaping) and the auxiliary channel distribution to compute AIRs without explicit channel knowledge in an end-to-end fashion."},"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":"1804.07675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-20T15:30:06Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"3def85904fa23a5ba3dcea7e8768103bf60028998d1247090502db0d618d161a","abstract_canon_sha256":"c653fad3d8b792a478ea5b14295971401a1fda17a24d60a9c3ce5d74de633cb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:39.100477Z","signature_b64":"HW86UxOuSNC3rSFtHAEtu4v5sfxUyyvUv8116oWD8oae+/4pD8tT89kx1MmxxVznhDQu0zJjWm6FEvpe3y7lCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b42c4830c05e6090455c92f27856095938c9b983aa3273f8aeeaeec4f6d5e8ec","last_reissued_at":"2026-05-18T00:05:39.099889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:39.099889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achievable Information Rates for Nonlinear Fiber Communication via End-to-end Autoencoder Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Christian H\\\"ager, Henk Wymeersch, Nil Garcia, Shen Li","submitted_at":"2018-04-20T15:30:06Z","abstract_excerpt":"Machine learning is used to compute achievable information rates (AIRs) for a simplified fiber channel. The approach jointly optimizes the input distribution (constellation shaping) and the auxiliary channel distribution to compute AIRs without explicit channel knowledge in an end-to-end fashion."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07675","kind":"arxiv","version":2},"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":"1804.07675","created_at":"2026-05-18T00:05:39.099980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07675v2","created_at":"2026-05-18T00:05:39.099980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07675","created_at":"2026-05-18T00:05:39.099980+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQWEQMGALZQJ","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQWEQMGALZQJARK4","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQWEQMGA","created_at":"2026-05-18T12:33:01.666342+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/WQWEQMGALZQJARK4SLZHQVQJLE","json":"https://pith.science/pith/WQWEQMGALZQJARK4SLZHQVQJLE.json","graph_json":"https://pith.science/api/pith-number/WQWEQMGALZQJARK4SLZHQVQJLE/graph.json","events_json":"https://pith.science/api/pith-number/WQWEQMGALZQJARK4SLZHQVQJLE/events.json","paper":"https://pith.science/paper/WQWEQMGA"},"agent_actions":{"view_html":"https://pith.science/pith/WQWEQMGALZQJARK4SLZHQVQJLE","download_json":"https://pith.science/pith/WQWEQMGALZQJARK4SLZHQVQJLE.json","view_paper":"https://pith.science/paper/WQWEQMGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07675&json=true","fetch_graph":"https://pith.science/api/pith-number/WQWEQMGALZQJARK4SLZHQVQJLE/graph.json","fetch_events":"https://pith.science/api/pith-number/WQWEQMGALZQJARK4SLZHQVQJLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQWEQMGALZQJARK4SLZHQVQJLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQWEQMGALZQJARK4SLZHQVQJLE/action/storage_attestation","attest_author":"https://pith.science/pith/WQWEQMGALZQJARK4SLZHQVQJLE/action/author_attestation","sign_citation":"https://pith.science/pith/WQWEQMGALZQJARK4SLZHQVQJLE/action/citation_signature","submit_replication":"https://pith.science/pith/WQWEQMGALZQJARK4SLZHQVQJLE/action/replication_record"}},"created_at":"2026-05-18T00:05:39.099980+00:00","updated_at":"2026-05-18T00:05:39.099980+00:00"}