diff --git a/data/xml/2025.coling.xml b/data/xml/2025.coling.xml
index 5324ec7660..4e60fdf20b 100644
--- a/data/xml/2025.coling.xml
+++ b/data/xml/2025.coling.xml
@@ -9868,8 +9868,10 @@
       <author><first>Dinesh</first><last>Garg</last></author>
       <pages>546–560</pages>
       <abstract>A domain-specific extension of C language known as <i>extended Berkeley Packet Filter (eBPF)</i> has gained widespread acceptance for various tasks, including observability, security, and network acceleration in the cloud community. Due to its recency and complexity, there is an overwhelming need for natural language summaries of existing eBPF codes (particularly open-source code) for practitioners and developers, which will go a long way in easing the understanding and development of new code. However, being a niche Domain-Specific Language (DSL), there is a scarcity of available training data. In this paper, we investigate the effectiveness of LLMs for summarizing low-resource DSLs, in the context of eBPF codes. Specifically, we propose a clustering-based technique to retrieve in-context examples that are semantically closer to the test example and propose a very simple yet powerful prompt design that yields superior-quality code summary generation. Experimental results show that our proposed retrieval approach for prompt generation improves the eBPF code summarization accuracy up to 12.9 BLEU points over other prompting techniques. The codes are available at https://github.com/babangain/ebpf_summ.</abstract>
-      <url hash="6ef70186">2025.coling-industry.47</url>
+      <url hash="3d5d21b1">2025.coling-industry.47</url>
       <bibkey>gain-etal-2025-transforming</bibkey>
+      <revision id="1" href="2025.coling-industry.47v1" hash="6ef70186"/>
+      <revision id="2" href="2025.coling-industry.47v2" hash="3d5d21b1" date="2025-02-06">Minor updates.</revision>
     </paper>
     <paper id="48">
       <title>Is my Meeting Summary Good? Estimating Quality with a Multi-<fixed-case>LLM</fixed-case> Evaluator</title>