Who Becomes a Key Developer? Relation-Aware Graph Learning on Artifact Traceability Graphs for Early Prediction

OverviewThe study investigates how developer–artifact relationships can improve the prediction of future key developers from their first six months of activity. The proposed approach constructs heterogeneous artifact traceability graphs representing developers, pull requests, issues, and files as nodes connected through typed relations and characterized by type-specific features.A customized Heterogeneous Attention Network (HAN) learns developer representations using developer-specific temporal masking. A hybrid meta-path selection procedure combines structural coverage and class discrimination to select complementary developer-to-developer interaction patterns of up to four hops.This package accompanies the experimental evaluation and analysis presented in the paper.Research QuestionsThe study addresses the following research questions:RQ1. To what extent does modeling developers’ initial activity using an artifact traceability graph improve the prediction of future key developers compared to the prior work?RQ2. Which developer–artifact interaction patterns are consistently selected and receive greater attention in predicting future key developers?

Authors

Publication Details

Journal
Figshare
Published
2026-11-05
DOI
https://doi.org/10.6084/m9.figshare.34930248
Primary Topic
Software Engineering Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Who Becomes a Key Developer? Relation-Aware Graph Learning on Artifact Traceability Graphs for Early Prediction

Eray Tüzün, Fereshteh Vedadi, Erdem Kocaoğlu
Figshare
Software Engineering Research
article

Who Becomes a Key Developer? Relation-Aware Graph Learning on Artifact Traceability Graphs for Early Prediction

Eray Tüzün, Fereshteh Vedadi, Erdem Kocaoğlu
article en

Abstract

OverviewThe study investigates how developer–artifact relationships can improve the prediction of future key developers from their first six months of activity. The proposed approach constructs heterogeneous artifact traceability graphs representing developers, pull requests, issues, and files as nodes connected through typed relations and characterized by type-specific features.A customized Heterogeneous Attention Network (HAN) learns developer representations using developer-specific temporal masking. A hybrid meta-path selection procedure combines structural coverage and class discrimination to select complementary developer-to-developer interaction patterns of up to four hops.This package accompanies the experimental evaluation and analysis presented in the paper.Research QuestionsThe study addresses the following research questions:RQ1. To what extent does modeling developers’ initial activity using an artifact traceability graph improve the prediction of future key developers compared to the prior work?RQ2. Which developer–artifact interaction patterns are consistently selected and receive greater attention in predicting future key developers?

Figshare
Openalex Percentile: Top 9%
Software Engineering Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon