{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NYSQNPSLZNAO3JWT7MLCHJUSBE","short_pith_number":"pith:NYSQNPSL","canonical_record":{"source":{"id":"1606.09099","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-29T13:50:54Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bf2ed8e02d267bb3b65150fc3fd7a7d353d54675e6c3b105fef7608e75b1161f","abstract_canon_sha256":"85ea4e427984f44b474e3723c21b0d954f84c1d01833a28fdaf7b38e8a851d6f"},"schema_version":"1.0"},"canonical_sha256":"6e2506be4bcb40eda6d3fb1623a692092584625c7fe2363a62be9d6accecc214","source":{"kind":"arxiv","id":"1606.09099","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.09099","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"arxiv_version","alias_value":"1606.09099v6","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09099","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"pith_short_12","alias_value":"NYSQNPSLZNAO","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NYSQNPSLZNAO3JWT","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NYSQNPSL","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NYSQNPSLZNAO3JWT7MLCHJUSBE","target":"record","payload":{"canonical_record":{"source":{"id":"1606.09099","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-29T13:50:54Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bf2ed8e02d267bb3b65150fc3fd7a7d353d54675e6c3b105fef7608e75b1161f","abstract_canon_sha256":"85ea4e427984f44b474e3723c21b0d954f84c1d01833a28fdaf7b38e8a851d6f"},"schema_version":"1.0"},"canonical_sha256":"6e2506be4bcb40eda6d3fb1623a692092584625c7fe2363a62be9d6accecc214","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:14.566722Z","signature_b64":"i+NNHLaVdGBhaCkdnKgzZAFeIXGi9QBhpSPT4ULX0ap7QzuhmD43KyOta0JDNMkdO+aJ9q5jRfF6BmJCcYRSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e2506be4bcb40eda6d3fb1623a692092584625c7fe2363a62be9d6accecc214","last_reissued_at":"2026-05-18T00:23:14.565980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:14.565980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.09099","source_version":6,"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-18T00:23:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4kvVTCPB5c8jYEutCBMtpSNalP9k7uwa4G3D7xMWQIzH64QILxPproXScLmJ7WKo2FMc1cvVNJVAQtlzvdODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:26:42.754221Z"},"content_sha256":"48b1217b98eeead72329cbb75e96678b470977b2d18d04d35c0133aca9be21cd","schema_version":"1.0","event_id":"sha256:48b1217b98eeead72329cbb75e96678b470977b2d18d04d35c0133aca9be21cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NYSQNPSLZNAO3JWT7MLCHJUSBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Colorability Saturation Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ralph Keusch","submitted_at":"2016-06-29T13:50:54Z","abstract_excerpt":"We consider the following two-player game: Maxi and Mini start with the empty graph on $n$ vertices and take turns, always adding one additional edge to the graph such that the chromatic number is at most $k$, where $k \\in \\mathbb{N}$ is a given parameter. The game is over when the graph is saturated and no further edge can be inserted. Maxi wants to maximize the length of the game while Mini wants to minimize it. The score $s(n,\\chi_{>k})$ denotes the number of edges in the final graph, given that both players followed an optimal strategy.\n  This colorability game belongs to the family of \\em"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09099","kind":"arxiv","version":6},"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-18T00:23:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oTd1SzKc6/WUzdYM+dC2a4DzRkp4uwy2stND55uShcmr28Y/j4RExozqLYZVJU5rQR0zdIEzCpXvyOrCf9WZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:26:42.754599Z"},"content_sha256":"ca4d8b94f8f97004169e012a777991b2fcb97cc9957e583bc68b704ee960167d","schema_version":"1.0","event_id":"sha256:ca4d8b94f8f97004169e012a777991b2fcb97cc9957e583bc68b704ee960167d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYSQNPSLZNAO3JWT7MLCHJUSBE/bundle.json","state_url":"https://pith.science/pith/NYSQNPSLZNAO3JWT7MLCHJUSBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYSQNPSLZNAO3JWT7MLCHJUSBE/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-08T11:26:42Z","links":{"resolver":"https://pith.science/pith/NYSQNPSLZNAO3JWT7MLCHJUSBE","bundle":"https://pith.science/pith/NYSQNPSLZNAO3JWT7MLCHJUSBE/bundle.json","state":"https://pith.science/pith/NYSQNPSLZNAO3JWT7MLCHJUSBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYSQNPSLZNAO3JWT7MLCHJUSBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NYSQNPSLZNAO3JWT7MLCHJUSBE","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":"85ea4e427984f44b474e3723c21b0d954f84c1d01833a28fdaf7b38e8a851d6f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-29T13:50:54Z","title_canon_sha256":"bf2ed8e02d267bb3b65150fc3fd7a7d353d54675e6c3b105fef7608e75b1161f"},"schema_version":"1.0","source":{"id":"1606.09099","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.09099","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"arxiv_version","alias_value":"1606.09099v6","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09099","created_at":"2026-05-18T00:23:14Z"},{"alias_kind":"pith_short_12","alias_value":"NYSQNPSLZNAO","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NYSQNPSLZNAO3JWT","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NYSQNPSL","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:ca4d8b94f8f97004169e012a777991b2fcb97cc9957e583bc68b704ee960167d","target":"graph","created_at":"2026-05-18T00:23:14Z","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":"We consider the following two-player game: Maxi and Mini start with the empty graph on $n$ vertices and take turns, always adding one additional edge to the graph such that the chromatic number is at most $k$, where $k \\in \\mathbb{N}$ is a given parameter. The game is over when the graph is saturated and no further edge can be inserted. Maxi wants to maximize the length of the game while Mini wants to minimize it. The score $s(n,\\chi_{>k})$ denotes the number of edges in the final graph, given that both players followed an optimal strategy.\n  This colorability game belongs to the family of \\em","authors_text":"Ralph Keusch","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-29T13:50:54Z","title":"Colorability Saturation Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09099","kind":"arxiv","version":6},"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:48b1217b98eeead72329cbb75e96678b470977b2d18d04d35c0133aca9be21cd","target":"record","created_at":"2026-05-18T00:23:14Z","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":"85ea4e427984f44b474e3723c21b0d954f84c1d01833a28fdaf7b38e8a851d6f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-29T13:50:54Z","title_canon_sha256":"bf2ed8e02d267bb3b65150fc3fd7a7d353d54675e6c3b105fef7608e75b1161f"},"schema_version":"1.0","source":{"id":"1606.09099","kind":"arxiv","version":6}},"canonical_sha256":"6e2506be4bcb40eda6d3fb1623a692092584625c7fe2363a62be9d6accecc214","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e2506be4bcb40eda6d3fb1623a692092584625c7fe2363a62be9d6accecc214","first_computed_at":"2026-05-18T00:23:14.565980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:14.565980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i+NNHLaVdGBhaCkdnKgzZAFeIXGi9QBhpSPT4ULX0ap7QzuhmD43KyOta0JDNMkdO+aJ9q5jRfF6BmJCcYRSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:14.566722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.09099","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48b1217b98eeead72329cbb75e96678b470977b2d18d04d35c0133aca9be21cd","sha256:ca4d8b94f8f97004169e012a777991b2fcb97cc9957e583bc68b704ee960167d"],"state_sha256":"93f055205b574bb7ee49dee7f7704a78c04f533c245f7d4d2ef2170dc6b19806"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pxHHFN/uLYaWIfKCW3wmb9ThnzNE9CMdg9bfX+AXXd3hMUdmGLWX13HYVWoIvlunrZbtac2JZm46e+JKWRduBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T11:26:42.756528Z","bundle_sha256":"a452d09ac862b1cba9cec4772b40e1fc0d8b414eb1c488d805725940082ff346"}}