## Problem 043 — rank:319

**Title:** Structural parameter identifiability

**Added binding assumptions (LaTeX):**

```latex
An instance specifies an enumerable finite design menu or a compact continuous design space with appropriate attainment assumptions; otherwise replace $\arg\min$ by an infimum and approximate designs. State whether the implication is for every parameter or only outside a proper exceptional algebraic set. Known rational-model identifiability algorithms are not reposed as open; the residual target is biologically constrained, scalable design and certification.
```

**Direct edits:** 0. **Fresh external checks:** SC01