{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4HNJSMAK3AU7EXXIUSVDYZDOKV","short_pith_number":"pith:4HNJSMAK","schema_version":"1.0","canonical_sha256":"e1da99300ad829f25ee8a4aa3c646e5559ceed3963d46e779c69441205740852","source":{"kind":"arxiv","id":"1508.00625","version":1},"attestation_state":"computed","paper":{"title":"Sparse PCA via Bipartite Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Alexandros G. Dimakis, Anastasios Kyrillidis, Dimitris Papailiopoulos, Megasthenis Asteris","submitted_at":"2015-08-04T00:12:35Z","abstract_excerpt":"We consider the following multi-component sparse PCA problem: given a set of data points, we seek to extract a small number of sparse components with disjoint supports that jointly capture the maximum possible variance. These components can be computed one by one, repeatedly solving the single-component problem and deflating the input data matrix, but as we show this greedy procedure is suboptimal. We present a novel algorithm for sparse PCA that jointly optimizes multiple disjoint components. The extracted features capture variance that lies within a multiplicative factor arbitrarily close to"},"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":"1508.00625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-04T00:12:35Z","cross_cats_sorted":["cs.DS","cs.LG","math.OC"],"title_canon_sha256":"92970c6e12fdb7a9acf799a634356ad89dcaa03cb813bc2abbd11f04754f9e18","abstract_canon_sha256":"f52ed330707d8539bfa2771e38befb2085af96b6e2a73c566883f394a6d56edc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:53.829524Z","signature_b64":"kahw62WYVg94UnZZq2fPySOxDnbWOQbywgjzNkxo0XfNc9ngM28ACx5IYuYr7gcvbVPziz40T78JeSLuNE1bAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1da99300ad829f25ee8a4aa3c646e5559ceed3963d46e779c69441205740852","last_reissued_at":"2026-05-18T01:35:53.829021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:53.829021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse PCA via Bipartite Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Alexandros G. Dimakis, Anastasios Kyrillidis, Dimitris Papailiopoulos, Megasthenis Asteris","submitted_at":"2015-08-04T00:12:35Z","abstract_excerpt":"We consider the following multi-component sparse PCA problem: given a set of data points, we seek to extract a small number of sparse components with disjoint supports that jointly capture the maximum possible variance. These components can be computed one by one, repeatedly solving the single-component problem and deflating the input data matrix, but as we show this greedy procedure is suboptimal. We present a novel algorithm for sparse PCA that jointly optimizes multiple disjoint components. The extracted features capture variance that lies within a multiplicative factor arbitrarily close to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00625","kind":"arxiv","version":1},"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":"1508.00625","created_at":"2026-05-18T01:35:53.829089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.00625v1","created_at":"2026-05-18T01:35:53.829089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00625","created_at":"2026-05-18T01:35:53.829089+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HNJSMAK3AU7","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HNJSMAK3AU7EXXI","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HNJSMAK","created_at":"2026-05-18T12:29:05.191682+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/4HNJSMAK3AU7EXXIUSVDYZDOKV","json":"https://pith.science/pith/4HNJSMAK3AU7EXXIUSVDYZDOKV.json","graph_json":"https://pith.science/api/pith-number/4HNJSMAK3AU7EXXIUSVDYZDOKV/graph.json","events_json":"https://pith.science/api/pith-number/4HNJSMAK3AU7EXXIUSVDYZDOKV/events.json","paper":"https://pith.science/paper/4HNJSMAK"},"agent_actions":{"view_html":"https://pith.science/pith/4HNJSMAK3AU7EXXIUSVDYZDOKV","download_json":"https://pith.science/pith/4HNJSMAK3AU7EXXIUSVDYZDOKV.json","view_paper":"https://pith.science/paper/4HNJSMAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.00625&json=true","fetch_graph":"https://pith.science/api/pith-number/4HNJSMAK3AU7EXXIUSVDYZDOKV/graph.json","fetch_events":"https://pith.science/api/pith-number/4HNJSMAK3AU7EXXIUSVDYZDOKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HNJSMAK3AU7EXXIUSVDYZDOKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HNJSMAK3AU7EXXIUSVDYZDOKV/action/storage_attestation","attest_author":"https://pith.science/pith/4HNJSMAK3AU7EXXIUSVDYZDOKV/action/author_attestation","sign_citation":"https://pith.science/pith/4HNJSMAK3AU7EXXIUSVDYZDOKV/action/citation_signature","submit_replication":"https://pith.science/pith/4HNJSMAK3AU7EXXIUSVDYZDOKV/action/replication_record"}},"created_at":"2026-05-18T01:35:53.829089+00:00","updated_at":"2026-05-18T01:35:53.829089+00:00"}