{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MJE53F3YOBF5722US3DPTFKHHL","short_pith_number":"pith:MJE53F3Y","schema_version":"1.0","canonical_sha256":"6249dd9778704bdfeb5496c6f995473ac34b76515f68e99c055595f655aca132","source":{"kind":"arxiv","id":"2606.23837","version":1},"attestation_state":"computed","paper":{"title":"Flood-It with Jewelry -- Characterizing the Game Complexity for Cograph Generalizations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Christian Rosenke, Mark Scheibner, Martin Darm\\\"untzel","submitted_at":"2026-06-22T18:17:19Z","abstract_excerpt":"Flood-It is a single-player game played on a precolored graph $G$, where the objective is to make $G$ monochromatic using as few flooding moves as possible. In each move, a color $c$ is selected and all vertices reachable from a fixed pivot vertex via a monochromatic path are recolored with $c$. In the free variant, the pivot may be chosen anew in every move. Deciding whether a graph can be made monochromatic in at most $k$ moves is NP-complete for both variants, fixed and free. This hardness persists even under strong structural restrictions such as split graphs and trees. The Free Flood-It v"},"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":"2606.23837","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-06-22T18:17:19Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f0049feb8d0df84e9f1c789552eda7095295a5bfdfe7344c7ea80c67f66957b1","abstract_canon_sha256":"74b6b736d3a382204c5920cbfe90c77aeec5eca57a2ec18e5974dec398872819"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T00:14:28.241037Z","signature_b64":"ww6mkZsKgT9rkV9K2XJY7HZJoQgCpPtlLGsJvo2fWBDxvWbRSxzhzzSdhOxZqsqY2bxS28pTAq1wZLSWr/g2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6249dd9778704bdfeb5496c6f995473ac34b76515f68e99c055595f655aca132","last_reissued_at":"2026-06-24T00:14:28.240671Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T00:14:28.240671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flood-It with Jewelry -- Characterizing the Game Complexity for Cograph Generalizations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Christian Rosenke, Mark Scheibner, Martin Darm\\\"untzel","submitted_at":"2026-06-22T18:17:19Z","abstract_excerpt":"Flood-It is a single-player game played on a precolored graph $G$, where the objective is to make $G$ monochromatic using as few flooding moves as possible. In each move, a color $c$ is selected and all vertices reachable from a fixed pivot vertex via a monochromatic path are recolored with $c$. In the free variant, the pivot may be chosen anew in every move. Deciding whether a graph can be made monochromatic in at most $k$ moves is NP-complete for both variants, fixed and free. This hardness persists even under strong structural restrictions such as split graphs and trees. The Free Flood-It v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23837","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.23837/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.23837","created_at":"2026-06-24T00:14:28.240731+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.23837v1","created_at":"2026-06-24T00:14:28.240731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23837","created_at":"2026-06-24T00:14:28.240731+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJE53F3YOBF5","created_at":"2026-06-24T00:14:28.240731+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJE53F3YOBF5722U","created_at":"2026-06-24T00:14:28.240731+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJE53F3Y","created_at":"2026-06-24T00:14:28.240731+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/MJE53F3YOBF5722US3DPTFKHHL","json":"https://pith.science/pith/MJE53F3YOBF5722US3DPTFKHHL.json","graph_json":"https://pith.science/api/pith-number/MJE53F3YOBF5722US3DPTFKHHL/graph.json","events_json":"https://pith.science/api/pith-number/MJE53F3YOBF5722US3DPTFKHHL/events.json","paper":"https://pith.science/paper/MJE53F3Y"},"agent_actions":{"view_html":"https://pith.science/pith/MJE53F3YOBF5722US3DPTFKHHL","download_json":"https://pith.science/pith/MJE53F3YOBF5722US3DPTFKHHL.json","view_paper":"https://pith.science/paper/MJE53F3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.23837&json=true","fetch_graph":"https://pith.science/api/pith-number/MJE53F3YOBF5722US3DPTFKHHL/graph.json","fetch_events":"https://pith.science/api/pith-number/MJE53F3YOBF5722US3DPTFKHHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJE53F3YOBF5722US3DPTFKHHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJE53F3YOBF5722US3DPTFKHHL/action/storage_attestation","attest_author":"https://pith.science/pith/MJE53F3YOBF5722US3DPTFKHHL/action/author_attestation","sign_citation":"https://pith.science/pith/MJE53F3YOBF5722US3DPTFKHHL/action/citation_signature","submit_replication":"https://pith.science/pith/MJE53F3YOBF5722US3DPTFKHHL/action/replication_record"}},"created_at":"2026-06-24T00:14:28.240731+00:00","updated_at":"2026-06-24T00:14:28.240731+00:00"}