{
  "annotation_id": "160fb04c-24e3-4cf6-8162-2d30208b1a95",
  "date_created": "2026-03-02T18:01:28.352000Z",
  "date_modified": "2026-03-02T18:01:28.352000Z",
  "file_hash": "fc4ef4f4dcce24b649121c9212f10373946d0dec589fe8f5f8b31f3fc1cb682e",
  "private": false,
  "record": {
    "abstract": "While the problem of knot classification is far from solved, it is possible\nto create computer programs that can be used to tabulate knots up to a desired\ndegree of complexity. Here we discuss the main ideas on which such programs can\nbe based. We also present the actual results obtained after running a computer\nprogram on which knots are denoted through regular projections.",
    "arxiv_id": "q-alg/9701006",
    "authors": [
      "Charilaos Aneziris"
    ],
    "categories": [
      "q-alg",
      "math.QA"
    ],
    "title": "Computer Programs for Knot Tabulation",
    "url": "https://arxiv.org/abs/q-alg/9701006"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "6596700e-32e9-4235-92d4-bdce44d04058",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}