{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T05:08:22Z","timestamp":1777871302245,"version":"3.51.4"},"reference-count":31,"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\/501100011755","name":"National Center for Research and Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011755","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005632","name":"National Centre for Research and Development","doi-asserted-by":"publisher","award":["FENG.01.01-IP.02-0777\/23"],"award-info":[{"award-number":["FENG.01.01-IP.02-0777\/23"]}],"id":[{"id":"10.13039\/501100005632","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.knosys.2026.115943","type":"journal-article","created":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T16:52:05Z","timestamp":1775494325000},"page":"115943","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["GRA-FIN: New method of large graphs reduction for financial transactions and financial crime analysis"],"prefix":"10.1016","volume":"342","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7122-3306","authenticated-orcid":false,"given":"Rafa\u0142","family":"Kozik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Goca\u0142","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Chora\u015b","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.knosys.2026.115943_b1","series-title":"2025 Financial crime report: AI and geopolitical uncertainty fuel a new wave of financial crime","year":"2025"},{"key":"10.1016\/j.knosys.2026.115943_b2","series-title":"The other side of the coin: An analysis of financial and economic crime \u2013 European financial and economic crime threat assessment 2023","year":"2024"},{"key":"10.1016\/j.knosys.2026.115943_b3","series-title":"EPPO annual report","year":"2024"},{"key":"10.1016\/j.knosys.2026.115943_b4","series-title":"A comprehensive survey on graph reduction: Sparsification, coarsening, and condensation","author":"Hashemi","year":"2024"},{"issue":"3","key":"10.1016\/j.knosys.2026.115943_b5","doi-asserted-by":"crossref","DOI":"10.1145\/3186727","article-title":"Graph summarization methods and applications: A survey","volume":"51","author":"Liu","year":"2018","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.knosys.2026.115943_b6","series-title":"Spectrahedral geometry of graph sparsifiers","author":"Babecki","year":"2023"},{"key":"10.1016\/j.knosys.2026.115943_b7","series-title":"Graph coarsening with neural networks","author":"Cai","year":"2021"},{"key":"10.1016\/j.knosys.2026.115943_b8","series-title":"Graph condensation: A survey","author":"Gao","year":"2025"},{"key":"10.1016\/j.knosys.2026.115943_b9","series-title":"Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing","first-page":"255","article-title":"Twice-Ramanujan sparsifiers","author":"Batson","year":"2009"},{"key":"10.1016\/j.knosys.2026.115943_b10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0024-3795(94)90486-3","article-title":"Laplacian matrices of graphs: a survey","volume":"197\u2013198","author":"Merris","year":"1994","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.knosys.2026.115943_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.114907","article-title":"A dual autoencoder-like NMF with higher-order graph regularization for topic modeling","volume":"333","author":"Majidi","year":"2026","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2026.115943_b12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.knosys.2012.08.022","article-title":"Bipolar fuzzy graphs with applications","volume":"39","author":"Akram","year":"2013","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2026.115943_b13","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2019.105315","article-title":"Note on \u201cbipolar fuzzy graphs with applications\u201d","volume":"192","author":"Poulik","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2026.115943_b14","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s40819-015-0112-0","article-title":"Certain types of product bipolar fuzzy graphs","volume":"3","author":"Ghorai","year":"2017","journal-title":"Int. J. Appl. Comput. Math."},{"key":"10.1016\/j.knosys.2026.115943_b15","doi-asserted-by":"crossref","DOI":"10.1007\/s13370-021-00880-y","article-title":"Characterization of regular bipolar fuzzy graphs","volume":"32","author":"Ghorai","year":"2021","journal-title":"Afr. Mat."},{"key":"10.1016\/j.knosys.2026.115943_b16","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1016\/j.ins.2020.09.050","article-title":"Determination of journeys order based on graph\u2019s Wiener absolute index with bipolar fuzzy information","volume":"545","author":"Poulik","year":"2021","journal-title":"Inform. Sci."},{"key":"10.1016\/j.knosys.2026.115943_b17","series-title":"Demystifying graph sparsification algorithms in graph properties preservation","author":"Chen","year":"2023"},{"key":"10.1016\/j.knosys.2026.115943_b18","series-title":"A generic graph sparsification framework using deep reinforcement learning","author":"Wickman","year":"2023"},{"key":"10.1016\/j.knosys.2026.115943_b19","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2026.115385","article-title":"Enhancing heterogeneous graph learning with semantic-aware meta-path diffusion and dual optimization","volume":"337","author":"Ding","year":"2026","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2026.115943_b20","series-title":"Proceedings of the 2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining","first-page":"120","article-title":"Rank degree: an efficient algorithm for graph sampling","author":"Voudigari","year":"2016"},{"key":"10.1016\/j.knosys.2026.115943_b21","series-title":"Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"824","article-title":"SCAN: a structural clustering algorithm for networks","author":"Xu","year":"2007"},{"key":"10.1016\/j.knosys.2026.115943_b22","series-title":"NetworKit: A tool suite for large-scale complex network analysis","author":"Staudt","year":"2015"},{"key":"10.1016\/j.knosys.2026.115943_b23","series-title":"Graph sparsification by effective resistances","author":"Spielman","year":"2009"},{"key":"10.1016\/j.knosys.2026.115943_b24","series-title":"Spectral sparsification of graphs","author":"Spielman","year":"2010"},{"key":"10.1016\/j.knosys.2026.115943_b25","series-title":"Multi-way spectral partitioning and higher-order cheeger inequalities","author":"Lee","year":"2014"},{"key":"10.1016\/j.knosys.2026.115943_b26","series-title":"Sparsification of social networks using random walks","author":"Wilder","year":"2015"},{"key":"10.1016\/j.knosys.2026.115943_b27","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevResearch.4.043117","article-title":"Network community detection and clustering with random walks","volume":"4","author":"Ballal","year":"2022","journal-title":"Phys. Rev. Res."},{"key":"10.1016\/j.knosys.2026.115943_b28","doi-asserted-by":"crossref","first-page":"15791","DOI":"10.1109\/ACCESS.2024.3356572","article-title":"A graph classification method based on support vector machines and locality-sensitive hashing","volume":"12","author":"Gonzalez-Lima","year":"2024","journal-title":"IEEE Access"},{"key":"10.1016\/j.knosys.2026.115943_b29","series-title":"2022 IEEE International Conference on Cyber Security and Resilience","first-page":"30","article-title":"Ensemble of random and isolation forests for graph-based intrusion detection in containers","author":"Iacovazzi","year":"2022"},{"key":"10.1016\/j.knosys.2026.115943_b30","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.108126","article-title":"Reduction of large-scale graphs: Effective edge shedding at a controllable ratio under resource constraints","volume":"240","author":"Zeng","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2026.115943_b31","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2025.131327","article-title":"In depth analysis for securing the truth: Addressing the fake news challenge with graph neural networks","author":"Katek","year":"2025","journal-title":"Submitt. Neurocomputing"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126006696?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126006696?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T17:11:02Z","timestamp":1777569062000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705126006696"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":31,"alternative-id":["S0950705126006696"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2026.115943","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"GRA-FIN: New method of large graphs reduction for financial transactions and financial crime analysis","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2026.115943","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 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":"115943"}}