{
  "annotation_id": "e5b7625b-d099-4807-8736-22924b41353f",
  "date_created": "2026-03-02T18:01:00.415000Z",
  "date_modified": "2026-03-02T18:01:00.415000Z",
  "file_hash": "33d30f3f5b85561c9e864b82cec69d0ed9844c5330ce1f2e7a06c885d09c4de2",
  "private": false,
  "record": {
    "abstract": "This paper describes a new algorithm - P\u0026A algorithm - utilized in\nidentifying overlapping communities in non oriented valued graph regardless of\ntheir number or their size. The complexity of this algorithm is minimal in the\nmatter that the number of operations grows linearly with the number of\nvertices.",
    "arxiv_id": "physics/0509254",
    "authors": [
      "Nicolas Pissard",
      "Houssem Assadi"
    ],
    "categories": [
      "physics.soc-ph"
    ],
    "title": "Detecting overlapping communities in linear time with P\u0026A algorithm",
    "url": "https://arxiv.org/abs/physics/0509254"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "afbbaab7-a323-41cd-97f3-4c513dadc831",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}