ArticleJournal of the American Medical Informatics Association : JAMIA2025
Unmet social needs and diverticulitis: a phenotyping algorithm and cross-sectional analysis.
Article in Journal of the American Medical Informatics Association : JAMIA, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.
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
3 citing papers in PubMed.
- Natural Language Processing Algorithm Accurately Classifies Diverticulitis-Related Complications and Predicts Long-Term Outcomes.Clinical gastroenterology and hepatology : the official clinical practice journal of the American Gastroenterological Association · 2026Article
- Genetic Risk, Healthy Lifestyle, and Risk Stratification for Diverticulitis.Journal of the American College of Surgeons · 2026Article
- Returning value to communities from the All of Us Research Program through innovative approaches for data use, analysis, dissemination, and research capacity building.Journal of the American Medical Informatics Association : JAMIA · 2024Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
10 authors.
Funding
Abstract
objectiveTo validate a phenotyping algorithm for gradations of diverticular disease severity and investigate relationships between unmet social needs and disease severity. MATERIALS AND
methodsAn algorithm was designed in the All of Us Research Program to identify diverticulosis, mild diverticulitis, and operative or recurrent diverticulitis requiring multiple inpatient admissions. This was validated in an independent institution and applied to a cohort in the All of Us Research Program. Distributions of individual-level social barriers were compared across quintiles of an area-level index through fold enrichment of the barrier in the fifth (most deprived) quintile relative to the first (least deprived) quintile. Social needs of food insecurity, housing instability, and care access were included in logistic regression to assess association with disease severity.
resultsAcross disease severity groups, the phenotyping algorithm had positive predictive values ranging from 0.87 to 0.97 and negative predictive values ranging from 0.97 to 0.99. Unmet social needs were variably distributed when comparing the most to the least deprived quintile of the area-level deprivation index (fold enrichment ranging from 0.53 to 15). Relative to a reference of diverticulosis, an unmet social need was associated with greater odds of operative or recurrent inpatient diverticulitis (OR [95% CI] 1.61 [1.19-2.17]). DISCUSSION: Understanding the landscape of social barriers in disease-specific cohorts may facilitate a targeted approach when addressing these needs in clinical settings.
conclusionUsing a validated phenotyping algorithm for diverticular disease severity, unmet social needs were found to be associated with greater severity of diverticulitis presentation.
Indexed as
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.