{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7GQANZ43DQV5MKNXG3VBZD7XKY","short_pith_number":"pith:7GQANZ43","canonical_record":{"source":{"id":"1208.6357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-31T03:24:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d305dbf82ad79c271382979bf902c1680334ce007b0713c56f9eb63c26a74c88","abstract_canon_sha256":"3b870c21ee626f62e64329f18e37fd4e7d279ce962c860f0d0f7473c469a1aaa"},"schema_version":"1.0"},"canonical_sha256":"f9a006e79b1c2bd629b736ea1c8ff7562b4bf59fdd77c39651f4d1997427bebf","source":{"kind":"arxiv","id":"1208.6357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.6357","created_at":"2026-05-18T03:46:33Z"},{"alias_kind":"arxiv_version","alias_value":"1208.6357v1","created_at":"2026-05-18T03:46:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.6357","created_at":"2026-05-18T03:46:33Z"},{"alias_kind":"pith_short_12","alias_value":"7GQANZ43DQV5","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7GQANZ43DQV5MKNX","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7GQANZ43","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7GQANZ43DQV5MKNXG3VBZD7XKY","target":"record","payload":{"canonical_record":{"source":{"id":"1208.6357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-31T03:24:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d305dbf82ad79c271382979bf902c1680334ce007b0713c56f9eb63c26a74c88","abstract_canon_sha256":"3b870c21ee626f62e64329f18e37fd4e7d279ce962c860f0d0f7473c469a1aaa"},"schema_version":"1.0"},"canonical_sha256":"f9a006e79b1c2bd629b736ea1c8ff7562b4bf59fdd77c39651f4d1997427bebf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:33.562842Z","signature_b64":"9DjfG0SMQiQK0mFjb0jRH0t3yI/ouCvSS3SweQEkVVN3Lfm87z+IhvIHJMKkEWMNND2L2Tzqof6V2+JXk68BAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9a006e79b1c2bd629b736ea1c8ff7562b4bf59fdd77c39651f4d1997427bebf","last_reissued_at":"2026-05-18T03:46:33.561986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:33.561986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.6357","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-18T03:46:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OXXu7OeJTMcX5Lq/L5jOhq7qBw82Cga9/jemLw55OHVCTgO4Lp8BLkkSw5k26SmN87/YChFXawiRjs27SRThDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:50:18.015841Z"},"content_sha256":"cef17a529dd0b81b7bc687ece496ec11b9816d4c76f9889225211ff08dc912f9","schema_version":"1.0","event_id":"sha256:cef17a529dd0b81b7bc687ece496ec11b9816d4c76f9889225211ff08dc912f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7GQANZ43DQV5MKNXG3VBZD7XKY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Transceiver Design for a MIMO Interfering Broadcast Channel Achieving Max-Min Fairness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo","submitted_at":"2012-08-31T03:24:21Z","abstract_excerpt":"We consider the problem of linear transceiver design to achieve max-min fairness in a downlink MIMO multicell network. This problem can be formulated as maximizing the minimum rate among all the users in an interfering broadcast channel (IBC). In this paper we show that when the number of antennas is at least two at each of the transmitters and the receivers, the min rate maximization problem is NP-hard in the number of users. Moreover, we develop a low-complexity algorithm for this problem by iteratively solving a sequence of convex subproblems, and establish its global convergence to a stati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.6357","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-18T03:46:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tWsLyxV37gdrmmvbuIZ1fR4zua0mkn6YnFfPlYFHrWWaDZSoeo2insRx1F718TzFq24aE50zle1/uhEcjlDVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:50:18.016427Z"},"content_sha256":"75084b9a7c7bb4d67fcd8e190b235009e21d2636d6ab77da58404eaa043fa3e3","schema_version":"1.0","event_id":"sha256:75084b9a7c7bb4d67fcd8e190b235009e21d2636d6ab77da58404eaa043fa3e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GQANZ43DQV5MKNXG3VBZD7XKY/bundle.json","state_url":"https://pith.science/pith/7GQANZ43DQV5MKNXG3VBZD7XKY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GQANZ43DQV5MKNXG3VBZD7XKY/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-31T04:50:18Z","links":{"resolver":"https://pith.science/pith/7GQANZ43DQV5MKNXG3VBZD7XKY","bundle":"https://pith.science/pith/7GQANZ43DQV5MKNXG3VBZD7XKY/bundle.json","state":"https://pith.science/pith/7GQANZ43DQV5MKNXG3VBZD7XKY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GQANZ43DQV5MKNXG3VBZD7XKY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7GQANZ43DQV5MKNXG3VBZD7XKY","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":"3b870c21ee626f62e64329f18e37fd4e7d279ce962c860f0d0f7473c469a1aaa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-31T03:24:21Z","title_canon_sha256":"d305dbf82ad79c271382979bf902c1680334ce007b0713c56f9eb63c26a74c88"},"schema_version":"1.0","source":{"id":"1208.6357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.6357","created_at":"2026-05-18T03:46:33Z"},{"alias_kind":"arxiv_version","alias_value":"1208.6357v1","created_at":"2026-05-18T03:46:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.6357","created_at":"2026-05-18T03:46:33Z"},{"alias_kind":"pith_short_12","alias_value":"7GQANZ43DQV5","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7GQANZ43DQV5MKNX","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7GQANZ43","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:75084b9a7c7bb4d67fcd8e190b235009e21d2636d6ab77da58404eaa043fa3e3","target":"graph","created_at":"2026-05-18T03:46:33Z","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":"We consider the problem of linear transceiver design to achieve max-min fairness in a downlink MIMO multicell network. This problem can be formulated as maximizing the minimum rate among all the users in an interfering broadcast channel (IBC). In this paper we show that when the number of antennas is at least two at each of the transmitters and the receivers, the min rate maximization problem is NP-hard in the number of users. Moreover, we develop a low-complexity algorithm for this problem by iteratively solving a sequence of convex subproblems, and establish its global convergence to a stati","authors_text":"Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-31T03:24:21Z","title":"Linear Transceiver Design for a MIMO Interfering Broadcast Channel Achieving Max-Min Fairness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.6357","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:cef17a529dd0b81b7bc687ece496ec11b9816d4c76f9889225211ff08dc912f9","target":"record","created_at":"2026-05-18T03:46:33Z","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":"3b870c21ee626f62e64329f18e37fd4e7d279ce962c860f0d0f7473c469a1aaa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-31T03:24:21Z","title_canon_sha256":"d305dbf82ad79c271382979bf902c1680334ce007b0713c56f9eb63c26a74c88"},"schema_version":"1.0","source":{"id":"1208.6357","kind":"arxiv","version":1}},"canonical_sha256":"f9a006e79b1c2bd629b736ea1c8ff7562b4bf59fdd77c39651f4d1997427bebf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9a006e79b1c2bd629b736ea1c8ff7562b4bf59fdd77c39651f4d1997427bebf","first_computed_at":"2026-05-18T03:46:33.561986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:33.561986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9DjfG0SMQiQK0mFjb0jRH0t3yI/ouCvSS3SweQEkVVN3Lfm87z+IhvIHJMKkEWMNND2L2Tzqof6V2+JXk68BAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:33.562842Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.6357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cef17a529dd0b81b7bc687ece496ec11b9816d4c76f9889225211ff08dc912f9","sha256:75084b9a7c7bb4d67fcd8e190b235009e21d2636d6ab77da58404eaa043fa3e3"],"state_sha256":"dcab8bc04a44c41d808dc6e75940e65f2c167ac53978ffb1bddcf634017c81a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yHHsW/+6aup98EOR7c0VWRenZBHdTYm+wVITlTG3wPS5Dqo3uVggl4zzZ5MRwEmGQ2MzUA4hQDkuQXLRgyIAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:50:18.019740Z","bundle_sha256":"1752a6f8cf0db5ec71383f02d9ba086b4d587f82d92224a8952c4e0ec2af03f9"}}