{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZXHVOWKM3KDA27RBALTHPITHEX","short_pith_number":"pith:ZXHVOWKM","schema_version":"1.0","canonical_sha256":"cdcf57594cda860d7e2102e677a26725fca1e10f95817fb57d8a0e3a3412280e","source":{"kind":"arxiv","id":"1502.05675","version":2},"attestation_state":"computed","paper":{"title":"NP-Hardness and Inapproximability of Sparse PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Malik Magdon-Ismail","submitted_at":"2015-02-19T19:30:46Z","abstract_excerpt":"We give a reduction from {\\sc clique} to establish that sparse PCA is NP-hard. The reduction has a gap which we use to exclude an FPTAS for sparse PCA (unless P=NP). Under weaker complexity assumptions, we also exclude polynomial constant-factor approximation algorithms."},"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":"1502.05675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-19T19:30:46Z","cross_cats_sorted":["cs.CC","cs.DS","math.CO","stat.ML"],"title_canon_sha256":"7e0260a5d63f470b451dae88569dee7249da3b6dbd516e6c0bfe53ac6d2f3147","abstract_canon_sha256":"057f70e802bc4d3471369634f2399adddc7bf480770ba2e8c2925dd43faeea86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:44.979685Z","signature_b64":"QHW6ja7S7iPSRwCa87Xmznd/Cz1nBCL2EBwrBSWZ6SdjfbXonneevl0XLe6zdy62RzKvYNveJHxprRyQmadaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdcf57594cda860d7e2102e677a26725fca1e10f95817fb57d8a0e3a3412280e","last_reissued_at":"2026-05-18T02:26:44.979203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:44.979203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NP-Hardness and Inapproximability of Sparse PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Malik Magdon-Ismail","submitted_at":"2015-02-19T19:30:46Z","abstract_excerpt":"We give a reduction from {\\sc clique} to establish that sparse PCA is NP-hard. The reduction has a gap which we use to exclude an FPTAS for sparse PCA (unless P=NP). Under weaker complexity assumptions, we also exclude polynomial constant-factor approximation algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05675","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":"1502.05675","created_at":"2026-05-18T02:26:44.979283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05675v2","created_at":"2026-05-18T02:26:44.979283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05675","created_at":"2026-05-18T02:26:44.979283+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXHVOWKM3KDA","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXHVOWKM3KDA27RB","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXHVOWKM","created_at":"2026-05-18T12:29:52.810259+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/ZXHVOWKM3KDA27RBALTHPITHEX","json":"https://pith.science/pith/ZXHVOWKM3KDA27RBALTHPITHEX.json","graph_json":"https://pith.science/api/pith-number/ZXHVOWKM3KDA27RBALTHPITHEX/graph.json","events_json":"https://pith.science/api/pith-number/ZXHVOWKM3KDA27RBALTHPITHEX/events.json","paper":"https://pith.science/paper/ZXHVOWKM"},"agent_actions":{"view_html":"https://pith.science/pith/ZXHVOWKM3KDA27RBALTHPITHEX","download_json":"https://pith.science/pith/ZXHVOWKM3KDA27RBALTHPITHEX.json","view_paper":"https://pith.science/paper/ZXHVOWKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05675&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXHVOWKM3KDA27RBALTHPITHEX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXHVOWKM3KDA27RBALTHPITHEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXHVOWKM3KDA27RBALTHPITHEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXHVOWKM3KDA27RBALTHPITHEX/action/storage_attestation","attest_author":"https://pith.science/pith/ZXHVOWKM3KDA27RBALTHPITHEX/action/author_attestation","sign_citation":"https://pith.science/pith/ZXHVOWKM3KDA27RBALTHPITHEX/action/citation_signature","submit_replication":"https://pith.science/pith/ZXHVOWKM3KDA27RBALTHPITHEX/action/replication_record"}},"created_at":"2026-05-18T02:26:44.979283+00:00","updated_at":"2026-05-18T02:26:44.979283+00:00"}