{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T01:51:21Z","timestamp":1772934681028,"version":"3.50.1"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,8]]},"DOI":"10.1109\/bigdata66926.2025.11401503","type":"proceedings-article","created":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T20:57:57Z","timestamp":1772830677000},"page":"752-757","source":"Crossref","is-referenced-by-count":0,"title":["Explainable Graph Neural Architecture Search via Monte-Carlo Tree Search"],"prefix":"10.1109","author":[{"given":"Yuya","family":"Sasaki","sequence":"first","affiliation":[{"name":"The University of Osaka,Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/s43588-021-00132-w"},{"key":"ref2","article-title":"Learning interpretable models through multi-objective neural architecture search","author":"Carmichael","year":"2021","journal-title":"arXiv"},{"key":"ref3","article-title":"Adaptive universal generalized pagerank graph neural network","author":"Chien","year":"2021","journal-title":"ICLR"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118916"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/s41524-021-00554-0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/195"},{"key":"ref7","article-title":"Predict then propagate: Graph neural networks meet personalized pagerank","author":"Gasteiger","year":"2019","journal-title":"ICLR"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-024-02329-7"},{"key":"ref9","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2017","journal-title":"ICLR"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_29"},{"key":"ref11","article-title":"A survey on fairness for machine learning on graphs","author":"Laclau","year":"2022","journal-title":"arXiv"},{"key":"ref12","article-title":"Random search and reproducibility for neural architecture search","author":"Li","year":"2020","journal-title":"UAI"},{"key":"ref13","article-title":"Finding global homophily in graph neural networks when meeting heterophily","author":"Li","year":"2022","journal-title":"ICML"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-63833-7_16"},{"key":"ref15","article-title":"Large scale learning on nonhomophilous graphs: New benchmarks and strong simple methods","author":"Lim","year":"2021","journal-title":"NeurIPS"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW54120.2021.00093"},{"key":"ref17","article-title":"Is heterophily a real nightmare for graph neural networks to do node classification?","author":"Luan","year":"2022","journal-title":"ICLR"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.52202\/068431-0402"},{"key":"ref19","article-title":"A simple and scalable graph neural network for large directed graphs","author":"Maekawa","year":"2023","journal-title":"arXiv"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3583558"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.26599\/TST.2021.9010057"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA250783"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.52202\/068431-0005"},{"key":"ref24","article-title":"Automl-zero: Evolving machine learning algorithms from scratch","author":"Real","year":"2020","journal-title":"ICML"},{"key":"ref25","article-title":"Interpretable neural architecture search via bayesian optimisation with weisfeiler-lehman kernels","author":"Ru","year":"2021","journal-title":"ICLR"},{"key":"ref26","article-title":"Learning to simulate complex physics with graph networks","author":"Sanchez-Gonzalez","year":"2020","journal-title":"ICML"},{"key":"ref27","article-title":"Benchmarking fairness-aware graph neural networks in knowledge graphs","author":"Sasaki","year":"2025","journal-title":"arXiv"},{"key":"ref28","author":"Sasaki","year":"2025","journal-title":"Explainable graph neural architecture search via montecarlo tree search (full version)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-032-05981-9_28"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i06.6554"},{"key":"ref31","article-title":"Representation learning on graphs with jumping knowledge networks","author":"Xu","year":"2018","journal-title":"ICML"},{"key":"ref32","article-title":"Design space for graph neural networks","author":"You","year":"2020","journal-title":"NeurIPS"},{"key":"ref33","article-title":"Dfg-nas: Ddeep and flexible graph neural architecture search","author":"Zhang","year":"2022","journal-title":"ICML"},{"key":"ref34","article-title":"Autogt: Automated graph transformer architecture search","author":"Zhang","year":"2023","journal-title":"ICLR"},{"key":"ref35","article-title":"Simplifying architecture search for graph neural network","author":"Zhao","year":"2020","journal-title":"arXiv"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583498"},{"key":"ref37","article-title":"Auto-gnn: Neural architecture search of graph neural networks","author":"Zhou","year":"2019","journal-title":"arXiv"},{"key":"ref38","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","author":"Zhu","year":"2020","journal-title":"NeurIPS"}],"event":{"name":"2025 IEEE International Conference on Big Data (BigData)","location":"Macau, China","start":{"date-parts":[[2025,12,8]]},"end":{"date-parts":[[2025,12,11]]}},"container-title":["2025 IEEE International Conference on Big Data (BigData)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11400704\/11400712\/11401503.pdf?arnumber=11401503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T07:14:35Z","timestamp":1772867675000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11401503\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/bigdata66926.2025.11401503","relation":{},"subject":[],"published":{"date-parts":[[2025,12,8]]}}}