{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KEIG2Q2F5IYPXDRF7HD55G2IEH","short_pith_number":"pith:KEIG2Q2F","schema_version":"1.0","canonical_sha256":"51106d4345ea30fb8e25f9c7de9b4821fcf2d128d8ab8c678908d543d3df8bbf","source":{"kind":"arxiv","id":"2412.09904","version":2},"attestation_state":"computed","paper":{"title":"Quantum chromatic numbers of some graphs in Hamming schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Keqin Feng, Xiwang Cao, Ying-Ying Tan","submitted_at":"2024-12-13T06:45:02Z","abstract_excerpt":"The study of quantum chromatic numbers of graphs is a hot research topic in recent years. However, the infinite family of graphs with known quantum chromatic numbers are rare, as far as we know, the only known such graphs (except for complete graphs, cycles, bipartite graphs and some trivial cases) are the Hadamard graphs $H_n$ with $2^n$ vertices and $n$ a multiple of $4$. In this paper, we consider the graphs in Hamming schemes, we determined the quantum chromatic numbers of one class of such graphs. Notably, this is the second known family of graphs whose quantum chromatic numbers are expli"},"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":"2412.09904","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-13T06:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"feb547bccf11e26f7fa7cc2f34d4ac0acf4231e3b2b2af40d8013e759d6366d7","abstract_canon_sha256":"82ae246b7ea0d6a7f7c50aa89e702c9aadd33df0a26f33dabe90847464e71f97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:14.890744Z","signature_b64":"NTlqhegQkvXWhr/8fgEZ8r4KZatMLJubFFnj9oTDZR14Q4J7Y0J2q74KakEOeAztWAKHTZqOpuBsFj8fVtFtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51106d4345ea30fb8e25f9c7de9b4821fcf2d128d8ab8c678908d543d3df8bbf","last_reissued_at":"2026-07-05T09:55:14.890325Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:14.890325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum chromatic numbers of some graphs in Hamming schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Keqin Feng, Xiwang Cao, Ying-Ying Tan","submitted_at":"2024-12-13T06:45:02Z","abstract_excerpt":"The study of quantum chromatic numbers of graphs is a hot research topic in recent years. However, the infinite family of graphs with known quantum chromatic numbers are rare, as far as we know, the only known such graphs (except for complete graphs, cycles, bipartite graphs and some trivial cases) are the Hadamard graphs $H_n$ with $2^n$ vertices and $n$ a multiple of $4$. In this paper, we consider the graphs in Hamming schemes, we determined the quantum chromatic numbers of one class of such graphs. Notably, this is the second known family of graphs whose quantum chromatic numbers are expli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.09904","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.09904/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.09904","created_at":"2026-07-05T09:55:14.890383+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.09904v2","created_at":"2026-07-05T09:55:14.890383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.09904","created_at":"2026-07-05T09:55:14.890383+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEIG2Q2F5IYP","created_at":"2026-07-05T09:55:14.890383+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEIG2Q2F5IYPXDRF","created_at":"2026-07-05T09:55:14.890383+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEIG2Q2F","created_at":"2026-07-05T09:55:14.890383+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.28402","citing_title":"On the Smallest Eigenvalues and Quantum Chromatic Numbers of Hamming Graphs and Generalizations","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00524","citing_title":"Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KEIG2Q2F5IYPXDRF7HD55G2IEH","json":"https://pith.science/pith/KEIG2Q2F5IYPXDRF7HD55G2IEH.json","graph_json":"https://pith.science/api/pith-number/KEIG2Q2F5IYPXDRF7HD55G2IEH/graph.json","events_json":"https://pith.science/api/pith-number/KEIG2Q2F5IYPXDRF7HD55G2IEH/events.json","paper":"https://pith.science/paper/KEIG2Q2F"},"agent_actions":{"view_html":"https://pith.science/pith/KEIG2Q2F5IYPXDRF7HD55G2IEH","download_json":"https://pith.science/pith/KEIG2Q2F5IYPXDRF7HD55G2IEH.json","view_paper":"https://pith.science/paper/KEIG2Q2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.09904&json=true","fetch_graph":"https://pith.science/api/pith-number/KEIG2Q2F5IYPXDRF7HD55G2IEH/graph.json","fetch_events":"https://pith.science/api/pith-number/KEIG2Q2F5IYPXDRF7HD55G2IEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEIG2Q2F5IYPXDRF7HD55G2IEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEIG2Q2F5IYPXDRF7HD55G2IEH/action/storage_attestation","attest_author":"https://pith.science/pith/KEIG2Q2F5IYPXDRF7HD55G2IEH/action/author_attestation","sign_citation":"https://pith.science/pith/KEIG2Q2F5IYPXDRF7HD55G2IEH/action/citation_signature","submit_replication":"https://pith.science/pith/KEIG2Q2F5IYPXDRF7HD55G2IEH/action/replication_record"}},"created_at":"2026-07-05T09:55:14.890383+00:00","updated_at":"2026-07-05T09:55:14.890383+00:00"}