{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:B2P3X2CSEBIWTP64MSAPPFI3VO","short_pith_number":"pith:B2P3X2CS","canonical_record":{"source":{"id":"1705.02957","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-08T16:29:27Z","cross_cats_sorted":["cs.GT","math.IT"],"title_canon_sha256":"53ed627d5a46042668969546cd1803206fb8db09b8ecad68cb0a9c1766a74d42","abstract_canon_sha256":"5ebee51077951a39952719303b558f9c7864649afb62e7e4831c15125349bbfd"},"schema_version":"1.0"},"canonical_sha256":"0e9fbbe852205169bfdc6480f7951babb80e6829483b6bb5880c2b42941172bf","source":{"kind":"arxiv","id":"1705.02957","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02957","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02957v5","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02957","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"pith_short_12","alias_value":"B2P3X2CSEBIW","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B2P3X2CSEBIWTP64","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B2P3X2CS","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:B2P3X2CSEBIWTP64MSAPPFI3VO","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02957","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-08T16:29:27Z","cross_cats_sorted":["cs.GT","math.IT"],"title_canon_sha256":"53ed627d5a46042668969546cd1803206fb8db09b8ecad68cb0a9c1766a74d42","abstract_canon_sha256":"5ebee51077951a39952719303b558f9c7864649afb62e7e4831c15125349bbfd"},"schema_version":"1.0"},"canonical_sha256":"0e9fbbe852205169bfdc6480f7951babb80e6829483b6bb5880c2b42941172bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:10.507963Z","signature_b64":"jG2CUuwMYuCHPTLmvRtfNrv9uVLKiZk4m0zO6obniZZ/0IlRHX+ZuQtC8RcFMOHfuyEOZTKpgIQGMVWgszrSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e9fbbe852205169bfdc6480f7951babb80e6829483b6bb5880c2b42941172bf","last_reissued_at":"2026-05-18T00:01:10.507391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:10.507391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02957","source_version":5,"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-18T00:01:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z6FpMl2hxpNChx8kkNLDTw0vrGpJ5nHeazrIns299887J+jWI1KfLLuTTNBNvII+cM1ggh9+v1MHEseWHfTgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:09:39.251649Z"},"content_sha256":"7c235128d53acccb4566b3d1c9e416df5d565cf9927660e5dfe9e32aaf8210aa","schema_version":"1.0","event_id":"sha256:7c235128d53acccb4566b3d1c9e416df5d565cf9927660e5dfe9e32aaf8210aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:B2P3X2CSEBIWTP64MSAPPFI3VO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Game Theoretic Dynamic Channel Allocation for Frequency-Selective Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Leshem, Ilai Bistritz","submitted_at":"2017-05-08T16:29:27Z","abstract_excerpt":"We consider the problem of distributed channel allocation in large networks under the frequency-selective interference channel. Performance is measured by the weighted sum of achievable rates. Our proposed algorithm is a modified Fictitious Play algorithm that can be implemented distributedly and its stable points are the pure Nash equilibria of a given game. Our goal is to design a utility function for a non-cooperative game such that all of its pure Nash equilibria have close to optimal global performance. This will make the algorithm close to optimal while requiring no communication between"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02957","kind":"arxiv","version":5},"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-18T00:01:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d6SIvpyQwfACzmT1NbtykgQBMuqDsEiAENVNEnqvW9yzzsiSUj17cedMVsXhxTCHmvkb9++8v8KDB4cq/56wAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:09:39.252072Z"},"content_sha256":"8719bfa965d70f418d9c9836977ff907d6172cd815b8e4fb6fe7741e85d89b2c","schema_version":"1.0","event_id":"sha256:8719bfa965d70f418d9c9836977ff907d6172cd815b8e4fb6fe7741e85d89b2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2P3X2CSEBIWTP64MSAPPFI3VO/bundle.json","state_url":"https://pith.science/pith/B2P3X2CSEBIWTP64MSAPPFI3VO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2P3X2CSEBIWTP64MSAPPFI3VO/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-05-30T01:09:39Z","links":{"resolver":"https://pith.science/pith/B2P3X2CSEBIWTP64MSAPPFI3VO","bundle":"https://pith.science/pith/B2P3X2CSEBIWTP64MSAPPFI3VO/bundle.json","state":"https://pith.science/pith/B2P3X2CSEBIWTP64MSAPPFI3VO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2P3X2CSEBIWTP64MSAPPFI3VO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:B2P3X2CSEBIWTP64MSAPPFI3VO","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":"5ebee51077951a39952719303b558f9c7864649afb62e7e4831c15125349bbfd","cross_cats_sorted":["cs.GT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-08T16:29:27Z","title_canon_sha256":"53ed627d5a46042668969546cd1803206fb8db09b8ecad68cb0a9c1766a74d42"},"schema_version":"1.0","source":{"id":"1705.02957","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02957","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02957v5","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02957","created_at":"2026-05-18T00:01:10Z"},{"alias_kind":"pith_short_12","alias_value":"B2P3X2CSEBIW","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B2P3X2CSEBIWTP64","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B2P3X2CS","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:8719bfa965d70f418d9c9836977ff907d6172cd815b8e4fb6fe7741e85d89b2c","target":"graph","created_at":"2026-05-18T00:01:10Z","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 the problem of distributed channel allocation in large networks under the frequency-selective interference channel. Performance is measured by the weighted sum of achievable rates. Our proposed algorithm is a modified Fictitious Play algorithm that can be implemented distributedly and its stable points are the pure Nash equilibria of a given game. Our goal is to design a utility function for a non-cooperative game such that all of its pure Nash equilibria have close to optimal global performance. This will make the algorithm close to optimal while requiring no communication between","authors_text":"Amir Leshem, Ilai Bistritz","cross_cats":["cs.GT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-08T16:29:27Z","title":"Game Theoretic Dynamic Channel Allocation for Frequency-Selective Interference Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02957","kind":"arxiv","version":5},"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:7c235128d53acccb4566b3d1c9e416df5d565cf9927660e5dfe9e32aaf8210aa","target":"record","created_at":"2026-05-18T00:01:10Z","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":"5ebee51077951a39952719303b558f9c7864649afb62e7e4831c15125349bbfd","cross_cats_sorted":["cs.GT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-08T16:29:27Z","title_canon_sha256":"53ed627d5a46042668969546cd1803206fb8db09b8ecad68cb0a9c1766a74d42"},"schema_version":"1.0","source":{"id":"1705.02957","kind":"arxiv","version":5}},"canonical_sha256":"0e9fbbe852205169bfdc6480f7951babb80e6829483b6bb5880c2b42941172bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e9fbbe852205169bfdc6480f7951babb80e6829483b6bb5880c2b42941172bf","first_computed_at":"2026-05-18T00:01:10.507391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:10.507391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jG2CUuwMYuCHPTLmvRtfNrv9uVLKiZk4m0zO6obniZZ/0IlRHX+ZuQtC8RcFMOHfuyEOZTKpgIQGMVWgszrSDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:10.507963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02957","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c235128d53acccb4566b3d1c9e416df5d565cf9927660e5dfe9e32aaf8210aa","sha256:8719bfa965d70f418d9c9836977ff907d6172cd815b8e4fb6fe7741e85d89b2c"],"state_sha256":"9291469c2d0b1157970f92d46be4bebe85628d76a7136290a159e4c8caa8a2b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Je1kdxqP03SWI4tp/PuRnlB6zRFH7jUA8fJmhyZOJDFFP5S7RdsEH7CxXkVTZ6lUXEo/aiegCbGQtGf5z1DiBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:09:39.254415Z","bundle_sha256":"cd70289d4222b1a554de2cde92f5ce23cdb0ccc8fa7befd3b34de21d15e4a425"}}