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

An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints

IEEE Transactions on Evolutionary Computation(2014)10.1109/tevc.2013.2281535Source: DataRank Database
Top 11%
15.8DataRank
15.8Top 11%
6591 citations · base score 8.8
datarank_citation_only_1hop_v4Methodology
Data sources & pipeline
Pipeline:CrossRefSciBERTdoi-metadataOpenAlexDataRank
Enrichment:Pending
FAIR ChecklistContext only (not used in score)
FFindable
Has DOI
AAccessible
IInteroperable
RReusable

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

DataRank Breakdown

Base Component 8%Network Component 92%

Base Score Contribution

1.3

From this paper's citation signal

Citation Network Contribution

14.5

From 187 citing papers with measurable signal

Learn more about DataRank methodology →

Authors (2)

Related Papers