{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TCEZXUBMR3U76XYVLRDHBHINPN","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":"faf57702d63b9296e4a9241b650ecf1a71d573183ffc2df7583d3d086c0d9af5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T21:23:04Z","title_canon_sha256":"5087421984e9c6f8e2ecfdffc883a14f3b26f1624f838ad47d829aa75e34abc8"},"schema_version":"1.0","source":{"id":"1512.04972","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04972","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04972v1","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04972","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"pith_short_12","alias_value":"TCEZXUBMR3U7","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TCEZXUBMR3U76XYV","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TCEZXUBM","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:b7241e3584ac3b74cad46da3c227ddd8c352eb3bf6098844c11b92f895c5faba","target":"graph","created_at":"2026-05-18T01:24:13Z","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":"An embedding $i \\mapsto p_i\\in \\mathbb{R}^d$ of the vertices of a graph $G$ is called universally completable if the following holds: For any other embedding $i\\mapsto q_i~\\in \\mathbb{R}^{k}$ satisfying $q_i^T q_j = p_i^T p_j$ for $i = j$ and $i$ adjacent to $j$, there exists an isometry mapping the $q_i$'s to the $p_i$'s for all $ i\\in V(G)$. The notion of universal completability was introduced recently due to its relevance to the positive semidefinite matrix completion problem. In this work we focus on graph embeddings constructed using the eigenvectors of the least eigenvalue of the adjace","authors_text":"Antonios Varvitsiotis, Brendan Rooney, Chris Godsil, David E. Roberson, Robert \\v{S}\\'amal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T21:23:04Z","title":"Universal completability, least eigenvalue frameworks, and vector colorings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04972","kind":"arxiv","version":1},"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:fd24916628b5d16261795020233d60f5ef68f81a99f524f649654fcd98b8c0f5","target":"record","created_at":"2026-05-18T01:24:13Z","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":"faf57702d63b9296e4a9241b650ecf1a71d573183ffc2df7583d3d086c0d9af5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T21:23:04Z","title_canon_sha256":"5087421984e9c6f8e2ecfdffc883a14f3b26f1624f838ad47d829aa75e34abc8"},"schema_version":"1.0","source":{"id":"1512.04972","kind":"arxiv","version":1}},"canonical_sha256":"98899bd02c8ee9ff5f155c46709d0d7b6da5fbc5ca48678ab1a7d7870fea4b7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98899bd02c8ee9ff5f155c46709d0d7b6da5fbc5ca48678ab1a7d7870fea4b7b","first_computed_at":"2026-05-18T01:24:13.871536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:13.871536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1sMLY1GjQrlq3SK6csaCLmvRby/R9iIWJj1LhUwa67G00/e/H0eeVQaw2HHawRwB6diBvGvLDWNFAMJnO1vtCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:13.871878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.04972","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd24916628b5d16261795020233d60f5ef68f81a99f524f649654fcd98b8c0f5","sha256:b7241e3584ac3b74cad46da3c227ddd8c352eb3bf6098844c11b92f895c5faba"],"state_sha256":"92979bcecdbddd84fedbba97f460ee7dcd9f20bd19cfb128e508683b0ce53173"}