BHB: A Simple Knowledge-Based Scoring Function to Improve the Efficiency of Database Screening
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
A new knowledge-based scoring function was developed in this work to facilitate the rapid ranking of ligands in databases. The acronym of the method is BHB based on the descriptors it utilizes: buriedness, hydrogen bonding, and binding energy. Receptor buriedness is a measure of how well molecules occupy the binding pocket in comparison to known high-affinity ligands or, alternatively, whether they have contact with identified residues in the pocket. The possibility of hydrogen bond formation is checked for selected residues that are recognized as being important in the binding of known ligands. The approximate binding energy is calculated from the thermodynamic cycle using the optimized bound and free solvent conformations of the ligand-receptor system. The information necessary for the scoring function can ideally be gleaned from the 3D structure of the receptor-ligand complex. Alternatively, the descriptors can be derived from the 3D structure of the unbound receptor, provided this receptor has a known ligand that binds to the given site with nanomolar activity. We show that the new scoring functions provide up to 12 times improvement in enrichment compared to the popular commercial docking program GOLD.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it