{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:U775F34FNQ6XDVSI4LAVBYQAY6","short_pith_number":"pith:U775F34F","schema_version":"1.0","canonical_sha256":"a7ffd2ef856c3d71d648e2c150e200c7a369da07346e3e70858198dceb7907f6","source":{"kind":"arxiv","id":"2505.05613","version":1},"attestation_state":"computed","paper":{"title":"Optimal Regret of Bernoulli Bandits under Global Differential Privacy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Achraf Azize, Debabrota Basu, Francesco Orabona, Junya Honda, Shinji Ito, Yulian Wu","submitted_at":"2025-05-08T19:48:58Z","abstract_excerpt":"As sequential learning algorithms are increasingly applied to real life, ensuring data privacy while maintaining their utilities emerges as a timely question. In this context, regret minimisation in stochastic bandits under $\\epsilon$-global Differential Privacy (DP) has been widely studied. Unlike bandits without DP, there is a significant gap between the best-known regret lower and upper bound in this setting, though they \"match\" in order. Thus, we revisit the regret lower and upper bounds of $\\epsilon$-global DP algorithms for Bernoulli bandits and improve both. First, we prove a tighter re"},"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":"2505.05613","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-05-08T19:48:58Z","cross_cats_sorted":["cs.CR","cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"7bc85cd21314105398c13e9db3f195bbbadcfaee6e749a902ad94cf9f59d2b3b","abstract_canon_sha256":"c5f9328758ab9b0618fe052e85bed8fd4ef4bf09ad4e400bdb7e7f3bde8763b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:29.076684Z","signature_b64":"7Q1/1MiJ14htpvuPtFocA4/RQBY5w0ViTHHT+2/tQaYVPLNpB4O1JZTiFutaw9CU0z0H3iLgPefcTGG1nG5kDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7ffd2ef856c3d71d648e2c150e200c7a369da07346e3e70858198dceb7907f6","last_reissued_at":"2026-07-05T11:00:29.076189Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:29.076189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Regret of Bernoulli Bandits under Global Differential Privacy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Achraf Azize, Debabrota Basu, Francesco Orabona, Junya Honda, Shinji Ito, Yulian Wu","submitted_at":"2025-05-08T19:48:58Z","abstract_excerpt":"As sequential learning algorithms are increasingly applied to real life, ensuring data privacy while maintaining their utilities emerges as a timely question. In this context, regret minimisation in stochastic bandits under $\\epsilon$-global Differential Privacy (DP) has been widely studied. Unlike bandits without DP, there is a significant gap between the best-known regret lower and upper bound in this setting, though they \"match\" in order. Thus, we revisit the regret lower and upper bounds of $\\epsilon$-global DP algorithms for Bernoulli bandits and improve both. First, we prove a tighter re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05613","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/2505.05613/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":"2505.05613","created_at":"2026-07-05T11:00:29.076249+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.05613v1","created_at":"2026-07-05T11:00:29.076249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05613","created_at":"2026-07-05T11:00:29.076249+00:00"},{"alias_kind":"pith_short_12","alias_value":"U775F34FNQ6X","created_at":"2026-07-05T11:00:29.076249+00:00"},{"alias_kind":"pith_short_16","alias_value":"U775F34FNQ6XDVSI","created_at":"2026-07-05T11:00:29.076249+00:00"},{"alias_kind":"pith_short_8","alias_value":"U775F34F","created_at":"2026-07-05T11:00:29.076249+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/U775F34FNQ6XDVSI4LAVBYQAY6","json":"https://pith.science/pith/U775F34FNQ6XDVSI4LAVBYQAY6.json","graph_json":"https://pith.science/api/pith-number/U775F34FNQ6XDVSI4LAVBYQAY6/graph.json","events_json":"https://pith.science/api/pith-number/U775F34FNQ6XDVSI4LAVBYQAY6/events.json","paper":"https://pith.science/paper/U775F34F"},"agent_actions":{"view_html":"https://pith.science/pith/U775F34FNQ6XDVSI4LAVBYQAY6","download_json":"https://pith.science/pith/U775F34FNQ6XDVSI4LAVBYQAY6.json","view_paper":"https://pith.science/paper/U775F34F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.05613&json=true","fetch_graph":"https://pith.science/api/pith-number/U775F34FNQ6XDVSI4LAVBYQAY6/graph.json","fetch_events":"https://pith.science/api/pith-number/U775F34FNQ6XDVSI4LAVBYQAY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U775F34FNQ6XDVSI4LAVBYQAY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U775F34FNQ6XDVSI4LAVBYQAY6/action/storage_attestation","attest_author":"https://pith.science/pith/U775F34FNQ6XDVSI4LAVBYQAY6/action/author_attestation","sign_citation":"https://pith.science/pith/U775F34FNQ6XDVSI4LAVBYQAY6/action/citation_signature","submit_replication":"https://pith.science/pith/U775F34FNQ6XDVSI4LAVBYQAY6/action/replication_record"}},"created_at":"2026-07-05T11:00:29.076249+00:00","updated_at":"2026-07-05T11:00:29.076249+00:00"}