{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:6D2CYDNPB463ILIJ32APA3Q5A7","short_pith_number":"pith:6D2CYDNP","schema_version":"1.0","canonical_sha256":"f0f42c0daf0f3db42d09de80f06e1d07c4d1a078cdb89be212e5fc4d36bab496","source":{"kind":"arxiv","id":"2206.05772","version":1},"attestation_state":"computed","paper":{"title":"Distributed Differential Privacy in Multi-Armed Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Sayak Ray Chowdhury, Xingyu Zhou","submitted_at":"2022-06-12T15:37:36Z","abstract_excerpt":"We consider the standard $K$-armed bandit problem under a distributed trust model of differential privacy (DP), which enables to guarantee privacy without a trustworthy server. Under this trust model, previous work largely focus on achieving privacy using a shuffle protocol, where a batch of users data are randomly permuted before sending to a central server. This protocol achieves ($\\epsilon,\\delta$) or approximate-DP guarantee by sacrificing an additional additive $O\\!\\left(\\!\\frac{K\\log T\\sqrt{\\log(1/\\delta)}}{\\epsilon}\\!\\right)\\!$ cost in $T$-step cumulative regret. In contrast, the optima"},"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":"2206.05772","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-12T15:37:36Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"63569504c453239efb3a9f7a4591e0a74090f70a0da566d9cccc5039c56f4a49","abstract_canon_sha256":"0dc102331b80d72df3e016c64c4631a0618f0bfbfa2dfc2d6bda828c60efc057"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:02.686416Z","signature_b64":"6Sz+DeAx2IZyr2GJvAbnUVTyRTfYKa/rURGTkVaaFWzT2P1k6Hfus0LzBgn5RUHVBIc7QnsbsFF7qq9VOAy7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0f42c0daf0f3db42d09de80f06e1d07c4d1a078cdb89be212e5fc4d36bab496","last_reissued_at":"2026-07-05T04:31:02.685923Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:02.685923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Differential Privacy in Multi-Armed Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Sayak Ray Chowdhury, Xingyu Zhou","submitted_at":"2022-06-12T15:37:36Z","abstract_excerpt":"We consider the standard $K$-armed bandit problem under a distributed trust model of differential privacy (DP), which enables to guarantee privacy without a trustworthy server. Under this trust model, previous work largely focus on achieving privacy using a shuffle protocol, where a batch of users data are randomly permuted before sending to a central server. This protocol achieves ($\\epsilon,\\delta$) or approximate-DP guarantee by sacrificing an additional additive $O\\!\\left(\\!\\frac{K\\log T\\sqrt{\\log(1/\\delta)}}{\\epsilon}\\!\\right)\\!$ cost in $T$-step cumulative regret. In contrast, the optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.05772","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/2206.05772/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":"2206.05772","created_at":"2026-07-05T04:31:02.685977+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.05772v1","created_at":"2026-07-05T04:31:02.685977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.05772","created_at":"2026-07-05T04:31:02.685977+00:00"},{"alias_kind":"pith_short_12","alias_value":"6D2CYDNPB463","created_at":"2026-07-05T04:31:02.685977+00:00"},{"alias_kind":"pith_short_16","alias_value":"6D2CYDNPB463ILIJ","created_at":"2026-07-05T04:31:02.685977+00:00"},{"alias_kind":"pith_short_8","alias_value":"6D2CYDNP","created_at":"2026-07-05T04:31:02.685977+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23131","citing_title":"When Determinants Are Not Enough: Private Rare Switching","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2510.21060","citing_title":"On the Sample Complexity of Differentially Private Policy Optimization","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6D2CYDNPB463ILIJ32APA3Q5A7","json":"https://pith.science/pith/6D2CYDNPB463ILIJ32APA3Q5A7.json","graph_json":"https://pith.science/api/pith-number/6D2CYDNPB463ILIJ32APA3Q5A7/graph.json","events_json":"https://pith.science/api/pith-number/6D2CYDNPB463ILIJ32APA3Q5A7/events.json","paper":"https://pith.science/paper/6D2CYDNP"},"agent_actions":{"view_html":"https://pith.science/pith/6D2CYDNPB463ILIJ32APA3Q5A7","download_json":"https://pith.science/pith/6D2CYDNPB463ILIJ32APA3Q5A7.json","view_paper":"https://pith.science/paper/6D2CYDNP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.05772&json=true","fetch_graph":"https://pith.science/api/pith-number/6D2CYDNPB463ILIJ32APA3Q5A7/graph.json","fetch_events":"https://pith.science/api/pith-number/6D2CYDNPB463ILIJ32APA3Q5A7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6D2CYDNPB463ILIJ32APA3Q5A7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6D2CYDNPB463ILIJ32APA3Q5A7/action/storage_attestation","attest_author":"https://pith.science/pith/6D2CYDNPB463ILIJ32APA3Q5A7/action/author_attestation","sign_citation":"https://pith.science/pith/6D2CYDNPB463ILIJ32APA3Q5A7/action/citation_signature","submit_replication":"https://pith.science/pith/6D2CYDNPB463ILIJ32APA3Q5A7/action/replication_record"}},"created_at":"2026-07-05T04:31:02.685977+00:00","updated_at":"2026-07-05T04:31:02.685977+00:00"}