{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZUYDYLO7IDVYHWYORIP6GHTQ2Q","short_pith_number":"pith:ZUYDYLO7","schema_version":"1.0","canonical_sha256":"cd303c2ddf40eb83db0e8a1fe31e70d40d9b8c9c7a9a3cbd58596b900fc22e57","source":{"kind":"arxiv","id":"1704.01470","version":2},"attestation_state":"computed","paper":{"title":"Low-complexity Approaches for MIMO Capacity with Per-antenna Power Constraint","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Le-Nam Tran, Ronan Farrell, Thuy M. Pham","submitted_at":"2017-04-05T15:03:53Z","abstract_excerpt":"This paper proposes two low-complexity iterative algorithms to compute the capacity of a single-user multiple-input multiple-output channel with per-antenna power constraint. The first method results from manipulating the optimality conditions of the considered problem and applying fixed-point iteration. In the second approach, we transform the considered problem into a minimax optimization program using the well-known MAC- BC duality, and then solve it by a novel alternating optimization method. In both proposed iterative methods, each iteration involves an optimization problem which can be e"},"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":"1704.01470","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-04-05T15:03:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0078191231e5d16db005bde4bbc0ad4727ffc863431f66c4e8b54453f06cd8fe","abstract_canon_sha256":"d6ff304db6e27211e6a729b556e47d01376c50813fcf2f46b9c6642f1673cee6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:18.641159Z","signature_b64":"ytwOnKIAMDjaehs7r+8Q4z0+4m5EGo7QpEnsS/2g2XNi26XGhcOyvstuzLpQxNSp8Va0yR68nAZ89JTllO3WBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd303c2ddf40eb83db0e8a1fe31e70d40d9b8c9c7a9a3cbd58596b900fc22e57","last_reissued_at":"2026-05-18T00:44:18.640770Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:18.640770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-complexity Approaches for MIMO Capacity with Per-antenna Power Constraint","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Le-Nam Tran, Ronan Farrell, Thuy M. Pham","submitted_at":"2017-04-05T15:03:53Z","abstract_excerpt":"This paper proposes two low-complexity iterative algorithms to compute the capacity of a single-user multiple-input multiple-output channel with per-antenna power constraint. The first method results from manipulating the optimality conditions of the considered problem and applying fixed-point iteration. In the second approach, we transform the considered problem into a minimax optimization program using the well-known MAC- BC duality, and then solve it by a novel alternating optimization method. In both proposed iterative methods, each iteration involves an optimization problem which can be e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01470","kind":"arxiv","version":2},"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":"1704.01470","created_at":"2026-05-18T00:44:18.640830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.01470v2","created_at":"2026-05-18T00:44:18.640830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01470","created_at":"2026-05-18T00:44:18.640830+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZUYDYLO7IDVY","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZUYDYLO7IDVYHWYO","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZUYDYLO7","created_at":"2026-05-18T12:31:59.375834+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/ZUYDYLO7IDVYHWYORIP6GHTQ2Q","json":"https://pith.science/pith/ZUYDYLO7IDVYHWYORIP6GHTQ2Q.json","graph_json":"https://pith.science/api/pith-number/ZUYDYLO7IDVYHWYORIP6GHTQ2Q/graph.json","events_json":"https://pith.science/api/pith-number/ZUYDYLO7IDVYHWYORIP6GHTQ2Q/events.json","paper":"https://pith.science/paper/ZUYDYLO7"},"agent_actions":{"view_html":"https://pith.science/pith/ZUYDYLO7IDVYHWYORIP6GHTQ2Q","download_json":"https://pith.science/pith/ZUYDYLO7IDVYHWYORIP6GHTQ2Q.json","view_paper":"https://pith.science/paper/ZUYDYLO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.01470&json=true","fetch_graph":"https://pith.science/api/pith-number/ZUYDYLO7IDVYHWYORIP6GHTQ2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/ZUYDYLO7IDVYHWYORIP6GHTQ2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZUYDYLO7IDVYHWYORIP6GHTQ2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZUYDYLO7IDVYHWYORIP6GHTQ2Q/action/storage_attestation","attest_author":"https://pith.science/pith/ZUYDYLO7IDVYHWYORIP6GHTQ2Q/action/author_attestation","sign_citation":"https://pith.science/pith/ZUYDYLO7IDVYHWYORIP6GHTQ2Q/action/citation_signature","submit_replication":"https://pith.science/pith/ZUYDYLO7IDVYHWYORIP6GHTQ2Q/action/replication_record"}},"created_at":"2026-05-18T00:44:18.640830+00:00","updated_at":"2026-05-18T00:44:18.640830+00:00"}