跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.01636 · v1

What reviewers call a Long Method is a length: A pre-registered test of coupling divergence as a god-unit signal, and what it settled instead

首次提交 2026-11-01 14:39
版本更新 2026-11-01 14:39
雷达观测 2026-11-04 23:43
arXiv ↗PDF ↗

摘要

A companion study found that a complexity outlier rule shows where complexity concentrates but cannot tell a god unit from a complex algorithm. This paper pre-registered a test of one way to tell them apart: weight a unit's complexity by its coupling divergence, the data it hands on minus the data it receives, so that a leaf is set aside. Coupling was measured by resolving every call in 520 MLCQ repositories, 500 fresh Java repositories and 73 Qualitas Corpus systems. The claim fails: the primary, the pooled MCC of the weighted form minus complexity alone against MLCQ's human Blob, is -0.041 [-0.130, +0.054], no difference resolved and underpowered, and the resolved readings go against it. What the data settle is at method level. What MLCQ's reviewers call a Long Method is an absolute length: a constant of 26 lines or more, chosen on the explore half, reaches MCC 0.777 on the confirm half, +0.080 [+0.016, +0.145] over the best per-repository form; every reviewer with ten or more positives, on their non-leaf reviews, has a best cutoff between 17 and 34 lines; and nothing measured inside a method, its calls, variables, data flow or the cost of cutting it, refines the constant. The constant is a limit of human reading. The next form of the construct is the cost of bringing a long method under it, which is where the construct meets architecture.

作者备注:6 pages, 1 table. Ancillary files: the full registered report and the analysis data. Also deposited at Zenodo, doi:10.5281/zenodo.23749773

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-01 14:39 · 最新观测版本

What reviewers call a Long Method is a length: A pre-registered test of coupling divergence as a god-unit signal, and what it settled instead

A companion study found that a complexity outlier rule shows where complexity concentrates but cannot tell a god unit from a complex algorithm. This paper pre-registered a test of one way to tell them apart: weight a unit's complexity by its coupling divergence, the data it hands on minus the data it receives, so that a leaf is set aside. Coupling was measured by resolving every call in 520 MLCQ repositories, 500 fresh Java repositories and 73 Qualitas Corpus systems. The claim fails: the primary, the pooled MCC of the weighted form minus complexity alone against MLCQ's human Blob, is -0.041 [-0.130, +0.054], no difference resolved and underpowered, and the resolved readings go against it. What the data settle is at method level. What MLCQ's reviewers call a Long Method is an absolute length: a constant of 26 lines or more, chosen on the explore half, reaches MCC 0.777 on the confirm half, +0.080 [+0.016, +0.145] over the best per-repository form; every reviewer with ten or more positives, on their non-leaf reviews, has a best cutoff between 17 and 34 lines; and nothing measured inside a method, its calls, variables, data flow or the cost of cutting it, refines the constant. The constant is a limit of human reading. The next form of the construct is the cost of bringing a long method under it, which is where the construct meets architecture.

查看此版本解读 →查看此版本原文 ↗