{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DX6NUFIPU6QJKMZFEJSMS6EM7V","short_pith_number":"pith:DX6NUFIP","schema_version":"1.0","canonical_sha256":"1dfcda150fa7a09533252264c9788cfd6dfd7ab5491fc719fbabded5132b8209","source":{"kind":"arxiv","id":"1206.6201","version":2},"attestation_state":"computed","paper":{"title":"On Complexity of Flooding Games on Graphs with Interval Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno, Yota Otachi, Yushi Uno","submitted_at":"2012-06-27T08:27:44Z","abstract_excerpt":"The flooding games, which are called Flood-It, Mad Virus, or HoneyBee, are a kind of coloring games and they have been becoming popular online. In these games, each player colors one specified cell in his/her turn, and all connected neighbor cells of the same color are also colored by the color. This flooding or coloring spreads on the same color cells. It is natural to consider these new coloring games on more general boards, or general graphs. Recently, computational complexities of the variants of the flooding games on several graph classes have been studied. In this paper, we investigate t"},"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":"1206.6201","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-27T08:27:44Z","cross_cats_sorted":[],"title_canon_sha256":"fa6244b890430741e5f555bec68a55a41f87a0aaed1e2e8bfe4e4cde486e1a8b","abstract_canon_sha256":"415ccb4a07929850764aa6e407aa3b67573a71975d99a84ecc161ba8bd8d7c5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:28.064930Z","signature_b64":"1XUCOAD1jcTLkdP5pGJsed+3IAjmF3YHObOvrY8x13hB7N8JHyQaJLJ743jW6azr0k+sWpIeVPqg5ONhBXzHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dfcda150fa7a09533252264c9788cfd6dfd7ab5491fc719fbabded5132b8209","last_reissued_at":"2026-05-18T03:35:28.064190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:28.064190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Complexity of Flooding Games on Graphs with Interval Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno, Yota Otachi, Yushi Uno","submitted_at":"2012-06-27T08:27:44Z","abstract_excerpt":"The flooding games, which are called Flood-It, Mad Virus, or HoneyBee, are a kind of coloring games and they have been becoming popular online. In these games, each player colors one specified cell in his/her turn, and all connected neighbor cells of the same color are also colored by the color. This flooding or coloring spreads on the same color cells. It is natural to consider these new coloring games on more general boards, or general graphs. Recently, computational complexities of the variants of the flooding games on several graph classes have been studied. In this paper, we investigate t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6201","kind":"arxiv","version":2},"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":"1206.6201","created_at":"2026-05-18T03:35:28.064305+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6201v2","created_at":"2026-05-18T03:35:28.064305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6201","created_at":"2026-05-18T03:35:28.064305+00:00"},{"alias_kind":"pith_short_12","alias_value":"DX6NUFIPU6QJ","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DX6NUFIPU6QJKMZF","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DX6NUFIP","created_at":"2026-05-18T12:27:04.183437+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/DX6NUFIPU6QJKMZFEJSMS6EM7V","json":"https://pith.science/pith/DX6NUFIPU6QJKMZFEJSMS6EM7V.json","graph_json":"https://pith.science/api/pith-number/DX6NUFIPU6QJKMZFEJSMS6EM7V/graph.json","events_json":"https://pith.science/api/pith-number/DX6NUFIPU6QJKMZFEJSMS6EM7V/events.json","paper":"https://pith.science/paper/DX6NUFIP"},"agent_actions":{"view_html":"https://pith.science/pith/DX6NUFIPU6QJKMZFEJSMS6EM7V","download_json":"https://pith.science/pith/DX6NUFIPU6QJKMZFEJSMS6EM7V.json","view_paper":"https://pith.science/paper/DX6NUFIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6201&json=true","fetch_graph":"https://pith.science/api/pith-number/DX6NUFIPU6QJKMZFEJSMS6EM7V/graph.json","fetch_events":"https://pith.science/api/pith-number/DX6NUFIPU6QJKMZFEJSMS6EM7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DX6NUFIPU6QJKMZFEJSMS6EM7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DX6NUFIPU6QJKMZFEJSMS6EM7V/action/storage_attestation","attest_author":"https://pith.science/pith/DX6NUFIPU6QJKMZFEJSMS6EM7V/action/author_attestation","sign_citation":"https://pith.science/pith/DX6NUFIPU6QJKMZFEJSMS6EM7V/action/citation_signature","submit_replication":"https://pith.science/pith/DX6NUFIPU6QJKMZFEJSMS6EM7V/action/replication_record"}},"created_at":"2026-05-18T03:35:28.064305+00:00","updated_at":"2026-05-18T03:35:28.064305+00:00"}