{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RGS5CUSIXZQ7N5ATYLSPPWUI2W","short_pith_number":"pith:RGS5CUSI","schema_version":"1.0","canonical_sha256":"89a5d15248be61f6f413c2e4f7da88d5b3e0e7d56e719da0fc4083edff761684","source":{"kind":"arxiv","id":"2202.05567","version":1},"attestation_state":"computed","paper":{"title":"Shuffle Private Linear Contextual Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Sayak Ray Chowdhury, Xingyu Zhou","submitted_at":"2022-02-11T11:53:22Z","abstract_excerpt":"Differential privacy (DP) has been recently introduced to linear contextual bandits to formally address the privacy concerns in its associated personalized services to participating users (e.g., recommendations). Prior work largely focus on two trust models of DP: the central model, where a central server is responsible for protecting users sensitive data, and the (stronger) local model, where information needs to be protected directly on user side. However, there remains a fundamental gap in the utility achieved by learning algorithms under these two privacy models, e.g., $\\tilde{O}(\\sqrt{T})"},"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":"2202.05567","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-02-11T11:53:22Z","cross_cats_sorted":[],"title_canon_sha256":"54d97e49d09692cfb1607bcf75b543806fefc82cb9d2298ae0a08760ec9c9b87","abstract_canon_sha256":"eae57ecb7e324ca0a0efd0bc576e51f94cba294a0193b114082958766cf2d1f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:25:55.215645Z","signature_b64":"jywbyqp/OMe65OAgJzLnmb9IM4uty0VkqVc7v9RWRUrKHAeCtKoCRLu9eFzp8LIbVnTJdYpBWbzcHEg+bwNQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89a5d15248be61f6f413c2e4f7da88d5b3e0e7d56e719da0fc4083edff761684","last_reissued_at":"2026-07-05T04:25:55.215153Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:25:55.215153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shuffle Private Linear Contextual Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Sayak Ray Chowdhury, Xingyu Zhou","submitted_at":"2022-02-11T11:53:22Z","abstract_excerpt":"Differential privacy (DP) has been recently introduced to linear contextual bandits to formally address the privacy concerns in its associated personalized services to participating users (e.g., recommendations). Prior work largely focus on two trust models of DP: the central model, where a central server is responsible for protecting users sensitive data, and the (stronger) local model, where information needs to be protected directly on user side. However, there remains a fundamental gap in the utility achieved by learning algorithms under these two privacy models, e.g., $\\tilde{O}(\\sqrt{T})"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.05567","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/2202.05567/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":"2202.05567","created_at":"2026-07-05T04:25:55.215208+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.05567v1","created_at":"2026-07-05T04:25:55.215208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.05567","created_at":"2026-07-05T04:25:55.215208+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGS5CUSIXZQ7","created_at":"2026-07-05T04:25:55.215208+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGS5CUSIXZQ7N5AT","created_at":"2026-07-05T04:25:55.215208+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGS5CUSI","created_at":"2026-07-05T04:25:55.215208+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20022","citing_title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23131","citing_title":"When Determinants Are Not Enough: Private Rare Switching","ref_index":98,"is_internal_anchor":false},{"citing_arxiv_id":"2510.21060","citing_title":"On the Sample Complexity of Differentially Private Policy Optimization","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07049","citing_title":"Towards Differentially Private Reinforcement Learning with General Function Approximation","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RGS5CUSIXZQ7N5ATYLSPPWUI2W","json":"https://pith.science/pith/RGS5CUSIXZQ7N5ATYLSPPWUI2W.json","graph_json":"https://pith.science/api/pith-number/RGS5CUSIXZQ7N5ATYLSPPWUI2W/graph.json","events_json":"https://pith.science/api/pith-number/RGS5CUSIXZQ7N5ATYLSPPWUI2W/events.json","paper":"https://pith.science/paper/RGS5CUSI"},"agent_actions":{"view_html":"https://pith.science/pith/RGS5CUSIXZQ7N5ATYLSPPWUI2W","download_json":"https://pith.science/pith/RGS5CUSIXZQ7N5ATYLSPPWUI2W.json","view_paper":"https://pith.science/paper/RGS5CUSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.05567&json=true","fetch_graph":"https://pith.science/api/pith-number/RGS5CUSIXZQ7N5ATYLSPPWUI2W/graph.json","fetch_events":"https://pith.science/api/pith-number/RGS5CUSIXZQ7N5ATYLSPPWUI2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGS5CUSIXZQ7N5ATYLSPPWUI2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGS5CUSIXZQ7N5ATYLSPPWUI2W/action/storage_attestation","attest_author":"https://pith.science/pith/RGS5CUSIXZQ7N5ATYLSPPWUI2W/action/author_attestation","sign_citation":"https://pith.science/pith/RGS5CUSIXZQ7N5ATYLSPPWUI2W/action/citation_signature","submit_replication":"https://pith.science/pith/RGS5CUSIXZQ7N5ATYLSPPWUI2W/action/replication_record"}},"created_at":"2026-07-05T04:25:55.215208+00:00","updated_at":"2026-07-05T04:25:55.215208+00:00"}