KnowLP-RAG — 7-Layer Retrieval Pipeline

Dual knowledge graph (P/S-Agent) + 4-engine unified search + feedback loop

KnowLP-RAG: 7-Layer Retrieval Architecture Layer 1 — Markdown Source Obsidian · Logseq · Joplin · plain .md folder Layer 2 — Metadata Extraction YAML frontmatter · tags · wiki-links · headings Layer 3 — Dual Graph Builder P-Agent: 3,260 prerequisite edges (read A before B) S-Agent: 3,108 similarity edges (viable alternatives) Layer 4 — Paragraph Chunking 3,214 chunks · body-text keyword matching · Chinese-aware sentence splitting Layer 5 — Vector Index (dual-mode) n-gram active (1,401 docs, CPU) · Qwen3-VL-Embedding-2B real embedding optional (needs GPU) Layer 6 — 4-Engine Unified Search KnowLP Graph P/S-Agent traversal Chroma Skills Vector skill search ripgrep Full-Text Raw content grep PixelRAG Visual search Layer 7 — Weight Feedback Loop consumed edges +0.05 (cap 2.0) · ignored -0.02 (floor 0.05) half-life decay 3 tiers · ephemeral 1d / default 30d / decree ∞ feedback loop benchmarks (n=52 · 2026-10-02) 940 notes 6368 edges P@5: 0.219 MRR: 0.496 Legend Source / I/O Processing Graph / Index Search Vector Feedback Loopback KnowLP-RAG v3.0.10 · MIT · 303 tests · github.com/wly8691-jpg/knowlp-rag

Dual Graph (unique)

  • • P-Agent: prerequisite chains
  • • S-Agent: similar alternatives
  • • 6368 total edges, 940 nodes
  • • Jaccard + tag + dir co-occurrence

4-Engine Search

  • • KnowLP graph traversal
  • • Chroma skill vector search
  • • ripgrep raw content grep
  • • PixelRAG visual search

Feedback Loop

  • • +0.05 per consumed edge
  • • -0.02 per ignored edge
  • • 3-tier half-life decay (1d / 30d / ∞)
  • • Gets better with every use

KnowLP-RAG · github.com/wly8691-jpg/knowlp-rag · MIT © 2026