{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D3X2ZZMYTHC3QNEN2DOYWAURYU","short_pith_number":"pith:D3X2ZZMY","schema_version":"1.0","canonical_sha256":"1eeface59899c5b8348dd0dd8b0291c51be93a72573c9572b8279d4dc23b84f2","source":{"kind":"arxiv","id":"1401.0987","version":1},"attestation_state":"computed","paper":{"title":"Differentially Private Data Releasing for Smooth Queries with Synthetic Database Output","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DB","authors_text":"Chi Jin, Junliang Huang, Liwei Wang, Yiqiao Zhong, Ziteng Wang","submitted_at":"2014-01-06T05:12:01Z","abstract_excerpt":"We consider accurately answering smooth queries while preserving differential privacy. A query is said to be $K$-smooth if it is specified by a function defined on $[-1,1]^d$ whose partial derivatives up to order $K$ are all bounded. We develop an $\\epsilon$-differentially private mechanism for the class of $K$-smooth queries. The major advantage of the algorithm is that it outputs a synthetic database. In real applications, a synthetic database output is appealing. Our mechanism achieves an accuracy of $O (n^{-\\frac{K}{2d+K}}/\\epsilon )$, and runs in polynomial time. We also generalize the me"},"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":"1401.0987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-01-06T05:12:01Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"db8cafb244856749f4039d60c1d27f017126def9028a603da436b90c23ab3ba3","abstract_canon_sha256":"09eccb6acac4756b65dbb912e5ec1df4d9fe257e78265d71130875ae8f0bfedc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:11.291498Z","signature_b64":"GEQuAlI/ji+HapuJtq9BaqnlpGQvFeyjuKl03GzByRQjCPrIz4b8T+pAZ+dr8wo60gfIE1t2LuLepiD+29aQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1eeface59899c5b8348dd0dd8b0291c51be93a72573c9572b8279d4dc23b84f2","last_reissued_at":"2026-05-18T03:03:11.290640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:11.290640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentially Private Data Releasing for Smooth Queries with Synthetic Database Output","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DB","authors_text":"Chi Jin, Junliang Huang, Liwei Wang, Yiqiao Zhong, Ziteng Wang","submitted_at":"2014-01-06T05:12:01Z","abstract_excerpt":"We consider accurately answering smooth queries while preserving differential privacy. A query is said to be $K$-smooth if it is specified by a function defined on $[-1,1]^d$ whose partial derivatives up to order $K$ are all bounded. We develop an $\\epsilon$-differentially private mechanism for the class of $K$-smooth queries. The major advantage of the algorithm is that it outputs a synthetic database. In real applications, a synthetic database output is appealing. Our mechanism achieves an accuracy of $O (n^{-\\frac{K}{2d+K}}/\\epsilon )$, and runs in polynomial time. We also generalize the me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0987","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":"1401.0987","created_at":"2026-05-18T03:03:11.290790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.0987v1","created_at":"2026-05-18T03:03:11.290790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0987","created_at":"2026-05-18T03:03:11.290790+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3X2ZZMYTHC3","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3X2ZZMYTHC3QNEN","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3X2ZZMY","created_at":"2026-05-18T12:28:25.294606+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/D3X2ZZMYTHC3QNEN2DOYWAURYU","json":"https://pith.science/pith/D3X2ZZMYTHC3QNEN2DOYWAURYU.json","graph_json":"https://pith.science/api/pith-number/D3X2ZZMYTHC3QNEN2DOYWAURYU/graph.json","events_json":"https://pith.science/api/pith-number/D3X2ZZMYTHC3QNEN2DOYWAURYU/events.json","paper":"https://pith.science/paper/D3X2ZZMY"},"agent_actions":{"view_html":"https://pith.science/pith/D3X2ZZMYTHC3QNEN2DOYWAURYU","download_json":"https://pith.science/pith/D3X2ZZMYTHC3QNEN2DOYWAURYU.json","view_paper":"https://pith.science/paper/D3X2ZZMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.0987&json=true","fetch_graph":"https://pith.science/api/pith-number/D3X2ZZMYTHC3QNEN2DOYWAURYU/graph.json","fetch_events":"https://pith.science/api/pith-number/D3X2ZZMYTHC3QNEN2DOYWAURYU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3X2ZZMYTHC3QNEN2DOYWAURYU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3X2ZZMYTHC3QNEN2DOYWAURYU/action/storage_attestation","attest_author":"https://pith.science/pith/D3X2ZZMYTHC3QNEN2DOYWAURYU/action/author_attestation","sign_citation":"https://pith.science/pith/D3X2ZZMYTHC3QNEN2DOYWAURYU/action/citation_signature","submit_replication":"https://pith.science/pith/D3X2ZZMYTHC3QNEN2DOYWAURYU/action/replication_record"}},"created_at":"2026-05-18T03:03:11.290790+00:00","updated_at":"2026-05-18T03:03:11.290790+00:00"}