{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NG4GZKSYKUTZI6RHNFQY3DMYUL","short_pith_number":"pith:NG4GZKSY","schema_version":"1.0","canonical_sha256":"69b86caa585527947a2769618d8d98a2dffc67e1a7b8b18a6b5f692c3a9c905c","source":{"kind":"arxiv","id":"2412.19405","version":1},"attestation_state":"computed","paper":{"title":"Approximate quantum 3-colorings of graphs and the quantum Max 3-Cut problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OA"],"primary_cat":"quant-ph","authors_text":"Samuel J. Harris","submitted_at":"2024-12-27T02:05:37Z","abstract_excerpt":"We prove that, to each synchronous non-local game $\\mathcal{G}=(I,O,\\lambda)$ with $|I|=n$ and $|O|=m \\geq 3$, there is an associated graph $G_{\\lambda}$ for which approximate winning strategies for the game $\\mathcal{G}$ and the $3$-coloring game for $G_{\\lambda}$ are preserved. That is, using a similar graph to previous work of the author (Ann. Henri Poincar\\'{e}, 2024), any synchronous strategy for $\\text{Hom}(G_{\\lambda},K_3)$ that wins the game with probability $1-\\varepsilon$ with respect to the uniform probability distribution on the edges, yields a strategy in the same model that wins "},"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.19405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-12-27T02:05:37Z","cross_cats_sorted":["math.OA"],"title_canon_sha256":"166f8059b63d121f37f192500a2df2e23e469afe154227e4ccb5a65ee5aed7df","abstract_canon_sha256":"b84f6bf8b714e78ab7ee02922e207fe0fb1199fb644389f99e895bebc6507283"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:35.041601Z","signature_b64":"zwZVjtxPksZZ06WEn+4Y+xwpnrXzrmwK/9yEjinwYzpctRp+RkIiQ+iqYY3xyJBCa8VByU1jbvhLCULfsOU8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69b86caa585527947a2769618d8d98a2dffc67e1a7b8b18a6b5f692c3a9c905c","last_reissued_at":"2026-07-05T09:54:35.041124Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:35.041124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate quantum 3-colorings of graphs and the quantum Max 3-Cut problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OA"],"primary_cat":"quant-ph","authors_text":"Samuel J. Harris","submitted_at":"2024-12-27T02:05:37Z","abstract_excerpt":"We prove that, to each synchronous non-local game $\\mathcal{G}=(I,O,\\lambda)$ with $|I|=n$ and $|O|=m \\geq 3$, there is an associated graph $G_{\\lambda}$ for which approximate winning strategies for the game $\\mathcal{G}$ and the $3$-coloring game for $G_{\\lambda}$ are preserved. That is, using a similar graph to previous work of the author (Ann. Henri Poincar\\'{e}, 2024), any synchronous strategy for $\\text{Hom}(G_{\\lambda},K_3)$ that wins the game with probability $1-\\varepsilon$ with respect to the uniform probability distribution on the edges, yields a strategy in the same model that wins "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.19405","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.19405/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.19405","created_at":"2026-07-05T09:54:35.041181+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.19405v1","created_at":"2026-07-05T09:54:35.041181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.19405","created_at":"2026-07-05T09:54:35.041181+00:00"},{"alias_kind":"pith_short_12","alias_value":"NG4GZKSYKUTZ","created_at":"2026-07-05T09:54:35.041181+00:00"},{"alias_kind":"pith_short_16","alias_value":"NG4GZKSYKUTZI6RH","created_at":"2026-07-05T09:54:35.041181+00:00"},{"alias_kind":"pith_short_8","alias_value":"NG4GZKSY","created_at":"2026-07-05T09:54:35.041181+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/NG4GZKSYKUTZI6RHNFQY3DMYUL","json":"https://pith.science/pith/NG4GZKSYKUTZI6RHNFQY3DMYUL.json","graph_json":"https://pith.science/api/pith-number/NG4GZKSYKUTZI6RHNFQY3DMYUL/graph.json","events_json":"https://pith.science/api/pith-number/NG4GZKSYKUTZI6RHNFQY3DMYUL/events.json","paper":"https://pith.science/paper/NG4GZKSY"},"agent_actions":{"view_html":"https://pith.science/pith/NG4GZKSYKUTZI6RHNFQY3DMYUL","download_json":"https://pith.science/pith/NG4GZKSYKUTZI6RHNFQY3DMYUL.json","view_paper":"https://pith.science/paper/NG4GZKSY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.19405&json=true","fetch_graph":"https://pith.science/api/pith-number/NG4GZKSYKUTZI6RHNFQY3DMYUL/graph.json","fetch_events":"https://pith.science/api/pith-number/NG4GZKSYKUTZI6RHNFQY3DMYUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NG4GZKSYKUTZI6RHNFQY3DMYUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NG4GZKSYKUTZI6RHNFQY3DMYUL/action/storage_attestation","attest_author":"https://pith.science/pith/NG4GZKSYKUTZI6RHNFQY3DMYUL/action/author_attestation","sign_citation":"https://pith.science/pith/NG4GZKSYKUTZI6RHNFQY3DMYUL/action/citation_signature","submit_replication":"https://pith.science/pith/NG4GZKSYKUTZI6RHNFQY3DMYUL/action/replication_record"}},"created_at":"2026-07-05T09:54:35.041181+00:00","updated_at":"2026-07-05T09:54:35.041181+00:00"}