{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:LDLFDDRTPOE7SVE4S7CQSHJLVN","short_pith_number":"pith:LDLFDDRT","schema_version":"1.0","canonical_sha256":"58d6518e337b89f9549c97c5091d2bab415cf2863ae92874c05b7889e3188fc9","source":{"kind":"arxiv","id":"2004.01454","version":1},"attestation_state":"computed","paper":{"title":"Infomax Neural Joint Source-Channel Coding via Adversarial Bit Flip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hao Zhou, Lantao Yu, Minkai Xu, Shuo Shao, Yong Yu, Yuxuan Song","submitted_at":"2020-04-03T10:00:02Z","abstract_excerpt":"Although Shannon theory states that it is asymptotically optimal to separate the source and channel coding as two independent processes, in many practical communication scenarios this decomposition is limited by the finite bit-length and computational power for decoding. Recently, neural joint source-channel coding (NECST) is proposed to sidestep this problem. While it leverages the advancements of amortized inference and deep learning to improve the encoding and decoding process, it still cannot always achieve compelling results in terms of compression and error correction performance due to "},"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":"2004.01454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-04-03T10:00:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"24bf6c1d635faa1e0a81d2eff5cacd7cd2b7ec13cb9c08cbe5b1fe5a1617d343","abstract_canon_sha256":"16936636958d3d5544593b7b0a22b6f917e715b0dd226683f6576381be8e2fcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:52:33.165668Z","signature_b64":"CZsIgEsga5Oqd2TOQcsCWE/8aQGl0FcQwhrxb5tRT/FTy3yw3XXV7eGkUPcUNZQiFYT4PFC3pBm3JlzPLdl8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58d6518e337b89f9549c97c5091d2bab415cf2863ae92874c05b7889e3188fc9","last_reissued_at":"2026-07-05T00:52:33.165289Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:52:33.165289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infomax Neural Joint Source-Channel Coding via Adversarial Bit Flip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hao Zhou, Lantao Yu, Minkai Xu, Shuo Shao, Yong Yu, Yuxuan Song","submitted_at":"2020-04-03T10:00:02Z","abstract_excerpt":"Although Shannon theory states that it is asymptotically optimal to separate the source and channel coding as two independent processes, in many practical communication scenarios this decomposition is limited by the finite bit-length and computational power for decoding. Recently, neural joint source-channel coding (NECST) is proposed to sidestep this problem. While it leverages the advancements of amortized inference and deep learning to improve the encoding and decoding process, it still cannot always achieve compelling results in terms of compression and error correction performance due to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.01454","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.01454/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2004.01454","created_at":"2026-07-05T00:52:33.165369+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.01454v1","created_at":"2026-07-05T00:52:33.165369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.01454","created_at":"2026-07-05T00:52:33.165369+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDLFDDRTPOE7","created_at":"2026-07-05T00:52:33.165369+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDLFDDRTPOE7SVE4","created_at":"2026-07-05T00:52:33.165369+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDLFDDRT","created_at":"2026-07-05T00:52:33.165369+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/LDLFDDRTPOE7SVE4S7CQSHJLVN","json":"https://pith.science/pith/LDLFDDRTPOE7SVE4S7CQSHJLVN.json","graph_json":"https://pith.science/api/pith-number/LDLFDDRTPOE7SVE4S7CQSHJLVN/graph.json","events_json":"https://pith.science/api/pith-number/LDLFDDRTPOE7SVE4S7CQSHJLVN/events.json","paper":"https://pith.science/paper/LDLFDDRT"},"agent_actions":{"view_html":"https://pith.science/pith/LDLFDDRTPOE7SVE4S7CQSHJLVN","download_json":"https://pith.science/pith/LDLFDDRTPOE7SVE4S7CQSHJLVN.json","view_paper":"https://pith.science/paper/LDLFDDRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.01454&json=true","fetch_graph":"https://pith.science/api/pith-number/LDLFDDRTPOE7SVE4S7CQSHJLVN/graph.json","fetch_events":"https://pith.science/api/pith-number/LDLFDDRTPOE7SVE4S7CQSHJLVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDLFDDRTPOE7SVE4S7CQSHJLVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDLFDDRTPOE7SVE4S7CQSHJLVN/action/storage_attestation","attest_author":"https://pith.science/pith/LDLFDDRTPOE7SVE4S7CQSHJLVN/action/author_attestation","sign_citation":"https://pith.science/pith/LDLFDDRTPOE7SVE4S7CQSHJLVN/action/citation_signature","submit_replication":"https://pith.science/pith/LDLFDDRTPOE7SVE4S7CQSHJLVN/action/replication_record"}},"created_at":"2026-07-05T00:52:33.165369+00:00","updated_at":"2026-07-05T00:52:33.165369+00:00"}