- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
ORBIT checks if a piece of text is a lightly edited copy of a registered text. The registry stores the full original text and a signature. A short address embedded in the text points the search at one bucket; if that fails, standard text search will be used. Scoring then asks an off-the-shelf support model whether the original still supports the changed sentences and their neighbors.
Critical strengths
The task is clear: find the signed original, then decide whether it still supports the quote. Authentication is applied to every candidate, so the short address is not trusted by itself. On the fresh short texts, skipping unchanged sentences keeps the decisions close to scoring the whole query, and the paper reports the cases where vector search is faster without the hint.
Critical weaknesses
The claim that the address saves more as the registry grows is only shown against BM25. Vector search/ approximate nearest neighbor search is not tested at the larger sizes. BM25 becoming slow at a million records does not show that the paper beats the vector index people actually use.
The evaluated edits are also narrow. The signed unit is one complete generation. The test edits replace a single sentence and leave every other byte fixed. A quote that contains two pieces or half of the original fails the overlap check and is never scored.
Questions for authors
At the scale of millions records, is the method more efficient than approximate nearest neighbor search?