{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TCEZXUBMR3U76XYVLRDHBHINPN","short_pith_number":"pith:TCEZXUBM","schema_version":"1.0","canonical_sha256":"98899bd02c8ee9ff5f155c46709d0d7b6da5fbc5ca48678ab1a7d7870fea4b7b","source":{"kind":"arxiv","id":"1512.04972","version":1},"attestation_state":"computed","paper":{"title":"Universal completability, least eigenvalue frameworks, and vector colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Antonios Varvitsiotis, Brendan Rooney, Chris Godsil, David E. Roberson, Robert \\v{S}\\'amal","submitted_at":"2015-12-15T21:23:04Z","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"},"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":"1512.04972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T21:23:04Z","cross_cats_sorted":[],"title_canon_sha256":"5087421984e9c6f8e2ecfdffc883a14f3b26f1624f838ad47d829aa75e34abc8","abstract_canon_sha256":"faf57702d63b9296e4a9241b650ecf1a71d573183ffc2df7583d3d086c0d9af5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:13.871878Z","signature_b64":"1sMLY1GjQrlq3SK6csaCLmvRby/R9iIWJj1LhUwa67G00/e/H0eeVQaw2HHawRwB6diBvGvLDWNFAMJnO1vtCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98899bd02c8ee9ff5f155c46709d0d7b6da5fbc5ca48678ab1a7d7870fea4b7b","last_reissued_at":"2026-05-18T01:24:13.871536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:13.871536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal completability, least eigenvalue frameworks, and vector colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Antonios Varvitsiotis, Brendan Rooney, Chris Godsil, David E. Roberson, Robert \\v{S}\\'amal","submitted_at":"2015-12-15T21:23:04Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04972","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":"1512.04972","created_at":"2026-05-18T01:24:13.871588+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04972v1","created_at":"2026-05-18T01:24:13.871588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04972","created_at":"2026-05-18T01:24:13.871588+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCEZXUBMR3U7","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCEZXUBMR3U76XYV","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCEZXUBM","created_at":"2026-05-18T12:29:42.218222+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/TCEZXUBMR3U76XYVLRDHBHINPN","json":"https://pith.science/pith/TCEZXUBMR3U76XYVLRDHBHINPN.json","graph_json":"https://pith.science/api/pith-number/TCEZXUBMR3U76XYVLRDHBHINPN/graph.json","events_json":"https://pith.science/api/pith-number/TCEZXUBMR3U76XYVLRDHBHINPN/events.json","paper":"https://pith.science/paper/TCEZXUBM"},"agent_actions":{"view_html":"https://pith.science/pith/TCEZXUBMR3U76XYVLRDHBHINPN","download_json":"https://pith.science/pith/TCEZXUBMR3U76XYVLRDHBHINPN.json","view_paper":"https://pith.science/paper/TCEZXUBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04972&json=true","fetch_graph":"https://pith.science/api/pith-number/TCEZXUBMR3U76XYVLRDHBHINPN/graph.json","fetch_events":"https://pith.science/api/pith-number/TCEZXUBMR3U76XYVLRDHBHINPN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCEZXUBMR3U76XYVLRDHBHINPN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCEZXUBMR3U76XYVLRDHBHINPN/action/storage_attestation","attest_author":"https://pith.science/pith/TCEZXUBMR3U76XYVLRDHBHINPN/action/author_attestation","sign_citation":"https://pith.science/pith/TCEZXUBMR3U76XYVLRDHBHINPN/action/citation_signature","submit_replication":"https://pith.science/pith/TCEZXUBMR3U76XYVLRDHBHINPN/action/replication_record"}},"created_at":"2026-05-18T01:24:13.871588+00:00","updated_at":"2026-05-18T01:24:13.871588+00:00"}