{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:11:13Z","timestamp":1775283073423,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540770039","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77004-6_6","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T06:40:36Z","timestamp":1195022436000},"page":"68-81","source":"Crossref","is-referenced-by-count":7,"title":["Manipulation-Resistant Reputations Using Hitting Time"],"prefix":"10.1007","author":[{"given":"John","family":"Hopcroft","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Sheldon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs. Monograph in Preparation, \n                  \n                    http:\/\/www.stat.berkeley.edu\/users\/aldous\/RWG\/book.html"},{"key":"6_CR2","unstructured":"Avrachenkov, K., Litvak, N., Nemirovsky, D., Osipova, N.: Monte carlo methods in PageRank computation: When one iteration is sufficient. Memorandum 1754, University of Twente, The Netherlands (2005)"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/1052934.1052938","volume":"5","author":"M. Bianchini","year":"2005","unstructured":"Bianchini, M., Gori, M., Scarselli, F.: Inside PageRank. ACM Trans. Inter. Tech.\u00a05(1), 92\u2013128 (2005)","journal-title":"ACM Trans. Inter. Tech."},{"issue":"1-7","key":"6_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S. Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems\u00a030(1-7), 107\u2013117 (1998)","journal-title":"Computer Networks and ISDN Systems"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/1080192.1080202","volume-title":"P2PECON 2005: Proceeding of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems","author":"A. Cheng","year":"2005","unstructured":"Cheng, A., Friedman, E.: Sybilproof reputation mechanisms. In: P2PECON 2005: Proceeding of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems, pp. 128\u2013132. ACM Press, New York (2005)"},{"key":"6_CR6","unstructured":"Cheng, A., Friedman, E.: Manipulability of PageRank under sybil strategies. In: Proceedings of the First Workshop of Networked Systems (2006)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45748-8_24","volume-title":"Peer-to-Peer Systems","author":"J. Douceur","year":"2002","unstructured":"Douceur, J.: The sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, Springer, Heidelberg (2002)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms and Models for the Web-Graph","author":"D. Fogaras","year":"2004","unstructured":"Fogaras, D., R\u00e1cz, B.: Towards fully personalizing PageRank. In: Leonardi, S. (ed.) WAW 2004. LNCS, vol.\u00a03243, Springer, Heidelberg (2004)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Friedman, E., Resnick, P., Sami, R.: Manipulation-resistant reputation systems. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory, Cambridge University Press, Cambridge (to appear)","DOI":"10.1017\/CBO9780511800481.029"},{"key":"6_CR10","unstructured":"Gade, K., Prakash, A.: Using transient probability distributions of random walk to estimate spam resistant authority scores. Unpublished manuscript (2007)"},{"key":"6_CR11","volume-title":"Proceedings of the 32nd International Conference on Very Large Databases","author":"Z. Gy\u00f6ngyi","year":"2006","unstructured":"Gy\u00f6ngyi, Z., Berkhin, P., Garcia-Molina, H., Pedersen, J.: Link spam detection based on mass estimation. In: Proceedings of the 32nd International Conference on Very Large Databases, ACM, New York (2006)"},{"key":"6_CR12","first-page":"517","volume-title":"Proceedings of the 31st International Conference on Very Large Databases","author":"Z. Gy\u00f6ngyi","year":"2005","unstructured":"Gy\u00f6ngyi, Z., Garcia-Molina, H.: Link spam alliances. In: Proceedings of the 31st International Conference on Very Large Databases, pp. 517\u2013528. ACM, New York (2005)"},{"key":"6_CR13","unstructured":"Gy\u00f6ngyi, Z., Garcia-Molina, H.: Web spam taxonomy. In: First International Workshop on Adversarial Information Retrieval on the Web (2005)"},{"key":"6_CR14","first-page":"576","volume-title":"Proceedings of the 30th International Conference on Very Large Databases","author":"Z. Gy\u00f6ngyi","year":"2004","unstructured":"Gy\u00f6ngyi, Z., Garcia-Molina, H., Pedersen, J.: Combating web spam with TrustRank. In: Proceedings of the 30th International Conference on Very Large Databases, pp. 576\u2013587. Morgan Kaufmann, San Francisco (2004)"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/203091.203094","volume":"5","author":"P. Heidelberger","year":"1995","unstructured":"Heidelberger, P.: Fast simulation of rare events in queueing and reliability models. ACM Trans. Model. Comput. Simul.\u00a05(1), 43\u201385 (1995)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: SimRank: A measure of structural-context similarity. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002)","DOI":"10.1145\/775047.775126"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/775152.775242","volume-title":"WWW 2003: Proceedings of the 12th international conference on World Wide Web","author":"S.D. Kamvar","year":"2003","unstructured":"Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in P2P networks. In: WWW 2003: Proceedings of the 12th international conference on World Wide Web, pp. 640\u2013651. ACM Press, New York (2003)"},{"issue":"3","key":"6_CR18","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"A.N. Langville","year":"2004","unstructured":"Langville, A.N., Meyer, C.D.: Deeper inside PageRank. Internet Mathematics\u00a01(3), 335\u2013380 (2004)","journal-title":"Internet Mathematics"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: CIKM 2003. Proceedings of the 12th International Conference on Information and Knowledge Management (2003)","DOI":"10.1145\/956863.956972"},{"key":"6_CR20","unstructured":"Mason, K.: Detecting Colluders in PageRank - Finding Slow Mixing States in a Markov Chain. PhD thesis, Stanford University (2005)"},{"key":"6_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (2005)"},{"key":"6_CR22","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project (1998)"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms and Models for the Web-Graph","author":"H. Zhang","year":"2004","unstructured":"Zhang, H., Goel, A., Govindian, R., Mason, K., Van Roy, B.: Making eigenvector-based reputation systems robust to collusion. In: Leonardi, S. (ed.) WAW 2004. LNCS, vol.\u00a03243, Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web-Graph"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77004-6_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:52:41Z","timestamp":1619520761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77004-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540770039"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77004-6_6","relation":{},"subject":[]}}