{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JKX7LVVRGAHETADTLA7IXUJGWK","short_pith_number":"pith:JKX7LVVR","schema_version":"1.0","canonical_sha256":"4aaff5d6b1300e498073583e8bd126b2827a76e83b0fa0de901efd96e7e94ad4","source":{"kind":"arxiv","id":"2007.03121","version":1},"attestation_state":"computed","paper":{"title":"Multi-Armed Bandits with Local Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jia Liu, Ness B. Shroff, Wenbo Ren, Xingyu Zhou","submitted_at":"2020-07-06T23:36:20Z","abstract_excerpt":"This paper investigates the problem of regret minimization for multi-armed bandit (MAB) problems with local differential privacy (LDP) guarantee. In stochastic bandit systems, the rewards may refer to the users' activities, which may involve private information and the users may not want the agent to know. However, in many cases, the agent needs to know these activities to provide better services such as recommendations and news feeds. To handle this dilemma, we adopt differential privacy and study the regret upper and lower bounds for MAB algorithms with a given LDP guarantee. In this paper, "},"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":"2007.03121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T23:36:20Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"7091e8d0465bb9f5ed44c1d128f8f02ea7797b0901af3fd06a75517953f0ad1b","abstract_canon_sha256":"a56b34563c53318a0aaf81b16f743914549d7a7645692df44621b90356a23d52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:59.757810Z","signature_b64":"wVnEUy/foOzsxcb4EWIO7WlfWB8/C2S7CYIHcEhBsiOFORIyENfAN7e0t92HVSN+PzsxpnI+IjQa4JGeHW+hDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aaff5d6b1300e498073583e8bd126b2827a76e83b0fa0de901efd96e7e94ad4","last_reissued_at":"2026-07-05T01:16:59.757375Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:59.757375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Armed Bandits with Local Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jia Liu, Ness B. Shroff, Wenbo Ren, Xingyu Zhou","submitted_at":"2020-07-06T23:36:20Z","abstract_excerpt":"This paper investigates the problem of regret minimization for multi-armed bandit (MAB) problems with local differential privacy (LDP) guarantee. In stochastic bandit systems, the rewards may refer to the users' activities, which may involve private information and the users may not want the agent to know. However, in many cases, the agent needs to know these activities to provide better services such as recommendations and news feeds. To handle this dilemma, we adopt differential privacy and study the regret upper and lower bounds for MAB algorithms with a given LDP guarantee. In this paper, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03121","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.03121/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":"2007.03121","created_at":"2026-07-05T01:16:59.757433+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.03121v1","created_at":"2026-07-05T01:16:59.757433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03121","created_at":"2026-07-05T01:16:59.757433+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKX7LVVRGAHE","created_at":"2026-07-05T01:16:59.757433+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKX7LVVRGAHETADT","created_at":"2026-07-05T01:16:59.757433+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKX7LVVR","created_at":"2026-07-05T01:16:59.757433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23096","citing_title":"Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacy","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2606.21524","citing_title":"Prophet Inequalities under Local Differential Privacy","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23131","citing_title":"When Determinants Are Not Enough: Private Rare Switching","ref_index":105,"is_internal_anchor":false},{"citing_arxiv_id":"2406.06408","citing_title":"Differentially Private Best-Arm Identification","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2510.21060","citing_title":"On the Sample Complexity of Differentially Private Policy Optimization","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00638","citing_title":"Unlearning Offline Stochastic Multi-Armed Bandits","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JKX7LVVRGAHETADTLA7IXUJGWK","json":"https://pith.science/pith/JKX7LVVRGAHETADTLA7IXUJGWK.json","graph_json":"https://pith.science/api/pith-number/JKX7LVVRGAHETADTLA7IXUJGWK/graph.json","events_json":"https://pith.science/api/pith-number/JKX7LVVRGAHETADTLA7IXUJGWK/events.json","paper":"https://pith.science/paper/JKX7LVVR"},"agent_actions":{"view_html":"https://pith.science/pith/JKX7LVVRGAHETADTLA7IXUJGWK","download_json":"https://pith.science/pith/JKX7LVVRGAHETADTLA7IXUJGWK.json","view_paper":"https://pith.science/paper/JKX7LVVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.03121&json=true","fetch_graph":"https://pith.science/api/pith-number/JKX7LVVRGAHETADTLA7IXUJGWK/graph.json","fetch_events":"https://pith.science/api/pith-number/JKX7LVVRGAHETADTLA7IXUJGWK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKX7LVVRGAHETADTLA7IXUJGWK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKX7LVVRGAHETADTLA7IXUJGWK/action/storage_attestation","attest_author":"https://pith.science/pith/JKX7LVVRGAHETADTLA7IXUJGWK/action/author_attestation","sign_citation":"https://pith.science/pith/JKX7LVVRGAHETADTLA7IXUJGWK/action/citation_signature","submit_replication":"https://pith.science/pith/JKX7LVVRGAHETADTLA7IXUJGWK/action/replication_record"}},"created_at":"2026-07-05T01:16:59.757433+00:00","updated_at":"2026-07-05T01:16:59.757433+00:00"}