{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2BRLRF6BNC6OHFU4SE5I2UEY54","short_pith_number":"pith:2BRLRF6B","schema_version":"1.0","canonical_sha256":"d062b897c168bce3969c913a8d5098ef140bbe85a0850ad44527674403a29392","source":{"kind":"arxiv","id":"1011.1296","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.1296","created_at":"2026-05-18T04:10:10.581041+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.1296v4","created_at":"2026-05-18T04:10:10.581041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1296","created_at":"2026-05-18T04:10:10.581041+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BRLRF6BNC6O","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BRLRF6BNC6OHFU4","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BRLRF6B","created_at":"2026-05-18T12:26:03.138858+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/2BRLRF6BNC6OHFU4SE5I2UEY54","json":"https://pith.science/pith/2BRLRF6BNC6OHFU4SE5I2UEY54.json","graph_json":"https://pith.science/api/pith-number/2BRLRF6BNC6OHFU4SE5I2UEY54/graph.json","events_json":"https://pith.science/api/pith-number/2BRLRF6BNC6OHFU4SE5I2UEY54/events.json","paper":"https://pith.science/paper/2BRLRF6B"},"agent_actions":{"view_html":"https://pith.science/pith/2BRLRF6BNC6OHFU4SE5I2UEY54","download_json":"https://pith.science/pith/2BRLRF6BNC6OHFU4SE5I2UEY54.json","view_paper":"https://pith.science/paper/2BRLRF6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.1296&json=true","fetch_graph":"https://pith.science/api/pith-number/2BRLRF6BNC6OHFU4SE5I2UEY54/graph.json","fetch_events":"https://pith.science/api/pith-number/2BRLRF6BNC6OHFU4SE5I2UEY54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BRLRF6BNC6OHFU4SE5I2UEY54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BRLRF6BNC6OHFU4SE5I2UEY54/action/storage_attestation","attest_author":"https://pith.science/pith/2BRLRF6BNC6OHFU4SE5I2UEY54/action/author_attestation","sign_citation":"https://pith.science/pith/2BRLRF6BNC6OHFU4SE5I2UEY54/action/citation_signature","submit_replication":"https://pith.science/pith/2BRLRF6BNC6OHFU4SE5I2UEY54/action/replication_record"}},"created_at":"2026-05-18T04:10:10.581041+00:00","updated_at":"2026-05-18T04:10:10.581041+00:00"}