Preregistration: testing the "slowest clock" law of steretic logic on the US patent technology network
Preregistration of a confirmatory test of steretic logic on the network of US patent technology classes (CPC main groups co-assigned to utility patents, PatentsView g_patent and g_cpc_current). Deposited before any of these data were downloaded or inspected. The main hypothesis (H1) states that an existing link survives while the clock (growth) of the slower of its two ends keeps running, beyond known predictors of tie persistence (link weight, age, degrees, resource allocation). H2 tests the held-out predictive gain; H3 and H4 test the specificity of privation (open versus hub common neighbours) in link survival and link formation. Decision rules, thresholds and the analysis code (SHA-256 fdbbcedab128366d125f84ccd774f00ba979dd7aa5eca2bcf8327726f792b872) are fixed in advance. All verdicts will be published whatever they are.
Authors
- Oleksandr Krol
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24423433
- Citations
- 1
- Primary Topic
- Complex Network Analysis Techniques
- Type
- preprint