<?xml version="1.0" encoding="UTF-8"?><doi_batch version="4.3.7" xmlns="http://www.crossref.org/schema/4.3.7" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.crossref.org/schema/4.3.7 http://www.crossref.org/schema/deposit/crossref4.3.7.xsd">
		<head>
		<doi_batch_id>iamrp.net-5nIx-1791491021-d541999886</doi_batch_id>
		<timestamp>1791491021</timestamp>
		<depositor>
			<depositor_name>Institute for Advanced Materials Research Press</depositor_name>
			<email_address>info@iamrp.net</email_address>
		</depositor>
		<registrant>Institute for Advanced Materials Research Press</registrant>
	</head>
	<body>
		<journal>
			<journal_metadata>
				<full_title>Journal of Computational and Data-Driven Materials Engineering</full_title>
				<abbrev_title>J. Comput. Data-Driven Mater. Eng.</abbrev_title>
				<issn>3149-9368</issn>
			</journal_metadata>
			<journal_issue>
				<publication_date>
					<year>2023</year>
				</publication_date>
				<journal_volume>
					<volume>2</volume>
				</journal_volume>
				<issue>2</issue>
			</journal_issue>
			<journal_article publication_type="full_text">
				<titles>
					<title>Vanishing Gradients in Deep Materials GNNs: Theoretical Depth Limits for Property Prediction</title>
				</titles>
								<contributors>
          					<person_name sequence="first" contributor_role="author">
            <given_name>Oliver</given_name>
            <surname>Grant</surname>
					</person_name>
          					<person_name sequence="additional" contributor_role="author">
            <given_name>David</given_name>
            <surname>Clark</surname>
					</person_name>
          					<person_name sequence="additional" contributor_role="author">
            <given_name>Sophia</given_name>
            <surname>Nguyen</surname>
					</person_name>
          				</contributors>
								<publication_date>
					<year>2023</year>
				</publication_date>
				<doi_data>
					<doi>10.68159/d541999886</doi>
					<resource>https://iamrp.net/pub/journal/2/article/d541999886</resource>
				</doi_data>
				<citation_list>
          					<citation key="rk-10.68159/d541999886-2a874475-2ae3-4412-aace-da1312d0affd">
					  <unstructured_citation>Chen C, Ye W, Zuo Y, Zheng C, Ong SP. Graph networks as a universal machine learning framework for molecules and crystals. Chem Mater. 2019;31(9):3564-72.</unstructured_citation>
						 <doi>10.1021/acs.chemmater.9b01294</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-dd9696e0-1c8d-4aa7-a817-d1983353c0bb">
					  <unstructured_citation>Xie T, Grossman JC. Crystal graph convolutional neural networks for an accurate and interpretable prediction of material properties. Phys Rev Lett. 2018;120(14):145301.</unstructured_citation>
						 <doi>10.1103/PhysRevLett.120.145301</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-1591ac6c-c924-42e2-b43d-f717d6af4db5">
					  <unstructured_citation>Wu Z, Pan S, Chen F, Long G, Zhang C, Yu PS. A comprehensive survey on graph neural networks. IEEE Trans Neural Netw Learn Syst. 2021;32(1):4-24.</unstructured_citation>
						 <doi>10.1109/TNNLS.2020.2978386</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-7cb2e405-f2e6-490e-96cf-d985ae3a47a4">
					  <unstructured_citation>Batzner S, Musaelian A, Sun L, Geiger M, Mailoa JP, Kornbluth M, et al. E(3)-equivariant graph neural networks for data-efficient and accurate interatomic potentials. Nat Commun. 2022;13(1):2453.</unstructured_citation>
						 <doi>10.1038/s41467-022-29939-5</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-88dfedc7-6e81-4884-8dd2-ebff572cab6d">
					  <unstructured_citation>Xu K, Li J, Zhang M, Du SS, Kawarabayashi KI, Jegelka S. What can neural networks reason about? [Preprint]. arXiv; 2019.</unstructured_citation>
						 <doi>10.48550/arXiv.1905.13211</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-00a8fcdc-de7b-4aca-857b-ce89b47d3436">
					  <unstructured_citation>Xu K, Hu W, Leskovec J, Jegelka S. How powerful are graph neural networks? [Preprint]. arXiv; 2018.</unstructured_citation>
						 <doi>10.48550/arXiv.1810.00826</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-9dc0b40e-af77-4f28-aa82-b1b91b5086b5">
					  <unstructured_citation>Alon U, Yahav E. On the bottleneck of graph neural networks and its practical implications [Preprint]. arXiv; 2020.</unstructured_citation>
						 <doi>10.48550/arXiv.2006.05205</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-f237a91b-5ce3-4637-ab15-378bd00ddb0c">
					  <unstructured_citation>Zhang B, Luo S, Wang L, He D. Rethinking the expressive power of GNNs via graph biconnectivity [Preprint]. arXiv; 2023.</unstructured_citation>
						 <doi>10.48550/arXiv.2301.09505</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-8514503d-7f31-4e74-9d56-e4b240f8ea70">
					  <unstructured_citation>Omee SS, Louis SY, Fu N, Wei L, Dey S, Dong R, et al. Scalable deeper graph neural networks for high-performance materials property prediction. Patterns. 2022;3(5):100491.</unstructured_citation>
						 <doi>10.1016/j.patter.2022.100491</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-acef03fa-8ac1-4f85-be52-3f47decc2986">
					  <unstructured_citation>Li Q, Han Z, Wu XM. Deeper insights into graph convolutional networks for semi-supervised learning. Proc AAAI Conf Artif Intell. 2018;32(1):3538-45.</unstructured_citation>
						 <doi>10.1609/aaai.v32i1.11604</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-f7b2bf39-f5e9-4783-b88b-6b0349fbd48d">
					  <unstructured_citation>Jaiswal A, Wang P, Chen T, Rousseau J, Ding Y, Wang Z. Old can be gold: Better gradient flow can make vanilla-GCNs great again. Adv Neural Inf Process Syst. 2022;35:7561-74.</unstructured_citation>
						 <doi>10.52202/068431-0549</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-d30f39bd-ef2f-4dc3-aff2-989400c80075">
					  <unstructured_citation>Chen M, Wei Z, Huang Z, Ding B, Li Y. Simple and deep graph convolutional networks. Proc Mach Learn Res. 2020;119:1725-35.</unstructured_citation>
											</citation>
          					<citation key="rk-10.68159/d541999886-69504489-424e-4fb3-843c-0e6f710efec3">
					  <unstructured_citation>Li G, Müller M, Thabet A, Ghanem B. DeepGCNs: Can GCNs go as deep as CNNs? Proc IEEE/CVF Int Conf Comput Vis. 2019:9267-76.</unstructured_citation>
						 <doi>10.1109/ICCV.2019.00936</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-e09e1756-7a7e-47be-ba1d-23ab923a5ced">
					  <unstructured_citation>Liu M, Gao H, Ji S. Towards deeper graph neural networks. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery &amp; data mining; 2020. New York: ACM; 2020. p. 338-48.</unstructured_citation>
						 <doi>10.1145/3394486.3403076</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-f19a2595-be13-43da-968d-60441ffda759">
					  <unstructured_citation>Gasteiger J, Weißenberger S, Günnemann S. Diffusion improves graph learning. Adv Neural Inf Process Syst. 2019;32:13366-78.</unstructured_citation>
						 <doi>10.5555/3454287.3455484</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-4098b1b5-b08d-49c7-8057-517a06ae46be">
					  <unstructured_citation>Rusch TK, Bronstein MM, Mishra S. A survey on oversmoothing in graph neural networks [Preprint]. arXiv; 2023.</unstructured_citation>
						 <doi>10.48550/arXiv.2303.10993</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-b69823e5-240d-478f-a918-9df1ad73846a">
					  <unstructured_citation>Jiang B, Zhang Z, Lin D, Tang J, Luo B. Semi-supervised learning with graph learning-convolutional networks. Proc IEEE/CVF Conf Comput Vis Pattern Recognit. 2019:11313-20.</unstructured_citation>
						 <doi>10.1109/CVPR.2019.01157</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-f20ff8a7-75f9-45b7-88da-1e49ad976311">
					  <unstructured_citation>Gilmer J, Schoenholz SS, Riley PF, Vinyals O, Dahl GE. Neural message passing for quantum chemistry. Proc Mach Learn Res. 2017;70:1263-72.</unstructured_citation>
											</citation>
          					<citation key="rk-10.68159/d541999886-3174077f-815c-4e76-bfcb-7f42d9d32e54">
					  <unstructured_citation>Veličković P, Cucurull G, Casanova A, Romero A, Liò P, Bengio Y. Graph attention networks. In: International conference on learning representations; 2018.</unstructured_citation>
											</citation>
          					<citation key="rk-10.68159/d541999886-51c576f9-1101-45f2-bc6d-310ba526048d">
					  <unstructured_citation>Di Giovanni F, Rowbottom J, Chamberlain BP, Markovich T, Bronstein MM. Graph neural networks as gradient flows: Understanding graph convolutions via energy [Preprint]. arXiv; 2022.</unstructured_citation>
						 <doi>10.48550/arXiv.2206.10991</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-df4069e1-7401-46c9-824b-6acfe779a589">
					  <unstructured_citation>Bezdan T, Bačanin Džakula N. Convolutional neural network layers and architectures. In: Sinteza 2019 - International scientific conference on information technology and data related research; 2019; Belgrade, Serbia. Belgrade: Singidunum University; 2019. p. 445-51.</unstructured_citation>
						 <doi>10.15308/Sinteza-2019-445-451</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-927e2b74-afe8-4d1a-aa40-bcd5d671d572">
					  <unstructured_citation>Chen D, Lin Y, Li W, Li P, Zhou J, Sun X. Measuring and relieving the over-smoothing problem for graph neural networks from the topological view. Proc AAAI Conf Artif Intell. 2020;34(04):3438-45.</unstructured_citation>
						 <doi>10.1609/aaai.v34i04.5747</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-702447a6-9396-4a48-b020-8ed08cb8c91c">
					  <unstructured_citation>Rong Y, Huang W, Xu T, Huang J. DropEdge: Towards deep graph convolutional networks on node classification [Preprint]. arXiv; 2019.</unstructured_citation>
						 <doi>10.48550/arXiv.1907.10903</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-ea868d64-1162-45e9-96fe-7b72fca6353f">
					  <unstructured_citation>Wu F, Souza A, Zhang T, Fifty C, Yu T, Weinberger K. Simplifying graph convolutional networks. Proc Mach Learn Res. 2019;97:6861-71.</unstructured_citation>
											</citation>
          					<citation key="rk-10.68159/d541999886-90d14aa7-f684-4d02-8615-00a9d828af74">
					  <unstructured_citation>Hoang NT, Maehara T. Revisiting graph neural networks: All we have is low-pass filters [Preprint]. arXiv; 2019.</unstructured_citation>
						 <doi>10.48550/arXiv.1905.09550</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-5e51d65b-e814-4105-845b-28077452f805">
					  <unstructured_citation>Ma Y, Liu X, Zhao T, Liu Y, Tang J, Shah N. A unified view on graph neural networks as graph signal denoising. In: Proceedings of the 30th ACM international conference on information &amp; knowledge management; 2021. New York: ACM; 2021. p. 1202-11.</unstructured_citation>
						 <doi>10.1145/3459637.3482225</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-9afe7604-83a0-45f1-b334-288e027fdd3f">
					  <unstructured_citation>Bodnar C, Di Giovanni F, Chamberlain BP, Liò P, Bronstein MM. Neural sheaf diffusion: A topological perspective on heterophily and oversmoothing in GNNs. Adv Neural Inf Process Syst. 2022;35:18527-41.</unstructured_citation>
						 <doi>10.52202/068431-1346</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-6a58d866-9b38-4579-87e4-15565a926b96">
					  <unstructured_citation>Zhao L, Härtel L, Shah N, Akoglu L. A practical, progressively-expressive GNN. Adv Neural Inf Process Syst. 2022;35:34106-20.</unstructured_citation>
						 <doi>10.52202/068431-2472</doi> 					</citation>
          					<citation key="rk-10.68159/d541999886-a4ef53e8-a939-4448-9448-dff780bd2092">
					  <unstructured_citation>Hu W, Liu B, Gomes J, Zitnik M, Liang P, Pande V, et al. Strategies for pre-training graph neural networks [Preprint]. arXiv; 2019.</unstructured_citation>
						 <doi>10.48550/arXiv.1905.12265</doi> 					</citation>
          				</citation_list>
			</journal_article>
		</journal>
	</body>
</doi_batch>
