{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HQ4R6PIED62TUE74MHJII5NXFE","short_pith_number":"pith:HQ4R6PIE","canonical_record":{"source":{"id":"1306.3690","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-06-16T17:40:09Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"23a7b1795beea0676fdbe9f985bc034041c098dd00fe0c6c30e7e5471fa8a1e4","abstract_canon_sha256":"5347d7c6fc4176319b91a318ca8238e47fc5e302b07405979d754d65beb9ee97"},"schema_version":"1.0"},"canonical_sha256":"3c391f3d041fb53a13fc61d28475b7290312da80a3dbc44baf33e64eeecbee22","source":{"kind":"arxiv","id":"1306.3690","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3690","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3690v4","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3690","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"pith_short_12","alias_value":"HQ4R6PIED62T","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HQ4R6PIED62TUE74","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HQ4R6PIE","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HQ4R6PIED62TUE74MHJII5NXFE","target":"record","payload":{"canonical_record":{"source":{"id":"1306.3690","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-06-16T17:40:09Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"23a7b1795beea0676fdbe9f985bc034041c098dd00fe0c6c30e7e5471fa8a1e4","abstract_canon_sha256":"5347d7c6fc4176319b91a318ca8238e47fc5e302b07405979d754d65beb9ee97"},"schema_version":"1.0"},"canonical_sha256":"3c391f3d041fb53a13fc61d28475b7290312da80a3dbc44baf33e64eeecbee22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:27.464264Z","signature_b64":"epeUnQZPVdeEbWInS15AoR5+K49WIoaI9V455mIxr3KXScx0WkNy0C1CwmfapHmb4uwa0yPYDiTkNAPn7fojBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c391f3d041fb53a13fc61d28475b7290312da80a3dbc44baf33e64eeecbee22","last_reissued_at":"2026-05-18T01:58:27.463788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:27.463788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.3690","source_version":4,"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:58:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jiWMptNUgHhz6pHLt8tb4z6GCoWS3reYpWuzWhTT201dbzoTkOpCDxmTy85KTVIotRVbpdZKtO2tFhaYNrK1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:29:22.528543Z"},"content_sha256":"e8276dd293723e73ec7a9a55703f8e74937fc85c2a1a6dde5e910d1065211fcc","schema_version":"1.0","event_id":"sha256:e8276dd293723e73ec7a9a55703f8e74937fc85c2a1a6dde5e910d1065211fcc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HQ4R6PIED62TUE74MHJII5NXFE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Do semidefinite relaxations solve sparse PCA up to the information limit?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Boaz Nadler, Dan Vilenchik, Robert Krauthgamer","submitted_at":"2013-06-16T17:40:09Z","abstract_excerpt":"Estimating the leading principal components of data, assuming they are sparse, is a central task in modern high-dimensional statistics. Many algorithms were developed for this sparse PCA problem, from simple diagonal thresholding to sophisticated semidefinite programming (SDP) methods. A key theoretical question is under what conditions can such algorithms recover the sparse principal components? We study this question for a single-spike model with an $\\ell_0$-sparse eigenvector, in the asymptotic regime as dimension $p$ and sample size $n$ both tend to infinity. Amini and Wainwright [Ann. Sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3690","kind":"arxiv","version":4},"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:58:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r3KMUs7VXfxDSiVFRHtJlQfDKpjxibR7f4hzf2JMZ9VxRog9fTrEPMKFusRo+xj/MTzmmCNSbovYzqj0twjXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:29:22.528897Z"},"content_sha256":"320a5cf96131d695cdff1feda0220bc4b8775b1beece2607543071fa51f79610","schema_version":"1.0","event_id":"sha256:320a5cf96131d695cdff1feda0220bc4b8775b1beece2607543071fa51f79610"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQ4R6PIED62TUE74MHJII5NXFE/bundle.json","state_url":"https://pith.science/pith/HQ4R6PIED62TUE74MHJII5NXFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQ4R6PIED62TUE74MHJII5NXFE/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-01T14:29:22Z","links":{"resolver":"https://pith.science/pith/HQ4R6PIED62TUE74MHJII5NXFE","bundle":"https://pith.science/pith/HQ4R6PIED62TUE74MHJII5NXFE/bundle.json","state":"https://pith.science/pith/HQ4R6PIED62TUE74MHJII5NXFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQ4R6PIED62TUE74MHJII5NXFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HQ4R6PIED62TUE74MHJII5NXFE","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":"5347d7c6fc4176319b91a318ca8238e47fc5e302b07405979d754d65beb9ee97","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-06-16T17:40:09Z","title_canon_sha256":"23a7b1795beea0676fdbe9f985bc034041c098dd00fe0c6c30e7e5471fa8a1e4"},"schema_version":"1.0","source":{"id":"1306.3690","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3690","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3690v4","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3690","created_at":"2026-05-18T01:58:27Z"},{"alias_kind":"pith_short_12","alias_value":"HQ4R6PIED62T","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HQ4R6PIED62TUE74","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HQ4R6PIE","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:320a5cf96131d695cdff1feda0220bc4b8775b1beece2607543071fa51f79610","target":"graph","created_at":"2026-05-18T01:58:27Z","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":"Estimating the leading principal components of data, assuming they are sparse, is a central task in modern high-dimensional statistics. Many algorithms were developed for this sparse PCA problem, from simple diagonal thresholding to sophisticated semidefinite programming (SDP) methods. A key theoretical question is under what conditions can such algorithms recover the sparse principal components? We study this question for a single-spike model with an $\\ell_0$-sparse eigenvector, in the asymptotic regime as dimension $p$ and sample size $n$ both tend to infinity. Amini and Wainwright [Ann. Sta","authors_text":"Boaz Nadler, Dan Vilenchik, Robert Krauthgamer","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-06-16T17:40:09Z","title":"Do semidefinite relaxations solve sparse PCA up to the information limit?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3690","kind":"arxiv","version":4},"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:e8276dd293723e73ec7a9a55703f8e74937fc85c2a1a6dde5e910d1065211fcc","target":"record","created_at":"2026-05-18T01:58:27Z","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":"5347d7c6fc4176319b91a318ca8238e47fc5e302b07405979d754d65beb9ee97","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-06-16T17:40:09Z","title_canon_sha256":"23a7b1795beea0676fdbe9f985bc034041c098dd00fe0c6c30e7e5471fa8a1e4"},"schema_version":"1.0","source":{"id":"1306.3690","kind":"arxiv","version":4}},"canonical_sha256":"3c391f3d041fb53a13fc61d28475b7290312da80a3dbc44baf33e64eeecbee22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c391f3d041fb53a13fc61d28475b7290312da80a3dbc44baf33e64eeecbee22","first_computed_at":"2026-05-18T01:58:27.463788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:58:27.463788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"epeUnQZPVdeEbWInS15AoR5+K49WIoaI9V455mIxr3KXScx0WkNy0C1CwmfapHmb4uwa0yPYDiTkNAPn7fojBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:58:27.464264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3690","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8276dd293723e73ec7a9a55703f8e74937fc85c2a1a6dde5e910d1065211fcc","sha256:320a5cf96131d695cdff1feda0220bc4b8775b1beece2607543071fa51f79610"],"state_sha256":"6056ce967bc1fce656a9f1490842e80a0a430528ebe550f391f866728c39205f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Zada4qI/flTJjKftUtIQv4UT8wYUQvZmLXUwNGOhgPybnLfxj/+9k1Bz7EQk5EZotgvkq2C9vaP73GAliGxAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:29:22.530928Z","bundle_sha256":"3775274a3ee59bf9d7a5a10bc5c431ca89b325c6506265a0f738bbe0ba466410"}}