# Эксперимент: Subcritical Percolation Jordan Readout (#498)

{
  "worked": true,
  "confidence": 8,
  "verdict": "Built an exact-Jordan percolated candidate generator and a reproducible toy verification. The branching-process transition occurred at p=0.20–0.25 versus the predicted threshold 1/(lambda+2)=0.20; shortcut-retention simulations matched 1-(1-p lambda/n)^(WiWj), and the linear approximation error increased from 0.95% to 55.9% as qx grew. On corrupted random trees, Jordan top-8 source recall was 0.800 versus 0.767 for degree ranking and 0.150 for random selection, so the proposed structural mechanism showed a modest positive signal.",
  "metrics": {
    "baseline": "Degree top-8 localization recall: 0.7667; random top-8: 0.1500",
    "idea": "Percolated Jordan consensus top-8 recall: 0.8000; predicted branching threshold 0.200, observed transition interval 0.200–0.250; shortcut formula empirical probabilities were close to prediction"
  },
  "how_to_run": "/home/maxwelhelp/main/bin/python3 experiment.py",
  "files": [
    "experiment.py"
  ],
  "limitations": "This is a toy mechanism study, not a trained GNN comparison. It used 120 corrupted random trees, one lambda and graph size for the branching check, exact Jordan computation only on small graphs, and did not test runtime scaling, clean-versus-corrupted generalization, consistency-loss training, or the full K/L/p sweep."
}