{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T16:45:46Z","timestamp":1773938746138,"version":"3.50.1"},"reference-count":59,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100018537","name":"National Science and Technology Major Project","doi-asserted-by":"publisher","award":["2025ZD1208203"],"award-info":[{"award-number":["2025ZD1208203"]}],"id":[{"id":"10.13039\/501100018537","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62332013"],"award-info":[{"award-number":["62332013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202322"],"award-info":[{"award-number":["62202322"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62572337"],"award-info":[{"award-number":["62572337"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Fusion"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.inffus.2025.104065","type":"journal-article","created":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T16:55:40Z","timestamp":1765904140000},"page":"104065","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["FuseMeter: An efficient framework for generic per-flow traffic measurement"],"prefix":"10.1016","volume":"130","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5415-3676","authenticated-orcid":false,"given":"Yifan","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2768-6607","authenticated-orcid":false,"given":"He","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0018-4810","authenticated-orcid":false,"given":"Yu-E","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7559-2280","authenticated-orcid":false,"given":"Jia","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3012-0778","authenticated-orcid":false,"given":"Yang","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7867-7765","authenticated-orcid":false,"given":"Shigang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.inffus.2025.104065_bib0001","doi-asserted-by":"crossref","first-page":"1463","DOI":"10.1109\/TNET.2020.2982003","article-title":"An efficient k-persistent spread estimator for traffic measurement in high-speed networks","volume":"28","author":"Huang","year":"2020","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.inffus.2025.104065_bib0002","series-title":"Proc. of the IEEE Conference on Computer Communications (INFOCOM)","first-page":"974","article-title":"Universal online sketch for tracking heavy hitters and estimating moments of data streams","author":"Xiao","year":"2020"},{"key":"10.1016\/j.inffus.2025.104065_bib0003","series-title":"Proc. of the ACM Web Conference (WWW)","first-page":"1752","article-title":"QCluster: clustering packets for flow scheduling","author":"Yang","year":"2022"},{"issue":"6","key":"10.1016\/j.inffus.2025.104065_bib0004","doi-asserted-by":"crossref","first-page":"1040","DOI":"10.14778\/3447689.3447707","article-title":"Randomized error removal for online spread estimation in data streaming","volume":"14","author":"Wang","year":"2021","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.inffus.2025.104065_bib0005","series-title":"Traffic Measurement for Big Network Data","author":"Chen","year":"2017"},{"issue":"1","key":"10.1016\/j.inffus.2025.104065_bib0006","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/1384529.1375472","article-title":"Counter braids: a novel counter architecture for per-flow measurement","volume":"36","author":"Lu","year":"2008","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"10.1016\/j.inffus.2025.104065_bib0007","series-title":"Proc. of the International Conference on Extending Database Technology (EDBT)","first-page":"683","article-title":"Hyperloglog in practice: algorithmic engineering of a state of the art cardinality estimation algorithm","author":"Heule","year":"2013"},{"issue":"6","key":"10.1016\/j.inffus.2025.104065_bib0008","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/MNET.2003.1248656","article-title":"Packet-level traffic measurements from the sprint IP backbone","volume":"17","author":"Fraleigh","year":"2003","journal-title":"IEEE Netw."},{"issue":"8","key":"10.1016\/j.inffus.2025.104065_bib0009","doi-asserted-by":"crossref","first-page":"2111","DOI":"10.1109\/TSP.2003.814521","article-title":"Modeling internet backbone traffic at the flow level","volume":"51","author":"Barakat","year":"2003","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.inffus.2025.104065_bib0010","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.inffus.2021.12.007","article-title":"Applications of sketches in network traffic measurement: a survey","volume":"82","author":"Han","year":"2022","journal-title":"Inf. Fusion"},{"issue":"5","key":"10.1016\/j.inffus.2025.104065_bib0011","doi-asserted-by":"crossref","first-page":"1697","DOI":"10.1007\/s00778-024-00869-6","article-title":"WavingSketch: an unbiased and generic sketch for finding top-k items in data streams","volume":"33","author":"Liu","year":"2024","journal-title":"VLDB J."},{"key":"10.1016\/j.inffus.2025.104065_bib0012","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.inffus.2022.12.009","article-title":"ExtendedSketch+: super host identification and network host trust evaluation with memory efficiency and high accuracy","volume":"92","author":"Han","year":"2023","journal-title":"Inf. Fusion"},{"issue":"4","key":"10.1016\/j.inffus.2025.104065_bib0013","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.14778\/3717755.3717779","article-title":"RGS-Sketch: an accurate, invertible, and mergeable sketch for online super spreader detection in high-speed data streams","volume":"18","author":"Zhang","year":"2024","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.inffus.2025.104065_bib0014","series-title":"Proc. of the ACM SIGMOD International Conference on Management of Data (SIGMOD)","first-page":"1","article-title":"Memory-efficient and flexible detection of heavy hitters in high-speed networks","author":"Huang","year":"2023"},{"issue":"3","key":"10.1016\/j.inffus.2025.104065_bib0015","doi-asserted-by":"crossref","DOI":"10.1007\/s11432-024-4244-3","article-title":"FEA-Sketch: flow entries assisted sketch for heavy flow detection in software-defined networking","volume":"68","author":"Wu","year":"2025","journal-title":"Science China Information Sciences."},{"issue":"4","key":"10.1016\/j.inffus.2025.104065_bib0016","doi-asserted-by":"crossref","DOI":"10.1007\/s11432-022-3794-1","article-title":"Jigsaw-Sketch: a fast and accurate algorithm for finding top-k elephant flows in high-speed networks","volume":"67","author":"Zhang","year":"2024","journal-title":"Science China Information Sciences."},{"key":"10.1016\/j.inffus.2025.104065_bib0017","series-title":"Proc. of the ACM SIGCOMM Conference on Internet Measurement (IMC)","first-page":"328","article-title":"Revisiting the case for a minimalist approach for network flow monitoring","author":"Sekar","year":"2010"},{"key":"10.1016\/j.inffus.2025.104065_bib0018","series-title":"Proc. of the IEEE Conference on Computer Communications (INFOCOM)","first-page":"2017","article-title":"A generic technique for sketches to adapt to different counting ranges","author":"Yang","year":"2019"},{"key":"10.1016\/j.inffus.2025.104065_bib0019","series-title":"Proc. of the USENIX Symposium on Networked Systems Design and Implementation (NSDI)","first-page":"29","article-title":"Software {Defined}{Traffic} measurement with {OpenSketch}","author":"Yu","year":"2013"},{"key":"10.1016\/j.inffus.2025.104065_bib0020","series-title":"Proc. of the International Conference on Emerging Networking EXperiments and Technologies (CoNEXT)","first-page":"78","article-title":"Fcm-sketch: generic network measurements with data plane support","author":"Song","year":"2020"},{"key":"10.1016\/j.inffus.2025.104065_bib0021","series-title":"Proc. of the ACM SIGCOMM Conference (SIGCOMM)","first-page":"101","article-title":"One sketch to rule them all: rethinking network flow monitoring with univmon","author":"Liu","year":"2016"},{"key":"10.1016\/j.inffus.2025.104065_bib0022","series-title":"Proc. of the IEEE International Conference on Network Protocols (ICNP)","first-page":"1","article-title":"MIME: Fast and accurate flow information compression for multi-spread estimation","author":"Zhang","year":"2023"},{"key":"10.1016\/j.inffus.2025.104065_bib0023","series-title":"Proc. of the IEEE Conference on Computer Communications (INFOCOM)","first-page":"1","article-title":"Self-adaptive sampling for network traffic measurement","author":"Du","year":"2021"},{"issue":"3","key":"10.1016\/j.inffus.2025.104065_bib0024","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/TNET.2022.3212066","article-title":"Self-adaptive sampling based per-flow traffic measurement","volume":"31","author":"Du","year":"2022","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.inffus.2025.104065_bib0025","series-title":"Proc. of the IFIP Networking Conference (Networking)","first-page":"449","article-title":"Routing oblivious measurement analytics","author":"Basat","year":"2020"},{"issue":"6","key":"10.1016\/j.inffus.2025.104065_bib0026","doi-asserted-by":"crossref","first-page":"2994","DOI":"10.1109\/TNET.2023.3268980","article-title":"Accurate and O (1)-time query of per-flow cardinality in high-speed networks","volume":"31","author":"Xiao","year":"2023","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.inffus.2025.104065_bib0027","unstructured":"The source codes of FuseMeter and other related algorithms, 2025, (https:\/\/github.com\/hanyifansuda\/FuseMeter_Paper)."},{"issue":"1","key":"10.1016\/j.inffus.2025.104065_bib0028","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","article-title":"An improved data stream summary: the count-min sketch and its applications","volume":"55","author":"Cormode","year":"2005","journal-title":"J. Algorithms"},{"key":"10.1016\/j.inffus.2025.104065_bib0029","series-title":"Proc. of the International Colloquium on Automata, Languages, and Programming (ICALP)","first-page":"693","article-title":"Finding frequent items in data streams","author":"Charikar","year":"2002"},{"key":"10.1016\/j.inffus.2025.104065_bib0030","series-title":"Proc. of the ACM SIGCOMM","first-page":"323","article-title":"New directions in traffic measurement and accounting","author":"Estan","year":"2002"},{"key":"10.1016\/j.inffus.2025.104065_bib0031","series-title":"Proc. of the ACM SIGCOMM Conference (SIGCOMM)","first-page":"561","article-title":"Elastic sketch: adaptive and fast network-wide measurements","author":"Yang","year":"2018"},{"key":"10.1016\/j.inffus.2025.104065_bib0032","series-title":"Proc. of the IEEE International Conference on Data Engineering (ICDE)","first-page":"864","article-title":"SALSA: self-adjusting lean streaming analytics","author":"Basat","year":"2021"},{"issue":"11","key":"10.1016\/j.inffus.2025.104065_bib0033","doi-asserted-by":"crossref","first-page":"1442","DOI":"10.14778\/3137628.3137652","article-title":"Pyramid sketch: a sketch framework for frequency estimation of data streams","volume":"10","author":"Yang","year":"2017","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"10.1016\/j.inffus.2025.104065_bib0034","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1145\/78922.78925","article-title":"A linear-time probabilistic counting algorithm for database applications","volume":"15","author":"Whang","year":"1990","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.inffus.2025.104065_bib0035","first-page":"137","article-title":"Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm","author":"Flajolet","year":"2007","journal-title":"Discrete Math. Theor. Comput. Sci. (Proceedings)"},{"key":"10.1016\/j.inffus.2025.104065_bib0036","series-title":"Proc. of the IEEE Conference on Computer Communications (INFOCOM)","first-page":"504","article-title":"Fit a spread estimator in small memory","author":"Yoon","year":"2009"},{"key":"10.1016\/j.inffus.2025.104065_bib0037","series-title":"Proc. of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)","first-page":"417","article-title":"Hyper-compact virtual estimators for big network data based on register sharing","author":"Xiao","year":"2015"},{"issue":"5","key":"10.1016\/j.inffus.2025.104065_bib0038","doi-asserted-by":"crossref","first-page":"2073","DOI":"10.1109\/TNET.2021.3078725","article-title":"Spread estimation with non-duplicate sampling in high-speed networks","volume":"29","author":"Huang","year":"2021","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.inffus.2025.104065_bib0039","series-title":"Proc. of the ACM SIGMOD International Conference on Management of Data (SIGMOD)","first-page":"1431","article-title":"Timely reporting of heavy hitters using external memory","author":"Pandey","year":"2020"},{"key":"10.1016\/j.inffus.2025.104065_bib0040","series-title":"Proc. of the IEEE Conference on Computer Communications (INFOCOM)","first-page":"3200","article-title":"Scan detection in high-speed networks based on optimal dynamic bit sharing","author":"Li","year":"2011"},{"issue":"6","key":"10.1016\/j.inffus.2025.104065_bib0041","doi-asserted-by":"crossref","first-page":"2429","DOI":"10.1109\/TNET.2018.2865125","article-title":"Identifying and estimating persistent items in data streams","volume":"26","author":"Dai","year":"2018","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.inffus.2025.104065_bib0042","series-title":"Proc. of the ACM International Conference on Management of Data (SIGMOD)","first-page":"853","article-title":"Graph cube: on warehousing and OLAP multidimensional networks","author":"Zhao","year":"2011"},{"key":"10.1016\/j.inffus.2025.104065_bib0043","series-title":"Proc. of the ACM International Conference on Management of Data (SIGMOD)","first-page":"651","article-title":"Continuous sampling for online aggregation over multiple queries","author":"Wu","year":"2010"},{"issue":"1","key":"10.1016\/j.inffus.2025.104065_bib0044","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/1012888.1005699","article-title":"Flow sampling under hard resource constraints","volume":"32","author":"Duffield","year":"2004","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"issue":"5","key":"10.1016\/j.inffus.2025.104065_bib0045","doi-asserted-by":"crossref","first-page":"1756","DOI":"10.1109\/TIT.2005.846400","article-title":"Learn more, sample less: control of volume and variance in network measurement","volume":"51","author":"Duffield","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10.1016\/j.inffus.2025.104065_bib0046","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1109\/TNET.2020.2982739","article-title":"Designing heavy-hitter detection algorithms for programmable switches","volume":"28","author":"Basat","year":"2020","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.inffus.2025.104065_bib0047","series-title":"Proc. of the Symposium on SDN Research (SOSR)","first-page":"164","article-title":"Heavy-hitter detection entirely in the data plane","author":"Sivaraman","year":"2017"},{"key":"10.1016\/j.inffus.2025.104065_bib0048","series-title":"Proc. of the IEEE International Conference on Network Protocols (ICNP)","first-page":"1","article-title":"SketchINT: empowering INT with TowerSketch for per-flow per-switch measurement","author":"Yang","year":"2021"},{"key":"10.1016\/j.inffus.2025.104065_bib0049","series-title":"Proc. of the IEEE International Conference on Data Engineering (ICDE)","first-page":"1157","article-title":"Scalable overspeed item detection in streams","author":"Wu","year":"2024"},{"key":"10.1016\/j.inffus.2025.104065_bib0050","unstructured":"CAIDA, The CAIDA UCSD Anonymized Internet Traces, https:\/\/www.caida.org\/catalog\/datasets\/. Accessed: 2024-7-28."},{"key":"10.1016\/j.inffus.2025.104065_bib0051","unstructured":"MAWI, MAWI Working Group Traffic Archive, https:\/\/mawi.wide.ad.jp\/mawi\/. Accessed: 2025-9-3."},{"issue":"6","key":"10.1016\/j.inffus.2025.104065_bib0052","doi-asserted-by":"crossref","first-page":"2653","DOI":"10.1109\/TNET.2023.3257226","article-title":"CocoSketch: high-performance sketch-based measurement over arbitrary partial key query","volume":"31","author":"Miao","year":"2023","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"10.1016\/j.inffus.2025.104065_bib0053","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1109\/TNET.2022.3198738","article-title":"A high-performance invertible sketch for network-wide superspreader detection","volume":"31","author":"Tang","year":"2022","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.inffus.2025.104065_bib0054","article-title":"TiGDistill-BEV: multi-view BEV 3D object detection via target inner-geometry learning distillation","author":"Xu","year":"2025","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"10.1016\/j.inffus.2025.104065_bib0055","series-title":"Proceedings of the Computer Vision and Pattern Recognition Conference","first-page":"22432","article-title":"Don\u2019t shake the wheel: momentum-aware planning in end-to-end autonomous driving","author":"Song","year":"2025"},{"key":"10.1016\/j.inffus.2025.104065_bib0056","doi-asserted-by":"crossref","DOI":"10.1016\/j.inffus.2024.102695","article-title":"Multimodal fusion for large-scale traffic prediction with heterogeneous retentive networks","volume":"114","author":"Yan","year":"2025","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.inffus.2025.104065_bib0057","doi-asserted-by":"crossref","DOI":"10.1016\/j.inffus.2023.101837","article-title":"Integrating the traffic science with representation learning for city-wide network congestion prediction","volume":"99","author":"Zheng","year":"2023","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.inffus.2025.104065_bib0058","doi-asserted-by":"crossref","DOI":"10.1016\/j.inffus.2023.102078","article-title":"RT-GCN: Gaussian-based spatiotemporal graph convolutional network for robust traffic prediction","volume":"102","author":"Liu","year":"2024","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.inffus.2025.104065_bib0059","doi-asserted-by":"crossref","DOI":"10.1016\/j.inffus.2025.103274","article-title":"General pre-trained inertial signal feature extraction based on temporal memory fusion","volume":"123","author":"Wang","year":"2025","journal-title":"Inf. Fusion"}],"container-title":["Information Fusion"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1566253525011273?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1566253525011273?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T15:24:49Z","timestamp":1773933889000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1566253525011273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":59,"alternative-id":["S1566253525011273"],"URL":"https:\/\/doi.org\/10.1016\/j.inffus.2025.104065","relation":{},"ISSN":["1566-2535"],"issn-type":[{"value":"1566-2535","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"FuseMeter: An efficient framework for generic per-flow traffic measurement","name":"articletitle","label":"Article Title"},{"value":"Information Fusion","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.inffus.2025.104065","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104065"}}