{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4KML2FLYVFUKIEKVYBNZ5IH3ZK","short_pith_number":"pith:4KML2FLY","schema_version":"1.0","canonical_sha256":"e298bd1578a968a41155c05b9ea0fbca891412ce855b1cc4489bf1b005f4f993","source":{"kind":"arxiv","id":"2009.03106","version":1},"attestation_state":"computed","paper":{"title":"Scaling up Differentially Private Deep Learning with Fast Per-Example Gradient Clipping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Kifer, Jaewoo Lee","submitted_at":"2020-09-07T13:51:26Z","abstract_excerpt":"Recent work on Renyi Differential Privacy has shown the feasibility of applying differential privacy to deep learning tasks. Despite their promise, however, differentially private deep networks often lag far behind their non-private counterparts in accuracy, showing the need for more research in model architectures, optimizers, etc. One of the barriers to this expanded research is the training time -- often orders of magnitude larger than training non-private networks. The reason for this slowdown is a crucial privacy-related step called \"per-example gradient clipping\" whose naive implementati"},"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":"2009.03106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-07T13:51:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c1c3dc81db1d8ccafbea553a036a4a346252323146e2e1e0ac8c2dc4392941e5","abstract_canon_sha256":"54e09a287906abc575b40e5d900f83d15af313e584ba83689b7d0bf027838303"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:33:29.067407Z","signature_b64":"WMpOdwZMOcDHghsLXuPRMsCFQUyqzbpYxkgGIF9WyXAhKICvin8gNdKLKNE7M0NjPDcrsfplPqn4xxaMI/vgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e298bd1578a968a41155c05b9ea0fbca891412ce855b1cc4489bf1b005f4f993","last_reissued_at":"2026-07-05T01:33:29.066992Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:33:29.066992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling up Differentially Private Deep Learning with Fast Per-Example Gradient Clipping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Kifer, Jaewoo Lee","submitted_at":"2020-09-07T13:51:26Z","abstract_excerpt":"Recent work on Renyi Differential Privacy has shown the feasibility of applying differential privacy to deep learning tasks. Despite their promise, however, differentially private deep networks often lag far behind their non-private counterparts in accuracy, showing the need for more research in model architectures, optimizers, etc. One of the barriers to this expanded research is the training time -- often orders of magnitude larger than training non-private networks. The reason for this slowdown is a crucial privacy-related step called \"per-example gradient clipping\" whose naive implementati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.03106","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.03106/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2009.03106","created_at":"2026-07-05T01:33:29.067056+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.03106v1","created_at":"2026-07-05T01:33:29.067056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.03106","created_at":"2026-07-05T01:33:29.067056+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KML2FLYVFUK","created_at":"2026-07-05T01:33:29.067056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KML2FLYVFUKIEKV","created_at":"2026-07-05T01:33:29.067056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KML2FLY","created_at":"2026-07-05T01:33:29.067056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.01154","citing_title":"FlashDP: Private Training Large Language Models with Efficient DP-SGD","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4KML2FLYVFUKIEKVYBNZ5IH3ZK","json":"https://pith.science/pith/4KML2FLYVFUKIEKVYBNZ5IH3ZK.json","graph_json":"https://pith.science/api/pith-number/4KML2FLYVFUKIEKVYBNZ5IH3ZK/graph.json","events_json":"https://pith.science/api/pith-number/4KML2FLYVFUKIEKVYBNZ5IH3ZK/events.json","paper":"https://pith.science/paper/4KML2FLY"},"agent_actions":{"view_html":"https://pith.science/pith/4KML2FLYVFUKIEKVYBNZ5IH3ZK","download_json":"https://pith.science/pith/4KML2FLYVFUKIEKVYBNZ5IH3ZK.json","view_paper":"https://pith.science/paper/4KML2FLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.03106&json=true","fetch_graph":"https://pith.science/api/pith-number/4KML2FLYVFUKIEKVYBNZ5IH3ZK/graph.json","fetch_events":"https://pith.science/api/pith-number/4KML2FLYVFUKIEKVYBNZ5IH3ZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KML2FLYVFUKIEKVYBNZ5IH3ZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KML2FLYVFUKIEKVYBNZ5IH3ZK/action/storage_attestation","attest_author":"https://pith.science/pith/4KML2FLYVFUKIEKVYBNZ5IH3ZK/action/author_attestation","sign_citation":"https://pith.science/pith/4KML2FLYVFUKIEKVYBNZ5IH3ZK/action/citation_signature","submit_replication":"https://pith.science/pith/4KML2FLYVFUKIEKVYBNZ5IH3ZK/action/replication_record"}},"created_at":"2026-07-05T01:33:29.067056+00:00","updated_at":"2026-07-05T01:33:29.067056+00:00"}