2601.19907v1.pdf

{
  "file/base": {
    "record": {
      "extension": ".pdf",
      "hash": "dacba043b39d6cc7f8dcbce608880eab7f4d3201dbc106781045823fd58300ca",
      "media_type": "application/pdf",
      "media_type_prefix": "application",
      "name": "2601.19907v1.pdf",
      "size": 2888399
    },
    "source": {
      "execution_id": "ed69e077-d066-4a4d-be88-ac4b64030fcc",
      "id": "file/base",
      "type": "Model",
      "version": "1.0.0"
    }
  },
  "file/pdf": {
    "private": false,
    "record": {
      "keywords": [],
      "page_count": 7,
      "producer": "pikepdf 8.15.1",
      "title": "RAPID-Graph: Recursive All-Pairs Shortest Paths Using Processing-in-Memory for Dynamic Programming on Graphs",
      "version": "1.7"
    },
    "source": {
      "execution_id": "8d71b84d-d36e-4878-a0d7-3ef0cec31311",
      "id": "dorsal/pdf",
      "type": "Model",
      "version": "1.1.0"
    }
  }
}