{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3AU6BZAND6OL34EXYPHF25JJRY","short_pith_number":"pith:3AU6BZAN","schema_version":"1.0","canonical_sha256":"d829e0e40d1f9cbdf097c3ce5d75298e3be3bd1f006e5f149490b3ae89568a18","source":{"kind":"arxiv","id":"1607.01346","version":1},"attestation_state":"computed","paper":{"title":"Resource Allocation in a MAC with and without security via Game Theoretic Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Krishna Chaitanya A, Shahid Mehraj Shah, Vinod Sharma","submitted_at":"2016-07-05T17:43:52Z","abstract_excerpt":"In this paper a $K$-user fading multiple access channel with and without security constraints is studied. First we consider a F-MAC without the security constraints. Under the assumption of individual CSI of users, we propose the problem of power allocation as a stochastic game when the receiver sends an ACK or a NACK depending on whether it was able to decode the message or not. We have used Multiplicative weight no-regret algorithm to obtain a Coarse Correlated Equilibrium (CCE). Then we consider the case when the users can decode ACK/NACK of each other. In this scenario we provide an algori"},"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":"1607.01346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-05T17:43:52Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"4b5838a527cf4797857e5a33c1600c00f638b53eb6ec50eafee4bb9af5b4bbf7","abstract_canon_sha256":"049c3f97a5af20f89a41822714e5b6ea94fe4dfc7628e10d1e134bd61d4037a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:29.770157Z","signature_b64":"zP/PxYCuJsFlihDcCr5ze+Y2jfeYsmSKdRCDKK62xYF5qHM8HbNoIEVMB+icUkRS2qw3vGaaV+WfKWvWsWjKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d829e0e40d1f9cbdf097c3ce5d75298e3be3bd1f006e5f149490b3ae89568a18","last_reissued_at":"2026-05-18T01:11:29.769585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:29.769585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource Allocation in a MAC with and without security via Game Theoretic Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Krishna Chaitanya A, Shahid Mehraj Shah, Vinod Sharma","submitted_at":"2016-07-05T17:43:52Z","abstract_excerpt":"In this paper a $K$-user fading multiple access channel with and without security constraints is studied. First we consider a F-MAC without the security constraints. Under the assumption of individual CSI of users, we propose the problem of power allocation as a stochastic game when the receiver sends an ACK or a NACK depending on whether it was able to decode the message or not. We have used Multiplicative weight no-regret algorithm to obtain a Coarse Correlated Equilibrium (CCE). Then we consider the case when the users can decode ACK/NACK of each other. In this scenario we provide an algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01346","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":"1607.01346","created_at":"2026-05-18T01:11:29.769690+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.01346v1","created_at":"2026-05-18T01:11:29.769690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01346","created_at":"2026-05-18T01:11:29.769690+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AU6BZAND6OL","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AU6BZAND6OL34EX","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AU6BZAN","created_at":"2026-05-18T12:29:55.572404+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/3AU6BZAND6OL34EXYPHF25JJRY","json":"https://pith.science/pith/3AU6BZAND6OL34EXYPHF25JJRY.json","graph_json":"https://pith.science/api/pith-number/3AU6BZAND6OL34EXYPHF25JJRY/graph.json","events_json":"https://pith.science/api/pith-number/3AU6BZAND6OL34EXYPHF25JJRY/events.json","paper":"https://pith.science/paper/3AU6BZAN"},"agent_actions":{"view_html":"https://pith.science/pith/3AU6BZAND6OL34EXYPHF25JJRY","download_json":"https://pith.science/pith/3AU6BZAND6OL34EXYPHF25JJRY.json","view_paper":"https://pith.science/paper/3AU6BZAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.01346&json=true","fetch_graph":"https://pith.science/api/pith-number/3AU6BZAND6OL34EXYPHF25JJRY/graph.json","fetch_events":"https://pith.science/api/pith-number/3AU6BZAND6OL34EXYPHF25JJRY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AU6BZAND6OL34EXYPHF25JJRY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AU6BZAND6OL34EXYPHF25JJRY/action/storage_attestation","attest_author":"https://pith.science/pith/3AU6BZAND6OL34EXYPHF25JJRY/action/author_attestation","sign_citation":"https://pith.science/pith/3AU6BZAND6OL34EXYPHF25JJRY/action/citation_signature","submit_replication":"https://pith.science/pith/3AU6BZAND6OL34EXYPHF25JJRY/action/replication_record"}},"created_at":"2026-05-18T01:11:29.769690+00:00","updated_at":"2026-05-18T01:11:29.769690+00:00"}