{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:2FOSSQLJEYSZUIQ6IYQC76CN2X","short_pith_number":"pith:2FOSSQLJ","schema_version":"1.0","canonical_sha256":"d15d29416926259a221e46202ff84dd5f394783933ee6e5c03f9cb431d531a81","source":{"kind":"arxiv","id":"2110.08986","version":3},"attestation_state":"computed","paper":{"title":"Solving Optimization Problems over the Stiefel Manifold by Smooth Exact Penalty Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nachuan Xiao, Xin Liu","submitted_at":"2021-10-18T02:42:11Z","abstract_excerpt":"In this paper, we present a novel penalty model called ExPen for optimization over the Stiefel manifold. Different from existing penalty functions for orthogonality constraints, ExPen adopts a smooth penalty function without using any first-order derivative of the objective function. We show that all the first-order stationary points of ExPen with a sufficiently large penalty parameter are either feasible, namely, are the first-order stationary points of the original optimization problem, or far from the Stiefel manifold. Besides, the original problem and ExPen share the same second-order stat"},"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":"2110.08986","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-10-18T02:42:11Z","cross_cats_sorted":[],"title_canon_sha256":"a595df69f9326c8ebdf0d79c1ab78592c25518dbda0b7ceafe88d49e4977c206","abstract_canon_sha256":"ac4cbadca4b26bbb6b9a0e9eaea54e912b1e56f3fcaa46b6c6a6ccadffe66f59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:26:02.959648Z","signature_b64":"meg0xlcsFgN73AUjdOFdqNNPDEzDy4xS8+SyT6M8dWAXJGs2afz0jLwNrwfbudjm66c6q0TmhbFEp3VQ4HvQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d15d29416926259a221e46202ff84dd5f394783933ee6e5c03f9cb431d531a81","last_reissued_at":"2026-07-05T05:26:02.959181Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:26:02.959181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Optimization Problems over the Stiefel Manifold by Smooth Exact Penalty Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nachuan Xiao, Xin Liu","submitted_at":"2021-10-18T02:42:11Z","abstract_excerpt":"In this paper, we present a novel penalty model called ExPen for optimization over the Stiefel manifold. Different from existing penalty functions for orthogonality constraints, ExPen adopts a smooth penalty function without using any first-order derivative of the objective function. We show that all the first-order stationary points of ExPen with a sufficiently large penalty parameter are either feasible, namely, are the first-order stationary points of the original optimization problem, or far from the Stiefel manifold. Besides, the original problem and ExPen share the same second-order stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.08986","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/2110.08986/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":"2110.08986","created_at":"2026-07-05T05:26:02.959241+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.08986v3","created_at":"2026-07-05T05:26:02.959241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.08986","created_at":"2026-07-05T05:26:02.959241+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FOSSQLJEYSZ","created_at":"2026-07-05T05:26:02.959241+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FOSSQLJEYSZUIQ6","created_at":"2026-07-05T05:26:02.959241+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FOSSQLJ","created_at":"2026-07-05T05:26:02.959241+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27189","citing_title":"Benign Landscape of Quadratic Programs with Orthogonality Constraints and Its Application to Heteroscedastic Probabilistic PCA","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2FOSSQLJEYSZUIQ6IYQC76CN2X","json":"https://pith.science/pith/2FOSSQLJEYSZUIQ6IYQC76CN2X.json","graph_json":"https://pith.science/api/pith-number/2FOSSQLJEYSZUIQ6IYQC76CN2X/graph.json","events_json":"https://pith.science/api/pith-number/2FOSSQLJEYSZUIQ6IYQC76CN2X/events.json","paper":"https://pith.science/paper/2FOSSQLJ"},"agent_actions":{"view_html":"https://pith.science/pith/2FOSSQLJEYSZUIQ6IYQC76CN2X","download_json":"https://pith.science/pith/2FOSSQLJEYSZUIQ6IYQC76CN2X.json","view_paper":"https://pith.science/paper/2FOSSQLJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.08986&json=true","fetch_graph":"https://pith.science/api/pith-number/2FOSSQLJEYSZUIQ6IYQC76CN2X/graph.json","fetch_events":"https://pith.science/api/pith-number/2FOSSQLJEYSZUIQ6IYQC76CN2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FOSSQLJEYSZUIQ6IYQC76CN2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FOSSQLJEYSZUIQ6IYQC76CN2X/action/storage_attestation","attest_author":"https://pith.science/pith/2FOSSQLJEYSZUIQ6IYQC76CN2X/action/author_attestation","sign_citation":"https://pith.science/pith/2FOSSQLJEYSZUIQ6IYQC76CN2X/action/citation_signature","submit_replication":"https://pith.science/pith/2FOSSQLJEYSZUIQ6IYQC76CN2X/action/replication_record"}},"created_at":"2026-07-05T05:26:02.959241+00:00","updated_at":"2026-07-05T05:26:02.959241+00:00"}