{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3AU6BZAND6OL34EXYPHF25JJRY","short_pith_number":"pith:3AU6BZAN","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"},"canonical_sha256":"d829e0e40d1f9cbdf097c3ce5d75298e3be3bd1f006e5f149490b3ae89568a18","source":{"kind":"arxiv","id":"1607.01346","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01346","created_at":"2026-05-18T01:11:29Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01346v1","created_at":"2026-05-18T01:11:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01346","created_at":"2026-05-18T01:11:29Z"},{"alias_kind":"pith_short_12","alias_value":"3AU6BZAND6OL","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3AU6BZAND6OL34EX","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3AU6BZAN","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3AU6BZAND6OL34EXYPHF25JJRY","target":"record","payload":{"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"},"canonical_sha256":"d829e0e40d1f9cbdf097c3ce5d75298e3be3bd1f006e5f149490b3ae89568a18","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"},"source_kind":"arxiv","source_id":"1607.01346","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JNJ31xEjZ7vxhPnLs/yAWifd6QqySxkdcuk5zHkvROFaYxCJs3sbnOM1qMyDyh3ZsepO6e+K2ixpCZzgKy5QDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:12:43.538346Z"},"content_sha256":"924c753057f0985ab5d3393460e376424fa06d1948638116b59251ca2605f1e2","schema_version":"1.0","event_id":"sha256:924c753057f0985ab5d3393460e376424fa06d1948638116b59251ca2605f1e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3AU6BZAND6OL34EXYPHF25JJRY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uzkA4rBtKMEJO0SsifSa/Z4RiNzYtZpmr+YcT2YiFC0DN/hVUi8RpkNQyHBlJRIZJCNp+Jd3MfIWTe+e52IHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:12:43.538709Z"},"content_sha256":"964964776eff6c88b7fe062491dd41216847b764e03bf6f65961e0e2cf008f81","schema_version":"1.0","event_id":"sha256:964964776eff6c88b7fe062491dd41216847b764e03bf6f65961e0e2cf008f81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3AU6BZAND6OL34EXYPHF25JJRY/bundle.json","state_url":"https://pith.science/pith/3AU6BZAND6OL34EXYPHF25JJRY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3AU6BZAND6OL34EXYPHF25JJRY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T15:12:43Z","links":{"resolver":"https://pith.science/pith/3AU6BZAND6OL34EXYPHF25JJRY","bundle":"https://pith.science/pith/3AU6BZAND6OL34EXYPHF25JJRY/bundle.json","state":"https://pith.science/pith/3AU6BZAND6OL34EXYPHF25JJRY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3AU6BZAND6OL34EXYPHF25JJRY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3AU6BZAND6OL34EXYPHF25JJRY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"049c3f97a5af20f89a41822714e5b6ea94fe4dfc7628e10d1e134bd61d4037a8","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-05T17:43:52Z","title_canon_sha256":"4b5838a527cf4797857e5a33c1600c00f638b53eb6ec50eafee4bb9af5b4bbf7"},"schema_version":"1.0","source":{"id":"1607.01346","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01346","created_at":"2026-05-18T01:11:29Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01346v1","created_at":"2026-05-18T01:11:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01346","created_at":"2026-05-18T01:11:29Z"},{"alias_kind":"pith_short_12","alias_value":"3AU6BZAND6OL","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3AU6BZAND6OL34EX","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3AU6BZAN","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:964964776eff6c88b7fe062491dd41216847b764e03bf6f65961e0e2cf008f81","target":"graph","created_at":"2026-05-18T01:11:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Krishna Chaitanya A, Shahid Mehraj Shah, Vinod Sharma","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-05T17:43:52Z","title":"Resource Allocation in a MAC with and without security via Game Theoretic Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01346","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:924c753057f0985ab5d3393460e376424fa06d1948638116b59251ca2605f1e2","target":"record","created_at":"2026-05-18T01:11:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"049c3f97a5af20f89a41822714e5b6ea94fe4dfc7628e10d1e134bd61d4037a8","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-05T17:43:52Z","title_canon_sha256":"4b5838a527cf4797857e5a33c1600c00f638b53eb6ec50eafee4bb9af5b4bbf7"},"schema_version":"1.0","source":{"id":"1607.01346","kind":"arxiv","version":1}},"canonical_sha256":"d829e0e40d1f9cbdf097c3ce5d75298e3be3bd1f006e5f149490b3ae89568a18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d829e0e40d1f9cbdf097c3ce5d75298e3be3bd1f006e5f149490b3ae89568a18","first_computed_at":"2026-05-18T01:11:29.769585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:29.769585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zP/PxYCuJsFlihDcCr5ze+Y2jfeYsmSKdRCDKK62xYF5qHM8HbNoIEVMB+icUkRS2qw3vGaaV+WfKWvWsWjKAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:29.770157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01346","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:924c753057f0985ab5d3393460e376424fa06d1948638116b59251ca2605f1e2","sha256:964964776eff6c88b7fe062491dd41216847b764e03bf6f65961e0e2cf008f81"],"state_sha256":"cf37c2b18ee057f2926cf4d2b78dfce1274ae466e1a337715702ab07047cd527"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ep9qAek3ZJ3NG+ck340VDJ2T3BB/0mDD/tkSUxHqTy2nGxRFZecLRhIT43u/86dP9uVdqDw4dfP1FQ01MZJPDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:12:43.540861Z","bundle_sha256":"43609c57c4052d18fa182d96fcdbfaeacf17d3f147279bdec1e56f82aa4eecbe"}}