{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:72EFAWK2RUVDQKKSWI33CGX3N3","short_pith_number":"pith:72EFAWK2","schema_version":"1.0","canonical_sha256":"fe8850595a8d2a382952b237b11afb6ef13afaf40c30153d1004c008a59dcae1","source":{"kind":"arxiv","id":"2409.01770","version":2},"attestation_state":"computed","paper":{"title":"Randomized Submanifold Subgradient Method for Optimization over Stiefel Manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andy Yat-Ming Cheung, Anthony Man-Cho So, Jinxin Wang, Man-Chung Yue","submitted_at":"2024-09-03T10:29:57Z","abstract_excerpt":"Optimization over the Stiefel manifold is a fundamental computational problem in many scientific and engineering applications. Despite considerable research effort, high-dimensional optimization problems over the Stiefel manifold remain challenging, particularly when the objective function is nonsmooth. In this paper, we propose a novel coordinate-type algorithm, named \\emph{randomized submanifold subgradient method} (RSSM), for minimizing a possibly nonsmooth weakly convex function over the Stiefel manifold and study its convergence behavior. Similar to coordinate-type algorithms in the Eucli"},"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":"2409.01770","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-03T10:29:57Z","cross_cats_sorted":[],"title_canon_sha256":"e5db8e7076ed6330d216b1845c344858b1eb30dcc814ae3163704ee31484b9d6","abstract_canon_sha256":"3eed07b68b8f81c03f882da809147934058ec73494aa8114cb1ce342b26bde5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:16.489377Z","signature_b64":"AwsK1g9xLeovrT4+xFDNeI6TDXwSCw3RyBMcq/Me2qx2wpLUSmbi5OnXQ/HLKmY8WESKu4uxN3E+A+f5e5afAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe8850595a8d2a382952b237b11afb6ef13afaf40c30153d1004c008a59dcae1","last_reissued_at":"2026-07-05T11:03:16.488899Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:16.488899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Submanifold Subgradient Method for Optimization over Stiefel Manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andy Yat-Ming Cheung, Anthony Man-Cho So, Jinxin Wang, Man-Chung Yue","submitted_at":"2024-09-03T10:29:57Z","abstract_excerpt":"Optimization over the Stiefel manifold is a fundamental computational problem in many scientific and engineering applications. Despite considerable research effort, high-dimensional optimization problems over the Stiefel manifold remain challenging, particularly when the objective function is nonsmooth. In this paper, we propose a novel coordinate-type algorithm, named \\emph{randomized submanifold subgradient method} (RSSM), for minimizing a possibly nonsmooth weakly convex function over the Stiefel manifold and study its convergence behavior. Similar to coordinate-type algorithms in the Eucli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.01770","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/2409.01770/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":"2409.01770","created_at":"2026-07-05T11:03:16.488955+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.01770v2","created_at":"2026-07-05T11:03:16.488955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.01770","created_at":"2026-07-05T11:03:16.488955+00:00"},{"alias_kind":"pith_short_12","alias_value":"72EFAWK2RUVD","created_at":"2026-07-05T11:03:16.488955+00:00"},{"alias_kind":"pith_short_16","alias_value":"72EFAWK2RUVDQKKS","created_at":"2026-07-05T11:03:16.488955+00:00"},{"alias_kind":"pith_short_8","alias_value":"72EFAWK2","created_at":"2026-07-05T11:03:16.488955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.12378","citing_title":"Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/72EFAWK2RUVDQKKSWI33CGX3N3","json":"https://pith.science/pith/72EFAWK2RUVDQKKSWI33CGX3N3.json","graph_json":"https://pith.science/api/pith-number/72EFAWK2RUVDQKKSWI33CGX3N3/graph.json","events_json":"https://pith.science/api/pith-number/72EFAWK2RUVDQKKSWI33CGX3N3/events.json","paper":"https://pith.science/paper/72EFAWK2"},"agent_actions":{"view_html":"https://pith.science/pith/72EFAWK2RUVDQKKSWI33CGX3N3","download_json":"https://pith.science/pith/72EFAWK2RUVDQKKSWI33CGX3N3.json","view_paper":"https://pith.science/paper/72EFAWK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.01770&json=true","fetch_graph":"https://pith.science/api/pith-number/72EFAWK2RUVDQKKSWI33CGX3N3/graph.json","fetch_events":"https://pith.science/api/pith-number/72EFAWK2RUVDQKKSWI33CGX3N3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72EFAWK2RUVDQKKSWI33CGX3N3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72EFAWK2RUVDQKKSWI33CGX3N3/action/storage_attestation","attest_author":"https://pith.science/pith/72EFAWK2RUVDQKKSWI33CGX3N3/action/author_attestation","sign_citation":"https://pith.science/pith/72EFAWK2RUVDQKKSWI33CGX3N3/action/citation_signature","submit_replication":"https://pith.science/pith/72EFAWK2RUVDQKKSWI33CGX3N3/action/replication_record"}},"created_at":"2026-07-05T11:03:16.488955+00:00","updated_at":"2026-07-05T11:03:16.488955+00:00"}