{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XZ56D4VUSPXUQ7OQFIEBFHBDCU","short_pith_number":"pith:XZ56D4VU","schema_version":"1.0","canonical_sha256":"be7be1f2b493ef487dd02a08129c23151b687043db220a7e7d9efec9bfedacdc","source":{"kind":"arxiv","id":"1510.08018","version":4},"attestation_state":"computed","paper":{"title":"The Dirty MIMO Multiple-Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anatoly Khina, Uri Erez, Yuval Kochman","submitted_at":"2015-10-27T18:28:51Z","abstract_excerpt":"In the scalar dirty multiple-access channel, in addition to Gaussian noise, two additive interference signals are present, each known non-causally to a single transmitter. It was shown by Philosof et al. that for strong interferences, an i.i.d. ensemble of codes does not achieve the capacity region. Rather, a structured-codes approach was presented, that was shown to be optimal in the limit of high signal-to-noise ratios, where the sum-capacity is dictated by the minimal (\"bottleneck\") channel gain. In this paper, we consider the multiple-input multiple-output (MIMO) variant of this setting. I"},"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":"1510.08018","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-27T18:28:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c40cf22ee94af0ebb75d1411628f6873e44f66fecab809550312ef035d381d75","abstract_canon_sha256":"61032f241ee38ae82601d7ec86c4acc27da22d919b74bb3a7b792bb236daefba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:13.431780Z","signature_b64":"M26xajv2QwxapkcUlNychDdA81C9vkwQ32Jbr2SB+gVe/LKpV6NKOM7VSbZYS/ttCpT25XvPRKYL79KjPRbGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be7be1f2b493ef487dd02a08129c23151b687043db220a7e7d9efec9bfedacdc","last_reissued_at":"2026-05-18T00:42:13.431209Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:13.431209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Dirty MIMO Multiple-Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anatoly Khina, Uri Erez, Yuval Kochman","submitted_at":"2015-10-27T18:28:51Z","abstract_excerpt":"In the scalar dirty multiple-access channel, in addition to Gaussian noise, two additive interference signals are present, each known non-causally to a single transmitter. It was shown by Philosof et al. that for strong interferences, an i.i.d. ensemble of codes does not achieve the capacity region. Rather, a structured-codes approach was presented, that was shown to be optimal in the limit of high signal-to-noise ratios, where the sum-capacity is dictated by the minimal (\"bottleneck\") channel gain. In this paper, we consider the multiple-input multiple-output (MIMO) variant of this setting. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08018","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.08018","created_at":"2026-05-18T00:42:13.431297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08018v4","created_at":"2026-05-18T00:42:13.431297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08018","created_at":"2026-05-18T00:42:13.431297+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZ56D4VUSPXU","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZ56D4VUSPXUQ7OQ","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZ56D4VU","created_at":"2026-05-18T12:29:50.041715+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/XZ56D4VUSPXUQ7OQFIEBFHBDCU","json":"https://pith.science/pith/XZ56D4VUSPXUQ7OQFIEBFHBDCU.json","graph_json":"https://pith.science/api/pith-number/XZ56D4VUSPXUQ7OQFIEBFHBDCU/graph.json","events_json":"https://pith.science/api/pith-number/XZ56D4VUSPXUQ7OQFIEBFHBDCU/events.json","paper":"https://pith.science/paper/XZ56D4VU"},"agent_actions":{"view_html":"https://pith.science/pith/XZ56D4VUSPXUQ7OQFIEBFHBDCU","download_json":"https://pith.science/pith/XZ56D4VUSPXUQ7OQFIEBFHBDCU.json","view_paper":"https://pith.science/paper/XZ56D4VU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08018&json=true","fetch_graph":"https://pith.science/api/pith-number/XZ56D4VUSPXUQ7OQFIEBFHBDCU/graph.json","fetch_events":"https://pith.science/api/pith-number/XZ56D4VUSPXUQ7OQFIEBFHBDCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZ56D4VUSPXUQ7OQFIEBFHBDCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZ56D4VUSPXUQ7OQFIEBFHBDCU/action/storage_attestation","attest_author":"https://pith.science/pith/XZ56D4VUSPXUQ7OQFIEBFHBDCU/action/author_attestation","sign_citation":"https://pith.science/pith/XZ56D4VUSPXUQ7OQFIEBFHBDCU/action/citation_signature","submit_replication":"https://pith.science/pith/XZ56D4VUSPXUQ7OQFIEBFHBDCU/action/replication_record"}},"created_at":"2026-05-18T00:42:13.431297+00:00","updated_at":"2026-05-18T00:42:13.431297+00:00"}