{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KRB7O7UD6VERFXPWHUM475KEWV","short_pith_number":"pith:KRB7O7UD","schema_version":"1.0","canonical_sha256":"5443f77e83f54912ddf63d19cff544b5773626cc490e70f10306d3fde6c40411","source":{"kind":"arxiv","id":"1804.08236","version":1},"attestation_state":"computed","paper":{"title":"How Bad is the Freedom to Flood-It?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Masashi Kiyomi, Mehdi Khosravian Ghadikolaei, Michael Lampis, R\\'emy Belmonte, Yota Otachi","submitted_at":"2018-04-23T03:21:10Z","abstract_excerpt":"Fixed-Flood-It and Free-Flood-It are combinatorial problems on graphs that generalize a very popular puzzle called Flood-It. Both problems consist of recoloring moves whose goal is to produce a monochromatic (\"flooded\") graph as quickly as possible. Their difference is that in Free-Flood-It the player has the additional freedom of choosing the vertex to play in each move. In this paper, we investigate how this freedom affects the complexity of the problem. It turns out that the freedom is bad in some sense. We show that some cases trivially solvable for Fixed-Flood-It become intractable for Fr"},"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":"1804.08236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-23T03:21:10Z","cross_cats_sorted":[],"title_canon_sha256":"db3bc61e585cda76046aa96dc0eb68a57664387b647ad7ebc60d340fc1c17ed7","abstract_canon_sha256":"71778cd1dd8811e9963c0784ca9f5232bbcf2362b8ee02854b873ab06f88a052"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:49.110027Z","signature_b64":"JQJtZf8vODCaex43POTSwRrhwAJzqw1Ar99i4Z254O5GQVQ2LNNUoCTup4EHGV8nycktRp/bHpFCx8skbrtBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5443f77e83f54912ddf63d19cff544b5773626cc490e70f10306d3fde6c40411","last_reissued_at":"2026-05-18T00:17:49.109374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:49.109374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Bad is the Freedom to Flood-It?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Masashi Kiyomi, Mehdi Khosravian Ghadikolaei, Michael Lampis, R\\'emy Belmonte, Yota Otachi","submitted_at":"2018-04-23T03:21:10Z","abstract_excerpt":"Fixed-Flood-It and Free-Flood-It are combinatorial problems on graphs that generalize a very popular puzzle called Flood-It. Both problems consist of recoloring moves whose goal is to produce a monochromatic (\"flooded\") graph as quickly as possible. Their difference is that in Free-Flood-It the player has the additional freedom of choosing the vertex to play in each move. In this paper, we investigate how this freedom affects the complexity of the problem. It turns out that the freedom is bad in some sense. We show that some cases trivially solvable for Fixed-Flood-It become intractable for Fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08236","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.08236","created_at":"2026-05-18T00:17:49.109536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08236v1","created_at":"2026-05-18T00:17:49.109536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08236","created_at":"2026-05-18T00:17:49.109536+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRB7O7UD6VER","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRB7O7UD6VERFXPW","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRB7O7UD","created_at":"2026-05-18T12:32:33.847187+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/KRB7O7UD6VERFXPWHUM475KEWV","json":"https://pith.science/pith/KRB7O7UD6VERFXPWHUM475KEWV.json","graph_json":"https://pith.science/api/pith-number/KRB7O7UD6VERFXPWHUM475KEWV/graph.json","events_json":"https://pith.science/api/pith-number/KRB7O7UD6VERFXPWHUM475KEWV/events.json","paper":"https://pith.science/paper/KRB7O7UD"},"agent_actions":{"view_html":"https://pith.science/pith/KRB7O7UD6VERFXPWHUM475KEWV","download_json":"https://pith.science/pith/KRB7O7UD6VERFXPWHUM475KEWV.json","view_paper":"https://pith.science/paper/KRB7O7UD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08236&json=true","fetch_graph":"https://pith.science/api/pith-number/KRB7O7UD6VERFXPWHUM475KEWV/graph.json","fetch_events":"https://pith.science/api/pith-number/KRB7O7UD6VERFXPWHUM475KEWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRB7O7UD6VERFXPWHUM475KEWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRB7O7UD6VERFXPWHUM475KEWV/action/storage_attestation","attest_author":"https://pith.science/pith/KRB7O7UD6VERFXPWHUM475KEWV/action/author_attestation","sign_citation":"https://pith.science/pith/KRB7O7UD6VERFXPWHUM475KEWV/action/citation_signature","submit_replication":"https://pith.science/pith/KRB7O7UD6VERFXPWHUM475KEWV/action/replication_record"}},"created_at":"2026-05-18T00:17:49.109536+00:00","updated_at":"2026-05-18T00:17:49.109536+00:00"}