Metraipolis › archive › dc_cd0aec924043
Pin and Replay, or Refuse: Conditional Exactness and Probabilistic Validation Across Reference Releases — arXiv:2611.02182
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.02182
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:52:51.653Z
- SHA-256 of the archived text
2551f1e24062c6fcd640d69e90bbb0b2327e6595728969df78f3cd945639304c- Stable URL of this page
https://metraipolis.com/documento/dc_cd0aec924043
How to cite
Pin and Replay, or Refuse: Conditional Exactness and Probabilistic Validation Across Reference Releases — arXiv:2611.02182 — arXiv (en), https://arxiv.org/abs/2611.02182 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cd0aec924043 (Metraipolis archive dc_cd0aec924043, sha256 2551f1e24062c6fcd640d69e90bbb0b2327e6595728969df78f3cd945639304c)
BibTeX
@misc{dccd0aec924043,
title = {Pin and Replay, or Refuse: Conditional Exactness and Probabilistic Validation Across Reference Releases — arXiv:2611.02182},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.02182},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cd0aec924043; sha256 2551f1e24062c6fcd640d69e90bbb0b2327e6595728969df78f3cd945639304c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02182. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Biologists annotate genomes by searching proteins against reference databases such as Pfam, which publish new releases every few weeks to months. Each release forces a full re-search, though most of the database is unchanged: 86.6% of Pfam entries matched between releases 38.1 and 38.2 after excluding build metadata and comments. Reusing old results is hard because search programs are fixed binaries whose printed statistics depend on whole-database size. We present TARE (Tool Annotation Replay with Evidence), a wrapper that reruns an unmodified program only on entries that can matter, pinning the program's database-size setting to the new release so it prints the numbers a full run would print. TARE then tests the replay by adding back omitted entries and refuses with a failure status if any line changes, dumping a full stock body when the tool still runs. Two claims stay separate: conditional exactness under a stated contract (tested each update, not proved), and runtime assurance as probabilistic validation at a stated prevalence---not a guarantee against shipping incorrect output. In the all-record timing, TARE audits 299 records from all queries, so a hidden dependency affecting at least 1% of that population ships with probability at most 5% (valid oracle); rarer faults are outside that bound. On Pfam 38.1->38.2, TARE is 3.47x faster than a full rerun under that audit (median over 8 genomes after excluding 1 flagged genome; 95% CI 3.30-3.81). Historical candidate-population timings on the same nine genomes were 4.24x (Bernoulli; 95% CI 4.17-4.68) and 3.49x (bounded s=299; 95% CI 3.32-4.10). Cost of checking versus unchecked replay is 1.58x (C/B). Across 715,704 HMMER and Infernal output lines, none differed from a full run. TARE refused DIAMOND, whose first filter reads neighboring database bytes, and BLAST+, whose unpinned probe rows fit none of TARE's column rules. Tema degli esploratori: scienze della vita e salute (elenco arXiv q-bio.GN, nuovi lavori del giorno). Categorie arXiv: Genomics (q-bio.GN). Pagina del lavoro: https://arxiv.org/abs/2611.02182 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T11:13:52.627Z dalla pagina https://arxiv.org/list/q-bio.GN/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).