01
Permission-aware approximate retrieval for governed archival collections
The approximate index is partitioned by access policy, so a search only ever opens the partitions the person is authorized to search; candidates from material they may not reach are never generated.
- 99.04% candidate-set Recall@500 against exact search
- 0 unauthorized disclosures in 12,486 adversarial access cases
- Recall@500 is from the approximate-versus-exact index benchmark; the access figures are from automated tests in a test environment.
In the code: src/tierline/retrieval/faiss_index.py, src/tierline/policies/evaluator.py.
02
Multi-example spoken-passage matching and controlled reranking
Candidate regions proposed by the index are re-scored frame by frame with subsequence dynamic time warping, within bounded region counts and duration ratios, so the final ranking compares the passages themselves. Up to five human-confirmed examples of a passage can be searched together, each on the same bounded path, keeping the closest overlapping match.
- 10.77 points Hit@5 above frozen XLS-R embeddings
- 72.76% of positive queries answered by the first result
- Both figures are from the held-out evaluation, whose configuration includes bounded reranking; search with several confirmed examples uses the same reranking path.
In the code: src/tierline/retrieval/multi_example.py, src/tierline/retrieval/dtw.py.
03
Provenance-linked retrieval with tested withdrawal and revocation
Every result is bound to its source recording, derivative and policy; a withdrawal or revocation is enforced at retrieval time, including against stale indexes and cached results.
- 100% of tested revoked-access cases denied retrieval
- 27 revocation and withdrawal exercises, including stale indexes and caches
- From controlled exercises in a test environment.
In the code: src/tierline/ingest/provenance.py, src/tierline/stewardship.