{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7ECIHEYVZYVLR7J5B4TJRTSP3X","short_pith_number":"pith:7ECIHEYV","schema_version":"1.0","canonical_sha256":"f904839315ce2ab8fd3d0f2698ce4fddc2e65ae725765b7ee4cfee09ee93b9ef","source":{"kind":"arxiv","id":"1906.00504","version":1},"attestation_state":"computed","paper":{"title":"Optimality Conditions for Cardinality-Constrained Programs and a SCA Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Baiyi Wu, Qiying Hu, Zhongyi Jiang","submitted_at":"2019-06-02T23:40:00Z","abstract_excerpt":"We study a cardinality-constrained optimization problem with nonnegative variables in this paper. This problem is often encountered in practice.\n  Firstly we study some properties on the optimal solutions of this optimization problem under some conditions. An equivalent reformulation of the problem under consideration is proposed. Based on the reformulation, we present a successive convex approximation method for the cardinality constrained optimization problem. We prove that the method converges to a KKT point of the reformulation problem. Under some conditions, the KKT points of the reformul"},"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":"1906.00504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-02T23:40:00Z","cross_cats_sorted":[],"title_canon_sha256":"05aa6a6d193da84414bf9c16b74e445cab486bd252216d8aa481fd2e053f8b0e","abstract_canon_sha256":"8e74588e6d3fc4546c8e1621ab83b683eb5fe118867cfec9934eb885d785298f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:26.895610Z","signature_b64":"5JJKy7nxTQ6AOmtf5mMk7QxXkxgLOogIfrGn+Dz0CnRMCNgkUN6KFdYMbS+kYL+4xG8oYuRHMONUYLGdYoQCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f904839315ce2ab8fd3d0f2698ce4fddc2e65ae725765b7ee4cfee09ee93b9ef","last_reissued_at":"2026-05-17T23:44:26.894904Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:26.894904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimality Conditions for Cardinality-Constrained Programs and a SCA Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Baiyi Wu, Qiying Hu, Zhongyi Jiang","submitted_at":"2019-06-02T23:40:00Z","abstract_excerpt":"We study a cardinality-constrained optimization problem with nonnegative variables in this paper. This problem is often encountered in practice.\n  Firstly we study some properties on the optimal solutions of this optimization problem under some conditions. An equivalent reformulation of the problem under consideration is proposed. Based on the reformulation, we present a successive convex approximation method for the cardinality constrained optimization problem. We prove that the method converges to a KKT point of the reformulation problem. Under some conditions, the KKT points of the reformul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00504","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.00504","created_at":"2026-05-17T23:44:26.895031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00504v1","created_at":"2026-05-17T23:44:26.895031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00504","created_at":"2026-05-17T23:44:26.895031+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ECIHEYVZYVL","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ECIHEYVZYVLR7J5","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ECIHEYV","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7ECIHEYVZYVLR7J5B4TJRTSP3X","json":"https://pith.science/pith/7ECIHEYVZYVLR7J5B4TJRTSP3X.json","graph_json":"https://pith.science/api/pith-number/7ECIHEYVZYVLR7J5B4TJRTSP3X/graph.json","events_json":"https://pith.science/api/pith-number/7ECIHEYVZYVLR7J5B4TJRTSP3X/events.json","paper":"https://pith.science/paper/7ECIHEYV"},"agent_actions":{"view_html":"https://pith.science/pith/7ECIHEYVZYVLR7J5B4TJRTSP3X","download_json":"https://pith.science/pith/7ECIHEYVZYVLR7J5B4TJRTSP3X.json","view_paper":"https://pith.science/paper/7ECIHEYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00504&json=true","fetch_graph":"https://pith.science/api/pith-number/7ECIHEYVZYVLR7J5B4TJRTSP3X/graph.json","fetch_events":"https://pith.science/api/pith-number/7ECIHEYVZYVLR7J5B4TJRTSP3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ECIHEYVZYVLR7J5B4TJRTSP3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ECIHEYVZYVLR7J5B4TJRTSP3X/action/storage_attestation","attest_author":"https://pith.science/pith/7ECIHEYVZYVLR7J5B4TJRTSP3X/action/author_attestation","sign_citation":"https://pith.science/pith/7ECIHEYVZYVLR7J5B4TJRTSP3X/action/citation_signature","submit_replication":"https://pith.science/pith/7ECIHEYVZYVLR7J5B4TJRTSP3X/action/replication_record"}},"created_at":"2026-05-17T23:44:26.895031+00:00","updated_at":"2026-05-17T23:44:26.895031+00:00"}