{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:PXTQZE6H5ILQFW7ISJ53TRXLLL","short_pith_number":"pith:PXTQZE6H","schema_version":"1.0","canonical_sha256":"7de70c93c7ea1702dbe8927bb9c6eb5ae50ea28c4c267c49c7d2a57821b8ff7e","source":{"kind":"arxiv","id":"2102.10200","version":1},"attestation_state":"computed","paper":{"title":"A High Performance, Low Complexity Algorithm for Multi-Player Bandits Without Collision Sensing Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cindy Trinh, Richard Combes","submitted_at":"2021-02-19T23:10:48Z","abstract_excerpt":"Motivated by applications in cognitive radio networks, we consider the decentralized multi-player multi-armed bandit problem, without collision nor sensing information. We propose Randomized Selfish KL-UCB, an algorithm with very low computational complexity, inspired by the Selfish KL-UCB algorithm, which has been abandoned as it provably performs sub-optimally in some cases. We subject Randomized Selfish KL-UCB to extensive numerical experiments showing that it far outperforms state-of-the-art algorithms in almost all environments, sometimes by several orders of magnitude, and without the ad"},"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":"2102.10200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-19T23:10:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d6e398a0811072c5a156a2fbb390237769556001c34130f02e4298c02ee2519f","abstract_canon_sha256":"eb16ba2e958e7341fb04c04c348525b673f1ae825b56b0e8e7bd98e805bc1678"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:16:55.159760Z","signature_b64":"SOch27ygzTdt2sWZombpVhyF+S3NzaIvy8RgxRs+TUA2uC0p+wMpTRyRbR0QrLtOTSrejo2CZa7hCffK+oJeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7de70c93c7ea1702dbe8927bb9c6eb5ae50ea28c4c267c49c7d2a57821b8ff7e","last_reissued_at":"2026-07-05T02:16:55.159282Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:16:55.159282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A High Performance, Low Complexity Algorithm for Multi-Player Bandits Without Collision Sensing Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cindy Trinh, Richard Combes","submitted_at":"2021-02-19T23:10:48Z","abstract_excerpt":"Motivated by applications in cognitive radio networks, we consider the decentralized multi-player multi-armed bandit problem, without collision nor sensing information. We propose Randomized Selfish KL-UCB, an algorithm with very low computational complexity, inspired by the Selfish KL-UCB algorithm, which has been abandoned as it provably performs sub-optimally in some cases. We subject Randomized Selfish KL-UCB to extensive numerical experiments showing that it far outperforms state-of-the-art algorithms in almost all environments, sometimes by several orders of magnitude, and without the ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.10200","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.10200/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2102.10200","created_at":"2026-07-05T02:16:55.159339+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.10200v1","created_at":"2026-07-05T02:16:55.159339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.10200","created_at":"2026-07-05T02:16:55.159339+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXTQZE6H5ILQ","created_at":"2026-07-05T02:16:55.159339+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXTQZE6H5ILQFW7I","created_at":"2026-07-05T02:16:55.159339+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXTQZE6H","created_at":"2026-07-05T02:16:55.159339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06202","citing_title":"Bandit Learning in General Open Multi-agent Systems","ref_index":241,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PXTQZE6H5ILQFW7ISJ53TRXLLL","json":"https://pith.science/pith/PXTQZE6H5ILQFW7ISJ53TRXLLL.json","graph_json":"https://pith.science/api/pith-number/PXTQZE6H5ILQFW7ISJ53TRXLLL/graph.json","events_json":"https://pith.science/api/pith-number/PXTQZE6H5ILQFW7ISJ53TRXLLL/events.json","paper":"https://pith.science/paper/PXTQZE6H"},"agent_actions":{"view_html":"https://pith.science/pith/PXTQZE6H5ILQFW7ISJ53TRXLLL","download_json":"https://pith.science/pith/PXTQZE6H5ILQFW7ISJ53TRXLLL.json","view_paper":"https://pith.science/paper/PXTQZE6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.10200&json=true","fetch_graph":"https://pith.science/api/pith-number/PXTQZE6H5ILQFW7ISJ53TRXLLL/graph.json","fetch_events":"https://pith.science/api/pith-number/PXTQZE6H5ILQFW7ISJ53TRXLLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXTQZE6H5ILQFW7ISJ53TRXLLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXTQZE6H5ILQFW7ISJ53TRXLLL/action/storage_attestation","attest_author":"https://pith.science/pith/PXTQZE6H5ILQFW7ISJ53TRXLLL/action/author_attestation","sign_citation":"https://pith.science/pith/PXTQZE6H5ILQFW7ISJ53TRXLLL/action/citation_signature","submit_replication":"https://pith.science/pith/PXTQZE6H5ILQFW7ISJ53TRXLLL/action/replication_record"}},"created_at":"2026-07-05T02:16:55.159339+00:00","updated_at":"2026-07-05T02:16:55.159339+00:00"}