🏆 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.

A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation

Journal of Algorithms(1995)10.1006/jagm.1995.1021Source: DataRank Database
N/A
27.1DataRank · unranked
27.1
672 citations · base score 6.5
datarank_citation_only_1hop_v6· scope data_onlyMethodology
Data sources & pipeline
Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring
Enrichment:Pending

FAIR Checklist

Context only (not used in score)
Findable (2/2)
  • Has DOI
  • Indexed in repositories
Accessible (0/2)
    Interoperable (2/2)
    • DataCite relations
    • Linked datasets
    Reusable (0/3)

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

      DataRank Breakdown

      Base Score 4%Citation Network 96%

      Base Score Contribution

      0.977

      From this paper's citation signal

      Citation Network Contribution

      26.2

      From 200 citing papers with measurable signal

      Learn more about DataRank methodology →

      Top citers

      Why this DataRank?

      DataRank blends this paper's own citation count with the influence of the papers that cite it. Here, roughly 4% comes from its base citations and 96% from the citation network (200 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 →

      Authors (1)

      J. Ruppert

      Related Papers