{
  "annotation_id": "48a4720f-f860-4361-a222-9ec582747c5b",
  "date_created": "2026-03-02T18:01:11.462000Z",
  "date_modified": "2026-03-02T18:01:11.462000Z",
  "file_hash": "9a29a406bbee525b7ebfdcdceec983eb28d67de0a532e3b0eb1260637f3b017b",
  "private": false,
  "record": {
    "abstract": "The efficiency of a large hierarchical organisation is simulated on\nBarabasi-Albert networks, when each needed link leads to a loss of information.\nThe optimum is found at a finite network size, corresponding to about five\nhierarchical layers, provided a cost for building the network is included in\nour optimization.",
    "arxiv_id": "physics/0608179",
    "authors": [
      "D. Stauffer",
      "P. M. C. de Oliveira"
    ],
    "categories": [
      "physics.soc-ph"
    ],
    "doi": "10.1142/S0129183106009886",
    "title": "Optimization of hierarchical structures of information flow",
    "url": "https://arxiv.org/abs/physics/0608179"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "910ae10e-8e43-41dd-8b26-269272c8b478",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}