{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:41:22Z","timestamp":1782834082444,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T00:00:00Z","timestamp":1575331200000},"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":[[2019,12,3]]},"DOI":"10.1145\/3359989.3365420","type":"proceedings-article","created":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T14:07:37Z","timestamp":1575554857000},"page":"272-284","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["UNARI"],"prefix":"10.1145","author":[{"given":"Guoyao","family":"Feng","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Srinivasan","family":"Seshan","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Steenkiste","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,12,3]]},"reference":[{"key":"e_1_3_2_1_2_1","volume-title":"Handbook of satisfiability","author":"Biere Armin","unstructured":"Armin Biere , Marijn Heule , and Hans van Maaren . 2009. Handbook of satisfiability . Vol. 185 . IOS press . Armin Biere, Marijn Heule, and Hans van Maaren. 2009. Handbook of satisfiability. Vol. 185. IOS press."},{"key":"e_1_3_2_1_3_1","volume-title":"Pattern Recognition and Machine Learning (Information Science and Statistics)","author":"Bishop Christopher M.","unstructured":"Christopher M. Bishop , 2006. Pattern Recognition and Machine Learning (Information Science and Statistics) . Springer-Verlag , Berlin . Heidelberg. Christopher M. Bishop, 2006. Pattern Recognition and Machine Learning (Information Science and Statistics). Springer-Verlag, Berlin. Heidelberg."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2504730.2504754"},{"key":"e_1_3_2_1_5_1","unstructured":"RIPE Network Coordination Center. 2017. Routing Information Service Raw Data. https:\/\/www.ripe.net\/analyse\/interrtet-measurements\/routing-information-service-ris\/ris-raw-data. [Online: accessed 12-October-2017].  RIPE Network Coordination Center. 2017. Routing Information Service Raw Data. https:\/\/www.ripe.net\/analyse\/interrtet-measurements\/routing-information-service-ris\/ris-raw-data. [Online: accessed 12-October-2017]."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208668"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1198255.1198259"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.974527"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2012.6363987"},{"key":"e_1_3_2_1_11_1","volume-title":"Packet Clearing House Daily Routing Snapshots. https:\/\/www.pch.net\/resources\/Routing_Data\/. [Online","author":"House Packet Clearing","year":"2017","unstructured":"Packet Clearing House . 2017. Packet Clearing House Daily Routing Snapshots. https:\/\/www.pch.net\/resources\/Routing_Data\/. [Online ; accessed 12- October - 2017 ]. Packet Clearing House. 2017. Packet Clearing House Daily Routing Snapshots. https:\/\/www.pch.net\/resources\/Routing_Data\/. [Online; accessed 12-October-2017]."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282427.1282396"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/3323234.3323282"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2663716.2663741"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2504730.2504735"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633027"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09284-3_33"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/1978665.1978669"},{"key":"e_1_3_2_1_19_1","unstructured":"University of Oregon. 2017. University of Oregon Route Views Project http:\/\/www.routeviews.org\/. [Online; accessed 12-October-2017].  University of Oregon. 2017. University of Oregon Route Views Project http:\/\/www.routeviews.org\/. [Online; accessed 12-October-2017]."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2020798"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375457.1375482"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_3_2_1_23_1","volume-title":"Markov logic networks. Machine learning 62, 1-2","author":"Richardson Matthew","year":"2006","unstructured":"Matthew Richardson and Pedro Domingos . 2006. Markov logic networks. Machine learning 62, 1-2 ( 2006 ), 107--136. Matthew Richardson and Pedro Domingos. 2006. Markov logic networks. Machine learning 62, 1-2 (2006), 107--136."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158885"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019307"},{"key":"e_1_3_2_1_26_1","volume-title":"sharpSAT: Counting models with advanced component caching and implicit BCP. Lecture notes in computer science","author":"Marc THURLEY.","year":"2006","unstructured":"Marc THURLEY. 2006. sharpSAT: Counting models with advanced component caching and implicit BCP. Lecture notes in computer science ( 2006 ), 424--429. Marc THURLEY. 2006. sharpSAT: Counting models with advanced component caching and implicit BCP. Lecture notes in computer science (2006), 424--429."},{"key":"e_1_3_2_1_27_1","volume-title":"Tier 1 network. https:\/\/en.wikipedia.org\/wiki\/Tier_1_network. [Online","year":"2017","unstructured":"tier-one 2017. Tier 1 network. https:\/\/en.wikipedia.org\/wiki\/Tier_1_network. [Online ; accessed 12- October - 2017 ]. tier-one 2017. Tier 1 network. https:\/\/en.wikipedia.org\/wiki\/Tier_1_network. [Online; accessed 12-October-2017]."},{"key":"e_1_3_2_1_28_1","volume-title":"Global Telecommunications Conference, 2004. GLOEECOM'04. IEEE, VoL 3. IEEE, 1373--1377","author":"Xia Jianhong","year":"2004","unstructured":"Jianhong Xia and Lixin Gao . 2004 . On the evaluation of AS relationship inferences [Internet reachability\/traffic flow applications] . In Global Telecommunications Conference, 2004. GLOEECOM'04. IEEE, VoL 3. IEEE, 1373--1377 . Jianhong Xia and Lixin Gao. 2004. On the evaluation of AS relationship inferences [Internet reachability\/traffic flow applications]. In Global Telecommunications Conference, 2004. GLOEECOM'04. IEEE, VoL 3. IEEE, 1373--1377."}],"event":{"name":"CoNEXT '19: The 15th International Conference on emerging Networking EXperiments and Technologies","location":"Orlando Florida","acronym":"CoNEXT '19","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 15th International Conference on Emerging Networking Experiments And Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3359989.3365420","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3359989.3365420","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:27Z","timestamp":1750202007000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3359989.3365420"}},"subtitle":["an uncertainty-aware approach to AS relationships inference"],"short-title":[],"issued":{"date-parts":[[2019,12,3]]},"references-count":26,"alternative-id":["10.1145\/3359989.3365420","10.1145\/3359989"],"URL":"https:\/\/doi.org\/10.1145\/3359989.3365420","relation":{},"subject":[],"published":{"date-parts":[[2019,12,3]]},"assertion":[{"value":"2019-12-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}