{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KOVSAX4RIL53B4GCX5B2INO6RY","short_pith_number":"pith:KOVSAX4R","canonical_record":{"source":{"id":"1511.08681","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-27T14:16:00Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"22953464b83b2d6c928b7a0cb2819957a60f10768f249cd06b672ee4fdbc285c","abstract_canon_sha256":"d14691f6c7e586656e2dac6c81ef96d74aa588a7eb5142aea9e0113950b00a2f"},"schema_version":"1.0"},"canonical_sha256":"53ab205f9142fbb0f0c2bf43a435de8e35eea4badc2fba8cdda5c16a47cf73cf","source":{"kind":"arxiv","id":"1511.08681","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08681","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08681v1","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08681","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"KOVSAX4RIL53","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KOVSAX4RIL53B4GC","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KOVSAX4R","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KOVSAX4RIL53B4GCX5B2INO6RY","target":"record","payload":{"canonical_record":{"source":{"id":"1511.08681","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-27T14:16:00Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"22953464b83b2d6c928b7a0cb2819957a60f10768f249cd06b672ee4fdbc285c","abstract_canon_sha256":"d14691f6c7e586656e2dac6c81ef96d74aa588a7eb5142aea9e0113950b00a2f"},"schema_version":"1.0"},"canonical_sha256":"53ab205f9142fbb0f0c2bf43a435de8e35eea4badc2fba8cdda5c16a47cf73cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:48.324262Z","signature_b64":"z7YH6pHSjn4okq9quhCIOQDjr26gEK/XSnBJe0jAhZW/tCXJsc8Wt8UxHCR1FgyM7GXiqyp6Je4iKBdRqNFbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53ab205f9142fbb0f0c2bf43a435de8e35eea4badc2fba8cdda5c16a47cf73cf","last_reissued_at":"2026-05-18T01:25:48.323715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:48.323715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.08681","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-05-18T01:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0X9H1AmNJy9SFHtniQ/5vNzoX6I/dVjGBsqOqfOwCQYEdCwrW2SYZ4CItbRNwPHCaedeAJkJIS0qXSuB6q+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:15:44.173270Z"},"content_sha256":"bede1acba13dfbd6ef5af5357c1b4843a7c066b7688503f9154a6de26fd7cbb9","schema_version":"1.0","event_id":"sha256:bede1acba13dfbd6ef5af5357c1b4843a7c066b7688503f9154a6de26fd7cbb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KOVSAX4RIL53B4GCX5B2INO6RY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Differentially Private Multi-Armed Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Aristide Tossou, Christos Dimitrakakis","submitted_at":"2015-11-27T14:16:00Z","abstract_excerpt":"We present differentially private algorithms for the stochastic Multi-Armed Bandit (MAB) problem. This is a problem for applications such as adaptive clinical trials, experiment design, and user-targeted advertising where private information is connected to individual rewards. Our major contribution is to show that there exist $(\\epsilon, \\delta)$ differentially private variants of Upper Confidence Bound algorithms which have optimal regret, $O(\\epsilon^{-1} + \\log T)$. This is a significant improvement over previous results, which only achieve poly-log regret $O(\\epsilon^{-2} \\log^{2} T)$, be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08681","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":""},"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-05-18T01:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gQmTbtt+jNrsmleyMGIPAeDhlOCxNfXCRbQEdxpe1ToMHBzcfD+jY30PhAM+/mMgTOfjUMaj1VWZUp/n++hiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:15:44.173916Z"},"content_sha256":"73b25a3c0a6096f82a79cd7036903110e61a85b9aeebb046cf83d5967ff79d51","schema_version":"1.0","event_id":"sha256:73b25a3c0a6096f82a79cd7036903110e61a85b9aeebb046cf83d5967ff79d51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KOVSAX4RIL53B4GCX5B2INO6RY/bundle.json","state_url":"https://pith.science/pith/KOVSAX4RIL53B4GCX5B2INO6RY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KOVSAX4RIL53B4GCX5B2INO6RY/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-05-27T22:15:44Z","links":{"resolver":"https://pith.science/pith/KOVSAX4RIL53B4GCX5B2INO6RY","bundle":"https://pith.science/pith/KOVSAX4RIL53B4GCX5B2INO6RY/bundle.json","state":"https://pith.science/pith/KOVSAX4RIL53B4GCX5B2INO6RY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KOVSAX4RIL53B4GCX5B2INO6RY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KOVSAX4RIL53B4GCX5B2INO6RY","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":"d14691f6c7e586656e2dac6c81ef96d74aa588a7eb5142aea9e0113950b00a2f","cross_cats_sorted":["cs.CR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-27T14:16:00Z","title_canon_sha256":"22953464b83b2d6c928b7a0cb2819957a60f10768f249cd06b672ee4fdbc285c"},"schema_version":"1.0","source":{"id":"1511.08681","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08681","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08681v1","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08681","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"KOVSAX4RIL53","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KOVSAX4RIL53B4GC","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KOVSAX4R","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:73b25a3c0a6096f82a79cd7036903110e61a85b9aeebb046cf83d5967ff79d51","target":"graph","created_at":"2026-05-18T01:25:48Z","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"},"paper":{"abstract_excerpt":"We present differentially private algorithms for the stochastic Multi-Armed Bandit (MAB) problem. This is a problem for applications such as adaptive clinical trials, experiment design, and user-targeted advertising where private information is connected to individual rewards. Our major contribution is to show that there exist $(\\epsilon, \\delta)$ differentially private variants of Upper Confidence Bound algorithms which have optimal regret, $O(\\epsilon^{-1} + \\log T)$. This is a significant improvement over previous results, which only achieve poly-log regret $O(\\epsilon^{-2} \\log^{2} T)$, be","authors_text":"Aristide Tossou, Christos Dimitrakakis","cross_cats":["cs.CR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-27T14:16:00Z","title":"Algorithms for Differentially Private Multi-Armed Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08681","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:bede1acba13dfbd6ef5af5357c1b4843a7c066b7688503f9154a6de26fd7cbb9","target":"record","created_at":"2026-05-18T01:25:48Z","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":"d14691f6c7e586656e2dac6c81ef96d74aa588a7eb5142aea9e0113950b00a2f","cross_cats_sorted":["cs.CR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-27T14:16:00Z","title_canon_sha256":"22953464b83b2d6c928b7a0cb2819957a60f10768f249cd06b672ee4fdbc285c"},"schema_version":"1.0","source":{"id":"1511.08681","kind":"arxiv","version":1}},"canonical_sha256":"53ab205f9142fbb0f0c2bf43a435de8e35eea4badc2fba8cdda5c16a47cf73cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53ab205f9142fbb0f0c2bf43a435de8e35eea4badc2fba8cdda5c16a47cf73cf","first_computed_at":"2026-05-18T01:25:48.323715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:48.323715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z7YH6pHSjn4okq9quhCIOQDjr26gEK/XSnBJe0jAhZW/tCXJsc8Wt8UxHCR1FgyM7GXiqyp6Je4iKBdRqNFbCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:48.324262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08681","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bede1acba13dfbd6ef5af5357c1b4843a7c066b7688503f9154a6de26fd7cbb9","sha256:73b25a3c0a6096f82a79cd7036903110e61a85b9aeebb046cf83d5967ff79d51"],"state_sha256":"e3cd974cf2d39d902ca5274ae057c39bfca3a31b1451272dfcd90f6f2ff772c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btUuqJ2SN4G+70pFfKa0w6bS2GvCwotAO0tlySPzhiyAMc3C2JZfPCP0IyECMuzDj3eZVNtk7oS/UrebfjHkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:15:44.176596Z","bundle_sha256":"e21028b5fb9eeceafbbb533cf726aef87c3f924461d5fc9ecc75da5f00810274"}}