{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WHVJAHATCLVWE2OY444J2IOK6O","short_pith_number":"pith:WHVJAHAT","schema_version":"1.0","canonical_sha256":"b1ea901c1312eb6269d8e7389d21caf3be2982948e356549653f30f55cf6b462","source":{"kind":"arxiv","id":"1201.1214","version":6},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.1214","created_at":"2026-05-18T01:09:07.405672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.1214v6","created_at":"2026-05-18T01:09:07.405672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1214","created_at":"2026-05-18T01:09:07.405672+00:00"},{"alias_kind":"pith_short_12","alias_value":"WHVJAHATCLVW","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WHVJAHATCLVWE2OY","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WHVJAHAT","created_at":"2026-05-18T12:27:25.539911+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/WHVJAHATCLVWE2OY444J2IOK6O","json":"https://pith.science/pith/WHVJAHATCLVWE2OY444J2IOK6O.json","graph_json":"https://pith.science/api/pith-number/WHVJAHATCLVWE2OY444J2IOK6O/graph.json","events_json":"https://pith.science/api/pith-number/WHVJAHATCLVWE2OY444J2IOK6O/events.json","paper":"https://pith.science/paper/WHVJAHAT"},"agent_actions":{"view_html":"https://pith.science/pith/WHVJAHATCLVWE2OY444J2IOK6O","download_json":"https://pith.science/pith/WHVJAHATCLVWE2OY444J2IOK6O.json","view_paper":"https://pith.science/paper/WHVJAHAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.1214&json=true","fetch_graph":"https://pith.science/api/pith-number/WHVJAHATCLVWE2OY444J2IOK6O/graph.json","fetch_events":"https://pith.science/api/pith-number/WHVJAHATCLVWE2OY444J2IOK6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WHVJAHATCLVWE2OY444J2IOK6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WHVJAHATCLVWE2OY444J2IOK6O/action/storage_attestation","attest_author":"https://pith.science/pith/WHVJAHATCLVWE2OY444J2IOK6O/action/author_attestation","sign_citation":"https://pith.science/pith/WHVJAHATCLVWE2OY444J2IOK6O/action/citation_signature","submit_replication":"https://pith.science/pith/WHVJAHATCLVWE2OY444J2IOK6O/action/replication_record"}},"created_at":"2026-05-18T01:09:07.405672+00:00","updated_at":"2026-05-18T01:09:07.405672+00:00"}