{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:15:35Z","timestamp":1753600535438,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,5,13]]},"DOI":"10.1145\/3308558.3313708","type":"proceedings-article","created":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:17:59Z","timestamp":1557749879000},"page":"2301-2311","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Pruning based Distance Sketches with Provable Guarantees on Random Graphs"],"prefix":"10.1145","author":[{"given":"Hongyang","family":"Zhang","sequence":"first","affiliation":[{"name":"Stanford University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huacheng","family":"Yu","sequence":"additional","affiliation":[{"name":"Harvard University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Goel","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,5,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873665"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2075029.2075081"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_4_1","volume-title":"Mathias B\u00e6k Tejs Knudsen, and Ely Porat","author":"Alstrup Stephen","year":"2015","unstructured":"Stephen Alstrup , S\u00f8ren Dahlgaard , Mathias B\u00e6k Tejs Knudsen, and Ely Porat . 2015 . Sublinear distance labeling. arXiv preprint arXiv:1507.02618(2015). Stephen Alstrup, S\u00f8ren Dahlgaard, Mathias B\u00e6k Tejs Knudsen, and Ely Porat. 2015. Sublinear distance labeling. arXiv preprint arXiv:1507.02618(2015)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2805875.2805976"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039780"},{"key":"e_1_3_2_1_7_1","volume-title":"International Symposium on Mathematical Foundations of Computer Science. Springer, 62-74","author":"Babenko Maxim","year":"2015","unstructured":"Maxim Babenko , Andrew V Goldberg , Haim Kaplan , Ruslan Savchenko , and Mathias Weller . 2015 . On the complexity of hub labeling . In International Symposium on Mathematical Foundations of Computer Science. Springer, 62-74 . Maxim Babenko, Andrew V Goldberg, Haim Kaplan, Ruslan Savchenko, and Mathias Weller. 2015. On the complexity of hub labeling. In International Symposium on Mathematical Foundations of Computer Science. Springer, 62-74."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187891"},{"volume-title":"Algorithm engineering","author":"Bast Hannah","key":"e_1_3_2_1_9_1","unstructured":"Hannah Bast , Daniel Delling , Andrew Goldberg , Matthias M\u00fcller-Hannemann , Thomas Pajor , Peter Sanders , Dorothea Wagner , and Renato F Werneck . 2016. Route planning in transportation networks . In Algorithm engineering . Springer , 19-80. Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias M\u00fcller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F Werneck. 2016. Route planning in transportation networks. In Algorithm engineering. Springer, 19-80."},{"volume-title":"Modern Graph Theory","author":"Bollob\u00e1s Be\u00b4la","key":"e_1_3_2_1_10_1","unstructured":"Be\u00b4la Bollob\u00e1s . 1998. Random graphs . In Modern Graph Theory . Springer , 215-252. Be\u00b4la Bollob\u00e1s. 1998. Random graphs. In Modern Graph Theory. Springer, 215-252."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039744"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039744"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1813164.1813216"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.252631999"},{"volume-title":"Complex graphs and networks","author":"Chung Fan RK","key":"e_1_3_2_1_15_1","unstructured":"Fan RK Chung and Linyuan Lu. 2006. Complex graphs and networks . Vol. 107 . American mathematical society Providence . Fan RK Chung and Linyuan Lu. 2006. Complex graphs and networks. Vol. 107. American mathematical society Providence."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/070710111"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1534"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718537"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_27"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_22"},{"volume-title":"Random graph dynamics","author":"Durrett Richard","key":"e_1_3_2_1_22_1","unstructured":"Richard Durrett . 2007. Random graph dynamics . Vol. 200 . Citeseer . Richard Durrett. 2007. Random graph dynamics. Vol. 200. Citeseer."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098128"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.76"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767449"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/365411.365447"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 156-165","author":"Goldberg Andrew V","year":"2005","unstructured":"Andrew V Goldberg and Chris Harrelson . 2005 . Computing the shortest path: A search meets graph theory . In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 156-165 . Andrew V Goldberg and Chris Harrelson. 2005. Computing the shortest path: A search meets graph theory. In Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 156-165."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40313-2_42"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247516"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732993"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/130914218"},{"key":"e_1_3_2_1_32_1","first-page":"985","article-title":"Kronecker graphs: An approach to modeling networks","author":"Leskovec Jure","year":"2010","unstructured":"Jure Leskovec , Deepayan Chakrabarti , Jon Kleinberg , Christos Faloutsos , and Zoubin Ghahramani . 2010 . Kronecker graphs: An approach to modeling networks . Journal of Machine Learning Research 11 , Feb (2010), 985 - 1042 . Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, and Zoubin Ghahramani. 2010. Kronecker graphs: An approach to modeling networks. Journal of Machine Learning Research 11, Feb (2010), 985-1042.","journal-title":"Journal of Machine Learning Research 11"},{"key":"e_1_3_2_1_33_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367591"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"e_1_3_2_1_38_1","volume-title":"Random graphs and complex networks. Available on http:\/\/www. win. tue. nl\/rhofstad\/NotesRGCN.pdf","author":"Der Hofstad Remco Van","year":"2009","unstructured":"Remco Van Der Hofstad . 2009. Random graphs and complex networks. Available on http:\/\/www. win. tue. nl\/rhofstad\/NotesRGCN.pdf ( 2009 ), 11. Remco Van Der Hofstad. 2009. Random graphs and complex networks. Available on http:\/\/www. win. tue. nl\/rhofstad\/NotesRGCN.pdf (2009), 11."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321520"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453934"}],"event":{"name":"WWW '19: The Web Conference","sponsor":["IW3C2 International World Wide Web Conference Committee"],"location":"San Francisco CA USA","acronym":"WWW '19"},"container-title":["The World Wide Web Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308558.3313708","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3308558.3313708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:31Z","timestamp":1750204411000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308558.3313708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,13]]},"references-count":40,"alternative-id":["10.1145\/3308558.3313708","10.1145\/3308558"],"URL":"https:\/\/doi.org\/10.1145\/3308558.3313708","relation":{},"subject":[],"published":{"date-parts":[[2019,5,13]]},"assertion":[{"value":"2019-05-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}