{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4ZES72PCM2T37GHINAUD5KGMG2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"957cc0ad0b4bed0f4bf51d229eefd93aeb59107459c7cb25d7d29512acbb8f58","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-16T02:50:01Z","title_canon_sha256":"8543d7f97778edefed91353e26368626ea42d65ab6f4b5ea211f642daa8aaaf3"},"schema_version":"1.0","source":{"id":"1708.04750","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04750","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04750v1","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04750","created_at":"2026-05-18T00:37:58Z"},{"alias_kind":"pith_short_12","alias_value":"4ZES72PCM2T3","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4ZES72PCM2T37GHI","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4ZES72PC","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:58dd6a91104641bff65f897892f7ae3a571ec283affa67fb6ea665676ac97fef","target":"graph","created_at":"2026-05-18T00:37:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hidekazu Murata, Mirza Golam Kibria, Susumu Yoshida","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-16T02:50:01Z","title":"Coordinated Linear Precoding in Downlink Multicell MU-MISO OFDMA Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04750","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:70eeb6dfd11da1bc9f49c18f51619596657d4daba54616f235571c88cb46b8a5","target":"record","created_at":"2026-05-18T00:37:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"957cc0ad0b4bed0f4bf51d229eefd93aeb59107459c7cb25d7d29512acbb8f58","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-16T02:50:01Z","title_canon_sha256":"8543d7f97778edefed91353e26368626ea42d65ab6f4b5ea211f642daa8aaaf3"},"schema_version":"1.0","source":{"id":"1708.04750","kind":"arxiv","version":1}},"canonical_sha256":"e6492fe9e266a7bf98e868283ea8cc36963c6c7792114ea0db138d8ea57e1075","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6492fe9e266a7bf98e868283ea8cc36963c6c7792114ea0db138d8ea57e1075","first_computed_at":"2026-05-18T00:37:58.014365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:58.014365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qkt3zJpz0uNkDUan9nubcaDKG6CNLjvnA4hdeAyvE5PHR00iQf9FbTkZpRtOgOqezmvEfQD5w8FQ+TmErg1WBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:58.014811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04750","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70eeb6dfd11da1bc9f49c18f51619596657d4daba54616f235571c88cb46b8a5","sha256:58dd6a91104641bff65f897892f7ae3a571ec283affa67fb6ea665676ac97fef"],"state_sha256":"570150b58b8454de8a364e1043274b9f81f8c5581699499848e6efbcf02580e2"}