The paper tackles fairness in edge prediction for graphs, proposing a new method.
problem Fairness in edge prediction for graphs, especially in underinvestigated scenarios.
method Formulated problem, proposed embedding-agnostic repairing procedure for adjacency matrix.
result Demonstrated versatility and control over fairness and prediction accuracy.