{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XXDCVW27EQLXLYRGYOHOTPU3U6","short_pith_number":"pith:XXDCVW27","canonical_record":{"source":{"id":"1612.04702","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-14T16:06:41Z","cross_cats_sorted":[],"title_canon_sha256":"a36744e529c24ebad29c81f3b08d4d387b4bfdf5a153e6879e9e517e6b859c08","abstract_canon_sha256":"ef98ac35c64238c2853cc85e53df0ce9894d6af1726dadf969349804ab7b3ac4"},"schema_version":"1.0"},"canonical_sha256":"bdc62adb5f241775e226c38ee9be9ba781251e44df8bbb6cfd376c189502d499","source":{"kind":"arxiv","id":"1612.04702","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04702","created_at":"2026-05-18T00:33:52Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04702v3","created_at":"2026-05-18T00:33:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04702","created_at":"2026-05-18T00:33:52Z"},{"alias_kind":"pith_short_12","alias_value":"XXDCVW27EQLX","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XXDCVW27EQLXLYRG","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XXDCVW27","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XXDCVW27EQLXLYRGYOHOTPU3U6","target":"record","payload":{"canonical_record":{"source":{"id":"1612.04702","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-14T16:06:41Z","cross_cats_sorted":[],"title_canon_sha256":"a36744e529c24ebad29c81f3b08d4d387b4bfdf5a153e6879e9e517e6b859c08","abstract_canon_sha256":"ef98ac35c64238c2853cc85e53df0ce9894d6af1726dadf969349804ab7b3ac4"},"schema_version":"1.0"},"canonical_sha256":"bdc62adb5f241775e226c38ee9be9ba781251e44df8bbb6cfd376c189502d499","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:52.909568Z","signature_b64":"vv5+a7+zVMSwEGQkCWimwSCniKE3Q0mA8zWUat1w7yZZfpP2NK+Cua6CPOuTWMoFyT3BDflG7SE3ax6EHmOdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdc62adb5f241775e226c38ee9be9ba781251e44df8bbb6cfd376c189502d499","last_reissued_at":"2026-05-18T00:33:52.907691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:52.907691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.04702","source_version":3,"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:33:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EB54PpSKeSHbjPAdLeFKux5+vCMGqFuR3z85SjaD8nrS8WE/XKIjbK9MWuW0FQA0u+Wh6ADtKH1EYc8B6Zt8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T23:22:50.435040Z"},"content_sha256":"787093f4c48044d2bc3685ce5429d014fbd9fc50d7b242187dde01967adb82c4","schema_version":"1.0","event_id":"sha256:787093f4c48044d2bc3685ce5429d014fbd9fc50d7b242187dde01967adb82c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XXDCVW27EQLXLYRGYOHOTPU3U6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Sum-Paintability: Slow-Coloring of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas B. West, Gregory J. Puleo","submitted_at":"2016-12-14T16:06:41Z","abstract_excerpt":"The slow-coloring game is played by Lister and Painter on a graph $G$. On each round, Lister marks a nonempty subset $M$ of the remaining vertices, scoring $|M|$ points. Painter then gives a color to a subset of $M$ that is independent in $G$. The game ends when all vertices are colored. Painter's goal is to minimize the total score; Lister seeks to maximize it. The score that each player can guarantee doing no worse than is the sum-color cost of $G$, written $\\mathring{\\rm s}(G)$. We develop a linear-time algorithm to compute $\\mathring{\\rm s}(G)$ when $G$ is a tree, enabling us to characteri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04702","kind":"arxiv","version":3},"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:33:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2W0qf5zq1KUKRNTFdYoGQOg7YiYzcCyop83JD50mlt7qs0kAKDJCeCanMMVL1nCDLGnPr6MHIrz6KzPUQhlGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T23:22:50.435392Z"},"content_sha256":"35f78aa16e952ac63923bff864f32c17c309625d1a2ce68bc27f16a4b23392e7","schema_version":"1.0","event_id":"sha256:35f78aa16e952ac63923bff864f32c17c309625d1a2ce68bc27f16a4b23392e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XXDCVW27EQLXLYRGYOHOTPU3U6/bundle.json","state_url":"https://pith.science/pith/XXDCVW27EQLXLYRGYOHOTPU3U6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XXDCVW27EQLXLYRGYOHOTPU3U6/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-27T23:22:50Z","links":{"resolver":"https://pith.science/pith/XXDCVW27EQLXLYRGYOHOTPU3U6","bundle":"https://pith.science/pith/XXDCVW27EQLXLYRGYOHOTPU3U6/bundle.json","state":"https://pith.science/pith/XXDCVW27EQLXLYRGYOHOTPU3U6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XXDCVW27EQLXLYRGYOHOTPU3U6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XXDCVW27EQLXLYRGYOHOTPU3U6","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":"ef98ac35c64238c2853cc85e53df0ce9894d6af1726dadf969349804ab7b3ac4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-14T16:06:41Z","title_canon_sha256":"a36744e529c24ebad29c81f3b08d4d387b4bfdf5a153e6879e9e517e6b859c08"},"schema_version":"1.0","source":{"id":"1612.04702","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04702","created_at":"2026-05-18T00:33:52Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04702v3","created_at":"2026-05-18T00:33:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04702","created_at":"2026-05-18T00:33:52Z"},{"alias_kind":"pith_short_12","alias_value":"XXDCVW27EQLX","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XXDCVW27EQLXLYRG","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XXDCVW27","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:35f78aa16e952ac63923bff864f32c17c309625d1a2ce68bc27f16a4b23392e7","target":"graph","created_at":"2026-05-18T00:33:52Z","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":"The slow-coloring game is played by Lister and Painter on a graph $G$. On each round, Lister marks a nonempty subset $M$ of the remaining vertices, scoring $|M|$ points. Painter then gives a color to a subset of $M$ that is independent in $G$. The game ends when all vertices are colored. Painter's goal is to minimize the total score; Lister seeks to maximize it. The score that each player can guarantee doing no worse than is the sum-color cost of $G$, written $\\mathring{\\rm s}(G)$. We develop a linear-time algorithm to compute $\\mathring{\\rm s}(G)$ when $G$ is a tree, enabling us to characteri","authors_text":"Douglas B. West, Gregory J. Puleo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-14T16:06:41Z","title":"Online Sum-Paintability: Slow-Coloring of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04702","kind":"arxiv","version":3},"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:787093f4c48044d2bc3685ce5429d014fbd9fc50d7b242187dde01967adb82c4","target":"record","created_at":"2026-05-18T00:33:52Z","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":"ef98ac35c64238c2853cc85e53df0ce9894d6af1726dadf969349804ab7b3ac4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-14T16:06:41Z","title_canon_sha256":"a36744e529c24ebad29c81f3b08d4d387b4bfdf5a153e6879e9e517e6b859c08"},"schema_version":"1.0","source":{"id":"1612.04702","kind":"arxiv","version":3}},"canonical_sha256":"bdc62adb5f241775e226c38ee9be9ba781251e44df8bbb6cfd376c189502d499","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdc62adb5f241775e226c38ee9be9ba781251e44df8bbb6cfd376c189502d499","first_computed_at":"2026-05-18T00:33:52.907691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:52.907691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vv5+a7+zVMSwEGQkCWimwSCniKE3Q0mA8zWUat1w7yZZfpP2NK+Cua6CPOuTWMoFyT3BDflG7SE3ax6EHmOdAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:52.909568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.04702","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:787093f4c48044d2bc3685ce5429d014fbd9fc50d7b242187dde01967adb82c4","sha256:35f78aa16e952ac63923bff864f32c17c309625d1a2ce68bc27f16a4b23392e7"],"state_sha256":"5a5a3657f993fe13b8e9ca39dc78936b76190ee14f1dadd9ab965d85575fcbdf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7M7cf1ufWNmfLYKHEiCh41zzfWa/v3BiijbYboE8+r/GDFQi3Infb+gHnPn2Qvm2DusDB3pNLnNAXIDqyqEDDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T23:22:50.437179Z","bundle_sha256":"13b2e26cafcd3e9a202d8474238bdf7da0eef95bf3d8bf9511e8aa10a5c61792"}}