{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:AACRSP4X7QVOWOLP2GAGSHB5ML","short_pith_number":"pith:AACRSP4X","schema_version":"1.0","canonical_sha256":"0005193f97fc2aeb396fd180691c3d62e080d142a8be0111b56bd5541515e09c","source":{"kind":"arxiv","id":"2212.14194","version":2},"attestation_state":"computed","paper":{"title":"Theoretical Guarantees for Sparse Principal Component Analysis based on the Elastic Net","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Haoyi Yang, Lingzhou Xue, Teng Zhang","submitted_at":"2022-12-29T06:43:31Z","abstract_excerpt":"Sparse principal component analysis (SPCA) is widely used for dimensionality reduction and feature extraction in high-dimensional data analysis. Despite many methodological and theoretical developments in the past two decades, the theoretical guarantees of the popular SPCA algorithm proposed by Zou, Hastie & Tibshirani (2006) are still unknown. This paper aims to address this critical gap. We first revisit the SPCA algorithm of Zou et al. (2006) and present our implementation. We also study a computationally more efficient variant of the SPCA algorithm in Zou et al. (2006) that can be consider"},"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":"2212.14194","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-12-29T06:43:31Z","cross_cats_sorted":["stat.CO","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"90682a3aba3d32bbdbabfd15ac1aefd3b26cb0aee45c633118b44da774234863","abstract_canon_sha256":"4a9d1ee0f3084db9d8bde4fe1823878bf008aebc5b7507d24e625f63d6f56ed1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:05:04.494112Z","signature_b64":"sIjH1tk84xYcsdf48iOxNvlcIBxKjc12i+dJGilGuEc6tF8U1gMcPKhVAwfmI0YJ7JqugvskqJ/mpytfaenKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0005193f97fc2aeb396fd180691c3d62e080d142a8be0111b56bd5541515e09c","last_reissued_at":"2026-07-05T06:05:04.493708Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:05:04.493708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Theoretical Guarantees for Sparse Principal Component Analysis based on the Elastic Net","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Haoyi Yang, Lingzhou Xue, Teng Zhang","submitted_at":"2022-12-29T06:43:31Z","abstract_excerpt":"Sparse principal component analysis (SPCA) is widely used for dimensionality reduction and feature extraction in high-dimensional data analysis. Despite many methodological and theoretical developments in the past two decades, the theoretical guarantees of the popular SPCA algorithm proposed by Zou, Hastie & Tibshirani (2006) are still unknown. This paper aims to address this critical gap. We first revisit the SPCA algorithm of Zou et al. (2006) and present our implementation. We also study a computationally more efficient variant of the SPCA algorithm in Zou et al. (2006) that can be consider"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.14194","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.14194/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2212.14194","created_at":"2026-07-05T06:05:04.493772+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.14194v2","created_at":"2026-07-05T06:05:04.493772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.14194","created_at":"2026-07-05T06:05:04.493772+00:00"},{"alias_kind":"pith_short_12","alias_value":"AACRSP4X7QVO","created_at":"2026-07-05T06:05:04.493772+00:00"},{"alias_kind":"pith_short_16","alias_value":"AACRSP4X7QVOWOLP","created_at":"2026-07-05T06:05:04.493772+00:00"},{"alias_kind":"pith_short_8","alias_value":"AACRSP4X","created_at":"2026-07-05T06:05:04.493772+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/AACRSP4X7QVOWOLP2GAGSHB5ML","json":"https://pith.science/pith/AACRSP4X7QVOWOLP2GAGSHB5ML.json","graph_json":"https://pith.science/api/pith-number/AACRSP4X7QVOWOLP2GAGSHB5ML/graph.json","events_json":"https://pith.science/api/pith-number/AACRSP4X7QVOWOLP2GAGSHB5ML/events.json","paper":"https://pith.science/paper/AACRSP4X"},"agent_actions":{"view_html":"https://pith.science/pith/AACRSP4X7QVOWOLP2GAGSHB5ML","download_json":"https://pith.science/pith/AACRSP4X7QVOWOLP2GAGSHB5ML.json","view_paper":"https://pith.science/paper/AACRSP4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.14194&json=true","fetch_graph":"https://pith.science/api/pith-number/AACRSP4X7QVOWOLP2GAGSHB5ML/graph.json","fetch_events":"https://pith.science/api/pith-number/AACRSP4X7QVOWOLP2GAGSHB5ML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AACRSP4X7QVOWOLP2GAGSHB5ML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AACRSP4X7QVOWOLP2GAGSHB5ML/action/storage_attestation","attest_author":"https://pith.science/pith/AACRSP4X7QVOWOLP2GAGSHB5ML/action/author_attestation","sign_citation":"https://pith.science/pith/AACRSP4X7QVOWOLP2GAGSHB5ML/action/citation_signature","submit_replication":"https://pith.science/pith/AACRSP4X7QVOWOLP2GAGSHB5ML/action/replication_record"}},"created_at":"2026-07-05T06:05:04.493772+00:00","updated_at":"2026-07-05T06:05:04.493772+00:00"}