{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:AGX46EE7ACU5XPWBDCD3GIQ7XY","short_pith_number":"pith:AGX46EE7","canonical_record":{"source":{"id":"2505.21790","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-27T21:42:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c46b359752c0dc5ca0215002db20f543de7b63b24a25c0eeda59d7d319fd8f1c","abstract_canon_sha256":"e847881190d98ee70f4b9606696d23ead47c918df642cf39ff9a7079e03a08f1"},"schema_version":"1.0"},"canonical_sha256":"01afcf109f00a9dbbec11887b3221fbe31700f72e221b25ac373b50808a738c4","source":{"kind":"arxiv","id":"2505.21790","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21790","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21790v1","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21790","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_12","alias_value":"AGX46EE7ACU5","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_16","alias_value":"AGX46EE7ACU5XPWB","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_8","alias_value":"AGX46EE7","created_at":"2026-07-05T11:11:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:AGX46EE7ACU5XPWBDCD3GIQ7XY","target":"record","payload":{"canonical_record":{"source":{"id":"2505.21790","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-27T21:42:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c46b359752c0dc5ca0215002db20f543de7b63b24a25c0eeda59d7d319fd8f1c","abstract_canon_sha256":"e847881190d98ee70f4b9606696d23ead47c918df642cf39ff9a7079e03a08f1"},"schema_version":"1.0"},"canonical_sha256":"01afcf109f00a9dbbec11887b3221fbe31700f72e221b25ac373b50808a738c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:03.600290Z","signature_b64":"rbUOxvX2VcfxvzBy6F2y2kavV2vOvgTZmyxuYXlUgpXR2tN7bF3FmvOVNXW7GLUoC8Gs+EdiFf1u96y7R3YXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01afcf109f00a9dbbec11887b3221fbe31700f72e221b25ac373b50808a738c4","last_reissued_at":"2026-07-05T11:11:03.599792Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:03.599792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.21790","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-07-05T11:11:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0FavdYgbIyT0umfB8ySvxBzAQcCYECX+BBoKC+5zPKtY72L5oUxCfXtIGkGy93arbGkTK3MQND8ZDbcELEXPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T03:57:33.598257Z"},"content_sha256":"be4b9fe66e610a076033125437e33b76d79950183c54b9f97628d48d9110002b","schema_version":"1.0","event_id":"sha256:be4b9fe66e610a076033125437e33b76d79950183c54b9f97628d48d9110002b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:AGX46EE7ACU5XPWBDCD3GIQ7XY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Rates for Private Adversarial Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hilal Asi, Kunal Talwar, Vinod Raman","submitted_at":"2025-05-27T21:42:10Z","abstract_excerpt":"We design new differentially private algorithms for the problems of adversarial bandits and bandits with expert advice. For adversarial bandits, we give a simple and efficient conversion of any non-private bandit algorithm to a private bandit algorithm. Instantiating our conversion with existing non-private bandit algorithms gives a regret upper bound of $O\\left(\\frac{\\sqrt{KT}}{\\sqrt{\\epsilon}}\\right)$, improving upon the existing upper bound $O\\left(\\frac{\\sqrt{KT \\log(KT)}}{\\epsilon}\\right)$ for all $\\epsilon \\leq 1$. In particular, our algorithms allow for sublinear expected regret even wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21790","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.21790/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"},"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-07-05T11:11:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q5hBAzYPXBR7bwYHMuhCgPVSz85MYRWKVDODBXDtc8tpmsMJLbS8vhdrVne2x61eqOWMSF4bi2oZwHcKCL0VBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T03:57:33.598742Z"},"content_sha256":"7662d1a8343589d2a8d36e45cb1b0af474d3ff984b455754596905a7e8e63a09","schema_version":"1.0","event_id":"sha256:7662d1a8343589d2a8d36e45cb1b0af474d3ff984b455754596905a7e8e63a09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGX46EE7ACU5XPWBDCD3GIQ7XY/bundle.json","state_url":"https://pith.science/pith/AGX46EE7ACU5XPWBDCD3GIQ7XY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGX46EE7ACU5XPWBDCD3GIQ7XY/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-08-08T03:57:33Z","links":{"resolver":"https://pith.science/pith/AGX46EE7ACU5XPWBDCD3GIQ7XY","bundle":"https://pith.science/pith/AGX46EE7ACU5XPWBDCD3GIQ7XY/bundle.json","state":"https://pith.science/pith/AGX46EE7ACU5XPWBDCD3GIQ7XY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGX46EE7ACU5XPWBDCD3GIQ7XY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AGX46EE7ACU5XPWBDCD3GIQ7XY","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":"e847881190d98ee70f4b9606696d23ead47c918df642cf39ff9a7079e03a08f1","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-27T21:42:10Z","title_canon_sha256":"c46b359752c0dc5ca0215002db20f543de7b63b24a25c0eeda59d7d319fd8f1c"},"schema_version":"1.0","source":{"id":"2505.21790","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21790","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21790v1","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21790","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_12","alias_value":"AGX46EE7ACU5","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_16","alias_value":"AGX46EE7ACU5XPWB","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_8","alias_value":"AGX46EE7","created_at":"2026-07-05T11:11:03Z"}],"graph_snapshots":[{"event_id":"sha256:7662d1a8343589d2a8d36e45cb1b0af474d3ff984b455754596905a7e8e63a09","target":"graph","created_at":"2026-07-05T11:11:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.21790/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We design new differentially private algorithms for the problems of adversarial bandits and bandits with expert advice. For adversarial bandits, we give a simple and efficient conversion of any non-private bandit algorithm to a private bandit algorithm. Instantiating our conversion with existing non-private bandit algorithms gives a regret upper bound of $O\\left(\\frac{\\sqrt{KT}}{\\sqrt{\\epsilon}}\\right)$, improving upon the existing upper bound $O\\left(\\frac{\\sqrt{KT \\log(KT)}}{\\epsilon}\\right)$ for all $\\epsilon \\leq 1$. In particular, our algorithms allow for sublinear expected regret even wh","authors_text":"Hilal Asi, Kunal Talwar, Vinod Raman","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21790","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:be4b9fe66e610a076033125437e33b76d79950183c54b9f97628d48d9110002b","target":"record","created_at":"2026-07-05T11:11:03Z","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":"e847881190d98ee70f4b9606696d23ead47c918df642cf39ff9a7079e03a08f1","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-27T21:42:10Z","title_canon_sha256":"c46b359752c0dc5ca0215002db20f543de7b63b24a25c0eeda59d7d319fd8f1c"},"schema_version":"1.0","source":{"id":"2505.21790","kind":"arxiv","version":1}},"canonical_sha256":"01afcf109f00a9dbbec11887b3221fbe31700f72e221b25ac373b50808a738c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01afcf109f00a9dbbec11887b3221fbe31700f72e221b25ac373b50808a738c4","first_computed_at":"2026-07-05T11:11:03.599792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:11:03.599792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rbUOxvX2VcfxvzBy6F2y2kavV2vOvgTZmyxuYXlUgpXR2tN7bF3FmvOVNXW7GLUoC8Gs+EdiFf1u96y7R3YXCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:11:03.600290Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.21790","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be4b9fe66e610a076033125437e33b76d79950183c54b9f97628d48d9110002b","sha256:7662d1a8343589d2a8d36e45cb1b0af474d3ff984b455754596905a7e8e63a09"],"state_sha256":"ae513b13e3766acc589a99de234e237d5d56f46bb8c3dfd4f17ee4af965a4257"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjiyGibwTQFjo1nHtUKiXd6C33CtuScISQXpatq5oE1XY9iZX56/8zuix0pn6TlXBM4HfgmctAPJGSfNpxxKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T03:57:33.603305Z","bundle_sha256":"bbaec698e15e4d91c0bb4f6b5cfe2d847af945d7782409437b1310f8c8df829f"}}