Power laws in code repositories: A skeptical approach
May 27, 2019 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
BartolomΓ© Ortiz, J. J. Merelo-GuervΓ³s
arXiv ID
1905.11044
Category
nlin.AO
Cross-listed
cs.SE,
cs.SI
Citations
0
Venue
arXiv.org
Last Checked
3 months ago
Abstract
Software development as done using modern methodologies and source control management systems, has been often established as an example of self-organization, with code growing and evolving organically, through activities that do not stem from entralized power, leader or directives. The main challenge in proving these claims is that self organization cannot be detected through direct observation, but through measurements on the system, looking for hints such as the existence of power laws over some features, such as the size of changes over time. The problem we intend to tackle in this paper is to establish a methodology for checking, for a chosen set of repositories we had already measured in the past, if the claims about power laws actually hold from a precise mathematical point of view, since, although shown as pervasive in the software engineering literature (and others), power laws are more elusive than they might seem at first sight. For that reason, in this paper we present a statistically accurate set of tests that will help us decide, from the way repositories are changing, if they are really distributed by a power law, which could indicate us the existence of a state reached via self-organization, or actually, how accurately a power law fits the observed distribution of the size of changes of commits in git repositories of 16 open source repositories. We revisit one of the most representative papers of these observations to reevaluate its results and compare them with the current status of the repositories analyzed in it, trying to elucidate if there has been any change in the possible presence, or not, of a power law.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β nlin.AO
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
When slower is faster
R.I.P.
π»
Ghosted
Performance boost of time-delay reservoir computing by non-resonant clock cycle
R.I.P.
π»
Ghosted
Seeking Open-Ended Evolution in Swarm Chemistry II: Analyzing Long-Term Dynamics via Automated Object Harvesting
R.I.P.
π»
Ghosted
Self-Organization and Artificial Life
R.I.P.
π»
Ghosted
Using Machine Learning to Assess Short Term Causal Dependence and Infer Network Links
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Neural Architecture Search with Reinforcement Learning
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted