{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:B5ZN5IR64G5IVCG6VYFIYV2VZM","short_pith_number":"pith:B5ZN5IR6","schema_version":"1.0","canonical_sha256":"0f72dea23ee1ba8a88deae0a8c5755cb14825e0709d86e201ada395a2c0351d7","source":{"kind":"arxiv","id":"1202.3399","version":4},"attestation_state":"computed","paper":{"title":"Optimal error of query sets under the differentially-private matrix mechanism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DB","authors_text":"Chao Li, Gerome Miklau","submitted_at":"2012-02-15T18:24:04Z","abstract_excerpt":"A common goal of privacy research is to release synthetic data that satisfies a formal privacy guarantee and can be used by an analyst in place of the original data. To achieve reasonable accuracy, a synthetic data set must be tuned to support a specified set of queries accurately, sacrificing fidelity for other queries.\n  This work considers methods for producing synthetic data under differential privacy and investigates what makes a set of queries \"easy\" or \"hard\" to answer. We consider answering sets of linear counting queries using the matrix mechanism, a recent differentially-private mech"},"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":"1202.3399","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-02-15T18:24:04Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"0667581412b13bc0a9a4ad2770faa9b69642ab125157df726e1ad1c5c0eaed94","abstract_canon_sha256":"26d7d6068fed209f5862315b5f217dedc0bd4d7c201483e766fb11fddac7b5ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:17.825086Z","signature_b64":"Bg9EZcu2QjeICffxrJ/vYmfXulMmdeGHbNMyWi4SyAOu9WKz1FC0eb2KqnrfLMAyC/wm67vqsgqU5q0LWtfJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f72dea23ee1ba8a88deae0a8c5755cb14825e0709d86e201ada395a2c0351d7","last_reissued_at":"2026-05-18T02:21:17.824295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:17.824295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal error of query sets under the differentially-private matrix mechanism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DB","authors_text":"Chao Li, Gerome Miklau","submitted_at":"2012-02-15T18:24:04Z","abstract_excerpt":"A common goal of privacy research is to release synthetic data that satisfies a formal privacy guarantee and can be used by an analyst in place of the original data. To achieve reasonable accuracy, a synthetic data set must be tuned to support a specified set of queries accurately, sacrificing fidelity for other queries.\n  This work considers methods for producing synthetic data under differential privacy and investigates what makes a set of queries \"easy\" or \"hard\" to answer. We consider answering sets of linear counting queries using the matrix mechanism, a recent differentially-private mech"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3399","kind":"arxiv","version":4},"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":"1202.3399","created_at":"2026-05-18T02:21:17.824461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3399v4","created_at":"2026-05-18T02:21:17.824461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3399","created_at":"2026-05-18T02:21:17.824461+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5ZN5IR64G5I","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5ZN5IR64G5IVCG6","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5ZN5IR6","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.02159","citing_title":"Capacity Bounded Differential Privacy","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B5ZN5IR64G5IVCG6VYFIYV2VZM","json":"https://pith.science/pith/B5ZN5IR64G5IVCG6VYFIYV2VZM.json","graph_json":"https://pith.science/api/pith-number/B5ZN5IR64G5IVCG6VYFIYV2VZM/graph.json","events_json":"https://pith.science/api/pith-number/B5ZN5IR64G5IVCG6VYFIYV2VZM/events.json","paper":"https://pith.science/paper/B5ZN5IR6"},"agent_actions":{"view_html":"https://pith.science/pith/B5ZN5IR64G5IVCG6VYFIYV2VZM","download_json":"https://pith.science/pith/B5ZN5IR64G5IVCG6VYFIYV2VZM.json","view_paper":"https://pith.science/paper/B5ZN5IR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3399&json=true","fetch_graph":"https://pith.science/api/pith-number/B5ZN5IR64G5IVCG6VYFIYV2VZM/graph.json","fetch_events":"https://pith.science/api/pith-number/B5ZN5IR64G5IVCG6VYFIYV2VZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5ZN5IR64G5IVCG6VYFIYV2VZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5ZN5IR64G5IVCG6VYFIYV2VZM/action/storage_attestation","attest_author":"https://pith.science/pith/B5ZN5IR64G5IVCG6VYFIYV2VZM/action/author_attestation","sign_citation":"https://pith.science/pith/B5ZN5IR64G5IVCG6VYFIYV2VZM/action/citation_signature","submit_replication":"https://pith.science/pith/B5ZN5IR64G5IVCG6VYFIYV2VZM/action/replication_record"}},"created_at":"2026-05-18T02:21:17.824461+00:00","updated_at":"2026-05-18T02:21:17.824461+00:00"}