{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IGHPAZNFF6BDZ3JAJMRX6FHERT","short_pith_number":"pith:IGHPAZNF","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"},"canonical_sha256":"418ef065a52f823ced204b237f14e48cc57179d43134d571e83e9978fc340e9d","source":{"kind":"arxiv","id":"1505.00244","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00244","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00244v1","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00244","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"IGHPAZNFF6BD","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IGHPAZNFF6BDZ3JA","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IGHPAZNF","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IGHPAZNFF6BDZ3JAJMRX6FHERT","target":"record","payload":{"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"},"canonical_sha256":"418ef065a52f823ced204b237f14e48cc57179d43134d571e83e9978fc340e9d","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"},"source_kind":"arxiv","source_id":"1505.00244","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bn2ZHeSQstmHjnisCfb9x4tIVUZQ4dC3+O1t0scaAarFOpoMsnoM0OA1s9Tt6fT/8hYwk0fZATsqT//t4QhTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:27:19.370901Z"},"content_sha256":"df8b81facff6eaca808355410b75d5a811ab4f6be15a0e4fd7a6175296bc58d8","schema_version":"1.0","event_id":"sha256:df8b81facff6eaca808355410b75d5a811ab4f6be15a0e4fd7a6175296bc58d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IGHPAZNFF6BDZ3JAJMRX6FHERT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dcu7Ej1LV21t0t5PJIYDxVAhiHdOdBRT4+1c/iusE8udHXkiKbve8hTfJWnUfEK4ZI0qI6C8N6S0XFGyZhsyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:27:19.371243Z"},"content_sha256":"a5dbcc3d881647156e5278101da6797a3305702a301ffacdcb1b94cf42b89fbb","schema_version":"1.0","event_id":"sha256:a5dbcc3d881647156e5278101da6797a3305702a301ffacdcb1b94cf42b89fbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGHPAZNFF6BDZ3JAJMRX6FHERT/bundle.json","state_url":"https://pith.science/pith/IGHPAZNFF6BDZ3JAJMRX6FHERT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGHPAZNFF6BDZ3JAJMRX6FHERT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T15:27:19Z","links":{"resolver":"https://pith.science/pith/IGHPAZNFF6BDZ3JAJMRX6FHERT","bundle":"https://pith.science/pith/IGHPAZNFF6BDZ3JAJMRX6FHERT/bundle.json","state":"https://pith.science/pith/IGHPAZNFF6BDZ3JAJMRX6FHERT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGHPAZNFF6BDZ3JAJMRX6FHERT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IGHPAZNFF6BDZ3JAJMRX6FHERT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4bed5ae4f860205cb00abfa367603e14384d92519aa2270bdfb21189a21890cc","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-01T18:55:16Z","title_canon_sha256":"a475adad32d694466c05ce4a2095c4fd9efc67214b89a20b1332f8b87b573c3f"},"schema_version":"1.0","source":{"id":"1505.00244","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00244","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00244v1","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00244","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"IGHPAZNFF6BD","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IGHPAZNFF6BDZ3JA","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IGHPAZNF","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:a5dbcc3d881647156e5278101da6797a3305702a301ffacdcb1b94cf42b89fbb","target":"graph","created_at":"2026-05-18T02:17:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aleksandar Nikolov","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-01T18:55:16Z","title":"An Improved Private Mechanism for Small Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00244","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:df8b81facff6eaca808355410b75d5a811ab4f6be15a0e4fd7a6175296bc58d8","target":"record","created_at":"2026-05-18T02:17:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4bed5ae4f860205cb00abfa367603e14384d92519aa2270bdfb21189a21890cc","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-01T18:55:16Z","title_canon_sha256":"a475adad32d694466c05ce4a2095c4fd9efc67214b89a20b1332f8b87b573c3f"},"schema_version":"1.0","source":{"id":"1505.00244","kind":"arxiv","version":1}},"canonical_sha256":"418ef065a52f823ced204b237f14e48cc57179d43134d571e83e9978fc340e9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"418ef065a52f823ced204b237f14e48cc57179d43134d571e83e9978fc340e9d","first_computed_at":"2026-05-18T02:17:12.987947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:12.987947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wo4h5YJgRKz/BbrpEdTDyxYMr3/cD2GBWmX8HBZwvKptkq8qT1bqeBCVmV+65oLonUewb3I5apG2ng6xCTfhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:12.988674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00244","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df8b81facff6eaca808355410b75d5a811ab4f6be15a0e4fd7a6175296bc58d8","sha256:a5dbcc3d881647156e5278101da6797a3305702a301ffacdcb1b94cf42b89fbb"],"state_sha256":"4d6f0bdb16e46acef7c7ad1fa9a7f87af951a3e5ad6ea3e1f5492f1bca251d4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yf4IV2uW4QGC/H5IWKosAKqyIQSAgYiSmkUBGBdhM5gkqr4xhWWeEbCx51Jl/wcQPrzNo7z7MDgHkuy240SfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:27:19.373176Z","bundle_sha256":"8b373bb00b40cd774d343de4579f851dd568d7992d58adf50dae7582632bdcb3"}}