{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Z7YTEPZA4M7ZMNEX6Q7WWQMGCQ","short_pith_number":"pith:Z7YTEPZA","schema_version":"1.0","canonical_sha256":"cff1323f20e33f963497f43f6b41861417138023e8d2fb95056f0ed1bbda3ffc","source":{"kind":"arxiv","id":"1203.2538","version":3},"attestation_state":"computed","paper":{"title":"Spanning trees and the complexity of flood-filling games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Scott, Kitty Meeks","submitted_at":"2012-03-12T16:29:42Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1203.2538","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-12T16:29:42Z","cross_cats_sorted":[],"title_canon_sha256":"1813553bf126b83614c0799ea7c3bbd3d4a67efbd0c519ceddff61222585855b","abstract_canon_sha256":"e73ea6572bc37d00a1ece32fef223d495210fcc6841640121ec9c4c1fcbd8ccd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:08.686955Z","signature_b64":"0EoaDwV8lDcYrW1B7y8fyW/wnAt/NbMFkoVf+LpfMq5XBvQfS8MswVs/OzrDC/36hwjwgFycmSbvaJw+wjv2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cff1323f20e33f963497f43f6b41861417138023e8d2fb95056f0ed1bbda3ffc","last_reissued_at":"2026-05-18T03:21:08.686376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:08.686376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning trees and the complexity of flood-filling games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Scott, Kitty Meeks","submitted_at":"2012-03-12T16:29:42Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2538","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.2538","created_at":"2026-05-18T03:21:08.686474+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.2538v3","created_at":"2026-05-18T03:21:08.686474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2538","created_at":"2026-05-18T03:21:08.686474+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7YTEPZA4M7Z","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7YTEPZA4M7ZMNEX","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7YTEPZA","created_at":"2026-05-18T12:27:30.460161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z7YTEPZA4M7ZMNEX6Q7WWQMGCQ","json":"https://pith.science/pith/Z7YTEPZA4M7ZMNEX6Q7WWQMGCQ.json","graph_json":"https://pith.science/api/pith-number/Z7YTEPZA4M7ZMNEX6Q7WWQMGCQ/graph.json","events_json":"https://pith.science/api/pith-number/Z7YTEPZA4M7ZMNEX6Q7WWQMGCQ/events.json","paper":"https://pith.science/paper/Z7YTEPZA"},"agent_actions":{"view_html":"https://pith.science/pith/Z7YTEPZA4M7ZMNEX6Q7WWQMGCQ","download_json":"https://pith.science/pith/Z7YTEPZA4M7ZMNEX6Q7WWQMGCQ.json","view_paper":"https://pith.science/paper/Z7YTEPZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.2538&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7YTEPZA4M7ZMNEX6Q7WWQMGCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7YTEPZA4M7ZMNEX6Q7WWQMGCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7YTEPZA4M7ZMNEX6Q7WWQMGCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7YTEPZA4M7ZMNEX6Q7WWQMGCQ/action/storage_attestation","attest_author":"https://pith.science/pith/Z7YTEPZA4M7ZMNEX6Q7WWQMGCQ/action/author_attestation","sign_citation":"https://pith.science/pith/Z7YTEPZA4M7ZMNEX6Q7WWQMGCQ/action/citation_signature","submit_replication":"https://pith.science/pith/Z7YTEPZA4M7ZMNEX6Q7WWQMGCQ/action/replication_record"}},"created_at":"2026-05-18T03:21:08.686474+00:00","updated_at":"2026-05-18T03:21:08.686474+00:00"}