{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:J47STEB2OJSO6R73J5BDBYQ7AC","short_pith_number":"pith:J47STEB2","schema_version":"1.0","canonical_sha256":"4f3f29903a7264ef47fb4f4230e21f00a74647c726bef5dce959b960ed2b9f2f","source":{"kind":"arxiv","id":"1203.6602","version":2},"attestation_state":"computed","paper":{"title":"Complexity of the positive semidefinite matrix completion problem with a rank constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Antonios Varvitsiotis, Marianna Eisenberg-Nagy, Monique Laurent","submitted_at":"2012-03-29T17:40:17Z","abstract_excerpt":"We consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most $k$. We show that this problem is $\\NP$-hard for any fixed integer $k\\ge 2$. Equivalently, for $k\\ge 2$, it is $\\NP$-hard to test membership in the rank constrained elliptope $\\EE_k(G)$, i.e., the set of all partial matrices with off-diagonal entries specified at the edges of $G$, that can be completed to a positive semidefinite matrix of rank at most $k$. Additionally, we show that deciding membership in the conve"},"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":"1203.6602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-29T17:40:17Z","cross_cats_sorted":[],"title_canon_sha256":"d9abbf82982f3a36fc5a556ba159be4250d9fb37996ca50d43fa3091169dacb2","abstract_canon_sha256":"8517ef53f16fdd9ceca446db04db65fe944fbadc3b6a2f7be102727a6173c299"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:22.975290Z","signature_b64":"mr5daX5wCbaFEjt3hR6Hx2cLI6bl8kTAxWmOr1kZwNTqJ4Nj7JxcUTvv8xWbbCkejI896SygHJD1j/D9JM8qCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f3f29903a7264ef47fb4f4230e21f00a74647c726bef5dce959b960ed2b9f2f","last_reissued_at":"2026-05-18T03:45:22.974748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:22.974748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of the positive semidefinite matrix completion problem with a rank constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Antonios Varvitsiotis, Marianna Eisenberg-Nagy, Monique Laurent","submitted_at":"2012-03-29T17:40:17Z","abstract_excerpt":"We consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most $k$. We show that this problem is $\\NP$-hard for any fixed integer $k\\ge 2$. Equivalently, for $k\\ge 2$, it is $\\NP$-hard to test membership in the rank constrained elliptope $\\EE_k(G)$, i.e., the set of all partial matrices with off-diagonal entries specified at the edges of $G$, that can be completed to a positive semidefinite matrix of rank at most $k$. Additionally, we show that deciding membership in the conve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6602","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":"1203.6602","created_at":"2026-05-18T03:45:22.974832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.6602v2","created_at":"2026-05-18T03:45:22.974832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6602","created_at":"2026-05-18T03:45:22.974832+00:00"},{"alias_kind":"pith_short_12","alias_value":"J47STEB2OJSO","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"J47STEB2OJSO6R73","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"J47STEB2","created_at":"2026-05-18T12:27:09.501522+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/J47STEB2OJSO6R73J5BDBYQ7AC","json":"https://pith.science/pith/J47STEB2OJSO6R73J5BDBYQ7AC.json","graph_json":"https://pith.science/api/pith-number/J47STEB2OJSO6R73J5BDBYQ7AC/graph.json","events_json":"https://pith.science/api/pith-number/J47STEB2OJSO6R73J5BDBYQ7AC/events.json","paper":"https://pith.science/paper/J47STEB2"},"agent_actions":{"view_html":"https://pith.science/pith/J47STEB2OJSO6R73J5BDBYQ7AC","download_json":"https://pith.science/pith/J47STEB2OJSO6R73J5BDBYQ7AC.json","view_paper":"https://pith.science/paper/J47STEB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.6602&json=true","fetch_graph":"https://pith.science/api/pith-number/J47STEB2OJSO6R73J5BDBYQ7AC/graph.json","fetch_events":"https://pith.science/api/pith-number/J47STEB2OJSO6R73J5BDBYQ7AC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J47STEB2OJSO6R73J5BDBYQ7AC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J47STEB2OJSO6R73J5BDBYQ7AC/action/storage_attestation","attest_author":"https://pith.science/pith/J47STEB2OJSO6R73J5BDBYQ7AC/action/author_attestation","sign_citation":"https://pith.science/pith/J47STEB2OJSO6R73J5BDBYQ7AC/action/citation_signature","submit_replication":"https://pith.science/pith/J47STEB2OJSO6R73J5BDBYQ7AC/action/replication_record"}},"created_at":"2026-05-18T03:45:22.974832+00:00","updated_at":"2026-05-18T03:45:22.974832+00:00"}