{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KJ6G4IFS4AQJM57BVIV5J6I2SW","short_pith_number":"pith:KJ6G4IFS","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"},"canonical_sha256":"527c6e20b2e0209677e1aa2bd4f91a958144a7de8ad9237654476343c31e20b0","source":{"kind":"arxiv","id":"1410.1228","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1228","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1228v2","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1228","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"KJ6G4IFS4AQJ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KJ6G4IFS4AQJM57B","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KJ6G4IFS","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KJ6G4IFS4AQJM57BVIV5J6I2SW","target":"record","payload":{"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"},"canonical_sha256":"527c6e20b2e0209677e1aa2bd4f91a958144a7de8ad9237654476343c31e20b0","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"},"source_kind":"arxiv","source_id":"1410.1228","source_version":2,"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-18T02:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I+ULFVrxshcu4N0kxjnzDMlZFcYY9Tud9RUe0UteEkCazxUvTaot1NihFh6m+Fe8VBiMZ79jEXx0SK7N0HYhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:51:55.003742Z"},"content_sha256":"a67b382ca18f5573ee60c0a397c1e4c11287f81643a4e3e1bfac207f1f25873b","schema_version":"1.0","event_id":"sha256:a67b382ca18f5573ee60c0a397c1e4c11287f81643a4e3e1bfac207f1f25873b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KJ6G4IFS4AQJM57BVIV5J6I2SW","target":"graph","payload":{"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"},"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-18T02:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2koe4d4OOIb31416FkkTUV1xM3BLnyngmKhfaXR+74P6ddbrxlRr+Nzy+voy7jNqpe8aT+pOPnsdyl55xW8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:51:55.004191Z"},"content_sha256":"a0d523781102d384b64753c3bb5a6113232e939849cf25aa660ca790614a8e98","schema_version":"1.0","event_id":"sha256:a0d523781102d384b64753c3bb5a6113232e939849cf25aa660ca790614a8e98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJ6G4IFS4AQJM57BVIV5J6I2SW/bundle.json","state_url":"https://pith.science/pith/KJ6G4IFS4AQJM57BVIV5J6I2SW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJ6G4IFS4AQJM57BVIV5J6I2SW/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-06-05T03:51:55Z","links":{"resolver":"https://pith.science/pith/KJ6G4IFS4AQJM57BVIV5J6I2SW","bundle":"https://pith.science/pith/KJ6G4IFS4AQJM57BVIV5J6I2SW/bundle.json","state":"https://pith.science/pith/KJ6G4IFS4AQJM57BVIV5J6I2SW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJ6G4IFS4AQJM57BVIV5J6I2SW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KJ6G4IFS4AQJM57BVIV5J6I2SW","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":"f340c6153e43cf56b3902b628f712b6e2b2fe34766acc56bdb4e82a278fe2e3a","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-10-05T23:55:22Z","title_canon_sha256":"984ead79b9b420bbb8082bffbfc868dbb1197c857311d7c7174466499d1d7392"},"schema_version":"1.0","source":{"id":"1410.1228","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1228","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1228v2","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1228","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"KJ6G4IFS4AQJ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KJ6G4IFS4AQJM57B","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KJ6G4IFS","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:a0d523781102d384b64753c3bb5a6113232e939849cf25aa660ca790614a8e98","target":"graph","created_at":"2026-05-18T02:26:45Z","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":"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}(","authors_text":"Jonathan Ullman, Thomas Steinke","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-10-05T23:55:22Z","title":"Interactive Fingerprinting Codes and the Hardness of Preventing False Discovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1228","kind":"arxiv","version":2},"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:a67b382ca18f5573ee60c0a397c1e4c11287f81643a4e3e1bfac207f1f25873b","target":"record","created_at":"2026-05-18T02:26:45Z","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":"f340c6153e43cf56b3902b628f712b6e2b2fe34766acc56bdb4e82a278fe2e3a","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-10-05T23:55:22Z","title_canon_sha256":"984ead79b9b420bbb8082bffbfc868dbb1197c857311d7c7174466499d1d7392"},"schema_version":"1.0","source":{"id":"1410.1228","kind":"arxiv","version":2}},"canonical_sha256":"527c6e20b2e0209677e1aa2bd4f91a958144a7de8ad9237654476343c31e20b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"527c6e20b2e0209677e1aa2bd4f91a958144a7de8ad9237654476343c31e20b0","first_computed_at":"2026-05-18T02:26:45.278022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:45.278022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dfgIX/aETFtrU60Px8nR/4ADMUACaRVI19cEOUywVC/ot/0ZwHlggdoYwJ5/jpTwVdJ3bYNqfhTqmwCXUGyGAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:45.278431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.1228","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a67b382ca18f5573ee60c0a397c1e4c11287f81643a4e3e1bfac207f1f25873b","sha256:a0d523781102d384b64753c3bb5a6113232e939849cf25aa660ca790614a8e98"],"state_sha256":"beabe3a1aa0569fbbc4da5e68b38f7b0e2e98f41c9b949c251a3252d54da4693"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qjo1ZuVV0rvdUaVleFbNH6iImqNYBzEqHdw9DbF3b07iXpL4NLguQEFSXV4WDfuv+/DOHev2NHjfN6eeqEzbCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:51:55.007400Z","bundle_sha256":"a1070873f7461403d1d9c200e7c3362b758b047d1030d0b34f189f6b67e6e061"}}