{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:5OWHNQZGQOV66DMSPQBAPXHC2E","short_pith_number":"pith:5OWHNQZG","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"},"canonical_sha256":"ebac76c32683abef0d927c0207dce2d108e6a773ea86327fdcbb85dcb07e31c2","source":{"kind":"arxiv","id":"2108.06028","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.06028","created_at":"2026-07-05T03:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"2108.06028v1","created_at":"2026-07-05T03:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.06028","created_at":"2026-07-05T03:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"5OWHNQZGQOV6","created_at":"2026-07-05T03:05:36Z"},{"alias_kind":"pith_short_16","alias_value":"5OWHNQZGQOV66DMS","created_at":"2026-07-05T03:05:36Z"},{"alias_kind":"pith_short_8","alias_value":"5OWHNQZG","created_at":"2026-07-05T03:05:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:5OWHNQZGQOV66DMSPQBAPXHC2E","target":"record","payload":{"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"},"canonical_sha256":"ebac76c32683abef0d927c0207dce2d108e6a773ea86327fdcbb85dcb07e31c2","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"},"source_kind":"arxiv","source_id":"2108.06028","source_version":1,"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-07-05T03:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHvjsPtuqFIupdIieHQhmH9VRVcQ9UZHZ0SkFLWnwFONoBcKElhD5O4BvZFCF8zORmi67a/5uZx/QDVme0V7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:32:20.546921Z"},"content_sha256":"9b98fe273b8a16e0fcf4b63edfb72890e5d182f354109e72efe7a82b7349e640","schema_version":"1.0","event_id":"sha256:9b98fe273b8a16e0fcf4b63edfb72890e5d182f354109e72efe7a82b7349e640"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:5OWHNQZGQOV66DMSPQBAPXHC2E","target":"graph","payload":{"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"},"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-07-05T03:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0agd8I3YpzwoB1h2di+AxwLJ6RxRZe7CPQhRtCd8owxLXbzXj6mcSRrH872m1cJXM56qIeEyGbo3cWCjkyoSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:32:20.547288Z"},"content_sha256":"de4a144f99551efbbaacaef33fe7f62234f8d260ceca6f1bb1651d986623dfcb","schema_version":"1.0","event_id":"sha256:de4a144f99551efbbaacaef33fe7f62234f8d260ceca6f1bb1651d986623dfcb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OWHNQZGQOV66DMSPQBAPXHC2E/bundle.json","state_url":"https://pith.science/pith/5OWHNQZGQOV66DMSPQBAPXHC2E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OWHNQZGQOV66DMSPQBAPXHC2E/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-07-07T04:32:20Z","links":{"resolver":"https://pith.science/pith/5OWHNQZGQOV66DMSPQBAPXHC2E","bundle":"https://pith.science/pith/5OWHNQZGQOV66DMSPQBAPXHC2E/bundle.json","state":"https://pith.science/pith/5OWHNQZGQOV66DMSPQBAPXHC2E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OWHNQZGQOV66DMSPQBAPXHC2E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:5OWHNQZGQOV66DMSPQBAPXHC2E","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":"2c07caad3d82edefa6318164a2035a5b78437b3652531931a481613e806dbed2","cross_cats_sorted":["cs.AI","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-08-13T02:23:30Z","title_canon_sha256":"2d3295381d827bc379fd08070407c6054daa5de1ce91481321b36daf7b149126"},"schema_version":"1.0","source":{"id":"2108.06028","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.06028","created_at":"2026-07-05T03:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"2108.06028v1","created_at":"2026-07-05T03:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.06028","created_at":"2026-07-05T03:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"5OWHNQZGQOV6","created_at":"2026-07-05T03:05:36Z"},{"alias_kind":"pith_short_16","alias_value":"5OWHNQZGQOV66DMS","created_at":"2026-07-05T03:05:36Z"},{"alias_kind":"pith_short_8","alias_value":"5OWHNQZG","created_at":"2026-07-05T03:05:36Z"}],"graph_snapshots":[{"event_id":"sha256:de4a144f99551efbbaacaef33fe7f62234f8d260ceca6f1bb1651d986623dfcb","target":"graph","created_at":"2026-07-05T03:05:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2108.06028/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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  ","authors_text":"Hyeji Kim, Karl Chahine, Nanyang Ye","cross_cats":["cs.AI","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-08-13T02:23:30Z","title":"DeepIC: Coding for Interference Channels via Deep Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.06028","kind":"arxiv","version":1},"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:9b98fe273b8a16e0fcf4b63edfb72890e5d182f354109e72efe7a82b7349e640","target":"record","created_at":"2026-07-05T03:05:36Z","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":"2c07caad3d82edefa6318164a2035a5b78437b3652531931a481613e806dbed2","cross_cats_sorted":["cs.AI","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-08-13T02:23:30Z","title_canon_sha256":"2d3295381d827bc379fd08070407c6054daa5de1ce91481321b36daf7b149126"},"schema_version":"1.0","source":{"id":"2108.06028","kind":"arxiv","version":1}},"canonical_sha256":"ebac76c32683abef0d927c0207dce2d108e6a773ea86327fdcbb85dcb07e31c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebac76c32683abef0d927c0207dce2d108e6a773ea86327fdcbb85dcb07e31c2","first_computed_at":"2026-07-05T03:05:36.702854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:05:36.702854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3UIirRhXWFakR5vLEPFrvW1ezrYyWjjG9vlFBTaKT7GA3pWn5qjyLdBgzTPi7H+HwlkB4C4uphhK1E7ix2s8BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:05:36.703280Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.06028","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b98fe273b8a16e0fcf4b63edfb72890e5d182f354109e72efe7a82b7349e640","sha256:de4a144f99551efbbaacaef33fe7f62234f8d260ceca6f1bb1651d986623dfcb"],"state_sha256":"5e9297e6612b5b114dc6942b6d9aa4a2dee5ce9a77f9450484fa46aa0501e437"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vwxFnV6Blp9ZXp8irfBMqAepZ/SmyMn8H+PwT/GeBByXy0Rlx/vVDvaGc6w/Wd9HrPj7rjSLfVwBfWx9XzARBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:32:20.549289Z","bundle_sha256":"eb862808ad7039f522b2cde9d432e38ab02963bec2b0bfd81d6e793b2b484786"}}