{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PBRVR5X3PNRKXBAGILXDCCXKIO","short_pith_number":"pith:PBRVR5X3","canonical_record":{"source":{"id":"1101.2192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-11T19:57:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"068161629ec1794839271a9e7038b7e64661bc616cf22b8a7b9f6fa5937ffe76","abstract_canon_sha256":"ebd72864be7bd27fddb37ed8cd0e847c67451d4215d8067d89034993807dbe08"},"schema_version":"1.0"},"canonical_sha256":"786358f6fb7b62ab840642ee310aea43a95b1322dff61d74d710dfbb7548bbab","source":{"kind":"arxiv","id":"1101.2192","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2192","created_at":"2026-05-18T02:22:58Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2192v1","created_at":"2026-05-18T02:22:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2192","created_at":"2026-05-18T02:22:58Z"},{"alias_kind":"pith_short_12","alias_value":"PBRVR5X3PNRK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PBRVR5X3PNRKXBAG","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PBRVR5X3","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PBRVR5X3PNRKXBAGILXDCCXKIO","target":"record","payload":{"canonical_record":{"source":{"id":"1101.2192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-11T19:57:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"068161629ec1794839271a9e7038b7e64661bc616cf22b8a7b9f6fa5937ffe76","abstract_canon_sha256":"ebd72864be7bd27fddb37ed8cd0e847c67451d4215d8067d89034993807dbe08"},"schema_version":"1.0"},"canonical_sha256":"786358f6fb7b62ab840642ee310aea43a95b1322dff61d74d710dfbb7548bbab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:58.640933Z","signature_b64":"pWjVu4Sjtd9iNWzyxRxoFENH/rHSNrzQz8f2jXBNee32Y0iqhZHS+SpnRUMKAC/25hRIaJTsLMfNm4NdvrbQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"786358f6fb7b62ab840642ee310aea43a95b1322dff61d74d710dfbb7548bbab","last_reissued_at":"2026-05-18T02:22:58.640360Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:58.640360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.2192","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:22:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VixRhG6QYgRBmAtIlAgNjjehmWv5kVH9arYtsC8u4+2Cqno/2kcmlFJuKFHDjdpmYYvRkiaVSLO+nXk4bAr2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:09:25.418494Z"},"content_sha256":"05c06ebe6481e0c5809e610f3cec0602a5cf1773350042ea6482a25036b00093","schema_version":"1.0","event_id":"sha256:05c06ebe6481e0c5809e610f3cec0602a5cf1773350042ea6482a25036b00093"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PBRVR5X3PNRKXBAGILXDCCXKIO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Power Allocation Games in Interference Relay Channels: Existence Analysis of Nash Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"E. V. Belmega, S. Lasaulce","submitted_at":"2011-01-11T19:57:32Z","abstract_excerpt":"We consider a network composed of two interfering point-to-point links where the two transmitters can exploit one common relay node to improve their individual transmission rate. Communications are assumed to be multi-band and transmitters are assumed to selfishly allocate their resources to optimize their individual transmission rate. The main objective of this paper is to show that this conflicting situation (modeled by a non-cooperative game) has some stable outcomes, namely Nash equilibria. This result is proved for three different types of relaying protocols: decode-and-forward, estimate-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2192","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:22:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uBCbYrDAuTWg3SDMu4+E3Jzklh2N2piW/YnulFkqktr6huux+hc+XpL9ZczSPtUB0RGLX1dqHliFTRFTKoU5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:09:25.419123Z"},"content_sha256":"eb58130f0230095943158740e0ee3a62fbeaf77965af0323db0f87a39e4c562e","schema_version":"1.0","event_id":"sha256:eb58130f0230095943158740e0ee3a62fbeaf77965af0323db0f87a39e4c562e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PBRVR5X3PNRKXBAGILXDCCXKIO/bundle.json","state_url":"https://pith.science/pith/PBRVR5X3PNRKXBAGILXDCCXKIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PBRVR5X3PNRKXBAGILXDCCXKIO/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-12T10:09:25Z","links":{"resolver":"https://pith.science/pith/PBRVR5X3PNRKXBAGILXDCCXKIO","bundle":"https://pith.science/pith/PBRVR5X3PNRKXBAGILXDCCXKIO/bundle.json","state":"https://pith.science/pith/PBRVR5X3PNRKXBAGILXDCCXKIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PBRVR5X3PNRKXBAGILXDCCXKIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PBRVR5X3PNRKXBAGILXDCCXKIO","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":"ebd72864be7bd27fddb37ed8cd0e847c67451d4215d8067d89034993807dbe08","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-11T19:57:32Z","title_canon_sha256":"068161629ec1794839271a9e7038b7e64661bc616cf22b8a7b9f6fa5937ffe76"},"schema_version":"1.0","source":{"id":"1101.2192","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2192","created_at":"2026-05-18T02:22:58Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2192v1","created_at":"2026-05-18T02:22:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2192","created_at":"2026-05-18T02:22:58Z"},{"alias_kind":"pith_short_12","alias_value":"PBRVR5X3PNRK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PBRVR5X3PNRKXBAG","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PBRVR5X3","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:eb58130f0230095943158740e0ee3a62fbeaf77965af0323db0f87a39e4c562e","target":"graph","created_at":"2026-05-18T02:22:58Z","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 network composed of two interfering point-to-point links where the two transmitters can exploit one common relay node to improve their individual transmission rate. Communications are assumed to be multi-band and transmitters are assumed to selfishly allocate their resources to optimize their individual transmission rate. The main objective of this paper is to show that this conflicting situation (modeled by a non-cooperative game) has some stable outcomes, namely Nash equilibria. This result is proved for three different types of relaying protocols: decode-and-forward, estimate-","authors_text":"E. V. Belmega, S. Lasaulce","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-11T19:57:32Z","title":"Power Allocation Games in Interference Relay Channels: Existence Analysis of Nash Equilibria"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2192","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:05c06ebe6481e0c5809e610f3cec0602a5cf1773350042ea6482a25036b00093","target":"record","created_at":"2026-05-18T02:22:58Z","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":"ebd72864be7bd27fddb37ed8cd0e847c67451d4215d8067d89034993807dbe08","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-11T19:57:32Z","title_canon_sha256":"068161629ec1794839271a9e7038b7e64661bc616cf22b8a7b9f6fa5937ffe76"},"schema_version":"1.0","source":{"id":"1101.2192","kind":"arxiv","version":1}},"canonical_sha256":"786358f6fb7b62ab840642ee310aea43a95b1322dff61d74d710dfbb7548bbab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"786358f6fb7b62ab840642ee310aea43a95b1322dff61d74d710dfbb7548bbab","first_computed_at":"2026-05-18T02:22:58.640360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:58.640360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pWjVu4Sjtd9iNWzyxRxoFENH/rHSNrzQz8f2jXBNee32Y0iqhZHS+SpnRUMKAC/25hRIaJTsLMfNm4NdvrbQBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:58.640933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.2192","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05c06ebe6481e0c5809e610f3cec0602a5cf1773350042ea6482a25036b00093","sha256:eb58130f0230095943158740e0ee3a62fbeaf77965af0323db0f87a39e4c562e"],"state_sha256":"2363a033f830b38fdc3fad5e83884d4e40209b4cc252a0e344f988b759d762ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TAH58DZGOo3gubHvz41NVWmvBZXFfjvdnwC4uQ1eB9aPRIiU7GR9Xiv/iyMgmvzQg8itLWoRqHCmAtL5pInrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:09:25.422478Z","bundle_sha256":"a4e8432507cb273d55f7407e0779a388158af8f69528fdc0dd9a54fae6f12ac9"}}