{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T15:51:42Z","timestamp":1763740302412,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","funder":[{"name":"National Key Research and Development Program of China","award":["2024YFB2906601"],"award-info":[{"award-number":["2024YFB2906601"]}]},{"name":"National Natural Science Foundation of China","award":["624B2005"],"award-info":[{"award-number":["624B2005"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,10,28]]},"DOI":"10.1145\/3730567.3764459","type":"proceedings-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T15:22:38Z","timestamp":1763738558000},"page":"808-825","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Approaching 100% Confidence in Stream Summary through ReliableSketch"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7115-5390","authenticated-orcid":false,"given":"Yuhan","family":"Wu","sequence":"first","affiliation":[{"name":"Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1771-6630","authenticated-orcid":false,"given":"Hanbo","family":"Wu","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1354-7895","authenticated-orcid":false,"given":"Xilai","family":"Liu","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5474-9156","authenticated-orcid":false,"given":"Yuxuan","family":"Tian","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2495-7774","authenticated-orcid":false,"given":"Yikai","family":"Zhao","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2402-5854","authenticated-orcid":false,"given":"Tong","family":"Yang","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2147-5635","authenticated-orcid":false,"given":"Rui","family":"Qiu","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6381-4026","authenticated-orcid":false,"given":"Kaicheng","family":"Yang","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4677-7452","authenticated-orcid":false,"given":"Sha","family":"Wang","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7168-3628","authenticated-orcid":false,"given":"Tao","family":"Li","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-8903-1168","authenticated-orcid":false,"given":"Lihua","family":"Miao","sequence":"additional","affiliation":[{"name":"Huawei Technologies Co., Ltd., Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4964-1135","authenticated-orcid":false,"given":"Gaogang","family":"Xie","sequence":"additional","affiliation":[{"name":"Computer Network Information Center, Chinese Academy of Sciences, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2025,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. Murmur Hashing source codes. https:\/\/github.com\/aappleby\/smhasher\/blob\/master\/src\/MurmurHash3.cpp."},{"key":"e_1_3_2_1_2_1","unstructured":"[n.d.]. Source code related to ReliableSketch. https:\/\/github.com\/ReliableSketch\/ReliableSketch."},{"key":"e_1_3_2_1_3_1","unstructured":"[n.d.]. Frequent itemset mining dataset repository. http:\/\/fimi.ua.ac.be\/data\/."},{"key":"e_1_3_2_1_4_1","unstructured":"[n.d.]. The CAIDA Anonymized Internet Traces. http:\/\/www.caida.org\/data\/overview\/."},{"key":"e_1_3_2_1_5_1","first-page":"719","volume-title":"19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22)","author":"Agarwal Anup","year":"2022","unstructured":"Anup Agarwal, Zaoxing Liu, and Srinivasan Seshan. 2022. {HeteroSketch}: Coordinating network-wide monitoring in heterogeneous and dynamic networks. In 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22). 719-741."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303978"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2982739"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00080"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2018.00047"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"e_1_3_2_1_12_1","volume-title":"Automated Reasoning","author":"Boyer Robert S","unstructured":"Robert S Boyer and J Strother Moore. 1991. MJRTY\u2014a fast majority vote algorithm. In Automated Reasoning. Springer, 105-117."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.12142\/ZTECOM.202301009"},{"key":"e_1_3_2_1_14_1","volume-title":"Automata, Languages and Programming","author":"Charikar Moses","unstructured":"Moses Charikar, Kevin Chen, and Martin Farach-Colton. 2002. Finding frequent items in data streams. In Automata, Languages and Programming. Springer."},{"key":"e_1_3_2_1_15_1","volume-title":"Sketch techniques for approximate query processing. Foundations and Trends in Databases","author":"Cormode Graham","year":"2011","unstructured":"Graham Cormode. 2011. Sketch techniques for approximate query processing. Foundations and Trends in Databases. NOW publishers (2011)."},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 31st international conference on Very large data bases. 13-24","author":"Cormode Graham","year":"2005","unstructured":"Graham Cormode and Minos Garofalakis. 2005. Sketching streams through the net: Distributed approximate query tracking. In Proceedings of the 31st international conference on Very large data bases. 13-24."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45749-6_33"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Philippe Flajolet \u00c9ric Fusy Olivier Gandouet and Fr\u00e9d\u00e9ric Meunier. 2007. Hyperlog log: the analysis of a near-optimal cardinality estimation algorithm.","DOI":"10.46298\/dmtcs.3545"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098831"},{"key":"e_1_3_2_1_22_1","unstructured":"Qun Huang Siyuan Sheng Po-HanWang Xiang Chen Chi Zhang Isaac Pedisich Yungang Bao Zhaoyang Han Dinesh Bharadia Rui Zhang et al. 2021. Toward nearly-zero-error sketching via compressive sensing. In 18th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 21). 1027-1044."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.12142\/ZTECOM.202303010"},{"key":"e_1_3_2_1_24_1","first-page":"71","article-title":"Optimal quantile approximation in streams. In 2016 ieee 57th annual symposium on foundations of computer science (focs)","author":"Karnin Zohar","year":"2016","unstructured":"Zohar Karnin, Kevin Lang, and Edo Liberty. 2016. Optimal quantile approximation in streams. In 2016 ieee 57th annual symposium on foundations of computer science (focs). IEEE, 71-78.","journal-title":"IEEE"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3523210.3523220"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342076"},{"key":"e_1_3_2_1_27_1","unstructured":"Zaoxing Liu Antonis Manousis Gregory Vorsanger Vyas Sekar and Vladimir Braverman. 2016. One sketch to rule them all: Rethinking network flow monitoring with univmon. In SIGCOMM."},{"key":"e_1_3_2_1_28_1","volume-title":"DDSketch: A Fast and Fully-Mergeable Quantile Sketch with Relative-Error Guarantees. Proceedings of the VLDB Endowment 12","author":"Masson Charles","unstructured":"Charles Masson, Jee E Rim, and Homin K Lee. [n.d.]. DDSketch: A Fast and Fully-Mergeable Quantile Sketch with Relative-Error Guarantees. Proceedings of the VLDB Endowment 12, 12 ([n.d.])."},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of the VLDB Endowment 16","author":"Melissourgos Dimitrios","year":"2024","unstructured":"Dimitrios Melissourgos, Haibo Wang, Shigang Chen, Chaoyi Ma, and Shiping Chen. 2024. Single Update Sketch with Variable Counter Structure. Proceedings of the VLDB Endowment 16, 13 (2024)."},{"key":"e_1_3_2_1_30_1","volume-title":"International Conference on Database Theory. Springer.","author":"Metwally Ahmed","year":"2005","unstructured":"Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. 2005. Efficient computation of frequent and top-k elements in data streams. In International Conference on Database Theory. Springer."},{"key":"e_1_3_2_1_31_1","volume-title":"A fast majority vote algorithm. Automated Reasoning: Essays in Honor of Woody Bledsoe","author":"Moore J Strother","year":"1981","unstructured":"J Strother Moore. 1981. A fast majority vote algorithm. Automated Reasoning: Essays in Honor of Woody Bledsoe (1981)."},{"key":"e_1_3_2_1_32_1","volume-title":"Ranysha Ware, et al.","author":"Namkung Hun","year":"2022","unstructured":"Hun Namkung, Zaoxing Liu, Daehyeok Kim, Vyas Sekar, Peter Steenkiste, Guyue Liu, Ao Li, Christopher Canel, Adithya Abraham Philip, Ranysha Ware, et al. 2022. Sketchlib: Enabling efficient sketch-based monitoring on programmable switches. NSDI."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.576"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588937"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Vibhaalakshmi Sivaraman Srinivas Narayana Ori Rottenstreich S Muthukrishnan and Jennifer Rexford. 2017. Heavy-hitter detection entirely in the data plane. In SOSR. ACM.","DOI":"10.1145\/3050220.3063772"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737499"},{"key":"e_1_3_2_1_37_1","volume-title":"Data Sketches for Disaggregated Subset Sum and Frequent Item Estimation. In SIGMOD Conference.","author":"Ting Daniel","year":"2018","unstructured":"Daniel Ting. 2018. Data Sketches for Disaggregated Subset Sum and Frequent Item Estimation. In SIGMOD Conference."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588935"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/78922.78925"},{"key":"e_1_3_2_1_40_1","first-page":"561","article-title":"Elastic sketch: Adaptive and fast networkwide measurements","author":"Yang Tong","year":"2018","unstructured":"Tong Yang, Jie Jiang, Peng Liu, Qun Huang, Junzhi Gong, Yang Zhou, Rui Miao, Xiaoming Li, and Steve Uhlig. 2018. Elastic sketch: Adaptive and fast networkwide measurements. In SIGCOMM. 561-575.","journal-title":"SIGCOMM."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452296.3472892"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467353"},{"key":"e_1_3_2_1_43_1","volume-title":"Amr El Abbadi, and Ahmed Metwally","author":"Zhao Fuheng","year":"2021","unstructured":"Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi, and Ahmed Metwally. 2021. SpaceSaving \u00b1: An Optimal Algorithm for Frequency Estimation and Frequent items in the Bounded Deletion Model. arXiv preprint arXiv:2112.03462 (2021)."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/3583140.3583147"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/3450980.3450990"}],"event":{"name":"IMC '25:ACM Internet Measurement Conference","location":"Madison WI USA","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 2025 ACM Internet Measurement Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3730567.3764459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T15:23:15Z","timestamp":1763738595000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3730567.3764459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,28]]},"references-count":45,"alternative-id":["10.1145\/3730567.3764459","10.1145\/3730567"],"URL":"https:\/\/doi.org\/10.1145\/3730567.3764459","relation":{},"subject":[],"published":{"date-parts":[[2025,10,28]]},"assertion":[{"value":"2025-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}