{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SF2ZZQLH3J33A7YGTNZGESJJMX","short_pith_number":"pith:SF2ZZQLH","schema_version":"1.0","canonical_sha256":"91759cc167da77b07f069b7262492965c5a12831537509170172b38862b369c8","source":{"kind":"arxiv","id":"1802.08908","version":1},"attestation_state":"computed","paper":{"title":"Scalable Private Learning with PATE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Ananth Raghunathan, Ilya Mironov, Kunal Talwar, Nicolas Papernot, Shuang Song, \\'Ulfar Erlingsson","submitted_at":"2018-02-24T20:39:51Z","abstract_excerpt":"The rapid adoption of machine learning has increased concerns about the privacy implications of machine learning models trained on sensitive data, such as medical records or other personal information. To address those concerns, one promising approach is Private Aggregation of Teacher Ensembles, or PATE, which transfers to a \"student\" model the knowledge of an ensemble of \"teacher\" models, with intuitive privacy provided by training teachers on disjoint data and strong privacy guaranteed by noisy aggregation of teachers' answers. However, PATE has so far been evaluated only on simple classific"},"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":"1802.08908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-24T20:39:51Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"0a5525f93278ddfe7558d2392a0f280cb442756391bf69e2c71a01446b20ccdf","abstract_canon_sha256":"d8ac7aeecdfcb1f27d94de3c1df5556df4920fe7b1bd3053123d4a1dd07f3dba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:36.076036Z","signature_b64":"qd7tKpWMX5PUWj1DzfDTp24pxVfD3VrZ7gQbIJ7oAX0I9ui+nzfxFHd8nCXiE4KqLIIuHx6fAO6PmWmmNkBBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91759cc167da77b07f069b7262492965c5a12831537509170172b38862b369c8","last_reissued_at":"2026-05-18T00:22:36.075506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:36.075506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Private Learning with PATE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Ananth Raghunathan, Ilya Mironov, Kunal Talwar, Nicolas Papernot, Shuang Song, \\'Ulfar Erlingsson","submitted_at":"2018-02-24T20:39:51Z","abstract_excerpt":"The rapid adoption of machine learning has increased concerns about the privacy implications of machine learning models trained on sensitive data, such as medical records or other personal information. To address those concerns, one promising approach is Private Aggregation of Teacher Ensembles, or PATE, which transfers to a \"student\" model the knowledge of an ensemble of \"teacher\" models, with intuitive privacy provided by training teachers on disjoint data and strong privacy guaranteed by noisy aggregation of teachers' answers. However, PATE has so far been evaluated only on simple classific"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08908","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":"1802.08908","created_at":"2026-05-18T00:22:36.075596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08908v1","created_at":"2026-05-18T00:22:36.075596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08908","created_at":"2026-05-18T00:22:36.075596+00:00"},{"alias_kind":"pith_short_12","alias_value":"SF2ZZQLH3J33","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SF2ZZQLH3J33A7YG","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SF2ZZQLH","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2604.15851","citing_title":"DPrivBench: Benchmarking LLMs' Reasoning for Differential Privacy","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2509.14594","citing_title":"SynBench: A Benchmark for Differentially Private Text Generation","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2604.15851","citing_title":"DPrivBench: Benchmarking LLMs' Reasoning for Differential Privacy","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SF2ZZQLH3J33A7YGTNZGESJJMX","json":"https://pith.science/pith/SF2ZZQLH3J33A7YGTNZGESJJMX.json","graph_json":"https://pith.science/api/pith-number/SF2ZZQLH3J33A7YGTNZGESJJMX/graph.json","events_json":"https://pith.science/api/pith-number/SF2ZZQLH3J33A7YGTNZGESJJMX/events.json","paper":"https://pith.science/paper/SF2ZZQLH"},"agent_actions":{"view_html":"https://pith.science/pith/SF2ZZQLH3J33A7YGTNZGESJJMX","download_json":"https://pith.science/pith/SF2ZZQLH3J33A7YGTNZGESJJMX.json","view_paper":"https://pith.science/paper/SF2ZZQLH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08908&json=true","fetch_graph":"https://pith.science/api/pith-number/SF2ZZQLH3J33A7YGTNZGESJJMX/graph.json","fetch_events":"https://pith.science/api/pith-number/SF2ZZQLH3J33A7YGTNZGESJJMX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SF2ZZQLH3J33A7YGTNZGESJJMX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SF2ZZQLH3J33A7YGTNZGESJJMX/action/storage_attestation","attest_author":"https://pith.science/pith/SF2ZZQLH3J33A7YGTNZGESJJMX/action/author_attestation","sign_citation":"https://pith.science/pith/SF2ZZQLH3J33A7YGTNZGESJJMX/action/citation_signature","submit_replication":"https://pith.science/pith/SF2ZZQLH3J33A7YGTNZGESJJMX/action/replication_record"}},"created_at":"2026-05-18T00:22:36.075596+00:00","updated_at":"2026-05-18T00:22:36.075596+00:00"}