{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WHVJAHATCLVWE2OY444J2IOK6O","short_pith_number":"pith:WHVJAHAT","canonical_record":{"source":{"id":"1201.1214","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-05T16:39:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"eeb14f3ebd8765ad706ff24101e257b0d6f2ac99c26ba11588e6c6428fc76eed","abstract_canon_sha256":"d156f3f9a00cd314d1435492997fcdf7bef7fc68f139e91bcbb50b4b6b504a93"},"schema_version":"1.0"},"canonical_sha256":"b1ea901c1312eb6269d8e7389d21caf3be2982948e356549653f30f55cf6b462","source":{"kind":"arxiv","id":"1201.1214","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1214","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1214v6","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1214","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"pith_short_12","alias_value":"WHVJAHATCLVW","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WHVJAHATCLVWE2OY","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WHVJAHAT","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WHVJAHATCLVWE2OY444J2IOK6O","target":"record","payload":{"canonical_record":{"source":{"id":"1201.1214","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-05T16:39:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"eeb14f3ebd8765ad706ff24101e257b0d6f2ac99c26ba11588e6c6428fc76eed","abstract_canon_sha256":"d156f3f9a00cd314d1435492997fcdf7bef7fc68f139e91bcbb50b4b6b504a93"},"schema_version":"1.0"},"canonical_sha256":"b1ea901c1312eb6269d8e7389d21caf3be2982948e356549653f30f55cf6b462","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:07.406153Z","signature_b64":"B2Gny2ivqoZp4DSOZDiZIpU79axn8iDmmiCdUeklfZahcLXkqybfN/1zWry/q9R1zMei5G//OQGH3kNTrxANCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1ea901c1312eb6269d8e7389d21caf3be2982948e356549653f30f55cf6b462","last_reissued_at":"2026-05-18T01:09:07.405593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:07.405593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.1214","source_version":6,"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-18T01:09:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8oBlsWAiPQzlyYcjxi5Vpn3XH4js/so32jLW9XXu2N11eO+wrIJ+x4RQOTwtEjVF984Jo7K5HhXK3saSdbQdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:23:25.823069Z"},"content_sha256":"3169e487fe12d3440be4c5879a91f923b3414c8c4ac64ad1a86ed1b2a0f35536","schema_version":"1.0","event_id":"sha256:3169e487fe12d3440be4c5879a91f923b3414c8c4ac64ad1a86ed1b2a0f35536"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WHVJAHATCLVWE2OY444J2IOK6O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Statistical Algorithms and a Lower Bound for Detecting Planted Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Elena Grigorescu, Lev Reyzin, Santosh Vempala, Vitaly Feldman, Ying Xiao","submitted_at":"2012-01-05T16:39:21Z","abstract_excerpt":"We introduce a framework for proving lower bounds on computational problems over distributions against algorithms that can be implemented using access to a statistical query oracle. For such algorithms, access to the input distribution is limited to obtaining an estimate of the expectation of any given function on a sample drawn randomly from the input distribution, rather than directly accessing samples. Most natural algorithms of interest in theory and in practice, e.g., moments-based methods, local search, standard iterative methods for convex optimization, MCMC and simulated annealing can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1214","kind":"arxiv","version":6},"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-18T01:09:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RAfgDTi2shf9LRNAI9wbwSGn+EDOKG5EYXozZ4u1UNe8YBhz7UWoVW68DHIulnrPknIV5myWH+hvr+5egQLYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:23:25.823775Z"},"content_sha256":"cb0dbb783828850698981a9b9ea328bfc58d001b62cfc8bb422676bb521c8fe1","schema_version":"1.0","event_id":"sha256:cb0dbb783828850698981a9b9ea328bfc58d001b62cfc8bb422676bb521c8fe1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHVJAHATCLVWE2OY444J2IOK6O/bundle.json","state_url":"https://pith.science/pith/WHVJAHATCLVWE2OY444J2IOK6O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHVJAHATCLVWE2OY444J2IOK6O/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-27T09:23:25Z","links":{"resolver":"https://pith.science/pith/WHVJAHATCLVWE2OY444J2IOK6O","bundle":"https://pith.science/pith/WHVJAHATCLVWE2OY444J2IOK6O/bundle.json","state":"https://pith.science/pith/WHVJAHATCLVWE2OY444J2IOK6O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHVJAHATCLVWE2OY444J2IOK6O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WHVJAHATCLVWE2OY444J2IOK6O","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":"d156f3f9a00cd314d1435492997fcdf7bef7fc68f139e91bcbb50b4b6b504a93","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-05T16:39:21Z","title_canon_sha256":"eeb14f3ebd8765ad706ff24101e257b0d6f2ac99c26ba11588e6c6428fc76eed"},"schema_version":"1.0","source":{"id":"1201.1214","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1214","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1214v6","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1214","created_at":"2026-05-18T01:09:07Z"},{"alias_kind":"pith_short_12","alias_value":"WHVJAHATCLVW","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WHVJAHATCLVWE2OY","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WHVJAHAT","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:cb0dbb783828850698981a9b9ea328bfc58d001b62cfc8bb422676bb521c8fe1","target":"graph","created_at":"2026-05-18T01:09:07Z","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 introduce a framework for proving lower bounds on computational problems over distributions against algorithms that can be implemented using access to a statistical query oracle. For such algorithms, access to the input distribution is limited to obtaining an estimate of the expectation of any given function on a sample drawn randomly from the input distribution, rather than directly accessing samples. Most natural algorithms of interest in theory and in practice, e.g., moments-based methods, local search, standard iterative methods for convex optimization, MCMC and simulated annealing can ","authors_text":"Elena Grigorescu, Lev Reyzin, Santosh Vempala, Vitaly Feldman, Ying Xiao","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-05T16:39:21Z","title":"Statistical Algorithms and a Lower Bound for Detecting Planted Clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1214","kind":"arxiv","version":6},"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:3169e487fe12d3440be4c5879a91f923b3414c8c4ac64ad1a86ed1b2a0f35536","target":"record","created_at":"2026-05-18T01:09:07Z","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":"d156f3f9a00cd314d1435492997fcdf7bef7fc68f139e91bcbb50b4b6b504a93","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-05T16:39:21Z","title_canon_sha256":"eeb14f3ebd8765ad706ff24101e257b0d6f2ac99c26ba11588e6c6428fc76eed"},"schema_version":"1.0","source":{"id":"1201.1214","kind":"arxiv","version":6}},"canonical_sha256":"b1ea901c1312eb6269d8e7389d21caf3be2982948e356549653f30f55cf6b462","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1ea901c1312eb6269d8e7389d21caf3be2982948e356549653f30f55cf6b462","first_computed_at":"2026-05-18T01:09:07.405593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:07.405593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B2Gny2ivqoZp4DSOZDiZIpU79axn8iDmmiCdUeklfZahcLXkqybfN/1zWry/q9R1zMei5G//OQGH3kNTrxANCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:07.406153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.1214","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3169e487fe12d3440be4c5879a91f923b3414c8c4ac64ad1a86ed1b2a0f35536","sha256:cb0dbb783828850698981a9b9ea328bfc58d001b62cfc8bb422676bb521c8fe1"],"state_sha256":"f81f2fc993527585317668cae5848a7ccedf04ae4f9a0c105d7e5c4da386f9d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YWAFBQxs2BXlZf3JhfjnPaXLCH9Fx6NOsjc0GP1RofrK4kaeEEFbaUZzH6Cti8FCSlr5LTnWGSYe9EfRV1WqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:23:25.828303Z","bundle_sha256":"0827bb3844209f019634f8a29f5d4bfa5ca9f2b79d46f2f97d4d9f426269cae4"}}