{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KWYP22HPPXJIEWNXZEAZ5NIB3D","short_pith_number":"pith:KWYP22HP","schema_version":"1.0","canonical_sha256":"55b0fd68ef7dd28259b7c9019eb501d8e493d8f014136085ae46f1ca95450c93","source":{"kind":"arxiv","id":"2408.07021","version":3},"attestation_state":"computed","paper":{"title":"Count on Your Elders: Laplace vs Gaussian Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Joel Daniel Andersson, Rasmus Pagh, Sahel Torkamani, Teresa Anna Steiner","submitted_at":"2024-08-13T16:36:33Z","abstract_excerpt":"In recent years, Gaussian noise has become a popular tool in differentially private algorithms, often replacing Laplace noise which dominated the early literature. Gaussian noise is the standard approach to $\\textit{approximate}$ differential privacy, often resulting in much higher utility than traditional (pure) differential privacy mechanisms. In this paper we argue that Laplace noise may in fact be preferable to Gaussian noise in many settings, in particular for $(\\varepsilon,\\delta)$-differential privacy when $\\delta$ is small. We consider two scenarios:\n  First, we consider the problem of"},"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":"2408.07021","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2024-08-13T16:36:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"28d8c901b78b6eb4e1ac43f91b4c97a11c65cdbf43826e3578a09cb51f72af97","abstract_canon_sha256":"7f7bfcf2ac6cec9b6d085674abf823a0004988735b40e9f83e12309d3945c34e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:36:47.586157Z","signature_b64":"rGZtW9PiWgv4N3QBY29m2lqp/8B7l3OQKA6lFvbXW2LVeW4lpkFAByW/WSpr6gCTmPtOpJwAjQmtyTDMT62kCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55b0fd68ef7dd28259b7c9019eb501d8e493d8f014136085ae46f1ca95450c93","last_reissued_at":"2026-07-05T09:36:47.585553Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:36:47.585553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Count on Your Elders: Laplace vs Gaussian Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Joel Daniel Andersson, Rasmus Pagh, Sahel Torkamani, Teresa Anna Steiner","submitted_at":"2024-08-13T16:36:33Z","abstract_excerpt":"In recent years, Gaussian noise has become a popular tool in differentially private algorithms, often replacing Laplace noise which dominated the early literature. Gaussian noise is the standard approach to $\\textit{approximate}$ differential privacy, often resulting in much higher utility than traditional (pure) differential privacy mechanisms. In this paper we argue that Laplace noise may in fact be preferable to Gaussian noise in many settings, in particular for $(\\varepsilon,\\delta)$-differential privacy when $\\delta$ is small. We consider two scenarios:\n  First, we consider the problem of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.07021","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/2408.07021/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":"2408.07021","created_at":"2026-07-05T09:36:47.585626+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.07021v3","created_at":"2026-07-05T09:36:47.585626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.07021","created_at":"2026-07-05T09:36:47.585626+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWYP22HPPXJI","created_at":"2026-07-05T09:36:47.585626+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWYP22HPPXJIEWNX","created_at":"2026-07-05T09:36:47.585626+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWYP22HP","created_at":"2026-07-05T09:36:47.585626+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00876","citing_title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00876","citing_title":"The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2606.11760","citing_title":"A Fast Gaussian Mechanism under Continual Observation, with Applications","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KWYP22HPPXJIEWNXZEAZ5NIB3D","json":"https://pith.science/pith/KWYP22HPPXJIEWNXZEAZ5NIB3D.json","graph_json":"https://pith.science/api/pith-number/KWYP22HPPXJIEWNXZEAZ5NIB3D/graph.json","events_json":"https://pith.science/api/pith-number/KWYP22HPPXJIEWNXZEAZ5NIB3D/events.json","paper":"https://pith.science/paper/KWYP22HP"},"agent_actions":{"view_html":"https://pith.science/pith/KWYP22HPPXJIEWNXZEAZ5NIB3D","download_json":"https://pith.science/pith/KWYP22HPPXJIEWNXZEAZ5NIB3D.json","view_paper":"https://pith.science/paper/KWYP22HP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.07021&json=true","fetch_graph":"https://pith.science/api/pith-number/KWYP22HPPXJIEWNXZEAZ5NIB3D/graph.json","fetch_events":"https://pith.science/api/pith-number/KWYP22HPPXJIEWNXZEAZ5NIB3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWYP22HPPXJIEWNXZEAZ5NIB3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWYP22HPPXJIEWNXZEAZ5NIB3D/action/storage_attestation","attest_author":"https://pith.science/pith/KWYP22HPPXJIEWNXZEAZ5NIB3D/action/author_attestation","sign_citation":"https://pith.science/pith/KWYP22HPPXJIEWNXZEAZ5NIB3D/action/citation_signature","submit_replication":"https://pith.science/pith/KWYP22HPPXJIEWNXZEAZ5NIB3D/action/replication_record"}},"created_at":"2026-07-05T09:36:47.585626+00:00","updated_at":"2026-07-05T09:36:47.585626+00:00"}