{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T03:52:26Z","timestamp":1768535546108,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972089"],"award-info":[{"award-number":["61972089"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3485447.3512019","type":"proceedings-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T05:13:07Z","timestamp":1650863587000},"page":"2989-2997","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["DUET: A Generic Framework for Finding Special Quadratic Elements in Data Streams"],"prefix":"10.1145","author":[{"given":"Jiaqian","family":"Liu","sequence":"first","affiliation":[{"name":"Nanjing University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haipeng","family":"Dai","sequence":"additional","affiliation":[{"name":"Nanjing University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Xia","sequence":"additional","affiliation":[{"name":"Nanjing University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Li","sequence":"additional","affiliation":[{"name":"Nanjing University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran Ben","family":"Basat","sequence":"additional","affiliation":[{"name":"University College London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Li","sequence":"additional","affiliation":[{"name":"Dongguan University of Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[{"name":"Nanjing University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n. d.]. Advanced Persistent Threat. http:\/\/www.usenix.org\/event\/lisa09\/tech\/slides\/daly. pdf."},{"key":"e_1_3_2_1_2_1","unstructured":"[n. d.]. BobHash. http:\/\/burtleburtle.net\/bob\/hash\/evahash.html."},{"key":"e_1_3_2_1_3_1","unstructured":"[n. d.]. The CAIDA Anonymized Internet Traces. https:\/\/www.caida.org\/data\/passive\/passive_2016_dataset.xml."},{"key":"e_1_3_2_1_4_1","unstructured":"[n. d.]. Social Network: Reddit Hyperlink Network. http:\/\/snap.stanford.edu\/data\/soc-RedditHyperlinks.html."},{"key":"e_1_3_2_1_5_1","unstructured":"[n. d.]. Source Codes of DUET. https:\/\/github.com\/callitwhatyouwannt13\/WWW_DUET."},{"key":"e_1_3_2_1_6_1","unstructured":"[n. d.]. The Source Codes of HeavyKeeper. https:\/\/github.com\/papergitkeeper\/heavy-keeper-project."},{"key":"e_1_3_2_1_7_1","unstructured":"[n. d.]. Stack Overflow Temporal Network. http:\/\/snap.stanford.edu\/data\/sx-stackoverflow.html."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2006.09.001"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626316"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057216"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155340"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_59"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3025111.3025112"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-017-0526-x"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230559"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems. 910\u2013918","author":"Irfan T","year":"2018","unstructured":"Mohammad\u00a0T Irfan and Tucker Gordon. 2018. The power of context in networks: Ideal point models with social interactions. In Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems. 910\u2013918."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/PCCC.2009.5403820"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11214"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403208"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342076"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934906"},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of International Conference on Database Theory. Springer, 398\u2013412","author":"Metwally Ahmed","year":"2005","unstructured":"Ahmed Metwally, Divyakant Agrawal, and Amr El\u00a0Abbadi. 2005. Efficient computation of frequent and top-k elements in data streams. In Proceedings of International Conference on Database Theory. Springer, 398\u2013412."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544898"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(82)90012-0"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622201"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/597917.597922"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983663"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737499"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3186569"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219978"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3425879.3425884"}],"event":{"name":"WWW '22: The ACM Web Conference 2022","location":"Virtual Event, Lyon France","acronym":"WWW '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512019","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:06Z","timestamp":1750188606000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":36,"alternative-id":["10.1145\/3485447.3512019","10.1145\/3485447"],"URL":"https:\/\/doi.org\/10.1145\/3485447.3512019","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-04-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}