{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KFA43QJH6IIXB3P5N5K5BYWXZX","short_pith_number":"pith:KFA43QJH","canonical_record":{"source":{"id":"1605.02065","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-05-06T19:57:35Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"ddcadf0a3b7f818099842c858210e7c695c60eddd2b0ffb465b40cead43b14ce","abstract_canon_sha256":"5292cf0d03e7e0c6ac41dd3957bbb8f18c345fbcd2f3bfafe8eb03098befed47"},"schema_version":"1.0"},"canonical_sha256":"5141cdc127f21170edfd6f55d0e2d7cdc39af0e52e68a8c4752a632bd872500b","source":{"kind":"arxiv","id":"1605.02065","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02065","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02065v1","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02065","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"pith_short_12","alias_value":"KFA43QJH6IIX","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KFA43QJH6IIXB3P5","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KFA43QJH","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KFA43QJH6IIXB3P5N5K5BYWXZX","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02065","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-05-06T19:57:35Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"ddcadf0a3b7f818099842c858210e7c695c60eddd2b0ffb465b40cead43b14ce","abstract_canon_sha256":"5292cf0d03e7e0c6ac41dd3957bbb8f18c345fbcd2f3bfafe8eb03098befed47"},"schema_version":"1.0"},"canonical_sha256":"5141cdc127f21170edfd6f55d0e2d7cdc39af0e52e68a8c4752a632bd872500b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:24.541102Z","signature_b64":"YmKl2qY8N+TvVm1tOVZBR0wGWpEOpYZwx1UpFjaVByqQDRP24OgqHSE3Enq8zhemYlWQGlHPtILnixKZ1pIZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5141cdc127f21170edfd6f55d0e2d7cdc39af0e52e68a8c4752a632bd872500b","last_reissued_at":"2026-05-18T01:15:24.540440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:24.540440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02065","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:15:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"03P2MHu84Uc1RkMeKem/RcZX/EatYJWtnLDns1NTSCHEmuizyEF7w6UcLn4SFzOEDVKSjho3nElFk1jpkZ4UAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:33:07.694210Z"},"content_sha256":"9888387b7754d5228c2c52fea8b7755b291d935b17aa4587b59df1bbc6a1b46c","schema_version":"1.0","event_id":"sha256:9888387b7754d5228c2c52fea8b7755b291d935b17aa4587b59df1bbc6a1b46c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KFA43QJH6IIXB3P5N5K5BYWXZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"primary_cat":"cs.CR","authors_text":"Mark Bun, Thomas Steinke","submitted_at":"2016-05-06T19:57:35Z","abstract_excerpt":"\"Concentrated differential privacy\" was recently introduced by Dwork and Rothblum as a relaxation of differential privacy, which permits sharper analyses of many privacy-preserving computations. We present an alternative formulation of the concept of concentrated differential privacy in terms of the Renyi divergence between the distributions obtained by running an algorithm on neighboring inputs. With this reformulation in hand, we prove sharper quantitative results, establish lower bounds, and raise a few new questions. We also unify this approach with approximate differential privacy by givi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02065","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:15:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7aaKvNapji8Ygh7WGflnRhLkQ31xPeFsPZkn5fwnWUQWVTT8rKt0yH/NHorlarLQ73rB1vX5fQ7yKzgismIdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:33:07.694854Z"},"content_sha256":"c7cfb11b8015072329bad700f8e49107c18c4b2148994b50fcbe07fddc6f93e0","schema_version":"1.0","event_id":"sha256:c7cfb11b8015072329bad700f8e49107c18c4b2148994b50fcbe07fddc6f93e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KFA43QJH6IIXB3P5N5K5BYWXZX/bundle.json","state_url":"https://pith.science/pith/KFA43QJH6IIXB3P5N5K5BYWXZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KFA43QJH6IIXB3P5N5K5BYWXZX/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-21T15:33:07Z","links":{"resolver":"https://pith.science/pith/KFA43QJH6IIXB3P5N5K5BYWXZX","bundle":"https://pith.science/pith/KFA43QJH6IIXB3P5N5K5BYWXZX/bundle.json","state":"https://pith.science/pith/KFA43QJH6IIXB3P5N5K5BYWXZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KFA43QJH6IIXB3P5N5K5BYWXZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KFA43QJH6IIXB3P5N5K5BYWXZX","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":"5292cf0d03e7e0c6ac41dd3957bbb8f18c345fbcd2f3bfafe8eb03098befed47","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-05-06T19:57:35Z","title_canon_sha256":"ddcadf0a3b7f818099842c858210e7c695c60eddd2b0ffb465b40cead43b14ce"},"schema_version":"1.0","source":{"id":"1605.02065","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02065","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02065v1","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02065","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"pith_short_12","alias_value":"KFA43QJH6IIX","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KFA43QJH6IIXB3P5","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KFA43QJH","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:c7cfb11b8015072329bad700f8e49107c18c4b2148994b50fcbe07fddc6f93e0","target":"graph","created_at":"2026-05-18T01:15:24Z","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":"\"Concentrated differential privacy\" was recently introduced by Dwork and Rothblum as a relaxation of differential privacy, which permits sharper analyses of many privacy-preserving computations. We present an alternative formulation of the concept of concentrated differential privacy in terms of the Renyi divergence between the distributions obtained by running an algorithm on neighboring inputs. With this reformulation in hand, we prove sharper quantitative results, establish lower bounds, and raise a few new questions. We also unify this approach with approximate differential privacy by givi","authors_text":"Mark Bun, Thomas Steinke","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-05-06T19:57:35Z","title":"Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02065","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:9888387b7754d5228c2c52fea8b7755b291d935b17aa4587b59df1bbc6a1b46c","target":"record","created_at":"2026-05-18T01:15:24Z","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":"5292cf0d03e7e0c6ac41dd3957bbb8f18c345fbcd2f3bfafe8eb03098befed47","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-05-06T19:57:35Z","title_canon_sha256":"ddcadf0a3b7f818099842c858210e7c695c60eddd2b0ffb465b40cead43b14ce"},"schema_version":"1.0","source":{"id":"1605.02065","kind":"arxiv","version":1}},"canonical_sha256":"5141cdc127f21170edfd6f55d0e2d7cdc39af0e52e68a8c4752a632bd872500b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5141cdc127f21170edfd6f55d0e2d7cdc39af0e52e68a8c4752a632bd872500b","first_computed_at":"2026-05-18T01:15:24.540440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:24.540440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YmKl2qY8N+TvVm1tOVZBR0wGWpEOpYZwx1UpFjaVByqQDRP24OgqHSE3Enq8zhemYlWQGlHPtILnixKZ1pIZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:24.541102Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02065","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9888387b7754d5228c2c52fea8b7755b291d935b17aa4587b59df1bbc6a1b46c","sha256:c7cfb11b8015072329bad700f8e49107c18c4b2148994b50fcbe07fddc6f93e0"],"state_sha256":"8aad8d0e5e89b49b819ebd46f1a09177ea78056024bbf3d13f6dd2c4311151a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGBrUTRRQKRp260vh+JmlrtCJpbGLkwy98hL+u3rdmkDWO8d/F80/BGf3oedd1Ht78f5OX3OT5Lf0HOVeKN1AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T15:33:07.698006Z","bundle_sha256":"eedba7f5869ed06cf7193fbf49aca7cbfc826d7c70bdc0d92d1763c7c4613750"}}