{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BW3FH742GKVCE3IAVMHO7W6XC4","short_pith_number":"pith:BW3FH742","schema_version":"1.0","canonical_sha256":"0db653ff9a32aa226d00ab0eefdbd71702319b71d1881c186ac84b4966e1e9d7","source":{"kind":"arxiv","id":"1709.05396","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.05396","created_at":"2026-05-17T23:56:10.484106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05396v3","created_at":"2026-05-17T23:56:10.484106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05396","created_at":"2026-05-17T23:56:10.484106+00:00"},{"alias_kind":"pith_short_12","alias_value":"BW3FH742GKVC","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BW3FH742GKVCE3IA","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BW3FH742","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BW3FH742GKVCE3IAVMHO7W6XC4","json":"https://pith.science/pith/BW3FH742GKVCE3IAVMHO7W6XC4.json","graph_json":"https://pith.science/api/pith-number/BW3FH742GKVCE3IAVMHO7W6XC4/graph.json","events_json":"https://pith.science/api/pith-number/BW3FH742GKVCE3IAVMHO7W6XC4/events.json","paper":"https://pith.science/paper/BW3FH742"},"agent_actions":{"view_html":"https://pith.science/pith/BW3FH742GKVCE3IAVMHO7W6XC4","download_json":"https://pith.science/pith/BW3FH742GKVCE3IAVMHO7W6XC4.json","view_paper":"https://pith.science/paper/BW3FH742","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05396&json=true","fetch_graph":"https://pith.science/api/pith-number/BW3FH742GKVCE3IAVMHO7W6XC4/graph.json","fetch_events":"https://pith.science/api/pith-number/BW3FH742GKVCE3IAVMHO7W6XC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BW3FH742GKVCE3IAVMHO7W6XC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BW3FH742GKVCE3IAVMHO7W6XC4/action/storage_attestation","attest_author":"https://pith.science/pith/BW3FH742GKVCE3IAVMHO7W6XC4/action/author_attestation","sign_citation":"https://pith.science/pith/BW3FH742GKVCE3IAVMHO7W6XC4/action/citation_signature","submit_replication":"https://pith.science/pith/BW3FH742GKVCE3IAVMHO7W6XC4/action/replication_record"}},"created_at":"2026-05-17T23:56:10.484106+00:00","updated_at":"2026-05-17T23:56:10.484106+00:00"}