Evidence map›Paper›PMID 41503484›Full record

ArticlemedRxiv : the preprint server for health sciences2026

A Similarity Metric, Rubric and Unified Hierarchy for Biomedical Publication Types and Study Designs.

Neil R Smalheiser, Joe D Menke, Arthur W Holt

Abstract readPreprint
In one paragraph

Article in medRxiv : the preprint server for health sciences, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

5 · Who and what money

Authors and funding

3 authors.

Neil R SmalheiserDepartment of Psychiatry, University of Illinois Chicago, Chicago, IL.ORCID 0000-0003-1079-3406
Joe D MenkeSchool of Information Sciences, University of Illinois Urbana-Champaign, Champaign, IL.ORCID 0000-0002-7374-7549
Arthur W HoltDepartment of Psychiatry, University of Illinois Chicago, Chicago, IL.ORCID 0000-0002-6110-2997

Funding

Automated Indexing for Publication Types and Study DesignsR01LM014292 · NLM · UNIVERSITY OF ILLINOIS AT CHICAGO · PI SMALHEISER, NEIL R · 2023 to 2025
$948k
NLM NIH HHS R01 LM014292
6 · The paper itself

Abstract

Objective: Our goal is to unify the 72 biomedical publication types and study designs (collectively, PTs) into a single rubric and hierarchy. Materials and Methods: This is carried out in a data-driven manner by computing pairwise similarities of each PT against all others to form a similarity matrix. By performing hierarchical clustering we place each PT in a specific category and collect these into broader categories. Results: Spearman correlations among PT pairs ranged from strongly negative to strongly positive (-0.732 to +0.997), with a mean of 0.176. Overall, we obtained 13 clusters of PTs and 5 more general categories: Observational Clinical Research, Qualitative and Genetic Methods, Clinical Evaluation and Validation, Interventional Trial Research, and Scholarly Synthesis and Discourse. These were then utilized to construct a unified hierarchy of PT terms. Discussion: The rubric provides a flexible classification scheme for publication types and study designs that can accommodate new PTs as they are added over time. Conclusion: The similarity metric has the potential to improve the modeling, implementation and evaluation of automated indexing systems. The PT rubric provides an overview that complements the existing NIH MeSH Hierarchy trees, and the unified hierarchy permits proper automated expansion for PT indexing and PubMed user queries involving PT terms.

Indexed as

BibliographicClassificationDatabasesInformation Storage and RetrievalMEDLINEPubMed

Identifiers

PMID41503484
PMCPMC12772678

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
Read underepoch 390

Registered trials

None linked

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.