{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JRRKNK2AXFI3IOOPDLXR7Q4BRJ","short_pith_number":"pith:JRRKNK2A","schema_version":"1.0","canonical_sha256":"4c62a6ab40b951b439cf1aef1fc3818a6aea037564845555d325d0d6b9fc148c","source":{"kind":"arxiv","id":"1805.08334","version":3},"attestation_state":"computed","paper":{"title":"Spectral lower bounds for the quantum chromatic number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.CO","authors_text":"Clive Elphick, Pawel Wocjan","submitted_at":"2018-05-22T00:35:42Z","abstract_excerpt":"The quantum chromatic number, $\\chi_q(G)$, of a graph $G$ was originally defined as the minimal number of colors necessary in a quantum protocol in which two provers that cannot communicate with each other but share an entangled state can convince an interrogator with certainty that they have a coloring of the graph. We use an equivalent purely combinatorial definition of $\\chi_q(G)$ to prove that many spectral lower bounds for the chromatic number, $\\chi(G)$, are also lower bounds for $\\chi_q(G)$. This is achieved using techniques from linear algebra called pinching and twirling. We illustrat"},"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":"1805.08334","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-22T00:35:42Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"d47c69d2037b25eedb6094aff346c515e3a3004745440735bfd8730b6edd2ee7","abstract_canon_sha256":"a10bf4083541430aa735fe287a873b9ec3f1f33e02ef3e683cbd5155fb630afb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:30.949613Z","signature_b64":"zi8xa3DiF/X0O1J8kfKEoFf3EEDk5AgAh+8XLNDsctsTg2/zBO52Jg0LJtxSbcuLI34D8pIHydDraLXjRxuBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c62a6ab40b951b439cf1aef1fc3818a6aea037564845555d325d0d6b9fc148c","last_reissued_at":"2026-05-18T00:08:30.949202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:30.949202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral lower bounds for the quantum chromatic number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.CO","authors_text":"Clive Elphick, Pawel Wocjan","submitted_at":"2018-05-22T00:35:42Z","abstract_excerpt":"The quantum chromatic number, $\\chi_q(G)$, of a graph $G$ was originally defined as the minimal number of colors necessary in a quantum protocol in which two provers that cannot communicate with each other but share an entangled state can convince an interrogator with certainty that they have a coloring of the graph. We use an equivalent purely combinatorial definition of $\\chi_q(G)$ to prove that many spectral lower bounds for the chromatic number, $\\chi(G)$, are also lower bounds for $\\chi_q(G)$. This is achieved using techniques from linear algebra called pinching and twirling. We illustrat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08334","kind":"arxiv","version":3},"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":"1805.08334","created_at":"2026-05-18T00:08:30.949274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08334v3","created_at":"2026-05-18T00:08:30.949274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08334","created_at":"2026-05-18T00:08:30.949274+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRRKNK2AXFI3","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRRKNK2AXFI3IOOP","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRRKNK2A","created_at":"2026-05-18T12:32:31.084164+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/JRRKNK2AXFI3IOOPDLXR7Q4BRJ","json":"https://pith.science/pith/JRRKNK2AXFI3IOOPDLXR7Q4BRJ.json","graph_json":"https://pith.science/api/pith-number/JRRKNK2AXFI3IOOPDLXR7Q4BRJ/graph.json","events_json":"https://pith.science/api/pith-number/JRRKNK2AXFI3IOOPDLXR7Q4BRJ/events.json","paper":"https://pith.science/paper/JRRKNK2A"},"agent_actions":{"view_html":"https://pith.science/pith/JRRKNK2AXFI3IOOPDLXR7Q4BRJ","download_json":"https://pith.science/pith/JRRKNK2AXFI3IOOPDLXR7Q4BRJ.json","view_paper":"https://pith.science/paper/JRRKNK2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08334&json=true","fetch_graph":"https://pith.science/api/pith-number/JRRKNK2AXFI3IOOPDLXR7Q4BRJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JRRKNK2AXFI3IOOPDLXR7Q4BRJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRRKNK2AXFI3IOOPDLXR7Q4BRJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRRKNK2AXFI3IOOPDLXR7Q4BRJ/action/storage_attestation","attest_author":"https://pith.science/pith/JRRKNK2AXFI3IOOPDLXR7Q4BRJ/action/author_attestation","sign_citation":"https://pith.science/pith/JRRKNK2AXFI3IOOPDLXR7Q4BRJ/action/citation_signature","submit_replication":"https://pith.science/pith/JRRKNK2AXFI3IOOPDLXR7Q4BRJ/action/replication_record"}},"created_at":"2026-05-18T00:08:30.949274+00:00","updated_at":"2026-05-18T00:08:30.949274+00:00"}