Evidence map›Paper›PMID 23369260›Full record

ArticleTransplantation research2012

Access to kidney transplantation: outcomes of the non-referred.

Meteb M Albugami, Romuald Panek, Steven Soroka, Karthik Tennankore, Bryce A Kiberd

Abstract read
In one paragraph

Article in Transplantation research, 2012. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.

0numbers the graph read from it
0cells of the map it votes in
7citing 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

7 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Correlates of left ventricular mass in chronic hemodialysis recipients.The international journal of cardiovascular imaging · 2014
    Observational
  7. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Meteb M AlbugamiDepartment of Medicine, Dalhousie University, Halifax, NS, Canada 5820 University Avenue, Halifax, NS, B3H 1V8, Canada. bryce.kiberd@dal.ca.
Romuald Panek
Steven Soroka
Karthik Tennankore
Bryce A Kiberd

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

unlabelled

backgroundThere is a concern that some, especially older people, are not referred and could benefit from transplantation.

methodsWe retrospectively examined consecutive incident end stage renal disease (ESRD) patients at our center from January 2006 to December 2009. At ESRD start, patients were classified into those with or without contraindications using Canadian eligibility criteria. Based on referral for transplantation, patients were grouped as CANDIDATE (no contraindication and referred), NEITHER (no contraindication and not referred) and CONTRAINDICATION. The Charlson Comorbidity Index (CCI) was used to assess comorbidity burden.

resultsOf the 437 patients, 133 (30.4%) were CANDIDATE (mean age 50 and CCI 3.0), 59 (13.5%) were NEITHER (age 76 and CCI 4.4), and 245 (56.1%) were CONTRAINDICATION (age 65 and CCI 5.5). Age was the best discriminator between NEITHER and CANDIDATES (c-statistic 0.96, P <0.0001) with CCI being less discriminative (0.692, P <0.001). CANDIDATES had excellent survival whereas those patients designated NEITHER and CONTRAINDICATION had high mortality rates. NEITHER patients died or developed a contraindication at very high rates. By 1.5 years 50% of the NEITHER patients were no longer eligible for a transplant.

conclusionsThere exists a relatively small population of incident patients not referred who have no contraindications. These are older patients with significant comorbidity who have a small window of opportunity for kidney transplantation.

Identifiers

PMID23369260
PMCPMC3561041

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.