Unverified50% confidenceFactExact time
LeanGraphSearch uses a forward dependency graph (edges go from a declaration to the premises it references), and the propagation direction follows the decomposition direction in the proof from goal to subgoals, so as to cover the intermediate lemmas along the complete proof path.
1
Sources
50%
Confidence
Long-term
Relevance
10/16/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedGraphRAG范式先用向量检索定位候选实体节点，再通过图遍历沿关系链条扩展上下文，形成语义召回加结构推理的两阶段管道69% similarUnverifiedSlideRuler first learns a transfer map using paired repeat scans, and at inference time calibrates only a single scan, keeping the foundation model parameters unchanged throughout the process66% similarUnverifiedConditional routing is an edge type in LangGraph implemented via the add_conditional_edges method, which dynamically determines the next step based on the return value of a routing function.65% similarUnverifiedLLM 与 Lean 结合的典型流程是模型生成候选证明策略，Lean 即时反馈该策略是否使目标状态合法推进，实现生成-验证循环64% similarUnverifiedThe anchor mechanism in AnchorDLM may help the model lock onto the correct reasoning path earlier by providing structured intermediate hints for the reasoning process.64% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1042033API
curl https://kongchang.com/api/v1/knowledge/claims/1042033MCP
get_claim(id=1042033)