{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:38Z","timestamp":1750306598596,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":2,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,5,20]],"date-time":"2015-05-20T00:00:00Z","timestamp":1432080000000},"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":[[2015,5,20]]},"DOI":"10.1145\/2745754.2745784","type":"proceedings-article","created":{"date-parts":[[2015,5,26]],"date-time":"2015-05-26T14:36:25Z","timestamp":1432650985000},"page":"343-343","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Erratum for"],"prefix":"10.1145","author":[{"given":"Piotr","family":"Indyk","sequence":"first","affiliation":[{"name":"MIT, Cambridge MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reut","family":"Levi","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Diderot - Paris 7 and Ecole Normale Sup\u00e9rieure Paris, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronitt","family":"Rubinfeld","sequence":"additional","affiliation":[{"name":"MIT and Tel-Aviv University, Cambridge MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,5,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Approximating and testing k-histogram distributions in sub-linear time. Electronic Colloquium on Computational Complexity (ECCC), 18:171","author":"Indyk Piotr","year":"2011","unstructured":"Piotr Indyk , Reut Levi , and Ronitt Rubinfeld . Approximating and testing k-histogram distributions in sub-linear time. Electronic Colloquium on Computational Complexity (ECCC), 18:171 , 2011 . Piotr Indyk, Reut Levi, and Ronitt Rubinfeld. Approximating and testing k-histogram distributions in sub-linear time. Electronic Colloquium on Computational Complexity (ECCC), 18:171, 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213561"}],"event":{"name":"SIGMOD\/PODS'15: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Melbourne Victoria Australia","acronym":"SIGMOD\/PODS'15"},"container-title":["Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI  Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2745754.2745784","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2745754.2745784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:45Z","timestamp":1750227405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2745754.2745784"}},"subtitle":["Approximating and Testing\n            <i>k<\/i>\n            -Histogram Distributions in Sub-linear Time"],"short-title":[],"issued":{"date-parts":[[2015,5,20]]},"references-count":2,"alternative-id":["10.1145\/2745754.2745784","10.1145\/2745754"],"URL":"https:\/\/doi.org\/10.1145\/2745754.2745784","relation":{},"subject":[],"published":{"date-parts":[[2015,5,20]]},"assertion":[{"value":"2015-05-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}