{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FAAGKWAUCTP44CLJEGSXKQ7NQH","short_pith_number":"pith:FAAGKWAU","canonical_record":{"source":{"id":"1712.08699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-23T01:59:13Z","cross_cats_sorted":[],"title_canon_sha256":"b301a1bf4d8ab88bb7c7b855c7e5b53f81fc71236b8651452a252f06bac58782","abstract_canon_sha256":"126fcea7e2cfd3c18bb5efadf3d191de073c1fb0556f7469242ceee79ff8b00e"},"schema_version":"1.0"},"canonical_sha256":"280065581414dfce096921a57543ed81c948a1c13818928983b6b0db288024ff","source":{"kind":"arxiv","id":"1712.08699","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08699","created_at":"2026-05-18T00:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08699v1","created_at":"2026-05-18T00:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08699","created_at":"2026-05-18T00:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"FAAGKWAUCTP4","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FAAGKWAUCTP44CLJ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FAAGKWAU","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FAAGKWAUCTP44CLJEGSXKQ7NQH","target":"record","payload":{"canonical_record":{"source":{"id":"1712.08699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-23T01:59:13Z","cross_cats_sorted":[],"title_canon_sha256":"b301a1bf4d8ab88bb7c7b855c7e5b53f81fc71236b8651452a252f06bac58782","abstract_canon_sha256":"126fcea7e2cfd3c18bb5efadf3d191de073c1fb0556f7469242ceee79ff8b00e"},"schema_version":"1.0"},"canonical_sha256":"280065581414dfce096921a57543ed81c948a1c13818928983b6b0db288024ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:17.026753Z","signature_b64":"OyfutvlyS+y26XOzkGwsNtN5xJ49AkE/lgxSU9Amx86bSsNvkEAcdjh5P9BUx7O99NzcylJSN4Oe9dPe35cuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"280065581414dfce096921a57543ed81c948a1c13818928983b6b0db288024ff","last_reissued_at":"2026-05-18T00:27:17.026245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:17.026245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.08699","source_version":1,"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:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+aFGx8QeRSSC6Tfc4f0g8SyzpopI1q5WBh42MtMb0p1147Qpm3BhP2j9QO7JWo9tK5taxxhN6HlKTm9SeTYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:46:13.202407Z"},"content_sha256":"36e267d03ea2f41f86e5a3b70966e1fa44afaa46342d045d8f2439c904686e06","schema_version":"1.0","event_id":"sha256:36e267d03ea2f41f86e5a3b70966e1fa44afaa46342d045d8f2439c904686e06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FAAGKWAUCTP44CLJEGSXKQ7NQH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online coloring a token graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kevin G. Milans, Michael C. Wigal","submitted_at":"2017-12-23T01:59:13Z","abstract_excerpt":"We study a combinatorial coloring game between two players, Spoiler and Algorithm, who alternate turns. First, Spoiler places a new token at a vertex in $G$, and Algorithm responds by assigning a color to the new token. Algorithm must ensure that tokens on the same or adjacent vertices receive distinct colors. Spoiler must ensure that the token graph (in which two tokens are adjacent if and only if their distance in $G$ is at most $1$) has chromatic number at most $w$. Algorithm wants to minimize the number of colors used, and Spoiler wants to force as many colors as possible. Let $f(w,G)$ be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08699","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":""},"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:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nk0y0fqbnKGABSK4uXebUuG2SSI1sNXjC3BeuqZjH8exsXJ/gxDv74YyB5/ZEIlv2fw2Ca970GakH6FdgjHDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:46:13.202749Z"},"content_sha256":"8d4f8bcc1fd70d04e569a9b4c454b7ba327fefc1ad79bc1464bec43c618bbf59","schema_version":"1.0","event_id":"sha256:8d4f8bcc1fd70d04e569a9b4c454b7ba327fefc1ad79bc1464bec43c618bbf59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FAAGKWAUCTP44CLJEGSXKQ7NQH/bundle.json","state_url":"https://pith.science/pith/FAAGKWAUCTP44CLJEGSXKQ7NQH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FAAGKWAUCTP44CLJEGSXKQ7NQH/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-22T10:46:13Z","links":{"resolver":"https://pith.science/pith/FAAGKWAUCTP44CLJEGSXKQ7NQH","bundle":"https://pith.science/pith/FAAGKWAUCTP44CLJEGSXKQ7NQH/bundle.json","state":"https://pith.science/pith/FAAGKWAUCTP44CLJEGSXKQ7NQH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FAAGKWAUCTP44CLJEGSXKQ7NQH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FAAGKWAUCTP44CLJEGSXKQ7NQH","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":"126fcea7e2cfd3c18bb5efadf3d191de073c1fb0556f7469242ceee79ff8b00e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-23T01:59:13Z","title_canon_sha256":"b301a1bf4d8ab88bb7c7b855c7e5b53f81fc71236b8651452a252f06bac58782"},"schema_version":"1.0","source":{"id":"1712.08699","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08699","created_at":"2026-05-18T00:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08699v1","created_at":"2026-05-18T00:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08699","created_at":"2026-05-18T00:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"FAAGKWAUCTP4","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FAAGKWAUCTP44CLJ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FAAGKWAU","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:8d4f8bcc1fd70d04e569a9b4c454b7ba327fefc1ad79bc1464bec43c618bbf59","target":"graph","created_at":"2026-05-18T00:27:17Z","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 study a combinatorial coloring game between two players, Spoiler and Algorithm, who alternate turns. First, Spoiler places a new token at a vertex in $G$, and Algorithm responds by assigning a color to the new token. Algorithm must ensure that tokens on the same or adjacent vertices receive distinct colors. Spoiler must ensure that the token graph (in which two tokens are adjacent if and only if their distance in $G$ is at most $1$) has chromatic number at most $w$. Algorithm wants to minimize the number of colors used, and Spoiler wants to force as many colors as possible. Let $f(w,G)$ be ","authors_text":"Kevin G. Milans, Michael C. Wigal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-23T01:59:13Z","title":"Online coloring a token graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08699","kind":"arxiv","version":1},"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:36e267d03ea2f41f86e5a3b70966e1fa44afaa46342d045d8f2439c904686e06","target":"record","created_at":"2026-05-18T00:27:17Z","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":"126fcea7e2cfd3c18bb5efadf3d191de073c1fb0556f7469242ceee79ff8b00e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-23T01:59:13Z","title_canon_sha256":"b301a1bf4d8ab88bb7c7b855c7e5b53f81fc71236b8651452a252f06bac58782"},"schema_version":"1.0","source":{"id":"1712.08699","kind":"arxiv","version":1}},"canonical_sha256":"280065581414dfce096921a57543ed81c948a1c13818928983b6b0db288024ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"280065581414dfce096921a57543ed81c948a1c13818928983b6b0db288024ff","first_computed_at":"2026-05-18T00:27:17.026245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:17.026245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OyfutvlyS+y26XOzkGwsNtN5xJ49AkE/lgxSU9Amx86bSsNvkEAcdjh5P9BUx7O99NzcylJSN4Oe9dPe35cuAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:17.026753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.08699","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36e267d03ea2f41f86e5a3b70966e1fa44afaa46342d045d8f2439c904686e06","sha256:8d4f8bcc1fd70d04e569a9b4c454b7ba327fefc1ad79bc1464bec43c618bbf59"],"state_sha256":"4423207c6039ecf6540452ff92d03519ff3ea39abc3706fdd8c6a124de12a2ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sBEqnyLNWggv3V+wVMzmncvR2JExtlg48TXoY/uHN2iQ3xtwWl2AoUW99hBUF6u0xhliOxNjkCw4kQ7aDCiuDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T10:46:13.204699Z","bundle_sha256":"d98f1bc106331e16b3d54e94690aa82e5531b000bd85ed1d9a6bc719fdd228cc"}}