{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OVB2XOYRNFKBIQMG7IVZ655BEA","short_pith_number":"pith:OVB2XOYR","schema_version":"1.0","canonical_sha256":"7543abbb116954144186fa2b9f77a1200077baa66ea9c70bf4b3edb36e405113","source":{"kind":"arxiv","id":"1412.0833","version":1},"attestation_state":"computed","paper":{"title":"Fast and Optimal Power Control Games in Multiuser MIMO Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.GT","authors_text":"Hassan Aghaeinia, Peyman Siyari","submitted_at":"2014-12-02T10:03:48Z","abstract_excerpt":"In this paper, we analyze the problem of power control in a multiuser MIMO network, where the optimal linear precoder is employed in each user to achieve maximum point- to-point information rate. We design a distributed power control algorithm based on the concept of game theory and contractive functions that has a couple of advantages over the previous designs (e.g. more uniqueness probability of Nash equilibria and asynchronous implementation). Despite these improvements, the sum-rate of the users does not increase because the proposed algorithm can not lead the power control game to an effi"},"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":"1412.0833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-02T10:03:48Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"019886a71b794ffafa5b0a3ff2bfc99a2ed5476f1fa1d4268dcde14f0bc6211c","abstract_canon_sha256":"4db62321734825aa1ef38dc90ce87abfbb185572ecacb3b79e37d4be78bb0c58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:21.092531Z","signature_b64":"K6iTG4/WNGHuykQU0GD1cvOAWb3OYeKwocskyDFMMnzYFGZF/AZcS9k0hASkRisE6xJzdZspJcK4Md58jghBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7543abbb116954144186fa2b9f77a1200077baa66ea9c70bf4b3edb36e405113","last_reissued_at":"2026-05-18T02:32:21.092134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:21.092134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Optimal Power Control Games in Multiuser MIMO Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.GT","authors_text":"Hassan Aghaeinia, Peyman Siyari","submitted_at":"2014-12-02T10:03:48Z","abstract_excerpt":"In this paper, we analyze the problem of power control in a multiuser MIMO network, where the optimal linear precoder is employed in each user to achieve maximum point- to-point information rate. We design a distributed power control algorithm based on the concept of game theory and contractive functions that has a couple of advantages over the previous designs (e.g. more uniqueness probability of Nash equilibria and asynchronous implementation). Despite these improvements, the sum-rate of the users does not increase because the proposed algorithm can not lead the power control game to an effi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0833","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":"1412.0833","created_at":"2026-05-18T02:32:21.092198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0833v1","created_at":"2026-05-18T02:32:21.092198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0833","created_at":"2026-05-18T02:32:21.092198+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVB2XOYRNFKB","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVB2XOYRNFKBIQMG","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVB2XOYR","created_at":"2026-05-18T12:28:43.426989+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/OVB2XOYRNFKBIQMG7IVZ655BEA","json":"https://pith.science/pith/OVB2XOYRNFKBIQMG7IVZ655BEA.json","graph_json":"https://pith.science/api/pith-number/OVB2XOYRNFKBIQMG7IVZ655BEA/graph.json","events_json":"https://pith.science/api/pith-number/OVB2XOYRNFKBIQMG7IVZ655BEA/events.json","paper":"https://pith.science/paper/OVB2XOYR"},"agent_actions":{"view_html":"https://pith.science/pith/OVB2XOYRNFKBIQMG7IVZ655BEA","download_json":"https://pith.science/pith/OVB2XOYRNFKBIQMG7IVZ655BEA.json","view_paper":"https://pith.science/paper/OVB2XOYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0833&json=true","fetch_graph":"https://pith.science/api/pith-number/OVB2XOYRNFKBIQMG7IVZ655BEA/graph.json","fetch_events":"https://pith.science/api/pith-number/OVB2XOYRNFKBIQMG7IVZ655BEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVB2XOYRNFKBIQMG7IVZ655BEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVB2XOYRNFKBIQMG7IVZ655BEA/action/storage_attestation","attest_author":"https://pith.science/pith/OVB2XOYRNFKBIQMG7IVZ655BEA/action/author_attestation","sign_citation":"https://pith.science/pith/OVB2XOYRNFKBIQMG7IVZ655BEA/action/citation_signature","submit_replication":"https://pith.science/pith/OVB2XOYRNFKBIQMG7IVZ655BEA/action/replication_record"}},"created_at":"2026-05-18T02:32:21.092198+00:00","updated_at":"2026-05-18T02:32:21.092198+00:00"}