pith. machine review for the scientific record. sign in

arxiv: 2605.00074 · v1 · submitted 2026-04-30 · 🧬 q-bio.GN · cs.AI

Recognition: unknown

CRC-Screen: Certified DNA-Synthesis Hazard Screening Under Taxonomic Shift

Authors on Pith no claims yet

Pith reviewed 2026-05-09 20:25 UTC · model grok-4.3

classification 🧬 q-bio.GN cs.AI
keywords DNA synthesis screeninghazard detectionconformal risk controltaxonomic shiftfalse negative rateUniProt toxinslogistic aggregatorcertified screening
0
0 comments X

The pith

Fusing three public signals and calibrating the threshold with conformal methods certifies an expected false-negative rate bound for DNA-synthesis hazard screening that holds under taxonomic shifts.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that matching orders against fixed hazard lists produces a 100 percent false-flag rate once the hazardous sequence belongs to a taxonomic family absent from the reference set. It instead derives three signals from a synthesis order's public annotation, fuses them with a monotone logistic aggregator, and sets the decision threshold via Conformal Risk Control so that the expected false-negative rate stays at or below a pre-chosen α. In ten leave-one-family-out experiments on reviewed UniProt toxins the calibrated rule achieves zero misses on every test fold and zero false flags on nine of the ten folds. The finite-sample guarantee is limited by calibration-set size rather than by the choice of signals, and the full reviewed toxin corpus is large enough to support much tighter bounds.

Core claim

By combining k-mer Jaccard similarity to known toxins, the trimmed-mean score of a five-LLM judge panel, and cosine similarity to clustered embedding centroids inside a monotone logistic aggregator and then calibrating the resulting score with Conformal Risk Control on leave-one-taxonomic-family-out folds drawn from UniProt KW-0800 reviewed toxins, the screener certifies E[FNR] ≤ α while attaining 0 percent test miss rate on every fold and 0 percent test false-flag rate on nine of ten folds at α = 0.05.

What carries the argument

A monotone logistic aggregator of three annotation-derived signals whose threshold is set by Conformal Risk Control to enforce an upper bound on expected false-negative rate under distribution shift.

If this is right

  • The size of the calibration set, not the design of the signals, is the binding constraint on how low a certifiable miss rate can be achieved.
  • The full reviewed UniProt KW-0800 corpus already supplies enough data to reach procurement-grade α = 0.001.
  • The same certified bound can be maintained on future orders whose hazards come from families outside the current calibration folds.
  • The finite-sample slack of 1/(n_cal + 1) limits the smallest certifiable miss rate to 1.77 percent on the 200-hazard subsample used in the experiments.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Expanding the calibration set with additional reviewed toxins would directly tighten the certified risk bound without requiring new signal engineering.
  • DNA-synthesis providers could adopt the calibrated rule to reduce both missed hazards and unnecessary blocks on safe orders from novel organisms.
  • The same three-signal plus conformal-calibration pattern may apply to other sequence-based screening tasks that face distributional shifts.

Load-bearing premise

The three chosen signals remain sufficiently informative when the hazardous sequence comes from a taxonomic family that was never seen during calibration.

What would settle it

A new family of toxins in which every one of the three signals produces scores that overlap completely with the distribution of benign sequences would cause the calibrated threshold to miss hazards at a rate exceeding the certified bound.

Figures

Figures reproduced from arXiv: 2605.00074 by Najmul Hasan.

