{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:3JZFIET5SFPOCX6EMNGQ6JCKET","short_pith_number":"pith:3JZFIET5","schema_version":"1.0","canonical_sha256":"da7254127d915ee15fc4634d0f244a24dfe1f41fcb61abfe7db9bfd682adada9","source":{"kind":"arxiv","id":"cs/0406021","version":3},"attestation_state":"computed","paper":{"title":"A direct formulation for sparse PCA using semidefinite programming","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Alexandre d'Aspremont, Gert R. G. Lanckriet, Laurent El Ghaoui, Michael I. Jordan","submitted_at":"2004-06-16T01:23:03Z","abstract_excerpt":"We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its eigenvector. The problem arises in the decomposition of a covariance matrix into sparse factors, and has wide applications ranging from biology to finance. We use a modification of the classical variational representation of the largest eigenvalue of a symmetric matrix, where cardinality is constrained, and derive a semidefinite programming based relaxation for our problem. We also discuss Nesterov's smooth minimizat"},"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":"cs/0406021","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.CE","submitted_at":"2004-06-16T01:23:03Z","cross_cats_sorted":[],"title_canon_sha256":"fdcd2572a3513ce6b208f7ccf7da0b918c5f68ef97ae7565b9f406a0a2fd4d67","abstract_canon_sha256":"cec24fc046d6bd0a260cfd5328bebe7be7f5e589a06e9ce760582af693835fe7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:49:46.541416Z","signature_b64":"+mGJjwE0L7ogbUOuzU8EY96U2q59DZ+TCVGr/FUccuWzYaBgqGFdqvkj/vEJ2epU0oQRwbSrh0Vir0Tq79fGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da7254127d915ee15fc4634d0f244a24dfe1f41fcb61abfe7db9bfd682adada9","last_reissued_at":"2026-07-04T14:49:46.541053Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:49:46.541053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A direct formulation for sparse PCA using semidefinite programming","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Alexandre d'Aspremont, Gert R. G. Lanckriet, Laurent El Ghaoui, Michael I. Jordan","submitted_at":"2004-06-16T01:23:03Z","abstract_excerpt":"We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its eigenvector. The problem arises in the decomposition of a covariance matrix into sparse factors, and has wide applications ranging from biology to finance. We use a modification of the classical variational representation of the largest eigenvalue of a symmetric matrix, where cardinality is constrained, and derive a semidefinite programming based relaxation for our problem. We also discuss Nesterov's smooth minimizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0406021","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0406021/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"cs/0406021","created_at":"2026-07-04T14:49:46.541110+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0406021v3","created_at":"2026-07-04T14:49:46.541110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0406021","created_at":"2026-07-04T14:49:46.541110+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JZFIET5SFPO","created_at":"2026-07-04T14:49:46.541110+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JZFIET5SFPOCX6E","created_at":"2026-07-04T14:49:46.541110+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JZFIET5","created_at":"2026-07-04T14:49:46.541110+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/3JZFIET5SFPOCX6EMNGQ6JCKET","json":"https://pith.science/pith/3JZFIET5SFPOCX6EMNGQ6JCKET.json","graph_json":"https://pith.science/api/pith-number/3JZFIET5SFPOCX6EMNGQ6JCKET/graph.json","events_json":"https://pith.science/api/pith-number/3JZFIET5SFPOCX6EMNGQ6JCKET/events.json","paper":"https://pith.science/paper/3JZFIET5"},"agent_actions":{"view_html":"https://pith.science/pith/3JZFIET5SFPOCX6EMNGQ6JCKET","download_json":"https://pith.science/pith/3JZFIET5SFPOCX6EMNGQ6JCKET.json","view_paper":"https://pith.science/paper/3JZFIET5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0406021&json=true","fetch_graph":"https://pith.science/api/pith-number/3JZFIET5SFPOCX6EMNGQ6JCKET/graph.json","fetch_events":"https://pith.science/api/pith-number/3JZFIET5SFPOCX6EMNGQ6JCKET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JZFIET5SFPOCX6EMNGQ6JCKET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JZFIET5SFPOCX6EMNGQ6JCKET/action/storage_attestation","attest_author":"https://pith.science/pith/3JZFIET5SFPOCX6EMNGQ6JCKET/action/author_attestation","sign_citation":"https://pith.science/pith/3JZFIET5SFPOCX6EMNGQ6JCKET/action/citation_signature","submit_replication":"https://pith.science/pith/3JZFIET5SFPOCX6EMNGQ6JCKET/action/replication_record"}},"created_at":"2026-07-04T14:49:46.541110+00:00","updated_at":"2026-07-04T14:49:46.541110+00:00"}