{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EYYIZV3ZHZAWYTEH2XKCBLKRGE","short_pith_number":"pith:EYYIZV3Z","schema_version":"1.0","canonical_sha256":"26308cd7793e416c4c87d5d420ad5131132cc0660cf049dec44c0b9429360f81","source":{"kind":"arxiv","id":"1903.07325","version":1},"attestation_state":"computed","paper":{"title":"Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Masakazu Kojima, Sunyoung Kim","submitted_at":"2019-03-18T09:32:06Z","abstract_excerpt":"We study the equivalence among a nonconvex QOP, its CPP and DNN relaxations under the assumption that the aggregated and correlative sparsity of the data matrices of the CPP relaxation is represented by a block-clique graph $G$. By exploiting the correlative sparsity, we decompose the CPP relaxation problem into a clique-tree structured family of smaller subproblems. Each subproblem is associated with a node of a clique tree of $G$. The optimal value can be obtained by applying an algorithm that we propose for solving the subproblems recursively from leaf nodes to the root node of the clique-t"},"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":"1903.07325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T09:32:06Z","cross_cats_sorted":[],"title_canon_sha256":"bfe2f177ebb49d28f7b21a92f67ad5f82b661b84cddf82d794c270bb5815e73f","abstract_canon_sha256":"0e33a6c327188ea499bb126d5d5be2a31f7de7b2b4c529f2e2706a831b64f517"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:01.711277Z","signature_b64":"tMpmgHo/eKp7eHJ5LlAHhG070C+mZ7ZwxbYCqyNXtdyKmZpsOrXKf8lkSmINlgPTi8vxkTQKSwsrfX/wHVPmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26308cd7793e416c4c87d5d420ad5131132cc0660cf049dec44c0b9429360f81","last_reissued_at":"2026-05-17T23:51:01.710805Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:01.710805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Masakazu Kojima, Sunyoung Kim","submitted_at":"2019-03-18T09:32:06Z","abstract_excerpt":"We study the equivalence among a nonconvex QOP, its CPP and DNN relaxations under the assumption that the aggregated and correlative sparsity of the data matrices of the CPP relaxation is represented by a block-clique graph $G$. By exploiting the correlative sparsity, we decompose the CPP relaxation problem into a clique-tree structured family of smaller subproblems. Each subproblem is associated with a node of a clique tree of $G$. The optimal value can be obtained by applying an algorithm that we propose for solving the subproblems recursively from leaf nodes to the root node of the clique-t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07325","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":"1903.07325","created_at":"2026-05-17T23:51:01.710880+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.07325v1","created_at":"2026-05-17T23:51:01.710880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07325","created_at":"2026-05-17T23:51:01.710880+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYYIZV3ZHZAW","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYYIZV3ZHZAWYTEH","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYYIZV3Z","created_at":"2026-05-18T12:33:15.570797+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/EYYIZV3ZHZAWYTEH2XKCBLKRGE","json":"https://pith.science/pith/EYYIZV3ZHZAWYTEH2XKCBLKRGE.json","graph_json":"https://pith.science/api/pith-number/EYYIZV3ZHZAWYTEH2XKCBLKRGE/graph.json","events_json":"https://pith.science/api/pith-number/EYYIZV3ZHZAWYTEH2XKCBLKRGE/events.json","paper":"https://pith.science/paper/EYYIZV3Z"},"agent_actions":{"view_html":"https://pith.science/pith/EYYIZV3ZHZAWYTEH2XKCBLKRGE","download_json":"https://pith.science/pith/EYYIZV3ZHZAWYTEH2XKCBLKRGE.json","view_paper":"https://pith.science/paper/EYYIZV3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.07325&json=true","fetch_graph":"https://pith.science/api/pith-number/EYYIZV3ZHZAWYTEH2XKCBLKRGE/graph.json","fetch_events":"https://pith.science/api/pith-number/EYYIZV3ZHZAWYTEH2XKCBLKRGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYYIZV3ZHZAWYTEH2XKCBLKRGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYYIZV3ZHZAWYTEH2XKCBLKRGE/action/storage_attestation","attest_author":"https://pith.science/pith/EYYIZV3ZHZAWYTEH2XKCBLKRGE/action/author_attestation","sign_citation":"https://pith.science/pith/EYYIZV3ZHZAWYTEH2XKCBLKRGE/action/citation_signature","submit_replication":"https://pith.science/pith/EYYIZV3ZHZAWYTEH2XKCBLKRGE/action/replication_record"}},"created_at":"2026-05-17T23:51:01.710880+00:00","updated_at":"2026-05-17T23:51:01.710880+00:00"}