{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YYRR7R44OI4QGCGEQWLCSRTW6N","short_pith_number":"pith:YYRR7R44","schema_version":"1.0","canonical_sha256":"c6231fc79c72390308c48596294676f3429033ef3bf6e8237cac04e6699e568e","source":{"kind":"arxiv","id":"1507.06370","version":2},"attestation_state":"computed","paper":{"title":"Sum-of-Squares Lower Bounds for Sparse PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.ST","stat.CO","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Avi Wigderson, Tengyu Ma","submitted_at":"2015-07-23T01:50:43Z","abstract_excerpt":"This paper establishes a statistical versus computational trade-off for solving a basic high-dimensional machine learning problem via a basic convex relaxation method. Specifically, we consider the {\\em Sparse Principal Component Analysis} (Sparse PCA) problem, and the family of {\\em Sum-of-Squares} (SoS, aka Lasserre/Parillo) convex relaxations. It was well known that in large dimension $p$, a planted $k$-sparse unit vector can be {\\em in principle} detected using only $n \\approx k\\log p$ (Gaussian or Bernoulli) samples, but all {\\em efficient} (polynomial time) algorithms known require $n \\a"},"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":"1507.06370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-23T01:50:43Z","cross_cats_sorted":["cs.CC","math.ST","stat.CO","stat.ML","stat.TH"],"title_canon_sha256":"0e46492c0a2ebf6051784430e4bdb3d1f9e55abd75db13402d5d9841c79da0bc","abstract_canon_sha256":"1fe041f4837e6316fa30469f3f5883dd459c6e57e2172769012fd18c755cc770"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:53.854981Z","signature_b64":"PnAP5cAlg4V0uSDNfRnmCzTpHnfd961x8KVTRODopubqdME9lCD8wtEpsuf/zWTH3J64hN++IWc0T86gvM4FBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6231fc79c72390308c48596294676f3429033ef3bf6e8237cac04e6699e568e","last_reissued_at":"2026-05-18T01:29:53.854497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:53.854497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sum-of-Squares Lower Bounds for Sparse PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.ST","stat.CO","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Avi Wigderson, Tengyu Ma","submitted_at":"2015-07-23T01:50:43Z","abstract_excerpt":"This paper establishes a statistical versus computational trade-off for solving a basic high-dimensional machine learning problem via a basic convex relaxation method. Specifically, we consider the {\\em Sparse Principal Component Analysis} (Sparse PCA) problem, and the family of {\\em Sum-of-Squares} (SoS, aka Lasserre/Parillo) convex relaxations. It was well known that in large dimension $p$, a planted $k$-sparse unit vector can be {\\em in principle} detected using only $n \\approx k\\log p$ (Gaussian or Bernoulli) samples, but all {\\em efficient} (polynomial time) algorithms known require $n \\a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06370","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":"1507.06370","created_at":"2026-05-18T01:29:53.854574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06370v2","created_at":"2026-05-18T01:29:53.854574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06370","created_at":"2026-05-18T01:29:53.854574+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYRR7R44OI4Q","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYRR7R44OI4QGCGE","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYRR7R44","created_at":"2026-05-18T12:29:52.810259+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/YYRR7R44OI4QGCGEQWLCSRTW6N","json":"https://pith.science/pith/YYRR7R44OI4QGCGEQWLCSRTW6N.json","graph_json":"https://pith.science/api/pith-number/YYRR7R44OI4QGCGEQWLCSRTW6N/graph.json","events_json":"https://pith.science/api/pith-number/YYRR7R44OI4QGCGEQWLCSRTW6N/events.json","paper":"https://pith.science/paper/YYRR7R44"},"agent_actions":{"view_html":"https://pith.science/pith/YYRR7R44OI4QGCGEQWLCSRTW6N","download_json":"https://pith.science/pith/YYRR7R44OI4QGCGEQWLCSRTW6N.json","view_paper":"https://pith.science/paper/YYRR7R44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06370&json=true","fetch_graph":"https://pith.science/api/pith-number/YYRR7R44OI4QGCGEQWLCSRTW6N/graph.json","fetch_events":"https://pith.science/api/pith-number/YYRR7R44OI4QGCGEQWLCSRTW6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYRR7R44OI4QGCGEQWLCSRTW6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYRR7R44OI4QGCGEQWLCSRTW6N/action/storage_attestation","attest_author":"https://pith.science/pith/YYRR7R44OI4QGCGEQWLCSRTW6N/action/author_attestation","sign_citation":"https://pith.science/pith/YYRR7R44OI4QGCGEQWLCSRTW6N/action/citation_signature","submit_replication":"https://pith.science/pith/YYRR7R44OI4QGCGEQWLCSRTW6N/action/replication_record"}},"created_at":"2026-05-18T01:29:53.854574+00:00","updated_at":"2026-05-18T01:29:53.854574+00:00"}