{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3CH34U5424X3QTL76DSOPFC6O6","short_pith_number":"pith:3CH34U54","schema_version":"1.0","canonical_sha256":"d88fbe53bcd72fb84d7ff0e4e7945e77be4d39dd824029e99c0c866401af1f9f","source":{"kind":"arxiv","id":"1804.00341","version":3},"attestation_state":"computed","paper":{"title":"Sparse Principal Component Analysis via Variable Projection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aleksandr Y. Aravkin, J. Nathan Kutz, Krithika Manohar, N. Benjamin Erichson, Peng Zheng, Steven L. Brunton","submitted_at":"2018-04-01T20:49:56Z","abstract_excerpt":"Sparse principal component analysis (SPCA) has emerged as a powerful technique for modern data analysis, providing improved interpretation of low-rank structures by identifying localized spatial structures in the data and disambiguating between distinct time scales. We demonstrate a robust and scalable SPCA algorithm by formulating it as a value-function optimization problem. This viewpoint leads to a flexible and computationally efficient algorithm. Further, we can leverage randomized methods from linear algebra to extend the approach to the large-scale (big data) setting. Our proposed innova"},"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":"1804.00341","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-01T20:49:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8a528118f3a9ee11e54ebb90d62ee69589b069b2ef9c1479122f821b7ab90073","abstract_canon_sha256":"99879af9ffce8daf23075b2fee46a59040f4774ce48b90c0b466003816780669"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:01:59.181629Z","signature_b64":"QgKSUSAW6pYgIT/S7J8RflUfNs7V5MRVmvAh2svlde14lkYrZalh8TImdGCJosm5/WFckRYojvdobgpSJ0EWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d88fbe53bcd72fb84d7ff0e4e7945e77be4d39dd824029e99c0c866401af1f9f","last_reissued_at":"2026-07-05T02:01:59.181260Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:01:59.181260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Principal Component Analysis via Variable Projection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aleksandr Y. Aravkin, J. Nathan Kutz, Krithika Manohar, N. Benjamin Erichson, Peng Zheng, Steven L. Brunton","submitted_at":"2018-04-01T20:49:56Z","abstract_excerpt":"Sparse principal component analysis (SPCA) has emerged as a powerful technique for modern data analysis, providing improved interpretation of low-rank structures by identifying localized spatial structures in the data and disambiguating between distinct time scales. We demonstrate a robust and scalable SPCA algorithm by formulating it as a value-function optimization problem. This viewpoint leads to a flexible and computationally efficient algorithm. Further, we can leverage randomized methods from linear algebra to extend the approach to the large-scale (big data) setting. Our proposed innova"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00341","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/1804.00341/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":"1804.00341","created_at":"2026-07-05T02:01:59.181323+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00341v3","created_at":"2026-07-05T02:01:59.181323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00341","created_at":"2026-07-05T02:01:59.181323+00:00"},{"alias_kind":"pith_short_12","alias_value":"3CH34U5424X3","created_at":"2026-07-05T02:01:59.181323+00:00"},{"alias_kind":"pith_short_16","alias_value":"3CH34U5424X3QTL7","created_at":"2026-07-05T02:01:59.181323+00:00"},{"alias_kind":"pith_short_8","alias_value":"3CH34U54","created_at":"2026-07-05T02:01:59.181323+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.03717","citing_title":"Separable nonlinear least-squares parameter estimation for complex dynamic systems","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3CH34U5424X3QTL76DSOPFC6O6","json":"https://pith.science/pith/3CH34U5424X3QTL76DSOPFC6O6.json","graph_json":"https://pith.science/api/pith-number/3CH34U5424X3QTL76DSOPFC6O6/graph.json","events_json":"https://pith.science/api/pith-number/3CH34U5424X3QTL76DSOPFC6O6/events.json","paper":"https://pith.science/paper/3CH34U54"},"agent_actions":{"view_html":"https://pith.science/pith/3CH34U5424X3QTL76DSOPFC6O6","download_json":"https://pith.science/pith/3CH34U5424X3QTL76DSOPFC6O6.json","view_paper":"https://pith.science/paper/3CH34U54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00341&json=true","fetch_graph":"https://pith.science/api/pith-number/3CH34U5424X3QTL76DSOPFC6O6/graph.json","fetch_events":"https://pith.science/api/pith-number/3CH34U5424X3QTL76DSOPFC6O6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3CH34U5424X3QTL76DSOPFC6O6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3CH34U5424X3QTL76DSOPFC6O6/action/storage_attestation","attest_author":"https://pith.science/pith/3CH34U5424X3QTL76DSOPFC6O6/action/author_attestation","sign_citation":"https://pith.science/pith/3CH34U5424X3QTL76DSOPFC6O6/action/citation_signature","submit_replication":"https://pith.science/pith/3CH34U5424X3QTL76DSOPFC6O6/action/replication_record"}},"created_at":"2026-07-05T02:01:59.181323+00:00","updated_at":"2026-07-05T02:01:59.181323+00:00"}