{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TXSGFQGCL2T57LDPN55KZB2EHF","short_pith_number":"pith:TXSGFQGC","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"},"canonical_sha256":"9de462c0c25ea7dfac6f6f7aac8744395d4a747eb5492b6e3bc1dfdedf6aa498","source":{"kind":"arxiv","id":"1409.7551","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7551","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7551v1","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7551","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"TXSGFQGCL2T5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TXSGFQGCL2T57LDP","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TXSGFQGC","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TXSGFQGCL2T57LDPN55KZB2EHF","target":"record","payload":{"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"},"canonical_sha256":"9de462c0c25ea7dfac6f6f7aac8744395d4a747eb5492b6e3bc1dfdedf6aa498","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"},"source_kind":"arxiv","source_id":"1409.7551","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-18T02:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"puF3XNYjPLW0bBoIIGtwvqHZ6ptWiUebKO3qe7v1YOyE1ZFiwGdDQghceJ6pDrmEpWdkXlVAjp0T1diedD4uBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:06:20.863742Z"},"content_sha256":"575a832fc9e97acea409bc5f2bd7132047c5ce486f04915e8018a8bc31bb1f61","schema_version":"1.0","event_id":"sha256:575a832fc9e97acea409bc5f2bd7132047c5ce486f04915e8018a8bc31bb1f61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TXSGFQGCL2T57LDPN55KZB2EHF","target":"graph","payload":{"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"},"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-18T02:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KyKKA46r+ei0UGxcuETsSzlBkFXQgbC8YEHZYiBgX8s76SqW++Of6yPvpo0Op9sZb345JqhcNRV5KBxzV+90Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:06:20.864516Z"},"content_sha256":"5a8c5085dd52007b120ba5a0c4257a896190d75b96d67a755a3440e71e92096d","schema_version":"1.0","event_id":"sha256:5a8c5085dd52007b120ba5a0c4257a896190d75b96d67a755a3440e71e92096d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXSGFQGCL2T57LDPN55KZB2EHF/bundle.json","state_url":"https://pith.science/pith/TXSGFQGCL2T57LDPN55KZB2EHF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXSGFQGCL2T57LDPN55KZB2EHF/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-09T06:06:20Z","links":{"resolver":"https://pith.science/pith/TXSGFQGCL2T57LDPN55KZB2EHF","bundle":"https://pith.science/pith/TXSGFQGCL2T57LDPN55KZB2EHF/bundle.json","state":"https://pith.science/pith/TXSGFQGCL2T57LDPN55KZB2EHF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXSGFQGCL2T57LDPN55KZB2EHF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TXSGFQGCL2T57LDPN55KZB2EHF","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":"124049a283a2234b682e2acf91ebb6cbf8089c687980125f5ed9f7dffbbf0539","cross_cats_sorted":["cs.GT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-26T12:16:59Z","title_canon_sha256":"7b6f08c41e9dcc505bb43c5a84918cc3d07f74edc39ae49f669507ab1f928390"},"schema_version":"1.0","source":{"id":"1409.7551","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7551","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7551v1","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7551","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"TXSGFQGCL2T5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TXSGFQGCL2T57LDP","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TXSGFQGC","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:5a8c5085dd52007b120ba5a0c4257a896190d75b96d67a755a3440e71e92096d","target":"graph","created_at":"2026-05-18T02:41:52Z","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":"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","authors_text":"Krishna Chaitanya A, Utpal Mukherji, Vinod Sharma","cross_cats":["cs.GT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-26T12:16:59Z","title":"Algorithms for Stochastic Games on Interference Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7551","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:575a832fc9e97acea409bc5f2bd7132047c5ce486f04915e8018a8bc31bb1f61","target":"record","created_at":"2026-05-18T02:41:52Z","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":"124049a283a2234b682e2acf91ebb6cbf8089c687980125f5ed9f7dffbbf0539","cross_cats_sorted":["cs.GT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-26T12:16:59Z","title_canon_sha256":"7b6f08c41e9dcc505bb43c5a84918cc3d07f74edc39ae49f669507ab1f928390"},"schema_version":"1.0","source":{"id":"1409.7551","kind":"arxiv","version":1}},"canonical_sha256":"9de462c0c25ea7dfac6f6f7aac8744395d4a747eb5492b6e3bc1dfdedf6aa498","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9de462c0c25ea7dfac6f6f7aac8744395d4a747eb5492b6e3bc1dfdedf6aa498","first_computed_at":"2026-05-18T02:41:52.442335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:52.442335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yOJiIGC0hskN85qmXCrq7s8+ynbnsCKeqX3raHu/ZaEWjLtumdBs/5qHe5wmqbmZYLT/M8gm9OmVMf1H4HKsBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:52.442872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7551","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:575a832fc9e97acea409bc5f2bd7132047c5ce486f04915e8018a8bc31bb1f61","sha256:5a8c5085dd52007b120ba5a0c4257a896190d75b96d67a755a3440e71e92096d"],"state_sha256":"9658e583ac7fcf7c78cd061d71c5521820a4828b6c04e1e1c745f62313e15bea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Smc7IZDQngHiYrNC5Vu8woKd32KK7gVgUa5RnJMk/gH38+EBHUS0TE41X4GJweHPwJmaGDZMcmiFp1NaUf+7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:06:20.868243Z","bundle_sha256":"bb499be4e782aebab951fb5f78d95a33c527b64afea9874ec43616cdfde866bc"}}