{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DQJFNM67QZCB3SJ2LNCQ2VRI34","short_pith_number":"pith:DQJFNM67","schema_version":"1.0","canonical_sha256":"1c1256b3df86441dc93a5b450d5628df2a949c90e2ed6dad2b247c7d2c98d54d","source":{"kind":"arxiv","id":"2503.02494","version":2},"attestation_state":"computed","paper":{"title":"Enhancing Distributional Robustness in Principal Component Analysis by Wasserstein Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Lei Wang, Xiaojun Chen, Xin Liu","submitted_at":"2025-03-04T11:00:08Z","abstract_excerpt":"We consider the distributionally robust optimization (DRO) model of principal component analysis (PCA) to account for uncertainty in the underlying probability distribution. The resulting formulation leads to a nonsmooth constrained min-max optimization problem, where the ambiguity set captures the distributional uncertainty by the type-$2$ Wasserstein distance. We prove that the inner maximization problem admits a closed-form optimal value. This explicit characterization equivalently reformulates the original DRO model into a minimization problem on the Stiefel manifold with intricate nonsmoo"},"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":"2503.02494","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-04T11:00:08Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a218a22d1148a8d945fc328dc918909fb930e2b76bf71ad96a2d8a601d9bb82c","abstract_canon_sha256":"6902f0cc6cf74c56dd6e1eb5b781ea49ff37d35bebe9eda3d78a26ba5bf6bb49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:12.428907Z","signature_b64":"YbtyJQBNtduHM0CvAuj6LlUej5rYz3IHspK948MLa2O41ImyRDoVIupLDESSkV9MYdK3Cw2qYW8T8y+YrcLMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c1256b3df86441dc93a5b450d5628df2a949c90e2ed6dad2b247c7d2c98d54d","last_reissued_at":"2026-07-05T11:35:12.428388Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:12.428388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhancing Distributional Robustness in Principal Component Analysis by Wasserstein Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Lei Wang, Xiaojun Chen, Xin Liu","submitted_at":"2025-03-04T11:00:08Z","abstract_excerpt":"We consider the distributionally robust optimization (DRO) model of principal component analysis (PCA) to account for uncertainty in the underlying probability distribution. The resulting formulation leads to a nonsmooth constrained min-max optimization problem, where the ambiguity set captures the distributional uncertainty by the type-$2$ Wasserstein distance. We prove that the inner maximization problem admits a closed-form optimal value. This explicit characterization equivalently reformulates the original DRO model into a minimization problem on the Stiefel manifold with intricate nonsmoo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.02494","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.02494/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":"2503.02494","created_at":"2026-07-05T11:35:12.428447+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.02494v2","created_at":"2026-07-05T11:35:12.428447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.02494","created_at":"2026-07-05T11:35:12.428447+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQJFNM67QZCB","created_at":"2026-07-05T11:35:12.428447+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQJFNM67QZCB3SJ2","created_at":"2026-07-05T11:35:12.428447+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQJFNM67","created_at":"2026-07-05T11:35:12.428447+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10463","citing_title":"Distributionally Robust PCA with Data-Adaptive Wasserstein Geometry","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2508.12003","citing_title":"An inexact variable metric proximal linearization method for composite optimization on manifolds","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18325","citing_title":"An Adaptive Smoothing Algorithm for Non-Lipschitz Optimization on Manifolds with Complexity Guarantees","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DQJFNM67QZCB3SJ2LNCQ2VRI34","json":"https://pith.science/pith/DQJFNM67QZCB3SJ2LNCQ2VRI34.json","graph_json":"https://pith.science/api/pith-number/DQJFNM67QZCB3SJ2LNCQ2VRI34/graph.json","events_json":"https://pith.science/api/pith-number/DQJFNM67QZCB3SJ2LNCQ2VRI34/events.json","paper":"https://pith.science/paper/DQJFNM67"},"agent_actions":{"view_html":"https://pith.science/pith/DQJFNM67QZCB3SJ2LNCQ2VRI34","download_json":"https://pith.science/pith/DQJFNM67QZCB3SJ2LNCQ2VRI34.json","view_paper":"https://pith.science/paper/DQJFNM67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.02494&json=true","fetch_graph":"https://pith.science/api/pith-number/DQJFNM67QZCB3SJ2LNCQ2VRI34/graph.json","fetch_events":"https://pith.science/api/pith-number/DQJFNM67QZCB3SJ2LNCQ2VRI34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQJFNM67QZCB3SJ2LNCQ2VRI34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQJFNM67QZCB3SJ2LNCQ2VRI34/action/storage_attestation","attest_author":"https://pith.science/pith/DQJFNM67QZCB3SJ2LNCQ2VRI34/action/author_attestation","sign_citation":"https://pith.science/pith/DQJFNM67QZCB3SJ2LNCQ2VRI34/action/citation_signature","submit_replication":"https://pith.science/pith/DQJFNM67QZCB3SJ2LNCQ2VRI34/action/replication_record"}},"created_at":"2026-07-05T11:35:12.428447+00:00","updated_at":"2026-07-05T11:35:12.428447+00:00"}