{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZPV2DX3AJP4FU5P2SG7AC5NEAR","short_pith_number":"pith:ZPV2DX3A","schema_version":"1.0","canonical_sha256":"cbeba1df604bf85a75fa91be0175a40479122b3174c7cd6df501d67d136b078d","source":{"kind":"arxiv","id":"1609.00833","version":1},"attestation_state":"computed","paper":{"title":"An Upper Bound on the Sum Capacity of the Downlink Multicell Processing with Finite Backhaul Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nan Liu, Shlomo Shamai, Tianyu Yang, Wei Kang","submitted_at":"2016-09-03T14:52:21Z","abstract_excerpt":"In this paper, we study upper bounds on the sum capacity of the downlink multicell processing model with finite backhaul capacity for the simple case of 2 base stations and 2 mobile users. It is modelled as a two-user multiple access diamond channel. It consists of a first hop from the central processor to the base stations via orthogonal links of finite capacity, and the second hop from the base stations to the mobile users via a Gaussian interference channel. The converse is derived using the converse tools of the multiple access diamond channel and that of the Gaussian MIMO broadcast channe"},"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":"1609.00833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-03T14:52:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"63923d6723a61b4e0c05be7640b73d97f7d3e4bb28fa0868eb0d6b69dc26a099","abstract_canon_sha256":"12aaca98c46c85ff43a6c349db41d2363cb68d4c1772c83f709795927890cd71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:19.834404Z","signature_b64":"R2qsbW6nqMO5R7h0/df9ERIFoP4a5i0K1+4D79A7J5ImLdWiNIVTrApkZJToz5p613qshhggAC3b04fRL2+BDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbeba1df604bf85a75fa91be0175a40479122b3174c7cd6df501d67d136b078d","last_reissued_at":"2026-05-18T01:06:19.833765Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:19.833765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Upper Bound on the Sum Capacity of the Downlink Multicell Processing with Finite Backhaul Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nan Liu, Shlomo Shamai, Tianyu Yang, Wei Kang","submitted_at":"2016-09-03T14:52:21Z","abstract_excerpt":"In this paper, we study upper bounds on the sum capacity of the downlink multicell processing model with finite backhaul capacity for the simple case of 2 base stations and 2 mobile users. It is modelled as a two-user multiple access diamond channel. It consists of a first hop from the central processor to the base stations via orthogonal links of finite capacity, and the second hop from the base stations to the mobile users via a Gaussian interference channel. The converse is derived using the converse tools of the multiple access diamond channel and that of the Gaussian MIMO broadcast channe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00833","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":""},"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":"1609.00833","created_at":"2026-05-18T01:06:19.833859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00833v1","created_at":"2026-05-18T01:06:19.833859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00833","created_at":"2026-05-18T01:06:19.833859+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPV2DX3AJP4F","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPV2DX3AJP4FU5P2","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPV2DX3A","created_at":"2026-05-18T12:30:55.937587+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/ZPV2DX3AJP4FU5P2SG7AC5NEAR","json":"https://pith.science/pith/ZPV2DX3AJP4FU5P2SG7AC5NEAR.json","graph_json":"https://pith.science/api/pith-number/ZPV2DX3AJP4FU5P2SG7AC5NEAR/graph.json","events_json":"https://pith.science/api/pith-number/ZPV2DX3AJP4FU5P2SG7AC5NEAR/events.json","paper":"https://pith.science/paper/ZPV2DX3A"},"agent_actions":{"view_html":"https://pith.science/pith/ZPV2DX3AJP4FU5P2SG7AC5NEAR","download_json":"https://pith.science/pith/ZPV2DX3AJP4FU5P2SG7AC5NEAR.json","view_paper":"https://pith.science/paper/ZPV2DX3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00833&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPV2DX3AJP4FU5P2SG7AC5NEAR/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPV2DX3AJP4FU5P2SG7AC5NEAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPV2DX3AJP4FU5P2SG7AC5NEAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPV2DX3AJP4FU5P2SG7AC5NEAR/action/storage_attestation","attest_author":"https://pith.science/pith/ZPV2DX3AJP4FU5P2SG7AC5NEAR/action/author_attestation","sign_citation":"https://pith.science/pith/ZPV2DX3AJP4FU5P2SG7AC5NEAR/action/citation_signature","submit_replication":"https://pith.science/pith/ZPV2DX3AJP4FU5P2SG7AC5NEAR/action/replication_record"}},"created_at":"2026-05-18T01:06:19.833859+00:00","updated_at":"2026-05-18T01:06:19.833859+00:00"}