{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QOYYPOXPZXSJNTQYSUYCCMFJQL","short_pith_number":"pith:QOYYPOXP","schema_version":"1.0","canonical_sha256":"83b187baefcde496ce1895302130a982c93c0ae4acde3bf1467ebbdd87e7fe16","source":{"kind":"arxiv","id":"2402.16982","version":3},"attestation_state":"computed","paper":{"title":"Synthesizing Tight Privacy and Accuracy Bounds via Weighted Model Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CR","authors_text":"Alina Oprea, Lisa Oakley, Steven Holtzen","submitted_at":"2024-02-26T19:29:46Z","abstract_excerpt":"Programmatically generating tight differential privacy (DP) bounds is a hard problem. Two core challenges are (1) finding expressive, compact, and efficient encodings of the distributions of DP algorithms, and (2) state space explosion stemming from the multiple quantifiers and relational properties of the DP definition.\n  We address the first challenge by developing a method for tight privacy and accuracy bound synthesis using weighted model counting on binary decision diagrams, a state-of-the-art technique from the artificial intelligence and automated reasoning communities for exactly compu"},"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":"2402.16982","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2024-02-26T19:29:46Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"bd79436ac76735db78fd71f9043c07b1b3df59e208f4e89f4d55c9e87f53aff6","abstract_canon_sha256":"c3f5f2181e23b292b820ddc860df5d148ca473b3b18c92e7d03848571eaf260c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:14:18.236920Z","signature_b64":"KsrjS81JKRvb4SnHSuWzpZ2A0K2lSBzuNcuxzNmH/EM6JzaBE3mqfxZBKro4VbGOr8wmJDgESdPvRv9mFSqQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83b187baefcde496ce1895302130a982c93c0ae4acde3bf1467ebbdd87e7fe16","last_reissued_at":"2026-07-05T09:14:18.236448Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:14:18.236448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synthesizing Tight Privacy and Accuracy Bounds via Weighted Model Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CR","authors_text":"Alina Oprea, Lisa Oakley, Steven Holtzen","submitted_at":"2024-02-26T19:29:46Z","abstract_excerpt":"Programmatically generating tight differential privacy (DP) bounds is a hard problem. Two core challenges are (1) finding expressive, compact, and efficient encodings of the distributions of DP algorithms, and (2) state space explosion stemming from the multiple quantifiers and relational properties of the DP definition.\n  We address the first challenge by developing a method for tight privacy and accuracy bound synthesis using weighted model counting on binary decision diagrams, a state-of-the-art technique from the artificial intelligence and automated reasoning communities for exactly compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.16982","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/2402.16982/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":"2402.16982","created_at":"2026-07-05T09:14:18.236507+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.16982v3","created_at":"2026-07-05T09:14:18.236507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.16982","created_at":"2026-07-05T09:14:18.236507+00:00"},{"alias_kind":"pith_short_12","alias_value":"QOYYPOXPZXSJ","created_at":"2026-07-05T09:14:18.236507+00:00"},{"alias_kind":"pith_short_16","alias_value":"QOYYPOXPZXSJNTQY","created_at":"2026-07-05T09:14:18.236507+00:00"},{"alias_kind":"pith_short_8","alias_value":"QOYYPOXP","created_at":"2026-07-05T09:14:18.236507+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/QOYYPOXPZXSJNTQYSUYCCMFJQL","json":"https://pith.science/pith/QOYYPOXPZXSJNTQYSUYCCMFJQL.json","graph_json":"https://pith.science/api/pith-number/QOYYPOXPZXSJNTQYSUYCCMFJQL/graph.json","events_json":"https://pith.science/api/pith-number/QOYYPOXPZXSJNTQYSUYCCMFJQL/events.json","paper":"https://pith.science/paper/QOYYPOXP"},"agent_actions":{"view_html":"https://pith.science/pith/QOYYPOXPZXSJNTQYSUYCCMFJQL","download_json":"https://pith.science/pith/QOYYPOXPZXSJNTQYSUYCCMFJQL.json","view_paper":"https://pith.science/paper/QOYYPOXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.16982&json=true","fetch_graph":"https://pith.science/api/pith-number/QOYYPOXPZXSJNTQYSUYCCMFJQL/graph.json","fetch_events":"https://pith.science/api/pith-number/QOYYPOXPZXSJNTQYSUYCCMFJQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QOYYPOXPZXSJNTQYSUYCCMFJQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QOYYPOXPZXSJNTQYSUYCCMFJQL/action/storage_attestation","attest_author":"https://pith.science/pith/QOYYPOXPZXSJNTQYSUYCCMFJQL/action/author_attestation","sign_citation":"https://pith.science/pith/QOYYPOXPZXSJNTQYSUYCCMFJQL/action/citation_signature","submit_replication":"https://pith.science/pith/QOYYPOXPZXSJNTQYSUYCCMFJQL/action/replication_record"}},"created_at":"2026-07-05T09:14:18.236507+00:00","updated_at":"2026-07-05T09:14:18.236507+00:00"}