Skip to main content
50search
Sign up
← new search
software · published 2026-04-23

Hop-bounded retrieval for latency-sensitive RAG

A graph algorithm that bounds the number of retrieval hops at query time so latency remains predictable under adversarial corpora.

Composite score

84/100

Adversarial-robustness for retrieval pipelines is well studied; the explicit hop bound at serve time with a provable upper bound on latency is novel in combination.

Closest prior art

  1. #1 · arxivsimilarity 54%

    Bounded-cost graph search over embedding indices

    arXiv:2406.11241 · unassigned · published 2024-06-17
  2. #2 · usptosimilarity 44%

    Retrieval system with adversarial example detection

    US20240112345A1 · Meta Platforms, Inc. · published 2024-04-04

What to do next

  • Start a draft — turn this into a USPTO-ready provisional for $199.
  • Save to workspace — track this idea across states.
  • Share this URL — it's indexed by search engines.

Memo watermark: 50search.com/search/rag-hop-bound-002

Hop-bounded retrieval for latency-sensitive RAG