Pith. sign in

REVIEW 2 major objections 6 minor 35 references

GitChameleon 2.0: Evaluating AI Code Generation Against Python Library Version Incompatibilities

T0 review · 2 major / 6 minor · reviewed 2026-08-06 · deepseek-v4-flash

Pith's one-line read Best AI coders pass only half of version-locked Python tasks.

desk verdict A genuine, reusable version-conditioned benchmark with execution-based evaluation; the AI-generated test audit is the main thing to fix, but the central result is solid. read the letter →

arxiv 2507.12367 v2 pith:A4PTODPV submitted 2025-07-16 cs.SE cs.AIcs.PL

classification cs.SEcs.AIcs.PL
keywords GitChameleon2.0version-conditionedcodegenerationlibraryversionincompatibilitybreakingchangesPythonbenchmarkLLMevaluationself-debuggingretrieval-augmented
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

GitChameleon 2.0 aims to establish that generating code for a specific, pinned library version is a distinct capability that today's best AI code generators do not yet have. It is a benchmark of 328 Python completion problems built from documented breaking changes in 26 popular libraries, where each prompt names a version and each solution is graded by hidden unit tests that the model never sees. Across enterprise models, agents, coding assistants, and retrieval-augmented pipelines, hidden-test success clusters near 48-51% for the strongest models, and open-weight and smaller models fall further behind. The failures are mostly attributed to recalling the wrong version's API rather than to logic, since most ground-truth solutions contain fewer than five logic-related AST nodes. If the benchmark is right, version-aware code generation is a real bottleneck for production use, and progress will need evaluation and training that reward knowing which API belongs to which version.

What carries the argument

The central object is GitChameleon 2.0: 328 Python code-completion tasks, each tied to a documented breaking change in one of 26 libraries, with the library and exact version named in the prompt and installed in the validation environment. The key design move is version-conditioned generation (VCG), which forces models to write code for a fixed, in-distribution version rather than migrate code forward; the hidden-test suite is the scoring instrument, with visible tests reserved for self-debugging and reference documents reserved for RAG experiments. A supporting mechanism is the logic-vs-knowledge decomposition, which counts logic-related AST nodes in ground-truth solutions and uses the low counts to argue that the benchmark measures knowledge retention, not complex code logic.

What would settle it

Have human experts write independent oracle tests for a random sample of the 328 problems, rerun the same models against those tests, and compare pass rates with the reported hidden-test rates; a material divergence would show the benchmark's difficulty depends on the AI-generated test suite. Then classify each wrong solution as either a version-wrong API call or a logic error under the correct version; if most failures are logic errors, the paper's knowledge-retention claim would not hold.

Watch

Extended reading notes

Core claim

The paper's central claim is that state-of-the-art LLM-based coding systems are unreliable when asked to write code for a library version they have already seen. Even with the target version stated in the prompt and installed in the test environment, the best enterprise model reaches 51.2% hidden-test success and several large models cluster at 48-51%; the best retrieval-augmented result is about 59%, so more than 40% of problems remain unsolved even with documentation available. The benchmark deliberately uses versions inside training windows and mostly short solutions with few logic nodes, so it interprets the failures as a version-knowledge disambiguation problem rather than a code-reasoning problem. The paper's conclusion is that version-conditioned code generation is a measurable, currently unsolved subproblem of code generation, and that execution-based benchmarks are needed to see it.

Load-bearing premise

The measuring instrument for every headline result is a set of hidden tests written by an AI coding agent, not independently audited by human experts; if those tests are too lenient, too strict, or encode the generator's own API mistakes, the reported 48-51% rates are not measurements of version compliance.

Editorial extensions

