{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4PF2WQSLKSSAG5QKJV7TUG2KYT","short_pith_number":"pith:4PF2WQSL","schema_version":"1.0","canonical_sha256":"e3cbab424b54a403760a4d7f3a1b4ac4d097d9d3802d589efa7c129c52b495a6","source":{"kind":"arxiv","id":"1603.03956","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.03956","created_at":"2026-05-18T00:46:26.475026+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.03956v1","created_at":"2026-05-18T00:46:26.475026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03956","created_at":"2026-05-18T00:46:26.475026+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PF2WQSLKSSA","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PF2WQSLKSSAG5QK","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PF2WQSL","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT","json":"https://pith.science/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT.json","graph_json":"https://pith.science/api/pith-number/4PF2WQSLKSSAG5QKJV7TUG2KYT/graph.json","events_json":"https://pith.science/api/pith-number/4PF2WQSLKSSAG5QKJV7TUG2KYT/events.json","paper":"https://pith.science/paper/4PF2WQSL"},"agent_actions":{"view_html":"https://pith.science/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT","download_json":"https://pith.science/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT.json","view_paper":"https://pith.science/paper/4PF2WQSL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.03956&json=true","fetch_graph":"https://pith.science/api/pith-number/4PF2WQSLKSSAG5QKJV7TUG2KYT/graph.json","fetch_events":"https://pith.science/api/pith-number/4PF2WQSLKSSAG5QKJV7TUG2KYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT/action/storage_attestation","attest_author":"https://pith.science/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT/action/author_attestation","sign_citation":"https://pith.science/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT/action/citation_signature","submit_replication":"https://pith.science/pith/4PF2WQSLKSSAG5QKJV7TUG2KYT/action/replication_record"}},"created_at":"2026-05-18T00:46:26.475026+00:00","updated_at":"2026-05-18T00:46:26.475026+00:00"}