{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XFEJRDFE4B6ZXO6MLM5H6BH4HZ","short_pith_number":"pith:XFEJRDFE","canonical_record":{"source":{"id":"1904.10155","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2019-04-23T05:25:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9c6bc06a91e8e579e7431b83cab23877c0dd5222c9500a972d231dd7840d58ec","abstract_canon_sha256":"05c142baf094627604396c460bf232620345a3f93490db058f10353ffb557bb6"},"schema_version":"1.0"},"canonical_sha256":"b948988ca4e07d9bbbcc5b3a7f04fc3e5c5d166ae1064626169af234be36829f","source":{"kind":"arxiv","id":"1904.10155","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10155","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10155v2","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10155","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"XFEJRDFE4B6Z","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XFEJRDFE4B6ZXO6M","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XFEJRDFE","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XFEJRDFE4B6ZXO6MLM5H6BH4HZ","target":"record","payload":{"canonical_record":{"source":{"id":"1904.10155","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2019-04-23T05:25:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9c6bc06a91e8e579e7431b83cab23877c0dd5222c9500a972d231dd7840d58ec","abstract_canon_sha256":"05c142baf094627604396c460bf232620345a3f93490db058f10353ffb557bb6"},"schema_version":"1.0"},"canonical_sha256":"b948988ca4e07d9bbbcc5b3a7f04fc3e5c5d166ae1064626169af234be36829f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:08.951073Z","signature_b64":"Pu1Xh9DeroW/JX+QBO6235AKgXTuviQ7wkCdgb1PVE9rui9AtqrW2L5TXMmGDKHRRjYiuePtGtrd7V6nNGTGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b948988ca4e07d9bbbcc5b3a7f04fc3e5c5d166ae1064626169af234be36829f","last_reissued_at":"2026-05-17T23:45:08.950429Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:08.950429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.10155","source_version":2,"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-17T23:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIG1cAigqPK51ag0lSFOP4ydHSOMbI/ke9GWD7AQe0hLuwumrIxELATvRZn4jtwQJ+L2l/a/xGEn0yBuLMXNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:31:14.290615Z"},"content_sha256":"3fb7b2791ffbb452d754c42959a13efd86bd9e9b7a2aa0d010e49489684cac81","schema_version":"1.0","event_id":"sha256:3fb7b2791ffbb452d754c42959a13efd86bd9e9b7a2aa0d010e49489684cac81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XFEJRDFE4B6ZXO6MLM5H6BH4HZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Feature Sparse Principal Components","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Feiping Nie, Lai Tian, Xuelong Li","submitted_at":"2019-04-23T05:25:02Z","abstract_excerpt":"This paper presents new algorithms to solve the feature-sparsity constrained PCA problem (FSPCA), which performs feature selection and PCA simultaneously. Existing optimization methods for FSPCA require data distribution assumptions and are lack of global convergence guarantee. Though the general FSPCA problem is NP-hard, we show that, for a low-rank covariance, FSPCA can be solved globally (Algorithm 1). Then, we propose another strategy (Algorithm 2) to solve FSPCA for the general covariance by iteratively building a carefully designed proxy. We prove theoretical guarantees on approximation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10155","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"},"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-17T23:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tT79EQXmrXzaqN9D6zuadqP5HbPWrtnmH+iCYW95ss7VysNtemW86RgpQWRKt1mJpuy6yaLIgCSsR8tb31HjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:31:14.291000Z"},"content_sha256":"e0b6eacd29dabdfe36eb85a78ea06ae7eb903da9bb6135741a551ab136cdb898","schema_version":"1.0","event_id":"sha256:e0b6eacd29dabdfe36eb85a78ea06ae7eb903da9bb6135741a551ab136cdb898"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFEJRDFE4B6ZXO6MLM5H6BH4HZ/bundle.json","state_url":"https://pith.science/pith/XFEJRDFE4B6ZXO6MLM5H6BH4HZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFEJRDFE4B6ZXO6MLM5H6BH4HZ/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-06-07T07:31:14Z","links":{"resolver":"https://pith.science/pith/XFEJRDFE4B6ZXO6MLM5H6BH4HZ","bundle":"https://pith.science/pith/XFEJRDFE4B6ZXO6MLM5H6BH4HZ/bundle.json","state":"https://pith.science/pith/XFEJRDFE4B6ZXO6MLM5H6BH4HZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFEJRDFE4B6ZXO6MLM5H6BH4HZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XFEJRDFE4B6ZXO6MLM5H6BH4HZ","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":"05c142baf094627604396c460bf232620345a3f93490db058f10353ffb557bb6","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2019-04-23T05:25:02Z","title_canon_sha256":"9c6bc06a91e8e579e7431b83cab23877c0dd5222c9500a972d231dd7840d58ec"},"schema_version":"1.0","source":{"id":"1904.10155","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10155","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10155v2","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10155","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"XFEJRDFE4B6Z","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XFEJRDFE4B6ZXO6M","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XFEJRDFE","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:e0b6eacd29dabdfe36eb85a78ea06ae7eb903da9bb6135741a551ab136cdb898","target":"graph","created_at":"2026-05-17T23:45:08Z","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":"This paper presents new algorithms to solve the feature-sparsity constrained PCA problem (FSPCA), which performs feature selection and PCA simultaneously. Existing optimization methods for FSPCA require data distribution assumptions and are lack of global convergence guarantee. Though the general FSPCA problem is NP-hard, we show that, for a low-rank covariance, FSPCA can be solved globally (Algorithm 1). Then, we propose another strategy (Algorithm 2) to solve FSPCA for the general covariance by iteratively building a carefully designed proxy. We prove theoretical guarantees on approximation ","authors_text":"Feiping Nie, Lai Tian, Xuelong Li","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2019-04-23T05:25:02Z","title":"Learning Feature Sparse Principal Components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10155","kind":"arxiv","version":2},"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:3fb7b2791ffbb452d754c42959a13efd86bd9e9b7a2aa0d010e49489684cac81","target":"record","created_at":"2026-05-17T23:45:08Z","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":"05c142baf094627604396c460bf232620345a3f93490db058f10353ffb557bb6","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2019-04-23T05:25:02Z","title_canon_sha256":"9c6bc06a91e8e579e7431b83cab23877c0dd5222c9500a972d231dd7840d58ec"},"schema_version":"1.0","source":{"id":"1904.10155","kind":"arxiv","version":2}},"canonical_sha256":"b948988ca4e07d9bbbcc5b3a7f04fc3e5c5d166ae1064626169af234be36829f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b948988ca4e07d9bbbcc5b3a7f04fc3e5c5d166ae1064626169af234be36829f","first_computed_at":"2026-05-17T23:45:08.950429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:08.950429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pu1Xh9DeroW/JX+QBO6235AKgXTuviQ7wkCdgb1PVE9rui9AtqrW2L5TXMmGDKHRRjYiuePtGtrd7V6nNGTGAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:08.951073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.10155","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fb7b2791ffbb452d754c42959a13efd86bd9e9b7a2aa0d010e49489684cac81","sha256:e0b6eacd29dabdfe36eb85a78ea06ae7eb903da9bb6135741a551ab136cdb898"],"state_sha256":"250ed1ec25a2ca6665bb254a14d2818fc58c8f7946090e37eaba1d822279ba8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtdcvX5/qpJmNw9s9AMKEq0C5kOkrV+KCFOx13AEsxSj7Ao2Qes7+4RGzPy3z5PyKLFDW0pA3BORK+6XSjNZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:31:14.292959Z","bundle_sha256":"98f1b296dd2e1f4bf1130494e21563fd54347ad187512dba8159b1b4ccd4e845"}}