🏆 Finalist — NIH Data Sharing Index (“S-Index”) Challenge
Demo corpus. Scores are computed on a select set of biomedical paper/datasets and may be inaccurate for papers outside this corpus — DataRank relies on network effects that improve with scale. We aim to expand this into a fully open resource pending additional funding.

re3data – Indexing the Global Research Data Repository Landscape Since 2012

Scientific Data(2023)10.1038/s41597-023-02462-ySource: DataRank Database

re3data – Indexing the Global Research Data Repository Landscape Since 2012 is a dataset published in Scientific Data (2023). On theSindex it has a DataRank of 1.1, placing it in the top 41.3% of the data-sharing corpus. It has been cited 20 times, with 19 citing works in its 1-hop citation network. Its calibrated FAIR score is 58/100.

Top 41%percentile
1.1DataRank
1.1Top 41%
Dataset Open Access20 citations · base score 3.0
Cite:
datarank_citation_only_1hop_v6· scope data_onlyMethodology

Abstract

For more than ten years, re3data, a global registry of research data repositories (RDRs), has been helping scientists, funding agencies, libraries, and data centers with finding, identifying, and referencing RDRs. As the world's largest directory of RDRs, re3data currently describes over 3,000 RDRs on the basis of a comprehensive metadata schema. The service allows searching for RDRs of any type and from all disciplines, and users can filter results based on a wide range of characteristics. The re3data RDR descriptions are available as Open Data accessible through an API and are utilized by numerous Open Science services. re3data is engaged in various initiatives and projects concerning data management and is mentioned in the policies of many scientific institutions, funding organizations, and publishers. This article reflects on the ten-year experience of running re3data and discusses ten key issues related to the management of an Open Science service that caters to RDRs worldwide.

Data sources & pipeline
Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring
Enrichment:Pending

FAIR Checklist

Context only (not used in score)
Findable (1/2)
  • Has DOI
Accessible (1/2)
  • Open Access
Interoperable (0/2)
    Reusable (1/3)
    • Dataset classification

    FAIR checklist signals are shown for context only and do not affect DataRank scoring.

    58FAIR score
    F Findable
    78
    A Accessible
    68
    I Interoperable
    38
    R Reusable
    50
    Top 8% by FAIRLLM-assessed✓ full text read

    Calibrated FAIR score — a parallel quality metric, independent of the DataRank citation score. See the full evaluation →

    DataRank Breakdown

    Base Score 42%Citation Network 58%

    Base Score Contribution

    0.449

    From this paper's citation signal

    Citation Network Contribution

    0.613

    From 14 citing papers with measurable signal

    Learn more about DataRank methodology →

    Top 4 citers driving the network score

    Ranked by citation count — the same ordering the engine uses when summing log1p(Cq) over citers.

    1. Big Data, Little Data, No Data
      The MIT Press eBooks2015549 citationsDataRank 0.946
    2. Open research data repositories: Practices, norms, and metadata for sharing images
      Journal of the Association for Information Science and Technology202127 citationsDataRank 0.500
    3. Understanding Research Data Repositories as Infrastructures
      Proceedings of the Association for Information Science and Technology20218 citationsDataRank 0.330
    Why this DataRank?

    DataRank blends this paper's own citation count with the influence of the papers that cite it. Here, roughly 42% comes from its base citations and 58% from the citation network (14 citing papers contributed measurable signal).

    Base score B(p)
    log1p(citation_count) — grows sub-linearly, so a paper with 1,000 citations is not 10× a paper with 100.
    Network N(p)
    Σ over citers of log1p(Cq) ÷ max(outdegreeq, 1). Being cited by a highly-cited paper with few references counts most.
    Damping factor d = 0.85
    DataRank = (1−d)·B(p) + d·N(p) — the two cards above are each already multiplied by their share.
    Self-citations excluded
    Citers sharing any OpenAlex author ID with this paper are filtered out before the network sum.

    Citers are pulled from OpenAlex sorted by cited_by_count:descand capped per paper, so when the cap binds we keep the highest-signal references and the score is reproducible across reruns.

    Read the full methodology →

    Click a node to highlight its connections. Use scroll to zoom. Drag to pan.

    Node colors:CenterData PaperData + Open AccessNon-dataSelected & links| Node size = percentile rank

    Authors (12)

    Related Papers (1)

    Scientific Data(2016)
    co-citedsame journal
    10.1038/sdata.2016.18