{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:UDELJN63TKN73PQN3RPKOZJVII","short_pith_number":"pith:UDELJN63","canonical_record":{"source":{"id":"quant-ph/0509047","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-07T07:43:29Z","cross_cats_sorted":[],"title_canon_sha256":"3c93d8e3b724a62a883cf04f85d42a5a4906487f05e94555b6279ac5c5c4ac88","abstract_canon_sha256":"f08f543aec2225d2f85d15d822f2550b58c4a3d63ea3fb47db0fc301f1607a60"},"schema_version":"1.0"},"canonical_sha256":"a0c8b4b7db9a9bfdbe0ddc5ea7653542313c35c8222507fd9496894d922d36e6","source":{"kind":"arxiv","id":"quant-ph/0509047","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0509047","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0509047v4","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0509047","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"pith_short_12","alias_value":"UDELJN63TKN7","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"UDELJN63TKN73PQN","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"UDELJN63","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:UDELJN63TKN73PQN3RPKOZJVII","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0509047","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-07T07:43:29Z","cross_cats_sorted":[],"title_canon_sha256":"3c93d8e3b724a62a883cf04f85d42a5a4906487f05e94555b6279ac5c5c4ac88","abstract_canon_sha256":"f08f543aec2225d2f85d15d822f2550b58c4a3d63ea3fb47db0fc301f1607a60"},"schema_version":"1.0"},"canonical_sha256":"a0c8b4b7db9a9bfdbe0ddc5ea7653542313c35c8222507fd9496894d922d36e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:57.472755Z","signature_b64":"+A6OQ29fX6z6GDfy2P2Hk0us3ow3uEroKIIKGfLAeERi/utT34zG7oo9Fvfrkql4ZAZIR73jOY3NiE3vw8OuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0c8b4b7db9a9bfdbe0ddc5ea7653542313c35c8222507fd9496894d922d36e6","last_reissued_at":"2026-05-18T01:37:57.472081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:57.472081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0509047","source_version":4,"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:37:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7T0eZosBu5riIKyd7TCxEjaTfDFQMxKPN1IDInIwMxymrXadiSs7KOoeW/eL2F+GWYJboExijDx9Rz35TQlJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:22:34.313743Z"},"content_sha256":"079b827309bdc06d132cc6ebd58a04ee846749760812918244f8270185811901","schema_version":"1.0","event_id":"sha256:079b827309bdc06d132cc6ebd58a04ee846749760812918244f8270185811901"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:UDELJN63TKN73PQN3RPKOZJVII","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A quantum protocol to win the graph colouring game on all Hadamard graphs","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Avis, Jun Hasegawa, Yosuke Kikuchi, Yuuya Sasaki","submitted_at":"2005-09-07T07:43:29Z","abstract_excerpt":"This paper deals with graph colouring games, an example of pseudo-telepathy, in which two provers can convince a verifier that a graph $G$ is $c$-colourable where $c$ is less than the chromatic number of the graph. They win the game if they convince the verifier. It is known that the players cannot win if they share only classical information, but they can win in some cases by sharing entanglement. The smallest known graph where the players win in the quantum setting, but not in the classical setting, was found by Galliard, Tapp and Wolf and has 32,768 vertices. It is a connected component of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0509047","kind":"arxiv","version":4},"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:37:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tk06RPTdd8Hf5Pld8no34QMjmoMWkgdnyU/X7986BUlMpgwbmoTkj4JT1Kk90JPnU63laVGvz9H+yEEOvXPkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:22:34.314604Z"},"content_sha256":"896ab2176d48a1a40ea4355060733c8b1c82350964e4bbfad23896fe7dc509d9","schema_version":"1.0","event_id":"sha256:896ab2176d48a1a40ea4355060733c8b1c82350964e4bbfad23896fe7dc509d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UDELJN63TKN73PQN3RPKOZJVII/bundle.json","state_url":"https://pith.science/pith/UDELJN63TKN73PQN3RPKOZJVII/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UDELJN63TKN73PQN3RPKOZJVII/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-06-06T08:22:34Z","links":{"resolver":"https://pith.science/pith/UDELJN63TKN73PQN3RPKOZJVII","bundle":"https://pith.science/pith/UDELJN63TKN73PQN3RPKOZJVII/bundle.json","state":"https://pith.science/pith/UDELJN63TKN73PQN3RPKOZJVII/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UDELJN63TKN73PQN3RPKOZJVII/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:UDELJN63TKN73PQN3RPKOZJVII","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":"f08f543aec2225d2f85d15d822f2550b58c4a3d63ea3fb47db0fc301f1607a60","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-07T07:43:29Z","title_canon_sha256":"3c93d8e3b724a62a883cf04f85d42a5a4906487f05e94555b6279ac5c5c4ac88"},"schema_version":"1.0","source":{"id":"quant-ph/0509047","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0509047","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0509047v4","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0509047","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"pith_short_12","alias_value":"UDELJN63TKN7","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"UDELJN63TKN73PQN","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"UDELJN63","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:896ab2176d48a1a40ea4355060733c8b1c82350964e4bbfad23896fe7dc509d9","target":"graph","created_at":"2026-05-18T01:37:57Z","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":"This paper deals with graph colouring games, an example of pseudo-telepathy, in which two provers can convince a verifier that a graph $G$ is $c$-colourable where $c$ is less than the chromatic number of the graph. They win the game if they convince the verifier. It is known that the players cannot win if they share only classical information, but they can win in some cases by sharing entanglement. The smallest known graph where the players win in the quantum setting, but not in the classical setting, was found by Galliard, Tapp and Wolf and has 32,768 vertices. It is a connected component of ","authors_text":"David Avis, Jun Hasegawa, Yosuke Kikuchi, Yuuya Sasaki","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2005-09-07T07:43:29Z","title":"A quantum protocol to win the graph colouring game on all Hadamard graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0509047","kind":"arxiv","version":4},"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:079b827309bdc06d132cc6ebd58a04ee846749760812918244f8270185811901","target":"record","created_at":"2026-05-18T01:37:57Z","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":"f08f543aec2225d2f85d15d822f2550b58c4a3d63ea3fb47db0fc301f1607a60","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-07T07:43:29Z","title_canon_sha256":"3c93d8e3b724a62a883cf04f85d42a5a4906487f05e94555b6279ac5c5c4ac88"},"schema_version":"1.0","source":{"id":"quant-ph/0509047","kind":"arxiv","version":4}},"canonical_sha256":"a0c8b4b7db9a9bfdbe0ddc5ea7653542313c35c8222507fd9496894d922d36e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0c8b4b7db9a9bfdbe0ddc5ea7653542313c35c8222507fd9496894d922d36e6","first_computed_at":"2026-05-18T01:37:57.472081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:57.472081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+A6OQ29fX6z6GDfy2P2Hk0us3ow3uEroKIIKGfLAeERi/utT34zG7oo9Fvfrkql4ZAZIR73jOY3NiE3vw8OuDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:57.472755Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0509047","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:079b827309bdc06d132cc6ebd58a04ee846749760812918244f8270185811901","sha256:896ab2176d48a1a40ea4355060733c8b1c82350964e4bbfad23896fe7dc509d9"],"state_sha256":"ebeeca25a25f2ad3abbff88d523519a9136ade7761b87f13bfa434b896a3f1f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZ+tUUddoFJOUmBu4kzNWhsAMu8z5VPRlZMVW7zP2IwF16eUA9+ZIyo2acKPHC6ZXC11w+Qk2QjrOqlf8d07Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:22:34.318763Z","bundle_sha256":"6595c17bfaf006dade0aa521acb2fe1b9987eafeec564a6f0c56fabfc8f29104"}}