{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2ZQD4OR4RA5TCYRUDXHNXLAJTW","short_pith_number":"pith:2ZQD4OR4","schema_version":"1.0","canonical_sha256":"d6603e3a3c883b3162341dcedbac099d847c2bbaa8f9ed4f8c1d374f494ae650","source":{"kind":"arxiv","id":"1305.0632","version":2},"attestation_state":"computed","paper":{"title":"The CP-matrix completion 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":"2013-05-03T07:53:03Z","abstract_excerpt":"A symmetric matrix $C$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $C=BB^T$. The CP-completion problem is to study whether we can assign values to the missing entries of a partial matrix (i.e., a matrix having unknown entries) such that the completed matrix is completely positive. We propose a semidefinite algorithm for solving general CP-completion problems, and study its properties. When all the diagonal entries are given, the algorithm can give a certificate if a partial matrix is not CP-completable, and it almost always gives a CP-completion if"},"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":"1305.0632","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-05-03T07:53:03Z","cross_cats_sorted":[],"title_canon_sha256":"114d2daebd22488ec21233db7959c197ff70ac32e717bdb0b56d79b28de43ec3","abstract_canon_sha256":"e2c72d8e27bac3d229e26b394a0bbfa225ac72ee3216939a83ddeaad45c0923c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:42.903889Z","signature_b64":"muezy5ebXHjWtnSXyTK3Y4E2QTl8leZ7Dt3XViAajzFvFRnoxOyG6cSjuKthc5SgPR070YPJDKw/diuq/rOwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6603e3a3c883b3162341dcedbac099d847c2bbaa8f9ed4f8c1d374f494ae650","last_reissued_at":"2026-05-18T03:06:42.903392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:42.903392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The CP-matrix completion 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":"2013-05-03T07:53:03Z","abstract_excerpt":"A symmetric matrix $C$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $C=BB^T$. The CP-completion problem is to study whether we can assign values to the missing entries of a partial matrix (i.e., a matrix having unknown entries) such that the completed matrix is completely positive. We propose a semidefinite algorithm for solving general CP-completion problems, and study its properties. When all the diagonal entries are given, the algorithm can give a certificate if a partial matrix is not CP-completable, and it almost always gives a CP-completion if"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0632","kind":"arxiv","version":2},"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":"1305.0632","created_at":"2026-05-18T03:06:42.903464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0632v2","created_at":"2026-05-18T03:06:42.903464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0632","created_at":"2026-05-18T03:06:42.903464+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZQD4OR4RA5T","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZQD4OR4RA5TCYRU","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZQD4OR4","created_at":"2026-05-18T12:27:32.513160+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/2ZQD4OR4RA5TCYRUDXHNXLAJTW","json":"https://pith.science/pith/2ZQD4OR4RA5TCYRUDXHNXLAJTW.json","graph_json":"https://pith.science/api/pith-number/2ZQD4OR4RA5TCYRUDXHNXLAJTW/graph.json","events_json":"https://pith.science/api/pith-number/2ZQD4OR4RA5TCYRUDXHNXLAJTW/events.json","paper":"https://pith.science/paper/2ZQD4OR4"},"agent_actions":{"view_html":"https://pith.science/pith/2ZQD4OR4RA5TCYRUDXHNXLAJTW","download_json":"https://pith.science/pith/2ZQD4OR4RA5TCYRUDXHNXLAJTW.json","view_paper":"https://pith.science/paper/2ZQD4OR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0632&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZQD4OR4RA5TCYRUDXHNXLAJTW/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZQD4OR4RA5TCYRUDXHNXLAJTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZQD4OR4RA5TCYRUDXHNXLAJTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZQD4OR4RA5TCYRUDXHNXLAJTW/action/storage_attestation","attest_author":"https://pith.science/pith/2ZQD4OR4RA5TCYRUDXHNXLAJTW/action/author_attestation","sign_citation":"https://pith.science/pith/2ZQD4OR4RA5TCYRUDXHNXLAJTW/action/citation_signature","submit_replication":"https://pith.science/pith/2ZQD4OR4RA5TCYRUDXHNXLAJTW/action/replication_record"}},"created_at":"2026-05-18T03:06:42.903464+00:00","updated_at":"2026-05-18T03:06:42.903464+00:00"}