If this is right

  • Teams that ask an LLM to produce code for a pinned library version can expect roughly one in two completions to fail hidden functional tests, so version-aware guardrails and testing are necessary before such output can be shipped.
  • Providing relevant documentation through RAG lifts the best model to about 59% hidden-test success, yet leaves over 40% of problems unsolved, showing that retrieval alone does not solve version compliance.
  • Self-debugging against visible tests can raise visible success rates substantially, but it widens the visible-hidden gap for every model, so visible-test feedback can mask version errors that only hidden tests catch.
  • Larger model variants consistently outperform their smaller siblings, indicating that version-specific API recall scales with model capacity.
  • Coding assistants that only receive starter code without the full problem statement perform far worse, so the way version constraints are presented is itself a large factor in success.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial extension: because the benchmark pins versions inside training windows, the 48-51% ceiling suggests pretraining stores versioned API knowledge in a poorly disentangled way; a targeted error analysis distinguishing stale-API calls from hallucinated newer APIs would make this precise.
  • Editorial extension: the hidden tests were generated by an AI agent and not independently human-audited, so auditing a random subset with human-written oracle tests would show how much of the reported difficulty is the test suite itself.
  • Editorial extension: since most ground-truth solutions have few logic nodes, an oracle-document RAG condition would isolate whether remaining failures come from retrieval inaccuracy or from models ignoring correctly retrieved version-specific documentation.
  • Editorial extension: the paper leaves out human baselines and version-to-version translation; adding a human-performer baseline would turn the absolute 48-51% numbers into a calibrated statement about how hard version-conditioned generation is for humans versus models.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 6 minor

Summary. GitChameleon 2.0 introduces a dataset of 328 Python code-completion problems, each tied to a specific library version and a documented breaking change, with executable hidden tests and a visible test per problem. The paper evaluates a broad range of open-weight and enterprise LLMs, tool-calling agents, CLI/IDE coding assistants, and RAG pipelines under greedy decoding, chain-of-thought, self-debugging, multi-step agent, and retrieval-augmented settings. The central finding is that enterprise models achieve only 48-51% hidden-test success under greedy decoding, with self-debugging and RAG providing gains yet leaving over 40% of problems unsolved. The paper also reports analyses by API change category, error type, and version release year, and argues that the benchmark primarily measures version-specific knowledge retention rather than complex logic.

Significance. If the hidden tests are valid, this is a useful benchmark and empirical study. Strengths include execution-based evaluation in Docker containers with pinned library versions, standard errors on all headline numbers, a wide model/agent/assistant coverage, public dataset and code, and the visible/hidden test gap analysis that supports the self-debugging findings. The moderate correlations with SWE-bench and LiveCodeBench are thought-provoking. The main weakness is that the hidden tests were AI-generated without independent verification, and the knowledge-retention interpretation rests on a subjective AST classification; these need to be addressed before the headline claims can be fully trusted.

major comments (2)
  1. [Appendix A.4 (Tables 1-4)] The benchmark's headline metric is hidden-test success, yet the hidden tests were generated by the Zencoder agent (built on GPT-4.1) with no independent human audit; the reported 96.5% coverage and the fact that reference solutions pass do not establish that the tests correctly discriminate version-correct from version-incorrect solutions. Coverage measures how much of the reference implementation is exercised, not whether the assertions encode the version-specific behavior described in each problem statement, and a reference solution passing its own tests is necessary but not sufficient for test validity. Because Zencoder is itself an LLM, the tests can encode the same API misconceptions the benchmark aims to detect (e.g., using a deprecated argument in the reference implementation or failing to check return types that changed across versions). I request an independent human audit of a sample of hidden tests, or at least an adversarial validation in which known version-incorrect solutions (e.g., using the pre-change API) are shown to fail, and a report of the resulting precision/recall of the test suite. Without this, the 48-51% enterprise rates in Table 1 and all downstream comparisons rest on an unvalidated measuring instrument.
  2. [Appendix H (Table 15)] The claim that GitChameleon 2.0 'is primarily designed to assess version-specific knowledge retention rather than complex logic-based code generation' rests on an ad-hoc AST node classification whose categories are not independently validated. Table 15 counts 'calling a math or utility function with non-obvious purpose' and 'composing multiple calls together' as logic-related, yet these categories require judgment; no inter-annotator agreement or comparison with a validated complexity measure (e.g., cyclomatic complexity or human ratings) is provided. Since this claim is used to interpret the benchmark's results and to position the contribution relative to logic-reasoning benchmarks, it should be supported by a more rigorous validation, or the wording should be softened to describe the observed distribution of logic nodes without asserting the benchmark's primary design intent.
