{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T11:01:58Z","timestamp":1783422118607,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,18]],"date-time":"2014-06-18T00:00:00Z","timestamp":1403049600000},"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":[[2014,6,18]]},"DOI":"10.1145\/2594538.2594546","type":"proceedings-article","created":{"date-parts":[[2014,6,20]],"date-time":"2014-06-20T13:06:05Z","timestamp":1403269565000},"page":"88-99","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["All-distances sketches, revisited"],"prefix":"10.1145","author":[{"given":"Edith","family":"Cohen","sequence":"first","affiliation":[{"name":"Microsoft Research, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796303421"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2380718.2380723"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646978.711822"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.17730\/humo.7.3.f4033344851gl053"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177730497"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963493"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2050728.2050738"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2013.865686"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-842X.1972.tb00899.x"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/829502.830043"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/647819.736184"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1534"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512944"},{"key":"e_1_3_2_1_16_1","volume-title":"Influence computation scaled-up in sketch space","author":"Cohen E.","year":"2014","unstructured":"E. Cohen , D. Delling , T. Pajor , and R. Werneck . Influence computation scaled-up in sketch space , 2014 . Manuscript . E. Cohen, D. Delling, T. Pajor, and R. Werneck. Influence computation scaled-up in sketch space, 2014. Manuscript."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.016"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281133"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453884"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2005.01.006"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987334.1987345"},{"key":"e_1_3_2_1_22_1","first-page":"365","article-title":"Residual closeness in networks","author":"Dangalchev Ch.","year":"2006","unstructured":"Ch. Dangalchev . Residual closeness in networks . Phisica A , 365 , 2006 . Ch. Dangalchev. Residual closeness in networks. Phisica A, 365, 2006.","journal-title":"Phisica A"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1314690.1314696"},{"key":"e_1_3_2_1_24_1","volume-title":"ESA","author":"Durand M.","year":"2003","unstructured":"M. Durand and P. Flajolet . Loglog counting of large cardinalities (extended abstract) . In ESA , 2003 . M. Durand and P. Flajolet. Loglog counting of large cardinalities (extended abstract). In ESA, 2003."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/365411.365449"},{"key":"e_1_3_2_1_26_1","volume-title":"An introduction to probability theory and its applications","author":"Feller W.","year":"1971","unstructured":"W. Feller . An introduction to probability theory and its applications , volume 2 . John Wiley & Sons , New York , 1971 . W. Feller. An introduction to probability theory and its applications, volume 2. John Wiley & Sons, New York, 1971."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934993"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.46298\/dmtcs.3545"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452456"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1952.10483446"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807094"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/20415"},{"key":"e_1_3_2_1_34_1","volume-title":"Completeness, similar regions, and unbiased estimation. Sankhya, 10(4)","author":"Lehmann E. L.","year":"1950","unstructured":"E. L. Lehmann and H. Scheff\u00e9 . Completeness, similar regions, and unbiased estimation. Sankhya, 10(4) , 1950 . E. L. Lehmann and H. Scheff\u00e9. Completeness, similar regions, and unbiased estimation. Sankhya, 10(4), 1950."},{"key":"e_1_3_2_1_35_1","volume-title":"NIPS","author":"Li P.","year":"2008","unstructured":"P. Li , , K. W. Church , and T. Hastie . One sketch for all: Theory and application of conditional random sampling . In NIPS , 2008 . P. Li, , K. W. Church, and T. Hastie. One sketch for all: Theory and application of conditional random sampling. In NIPS, 2008."},{"key":"e_1_3_2_1_36_1","volume-title":"NIPS","author":"Li P.","year":"2012","unstructured":"P. Li , A. B. Owen , and C-H Zhang . One permutation hashing . In NIPS , 2012 . P. Li, A. B. Owen, and C-H Zhang. One permutation hashing. In NIPS, 2012."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/359619.359627"},{"issue":"2","key":"e_1_3_2_1_39_1","first-page":"149","article-title":"Sequential poisson sampling","volume":"14","author":"Ohlsson E.","year":"1998","unstructured":"E. Ohlsson . Sequential poisson sampling . J. Official Statistics , 14 ( 2 ): 149 -- 162 , 1998 . E. Ohlsson. Sequential poisson sampling. J. Official Statistics, 14(2):149--162, 1998.","journal-title":"J. Official Statistics"},{"key":"e_1_3_2_1_40_1","first-page":"32","article-title":"Node centrality in weighted networks: Generalizing degreeand shortest paths","author":"Opsahl T.","year":"2010","unstructured":"T. Opsahl , F. Agneessens , and J. Skvoretz . Node centrality in weighted networks: Generalizing degreeand shortest paths . Social Networks , 32 , 2010 . T. Opsahl, F. Agneessens, and J. Skvoretz. Node centrality in weighted networks: Generalizing degreeand shortest paths. Social Networks, 32, 2010.","journal-title":"Social Networks"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775059"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488673"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-3758(96)00185-1"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728190"}],"event":{"name":"SIGMOD\/PODS'14: International Conference on Management of Data","location":"Snowbird Utah USA","acronym":"SIGMOD\/PODS'14","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2594538.2594546","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2594538.2594546","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:52Z","timestamp":1750230052000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2594538.2594546"}},"subtitle":["HIP estimators for massive graphs analysis"],"short-title":[],"issued":{"date-parts":[[2014,6,18]]},"references-count":44,"alternative-id":["10.1145\/2594538.2594546","10.1145\/2594538"],"URL":"https:\/\/doi.org\/10.1145\/2594538.2594546","relation":{},"subject":[],"published":{"date-parts":[[2014,6,18]]},"assertion":[{"value":"2014-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}