{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZPV2DX3AJP4FU5P2SG7AC5NEAR","short_pith_number":"pith:ZPV2DX3A","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"},"canonical_sha256":"cbeba1df604bf85a75fa91be0175a40479122b3174c7cd6df501d67d136b078d","source":{"kind":"arxiv","id":"1609.00833","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00833","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00833v1","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00833","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZPV2DX3AJP4F","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZPV2DX3AJP4FU5P2","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZPV2DX3A","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZPV2DX3AJP4FU5P2SG7AC5NEAR","target":"record","payload":{"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"},"canonical_sha256":"cbeba1df604bf85a75fa91be0175a40479122b3174c7cd6df501d67d136b078d","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"},"source_kind":"arxiv","source_id":"1609.00833","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-05-18T01:06:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IvzrvovDwhaAXNwCgmoz8HDJ4/GQ7sh8ccmrPgCO2YFk1UVbyOEog+F0eMhEttJAio/+2AVp0X2xI5bEZ4RUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:37:28.308245Z"},"content_sha256":"e2569f3771cb10fb7944f307cde2e5114d9717ee22aa100a50b30d9e9b9ac8d1","schema_version":"1.0","event_id":"sha256:e2569f3771cb10fb7944f307cde2e5114d9717ee22aa100a50b30d9e9b9ac8d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZPV2DX3AJP4FU5P2SG7AC5NEAR","target":"graph","payload":{"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"},"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-18T01:06:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJY6mudlFRpUmNVZHOVRB6O38JS6J5lkEoLHzv1mMudd4H97ILK8ZGb25yQ7EhX+28K/0vs8a3bww7Z7DMQaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:37:28.308625Z"},"content_sha256":"de4fb226756916aca7c49a45daa8e300fb168390eafcea89d60e14a373191143","schema_version":"1.0","event_id":"sha256:de4fb226756916aca7c49a45daa8e300fb168390eafcea89d60e14a373191143"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZPV2DX3AJP4FU5P2SG7AC5NEAR/bundle.json","state_url":"https://pith.science/pith/ZPV2DX3AJP4FU5P2SG7AC5NEAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZPV2DX3AJP4FU5P2SG7AC5NEAR/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-24T21:37:28Z","links":{"resolver":"https://pith.science/pith/ZPV2DX3AJP4FU5P2SG7AC5NEAR","bundle":"https://pith.science/pith/ZPV2DX3AJP4FU5P2SG7AC5NEAR/bundle.json","state":"https://pith.science/pith/ZPV2DX3AJP4FU5P2SG7AC5NEAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZPV2DX3AJP4FU5P2SG7AC5NEAR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZPV2DX3AJP4FU5P2SG7AC5NEAR","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":"12aaca98c46c85ff43a6c349db41d2363cb68d4c1772c83f709795927890cd71","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-03T14:52:21Z","title_canon_sha256":"63923d6723a61b4e0c05be7640b73d97f7d3e4bb28fa0868eb0d6b69dc26a099"},"schema_version":"1.0","source":{"id":"1609.00833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00833","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00833v1","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00833","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZPV2DX3AJP4F","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZPV2DX3AJP4FU5P2","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZPV2DX3A","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:de4fb226756916aca7c49a45daa8e300fb168390eafcea89d60e14a373191143","target":"graph","created_at":"2026-05-18T01:06:19Z","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":"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","authors_text":"Nan Liu, Shlomo Shamai, Tianyu Yang, Wei Kang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-03T14:52:21Z","title":"An Upper Bound on the Sum Capacity of the Downlink Multicell Processing with Finite Backhaul Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00833","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:e2569f3771cb10fb7944f307cde2e5114d9717ee22aa100a50b30d9e9b9ac8d1","target":"record","created_at":"2026-05-18T01:06:19Z","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":"12aaca98c46c85ff43a6c349db41d2363cb68d4c1772c83f709795927890cd71","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-03T14:52:21Z","title_canon_sha256":"63923d6723a61b4e0c05be7640b73d97f7d3e4bb28fa0868eb0d6b69dc26a099"},"schema_version":"1.0","source":{"id":"1609.00833","kind":"arxiv","version":1}},"canonical_sha256":"cbeba1df604bf85a75fa91be0175a40479122b3174c7cd6df501d67d136b078d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbeba1df604bf85a75fa91be0175a40479122b3174c7cd6df501d67d136b078d","first_computed_at":"2026-05-18T01:06:19.833765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:19.833765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R2qsbW6nqMO5R7h0/df9ERIFoP4a5i0K1+4D79A7J5ImLdWiNIVTrApkZJToz5p613qshhggAC3b04fRL2+BDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:19.834404Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2569f3771cb10fb7944f307cde2e5114d9717ee22aa100a50b30d9e9b9ac8d1","sha256:de4fb226756916aca7c49a45daa8e300fb168390eafcea89d60e14a373191143"],"state_sha256":"354f22676fd68326a55bf4908ddf7e96b9223d1afd01d677059838a8b9d30eda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"huVQiHwSxg6S+n3PjWEKLIiqPVEai/yY3Mwb6AqUyxPnig7AjqBMUXda/yaiHLEJy55db8RE0/zZP1OnmmM6Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T21:37:28.311738Z","bundle_sha256":"9324faddeb538c06c5e3d5a9c3f2e344893f99fc7432db948cae8d0815b25404"}}