{
  "annotation_id": "f5403470-a2f7-4519-9000-e83f35591f78",
  "date_created": "2026-02-17T05:53:20.115000Z",
  "date_modified": "2026-02-17T05:53:20.115000Z",
  "file_hash": "e96c7c9326412b1e819052c4976f33e1fb05d9cfec518c20ee82ab8c45cdc6ee",
  "private": false,
  "record": {
    "abstract": "Wataridori is a pencil puzzle involving drawing paths to connect all circles in a rectangular grid into pairs, in order to satisfy several constraints. In this paper, we prove that deciding solvability of a given Wataridori puzzle is NP-complete via reduction from Numberlink, another pencil puzzle that has already been proved to be NP-complete.",
    "arxiv_id": "2601.09345",
    "authors": [
      "Suthee Ruangwises"
    ],
    "categories": [
      "cs.CC"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Wataridori is NP-Complete",
    "url": "https://arxiv.org/abs/2601.09345",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "6d6b711d-4d96-4062-829d-c647f3150eb7",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}