Pilot corpus: NIH-funded biomedical datasets. Any DOI can be scored on demand — network effects sharpen as coverage grows.

Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut

Proceedings of the ACM on Management of Data(2024)10.1145/3651148Source: DataRank Database

Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut is a research paper published in Proceedings of the ACM on Management of Data (2024). On theSindex it has a DataRank of 0.

N/A

0DataRank · unranked

Scored on demand from live citation data

Open Access0 citations

Download PDF

Cite:

DataRank reads this dataset's downstream impact straight off the citation graph — no black box, no proprietary weighting. How is this computed?

›Methodology & internals

datarank_citation_only_1hop_v6· scope data_onlyMethodology

Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring

Enrichment:Funding (5 grants)OA: bronzeTopics (7)IDs (PubMed, PMC)

FAIR Checklist

Context only (not used in score)

Findable (1/2)

Has DOI

Accessible (1/2)

Open Access

Interoperable (0/2)

Reusable (0/3)

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

Run a calibrated FAIR evaluation for this paper →

We only score data papers we can read in full — never from an abstract alone.

Authors (6)

Max Li ORCID,Honghao Lin ORCID,Zi-Yi Tai ORCID,David P. Woodruff ORCID,Jason Zhang ORCID

Live enrichment

PubMed:39569053 PMC:PMC11576265

NSF Award

Grant: CCF (AF) 2307106

National Institute of Health

Grant: 5R01 HG 10798-2

NHGRI NIH HHS

Grant: R01 HG010798

National Science Foundation

Grant: 2307106

AF: Small: Faster Algorithms for High-Dimensional Robust Statistics

National Institutes of Health

Grant: 1R01HG010798-01

Secure and Privacy-preserving Genome-wide and Phenome-wide Association Studies via Intel Software Guard Extensions (SGX)

bronzeLicense: https://www.acm.org/publications/policies/copyright_policy#Background

publisherhttps://dl.acm.org/doi/pdf/10.1145/3651148

publisherhttps://dl.acm.org/doi/10.1145/3651148

repositoryhttps://pmc.ncbi.nlm.nih.gov/articles/PMC11576265/pdf/nihms-2027450.pdf

https://doi.org/10.1145/3651148

https://dx.doi.org/10.48550/arxiv.2406.13231

Fields of Study

0202 electrical engineering, electronic engineering, information engineering02 engineering and technology0102 computer and information sciences01 natural sciences

Keywords

FOS: Computer and information sciencesComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)