{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XBJCKR5OKK5AL6IPX65TG3AM7T","short_pith_number":"pith:XBJCKR5O","schema_version":"1.0","canonical_sha256":"b8522547ae52ba05f90fbfbb336c0cfce6b81fecc85eb7ab5aec344c5b2c66d7","source":{"kind":"arxiv","id":"1607.00133","version":2},"attestation_state":"computed","paper":{"title":"Deep Learning with Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Andy Chu, H. Brendan McMahan, Ian Goodfellow, Ilya Mironov, Kunal Talwar, Li Zhang, Mart\\'in Abadi","submitted_at":"2016-07-01T07:29:10Z","abstract_excerpt":"Machine learning techniques based on neural networks are achieving remarkable results in a wide variety of domains. Often, the training of models requires large, representative datasets, which may be crowdsourced and contain sensitive information. The models should not expose private information in these datasets. Addressing this goal, we develop new algorithmic techniques for learning and a refined analysis of privacy costs within the framework of differential privacy. Our implementation and experiments demonstrate that we can train deep neural networks with non-convex objectives, under a mod"},"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":"1607.00133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-01T07:29:10Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"21beb119d8989125acd6d7707418cd22c4252a9c5c14520e80c4e9d2b7571b01","abstract_canon_sha256":"bb5889f244cf058871a3f8592b80502c08fa82201cb11da23c4a382e19d70f7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:54.425845Z","signature_b64":"PRYOVFdCilhbOaXfIgbXP89aHpY/7kfygF1zLTYYBclcdhOgaD9uFjX+mzpi6oa8nNYhaNOqtAhHU37TDqBIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8522547ae52ba05f90fbfbb336c0cfce6b81fecc85eb7ab5aec344c5b2c66d7","last_reissued_at":"2026-05-17T23:57:54.425153Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:54.425153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Learning with Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Andy Chu, H. Brendan McMahan, Ian Goodfellow, Ilya Mironov, Kunal Talwar, Li Zhang, Mart\\'in Abadi","submitted_at":"2016-07-01T07:29:10Z","abstract_excerpt":"Machine learning techniques based on neural networks are achieving remarkable results in a wide variety of domains. Often, the training of models requires large, representative datasets, which may be crowdsourced and contain sensitive information. The models should not expose private information in these datasets. Addressing this goal, we develop new algorithmic techniques for learning and a refined analysis of privacy costs within the framework of differential privacy. Our implementation and experiments demonstrate that we can train deep neural networks with non-convex objectives, under a mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00133","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.00133","created_at":"2026-05-17T23:57:54.425263+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00133v2","created_at":"2026-05-17T23:57:54.425263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00133","created_at":"2026-05-17T23:57:54.425263+00:00"},{"alias_kind":"pith_short_12","alias_value":"XBJCKR5OKK5A","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XBJCKR5OKK5AL6IP","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XBJCKR5O","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11857","citing_title":"Beyond Parameter Aggregation: Semantic Consensus for Federated Fine-Tuning of LLMs","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21571","citing_title":"Separable Expert Architecture: Toward Privacy-Preserving LLM Personalization via Composable Adapters and Deletable User Proxies","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XBJCKR5OKK5AL6IPX65TG3AM7T","json":"https://pith.science/pith/XBJCKR5OKK5AL6IPX65TG3AM7T.json","graph_json":"https://pith.science/api/pith-number/XBJCKR5OKK5AL6IPX65TG3AM7T/graph.json","events_json":"https://pith.science/api/pith-number/XBJCKR5OKK5AL6IPX65TG3AM7T/events.json","paper":"https://pith.science/paper/XBJCKR5O"},"agent_actions":{"view_html":"https://pith.science/pith/XBJCKR5OKK5AL6IPX65TG3AM7T","download_json":"https://pith.science/pith/XBJCKR5OKK5AL6IPX65TG3AM7T.json","view_paper":"https://pith.science/paper/XBJCKR5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00133&json=true","fetch_graph":"https://pith.science/api/pith-number/XBJCKR5OKK5AL6IPX65TG3AM7T/graph.json","fetch_events":"https://pith.science/api/pith-number/XBJCKR5OKK5AL6IPX65TG3AM7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XBJCKR5OKK5AL6IPX65TG3AM7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XBJCKR5OKK5AL6IPX65TG3AM7T/action/storage_attestation","attest_author":"https://pith.science/pith/XBJCKR5OKK5AL6IPX65TG3AM7T/action/author_attestation","sign_citation":"https://pith.science/pith/XBJCKR5OKK5AL6IPX65TG3AM7T/action/citation_signature","submit_replication":"https://pith.science/pith/XBJCKR5OKK5AL6IPX65TG3AM7T/action/replication_record"}},"created_at":"2026-05-17T23:57:54.425263+00:00","updated_at":"2026-05-17T23:57:54.425263+00:00"}