minor comments (6)
  1. [Figure 1] The function name 'custom_violinpolot' in the figure appears to be a typo; it should probably be 'custom_violinplot'.
  2. [Appendix F.2] The code listing shows 'from scipy import llinalg' with a double 'l'; this is likely a typo for 'linalg'.
  3. [Table 3] Cline with GPT-4.1 and Cline with GPT-4.1-nano report identical hidden success rates (54.6%) and identical API hit rates (48.8%); please verify whether this is a copy-paste error or an actual duplicate result.
  4. [Appendix J.1] The Kymatio entry lists a librosa documentation URL instead of the Kymatio project URL; please correct this citation.
  5. [Appendix A.4] Capitalization of 'Zencoder' is inconsistent; the text uses both 'Zencoder' and 'ZENCODER'.
  6. [Table 14] The entry 'LLM-Deprecated-APl' contains a typo; 'APl' should be 'API'.

Circularity Check

0 steps flagged · score 2.0 of 10

No load-bearing circularity: results are execution-based against pinned versions; only a minor self-citation and a mild overlap between the hidden-test generator and an evaluated model.

full rationale

The paper's core claims—enterprise models reaching 48-51% hidden-test success, self-debugging/RAG gains, and the version-conditioning difficulty—are produced by executing candidate solutions in pinned Docker environments against hidden unit tests, an external measurement rather than a derivation from the benchmark's own assumptions. Appendix A.4 describes hidden tests generated by Zencoder (built on GPT-4.1) with execution feedback and manual patching; although GPT-4.1 is also an evaluated model, the pass/fail labels are grounded in real execution against installed library versions, and no fitted parameter or predicted quantity is defined in terms of those labels. The only self-citation is the predecessor GitChameleon (Islah et al., 2024), mentioned as context in Section 4; it does not support any headline number. Appendix H's claim that the benchmark targets knowledge retention rather than logic is a transparent design statement based on an explicit AST taxonomy (Table 15) that excludes library-method calls from 'logic-related' nodes; this is definitional by design but does not feed back into the experimental results. No step reduces to Equation X = Equation Y by construction or renames a fit as a prediction, so the score is 2 for the minor self-citation and the noted test-generation overlap, not for a circular derivation.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The central claim rests on no free parameters: no constants are fitted to data. The important unstated inputs are the unverified hidden tests, the unverifiable in-distribution training assumption for closed models, and the authors' AST criteria for the knowledge-retention analysis.

assumptions (4)
  • ad hoc to paper The versions used in the benchmark fall within the training data of the evaluated models.
    Section 2.3 states 'We intentionally use versions that fall within the training window of most evaluated models'. For API-only closed models this is an unverifiable assumption; if wrong, the task becomes out-of-distribution and the interpretation of failure changes.
  • domain assumption The hidden tests correctly encode the version-specific behavior of each problem.
    Appendix A.4 says tests were generated by Zencoder (GPT-4.1) with execution feedback and manual fixes, reporting 96.5% coverage, but there is no independent human verification of the tests.
  • domain assumption Changelogs and release notes for the selected libraries accurately document the breaking changes.
    Appendix A.1 describes compiling breaking changes from library documentation; the benchmark's validity depends on those documents being correct for the pinned versions.
  • ad hoc to paper The AST logic-node count is a valid proxy for distinguishing knowledge retention from logic reasoning.
    Appendix H defines arbitrary criteria for logic-related nodes; no external validation shows this criterion measures what the paper claims.

how reviews work

0 comments
Cite this review

Pith. "Pith review of GitChameleon 2.0: Evaluating AI Code Generation Against Python Library Version Incompatibilities." pith.science (2026). https://pith.science/paper/A4PTODPV

@misc{pith2026250712367,
  author       = {Pith},
  title        = {Pith review of: GitChameleon 2.0: Evaluating AI Code Generation Against Python Library Version Incompatibilities},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/A4PTODPV}},
  note         = {Machine review of arXiv:2507.12367}
}
read the original abstract

The rapid evolution of software libraries poses a considerable hurdle for code generation, necessitating continuous adaptation to frequent version updates while preserving backward compatibility. While existing code evolution benchmarks provide valuable insights, they typically lack execution-based evaluation for generating code compliant with specific library versions. To address this, we introduce GitChameleon 2.0, a novel, meticulously curated dataset comprising 328 Python code completion problems, each conditioned on specific library versions and accompanied by executable unit tests. GitChameleon 2.0 rigorously evaluates the capacity of contemporary large language models (LLMs), LLM-powered agents, code assistants, and RAG systems to perform version-conditioned code generation that demonstrates functional accuracy through execution. Our extensive evaluations indicate that state-of-the-art systems encounter significant challenges with this task; enterprise models achieving baseline success rates in the 48-51% range, underscoring the intricacy of the problem. By offering an execution-based benchmark emphasizing the dynamic nature of code libraries, GitChameleon 2.0 enables a clearer understanding of this challenge and helps guide the development of more adaptable and dependable AI code generation methods. We make the dataset and evaluation code publicly available at https://github.com/mrcabbage972/GitChameleonBenchmark.

