{
  "annotation_id": "73b90a3b-cf39-46a9-800a-07d5d02e2990",
  "date_created": "2026-03-02T18:01:32.167000Z",
  "date_modified": "2026-03-02T18:01:32.167000Z",
  "file_hash": "0a6b97e741fd17ad0535dfa619481f3519e71852c372b89e42737a51b19999cc",
  "private": false,
  "record": {
    "abstract": "Exploiting recent developments in information theory, we propose, illustrate,\nand validate a principled information-theoretic algorithm for module discovery\nand resulting measure of network modularity. This measure is an order parameter\n(a dimensionless number between 0 and 1). Comparison is made to other\napproaches to module-discovery and to quantifying network modularity using\nMonte Carlo generated Erdos-like modular networks. Finally, the Network\nInformation Bottleneck (NIB) algorithm is applied to a number of real world\nnetworks, including the \"social\" network of coauthors at the APS March Meeting\n2004.",
    "arxiv_id": "q-bio/0411033",
    "authors": [
      "Etay Ziv",
      "Manuel Middendorf",
      "Chris Wiggins"
    ],
    "categories": [
      "q-bio.QM",
      "q-bio.GN",
      "q-bio.MN"
    ],
    "doi": "10.1103/PhysRevE.71.046117",
    "title": "An Information-Theoretic Approach to Network Modularity",
    "url": "https://arxiv.org/abs/q-bio/0411033"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ba50cadb-2862-4c57-9e40-9f88a48bcf70",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}