{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VYNMN4SHI325XPEKRFWFH7335Q","short_pith_number":"pith:VYNMN4SH","schema_version":"1.0","canonical_sha256":"ae1ac6f24746f5dbbc8a896c53ff7bec038f74e4292562916c12eb98f55279ef","source":{"kind":"arxiv","id":"1802.06832","version":1},"attestation_state":"computed","paper":{"title":"Deep Learning for Joint Source-Channel Coding of Text","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Goldsmith, Milind Rao, Nariman Farsad","submitted_at":"2018-02-19T20:11:36Z","abstract_excerpt":"We consider the problem of joint source and channel coding of structured data such as natural language over a noisy channel. The typical approach to this problem in both theory and practice involves performing source coding to first compress the text and then channel coding to add robustness for the transmission across the channel. This approach is optimal in terms of minimizing end-to-end distortion with arbitrarily large block lengths of both the source and channel codes when transmission is over discrete memoryless channels. However, the optimality of this approach is no longer ensured for "},"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":"1802.06832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-19T20:11:36Z","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"title_canon_sha256":"81a52cae2f8aba641bd9fcd5943bd7ce5f94732f1d0584e334041c981bf4b96e","abstract_canon_sha256":"cab08bf99fe39d5a2926b32bfa6833fb1796f627a1e2e215a66aab6e5897b287"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:54.248595Z","signature_b64":"mr6SfO+5w7+4mffQ7XKp3BkV/TCk5LBhl5snL51pyfvVHWwhyYGsOvXFGfx39kpQi4nDSI2KzvAywY09mJMjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae1ac6f24746f5dbbc8a896c53ff7bec038f74e4292562916c12eb98f55279ef","last_reissued_at":"2026-05-18T00:22:54.248209Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:54.248209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Learning for Joint Source-Channel Coding of Text","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Goldsmith, Milind Rao, Nariman Farsad","submitted_at":"2018-02-19T20:11:36Z","abstract_excerpt":"We consider the problem of joint source and channel coding of structured data such as natural language over a noisy channel. The typical approach to this problem in both theory and practice involves performing source coding to first compress the text and then channel coding to add robustness for the transmission across the channel. This approach is optimal in terms of minimizing end-to-end distortion with arbitrarily large block lengths of both the source and channel codes when transmission is over discrete memoryless channels. However, the optimality of this approach is no longer ensured for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06832","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":"1802.06832","created_at":"2026-05-18T00:22:54.248272+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06832v1","created_at":"2026-05-18T00:22:54.248272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06832","created_at":"2026-05-18T00:22:54.248272+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYNMN4SHI325","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYNMN4SHI325XPEK","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYNMN4SH","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.02148","citing_title":"Large-Scale Model Enabled Semantic Communication Based on Robust Knowledge Distillation","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VYNMN4SHI325XPEKRFWFH7335Q","json":"https://pith.science/pith/VYNMN4SHI325XPEKRFWFH7335Q.json","graph_json":"https://pith.science/api/pith-number/VYNMN4SHI325XPEKRFWFH7335Q/graph.json","events_json":"https://pith.science/api/pith-number/VYNMN4SHI325XPEKRFWFH7335Q/events.json","paper":"https://pith.science/paper/VYNMN4SH"},"agent_actions":{"view_html":"https://pith.science/pith/VYNMN4SHI325XPEKRFWFH7335Q","download_json":"https://pith.science/pith/VYNMN4SHI325XPEKRFWFH7335Q.json","view_paper":"https://pith.science/paper/VYNMN4SH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06832&json=true","fetch_graph":"https://pith.science/api/pith-number/VYNMN4SHI325XPEKRFWFH7335Q/graph.json","fetch_events":"https://pith.science/api/pith-number/VYNMN4SHI325XPEKRFWFH7335Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYNMN4SHI325XPEKRFWFH7335Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYNMN4SHI325XPEKRFWFH7335Q/action/storage_attestation","attest_author":"https://pith.science/pith/VYNMN4SHI325XPEKRFWFH7335Q/action/author_attestation","sign_citation":"https://pith.science/pith/VYNMN4SHI325XPEKRFWFH7335Q/action/citation_signature","submit_replication":"https://pith.science/pith/VYNMN4SHI325XPEKRFWFH7335Q/action/replication_record"}},"created_at":"2026-05-18T00:22:54.248272+00:00","updated_at":"2026-05-18T00:22:54.248272+00:00"}