{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EGY2WJARA5RMKY5OFRSKK7MHY7","short_pith_number":"pith:EGY2WJAR","schema_version":"1.0","canonical_sha256":"21b1ab24110762c563ae2c64a57d87c7cc4363aaed7245476a8bc41d6ab4984c","source":{"kind":"arxiv","id":"2012.04117","version":3},"attestation_state":"computed","paper":{"title":"Local Dampening: Differential Privacy for Non-numeric Queries via Local Sensitivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Cheryl Flynn, Divesh Srivastava, Felipe T. Brito, Javam C. Machado, Subhabrata Majumdar, Victor A. E. Farias","submitted_at":"2020-12-07T23:51:19Z","abstract_excerpt":"Differential privacy is the state-of-the-art formal definition for data release under strong privacy guarantees. A variety of mechanisms have been proposed in the literature for releasing the output of numeric queries (e.g., the Laplace mechanism and smooth sensitivity mechanism). Those mechanisms guarantee differential privacy by adding noise to the true query's output. The amount of noise added is calibrated by the notions of global sensitivity and local sensitivity of the query that measure the impact of the addition or removal of an individual on the query's output. Mechanisms that use loc"},"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":"2012.04117","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2020-12-07T23:51:19Z","cross_cats_sorted":[],"title_canon_sha256":"c2e0f4d279564d2fe8a3d41b07d2a3f7e46d7be58ddbb8ae193a53ae3987479c","abstract_canon_sha256":"8615db011f82c2d6e13d794bf7f53a7f25a7ac085d9180d841a874a8625395a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:14:36.407595Z","signature_b64":"TBRCl1o60agOQIDz9UV+c0nFLJh8uC8Mj9a5L5cqDhYtK3aKWS4+4ux+W7+LSc0tnKSAsAfDs8KAhIGBXUV5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21b1ab24110762c563ae2c64a57d87c7cc4363aaed7245476a8bc41d6ab4984c","last_reissued_at":"2026-07-05T04:14:36.407036Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:14:36.407036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Dampening: Differential Privacy for Non-numeric Queries via Local Sensitivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Cheryl Flynn, Divesh Srivastava, Felipe T. Brito, Javam C. Machado, Subhabrata Majumdar, Victor A. E. Farias","submitted_at":"2020-12-07T23:51:19Z","abstract_excerpt":"Differential privacy is the state-of-the-art formal definition for data release under strong privacy guarantees. A variety of mechanisms have been proposed in the literature for releasing the output of numeric queries (e.g., the Laplace mechanism and smooth sensitivity mechanism). Those mechanisms guarantee differential privacy by adding noise to the true query's output. The amount of noise added is calibrated by the notions of global sensitivity and local sensitivity of the query that measure the impact of the addition or removal of an individual on the query's output. Mechanisms that use loc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.04117","kind":"arxiv","version":3},"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/2012.04117/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":"2012.04117","created_at":"2026-07-05T04:14:36.407160+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.04117v3","created_at":"2026-07-05T04:14:36.407160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.04117","created_at":"2026-07-05T04:14:36.407160+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGY2WJARA5RM","created_at":"2026-07-05T04:14:36.407160+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGY2WJARA5RMKY5O","created_at":"2026-07-05T04:14:36.407160+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGY2WJAR","created_at":"2026-07-05T04:14:36.407160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.20828","citing_title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EGY2WJARA5RMKY5OFRSKK7MHY7","json":"https://pith.science/pith/EGY2WJARA5RMKY5OFRSKK7MHY7.json","graph_json":"https://pith.science/api/pith-number/EGY2WJARA5RMKY5OFRSKK7MHY7/graph.json","events_json":"https://pith.science/api/pith-number/EGY2WJARA5RMKY5OFRSKK7MHY7/events.json","paper":"https://pith.science/paper/EGY2WJAR"},"agent_actions":{"view_html":"https://pith.science/pith/EGY2WJARA5RMKY5OFRSKK7MHY7","download_json":"https://pith.science/pith/EGY2WJARA5RMKY5OFRSKK7MHY7.json","view_paper":"https://pith.science/paper/EGY2WJAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.04117&json=true","fetch_graph":"https://pith.science/api/pith-number/EGY2WJARA5RMKY5OFRSKK7MHY7/graph.json","fetch_events":"https://pith.science/api/pith-number/EGY2WJARA5RMKY5OFRSKK7MHY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGY2WJARA5RMKY5OFRSKK7MHY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGY2WJARA5RMKY5OFRSKK7MHY7/action/storage_attestation","attest_author":"https://pith.science/pith/EGY2WJARA5RMKY5OFRSKK7MHY7/action/author_attestation","sign_citation":"https://pith.science/pith/EGY2WJARA5RMKY5OFRSKK7MHY7/action/citation_signature","submit_replication":"https://pith.science/pith/EGY2WJARA5RMKY5OFRSKK7MHY7/action/replication_record"}},"created_at":"2026-07-05T04:14:36.407160+00:00","updated_at":"2026-07-05T04:14:36.407160+00:00"}