{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5OWHNQZGQOV66DMSPQBAPXHC2E","short_pith_number":"pith:5OWHNQZG","schema_version":"1.0","canonical_sha256":"ebac76c32683abef0d927c0207dce2d108e6a773ea86327fdcbb85dcb07e31c2","source":{"kind":"arxiv","id":"2108.06028","version":1},"attestation_state":"computed","paper":{"title":"DeepIC: Coding for Interference Channels via Deep Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.IT"],"primary_cat":"cs.IT","authors_text":"Hyeji Kim, Karl Chahine, Nanyang Ye","submitted_at":"2021-08-13T02:23:30Z","abstract_excerpt":"The two-user interference channel is a model for multi one-to-one communications, where two transmitters wish to communicate with their corresponding receivers via a shared wireless medium. Two most common and simple coding schemes are time division (TD) and treating interference as noise (TIN). Interestingly, it is shown that there exists an asymptotic scheme, called Han-Kobayashi scheme, that performs better than TD and TIN. However, Han-Kobayashi scheme has impractically high complexity and is designed for asymptotic settings, which leads to a gap between information theory and practice.\n  "},"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":"2108.06028","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-08-13T02:23:30Z","cross_cats_sorted":["cs.AI","math.IT"],"title_canon_sha256":"2d3295381d827bc379fd08070407c6054daa5de1ce91481321b36daf7b149126","abstract_canon_sha256":"2c07caad3d82edefa6318164a2035a5b78437b3652531931a481613e806dbed2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:05:36.703280Z","signature_b64":"3UIirRhXWFakR5vLEPFrvW1ezrYyWjjG9vlFBTaKT7GA3pWn5qjyLdBgzTPi7H+HwlkB4C4uphhK1E7ix2s8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebac76c32683abef0d927c0207dce2d108e6a773ea86327fdcbb85dcb07e31c2","last_reissued_at":"2026-07-05T03:05:36.702854Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:05:36.702854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DeepIC: Coding for Interference Channels via Deep Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.IT"],"primary_cat":"cs.IT","authors_text":"Hyeji Kim, Karl Chahine, Nanyang Ye","submitted_at":"2021-08-13T02:23:30Z","abstract_excerpt":"The two-user interference channel is a model for multi one-to-one communications, where two transmitters wish to communicate with their corresponding receivers via a shared wireless medium. Two most common and simple coding schemes are time division (TD) and treating interference as noise (TIN). Interestingly, it is shown that there exists an asymptotic scheme, called Han-Kobayashi scheme, that performs better than TD and TIN. However, Han-Kobayashi scheme has impractically high complexity and is designed for asymptotic settings, which leads to a gap between information theory and practice.\n  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.06028","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/2108.06028/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":"2108.06028","created_at":"2026-07-05T03:05:36.702909+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.06028v1","created_at":"2026-07-05T03:05:36.702909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.06028","created_at":"2026-07-05T03:05:36.702909+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OWHNQZGQOV6","created_at":"2026-07-05T03:05:36.702909+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OWHNQZGQOV66DMS","created_at":"2026-07-05T03:05:36.702909+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OWHNQZG","created_at":"2026-07-05T03:05:36.702909+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/5OWHNQZGQOV66DMSPQBAPXHC2E","json":"https://pith.science/pith/5OWHNQZGQOV66DMSPQBAPXHC2E.json","graph_json":"https://pith.science/api/pith-number/5OWHNQZGQOV66DMSPQBAPXHC2E/graph.json","events_json":"https://pith.science/api/pith-number/5OWHNQZGQOV66DMSPQBAPXHC2E/events.json","paper":"https://pith.science/paper/5OWHNQZG"},"agent_actions":{"view_html":"https://pith.science/pith/5OWHNQZGQOV66DMSPQBAPXHC2E","download_json":"https://pith.science/pith/5OWHNQZGQOV66DMSPQBAPXHC2E.json","view_paper":"https://pith.science/paper/5OWHNQZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.06028&json=true","fetch_graph":"https://pith.science/api/pith-number/5OWHNQZGQOV66DMSPQBAPXHC2E/graph.json","fetch_events":"https://pith.science/api/pith-number/5OWHNQZGQOV66DMSPQBAPXHC2E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OWHNQZGQOV66DMSPQBAPXHC2E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OWHNQZGQOV66DMSPQBAPXHC2E/action/storage_attestation","attest_author":"https://pith.science/pith/5OWHNQZGQOV66DMSPQBAPXHC2E/action/author_attestation","sign_citation":"https://pith.science/pith/5OWHNQZGQOV66DMSPQBAPXHC2E/action/citation_signature","submit_replication":"https://pith.science/pith/5OWHNQZGQOV66DMSPQBAPXHC2E/action/replication_record"}},"created_at":"2026-07-05T03:05:36.702909+00:00","updated_at":"2026-07-05T03:05:36.702909+00:00"}