{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WB727RWWQYGABGEQGYPVOHSDT4","short_pith_number":"pith:WB727RWW","schema_version":"1.0","canonical_sha256":"b07fafc6d6860c009890361f571e439f208ae713edd0a73e167744402f70190a","source":{"kind":"arxiv","id":"1408.1655","version":1},"attestation_state":"computed","paper":{"title":"Preventing False Discovery in Interactive Data Analysis is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.LG","authors_text":"Jonathan Ullman, Moritz Hardt","submitted_at":"2014-08-06T17:39:56Z","abstract_excerpt":"We show that, under a standard hardness assumption, there is no computationally efficient algorithm that given $n$ samples from an unknown distribution can give valid answers to $n^{3+o(1)}$ adaptively chosen statistical queries. A statistical query asks for the expectation of a predicate over the underlying distribution, and an answer to a statistical query is valid if it is \"close\" to the correct expectation over the distribution.\n  Our result stands in stark contrast to the well known fact that exponentially many statistical queries can be answered validly and efficiently if the queries are"},"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":"1408.1655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-06T17:39:56Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"4062b654c84b120d54c0945242ba029f98d8591592e8f0d6acd609c6fded19db","abstract_canon_sha256":"4bba70d0f84e1424798b9b4c56e72d753204d2c50ee610d60fc91e82935bbba7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:40.005278Z","signature_b64":"/kxPisrWkmVCNZ6it9pyRbtXPrV74Og4Tl9kVmtoMs5W5p3ai3Ot6OBfoDYOSe5xJVyWmInS04i9TjK5VPGWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b07fafc6d6860c009890361f571e439f208ae713edd0a73e167744402f70190a","last_reissued_at":"2026-05-18T02:45:40.004645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:40.004645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Preventing False Discovery in Interactive Data Analysis is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.LG","authors_text":"Jonathan Ullman, Moritz Hardt","submitted_at":"2014-08-06T17:39:56Z","abstract_excerpt":"We show that, under a standard hardness assumption, there is no computationally efficient algorithm that given $n$ samples from an unknown distribution can give valid answers to $n^{3+o(1)}$ adaptively chosen statistical queries. A statistical query asks for the expectation of a predicate over the underlying distribution, and an answer to a statistical query is valid if it is \"close\" to the correct expectation over the distribution.\n  Our result stands in stark contrast to the well known fact that exponentially many statistical queries can be answered validly and efficiently if the queries are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1655","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":"1408.1655","created_at":"2026-05-18T02:45:40.004732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1655v1","created_at":"2026-05-18T02:45:40.004732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1655","created_at":"2026-05-18T02:45:40.004732+00:00"},{"alias_kind":"pith_short_12","alias_value":"WB727RWWQYGA","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WB727RWWQYGABGEQ","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WB727RWW","created_at":"2026-05-18T12:28:54.890064+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/WB727RWWQYGABGEQGYPVOHSDT4","json":"https://pith.science/pith/WB727RWWQYGABGEQGYPVOHSDT4.json","graph_json":"https://pith.science/api/pith-number/WB727RWWQYGABGEQGYPVOHSDT4/graph.json","events_json":"https://pith.science/api/pith-number/WB727RWWQYGABGEQGYPVOHSDT4/events.json","paper":"https://pith.science/paper/WB727RWW"},"agent_actions":{"view_html":"https://pith.science/pith/WB727RWWQYGABGEQGYPVOHSDT4","download_json":"https://pith.science/pith/WB727RWWQYGABGEQGYPVOHSDT4.json","view_paper":"https://pith.science/paper/WB727RWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1655&json=true","fetch_graph":"https://pith.science/api/pith-number/WB727RWWQYGABGEQGYPVOHSDT4/graph.json","fetch_events":"https://pith.science/api/pith-number/WB727RWWQYGABGEQGYPVOHSDT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WB727RWWQYGABGEQGYPVOHSDT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WB727RWWQYGABGEQGYPVOHSDT4/action/storage_attestation","attest_author":"https://pith.science/pith/WB727RWWQYGABGEQGYPVOHSDT4/action/author_attestation","sign_citation":"https://pith.science/pith/WB727RWWQYGABGEQGYPVOHSDT4/action/citation_signature","submit_replication":"https://pith.science/pith/WB727RWWQYGABGEQGYPVOHSDT4/action/replication_record"}},"created_at":"2026-05-18T02:45:40.004732+00:00","updated_at":"2026-05-18T02:45:40.004732+00:00"}