{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4XUWO3ZIT4BV5CHPWZ3ARR4LTG","short_pith_number":"pith:4XUWO3ZI","canonical_record":{"source":{"id":"1811.07557","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-19T08:43:15Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"131017467d2f045d5190b157bde8f17b2ac288ed85034448502024fda931f4c1","abstract_canon_sha256":"e1275935dde8af8b57f0d3cb04577ebad0583d566ebbcc55d3cbfeae29679f8c"},"schema_version":"1.0"},"canonical_sha256":"e5e9676f289f035e88efb67608c78b99b9470704b2285aa2aa08a7ab767e65cf","source":{"kind":"arxiv","id":"1811.07557","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07557","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07557v3","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07557","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"pith_short_12","alias_value":"4XUWO3ZIT4BV","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4XUWO3ZIT4BV5CHP","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4XUWO3ZI","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4XUWO3ZIT4BV5CHPWZ3ARR4LTG","target":"record","payload":{"canonical_record":{"source":{"id":"1811.07557","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-19T08:43:15Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"131017467d2f045d5190b157bde8f17b2ac288ed85034448502024fda931f4c1","abstract_canon_sha256":"e1275935dde8af8b57f0d3cb04577ebad0583d566ebbcc55d3cbfeae29679f8c"},"schema_version":"1.0"},"canonical_sha256":"e5e9676f289f035e88efb67608c78b99b9470704b2285aa2aa08a7ab767e65cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:19.146663Z","signature_b64":"fBmFLZSPI0QYq/admmbsizd+VKzcqKqWXZ0IxGwDwv2V05tW2TxFjCnG3Jx6UGNqsmiXfYokS0VabFmDbVUUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5e9676f289f035e88efb67608c78b99b9470704b2285aa2aa08a7ab767e65cf","last_reissued_at":"2026-05-17T23:46:19.145924Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:19.145924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.07557","source_version":3,"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-17T23:46:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"glZ4eA7L9eDKfwarGWi8vVyjZ2lrmAu7KcmSww9DLiQw1MumbMVGTrmW2CPP01R1aHoLRLXCGwkml98nIeNRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:57:39.830411Z"},"content_sha256":"05d79aeae4fe6ec03a6999c1a0c7bab68b5c96691b2c90a0a92725b8f47bfb86","schema_version":"1.0","event_id":"sha256:05d79aeae4fe6ec03a6999c1a0c7bab68b5c96691b2c90a0a92725b8f47bfb86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4XUWO3ZIT4BV5CHPWZ3ARR4LTG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Joint Source-Channel Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aditya Grover, Kedar Tatwawadi, Kristy Choi, Stefano Ermon, Tsachy Weissman","submitted_at":"2018-11-19T08:43:15Z","abstract_excerpt":"For reliable transmission across a noisy communication channel, classical results from information theory show that it is asymptotically optimal to separate out the source and channel coding processes. However, this decomposition can fall short in the finite bit-length regime, as it requires non-trivial tuning of hand-crafted codes and assumes infinite computational power for decoding. In this work, we propose to jointly learn the encoding and decoding processes using a new discrete variational autoencoder model. By adding noise into the latent codes to simulate the channel during training, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07557","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"},"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-17T23:46:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wEm94r7dgj8BNWcPzqCHXA+DRwjMUT9WmWDu7peeEAxG8HjzcoZbDhtkBonu8XsYuRcmDznzMJBank0+Sv9XCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:57:39.830779Z"},"content_sha256":"837aa70afe4941477ecd8aea9b529347349d87498ca20fa1fd3f84e7e4391e07","schema_version":"1.0","event_id":"sha256:837aa70afe4941477ecd8aea9b529347349d87498ca20fa1fd3f84e7e4391e07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4XUWO3ZIT4BV5CHPWZ3ARR4LTG/bundle.json","state_url":"https://pith.science/pith/4XUWO3ZIT4BV5CHPWZ3ARR4LTG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4XUWO3ZIT4BV5CHPWZ3ARR4LTG/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-27T09:57:39Z","links":{"resolver":"https://pith.science/pith/4XUWO3ZIT4BV5CHPWZ3ARR4LTG","bundle":"https://pith.science/pith/4XUWO3ZIT4BV5CHPWZ3ARR4LTG/bundle.json","state":"https://pith.science/pith/4XUWO3ZIT4BV5CHPWZ3ARR4LTG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4XUWO3ZIT4BV5CHPWZ3ARR4LTG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4XUWO3ZIT4BV5CHPWZ3ARR4LTG","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":"e1275935dde8af8b57f0d3cb04577ebad0583d566ebbcc55d3cbfeae29679f8c","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-19T08:43:15Z","title_canon_sha256":"131017467d2f045d5190b157bde8f17b2ac288ed85034448502024fda931f4c1"},"schema_version":"1.0","source":{"id":"1811.07557","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07557","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07557v3","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07557","created_at":"2026-05-17T23:46:19Z"},{"alias_kind":"pith_short_12","alias_value":"4XUWO3ZIT4BV","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4XUWO3ZIT4BV5CHP","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4XUWO3ZI","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:837aa70afe4941477ecd8aea9b529347349d87498ca20fa1fd3f84e7e4391e07","target":"graph","created_at":"2026-05-17T23:46:19Z","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":"For reliable transmission across a noisy communication channel, classical results from information theory show that it is asymptotically optimal to separate out the source and channel coding processes. However, this decomposition can fall short in the finite bit-length regime, as it requires non-trivial tuning of hand-crafted codes and assumes infinite computational power for decoding. In this work, we propose to jointly learn the encoding and decoding processes using a new discrete variational autoencoder model. By adding noise into the latent codes to simulate the channel during training, we","authors_text":"Aditya Grover, Kedar Tatwawadi, Kristy Choi, Stefano Ermon, Tsachy Weissman","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-19T08:43:15Z","title":"Neural Joint Source-Channel Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07557","kind":"arxiv","version":3},"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:05d79aeae4fe6ec03a6999c1a0c7bab68b5c96691b2c90a0a92725b8f47bfb86","target":"record","created_at":"2026-05-17T23:46:19Z","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":"e1275935dde8af8b57f0d3cb04577ebad0583d566ebbcc55d3cbfeae29679f8c","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-19T08:43:15Z","title_canon_sha256":"131017467d2f045d5190b157bde8f17b2ac288ed85034448502024fda931f4c1"},"schema_version":"1.0","source":{"id":"1811.07557","kind":"arxiv","version":3}},"canonical_sha256":"e5e9676f289f035e88efb67608c78b99b9470704b2285aa2aa08a7ab767e65cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5e9676f289f035e88efb67608c78b99b9470704b2285aa2aa08a7ab767e65cf","first_computed_at":"2026-05-17T23:46:19.145924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:19.145924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fBmFLZSPI0QYq/admmbsizd+VKzcqKqWXZ0IxGwDwv2V05tW2TxFjCnG3Jx6UGNqsmiXfYokS0VabFmDbVUUDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:19.146663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07557","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05d79aeae4fe6ec03a6999c1a0c7bab68b5c96691b2c90a0a92725b8f47bfb86","sha256:837aa70afe4941477ecd8aea9b529347349d87498ca20fa1fd3f84e7e4391e07"],"state_sha256":"1d6d3d0f36f2819d56cfcbbbe5b0dc0b584de938fa84c0d0663611f3cda8a2cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iyncNPD3cS01CIxYV2DPQbx4wqFnTkXpG0mCcZRwlZd3DyudaYbRaWg/pngOjjVbTIMnXZjPtnmP9nMURhDdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:57:39.833003Z","bundle_sha256":"7673cee48b854735f54fdf45c6bc491fb3c8206a46363e0118c25047a789a196"}}