{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:54Z","timestamp":1750221354486,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,4,9]],"date-time":"2018-04-09T00:00:00Z","timestamp":1523232000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Seventh Framework Programme","award":["http:\/\/dx.doi.org\/10.13039\/100011102"],"award-info":[{"award-number":["http:\/\/dx.doi.org\/10.13039\/100011102"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,4,9]]},"DOI":"10.1145\/3167132.3167212","type":"proceedings-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T13:54:10Z","timestamp":1530626050000},"page":"720-727","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Source selection of long tail sources for federated search in an uncooperative setting"],"prefix":"10.1145","author":[{"given":"G\u00fcnter","family":"Urak","sequence":"first","affiliation":[{"name":"Know-Center GmbH, Graz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hermann","family":"Ziak","sequence":"additional","affiliation":[{"name":"Know-Center GmbH, Graz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Kern","sequence":"additional","affiliation":[{"name":"Know-Center GmbH, Graz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,4,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.v57:3"},{"volume-title":"Advances in information retrieval","author":"Callan Jamie","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/382979.383040"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071389.2071390"},{"volume-title":"Overview of the TREC 2014 federated Web search track. Technical Report. DTIC Document.","year":"2014","author":"Demeester Thomas","key":"e_1_3_2_1_5_1"},{"volume-title":"Uncovering the big players of the web","author":"Gehlen Vinicius","key":"e_1_3_2_1_6_1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253299"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/379437.379496"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2011.10.001"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287404"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Shan Jin and Man Lan. 2014. Simple May Be Best-A Simple and Effective Method for Federated Web Search via Search Engine Impact Factor Estimation.. In TREC. Shan Jin and Man Lan. 2014. Simple May Be Best-A Simple and Effective Method for Federated Web Search via Search Engine Impact Factor Estimation.. In TREC.","DOI":"10.6028\/NIST.SP.500-308.federated-ECNU"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31865-1_5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568012"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860489"},{"key":"e_1_3_2_1_16_1","unstructured":"Lawrence Page Sergey Brin Rajeev Motwani and Terry Winograd. 1999. The PageRank citation ranking: bringing order to the web. (1999). Lawrence Page Sergey Brin Rajeev Motwani and Terry Winograd. 1999. The PageRank citation ranking: bringing order to the web. (1999)."},{"key":"e_1_3_2_1_17_1","first-page":"109","article-title":"Okapi at TREC-3","volume":"109","author":"Robertson Stephen E","year":"1995","journal-title":"NIST SPECIAL PUBLICATION SP"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11610113_7"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000010"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860490"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031180"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076051"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080343.1080347"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065385.1065407"}],"event":{"name":"SAC 2018: Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Pau France","acronym":"SAC 2018"},"container-title":["Proceedings of the 33rd Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3167132.3167212","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3167132.3167212","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:05Z","timestamp":1750213565000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3167132.3167212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,9]]},"references-count":23,"alternative-id":["10.1145\/3167132.3167212","10.1145\/3167132"],"URL":"https:\/\/doi.org\/10.1145\/3167132.3167212","relation":{},"subject":[],"published":{"date-parts":[[2018,4,9]]},"assertion":[{"value":"2018-04-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}