{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZEJR2FWSOPCOYWZKAJ7UG7LZL3","short_pith_number":"pith:ZEJR2FWS","schema_version":"1.0","canonical_sha256":"c9131d16d273c4ec5b2a027f437d795ed383987415a9a029a1ca37df57f3ccfa","source":{"kind":"arxiv","id":"1103.0996","version":2},"attestation_state":"computed","paper":{"title":"Communication with Disturbance Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abbas El Gamal, Bernd Bandemer","submitted_at":"2011-03-04T23:51:47Z","abstract_excerpt":"Motivated by the broadcast view of the interference channel, the new problem of communication with disturbance constraints is formulated. The rate-disturbance region is established for the single constraint case and the optimal encoding scheme turns out to be the same as the Han-Kobayashi scheme for the two user-pair interference channel. This result is extended to the Gaussian vector (MIMO) case. For the case of communication with two disturbance constraints, inner and outer bounds on the rate-disturbance region for a deterministic model are established. The inner bound is achieved by an enco"},"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":"1103.0996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-04T23:51:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d655ef53aca155584b22bdfd3b54b05732312e402ebc4dd71403f49c4c872657","abstract_canon_sha256":"d7bc4b7e6819098536bc9a607ce74c78b0b724ed6d5872d5266d8c7170dfd7af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:25.281338Z","signature_b64":"+Nk2ZqlixBQBNCD1UipwoSEUFMWO6U+DvzeTCF3yKu4ucLWU3molb7WbLGn0rbfCaQkGlb6TMM7MtMkGcehcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9131d16d273c4ec5b2a027f437d795ed383987415a9a029a1ca37df57f3ccfa","last_reissued_at":"2026-05-18T04:09:25.280687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:25.280687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication with Disturbance Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abbas El Gamal, Bernd Bandemer","submitted_at":"2011-03-04T23:51:47Z","abstract_excerpt":"Motivated by the broadcast view of the interference channel, the new problem of communication with disturbance constraints is formulated. The rate-disturbance region is established for the single constraint case and the optimal encoding scheme turns out to be the same as the Han-Kobayashi scheme for the two user-pair interference channel. This result is extended to the Gaussian vector (MIMO) case. For the case of communication with two disturbance constraints, inner and outer bounds on the rate-disturbance region for a deterministic model are established. The inner bound is achieved by an enco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0996","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.0996","created_at":"2026-05-18T04:09:25.280757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.0996v2","created_at":"2026-05-18T04:09:25.280757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0996","created_at":"2026-05-18T04:09:25.280757+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZEJR2FWSOPCO","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZEJR2FWSOPCOYWZK","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZEJR2FWS","created_at":"2026-05-18T12:26:47.523578+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/ZEJR2FWSOPCOYWZKAJ7UG7LZL3","json":"https://pith.science/pith/ZEJR2FWSOPCOYWZKAJ7UG7LZL3.json","graph_json":"https://pith.science/api/pith-number/ZEJR2FWSOPCOYWZKAJ7UG7LZL3/graph.json","events_json":"https://pith.science/api/pith-number/ZEJR2FWSOPCOYWZKAJ7UG7LZL3/events.json","paper":"https://pith.science/paper/ZEJR2FWS"},"agent_actions":{"view_html":"https://pith.science/pith/ZEJR2FWSOPCOYWZKAJ7UG7LZL3","download_json":"https://pith.science/pith/ZEJR2FWSOPCOYWZKAJ7UG7LZL3.json","view_paper":"https://pith.science/paper/ZEJR2FWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.0996&json=true","fetch_graph":"https://pith.science/api/pith-number/ZEJR2FWSOPCOYWZKAJ7UG7LZL3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZEJR2FWSOPCOYWZKAJ7UG7LZL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZEJR2FWSOPCOYWZKAJ7UG7LZL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZEJR2FWSOPCOYWZKAJ7UG7LZL3/action/storage_attestation","attest_author":"https://pith.science/pith/ZEJR2FWSOPCOYWZKAJ7UG7LZL3/action/author_attestation","sign_citation":"https://pith.science/pith/ZEJR2FWSOPCOYWZKAJ7UG7LZL3/action/citation_signature","submit_replication":"https://pith.science/pith/ZEJR2FWSOPCOYWZKAJ7UG7LZL3/action/replication_record"}},"created_at":"2026-05-18T04:09:25.280757+00:00","updated_at":"2026-05-18T04:09:25.280757+00:00"}