{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FMIUPIUVZZYCDQPHEXDHXYX456","short_pith_number":"pith:FMIUPIUV","schema_version":"1.0","canonical_sha256":"2b1147a295ce7021c1e725c67be2fcefb6e6b39529c1494fbf376005a57f7cf1","source":{"kind":"arxiv","id":"1804.02276","version":3},"attestation_state":"computed","paper":{"title":"End-to-End Learning of Communications Systems Without a Channel Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Fay\\c{c}al Ait Aoudia, Jakob Hoydis","submitted_at":"2018-04-06T14:01:00Z","abstract_excerpt":"The idea of end-to-end learning of communications systems through neural network -based autoencoders has the shortcoming that it requires a differentiable channel model. We present in this paper a novel learning algorithm which alleviates this problem. The algorithm iterates between supervised training of the receiver and reinforcement learning -based training of the transmitter. We demonstrate that this approach works as well as fully supervised methods on additive white Gaussian noise (AWGN) and Rayleigh block-fading (RBF) channels. Surprisingly, while our method converges slower on AWGN cha"},"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.02276","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-06T14:01:00Z","cross_cats_sorted":["cs.AI","math.IT","stat.ML"],"title_canon_sha256":"0b29dfa71422dfa17a0a1f7f1b3bb2cca5e5ffbca416f8ae8bd8af9117460e6f","abstract_canon_sha256":"369591c538137fc067f6ba15988ad5447a4fa314feab9fe0550ba96f93b623e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:01.851505Z","signature_b64":"Lmyg6dR/n2szVdyNkU5lAHVupwoImjEkPcfMln81gAVEZtYH30QAdUE0AKEV54REOFyNqCUE9376qZS0kM6/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b1147a295ce7021c1e725c67be2fcefb6e6b39529c1494fbf376005a57f7cf1","last_reissued_at":"2026-05-17T23:59:01.851083Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:01.851083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-End Learning of Communications Systems Without a Channel Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Fay\\c{c}al Ait Aoudia, Jakob Hoydis","submitted_at":"2018-04-06T14:01:00Z","abstract_excerpt":"The idea of end-to-end learning of communications systems through neural network -based autoencoders has the shortcoming that it requires a differentiable channel model. We present in this paper a novel learning algorithm which alleviates this problem. The algorithm iterates between supervised training of the receiver and reinforcement learning -based training of the transmitter. We demonstrate that this approach works as well as fully supervised methods on additive white Gaussian noise (AWGN) and Rayleigh block-fading (RBF) channels. Surprisingly, while our method converges slower on AWGN cha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02276","kind":"arxiv","version":3},"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.02276","created_at":"2026-05-17T23:59:01.851142+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.02276v3","created_at":"2026-05-17T23:59:01.851142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02276","created_at":"2026-05-17T23:59:01.851142+00:00"},{"alias_kind":"pith_short_12","alias_value":"FMIUPIUVZZYC","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FMIUPIUVZZYCDQPH","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FMIUPIUV","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04685","citing_title":"Learn to Compress CSI and Allocate Resources in Vehicular Networks","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FMIUPIUVZZYCDQPHEXDHXYX456","json":"https://pith.science/pith/FMIUPIUVZZYCDQPHEXDHXYX456.json","graph_json":"https://pith.science/api/pith-number/FMIUPIUVZZYCDQPHEXDHXYX456/graph.json","events_json":"https://pith.science/api/pith-number/FMIUPIUVZZYCDQPHEXDHXYX456/events.json","paper":"https://pith.science/paper/FMIUPIUV"},"agent_actions":{"view_html":"https://pith.science/pith/FMIUPIUVZZYCDQPHEXDHXYX456","download_json":"https://pith.science/pith/FMIUPIUVZZYCDQPHEXDHXYX456.json","view_paper":"https://pith.science/paper/FMIUPIUV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.02276&json=true","fetch_graph":"https://pith.science/api/pith-number/FMIUPIUVZZYCDQPHEXDHXYX456/graph.json","fetch_events":"https://pith.science/api/pith-number/FMIUPIUVZZYCDQPHEXDHXYX456/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FMIUPIUVZZYCDQPHEXDHXYX456/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FMIUPIUVZZYCDQPHEXDHXYX456/action/storage_attestation","attest_author":"https://pith.science/pith/FMIUPIUVZZYCDQPHEXDHXYX456/action/author_attestation","sign_citation":"https://pith.science/pith/FMIUPIUVZZYCDQPHEXDHXYX456/action/citation_signature","submit_replication":"https://pith.science/pith/FMIUPIUVZZYCDQPHEXDHXYX456/action/replication_record"}},"created_at":"2026-05-17T23:59:01.851142+00:00","updated_at":"2026-05-17T23:59:01.851142+00:00"}