{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DB2CNN5ZTYWITR3U5YAQCEDA6G","short_pith_number":"pith:DB2CNN5Z","schema_version":"1.0","canonical_sha256":"187426b7b99e2c89c774ee01011060f1b24c4848350d42cf5ca9ab0f661e8188","source":{"kind":"arxiv","id":"1503.06101","version":1},"attestation_state":"computed","paper":{"title":"Maximizing the Sum Rate in Cellular Networks Using Multi-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anja Klein, Hussein Al-Shatri, Rakash SivaSiva Ganesan, Tobias Weber, Xiang Li","submitted_at":"2015-03-20T15:12:53Z","abstract_excerpt":"In this paper, we propose a novel algorithm to maximize the sum rate in interference-limited scenarios where each user decodes its own message with the presence of unknown interferences and noise considering the signal-to-interference-plus-noise-ratio. It is known that the problem of adapting the transmit and receive filters of the users to maximize the sum rate with a sum transmit power constraint is non-convex. Our novel approach is to formulate the sum rate maximization problem as an equivalent multi-convex optimization problem by adding two sets of auxiliary variables. An iterative algorit"},"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":"1503.06101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-20T15:12:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5589473382c666562291cb3b466874ac38dc100f47d171980d017d2578980322","abstract_canon_sha256":"f05429f6925cf3e65ff6a97c394e2e736037a1c8691d887a5158f304cb00c5bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:48.634234Z","signature_b64":"QxxUxZgdzbgaYGjSOkTSACUYkQiUCLEj1Ubb80Nq08jUutPIIL224W3BzN6EEUjDYBamlRzKZVoakaIFRjlRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"187426b7b99e2c89c774ee01011060f1b24c4848350d42cf5ca9ab0f661e8188","last_reissued_at":"2026-05-18T02:20:48.633521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:48.633521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing the Sum Rate in Cellular Networks Using Multi-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anja Klein, Hussein Al-Shatri, Rakash SivaSiva Ganesan, Tobias Weber, Xiang Li","submitted_at":"2015-03-20T15:12:53Z","abstract_excerpt":"In this paper, we propose a novel algorithm to maximize the sum rate in interference-limited scenarios where each user decodes its own message with the presence of unknown interferences and noise considering the signal-to-interference-plus-noise-ratio. It is known that the problem of adapting the transmit and receive filters of the users to maximize the sum rate with a sum transmit power constraint is non-convex. Our novel approach is to formulate the sum rate maximization problem as an equivalent multi-convex optimization problem by adding two sets of auxiliary variables. An iterative algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06101","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":"1503.06101","created_at":"2026-05-18T02:20:48.633654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06101v1","created_at":"2026-05-18T02:20:48.633654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06101","created_at":"2026-05-18T02:20:48.633654+00:00"},{"alias_kind":"pith_short_12","alias_value":"DB2CNN5ZTYWI","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DB2CNN5ZTYWITR3U","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DB2CNN5Z","created_at":"2026-05-18T12:29:17.054201+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/DB2CNN5ZTYWITR3U5YAQCEDA6G","json":"https://pith.science/pith/DB2CNN5ZTYWITR3U5YAQCEDA6G.json","graph_json":"https://pith.science/api/pith-number/DB2CNN5ZTYWITR3U5YAQCEDA6G/graph.json","events_json":"https://pith.science/api/pith-number/DB2CNN5ZTYWITR3U5YAQCEDA6G/events.json","paper":"https://pith.science/paper/DB2CNN5Z"},"agent_actions":{"view_html":"https://pith.science/pith/DB2CNN5ZTYWITR3U5YAQCEDA6G","download_json":"https://pith.science/pith/DB2CNN5ZTYWITR3U5YAQCEDA6G.json","view_paper":"https://pith.science/paper/DB2CNN5Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06101&json=true","fetch_graph":"https://pith.science/api/pith-number/DB2CNN5ZTYWITR3U5YAQCEDA6G/graph.json","fetch_events":"https://pith.science/api/pith-number/DB2CNN5ZTYWITR3U5YAQCEDA6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DB2CNN5ZTYWITR3U5YAQCEDA6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DB2CNN5ZTYWITR3U5YAQCEDA6G/action/storage_attestation","attest_author":"https://pith.science/pith/DB2CNN5ZTYWITR3U5YAQCEDA6G/action/author_attestation","sign_citation":"https://pith.science/pith/DB2CNN5ZTYWITR3U5YAQCEDA6G/action/citation_signature","submit_replication":"https://pith.science/pith/DB2CNN5ZTYWITR3U5YAQCEDA6G/action/replication_record"}},"created_at":"2026-05-18T02:20:48.633654+00:00","updated_at":"2026-05-18T02:20:48.633654+00:00"}