{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MGJGTECZ2LA7XBLSJS2EIYYXSF","short_pith_number":"pith:MGJGTECZ","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"},"canonical_sha256":"6192699059d2c1fb85724cb44463179172b89e713f7a1f4d48235615941d4022","source":{"kind":"arxiv","id":"1109.2229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2229","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2229v1","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2229","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"MGJGTECZ2LA7","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MGJGTECZ2LA7XBLS","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MGJGTECZ","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MGJGTECZ2LA7XBLSJS2EIYYXSF","target":"record","payload":{"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"},"canonical_sha256":"6192699059d2c1fb85724cb44463179172b89e713f7a1f4d48235615941d4022","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"},"source_kind":"arxiv","source_id":"1109.2229","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-18T04:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mnZegTAb6iu2S3k4HwpY1f/yyhN2vk25vKeTlBTYE+083Y3to9KHjJp7TQFSgEuijzbsVmqvop4EPsbxxVRWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:25:25.492728Z"},"content_sha256":"119756c9a4c06fe093680325ec834e039ec26679f8d2bc7298ff4aa1bd76606e","schema_version":"1.0","event_id":"sha256:119756c9a4c06fe093680325ec834e039ec26679f8d2bc7298ff4aa1bd76606e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MGJGTECZ2LA7XBLSJS2EIYYXSF","target":"graph","payload":{"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"},"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-18T04:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hp0SvzOH/JQ5Ziz9yjRocEjYom4V8vFk5QSMr4VcfMSeLSUCDcSnDCr6KMnzsIHKr64pFeFIJxGz5wqlbUbuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:25:25.493392Z"},"content_sha256":"fb1481e284c4e30b4cd5ac763000af13cb4d51ea13b083d88bb208027c3ff892","schema_version":"1.0","event_id":"sha256:fb1481e284c4e30b4cd5ac763000af13cb4d51ea13b083d88bb208027c3ff892"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGJGTECZ2LA7XBLSJS2EIYYXSF/bundle.json","state_url":"https://pith.science/pith/MGJGTECZ2LA7XBLSJS2EIYYXSF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGJGTECZ2LA7XBLSJS2EIYYXSF/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-30T08:25:25Z","links":{"resolver":"https://pith.science/pith/MGJGTECZ2LA7XBLSJS2EIYYXSF","bundle":"https://pith.science/pith/MGJGTECZ2LA7XBLSJS2EIYYXSF/bundle.json","state":"https://pith.science/pith/MGJGTECZ2LA7XBLSJS2EIYYXSF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGJGTECZ2LA7XBLSJS2EIYYXSF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MGJGTECZ2LA7XBLSJS2EIYYXSF","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":"587ea86082ae3f3a2c1d7cbb2ac870f971591c082d475d688286ce50382db4a9","cross_cats_sorted":["cs.CR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-10T15:23:14Z","title_canon_sha256":"2656b21294b49a1d724d67232103e4ee4018c1ab4edab4e3efff236b64dda33b"},"schema_version":"1.0","source":{"id":"1109.2229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2229","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2229v1","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2229","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"MGJGTECZ2LA7","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MGJGTECZ2LA7XBLS","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MGJGTECZ","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:fb1481e284c4e30b4cd5ac763000af13cb4d51ea13b083d88bb208027c3ff892","target":"graph","created_at":"2026-05-18T04:13:38Z","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":"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","authors_text":"Aaron Roth, Avrim Blum, Katrina Ligett","cross_cats":["cs.CR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-10T15:23:14Z","title":"A Learning Theory Approach to Non-Interactive Database Privacy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2229","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:119756c9a4c06fe093680325ec834e039ec26679f8d2bc7298ff4aa1bd76606e","target":"record","created_at":"2026-05-18T04:13:38Z","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":"587ea86082ae3f3a2c1d7cbb2ac870f971591c082d475d688286ce50382db4a9","cross_cats_sorted":["cs.CR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-10T15:23:14Z","title_canon_sha256":"2656b21294b49a1d724d67232103e4ee4018c1ab4edab4e3efff236b64dda33b"},"schema_version":"1.0","source":{"id":"1109.2229","kind":"arxiv","version":1}},"canonical_sha256":"6192699059d2c1fb85724cb44463179172b89e713f7a1f4d48235615941d4022","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6192699059d2c1fb85724cb44463179172b89e713f7a1f4d48235615941d4022","first_computed_at":"2026-05-18T04:13:38.261275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:38.261275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zVBOTpI3oAxxs9iIDjBl7eX6tBw1g34TzlcVI4R5+r8xIhywVHeicIvpQ4t9OwNj0qlW9KYMvsqeGAnia9vWDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:38.261906Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:119756c9a4c06fe093680325ec834e039ec26679f8d2bc7298ff4aa1bd76606e","sha256:fb1481e284c4e30b4cd5ac763000af13cb4d51ea13b083d88bb208027c3ff892"],"state_sha256":"c04485512314c3d7db2892b217365064a8999def969fc9e75fb84e8a3ba153ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFjeUwIvx57NfnBYtgX+9mbnj1mq3hJ25ivWKwzZU/yYJcVqnBd5eFu6sJoa9keEzgLsBIgRypnKjUCjWIYZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:25:25.496798Z","bundle_sha256":"8cf624cb19e9823b05c74c52f82c1ad143710d7cc8dcc22c5b272e5f223cc9df"}}