nowfound

Alternatives

Products that do what Towards agentic Graph RAG: Enhancing graph retrieval with vector search does

In this post, we document the results of some experiments comparing vanilla Graph RAG (just a single pass of text2cypher) vs. a router agent Graph RAG approach that can call vector search tools alongside text2cypher. The routing agent uses an LLM to decide which vector search tool to call, depending on the terms identified in the question, and it works quite well. The results show that recent frontier LLMs like `gpt-4.1` and the trusty workhorse `gemini-2.0-flash` produce great quality Cypher reliably and reproducibly, with some prompt engineering to ensure that the graph schema is formatted…

  1. 1
    RLAMA138

    Open-Source RAG CLI for Ollama

    2025

  2. 2GG

    2016 · graphene-python.org

  3. 3GG
  4. 4

    Smarter RAG with Agentic Retrieval & Context-Aware MCP

    Sep 2025

  5. 5QG

    2018 · medium.com

  6. 6LS
  7. 7JO
  8. 8PR

    Hi HN, While building RAG agents, I noticed a lot of token budget was wasted on formatting overhead (HTML tags, JSON structure, whitespace). Existing solutions felt too heavy (often requiring torch&#x2F;transformers), so I wrote this lightweight, zero-dependency library to solve it. It includes strategies for context packing, PII redaction, and tool output compression. Benchmarks show it can save ~15% of tokens with negligible latency overhead (<0.5ms). Happy to answer any questions!

    Dec 2025 · github.com

  9. 9AE

    Hey folks, Elias here. Excited to unveil my latest project. Why I Built This: Traditional keyword search isn't cutting it. I've used LLM-embeddings to provide more nuanced, relevant results. How It Works: LLM-embedding similarity on curated datasets for semantically similar results. No need to iterate over keywords any more. Current Datasets: - YC Companies - Show HN Posts, - Ask HN Posts - ProductHunt Startups - Github Top 200k Repos Use Cases: - Validate a product idea's existence - Check if someone already Asked HN something - Have fun - search random terms and see what pops up Want to…

    2023 · payperrun.com

  10. 10AV

    2016 · workshape.github.io

  11. 11MO

    A small demo for a Metarank open-source project I'm maintaining.

    2023 · demo.metarank.ai

  12. 12ES

    Hi HN, I built EdgeVec, a vector database that runs entirely in the browser. It implements HNSW (Hierarchical Navigable Small World) graphs for approximate nearest neighbor search. Performance: - Sub-millisecond search at 100k vectors (768 dimensions, k=10) - 148 KB gzipped bundle - 3.6x memory reduction with scalar quantization Use cases: browser extensions with semantic search, local-first apps, privacy-preserving RAG. Technical: Written in Rust, compiled to WASM. Uses AVX2 SIMD on native, simd128 on WASM. IndexedDB for browser persistence. npm:…

    Dec 2025 · github.com

  13. 13RB

    Happy to release FastPlaid, which aim to ease and accelerate ColBERT and ColPali retrieval

    2025 · github.com

  14. 14AO

    Hi, We are building an open-source framework for loading and structuring LLM context to create accurate and explainable LLM answers using knowledge graphs and vector stores. We built the tool with four main concepts in mind: 1. Loader -> uses dlt in the backend to load and structure the data 2. Cognify step -> creates a graph with summaries, labels and factoids that are interconnected across the documents and stored as a representation in the vector store 3. Optimizer -> Uses DSPy to optimize LLM queries, and we plan to extend it to most of the knobs we can turn, like chunking etc. 4. Search…

    2024 · github.com

  15. 15LA

    2024 · twitter.com

  16. 16MG
  17. 17AL

    Hi HN, I built this to address what I see as the fundamental problem with ReAct-style agents: compounding errors. Even a small mistake made early enough in the loop can snowball and ruin the final output. But with search, agents can look multiple steps ahead and backtrack before committing to a particular trajectory. This has already been shown in a few papers to help agents avoid mistakes and boost overall task performance, but there's no easy way to actually build these kinds of agents. So that's why I made this framework. I believe search will eventually become table stakes for building…

    2024 · github.com

  18. 18WC
  19. 19SF

    Hey HN! We've just open-sourced Semble, a fast and accurate code search library built for agents. We're also releasing potion-code-16M, a small code-specialized static embedding model that powers it. Most embedding-based code search methods are either too slow to index on demand or need GPU infrastructure, while grep-style retrieval methods often cannot find the relevant content. Semble combines the speed and quality benefits of both, so agents waste less time and fewer tokens exploring. Main features: - Fast: indexes a full codebase in ~250 ms and answers queries in ~1.5 ms, all on CPU…

    Apr 2026 · github.com

  20. 20WB

    Hi HN, Our research team just released the best performing and most efficient reranker out there, and it's available now as an open weight model on HuggingFace. Reranker v2 was designed specifically for agentic RAG, supports instruction following (our v1 was the first to introduce this), and is multilingual. Along with this, we're also open source our eval set, which allows you to reproduce our benchmark results. By releasing these datasets, we are also advancing instruction-following reranking evaluation, where high-quality benchmarks are currently limited. Please give it a try and let us…

    2025 · huggingface.co

  21. 21AA

    We’ve published a set of open-source reference implementations on how to build production-grade Agentic AI applications on AWS. What’s in the repo: • Agentic RAG, memory, and planning workflows with LangGraph & CrewAI • Strands-based flows with observability using OTEL & Arize • Evaluation with LLM-as-judge and cost&#x2F;performance regressions • Built with Bedrock, S3, Step Functions, and more GitHub: https:&#x2F;&#x2F;github.com&#x2F;aws-samples&#x2F;sample-agentic-frameworks-on-... Would love your thoughts — feedback, issues, and stars welcome!

    2025 · github.com

  22. 22PA

    We're excited to release PaperQA2, an open source RAG library specialized to work with the scientific literature. We've seen some really compelling results with it (https:&#x2F;&#x2F;paper.wikicrow.ai), like superhuman performance at question answering and summarization when compared with expert scientists. PaperQA2 is a major overhaul of our prior PaperQA system, it includes automatically obtained rich metadata for each paper, a CLI to work with local papers directly, a local full-text search engine for keywords searches over PDF files, a state-of-the-art algorithm for LLM-based re-ranking…

    2024 · github.com

  23. 23AO

    Hi HN, We built one of the largest RAG set-ups that exist toady with Usul.ai (6B tokens). We started by using langchain and llamaindex, they were able to get us to a prototype in a couple of days, but took 3 months of taking pieces apart and optimizing them to make it perform well at such large scale. We put all of these learning into an MIT licensed open-source project — Agentset. Our goal to let people get production quality RAG w&#x2F;o having to understand or optimize the underlying pieces. It supports 22 file formats, agentic search, deep research, citations, and a UI out of the box.…

    Oct 2025 · github.com

  24. 24MI

    Hi HN! I lead product at Vectara and we've just released a new LLM in our platform that outperforms GPT4 and Gemini 1.5 Pro on RAG tasks. Vectara is a Retrieval Augmented Generation (RAG) platform primarily deployed as a SaaS service which includes a generous free tier so you can try it for free. The way we've been able to offer a "better but cheaper" is that we focus a lot of our attention on taking smaller models (which can be hosted in a cost efficient way) and fine tuning them to specific tasks: in this case RAG. This ends up with a model that is less capable of arbitrary tasks like…

    2024 · vectara.com

Ranked by how close each launch is in meaning, then by votes. Refine with a description →