CARDS: A collection of package, revision, and miscellaneous dependency graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910880002736128 |
|---|---|
| author | Tran-Girard, Euxane Bulteau, Laurent David, Pierre-Yves |
| author_facet | Tran-Girard, Euxane Bulteau, Laurent David, Pierre-Yves |
| contents | CARDS (Corpus of Acyclic Repositories and Dependency Systems) is a collection of directed graphs which express dependency relations, extracted from diverse real-world sources such as package managers, version control systems, and event graphs. Each graph contains anywhere from thousands to hundreds of millions of nodes and edges, which are normalized into a simple, unified format. Both cyclic and acyclic variants are included (as some graphs, such as citation networks, are not entirely acyclic). The dataset is suitable for studying the structure of different kinds of dependencies, enabling the characterization and distinction of various dependency graph types. It has been utilized for developing and testing efficient algorithms which leverage the specificities of source version control graphs. The collection is publicly available at doi.org/10.5281/zenodo.14245890. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_13461 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | CARDS: A collection of package, revision, and miscellaneous dependency graphs Tran-Girard, Euxane Bulteau, Laurent David, Pierre-Yves Databases Digital Libraries Social and Information Networks CARDS (Corpus of Acyclic Repositories and Dependency Systems) is a collection of directed graphs which express dependency relations, extracted from diverse real-world sources such as package managers, version control systems, and event graphs. Each graph contains anywhere from thousands to hundreds of millions of nodes and edges, which are normalized into a simple, unified format. Both cyclic and acyclic variants are included (as some graphs, such as citation networks, are not entirely acyclic). The dataset is suitable for studying the structure of different kinds of dependencies, enabling the characterization and distinction of various dependency graph types. It has been utilized for developing and testing efficient algorithms which leverage the specificities of source version control graphs. The collection is publicly available at doi.org/10.5281/zenodo.14245890. |
| title | CARDS: A collection of package, revision, and miscellaneous dependency graphs |
| topic | Databases Digital Libraries Social and Information Networks |
| url | https://arxiv.org/abs/2503.13461 |