{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KSOTTL5O7LINP3LIYJYO2NPFEX","short_pith_number":"pith:KSOTTL5O","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"},"canonical_sha256":"549d39afaefad0d7ed68c270ed35e525ecc174ca0747a4c0bdce6924c89aecbd","source":{"kind":"arxiv","id":"1905.09383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09383","created_at":"2026-05-17T23:45:19Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09383v1","created_at":"2026-05-17T23:45:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09383","created_at":"2026-05-17T23:45:19Z"},{"alias_kind":"pith_short_12","alias_value":"KSOTTL5O7LIN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KSOTTL5O7LINP3LI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KSOTTL5O","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KSOTTL5O7LINP3LIYJYO2NPFEX","target":"record","payload":{"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"},"canonical_sha256":"549d39afaefad0d7ed68c270ed35e525ecc174ca0747a4c0bdce6924c89aecbd","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"},"source_kind":"arxiv","source_id":"1905.09383","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-05-17T23:45:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HIkM57yPv7jCOeVOlw9sRAkPP9KoVDDv4Z3xdaeYYhv0+FxXhV7fTmYoKw1cTLaF/Zd/ktwplLIWLr/ZtSMTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:33:21.448823Z"},"content_sha256":"cd76ef1a1e162422c5ede53bb6d5b1ab81fd331635824a3a7aad7979072630dd","schema_version":"1.0","event_id":"sha256:cd76ef1a1e162422c5ede53bb6d5b1ab81fd331635824a3a7aad7979072630dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KSOTTL5O7LINP3LIYJYO2NPFEX","target":"graph","payload":{"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"},"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:45:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iqVRef/n+UtkhUyK1pfysx6kLsgC0WXhJtYavIhBdB0JNtq1HnK5vZ0fPuQMFa+tRo0AcLnDOu/LjodKMtPaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:33:21.449511Z"},"content_sha256":"7d1952a89aadba09a0459073c16cabb0a90ab27eeb0b146c86ccfa8b363e92dd","schema_version":"1.0","event_id":"sha256:7d1952a89aadba09a0459073c16cabb0a90ab27eeb0b146c86ccfa8b363e92dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KSOTTL5O7LINP3LIYJYO2NPFEX/bundle.json","state_url":"https://pith.science/pith/KSOTTL5O7LINP3LIYJYO2NPFEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KSOTTL5O7LINP3LIYJYO2NPFEX/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-27T22:33:21Z","links":{"resolver":"https://pith.science/pith/KSOTTL5O7LINP3LIYJYO2NPFEX","bundle":"https://pith.science/pith/KSOTTL5O7LINP3LIYJYO2NPFEX/bundle.json","state":"https://pith.science/pith/KSOTTL5O7LINP3LIYJYO2NPFEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KSOTTL5O7LINP3LIYJYO2NPFEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KSOTTL5O7LINP3LIYJYO2NPFEX","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":"dacbdaf868fa9a984e88aa508fe3b086178196950b2d2130c52cdbdb0c4fc039","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-22T22:27:44Z","title_canon_sha256":"f6ae629492467474b5f4a440f932516140464599435f0c5af8adcaf8f61594e6"},"schema_version":"1.0","source":{"id":"1905.09383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09383","created_at":"2026-05-17T23:45:19Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09383v1","created_at":"2026-05-17T23:45:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09383","created_at":"2026-05-17T23:45:19Z"},{"alias_kind":"pith_short_12","alias_value":"KSOTTL5O7LIN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KSOTTL5O7LINP3LI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KSOTTL5O","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:7d1952a89aadba09a0459073c16cabb0a90ab27eeb0b146c86ccfa8b363e92dd","target":"graph","created_at":"2026-05-17T23:45:19Z","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 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 ","authors_text":"Or Sheffet, Touqir Sajed","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-22T22:27:44Z","title":"An Optimal Private Stochastic-MAB Algorithm Based on an Optimal Private Stopping Rule"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09383","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:cd76ef1a1e162422c5ede53bb6d5b1ab81fd331635824a3a7aad7979072630dd","target":"record","created_at":"2026-05-17T23:45:19Z","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":"dacbdaf868fa9a984e88aa508fe3b086178196950b2d2130c52cdbdb0c4fc039","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-22T22:27:44Z","title_canon_sha256":"f6ae629492467474b5f4a440f932516140464599435f0c5af8adcaf8f61594e6"},"schema_version":"1.0","source":{"id":"1905.09383","kind":"arxiv","version":1}},"canonical_sha256":"549d39afaefad0d7ed68c270ed35e525ecc174ca0747a4c0bdce6924c89aecbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"549d39afaefad0d7ed68c270ed35e525ecc174ca0747a4c0bdce6924c89aecbd","first_computed_at":"2026-05-17T23:45:19.394194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:19.394194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JTmnrKMPklLYifFaJ4TpejAkY9r8mOVG+ZPVFPf96J0nciF5xuBdxVleji6pTMVdBluudZTCXg2eWFZRJKc0Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:19.395061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd76ef1a1e162422c5ede53bb6d5b1ab81fd331635824a3a7aad7979072630dd","sha256:7d1952a89aadba09a0459073c16cabb0a90ab27eeb0b146c86ccfa8b363e92dd"],"state_sha256":"c25e13b3087b98467b422ad644ea986e42dbe0f352e4da8afd7d90bb04a28d0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPLUT7TgxDGPOotFjt6hVjJGJ2BiVMNmPinXTLHhI4c2T2dLzFM5YlkTgLHM9XmVsoFIQ9IKDwrvssnbP7CvBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:33:21.453152Z","bundle_sha256":"8cc8d3e69e8b17af4a77289a0aa0c469aca98d11d5ca4f0bcf396ef3bad50f3e"}}