{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TXSGFQGCL2T57LDPN55KZB2EHF","short_pith_number":"pith:TXSGFQGC","schema_version":"1.0","canonical_sha256":"9de462c0c25ea7dfac6f6f7aac8744395d4a747eb5492b6e3bc1dfdedf6aa498","source":{"kind":"arxiv","id":"1409.7551","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for Stochastic Games on Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.IT"],"primary_cat":"cs.IT","authors_text":"Krishna Chaitanya A, Utpal Mukherji, Vinod Sharma","submitted_at":"2014-09-26T12:16:59Z","abstract_excerpt":"We consider a wireless channel shared by multiple transmitter-receiver pairs. Their transmissions interfere with each other. Each transmitter-receiver pair aims to maximize its long-term average transmission rate subject to an average power constraint. This scenario is modeled as a stochastic game. We provide sufficient conditions for existence and uniqueness of a Nash equilibrium (NE). We then formulate the problem of finding NE as a variational inequality (VI) problem and present an algorithm to solve the VI using regularization. We also provide distributed algorithms to compute Pareto optim"},"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":"1409.7551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-26T12:16:59Z","cross_cats_sorted":["cs.GT","math.IT"],"title_canon_sha256":"7b6f08c41e9dcc505bb43c5a84918cc3d07f74edc39ae49f669507ab1f928390","abstract_canon_sha256":"124049a283a2234b682e2acf91ebb6cbf8089c687980125f5ed9f7dffbbf0539"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:52.442872Z","signature_b64":"yOJiIGC0hskN85qmXCrq7s8+ynbnsCKeqX3raHu/ZaEWjLtumdBs/5qHe5wmqbmZYLT/M8gm9OmVMf1H4HKsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9de462c0c25ea7dfac6f6f7aac8744395d4a747eb5492b6e3bc1dfdedf6aa498","last_reissued_at":"2026-05-18T02:41:52.442335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:52.442335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Stochastic Games on Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.IT"],"primary_cat":"cs.IT","authors_text":"Krishna Chaitanya A, Utpal Mukherji, Vinod Sharma","submitted_at":"2014-09-26T12:16:59Z","abstract_excerpt":"We consider a wireless channel shared by multiple transmitter-receiver pairs. Their transmissions interfere with each other. Each transmitter-receiver pair aims to maximize its long-term average transmission rate subject to an average power constraint. This scenario is modeled as a stochastic game. We provide sufficient conditions for existence and uniqueness of a Nash equilibrium (NE). We then formulate the problem of finding NE as a variational inequality (VI) problem and present an algorithm to solve the VI using regularization. We also provide distributed algorithms to compute Pareto optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7551","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":"1409.7551","created_at":"2026-05-18T02:41:52.442400+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7551v1","created_at":"2026-05-18T02:41:52.442400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7551","created_at":"2026-05-18T02:41:52.442400+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXSGFQGCL2T5","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXSGFQGCL2T57LDP","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXSGFQGC","created_at":"2026-05-18T12:28:52.271510+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/TXSGFQGCL2T57LDPN55KZB2EHF","json":"https://pith.science/pith/TXSGFQGCL2T57LDPN55KZB2EHF.json","graph_json":"https://pith.science/api/pith-number/TXSGFQGCL2T57LDPN55KZB2EHF/graph.json","events_json":"https://pith.science/api/pith-number/TXSGFQGCL2T57LDPN55KZB2EHF/events.json","paper":"https://pith.science/paper/TXSGFQGC"},"agent_actions":{"view_html":"https://pith.science/pith/TXSGFQGCL2T57LDPN55KZB2EHF","download_json":"https://pith.science/pith/TXSGFQGCL2T57LDPN55KZB2EHF.json","view_paper":"https://pith.science/paper/TXSGFQGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7551&json=true","fetch_graph":"https://pith.science/api/pith-number/TXSGFQGCL2T57LDPN55KZB2EHF/graph.json","fetch_events":"https://pith.science/api/pith-number/TXSGFQGCL2T57LDPN55KZB2EHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXSGFQGCL2T57LDPN55KZB2EHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXSGFQGCL2T57LDPN55KZB2EHF/action/storage_attestation","attest_author":"https://pith.science/pith/TXSGFQGCL2T57LDPN55KZB2EHF/action/author_attestation","sign_citation":"https://pith.science/pith/TXSGFQGCL2T57LDPN55KZB2EHF/action/citation_signature","submit_replication":"https://pith.science/pith/TXSGFQGCL2T57LDPN55KZB2EHF/action/replication_record"}},"created_at":"2026-05-18T02:41:52.442400+00:00","updated_at":"2026-05-18T02:41:52.442400+00:00"}