{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KHQAI52DNWRFUBXYLDP47ZOAII","short_pith_number":"pith:KHQAI52D","schema_version":"1.0","canonical_sha256":"51e00477436da25a06f858dfcfe5c0422575768442367557d9a84626bc02e083","source":{"kind":"arxiv","id":"1604.00926","version":1},"attestation_state":"computed","paper":{"title":"Dual Link Algorithm for the Weighted Sum Rate Maximization in MIMO Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"An Liu, Lijun Chen, Seungil You, Xing Li, Youjian (Eugene) Liu","submitted_at":"2016-04-04T16:01:22Z","abstract_excerpt":"MIMO interference network optimization is important for increasingly crowded wireless communication networks. We provide a new algorithm, named Dual Link algorithm, for the classic problem of weighted sum-rate maximization for MIMO multiaccess channels (MAC), broadcast channels (BC), and general MIMO interference channels with Gaussian input and a total power constraint. For MIMO MAC/BC, the algorithm finds optimal signals to achieve the capacity region boundary. For interference channels with Gaussian input assumption, two of the previous state-of-the-art algorithms are the WMMSE algorithm an"},"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":"1604.00926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-04T16:01:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"41b9bb60ad710382d78cf8c7dd76d9135a5af7b175d99b8c9993fd47b017fbaa","abstract_canon_sha256":"e47ff9b1becb19494af2579691a8aca56892a1501d97529dd14ed8de47aab374"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:47.774291Z","signature_b64":"z3PgJgHD4d1p7JIMQnglYAP4KnOmeni7MBnwllIDWlO80VmHO5QqnwzgDUI2M14K3OO4UIweQaKqi1wQI50qDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51e00477436da25a06f858dfcfe5c0422575768442367557d9a84626bc02e083","last_reissued_at":"2026-05-18T01:17:47.773709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:47.773709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dual Link Algorithm for the Weighted Sum Rate Maximization in MIMO Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"An Liu, Lijun Chen, Seungil You, Xing Li, Youjian (Eugene) Liu","submitted_at":"2016-04-04T16:01:22Z","abstract_excerpt":"MIMO interference network optimization is important for increasingly crowded wireless communication networks. We provide a new algorithm, named Dual Link algorithm, for the classic problem of weighted sum-rate maximization for MIMO multiaccess channels (MAC), broadcast channels (BC), and general MIMO interference channels with Gaussian input and a total power constraint. For MIMO MAC/BC, the algorithm finds optimal signals to achieve the capacity region boundary. For interference channels with Gaussian input assumption, two of the previous state-of-the-art algorithms are the WMMSE algorithm an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00926","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":"1604.00926","created_at":"2026-05-18T01:17:47.773802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00926v1","created_at":"2026-05-18T01:17:47.773802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00926","created_at":"2026-05-18T01:17:47.773802+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHQAI52DNWRF","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHQAI52DNWRFUBXY","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHQAI52D","created_at":"2026-05-18T12:30:25.849896+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/KHQAI52DNWRFUBXYLDP47ZOAII","json":"https://pith.science/pith/KHQAI52DNWRFUBXYLDP47ZOAII.json","graph_json":"https://pith.science/api/pith-number/KHQAI52DNWRFUBXYLDP47ZOAII/graph.json","events_json":"https://pith.science/api/pith-number/KHQAI52DNWRFUBXYLDP47ZOAII/events.json","paper":"https://pith.science/paper/KHQAI52D"},"agent_actions":{"view_html":"https://pith.science/pith/KHQAI52DNWRFUBXYLDP47ZOAII","download_json":"https://pith.science/pith/KHQAI52DNWRFUBXYLDP47ZOAII.json","view_paper":"https://pith.science/paper/KHQAI52D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00926&json=true","fetch_graph":"https://pith.science/api/pith-number/KHQAI52DNWRFUBXYLDP47ZOAII/graph.json","fetch_events":"https://pith.science/api/pith-number/KHQAI52DNWRFUBXYLDP47ZOAII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHQAI52DNWRFUBXYLDP47ZOAII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHQAI52DNWRFUBXYLDP47ZOAII/action/storage_attestation","attest_author":"https://pith.science/pith/KHQAI52DNWRFUBXYLDP47ZOAII/action/author_attestation","sign_citation":"https://pith.science/pith/KHQAI52DNWRFUBXYLDP47ZOAII/action/citation_signature","submit_replication":"https://pith.science/pith/KHQAI52DNWRFUBXYLDP47ZOAII/action/replication_record"}},"created_at":"2026-05-18T01:17:47.773802+00:00","updated_at":"2026-05-18T01:17:47.773802+00:00"}