ArticleChemical communications (Cambridge, England)2018
Transition-metal-free C-H amidation and chlorination: synthesis of N/N'-mono-substituted imidazopyridin-2-ones from N-pyridyl-N-hydroxylamine intermediates.
Article in Chemical communications (Cambridge, England), 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
Abstract
Non-symmetric 1,3-substituted imidazopyridin-2-ones are a common structural scaffold found among many biologically active molecules. Herein we report an efficient, mild, and transition-metal free C-H amidation strategy to access such a pyrido-fused cyclic urea framework in good yields and with a broad functional group tolerance.
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.