Problem
Research questions and friction points this paper is trying to address.
large software repositories
model context limits
repository knowledge
local retrieval
relation graphs
The Thousand-Graph Hypothesis: A Testable Hypothesis of Task-Conditioned Relation Materialization in Repository-Level Code Reasoning
🤖 AI Summary
研究解决了大型软件库模型上下文限制问题，通过提出任务条件关系实例化的实体唯一外部接口方法，提高了代码推理效率。
📝 Abstract
Large software repositories are often beyond model context limits. Training repository knowledge into models is costly and quickly stale, while local retrieval can miss scattered requirements, and explicit relation graphs add ongoing maintenance burden. We propose an entity-only external interface with task-conditioned relation materialization during inference. A two-layer index separates global routing from local entity focus and is evaluated on DeepSeek-V4-Flash and SWE-bench Verified. The base, one-layer, and two-layer conditions achieve 92.1%, 94.2%, and 95.6% success, respectively, under zero pre-built entity-relation edges.
Innovation
Methods, ideas, or system contributions that make the work stand out.
entity-only external interface
task-conditioned relation materialization
two-layer index
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
