{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T22:48:08Z","timestamp":1759963688423,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,8,24]],"date-time":"2008-08-24T00:00:00Z","timestamp":1219536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,8,24]]},"DOI":"10.1145\/1401890.1401916","type":"proceedings-article","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T11:56:41Z","timestamp":1219838201000},"page":"177-185","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Bypass rates"],"prefix":"10.1145","author":[{"given":"Atish","family":"Das Sarma","sequence":"first","affiliation":[{"name":"Georgia Tech, Atlanta, GA, USA"}]},{"given":"Sreenivas","family":"Gollapudi","sequence":"additional","affiliation":[{"name":"Microsoft Research, Mountain View, CA, USA"}]},{"given":"Samuel","family":"Ieong","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,8,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291025"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73062"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148245"},{"key":"e_1_3_2_1_4_1","volume-title":"Spectral Graph Theory","author":"Chung F. R.","year":"1997","unstructured":"F. R. Chung , editor. Spectral Graph Theory . American Mathematical Society , 1997 . F. R. Chung, editor. Spectral Graph Theory. American Mathematical Society, 1997."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277784"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.46"},{"key":"e_1_3_2_1_7_1","volume-title":"Random walks on graphs. Stochastic Processes and their App., 2:311--336","author":"Gobel F.","year":"1974","unstructured":"F. Gobel and A. Jagers . Random walks on graphs. Stochastic Processes and their App., 2:311--336 , 1974 . F. Gobel and A. Jagers. Random walks on graphs. Stochastic Processes and their App., 2:311--336, 1974."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076063"},{"key":"e_1_3_2_1_11_1","first-page":"25","volume-title":"Tezele Congresului XVIII al Academiei Romano-Americane","author":"Lozovanu D.","year":"1993","unstructured":"D. Lozovanu and A. Zelikovsky . Minimal and bounded tree problems . In Tezele Congresului XVIII al Academiei Romano-Americane , pages 25 -- 26 , 1993 . D. Lozovanu and A. Zelikovsky. Minimal and bounded tree problems. In Tezele Congresului XVIII al Academiei Romano-Americane, pages 25--26, 1993."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.009"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5948\/UPO9781614440222"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390255"},{"key":"e_1_3_2_1_15_1","volume-title":"AAAI","author":"Radlinski Filip","year":"2006","unstructured":"Filip Radlinski and Thorsten Joachims . Minimally invasive randomization fro collecting unbiased preferences from clickthrough logs . In AAAI , 2006 . Filip Radlinski and Thorsten Joachims. Minimally invasive randomization fro collecting unbiased preferences from clickthrough logs. In AAAI, 2006."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281254"},{"key":"e_1_3_2_1_17_1","first-page":"546","volume-title":"SODA","author":"Ravi R.","year":"1994","unstructured":"R. Ravi , Ravi Sundaram , Madhav V. Marathe , Daniel J. Rosenkrantz , and S. S. Ravi . Spanning trees short or small . In SODA , pages 546 -- 555 , 1994 . R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, and S. S. Ravi. Spanning trees short or small. In SODA, pages 546--555, 1994."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1108\/eb026647"},{"key":"e_1_3_2_1_19_1","first-page":"418","volume-title":"Proc. of the 13th Text Retrieval Conference","author":"Zaragoza H.","year":"2003","unstructured":"H. Zaragoza , N. Craswell , M. Taylor , S. Saria , , and S. Robertson . Microsoft cambridge at trec-12: Web and hard track . In Proc. of the 13th Text Retrieval Conference , pages 418 -- 425 , 2003 . H. Zaragoza, N. Craswell, M. Taylor, S. Saria, , and S. Robertson. Microsoft cambridge at trec-12: Web and hard track. In Proc. of the 13th Text Retrieval Conference, pages 418--425, 2003."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860440"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2004.11.003"}],"event":{"name":"KDD08: The 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"],"location":"Las Vegas Nevada USA","acronym":"KDD08"},"container-title":["Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401916","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1401890.1401916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:40Z","timestamp":1750255000000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401916"}},"subtitle":["reducing query abandonment using negative inferences"],"short-title":[],"issued":{"date-parts":[[2008,8,24]]},"references-count":20,"alternative-id":["10.1145\/1401890.1401916","10.1145\/1401890"],"URL":"https:\/\/doi.org\/10.1145\/1401890.1401916","relation":{},"subject":[],"published":{"date-parts":[[2008,8,24]]},"assertion":[{"value":"2008-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}