{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T12:59:46Z","timestamp":1770814786674,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:00:00Z","timestamp":1652659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery Grant","award":["RGPIN-2019-05071"],"award-info":[{"award-number":["RGPIN-2019-05071"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,5,16]]},"DOI":"10.1145\/3524610.3528387","type":"proceedings-article","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T15:19:30Z","timestamp":1666279170000},"page":"614-618","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A first look at duplicate and near-duplicate self-admitted technical debt comments"],"prefix":"10.1145","author":[{"given":"Jerin","family":"Yasmin","sequence":"first","affiliation":[{"name":"Queen's University, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Sadegh","family":"Sheikhaei","sequence":"additional","affiliation":[{"name":"Queen's University, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Tian","sequence":"additional","affiliation":[{"name":"Queen's University, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,10,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2901739.2901742"},{"key":"e_1_3_2_1_2_1","unstructured":"Martin Ester Hans-Peter Kriegel J\u00f6rg Sander Xiaowei Xu etal 1996. A density-based algorithm for discovering clusters in large spatial databases with noise.. In kdd Vol. 96. 226--231.  Martin Ester Hans-Peter Kriegel J\u00f6rg Sander Xiaowei Xu et al. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise.. In kdd Vol. 96. 226--231."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSR52588.2021.00052"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3468264.3468553"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447247"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-017-9522-4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2014.12.027"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183440.3183478"},{"key":"e_1_3_2_1_9_1","volume-title":"Automated Identification of On-hold Self-admitted Technical Debt. CoRR abs\/2009.13113","author":"Maipradit Rungroj","year":"2020","unstructured":"Rungroj Maipradit , Bin Lin , Csaba Nagy , Gabriele Bavota , Michele Lanza , Hideaki Hata , and Kenichi Matsumoto . 2020. Automated Identification of On-hold Self-admitted Technical Debt. CoRR abs\/2009.13113 ( 2020 ). arXiv:2009.13113 https:\/\/arxiv.org\/abs\/2009.13113 Rungroj Maipradit, Bin Lin, Csaba Nagy, Gabriele Bavota, Michele Lanza, Hideaki Hata, and Kenichi Matsumoto. 2020. Automated Identification of On-hold Self-admitted Technical Debt. CoRR abs\/2009.13113 (2020). arXiv:2009.13113 https:\/\/arxiv.org\/abs\/2009.13113"},{"key":"e_1_3_2_1_10_1","first-page":"72","article-title":"Rework effort estimation of self-admitted technical debt","volume":"1771","author":"Mensah Solomon","year":"2016","unstructured":"Solomon Mensah , Jacky Keung , Michael Franklin Bosu , and Kwabena Ebo Bennin . 2016 . Rework effort estimation of self-admitted technical debt . CEUR Workshop Proceedings 1771 (2016), 72 -- 75 . http:\/\/ceur-ws.org\/Vol-1771\/ Joint of the 4th International Workshop on Quantitative Approaches to Software Quality, QuASoQ 2016 and 1st International Workshop on Technical Debt Analytics, TDA 2016; Conference date: 06-12-2016. Solomon Mensah, Jacky Keung, Michael Franklin Bosu, and Kwabena Ebo Bennin. 2016. Rework effort estimation of self-admitted technical debt. CEUR Workshop Proceedings 1771 (2016), 72--75. http:\/\/ceur-ws.org\/Vol-1771\/ Joint of the 4th International Workshop on Quantitative Approaches to Software Quality, QuASoQ 2016 and 1st International Workshop on Technical Debt Analytics, TDA 2016; Conference date: 06-12-2016.","journal-title":"CEUR Workshop Proceedings"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2017.09.026"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2018.8330196"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387904.3389262"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2014.31"},{"key":"e_1_3_2_1_15_1","volume-title":"NICAD: Accurate detection of near-miss intentional clones using flexible pretty-printing and code normalization. In 2008 16th iEEE international conference on program comprehension","author":"Roy Chanchal K","year":"2008","unstructured":"Chanchal K Roy and James R Cordy . 2008 . NICAD: Accurate detection of near-miss intentional clones using flexible pretty-printing and code normalization. In 2008 16th iEEE international conference on program comprehension . IEEE , 172--181. Chanchal K Roy and James R Cordy. 2008. NICAD: Accurate detection of near-miss intentional clones using flexible pretty-printing and code normalization. In 2008 16th iEEE international conference on program comprehension. IEEE, 172--181."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSTW.2009.18"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2019.02.056"},{"key":"e_1_3_2_1_18_1","volume-title":"MSR Mining Challenge: The SmartSHARK Repository Mining Data. arXiv preprint arXiv:2102.11540","author":"Trautsch Alexander","year":"2021","unstructured":"Alexander Trautsch , Fabian Trautsch , and Steffen Herbold . 2021. MSR Mining Challenge: The SmartSHARK Repository Mining Data. arXiv preprint arXiv:2102.11540 ( 2021 ). Alexander Trautsch, Fabian Trautsch, and Steffen Herbold. 2021. MSR Mining Challenge: The SmartSHARK Repository Mining Data. arXiv preprint arXiv:2102.11540 (2021)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491420"},{"key":"e_1_3_2_1_20_1","volume-title":"Breakthroughs in statistics","author":"Wilcoxon Frank","unstructured":"Frank Wilcoxon . 1992. Individual comparisons by ranking methods . In Breakthroughs in statistics . Springer , 196--202. Frank Wilcoxon. 1992. Individual comparisons by ranking methods. In Breakthroughs in statistics. Springer, 196--202."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3379597.3387459"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-021-10031-3"}],"event":{"name":"ICPC '22: 30th International Conference on Program Comprehension","location":"Virtual Event","acronym":"ICPC '22","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"]},"container-title":["Proceedings of the 30th IEEE\/ACM International Conference on Program Comprehension"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3524610.3528387","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3524610.3528387","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:53Z","timestamp":1750183793000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3524610.3528387"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,16]]},"references-count":22,"alternative-id":["10.1145\/3524610.3528387","10.1145\/3524610"],"URL":"https:\/\/doi.org\/10.1145\/3524610.3528387","relation":{},"subject":[],"published":{"date-parts":[[2022,5,16]]},"assertion":[{"value":"2022-10-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}