{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:57:15Z","timestamp":1770274635198,"version":"3.49.0"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LZ25F020003"],"award-info":[{"award-number":["LZ25F020003"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202420"],"award-info":[{"award-number":["62202420"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62302437"],"award-info":[{"award-number":["62302437"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018735","name":"Ant Group","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100018735","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Research Foundation, under its Investigatorship","award":["NRF-NRFI08-2022-0002"],"award-info":[{"award-number":["NRF-NRFI08-2022-0002"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IIEEE Trans. Software Eng."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1109\/tse.2025.3592823","type":"journal-article","created":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T17:56:44Z","timestamp":1753466204000},"page":"2566-2582","source":"Crossref","is-referenced-by-count":3,"title":["Enhancing Project-Specific Code Completion by Inferring Internal API Information"],"prefix":"10.1109","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4549-5469","authenticated-orcid":false,"given":"Le","family":"Deng","sequence":"first","affiliation":[{"name":"State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5526-1617","authenticated-orcid":false,"given":"Xiaoxia","family":"Ren","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2906-0598","authenticated-orcid":false,"given":"Chao","family":"Ni","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3622-1510","authenticated-orcid":false,"given":"Ming","family":"Liang","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4367-7201","authenticated-orcid":false,"given":"David","family":"Lo","sequence":"additional","affiliation":[{"name":"School of Computing and Information Systems, Singapore Management University, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1981-1626","authenticated-orcid":false,"given":"Zhongxin","family":"Liu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China"}]}],"member":"263","reference":[{"key":"ref1","article-title":"CodeGen: An open large language model for code with multi-turn program synthesis","author":"Nijkamp","year":"2022"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1108\/ws.2000.07949fab.004"},{"key":"ref3","article-title":"StarCoder 2 and the Stack v2: The next generation","author":"Lozhkov","year":"2024"},{"key":"ref4","article-title":"DeepSeek-Coder: When the large language model meets programming\u2013the rise of code intelligence","author":"Guo","year":"2024"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599790"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2025.findings-acl.1009"},{"key":"ref7","article-title":"Code Llama: Open foundation models for code","author":"Rozi\u00e8re","year":"2023"},{"key":"ref8","article-title":"Github copilot","year":"2021"},{"key":"ref9","article-title":"Amazon CodeWhisperer","year":"2023"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1145\/3196398.3196408","article-title":"Learning to mine aligned code and natural language pairs from stack overflow","volume-title":"Proc. 15th Int. Conf. Mining Softw. Repositories","author":"Yin","year":"2018"},{"key":"ref11","article-title":"Evaluating large language models trained on code","author":"Chen","year":"2021"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.emnlp-main.151"},{"key":"ref13","article-title":"CoCoMIC: Code completion by jointly modeling in-file and cross-file context","author":"Ding","year":"2022"},{"key":"ref14","first-page":"31693","article-title":"Repository-level prompt generation for large language models of code","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Shrivastava","year":"2023"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-long.431"},{"key":"ref16","article-title":"RepoFusion: Training code models to understand your repository","author":"Shrivastava","year":"2023"},{"key":"ref17","article-title":"REPOFUSE: Repository-level code completion with fused dual context","author":"Liang","year":"2024"},{"key":"ref18","article-title":"RepoHyper: Better context retrieval is all you need for repository-level code completion","author":"Phan","year":"2024"},{"key":"ref19","first-page":"9459","article-title":"Retrieval-augmented generation for knowledge-intensive NLP tasks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Lewis","year":"2020"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/icse-seip66354.2025.00055"},{"key":"ref21","article-title":"RepoBench: Benchmarking repository-level code auto-completion systems","author":"Liu","year":"2023"},{"key":"ref22","first-page":"46701","article-title":"CrossCodeEval: A diverse and multilingual benchmark for cross-file code completion","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Ding","year":"2024"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3597503.3623316"},{"key":"ref24","article-title":"DevEval: Evaluating code generation in practical software projects","author":"Li","year":"2024"},{"key":"ref25","first-page":"3082","article-title":"Learning to break the loop: Analyzing and mitigating repetitions for neural text generation","volume-title":"Proc. Advances in Neural Inf. Process. Syst.","volume":"35","author":"Xu","year":"2022"},{"key":"ref26","article-title":"Treesitter: An incremental parsing system for programming tools","year":"2018"},{"key":"ref27","article-title":"Pep 8 \u2013 Style guide for Python code","author":"Guido van Rossum","year":"2001"},{"key":"ref28","article-title":"The appendix of the paper","author":"Deng","year":"2001"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-long.499"},{"key":"ref30","article-title":"A survey on in-context learning","author":"Dong","year":"2022"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.findings-emnlp.624"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.387"},{"key":"ref33","article-title":"REPOFORMER: Selective retrieval for repository-level code completion","author":"Wu","year":"2024"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-8137.1912.tb05611.x"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(88)90021-0"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/icse55347.2025.00014"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1561\/1500000019"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-demos.6"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3600006.3613165"},{"issue":"8","key":"ref40","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Soviet Phys. Doklady"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3611643.3616280"},{"key":"ref42","first-page":"1258","article-title":"HITS: High-coverage LLM-based unit test generation via method slicing","volume-title":"Proc. 39th IEEE\/ACM Int. Conf. Automated Softw. Eng.","author":"Wang","year":"2024"},{"key":"ref43","article-title":"Claude 3.7 sonnet","year":"2025"},{"key":"ref44","article-title":"Guiding language models of code with global context using monitors","author":"Agrawal","year":"2023"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3714462"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-acl.138"}],"container-title":["IEEE Transactions on Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/32\/11172729\/11096713.pdf?arnumber=11096713","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T17:37:10Z","timestamp":1758303430000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11096713\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":46,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tse.2025.3592823","relation":{},"ISSN":["0098-5589","1939-3520","2326-3881"],"issn-type":[{"value":"0098-5589","type":"print"},{"value":"1939-3520","type":"electronic"},{"value":"2326-3881","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9]]}}}