{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:MTK22SIEGXEVTIPX54R3IVKUJC","short_pith_number":"pith:MTK22SIE","schema_version":"1.0","canonical_sha256":"64d5ad490435c959a1f7ef23b4555448b73f8fbd1a19984b54a08a3ff15b7bb9","source":{"kind":"arxiv","id":"2106.04207","version":1},"attestation_state":"computed","paper":{"title":"Cooperative Stochastic Multi-agent Multi-armed Bandits Robust to Adversarial Corruptions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dapeng Li, Junyan Liu, Shuai Li","submitted_at":"2021-06-08T09:32:43Z","abstract_excerpt":"We study the problem of stochastic bandits with adversarial corruptions in the cooperative multi-agent setting, where $V$ agents interact with a common $K$-armed bandit problem, and each pair of agents can communicate with each other to expedite the learning process. In the problem, the rewards are independently sampled from distributions across all agents and rounds, but they may be corrupted by an adversary. Our goal is to minimize both the overall regret and communication cost across all agents. We first show that an additive term of corruption is unavoidable for any algorithm in this probl"},"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":"2106.04207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-08T09:32:43Z","cross_cats_sorted":[],"title_canon_sha256":"7cf59a9cba9716faf4b450b75627ee0510f8394db28ed5d91377100b9be63690","abstract_canon_sha256":"54c7fbf8781e349a4b1c9384603e51ae65d949bfce33d4541c88d7c13bcb86ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:47:13.270097Z","signature_b64":"IdJzf/QMIR1zdi1RsNFYOsXf/V4pM+BPXoa/x+wLBwgOClCKkgAFoio5qWY6JgXA9HU21gaUf6lAG8131FyxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64d5ad490435c959a1f7ef23b4555448b73f8fbd1a19984b54a08a3ff15b7bb9","last_reissued_at":"2026-07-05T02:47:13.269721Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:47:13.269721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cooperative Stochastic Multi-agent Multi-armed Bandits Robust to Adversarial Corruptions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dapeng Li, Junyan Liu, Shuai Li","submitted_at":"2021-06-08T09:32:43Z","abstract_excerpt":"We study the problem of stochastic bandits with adversarial corruptions in the cooperative multi-agent setting, where $V$ agents interact with a common $K$-armed bandit problem, and each pair of agents can communicate with each other to expedite the learning process. In the problem, the rewards are independently sampled from distributions across all agents and rounds, but they may be corrupted by an adversary. Our goal is to minimize both the overall regret and communication cost across all agents. We first show that an additive term of corruption is unavoidable for any algorithm in this probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.04207","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/2106.04207/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":"2106.04207","created_at":"2026-07-05T02:47:13.269770+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.04207v1","created_at":"2026-07-05T02:47:13.269770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.04207","created_at":"2026-07-05T02:47:13.269770+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTK22SIEGXEV","created_at":"2026-07-05T02:47:13.269770+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTK22SIEGXEVTIPX","created_at":"2026-07-05T02:47:13.269770+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTK22SIE","created_at":"2026-07-05T02:47:13.269770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08077","citing_title":"Cascading Bandits Robust to Adversarial Corruptions","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MTK22SIEGXEVTIPX54R3IVKUJC","json":"https://pith.science/pith/MTK22SIEGXEVTIPX54R3IVKUJC.json","graph_json":"https://pith.science/api/pith-number/MTK22SIEGXEVTIPX54R3IVKUJC/graph.json","events_json":"https://pith.science/api/pith-number/MTK22SIEGXEVTIPX54R3IVKUJC/events.json","paper":"https://pith.science/paper/MTK22SIE"},"agent_actions":{"view_html":"https://pith.science/pith/MTK22SIEGXEVTIPX54R3IVKUJC","download_json":"https://pith.science/pith/MTK22SIEGXEVTIPX54R3IVKUJC.json","view_paper":"https://pith.science/paper/MTK22SIE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.04207&json=true","fetch_graph":"https://pith.science/api/pith-number/MTK22SIEGXEVTIPX54R3IVKUJC/graph.json","fetch_events":"https://pith.science/api/pith-number/MTK22SIEGXEVTIPX54R3IVKUJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTK22SIEGXEVTIPX54R3IVKUJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTK22SIEGXEVTIPX54R3IVKUJC/action/storage_attestation","attest_author":"https://pith.science/pith/MTK22SIEGXEVTIPX54R3IVKUJC/action/author_attestation","sign_citation":"https://pith.science/pith/MTK22SIEGXEVTIPX54R3IVKUJC/action/citation_signature","submit_replication":"https://pith.science/pith/MTK22SIEGXEVTIPX54R3IVKUJC/action/replication_record"}},"created_at":"2026-07-05T02:47:13.269770+00:00","updated_at":"2026-07-05T02:47:13.269770+00:00"}