<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>CodexGraph: Bridging Large Language Models and Code Repositories via Code Graph Databases · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2408.03910/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2408.03910/feed.xml" rel="self" type="application/rss+xml" /><item><title>CodexGraph: Bridging Large Language Models and Code Repositories via Code Graph Databases — mentioned by lucasacosta_</title><link>https://news.ycombinator.com/item?id=44061525</link><guid isPermaLink="false">urn:hackerpapers:mention:2408.03910:44061525</guid><pubDate>Thu, 22 May 2025 12:46:27 GMT</pubDate><description>&lt;p&gt;Definitely. For now the &amp;quot;frontier-level&amp;quot; papers (working with repository-level coding maintenance) need to necessarily depend on previously (and statically) generated Code Knowledge Graphs or Snippet-Retrieval systems, which makes the scalable and fast aspects complicated, as any change in the code would represent a change in the graph, hence requiring a rebuild. But given the context limit, you need to rely on Graph queries to give relevant parts and then at the end of the day it just reads snippets instead of the full code, which makes the consistent an issue, as it can&amp;#x27;t learn from the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2408.03910/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.SE</category></item></channel></rss>
