{
  "annotation_id": "506e2293-4f94-42c6-a000-fe5fa81eec97",
  "date_created": "2026-03-02T18:01:24.720000Z",
  "date_modified": "2026-03-02T18:01:24.720000Z",
  "file_hash": "3e0ad9e9da23108eeb40a4e7231549f392c6ad11819a347458f7d83c4efea8ba",
  "private": false,
  "record": {
    "abstract": "In a previous paper (q-alg/9501022) we suggested some algorithms that could\nbe useful in solving the problem of knot classification. Here we continue this\ndiscussion by answering questions raised in that paper and by commenting on\npractical aspects related to running these algorithms as computer programs.\nFurther on, we reach a solution by improving on the efficiency of these\nalgorithms, and by introducing new ones.",
    "arxiv_id": "q-alg/9505003",
    "authors": [
      "Charilaos Aneziris"
    ],
    "categories": [
      "q-alg",
      "alg-geom",
      "math.AG",
      "math.QA"
    ],
    "title": "A Novel Aprroach to Knot Classification",
    "url": "https://arxiv.org/abs/q-alg/9505003"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8f820fba-5377-41ed-94c1-6c8072dc98fa",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}