{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:WVSX5LTYKNDAYJNYOWP5ADXZTO","short_pith_number":"pith:WVSX5LTY","canonical_record":{"source":{"id":"0707.0705","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"cs.AI","submitted_at":"2007-07-04T22:28:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"409149ed7f7458e1b6c4fdbcbb676bbfa5891a43821a436add530cfbeb16225d","abstract_canon_sha256":"bad9c59eb374ffa921ab85730825fa287a3255e3c44ff849d87d195ca8dddbde"},"schema_version":"1.0"},"canonical_sha256":"b5657eae7853460c25b8759fd00ef99bbe4c09f6fb8f5a5a74fc06541d00ad3a","source":{"kind":"arxiv","id":"0707.0705","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.0705","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"arxiv_version","alias_value":"0707.0705v4","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.0705","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"pith_short_12","alias_value":"WVSX5LTYKNDA","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"WVSX5LTYKNDAYJNY","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"WVSX5LTY","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:WVSX5LTYKNDAYJNYOWP5ADXZTO","target":"record","payload":{"canonical_record":{"source":{"id":"0707.0705","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"cs.AI","submitted_at":"2007-07-04T22:28:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"409149ed7f7458e1b6c4fdbcbb676bbfa5891a43821a436add530cfbeb16225d","abstract_canon_sha256":"bad9c59eb374ffa921ab85730825fa287a3255e3c44ff849d87d195ca8dddbde"},"schema_version":"1.0"},"canonical_sha256":"b5657eae7853460c25b8759fd00ef99bbe4c09f6fb8f5a5a74fc06541d00ad3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:15.787186Z","signature_b64":"hi9wwgiSlE3I7h3u5nNcdmFUM9nNZGdzt+5FSgaubfTYVHxr+bh3cxM8IookPcHKgUqWH/OWvs08T3L3S0JJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5657eae7853460c25b8759fd00ef99bbe4c09f6fb8f5a5a74fc06541d00ad3a","last_reissued_at":"2026-05-18T04:09:15.786506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:15.786506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0707.0705","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:09:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NlaHFPVS7Vhuczq1fVYRNkwYdvFJpMJ8Qvc8Cwb5U+Qy64rTtOSwzEUNwcMYI3pWO2fcopeq+z4ditc3KTmbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:58:51.732304Z"},"content_sha256":"f4d2bbe74dc6321eaf2b964e1a167882e4848fcd888125cb723f4b3b9450cf8f","schema_version":"1.0","event_id":"sha256:f4d2bbe74dc6321eaf2b964e1a167882e4848fcd888125cb723f4b3b9450cf8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:WVSX5LTYKNDAYJNYOWP5ADXZTO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Solutions for Sparse Principal Component Analysis","license":"","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Alexandre d'Aspremont, Francis Bach, Laurent El Ghaoui","submitted_at":"2007-07-04T22:28:28Z","abstract_excerpt":"Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonzero coefficients in this combination. This is known as sparse principal component analysis and has a wide array of applications in machine learning and engineering. We formulate a new semidefinite relaxation to this problem and derive a greedy algorithm that computes a full set of good solutions for all target numbers of non zero coefficients, with total complexity O(n^3), where n is the number of variables. We then us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.0705","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:09:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXMnQzjNerF9O5fan/hkpWNs/iyDqtmV17xLdBbusk4jQQHAUWrnXpFvMw/rCRH3HFlm/CvoBzqB6E6Fe2E1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:58:51.733001Z"},"content_sha256":"790488b751b11964a6c1bbefbd5ef84634996d48796ee3aa13e9901318a493f3","schema_version":"1.0","event_id":"sha256:790488b751b11964a6c1bbefbd5ef84634996d48796ee3aa13e9901318a493f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVSX5LTYKNDAYJNYOWP5ADXZTO/bundle.json","state_url":"https://pith.science/pith/WVSX5LTYKNDAYJNYOWP5ADXZTO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVSX5LTYKNDAYJNYOWP5ADXZTO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T07:58:51Z","links":{"resolver":"https://pith.science/pith/WVSX5LTYKNDAYJNYOWP5ADXZTO","bundle":"https://pith.science/pith/WVSX5LTYKNDAYJNYOWP5ADXZTO/bundle.json","state":"https://pith.science/pith/WVSX5LTYKNDAYJNYOWP5ADXZTO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVSX5LTYKNDAYJNYOWP5ADXZTO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:WVSX5LTYKNDAYJNYOWP5ADXZTO","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":"bad9c59eb374ffa921ab85730825fa287a3255e3c44ff849d87d195ca8dddbde","cross_cats_sorted":["cs.LG"],"license":"","primary_cat":"cs.AI","submitted_at":"2007-07-04T22:28:28Z","title_canon_sha256":"409149ed7f7458e1b6c4fdbcbb676bbfa5891a43821a436add530cfbeb16225d"},"schema_version":"1.0","source":{"id":"0707.0705","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.0705","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"arxiv_version","alias_value":"0707.0705v4","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.0705","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"pith_short_12","alias_value":"WVSX5LTYKNDA","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"WVSX5LTYKNDAYJNY","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"WVSX5LTY","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:790488b751b11964a6c1bbefbd5ef84634996d48796ee3aa13e9901318a493f3","target":"graph","created_at":"2026-05-18T04:09:15Z","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":"Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonzero coefficients in this combination. This is known as sparse principal component analysis and has a wide array of applications in machine learning and engineering. We formulate a new semidefinite relaxation to this problem and derive a greedy algorithm that computes a full set of good solutions for all target numbers of non zero coefficients, with total complexity O(n^3), where n is the number of variables. We then us","authors_text":"Alexandre d'Aspremont, Francis Bach, Laurent El Ghaoui","cross_cats":["cs.LG"],"headline":"","license":"","primary_cat":"cs.AI","submitted_at":"2007-07-04T22:28:28Z","title":"Optimal Solutions for Sparse Principal Component Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.0705","kind":"arxiv","version":4},"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:f4d2bbe74dc6321eaf2b964e1a167882e4848fcd888125cb723f4b3b9450cf8f","target":"record","created_at":"2026-05-18T04:09:15Z","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":"bad9c59eb374ffa921ab85730825fa287a3255e3c44ff849d87d195ca8dddbde","cross_cats_sorted":["cs.LG"],"license":"","primary_cat":"cs.AI","submitted_at":"2007-07-04T22:28:28Z","title_canon_sha256":"409149ed7f7458e1b6c4fdbcbb676bbfa5891a43821a436add530cfbeb16225d"},"schema_version":"1.0","source":{"id":"0707.0705","kind":"arxiv","version":4}},"canonical_sha256":"b5657eae7853460c25b8759fd00ef99bbe4c09f6fb8f5a5a74fc06541d00ad3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5657eae7853460c25b8759fd00ef99bbe4c09f6fb8f5a5a74fc06541d00ad3a","first_computed_at":"2026-05-18T04:09:15.786506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:15.786506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hi9wwgiSlE3I7h3u5nNcdmFUM9nNZGdzt+5FSgaubfTYVHxr+bh3cxM8IookPcHKgUqWH/OWvs08T3L3S0JJCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:15.787186Z","signed_message":"canonical_sha256_bytes"},"source_id":"0707.0705","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4d2bbe74dc6321eaf2b964e1a167882e4848fcd888125cb723f4b3b9450cf8f","sha256:790488b751b11964a6c1bbefbd5ef84634996d48796ee3aa13e9901318a493f3"],"state_sha256":"69f20a949b86ebc3783ee796fb7a3e58a185c86670ef16a0b599b3e565326d10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JrrPgyuE+AABMWYV48o11MMO3djwt3uqPh50bkjwebs8Ya5L2/NyWf7NNnMenbQ9ONwtKarvvbVpqAvQw7IRAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:58:51.736758Z","bundle_sha256":"26bf19448ffdf9d9c2356eb3aae4ea50e23a1c194257fe4db4c5e19586d52747"}}