{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IGHPAZNFF6BDZ3JAJMRX6FHERT","short_pith_number":"pith:IGHPAZNF","schema_version":"1.0","canonical_sha256":"418ef065a52f823ced204b237f14e48cc57179d43134d571e83e9978fc340e9d","source":{"kind":"arxiv","id":"1505.00244","version":1},"attestation_state":"computed","paper":{"title":"An Improved Private Mechanism for Small Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Aleksandar Nikolov","submitted_at":"2015-05-01T18:55:16Z","abstract_excerpt":"We study the problem of answering a workload of linear queries $\\mathcal{Q}$, on a database of size at most $n = o(|\\mathcal{Q}|)$ drawn from a universe $\\mathcal{U}$ under the constraint of (approximate) differential privacy. Nikolov, Talwar, and Zhang~\\cite{NTZ} proposed an efficient mechanism that, for any given $\\mathcal{Q}$ and $n$, answers the queries with average error that is at most a factor polynomial in $\\log |\\mathcal{Q}|$ and $\\log |\\mathcal{U}|$ worse than the best possible. Here we improve on this guarantee and give a mechanism whose competitiveness ratio is at most polynomial i"},"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":"1505.00244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-01T18:55:16Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"a475adad32d694466c05ce4a2095c4fd9efc67214b89a20b1332f8b87b573c3f","abstract_canon_sha256":"4bed5ae4f860205cb00abfa367603e14384d92519aa2270bdfb21189a21890cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:12.988674Z","signature_b64":"wo4h5YJgRKz/BbrpEdTDyxYMr3/cD2GBWmX8HBZwvKptkq8qT1bqeBCVmV+65oLonUewb3I5apG2ng6xCTfhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"418ef065a52f823ced204b237f14e48cc57179d43134d571e83e9978fc340e9d","last_reissued_at":"2026-05-18T02:17:12.987947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:12.987947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Private Mechanism for Small Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Aleksandar Nikolov","submitted_at":"2015-05-01T18:55:16Z","abstract_excerpt":"We study the problem of answering a workload of linear queries $\\mathcal{Q}$, on a database of size at most $n = o(|\\mathcal{Q}|)$ drawn from a universe $\\mathcal{U}$ under the constraint of (approximate) differential privacy. Nikolov, Talwar, and Zhang~\\cite{NTZ} proposed an efficient mechanism that, for any given $\\mathcal{Q}$ and $n$, answers the queries with average error that is at most a factor polynomial in $\\log |\\mathcal{Q}|$ and $\\log |\\mathcal{U}|$ worse than the best possible. Here we improve on this guarantee and give a mechanism whose competitiveness ratio is at most polynomial i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00244","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":"1505.00244","created_at":"2026-05-18T02:17:12.988065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00244v1","created_at":"2026-05-18T02:17:12.988065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00244","created_at":"2026-05-18T02:17:12.988065+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGHPAZNFF6BD","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGHPAZNFF6BDZ3JA","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGHPAZNF","created_at":"2026-05-18T12:29:25.134429+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/IGHPAZNFF6BDZ3JAJMRX6FHERT","json":"https://pith.science/pith/IGHPAZNFF6BDZ3JAJMRX6FHERT.json","graph_json":"https://pith.science/api/pith-number/IGHPAZNFF6BDZ3JAJMRX6FHERT/graph.json","events_json":"https://pith.science/api/pith-number/IGHPAZNFF6BDZ3JAJMRX6FHERT/events.json","paper":"https://pith.science/paper/IGHPAZNF"},"agent_actions":{"view_html":"https://pith.science/pith/IGHPAZNFF6BDZ3JAJMRX6FHERT","download_json":"https://pith.science/pith/IGHPAZNFF6BDZ3JAJMRX6FHERT.json","view_paper":"https://pith.science/paper/IGHPAZNF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00244&json=true","fetch_graph":"https://pith.science/api/pith-number/IGHPAZNFF6BDZ3JAJMRX6FHERT/graph.json","fetch_events":"https://pith.science/api/pith-number/IGHPAZNFF6BDZ3JAJMRX6FHERT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGHPAZNFF6BDZ3JAJMRX6FHERT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGHPAZNFF6BDZ3JAJMRX6FHERT/action/storage_attestation","attest_author":"https://pith.science/pith/IGHPAZNFF6BDZ3JAJMRX6FHERT/action/author_attestation","sign_citation":"https://pith.science/pith/IGHPAZNFF6BDZ3JAJMRX6FHERT/action/citation_signature","submit_replication":"https://pith.science/pith/IGHPAZNFF6BDZ3JAJMRX6FHERT/action/replication_record"}},"created_at":"2026-05-18T02:17:12.988065+00:00","updated_at":"2026-05-18T02:17:12.988065+00:00"}