{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NPLJK3VBMCHVYPYPNT44XP5HM6","short_pith_number":"pith:NPLJK3VB","schema_version":"1.0","canonical_sha256":"6bd6956ea1608f5c3f0f6cf9cbbfa767bf82aebbd9afeadf8e0fb2d9a09776bf","source":{"kind":"arxiv","id":"1909.02481","version":1},"attestation_state":"computed","paper":{"title":"Duet: An Expressive Higher-order Language and Linear Type System for Statically Enforcing Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.PL","authors_text":"Alex Shan, Chike Abuah, David Darais, Dawn Song, Joseph P. Near, Lun Wang, Mu Zhang, Neel Somani, Nikhil Sharma, Pranav Gaddamadugu, Tim Stevens","submitted_at":"2019-09-05T15:35:07Z","abstract_excerpt":"During the past decade, differential privacy has become the gold standard for protecting the privacy of individuals. However, verifying that a particular program provides differential privacy often remains a manual task to be completed by an expert in the field. Language-based techniques have been proposed for fully automating proofs of differential privacy via type system design, however these results have lagged behind advances in differentially-private algorithms, leaving a noticeable gap in programs which can be automatically verified while also providing state-of-the-art bounds on privacy"},"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":"1909.02481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-09-05T15:35:07Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"d9d9827646a28c14cf7dd5260e900b5706ffbcef407412b016702e83e53225a1","abstract_canon_sha256":"903af6ded1474e5437de83d72511a150fb0313fc87029dd020c012aa1ac8aea1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:35.128463Z","signature_b64":"tvjKU1PJfAnG1vhNpSO9OgCcN5BaQSBe+fJoZy1oMrDzyOwmQRdbQX+wLnKY2JWrVFA+eY7hOHGhS+LGVIixAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bd6956ea1608f5c3f0f6cf9cbbfa767bf82aebbd9afeadf8e0fb2d9a09776bf","last_reissued_at":"2026-07-05T00:02:35.127904Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:35.127904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Duet: An Expressive Higher-order Language and Linear Type System for Statically Enforcing Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.PL","authors_text":"Alex Shan, Chike Abuah, David Darais, Dawn Song, Joseph P. Near, Lun Wang, Mu Zhang, Neel Somani, Nikhil Sharma, Pranav Gaddamadugu, Tim Stevens","submitted_at":"2019-09-05T15:35:07Z","abstract_excerpt":"During the past decade, differential privacy has become the gold standard for protecting the privacy of individuals. However, verifying that a particular program provides differential privacy often remains a manual task to be completed by an expert in the field. Language-based techniques have been proposed for fully automating proofs of differential privacy via type system design, however these results have lagged behind advances in differentially-private algorithms, leaving a noticeable gap in programs which can be automatically verified while also providing state-of-the-art bounds on privacy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.02481","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/1909.02481/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":"1909.02481","created_at":"2026-07-05T00:02:35.127974+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.02481v1","created_at":"2026-07-05T00:02:35.127974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.02481","created_at":"2026-07-05T00:02:35.127974+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPLJK3VBMCHV","created_at":"2026-07-05T00:02:35.127974+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPLJK3VBMCHVYPYP","created_at":"2026-07-05T00:02:35.127974+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPLJK3VB","created_at":"2026-07-05T00:02:35.127974+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/NPLJK3VBMCHVYPYPNT44XP5HM6","json":"https://pith.science/pith/NPLJK3VBMCHVYPYPNT44XP5HM6.json","graph_json":"https://pith.science/api/pith-number/NPLJK3VBMCHVYPYPNT44XP5HM6/graph.json","events_json":"https://pith.science/api/pith-number/NPLJK3VBMCHVYPYPNT44XP5HM6/events.json","paper":"https://pith.science/paper/NPLJK3VB"},"agent_actions":{"view_html":"https://pith.science/pith/NPLJK3VBMCHVYPYPNT44XP5HM6","download_json":"https://pith.science/pith/NPLJK3VBMCHVYPYPNT44XP5HM6.json","view_paper":"https://pith.science/paper/NPLJK3VB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.02481&json=true","fetch_graph":"https://pith.science/api/pith-number/NPLJK3VBMCHVYPYPNT44XP5HM6/graph.json","fetch_events":"https://pith.science/api/pith-number/NPLJK3VBMCHVYPYPNT44XP5HM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPLJK3VBMCHVYPYPNT44XP5HM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPLJK3VBMCHVYPYPNT44XP5HM6/action/storage_attestation","attest_author":"https://pith.science/pith/NPLJK3VBMCHVYPYPNT44XP5HM6/action/author_attestation","sign_citation":"https://pith.science/pith/NPLJK3VBMCHVYPYPNT44XP5HM6/action/citation_signature","submit_replication":"https://pith.science/pith/NPLJK3VBMCHVYPYPNT44XP5HM6/action/replication_record"}},"created_at":"2026-07-05T00:02:35.127974+00:00","updated_at":"2026-07-05T00:02:35.127974+00:00"}