{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KJ6G4IFS4AQJM57BVIV5J6I2SW","short_pith_number":"pith:KJ6G4IFS","schema_version":"1.0","canonical_sha256":"527c6e20b2e0209677e1aa2bd4f91a958144a7de8ad9237654476343c31e20b0","source":{"kind":"arxiv","id":"1410.1228","version":2},"attestation_state":"computed","paper":{"title":"Interactive Fingerprinting Codes and the Hardness of Preventing False Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CR","authors_text":"Jonathan Ullman, Thomas Steinke","submitted_at":"2014-10-05T23:55:22Z","abstract_excerpt":"We show an essentially tight bound on the number of adaptively chosen statistical queries that a computationally efficient algorithm can answer accurately given $n$ samples from an unknown distribution. A statistical query asks for the expectation of a predicate over the underlying distribution, and an answer to a statistical query is accurate if it is \"close\" to the correct expectation over the distribution. This question was recently studied by Dwork et al., who showed how to answer $\\tilde{\\Omega}(n^2)$ queries efficiently, and also by Hardt and Ullman, who showed that answering $\\tilde{O}("},"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":"1410.1228","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-10-05T23:55:22Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"984ead79b9b420bbb8082bffbfc868dbb1197c857311d7c7174466499d1d7392","abstract_canon_sha256":"f340c6153e43cf56b3902b628f712b6e2b2fe34766acc56bdb4e82a278fe2e3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:45.278431Z","signature_b64":"dfgIX/aETFtrU60Px8nR/4ADMUACaRVI19cEOUywVC/ot/0ZwHlggdoYwJ5/jpTwVdJ3bYNqfhTqmwCXUGyGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"527c6e20b2e0209677e1aa2bd4f91a958144a7de8ad9237654476343c31e20b0","last_reissued_at":"2026-05-18T02:26:45.278022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:45.278022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interactive Fingerprinting Codes and the Hardness of Preventing False Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CR","authors_text":"Jonathan Ullman, Thomas Steinke","submitted_at":"2014-10-05T23:55:22Z","abstract_excerpt":"We show an essentially tight bound on the number of adaptively chosen statistical queries that a computationally efficient algorithm can answer accurately given $n$ samples from an unknown distribution. A statistical query asks for the expectation of a predicate over the underlying distribution, and an answer to a statistical query is accurate if it is \"close\" to the correct expectation over the distribution. This question was recently studied by Dwork et al., who showed how to answer $\\tilde{\\Omega}(n^2)$ queries efficiently, and also by Hardt and Ullman, who showed that answering $\\tilde{O}("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1228","kind":"arxiv","version":2},"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":"1410.1228","created_at":"2026-05-18T02:26:45.278091+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.1228v2","created_at":"2026-05-18T02:26:45.278091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1228","created_at":"2026-05-18T02:26:45.278091+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJ6G4IFS4AQJ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJ6G4IFS4AQJM57B","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJ6G4IFS","created_at":"2026-05-18T12:28:35.611951+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/KJ6G4IFS4AQJM57BVIV5J6I2SW","json":"https://pith.science/pith/KJ6G4IFS4AQJM57BVIV5J6I2SW.json","graph_json":"https://pith.science/api/pith-number/KJ6G4IFS4AQJM57BVIV5J6I2SW/graph.json","events_json":"https://pith.science/api/pith-number/KJ6G4IFS4AQJM57BVIV5J6I2SW/events.json","paper":"https://pith.science/paper/KJ6G4IFS"},"agent_actions":{"view_html":"https://pith.science/pith/KJ6G4IFS4AQJM57BVIV5J6I2SW","download_json":"https://pith.science/pith/KJ6G4IFS4AQJM57BVIV5J6I2SW.json","view_paper":"https://pith.science/paper/KJ6G4IFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.1228&json=true","fetch_graph":"https://pith.science/api/pith-number/KJ6G4IFS4AQJM57BVIV5J6I2SW/graph.json","fetch_events":"https://pith.science/api/pith-number/KJ6G4IFS4AQJM57BVIV5J6I2SW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJ6G4IFS4AQJM57BVIV5J6I2SW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJ6G4IFS4AQJM57BVIV5J6I2SW/action/storage_attestation","attest_author":"https://pith.science/pith/KJ6G4IFS4AQJM57BVIV5J6I2SW/action/author_attestation","sign_citation":"https://pith.science/pith/KJ6G4IFS4AQJM57BVIV5J6I2SW/action/citation_signature","submit_replication":"https://pith.science/pith/KJ6G4IFS4AQJM57BVIV5J6I2SW/action/replication_record"}},"created_at":"2026-05-18T02:26:45.278091+00:00","updated_at":"2026-05-18T02:26:45.278091+00:00"}