{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VTTBMVFQ3QL42NPXE4NG3KQM6Q","short_pith_number":"pith:VTTBMVFQ","schema_version":"1.0","canonical_sha256":"ace61654b0dc17cd35f7271a6daa0cf42086ba1efbc656bc9f13bed1b3436f8f","source":{"kind":"arxiv","id":"1708.04454","version":1},"attestation_state":"computed","paper":{"title":"Convex Approximated Weighted Sum-Rate Maximization for Multicell Multiuser OFDM","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":"2017-08-15T10:30:09Z","abstract_excerpt":"This letter considers the weighted sum-rate maximization (WSRMax) problem in downlink multicell multiuser orthogonal frequency-division multiplexing system. The WSRMax problem under per base station transmit power constraint is known to be NP-hard, and the optimal solution is computationally very expensive. We propose two less-complex suboptimal convex approximated solutions which are based on sequential parametric convex approximation approach. We derive provably faster convergent iterative convex approximation techniques that locally optimize the weighted sum-rate function. Both the iterativ"},"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":"1708.04454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-15T10:30:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c725784b96c7c631cf5230d271fe4c385c64b874b3cea4a1ea012ee8bea4a079","abstract_canon_sha256":"cb239290a3daa6491b95cfa64c0716d7b1221ab6fcfa405d6d2e1cfa4d727844"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:59.288203Z","signature_b64":"+zuzNKXKUTiL/gkLgTobxmaNQQfLVV1pzxGMGQw0MOhQG9n4NqrwUBFMi6vAPW18nZODVhe9/V0jL5VEO9BKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ace61654b0dc17cd35f7271a6daa0cf42086ba1efbc656bc9f13bed1b3436f8f","last_reissued_at":"2026-05-18T00:37:59.287810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:59.287810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Approximated Weighted Sum-Rate Maximization for Multicell Multiuser OFDM","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":"2017-08-15T10:30:09Z","abstract_excerpt":"This letter considers the weighted sum-rate maximization (WSRMax) problem in downlink multicell multiuser orthogonal frequency-division multiplexing system. The WSRMax problem under per base station transmit power constraint is known to be NP-hard, and the optimal solution is computationally very expensive. We propose two less-complex suboptimal convex approximated solutions which are based on sequential parametric convex approximation approach. We derive provably faster convergent iterative convex approximation techniques that locally optimize the weighted sum-rate function. Both the iterativ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04454","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":"1708.04454","created_at":"2026-05-18T00:37:59.287883+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04454v1","created_at":"2026-05-18T00:37:59.287883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04454","created_at":"2026-05-18T00:37:59.287883+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTTBMVFQ3QL4","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTTBMVFQ3QL42NPX","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTTBMVFQ","created_at":"2026-05-18T12:31:49.984773+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/VTTBMVFQ3QL42NPXE4NG3KQM6Q","json":"https://pith.science/pith/VTTBMVFQ3QL42NPXE4NG3KQM6Q.json","graph_json":"https://pith.science/api/pith-number/VTTBMVFQ3QL42NPXE4NG3KQM6Q/graph.json","events_json":"https://pith.science/api/pith-number/VTTBMVFQ3QL42NPXE4NG3KQM6Q/events.json","paper":"https://pith.science/paper/VTTBMVFQ"},"agent_actions":{"view_html":"https://pith.science/pith/VTTBMVFQ3QL42NPXE4NG3KQM6Q","download_json":"https://pith.science/pith/VTTBMVFQ3QL42NPXE4NG3KQM6Q.json","view_paper":"https://pith.science/paper/VTTBMVFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04454&json=true","fetch_graph":"https://pith.science/api/pith-number/VTTBMVFQ3QL42NPXE4NG3KQM6Q/graph.json","fetch_events":"https://pith.science/api/pith-number/VTTBMVFQ3QL42NPXE4NG3KQM6Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTTBMVFQ3QL42NPXE4NG3KQM6Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTTBMVFQ3QL42NPXE4NG3KQM6Q/action/storage_attestation","attest_author":"https://pith.science/pith/VTTBMVFQ3QL42NPXE4NG3KQM6Q/action/author_attestation","sign_citation":"https://pith.science/pith/VTTBMVFQ3QL42NPXE4NG3KQM6Q/action/citation_signature","submit_replication":"https://pith.science/pith/VTTBMVFQ3QL42NPXE4NG3KQM6Q/action/replication_record"}},"created_at":"2026-05-18T00:37:59.287883+00:00","updated_at":"2026-05-18T00:37:59.287883+00:00"}