{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YJGPJXHMUMHWWIC2WBTM2LHDL5","short_pith_number":"pith:YJGPJXHM","schema_version":"1.0","canonical_sha256":"c24cf4dceca30f6b205ab066cd2ce35f7f88b1a997f02d9758293a2510113981","source":{"kind":"arxiv","id":"1309.4203","version":1},"attestation_state":"computed","paper":{"title":"An efficient algorithm for weighted sum-rate maximization in multicell downlink beamforming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hidekazu Murata, Mirza Golam Kibria","submitted_at":"2013-09-17T07:12:43Z","abstract_excerpt":"This paper considers coordinated linear precoding for rate optimization in downlink multicell, multiuser orthogonal frequency- division multiple access networks. We focus on two different design criteria. In the first, the weighted sum-rate is maximized under transmit power constraints per base station. In the second, we minimize the total transmit power satisfying the signal-to-interference-plus-noise-ratio constraints of the subcarriers per cell. Both problems are solved using standard conic optimization packages. A less complex, fast, and provably convergent algorithm that maximizes the wei"},"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":"1309.4203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-17T07:12:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13a0b949a9426a5b0a4297a74b611249dbd99c2c09883d8523b091b910806d5b","abstract_canon_sha256":"cff5b8ae9cfe6e4892f832d677c6a53188099e13c47b127ebcb3fac6b1a47095"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:47:36.828600Z","signature_b64":"/4kRI9qMkgIOPYPOrIORfi9JMAPGPkr0XmAi0H7k1vu4T+nYvsjgYN/l8WvnBCVovmfgX70ADzjgEePrr/PoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c24cf4dceca30f6b205ab066cd2ce35f7f88b1a997f02d9758293a2510113981","last_reissued_at":"2026-05-18T01:47:36.827925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:47:36.827925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient algorithm for weighted sum-rate maximization in multicell downlink beamforming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hidekazu Murata, Mirza Golam Kibria","submitted_at":"2013-09-17T07:12:43Z","abstract_excerpt":"This paper considers coordinated linear precoding for rate optimization in downlink multicell, multiuser orthogonal frequency- division multiple access networks. We focus on two different design criteria. In the first, the weighted sum-rate is maximized under transmit power constraints per base station. In the second, we minimize the total transmit power satisfying the signal-to-interference-plus-noise-ratio constraints of the subcarriers per cell. Both problems are solved using standard conic optimization packages. A less complex, fast, and provably convergent algorithm that maximizes the wei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4203","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":"1309.4203","created_at":"2026-05-18T01:47:36.828031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.4203v1","created_at":"2026-05-18T01:47:36.828031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4203","created_at":"2026-05-18T01:47:36.828031+00:00"},{"alias_kind":"pith_short_12","alias_value":"YJGPJXHMUMHW","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YJGPJXHMUMHWWIC2","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YJGPJXHM","created_at":"2026-05-18T12:28:06.772260+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/YJGPJXHMUMHWWIC2WBTM2LHDL5","json":"https://pith.science/pith/YJGPJXHMUMHWWIC2WBTM2LHDL5.json","graph_json":"https://pith.science/api/pith-number/YJGPJXHMUMHWWIC2WBTM2LHDL5/graph.json","events_json":"https://pith.science/api/pith-number/YJGPJXHMUMHWWIC2WBTM2LHDL5/events.json","paper":"https://pith.science/paper/YJGPJXHM"},"agent_actions":{"view_html":"https://pith.science/pith/YJGPJXHMUMHWWIC2WBTM2LHDL5","download_json":"https://pith.science/pith/YJGPJXHMUMHWWIC2WBTM2LHDL5.json","view_paper":"https://pith.science/paper/YJGPJXHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.4203&json=true","fetch_graph":"https://pith.science/api/pith-number/YJGPJXHMUMHWWIC2WBTM2LHDL5/graph.json","fetch_events":"https://pith.science/api/pith-number/YJGPJXHMUMHWWIC2WBTM2LHDL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YJGPJXHMUMHWWIC2WBTM2LHDL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YJGPJXHMUMHWWIC2WBTM2LHDL5/action/storage_attestation","attest_author":"https://pith.science/pith/YJGPJXHMUMHWWIC2WBTM2LHDL5/action/author_attestation","sign_citation":"https://pith.science/pith/YJGPJXHMUMHWWIC2WBTM2LHDL5/action/citation_signature","submit_replication":"https://pith.science/pith/YJGPJXHMUMHWWIC2WBTM2LHDL5/action/replication_record"}},"created_at":"2026-05-18T01:47:36.828031+00:00","updated_at":"2026-05-18T01:47:36.828031+00:00"}