{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LW7CHSKSW755WLJ73YTJRDNHYY","short_pith_number":"pith:LW7CHSKS","canonical_record":{"source":{"id":"1503.02389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-09T08:13:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d22cbb0c7c2df78ae16a610913d67cda6fcd6ca850f612143c01fa3817b1f039","abstract_canon_sha256":"9c3174c5fbe83e9b34d6ea40408d2f8566b66658a04b52f3534d9b4dbf532cbf"},"schema_version":"1.0"},"canonical_sha256":"5dbe23c952b7fbdb2d3fde26988da7c62ac2d39386110aec691e38a9932c389c","source":{"kind":"arxiv","id":"1503.02389","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02389","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02389v2","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02389","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"LW7CHSKSW755","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LW7CHSKSW755WLJ7","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LW7CHSKS","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LW7CHSKSW755WLJ73YTJRDNHYY","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-09T08:13:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d22cbb0c7c2df78ae16a610913d67cda6fcd6ca850f612143c01fa3817b1f039","abstract_canon_sha256":"9c3174c5fbe83e9b34d6ea40408d2f8566b66658a04b52f3534d9b4dbf532cbf"},"schema_version":"1.0"},"canonical_sha256":"5dbe23c952b7fbdb2d3fde26988da7c62ac2d39386110aec691e38a9932c389c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:58.620454Z","signature_b64":"DD9+tOZ5ZGy/ZhAdCamJTYZE36JMqjZHW/ku41e6vbASn0/LaRwZgy9EUM1ltSA9bJd4uZwQRJn83DhCPTnLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dbe23c952b7fbdb2d3fde26988da7c62ac2d39386110aec691e38a9932c389c","last_reissued_at":"2026-05-18T00:41:58.619727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:58.619727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02389","source_version":2,"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-18T00:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0v2F7GzAp6SCgycVPoqKPgoXgh0sKY0RwT5HEtz/Var0imafAu/tZy5g+veljaVAHx2nF1Y+AGwK+i2smo2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:53:27.618838Z"},"content_sha256":"29d1e62ae423d950d3fc59c621f4c3ad0765009fcc95ec0464c98c916abcc5eb","schema_version":"1.0","event_id":"sha256:29d1e62ae423d950d3fc59c621f4c3ad0765009fcc95ec0464c98c916abcc5eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LW7CHSKSW755WLJ73YTJRDNHYY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Coding Error Exponents for the Two-User Interference Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav, Wasim Huleihel","submitted_at":"2015-03-09T08:13:02Z","abstract_excerpt":"This paper is about deriving lower bounds on the error exponents for the two-user interference channel under the random coding regime for several ensembles. Specifically, we first analyze the standard random coding ensemble, where the codebooks are comprised of independently and identically distributed (i.i.d.) codewords. For this ensemble, we focus on optimum decoding, which is in contrast to other, suboptimal decoding rules that have been used in the literature (e.g., joint typicality decoding, treating interference as noise, etc.). The fact that the interfering signal is a codeword, rather "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02389","kind":"arxiv","version":2},"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-18T00:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e9Qng3McV2RrKTE0cSx/h8C/9blWM66e3AAHgPNclOzrulVamwkpjJzfQQvofpliqzMhMY6x7VcPdVtTogqnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:53:27.619475Z"},"content_sha256":"1929b735265de65a76f80d186120f73bfac2856ab8cc5be50bac9d72ecc63cac","schema_version":"1.0","event_id":"sha256:1929b735265de65a76f80d186120f73bfac2856ab8cc5be50bac9d72ecc63cac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LW7CHSKSW755WLJ73YTJRDNHYY/bundle.json","state_url":"https://pith.science/pith/LW7CHSKSW755WLJ73YTJRDNHYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LW7CHSKSW755WLJ73YTJRDNHYY/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-27T08:53:27Z","links":{"resolver":"https://pith.science/pith/LW7CHSKSW755WLJ73YTJRDNHYY","bundle":"https://pith.science/pith/LW7CHSKSW755WLJ73YTJRDNHYY/bundle.json","state":"https://pith.science/pith/LW7CHSKSW755WLJ73YTJRDNHYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LW7CHSKSW755WLJ73YTJRDNHYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LW7CHSKSW755WLJ73YTJRDNHYY","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":"9c3174c5fbe83e9b34d6ea40408d2f8566b66658a04b52f3534d9b4dbf532cbf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-09T08:13:02Z","title_canon_sha256":"d22cbb0c7c2df78ae16a610913d67cda6fcd6ca850f612143c01fa3817b1f039"},"schema_version":"1.0","source":{"id":"1503.02389","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02389","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02389v2","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02389","created_at":"2026-05-18T00:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"LW7CHSKSW755","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LW7CHSKSW755WLJ7","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LW7CHSKS","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:1929b735265de65a76f80d186120f73bfac2856ab8cc5be50bac9d72ecc63cac","target":"graph","created_at":"2026-05-18T00:41:58Z","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":"This paper is about deriving lower bounds on the error exponents for the two-user interference channel under the random coding regime for several ensembles. Specifically, we first analyze the standard random coding ensemble, where the codebooks are comprised of independently and identically distributed (i.i.d.) codewords. For this ensemble, we focus on optimum decoding, which is in contrast to other, suboptimal decoding rules that have been used in the literature (e.g., joint typicality decoding, treating interference as noise, etc.). The fact that the interfering signal is a codeword, rather ","authors_text":"Neri Merhav, Wasim Huleihel","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-09T08:13:02Z","title":"Random Coding Error Exponents for the Two-User Interference Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02389","kind":"arxiv","version":2},"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:29d1e62ae423d950d3fc59c621f4c3ad0765009fcc95ec0464c98c916abcc5eb","target":"record","created_at":"2026-05-18T00:41:58Z","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":"9c3174c5fbe83e9b34d6ea40408d2f8566b66658a04b52f3534d9b4dbf532cbf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-09T08:13:02Z","title_canon_sha256":"d22cbb0c7c2df78ae16a610913d67cda6fcd6ca850f612143c01fa3817b1f039"},"schema_version":"1.0","source":{"id":"1503.02389","kind":"arxiv","version":2}},"canonical_sha256":"5dbe23c952b7fbdb2d3fde26988da7c62ac2d39386110aec691e38a9932c389c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5dbe23c952b7fbdb2d3fde26988da7c62ac2d39386110aec691e38a9932c389c","first_computed_at":"2026-05-18T00:41:58.619727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:58.619727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DD9+tOZ5ZGy/ZhAdCamJTYZE36JMqjZHW/ku41e6vbASn0/LaRwZgy9EUM1ltSA9bJd4uZwQRJn83DhCPTnLDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:58.620454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02389","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29d1e62ae423d950d3fc59c621f4c3ad0765009fcc95ec0464c98c916abcc5eb","sha256:1929b735265de65a76f80d186120f73bfac2856ab8cc5be50bac9d72ecc63cac"],"state_sha256":"3d9c8ee61abaa1baf0f4073b48cf736aef9db5c8aa59a27e9fe0f4046de8399b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3MVoEOnIt5SgjKpOqK9Fq8z48ETdIqSgi021s1JfdscA/TdzQEE9P6yjpWJ6uf2vc7NIBC0Cka36aUiJWPbiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:53:27.622831Z","bundle_sha256":"8bb26bf19e8175d8d46ff086303049dea45490ee4f90398d916507dbd314264f"}}