Typed Temporal Interaction Features for Simulation-Backed Forecasting of Open-Source Game Release Incidents
Not on the map. Why?
Abstract (arXiv)
Open-source video-game quality depends on inter-actions among code, assets, configuration, tests, contributors, and issue workflows, yet conventional defect predictors usually flatten or omit these relations. We investigate release-level forecasting of a quality incident within thirty days using GAMEQUALGRAPH-Pilot, a typed temporal feature pipeline with calibrated risk estimates and effort-aware ranking. Because the accessible OS-SGameBench materials do not provide manually audited release dates and outbreak labels, the executed evaluation is explicitly simulation-backed rather than an empirical claim about real games. Five seeded worlds each contain 120 projects and 24 releases, with project-disjoint validation and future cross-project testing. The pilot obtains an AUPRC of 0.520, AUROC of 0.673, Brier score of 0.207, and 29.68% effort-aware recall at a twenty-percent testing budget. Its closest local comparator, Static-Hetero-Reimpl, reaches 0.522 AUPRC; the -0.002 difference is not statistically significant after Holm correction. Inference requires 0.023 milliseconds per release in the measured environment. Ablations and controlled missingness, drift, engine, project-size, alert-threshold, and attribution analyses expose where typed interactions help and where they fail. Results support the reproducibility of the proposed protocol, not deployment effectiveness. Real OSSGameBench release reconstruction, stratified label audits, and official graph-model comparisons remain mandatory before journal submission or operational use in practice. This boundary protects research integrity and supports credible evaluation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 37 references that are in the map. First posted on arXiv 12 Sep 2026.
Builds on
16 of 37 references.
References · 16
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,694
- 2020CodeBERT: A Pre-Trained Model for Programming and Natural Languagescited by 1,310
- 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 448
- 2019EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphscited by 447
- 2019Devign: Effective Vulnerability Identification by Learning Comprehensive Program Semantics via Graph Neural Networkscited by 272
- 2019Representation Learning for Dynamic Graphs: A Surveycited by 265
- 2017A Survey of Machine Learning for Big Code and Naturalnesscited by 221
- 2020CC2Vec: Distributed Representations of Code Changescited by 39
4 more
- 2018The Impact of Automated Parameter Optimization on Defect Prediction Modelscited by 38
- 2023GlitchBench: Can large multimodal models detect video game glitches?cited by 23
- 2021JITLine: A Simpler, Better, Faster, Finer-grained Just-In-Time Defect Predictioncited by 15
- 2020Dataset of Video Game Development Problemscited by 3
Built on by
Not cited yet.