Figures

Figures reproduced from arXiv: 2507.12367 by the authors.

Figure 1
Figure 1. In this GitChameleon 2.0 problem, the gpt-4o-mini model produced an incorrect solution due for seaborn.violinplot by using the deprecated bw parameter, instead of the appropriate bw_method and bw_adjust required by the specified library version. et al., 2022), and high performance on general coding benchmarks (Hendrycks et al., 2021; Chen et al., 2021), a critical capability remains under￾evaluated: generating code … view at source ↗
Figure 2
Figure 2. An illustration of two evaluation paradigms for code generation models. Code Evolution (right) as￾sesses model capabilities on out-of-distribution (OOD) data, using library versions or new libraries not encoun￾tered during training. In contrast, Version-Conditioned Generation (VCG) (left) focuses on the practical ability to generate code for specific, in-distribution (ID) library versions that the model has seen bef… view at source ↗
Figure 3
Figure 3. Can you predict GitChameleon 2.0 per￾formance from other code generation benchmarks? Here we present the Spearman (ρ) and Pearson (r) correlations between GitChameleon 2.0, SWE￾Bench (Jimenez et al., 2024), and LiveCodeBench (Jain et al., 2024). GitChameleon exhibits a moderate corre￾lation with SWE-Bench, with ρ of 0.550 and r of 0.675; and a weak correlation with LiveCodeBench, with ρ of 0.214 and r of 0.130. 2.1 … view at source ↗
Figures from the paper (18 more)
Figure 4
Figure 4. Figure 4: (a) Most versions in GitChameleon 2.0 were released between 2021–2023, with a few in earlier years. (b) The most common type of change between versions was an argument or attribute change, while semantic or functional changes were least common. As demonstrated in [PIT…
Figure 5
Figure 5. Figure 5: An illustration of the workflow for a single [PITH_FULL_IMAGE:figures/full_fig_p004_5.png]
Figure 6
Figure 6. Figure 6: Analysis of the Visible-Hidden Gap Be￾fore and After Self-Debugging. We analyze how self￾debugging affects the gap between the success rate on visible and hidden tests. We can see that for all models, the gap increases after self-debugging. This shows that self-debuggi…
Figure 7
Figure 7. Figure 7: Success Rate Breakdown by Type of Change: We analyze success rates with and without self-debugging, grouped by the type of change. Light shaded bars represent values obtained from self-debugging. Standard error is drawn as a black line. We include DDG-SB, a Multi-Step …
Figure 8
Figure 8. Figure 8: Total error count for each category un￾der Greedy decoding versus Self-Debug. Self-Debug yields substantial decreases all types of errors. mon AssertionError and TypeError still see de￾crease in the range of 60-70%. 4 Related Work The continuous evolution of software l…
Figure 9
Figure 9. Figure 9: Dataset library statistics. (a) The count of [PITH_FULL_IMAGE:figures/full_fig_p015_9.png]
Figure 10
Figure 10. Figure 10: Success Rate Breakdown by Version Release Year. Lighter and darker shaded bars represent values obtained with and without Self-Debugging, respectively. Standard error is drawn as a black line. This plot shows that the release year does not significantly impact the res…
Figure 11
Figure 11. Figure 11: Success Rate Breakdown by Library. This figure shows the differences in success rate between the libraries included in GitChameleon 2.0. All evaluated settings do very well on NumPy, which is to be expected given the popularity of the library and the subsequent abunda…
Figure 12
Figure 12. Figure 12: ∆ Success Rate of RAG over Greedy Decoding, per library. The 10 most frequent libraries in GitChameleon 2.0 are shown here. The plots demonstrate a trend where smaller models are less effective at using RAG, with the full-size GPT-4.1 improving on 7 libraries, the min…
Figure 13
Figure 13. Figure 13: Intra model sample agreement rates. These plots show the rate of samples that have the same pass/fail result among all pairs of models, under the Greedy Decoding, Zero-Shot CoT and RAG settings. Each cell in these plots represents the agreement rate of a pair of model…
Figure 14
Figure 14. Figure 14: Logic Nodes Distribution over samples’ ground truth solutions’ ASTs. Most ground truth solutions have less than five logic nodes. 32 [PITH_FULL_IMAGE:figures/full_fig_p032_14.png]
Figure 15
Figure 15. Figure 15: AST visualization for the ground-truth solution of Sample ID 0. The three color-coded [PITH_FULL_IMAGE:figures/full_fig_p033_15.png]
Figure 16
Figure 16. Figure 16: AST visualization for the ground-truth solution of Sample ID 329. No logic nodes are present, as the [PITH_FULL_IMAGE:figures/full_fig_p033_16.png]
Figure 18
Figure 18. Figure 18: Prompts for Self-Debugging (a) System Prompt You are an expert programming assistant . Your task is to fix issues in a generated Python solution for a given programming problem . You are provided with : - A problem statement - Starter code - A previously generated inc…
Figure 19
Figure 19. Figure 19: Tool-Calling Agent Prompt You are to solve a coding problem in Python . # Instructions : * The coding problem requires using the library { library }=={ version }. Try using the problem with only this library and the standard Python libraries . * Do a thorough research…
Figure 21
Figure 21. Figure 21: Prompt and File Format for Coding Assistants [PITH_FULL_IMAGE:figures/full_fig_p039_21.png]
Figure 22
Figure 22. Figure 22: Prompts for SEK (Keyword Generation Stage) [PITH_FULL_IMAGE:figures/full_fig_p039_22.png]
Figure 23
Figure 23. Figure 23: Prompts for SEK (Code Generation Stage) (a) System Prompt You are a skilled Python programmer tasked with solving a coding problem . Your goal is to provide a clear , efficient , and correct solution that meets all the specified requirements . Please provide your solu…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

35 extracted references · 30 canonical work pages

  1. [1]

    Tensor ) -> torch

    Sample ID: 0, Logic Nodes: 3 import torch def log _ ndtr ( input _ tensor : torch . Tensor ) -> torch . Tensor : import numpy as np from scipy . stats import norm output = torch . from _ numpy ( norm . logcdf ( input _ tensor . numpy () ) ) return output Listing 37: Sample 0 Ground Truth Solution

  2. [2]

    seaborn

    Sample ID: 329, Logic Nodes: 0 import matplotlib . pyplot as plt def use _ seaborn () -> None : plt . style . use ( " seaborn " ) Listing 38: Sample 329 Ground Truth Solution 0 20 40 60 80 100 Number of Logic Nodes 0 50 100 150 200 250Frequency Logic Nodes Distribution Figure 14: Logic Nodes Distribution over samples’ ground truth solutions’ ASTs. Most gr...

  3. [5]

    Functional

    Prompt alchemy: Automatic prompt re- finement for enhancing code generation. Preprint, arXiv:2503.11085. Shuyan Zhou, Uri Alon, Frank F Xu, Zhiruo Wang, Zhengbao Jiang, and Graham Neubig. 2022. DocPrompting: Generating code by retrieving the docs. 13 A Benchmark Details This appendix provides additional details on the GitChameleon 2.0 benchmark. We provid...

  4. [6]

    Output only the code block and nothing else . Example output format : ``` python # [ Your code here , incorporating the starter code ] # [ Additional code and comments as needed ] ``` After writing your solution , please review it to ensure all requirements are met and the code is correct and efficient . Here are the key elements for this task : (b) Syste...

  5. [7]

    Avoid interactive , stateful , or environment - dependent constructs ( e . g . , Django projects , web servers )

  6. [18]

    Ensure your code is clean , efficient , and well - commented

  7. [19]

    Output nothing else after the code block . Example output format : [ Step - by - step thinking ] ``` python # [ Your code here , incorporating the starter code ] # [ Additional code and comments as needed ] ``` After writing your solution , please review it to ensure all requirements are met and the code is correct and efficient . Here are the key element...

  8. [20]

    Required Library : < library > {{ library }} </ library >

