Discovery of diverse thyroid hormone receptor antagonists by high-throughput docking
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
Treatment of hyperthyroidism, a common clinical condition that can have serious manifestations in the elderly, has remained essentially unchanged for >30 years. Directly antagonizing the effect of the thyroid hormone at the receptor level may be a significant improvement for the treatment of hyperthyroid patients. We built a computer model of the thyroid hormone receptor (TR) ligand-binding domain in its predicted antagonist-bound conformation and used a virtual screening algorithm to select 100 TR antagonist candidates out of a library of >250,000 compounds. We were able to obtain 75 of the compounds selected in silico and studied their ability to act as antagonists by using cultured cells that express TR. Fourteen of these compounds were found to antagonize the effect of T3 on TR with IC50s ranging from 1.5 to 30 microM. A small virtual library of compounds, derived from the highest affinity antagonist (1-850) that could be rapidly synthesized, was generated. A second round of virtual screening identified new compounds with predicted increased antagonist activity. These second generation compounds were synthesized, and their ability to act as TR antagonists was confirmed by transfection and receptor binding experiments. The extreme structural diversity of the antagonist compounds shows how receptor-based virtual screening can identify diverse chemistries that comply with the structural rules of TR antagonism.
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.001 |
| 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