{"paper":{"title":"Search and Congestion in Complex Networks","license":"","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"(2) Departament d'Economia i Empresa, Alacant), Albert Diaz-Guilera (3), Alex Arenas (1), Antonio Cabrales (2), Barcelona (3) Departament de Fisica Fonamental, Barcelona (4) Departament d'Enginyeria Quimica, Fernando Vega-Redondo (5) ((1) Departament d'Enginyeria Informatica, Roger Guimera (4), Tarragona, Tarragona (5) Departament de Fonaments d'Analisi Economica, Universitat d'Alacant, Universitat de Barcelona, Universitat Pompeu Fabra, Universitat Rovira i Virgili","submitted_at":"2003-01-09T18:01:34Z","abstract_excerpt":"A model of communication that is able to cope simultaneously with the problems of search and congestion is presented. We investigate the communication dynamics in model networks and introduce a general framework that enables a search of optimal structures."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0301124","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}