{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:59Z","timestamp":1759638779467},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,2,3]],"date-time":"2006-02-03T00:00:00Z","timestamp":1138924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,2,3]],"date-time":"2006-02-03T00:00:00Z","timestamp":1138924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1007\/s00446-005-0137-4","type":"journal-article","created":{"date-parts":[[2006,1,16]],"date-time":"2006-01-16T09:54:13Z","timestamp":1137405253000},"page":"279-291","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Eclecticism shrinks even small worlds"],"prefix":"10.1007","volume":"18","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,2,3]]},"reference":[{"key":"137_CR1","unstructured":"Adamic, L., Adar, E.: How To Search a Social Network. Technical Report, HP Labs, Palo Alto (2003)"},{"key":"137_CR2","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Diamadi, Z., Shah, G.: Fault-tolerant routing in peer-to-peer systems. In: 21st ACM Symposium on Principles of Distributed Computing (PODC), pp. 223\u2013232 (2002)","DOI":"10.1145\/571825.571862"},{"key":"137_CR3","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Fraigniaud, P., Kranakis, E., Krizanc, D.: Efficient routing in networks with long range contacts. In: 15th International Symposium on Distributed Computing (DISC). LNCS 2180, pp. 270\u2013284. Springer-Verlag, Berlin Heidelberg, New York (2001)","DOI":"10.1007\/3-540-45414-4_19"},{"issue":"1","key":"137_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.10042","volume":"21","author":"D. Coppersmith","year":"2002","unstructured":"Coppersmith, D., Gamarnik, D., Sviridenko, M.: The diameter of a long-range percolation graph. Random Struct. Algorithms 21(1), 1\u201313 (2002)","journal-title":"Random Struct. Algorithms"},{"key":"137_CR5","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1126\/science.1081058","volume":"301","author":"P. Dodds","year":"2003","unstructured":"Dodds, P., Muhamad, R., Watts, D.: An experimental study of search in global social networks. Science 301, 827\u2013829 (2003)","journal-title":"Science"},{"issue":"2","key":"137_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0378-8733(78)90018-7","volume":"1","author":"P. Killworth","year":"1978","unstructured":"Killworth, P., Bernard, H.: Reverse small-world experiment. Soc. Networks 1(2), 159\u2013192 (1978)","journal-title":"Soc. Networks"},{"key":"137_CR7","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. In: 32nd ACM Symposium on Theory of Computing (STOC), pp. 163\u2013170 (2000)","DOI":"10.1145\/335305.335325"},{"key":"137_CR8","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1038\/35022643","volume":"406","author":"J. Kleinberg","year":"2000","unstructured":"Kleinberg, J.: Navigation in a small-world. Nature 406, 845 (2000)","journal-title":"Nature"},{"key":"137_CR9","unstructured":"Kleinberg, J.: Small-world phenomena and the dynamics of information. In: 15th Neural Information Processing Systems (NIPS) (2001)"},{"key":"137_CR10","doi-asserted-by":"crossref","unstructured":"Lebhar, E., Schabanel, N.: Searching for optimal paths in long-range contact networks. In: 31st International Colloquium on Automata, Languages and Programming (ICALP). LNCS 3142, pp. 894\u2013905 (2004)","DOI":"10.1007\/978-3-540-27836-8_75"},{"key":"137_CR11","unstructured":"Manku, G., Bawa, M., Raghavan, P.: Symphony: distributed hashing in a small world. In: 4th USENIX Symposium on Internet Technologies and Systems, pp. 127\u2013140 (2003)"},{"key":"137_CR12","doi-asserted-by":"crossref","unstructured":"Manku, G., Naor, M., Wieder, U.: Know thy neighbor\u2019s neighbor: the power of lookahead in randomized P2P networks. In: 36th ACM Symposium on Theory of Computing (STOC) (2004)","DOI":"10.1145\/1007352.1007368"},{"key":"137_CR13","doi-asserted-by":"crossref","unstructured":"Martel, C., Nguyen, V.: Analyzing Kleinberg\u2019s (and other) small-world models. In: 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 179\u2013188 (2004)","DOI":"10.1145\/1011767.1011794"},{"key":"137_CR14","doi-asserted-by":"crossref","unstructured":"Milgram, S.: The small-world problem. Psychol. Today, pp. 60\u201367 (1967)","DOI":"10.1037\/e400002009-005"},{"key":"137_CR15","doi-asserted-by":"publisher","first-page":"425","DOI":"10.2307\/2786545","volume":"32","author":"J. Travers","year":"1969","unstructured":"Travers, J., Milgram, S.: An experimental study of the small world problem. Sociometry 32, 425 (1969)","journal-title":"Sociometry"},{"key":"137_CR16","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1126\/science.1070120","volume":"296","author":"D. Watts","year":"2002","unstructured":"Watts, D., Dodds, P., Newman, M.: Identity and search in social networks. Science 296, 1302\u20131305 (2002)","journal-title":"Science"},{"key":"137_CR17","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D. Watts","year":"1998","unstructured":"Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0137-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-005-0137-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0137-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0137-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T04:13:55Z","timestamp":1652501635000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-005-0137-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2,3]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["137"],"URL":"https:\/\/doi.org\/10.1007\/s00446-005-0137-4","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2,3]]},"assertion":[{"value":"28 October 2004","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2005","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2006","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}