{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:HFDHF3FSBOCYRGSQJ7LAVAU6RV","short_pith_number":"pith:HFDHF3FS","schema_version":"1.0","canonical_sha256":"394672ecb20b85889a504fd60a829e8d712b474b7ca706cbaf5fe0384d0fd27a","source":{"kind":"arxiv","id":"2106.02900","version":3},"attestation_state":"computed","paper":{"title":"Differentially Private Multi-Armed Bandits in the Shuffle Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Haim Kaplan, Jay Tenenbaum, Uri Stemmer, Yishay Mansour","submitted_at":"2021-06-05T14:11:01Z","abstract_excerpt":"We give an $(\\varepsilon,\\delta)$-differentially private algorithm for the multi-armed bandit (MAB) problem in the shuffle model with a distribution-dependent regret of $O\\left(\\left(\\sum_{a\\in [k]:\\Delta_a>0}\\frac{\\log T}{\\Delta_a}\\right)+\\frac{k\\sqrt{\\log\\frac{1}{\\delta}}\\log T}{\\varepsilon}\\right)$, and a distribution-independent regret of $O\\left(\\sqrt{kT\\log T}+\\frac{k\\sqrt{\\log\\frac{1}{\\delta}}\\log T}{\\varepsilon}\\right)$, where $T$ is the number of rounds, $\\Delta_a$ is the suboptimality gap of the arm $a$, and $k$ is the total number of arms. Our upper bound almost matches the regret o"},"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.02900","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-05T14:11:01Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"1558a36718ea54a57cd29f18dc7bebc2531f19ff2034ddcba5c07ef3253247e2","abstract_canon_sha256":"a1bb33ed285f9b7286090f078995ef68fbb191aa820e87cc248a4e9459844316"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:26:41.866287Z","signature_b64":"hGilhZ7vRL0Nd3cFnrFxbbbirgHJrc4h1HDA5WRfY+WMZXA7Nr1HJHeo5SJzC4n1YkORSwRItQvYEy1o55XrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"394672ecb20b85889a504fd60a829e8d712b474b7ca706cbaf5fe0384d0fd27a","last_reissued_at":"2026-07-05T03:26:41.865798Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:26:41.865798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentially Private Multi-Armed Bandits in the Shuffle Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Haim Kaplan, Jay Tenenbaum, Uri Stemmer, Yishay Mansour","submitted_at":"2021-06-05T14:11:01Z","abstract_excerpt":"We give an $(\\varepsilon,\\delta)$-differentially private algorithm for the multi-armed bandit (MAB) problem in the shuffle model with a distribution-dependent regret of $O\\left(\\left(\\sum_{a\\in [k]:\\Delta_a>0}\\frac{\\log T}{\\Delta_a}\\right)+\\frac{k\\sqrt{\\log\\frac{1}{\\delta}}\\log T}{\\varepsilon}\\right)$, and a distribution-independent regret of $O\\left(\\sqrt{kT\\log T}+\\frac{k\\sqrt{\\log\\frac{1}{\\delta}}\\log T}{\\varepsilon}\\right)$, where $T$ is the number of rounds, $\\Delta_a$ is the suboptimality gap of the arm $a$, and $k$ is the total number of arms. Our upper bound almost matches the regret o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.02900","kind":"arxiv","version":3},"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.02900/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.02900","created_at":"2026-07-05T03:26:41.865861+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.02900v3","created_at":"2026-07-05T03:26:41.865861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.02900","created_at":"2026-07-05T03:26:41.865861+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFDHF3FSBOCY","created_at":"2026-07-05T03:26:41.865861+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFDHF3FSBOCYRGSQ","created_at":"2026-07-05T03:26:41.865861+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFDHF3FS","created_at":"2026-07-05T03:26:41.865861+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HFDHF3FSBOCYRGSQJ7LAVAU6RV","json":"https://pith.science/pith/HFDHF3FSBOCYRGSQJ7LAVAU6RV.json","graph_json":"https://pith.science/api/pith-number/HFDHF3FSBOCYRGSQJ7LAVAU6RV/graph.json","events_json":"https://pith.science/api/pith-number/HFDHF3FSBOCYRGSQJ7LAVAU6RV/events.json","paper":"https://pith.science/paper/HFDHF3FS"},"agent_actions":{"view_html":"https://pith.science/pith/HFDHF3FSBOCYRGSQJ7LAVAU6RV","download_json":"https://pith.science/pith/HFDHF3FSBOCYRGSQJ7LAVAU6RV.json","view_paper":"https://pith.science/paper/HFDHF3FS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.02900&json=true","fetch_graph":"https://pith.science/api/pith-number/HFDHF3FSBOCYRGSQJ7LAVAU6RV/graph.json","fetch_events":"https://pith.science/api/pith-number/HFDHF3FSBOCYRGSQJ7LAVAU6RV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFDHF3FSBOCYRGSQJ7LAVAU6RV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFDHF3FSBOCYRGSQJ7LAVAU6RV/action/storage_attestation","attest_author":"https://pith.science/pith/HFDHF3FSBOCYRGSQJ7LAVAU6RV/action/author_attestation","sign_citation":"https://pith.science/pith/HFDHF3FSBOCYRGSQJ7LAVAU6RV/action/citation_signature","submit_replication":"https://pith.science/pith/HFDHF3FSBOCYRGSQJ7LAVAU6RV/action/replication_record"}},"created_at":"2026-07-05T03:26:41.865861+00:00","updated_at":"2026-07-05T03:26:41.865861+00:00"}