{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7PILXYTUEH357CUI7SLCQYLHAU","short_pith_number":"pith:7PILXYTU","schema_version":"1.0","canonical_sha256":"fbd0bbe27421f7df8a88fc9628616705105be7551ebd12a3c2eb4d5fdd8d490e","source":{"kind":"arxiv","id":"1503.02839","version":4},"attestation_state":"computed","paper":{"title":"Learning Equilibria of a Stochastic Game on Gaussian Interference Channels with Incomplete Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Krishna Chaitanya A, Utpal Mukherji, Vinod Sharma","submitted_at":"2015-03-10T10:00:39Z","abstract_excerpt":"We consider a wireless communication system in which $N$ transmitter-receiver pairs want to communicate with each other. Each transmitter transmits data at a certain rate using a power that depends on the channel gain to its receiver. If a receiver can successfully receive the message, it sends an acknowledgment (ACK), else it sends a negative ACK (NACK). Each user aims to maximize its probability of successful transmission. We formulate this problem as a stochastic game and propose a fully distributed learning algorithm to find a correlated equilibrium (CE). In addition, we use a no regret al"},"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":"1503.02839","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-10T10:00:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1dee063c706867d8dea2ec50886f1b6d8dbebb230c4dbd32626396abf3d7b07d","abstract_canon_sha256":"7a5d8c39ded319a52498de8037ab7c00fd9d7bbb4b6e8be341aaee5763ae440c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:23.138004Z","signature_b64":"V+v4tq5DcZoo328Rv7D2TP+46eP7QoS1QNmcaIr9qnyJ3tVwMRSl+Cf9vI9fGmqTUI/oy+mnglnqDWVi3pi5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbd0bbe27421f7df8a88fc9628616705105be7551ebd12a3c2eb4d5fdd8d490e","last_reissued_at":"2026-05-18T01:21:23.137467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:23.137467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Equilibria of a Stochastic Game on Gaussian Interference Channels with Incomplete Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Krishna Chaitanya A, Utpal Mukherji, Vinod Sharma","submitted_at":"2015-03-10T10:00:39Z","abstract_excerpt":"We consider a wireless communication system in which $N$ transmitter-receiver pairs want to communicate with each other. Each transmitter transmits data at a certain rate using a power that depends on the channel gain to its receiver. If a receiver can successfully receive the message, it sends an acknowledgment (ACK), else it sends a negative ACK (NACK). Each user aims to maximize its probability of successful transmission. We formulate this problem as a stochastic game and propose a fully distributed learning algorithm to find a correlated equilibrium (CE). In addition, we use a no regret al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02839","kind":"arxiv","version":4},"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":"1503.02839","created_at":"2026-05-18T01:21:23.137556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02839v4","created_at":"2026-05-18T01:21:23.137556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02839","created_at":"2026-05-18T01:21:23.137556+00:00"},{"alias_kind":"pith_short_12","alias_value":"7PILXYTUEH35","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7PILXYTUEH357CUI","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7PILXYTU","created_at":"2026-05-18T12:29:10.953037+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/7PILXYTUEH357CUI7SLCQYLHAU","json":"https://pith.science/pith/7PILXYTUEH357CUI7SLCQYLHAU.json","graph_json":"https://pith.science/api/pith-number/7PILXYTUEH357CUI7SLCQYLHAU/graph.json","events_json":"https://pith.science/api/pith-number/7PILXYTUEH357CUI7SLCQYLHAU/events.json","paper":"https://pith.science/paper/7PILXYTU"},"agent_actions":{"view_html":"https://pith.science/pith/7PILXYTUEH357CUI7SLCQYLHAU","download_json":"https://pith.science/pith/7PILXYTUEH357CUI7SLCQYLHAU.json","view_paper":"https://pith.science/paper/7PILXYTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02839&json=true","fetch_graph":"https://pith.science/api/pith-number/7PILXYTUEH357CUI7SLCQYLHAU/graph.json","fetch_events":"https://pith.science/api/pith-number/7PILXYTUEH357CUI7SLCQYLHAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7PILXYTUEH357CUI7SLCQYLHAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7PILXYTUEH357CUI7SLCQYLHAU/action/storage_attestation","attest_author":"https://pith.science/pith/7PILXYTUEH357CUI7SLCQYLHAU/action/author_attestation","sign_citation":"https://pith.science/pith/7PILXYTUEH357CUI7SLCQYLHAU/action/citation_signature","submit_replication":"https://pith.science/pith/7PILXYTUEH357CUI7SLCQYLHAU/action/replication_record"}},"created_at":"2026-05-18T01:21:23.137556+00:00","updated_at":"2026-05-18T01:21:23.137556+00:00"}