{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BW3FH742GKVCE3IAVMHO7W6XC4","short_pith_number":"pith:BW3FH742","canonical_record":{"source":{"id":"1709.05396","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-15T20:43:20Z","cross_cats_sorted":[],"title_canon_sha256":"954116a86ebd8b7aa8ba4207071879e621605b0c2ec2b11a88e764dd130c7def","abstract_canon_sha256":"6c7ec56b70e9494ec23ef6d8686b0ee141d34d73926312899d2361c2f53550b4"},"schema_version":"1.0"},"canonical_sha256":"0db653ff9a32aa226d00ab0eefdbd71702319b71d1881c186ac84b4966e1e9d7","source":{"kind":"arxiv","id":"1709.05396","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05396","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05396v3","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05396","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"BW3FH742GKVC","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BW3FH742GKVCE3IA","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BW3FH742","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BW3FH742GKVCE3IAVMHO7W6XC4","target":"record","payload":{"canonical_record":{"source":{"id":"1709.05396","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-15T20:43:20Z","cross_cats_sorted":[],"title_canon_sha256":"954116a86ebd8b7aa8ba4207071879e621605b0c2ec2b11a88e764dd130c7def","abstract_canon_sha256":"6c7ec56b70e9494ec23ef6d8686b0ee141d34d73926312899d2361c2f53550b4"},"schema_version":"1.0"},"canonical_sha256":"0db653ff9a32aa226d00ab0eefdbd71702319b71d1881c186ac84b4966e1e9d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:10.484779Z","signature_b64":"qXF2ApmQ0InvauqK6HKRMf0zjEFsm7Pd1bV8H/6kv27yjlQj+VRsPDf+tLbwJe5RFQ4BrVVxUaoywfbwqFOBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0db653ff9a32aa226d00ab0eefdbd71702319b71d1881c186ac84b4966e1e9d7","last_reissued_at":"2026-05-17T23:56:10.483978Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:10.483978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.05396","source_version":3,"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-17T23:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYosn/UQnUHqrjtMoaW3+6de41En5rcEblEunewPz5AVCHtrHwv6u2yNGWQbbeEM38tNlckfNjP5K4GzEexsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:39:43.770452Z"},"content_sha256":"582ac41669dd69a139bac511d3102d135ea908850c07128ab4f6f45b5cc8d145","schema_version":"1.0","event_id":"sha256:582ac41669dd69a139bac511d3102d135ea908850c07128ab4f6f45b5cc8d145"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BW3FH742GKVCE3IAVMHO7W6XC4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differential Privacy on Finite Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Salil Vadhan, Victor Balcer","submitted_at":"2017-09-15T20:43:20Z","abstract_excerpt":"We consider the problem of designing and analyzing differentially private algorithms that can be implemented on {\\em discrete} models of computation in {\\em strict} polynomial time, motivated by known attacks on floating point implementations of real-arithmetic differentially private algorithms (Mironov, CCS 2012) and the potential for timing attacks on expected polynomial-time algorithms. As a case study, we examine the basic problem of approximating the histogram of a categorical dataset over a possibly large data universe $\\mathcal{X}$. The classic Laplace Mechanism (Dwork, McSherry, Nissim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05396","kind":"arxiv","version":3},"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-17T23:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovHyqFU7ArChfJlaK/Y7+5DfM06EfA+BeJYkEI0xsIINEzLIjQS9Qu+7jiyrfsU2hNfL+Q4+luFFEedbrO33CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:39:43.770792Z"},"content_sha256":"85d5f1b3ae9d603f0a00a644081f370275f89a91516937cfca2201b516475002","schema_version":"1.0","event_id":"sha256:85d5f1b3ae9d603f0a00a644081f370275f89a91516937cfca2201b516475002"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BW3FH742GKVCE3IAVMHO7W6XC4/bundle.json","state_url":"https://pith.science/pith/BW3FH742GKVCE3IAVMHO7W6XC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BW3FH742GKVCE3IAVMHO7W6XC4/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-06-29T13:39:43Z","links":{"resolver":"https://pith.science/pith/BW3FH742GKVCE3IAVMHO7W6XC4","bundle":"https://pith.science/pith/BW3FH742GKVCE3IAVMHO7W6XC4/bundle.json","state":"https://pith.science/pith/BW3FH742GKVCE3IAVMHO7W6XC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BW3FH742GKVCE3IAVMHO7W6XC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BW3FH742GKVCE3IAVMHO7W6XC4","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":"6c7ec56b70e9494ec23ef6d8686b0ee141d34d73926312899d2361c2f53550b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-15T20:43:20Z","title_canon_sha256":"954116a86ebd8b7aa8ba4207071879e621605b0c2ec2b11a88e764dd130c7def"},"schema_version":"1.0","source":{"id":"1709.05396","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05396","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05396v3","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05396","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"BW3FH742GKVC","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BW3FH742GKVCE3IA","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BW3FH742","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:85d5f1b3ae9d603f0a00a644081f370275f89a91516937cfca2201b516475002","target":"graph","created_at":"2026-05-17T23:56:10Z","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 consider the problem of designing and analyzing differentially private algorithms that can be implemented on {\\em discrete} models of computation in {\\em strict} polynomial time, motivated by known attacks on floating point implementations of real-arithmetic differentially private algorithms (Mironov, CCS 2012) and the potential for timing attacks on expected polynomial-time algorithms. As a case study, we examine the basic problem of approximating the histogram of a categorical dataset over a possibly large data universe $\\mathcal{X}$. The classic Laplace Mechanism (Dwork, McSherry, Nissim","authors_text":"Salil Vadhan, Victor Balcer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-15T20:43:20Z","title":"Differential Privacy on Finite Computers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05396","kind":"arxiv","version":3},"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:582ac41669dd69a139bac511d3102d135ea908850c07128ab4f6f45b5cc8d145","target":"record","created_at":"2026-05-17T23:56:10Z","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":"6c7ec56b70e9494ec23ef6d8686b0ee141d34d73926312899d2361c2f53550b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-15T20:43:20Z","title_canon_sha256":"954116a86ebd8b7aa8ba4207071879e621605b0c2ec2b11a88e764dd130c7def"},"schema_version":"1.0","source":{"id":"1709.05396","kind":"arxiv","version":3}},"canonical_sha256":"0db653ff9a32aa226d00ab0eefdbd71702319b71d1881c186ac84b4966e1e9d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0db653ff9a32aa226d00ab0eefdbd71702319b71d1881c186ac84b4966e1e9d7","first_computed_at":"2026-05-17T23:56:10.483978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:10.483978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qXF2ApmQ0InvauqK6HKRMf0zjEFsm7Pd1bV8H/6kv27yjlQj+VRsPDf+tLbwJe5RFQ4BrVVxUaoywfbwqFOBDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:10.484779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05396","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:582ac41669dd69a139bac511d3102d135ea908850c07128ab4f6f45b5cc8d145","sha256:85d5f1b3ae9d603f0a00a644081f370275f89a91516937cfca2201b516475002"],"state_sha256":"27ebaf4fb58c3c91a648c52c8e20f22a1813c7fb486ae7a7aefba9505b60bec6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h3R29xc+hjLfFLL0k1O9vvvHqBE0VSTMDy/yF/bO8dwjuYUmNTSKoEk+SBdAjrbkkEZT7zev0gVhx7FA/yguCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:39:43.772717Z","bundle_sha256":"da585be73c4f73deaaf5847f3e681d7718eff8669a60e6a0d1478f7c01f624fe"}}