{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Z7YTEPZA4M7ZMNEX6Q7WWQMGCQ","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":"e73ea6572bc37d00a1ece32fef223d495210fcc6841640121ec9c4c1fcbd8ccd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-12T16:29:42Z","title_canon_sha256":"1813553bf126b83614c0799ea7c3bbd3d4a67efbd0c519ceddff61222585855b"},"schema_version":"1.0","source":{"id":"1203.2538","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2538","created_at":"2026-05-18T03:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2538v3","created_at":"2026-05-18T03:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2538","created_at":"2026-05-18T03:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"Z7YTEPZA4M7Z","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z7YTEPZA4M7ZMNEX","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z7YTEPZA","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:2a31422643c10a55fd847dc26a6577dd23caca50012a809515b8b404140a85aa","target":"graph","created_at":"2026-05-18T03:21:08Z","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 problems related to the combinatorial game (Free-)Flood-It, in which players aim to make a coloured graph monochromatic with the minimum possible number of flooding operations. We show that the minimum number of moves required to flood any given graph G is equal to the minimum, taken over all spanning trees T of G, of the number of moves required to flood T. This result is then applied to give two polynomial-time algorithms for flood-filling problems. Firstly, we can compute in polynomial time the minimum number of moves required to flood a graph with only a polynomial number of co","authors_text":"Alexander Scott, Kitty Meeks","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-12T16:29:42Z","title":"Spanning trees and the complexity of flood-filling games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2538","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:0a594165c18775b9af4337700402d2371230eeb174406e042a7a856f5584ca63","target":"record","created_at":"2026-05-18T03:21:08Z","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":"e73ea6572bc37d00a1ece32fef223d495210fcc6841640121ec9c4c1fcbd8ccd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-12T16:29:42Z","title_canon_sha256":"1813553bf126b83614c0799ea7c3bbd3d4a67efbd0c519ceddff61222585855b"},"schema_version":"1.0","source":{"id":"1203.2538","kind":"arxiv","version":3}},"canonical_sha256":"cff1323f20e33f963497f43f6b41861417138023e8d2fb95056f0ed1bbda3ffc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cff1323f20e33f963497f43f6b41861417138023e8d2fb95056f0ed1bbda3ffc","first_computed_at":"2026-05-18T03:21:08.686376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:08.686376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0EoaDwV8lDcYrW1B7y8fyW/wnAt/NbMFkoVf+LpfMq5XBvQfS8MswVs/OzrDC/36hwjwgFycmSbvaJw+wjv2Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:08.686955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2538","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a594165c18775b9af4337700402d2371230eeb174406e042a7a856f5584ca63","sha256:2a31422643c10a55fd847dc26a6577dd23caca50012a809515b8b404140a85aa"],"state_sha256":"ba901c226085393ca969882daa2bbd03986f2780afc53144bdedf36c03500273"}