{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T05:44:27Z","timestamp":1771652667405,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"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":[[2021,10,20]]},"DOI":"10.1145\/3484272.3484963","type":"proceedings-article","created":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T16:07:41Z","timestamp":1634314061000},"page":"32-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["PaCon: a symbolic analysis approach for tactic-oriented clustering of programming submissions"],"prefix":"10.1145","author":[{"given":"Yingjie","family":"Fu","sequence":"first","affiliation":[{"name":"Peking University, China"}]},{"given":"Jonathan","family":"Osei-Owusu","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}]},{"given":"Angello","family":"Astorga","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7231-7416","authenticated-orcid":false,"given":"Zirui Neil","family":"Zhao","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Peking University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6731-216X","authenticated-orcid":false,"given":"Tao","family":"Xie","sequence":"additional","affiliation":[{"name":"Peking University, China"}]}],"member":"320","published-online":{"date-parts":[[2021,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180219"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2015.172"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2993270.2993271"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41540-6_21"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33263-0_31"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699751"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2634273"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635912"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192387"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3051457.3051467"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2019.00044"},{"key":"e_1_3_2_1_12_1","unstructured":"JetBrains. 2021. DupFinder Command-line Tool. https:\/\/www.jetbrains.com\/help\/resharper\/dupFinder.html  JetBrains. 2021. DupFinder Command-line Tool. https:\/\/www.jetbrains.com\/help\/resharper\/dupFinder.html"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2691352.2691356"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360252"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2889160.2889202"},{"key":"e_1_3_2_1_16_1","unstructured":"Microsoft. 2021. Near-Duplicate Code Detector. https:\/\/github.com\/microsoft\/near-duplicate-code-detector  Microsoft. 2021. Near-Duplicate Code Detector. https:\/\/github.com\/microsoft\/near-duplicate-code-detector"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2019.00030"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314629"},{"key":"e_1_3_2_1_19_1","unstructured":"Online Course Report. 2017. The 50 Most Popular MOOCs of All Time. https:\/\/www.onlinecoursereport.com\/the-50-most-popular-moocs-of-all-time\/  Online Course Report. 2017. The 50 Most Popular MOOCs of All Time. https:\/\/www.onlinecoursereport.com\/the-50-most-popular-moocs-of-all-time\/"},{"key":"e_1_3_2_1_20_1","unstructured":"Microsoft Research. 2021. The Z3 Theorem Prover. https:\/\/github.com\/Z3Prover\/z3  Microsoft Research. 2021. The Z3 Theorem Prover. https:\/\/github.com\/Z3Prover\/z3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2017.44"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93846-2_60"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462195"},{"key":"e_1_3_2_1_24_1","unstructured":"Tangible Software Solutions. 2004. C++ to C# Converter. https:\/\/www.tangiblesoftwaresolutions.com\/product_details\/cplusplus_to_csharp_converter_details.html  Tangible Software Solutions. 2004. C++ to C# Converter. https:\/\/www.tangiblesoftwaresolutions.com\/product_details\/cplusplus_to_csharp_converter_details.html"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79124-9_10"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081706.1081749"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192384"},{"key":"e_1_3_2_1_28_1","volume-title":"Category: Stable sorts. https:\/\/en.wikipedia.org\/wiki\/Category:Stable_sorts","year":"2020","unstructured":"Wikipedia. 2020 . Category: Stable sorts. https:\/\/en.wikipedia.org\/wiki\/Category:Stable_sorts Wikipedia. 2020. Category: Stable sorts. https:\/\/en.wikipedia.org\/wiki\/Category:Stable_sorts"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3106237.3106262"}],"event":{"name":"SPLASH '21: Software for Humanity","location":"Chicago IL USA","acronym":"SPLASH '21","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2021 ACM SIGPLAN International Symposium on SPLASH-E"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3484272.3484963","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3484272.3484963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:41Z","timestamp":1750191101000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3484272.3484963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":29,"alternative-id":["10.1145\/3484272.3484963","10.1145\/3484272"],"URL":"https:\/\/doi.org\/10.1145\/3484272.3484963","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]},"assertion":[{"value":"2021-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}