{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YYRR7R44OI4QGCGEQWLCSRTW6N","short_pith_number":"pith:YYRR7R44","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"},"canonical_sha256":"c6231fc79c72390308c48596294676f3429033ef3bf6e8237cac04e6699e568e","source":{"kind":"arxiv","id":"1507.06370","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06370","created_at":"2026-05-18T01:29:53Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06370v2","created_at":"2026-05-18T01:29:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06370","created_at":"2026-05-18T01:29:53Z"},{"alias_kind":"pith_short_12","alias_value":"YYRR7R44OI4Q","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YYRR7R44OI4QGCGE","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YYRR7R44","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YYRR7R44OI4QGCGEQWLCSRTW6N","target":"record","payload":{"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"},"canonical_sha256":"c6231fc79c72390308c48596294676f3429033ef3bf6e8237cac04e6699e568e","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"},"source_kind":"arxiv","source_id":"1507.06370","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-18T01:29:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cW5/HVvYoqsv1EBQD7tzJXKRcd9fsFSLDzn4QitKKPzo3WjX/mM1Mgel/ddoN1BHQ8yyCtznQBI6rzksTM8FCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:36:06.665565Z"},"content_sha256":"8f7eed0683ad32356b2a3c5516875c9006e43dcac1ab6e55aeaa6565bf6f8af2","schema_version":"1.0","event_id":"sha256:8f7eed0683ad32356b2a3c5516875c9006e43dcac1ab6e55aeaa6565bf6f8af2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YYRR7R44OI4QGCGEQWLCSRTW6N","target":"graph","payload":{"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"},"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:29:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4cd0ngSaQROsmZ0CeHOTyXlqs2xOjsAUaCc2cpLx9SV9/gf2iPjYBsWYzpPISK2NEPFtKZXiEbDuIwiyVpUrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:36:06.665919Z"},"content_sha256":"e33b95a7f80debc030048f776bcbb1c58bf5efae8a5424dc7fb4784037f71592","schema_version":"1.0","event_id":"sha256:e33b95a7f80debc030048f776bcbb1c58bf5efae8a5424dc7fb4784037f71592"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YYRR7R44OI4QGCGEQWLCSRTW6N/bundle.json","state_url":"https://pith.science/pith/YYRR7R44OI4QGCGEQWLCSRTW6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YYRR7R44OI4QGCGEQWLCSRTW6N/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-03T17:36:06Z","links":{"resolver":"https://pith.science/pith/YYRR7R44OI4QGCGEQWLCSRTW6N","bundle":"https://pith.science/pith/YYRR7R44OI4QGCGEQWLCSRTW6N/bundle.json","state":"https://pith.science/pith/YYRR7R44OI4QGCGEQWLCSRTW6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YYRR7R44OI4QGCGEQWLCSRTW6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YYRR7R44OI4QGCGEQWLCSRTW6N","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":"1fe041f4837e6316fa30469f3f5883dd459c6e57e2172769012fd18c755cc770","cross_cats_sorted":["cs.CC","math.ST","stat.CO","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-23T01:50:43Z","title_canon_sha256":"0e46492c0a2ebf6051784430e4bdb3d1f9e55abd75db13402d5d9841c79da0bc"},"schema_version":"1.0","source":{"id":"1507.06370","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06370","created_at":"2026-05-18T01:29:53Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06370v2","created_at":"2026-05-18T01:29:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06370","created_at":"2026-05-18T01:29:53Z"},{"alias_kind":"pith_short_12","alias_value":"YYRR7R44OI4Q","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YYRR7R44OI4QGCGE","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YYRR7R44","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:e33b95a7f80debc030048f776bcbb1c58bf5efae8a5424dc7fb4784037f71592","target":"graph","created_at":"2026-05-18T01:29:53Z","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":"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","authors_text":"Avi Wigderson, Tengyu Ma","cross_cats":["cs.CC","math.ST","stat.CO","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-23T01:50:43Z","title":"Sum-of-Squares Lower Bounds for Sparse PCA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06370","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:8f7eed0683ad32356b2a3c5516875c9006e43dcac1ab6e55aeaa6565bf6f8af2","target":"record","created_at":"2026-05-18T01:29:53Z","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":"1fe041f4837e6316fa30469f3f5883dd459c6e57e2172769012fd18c755cc770","cross_cats_sorted":["cs.CC","math.ST","stat.CO","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-23T01:50:43Z","title_canon_sha256":"0e46492c0a2ebf6051784430e4bdb3d1f9e55abd75db13402d5d9841c79da0bc"},"schema_version":"1.0","source":{"id":"1507.06370","kind":"arxiv","version":2}},"canonical_sha256":"c6231fc79c72390308c48596294676f3429033ef3bf6e8237cac04e6699e568e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6231fc79c72390308c48596294676f3429033ef3bf6e8237cac04e6699e568e","first_computed_at":"2026-05-18T01:29:53.854497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:53.854497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PnAP5cAlg4V0uSDNfRnmCzTpHnfd961x8KVTRODopubqdME9lCD8wtEpsuf/zWTH3J64hN++IWc0T86gvM4FBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:53.854981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06370","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f7eed0683ad32356b2a3c5516875c9006e43dcac1ab6e55aeaa6565bf6f8af2","sha256:e33b95a7f80debc030048f776bcbb1c58bf5efae8a5424dc7fb4784037f71592"],"state_sha256":"2f5f1cc5843cd125bdee7f46a4507887558217f27f15412407a3b7d93cca4fe8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zjvn+M8xNw37ES8wl3qpUPAutYJ98npXxjs0+5vqsZe8IvJ4MNTqaos+RII8SqMS7YPYSQ+MUkvOyaw6HlUwCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:36:06.668150Z","bundle_sha256":"91f38d53977cd9fa921068575565333028bf0e9b0bf2fee17759cb55b4dabc7c"}}