{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5HZB57JP47C35OXDL36NPC7BEX","short_pith_number":"pith:5HZB57JP","canonical_record":{"source":{"id":"1801.06754","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-21T02:47:32Z","cross_cats_sorted":[],"title_canon_sha256":"e652a616a2ab4c6e99bfcc379a3bfb26dad89d32f3f81af3a0b71157264bf2bf","abstract_canon_sha256":"17761f30310ada05ecbd5dfadd4abf6374f9b4880c6d7b1ac44ac8aba8a26dd5"},"schema_version":"1.0"},"canonical_sha256":"e9f21efd2fe7c5bebae35efcd78be125c25828281fbcd54f901f638a439f287a","source":{"kind":"arxiv","id":"1801.06754","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06754","created_at":"2026-07-05T03:41:21Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06754v4","created_at":"2026-07-05T03:41:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06754","created_at":"2026-07-05T03:41:21Z"},{"alias_kind":"pith_short_12","alias_value":"5HZB57JP47C3","created_at":"2026-07-05T03:41:21Z"},{"alias_kind":"pith_short_16","alias_value":"5HZB57JP47C35OXD","created_at":"2026-07-05T03:41:21Z"},{"alias_kind":"pith_short_8","alias_value":"5HZB57JP","created_at":"2026-07-05T03:41:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5HZB57JP47C35OXDL36NPC7BEX","target":"record","payload":{"canonical_record":{"source":{"id":"1801.06754","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-21T02:47:32Z","cross_cats_sorted":[],"title_canon_sha256":"e652a616a2ab4c6e99bfcc379a3bfb26dad89d32f3f81af3a0b71157264bf2bf","abstract_canon_sha256":"17761f30310ada05ecbd5dfadd4abf6374f9b4880c6d7b1ac44ac8aba8a26dd5"},"schema_version":"1.0"},"canonical_sha256":"e9f21efd2fe7c5bebae35efcd78be125c25828281fbcd54f901f638a439f287a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:41:21.743023Z","signature_b64":"BnXRlRmnjs3HfrzAvi3PB3OA4k1DWpnzWR2P2x44YdkEmiGoqZ6eBcvHXFZZNMxrEfz+J9R8eHHIyr6bC/p8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9f21efd2fe7c5bebae35efcd78be125c25828281fbcd54f901f638a439f287a","last_reissued_at":"2026-07-05T03:41:21.742567Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:41:21.742567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.06754","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-07-05T03:41:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LI9E9USPAiUCa6YjVX7ny2agjfhoZqOUyOZ2AswXkqDEVhfM68BgyzQ8m+Mx9zN6B6gRRf/S64zcVtTPZ+gRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:04:03.046102Z"},"content_sha256":"44f19c28e044626b75b5242b809ddad15e52abd0085c3d64dd03f024ce7a92ab","schema_version":"1.0","event_id":"sha256:44f19c28e044626b75b5242b809ddad15e52abd0085c3d64dd03f024ce7a92ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5HZB57JP47C35OXDL36NPC7BEX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Slow-coloring Game on Sparse Graphs: $k$-Degenerate, Planar, and Outerplanar","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas B. West, Grzegorz Gutowski, Krzysztof Maziarz, Micha{\\l} Zaj\\k{a}c, Tomasz Krawczyk, Xuding Zhu","submitted_at":"2018-01-21T02:47:32Z","abstract_excerpt":"The \\emph{slow-coloring game} is played by Lister and Painter on a graph $G$. Initially, all vertices of $G$ are uncolored. In each round, Lister marks a nonempty set $M$ of uncolored vertices, and Painter colors a subset of $M$ that is independent in $G$. The game ends when all vertices are colored. The score of the game is the sum of the sizes of all sets marked by Lister. The goal of Painter is to minimize the score, while Lister tries to maximize it. We provide strategies for Painter on various classes of graphs whose vertices can be partitioned into a bounded number of sets inducing fores"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06754","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1801.06754/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"},"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-07-05T03:41:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OOloWVNxzX0t3mVARXjafksQKCS+t9IXFgbmL7xF77H6W34PxZy8oTYa43VXAsjoQZJk9r/kisHtN2AQrTqEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:04:03.046505Z"},"content_sha256":"5d3e145ca83f4add5cdfa6e6248dbf5a505a88d54895117893e73982a4709f4f","schema_version":"1.0","event_id":"sha256:5d3e145ca83f4add5cdfa6e6248dbf5a505a88d54895117893e73982a4709f4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HZB57JP47C35OXDL36NPC7BEX/bundle.json","state_url":"https://pith.science/pith/5HZB57JP47C35OXDL36NPC7BEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HZB57JP47C35OXDL36NPC7BEX/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-07-06T15:04:03Z","links":{"resolver":"https://pith.science/pith/5HZB57JP47C35OXDL36NPC7BEX","bundle":"https://pith.science/pith/5HZB57JP47C35OXDL36NPC7BEX/bundle.json","state":"https://pith.science/pith/5HZB57JP47C35OXDL36NPC7BEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HZB57JP47C35OXDL36NPC7BEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5HZB57JP47C35OXDL36NPC7BEX","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":"17761f30310ada05ecbd5dfadd4abf6374f9b4880c6d7b1ac44ac8aba8a26dd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-21T02:47:32Z","title_canon_sha256":"e652a616a2ab4c6e99bfcc379a3bfb26dad89d32f3f81af3a0b71157264bf2bf"},"schema_version":"1.0","source":{"id":"1801.06754","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06754","created_at":"2026-07-05T03:41:21Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06754v4","created_at":"2026-07-05T03:41:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06754","created_at":"2026-07-05T03:41:21Z"},{"alias_kind":"pith_short_12","alias_value":"5HZB57JP47C3","created_at":"2026-07-05T03:41:21Z"},{"alias_kind":"pith_short_16","alias_value":"5HZB57JP47C35OXD","created_at":"2026-07-05T03:41:21Z"},{"alias_kind":"pith_short_8","alias_value":"5HZB57JP","created_at":"2026-07-05T03:41:21Z"}],"graph_snapshots":[{"event_id":"sha256:5d3e145ca83f4add5cdfa6e6248dbf5a505a88d54895117893e73982a4709f4f","target":"graph","created_at":"2026-07-05T03:41:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1801.06754/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The \\emph{slow-coloring game} is played by Lister and Painter on a graph $G$. Initially, all vertices of $G$ are uncolored. In each round, Lister marks a nonempty set $M$ of uncolored vertices, and Painter colors a subset of $M$ that is independent in $G$. The game ends when all vertices are colored. The score of the game is the sum of the sizes of all sets marked by Lister. The goal of Painter is to minimize the score, while Lister tries to maximize it. We provide strategies for Painter on various classes of graphs whose vertices can be partitioned into a bounded number of sets inducing fores","authors_text":"Douglas B. West, Grzegorz Gutowski, Krzysztof Maziarz, Micha{\\l} Zaj\\k{a}c, Tomasz Krawczyk, Xuding Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-21T02:47:32Z","title":"The Slow-coloring Game on Sparse Graphs: $k$-Degenerate, Planar, and Outerplanar"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06754","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:44f19c28e044626b75b5242b809ddad15e52abd0085c3d64dd03f024ce7a92ab","target":"record","created_at":"2026-07-05T03:41:21Z","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":"17761f30310ada05ecbd5dfadd4abf6374f9b4880c6d7b1ac44ac8aba8a26dd5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-21T02:47:32Z","title_canon_sha256":"e652a616a2ab4c6e99bfcc379a3bfb26dad89d32f3f81af3a0b71157264bf2bf"},"schema_version":"1.0","source":{"id":"1801.06754","kind":"arxiv","version":4}},"canonical_sha256":"e9f21efd2fe7c5bebae35efcd78be125c25828281fbcd54f901f638a439f287a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9f21efd2fe7c5bebae35efcd78be125c25828281fbcd54f901f638a439f287a","first_computed_at":"2026-07-05T03:41:21.742567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:41:21.742567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BnXRlRmnjs3HfrzAvi3PB3OA4k1DWpnzWR2P2x44YdkEmiGoqZ6eBcvHXFZZNMxrEfz+J9R8eHHIyr6bC/p8Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:41:21.743023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.06754","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44f19c28e044626b75b5242b809ddad15e52abd0085c3d64dd03f024ce7a92ab","sha256:5d3e145ca83f4add5cdfa6e6248dbf5a505a88d54895117893e73982a4709f4f"],"state_sha256":"f178b0604597b3c897a9f94b93d192373f7022402e13f0f66a53f18cabcb530a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Orou+HkIAQESPb9ikIcEEtrFpnHk9T/WRQvm3vaZpXLtSAI0qurNlYbypigjer7FDwb44L0H4H7gvOXL18RYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T15:04:03.048478Z","bundle_sha256":"66bbb4d0fb6e97eb6e6c83736e4b220ad22064da2e6044c6e0df57f60209efee"}}