Show all 35 references
  1. [21]

    Python version : < python > {{ python_version }} </ python >

  2. [22]

    Coding Problem : < coding_problem > {{ coding_problem }} </ coding_problem >

  3. [23]

    Your task is to fix issues in a generated Python solution for a given programming problem

    Starter Code : < starter_code > {{ starter_code }} </ starter_code > 35 • Qwen 2.5-VL Instruct 72B : (Qwen et al., 2025) • Qwen 3 235B :(Yang et al., 2025) • Command A 111B : (Cohere et al., 2025) • DeepSeek R1 685B : (DeepSeek-AI, 2025) • DeepSeek v3 : (DeepSeek-AI et al., 20...

  4. [24]

    Use the required libraries explicitly in your code

  5. [25]

    Correctly incorporate the provided starter code - do not remove or alter its structure

  6. [26]

    Write in standard Python syntax

  7. [27]

    Wrap your entire solution within a single Markdown code block

  8. [28]

    Do not include any text outside the code block - no explanations , comments , docstrings , or usage examples

  9. [29]

    Ensure the code is clean , efficient , and syntactically valid

  10. [31]

    Your output must be executable in a non - interactive environment ( e . g . , a test harness or script runner ) . Example output format : ``` python # [ Your corrected code here ] ``` Before submitting , carefully review your code for correctness , completeness , and adherence...

  11. [32]

    Use only the specified libraries and respect the given version constraints

  12. [33]

    Incorporate any provided starter code as required

  13. [34]

    Do not provide anything in the response but the code

    Write only Python code - no in - line comments or usage examples . Do not provide anything in the response but the code

  14. [35]

    Ensure the code is clean , minimal , and adheres to best practices

  15. [36]

    { assistant name }

    The code must be executable in a non - interactive environment ( e . g . , avoid frameworks like Django or code requiring a web server ) . Context : { context } Based on the above , respond to the user query below . Query : { query } Here, {context} refers to the context of th...

  16. [37]

    Give a formalized explanation of the keyword using technical languages . Provided Format : Keywords :[ Keywords ] Explainations :[ Formalized explanations ] Guidelines : - Prioritize keywords that are crucial to understanding the input parameters , return content or supplement...

  17. [38]

    Use the required library in your solution

  18. [39]

    Incorporate the provided starter code correctly

  19. [40]

    Write your solution in Python

  20. [41]

    Format your solution within a markdown code block

  21. [42]

    Ensure your code is clean and efficient

  22. [43]

    Do not add any in - line comments , documentations , references or usage examples

    Output only the code block and nothing else . Do not add any in - line comments , documentations , references or usage examples

  23. [44]

    For example , do not write code which requires building a Django project or deploying a web - app

    Make sure your code is executable in a non - interactive environment . For example , do not write code which requires building a Django project or deploying a web - app . Example output format : ``` python # [ Your code here , incorporating the starter code ] ``` After writing...

  24. [2008]

    In Proceedings of the 7th Python in Science Conference, pages 11–15

    Exploring network structure, dynamics, and function using NetworkX. In Proceedings of the 7th Python in Science Conference, pages 11–15. Charles R Harris, K Jarrod Millman, Stéfan J van der Walt, Ralf Gommers, Pauli Virtanen, David Cour- napeau, Eric Wieser, Julian Taylor, Seb...

  25. [2021]

    Evaluating large language models trained on code. ArXiv. Xinyun Chen, Maxwell Lin, Nathanael Schärli, and Denny Zhou. 2023. Teaching large language models to self-debug. Preprint, arXiv:2304.05128. Keyuan Cheng, Xudong Shen, Yihao Yang, Tengyue Wang, Yang Cao, Muhammad Asif Al...

  26. [2024]

    Preprint, arXiv:2410.15966

    Self-explained keywords empower large language models for code generation. Preprint, arXiv:2410.15966. Google. 2025. Grounding with Google Search | Gemini API. https://ai.google.dev/gemini-api/doc s/grounding. Aric A Hagberg, Daniel A Schult, and Pieter J Swart

  27. [2025]

    https://github.com/huggingfa ce/smolagents

    ‘smolagents‘: a smol library to build great agentic systems. https://github.com/huggingfa ce/smolagents. Aditi Singh, Abul Ehtesham, Saket Kumar, and Tala Ta- laei Khoei. 2025. Agentic retrieval-augmented generation: A survey on agentic rag. Preprint, arXiv:2501.09136. Jianlin...

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.