2601.08396v1.pdf

{
  "dorsal/arxiv": [
    {
      "date_modified": "2026-02-17T05:53:15.823000Z",
      "hash": "1916e2fb2533346280269931d57d1bca3945c09517b8abb63482dec0c6e189ea",
      "id": "476a81fa-6fd7-4333-886b-2f61f4169fea",
      "source": {
        "execution_id": "277c75b8-c382-4728-aca1-06283a8baaf4",
        "id": "arXiv Dataset",
        "type": "Model",
        "variant": "snapshot-2026-01-17",
        "version": "0.1.0"
      },
      "user_id": 1000002
    }
  ],
  "file/base": {
    "record": {
      "extension": ".pdf",
      "hash": "1916e2fb2533346280269931d57d1bca3945c09517b8abb63482dec0c6e189ea",
      "media_type": "application/pdf",
      "media_type_prefix": "application",
      "name": "2601.08396v1.pdf",
      "size": 1286470
    },
    "source": {
      "execution_id": "df710b9a-44fe-4693-9e47-1be55eea1362",
      "id": "file/base",
      "type": "Model",
      "version": "1.0.0"
    }
  },
  "file/pdf": {
    "private": false,
    "record": {
      "keywords": [],
      "page_count": 37,
      "producer": "pikepdf 8.15.1",
      "title": "Kantorovich Distance via Spanning Trees: Properties and Algorithms",
      "version": "1.7"
    },
    "source": {
      "execution_id": "b9870ed9-3777-4f21-8f06-534f9d41b820",
      "id": "dorsal/pdf",
      "type": "Model",
      "version": "1.1.0"
    }
  }
}