{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:CNRWB77ID7VVXDHVFNMPP4KFTT","short_pith_number":"pith:CNRWB77I","canonical_record":{"source":{"id":"2304.03641","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-04-07T13:44:59Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"0ab09673df2a32c7910f6aa4f84a0e8ae1942e0310f21c4400f1ccc19e3f1bdb","abstract_canon_sha256":"e0055bca35d65cee2f82c0f9e52b16da99f8eca6a16fe055f3e61bf6aa8bd56a"},"schema_version":"1.0"},"canonical_sha256":"136360ffe81feb5b8cf52b58f7f1459cf6b712a855c69563ce0fd9fdb67cb9df","source":{"kind":"arxiv","id":"2304.03641","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.03641","created_at":"2026-05-17T23:39:01Z"},{"alias_kind":"arxiv_version","alias_value":"2304.03641v4","created_at":"2026-05-17T23:39:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03641","created_at":"2026-05-17T23:39:01Z"},{"alias_kind":"pith_short_12","alias_value":"CNRWB77ID7VV","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"CNRWB77ID7VVXDHV","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"CNRWB77I","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:CNRWB77ID7VVXDHVFNMPP4KFTT","target":"record","payload":{"canonical_record":{"source":{"id":"2304.03641","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-04-07T13:44:59Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"0ab09673df2a32c7910f6aa4f84a0e8ae1942e0310f21c4400f1ccc19e3f1bdb","abstract_canon_sha256":"e0055bca35d65cee2f82c0f9e52b16da99f8eca6a16fe055f3e61bf6aa8bd56a"},"schema_version":"1.0"},"canonical_sha256":"136360ffe81feb5b8cf52b58f7f1459cf6b712a855c69563ce0fd9fdb67cb9df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:01.889746Z","signature_b64":"0rUpdXrLhk+P3bI7sT00gRw5gciFDDqu0C8liJt/zxRw5xtaIlgihOXnT2p4roR2OojnrcgR/eYz/4YBFGtuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"136360ffe81feb5b8cf52b58f7f1459cf6b712a855c69563ce0fd9fdb67cb9df","last_reissued_at":"2026-05-17T23:39:01.888703Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:01.888703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.03641","source_version":4,"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:39:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fm4WQyAHhv/Dhu2bxz3uL9RQewu7Jc2VsczT4IMlry8qysgh4OpINkL+ScKerk09SqxbB7FsdPhjHnVTlXkeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:04:59.186867Z"},"content_sha256":"4051e4a317d53cf167769ffe55cff393d6dffb0eb4ea0f5974f6d926795d5d48","schema_version":"1.0","event_id":"sha256:4051e4a317d53cf167769ffe55cff393d6dffb0eb4ea0f5974f6d926795d5d48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:CNRWB77ID7VVXDHVFNMPP4KFTT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Ganzhao Yuan","submitted_at":"2023-04-07T13:44:59Z","abstract_excerpt":"Nonsmooth composite optimization with orthogonality constraints has a wide range of applications in statistical learning and data science. However, this problem is challenging due to its nonsmooth objective and computationally expensive nonconvex constraints. In this paper, we propose a new approach called \\textbf{OBCD}, which leverages block coordinate descent to address these challenges. \\textbf{OBCD} is a feasible method with a small computational footprint. In each iteration, it updates \\(k\\) rows of the solution matrix, where \\(k \\geq 2\\), by globally solving a small nonsmooth optimizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.03641","kind":"arxiv","version":4},"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:39:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gqnc5z8ZYnW+QNG1UAUzluqUwksIRZbnBXNxc6NQcXTUYBGVCwqDh5j3SqNQUC9IYfi2BWXEg3uYBJUH3F2PCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:04:59.187508Z"},"content_sha256":"0750f1605d7278d42190ce21c0f47b07a37174a4d3c39e06e02b3065c467321b","schema_version":"1.0","event_id":"sha256:0750f1605d7278d42190ce21c0f47b07a37174a4d3c39e06e02b3065c467321b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CNRWB77ID7VVXDHVFNMPP4KFTT/bundle.json","state_url":"https://pith.science/pith/CNRWB77ID7VVXDHVFNMPP4KFTT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CNRWB77ID7VVXDHVFNMPP4KFTT/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-05-25T07:04:59Z","links":{"resolver":"https://pith.science/pith/CNRWB77ID7VVXDHVFNMPP4KFTT","bundle":"https://pith.science/pith/CNRWB77ID7VVXDHVFNMPP4KFTT/bundle.json","state":"https://pith.science/pith/CNRWB77ID7VVXDHVFNMPP4KFTT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CNRWB77ID7VVXDHVFNMPP4KFTT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CNRWB77ID7VVXDHVFNMPP4KFTT","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":"e0055bca35d65cee2f82c0f9e52b16da99f8eca6a16fe055f3e61bf6aa8bd56a","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-04-07T13:44:59Z","title_canon_sha256":"0ab09673df2a32c7910f6aa4f84a0e8ae1942e0310f21c4400f1ccc19e3f1bdb"},"schema_version":"1.0","source":{"id":"2304.03641","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.03641","created_at":"2026-05-17T23:39:01Z"},{"alias_kind":"arxiv_version","alias_value":"2304.03641v4","created_at":"2026-05-17T23:39:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03641","created_at":"2026-05-17T23:39:01Z"},{"alias_kind":"pith_short_12","alias_value":"CNRWB77ID7VV","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"CNRWB77ID7VVXDHV","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"CNRWB77I","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:0750f1605d7278d42190ce21c0f47b07a37174a4d3c39e06e02b3065c467321b","target":"graph","created_at":"2026-05-17T23:39:01Z","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":"Nonsmooth composite optimization with orthogonality constraints has a wide range of applications in statistical learning and data science. However, this problem is challenging due to its nonsmooth objective and computationally expensive nonconvex constraints. In this paper, we propose a new approach called \\textbf{OBCD}, which leverages block coordinate descent to address these challenges. \\textbf{OBCD} is a feasible method with a small computational footprint. In each iteration, it updates \\(k\\) rows of the solution matrix, where \\(k \\geq 2\\), by globally solving a small nonsmooth optimizatio","authors_text":"Ganzhao Yuan","cross_cats":["cs.LG","cs.NA","math.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.03641","kind":"arxiv","version":4},"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:4051e4a317d53cf167769ffe55cff393d6dffb0eb4ea0f5974f6d926795d5d48","target":"record","created_at":"2026-05-17T23:39:01Z","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":"e0055bca35d65cee2f82c0f9e52b16da99f8eca6a16fe055f3e61bf6aa8bd56a","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-04-07T13:44:59Z","title_canon_sha256":"0ab09673df2a32c7910f6aa4f84a0e8ae1942e0310f21c4400f1ccc19e3f1bdb"},"schema_version":"1.0","source":{"id":"2304.03641","kind":"arxiv","version":4}},"canonical_sha256":"136360ffe81feb5b8cf52b58f7f1459cf6b712a855c69563ce0fd9fdb67cb9df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"136360ffe81feb5b8cf52b58f7f1459cf6b712a855c69563ce0fd9fdb67cb9df","first_computed_at":"2026-05-17T23:39:01.888703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:01.888703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0rUpdXrLhk+P3bI7sT00gRw5gciFDDqu0C8liJt/zxRw5xtaIlgihOXnT2p4roR2OojnrcgR/eYz/4YBFGtuCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:01.889746Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.03641","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4051e4a317d53cf167769ffe55cff393d6dffb0eb4ea0f5974f6d926795d5d48","sha256:0750f1605d7278d42190ce21c0f47b07a37174a4d3c39e06e02b3065c467321b"],"state_sha256":"4945204db53bf049c6dc85b87b9ba9910570c226a779e3e29a1dea5dd415140d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8IaX+y4XWV72kunefSqd3QJzjdDiXXHKP61v360e+IgT4tfUh8HfmzyZJKYCJufba7deWfeEeY3wi5n/V6NVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:04:59.191120Z","bundle_sha256":"c06cca26f3b4bdb5ed3abbb9c35d09328023f1aed6da393d76f8f5233ae82d5b"}}