Every document becomes a KnowledgeNode tree - headings, tables, warnings kept intact, not flattened.
Every reply is traceable to a source file and page - ask a follow-up, get the same rigor.
Markdown, PDF, DOCX, XLSX, and CSV all normalize into the same tree - no format-specific retrieval logic.
Evaluated against a naive baseline on a labeled set - Precision@5, Recall@5, and MRR, not vibes.
Four stages, each explainable end to end - no black box between your documents and the answer.
Every document becomes a hierarchical KnowledgeNode tree - headings, tables, warnings, and figures kept intact instead of flattened into a wall of text.
BM25 keyword search and dense embeddings run in parallel and get fused by reciprocal rank, so exact terminology and paraphrased questions both surface the right passages.
A cross-encoder reranks the fused candidates, then a grading pass drops weak or duplicate matches - every score stays visible in the explainability matrix.
The answer is generated only from what survived grading, traced back to a source file and page. If the evidence is too weak, the pipeline says so instead of guessing.