{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:09:00Z","timestamp":1750306140909,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T00:00:00Z","timestamp":1498348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1314603"],"award-info":[{"award-number":["CNS-1314603"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency","doi-asserted-by":"publisher","award":["HDTRA1-10-1-0120"],"award-info":[{"award-number":["HDTRA1-10-1-0120"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,25]]},"DOI":"10.1145\/3091478.3091492","type":"proceedings-article","created":{"date-parts":[[2017,7,10]],"date-time":"2017-07-10T12:17:13Z","timestamp":1499689033000},"page":"161-170","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["\u03b5 - WGX"],"prefix":"10.1145","author":[{"given":"Sucheta","family":"Soundarajan","sequence":"first","affiliation":[{"name":"Syracuse University, Syracuse, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tina","family":"Eliassi-Rad","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"Gallagher","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Pinar","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Livermore, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Nonstochastic Multi-armed bandits with graph structured feedback. CoRR abs\/1409.8428","author":"Alon Noga","year":"2014","unstructured":"Noga Alon , Nicolo Cesa-Bianchi , Claudio Gentile , Shie Mannor , Yishay Mansour , and Ohad Shamir . 2014. Nonstochastic Multi-armed bandits with graph structured feedback. CoRR abs\/1409.8428 ( 2014 ). Noga Alon, Nicolo Cesa-Bianchi, Claudio Gentile, Shie Mannor, Yishay Mansour, and Ohad Shamir. 2014. Nonstochastic Multi-armed bandits with graph structured feedback. CoRR abs\/1409.8428 (2014)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2014.95"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Andrei Broder Ravi Kumar Farzin Maghoul Prabhakar Raghavan Sridhar Rajagopalan Raymie Stata Andrew Tomkins and Janet Wiener. 2000. Graph structure in the web. In WWW. 309--320.   Andrei Broder Ravi Kumar Farzin Maghoul Prabhakar Raghavan Sridhar Rajagopalan Raymie Stata Andrew Tomkins and Janet Wiener. 2000. Graph structure in the web. In WWW. 309--320.","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Junghoo Cho Hector Garcia-Molina and Lawrence Page. 1998. Efficient crawling through URL ordering. In WWW. 161--172.   Junghoo Cho Hector Garcia-Molina and Lawrence Page. 1998. Efficient crawling through URL ordering. In WWW. 161--172.","DOI":"10.1016\/S0169-7552(98)00108-1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.91.247901"},{"key":"e_1_3_2_1_7_1","volume-title":"Xing","author":"Hanneke Steve","year":"2009","unstructured":"Steve Hanneke and Eric P . Xing . 2009 . Network completing and survey sampling. In AISTATS. 209--215. Steve Hanneke and Eric P. Xing. 2009. Network completing and survey sampling. In AISTATS. 209--215."},{"key":"e_1_3_2_1_8_1","unstructured":"Myunghwan Kim and Jure Leskovec. 2011. The network completion problem: Inferring missing nodes and edges in networks. In SDM. 47--58.  Myunghwan Kim and Jure Leskovec. 2011. The network completion problem: Inferring missing nodes and edges in networks. In SDM. 47--58."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"volume-title":"International Conference on Intelligence Analysis. 6.","author":"Sofus","key":"e_1_3_2_1_10_1","unstructured":"Sofus A. Macskassy and Foster Provost. 2005. Suspicion scoring based on guiltby-association, collective inference, and focused data access . In International Conference on Intelligence Analysis. 6. Sofus A. Macskassy and Foster Provost. 2005. Suspicion scoring based on guiltby-association, collective inference, and focused data access. In International Conference on Intelligence Analysis. 6."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13657-3_12"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772762"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718519"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2307024"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177698338"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Sucheta Soundarajan Tina Eliassi-Rad Brian Gallagher and Ali Pinar. 2016. MaxReach: Reducing network incompleteness through node probes. In ASONAM. 152--157.  Sucheta Soundarajan Tina Eliassi-Rad Brian Gallagher and Ali Pinar. 2016. MaxReach: Reducing network incompleteness through node probes. In ASONAM. 152--157.","DOI":"10.1109\/ASONAM.2016.7752227"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993727"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11564096_42"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2013.01.015"}],"event":{"name":"WebSci '17: ACM Web Science Conference","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Troy New York USA","acronym":"WebSci '17"},"container-title":["Proceedings of the 2017 ACM on Web Science Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3091478.3091492","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3091478.3091492","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3091478.3091492","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:37:29Z","timestamp":1750217849000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3091478.3091492"}},"subtitle":["Adaptive Edge Probing for Enhancing Incomplete Networks"],"short-title":[],"issued":{"date-parts":[[2017,6,25]]},"references-count":20,"alternative-id":["10.1145\/3091478.3091492","10.1145\/3091478"],"URL":"https:\/\/doi.org\/10.1145\/3091478.3091492","relation":{},"subject":[],"published":{"date-parts":[[2017,6,25]]},"assertion":[{"value":"2017-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}