2601.14619v1.pdf

{
  "file/base": {
    "record": {
      "extension": ".pdf",
      "hash": "6773d85df96aef4e0b36b0345430ac0684dc9937bd1fbacb2b565b40819289b5",
      "media_type": "application/pdf",
      "media_type_prefix": "application",
      "name": "2601.14619v1.pdf",
      "size": 1039595
    },
    "source": {
      "execution_id": "a685df74-526b-48db-8468-c42452401f78",
      "id": "file/base",
      "type": "Model",
      "version": "1.0.0"
    }
  },
  "file/pdf": {
    "private": false,
    "record": {
      "creation_date": "2026-01-22T01:21:57Z",
      "keywords": [
        "Cohesive subgraph mining",
        "edge-based quasi-clique"
      ],
      "modified_date": "2026-01-22T01:21:57Z",
      "page_count": 12,
      "producer": "pikepdf 8.15.1",
      "subject": "-  Theory of computation  -\u003e  Graph algorithms analysis.",
      "title": "Maximum Edge-based Quasi-Clique: Novel Iterative Frameworks",
      "version": "1.7"
    },
    "source": {
      "execution_id": "7ce5e45d-acee-4953-ae9a-52c3c8da030e",
      "id": "dorsal/pdf",
      "type": "Model",
      "version": "1.1.0"
    }
  }
}