Experiments
Searchable full-text extractions: founding hypothesis, core claims, experimental setups, key results and statistics — pulled out of each paper as structure. Search a cell line, an assay or an entity (e.g. HUH7) and find every paper that worked with it. This corpus stands on its own: most entries carry no reproduction assessment (yet).
-
Full-text index only
Separating selection from mutation in antibody language models.
PMID 41944291 · PMC13056363 · eLife · 2026 · 8 claims · 6 setups
Masked antibody language models such as AbLang2 are biased by nucleotide-level mutation processes (germline memorization, codon table, SHM rate variation)
-
Full-text index only
Multi-Omic Profiling of T Cell-Mediated Rejection After Kidney Transplantation Reveals B Cell Receptor Repertoire Expansion and Its Prognostic Relevance.
PMID 41467897 · PMC12752722 · FASEB journal : official publication of the Federation of American Societies for Experimental Biology · 2026 · 8 claims · 8 setups
The BCR repertoire, particularly the IgG isotype, is significantly expanded in TCMR compared to stable renal function (STA) across independent renal transplant cohorts
-
Full-text index only
Activation-induced cytidine deaminase acts as a mutator in BCR-ABL1-transformed acute lymphoblastic leukemia cells.
PMID 17485517 · PMC2118573 · The Journal of experimental medicine · 2007 · 8 claims · 8 setups
AID mRNA is aberrantly expressed in Ph+ ALL but largely absent in Ph- ALL
-
Full-text index only
Env-antibody coevolution identifies B cell priming as the principal bottleneck to HIV V2 apex broadly neutralizing antibody development.
PMID 41686912 · PMC13015429 · Science immunology · 2026 · 8 claims · 8 setups
Efficiency of B cell priming, not complexity of Env-guided affinity maturation, is the primary obstacle to V2 apex bNAb elicitation in SHIV-infected macaques.
-
Has reproduction · 73
treeclimbR pinpoints the data-dependent resolution of hierarchical hypotheses.
PMID 34001188 · PMC8127214 · Genome biology · 2021 · 7 claims · 6 setups
treeclimbR proposes multiple candidate resolutions on a tree and selects the optimal one in a data-driven manner using three criteria (FDR-controlling range of t, number of rejected leaves, fewest internal nodes)