{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:J47STEB2OJSO6R73J5BDBYQ7AC","short_pith_number":"pith:J47STEB2","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"},"canonical_sha256":"4f3f29903a7264ef47fb4f4230e21f00a74647c726bef5dce959b960ed2b9f2f","source":{"kind":"arxiv","id":"1203.6602","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.6602","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1203.6602v2","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6602","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"J47STEB2OJSO","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"J47STEB2OJSO6R73","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"J47STEB2","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:J47STEB2OJSO6R73J5BDBYQ7AC","target":"record","payload":{"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"},"canonical_sha256":"4f3f29903a7264ef47fb4f4230e21f00a74647c726bef5dce959b960ed2b9f2f","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"},"source_kind":"arxiv","source_id":"1203.6602","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XHG8qMxC6x2pk1/DNlrmVU9Ni3jOheR9IgJhLva6vaGpfxEKnqqxLWxtyt4h8EIHpO5OpS3EPXtlgGtHSRpWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:09:06.741411Z"},"content_sha256":"d942600559b622faec7ddc2e5899d9c49e0c16e531d2828cecaed712fd595d7c","schema_version":"1.0","event_id":"sha256:d942600559b622faec7ddc2e5899d9c49e0c16e531d2828cecaed712fd595d7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:J47STEB2OJSO6R73J5BDBYQ7AC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QCXEBy2183ilBsEzciuIUdZDhD/zgnTCUTeXdVKFECDr3+XtApf8lo2r0N1ToVd16Tx7pe+zmBnUkha7wAnCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:09:06.741779Z"},"content_sha256":"ea20b0741e4b7879b4015c7bba78a32d717b200d62762636ce3df69a3898e87f","schema_version":"1.0","event_id":"sha256:ea20b0741e4b7879b4015c7bba78a32d717b200d62762636ce3df69a3898e87f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J47STEB2OJSO6R73J5BDBYQ7AC/bundle.json","state_url":"https://pith.science/pith/J47STEB2OJSO6R73J5BDBYQ7AC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J47STEB2OJSO6R73J5BDBYQ7AC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T06:09:06Z","links":{"resolver":"https://pith.science/pith/J47STEB2OJSO6R73J5BDBYQ7AC","bundle":"https://pith.science/pith/J47STEB2OJSO6R73J5BDBYQ7AC/bundle.json","state":"https://pith.science/pith/J47STEB2OJSO6R73J5BDBYQ7AC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J47STEB2OJSO6R73J5BDBYQ7AC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:J47STEB2OJSO6R73J5BDBYQ7AC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8517ef53f16fdd9ceca446db04db65fe944fbadc3b6a2f7be102727a6173c299","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-29T17:40:17Z","title_canon_sha256":"d9abbf82982f3a36fc5a556ba159be4250d9fb37996ca50d43fa3091169dacb2"},"schema_version":"1.0","source":{"id":"1203.6602","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.6602","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1203.6602v2","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6602","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"J47STEB2OJSO","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"J47STEB2OJSO6R73","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"J47STEB2","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:ea20b0741e4b7879b4015c7bba78a32d717b200d62762636ce3df69a3898e87f","target":"graph","created_at":"2026-05-18T03:45:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Antonios Varvitsiotis, Marianna Eisenberg-Nagy, Monique Laurent","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-29T17:40:17Z","title":"Complexity of the positive semidefinite matrix completion problem with a rank constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6602","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d942600559b622faec7ddc2e5899d9c49e0c16e531d2828cecaed712fd595d7c","target":"record","created_at":"2026-05-18T03:45:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8517ef53f16fdd9ceca446db04db65fe944fbadc3b6a2f7be102727a6173c299","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-29T17:40:17Z","title_canon_sha256":"d9abbf82982f3a36fc5a556ba159be4250d9fb37996ca50d43fa3091169dacb2"},"schema_version":"1.0","source":{"id":"1203.6602","kind":"arxiv","version":2}},"canonical_sha256":"4f3f29903a7264ef47fb4f4230e21f00a74647c726bef5dce959b960ed2b9f2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f3f29903a7264ef47fb4f4230e21f00a74647c726bef5dce959b960ed2b9f2f","first_computed_at":"2026-05-18T03:45:22.974748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:22.974748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mr5daX5wCbaFEjt3hR6Hx2cLI6bl8kTAxWmOr1kZwNTqJ4Nj7JxcUTvv8xWbbCkejI896SygHJD1j/D9JM8qCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:22.975290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.6602","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d942600559b622faec7ddc2e5899d9c49e0c16e531d2828cecaed712fd595d7c","sha256:ea20b0741e4b7879b4015c7bba78a32d717b200d62762636ce3df69a3898e87f"],"state_sha256":"ad604860cc3b249303d60b2a1c296dc533522cbe3df8802f8040d4529eb17dd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7F9bXBnYVTX7gk7wggl0bTVdyv0OyqDpRW+2GuBSfLXaux9EXpQskyRD8xvfHM0o9o9+tbeWAwMymCPhT/BhCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:09:06.743760Z","bundle_sha256":"5179c9b655aee93f1b0a4548f03a1b333b02a57f8831bb695a66c1f841e7b035"}}