{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T12:09:15Z","timestamp":1779365355393,"version":"3.53.0"},"reference-count":66,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.comnet.2026.112330","type":"journal-article","created":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T07:03:45Z","timestamp":1776755025000},"page":"112330","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["STAIR: Towards structure-aware inference of autonomous system relationships using graph neural networks"],"prefix":"10.1016","volume":"284","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-5471-2758","authenticated-orcid":false,"given":"Zekun","family":"Tao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4384-2729","authenticated-orcid":false,"given":"Di","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3235-188X","authenticated-orcid":false,"given":"Kaijie","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9588-0126","authenticated-orcid":false,"given":"Yichen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7721-2675","authenticated-orcid":false,"given":"Peng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2323-7820","authenticated-orcid":false,"given":"Yue","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.comnet.2026.112330_b1","series-title":"Passive and Active Measurement Conference","first-page":"206","article-title":"Internet outages, the eyewitness accounts: Analysis of the outages mailing list","author":"Banerjee","year":"2015"},{"issue":"2","key":"10.1016\/j.comnet.2026.112330_b2","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1109\/TNET.2015.2413838","article-title":"The BGP visibility toolkit: Detecting anomalous Internet routing behavior","volume":"24","author":"Lutu","year":"2016","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.comnet.2026.112330_b3","series-title":"Proceedings of the 2017 Internet Measurement Conference","first-page":"1","article-title":"Inferring BGP blackholing activity in the Internet","author":"Giotsas","year":"2017"},{"key":"10.1016\/j.comnet.2026.112330_b4","doi-asserted-by":"crossref","DOI":"10.2139\/ssrn.3750155","article-title":"A data-driven approach to understanding the state of internet routing security","author":"Testart","year":"2020","journal-title":"SSRN Electron. J."},{"key":"10.1016\/j.comnet.2026.112330_b5","unstructured":"T. Holterbach, T. Alfroy, A. Phokeer, A. Dainotti, C. Pelsser, A System to Detect Forged-Origin BGP Hijacks, in: 21st USENIX Symposium on Networked Systems Design and Implementation, NSDI \u201924, USA, ISBN: 978-1-939133-39-7, 2024, p. 20, URL: https:\/\/api.semanticscholar.org\/CorpusID:266821171."},{"key":"10.1016\/j.comnet.2026.112330_b6","series-title":"Passive and Active Measurement: 26th International Conference, PAM 2025, Virtual Event, March 10\u201312, 2025, Proceedings","first-page":"335","article-title":"Global BGP attacks that evade route monitoring","author":"Birge-Lee","year":"2025"},{"key":"10.1016\/j.comnet.2026.112330_b7","doi-asserted-by":"crossref","first-page":"31092","DOI":"10.1109\/ACCESS.2023.3261128","article-title":"On the effectiveness of BGP hijackers that evade public route collectors","volume":"11","author":"Milolidakis","year":"2023","journal-title":"IEEE Access"},{"key":"10.1016\/j.comnet.2026.112330_b8","doi-asserted-by":"crossref","unstructured":"J. He, Y. Li, H. Zhang, M. Wang, C. An, J. Wang, Be Careful of Your Neighbors: Injected Sub-Prefix Hijacking Invisible to Public Monitors, in: IEEE International Conference on Communications., ICC, Rome, Italy, 2023, pp. 3774\u20133780, http:\/\/dx.doi.org\/10.1109\/ICC45041.2023.10278923.","DOI":"10.1109\/ICC45041.2023.10278923"},{"key":"10.1016\/j.comnet.2026.112330_b9","series-title":"Oscilloscope: Detecting BGP hijacks in the data plane","author":"B\u00fchler","year":"2023"},{"key":"10.1016\/j.comnet.2026.112330_b10","series-title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security","first-page":"431","article-title":"SICO: Surgical interception attacks by manipulating BGP communities","author":"Birge-Lee","year":"2019"},{"issue":"C","key":"10.1016\/j.comnet.2026.112330_b11","article-title":"Hidden AS link prediction based on random forest feature selection and GWO-XGBoost model","volume":"262","author":"Wang","year":"2025","journal-title":"Comput. Netw."},{"issue":"6","key":"10.1016\/j.comnet.2026.112330_b12","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/90.974527","article-title":"On inferring autonomous system relationships in the internet","volume":"9","author":"Gao","year":"2001","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"6","key":"10.1016\/j.comnet.2026.112330_b13","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1109\/90.974523","article-title":"Stable internet routing without global coordination","volume":"9","author":"Gao","year":"2001","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"10.1016\/j.comnet.2026.112330_b14","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TNET.2007.892878","article-title":"Computing the types of the relationships between autonomous systems","volume":"15","author":"Di Battista","year":"2007","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"10.1016\/j.comnet.2026.112330_b15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/1198255.1198259","article-title":"AS relationships: Inference and validation","volume":"37","author":"Dimitropoulos","year":"2007","journal-title":"Sigcomm Comput. Commun. Rev."},{"key":"10.1016\/j.comnet.2026.112330_b16","doi-asserted-by":"crossref","unstructured":"E. Gregori, A. Improta, L. Lenzini, L. Rossi, L. Sani, BGP and inter-AS economic relationships, in: Proceedings of the 10th International IFIP TC 6 Conference on Networking, Berlin, Heidelberg, ISBN: 9783642207976, 2011, pp. 54\u201367, http:\/\/dx.doi.org\/10.1007\/978-3-642-20798-3_5.","DOI":"10.1007\/978-3-642-20798-3_5"},{"key":"10.1016\/j.comnet.2026.112330_b17","doi-asserted-by":"crossref","unstructured":"Z. Jin, X. Shi, Y. Yang, X. Yin, Z. Wang, J. Wu, TopoScope: Recover AS relationships from fragmentary observations, in: Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC, Busan, Korea, ISBN: 9781450381383, 2020, pp. 266\u2013280, http:\/\/dx.doi.org\/10.1145\/3419394.3423627.","DOI":"10.1145\/3419394.3423627"},{"key":"10.1016\/j.comnet.2026.112330_b18","series-title":"IEEE 47th Conference on Local Computer Networks","first-page":"267","article-title":"Research on the derivation of AS hidden links and the discovery of critical AS","author":"Chen","year":"2022"},{"key":"10.1016\/j.comnet.2026.112330_b19","series-title":"IEEE\/IFIP Network Operations and Management Symposium","first-page":"1","article-title":"Predicting unseen links using learning-based matrix completion","author":"Zhuang","year":"2022"},{"issue":"9","key":"10.1016\/j.comnet.2026.112330_b20","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.3390\/electronics13091617","article-title":"Hidden-SAGE: For the inference of complex autonomous system business relationships involving hidden links","volume":"13","author":"Gao","year":"2024","journal-title":"Electronics"},{"key":"10.1016\/j.comnet.2026.112330_b21","doi-asserted-by":"crossref","unstructured":"M. Luckie, B. Huffaker, A. Dhamdhere, V. Giotsas, k. claffy, AS relationships, customer cones, and validation, in: Proceedings of the 2013 Internet Measurement Conference, Barcelona, Spain, ISBN: 9781450319539, 2013, pp. 243\u2013256, http:\/\/dx.doi.org\/10.1145\/2504730.2504735.","DOI":"10.1145\/2504730.2504735"},{"key":"10.1016\/j.comnet.2026.112330_b22","unstructured":"Y. Jin, C. Scott, A. Dhamdhere, V. Giotsas, A. Krishnamurthy, S. Shenker, Stable and practical AS relationship inference with problink, in: Proceedings of the 16th USENIX Conference on Networked Systems Design and Implementation, NSDI, Boston, MA, USA, ISBN: 9781931971492, 2019, pp. 581\u2013597, URL: https:\/\/api.semanticscholar.org\/CorpusID:73724927."},{"key":"10.1016\/j.comnet.2026.112330_b23","doi-asserted-by":"crossref","unstructured":"J.S. Varghese, L. Ruan, A machine learning approach to edge type inference in Internet AS graphs, in: 2016 IEEE Conference on Computer Communications Workshops, INFOCOM, San Francisco, California, USA, 2016, pp. 71\u201376, http:\/\/dx.doi.org\/10.1109\/INFCOMW.2016.7562048.","DOI":"10.1109\/INFCOMW.2016.7562048"},{"key":"10.1016\/j.comnet.2026.112330_b24","series-title":"Inferring multiple relationships between ases using graph convolutional network","author":"Peng","year":"2021"},{"key":"10.1016\/j.comnet.2026.112330_b25","series-title":"Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","first-page":"974","article-title":"Graph convolutional neural networks for web-scale recommender systems","author":"Ying","year":"2018"},{"key":"10.1016\/j.comnet.2026.112330_b26","doi-asserted-by":"crossref","DOI":"10.1145\/3308558.3313488","article-title":"Graph neural networks for social recommendation","author":"Fan","year":"2019","journal-title":"World Wide Web Conf."},{"issue":"1","key":"10.1016\/j.comnet.2026.112330_b27","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","article-title":"A comprehensive survey on graph neural networks","volume":"32","author":"Wu","year":"2021","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.comnet.2026.112330_b28","series-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2017"},{"key":"10.1016\/j.comnet.2026.112330_b29","series-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems","first-page":"1025","article-title":"Inductive representation learning on large graphs","author":"Hamilton","year":"2017"},{"key":"10.1016\/j.comnet.2026.112330_b30","series-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2018"},{"key":"10.1016\/j.comnet.2026.112330_b31","doi-asserted-by":"crossref","DOI":"10.1145\/3543507.3583340","article-title":"xGCN: An extreme graph convolutional network for large-scale social link prediction","author":"Song","year":"2023","journal-title":"Proc. ACM Web Conf. 2023"},{"key":"10.1016\/j.comnet.2026.112330_b32","doi-asserted-by":"crossref","first-page":"56083","DOI":"10.1109\/ACCESS.2023.3283029","article-title":"LeL-GNN: Learnable edge sampling and line based graph neural network for link prediction","volume":"11","author":"Morshed","year":"2023","journal-title":"IEEE Access"},{"key":"10.1016\/j.comnet.2026.112330_b33","doi-asserted-by":"crossref","unstructured":"D.P. Giakatos, S. Kostoglou, P. Sermpezis, A. Vakali, Benchmarking graph neural networks for internet routing data, in: Proceedings of the 1st International Workshop on Graph Neural Networking, GNNet, Rome Italy, ISBN: 9781450399333, 2022, pp. 1\u20136, http:\/\/dx.doi.org\/10.1145\/3565473.3569187.","DOI":"10.1145\/3565473.3569187"},{"key":"10.1016\/j.comnet.2026.112330_b34","unstructured":"Y. Chen, Q. Yin, Q. Li, Z. Liu, K. Xu, Y. Xu, M. Xu, Z. Liu, J. Wu, Learning with Semantics: Towards a Semantics-Aware Routing Anomaly Detection System, in: 33rd USENIX Security Symposium (USENIX Security), Philadelphia, PA, ISBN: 978-1-939133-44-1, 2024, pp. 5143\u20135160, URL: https:\/\/www.usenix.org\/conference\/usenixsecurity24\/presentation\/chen-yihao."},{"key":"10.1016\/j.comnet.2026.112330_b35","series-title":"Proceedings of the 1st Workshop on Next-Generation Network Observability","first-page":"13","article-title":"BGPFlow: Flow-based feature extraction for BGP anomaly detection","author":"Fu","year":"2025"},{"key":"10.1016\/j.comnet.2026.112330_b36","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2025.111753","article-title":"BGP anomaly detection using the raw internet topology","volume":"273","author":"Latif-Mart\u00ednez","year":"2025","journal-title":"Comput. Netw."},{"key":"10.1016\/j.comnet.2026.112330_b37","series-title":"STAIR","author":"Tao","year":"2025"},{"key":"10.1016\/j.comnet.2026.112330_b38","series-title":"Proceedings of the 2015 Internet Measurement Conference","first-page":"71","article-title":"Investigating interdomain routing policies in the wild","author":"Anwar","year":"2015"},{"key":"10.1016\/j.comnet.2026.112330_b39","doi-asserted-by":"crossref","unstructured":"S. Kastanakis, V. Giotsas, I. Livadariu, N. Suri, Replication: 20 Years of Inferring Interdomain Routing Policies, in: Proceedings of the 2023 ACM on Internet Measurement Conference, IMC, Montr\u00e9al, Canada, ISBN: 9798400703829, 2023, pp. 16\u201329, http:\/\/dx.doi.org\/10.1145\/3618257.3624799.","DOI":"10.1145\/3618257.3624799"},{"key":"10.1016\/j.comnet.2026.112330_b40","series-title":"The elusive Internet flattening: 10 Years of IXP growth","author":"B\u00f6ttger","year":"2018"},{"key":"10.1016\/j.comnet.2026.112330_b41","doi-asserted-by":"crossref","unstructured":"B. Augustin, B. Krishnamurthy, W. Willinger, IXPs: mapped?, in: Proceedings of the 9th ACM SIGCOMM Internet Measurement Conference, IMC, Chicago, Illinois, USA, ISBN: 9781605587714, 2009, pp. 336\u2013349, http:\/\/dx.doi.org\/10.1145\/1644893.1644934.","DOI":"10.1145\/1644893.1644934"},{"issue":"C","key":"10.1016\/j.comnet.2026.112330_b42","article-title":"Practicable route leak detection and protection with ASIRIA","volume":"211","author":"Bagnulo","year":"2022","journal-title":"Comput. Netw."},{"key":"10.1016\/j.comnet.2026.112330_b43","series-title":"Problem Definition and Classification of BGP Route Leaks","author":"Sriram","year":"2016"},{"key":"10.1016\/j.comnet.2026.112330_b44","series-title":"Routing Information Service (RIS)","author":"R\u00e9seaux IP Europ\u00e9ens Network Coordination Centre (RIPE NCC)","year":"2025"},{"key":"10.1016\/j.comnet.2026.112330_b45","series-title":"Route Views Project","author":"University of Oregon","year":"2025"},{"key":"10.1016\/j.comnet.2026.112330_b46","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2020.124289","article-title":"Link prediction techniques, applications, and performance: A survey","volume":"553","author":"Kumar","year":"2020","journal-title":"Phys. A-Statistical Mech. Appl."},{"key":"10.1016\/j.comnet.2026.112330_b47","article-title":"Clustering and preferential attachment in growing networks","volume":"64 2 Pt 2","author":"Newman","year":"2001","journal-title":"Phys. Rev. E, Stat. Nonlinear, Soft Matter Phys."},{"issue":"3\u20134","key":"10.1016\/j.comnet.2026.112330_b48","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/S0378-4371(02)00736-7","article-title":"Evolution of the social network of scientific collaborations","volume":"311","author":"Barab\u00e1si","year":"2002","journal-title":"Phys. A"},{"key":"10.1016\/j.comnet.2026.112330_b49","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","article-title":"Friends and neighbors on the web","volume":"25","author":"Adamic","year":"2003","journal-title":"Soc. Netw."},{"issue":"4","key":"10.1016\/j.comnet.2026.112330_b50","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","article-title":"Predicting missing links via local information","volume":"71","author":"Zhou","year":"2009","journal-title":"Eur. Phys. J. B"},{"issue":"18","key":"10.1016\/j.comnet.2026.112330_b51","doi-asserted-by":"crossref","first-page":"3825","DOI":"10.1016\/j.comnet.2012.10.007","article-title":"Reprint of: The anatomy of a large-scale hypertextual web search engine","volume":"56","author":"Brin","year":"2012","journal-title":"Comput. Netw."},{"key":"10.1016\/j.comnet.2026.112330_b52","article-title":"Similarity index based on local paths for link prediction of complex networks.","volume":"80 4 Pt 2","author":"L\u00fc","year":"2009","journal-title":"Phys. Rev. E, Stat. Nonlinear, Soft Matter Phys."},{"key":"10.1016\/j.comnet.2026.112330_b53","series-title":"CAIDA AS Relationships Dataset: Serial-1 All-Path Data","author":"Center for Applied Internet Data Analysis (CAIDA)","year":"2025"},{"key":"10.1016\/j.comnet.2026.112330_b54","series-title":"Proceedings of the Ninth ACM Conference on Emerging Networking Experiments and Technologies (CoNEXT)","first-page":"247","article-title":"Inferring multilateral peering","author":"Giotsas","year":"2013"},{"key":"10.1016\/j.comnet.2026.112330_b55","series-title":"CAIDA AS Relationships Dataset","author":"Center for Applied Internet Data Analysis (CAIDA)","year":"2025"},{"key":"10.1016\/j.comnet.2026.112330_b56","series-title":"2016 IEEE Trustcom\/BigDataSE\/ISPA","first-page":"228","article-title":"The power of prefix hijackings in the Internet hierarchy","author":"Yang","year":"2016"},{"key":"10.1016\/j.comnet.2026.112330_b57","doi-asserted-by":"crossref","unstructured":"K.G. Leyba, J.J. Daymude, J.-G. Young, M.E.J. Newman, J. Rexford, S. Forrest, Cutting Through the Noise to Infer Autonomous System Topology, in: IEEE Conference on Computer Communications, INFOCOM, London, United Kingdom, 2022, pp. 1609\u20131618, http:\/\/dx.doi.org\/10.1109\/INFOCOM48880.2022.9796874.","DOI":"10.1109\/INFOCOM48880.2022.9796874"},{"key":"10.1016\/j.comnet.2026.112330_b58","series-title":"Proceedings of the 21st ACM Internet Measurement Conference","first-page":"612","article-title":"How biased is our validation (data) for AS relationships?","author":"Prehn","year":"2021"},{"key":"10.1016\/j.comnet.2026.112330_b59","series-title":"2020 IEEE\/IFIP Network Operations and Management Symposium","first-page":"1","article-title":"Unveiling the type of relationship between autonomous systems using deep learning","author":"Shapira","year":"2020"},{"issue":"4","key":"10.1016\/j.comnet.2026.112330_b60","doi-asserted-by":"crossref","first-page":"4516","DOI":"10.1109\/TNSM.2022.3169638","article-title":"BGP2Vec: Unveiling the latent characteristics of autonomous systems","volume":"19","author":"Shapira","year":"2022","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"10.1016\/j.comnet.2026.112330_b61","series-title":"ASRank v2.1: Autonomous System Ranking API Documentation","author":"CAIDA","year":"2025"},{"key":"10.1016\/j.comnet.2026.112330_b62","series-title":"PeeringDB: A Community-Maintained Database for Internet Interconnection","author":"PeeringDB","year":"2025"},{"key":"10.1016\/j.comnet.2026.112330_b63","series-title":"BGP updates in 2025","author":"Huston","year":"2026"},{"key":"10.1016\/j.comnet.2026.112330_b64","series-title":"Large European routing leak sends traffic through China telecom","author":"Mutually Agreed Norms for Routing Security (MANRS)","year":"2019"},{"key":"10.1016\/j.comnet.2026.112330_b65","series-title":"BGP route leak: European traffic rerouted through China","author":"CiscoZine","year":"2019"},{"key":"10.1016\/j.comnet.2026.112330_b66","series-title":"BGP route leak incident review","author":"Catchpoint","year":"2021"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626003427?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626003427?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T11:32:07Z","timestamp":1779363127000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128626003427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":66,"alternative-id":["S1389128626003427"],"URL":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112330","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"STAIR: Towards structure-aware inference of autonomous system relationships using graph neural networks","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112330","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":"112330"}}