{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:J676YEEK7HZ7YNYMTR3DP2VYLZ","short_pith_number":"pith:J676YEEK","canonical_record":{"source":{"id":"1606.07143","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-23T00:11:57Z","cross_cats_sorted":["cs.DS","cs.PL"],"title_canon_sha256":"ce1ce809a5d838f70902e0461e9a7a8db7437c8c4aa804d09ab5515bf4d9216a","abstract_canon_sha256":"82e8f8e42cc8e87c124bb11dba661b480c73c42b0bbdc50c2f78a2ef014f364d"},"schema_version":"1.0"},"canonical_sha256":"4fbfec108af9f3fc370c9c7637eab85e75b7a8b86d5c98b4384a23a54a5fd151","source":{"kind":"arxiv","id":"1606.07143","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07143","created_at":"2026-05-18T00:20:59Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07143v2","created_at":"2026-05-18T00:20:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07143","created_at":"2026-05-18T00:20:59Z"},{"alias_kind":"pith_short_12","alias_value":"J676YEEK7HZ7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J676YEEK7HZ7YNYM","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J676YEEK","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:J676YEEK7HZ7YNYMTR3DP2VYLZ","target":"record","payload":{"canonical_record":{"source":{"id":"1606.07143","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-23T00:11:57Z","cross_cats_sorted":["cs.DS","cs.PL"],"title_canon_sha256":"ce1ce809a5d838f70902e0461e9a7a8db7437c8c4aa804d09ab5515bf4d9216a","abstract_canon_sha256":"82e8f8e42cc8e87c124bb11dba661b480c73c42b0bbdc50c2f78a2ef014f364d"},"schema_version":"1.0"},"canonical_sha256":"4fbfec108af9f3fc370c9c7637eab85e75b7a8b86d5c98b4384a23a54a5fd151","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:59.425403Z","signature_b64":"Pgc0sKJnQU05YtZ1SfBzWatOssX5j+cnosXSMuoiDDParPmVr5LRqsXw1k7k2ZNC0YmD3obvgiMoE3ubDq4WCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fbfec108af9f3fc370c9c7637eab85e75b7a8b86d5c98b4384a23a54a5fd151","last_reissued_at":"2026-05-18T00:20:59.424828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:59.424828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.07143","source_version":2,"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-18T00:20:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0O5XvUgXz7nlmS9bfE2MhoprR2Pe2C0YsEZE9sxi9h6q1j8Kr6JluExmZ3jear62P7bE20EtPZpnmTVMVq4IAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:32:56.453360Z"},"content_sha256":"4fc43059063ca3198e8193d95db75ae2b148a1851f08fd13f8671eddc3be4e2a","schema_version":"1.0","event_id":"sha256:4fc43059063ca3198e8193d95db75ae2b148a1851f08fd13f8671eddc3be4e2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:J676YEEK7HZ7YNYMTR3DP2VYLZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Advanced Probabilistic Couplings for Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.PL"],"primary_cat":"cs.LO","authors_text":"Benjamin Gr\\'egoire, Gilles Barthe, Justin Hsu, Marco Gaboardi, No\\'emie Fong, Pierre-Yves Strub","submitted_at":"2016-06-23T00:11:57Z","abstract_excerpt":"Differential privacy is a promising formal approach to data privacy, which provides a quantitative bound on the privacy cost of an algorithm that operates on sensitive information. Several tools have been developed for the formal verification of differentially private algorithms, including program logics and type systems. However, these tools do not capture fundamental techniques that have emerged in recent years, and cannot be used for reasoning about cutting-edge differentially private algorithms. Existing techniques fail to handle three broad classes of algorithms: 1) algorithms where priva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07143","kind":"arxiv","version":2},"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-18T00:20:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RG5v/XLzhcj+lYXTbcsoPD4vQ4cCQchMGoZ8jleTRK1PGYAm1TkpVHV5g4M6i97m/PbvL0kPxZBNVyD5ot1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:32:56.453854Z"},"content_sha256":"719c6460769aaa029cf87a05a2b7348a41692c0fe1ab267d5056ae31c8648376","schema_version":"1.0","event_id":"sha256:719c6460769aaa029cf87a05a2b7348a41692c0fe1ab267d5056ae31c8648376"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J676YEEK7HZ7YNYMTR3DP2VYLZ/bundle.json","state_url":"https://pith.science/pith/J676YEEK7HZ7YNYMTR3DP2VYLZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J676YEEK7HZ7YNYMTR3DP2VYLZ/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-28T07:32:56Z","links":{"resolver":"https://pith.science/pith/J676YEEK7HZ7YNYMTR3DP2VYLZ","bundle":"https://pith.science/pith/J676YEEK7HZ7YNYMTR3DP2VYLZ/bundle.json","state":"https://pith.science/pith/J676YEEK7HZ7YNYMTR3DP2VYLZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J676YEEK7HZ7YNYMTR3DP2VYLZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J676YEEK7HZ7YNYMTR3DP2VYLZ","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":"82e8f8e42cc8e87c124bb11dba661b480c73c42b0bbdc50c2f78a2ef014f364d","cross_cats_sorted":["cs.DS","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-23T00:11:57Z","title_canon_sha256":"ce1ce809a5d838f70902e0461e9a7a8db7437c8c4aa804d09ab5515bf4d9216a"},"schema_version":"1.0","source":{"id":"1606.07143","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07143","created_at":"2026-05-18T00:20:59Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07143v2","created_at":"2026-05-18T00:20:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07143","created_at":"2026-05-18T00:20:59Z"},{"alias_kind":"pith_short_12","alias_value":"J676YEEK7HZ7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J676YEEK7HZ7YNYM","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J676YEEK","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:719c6460769aaa029cf87a05a2b7348a41692c0fe1ab267d5056ae31c8648376","target":"graph","created_at":"2026-05-18T00:20:59Z","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":"Differential privacy is a promising formal approach to data privacy, which provides a quantitative bound on the privacy cost of an algorithm that operates on sensitive information. Several tools have been developed for the formal verification of differentially private algorithms, including program logics and type systems. However, these tools do not capture fundamental techniques that have emerged in recent years, and cannot be used for reasoning about cutting-edge differentially private algorithms. Existing techniques fail to handle three broad classes of algorithms: 1) algorithms where priva","authors_text":"Benjamin Gr\\'egoire, Gilles Barthe, Justin Hsu, Marco Gaboardi, No\\'emie Fong, Pierre-Yves Strub","cross_cats":["cs.DS","cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-23T00:11:57Z","title":"Advanced Probabilistic Couplings for Differential Privacy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07143","kind":"arxiv","version":2},"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:4fc43059063ca3198e8193d95db75ae2b148a1851f08fd13f8671eddc3be4e2a","target":"record","created_at":"2026-05-18T00:20:59Z","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":"82e8f8e42cc8e87c124bb11dba661b480c73c42b0bbdc50c2f78a2ef014f364d","cross_cats_sorted":["cs.DS","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-23T00:11:57Z","title_canon_sha256":"ce1ce809a5d838f70902e0461e9a7a8db7437c8c4aa804d09ab5515bf4d9216a"},"schema_version":"1.0","source":{"id":"1606.07143","kind":"arxiv","version":2}},"canonical_sha256":"4fbfec108af9f3fc370c9c7637eab85e75b7a8b86d5c98b4384a23a54a5fd151","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fbfec108af9f3fc370c9c7637eab85e75b7a8b86d5c98b4384a23a54a5fd151","first_computed_at":"2026-05-18T00:20:59.424828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:59.424828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pgc0sKJnQU05YtZ1SfBzWatOssX5j+cnosXSMuoiDDParPmVr5LRqsXw1k7k2ZNC0YmD3obvgiMoE3ubDq4WCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:59.425403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.07143","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fc43059063ca3198e8193d95db75ae2b148a1851f08fd13f8671eddc3be4e2a","sha256:719c6460769aaa029cf87a05a2b7348a41692c0fe1ab267d5056ae31c8648376"],"state_sha256":"a83f55b5aa0852f88a2fe53f1177d5ecb2939d66804bcabadddfb9625c9a63a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/vWgmbRPkiP7gL+ZM1T5WtVtwzpINbrg+jz8cg6kZp5by44WHefZLwckCMmC7Dm160R32zfuUxOIn0ABBaS9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:32:56.456149Z","bundle_sha256":"5bcdb63e4200aa5cf81c79a055f400cd8114bbcbf25cde27836ddff8d82d7354"}}