{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:R72XPBP7EGIUPML6ALZTJWM2XI","short_pith_number":"pith:R72XPBP7","schema_version":"1.0","canonical_sha256":"8ff57785ff219147b17e02f334d99aba39248cfea19cde229e6260bdd29c95a6","source":{"kind":"arxiv","id":"1303.0551","version":2},"attestation_state":"computed","paper":{"title":"Sparse PCA through Low-rank Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos, Stavros Korokythakis","submitted_at":"2013-03-03T19:08:55Z","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"},"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":"1303.0551","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-03-03T19:08:55Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"0ae21230c76cd1aca76bb1baad6ce59013a7efe845a097e677a011e593c02478","abstract_canon_sha256":"d84a5309b28ec018dadc4a6f40954658d11f8bd6b541b8b3cb09da15e3aac2ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:23.683919Z","signature_b64":"iE2T8f8zlnkxFNx/i8GerprterjlFIq5F97r+znSKwNcVXgU+bBPl8t4f+0UyANjxP+gMOZgmcfHDU+jzUZFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ff57785ff219147b17e02f334d99aba39248cfea19cde229e6260bdd29c95a6","last_reissued_at":"2026-05-18T02:52:23.683342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:23.683342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse PCA through Low-rank Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Alexandros G. Dimakis, Dimitris S. Papailiopoulos, Stavros Korokythakis","submitted_at":"2013-03-03T19:08:55Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0551","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.0551","created_at":"2026-05-18T02:52:23.683454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.0551v2","created_at":"2026-05-18T02:52:23.683454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0551","created_at":"2026-05-18T02:52:23.683454+00:00"},{"alias_kind":"pith_short_12","alias_value":"R72XPBP7EGIU","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"R72XPBP7EGIUPML6","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"R72XPBP7","created_at":"2026-05-18T12:27:57.521954+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/R72XPBP7EGIUPML6ALZTJWM2XI","json":"https://pith.science/pith/R72XPBP7EGIUPML6ALZTJWM2XI.json","graph_json":"https://pith.science/api/pith-number/R72XPBP7EGIUPML6ALZTJWM2XI/graph.json","events_json":"https://pith.science/api/pith-number/R72XPBP7EGIUPML6ALZTJWM2XI/events.json","paper":"https://pith.science/paper/R72XPBP7"},"agent_actions":{"view_html":"https://pith.science/pith/R72XPBP7EGIUPML6ALZTJWM2XI","download_json":"https://pith.science/pith/R72XPBP7EGIUPML6ALZTJWM2XI.json","view_paper":"https://pith.science/paper/R72XPBP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.0551&json=true","fetch_graph":"https://pith.science/api/pith-number/R72XPBP7EGIUPML6ALZTJWM2XI/graph.json","fetch_events":"https://pith.science/api/pith-number/R72XPBP7EGIUPML6ALZTJWM2XI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R72XPBP7EGIUPML6ALZTJWM2XI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R72XPBP7EGIUPML6ALZTJWM2XI/action/storage_attestation","attest_author":"https://pith.science/pith/R72XPBP7EGIUPML6ALZTJWM2XI/action/author_attestation","sign_citation":"https://pith.science/pith/R72XPBP7EGIUPML6ALZTJWM2XI/action/citation_signature","submit_replication":"https://pith.science/pith/R72XPBP7EGIUPML6ALZTJWM2XI/action/replication_record"}},"created_at":"2026-05-18T02:52:23.683454+00:00","updated_at":"2026-05-18T02:52:23.683454+00:00"}