{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:02:32Z","timestamp":1780052552836,"version":"3.53.1"},"reference-count":91,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100018987","name":"Ministerul Cercet\u0103rii, Inov\u0103rii \u015fi Digitaliz\u0103rii","doi-asserted-by":"publisher","award":["PN-III-P1-1.1-TE- 2021-0253"],"award-info":[{"award-number":["PN-III-P1-1.1-TE- 2021-0253"]}],"id":[{"id":"10.13039\/100018987","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s11280-025-01387-3","type":"journal-article","created":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T01:18:20Z","timestamp":1764638300000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards understanding news plagiarism: theoretical and experimental analysis"],"prefix":"10.1007","volume":"29","author":[{"given":"Ruxandra","family":"Marinescu-Ghemeci","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrian","family":"Micl\u0103u\u015f","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ionu\u021b","family":"Murare\u021bu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"key":"1387_CR1","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201907, pp. 420\u2013429. Association for Computing Machinery, (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"1387_CR2","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201909, pp. 199\u2013208. Association for Computing Machinery, (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"1387_CR3","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, pp. 1029\u20131038 (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"1387_CR4","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms. SODA \u201914, pp. 946\u2013957. Society for Industrial and Applied Mathematics, (2014)","DOI":"10.1137\/1.9781611973402.70"},{"key":"1387_CR5","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: A martingale approach. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data. SIGMOD \u201915, pp. 1539\u20131554. Association for Computing Machinery, (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"1387_CR6","unstructured":"Adaptive submodularity: Theory and applications in active learning and stochastic optimization. Journal of Artificial Intelligence Research 42, 427\u2013486 (2011)"},{"key":"1387_CR7","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9. : Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) Automata, Languages and Programming, pp. 1127\u20131138. Springer, (2005)","DOI":"10.1007\/11523468_91"},{"key":"1387_CR8","doi-asserted-by":"crossref","unstructured":"Mossel, E., Roch, S.: On the submodularity of influence in social networks. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing. STOC \u201907, pp. 128\u2013134. Association for Computing Machinery, (2007)","DOI":"10.1145\/1250790.1250811"},{"issue":"3","key":"1387_CR9","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/08073617X","volume":"23","author":"N Chen","year":"2009","unstructured":"Chen, N.: On the approximability of influence in social networks. SIAM J. Discret. Math. 23(3), 1400\u20131415 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"1387_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2003","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. Theory Comput 11, 105\u2013147 (2003)","journal-title":"Theory Comput"},{"key":"1387_CR11","doi-asserted-by":"crossref","unstructured":"Beer, D., Matthee, M.: Approaches to identify fake news: A systematic literature review. In: Antipova, T. (ed.) integrated science in digital age 2020, pp. 13\u201322. Springer, (2021)","DOI":"10.1007\/978-3-030-49264-9_2"},{"key":"1387_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s10389-021-01658-z","author":"YM Rocha","year":"2021","unstructured":"Rocha, Y.M., Moura, G.A., Desid\u00e9rio, G.A., Oliveira, C.H., Louren\u00e7o, F.D., Figueiredo Nicolete, L.D.: The impact of fake news on social media and its influence on health during the COVID-19 pandemic: A systematic review. Journal of Public Health (2021). https:\/\/doi.org\/10.1007\/s10389-021-01658-z","journal-title":"Journal of Public Health"},{"key":"1387_CR13","doi-asserted-by":"crossref","unstructured":"Clough, P., Gaizauskas, R., Piao, S.S.L., Wilks, Y.: METER: MEasuring TExt Reuse. ACL (2002)","DOI":"10.3115\/1073083.1073110"},{"issue":"1","key":"1387_CR14","doi-asserted-by":"publisher","DOI":"10.1038\/s41597-022-01908-z","volume":"10","author":"L Gienapp","year":"2023","unstructured":"Gienapp, L., Kircheis, W., Sievers, B., Stein, B., Potthast, M.: A large dataset of scientific text reuse in open-access publications. Scientific Data 10(1), 58 (2023)","journal-title":"Scientific Data"},{"key":"1387_CR15","doi-asserted-by":"crossref","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. In: Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No. 97TB100171), pp. 21\u201329 (1997). IEEE","DOI":"10.1109\/SEQUEN.1997.666900"},{"key":"1387_CR16","doi-asserted-by":"crossref","unstructured":"Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing, pp. 380\u2013388 (2002)","DOI":"10.1145\/509907.509965"},{"key":"1387_CR17","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Jain, A., Das Sarma, A.: Detecting near-duplicates for web crawling. In: Proceedings of the 16th international conference on world wide web, pp. 141\u2013150 (2007)","DOI":"10.1145\/1242572.1242592"},{"key":"1387_CR18","doi-asserted-by":"crossref","unstructured":"Alonso, O., Fetterly, D., Manasse, M.: Duplicate news story detection revisited. In: Asia Information Retrieval Symposium, pp. 203\u2013214 (2013). Springer","DOI":"10.1007\/978-3-642-45068-6_18"},{"key":"1387_CR19","unstructured":"Rodier, S., Carter, D.: Online near-duplicate detection of news articles. In: Proceedings of the Twelfth Language Resources and Evaluation Conference, pp. 1242\u20131249 (2020)"},{"key":"1387_CR20","doi-asserted-by":"crossref","unstructured":"Evans, N., Edge, D., Larson, J., White, C.: News provenance: Revealing news text reuse at web-scale in an augmented news search experience. In: Extended Abstracts of the 2020 CHI Conference on Human Factors in Computing Systems, pp. 1\u20138 (2020)","DOI":"10.1145\/3334480.3375225"},{"issue":"1","key":"1387_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1080\/19312458.2018.1536972","volume":"13","author":"T Nicholls","year":"2019","unstructured":"Nicholls, T., Bright, J.: Understanding news story chains using information retrieval and network clustering techniques. Communication Methods and Measures 13(1), 43\u201359 (2019)","journal-title":"Communication Methods and Measures"},{"key":"1387_CR22","unstructured":"Potthast, M., Hagen, M., Gollub, T., Tippmann, M., Kiesel, J., Rosso, P., Stamatatos, E., Stein, B.: Overview of the 5th international competition on plagiarism detection (2013)"},{"key":"1387_CR23","doi-asserted-by":"crossref","unstructured":"Wang, Z., Zuo, C., Deng, D.: Txtalign: efficient near-duplicate text alignment search via bottom-k sketches for plagiarism detection. In: Proceedings of the 2022 International Conference on Management of Data, pp. 1146\u20131159 (2022)","DOI":"10.1145\/3514221.3526178"},{"key":"1387_CR24","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Backstrom, L., Kleinberg, J.: Meme-tracking and the dynamics of the news cycle. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201909, pp. 497\u2013506. Association for Computing Machinery, (2009)","DOI":"10.1145\/1557019.1557077"},{"key":"1387_CR25","doi-asserted-by":"crossref","unstructured":"Spitz, A., Gertz, M.: Breaking the news: Extracting the sparse citation network backbone of online news articles. In: Proceedings of the 2015 IEEE\/ACM international conference on advances in social networks analysis and mining 2015, pp. 274\u2013279 (2015)","DOI":"10.1145\/2808797.2809380"},{"issue":"2","key":"1387_CR26","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1504\/IJWET.2017.086449","volume":"12","author":"I Varlamis","year":"2017","unstructured":"Varlamis, I., Hilliard, D.F.: Finding influential sources and breaking news in news media using graph analysis techniques. International Journal of Web Engineering and Technology 12(2), 143\u2013164 (2017)","journal-title":"International Journal of Web Engineering and Technology"},{"issue":"6380","key":"1387_CR27","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1126\/science.aap9559","volume":"359","author":"S Vosoughi","year":"2018","unstructured":"Vosoughi, S., Roy, D., Aral, S.: The spread of true and false news online. Science 359(6380), 1146\u20131151 (2018)","journal-title":"Science"},{"key":"1387_CR28","doi-asserted-by":"crossref","unstructured":"Newman, M.: Networks, 2nd edn. Oxford University Press, Inc., (2018)","DOI":"10.1093\/oso\/9780198805090.001.0001"},{"key":"1387_CR29","doi-asserted-by":"publisher","first-page":"3417","DOI":"10.1007\/s10115-020-01461-4","volume":"62","author":"S Banerjee","year":"2020","unstructured":"Banerjee, S., Jenamani, M., Pratihar, D.K.: A survey on influence maximization in a social network. Knowl. Inf. Syst. 62, 3417\u20133455 (2020)","journal-title":"Knowl. Inf. Syst."},{"key":"1387_CR30","doi-asserted-by":"crossref","unstructured":"Mehrotra, A., Sarreddy, M., Singh, S.: Detection of fake twitter followers using graph centrality measures. In: 2016 2nd International conference on contemporary computing and informatics (IC3I), pp. 499\u2013504 (2016)","DOI":"10.1109\/IC3I.2016.7918016"},{"issue":"5","key":"1387_CR31","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1016\/j.ipm.2016.04.003","volume":"52","author":"F Riquelme","year":"2016","unstructured":"Riquelme, F., Gonz\u00e1ez-Cantergiani, P.: Measuring user influence on twitter: A survey. Inf. Process. Manage. 52(5), 949\u2013975 (2016)","journal-title":"Inf. Process. Manage."},{"key":"1387_CR32","doi-asserted-by":"crossref","unstructured":"Agarwal, N., Liu, H.: Modeling and Data Mining in Blogosphere vol. 1, (2009)","DOI":"10.1007\/978-3-031-01898-5_1"},{"issue":"4","key":"1387_CR33","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: An algorithmic perspective. Internet Mathematics 12(4), 239\u2013280 (2016)","journal-title":"Internet Mathematics"},{"issue":"4","key":"1387_CR34","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J.M., Kumar, A.: Connectivity and inference problems for temporal networks. Journal of Computer and System Sciences 64(4), 820\u2013842 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"1387_CR35","doi-asserted-by":"crossref","unstructured":"Deligkas, A., Eiben, E., Goldsmith, T.-L., Skretas, G.: Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source. In: Proceedings of the 2023 international conference on autonomous agents and multiagent systems, pp. 2222\u20132230 (2023)","DOI":"10.65109\/HWQC2949"},{"key":"1387_CR36","doi-asserted-by":"crossref","unstructured":"Gayraud, N.T., Pitoura, E., Tsaparas, P.: Diffusion maximization in evolving social networks. In: Proceedings of the 2015 ACM on conference on online social networks, pp. 125\u2013135 (2015)","DOI":"10.1145\/2817946.2817965"},{"issue":"4","key":"1387_CR37","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1007\/s10115-019-01403-9","volume":"62","author":"P Rozenshtein","year":"2020","unstructured":"Rozenshtein, P., Bonchi, F., Gionis, A., Sozio, M., Tatti, N.: Finding events in temporal networks: segmentation meets densest subgraph discovery. Knowl. Inf. Syst. 62(4), 1611\u20131639 (2020)","journal-title":"Knowl. Inf. Syst."},{"issue":"3","key":"1387_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-021-00593-w","volume":"2","author":"R Dondi","year":"2021","unstructured":"Dondi, R., Hosseinzadeh, M.M.: Dense sub-networks discovery in temporal networks. SN Comput. Sci. 2(3), 158 (2021)","journal-title":"SN Comput. Sci."},{"key":"1387_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.softx.2019.100305","volume":"10","author":"C Pop","year":"2019","unstructured":"Pop, C., Popa, A.: Newscompare-a novel application for detecting news influence in a country. SoftwareX 10, 100305 (2019)","journal-title":"SoftwareX"},{"key":"1387_CR40","unstructured":"Marinescu-Ghemeci, R., Micl\u0103u\u0219, A., Murare\u021bu, I., Popa, A.: Newscompare. https:\/\/github.com\/imuraretu\/newscompare (2024)"},{"key":"1387_CR41","unstructured":"Marinescu-Ghemeci, R., Micl\u0103u\u0219, A., Murare\u021bu, I., Popa, A.: Newscompare-Experiments. https:\/\/github.com\/adimiclaus15\/Newscompare-Experiments (2024)"},{"issue":"2","key":"1387_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103594","volume":"61","author":"X Fang","year":"2024","unstructured":"Fang, X., Wu, H., Jing, J., Meng, Y., Yu, B., Yu, H., Zhang, H.: Nsep: Early fake news detection via news semantic environment perception. Information Processing & Management 61(2), 103594 (2024)","journal-title":"Information Processing & Management"},{"issue":"3","key":"1387_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2024.103653","volume":"61","author":"AM Luvembe","year":"2024","unstructured":"Luvembe, A.M., Li, W., Li, S., Liu, F., Wu, X.: CAF-ODNN: Complementary attention fusion with optimized deep neural network for multimodal fake news detection. Information Processing & Management 61(3), 103653 (2024)","journal-title":"Information Processing & Management"},{"key":"1387_CR44","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1609\/aaai.v38i1.27788","volume":"38","author":"S Yin","year":"2024","unstructured":"Yin, S., Zhu, P., Wu, L., Gao, C., Wang, Z.: Gamc: an unsupervised method for fake news detection using graph autoencoder with masking. Proceedings of the AAAI Conference on Artificial Intelligence 38, 347\u2013355 (2024)","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"1387_CR45","doi-asserted-by":"crossref","unstructured":"Hashmi, E., Yildirim Yayilgan, S., Yamin, M., Ali, S., Abomhara, M.: Advancing fake news detection: Hybrid deep learning with fasttext and explainable ai. IEEE Access PP, 1\u20131 (2024)","DOI":"10.1109\/ACCESS.2024.3381038"},{"issue":"17","key":"1387_CR46","doi-asserted-by":"publisher","first-page":"51009","DOI":"10.1007\/s11042-023-17470-8","volume":"83","author":"J Alghamdi","year":"2024","unstructured":"Alghamdi, J., Luo, S., Lin, Y.: A comprehensive survey on machine learning approaches for fake news detection. Multimed. Tools Appl. 83(17), 51009\u201351067 (2024)","journal-title":"Multimed. Tools Appl."},{"key":"1387_CR47","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.neunet.2024.106115","volume":"172","author":"Q Chang","year":"2024","unstructured":"Chang, Q., Li, X., Duan, Z.: Graph global attention network with memory: A deep learning approach for fake news detection. Neural Netw. 172, 106\u2013115 (2024)","journal-title":"Neural Netw."},{"key":"1387_CR48","doi-asserted-by":"publisher","first-page":"73879","DOI":"10.1109\/ACCESS.2023.3294989","volume":"11","author":"M Tajrian","year":"2023","unstructured":"Tajrian, M., Rahman, A., Kabir, M.A., Islam, M.R.: A review of methodologies for fake news analysis. IEEE Access 11, 73879\u201373893 (2023)","journal-title":"IEEE Access"},{"key":"1387_CR49","doi-asserted-by":"publisher","first-page":"5248","DOI":"10.1609\/aaai.v37i4.25655","volume":"37","author":"L Sun","year":"2023","unstructured":"Sun, L., Rao, Y., Lan, Y., Xia, B., Li, Y.: Hg-sl: Jointly learning of global and local user spreading behavior for fake news early detection. Proceedings of the AAAI Conference on Artificial Intelligence 37, 5248\u20135256 (2023)","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"issue":"1","key":"1387_CR50","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-023-01104-w","volume":"13","author":"C Comito","year":"2023","unstructured":"Comito, C., Caroprese, L., Zumpano, E.: Multimodal fake news detection on social media: a survey of deep learning techniques. Soc. Netw. Anal. Min. 13(1), 101 (2023)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"3","key":"1387_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3522756","volume":"16","author":"S Raponi","year":"2022","unstructured":"Raponi, S., Khalifa, Z., Oligeri, G., Di Pietro, R.: Fake news propagation: A review of epidemic models, datasets, and insights. ACM Transactions on the Web 16(3), 1\u201334 (2022)","journal-title":"ACM Transactions on the Web"},{"issue":"5","key":"1387_CR52","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2021.102618","volume":"58","author":"A Silva","year":"2021","unstructured":"Silva, A., Han, Y., Luo, L., Karunasekera, S., Leckie, C.: Propagation2vec: Embedding partial propagation networks for explainable fake news early detection. Information Processing & Management 58(5), 102618 (2021)","journal-title":"Information Processing & Management"},{"key":"1387_CR53","doi-asserted-by":"crossref","unstructured":"Mishra, R.: Fake news detection using higher-order user to user mutual-attention progression in propagation paths. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition workshops, pp. 652\u2013653 (2020)","DOI":"10.1109\/CVPRW50498.2020.00334"},{"key":"1387_CR54","doi-asserted-by":"crossref","unstructured":"Liu, Y., Wu, Y.-F.: Early detection of fake news on social media through propagation path classification with recurrent and convolutional networks. In: Proceedings of the AAAI conference on artificial intelligence, vol. 32 (2018)","DOI":"10.1609\/aaai.v32i1.11268"},{"issue":"1","key":"1387_CR55","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-024-00625-3","volume":"9","author":"E Yanchenko","year":"2024","unstructured":"Yanchenko, E., Murata, T., Holme, P.: Influence maximization on temporal networks: a review. Appl. Netw. Sci. 9(1), 16 (2024)","journal-title":"Appl. Netw. Sci."},{"issue":"2","key":"1387_CR56","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1137\/22M1511916","volume":"53","author":"A Casteigts","year":"2024","unstructured":"Casteigts, A., Raskin, M., Renken, M., Zamaraev, V.: Sharp thresholds in random simple temporal graphs. SIAM J. Comput. 53(2), 346\u2013388 (2024)","journal-title":"SIAM J. Comput."},{"key":"1387_CR57","doi-asserted-by":"crossref","unstructured":"Chen, J., Molter, H., Sorge, M., Such\u1ef3, O.: Cluster editing for multi-layer and temporal graphs. Theory of Computing Systems, pp 1\u201352 (2024)","DOI":"10.21203\/rs.3.rs-2759843\/v1"},{"key":"1387_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2023.04.005","volume":"137","author":"GB Mertzios","year":"2023","unstructured":"Mertzios, G.B., Molter, H., Niedermeier, R., Zamaraev, V., Zschoche, P.: Computing maximum matchings in temporal graphs. Journal of Computer and System Sciences 137, 1\u201319 (2023)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"1387_CR59","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/s00453-022-01018-7","volume":"85","author":"BM Bumpus","year":"2023","unstructured":"Bumpus, B.M., Meeks, K.: Edge exploration of temporal graphs. Algorithmica 85(3), 688\u2013716 (2023)","journal-title":"Algorithmica"},{"issue":"6366","key":"1387_CR60","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1126\/science.aai7488","volume":"358","author":"A Li","year":"2017","unstructured":"Li, A., Cornelius, S.P., Liu, Y.-Y., Wang, L., Barab\u00e1si, A.-L.: The fundamental advantages of temporal networks. Science 358(6366), 1042\u20131046 (2017)","journal-title":"Science"},{"key":"1387_CR61","doi-asserted-by":"crossref","unstructured":"Masuda, N., Lambiotte, R.: A Guide to Temporal Networks. World Scientific, (2016)","DOI":"10.1142\/q0033"},{"key":"1387_CR62","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.04.006","volume":"634","author":"O Michail","year":"2016","unstructured":"Michail, O., Spirakis, P.G.: Traveling salesman problems in temporal graphs. Theoretical Computer Science 634, 1\u201323 (2016)","journal-title":"Theoretical Computer Science"},{"issue":"9","key":"1387_CR63","doi-asserted-by":"publisher","first-page":"721","DOI":"10.14778\/2732939.2732945","volume":"7","author":"H Wu","year":"2014","unstructured":"Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. Proceedings of the VLDB Endowment 7(9), 721\u2013732 (2014)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"3","key":"1387_CR64","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Physics Reports 519(3), 97\u2013125 (2012)","journal-title":"Physics Reports"},{"issue":"6","key":"1387_CR65","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1016\/j.physa.2008.11.021","volume":"388","author":"V Kostakos","year":"2009","unstructured":"Kostakos, V.: Temporal graphs. Physica A 388(6), 1007\u20131023 (2009)","journal-title":"Physica A"},{"key":"1387_CR66","doi-asserted-by":"publisher","DOI":"10.3389\/frma.2022.1055348","volume":"7","author":"S Wei","year":"2023","unstructured":"Wei, S., Wu, B., Xiang, A., Zhu, Y., Song, C.: DGTR: Dynamic graph transformer for rumor detection. Frontiers in Research Metrics and Analytics 7, 1055348 (2023)","journal-title":"Frontiers in Research Metrics and Analytics"},{"key":"1387_CR67","doi-asserted-by":"crossref","unstructured":"Gong, S., Sinnott, R.O., Qi, J., Paris, C.: Fake news detection through temporally evolving user interactions. In: Pacific-Asia conference on knowledge discovery and data mining, pp. 137\u2013148 (2023). Springer","DOI":"10.1007\/978-3-031-33383-5_11"},{"key":"1387_CR68","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.jcss.2019.08.002","volume":"107","author":"EC Akrida","year":"2020","unstructured":"Akrida, E.C., Mertzios, G.B., Spirakis, P.G., Zamaraev, V.: Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci. 107, 108\u2013123 (2020)","journal-title":"J. Comput. Syst. Sci."},{"key":"1387_CR69","doi-asserted-by":"crossref","unstructured":"Dondi, R., Popa, A.: Timeline cover in temporal graphs: Exact and approximation algorithms. In: International workshop on combinatorial algorithms, pp. 173\u2013184 (2023). Springer","DOI":"10.1007\/978-3-031-34347-6_15"},{"key":"1387_CR70","unstructured":"Klobas, N., Mertzios, G.B., Spirakis, P.G.: Sliding into the future: Investigating sliding windows in temporal graphs (2023)"},{"key":"1387_CR71","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual. https:\/\/www.gurobi.com (2023)"},{"key":"1387_CR72","volume":"47","author":"V Krotov","year":"2020","unstructured":"Krotov, V., Johnson, L., Silva, L.: Tutorial: Legality and ethics of web scraping. Commun. Assoc. Inf. Syst. 47, 22 (2020)","journal-title":"Commun. Assoc. Inf. Syst."},{"key":"1387_CR73","first-page":"275","volume":"13","author":"Z Gold","year":"2017","unstructured":"Gold, Z., Latonero, M.: Robots welcome: Ethical and legal considerations for web crawling and scraping. Wash. JL Tech. & Arts 13, 275 (2017)","journal-title":"Wash. JL Tech. & Arts"},{"key":"1387_CR74","unstructured":"Elasticsearch: Elastic Documentation. https:\/\/www.elastic.co\/guide\/en\/elasticsearch\/reference\/current\/query-dsl-mlt-query.html\u201d (2023)"},{"key":"1387_CR75","doi-asserted-by":"crossref","unstructured":"Reimers, N., Gurevych, I.: Sentence-bert: Sentence embeddings using siamese bert-networks. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pp. 3982\u20133992 (2019)","DOI":"10.18653\/v1\/D19-1410"},{"key":"1387_CR76","unstructured":"Casteigts, A., Flocchini, P.: Deterministic algorithms in dynamic networks: Problems, analysis, and algorithmic tools (2013)"},{"key":"1387_CR77","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions - I. Mathematical Programming 14, 265\u2013294 (1978)","journal-title":"Mathematical Programming"},{"key":"1387_CR78","doi-asserted-by":"crossref","unstructured":"Mandal, S., Gupta, A.: Approximation algorithms for permanent dominating set problem on dynamic networks. In: Distributed Computing and Internet Technology: 14th International Conference, ICDCIT 2018, Bhubaneswar, India, January 11\u201313, 2018, Proceedings 14, pp. 265\u2013279 (2018). Springer","DOI":"10.1007\/978-3-319-72344-0_22"},{"issue":"4","key":"1387_CR79","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"1387_CR80","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab (November 1999). Previous number = SIDL-WP-1999-0120"},{"issue":"5439","key":"1387_CR81","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. science 286(5439), 509\u2013512 (1999)","journal-title":"science"},{"issue":"6794","key":"1387_CR82","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.-L.: Error and attack tolerance of complex networks. nature 406(6794), 378\u2013382 (2000)","journal-title":"nature"},{"issue":"14","key":"1387_CR83","doi-asserted-by":"publisher","first-page":"3200","DOI":"10.1103\/PhysRevLett.86.3200","volume":"86","author":"R Pastor-Satorras","year":"2001","unstructured":"Pastor-Satorras, R., Vespignani, A.: Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86(14), 3200 (2001)","journal-title":"Phys. Rev. Lett."},{"issue":"5","key":"1387_CR84","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1080\/00107510500052444","volume":"46","author":"ME Newman","year":"2005","unstructured":"Newman, M.E.: Power laws, pareto distributions and zipf\u2019s law. Contemporary Physics 46(5), 323\u2013351 (2005)","journal-title":"Contemporary Physics"},{"issue":"4","key":"1387_CR85","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset, A., Shalizi, C.R., Newman, M.E.: Power-law distributions in empirical data. SIAM Rev. 51(4), 661\u2013703 (2009)","journal-title":"SIAM Rev."},{"issue":"253","key":"1387_CR86","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1080\/01621459.1951.10500769","volume":"46","author":"FJ Massey","year":"1951","unstructured":"Massey, F.J.: The kolmogorov-smirnov test for goodness of fit. Journal of the American Statistical Association 46(253), 68\u201378 (1951)","journal-title":"Journal of the American Statistical Association"},{"key":"1387_CR87","unstructured":"Fisher, R.A.: The Design of Experiments. Oliver and Boyd, (1935)"},{"issue":"1","key":"1387_CR88","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1214\/aoms\/1177730491","volume":"18","author":"HB Mann","year":"1947","unstructured":"Mann, H.B., Whitney, D.R.: On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other. The Annals of Mathematical Statistics 18(1), 50\u201360 (1947)","journal-title":"The Annals of Mathematical Statistics"},{"issue":"1","key":"1387_CR89","doi-asserted-by":"publisher","first-page":"119","DOI":"10.2307\/2984124","volume":"4","author":"EJG Pitman","year":"1937","unstructured":"Pitman, E.J.G.: Significance tests which may be applied to samples from any populations. Suppl. J. R. Stat. Soc. 4(1), 119\u2013130 (1937)","journal-title":"Suppl. J. R. Stat. Soc."},{"issue":"2","key":"1387_CR90","doi-asserted-by":"publisher","first-page":"225","DOI":"10.2307\/2983647","volume":"4","author":"EJG Pitman","year":"1937","unstructured":"Pitman, E.J.G.: Significance tests which may be applied to samples from any populations. ii. the correlation coefficient test. Journal of the Royal Statistical Society Series B: Statistical Methodology 4(2), 225\u2013232 (1937)","journal-title":"Journal of the Royal Statistical Society Series B: Statistical Methodology"},{"issue":"3\/4","key":"1387_CR91","doi-asserted-by":"publisher","first-page":"322","DOI":"10.2307\/2332008","volume":"29","author":"EJG Pitman","year":"1938","unstructured":"Pitman, E.J.G.: Significance tests which may be applied to samples from any populations: Iii. the analysis of variance test. Biometrika 29(3\/4), 322\u2013335 (1938)","journal-title":"Biometrika"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-025-01387-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-025-01387-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-025-01387-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T10:02:02Z","timestamp":1780048922000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-025-01387-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"references-count":91,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["1387"],"URL":"https:\/\/doi.org\/10.1007\/s11280-025-01387-3","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-7069020\/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,12,2]]},"assertion":[{"value":"7 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 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 declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"2"}}