Figure 1
Figure 1. Figure 1: Sequence-similarity-only screening flags every benign in out-of-family folds (100% FPR); CRC-Screen drops this to 0% while certifying E[FNR] ≤ α at α = 0.05, mean across ten leave￾one-taxonomic-family-out folds. tories and toxin databases. This baseline was built for a threat model in which the hazardous order looks, at the level of amino-acid sequence, like a hazardous protein the screener has already see… view at source ↗
Figure 2
Figure 2. Figure 2: CRC-Screen takes a UniProt annotation through three signals, fuses them with a monotone logistic aggregator, and flags the order if the calibrated score S exceeds the Conformal Risk Control threshold τb; on the held-out Crotalinae fold, this correctly flags Q800C2 with test FNR= 0% and test FPR= 0%. (a) Input UniProt record (accession Q800C2, an acidic phospholipase A2 from Crotalus viridis viridis, labell… view at source ↗
Figure 3
Figure 3. Figure 3: The CRC bound holds on every fold with 19–44 percentage points of slack: empirical test miss rate is zero, while the certified ceiling α + TV ranges from 24.3% to 49.4% across ten LOTO folds at α = 0.05. (a) Per-fold view; the grey track runs from zero to the bound right-hand side, the red segment is the slack on top of α, and the blue dot is the empirical test miss rate. (b) The TV proxy that drives the s… view at source ↗
Figure 4
Figure 4. Figure 4: Of seven signal subsets at α = 0.05, only LLM+embedding achieves 0% mean test FNR with 0% mean test FPR; sequence homology alone fails at 100% FPR; adding homology to LLM+embedding raises FPR to 0.5% with no recall gain. Two combinations have non-zero mean FNR (embedding only: 0.45%; homology + LLM: 0.69%); their worst-fold FNRs (4.55% and 6.90%) are within the per-fold bound. Means across ten LOTO folds … view at source ↗
Figure 5
Figure 5. Figure 5: The CRC slack frontier α = 1/(ncal + 1) caps the certifiable α at any calibration-set size; our 200-hazard subsample (ncal ≈ 55, floor 1.77%) is 18× below the procurement target α = 10−3 , but the full UniProt KW-0800 reviewed corpus has enough hazards to clear it. The shaded region is infeasible: any α below the frontier cannot be certified by Conformal Risk Control alone, regardless of model performance.… view at source ↗
read the original abstract

DNA-synthesis providers screen incoming orders by searching the requested sequence against curated hazard lists. We show that this baseline collapses to a 100% false-flag rate when the hazardous sequence comes from a taxonomic family absent from the reference set: under Conformal Risk Control's certified miss-rate constraint, a low-discrimination signal forces the threshold below the entire test-benign mass. We compose three signals derived from a synthesis order's public annotation: $k$-mer Jaccard similarity to known toxins, the trimmed-mean score of a five-LLM judge panel, and cosine similarity to clustered embedding centroids. Fused under a monotone logistic aggregator and calibrated by Conformal Risk Control, the resulting screener certifies $\mathbb{E}[\mathrm{FNR}] \le \alpha$. Across ten leave-one-taxonomic-family-out folds at $\alpha=0.05$ on UniProt KW-0800 reviewed toxins, the calibrated screener achieves 0% test miss rate on every fold and 0% test false-flag rate on nine of ten folds. The bound's finite-sample slack $1/(n_{\mathrm{cal}}+1)$ caps the certifiable miss rate at 1.77% on our 200-hazard subsample; reaching procurement-grade $\alpha=10^{-3}$ requires an $18\times$ larger calibration set, which the full reviewed UniProt KW-0800 corpus is large enough to deliver. The binding constraint on certifiable DNA-synthesis screening is calibration data, not algorithms. Code: https://github.com/najmulhasan-code/crc-screen

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper presents CRC-Screen, a hazard screener for DNA synthesis orders that fuses three signals (k-mer Jaccard similarity to known toxins, trimmed-mean score from a five-LLM judge panel, and cosine similarity to embedding centroids) via a monotone logistic aggregator. It applies Conformal Risk Control (CRC) to certify E[FNR] ≤ α under taxonomic shift, reporting 0% test miss rate on all ten leave-one-taxonomic-family-out folds and 0% false-flag rate on nine of ten folds at α=0.05 using a 200-hazard UniProt KW-0800 subsample. The work emphasizes that calibration-set size, not algorithmic sophistication, is the binding constraint for procurement-grade α.

Significance. If the CRC certification extends beyond the support of the calibration families, the approach would supply a finite-sample, distribution-free bound on miss rate that directly mitigates the 100% false-flag collapse of list-based screening under taxonomic shift. The LOO design, open code, and explicit discussion of the 1/(n_cal+1) slack and required calibration size (18× larger for α=10^{-3}) are concrete strengths that make the empirical results reproducible and the calibration-data insight actionable.

major comments (2)
  1. [Abstract] Abstract and the CRC application section: the central claim that the screener 'certifies E[FNR] ≤ α' under taxonomic shift is load-bearing, yet CRC supplies this bound only under exchangeability between calibration and test points. The ten leave-one-family-out folds test shifts among families already present in the reviewed UniProt KW-0800 subsample; for a family entirely absent from the corpus the three signals can become arbitrarily weak (low Jaccard, uninformative LLM scores, off-centroid embeddings), rendering the logistic aggregator non-discriminative and allowing realized FNR to exceed the certified bound. The reported 0% miss rates are therefore empirical within-support results and do not extend the finite-sample guarantee to out-of-support taxonomic shifts.
  2. [Methods (CRC calibration subsection)] The construction of the calibration set and the precise definition of the risk function (FNR) used inside the CRC procedure are not fully specified in the abstract and must be verified in the methods; without them it is impossible to confirm that the monotone logistic aggregator preserves the monotonicity and boundedness properties required for the CRC guarantee to hold.
minor comments (2)
  1. [Abstract] The abstract states 'trimmed-mean score of a five-LLM judge panel' without naming the models or the trimming rule; these details are needed for reproducibility even if they appear later in the text.
  2. [Results] Figure or table reporting per-fold false-flag rates should include the exact calibration-set size used in each LOO fold so readers can directly relate the observed slack to the theoretical 1/(n_cal+1) term.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed and constructive report. The comments highlight important nuances in the scope of the CRC guarantee and the need for explicit documentation of the calibration procedure. We address each point below and will incorporate clarifications in the revised manuscript.

read point-by-point responses
  1. Referee: [Abstract] Abstract and the CRC application section: the central claim that the screener 'certifies E[FNR] ≤ α' under taxonomic shift is load-bearing, yet CRC supplies this bound only under exchangeability between calibration and test points. The ten leave-one-family-out folds test shifts among families already present in the reviewed UniProt KW-0800 subsample; for a family entirely absent from the corpus the three signals can become arbitrarily weak (low Jaccard, uninformative LLM scores, off-centroid embeddings), rendering the logistic aggregator non-discriminative and allowing realized FNR to exceed the certified bound. The reported 0% miss rates are therefore empirical within-support results and do not extend the finite-sample guarantee to out-of-support taxonomic shifts.

    Authors: We agree that the finite-sample guarantee provided by Conformal Risk Control requires exchangeability between calibration and test points. The leave-one-family-out folds evaluate performance under taxonomic shifts among families that are represented in the overall UniProt KW-0800 subsample. For a taxonomic family entirely absent from this corpus, the three signals can indeed weaken substantially, and the certified bound on E[FNR] would not necessarily hold. We will revise the abstract, the CRC application section, and the discussion to explicitly delimit the claim to taxonomic shifts within the support of the calibration families, while noting the limitation for out-of-support families. This change preserves the paper's core contribution regarding calibration data as the binding constraint for within-support screening. revision: yes

  2. Referee: [Methods (CRC calibration subsection)] The construction of the calibration set and the precise definition of the risk function (FNR) used inside the CRC procedure are not fully specified in the abstract and must be verified in the methods; without them it is impossible to confirm that the monotone logistic aggregator preserves the monotonicity and boundedness properties required for the CRC guarantee to hold.

    Authors: The methods section constructs the calibration set for each fold as the 200-hazard subsample excluding the left-out family and defines the risk function as the indicator of false negative (hazard not flagged). The logistic aggregator is monotone non-decreasing in each of its three inputs by construction. To eliminate any ambiguity, we will expand the CRC calibration subsection with an explicit paragraph stating the calibration-set construction, the mathematical definition of the risk function, and a short verification that the aggregator satisfies the monotonicity and boundedness conditions required by the CRC framework. revision: yes

Circularity Check

0 steps flagged

No circularity: CRC certification and held-out empirical results are independent of inputs

full rationale

The paper composes three external signals (k-mer Jaccard, LLM panel scores, embedding cosine), fuses them via a monotone logistic aggregator, and applies standard Conformal Risk Control to produce a finite-sample bound on E[FNR]. The reported 0% miss/false-flag rates are direct observations on ten leave-one-taxonomic-family-out held-out folds, not predictions derived from the same data by construction. No self-definitional equations, fitted parameters renamed as predictions, or load-bearing self-citations appear in the derivation chain; the CRC guarantee is invoked as an external theorem and the empirical folds are statistically separate from calibration. The derivation is therefore self-contained against the paper's own inputs.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 0 invented entities

The central claim rests on the standard finite-sample guarantee of conformal risk control and on the assumption that the chosen signals remain informative when entire taxonomic families are unseen.

free parameters (1)
  • logistic aggregator coefficients
    The monotone logistic fusion likely contains fitted parameters; their exact count and fitting procedure are not stated in the abstract.
axioms (1)
  • domain assumption Exchangeability between calibration and test samples
    Required for the conformal risk control bound to hold with the stated finite-sample slack.

pith-pipeline@v0.9.0 · 5580 in / 1378 out tokens · 39796 ms · 2026-05-09T20:25:29.177767+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

43 extracted references

  1. [1]

    The Twelfth International Conference on Learning Representations (

    Conformal Risk Control , author =. The Twelfth International Conference on Learning Representations (. 2024 , url =

  2. [2]

    The Annals of Statistics , volume =

    Conformal prediction beyond exchangeability , author =. The Annals of Statistics , volume =. 2023 , doi =

  3. [3]

    2022 , isbn =

    Algorithmic Learning in a Random World , author =. 2022 , isbn =

  4. [4]

    Journal of Molecular Biology , volume =

    Basic Local Alignment Search Tool , author =. Journal of Molecular Biology , volume =. 1990 , doi =

  5. [5]

    Sensitive protein alignments at tree-of-life scale using

    Buchfink, Benjamin and Reuter, Klaus and Drost, Hajk-Georg , journal =. Sensitive protein alignments at tree-of-life scale using. 2021 , doi =

  6. [6]

    and Zhang, Hao and Gonzalez, Joseph E

    Zheng, Lianmin and Chiang, Wei-Lin and Sheng, Ying and Zhuang, Siyuan and Wu, Zhanghao and Zhuang, Yonghao and Lin, Zi and Li, Zhuohan and Li, Dacheng and Xing, Eric P. and Zhang, Hao and Gonzalez, Joseph E. and Stoica, Ion , booktitle =. Judging. 2023 , url =

  7. [7]

    2025 , doi =

    Nucleic Acids Research , volume =. 2025 , doi =

  8. [8]

    Scikit-learn: Machine Learning in

    Pedregosa, Fabian and Varoquaux, Ga. Scikit-learn: Machine Learning in. Journal of Machine Learning Research , volume =. 2011 , url =

  9. [9]

    Increased cyber-biosecurity for

    Puzis, Rami and Farbiash, Dor and Brodt, Oleg and Elovici, Yuval and Greenbaum, Dov , journal =. Increased cyber-biosecurity for. 2020 , doi =

  10. [10]

    Journal of the ACM , volume =

    Bates, Stephen and Angelopoulos, Anastasios and Lei, Lihua and Malik, Jitendra and Jordan, Michael , title =. Journal of the ACM , volume =. 2021 , publisher =

  11. [11]

    and Wasserman, Larry , title =

    Lei, Jing and G'Sell, Max and Rinaldo, Alessandro and Tibshirani, Ryan J. and Wasserman, Larry , title =. Journal of the American Statistical Association , volume =. 2018 , doi =

  12. [12]

    and Foygel Barber, Rina and Cand

    Tibshirani, Ryan J. and Foygel Barber, Rina and Cand. Conformal Prediction Under Covariate Shift , booktitle =

  13. [13]

    Conformalized Quantile Regression , booktitle =

    Romano, Yaniv and Patterson, Evan and Cand. Conformalized Quantile Regression , booktitle =

  14. [14]

    Journal of the American Statistical Association , volume =

    Sadinle, Mauricio and Lei, Jing and Wasserman, Larry , title =. Journal of the American Statistical Association , volume =. 2019 , doi =

  15. [15]

    , title =

    Cauchois, Maxime and Gupta, Suyash and Duchi, John C. , title =. Journal of Machine Learning Research , volume =

  16. [16]

    and Bates, Stephen , title =

    Angelopoulos, Anastasios N. and Bates, Stephen , title =. Foundations and Trends in Machine Learning , volume =. 2023 , doi =

  17. [17]

    and Madden, Thomas L

    Altschul, Stephen F. and Madden, Thomas L. and Sch. Gapped. Nucleic Acids Research , volume =. 1997 , doi =

  18. [18]

    Nature Biotechnology , volume =

    Steinegger, Martin and S. Nature Biotechnology , volume =. 2017 , doi =

  19. [19]

    , title =

    Edgar, Robert C. , title =. Bioinformatics , volume =. 2010 , doi =

  20. [20]

    , title =

    Eddy, Sean R. , title =. PLOS Computational Biology , volume =. 2011 , doi =

  21. [21]

    and Sonnhammer, Erik L

    Mistry, Jaina and Chuguransky, Sara and Williams, Lowri and Qureshi, Matloob and Salazar, Gustavo A. and Sonnhammer, Erik L. L. and Tosatto, Silvio C. E. and Paladin, Lisanna and Raj, Shriya and Richardson, Lorna J. and Finn, Robert D. and Bateman, Alex , title =. Nucleic Acids Research , volume =. 2021 , doi =

  22. [22]

    and Wang, Yuqi and Huang, Hongzhan and McGarvey, Peter B

    Suzek, Baris E. and Wang, Yuqi and Huang, Hongzhan and McGarvey, Peter B. and Wu, Cathy H. and. Bioinformatics , volume =. 2015 , doi =

  23. [23]

    , title =

    Camacho, Christiam and Coulouris, George and Avagyan, Vahram and Ma, Ning and Papadopoulos, Jason and Bealer, Kevin and Madden, Thomas L. , title =. BMC Bioinformatics , volume =. 2009 , doi =

  24. [24]

    Lawrence and Ma, Jerry and Fergus, Rob , title =

    Rives, Alexander and Meier, Joshua and Sercu, Tom and Goyal, Siddharth and Lin, Zeming and Liu, Jason and Guo, Demi and Ott, Myle and Zitnick, C. Lawrence and Ma, Jerry and Fergus, Rob , title =. Proceedings of the National Academy of Sciences , volume =. 2021 , doi =

  25. [25]

    Science , volume =

    Lin, Zeming and Akin, Halil and Rao, Roshan and Hie, Brian and Zhu, Zhongkai and Lu, Wenting and Smetanin, Nikita and Verkuil, Robert and Kabeli, Ori and Shmueli, Yaniv and dos Santos Costa, Allan and Fazel-Zarandi, Maryam and Sercu, Tom and Candido, Salvatore and Rives, Alexander , title =. Science , volume =. 2023 , doi =

  26. [26]

    IEEE Transactions on Pattern Analysis and Machine Intelligence , volume =

    Elnaggar, Ahmed and Heinzinger, Michael and Dallago, Christian and Rehawi, Ghalia and Wang, Yu and Jones, Llion and Gibbs, Tom and Feher, Tamas and Angerer, Christoph and Steinegger, Martin and Bhowmik, Debsindhu and Rost, Burkhard , title =. IEEE Transactions on Pattern Analysis and Machine Intelligence , volume =. 2022 , doi =

  27. [27]

    and Subramanian, Subu and Mohr, Benjamin P

    Madani, Ali and Krause, Ben and Greene, Eric R. and Subramanian, Subu and Mohr, Benjamin P. and Holton, James M. and Olmos, Jose Luis and Xiong, Caiming and Sun, Zachary Z. and Socher, Richard and Fraser, James S. and Naik, Nikhil , title =. Nature Biotechnology , volume =. 2023 , doi =

  28. [28]

    Frontiers in Bioengineering and Biotechnology , volume =

    Diggans, James and Leproust, Emily , title =. Frontiers in Bioengineering and Biotechnology , volume =. 2019 , doi =

  29. [29]

    and Lucas, Caleb and Guest, Ella , title =

    Mouton, Christopher A. and Lucas, Caleb and Guest, Ella , title =. 2024 , url =

  30. [30]

    and Friedman, Robert M

    Carter, Sarah R. and Friedman, Robert M. , title =. 2015 , url =

  31. [31]

    Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing (EMNLP) , pages =

    Liu, Yang and Iter, Dan and Xu, Yichong and Wang, Shuohang and Xu, Ruochen and Zhu, Chenguang , title =. Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing (EMNLP) , pages =. 2023 , doi =

  32. [32]

    , title =

    Dubois, Yann and Li, Xuechen and Taori, Rohan and Zhang, Tianyi and Gulrajani, Ishaan and Ba, Jimmy and Guestrin, Carlos and Liang, Percy and Hashimoto, Tatsunori B. , title =. Advances in Neural Information Processing Systems 36 (NeurIPS 2023) , year =

  33. [33]

    , title =

    Guo, Chuan and Pleiss, Geoff and Sun, Yu and Weinberger, Kilian Q. , title =. Proceedings of the 34th International Conference on Machine Learning (ICML) , series =

  34. [34]

    Advances in Neural Information Processing Systems 30 (NIPS 2017) , year =

    Geifman, Yonatan and El-Yaniv, Ran , title =. Advances in Neural Information Processing Systems 30 (NIPS 2017) , year =

  35. [35]

    , title =

    Platt, John C. , title =. Advances in Large Margin Classifiers , editor =

  36. [36]

    Reimers, Nils and Gurevych, Iryna , title =. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP) , pages =. 2019 , doi =

  37. [37]

    Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) , pages =

    Karpukhin, Vladimir and Oguz, Barlas and Min, Sewon and Lewis, Patrick and Wu, Ledell and Edunov, Sergey and Chen, Danqi and Yih, Wen-tau , title =. Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) , pages =. 2020 , doi =

  38. [38]

    Devlin, Jacob and Chang, Ming-Wei and Lee, Kenton and Toutanova, Kristina , title =. Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers) , pages =. 2019 , doi =

  39. [39]

    , title =

    Dietterich, Thomas G. , title =. Multiple Classifier Systems , series =. 2000 , doi =

  40. [40]

    Proceedings of the Twenty-First International Conference on Machine Learning (ICML) , year =

    Caruana, Rich and Niculescu-Mizil, Alexandru and Crew, Geoff and Ksikes, Alex , title =. Proceedings of the Twenty-First International Conference on Machine Learning (ICML) , year =

  41. [41]

    , title =

    Stone, M. , title =. Journal of the Royal Statistical Society: Series B (Methodological) , volume =. 1974 , doi =

  42. [42]

    Toxicon , volume =

    Jungo, Florence and Bairoch, Amos , title =. Toxicon , volume =. 2005 , doi =

  43. [43]

    Nucleic Acids Research , volume =

    Kaas, Quentin and Yu, Rilei and Jin, Ai-Hua and Dutertre, S. Nucleic Acids Research , volume =. 2012 , doi =