{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T23:08:24Z","timestamp":1777072104372,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T00:00:00Z","timestamp":1657411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,10]]},"DOI":"10.1145\/3489517.3530410","type":"proceedings-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T23:19:29Z","timestamp":1661296769000},"page":"61-66","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Functionality matters in netlist representation learning"],"prefix":"10.1145","author":[{"given":"Ziyi","family":"Wang","sequence":"first","affiliation":[{"name":"CUHK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Bai","sequence":"additional","affiliation":[{"name":"CUHK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuolun","family":"He","sequence":"additional","affiliation":[{"name":"CUHK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangliang","family":"Zhang","sequence":"additional","affiliation":[{"name":"HiSilicon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Xu","sequence":"additional","affiliation":[{"name":"CUHK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsung-Yi","family":"Ho","sequence":"additional","affiliation":[{"name":"CUHK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bei","family":"Yu","sequence":"additional","affiliation":[{"name":"CUHK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Huang","sequence":"additional","affiliation":[{"name":"HiSilicon"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,8,23]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"DAC","author":"Ma Y.","year":"2019","unstructured":"Y. Ma, H. Ren, B. Khailany, H. Sikka, L. Luo, K. Natarajan, and B. Yu, \"High performance graph convolutional networks with applications in testability analysis,\" in Proc. DAC, 2019, pp. 1--6."},{"key":"e_1_3_2_1_2_1","volume-title":"High-speed adder design space exploration via graph neural processes,\" IEEE TCAD","author":"Geng H.","year":"2021","unstructured":"H. Geng, Y. Ma, Q. Xu, J. Miao, S. Roy, and B. Yu, \"High-speed adder design space exploration via graph neural processes,\" IEEE TCAD, 2021."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3451179"},{"key":"e_1_3_2_1_4_1","first-page":"67","article-title":"Wordrev: Finding word-level structures in a sea of bit-level gates","author":"Li W.","year":"2013","unstructured":"W. Li, A. Gascon, P. Subramanyan, W. Y. Tan, A. Tiwari, S. Malik, N. Shankar, and S. A. Seshia, \"Wordrev: Finding word-level structures in a sea of bit-level gates,\" in Proc. HOST. IEEE, 2013, pp. 67--74.","journal-title":"Proc. HOST. IEEE"},{"key":"e_1_3_2_1_5_1","first-page":"638","article-title":"Deep learning-based circuit recognition using sparse mapping and level-dependent decaying sum circuit representations","author":"Fayyazi A.","year":"2019","unstructured":"A. Fayyazi, S. Shababi, P. Nuzzo, S. Nazarian, and M. Pedram, \"Deep learning-based circuit recognition using sparse mapping and level-dependent decaying sum circuit representations,\" in Proc. DATE, 2019, pp. 638--641.","journal-title":"Proc. DATE"},{"key":"e_1_3_2_1_6_1","volume-title":"ICCAD","author":"He Z.","year":"2021","unstructured":"Z. He, Z. Wang, C. Bai, H. Yang, and B. YU, \"Graph learning-based arithmetic block identification,\" in Proc. ICCAD, 2021."},{"key":"e_1_3_2_1_7_1","volume-title":"ICLR","author":"Xu K.","year":"2018","unstructured":"K. Xu, W. Hu, J. Leskovec, and S. Jegelka, \"How powerful are graph neural networks?\" Proc. ICLR, 2018."},{"key":"e_1_3_2_1_8_1","first-page":"1024","volume-title":"NIPS","author":"Hamilton W.","year":"2017","unstructured":"W. Hamilton, Z. Ying, and J. Leskovec, \"Inductive representation learning on large graphs,\" in Proc. NIPS, 2017, pp. 1024--1034."},{"key":"e_1_3_2_1_9_1","volume-title":"ICLR","author":"Veli\u010dkovi\u0107 P.","year":"2018","unstructured":"P. Veli\u010dkovi\u0107, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, \"Graph attention networks,\" Proc. ICLR, 2018."},{"key":"e_1_3_2_1_10_1","first-page":"5165","volume-title":"NIPS","volume":"31","author":"Zhang M.","year":"2018","unstructured":"M. Zhang and Y. Chen, \"Link prediction based on graph neural networks,\" Proc. NIPS, vol. 31, pp. 5165--5175, 2018."},{"key":"e_1_3_2_1_11_1","first-page":"617","article-title":"Exact-K Recommendation via Maximal Clique Optimization","author":"Gong Y.","year":"2019","unstructured":"Y. Gong, Y. Zhu, L. Duan, Q. Liu, Z. Guan, F. Sun, W. Ou, and K. Q. Zhu, \"Exact-K Recommendation via Maximal Clique Optimization,\" Proc. KDD, pp. 617--626, 2019.","journal-title":"Proc. KDD"},{"key":"e_1_3_2_1_12_1","volume-title":"Deep h-gcn: Fast analog ic aging-induced degradation estimation,\" IEEE TCAD","author":"Chen T.","year":"2021","unstructured":"T. Chen, Q. Sun, C. Zhan, C. Liu, H. Yu, and B. Yu, \"Deep h-gcn: Fast analog ic aging-induced degradation estimation,\" IEEE TCAD, 2021."},{"key":"e_1_3_2_1_13_1","volume-title":"Directed acyclic graph neural networks,\" arXiv preprint arXiv:2101.07965, 01","author":"Thost V.","year":"2021","unstructured":"V. Thost and J. Chen, \"Directed acyclic graph neural networks,\" arXiv preprint arXiv:2101.07965, 01 2021."},{"key":"e_1_3_2_1_14_1","volume-title":"NIPS","author":"Zhang M.","year":"2019","unstructured":"M. Zhang, S. Jiang, Z. Cui, R. Garnett, and Y. Chen, \"D-vae: A variational autoencoder for directed acyclic graphs,\" Proc. NIPS, 2019."},{"key":"e_1_3_2_1_15_1","first-page":"15","volume-title":"NIPS","volume":"32","author":"Bachman P.","year":"2019","unstructured":"P. Bachman, R. D. Hjelm, and W. Buchwalter, \"Learning Representations by Maximizing Mutual Information Across Views,\" Proc. NIPS, vol. 32, pp. 15 535--15 545, 2019."},{"key":"e_1_3_2_1_16_1","first-page":"1597","volume-title":"ICML","author":"Chen T.","year":"2020","unstructured":"T. Chen, S. Kornblith, M. Norouzi, and G. Hinton, \"A simple framework for contrastive learning of visual representations,\" in Proc. ICML, 2020, pp. 1597--1607."},{"key":"e_1_3_2_1_17_1","first-page":"5171","volume-title":"ICML","author":"Poole B.","year":"2019","unstructured":"B. Poole, S. Ozair, A. Van Den Oord, A. Alemi, and G. Tucker, \"On variational bounds of mutual information,\" in Proc. ICML, 2019, pp. 5171--5180."},{"issue":"3","key":"e_1_3_2_1_18_1","first-page":"4","article-title":"Deep graph infomax","volume":"2","author":"Velickovic P.","year":"2019","unstructured":"P. Velickovic, W. Fedus, W. L. Hamilton, P. Li\u00f2, Y. Bengio, and R. D. Hjelm, \"Deep graph infomax,\" Proc. ICLR, vol. 2, no. 3, p. 4, 2019.","journal-title":"Proc. ICLR"},{"key":"e_1_3_2_1_19_1","first-page":"5812","volume-title":"NIPS","volume":"33","author":"You Y.","year":"2020","unstructured":"Y. You, T. Chen, Y. Sui, T. Chen, Z. Wang, and Y. Shen, \"Graph contrastive learning with augmentations,\" Proc. NIPS, vol. 33, pp. 5812--5823, 2020."},{"key":"e_1_3_2_1_20_1","first-page":"2069","article-title":"Graph contrastive learning with adaptive augmentation","author":"Zhu Y.","year":"2021","unstructured":"Y. Zhu, Y. Xu, F. Yu, Q. Liu, S. Wu, and L. Wang, \"Graph contrastive learning with adaptive augmentation,\" in The Web Conference, 2021, pp. 2069--2080.","journal-title":"The Web Conference"},{"key":"e_1_3_2_1_21_1","volume-title":"What makes for good views for contrastive learning?\" arXiv preprint arXiv:2005.10243","author":"Tian Y.","year":"2020","unstructured":"Y. Tian, C. Sun, B. Poole, D. Krishnan, C. Schmid, and P. Isola, \"What makes for good views for contrastive learning?\" arXiv preprint arXiv:2005.10243, 2020."},{"key":"e_1_3_2_1_22_1","volume-title":"What should not be contrastive in contrastive learning,\" arXiv preprint arXiv:2008.05659","author":"Xiao T.","year":"2020","unstructured":"T. Xiao, X. Wang, A. A. Efros, and T. Darrell, \"What should not be contrastive in contrastive learning,\" arXiv preprint arXiv:2008.05659, 2020."},{"key":"e_1_3_2_1_23_1","first-page":"767","article-title":"On sampling strategies for neural network-based collaborative filtering","author":"Chen T.","year":"2017","unstructured":"T. Chen, Y. Sun, Y. Shi, and L. Hong, \"On sampling strategies for neural network-based collaborative filtering,\" in Proc. KDD, 2017, pp. 767--776.","journal-title":"Proc. KDD"},{"key":"e_1_3_2_1_24_1","first-page":"1857","volume-title":"NIPS","author":"Sohn K.","year":"2016","unstructured":"K. Sohn, \"Improved deep metric learning with multi-class n-pair loss objective,\" in Proc. NIPS, 2016, pp. 1857--1865."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.12.3500"}],"event":{"name":"DAC '22: 59th ACM\/IEEE Design Automation Conference","location":"San Francisco California","acronym":"DAC '22","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA"]},"container-title":["Proceedings of the 59th ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530410","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3489517.3530410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:39Z","timestamp":1750191519000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530410"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,10]]},"references-count":25,"alternative-id":["10.1145\/3489517.3530410","10.1145\/3489517"],"URL":"https:\/\/doi.org\/10.1145\/3489517.3530410","relation":{},"subject":[],"published":{"date-parts":[[2022,7,10]]},"assertion":[{"value":"2022-08-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}