{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4ZES72PCM2T37GHINAUD5KGMG2","short_pith_number":"pith:4ZES72PC","schema_version":"1.0","canonical_sha256":"e6492fe9e266a7bf98e868283ea8cc36963c6c7792114ea0db138d8ea57e1075","source":{"kind":"arxiv","id":"1708.04750","version":1},"attestation_state":"computed","paper":{"title":"Coordinated Linear Precoding in Downlink Multicell MU-MISO OFDMA Networks","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, Susumu Yoshida","submitted_at":"2017-08-16T02:50:01Z","abstract_excerpt":"This paper considers coordinated linear precoding in downlink multicell multiuser orthogonal frequency-division multiple access (OFDMA) network. A less-complex, fast and provably convergent algorithm that maximizes the weighted sum-rate with per base station (BS) transmit power constraint is formulated. We approximate the nonconvex weighted sum- rate maximization (WSRM) problem with a solvable convex form by means of sequential parametric convex approximation (SPCA) approach. The second order cone program (SOCP) formulations of the objective function and constraints of the optimization problem"},"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.04750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-16T02:50:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8543d7f97778edefed91353e26368626ea42d65ab6f4b5ea211f642daa8aaaf3","abstract_canon_sha256":"957cc0ad0b4bed0f4bf51d229eefd93aeb59107459c7cb25d7d29512acbb8f58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:58.014811Z","signature_b64":"Qkt3zJpz0uNkDUan9nubcaDKG6CNLjvnA4hdeAyvE5PHR00iQf9FbTkZpRtOgOqezmvEfQD5w8FQ+TmErg1WBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6492fe9e266a7bf98e868283ea8cc36963c6c7792114ea0db138d8ea57e1075","last_reissued_at":"2026-05-18T00:37:58.014365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:58.014365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coordinated Linear Precoding in Downlink Multicell MU-MISO OFDMA Networks","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, Susumu Yoshida","submitted_at":"2017-08-16T02:50:01Z","abstract_excerpt":"This paper considers coordinated linear precoding in downlink multicell multiuser orthogonal frequency-division multiple access (OFDMA) network. A less-complex, fast and provably convergent algorithm that maximizes the weighted sum-rate with per base station (BS) transmit power constraint is formulated. We approximate the nonconvex weighted sum- rate maximization (WSRM) problem with a solvable convex form by means of sequential parametric convex approximation (SPCA) approach. The second order cone program (SOCP) formulations of the objective function and constraints of the optimization problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04750","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.04750","created_at":"2026-05-18T00:37:58.014434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04750v1","created_at":"2026-05-18T00:37:58.014434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04750","created_at":"2026-05-18T00:37:58.014434+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZES72PCM2T3","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZES72PCM2T37GHI","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZES72PC","created_at":"2026-05-18T12:31:00.734936+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/4ZES72PCM2T37GHINAUD5KGMG2","json":"https://pith.science/pith/4ZES72PCM2T37GHINAUD5KGMG2.json","graph_json":"https://pith.science/api/pith-number/4ZES72PCM2T37GHINAUD5KGMG2/graph.json","events_json":"https://pith.science/api/pith-number/4ZES72PCM2T37GHINAUD5KGMG2/events.json","paper":"https://pith.science/paper/4ZES72PC"},"agent_actions":{"view_html":"https://pith.science/pith/4ZES72PCM2T37GHINAUD5KGMG2","download_json":"https://pith.science/pith/4ZES72PCM2T37GHINAUD5KGMG2.json","view_paper":"https://pith.science/paper/4ZES72PC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04750&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZES72PCM2T37GHINAUD5KGMG2/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZES72PCM2T37GHINAUD5KGMG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZES72PCM2T37GHINAUD5KGMG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZES72PCM2T37GHINAUD5KGMG2/action/storage_attestation","attest_author":"https://pith.science/pith/4ZES72PCM2T37GHINAUD5KGMG2/action/author_attestation","sign_citation":"https://pith.science/pith/4ZES72PCM2T37GHINAUD5KGMG2/action/citation_signature","submit_replication":"https://pith.science/pith/4ZES72PCM2T37GHINAUD5KGMG2/action/replication_record"}},"created_at":"2026-05-18T00:37:58.014434+00:00","updated_at":"2026-05-18T00:37:58.014434+00:00"}