{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ELDOQTBQCGBWV4VPLH4LXDJ4Q5","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":"3fecbd9dccb36c538aacf848aad3ff257abbe0e37f5820045960f61cb4862150","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-13T20:06:59Z","title_canon_sha256":"72f3e2a972fba1d964b20cb134782ec248b61800fbb2387c042a91979a726b3b"},"schema_version":"1.0","source":{"id":"1508.03337","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03337","created_at":"2026-05-18T00:57:04Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03337v5","created_at":"2026-05-18T00:57:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03337","created_at":"2026-05-18T00:57:04Z"},{"alias_kind":"pith_short_12","alias_value":"ELDOQTBQCGBW","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"ELDOQTBQCGBWV4VP","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"ELDOQTBQ","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:60d21f0d4ae15467423e8886b0239d1f0f34175c33b2b59d4feb9e95ddf33a28","target":"graph","created_at":"2026-05-18T00:57:04Z","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":"We present and analyze a simple, two-step algorithm to approximate the optimal solution of the sparse PCA problem. Our approach first solves a L1 penalized version of the NP-hard sparse PCA optimization problem and then uses a randomized rounding strategy to sparsify the resulting dense solution. Our main theoretical result guarantees an additive error approximation and provides a tradeoff between sparsity and accuracy. Our experimental evaluation indicates that our approach is competitive in practice, even compared to state-of-the-art toolboxes such as Spasm.","authors_text":"Abhisek Kundu, Eugenia-Maria Kontopoulou, Kimon Fountoulakis, Petros Drineas","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-13T20:06:59Z","title":"A Randomized Rounding Algorithm for Sparse PCA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03337","kind":"arxiv","version":5},"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:c9b19582f8130ef6444320c8c806e00b21daca0a44518da6ac2a36938f6bf3df","target":"record","created_at":"2026-05-18T00:57:04Z","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":"3fecbd9dccb36c538aacf848aad3ff257abbe0e37f5820045960f61cb4862150","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-13T20:06:59Z","title_canon_sha256":"72f3e2a972fba1d964b20cb134782ec248b61800fbb2387c042a91979a726b3b"},"schema_version":"1.0","source":{"id":"1508.03337","kind":"arxiv","version":5}},"canonical_sha256":"22c6e84c3011836af2af59f8bb8d3c875220797d1aca3cfa4e7ffae7aa62f2d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22c6e84c3011836af2af59f8bb8d3c875220797d1aca3cfa4e7ffae7aa62f2d2","first_computed_at":"2026-05-18T00:57:04.888312Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:04.888312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RIdzCreS5++koE3lFVOulVVqFweSflDjc/oLr4IAadNlvFr573dlQvnTLIOXr62qWykzoLD2UphQL7HiWO9ZCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:04.888914Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03337","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9b19582f8130ef6444320c8c806e00b21daca0a44518da6ac2a36938f6bf3df","sha256:60d21f0d4ae15467423e8886b0239d1f0f34175c33b2b59d4feb9e95ddf33a28"],"state_sha256":"0e74686fb7552422ecbd6ab72c2796c5b5527f7e35f58f867668e2d34c7a8078"}