{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BMR3W4KO75AR2RTZZCW2UCIMK3","short_pith_number":"pith:BMR3W4KO","canonical_record":{"source":{"id":"1904.12233","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-28T00:21:04Z","cross_cats_sorted":["cs.MA","stat.ML"],"title_canon_sha256":"ed704af550f4c95bb86dfc135a271fcb74caa2eb291965b161f0c840393d7b7c","abstract_canon_sha256":"cb47e5712248f8dca439ac7eefa212d04b35747b3d0bdb50e4287d2ba2a6e0c2"},"schema_version":"1.0"},"canonical_sha256":"0b23bb714eff411d4679c8adaa090c56cc873bb57393df43aab24f7330873ec7","source":{"kind":"arxiv","id":"1904.12233","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12233","created_at":"2026-05-17T23:47:11Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12233v2","created_at":"2026-05-17T23:47:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12233","created_at":"2026-05-17T23:47:11Z"},{"alias_kind":"pith_short_12","alias_value":"BMR3W4KO75AR","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BMR3W4KO75AR2RTZ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BMR3W4KO","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BMR3W4KO75AR2RTZZCW2UCIMK3","target":"record","payload":{"canonical_record":{"source":{"id":"1904.12233","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-28T00:21:04Z","cross_cats_sorted":["cs.MA","stat.ML"],"title_canon_sha256":"ed704af550f4c95bb86dfc135a271fcb74caa2eb291965b161f0c840393d7b7c","abstract_canon_sha256":"cb47e5712248f8dca439ac7eefa212d04b35747b3d0bdb50e4287d2ba2a6e0c2"},"schema_version":"1.0"},"canonical_sha256":"0b23bb714eff411d4679c8adaa090c56cc873bb57393df43aab24f7330873ec7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:11.900198Z","signature_b64":"hzWLUIdnM/iIKyTZqRRvkgIXjF6RB3N7S5poHqbdEtihJ1vsANHiDuc/agh0kM2Gk4yC9k5UX3Z4GgSzHoD0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b23bb714eff411d4679c8adaa090c56cc873bb57393df43aab24f7330873ec7","last_reissued_at":"2026-05-17T23:47:11.899818Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:11.899818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.12233","source_version":2,"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-05-17T23:47:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PiIJ5DxQxpHFkECmT6ra0jjaU1wbmhoql2aMEMJnBzXszERCTngr1XNEQEXcseQzLgghWLGRS3R0YWgZ5SL+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T06:36:49.984674Z"},"content_sha256":"a70418a31ac239e86ddf9d8543940934dc2c3f46a999c1f8b2c5020c8310598a","schema_version":"1.0","event_id":"sha256:a70418a31ac239e86ddf9d8543940934dc2c3f46a999c1f8b2c5020c8310598a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BMR3W4KO75AR2RTZZCW2UCIMK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Mark Sellke, S\\'ebastien Bubeck, Yuanzhi Li, Yuval Peres","submitted_at":"2019-04-28T00:21:04Z","abstract_excerpt":"We consider the non-stochastic version of the (cooperative) multi-player multi-armed bandit problem. The model assumes no communication at all between the players, and furthermore when two (or more) players select the same action this results in a maximal loss. We prove the first $\\sqrt{T}$-type regret guarantee for this problem, under the feedback model where collisions are announced to the colliding players. Such a bound was not known even for the simpler stochastic version. We also prove the first sublinear guarantee for the feedback model where collision information is not available, namel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12233","kind":"arxiv","version":2},"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"},"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-05-17T23:47:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n2mZu/e31rPeFi3ObG+gAG/WUkPrM0eTTfaBye8FHIKvWhdZGNeE4EFW2YBum1J73RHvPFIVELiFqfizVRjlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T06:36:49.985353Z"},"content_sha256":"714e6b223a9210e72be31fc07eb32d44428c13f1dc4ad951203e2c275bc32218","schema_version":"1.0","event_id":"sha256:714e6b223a9210e72be31fc07eb32d44428c13f1dc4ad951203e2c275bc32218"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMR3W4KO75AR2RTZZCW2UCIMK3/bundle.json","state_url":"https://pith.science/pith/BMR3W4KO75AR2RTZZCW2UCIMK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMR3W4KO75AR2RTZZCW2UCIMK3/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-05-25T06:36:49Z","links":{"resolver":"https://pith.science/pith/BMR3W4KO75AR2RTZZCW2UCIMK3","bundle":"https://pith.science/pith/BMR3W4KO75AR2RTZZCW2UCIMK3/bundle.json","state":"https://pith.science/pith/BMR3W4KO75AR2RTZZCW2UCIMK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMR3W4KO75AR2RTZZCW2UCIMK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BMR3W4KO75AR2RTZZCW2UCIMK3","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":"cb47e5712248f8dca439ac7eefa212d04b35747b3d0bdb50e4287d2ba2a6e0c2","cross_cats_sorted":["cs.MA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-28T00:21:04Z","title_canon_sha256":"ed704af550f4c95bb86dfc135a271fcb74caa2eb291965b161f0c840393d7b7c"},"schema_version":"1.0","source":{"id":"1904.12233","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12233","created_at":"2026-05-17T23:47:11Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12233v2","created_at":"2026-05-17T23:47:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12233","created_at":"2026-05-17T23:47:11Z"},{"alias_kind":"pith_short_12","alias_value":"BMR3W4KO75AR","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BMR3W4KO75AR2RTZ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BMR3W4KO","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:714e6b223a9210e72be31fc07eb32d44428c13f1dc4ad951203e2c275bc32218","target":"graph","created_at":"2026-05-17T23:47:11Z","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"},"paper":{"abstract_excerpt":"We consider the non-stochastic version of the (cooperative) multi-player multi-armed bandit problem. The model assumes no communication at all between the players, and furthermore when two (or more) players select the same action this results in a maximal loss. We prove the first $\\sqrt{T}$-type regret guarantee for this problem, under the feedback model where collisions are announced to the colliding players. Such a bound was not known even for the simpler stochastic version. We also prove the first sublinear guarantee for the feedback model where collision information is not available, namel","authors_text":"Mark Sellke, S\\'ebastien Bubeck, Yuanzhi Li, Yuval Peres","cross_cats":["cs.MA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-28T00:21:04Z","title":"Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12233","kind":"arxiv","version":2},"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:a70418a31ac239e86ddf9d8543940934dc2c3f46a999c1f8b2c5020c8310598a","target":"record","created_at":"2026-05-17T23:47:11Z","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":"cb47e5712248f8dca439ac7eefa212d04b35747b3d0bdb50e4287d2ba2a6e0c2","cross_cats_sorted":["cs.MA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-28T00:21:04Z","title_canon_sha256":"ed704af550f4c95bb86dfc135a271fcb74caa2eb291965b161f0c840393d7b7c"},"schema_version":"1.0","source":{"id":"1904.12233","kind":"arxiv","version":2}},"canonical_sha256":"0b23bb714eff411d4679c8adaa090c56cc873bb57393df43aab24f7330873ec7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b23bb714eff411d4679c8adaa090c56cc873bb57393df43aab24f7330873ec7","first_computed_at":"2026-05-17T23:47:11.899818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:11.899818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hzWLUIdnM/iIKyTZqRRvkgIXjF6RB3N7S5poHqbdEtihJ1vsANHiDuc/agh0kM2Gk4yC9k5UX3Z4GgSzHoD0Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:11.900198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.12233","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a70418a31ac239e86ddf9d8543940934dc2c3f46a999c1f8b2c5020c8310598a","sha256:714e6b223a9210e72be31fc07eb32d44428c13f1dc4ad951203e2c275bc32218"],"state_sha256":"4b7c9267586b07a64c1725b006c9cac0b83bacc838d89ec301fb33904ecbab96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cUT3mdXxNlkwtqeAiuX/pnw9+at0SWitmMcPB2X1i7k+h5zYb7YNE2uUnm2rdFShoslDJi5q5yXL1+HveKyYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T06:36:49.988919Z","bundle_sha256":"e4cddf9cfa6c2c254fc84b506910ae2c8e246d3a4b99374f62623a93c49fcb50"}}