{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KSOTTL5O7LINP3LIYJYO2NPFEX","short_pith_number":"pith:KSOTTL5O","schema_version":"1.0","canonical_sha256":"549d39afaefad0d7ed68c270ed35e525ecc174ca0747a4c0bdce6924c89aecbd","source":{"kind":"arxiv","id":"1905.09383","version":1},"attestation_state":"computed","paper":{"title":"An Optimal Private Stochastic-MAB Algorithm Based on an Optimal Private Stopping Rule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Or Sheffet, Touqir Sajed","submitted_at":"2019-05-22T22:27:44Z","abstract_excerpt":"We present a provably optimal differentially private algorithm for the stochastic multi-arm bandit problem, as opposed to the private analogue of the UCB-algorithm [Mishra and Thakurta, 2015; Tossou and Dimitrakakis, 2016] which doesn't meet the recently discovered lower-bound of $\\Omega \\left(\\frac{K\\log(T)}{\\epsilon} \\right)$ [Shariff and Sheffet, 2018]. Our construction is based on a different algorithm, Successive Elimination [Even-Dar et al. 2002], that repeatedly pulls all remaining arms until an arm is found to be suboptimal and is then eliminated. In order to devise a private analogue "},"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":"1905.09383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-22T22:27:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f6ae629492467474b5f4a440f932516140464599435f0c5af8adcaf8f61594e6","abstract_canon_sha256":"dacbdaf868fa9a984e88aa508fe3b086178196950b2d2130c52cdbdb0c4fc039"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:19.395061Z","signature_b64":"JTmnrKMPklLYifFaJ4TpejAkY9r8mOVG+ZPVFPf96J0nciF5xuBdxVleji6pTMVdBluudZTCXg2eWFZRJKc0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"549d39afaefad0d7ed68c270ed35e525ecc174ca0747a4c0bdce6924c89aecbd","last_reissued_at":"2026-05-17T23:45:19.394194Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:19.394194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Private Stochastic-MAB Algorithm Based on an Optimal Private Stopping Rule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Or Sheffet, Touqir Sajed","submitted_at":"2019-05-22T22:27:44Z","abstract_excerpt":"We present a provably optimal differentially private algorithm for the stochastic multi-arm bandit problem, as opposed to the private analogue of the UCB-algorithm [Mishra and Thakurta, 2015; Tossou and Dimitrakakis, 2016] which doesn't meet the recently discovered lower-bound of $\\Omega \\left(\\frac{K\\log(T)}{\\epsilon} \\right)$ [Shariff and Sheffet, 2018]. Our construction is based on a different algorithm, Successive Elimination [Even-Dar et al. 2002], that repeatedly pulls all remaining arms until an arm is found to be suboptimal and is then eliminated. In order to devise a private analogue "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09383","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":""},"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":"1905.09383","created_at":"2026-05-17T23:45:19.394335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.09383v1","created_at":"2026-05-17T23:45:19.394335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09383","created_at":"2026-05-17T23:45:19.394335+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSOTTL5O7LIN","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSOTTL5O7LINP3LI","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSOTTL5O","created_at":"2026-05-18T12:33:21.387695+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/KSOTTL5O7LINP3LIYJYO2NPFEX","json":"https://pith.science/pith/KSOTTL5O7LINP3LIYJYO2NPFEX.json","graph_json":"https://pith.science/api/pith-number/KSOTTL5O7LINP3LIYJYO2NPFEX/graph.json","events_json":"https://pith.science/api/pith-number/KSOTTL5O7LINP3LIYJYO2NPFEX/events.json","paper":"https://pith.science/paper/KSOTTL5O"},"agent_actions":{"view_html":"https://pith.science/pith/KSOTTL5O7LINP3LIYJYO2NPFEX","download_json":"https://pith.science/pith/KSOTTL5O7LINP3LIYJYO2NPFEX.json","view_paper":"https://pith.science/paper/KSOTTL5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.09383&json=true","fetch_graph":"https://pith.science/api/pith-number/KSOTTL5O7LINP3LIYJYO2NPFEX/graph.json","fetch_events":"https://pith.science/api/pith-number/KSOTTL5O7LINP3LIYJYO2NPFEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSOTTL5O7LINP3LIYJYO2NPFEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSOTTL5O7LINP3LIYJYO2NPFEX/action/storage_attestation","attest_author":"https://pith.science/pith/KSOTTL5O7LINP3LIYJYO2NPFEX/action/author_attestation","sign_citation":"https://pith.science/pith/KSOTTL5O7LINP3LIYJYO2NPFEX/action/citation_signature","submit_replication":"https://pith.science/pith/KSOTTL5O7LINP3LIYJYO2NPFEX/action/replication_record"}},"created_at":"2026-05-17T23:45:19.394335+00:00","updated_at":"2026-05-17T23:45:19.394335+00:00"}