{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,21]],"date-time":"2026-11-21T19:39:24Z","timestamp":1795289964828,"version":"4.10.3"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T00:00:00Z","timestamp":1654905600000},"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,6,11]]},"DOI":"10.1145\/3545258.3545267","type":"proceedings-article","created":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T12:09:39Z","timestamp":1663243779000},"page":"117-126","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Untangling Composite Commits by Attributed Graph Clustering"],"prefix":"10.1145","author":[{"given":"Siyu","family":"Chen","sequence":"first","affiliation":[{"name":"Nanjing University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shengbin","family":"Xu","sequence":"additional","affiliation":[{"name":"Nanjing University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuan","family":"Yao","sequence":"additional","affiliation":[{"name":"Nanjing University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Xu","sequence":"additional","affiliation":[{"name":"Nanjing University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,9,15]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"International Conference on Learning Representations.","author":"Allamanis Miltiadis","year":"2018","unstructured":"Miltiadis Allamanis , Marc Brockschmidt , and Mahmoud Khademi . 2018 . Learning to Represent Programs with Graphs . In International Conference on Learning Representations. Miltiadis Allamanis, Marc Brockschmidt, and Mahmoud Khademi. 2018. Learning to Represent Programs with Graphs. In International Conference on Learning Representations."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2015.35"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380214"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_52"},{"key":"e_1_3_2_1_5_1","unstructured":"John\u00a0Joseph Carrasco Daniel\u00a0C Fain Kevin\u00a0J Lang and Leonid Zhukov. 2003. Clustering of bipartite advertiser-keyword graph. (2003).  John\u00a0Joseph Carrasco Daniel\u00a0C Fain Kevin\u00a0J Lang and Leonid Zhukov. 2003. Clustering of bipartite advertiser-keyword graph. (2003)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236024.3236042"},{"key":"e_1_3_2_1_7_1","volume-title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In North American","author":"Devlin Jacob","year":"2019","unstructured":"Jacob Devlin , Ming-Wei Chang , Kenton Lee , and Kristina Toutanova . 2019 . BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In North American Chapter of the Association for Computational Linguistics: Human Language Technologies, ( NAACL-HLT) . 4171\u20134186. Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In North American Chapter of the Association for Computational Linguistics: Human Language Technologies, (NAACL-HLT). 4171\u20134186."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2015.7081844"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/24039.24041"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.989932"},{"key":"e_1_3_2_1_11_1","volume-title":"Clustering by passing messages between data points. science 315, 5814","author":"Frey J","year":"2007","unstructured":"Brendan\u00a0 J Frey and Delbert Dueck . 2007. Clustering by passing messages between data points. science 315, 5814 ( 2007 ), 972\u2013976. Brendan\u00a0J Frey and Delbert Dueck. 2007. Clustering by passing messages between data points. science 315, 5814 (2007), 972\u2013976."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208688"},{"key":"e_1_3_2_1_13_1","volume-title":"Vol.\u00a01","author":"Guo Bo","unstructured":"Bo Guo and Myoungkyu Song . 2017. Interactively decomposing composite changes to support code review and regression testing. In 2017 IEEE 41st annual computer software and applications conference (COMPSAC) , Vol.\u00a01 . IEEE , 118\u2013127. Bo Guo and Myoungkyu Song. 2017. Interactively decomposing composite changes to support code review and regression testing. In 2017 IEEE 41st annual computer software and applications conference (COMPSAC), Vol.\u00a01. IEEE, 118\u2013127."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/2346830"},{"key":"e_1_3_2_1_15_1","unstructured":"Steffen Herbold Alexander Trautsch Benjamin Ledel Alireza Aghamohammadi Taher\u00a0Ahmed Ghaleb Kuljit\u00a0Kaur Chahal Tim Bossenmaier Bhaveet Nagaria Philip Makedonski Matin\u00a0Nili Ahmadabadi 2020. A Fine-grained Data Set and Analysis of Tangling in Bug Fixing Commits. arXiv preprint arXiv:2011.06244(2020).  Steffen Herbold Alexander Trautsch Benjamin Ledel Alireza Aghamohammadi Taher\u00a0Ahmed Ghaleb Kuljit\u00a0Kaur Chahal Tim Bossenmaier Bhaveet Nagaria Philip Makedonski Matin\u00a0Nili Ahmadabadi 2020. A Fine-grained Data Set and Analysis of Tangling in Bug Fixing Commits. arXiv preprint arXiv:2011.06244(2020)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-015-9376-6"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSR.2013.6624018"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902362"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676696"},{"key":"e_1_3_2_1_20_1","volume-title":"International Conference on Learning Representations.","author":"Kipf N","year":"2017","unstructured":"Thomas\u00a0 N Kipf and Max Welling . 2017 . Semi-supervised classification with graph convolutional networks . In International Conference on Learning Representations. Thomas\u00a0N Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/APSEC.2016.028"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTACC.2017.26"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.9790\/3021-0204719725"},{"key":"e_1_3_2_1_25_1","volume-title":"2018 IEEE 18th International Working Conference on Source Code Analysis and Manipulation (SCAM). IEEE, 193\u2013202","author":"Muylaert Ward","year":"2018","unstructured":"Ward Muylaert and Coen De\u00a0Roover . 2018 . Untangling composite commits using program slicing . In 2018 IEEE 18th International Working Conference on Source Code Analysis and Manipulation (SCAM). IEEE, 193\u2013202 . Ward Muylaert and Coen De\u00a0Roover. 2018. Untangling composite commits using program slicing. In 2018 IEEE 18th International Working Conference on Source Code Analysis and Manipulation (SCAM). IEEE, 193\u2013202."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2015.336"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2013.6698913"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2019.00089"},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. 63\u201374","author":"P\u00e2r\u021bachi Profir-Petru","year":"2020","unstructured":"Profir-Petru P\u00e2r\u021bachi , Santanu\u00a0Kumar Dash , Miltiadis Allamanis , and Earl\u00a0 T Barr . 2020 . Flexeme: Untangling commits using lexical flows . In Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. 63\u201374 . Profir-Petru P\u00e2r\u021bachi, Santanu\u00a0Kumar Dash, Miltiadis Allamanis, and Earl\u00a0T Barr. 2020. Flexeme: Untangling commits using lexical flows. In Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. 63\u201374."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3468264.3468551"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360596"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2018.00018"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2393596.2393656"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSR.2015.24"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8916"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/509"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2019.00101"},{"key":"e_1_3_2_1_38_1","unstructured":"Wenhan Wang Kechi Zhang Ge Li and Zhi Jin. 2021. Learning to Represent Programs with Heterogeneous Graphs. (2021).  Wenhan Wang Kechi Zhang Ge Li and Zhi Jin. 2021. Learning to Represent Programs with Heterogeneous Graphs. (2021)."},{"key":"e_1_3_2_1_39_1","volume-title":"International Conference on Learning Representations.","author":"Xu Keyulu","year":"2019","unstructured":"Keyulu Xu , Weihua Hu , Jure Leskovec , and Stefanie Jegelka . 2019 . How Powerful are Graph Neural Networks? . In International Conference on Learning Representations. Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2019. How Powerful are Graph Neural Networks?. In International Conference on Learning Representations."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.44"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SANER48275.2020.9054861"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2019.00086"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/601"},{"key":"e_1_3_2_1_44_1","volume-title":"Devign: Effective vulnerability identification by learning comprehensive program semantics via graph neural networks. Advances in neural information processing systems 32","author":"Zhou Yaqin","year":"2019","unstructured":"Yaqin Zhou , Shangqing Liu , Jingkai Siow , Xiaoning Du , and Yang Liu . 2019 . Devign: Effective vulnerability identification by learning comprehensive program semantics via graph neural networks. Advances in neural information processing systems 32 (2019). Yaqin Zhou, Shangqing Liu, Jingkai Siow, Xiaoning Du, and Yang Liu. 2019. Devign: Effective vulnerability identification by learning comprehensive program semantics via graph neural networks. Advances in neural information processing systems 32 (2019)."}],"event":{"name":"Internetware 2022: 13th Asia-Pacific Symposium on Internetware","location":"Hohhot China","acronym":"Internetware 2022"},"container-title":["Proceedings of the 13th Asia-Pacific Symposium on Internetware"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545258.3545267","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3545258.3545267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T15:02:45Z","timestamp":1750172565000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545258.3545267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,11]]},"references-count":43,"alternative-id":["10.1145\/3545258.3545267","10.1145\/3545258"],"URL":"https:\/\/doi.org\/10.1145\/3545258.3545267","relation":{},"subject":[],"published":{"date-parts":[[2022,6,11]]},"assertion":[{"value":"2022-09-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}