{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LHXFROYRRSYSPKTOEGLS4C7UCR","short_pith_number":"pith:LHXFROYR","schema_version":"1.0","canonical_sha256":"59ee58bb118cb127aa6e21972e0bf4146d38c0c03ab0fad31c136bfad2eb1299","source":{"kind":"arxiv","id":"2309.06202","version":1},"attestation_state":"computed","paper":{"title":"Fast Sparse PCA via Positive Semidefinite Projection for Unsupervised Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Junjing Zheng, Kai Huo, Li Liu, Weidong Jiang, Xinyu Zhang, Yongxiang Liu","submitted_at":"2023-09-12T13:10:06Z","abstract_excerpt":"In the field of unsupervised feature selection, sparse principal component analysis (SPCA) methods have attracted more and more attention recently. Compared to spectral-based methods, SPCA methods don't rely on the construction of a similarity matrix and show better feature selection ability on real-world data. The original SPCA formulates a nonconvex optimization problem. Existing convex SPCA methods reformulate SPCA as a convex model by regarding the reconstruction matrix as an optimization variable. However, they are lack of constraints equivalent to the orthogonality restriction in SPCA, l"},"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":"2309.06202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-09-12T13:10:06Z","cross_cats_sorted":[],"title_canon_sha256":"f84629de4afc76ab336a7a58dfe3ee7475151d5856de9b94549e2be0a69f33dc","abstract_canon_sha256":"66c2c54e29386f1c0ba66e198b59da2e7c46875fac019974d23811468e3fd061"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:50:04.962037Z","signature_b64":"78eAKlwqyzOmWvXkWbfZS0VC+s0TnUSD0A0CzTiFim28QAWyXlFp+b0hKdLfvXf8II4wrQ8Icccq2opB3eNGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59ee58bb118cb127aa6e21972e0bf4146d38c0c03ab0fad31c136bfad2eb1299","last_reissued_at":"2026-07-05T06:50:04.961561Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:50:04.961561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Sparse PCA via Positive Semidefinite Projection for Unsupervised Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Junjing Zheng, Kai Huo, Li Liu, Weidong Jiang, Xinyu Zhang, Yongxiang Liu","submitted_at":"2023-09-12T13:10:06Z","abstract_excerpt":"In the field of unsupervised feature selection, sparse principal component analysis (SPCA) methods have attracted more and more attention recently. Compared to spectral-based methods, SPCA methods don't rely on the construction of a similarity matrix and show better feature selection ability on real-world data. The original SPCA formulates a nonconvex optimization problem. Existing convex SPCA methods reformulate SPCA as a convex model by regarding the reconstruction matrix as an optimization variable. However, they are lack of constraints equivalent to the orthogonality restriction in SPCA, l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.06202","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.06202/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":"2309.06202","created_at":"2026-07-05T06:50:04.961617+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.06202v1","created_at":"2026-07-05T06:50:04.961617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.06202","created_at":"2026-07-05T06:50:04.961617+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHXFROYRRSYS","created_at":"2026-07-05T06:50:04.961617+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHXFROYRRSYSPKTO","created_at":"2026-07-05T06:50:04.961617+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHXFROYR","created_at":"2026-07-05T06:50:04.961617+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.00726","citing_title":"Enhancing Unsupervised Feature Selection via Double Sparsity Constrained Optimization","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LHXFROYRRSYSPKTOEGLS4C7UCR","json":"https://pith.science/pith/LHXFROYRRSYSPKTOEGLS4C7UCR.json","graph_json":"https://pith.science/api/pith-number/LHXFROYRRSYSPKTOEGLS4C7UCR/graph.json","events_json":"https://pith.science/api/pith-number/LHXFROYRRSYSPKTOEGLS4C7UCR/events.json","paper":"https://pith.science/paper/LHXFROYR"},"agent_actions":{"view_html":"https://pith.science/pith/LHXFROYRRSYSPKTOEGLS4C7UCR","download_json":"https://pith.science/pith/LHXFROYRRSYSPKTOEGLS4C7UCR.json","view_paper":"https://pith.science/paper/LHXFROYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.06202&json=true","fetch_graph":"https://pith.science/api/pith-number/LHXFROYRRSYSPKTOEGLS4C7UCR/graph.json","fetch_events":"https://pith.science/api/pith-number/LHXFROYRRSYSPKTOEGLS4C7UCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHXFROYRRSYSPKTOEGLS4C7UCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHXFROYRRSYSPKTOEGLS4C7UCR/action/storage_attestation","attest_author":"https://pith.science/pith/LHXFROYRRSYSPKTOEGLS4C7UCR/action/author_attestation","sign_citation":"https://pith.science/pith/LHXFROYRRSYSPKTOEGLS4C7UCR/action/citation_signature","submit_replication":"https://pith.science/pith/LHXFROYRRSYSPKTOEGLS4C7UCR/action/replication_record"}},"created_at":"2026-07-05T06:50:04.961617+00:00","updated_at":"2026-07-05T06:50:04.961617+00:00"}