{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LOBBDZE55PTJIXTQQ6DO6FY32J","short_pith_number":"pith:LOBBDZE5","schema_version":"1.0","canonical_sha256":"5b8211e49debe6945e708786ef171bd267aa69860d08a2b1177a60e1168a91bf","source":{"kind":"arxiv","id":"1411.0795","version":1},"attestation_state":"computed","paper":{"title":"The CP-matrix Approximation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anwa Zhou, Jinyan Fan","submitted_at":"2014-11-04T06:06:04Z","abstract_excerpt":"A symmetric matrix $A$ is completely positive (CP) if there exists an entrywise nonnegative matrix $V$ such that $A = V V ^T$. In this paper, we study the CP-matrix approximation problem of projecting a matrix onto the intersection of a set of linear constraints and the cone of CP matrices. We formulate the problem as the linear optimization with the norm cone and the cone of moments. A semidefinite algorithm is presented for the problem. A CP-decomposition of the projection matrix can also be obtained if the problem is feasible."},"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":"1411.0795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-04T06:06:04Z","cross_cats_sorted":[],"title_canon_sha256":"908151999d8cac4b5a95d3abe975dc23535a3a050481fa4967359d2d37100daf","abstract_canon_sha256":"735ef364f0515691a3a97b212bb6be796937211f05401d68c4f680a1c4df6294"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:38.242903Z","signature_b64":"3l7dM++XtkxoTFA3rLDlinjt0jgVVNEKO8thRrezyG0fFjxYE/RHtrLdkslXhPLYPp5TVLIK62gHPjTRLkE2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b8211e49debe6945e708786ef171bd267aa69860d08a2b1177a60e1168a91bf","last_reissued_at":"2026-05-18T02:38:38.242487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:38.242487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The CP-matrix Approximation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anwa Zhou, Jinyan Fan","submitted_at":"2014-11-04T06:06:04Z","abstract_excerpt":"A symmetric matrix $A$ is completely positive (CP) if there exists an entrywise nonnegative matrix $V$ such that $A = V V ^T$. In this paper, we study the CP-matrix approximation problem of projecting a matrix onto the intersection of a set of linear constraints and the cone of CP matrices. We formulate the problem as the linear optimization with the norm cone and the cone of moments. A semidefinite algorithm is presented for the problem. A CP-decomposition of the projection matrix can also be obtained if the problem is feasible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0795","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":"1411.0795","created_at":"2026-05-18T02:38:38.242547+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0795v1","created_at":"2026-05-18T02:38:38.242547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0795","created_at":"2026-05-18T02:38:38.242547+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOBBDZE55PTJ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOBBDZE55PTJIXTQ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOBBDZE5","created_at":"2026-05-18T12:28:38.356838+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/LOBBDZE55PTJIXTQQ6DO6FY32J","json":"https://pith.science/pith/LOBBDZE55PTJIXTQQ6DO6FY32J.json","graph_json":"https://pith.science/api/pith-number/LOBBDZE55PTJIXTQQ6DO6FY32J/graph.json","events_json":"https://pith.science/api/pith-number/LOBBDZE55PTJIXTQQ6DO6FY32J/events.json","paper":"https://pith.science/paper/LOBBDZE5"},"agent_actions":{"view_html":"https://pith.science/pith/LOBBDZE55PTJIXTQQ6DO6FY32J","download_json":"https://pith.science/pith/LOBBDZE55PTJIXTQQ6DO6FY32J.json","view_paper":"https://pith.science/paper/LOBBDZE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0795&json=true","fetch_graph":"https://pith.science/api/pith-number/LOBBDZE55PTJIXTQQ6DO6FY32J/graph.json","fetch_events":"https://pith.science/api/pith-number/LOBBDZE55PTJIXTQQ6DO6FY32J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOBBDZE55PTJIXTQQ6DO6FY32J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOBBDZE55PTJIXTQQ6DO6FY32J/action/storage_attestation","attest_author":"https://pith.science/pith/LOBBDZE55PTJIXTQQ6DO6FY32J/action/author_attestation","sign_citation":"https://pith.science/pith/LOBBDZE55PTJIXTQQ6DO6FY32J/action/citation_signature","submit_replication":"https://pith.science/pith/LOBBDZE55PTJIXTQQ6DO6FY32J/action/replication_record"}},"created_at":"2026-05-18T02:38:38.242547+00:00","updated_at":"2026-05-18T02:38:38.242547+00:00"}