{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:DFMVAGQA5MBB6EIZ2THO5OGYRI","short_pith_number":"pith:DFMVAGQA","canonical_record":{"source":{"id":"2103.13059","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-03-24T10:14:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5012afdcdd2fed4cf3a40a82b2242bfbc729fccb2b8eff7ec5334e829954def2","abstract_canon_sha256":"0dc9afdc8ca36a0f2c79e5e9b8b1c77c19a1ce04102b15abed12d2186a4511a8"},"schema_version":"1.0"},"canonical_sha256":"1959501a00eb021f1119d4ceeeb8d88a17da6cd75514ff4e11b86117a7164548","source":{"kind":"arxiv","id":"2103.13059","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.13059","created_at":"2026-07-05T04:29:08Z"},{"alias_kind":"arxiv_version","alias_value":"2103.13059v2","created_at":"2026-07-05T04:29:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.13059","created_at":"2026-07-05T04:29:08Z"},{"alias_kind":"pith_short_12","alias_value":"DFMVAGQA5MBB","created_at":"2026-07-05T04:29:08Z"},{"alias_kind":"pith_short_16","alias_value":"DFMVAGQA5MBB6EIZ","created_at":"2026-07-05T04:29:08Z"},{"alias_kind":"pith_short_8","alias_value":"DFMVAGQA","created_at":"2026-07-05T04:29:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:DFMVAGQA5MBB6EIZ2THO5OGYRI","target":"record","payload":{"canonical_record":{"source":{"id":"2103.13059","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-03-24T10:14:16Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5012afdcdd2fed4cf3a40a82b2242bfbc729fccb2b8eff7ec5334e829954def2","abstract_canon_sha256":"0dc9afdc8ca36a0f2c79e5e9b8b1c77c19a1ce04102b15abed12d2186a4511a8"},"schema_version":"1.0"},"canonical_sha256":"1959501a00eb021f1119d4ceeeb8d88a17da6cd75514ff4e11b86117a7164548","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:29:08.088688Z","signature_b64":"yudaXuUGkV8fCRJUL+9r+ldSq2/AncYWV+3HlvofsBPDUdE5KxG+6LB9pqyjNs60BjyoUCYWEAHCNV01HxQqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1959501a00eb021f1119d4ceeeb8d88a17da6cd75514ff4e11b86117a7164548","last_reissued_at":"2026-07-05T04:29:08.088343Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:29:08.088343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.13059","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-07-05T04:29:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1XqyJ5twIr0og6LcRYEKOa3E9aCc25074VuunokDM6ev9fmISokRFkLesM6vHSGdL2oGqFqV8d/rnj0RWBoFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T07:29:20.278566Z"},"content_sha256":"508f6720ffb42bf8e36deb16a6c1cc51967dea1bc9c5e51646560e22a435dbf9","schema_version":"1.0","event_id":"sha256:508f6720ffb42bf8e36deb16a6c1cc51967dea1bc9c5e51646560e22a435dbf9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:DFMVAGQA5MBB6EIZ2THO5OGYRI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Optimal Algorithms for Multi-Player Bandits without Collision Sensing Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Cindy Trinh, Richard Combes, Wei Huang","submitted_at":"2021-03-24T10:14:16Z","abstract_excerpt":"We propose a novel algorithm for multi-player multi-armed bandits without collision sensing information. Our algorithm circumvents two problems shared by all state-of-the-art algorithms: it does not need as an input a lower bound on the minimal expected reward of an arm, and its performance does not scale inversely proportionally to the minimal expected reward. We prove a theoretical regret upper bound to justify these claims. We complement our theoretical results with numerical experiments, showing that the proposed algorithm outperforms state-of-the-art in practice as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.13059","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.13059/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-05T04:29:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TBP6k3a8wes+5JM3w6SSUdWVfTWVLBObTQ1OVG9luDR8XFG6PdVqWSxFx7mPN/wge0uqikxL1COebCfhD5OhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T07:29:20.278960Z"},"content_sha256":"3fc6e495805cb9ff0ed8ab29c736c5c5906f86f3155edb3104bdda59e9d4ecbc","schema_version":"1.0","event_id":"sha256:3fc6e495805cb9ff0ed8ab29c736c5c5906f86f3155edb3104bdda59e9d4ecbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DFMVAGQA5MBB6EIZ2THO5OGYRI/bundle.json","state_url":"https://pith.science/pith/DFMVAGQA5MBB6EIZ2THO5OGYRI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DFMVAGQA5MBB6EIZ2THO5OGYRI/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-07-12T07:29:20Z","links":{"resolver":"https://pith.science/pith/DFMVAGQA5MBB6EIZ2THO5OGYRI","bundle":"https://pith.science/pith/DFMVAGQA5MBB6EIZ2THO5OGYRI/bundle.json","state":"https://pith.science/pith/DFMVAGQA5MBB6EIZ2THO5OGYRI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DFMVAGQA5MBB6EIZ2THO5OGYRI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:DFMVAGQA5MBB6EIZ2THO5OGYRI","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":"0dc9afdc8ca36a0f2c79e5e9b8b1c77c19a1ce04102b15abed12d2186a4511a8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-03-24T10:14:16Z","title_canon_sha256":"5012afdcdd2fed4cf3a40a82b2242bfbc729fccb2b8eff7ec5334e829954def2"},"schema_version":"1.0","source":{"id":"2103.13059","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.13059","created_at":"2026-07-05T04:29:08Z"},{"alias_kind":"arxiv_version","alias_value":"2103.13059v2","created_at":"2026-07-05T04:29:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.13059","created_at":"2026-07-05T04:29:08Z"},{"alias_kind":"pith_short_12","alias_value":"DFMVAGQA5MBB","created_at":"2026-07-05T04:29:08Z"},{"alias_kind":"pith_short_16","alias_value":"DFMVAGQA5MBB6EIZ","created_at":"2026-07-05T04:29:08Z"},{"alias_kind":"pith_short_8","alias_value":"DFMVAGQA","created_at":"2026-07-05T04:29:08Z"}],"graph_snapshots":[{"event_id":"sha256:3fc6e495805cb9ff0ed8ab29c736c5c5906f86f3155edb3104bdda59e9d4ecbc","target":"graph","created_at":"2026-07-05T04:29:08Z","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/2103.13059/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a novel algorithm for multi-player multi-armed bandits without collision sensing information. Our algorithm circumvents two problems shared by all state-of-the-art algorithms: it does not need as an input a lower bound on the minimal expected reward of an arm, and its performance does not scale inversely proportionally to the minimal expected reward. We prove a theoretical regret upper bound to justify these claims. We complement our theoretical results with numerical experiments, showing that the proposed algorithm outperforms state-of-the-art in practice as well.","authors_text":"Cindy Trinh, Richard Combes, Wei Huang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-03-24T10:14:16Z","title":"Towards Optimal Algorithms for Multi-Player Bandits without Collision Sensing Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.13059","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:508f6720ffb42bf8e36deb16a6c1cc51967dea1bc9c5e51646560e22a435dbf9","target":"record","created_at":"2026-07-05T04:29:08Z","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":"0dc9afdc8ca36a0f2c79e5e9b8b1c77c19a1ce04102b15abed12d2186a4511a8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-03-24T10:14:16Z","title_canon_sha256":"5012afdcdd2fed4cf3a40a82b2242bfbc729fccb2b8eff7ec5334e829954def2"},"schema_version":"1.0","source":{"id":"2103.13059","kind":"arxiv","version":2}},"canonical_sha256":"1959501a00eb021f1119d4ceeeb8d88a17da6cd75514ff4e11b86117a7164548","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1959501a00eb021f1119d4ceeeb8d88a17da6cd75514ff4e11b86117a7164548","first_computed_at":"2026-07-05T04:29:08.088343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:29:08.088343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yudaXuUGkV8fCRJUL+9r+ldSq2/AncYWV+3HlvofsBPDUdE5KxG+6LB9pqyjNs60BjyoUCYWEAHCNV01HxQqAA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:29:08.088688Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.13059","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:508f6720ffb42bf8e36deb16a6c1cc51967dea1bc9c5e51646560e22a435dbf9","sha256:3fc6e495805cb9ff0ed8ab29c736c5c5906f86f3155edb3104bdda59e9d4ecbc"],"state_sha256":"0a9fa30ff06cd8899c980b08be1e9869afaaab4bfedf16372c7eafca70fc58ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57Ta6sTvDnEm/riiRgxu50/+szkq1daCiIINkFiKdSrlIirbu1hpllOeXy31YosxBw50Jt4UXIEbxKHm0CfUCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T07:29:20.281357Z","bundle_sha256":"d6ea94ab93b0ac0185a78fbcb249cc2daca8bdf1abb3df714eab000bae5fa383"}}