{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:GNTZSF6C6QNNRQDKDFLB6DXLQM","short_pith_number":"pith:GNTZSF6C","canonical_record":{"source":{"id":"2207.03445","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-07T17:20:57Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"4654f218da55edd704de7bcf83b03084a3ffa2ad92ddbfe51add1845fdb1dd7e","abstract_canon_sha256":"b550bffa337660093f6215f4ffe113e064152b146f23a0726d26205a8ce5d3c7"},"schema_version":"1.0"},"canonical_sha256":"33679917c2f41ad8c06a19561f0eeb831c63a74c27303b2e96a6dab1a4506ed9","source":{"kind":"arxiv","id":"2207.03445","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.03445","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"2207.03445v1","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03445","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"GNTZSF6C6QNN","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"pith_short_16","alias_value":"GNTZSF6C6QNNRQDK","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"pith_short_8","alias_value":"GNTZSF6C","created_at":"2026-07-05T04:38:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:GNTZSF6C6QNNRQDKDFLB6DXLQM","target":"record","payload":{"canonical_record":{"source":{"id":"2207.03445","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-07T17:20:57Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"4654f218da55edd704de7bcf83b03084a3ffa2ad92ddbfe51add1845fdb1dd7e","abstract_canon_sha256":"b550bffa337660093f6215f4ffe113e064152b146f23a0726d26205a8ce5d3c7"},"schema_version":"1.0"},"canonical_sha256":"33679917c2f41ad8c06a19561f0eeb831c63a74c27303b2e96a6dab1a4506ed9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:38:22.329025Z","signature_b64":"tt5Rhgy0RYKDmt6tKbGyNnLYyE4SZUdK0y/ONMbATJcxp05f2gHiz5F0NOsMaYuZPsLoCZKLqgnGWW9pzVlUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33679917c2f41ad8c06a19561f0eeb831c63a74c27303b2e96a6dab1a4506ed9","last_reissued_at":"2026-07-05T04:38:22.328519Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:38:22.328519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.03445","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-05T04:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+1EDvMF3+O46w0GdI6lNyS4lebqxFYkO4nIFDd4PX5EOyFeKSiy00g1ZJrb8G/NuVWCiMJSuzO6anseCky8mDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T03:30:19.603428Z"},"content_sha256":"34a2610ff84a7136b575ed8c133219f0fba473605f091a6694630b65821773d0","schema_version":"1.0","event_id":"sha256:34a2610ff84a7136b575ed8c133219f0fba473605f091a6694630b65821773d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:GNTZSF6C6QNNRQDKDFLB6DXLQM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differentially Private Stochastic Linear Bandits: (Almost) for Free","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Antonious M. Girgis, Christina Fragouli, Osama A. Hanna, Suhas Diggavi","submitted_at":"2022-07-07T17:20:57Z","abstract_excerpt":"In this paper, we propose differentially private algorithms for the problem of stochastic linear bandits in the central, local and shuffled models. In the central model, we achieve almost the same regret as the optimal non-private algorithms, which means we get privacy for free. In particular, we achieve a regret of $\\tilde{O}(\\sqrt{T}+\\frac{1}{\\epsilon})$ matching the known lower bound for private linear bandits, while the best previously known algorithm achieves $\\tilde{O}(\\frac{1}{\\epsilon}\\sqrt{T})$. In the local case, we achieve a regret of $\\tilde{O}(\\frac{1}{\\epsilon}{\\sqrt{T}})$ which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.03445","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/2207.03445/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-05T04:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7vzcvidmB5K5uHVrZUE9CfN9xLZSqG0zdqdnBHwahDszohylUodP5LIPAUzFLDup+4vVs1bh8YR40UPUmotBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T03:30:19.603928Z"},"content_sha256":"271583341f4ed2f78b9d2f42ceb52837e2b4b7cec17b5c9ea3676b985318430c","schema_version":"1.0","event_id":"sha256:271583341f4ed2f78b9d2f42ceb52837e2b4b7cec17b5c9ea3676b985318430c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNTZSF6C6QNNRQDKDFLB6DXLQM/bundle.json","state_url":"https://pith.science/pith/GNTZSF6C6QNNRQDKDFLB6DXLQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNTZSF6C6QNNRQDKDFLB6DXLQM/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-13T03:30:19Z","links":{"resolver":"https://pith.science/pith/GNTZSF6C6QNNRQDKDFLB6DXLQM","bundle":"https://pith.science/pith/GNTZSF6C6QNNRQDKDFLB6DXLQM/bundle.json","state":"https://pith.science/pith/GNTZSF6C6QNNRQDKDFLB6DXLQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNTZSF6C6QNNRQDKDFLB6DXLQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:GNTZSF6C6QNNRQDKDFLB6DXLQM","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":"b550bffa337660093f6215f4ffe113e064152b146f23a0726d26205a8ce5d3c7","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-07T17:20:57Z","title_canon_sha256":"4654f218da55edd704de7bcf83b03084a3ffa2ad92ddbfe51add1845fdb1dd7e"},"schema_version":"1.0","source":{"id":"2207.03445","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.03445","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"2207.03445v1","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03445","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"GNTZSF6C6QNN","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"pith_short_16","alias_value":"GNTZSF6C6QNNRQDK","created_at":"2026-07-05T04:38:22Z"},{"alias_kind":"pith_short_8","alias_value":"GNTZSF6C","created_at":"2026-07-05T04:38:22Z"}],"graph_snapshots":[{"event_id":"sha256:271583341f4ed2f78b9d2f42ceb52837e2b4b7cec17b5c9ea3676b985318430c","target":"graph","created_at":"2026-07-05T04:38:22Z","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/2207.03445/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose differentially private algorithms for the problem of stochastic linear bandits in the central, local and shuffled models. In the central model, we achieve almost the same regret as the optimal non-private algorithms, which means we get privacy for free. In particular, we achieve a regret of $\\tilde{O}(\\sqrt{T}+\\frac{1}{\\epsilon})$ matching the known lower bound for private linear bandits, while the best previously known algorithm achieves $\\tilde{O}(\\frac{1}{\\epsilon}\\sqrt{T})$. In the local case, we achieve a regret of $\\tilde{O}(\\frac{1}{\\epsilon}{\\sqrt{T}})$ which ","authors_text":"Antonious M. Girgis, Christina Fragouli, Osama A. Hanna, Suhas Diggavi","cross_cats":["cs.CR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-07T17:20:57Z","title":"Differentially Private Stochastic Linear Bandits: (Almost) for Free"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.03445","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:34a2610ff84a7136b575ed8c133219f0fba473605f091a6694630b65821773d0","target":"record","created_at":"2026-07-05T04:38:22Z","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":"b550bffa337660093f6215f4ffe113e064152b146f23a0726d26205a8ce5d3c7","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-07T17:20:57Z","title_canon_sha256":"4654f218da55edd704de7bcf83b03084a3ffa2ad92ddbfe51add1845fdb1dd7e"},"schema_version":"1.0","source":{"id":"2207.03445","kind":"arxiv","version":1}},"canonical_sha256":"33679917c2f41ad8c06a19561f0eeb831c63a74c27303b2e96a6dab1a4506ed9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33679917c2f41ad8c06a19561f0eeb831c63a74c27303b2e96a6dab1a4506ed9","first_computed_at":"2026-07-05T04:38:22.328519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:38:22.328519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tt5Rhgy0RYKDmt6tKbGyNnLYyE4SZUdK0y/ONMbATJcxp05f2gHiz5F0NOsMaYuZPsLoCZKLqgnGWW9pzVlUBg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:38:22.329025Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.03445","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34a2610ff84a7136b575ed8c133219f0fba473605f091a6694630b65821773d0","sha256:271583341f4ed2f78b9d2f42ceb52837e2b4b7cec17b5c9ea3676b985318430c"],"state_sha256":"27e3a473e9f97f0ce7e3502d5885a74620110ec8b39b3ad9e04da47d69babee8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZmubLFpR6YY0CXbMzirTMQhH4Kx05US6IFMWUZaOn4pUrIpmboa1RolYFGjHYFcJlh5zyd8I4PUuqzw43dXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T03:30:19.607383Z","bundle_sha256":"28cc4723bc947c6059632e030a5dbeb27c446234bd171d86f184b15cc6520637"}}