{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T13:02:31Z","timestamp":1780664551739,"version":"3.54.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T00:00:00Z","timestamp":1774051200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T00:00:00Z","timestamp":1774051200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61907021"],"award-info":[{"award-number":["61907021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s13042-026-03033-4","type":"journal-article","created":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T06:11:50Z","timestamp":1774073510000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["CasMST-KAN: a cascade prediction model with multi-scale temporal convolution and Kolmogorov\u2013Arnold networks"],"prefix":"10.1007","volume":"17","author":[{"given":"Xia","family":"Dan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhihao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuan","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Di","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,21]]},"reference":[{"issue":"6","key":"3033_CR1","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1109\/TMM.2013.2265080","volume":"15","author":"LM Aiello","year":"2013","unstructured":"Aiello LM, Petkos G, Martin C et al (2013) Sensing trending topics in twitter. IEEE Trans Multimed 15(6):1268\u20131282","journal-title":"IEEE Trans Multimed"},{"key":"3033_CR2","doi-asserted-by":"crossref","unstructured":"Cai H, Li J, Hu M et al (2022) Efficientvit: multi-scale linear attention for high-resolution dense prediction. arXiv:2205.14756","DOI":"10.1109\/ICCV51070.2023.01587"},{"key":"3033_CR3","doi-asserted-by":"crossref","unstructured":"Cao Q, Shen H, Cen K et al (2017) Deephawkes: bridging the gap between prediction and understanding of information cascades. In: Proceedings of the 2017 ACM on conference on information and knowledge management, pp 1149\u20131158","DOI":"10.1145\/3132847.3132973"},{"key":"3033_CR4","doi-asserted-by":"crossref","unstructured":"Cao Q, Shen H, Gao J et al (2020) Popularity prediction on social platforms with coupled graph neural networks. In: Proceedings of the 13th international conference on web search and data mining, pp 70\u201378","DOI":"10.1145\/3336191.3371834"},{"key":"3033_CR5","doi-asserted-by":"crossref","unstructured":"Chen X, Zhou F, Zhang K et al (2019) Information diffusion prediction via recurrent cascades convolution. In: 2019 IEEE 35th international conference on data engineering (ICDE). IEEE, pp 770\u2013781","DOI":"10.1109\/ICDE.2019.00074"},{"key":"3033_CR6","doi-asserted-by":"crossref","unstructured":"Cheng G, Yan X, Gao S et al (2023) Cassampling: exploring efficient cascade graph learning for popularity prediction. In: Joint European conference on machine learning and knowledge discovery in databases. Springer, pp 70\u201386","DOI":"10.1007\/978-3-031-43418-1_5"},{"key":"3033_CR7","doi-asserted-by":"crossref","unstructured":"Cheng J, Adamic L, Dow PA et al (2014) Can cascades be predicted? In: Proceedings of the 23rd international conference on world wide web, pp 925\u2013936","DOI":"10.1145\/2566486.2567997"},{"issue":"12","key":"3033_CR8","doi-asserted-by":"publisher","first-page":"8541","DOI":"10.1109\/TKDE.2024.3465241","volume":"36","author":"Z Cheng","year":"2024","unstructured":"Cheng Z, Zhou F, Xu X et al (2024) Information cascade popularity prediction via probabilistic diffusion. IEEE Trans Knowl Data Eng 36(12):8541\u201355","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3033_CR9","unstructured":"Chung J, Gulcehre C, Cho K et al (2014) Empirical evaluation of gated recurrent neural networks on sequence modeling. arXiv:1412.3555"},{"key":"3033_CR10","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/j.procs.2015.07.165","volume":"55","author":"W Fei","year":"2015","unstructured":"Fei W, Gu J, Yang Y et al (2015) Credit risk evaluation based on social media. Proc Comput Sci 55:725\u2013731","journal-title":"Proc Comput Sci"},{"key":"3033_CR11","doi-asserted-by":"crossref","unstructured":"Gao J, Shen H, Liu S et al (2016) Modeling and predicting retweeting dynamics via a mixture process. In: Proceedings of the 25th international conference companion on world wide web, pp 33\u201334","DOI":"10.1145\/2872518.2889389"},{"key":"3033_CR12","doi-asserted-by":"crossref","unstructured":"Gao S, Ma J, Chen Z (2014) Effective and effortless features for popularity prediction in microblogging network. In: Proceedings of the 23rd international conference on world wide web, pp 269\u2013270","DOI":"10.1145\/2567948.2577312"},{"key":"3033_CR13","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter S (1997) Long short-term memory. Neural Comput 9:1735\u201380","journal-title":"Neural Comput"},{"key":"3033_CR14","doi-asserted-by":"crossref","unstructured":"Huang C, Xu H, Xu Y et al (2021) Knowledge-aware coupled graph neural network for social recommendation. In: Proceedings of the AAAI conference on artificial intelligence, pp 4115\u20134122","DOI":"10.1609\/aaai.v35i5.16533"},{"issue":"5","key":"3033_CR15","doi-asserted-by":"publisher","first-page":"832","DOI":"10.26599\/TST.2021.9010062","volume":"27","author":"P Huang","year":"2022","unstructured":"Huang P, Guo L, Zhong Y (2022) Efficient algorithms for maximizing group influence in social networks. Tsinghua Sci Technol 27(5):832\u2013842","journal-title":"Tsinghua Sci Technol"},{"issue":"5","key":"3033_CR16","doi-asserted-by":"publisher","first-page":"832","DOI":"10.26599\/TST.2021.9010062","volume":"27","author":"P Huang","year":"2022","unstructured":"Huang P, Guo L, Zhong Y (2022) Efficient algorithms for maximizing group influence in social networks. Tsinghua Sci Technol 27(5):832\u2013842","journal-title":"Tsinghua Sci Technol"},{"key":"3033_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109659","volume":"254","author":"X Jia","year":"2022","unstructured":"Jia X, Shang J, Liu D et al (2022) Hedan: heterogeneous diffusion attention network for popularity prediction of online content. Knowl-Based Syst 254:109659","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"3033_CR18","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1109\/TNSE.2025.3525717","volume":"12","author":"P Jiao","year":"2025","unstructured":"Jiao P, Song W, Wang Y et al (2025) Cascade popularity prediction: a multi-view learning approach with socialized modeling. IEEE Trans Netw Sci Eng 12(2):1198\u2013209","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"3033_CR19","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"3033_CR20","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"3033_CR21","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv:1609.02907"},{"key":"3033_CR22","doi-asserted-by":"crossref","unstructured":"Liao D, Xu J, Li G et al (2019) Popularity prediction on online articles with deep fusion of temporal process and content features. In: Proceedings of the AAAI conference on artificial intelligence, pp 200\u2013207","DOI":"10.1609\/aaai.v33i01.3301200"},{"key":"3033_CR23","doi-asserted-by":"crossref","unstructured":"Liu Z, Huang X, Zhang J et al (2024) Multivariate time-series anomaly detection based on enhancing graph attention networks with topological analysis. In: Proceedings of the 33rd ACM international conference on information and knowledge management, pp 1555\u20131564","DOI":"10.1145\/3627673.3679614"},{"key":"3033_CR24","unstructured":"Liu Z, Wang Y, Vaidya S, et al (2024) Kan: Kolmogorov\u2013Arnold networks. arXiv:2404.19756"},{"key":"3033_CR25","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/j.ins.2016.07.043","volume":"369","author":"IN Lymperopoulos","year":"2016","unstructured":"Lymperopoulos IN (2016) Predicting the popularity growth of online content: model and algorithm. Inf Sci 369:585\u2013613","journal-title":"Inf Sci"},{"issue":"7","key":"3033_CR26","doi-asserted-by":"publisher","first-page":"4578","DOI":"10.1109\/TSMC.2021.3098630","volume":"52","author":"MA Manouchehri","year":"2021","unstructured":"Manouchehri MA, Helfroush MS, Danyali H (2021) Temporal rumor blocking in online social networks: a sampling-based approach. IEEE Trans Syst Man Cybern Syst 52(7):4578\u20134588","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"3033_CR27","doi-asserted-by":"crossref","unstructured":"Martin T, Hofman JM, Sharma A et al (2016) Exploring limits to prediction in complex social systems. In: Proceedings of the 25th international conference on world wide web, pp 683\u2013694","DOI":"10.1145\/2872427.2883001"},{"key":"3033_CR28","doi-asserted-by":"crossref","unstructured":"Mishra S, Rizoiu MA, Xie L (2016) Feature driven and point process approaches for popularity prediction. In: Proceedings of the 25th ACM international on conference on information and knowledge management, pp 1069\u20131078","DOI":"10.1145\/2983323.2983812"},{"key":"3033_CR29","doi-asserted-by":"crossref","unstructured":"Shen H, Wang D, Song C et al (2014) Modeling and predicting popularity dynamics via reinforced Poisson processes. In: Proceedings of the AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v28i1.8739"},{"issue":"3","key":"3033_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103278","volume":"60","author":"X Sun","year":"2023","unstructured":"Sun X, Zhou J, Liu L et al (2023) Explicit time embedding based cascade attention network for information popularity prediction. Inf Process Manag 60(3):103278","journal-title":"Inf Process Manag"},{"key":"3033_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119531","volume":"648","author":"X Sun","year":"2023","unstructured":"Sun X, Zhou J, Liu L et al (2023) Castformer: a novel cascade transformer towards predicting information diffusion. Inf Sci 648:119531","journal-title":"Inf Sci"},{"issue":"3","key":"3033_CR32","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1109\/TKDE.2020.2989759","volume":"34","author":"N Ta","year":"2020","unstructured":"Ta N, Li K, Yang Y et al (2020) Evaluating public anxiety for topic-based communities in social networks. IEEE Trans Knowl Data Eng 34(3):1191\u20131205","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3033_CR33","doi-asserted-by":"crossref","unstructured":"Tang X, Liao D, Huang W et al (2021) Fully exploiting cascade graphs for real-time forwarding prediction. In: Proceedings of the AAAI conference on artificial intelligence, pp 582\u2013590","DOI":"10.1609\/aaai.v35i1.16137"},{"issue":"20","key":"3033_CR34","first-page":"10","volume":"1050","author":"P Velickovic","year":"2017","unstructured":"Velickovic P, Cucurull G, Casanova A et al (2017) Graph attention networks. Stat 1050(20):10\u201348550","journal-title":"Stat"},{"issue":"1","key":"3033_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep02522","volume":"3","author":"L Weng","year":"2013","unstructured":"Weng L, Menczer F, Ahn YY (2013) Virality prediction and community structure in social networks. Sci Rep 3(1):1\u20136","journal-title":"Sci Rep"},{"key":"3033_CR36","doi-asserted-by":"crossref","unstructured":"Wu Z, Zhou J, Liu L et al (2022) Deep popularity prediction in multi-source cascade with heri-gcn. In: 2022 IEEE 38th international conference on data engineering (ICDE). IEEE Computer Society, pp 1714\u20131726","DOI":"10.1109\/ICDE53745.2022.00174"},{"key":"3033_CR37","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ins.2020.03.056","volume":"525","author":"C Xiao","year":"2020","unstructured":"Xiao C, Liu C, Ma Y et al (2020) Time sensitivity-based popularity prediction for online promotion on twitter. Inf Sci 525:82\u201392","journal-title":"Inf Sci"},{"issue":"4","key":"3033_CR38","doi-asserted-by":"publisher","first-page":"3484","DOI":"10.1109\/TKDE.2021.3126475","volume":"35","author":"X Xu","year":"2021","unstructured":"Xu X, Zhou F, Zhang K et al (2021) Casflow: exploring hierarchical structures and propagation uncertainty for cascade prediction. IEEE Trans Knowl Data Eng 35(4):3484\u20133499","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3033_CR39","unstructured":"Xu Z, Qian M, Huang X et al (2020) Casgcn: predicting future cascade growth based on information diffusion graph. arXiv:2009.05152"},{"key":"3033_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116057","volume":"188","author":"G Xue","year":"2022","unstructured":"Xue G, Liu S, Ren L et al (2022) Forecasting the subway passenger flow under event occurrences with multivariate disturbances. Expert Syst Appl 188:116057","journal-title":"Expert Syst Appl"},{"key":"3033_CR41","doi-asserted-by":"crossref","unstructured":"Zhao Q, Erdogdu MA, He HY et al (2015) Seismic: a self-exciting point process model for predicting tweet popularity. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1513\u20131522","DOI":"10.1145\/2783258.2783401"},{"issue":"2","key":"3033_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3433000","volume":"54","author":"F Zhou","year":"2021","unstructured":"Zhou F, Xu X, Trajcevski G et al (2021) A survey of information cascade analysis: models, predictions, and recent advances. ACM Comput Surv (CSUR) 54(2):1\u201336","journal-title":"ACM Comput Surv (CSUR)"},{"key":"3033_CR43","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s11280-020-00841-8","volume":"24","author":"J Zhu","year":"2021","unstructured":"Zhu J, Ghosh S, Wu W (2021) Robust rumor blocking problem with uncertain rumor sources in social networks. World Wide Web 24:229\u2013247","journal-title":"World Wide Web"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-026-03033-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-026-03033-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-026-03033-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T12:09:38Z","timestamp":1780661378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-026-03033-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,21]]},"references-count":43,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["3033"],"URL":"https:\/\/doi.org\/10.1007\/s13042-026-03033-4","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,21]]},"assertion":[{"value":"8 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"221"}}