{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5C3OEA2RSEE5DU7AIGMRZOSNSQ","short_pith_number":"pith:5C3OEA2R","schema_version":"1.0","canonical_sha256":"e8b6e203519109d1d3e041991cba4d9402b0056c9184628e261a501a0e65075c","source":{"kind":"arxiv","id":"1710.08800","version":2},"attestation_state":"computed","paper":{"title":"Large Player games on Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Lakshmi Narasimhan Theagarajan, Prashant Narayanan","submitted_at":"2017-10-24T14:28:52Z","abstract_excerpt":"We consider a scenario where $N$ users send packets to a common access point. The receiver decodes the message of each user by treating the other user's signals as noise. Associated with each user is its channel state and a finite queue which varies with time. Each user allocates his power and the admission control variable dynamically to maximize his expected throughput. Each user is unaware of the states, and actions taken, by the other users. This problem is formulated as a Markov game for which we show the existence of equilibrium and an algorithm to compute the equilibrium policies. We th"},"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":"1710.08800","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-24T14:28:52Z","cross_cats_sorted":[],"title_canon_sha256":"8a2128f12c2a4ebae59dae0cbc5aa530091d16e7be8119a0636e8bc0f6dc2004","abstract_canon_sha256":"257da34faa647f34015f24f00930a1fabd22f1ec6f20374654d0329d941e2d35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:16.184522Z","signature_b64":"dH51wp44SJs8lqmquPkBmG4SlZk5U1OCziisnJ46anXeRmMkBbp+FGt2zWxc/diyxlqMN0CKn839nOi/6CbSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8b6e203519109d1d3e041991cba4d9402b0056c9184628e261a501a0e65075c","last_reissued_at":"2026-05-17T23:47:16.183992Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:16.183992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Player games on Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Lakshmi Narasimhan Theagarajan, Prashant Narayanan","submitted_at":"2017-10-24T14:28:52Z","abstract_excerpt":"We consider a scenario where $N$ users send packets to a common access point. The receiver decodes the message of each user by treating the other user's signals as noise. Associated with each user is its channel state and a finite queue which varies with time. Each user allocates his power and the admission control variable dynamically to maximize his expected throughput. Each user is unaware of the states, and actions taken, by the other users. This problem is formulated as a Markov game for which we show the existence of equilibrium and an algorithm to compute the equilibrium policies. We th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08800","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":"1710.08800","created_at":"2026-05-17T23:47:16.184088+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.08800v2","created_at":"2026-05-17T23:47:16.184088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08800","created_at":"2026-05-17T23:47:16.184088+00:00"},{"alias_kind":"pith_short_12","alias_value":"5C3OEA2RSEE5","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5C3OEA2RSEE5DU7A","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5C3OEA2R","created_at":"2026-05-18T12:31:00.734936+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/5C3OEA2RSEE5DU7AIGMRZOSNSQ","json":"https://pith.science/pith/5C3OEA2RSEE5DU7AIGMRZOSNSQ.json","graph_json":"https://pith.science/api/pith-number/5C3OEA2RSEE5DU7AIGMRZOSNSQ/graph.json","events_json":"https://pith.science/api/pith-number/5C3OEA2RSEE5DU7AIGMRZOSNSQ/events.json","paper":"https://pith.science/paper/5C3OEA2R"},"agent_actions":{"view_html":"https://pith.science/pith/5C3OEA2RSEE5DU7AIGMRZOSNSQ","download_json":"https://pith.science/pith/5C3OEA2RSEE5DU7AIGMRZOSNSQ.json","view_paper":"https://pith.science/paper/5C3OEA2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.08800&json=true","fetch_graph":"https://pith.science/api/pith-number/5C3OEA2RSEE5DU7AIGMRZOSNSQ/graph.json","fetch_events":"https://pith.science/api/pith-number/5C3OEA2RSEE5DU7AIGMRZOSNSQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5C3OEA2RSEE5DU7AIGMRZOSNSQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5C3OEA2RSEE5DU7AIGMRZOSNSQ/action/storage_attestation","attest_author":"https://pith.science/pith/5C3OEA2RSEE5DU7AIGMRZOSNSQ/action/author_attestation","sign_citation":"https://pith.science/pith/5C3OEA2RSEE5DU7AIGMRZOSNSQ/action/citation_signature","submit_replication":"https://pith.science/pith/5C3OEA2RSEE5DU7AIGMRZOSNSQ/action/replication_record"}},"created_at":"2026-05-17T23:47:16.184088+00:00","updated_at":"2026-05-17T23:47:16.184088+00:00"}