{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MGJGTECZ2LA7XBLSJS2EIYYXSF","short_pith_number":"pith:MGJGTECZ","schema_version":"1.0","canonical_sha256":"6192699059d2c1fb85724cb44463179172b89e713f7a1f4d48235615941d4022","source":{"kind":"arxiv","id":"1109.2229","version":1},"attestation_state":"computed","paper":{"title":"A Learning Theory Approach to Non-Interactive Database Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Avrim Blum, Katrina Ligett","submitted_at":"2011-09-10T15:23:14Z","abstract_excerpt":"In this paper we demonstrate that, ignoring computational constraints, it is possible to privately release synthetic databases that are useful for large classes of queries -- much larger in size than the database itself. Specifically, we give a mechanism that privately releases synthetic data for a class of queries over a discrete domain with error that grows as a function of the size of the smallest net approximately representing the answers to that class of queries. We show that this in particular implies a mechanism for counting queries that gives error guarantees that grow only with the VC"},"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":"1109.2229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-10T15:23:14Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"2656b21294b49a1d724d67232103e4ee4018c1ab4edab4e3efff236b64dda33b","abstract_canon_sha256":"587ea86082ae3f3a2c1d7cbb2ac870f971591c082d475d688286ce50382db4a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:38.261906Z","signature_b64":"zVBOTpI3oAxxs9iIDjBl7eX6tBw1g34TzlcVI4R5+r8xIhywVHeicIvpQ4t9OwNj0qlW9KYMvsqeGAnia9vWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6192699059d2c1fb85724cb44463179172b89e713f7a1f4d48235615941d4022","last_reissued_at":"2026-05-18T04:13:38.261275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:38.261275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Learning Theory Approach to Non-Interactive Database Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Avrim Blum, Katrina Ligett","submitted_at":"2011-09-10T15:23:14Z","abstract_excerpt":"In this paper we demonstrate that, ignoring computational constraints, it is possible to privately release synthetic databases that are useful for large classes of queries -- much larger in size than the database itself. Specifically, we give a mechanism that privately releases synthetic data for a class of queries over a discrete domain with error that grows as a function of the size of the smallest net approximately representing the answers to that class of queries. We show that this in particular implies a mechanism for counting queries that gives error guarantees that grow only with the VC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2229","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":"1109.2229","created_at":"2026-05-18T04:13:38.261395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.2229v1","created_at":"2026-05-18T04:13:38.261395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2229","created_at":"2026-05-18T04:13:38.261395+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGJGTECZ2LA7","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGJGTECZ2LA7XBLS","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGJGTECZ","created_at":"2026-05-18T12:26:34.985390+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/MGJGTECZ2LA7XBLSJS2EIYYXSF","json":"https://pith.science/pith/MGJGTECZ2LA7XBLSJS2EIYYXSF.json","graph_json":"https://pith.science/api/pith-number/MGJGTECZ2LA7XBLSJS2EIYYXSF/graph.json","events_json":"https://pith.science/api/pith-number/MGJGTECZ2LA7XBLSJS2EIYYXSF/events.json","paper":"https://pith.science/paper/MGJGTECZ"},"agent_actions":{"view_html":"https://pith.science/pith/MGJGTECZ2LA7XBLSJS2EIYYXSF","download_json":"https://pith.science/pith/MGJGTECZ2LA7XBLSJS2EIYYXSF.json","view_paper":"https://pith.science/paper/MGJGTECZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.2229&json=true","fetch_graph":"https://pith.science/api/pith-number/MGJGTECZ2LA7XBLSJS2EIYYXSF/graph.json","fetch_events":"https://pith.science/api/pith-number/MGJGTECZ2LA7XBLSJS2EIYYXSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGJGTECZ2LA7XBLSJS2EIYYXSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGJGTECZ2LA7XBLSJS2EIYYXSF/action/storage_attestation","attest_author":"https://pith.science/pith/MGJGTECZ2LA7XBLSJS2EIYYXSF/action/author_attestation","sign_citation":"https://pith.science/pith/MGJGTECZ2LA7XBLSJS2EIYYXSF/action/citation_signature","submit_replication":"https://pith.science/pith/MGJGTECZ2LA7XBLSJS2EIYYXSF/action/replication_record"}},"created_at":"2026-05-18T04:13:38.261395+00:00","updated_at":"2026-05-18T04:13:38.261395+00:00"}