{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RXOFQ4TKXY3PO6XGE35RPDVFQE","short_pith_number":"pith:RXOFQ4TK","schema_version":"1.0","canonical_sha256":"8ddc58726abe36f77ae626fb178ea58126504f8a80277f81c38ce295bfdfe208","source":{"kind":"arxiv","id":"1809.08151","version":4},"attestation_state":"computed","paper":{"title":"SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Etienne Boursier, Vianney Perchet","submitted_at":"2018-09-21T14:43:46Z","abstract_excerpt":"Motivated by cognitive radio networks, we consider the stochastic multiplayer multi-armed bandit problem, where several players pull arms simultaneously and collisions occur if one of them is pulled by several players at the same stage. We present a decentralized algorithm that achieves the same performance as a centralized one, contradicting the existing lower bounds for that problem. This is possible by \"hacking\" the standard model by constructing a communication protocol between players that deliberately enforces collisions, allowing them to share their information at a negligible cost. Thi"},"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":"1809.08151","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-21T14:43:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6a2c29ffe933f41587cf76b9b71094cc48b472e98a247d63b6a72a18d19afdea","abstract_canon_sha256":"e4873ccba03477178dc2ba8e2dfd94254ec071d22f0bc905a7d66874f93a9232"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:10.693443Z","signature_b64":"pg76h74o6uDz8Ziu7OHoMqKa4c7aPOiAfKYEH1QcUZ9iuQznWAr9Xbu30D4ODoU267p9RzMGmMZOOlfBg9SKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ddc58726abe36f77ae626fb178ea58126504f8a80277f81c38ce295bfdfe208","last_reissued_at":"2026-07-05T00:20:10.692952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:10.692952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Etienne Boursier, Vianney Perchet","submitted_at":"2018-09-21T14:43:46Z","abstract_excerpt":"Motivated by cognitive radio networks, we consider the stochastic multiplayer multi-armed bandit problem, where several players pull arms simultaneously and collisions occur if one of them is pulled by several players at the same stage. We present a decentralized algorithm that achieves the same performance as a centralized one, contradicting the existing lower bounds for that problem. This is possible by \"hacking\" the standard model by constructing a communication protocol between players that deliberately enforces collisions, allowing them to share their information at a negligible cost. Thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08151","kind":"arxiv","version":4},"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/1809.08151/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":"1809.08151","created_at":"2026-07-05T00:20:10.693003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08151v4","created_at":"2026-07-05T00:20:10.693003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08151","created_at":"2026-07-05T00:20:10.693003+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXOFQ4TKXY3P","created_at":"2026-07-05T00:20:10.693003+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXOFQ4TKXY3PO6XG","created_at":"2026-07-05T00:20:10.693003+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXOFQ4TK","created_at":"2026-07-05T00:20:10.693003+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.06158","citing_title":"Accelerated learning from recommender systems using multi-armed bandit","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RXOFQ4TKXY3PO6XGE35RPDVFQE","json":"https://pith.science/pith/RXOFQ4TKXY3PO6XGE35RPDVFQE.json","graph_json":"https://pith.science/api/pith-number/RXOFQ4TKXY3PO6XGE35RPDVFQE/graph.json","events_json":"https://pith.science/api/pith-number/RXOFQ4TKXY3PO6XGE35RPDVFQE/events.json","paper":"https://pith.science/paper/RXOFQ4TK"},"agent_actions":{"view_html":"https://pith.science/pith/RXOFQ4TKXY3PO6XGE35RPDVFQE","download_json":"https://pith.science/pith/RXOFQ4TKXY3PO6XGE35RPDVFQE.json","view_paper":"https://pith.science/paper/RXOFQ4TK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08151&json=true","fetch_graph":"https://pith.science/api/pith-number/RXOFQ4TKXY3PO6XGE35RPDVFQE/graph.json","fetch_events":"https://pith.science/api/pith-number/RXOFQ4TKXY3PO6XGE35RPDVFQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXOFQ4TKXY3PO6XGE35RPDVFQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXOFQ4TKXY3PO6XGE35RPDVFQE/action/storage_attestation","attest_author":"https://pith.science/pith/RXOFQ4TKXY3PO6XGE35RPDVFQE/action/author_attestation","sign_citation":"https://pith.science/pith/RXOFQ4TKXY3PO6XGE35RPDVFQE/action/citation_signature","submit_replication":"https://pith.science/pith/RXOFQ4TKXY3PO6XGE35RPDVFQE/action/replication_record"}},"created_at":"2026-07-05T00:20:10.693003+00:00","updated_at":"2026-07-05T00:20:10.693003+00:00"}