Metraipolis › archive › dc_f3af4ecb792c
What Carries Architectural Signal? A Code-to-Architecture Mapping Study — arXiv:2610.41628
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41628
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T04:53:24.158Z
- SHA-256 of the archived text
028869eda5f53e5b94e88be170ec2a0bef40209eac4f8c3723e3310d5083a7c7- Stable URL of this page
https://metraipolis.com/documento/dc_f3af4ecb792c
How to cite
What Carries Architectural Signal? A Code-to-Architecture Mapping Study — arXiv:2610.41628 — arXiv (en), https://arxiv.org/abs/2610.41628 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f3af4ecb792c (Metraipolis archive dc_f3af4ecb792c, sha256 028869eda5f53e5b94e88be170ec2a0bef40209eac4f8c3723e3310d5083a7c7)
BibTeX
@misc{dcf3af4ecb792c,
title = {What Carries Architectural Signal? A Code-to-Architecture Mapping Study — arXiv:2610.41628},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41628},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f3af4ecb792c; sha256 028869eda5f53e5b94e88be170ec2a0bef40209eac4f8c3723e3310d5083a7c7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41628. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Code-to-architecture mapping assigns source files to modules of a reference architecture. Representations of implementation artifacts can capture code text, dependencies, and directory organization, but predictive gains alone do not establish the contribution of additional graph processing. Dependencies may already be encoded in these representations, while directories may closely match the reference decomposition. We investigate how artifact representations and graph context affect mapping on ten Java, C, and C++ systems with a limited labeling budget. We compare lexical, structural, and contextual file representations and assess each predictor with and without dependency neighbors. Using a Heterogeneous Graph Transformer (HGT), we compare file-level graphs extended with member nodes summarizing each file's program elements, folder nodes, or both, alongside a variant encoding folder paths directly in file representations. We compare folder-aware predictions with a directory rule using the same labeled files. Representations encoding dependency information outperform lexical representations on most systems. Additional neighbor aggregation can improve mapping, depending on the predictor and aggregation direction. Folder-aware variants yield the largest and most consistent gains across the evaluated HGT configurations. However, the directory rule achieves per-system median accuracy of 89-100%, and adding folder information does not consistently improve predictions for files the rule misclassifies. Member nodes provide no consistent improvement over file-level graphs. These findings support assessing what file representations and directory organization already provide before attributing improvements to graph neural networks. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Software Engineering (cs.SE) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2610.41628 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-02T04:45:12.959Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).