{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:59Z","timestamp":1750306079110,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T00:00:00Z","timestamp":1500940800000},"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":[[2017,7,25]]},"DOI":"10.1145\/3087801.3087855","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"195-197","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Varun","family":"Kanade","sequence":"first","affiliation":[{"name":"University of Oxford & Alan Turing Institute, Oxford, England UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederik","family":"Mallmann-Trenn","sequence":"additional","affiliation":[{"name":"\u00c9cole Normale Sup\u00e9rieure & Simon Fraser University, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Verdugo","sequence":"additional","affiliation":[{"name":"\u00c9cole Normale Sup\u00e9rieure & Universidad de Chile, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10023.abs"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(80)80030-8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509970"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CASoN.2012.6412374"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897575"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568019"},{"key":"e_1_3_2_1_7_1","unstructured":"Oded Goldreich. 2010. Introduction to Testing Graph Properties. Survey article available at http:\/\/www.wisdom.weizmann.ac.il\/ oded\/COL\/tgp-intro.pdf. (2010).  Oded Goldreich. 2010. Introduction to Testing Graph Properties. Survey article available at http:\/\/www.wisdom.weizmann.ac.il\/ oded\/COL\/tgp-intro.pdf. (2010)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2790304"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2013.862883"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1975-0373371-6"},{"key":"e_1_3_2_1_11_1","volume-title":"International Workshop on Graph-Theoretic Concepts in Computer Science. Springer, 317--326","author":"Marchetti-Spaccamela Alberto","year":"1988","unstructured":"Alberto Marchetti-Spaccamela . 1988 . On the estimate of the size of a directed graph . In International Workshop on Graph-Theoretic Concepts in Computer Science. Springer, 317--326 . Alberto Marchetti-Spaccamela. 1988. On the estimate of the size of a directed graph. In International Workshop on Graph-Theoretic Concepts in Computer Science. Springer, 317--326."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933106"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90187-6"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993727"},{"key":"e_1_3_2_1_15_1","unstructured":"Gregory Valiant and Paul Valiant. 2013. Estimating the unseen: improved estimators for entropy and other properties. In Advances in Neural Information Processing Systems. 2157--2165.  Gregory Valiant and Paul Valiant. 2013. Estimating the unseen: improved estimators for entropy and other properties. In Advances in Neural Information Processing Systems. 2157--2165."}],"event":{"name":"PODC '17: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Washington DC USA","acronym":"PODC '17"},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087855","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087801.3087855","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:07Z","timestamp":1750217407000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087855"}},"subtitle":["How Large is your Graph?"],"short-title":[],"issued":{"date-parts":[[2017,7,25]]},"references-count":15,"alternative-id":["10.1145\/3087801.3087855","10.1145\/3087801"],"URL":"https:\/\/doi.org\/10.1145\/3087801.3087855","relation":{},"subject":[],"published":{"date-parts":[[2017,7,25]]},"assertion":[{"value":"2017-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}