{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:2BRLRF6BNC6OHFU4SE5I2UEY54","short_pith_number":"pith:2BRLRF6B","canonical_record":{"source":{"id":"1011.1296","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-04T23:59:08Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"1a7929fa45a5b2fb4f617f6ba2add94884d9d8d116c81752467034635b54c136","abstract_canon_sha256":"c2bb0287275ea49f9b9f8051d9638069b85552b31277b820e3ea907d59c0e226"},"schema_version":"1.0"},"canonical_sha256":"d062b897c168bce3969c913a8d5098ef140bbe85a0850ad44527674403a29392","source":{"kind":"arxiv","id":"1011.1296","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1296","created_at":"2026-05-18T04:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1296v4","created_at":"2026-05-18T04:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1296","created_at":"2026-05-18T04:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"2BRLRF6BNC6O","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2BRLRF6BNC6OHFU4","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2BRLRF6B","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:2BRLRF6BNC6OHFU4SE5I2UEY54","target":"record","payload":{"canonical_record":{"source":{"id":"1011.1296","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-04T23:59:08Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"1a7929fa45a5b2fb4f617f6ba2add94884d9d8d116c81752467034635b54c136","abstract_canon_sha256":"c2bb0287275ea49f9b9f8051d9638069b85552b31277b820e3ea907d59c0e226"},"schema_version":"1.0"},"canonical_sha256":"d062b897c168bce3969c913a8d5098ef140bbe85a0850ad44527674403a29392","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:10.581721Z","signature_b64":"zLQYuNGnZyKLwnUgJdZv2T/BADjyoKM34twwblziQRMMEvikGm76tL9Xgi2p1SAoVYowDVdlUnnL0ADoJh/jDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d062b897c168bce3969c913a8d5098ef140bbe85a0850ad44527674403a29392","last_reissued_at":"2026-05-18T04:10:10.580893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:10.580893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.1296","source_version":4,"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:10:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6TLo1mVjbU66g5SkLO7ag6s19HiIP1IcJwERwLD+GUkh/u0ZeygGDmJlaMwWn5V0Xyc7nOTvCMYnMi1XYOfbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:23:56.145503Z"},"content_sha256":"fb30019a1432e9a3399d4acd899d278ee6bc58526ce79fc114b4a88c8b03645d","schema_version":"1.0","event_id":"sha256:fb30019a1432e9a3399d4acd899d278ee6bc58526ce79fc114b4a88c8b03645d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:2BRLRF6BNC6OHFU4SE5I2UEY54","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Privately Releasing Conjunctions and the Statistical Query Barrier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Anupam Gupta, Jonathan Ullman, Moritz Hardt","submitted_at":"2010-11-04T23:59:08Z","abstract_excerpt":"Suppose we would like to know all answers to a set of statistical queries C on a data set up to small error, but we can only access the data itself using statistical queries. A trivial solution is to exhaustively ask all queries in C. Can we do any better?\n  + We show that the number of statistical queries necessary and sufficient for this task is---up to polynomial factors---equal to the agnostic learning complexity of C in Kearns' statistical query (SQ) model. This gives a complete answer to the question when running time is not a concern.\n  + We then show that the problem can be solved effi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1296","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"},"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:10:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9kem4BC+x+6rNpKtrYUTJyPRYsXE/91r2n9VaD3vOhPDiNMRjmLnpGPaEwDFsVAfKG/MLBVPFlGR+6fTmWL9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:23:56.145939Z"},"content_sha256":"ae7cc1a912591219c1f93843a7e7dd7c7aa59730aaf13810009f91916635c768","schema_version":"1.0","event_id":"sha256:ae7cc1a912591219c1f93843a7e7dd7c7aa59730aaf13810009f91916635c768"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2BRLRF6BNC6OHFU4SE5I2UEY54/bundle.json","state_url":"https://pith.science/pith/2BRLRF6BNC6OHFU4SE5I2UEY54/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2BRLRF6BNC6OHFU4SE5I2UEY54/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-30T13:23:56Z","links":{"resolver":"https://pith.science/pith/2BRLRF6BNC6OHFU4SE5I2UEY54","bundle":"https://pith.science/pith/2BRLRF6BNC6OHFU4SE5I2UEY54/bundle.json","state":"https://pith.science/pith/2BRLRF6BNC6OHFU4SE5I2UEY54/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2BRLRF6BNC6OHFU4SE5I2UEY54/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:2BRLRF6BNC6OHFU4SE5I2UEY54","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":"c2bb0287275ea49f9b9f8051d9638069b85552b31277b820e3ea907d59c0e226","cross_cats_sorted":["cs.CR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-04T23:59:08Z","title_canon_sha256":"1a7929fa45a5b2fb4f617f6ba2add94884d9d8d116c81752467034635b54c136"},"schema_version":"1.0","source":{"id":"1011.1296","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1296","created_at":"2026-05-18T04:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1296v4","created_at":"2026-05-18T04:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1296","created_at":"2026-05-18T04:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"2BRLRF6BNC6O","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2BRLRF6BNC6OHFU4","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2BRLRF6B","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:ae7cc1a912591219c1f93843a7e7dd7c7aa59730aaf13810009f91916635c768","target":"graph","created_at":"2026-05-18T04:10:10Z","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":"Suppose we would like to know all answers to a set of statistical queries C on a data set up to small error, but we can only access the data itself using statistical queries. A trivial solution is to exhaustively ask all queries in C. Can we do any better?\n  + We show that the number of statistical queries necessary and sufficient for this task is---up to polynomial factors---equal to the agnostic learning complexity of C in Kearns' statistical query (SQ) model. This gives a complete answer to the question when running time is not a concern.\n  + We then show that the problem can be solved effi","authors_text":"Aaron Roth, Anupam Gupta, Jonathan Ullman, Moritz Hardt","cross_cats":["cs.CR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-04T23:59:08Z","title":"Privately Releasing Conjunctions and the Statistical Query Barrier"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1296","kind":"arxiv","version":4},"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:fb30019a1432e9a3399d4acd899d278ee6bc58526ce79fc114b4a88c8b03645d","target":"record","created_at":"2026-05-18T04:10:10Z","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":"c2bb0287275ea49f9b9f8051d9638069b85552b31277b820e3ea907d59c0e226","cross_cats_sorted":["cs.CR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-04T23:59:08Z","title_canon_sha256":"1a7929fa45a5b2fb4f617f6ba2add94884d9d8d116c81752467034635b54c136"},"schema_version":"1.0","source":{"id":"1011.1296","kind":"arxiv","version":4}},"canonical_sha256":"d062b897c168bce3969c913a8d5098ef140bbe85a0850ad44527674403a29392","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d062b897c168bce3969c913a8d5098ef140bbe85a0850ad44527674403a29392","first_computed_at":"2026-05-18T04:10:10.580893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:10.580893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zLQYuNGnZyKLwnUgJdZv2T/BADjyoKM34twwblziQRMMEvikGm76tL9Xgi2p1SAoVYowDVdlUnnL0ADoJh/jDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:10.581721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.1296","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb30019a1432e9a3399d4acd899d278ee6bc58526ce79fc114b4a88c8b03645d","sha256:ae7cc1a912591219c1f93843a7e7dd7c7aa59730aaf13810009f91916635c768"],"state_sha256":"b618f825e35d7e5bdbdeca09272564ad361ae61da0202e00435c530d76d88e0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oyR9il1mvo0yKaXirMBQzZKLB3kSkxjVfOI9Kklgi1/TvoqiHN0JkrmcLPsVgNk7T3HsUzv22hiAJCa1Sg07AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:23:56.148891Z","bundle_sha256":"d0cc0ee7d86d351cb62c3c977194979eb7a91ba47ce89ec265e05e61566d6414"}}