{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4PF2WQSLKSSAG5QKJV7TUG2KYT","short_pith_number":"pith:4PF2WQSL","canonical_record":{"source":{"id":"1603.03956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-03-12T19:35:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"38ffa8eee401266cd5db5b28a207469a93950cd365735ea9c6e3132a90d27d0c","abstract_canon_sha256":"83c7387b725ca1870b3e1ab81d9d813f31676afbde38c735672505b589a40761"},"schema_version":"1.0"},"canonical_sha256":"e3cbab424b54a403760a4d7f3a1b4ac4d097d9d3802d589efa7c129c52b495a6","source":{"kind":"arxiv","id":"1603.03956","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03956","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03956v1","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03956","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"pith_short_12","alias_value":"4PF2WQSLKSSA","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4PF2WQSLKSSAG5QK","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4PF2WQSL","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4PF2WQSLKSSAG5QKJV7TUG2KYT","target":"record","payload":{"canonical_record":{"source":{"id":"1603.03956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-03-12T19:35:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"38ffa8eee401266cd5db5b28a207469a93950cd365735ea9c6e3132a90d27d0c","abstract_canon_sha256":"83c7387b725ca1870b3e1ab81d9d813f31676afbde38c735672505b589a40761"},"schema_version":"1.0"},"canonical_sha256":"e3cbab424b54a403760a4d7f3a1b4ac4d097d9d3802d589efa7c129c52b495a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:26.475550Z","signature_b64":"03hb8LnAEgPQtQwXtKZip8TuY2aalUg92Pz8p19+Lp650Q9M3NJMcygrmOC7Sw9unWICsRE0xbcGG0nN0dLlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3cbab424b54a403760a4d7f3a1b4ac4d097d9d3802d589efa7c129c52b495a6","last_reissued_at":"2026-05-18T00:46:26.474922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:26.474922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.03956","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-18T00:46:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P813SMZJxWiRNwEURFYaZjsXLPVa1t9CGEa2nHwtiNgLSYPRCriCIQjlG8Th07+dhZK2APyVAnCK4Cag0buTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:30:50.560011Z"},"content_sha256":"17de06ece0c27a98ad871011fbbb0eaad4c732744aef4761e2dc13ddbb184164","schema_version":"1.0","event_id":"sha256:17de06ece0c27a98ad871011fbbb0eaad4c732744aef4761e2dc13ddbb184164"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4PF2WQSLKSSAG5QKJV7TUG2KYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Distributed Channel Allocation: a Competitive Game-Theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.GT","authors_text":"Amir Leshem, Ilai Bistritz","submitted_at":"2016-03-12T19:35:08Z","abstract_excerpt":"In this paper 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. First we present a natural non-cooperative game theoretic formulation for this problem. It is shown that, when interference is sufficiently strong, this game has a pure price of anarchy approaching infinity with high probability, and there is an asymptotically increasing number of equilibria with the worst performance. Then we propose a novel non-cooperative M Frequency-Selective Interferen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03956","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-18T00:46:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ri3X8YeZ1H1veBbwJrCBbI1Ex5WJnQl4KVwvL7txq3OtaOCCWCP1q7VWbw2DaeJaq9ToETYsn9/qpMm3+WpZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:30:50.560684Z"},"content_sha256":"bfb63686881f7c36fdc11cf0a76cbaaa74f752a5f47e90049d6825c3e09e8999","schema_version":"1.0","event_id":"sha256:bfb63686881f7c36fdc11cf0a76cbaaa74f752a5f47e90049d6825c3e09e8999"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT/bundle.json","state_url":"https://pith.science/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT/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-29T22:30:50Z","links":{"resolver":"https://pith.science/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT","bundle":"https://pith.science/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT/bundle.json","state":"https://pith.science/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4PF2WQSLKSSAG5QKJV7TUG2KYT","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":"83c7387b725ca1870b3e1ab81d9d813f31676afbde38c735672505b589a40761","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-03-12T19:35:08Z","title_canon_sha256":"38ffa8eee401266cd5db5b28a207469a93950cd365735ea9c6e3132a90d27d0c"},"schema_version":"1.0","source":{"id":"1603.03956","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03956","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03956v1","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03956","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"pith_short_12","alias_value":"4PF2WQSLKSSA","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4PF2WQSLKSSAG5QK","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4PF2WQSL","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:bfb63686881f7c36fdc11cf0a76cbaaa74f752a5f47e90049d6825c3e09e8999","target":"graph","created_at":"2026-05-18T00:46:26Z","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 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. First we present a natural non-cooperative game theoretic formulation for this problem. It is shown that, when interference is sufficiently strong, this game has a pure price of anarchy approaching infinity with high probability, and there is an asymptotically increasing number of equilibria with the worst performance. Then we propose a novel non-cooperative M Frequency-Selective Interferen","authors_text":"Amir Leshem, Ilai Bistritz","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-03-12T19:35:08Z","title":"Asymptotically Optimal Distributed Channel Allocation: a Competitive Game-Theoretic Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03956","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:17de06ece0c27a98ad871011fbbb0eaad4c732744aef4761e2dc13ddbb184164","target":"record","created_at":"2026-05-18T00:46:26Z","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":"83c7387b725ca1870b3e1ab81d9d813f31676afbde38c735672505b589a40761","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-03-12T19:35:08Z","title_canon_sha256":"38ffa8eee401266cd5db5b28a207469a93950cd365735ea9c6e3132a90d27d0c"},"schema_version":"1.0","source":{"id":"1603.03956","kind":"arxiv","version":1}},"canonical_sha256":"e3cbab424b54a403760a4d7f3a1b4ac4d097d9d3802d589efa7c129c52b495a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3cbab424b54a403760a4d7f3a1b4ac4d097d9d3802d589efa7c129c52b495a6","first_computed_at":"2026-05-18T00:46:26.474922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:26.474922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"03hb8LnAEgPQtQwXtKZip8TuY2aalUg92Pz8p19+Lp650Q9M3NJMcygrmOC7Sw9unWICsRE0xbcGG0nN0dLlBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:26.475550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03956","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17de06ece0c27a98ad871011fbbb0eaad4c732744aef4761e2dc13ddbb184164","sha256:bfb63686881f7c36fdc11cf0a76cbaaa74f752a5f47e90049d6825c3e09e8999"],"state_sha256":"4dfb18eecba5652e878967ad3e7bf1894e845bbf124c65baf9bb3a5c22fc1e3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rBMJ2CbzuB90JLD5xEQ8P2rK7gD2AwQxTMZUsFwbt73MwPLrar7nNcLK9RhGGuwOrTAxRUdw1ZMe+in8o46nBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:30:50.564780Z","bundle_sha256":"497922b3a2a8eee30dd002cf9d5e627b3a8fba03a7ddb0d1fc3d08ec83f2e512"}}