Build a plan from this source.
[Re] Learning Fair Graph Representations via Automated Data Augmentations is included below. Adapt the question and comparison, then copy or download your plan.
Make the question your own.
1 source · Exact preparation context
- [Re] Learning Fair Graph Representations via Automated Data Augmentations →
Belitsky, Max; Laitenberger, Filipe; Sheremet, Denys; Belkacemi, Nordin. [Re] Learning Fair Graph Representations via Automated Data Augmentations. ReScience C 10(1), #6; 10.5281/zenodo.16374814.
Record revision: 94766e898e2a6710da1d2f0cc8e3f385132e7f6064f2838c8baac65467b0e664
Source links open the current listing. This plan retains the revisions above; listing review does not grant permission to copy or adapt source files.
Before carrying out this plan
- Exact article-specific dependencies, data and build requirements remain uninspected.
Limits to keep in view
- No research code was executed; no independent scientific verification has been performed.
- The current qualified pilot is self-contained Python 3.13 with a 90-second author deadline. This article's environment has not been qualified for that path.
- Published source metadata and a historical review do not establish compatibility, successful reproduction, operator independence or current scientific correctness.
Edit freely. Export a copy before reloading or leaving. Your text stays in this tab until you choose to copy, download or save it privately.
Need a starting point with sources? Explore the research briefs →