{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LNV3YY53H5T4VYZRSXBBOSETJ6","short_pith_number":"pith:LNV3YY53","schema_version":"1.0","canonical_sha256":"5b6bbc63bb3f67cae33195c21748934f93139306d3294ff755e344255bd09753","source":{"kind":"arxiv","id":"1906.01509","version":3},"attestation_state":"computed","paper":{"title":"High-order Moment Portfolio Optimization via An Accelerated Difference-of-Convex Programming Approach and Sums-of-Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dinh Tao Pham, Hoai An Le Thi, Ya-Juan Wang, Yi-Shuai Niu","submitted_at":"2019-06-04T15:20:48Z","abstract_excerpt":"The Mean-Variance-Skewness-Kurtosis (MVSK) portfolio optimization model is a quartic nonconvex polynomial minimization problem over a polytope, which can be formulated as a Difference-of-Convex (DC) program. In this manuscript, we investigate four DC programming approaches for solving the MVSK model. First, two DC formulations based on the projective DC decomposition and the Difference-of-Convex-Sums-of-Squares (DC-SOS) decomposition are established, where the second one is novel. Then, DCA is applied to solve these DC formulations. The convergence analysis of DCA for the MVSK model is establi"},"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.01509","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-04T15:20:48Z","cross_cats_sorted":[],"title_canon_sha256":"19b69536520dbcbd65a0894178522a3d08a10e50abd24660fe7ae53d4f3861e6","abstract_canon_sha256":"1864b0f9e0ab67ccce28fbd4738c1b894bdb09da514e636a386321bb7200a2ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:20:41.752750Z","signature_b64":"JgWkmuvI1TJkx57F7NDe0eC2Z/GC+ZHo8LAMPijTBNcGqrDKCfKkpwXYPb60x5qcsl4a2IT7W22lx39NE6PyBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b6bbc63bb3f67cae33195c21748934f93139306d3294ff755e344255bd09753","last_reissued_at":"2026-07-05T04:20:41.752260Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:20:41.752260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-order Moment Portfolio Optimization via An Accelerated Difference-of-Convex Programming Approach and Sums-of-Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dinh Tao Pham, Hoai An Le Thi, Ya-Juan Wang, Yi-Shuai Niu","submitted_at":"2019-06-04T15:20:48Z","abstract_excerpt":"The Mean-Variance-Skewness-Kurtosis (MVSK) portfolio optimization model is a quartic nonconvex polynomial minimization problem over a polytope, which can be formulated as a Difference-of-Convex (DC) program. In this manuscript, we investigate four DC programming approaches for solving the MVSK model. First, two DC formulations based on the projective DC decomposition and the Difference-of-Convex-Sums-of-Squares (DC-SOS) decomposition are established, where the second one is novel. Then, DCA is applied to solve these DC formulations. The convergence analysis of DCA for the MVSK model is establi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01509","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/1906.01509/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":"1906.01509","created_at":"2026-07-05T04:20:41.752323+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01509v3","created_at":"2026-07-05T04:20:41.752323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01509","created_at":"2026-07-05T04:20:41.752323+00:00"},{"alias_kind":"pith_short_12","alias_value":"LNV3YY53H5T4","created_at":"2026-07-05T04:20:41.752323+00:00"},{"alias_kind":"pith_short_16","alias_value":"LNV3YY53H5T4VYZR","created_at":"2026-07-05T04:20:41.752323+00:00"},{"alias_kind":"pith_short_8","alias_value":"LNV3YY53","created_at":"2026-07-05T04:20:41.752323+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.25378","citing_title":"Yau's Affine-Normal Descent for Large-Scale Unrestricted Higher-Moment Portfolio Optimization","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06575","citing_title":"Polylab: A MATLAB Toolbox for Multivariate Polynomial Modeling","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LNV3YY53H5T4VYZRSXBBOSETJ6","json":"https://pith.science/pith/LNV3YY53H5T4VYZRSXBBOSETJ6.json","graph_json":"https://pith.science/api/pith-number/LNV3YY53H5T4VYZRSXBBOSETJ6/graph.json","events_json":"https://pith.science/api/pith-number/LNV3YY53H5T4VYZRSXBBOSETJ6/events.json","paper":"https://pith.science/paper/LNV3YY53"},"agent_actions":{"view_html":"https://pith.science/pith/LNV3YY53H5T4VYZRSXBBOSETJ6","download_json":"https://pith.science/pith/LNV3YY53H5T4VYZRSXBBOSETJ6.json","view_paper":"https://pith.science/paper/LNV3YY53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01509&json=true","fetch_graph":"https://pith.science/api/pith-number/LNV3YY53H5T4VYZRSXBBOSETJ6/graph.json","fetch_events":"https://pith.science/api/pith-number/LNV3YY53H5T4VYZRSXBBOSETJ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LNV3YY53H5T4VYZRSXBBOSETJ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LNV3YY53H5T4VYZRSXBBOSETJ6/action/storage_attestation","attest_author":"https://pith.science/pith/LNV3YY53H5T4VYZRSXBBOSETJ6/action/author_attestation","sign_citation":"https://pith.science/pith/LNV3YY53H5T4VYZRSXBBOSETJ6/action/citation_signature","submit_replication":"https://pith.science/pith/LNV3YY53H5T4VYZRSXBBOSETJ6/action/replication_record"}},"created_at":"2026-07-05T04:20:41.752323+00:00","updated_at":"2026-07-05T04:20:41.752323+00:00"}