vrr/ruvector
2
0
Fork 0
mirror of https://github.com/ruvnet/RuVector.git synced 2026-08-04 05:50:13 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 20
ruvector/crates/ruvector-bounded-rag
History
Exact
rUv e24813cd7b
feat: add bounded RAG graph retrieval research (ADR-272) (#720) 
* feat: add ruvector-bounded-rag MinCut context window retrieval crate

Three BoundedRetriever variants: TopK baseline, GraphBFS coherence expansion,
and MinCutBounded Edmonds-Karp max-flow partition. All 9 tests pass with
precision=1.000 acceptance on synthetic 2-cluster corpora.

Co-Authored-By: claude-flow <ruv@ruv.net>
Claude-Session: https://claude.ai/code/session_012eSJ4Y33PH9w8RCv73ugu5

* docs: add ADR-272 for bounded-rag-mincut

Documents decision to add MinCut-bounded RAG retrieval, benchmark evidence,
failure modes, security considerations, and Phase 2 production hardening plan.

Co-Authored-By: claude-flow <ruv@ruv.net>
Claude-Session: https://claude.ai/code/session_012eSJ4Y33PH9w8RCv73ugu5

* docs: add nightly research README and gist for bounded-rag-mincut

Full research document with SOTA survey, architecture diagrams, real benchmark
numbers, practical/exotic applications, and public SEO gist.

Co-Authored-By: claude-flow <ruv@ruv.net>
Claude-Session: https://claude.ai/code/session_012eSJ4Y33PH9w8RCv73ugu5

* chore: update Cargo.lock for ruvector-bounded-rag dependencies

Co-Authored-By: claude-flow <ruv@ruv.net>
Claude-Session: https://claude.ai/code/session_012eSJ4Y33PH9w8RCv73ugu5

* fix bounded RAG flow and input validation

---------

Co-authored-by: Claude <noreply@anthropic.com>
2026-07-27 09:55:59 -07:00
..
src feat: add bounded RAG graph retrieval research (ADR-272) (#720) 2026-07-27 09:55:59 -07:00
Cargo.toml feat: add bounded RAG graph retrieval research (ADR-272) (#720) 2026-07-27 09:55:59 -07:00
README.md feat: add bounded RAG graph retrieval research (ADR-272) (#720) 2026-07-27 09:55:59 -07:00

README.md

ruvector-bounded-rag

Research implementations of context-budgeted retrieval for RuVector.

The crate compares cosine top-k retrieval, priority traversal over a dense similarity graph, and an Edmonds–Karp min-cut partition followed by relevance ranking and budget truncation. The graph-based variants rebuild their pairwise similarity structures per query and are intended as auditable research baselines rather than production-scale indexes.

cargo test -p ruvector-bounded-rag
cargo run --release -p ruvector-bounded-rag --bin benchmark

See docs/adr/ADR-272-bounded-rag-mincut.md and the associated nightly research report for methodology and limitations.