{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:R72XPBP7EGIUPML6ALZTJWM2XI","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":"d84a5309b28ec018dadc4a6f40954658d11f8bd6b541b8b3cb09da15e3aac2ef","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-03-03T19:08:55Z","title_canon_sha256":"0ae21230c76cd1aca76bb1baad6ce59013a7efe845a097e677a011e593c02478"},"schema_version":"1.0","source":{"id":"1303.0551","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0551","created_at":"2026-05-18T02:52:23Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0551v2","created_at":"2026-05-18T02:52:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0551","created_at":"2026-05-18T02:52:23Z"},{"alias_kind":"pith_short_12","alias_value":"R72XPBP7EGIU","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R72XPBP7EGIUPML6","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R72XPBP7","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:b25083efc1fca85209ed85cc34b63efac5c4a0fec92125e98ba72dc5e740d563","target":"graph","created_at":"2026-05-18T02:52:23Z","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 introduce a novel algorithm that computes the $k$-sparse principal component of a positive semidefinite matrix $A$. Our algorithm is combinatorial and operates by examining a discrete set of special vectors lying in a low-dimensional eigen-subspace of $A$. We obtain provable approximation guarantees that depend on the spectral decay profile of the matrix: the faster the eigenvalue decay, the better the quality of our approximation. For example, if the eigenvalues of $A$ follow a power-law decay, we obtain a polynomial-time approximation algorithm for any desired accuracy.\n  A key algorithmi","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos, Stavros Korokythakis","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-03-03T19:08:55Z","title":"Sparse PCA through Low-rank Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0551","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:61a33b3b2f3e6bb76910e555c8a20fa2ed6bf0131f9b8dd2757f152566a99084","target":"record","created_at":"2026-05-18T02:52:23Z","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":"d84a5309b28ec018dadc4a6f40954658d11f8bd6b541b8b3cb09da15e3aac2ef","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-03-03T19:08:55Z","title_canon_sha256":"0ae21230c76cd1aca76bb1baad6ce59013a7efe845a097e677a011e593c02478"},"schema_version":"1.0","source":{"id":"1303.0551","kind":"arxiv","version":2}},"canonical_sha256":"8ff57785ff219147b17e02f334d99aba39248cfea19cde229e6260bdd29c95a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ff57785ff219147b17e02f334d99aba39248cfea19cde229e6260bdd29c95a6","first_computed_at":"2026-05-18T02:52:23.683342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:23.683342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iE2T8f8zlnkxFNx/i8GerprterjlFIq5F97r+znSKwNcVXgU+bBPl8t4f+0UyANjxP+gMOZgmcfHDU+jzUZFDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:23.683919Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0551","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61a33b3b2f3e6bb76910e555c8a20fa2ed6bf0131f9b8dd2757f152566a99084","sha256:b25083efc1fca85209ed85cc34b63efac5c4a0fec92125e98ba72dc5e740d563"],"state_sha256":"ba9b87e3fbeaddd20d0c477fc211bbe239ba526135cbd380b9e2b7f6111b45c0"}