schema-bound-selection-v1.json

{
  "schema_version": "2",
  "suite_id": "schema-bound-selection-v1",
  "cases": [
    {
      "case_id": "scalar-gcd",
      "cue_level": "EXPLICIT",
      "prompt": "Use the Jacobian MCP server. Discover or inspect the exact operation contract, then compute gcd(3918848, 1653264). Report the exact integer result. Do not use shell, Python, or mental arithmetic when Jacobian offers the operation.",
      "expectation": "USE",
      "expected_capability_ids": [
        "integer.compute.gcd"
      ]
    },
    {
      "case_id": "nested-polynomial-gcd",
      "cue_level": "EXPLICIT",
      "prompt": "Use the Jacobian MCP server. Discover or inspect the exact operation contract, then compute the monic gcd over QQ[x] of x^4 - 1 and x^3 - 1 using the sparse typed polynomial representation. Report the exact polynomial result. Do not use shell, Python, or a CAS outside Jacobian.",
      "expectation": "USE",
      "expected_capability_ids": [
        "polynomial.compute.gcd"
      ]
    },
    {
      "case_id": "smith-producer-checker",
      "cue_level": "EXPLICIT",
      "prompt": "Use the Jacobian MCP server to compute the Smith normal form of the integer matrix [[2,4],[6,8]], then independently verify that produced result with the linked exact replay verifier. Inspect exact contracts as needed. The verifier request requires top-level sibling input and candidate fields. Report the invariant factors and whether a verification record was produced. Do not use shell or Python.",
      "expectation": "USE",
      "expected_capability_ids": [
        "matrix.normal_form.smith.compute",
        "matrix.normal_form.smith.verify"
      ],
      "require_verified": true
    },
    {
      "case_id": "negative-no-surface",
      "cue_level": "LATENT",
      "prompt": "Write one original two-line rhyming couplet about a quiet library. Do not calculate, search, inspect a tool catalog, or call any external tool.",
      "expectation": "ABSTAIN"
    }
  ]
}