{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YNHLDV7HPDXIIST7IOHV2QTFPW","short_pith_number":"pith:YNHLDV7H","schema_version":"1.0","canonical_sha256":"c34eb1d7e778ee844a7f438f5d42657d955d069e5d9624a63152a02078918e42","source":{"kind":"arxiv","id":"1211.1969","version":1},"attestation_state":"computed","paper":{"title":"Fast Converging Algorithm for Weighted Sum Rate Maximization in Multicell MISO Downlink","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antti T\\\"olli, Le-Nam Tran, Markku Juntti, Muhammad Fainan Hanif","submitted_at":"2012-11-08T08:37:24Z","abstract_excerpt":"The problem of maximizing weighted sum rates in the downlink of a multicell environment is of considerable interest. Unfortunately, this problem is known to be NP-hard. For the case of multi-antenna base stations and single antenna mobile terminals, we devise a low complexity, fast and provably convergent algorithm that locally optimizes the weighted sum rate in the downlink of the system. In particular, we derive an iterative second-order cone program formulation of the weighted sum rate maximization problem. The algorithm converges to a local optimum within a few iterations. Superior perform"},"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":"1211.1969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-08T08:37:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"794db87b58f459b4925d607c2efce84d4dd720a38957508b515f2e28bbd86c03","abstract_canon_sha256":"fdde11df5ac8ecf5103c31db55a6862bc815baf2b3c60c7cf0abd52b6d2abd50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:12.009682Z","signature_b64":"mOOs6mSSNf+uWxk8jeTblq4SM+U6xy5mHShJRPrlVMvuPKbo2tGYzbBe6/sd5JIx8PpuMBCUyDZoWZrNFeIyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c34eb1d7e778ee844a7f438f5d42657d955d069e5d9624a63152a02078918e42","last_reissued_at":"2026-05-18T03:41:12.009041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:12.009041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Converging Algorithm for Weighted Sum Rate Maximization in Multicell MISO Downlink","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antti T\\\"olli, Le-Nam Tran, Markku Juntti, Muhammad Fainan Hanif","submitted_at":"2012-11-08T08:37:24Z","abstract_excerpt":"The problem of maximizing weighted sum rates in the downlink of a multicell environment is of considerable interest. Unfortunately, this problem is known to be NP-hard. For the case of multi-antenna base stations and single antenna mobile terminals, we devise a low complexity, fast and provably convergent algorithm that locally optimizes the weighted sum rate in the downlink of the system. In particular, we derive an iterative second-order cone program formulation of the weighted sum rate maximization problem. The algorithm converges to a local optimum within a few iterations. Superior perform"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1969","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":"1211.1969","created_at":"2026-05-18T03:41:12.009133+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1969v1","created_at":"2026-05-18T03:41:12.009133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1969","created_at":"2026-05-18T03:41:12.009133+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNHLDV7HPDXI","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNHLDV7HPDXIIST7","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNHLDV7H","created_at":"2026-05-18T12:27:27.928770+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/YNHLDV7HPDXIIST7IOHV2QTFPW","json":"https://pith.science/pith/YNHLDV7HPDXIIST7IOHV2QTFPW.json","graph_json":"https://pith.science/api/pith-number/YNHLDV7HPDXIIST7IOHV2QTFPW/graph.json","events_json":"https://pith.science/api/pith-number/YNHLDV7HPDXIIST7IOHV2QTFPW/events.json","paper":"https://pith.science/paper/YNHLDV7H"},"agent_actions":{"view_html":"https://pith.science/pith/YNHLDV7HPDXIIST7IOHV2QTFPW","download_json":"https://pith.science/pith/YNHLDV7HPDXIIST7IOHV2QTFPW.json","view_paper":"https://pith.science/paper/YNHLDV7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1969&json=true","fetch_graph":"https://pith.science/api/pith-number/YNHLDV7HPDXIIST7IOHV2QTFPW/graph.json","fetch_events":"https://pith.science/api/pith-number/YNHLDV7HPDXIIST7IOHV2QTFPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNHLDV7HPDXIIST7IOHV2QTFPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNHLDV7HPDXIIST7IOHV2QTFPW/action/storage_attestation","attest_author":"https://pith.science/pith/YNHLDV7HPDXIIST7IOHV2QTFPW/action/author_attestation","sign_citation":"https://pith.science/pith/YNHLDV7HPDXIIST7IOHV2QTFPW/action/citation_signature","submit_replication":"https://pith.science/pith/YNHLDV7HPDXIIST7IOHV2QTFPW/action/replication_record"}},"created_at":"2026-05-18T03:41:12.009133+00:00","updated_at":"2026-05-18T03:41:12.009133+00:00"}