{
  "kind": "original-bounded-choice-workflow",
  "version": 1,
  "scope": "Classify a supplied stored-closure ownership graph without measuring memory or treating every reference to self as a leak.",
  "question": "Review ownership. Review first for missing/conflicting storage, capture or lifetime facts. Otherwise Strong cycle means explicit strong edges form a loop through the stored closure back to its owner. Weak capture takes priority over No cycle shown when the return edge is explicitly weak/nonowning and no other strong loop exists. No cycle shown covers other complete graphs without a loop. Seeing self alone is insufficient. Do not measure leaks or recommend lifetime changes.",
  "choices": [
    "Strong cycle",
    "Weak capture",
    "No cycle shown",
    "Review"
  ],
  "actions": {
    "Strong cycle": {
      "action": "preview_jev_closure_ownership_cycle",
      "payload": {
        "decision": "Strong cycle"
      },
      "pending": true
    },
    "Weak capture": {
      "action": "preview_jev_closure_ownership_cycle",
      "payload": {
        "decision": "Weak capture"
      },
      "pending": true
    },
    "No cycle shown": {
      "action": "preview_jev_closure_ownership_cycle",
      "payload": {
        "decision": "No cycle shown"
      },
      "pending": true
    },
    "Review": {
      "action": "preview_jev_closure_ownership_cycle",
      "payload": {
        "decision": "Review"
      },
      "pending": true
    }
  },
  "samples": [
    {
      "id": "case-1",
      "label": "Stored closure captures owner",
      "expected": "Strong cycle",
      "request": {
        "context": "{\n  \"task\": \"Classify a supplied stored-closure ownership graph without measuring memory or treating every reference to self as a leak.\",\n  \"evidence\": {\n    \"storage\": \"Owner strongly retains a callback property.\",\n    \"capture\": \"That closure strongly captures the same owner.\",\n    \"lifetime\": \"Both edges persist; no other removal behavior is supplied.\"\n  }\n}",
        "question": "Review ownership. Review first for missing/conflicting storage, capture or lifetime facts. Otherwise Strong cycle means explicit strong edges form a loop through the stored closure back to its owner. Weak capture takes priority over No cycle shown when the return edge is explicitly weak/nonowning and no other strong loop exists. No cycle shown covers other complete graphs without a loop. Seeing self alone is insufficient. Do not measure leaks or recommend lifetime changes.",
        "choices": [
          "Strong cycle",
          "Weak capture",
          "No cycle shown",
          "Review"
        ]
      }
    },
    {
      "id": "case-2",
      "label": "Weak return edge",
      "expected": "Weak capture",
      "request": {
        "context": "{\n  \"task\": \"Classify a supplied stored-closure ownership graph without measuring memory or treating every reference to self as a leak.\",\n  \"evidence\": {\n    \"storage\": \"Owner strongly retains a callback.\",\n    \"capture\": \"Callback captures owner weakly.\",\n    \"lifetime\": \"Complete graph has no other strong return path.\"\n  }\n}",
        "question": "Review ownership. Review first for missing/conflicting storage, capture or lifetime facts. Otherwise Strong cycle means explicit strong edges form a loop through the stored closure back to its owner. Weak capture takes priority over No cycle shown when the return edge is explicitly weak/nonowning and no other strong loop exists. No cycle shown covers other complete graphs without a loop. Seeing self alone is insufficient. Do not measure leaks or recommend lifetime changes.",
        "choices": [
          "Strong cycle",
          "Weak capture",
          "No cycle shown",
          "Review"
        ]
      }
    },
    {
      "id": "case-3",
      "label": "External one-shot closure",
      "expected": "No cycle shown",
      "request": {
        "context": "{\n  \"task\": \"Classify a supplied stored-closure ownership graph without measuring memory or treating every reference to self as a leak.\",\n  \"evidence\": {\n    \"storage\": \"An external executor stores the closure; owner does not retain the executor or closure.\",\n    \"capture\": \"Closure strongly captures owner.\",\n    \"lifetime\": \"Complete graph has no return ownership path; executor releases closure after its one call.\"\n  }\n}",
        "question": "Review ownership. Review first for missing/conflicting storage, capture or lifetime facts. Otherwise Strong cycle means explicit strong edges form a loop through the stored closure back to its owner. Weak capture takes priority over No cycle shown when the return edge is explicitly weak/nonowning and no other strong loop exists. No cycle shown covers other complete graphs without a loop. Seeing self alone is insufficient. Do not measure leaks or recommend lifetime changes.",
        "choices": [
          "Strong cycle",
          "Weak capture",
          "No cycle shown",
          "Review"
        ]
      }
    },
    {
      "id": "case-4",
      "label": "Unknown registry ownership",
      "expected": "Review",
      "request": {
        "context": "{\n  \"task\": \"Classify a supplied stored-closure ownership graph without measuring memory or treating every reference to self as a leak.\",\n  \"evidence\": {\n    \"storage\": \"Closure is registered with an event source.\",\n    \"capture\": \"It references owner, but capture strength and subscription ownership are not supplied.\",\n    \"lifetime\": null\n  }\n}",
        "question": "Review ownership. Review first for missing/conflicting storage, capture or lifetime facts. Otherwise Strong cycle means explicit strong edges form a loop through the stored closure back to its owner. Weak capture takes priority over No cycle shown when the return edge is explicitly weak/nonowning and no other strong loop exists. No cycle shown covers other complete graphs without a loop. Seeing self alone is insufficient. Do not measure leaks or recommend lifetime changes.",
        "choices": [
          "Strong cycle",
          "Weak capture",
          "No cycle shown",
          "Review"
        ]
      }
    },
    {
      "id": "case-5",
      "label": "Indirect strong loop",
      "expected": "Strong cycle",
      "request": {
        "context": "{\n  \"task\": \"Classify a supplied stored-closure ownership graph without measuring memory or treating every reference to self as a leak.\",\n  \"evidence\": {\n    \"storage\": \"Owner strongly retains a subscription; subscription strongly retains callback.\",\n    \"capture\": \"Callback strongly captures owner.\",\n    \"lifetime\": \"All edges persist in the supplied graph.\"\n  }\n}",
        "question": "Review ownership. Review first for missing/conflicting storage, capture or lifetime facts. Otherwise Strong cycle means explicit strong edges form a loop through the stored closure back to its owner. Weak capture takes priority over No cycle shown when the return edge is explicitly weak/nonowning and no other strong loop exists. No cycle shown covers other complete graphs without a loop. Seeing self alone is insufficient. Do not measure leaks or recommend lifetime changes.",
        "choices": [
          "Strong cycle",
          "Weak capture",
          "No cycle shown",
          "Review"
        ]
      }
    },
    {
      "id": "case-6",
      "label": "Nonowning capture with known lifetime",
      "expected": "Weak capture",
      "request": {
        "context": "{\n  \"task\": \"Classify a supplied stored-closure ownership graph without measuring memory or treating every reference to self as a leak.\",\n  \"evidence\": {\n    \"storage\": \"Owner stores callback.\",\n    \"capture\": \"The return reference is explicitly nonowning.\",\n    \"lifetime\": \"Its required lifetime contract is separately established; no other strong loop exists.\"\n  }\n}",
        "question": "Review ownership. Review first for missing/conflicting storage, capture or lifetime facts. Otherwise Strong cycle means explicit strong edges form a loop through the stored closure back to its owner. Weak capture takes priority over No cycle shown when the return edge is explicitly weak/nonowning and no other strong loop exists. No cycle shown covers other complete graphs without a loop. Seeing self alone is insufficient. Do not measure leaks or recommend lifetime changes.",
        "choices": [
          "Strong cycle",
          "Weak capture",
          "No cycle shown",
          "Review"
        ]
      }
    }
  ],
  "consumer": "preview_choice_workflow.py"
}
