- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper focuses on automated software architecture recovery for large code repositories and proposes ASNER to address issues such as the difficulty of accurately reflecting responsibility ownership through file-level semantic similarity and the limited flexibility of fixed semantic neighborhood selection. The method represents code files by using structured responsibility summaries. It selects the semantic relations to retain through an adaptive semantic neighborhood algorithm and obtains initial components through a community detection algorithm. Besides, it uses ROA Agent to decide whether to adjust the component assignments of suspicious files. The authors evaluate the proposed method on 12 open-source projects, and the results show that ASNER achieves the best macro-averaged results on all five metrics among the compared methods.
Critical strengths
None
Critical weaknesses
None
Questions for authors
The paper focuses on automated software architecture recovery for large code repositories and proposes ASNER to address issues such as the difficulty of accurately reflecting responsibility ownership through file-level semantic similarity and the limited flexibility of fixed semantic neighborhood selection. The method represents code files by using structured responsibility summaries. It selects the semantic relations to retain through an adaptive semantic neighborhood algorithm and obtains initial components through a community detection algorithm. Besides, it uses ROA Agent to decide whether to adjust the component assignments of suspicious files. The authors evaluate the proposed method on 12 open-source projects, and the results show that ASNER achieves the best macro-averaged results on all five metrics among the compared methods. However, the following issues still need further clarification and revision:
- SGASN determines the number of neighbors for each file based on project scale and local similarity gaps, and the existing ablation studies provide support for its effectiveness, but comparative experiments with fixed Top-K are still needed.
- Equation (1) and the appendix provide the calculation method and parameters for the candidate bound, but the paper does not yet provide a rationale for selecting these parameters and does not report a parameter sensitivity analysis, and I recommend adding both.
- Table 2 already specifies the configurations of the first two ablation blocks, but whether “w/o ROA” retains the deterministic split and merge rules still needs to be clarified.
- Figure 4 indicates that the same file can appear in multiple reference components, but Appendix F does not clarify how such multiple memberships are handled when calculating ARI and other metrics.
Response to Reviewer 5Q7S
Thank you for your suggestions. We have added experiments and clarifications addressing your four questions:
Evaluation of multiple memberships (Q4). Figure 4 displays the original reference architecture, so a file may appear in multiple reference components. ASNER's predictions and numerical evaluation use single-label partitions. The evaluator reads memberships in the reference file's fixed component order; when a file appears more than once, the later label overwrites the earlier one, so each file is counted once. SemArc's public evaluation entry point uses the same procedure. We will clarify in Appendix F that the visualization preserves multiple memberships, whereas scoring uses a single-label reference partition.