{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PVXG4O4DAIXKV545LOMWOCPTS3","short_pith_number":"pith:PVXG4O4D","schema_version":"1.0","canonical_sha256":"7d6e6e3b83022eaaf79d5b996709f396fa9d50cbd14e68ff81ef433d642e5d0a","source":{"kind":"arxiv","id":"1701.04577","version":1},"attestation_state":"computed","paper":{"title":"Optimal Distributed Channel Assignment in D2D Networks Using Learning in Noisy Potential Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Marceau Coupechoux, Mohd. Shabbir Ali, Pierre Coucheney","submitted_at":"2017-01-17T09:05:30Z","abstract_excerpt":"We present a novel solution for Channel Assignment Problem (CAP) in Device-to-Device (D2D) wireless networks that takes into account the throughput estimation noise. CAP is known to be NP-hard in the literature and there is no practical optimal learning algorithm that takes into account the estimation noise. In this paper, we first formulate the CAP as a stochastic optimization problem to maximize the expected sum data rate. To capture the estimation noise, CAP is modeled as a noisy potential game, a novel notion we introduce in this paper. Then, we propose a distributed Binary Log-linear Lear"},"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":"1701.04577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-01-17T09:05:30Z","cross_cats_sorted":["cs.GT","cs.IT","math.IT"],"title_canon_sha256":"9e3e5c05f51cf9590d6654deb08e4c7b929c1d62cc7eccd4333ff24745f1c1f3","abstract_canon_sha256":"c694735a8d3d7ee5ecf0350c0ebcaad42a207a07771931bfef8e1e524d0cf1f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:43.220501Z","signature_b64":"wbb90G04wKvcCS+GJ9bkr/LL7Y+7aA64ZkkqcxYZErg9k49sEAkUNrqUPR/jT+jZUVpeYOfUHGFI3qDKMo7GAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d6e6e3b83022eaaf79d5b996709f396fa9d50cbd14e68ff81ef433d642e5d0a","last_reissued_at":"2026-05-18T00:52:43.219377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:43.219377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Distributed Channel Assignment in D2D Networks Using Learning in Noisy Potential Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Marceau Coupechoux, Mohd. Shabbir Ali, Pierre Coucheney","submitted_at":"2017-01-17T09:05:30Z","abstract_excerpt":"We present a novel solution for Channel Assignment Problem (CAP) in Device-to-Device (D2D) wireless networks that takes into account the throughput estimation noise. CAP is known to be NP-hard in the literature and there is no practical optimal learning algorithm that takes into account the estimation noise. In this paper, we first formulate the CAP as a stochastic optimization problem to maximize the expected sum data rate. To capture the estimation noise, CAP is modeled as a noisy potential game, a novel notion we introduce in this paper. Then, we propose a distributed Binary Log-linear Lear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04577","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":"1701.04577","created_at":"2026-05-18T00:52:43.219473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04577v1","created_at":"2026-05-18T00:52:43.219473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04577","created_at":"2026-05-18T00:52:43.219473+00:00"},{"alias_kind":"pith_short_12","alias_value":"PVXG4O4DAIXK","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PVXG4O4DAIXKV545","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PVXG4O4D","created_at":"2026-05-18T12:31:37.085036+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/PVXG4O4DAIXKV545LOMWOCPTS3","json":"https://pith.science/pith/PVXG4O4DAIXKV545LOMWOCPTS3.json","graph_json":"https://pith.science/api/pith-number/PVXG4O4DAIXKV545LOMWOCPTS3/graph.json","events_json":"https://pith.science/api/pith-number/PVXG4O4DAIXKV545LOMWOCPTS3/events.json","paper":"https://pith.science/paper/PVXG4O4D"},"agent_actions":{"view_html":"https://pith.science/pith/PVXG4O4DAIXKV545LOMWOCPTS3","download_json":"https://pith.science/pith/PVXG4O4DAIXKV545LOMWOCPTS3.json","view_paper":"https://pith.science/paper/PVXG4O4D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04577&json=true","fetch_graph":"https://pith.science/api/pith-number/PVXG4O4DAIXKV545LOMWOCPTS3/graph.json","fetch_events":"https://pith.science/api/pith-number/PVXG4O4DAIXKV545LOMWOCPTS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PVXG4O4DAIXKV545LOMWOCPTS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PVXG4O4DAIXKV545LOMWOCPTS3/action/storage_attestation","attest_author":"https://pith.science/pith/PVXG4O4DAIXKV545LOMWOCPTS3/action/author_attestation","sign_citation":"https://pith.science/pith/PVXG4O4DAIXKV545LOMWOCPTS3/action/citation_signature","submit_replication":"https://pith.science/pith/PVXG4O4DAIXKV545LOMWOCPTS3/action/replication_record"}},"created_at":"2026-05-18T00:52:43.219473+00:00","updated_at":"2026-05-18T00:52:43.219473+00:00"}