{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TCEZXUBMR3U76XYVLRDHBHINPN","short_pith_number":"pith:TCEZXUBM","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"},"canonical_sha256":"98899bd02c8ee9ff5f155c46709d0d7b6da5fbc5ca48678ab1a7d7870fea4b7b","source":{"kind":"arxiv","id":"1512.04972","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TCEZXUBMR3U76XYVLRDHBHINPN","target":"record","payload":{"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"},"canonical_sha256":"98899bd02c8ee9ff5f155c46709d0d7b6da5fbc5ca48678ab1a7d7870fea4b7b","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"},"source_kind":"arxiv","source_id":"1512.04972","source_version":1,"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-18T01:24:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iK3pCrDyh0ZSFT3BNX/vuheSjko/w/lNIWov9HLi2ADKxQnVRdEz4GTmjNvbTClET1Dk75rH9NGIeJAh2Qz6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:22:19.476904Z"},"content_sha256":"fd24916628b5d16261795020233d60f5ef68f81a99f524f649654fcd98b8c0f5","schema_version":"1.0","event_id":"sha256:fd24916628b5d16261795020233d60f5ef68f81a99f524f649654fcd98b8c0f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TCEZXUBMR3U76XYVLRDHBHINPN","target":"graph","payload":{"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"},"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-18T01:24:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sGi2Art6eTWfbKImeUqqzWBYwFLmFeJpsB0XUCNHRUTdmejQusuNqb+hDpsxEuQ4tTDv6QNV8SGBC1eCueqDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:22:19.477619Z"},"content_sha256":"b7241e3584ac3b74cad46da3c227ddd8c352eb3bf6098844c11b92f895c5faba","schema_version":"1.0","event_id":"sha256:b7241e3584ac3b74cad46da3c227ddd8c352eb3bf6098844c11b92f895c5faba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TCEZXUBMR3U76XYVLRDHBHINPN/bundle.json","state_url":"https://pith.science/pith/TCEZXUBMR3U76XYVLRDHBHINPN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TCEZXUBMR3U76XYVLRDHBHINPN/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-26T07:22:19Z","links":{"resolver":"https://pith.science/pith/TCEZXUBMR3U76XYVLRDHBHINPN","bundle":"https://pith.science/pith/TCEZXUBMR3U76XYVLRDHBHINPN/bundle.json","state":"https://pith.science/pith/TCEZXUBMR3U76XYVLRDHBHINPN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TCEZXUBMR3U76XYVLRDHBHINPN/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UBHODP5wt7jFIYMy6iQHNE2oye4MOLOqEagYc2QPB+0ei9/sJtv9ftC0wYbABbtyF2DaaAIj6SMs6inuBq8RAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:22:19.481271Z","bundle_sha256":"c8b36cf0a576aca5b6200e331ca1e166ec7a4802b8601d659905cba9ab8cbadb"}}