{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:MTK22SIEGXEVTIPX54R3IVKUJC","short_pith_number":"pith:MTK22SIE","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"},"canonical_sha256":"64d5ad490435c959a1f7ef23b4555448b73f8fbd1a19984b54a08a3ff15b7bb9","source":{"kind":"arxiv","id":"2106.04207","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.04207","created_at":"2026-07-05T02:47:13Z"},{"alias_kind":"arxiv_version","alias_value":"2106.04207v1","created_at":"2026-07-05T02:47:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.04207","created_at":"2026-07-05T02:47:13Z"},{"alias_kind":"pith_short_12","alias_value":"MTK22SIEGXEV","created_at":"2026-07-05T02:47:13Z"},{"alias_kind":"pith_short_16","alias_value":"MTK22SIEGXEVTIPX","created_at":"2026-07-05T02:47:13Z"},{"alias_kind":"pith_short_8","alias_value":"MTK22SIE","created_at":"2026-07-05T02:47:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:MTK22SIEGXEVTIPX54R3IVKUJC","target":"record","payload":{"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"},"canonical_sha256":"64d5ad490435c959a1f7ef23b4555448b73f8fbd1a19984b54a08a3ff15b7bb9","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"},"source_kind":"arxiv","source_id":"2106.04207","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:47:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H26A9K1tRw2ODvN9jbBt3jin0MJW3jyAzmLNK5ryMuJv/GHSp1EaSlR4anQipZt7DnrwsM3YJf9DawDDqfMZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:01:34.804866Z"},"content_sha256":"a0eccda91ed49040cf10b5f4190f9628355c79d87c605c45019bdf47fb557bb9","schema_version":"1.0","event_id":"sha256:a0eccda91ed49040cf10b5f4190f9628355c79d87c605c45019bdf47fb557bb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:MTK22SIEGXEVTIPX54R3IVKUJC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:47:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oah21a/IlNu7RZxHsepiz3bqU5ikOuelP2sffqlokz7cVFgoZYhLUaAwkr965oqnSnTwo6UpDKr8xnszSo7uDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:01:34.805237Z"},"content_sha256":"251029c35dd1a752c3e35b80002b1952ed51b4559e320a28eb4b9f211d6e1bc4","schema_version":"1.0","event_id":"sha256:251029c35dd1a752c3e35b80002b1952ed51b4559e320a28eb4b9f211d6e1bc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTK22SIEGXEVTIPX54R3IVKUJC/bundle.json","state_url":"https://pith.science/pith/MTK22SIEGXEVTIPX54R3IVKUJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTK22SIEGXEVTIPX54R3IVKUJC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T19:01:34Z","links":{"resolver":"https://pith.science/pith/MTK22SIEGXEVTIPX54R3IVKUJC","bundle":"https://pith.science/pith/MTK22SIEGXEVTIPX54R3IVKUJC/bundle.json","state":"https://pith.science/pith/MTK22SIEGXEVTIPX54R3IVKUJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTK22SIEGXEVTIPX54R3IVKUJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:MTK22SIEGXEVTIPX54R3IVKUJC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"54c7fbf8781e349a4b1c9384603e51ae65d949bfce33d4541c88d7c13bcb86ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-08T09:32:43Z","title_canon_sha256":"7cf59a9cba9716faf4b450b75627ee0510f8394db28ed5d91377100b9be63690"},"schema_version":"1.0","source":{"id":"2106.04207","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.04207","created_at":"2026-07-05T02:47:13Z"},{"alias_kind":"arxiv_version","alias_value":"2106.04207v1","created_at":"2026-07-05T02:47:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.04207","created_at":"2026-07-05T02:47:13Z"},{"alias_kind":"pith_short_12","alias_value":"MTK22SIEGXEV","created_at":"2026-07-05T02:47:13Z"},{"alias_kind":"pith_short_16","alias_value":"MTK22SIEGXEVTIPX","created_at":"2026-07-05T02:47:13Z"},{"alias_kind":"pith_short_8","alias_value":"MTK22SIE","created_at":"2026-07-05T02:47:13Z"}],"graph_snapshots":[{"event_id":"sha256:251029c35dd1a752c3e35b80002b1952ed51b4559e320a28eb4b9f211d6e1bc4","target":"graph","created_at":"2026-07-05T02:47:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2106.04207/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dapeng Li, Junyan Liu, Shuai Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-08T09:32:43Z","title":"Cooperative Stochastic Multi-agent Multi-armed Bandits Robust to Adversarial Corruptions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.04207","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a0eccda91ed49040cf10b5f4190f9628355c79d87c605c45019bdf47fb557bb9","target":"record","created_at":"2026-07-05T02:47:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"54c7fbf8781e349a4b1c9384603e51ae65d949bfce33d4541c88d7c13bcb86ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-08T09:32:43Z","title_canon_sha256":"7cf59a9cba9716faf4b450b75627ee0510f8394db28ed5d91377100b9be63690"},"schema_version":"1.0","source":{"id":"2106.04207","kind":"arxiv","version":1}},"canonical_sha256":"64d5ad490435c959a1f7ef23b4555448b73f8fbd1a19984b54a08a3ff15b7bb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64d5ad490435c959a1f7ef23b4555448b73f8fbd1a19984b54a08a3ff15b7bb9","first_computed_at":"2026-07-05T02:47:13.269721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:47:13.269721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IdJzf/QMIR1zdi1RsNFYOsXf/V4pM+BPXoa/x+wLBwgOClCKkgAFoio5qWY6JgXA9HU21gaUf6lAG8131FyxCg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:47:13.270097Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.04207","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0eccda91ed49040cf10b5f4190f9628355c79d87c605c45019bdf47fb557bb9","sha256:251029c35dd1a752c3e35b80002b1952ed51b4559e320a28eb4b9f211d6e1bc4"],"state_sha256":"31a5b5e3614dfe9f52ee51c926d16a2245f7dd1de2130b1f988433936589a56f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zkNBMRNpvzsBB+0eUS/a/4k7K2X6zplXocwyz0hgSdpgMEPQoYquD9lzsrYPdGwkMFUTyqmr726C4D2JINgFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T19:01:34.808447Z","bundle_sha256":"7bff6247851d9b7d7b598e110c8ced4b0e4ebcf6241733dd62aa79e97f6b65cf"}}