[
  {
    "id": "dg13-fp",
    "categoryId": "ssip-fp-classical-heuristic",
    "paperId": "dg13",
    "date": "2013-10-29",
    "datePrecision": "day",
    "time": {
      "coefficient": 0.25,
      "expression": "O~(p^{1/4})"
    },
    "space": {
      "coefficient": null,
      "expression": "Not stated in the checked source"
    },
    "tags": [],
    "review": {
      "status": "source-checked"
    },
    "certificate": {
      "status": "not-provided",
      "lean": null
    },
    "notes": "Both input curves are defined over F_p. Section 3 explicitly describes the runtime as heuristic; GRH supplies the class-group connectivity bound.",
    "extra": {
      "input-restriction": "Both supersingular curves defined over F_p"
    },
    "evidence": {
      "url": "https://arxiv.org/pdf/1310.7789",
      "locator": "Section 3, Algorithm 1 and preceding complexity statement",
      "sourceVersion": "Checked 2026-11-08; see linked source version/date"
    }
  }
]