{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VTXAW5M6BBUY45ZPEKFXYLIX4F","short_pith_number":"pith:VTXAW5M6","schema_version":"1.0","canonical_sha256":"acee0b759e08698e772f228b7c2d17e1462734c4fde172d6eae698b2de271348","source":{"kind":"arxiv","id":"1212.1724","version":2},"attestation_state":"computed","paper":{"title":"Graph Homomorphisms for Quantum Players","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"quant-ph","authors_text":"David E. Roberson, Laura Man\\v{c}inska","submitted_at":"2012-12-07T21:12:33Z","abstract_excerpt":"A homomorphism from a graph $X$ to a graph $Y$ is an adjacency preserving mapping $f:V(X) \\rightarrow V(Y)$. We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph $X$ admits a homomorphism to $Y$. This is a generalization of the well-studied graph coloring game. Via systematic study of quantum homomorphisms we prove new results for graph coloring. Most importantly, we show that the Lov\\'{a}sz theta number of the complement lower bounds the quantum chromatic number, which itself is not known to be computable. We also show that some of o"},"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":"1212.1724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-12-07T21:12:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d7f68c8c3997179ff951b648ca24824005a3080f7187f1c900bafe79d5a7152c","abstract_canon_sha256":"0579182addcbe8c6223fa6f7aa04866239e069d8ba0ca44bd1a7be9017769282"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:24.936955Z","signature_b64":"kZm3Tf7vAoQ5v7D/luijKliimR8hxdwvI+t6cnybryKa/d8+mit7gHbTvG5932LuBkk07m8FH62WiiZW0ZRDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acee0b759e08698e772f228b7c2d17e1462734c4fde172d6eae698b2de271348","last_reissued_at":"2026-05-18T01:04:24.936291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:24.936291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Homomorphisms for Quantum Players","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"quant-ph","authors_text":"David E. Roberson, Laura Man\\v{c}inska","submitted_at":"2012-12-07T21:12:33Z","abstract_excerpt":"A homomorphism from a graph $X$ to a graph $Y$ is an adjacency preserving mapping $f:V(X) \\rightarrow V(Y)$. We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph $X$ admits a homomorphism to $Y$. This is a generalization of the well-studied graph coloring game. Via systematic study of quantum homomorphisms we prove new results for graph coloring. Most importantly, we show that the Lov\\'{a}sz theta number of the complement lower bounds the quantum chromatic number, which itself is not known to be computable. We also show that some of o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1724","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":"1212.1724","created_at":"2026-05-18T01:04:24.936428+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.1724v2","created_at":"2026-05-18T01:04:24.936428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1724","created_at":"2026-05-18T01:04:24.936428+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTXAW5M6BBUY","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTXAW5M6BBUY45ZP","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTXAW5M6","created_at":"2026-05-18T12:27:25.539911+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/VTXAW5M6BBUY45ZPEKFXYLIX4F","json":"https://pith.science/pith/VTXAW5M6BBUY45ZPEKFXYLIX4F.json","graph_json":"https://pith.science/api/pith-number/VTXAW5M6BBUY45ZPEKFXYLIX4F/graph.json","events_json":"https://pith.science/api/pith-number/VTXAW5M6BBUY45ZPEKFXYLIX4F/events.json","paper":"https://pith.science/paper/VTXAW5M6"},"agent_actions":{"view_html":"https://pith.science/pith/VTXAW5M6BBUY45ZPEKFXYLIX4F","download_json":"https://pith.science/pith/VTXAW5M6BBUY45ZPEKFXYLIX4F.json","view_paper":"https://pith.science/paper/VTXAW5M6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.1724&json=true","fetch_graph":"https://pith.science/api/pith-number/VTXAW5M6BBUY45ZPEKFXYLIX4F/graph.json","fetch_events":"https://pith.science/api/pith-number/VTXAW5M6BBUY45ZPEKFXYLIX4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTXAW5M6BBUY45ZPEKFXYLIX4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTXAW5M6BBUY45ZPEKFXYLIX4F/action/storage_attestation","attest_author":"https://pith.science/pith/VTXAW5M6BBUY45ZPEKFXYLIX4F/action/author_attestation","sign_citation":"https://pith.science/pith/VTXAW5M6BBUY45ZPEKFXYLIX4F/action/citation_signature","submit_replication":"https://pith.science/pith/VTXAW5M6BBUY45ZPEKFXYLIX4F/action/replication_record"}},"created_at":"2026-05-18T01:04:24.936428+00:00","updated_at":"2026-05-18T01:04:24.936428+00:00"}