[Re] A simple rule for the evolution of cooperation on graphs and social networks

How do cooperation frequencies vary across evaluator-generated graph families under a fixed update rule?

The evaluator checks graph properties, applies an independent small-state reference where feasible and recomputes frequencies with uncertainty across seeds.

What you could produce

• Versioned protocol, input and environment manifest, and independent per-case comparison table including uncertainty and incomplete cases.

Before you use it

• Exact article-specific dependencies, data and build requirements remain uninspected.

Limits to keep in view

• No research code was executed; no independent scientific verification has been performed.
• The current qualified pilot is self-contained Python 3.13 with a 90-second author deadline. This article's environment has not been qualified for that path.
• Published source metadata and a historical review do not establish compatibility, successful reproduction, operator independence or current scientific correctness.

Source and permission context

Stollmeier, Frank. [Re] A simple rule for the evolution of cooperation on graphs and social networks. ReScience 3(1), #5; 10.5281/zenodo.847732.

Rights need review. Review the scope and upstream conditions before reuse.

Still unresolved

• The associated code's exact license and version-specific third-party notices have not been independently checked.
• Data licenses, permissions, consent restrictions and redistribution conditions have not been independently checked.
• Artifacts are referenced only; PDF/archive contents, dependency locks and bytes have not been inspected or executed.