{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:31:08Z","timestamp":1772119868372,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:00:00Z","timestamp":1760486400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:00:00Z","timestamp":1760486400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of china","doi-asserted-by":"crossref","award":["2022YFB2901100"],"award-info":[{"award-number":["2022YFB2901100"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["022ZD0115303"],"award-info":[{"award-number":["022ZD0115303"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Major Key Project of Peng ChengLaboratory","award":["PCL2023A06"],"award-info":[{"award-number":["PCL2023A06"]}]},{"name":"Key Project of Natural Science Foundation of Tianjin","award":["24JCZDJC01180"],"award-info":[{"award-number":["24JCZDJC01180"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s11280-025-01378-4","type":"journal-article","created":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T12:37:25Z","timestamp":1760531845000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Toward accurate weight-based measurement and periodic edge measurement in graph stream"],"prefix":"10.1007","volume":"28","author":[{"given":"Zhuo","family":"Li","sequence":"first","affiliation":[]},{"given":"YuXuan","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Jindian","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Kaihua","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,15]]},"reference":[{"key":"1378_CR1","doi-asserted-by":"publisher","unstructured":"He, K., Shi, P., Bindel, D., Hopcroft, J.E.: Krylov subspace approximation for local community detection in large networks. ACM Trans. Knowl. Discov. Data. 13(5) (2019) https:\/\/doi.org\/10.1145\/3340708","DOI":"10.1145\/3340708"},{"key":"1378_CR2","doi-asserted-by":"publisher","unstructured":"Aldhaheri, A., Lee, J., Almgren, K.: An event detection platform to detect gender using deep learning. In: 2020 11th IEEE Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON), pp. 0359\u20130363 (2020). https:\/\/doi.org\/10.1109\/UEMCON51285.2020.9298104","DOI":"10.1109\/UEMCON51285.2020.9298104"},{"key":"1378_CR3","doi-asserted-by":"publisher","unstructured":"Yan, N., Wen, Y., Chen, L., Wu, Y., Zhang, B., Wang, Z., Meng, D.: Deepro: Provenance-based APT campaigns detection via GNN. In: 2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), pp. 747\u2013758 (2022). https:\/\/doi.org\/10.1109\/TrustCom56396.2022.00106","DOI":"10.1109\/TrustCom56396.2022.00106"},{"issue":"12","key":"1378_CR4","doi-asserted-by":"publisher","first-page":"2030","DOI":"10.14778\/2367502.2367570","volume":"5","author":"S Guha","year":"2012","unstructured":"Guha, S., McGregor, A.: Graph synopses, sketches, and streams: A survey. Proc. VLDB Endow. 5(12), 2030\u20132031 (2012). https:\/\/doi.org\/10.14778\/2367502.2367570","journal-title":"Proc. VLDB Endow."},{"key":"1378_CR5","doi-asserted-by":"publisher","unstructured":"Shah, N., Koutra, D., Zou, T., Gallagher, B., Faloutsos, C.: Timecrunch: Interpretable dynamic graph summarization. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201915, pp. 1055\u20131064. Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2783258.2783321","DOI":"10.1145\/2783258.2783321"},{"key":"1378_CR6","doi-asserted-by":"publisher","first-page":"110577","DOI":"10.1016\/j.patcog.2024.110577","volume":"154","author":"H-Y Yao","year":"2024","unstructured":"Yao, H.-Y., Zhang, C.-Y., Yao, Z.-L., Chen, C.L.P., Hu, J.: A recurrent graph neural network for inductive representation learning on dynamic graphs. Pattern Recogn. 154, 110577 (2024). https:\/\/doi.org\/10.1016\/j.patcog.2024.110577","journal-title":"Pattern Recogn."},{"key":"1378_CR7","unstructured":"Defferrard, M., Bresson, X., Vandergheynst, P.: Convolutional neural networks on graphs with fast localized spectral filtering. In: Proceedings of the 30th International Conference on Neural Information Processing Systems. NIPS\u201916, pp. 3844\u20133852. Curran Associates Inc., Red Hook, NY, USA (2016)"},{"issue":"8","key":"1378_CR8","doi-asserted-by":"publisher","first-page":"3780","DOI":"10.1109\/TAI.2024.3350545","volume":"5","author":"N Shabani","year":"2024","unstructured":"Shabani, N., Wu, J., Beheshti, A., Sheng, Q.Z., Foo, J., Haghighi, V., Hanif, A., Shahabikargar, M.: A comprehensive survey on graph summarization with graph neural networks. IEEE Trans. Artif. Intell. 5(8), 3780\u20133800 (2024). https:\/\/doi.org\/10.1109\/TAI.2024.3350545","journal-title":"IEEE Trans. Artif. Intell."},{"key":"1378_CR9","doi-asserted-by":"publisher","unstructured":"Tang, N., Chen, Q., Mitra, P.: Graph stream summarization: From big bang to big crunch. In: Proceedings of the 2016 International Conference on Management of Data. SIGMOD \u201916, pp. 1481\u20131496. Association for Computing Machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2882903.2915223","DOI":"10.1145\/2882903.2915223"},{"issue":"6","key":"1378_CR10","doi-asserted-by":"publisher","first-page":"3831","DOI":"10.1007\/s10618-024-01060-9","volume":"38","author":"M Bansal","year":"2024","unstructured":"Bansal, M., Sharma, D.: Statistical methods utilizing structural properties of time-evolving networks for event detection. Data Min. Knowl. Disc. 38(6), 3831\u20133867 (2024). https:\/\/doi.org\/10.1007\/s10618-024-01060-9","journal-title":"Data Min. Knowl. Disc."},{"key":"1378_CR11","doi-asserted-by":"publisher","unstructured":"Bhatia, S., Wang, Y., Hooi, B., Chakraborty, T.: Graphanogan: Detecting anomalous snapshots from attributed graphs. In: Machine Learning and Knowledge Discovery in Databases. Research Track: European Conference, ECML PKDD 2021, Bilbao, Spain, September 13\u201317, 2021, Proceedings, Part II, pp. 36\u201351. Springer, Berlin, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-86520-7_3","DOI":"10.1007\/978-3-030-86520-7_3"},{"key":"1378_CR12","doi-asserted-by":"publisher","unstructured":"Xuan, W., Liang, Y., Cao, H., Lin, N., Ye, X., Fan, D.: DTC: Real-time and accurate distributed triangle counting in fully dynamic graph streams. In: 2024 43rd International Symposium on Reliable Distributed Systems (SRDS), pp. 198\u2013209 (2024). https:\/\/doi.org\/10.1109\/SRDS64841.2024.00028","DOI":"10.1109\/SRDS64841.2024.00028"},{"key":"1378_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-017-0443-4","volume":"7","author":"A Khan","year":"2017","unstructured":"Khan, A., Aggarwal, C.: Toward query-friendly compression of rapid graph streams. Soc. Netw. Anal. Min. 7, 1\u201319 (2017). https:\/\/doi.org\/10.1007\/s13278-017-0443-4","journal-title":"Soc. Netw. Anal. Min."},{"key":"1378_CR14","doi-asserted-by":"publisher","first-page":"108403","DOI":"10.1016\/j.comnet.2021.108403","volume":"198","author":"C Hou","year":"2021","unstructured":"Hou, C., Hou, B., Zhou, T., Cai, Z.: DMatrix: toward fast and accurate queries in graph stream. Comput. Netw. 198, 108403 (2021). https:\/\/doi.org\/10.1016\/j.comnet.2021.108403","journal-title":"Comput. Netw."},{"key":"1378_CR15","doi-asserted-by":"publisher","first-page":"110502","DOI":"10.1016\/j.comnet.2024.110502","volume":"248","author":"Z Li","year":"2024","unstructured":"Li, Z., Liu, S., Liu, J., Zhang, Y., Liang, T., Liu, K.: SIM: a fast real-time graph stream summarization with improved memory efficiency and accuracy. Comput. Netw. 248, 110502 (2024). https:\/\/doi.org\/10.1016\/j.comnet.2024.110502","journal-title":"Comput. Netw."},{"key":"1378_CR16","doi-asserted-by":"publisher","first-page":"110467","DOI":"10.1016\/j.comnet.2024.110467","volume":"247","author":"J Liu","year":"2024","unstructured":"Liu, J., Li, Z., Du, H., Zhou, H., Li, L., An, Y., Zhang, Y., Liu, K., Li, Q.: An effective and accurate flow size measurement using funnel-shaped sketch. Comput. Netw. 247, 110467 (2024). https:\/\/doi.org\/10.1016\/j.comnet.2024.110467","journal-title":"Comput. Netw."},{"key":"1378_CR17","doi-asserted-by":"publisher","unstructured":"Chen, M., Zhou, R., Chen, H., Jin, H.: Scube: Efficient summarization for skewed graph streams. In: 2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS), pp. 100\u2013110 (2022). https:\/\/doi.org\/10.1109\/ICDCS54860.2022.00019","DOI":"10.1109\/ICDCS54860.2022.00019"},{"issue":"6","key":"1378_CR18","doi-asserted-by":"publisher","first-page":"5901","DOI":"10.1109\/TKDE.2022.3174570","volume":"35","author":"X Gou","year":"2023","unstructured":"Gou, X., Zou, L., Zhao, C., Yang, T.: Graph stream sketch: summarizing graph streams with high speed and accuracy. IEEE Trans. Knowl. Data Eng. 35(6), 5901\u20135914 (2023). https:\/\/doi.org\/10.1109\/TKDE.2022.3174570","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1378_CR19","doi-asserted-by":"publisher","unstructured":"Li, Z., Li, Z., Fan, Z., Zhao, J., Zeng, S., Luo, P., Liu, K.: Cuckoo matrix: A high efficient and accurate graph stream summarization on limited memory. Electronics 12(2) (2023). https:\/\/doi.org\/10.3390\/electronics12020414","DOI":"10.3390\/electronics12020414"},{"key":"1378_CR20","doi-asserted-by":"publisher","unstructured":"Fan, Z., Zhang, Y., Yang, T., Yan, M., Wen, G., Wu, Y., Li, H., Cui, B.: Periodicsketch: Finding periodic items in data streams. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 96\u2013109 (2022). https:\/\/doi.org\/10.1109\/ICDE53745.2022.00012","DOI":"10.1109\/ICDE53745.2022.00012"},{"key":"1378_CR21","doi-asserted-by":"publisher","unstructured":"Chen, M., Zhou, R., Chen, H., Xiao, J., Jin, H., Li, B.: Horae: A graph stream summarization structure for efficient temporal range query. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 2792\u20132804 (2022). https:\/\/doi.org\/10.1109\/ICDE53745.2022.00254","DOI":"10.1109\/ICDE53745.2022.00254"},{"issue":"4","key":"1378_CR22","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1109\/TPDS.2023.3301852","volume":"35","author":"J Lu","year":"2023","unstructured":"Lu, J., Pan, T., He, S., Miao, M., Zhou, G., Qi, Y., Zhang, S., Song, E., Sun, X., Zhao, H., Lyu, B., Zhu, S.: Cloudsentry: two-stage heavy hitter detection for cloud-scale gateway overload protection. IEEE Trans. Parallel Distrib. Syst. 35(4), 616\u2013633 (2023). https:\/\/doi.org\/10.1109\/TPDS.2023.3301852","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1378_CR23","doi-asserted-by":"crossref","unstructured":"Wang, Y., Yang, T., Wang, R., Tai, T.: Dynamic sketch: Efficient and adjustable heavy hitter detection for software packet processing. In: 2019 IEEE 8th International Conference on Cloud Networking (CloudNet), pp. 1\u20137 (2019)","DOI":"10.1109\/CloudNet47604.2019.9064148"},{"issue":"3","key":"1378_CR24","doi-asserted-by":"publisher","first-page":"2038","DOI":"10.1109\/TCC.2020.3012999","volume":"10","author":"X Zuo","year":"2022","unstructured":"Zuo, X., Li, L., Peng, H., Luo, S., Yang, Y.: Privacy-preserving subgraph matching scheme with authentication in social networks. IEEE Trans. Cloud Comput. 10(3), 2038\u20132049 (2022). https:\/\/doi.org\/10.1109\/TCC.2020.3012999","journal-title":"IEEE Trans. Cloud Comput."},{"issue":"1","key":"1378_CR25","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10586-022-03540-3","volume":"26","author":"S Srivastava","year":"2022","unstructured":"Srivastava, S., Singh, A.K.: Fraud detection in the distributed graph database. Clust. Comput. 26(1), 515\u2013537 (2022). https:\/\/doi.org\/10.1007\/s10586-022-03540-3","journal-title":"Clust. Comput."},{"issue":"18","key":"1378_CR26","doi-asserted-by":"publisher","first-page":"3309","DOI":"10.1016\/j.comnet.2010.06.018","volume":"54","author":"T Bu","year":"2010","unstructured":"Bu, T., Cao, J., Chen, A., Lee, P.P.C.: Sequential hashing: a flexible approach for unveiling significant patterns in high speed networks. Comput. Netw. 54(18), 3309\u20133326 (2010). https:\/\/doi.org\/10.1016\/j.comnet.2010.06.018","journal-title":"Comput. Netw."},{"key":"1378_CR27","unstructured":"MAWI Datasets. https:\/\/mawi.wide.ad.jp\/mawi (2020)"},{"key":"1378_CR28","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data (2014)"},{"key":"1378_CR29","unstructured":"Caida: Anonymized Internet Traces 2016. https:\/\/catalog.caida.org\/dataset\/passive_2016_pcap. Dates used: date(s) used. Accessed: date accessed (2016). https:\/\/doi.org\/https:\/\/catalog.caida.org\/dataset\/passive_2016_pcap"},{"key":"1378_CR30","unstructured":"Hash website. https:\/\/github.com\/aappleby\/smhasher\/blob\/master\/src\/MurmurHash3.cpp"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-025-01378-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-025-01378-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-025-01378-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T04:06:28Z","timestamp":1764821188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-025-01378-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,15]]},"references-count":30,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["1378"],"URL":"https:\/\/doi.org\/10.1007\/s11280-025-01378-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-6241870\/v1","asserted-by":"object"}]},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,15]]},"assertion":[{"value":"17 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors have no competing interests as defined by Springer, or other interests that might be perceived to influence the results and discussion reported in this paper.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"63"}}