{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:G3F6IYA3ZALZEGDHYDG7QWG3VR","short_pith_number":"pith:G3F6IYA3","schema_version":"1.0","canonical_sha256":"36cbe4601bc817921867c0cdf858dbac63fd70f1c46d62ec4fb5175fe880e07d","source":{"kind":"arxiv","id":"1811.07765","version":1},"attestation_state":"computed","paper":{"title":"How to Use Heuristics for Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Roth, Seth Neel, Zhiwei Steven Wu","submitted_at":"2018-11-19T15:57:08Z","abstract_excerpt":"We develop theory for using heuristics to solve computationally hard problems in differential privacy. Heuristic approaches have enjoyed tremendous success in machine learning, for which performance can be empirically evaluated. However, privacy guarantees cannot be evaluated empirically, and must be proven --- without making heuristic assumptions. We show that learning problems over broad classes of functions can be solved privately and efficiently, assuming the existence of a non-private oracle for solving the same problem. Our first algorithm yields a privacy guarantee that is contingent on"},"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":"1811.07765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-19T15:57:08Z","cross_cats_sorted":["cs.CR","cs.DS","stat.ML"],"title_canon_sha256":"af386256988aa1f75e5226b04be67256f648daa09ea044f3c39670b0de19999d","abstract_canon_sha256":"c26a6bc0ac664adafbbc42d57073983d7ccce2e8641a616022dec0a2790d515e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:23.524755Z","signature_b64":"sOaZGPIyF8RbHUgXaXemMwlDMpSTXa29iL2bDpoaIRBDXtE0S3vkWhnjZw0KsBDz3Kf8xD9xhEhrHK6bspmNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36cbe4601bc817921867c0cdf858dbac63fd70f1c46d62ec4fb5175fe880e07d","last_reissued_at":"2026-05-18T00:00:23.524072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:23.524072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Use Heuristics for Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Roth, Seth Neel, Zhiwei Steven Wu","submitted_at":"2018-11-19T15:57:08Z","abstract_excerpt":"We develop theory for using heuristics to solve computationally hard problems in differential privacy. Heuristic approaches have enjoyed tremendous success in machine learning, for which performance can be empirically evaluated. However, privacy guarantees cannot be evaluated empirically, and must be proven --- without making heuristic assumptions. We show that learning problems over broad classes of functions can be solved privately and efficiently, assuming the existence of a non-private oracle for solving the same problem. Our first algorithm yields a privacy guarantee that is contingent on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07765","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.07765","created_at":"2026-05-18T00:00:23.524166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.07765v1","created_at":"2026-05-18T00:00:23.524166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07765","created_at":"2026-05-18T00:00:23.524166+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3F6IYA3ZALZ","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3F6IYA3ZALZEGDH","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3F6IYA3","created_at":"2026-05-18T12:32:25.280505+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/G3F6IYA3ZALZEGDHYDG7QWG3VR","json":"https://pith.science/pith/G3F6IYA3ZALZEGDHYDG7QWG3VR.json","graph_json":"https://pith.science/api/pith-number/G3F6IYA3ZALZEGDHYDG7QWG3VR/graph.json","events_json":"https://pith.science/api/pith-number/G3F6IYA3ZALZEGDHYDG7QWG3VR/events.json","paper":"https://pith.science/paper/G3F6IYA3"},"agent_actions":{"view_html":"https://pith.science/pith/G3F6IYA3ZALZEGDHYDG7QWG3VR","download_json":"https://pith.science/pith/G3F6IYA3ZALZEGDHYDG7QWG3VR.json","view_paper":"https://pith.science/paper/G3F6IYA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.07765&json=true","fetch_graph":"https://pith.science/api/pith-number/G3F6IYA3ZALZEGDHYDG7QWG3VR/graph.json","fetch_events":"https://pith.science/api/pith-number/G3F6IYA3ZALZEGDHYDG7QWG3VR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3F6IYA3ZALZEGDHYDG7QWG3VR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3F6IYA3ZALZEGDHYDG7QWG3VR/action/storage_attestation","attest_author":"https://pith.science/pith/G3F6IYA3ZALZEGDHYDG7QWG3VR/action/author_attestation","sign_citation":"https://pith.science/pith/G3F6IYA3ZALZEGDHYDG7QWG3VR/action/citation_signature","submit_replication":"https://pith.science/pith/G3F6IYA3ZALZEGDHYDG7QWG3VR/action/replication_record"}},"created_at":"2026-05-18T00:00:23.524166+00:00","updated_at":"2026-05-18T00:00:23.524166+00:00"}