admission: END is accepted as an edge source and START as a target, so a graph that cannot be built is admitted #108

Description

@Shashankss1205

What happens

_check_endpoints accepts START and END in either role:

forrole, endpointin (("source", edge.source), ("target", edge.target)):
ifendpointin_SENTINELSorendpointinnamesorendpointinself.known_nodes:
continue

But the sentinels are directional — START is the graph's entry and END its exit — so a proposal carrying END -> x or x -> START is admitted and then dies in Materializer:

END -> work admitted=True -> MaterializationError: ... ValueError: END cannot be a start node
work -> START admitted=True -> MaterializationError: ... ValueError: START cannot be an end node

Reproduce:

fromgrapharc.plannerimport (
AdmissionChecker, CostEstimate, EdgePolicy, EdgeRule, Materializer,
NodeRegistry, NodeSpec, ProposedEdge, ProposedNode, Subgraph,
)
fromgrapharc.runtime.graphimportSTART, ENDfromgrapharc.runtime.stateimportGraphARCStateclassS(GraphARCState):
note: str=""reg=NodeRegistry([NodeSpec(name="work", description="w",
worst_case=CostEstimate(iterations=1),
factory=lambdabuild: (lambdastate: {"note": "ran"}))])
ck=AdmissionChecker(registry=reg, edge_policy=EdgePolicy(rules=(EdgeRule(action="allow"),)))
mz=Materializer(registry=reg, state_schema=S, writes={"work": {"note"}})
sub=Subgraph(
nodes=(ProposedNode(name="work", kind="work"),),
edges=(ProposedEdge(source=START, target="work"),
ProposedEdge(source=END, target="work")),
)
r=ck.check(sub)
print(r.admitted) # Truemz.materialize(r, sub) # MaterializationError: END cannot be a start node

Why it matters

Not because the run proceeds — it does not — but because the failure is charged to the wrong allowance and reaches the planner in the wrong shape.

GovernedLoop counts a MaterializationError as an execution failure:

exceptMaterializationErrorasexc:
return_Execution(state=state, materialization_error=f"could not be built: {exc}")

which lands in failed_in_a_row against max_consecutive_execution_failures (2) rather than rejected_in_a_row against max_consecutive_rejections (3). So a planner gets fewer retries for a mistake admission is supposed to catch than for one it does catch, and two of these in a row end the run with LoopStop.EXECUTION_FAILED — a stop reason that says the graph ran and failed, when nothing ran at all.

The second half is the shape. A rejection is meant to be data: AdmissionResult.feedback() hands the planner a per-check list of codes and remedies, and the loop never retries an identical proposal. What the planner gets here instead is prose assembled from an exception:

The subgraph you proposed did not run: could not be built: proposal 0fcdafa536eb
was admitted but could not be assembled into a graph: ValueError: END cannot be
a start node. Propose something that addresses that.

There is no reason code, no remedy, and nothing on the admission trace event's failed-check list — because admission did not fail. The gate said yes to a graph that cannot exist.

The prompt already tells models the right rule (proposal.py: "__start__ and __end__ are the graph's own entry and exit. Never use..."). The gate is what does not enforce it, and the gate is the part that is supposed to hold when the model does not.

Where in the code

  • grapharc/planner/admission.py_check_endpoints, the loop over ("source", ...), ("target", ...)
  • grapharc/planner/proposal.py_SENTINELS, and the prompt text that already states the rule
  • grapharc/planner/loop.pyexcept MaterializationError, and the two separate max_consecutive_* counters

What to change

Reject END as a source and START as a target under Check.REGISTRY, with a reason code and a remedy in the same shape every other rejection uses. Both endpoints of an edge should still be reported rather than only the first, matching the existing posture.

Deliberately not in scope: whether a MaterializationError should count against the rejection allowance in general. That is a separate question about the loop, and closing this one removes the only known way to reach it from a well-formed proposal.

Acceptance criteria

  • A proposal with END -> x or x -> START is refused by admission with a reason code and a remedy, and appears on the admission trace event's failed-check list
  • Nothing is materialised and no factory is called
  • The normal START -> ... -> END shape still admits
  • uv run pytest green, uv run ruff check . clean

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions

      , 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Add copy buttons to all
       blocks\n(function() {\n function addCopyButtons() {\n document.querySelectorAll('pre code').forEach(function(codeBlock) {\n if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;\n codeBlock.parentElement.setAttribute('data-copy-added', 'true');\n \n var btn = document.createElement('button');\n btn.textContent = 'Copy';\n btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';\n btn.onmouseover = function() { this.style.opacity = '1'; };\n btn.onmouseout = function() { this.style.opacity = '0.7'; };\n btn.onclick = function() {\n navigator.clipboard.writeText(codeBlock.textContent).then(function() {\n btn.textContent = 'Copied!';\n setTimeout(function() { btn.textContent = 'Copy'; }, 1500);\n });\n };\n codeBlock.parentElement.style.position = 'relative';\n codeBlock.parentElement.appendChild(btn);\n });\n }\n \n addCopyButtons();\n \n // Re-run on dynamic content\n var observer = new MutationObserver(addCopyButtons);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Add Copy Buttons to Code Blocks");
      }
      } catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
      })();
      (function(){
      try {
      var __m = "github.com";
      var __re = new RegExp('^' + "github\\.com" + '
      
      Skip to content

      admission: END is accepted as an edge source and START as a target, so a graph that cannot be built is admitted #108

      Description

      @Shashankss1205

      What happens

      _check_endpoints accepts START and END in either role:

      forrole, endpointin (("source", edge.source), ("target", edge.target)):
      ifendpointin_SENTINELSorendpointinnamesorendpointinself.known_nodes:
      continue

      But the sentinels are directional — START is the graph's entry and END its exit — so a proposal carrying END -> x or x -> START is admitted and then dies in Materializer:

      END -> work admitted=True -> MaterializationError: ... ValueError: END cannot be a start node
      work -> START admitted=True -> MaterializationError: ... ValueError: START cannot be an end node
      

      Reproduce:

      fromgrapharc.plannerimport (
      AdmissionChecker, CostEstimate, EdgePolicy, EdgeRule, Materializer,
      NodeRegistry, NodeSpec, ProposedEdge, ProposedNode, Subgraph,
      )
      fromgrapharc.runtime.graphimportSTART, ENDfromgrapharc.runtime.stateimportGraphARCStateclassS(GraphARCState):
      note: str=""reg=NodeRegistry([NodeSpec(name="work", description="w",
      worst_case=CostEstimate(iterations=1),
      factory=lambdabuild: (lambdastate: {"note": "ran"}))])
      ck=AdmissionChecker(registry=reg, edge_policy=EdgePolicy(rules=(EdgeRule(action="allow"),)))
      mz=Materializer(registry=reg, state_schema=S, writes={"work": {"note"}})
      sub=Subgraph(
      nodes=(ProposedNode(name="work", kind="work"),),
      edges=(ProposedEdge(source=START, target="work"),
      ProposedEdge(source=END, target="work")),
      )
      r=ck.check(sub)
      print(r.admitted) # Truemz.materialize(r, sub) # MaterializationError: END cannot be a start node

      Why it matters

      Not because the run proceeds — it does not — but because the failure is charged to the wrong allowance and reaches the planner in the wrong shape.

      GovernedLoop counts a MaterializationError as an execution failure:

      exceptMaterializationErrorasexc:
      return_Execution(state=state, materialization_error=f"could not be built: {exc}")

      which lands in failed_in_a_row against max_consecutive_execution_failures (2) rather than rejected_in_a_row against max_consecutive_rejections (3). So a planner gets fewer retries for a mistake admission is supposed to catch than for one it does catch, and two of these in a row end the run with LoopStop.EXECUTION_FAILED — a stop reason that says the graph ran and failed, when nothing ran at all.

      The second half is the shape. A rejection is meant to be data: AdmissionResult.feedback() hands the planner a per-check list of codes and remedies, and the loop never retries an identical proposal. What the planner gets here instead is prose assembled from an exception:

      The subgraph you proposed did not run: could not be built: proposal 0fcdafa536eb
      was admitted but could not be assembled into a graph: ValueError: END cannot be
      a start node. Propose something that addresses that.
      

      There is no reason code, no remedy, and nothing on the admission trace event's failed-check list — because admission did not fail. The gate said yes to a graph that cannot exist.

      The prompt already tells models the right rule (proposal.py: "__start__ and __end__ are the graph's own entry and exit. Never use..."). The gate is what does not enforce it, and the gate is the part that is supposed to hold when the model does not.

      Where in the code

      • grapharc/planner/admission.py_check_endpoints, the loop over ("source", ...), ("target", ...)
      • grapharc/planner/proposal.py_SENTINELS, and the prompt text that already states the rule
      • grapharc/planner/loop.pyexcept MaterializationError, and the two separate max_consecutive_* counters

      What to change

      Reject END as a source and START as a target under Check.REGISTRY, with a reason code and a remedy in the same shape every other rejection uses. Both endpoints of an edge should still be reported rather than only the first, matching the existing posture.

      Deliberately not in scope: whether a MaterializationError should count against the rejection allowance in general. That is a separate question about the loop, and closing this one removes the only known way to reach it from a well-formed proposal.

      Acceptance criteria

      • A proposal with END -> x or x -> START is refused by admission with a reason code and a remedy, and appears on the admission trace event's failed-check list
      • Nothing is materialised and no factory is called
      • The normal START -> ... -> END shape still admits
      • uv run pytest green, uv run ruff check . clean

      Activity

      Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

      Metadata

      Metadata

      Assignees

      No one assigned

        Labels

        No labels
        No labels

        Type

        No type

        Projects

        No projects

          Milestone

          No milestone

          Relationships

          None yet

          Development

          No branches or pull requests

          Issue actions

          , 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Force GitHub README to respect dark mode\n(function() {\n var style = document.createElement('style');\n style.textContent = '\n .markdown-body {\n color-scheme: dark light;\n }\n .markdown-body pre { background: #161b22 !important; }\n .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; }\n .markdown-body table th, .markdown-body table td { border-color: #30363d !important; }\n .markdown-body img { background: #0d1117; }\n .markdown-body blockquote { border-left-color: #8b949e; }\n .markdown-body hr { border-color: #30363d; }\n ';\n document.head.appendChild(style);\n})();", "GitHub Dark Mode README Fix"); } } catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
          Skip to content

          admission: END is accepted as an edge source and START as a target, so a graph that cannot be built is admitted #108

          Description

          @Shashankss1205

          What happens

          _check_endpoints accepts START and END in either role:

          forrole, endpointin (("source", edge.source), ("target", edge.target)):
          ifendpointin_SENTINELSorendpointinnamesorendpointinself.known_nodes:
          continue

          But the sentinels are directional — START is the graph's entry and END its exit — so a proposal carrying END -> x or x -> START is admitted and then dies in Materializer:

          END -> work admitted=True -> MaterializationError: ... ValueError: END cannot be a start node
          work -> START admitted=True -> MaterializationError: ... ValueError: START cannot be an end node
          

          Reproduce:

          fromgrapharc.plannerimport (
          AdmissionChecker, CostEstimate, EdgePolicy, EdgeRule, Materializer,
          NodeRegistry, NodeSpec, ProposedEdge, ProposedNode, Subgraph,
          )
          fromgrapharc.runtime.graphimportSTART, ENDfromgrapharc.runtime.stateimportGraphARCStateclassS(GraphARCState):
          note: str=""reg=NodeRegistry([NodeSpec(name="work", description="w",
          worst_case=CostEstimate(iterations=1),
          factory=lambdabuild: (lambdastate: {"note": "ran"}))])
          ck=AdmissionChecker(registry=reg, edge_policy=EdgePolicy(rules=(EdgeRule(action="allow"),)))
          mz=Materializer(registry=reg, state_schema=S, writes={"work": {"note"}})
          sub=Subgraph(
          nodes=(ProposedNode(name="work", kind="work"),),
          edges=(ProposedEdge(source=START, target="work"),
          ProposedEdge(source=END, target="work")),
          )
          r=ck.check(sub)
          print(r.admitted) # Truemz.materialize(r, sub) # MaterializationError: END cannot be a start node

          Why it matters

          Not because the run proceeds — it does not — but because the failure is charged to the wrong allowance and reaches the planner in the wrong shape.

          GovernedLoop counts a MaterializationError as an execution failure:

          exceptMaterializationErrorasexc:
          return_Execution(state=state, materialization_error=f"could not be built: {exc}")

          which lands in failed_in_a_row against max_consecutive_execution_failures (2) rather than rejected_in_a_row against max_consecutive_rejections (3). So a planner gets fewer retries for a mistake admission is supposed to catch than for one it does catch, and two of these in a row end the run with LoopStop.EXECUTION_FAILED — a stop reason that says the graph ran and failed, when nothing ran at all.

          The second half is the shape. A rejection is meant to be data: AdmissionResult.feedback() hands the planner a per-check list of codes and remedies, and the loop never retries an identical proposal. What the planner gets here instead is prose assembled from an exception:

          The subgraph you proposed did not run: could not be built: proposal 0fcdafa536eb
          was admitted but could not be assembled into a graph: ValueError: END cannot be
          a start node. Propose something that addresses that.
          

          There is no reason code, no remedy, and nothing on the admission trace event's failed-check list — because admission did not fail. The gate said yes to a graph that cannot exist.

          The prompt already tells models the right rule (proposal.py: "__start__ and __end__ are the graph's own entry and exit. Never use..."). The gate is what does not enforce it, and the gate is the part that is supposed to hold when the model does not.

          Where in the code

          • grapharc/planner/admission.py_check_endpoints, the loop over ("source", ...), ("target", ...)
          • grapharc/planner/proposal.py_SENTINELS, and the prompt text that already states the rule
          • grapharc/planner/loop.pyexcept MaterializationError, and the two separate max_consecutive_* counters

          What to change

          Reject END as a source and START as a target under Check.REGISTRY, with a reason code and a remedy in the same shape every other rejection uses. Both endpoints of an edge should still be reported rather than only the first, matching the existing posture.

          Deliberately not in scope: whether a MaterializationError should count against the rejection allowance in general. That is a separate question about the loop, and closing this one removes the only known way to reach it from a well-formed proposal.

          Acceptance criteria

          • A proposal with END -> x or x -> START is refused by admission with a reason code and a remedy, and appears on the admission trace event's failed-check list
          • Nothing is materialised and no factory is called
          • The normal START -> ... -> END shape still admits
          • uv run pytest green, uv run ruff check . clean

          Activity

          Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

          Metadata

          Metadata

          Assignees

          No one assigned

            Labels

            No labels
            No labels

            Type

            No type

            Projects

            No projects

              Milestone

              No milestone

              Relationships

              None yet

              Development

              No branches or pull requests

              Issue actions

              , 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Highlight search terms from Google/DuckDuckGo/Bing referrer\n(function() {\n var ref = document.referrer;\n var terms = [];\n \n if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) {\n var url = new URL(ref);\n var q = url.searchParams.get('q') || url.searchParams.get('p');\n if (q) {\n terms = q.split(/\\s+/).filter(function(t) { return t.length > 2; });\n }\n }\n \n if (terms.length === 0) return;\n \n var style = document.createElement('style');\n style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }';\n document.head.appendChild(style);\n \n function highlight(node) {\n if (node.nodeType === 3) { // text node\n var text = node.textContent;\n var found = false;\n terms.forEach(function(term) {\n var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\') + ')', 'gi');\n if (regex.test(text)) {\n found = true;\n var frag = document.createDocumentFragment();\n var parts = text.split(regex);\n parts.forEach(function(part, i) {\n if (i % 2 === 0) {\n frag.appendChild(document.createTextNode(part));\n } else {\n var span = document.createElement('span');\n span.className = 'userscript-highlight';\n span.textContent = part;\n frag.appendChild(span);\n }\n });\n node.parentNode.replaceChild(frag, node);\n }\n });\n } else if (node.nodeType === 1 && node.childNodes) { // element\n var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT'];\n if (!skipTags.includes(node.tagName)) {\n Array.from(node.childNodes).forEach(highlight);\n }\n }\n }\n \n highlight(document.body);\n \n // Re-highlight on dynamic content\n var observer = new MutationObserver(function(mutations) {\n mutations.forEach(function(m) {\n m.addedNodes.forEach(function(node) {\n if (node.nodeType === 1 || node.nodeType === 3) highlight(node);\n });\n });\n });\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Highlight Search Terms"); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
              Skip to content

              admission: END is accepted as an edge source and START as a target, so a graph that cannot be built is admitted #108

              Description

              @Shashankss1205

              What happens

              _check_endpoints accepts START and END in either role:

              forrole, endpointin (("source", edge.source), ("target", edge.target)):
              ifendpointin_SENTINELSorendpointinnamesorendpointinself.known_nodes:
              continue

              But the sentinels are directional — START is the graph's entry and END its exit — so a proposal carrying END -> x or x -> START is admitted and then dies in Materializer:

              END -> work admitted=True -> MaterializationError: ... ValueError: END cannot be a start node
              work -> START admitted=True -> MaterializationError: ... ValueError: START cannot be an end node
              

              Reproduce:

              fromgrapharc.plannerimport (
              AdmissionChecker, CostEstimate, EdgePolicy, EdgeRule, Materializer,
              NodeRegistry, NodeSpec, ProposedEdge, ProposedNode, Subgraph,
              )
              fromgrapharc.runtime.graphimportSTART, ENDfromgrapharc.runtime.stateimportGraphARCStateclassS(GraphARCState):
              note: str=""reg=NodeRegistry([NodeSpec(name="work", description="w",
              worst_case=CostEstimate(iterations=1),
              factory=lambdabuild: (lambdastate: {"note": "ran"}))])
              ck=AdmissionChecker(registry=reg, edge_policy=EdgePolicy(rules=(EdgeRule(action="allow"),)))
              mz=Materializer(registry=reg, state_schema=S, writes={"work": {"note"}})
              sub=Subgraph(
              nodes=(ProposedNode(name="work", kind="work"),),
              edges=(ProposedEdge(source=START, target="work"),
              ProposedEdge(source=END, target="work")),
              )
              r=ck.check(sub)
              print(r.admitted) # Truemz.materialize(r, sub) # MaterializationError: END cannot be a start node

              Why it matters

              Not because the run proceeds — it does not — but because the failure is charged to the wrong allowance and reaches the planner in the wrong shape.

              GovernedLoop counts a MaterializationError as an execution failure:

              exceptMaterializationErrorasexc:
              return_Execution(state=state, materialization_error=f"could not be built: {exc}")

              which lands in failed_in_a_row against max_consecutive_execution_failures (2) rather than rejected_in_a_row against max_consecutive_rejections (3). So a planner gets fewer retries for a mistake admission is supposed to catch than for one it does catch, and two of these in a row end the run with LoopStop.EXECUTION_FAILED — a stop reason that says the graph ran and failed, when nothing ran at all.

              The second half is the shape. A rejection is meant to be data: AdmissionResult.feedback() hands the planner a per-check list of codes and remedies, and the loop never retries an identical proposal. What the planner gets here instead is prose assembled from an exception:

              The subgraph you proposed did not run: could not be built: proposal 0fcdafa536eb
              was admitted but could not be assembled into a graph: ValueError: END cannot be
              a start node. Propose something that addresses that.
              

              There is no reason code, no remedy, and nothing on the admission trace event's failed-check list — because admission did not fail. The gate said yes to a graph that cannot exist.

              The prompt already tells models the right rule (proposal.py: "__start__ and __end__ are the graph's own entry and exit. Never use..."). The gate is what does not enforce it, and the gate is the part that is supposed to hold when the model does not.

              Where in the code

              • grapharc/planner/admission.py_check_endpoints, the loop over ("source", ...), ("target", ...)
              • grapharc/planner/proposal.py_SENTINELS, and the prompt text that already states the rule
              • grapharc/planner/loop.pyexcept MaterializationError, and the two separate max_consecutive_* counters

              What to change

              Reject END as a source and START as a target under Check.REGISTRY, with a reason code and a remedy in the same shape every other rejection uses. Both endpoints of an edge should still be reported rather than only the first, matching the existing posture.

              Deliberately not in scope: whether a MaterializationError should count against the rejection allowance in general. That is a separate question about the loop, and closing this one removes the only known way to reach it from a well-formed proposal.

              Acceptance criteria

              • A proposal with END -> x or x -> START is refused by admission with a reason code and a remedy, and appears on the admission trace event's failed-check list
              • Nothing is materialised and no factory is called
              • The normal START -> ... -> END shape still admits
              • uv run pytest green, uv run ruff check . clean

              Activity

              Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

              Metadata

              Metadata

              Assignees

              No one assigned

                Labels

                No labels
                No labels

                Type

                No type

                Projects

                No projects

                  Milestone

                  No milestone

                  Relationships

                  None yet

                  Development

                  No branches or pull requests

                  Issue actions

                  , 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Strip utm_, fbclid, gclid, etc. from all links on page\n(function() {\n var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content',\n 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid',\n 'ref', 'ref_src', 'source', 'medium', 'campaign'];\n \n function cleanUrl(url) {\n try {\n var u = new URL(url, window.location.origin);\n var changed = false;\n trackingParams.forEach(function(p) {\n if (u.searchParams.has(p)) {\n u.searchParams.delete(p);\n changed = true;\n }\n });\n return changed ? u.toString() : url;\n } catch (e) {\n return url;\n }\n }\n \n function cleanLinks() {\n document.querySelectorAll('a[href]').forEach(function(a) {\n var clean = cleanUrl(a.href);\n if (clean !== a.href) a.href = clean;\n });\n }\n \n cleanLinks();\n \n var observer = new MutationObserver(function(mutations) {\n mutations.forEach(function(m) {\n m.addedNodes.forEach(function(node) {\n if (node.nodeType === 1) {\n if (node.tagName === 'A') cleanLinks();\n node.querySelectorAll('a[href]').forEach(function(a) {\n var clean = cleanUrl(a.href);\n if (clean !== a.href) a.href = clean;\n });\n }\n });\n });\n });\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Remove Tracking Parameters from Links"); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + '
                  Skip to content

                  admission: END is accepted as an edge source and START as a target, so a graph that cannot be built is admitted #108

                  Description

                  @Shashankss1205

                  What happens

                  _check_endpoints accepts START and END in either role:

                  forrole, endpointin (("source", edge.source), ("target", edge.target)):
                  ifendpointin_SENTINELSorendpointinnamesorendpointinself.known_nodes:
                  continue

                  But the sentinels are directional — START is the graph's entry and END its exit — so a proposal carrying END -> x or x -> START is admitted and then dies in Materializer:

                  END -> work admitted=True -> MaterializationError: ... ValueError: END cannot be a start node
                  work -> START admitted=True -> MaterializationError: ... ValueError: START cannot be an end node
                  

                  Reproduce:

                  fromgrapharc.plannerimport (
                  AdmissionChecker, CostEstimate, EdgePolicy, EdgeRule, Materializer,
                  NodeRegistry, NodeSpec, ProposedEdge, ProposedNode, Subgraph,
                  )
                  fromgrapharc.runtime.graphimportSTART, ENDfromgrapharc.runtime.stateimportGraphARCStateclassS(GraphARCState):
                  note: str=""reg=NodeRegistry([NodeSpec(name="work", description="w",
                  worst_case=CostEstimate(iterations=1),
                  factory=lambdabuild: (lambdastate: {"note": "ran"}))])
                  ck=AdmissionChecker(registry=reg, edge_policy=EdgePolicy(rules=(EdgeRule(action="allow"),)))
                  mz=Materializer(registry=reg, state_schema=S, writes={"work": {"note"}})
                  sub=Subgraph(
                  nodes=(ProposedNode(name="work", kind="work"),),
                  edges=(ProposedEdge(source=START, target="work"),
                  ProposedEdge(source=END, target="work")),
                  )
                  r=ck.check(sub)
                  print(r.admitted) # Truemz.materialize(r, sub) # MaterializationError: END cannot be a start node

                  Why it matters

                  Not because the run proceeds — it does not — but because the failure is charged to the wrong allowance and reaches the planner in the wrong shape.

                  GovernedLoop counts a MaterializationError as an execution failure:

                  exceptMaterializationErrorasexc:
                  return_Execution(state=state, materialization_error=f"could not be built: {exc}")

                  which lands in failed_in_a_row against max_consecutive_execution_failures (2) rather than rejected_in_a_row against max_consecutive_rejections (3). So a planner gets fewer retries for a mistake admission is supposed to catch than for one it does catch, and two of these in a row end the run with LoopStop.EXECUTION_FAILED — a stop reason that says the graph ran and failed, when nothing ran at all.

                  The second half is the shape. A rejection is meant to be data: AdmissionResult.feedback() hands the planner a per-check list of codes and remedies, and the loop never retries an identical proposal. What the planner gets here instead is prose assembled from an exception:

                  The subgraph you proposed did not run: could not be built: proposal 0fcdafa536eb
                  was admitted but could not be assembled into a graph: ValueError: END cannot be
                  a start node. Propose something that addresses that.
                  

                  There is no reason code, no remedy, and nothing on the admission trace event's failed-check list — because admission did not fail. The gate said yes to a graph that cannot exist.

                  The prompt already tells models the right rule (proposal.py: "__start__ and __end__ are the graph's own entry and exit. Never use..."). The gate is what does not enforce it, and the gate is the part that is supposed to hold when the model does not.

                  Where in the code

                  • grapharc/planner/admission.py_check_endpoints, the loop over ("source", ...), ("target", ...)
                  • grapharc/planner/proposal.py_SENTINELS, and the prompt text that already states the rule
                  • grapharc/planner/loop.pyexcept MaterializationError, and the two separate max_consecutive_* counters

                  What to change

                  Reject END as a source and START as a target under Check.REGISTRY, with a reason code and a remedy in the same shape every other rejection uses. Both endpoints of an edge should still be reported rather than only the first, matching the existing posture.

                  Deliberately not in scope: whether a MaterializationError should count against the rejection allowance in general. That is a separate question about the loop, and closing this one removes the only known way to reach it from a well-formed proposal.

                  Acceptance criteria

                  • A proposal with END -> x or x -> START is refused by admission with a reason code and a remedy, and appears on the admission trace event's failed-check list
                  • Nothing is materialised and no factory is called
                  • The normal START -> ... -> END shape still admits
                  • uv run pytest green, uv run ruff check . clean

                  Activity

                  Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

                  Metadata

                  Metadata

                  Assignees

                  No one assigned

                    Labels

                    No labels
                    No labels

                    Type

                    No type

                    Projects

                    No projects

                      Milestone

                      No milestone

                      Relationships

                      None yet

                      Development

                      No branches or pull requests

                      Issue actions

                      , 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Auto-enable theater mode on YouTube\n(function() {\n function tryTheater() {\n var btn = document.querySelector('button[aria-label=\"Theater mode\"], ytd-player #player button[title=\"Theater mode\"]');\n if (btn && !btn.classList.contains('activated')) {\n btn.click();\n }\n }\n \n // Try immediately\n tryTheater();\n \n // Try after navigation (SPA)\n var lastUrl = location.href;\n setInterval(function() {\n if (location.href !== lastUrl) {\n lastUrl = location.href;\n setTimeout(tryTheater, 500);\n }\n }, 1000);\n \n // Also try on player load\n var observer = new MutationObserver(tryTheater);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "YouTube Theater Mode Default"); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
                      Skip to content

                      admission: END is accepted as an edge source and START as a target, so a graph that cannot be built is admitted #108

                      Description

                      @Shashankss1205

                      What happens

                      _check_endpoints accepts START and END in either role:

                      forrole, endpointin (("source", edge.source), ("target", edge.target)):
                      ifendpointin_SENTINELSorendpointinnamesorendpointinself.known_nodes:
                      continue

                      But the sentinels are directional — START is the graph's entry and END its exit — so a proposal carrying END -> x or x -> START is admitted and then dies in Materializer:

                      END -> work admitted=True -> MaterializationError: ... ValueError: END cannot be a start node
                      work -> START admitted=True -> MaterializationError: ... ValueError: START cannot be an end node
                      

                      Reproduce:

                      fromgrapharc.plannerimport (
                      AdmissionChecker, CostEstimate, EdgePolicy, EdgeRule, Materializer,
                      NodeRegistry, NodeSpec, ProposedEdge, ProposedNode, Subgraph,
                      )
                      fromgrapharc.runtime.graphimportSTART, ENDfromgrapharc.runtime.stateimportGraphARCStateclassS(GraphARCState):
                      note: str=""reg=NodeRegistry([NodeSpec(name="work", description="w",
                      worst_case=CostEstimate(iterations=1),
                      factory=lambdabuild: (lambdastate: {"note": "ran"}))])
                      ck=AdmissionChecker(registry=reg, edge_policy=EdgePolicy(rules=(EdgeRule(action="allow"),)))
                      mz=Materializer(registry=reg, state_schema=S, writes={"work": {"note"}})
                      sub=Subgraph(
                      nodes=(ProposedNode(name="work", kind="work"),),
                      edges=(ProposedEdge(source=START, target="work"),
                      ProposedEdge(source=END, target="work")),
                      )
                      r=ck.check(sub)
                      print(r.admitted) # Truemz.materialize(r, sub) # MaterializationError: END cannot be a start node

                      Why it matters

                      Not because the run proceeds — it does not — but because the failure is charged to the wrong allowance and reaches the planner in the wrong shape.

                      GovernedLoop counts a MaterializationError as an execution failure:

                      exceptMaterializationErrorasexc:
                      return_Execution(state=state, materialization_error=f"could not be built: {exc}")

                      which lands in failed_in_a_row against max_consecutive_execution_failures (2) rather than rejected_in_a_row against max_consecutive_rejections (3). So a planner gets fewer retries for a mistake admission is supposed to catch than for one it does catch, and two of these in a row end the run with LoopStop.EXECUTION_FAILED — a stop reason that says the graph ran and failed, when nothing ran at all.

                      The second half is the shape. A rejection is meant to be data: AdmissionResult.feedback() hands the planner a per-check list of codes and remedies, and the loop never retries an identical proposal. What the planner gets here instead is prose assembled from an exception:

                      The subgraph you proposed did not run: could not be built: proposal 0fcdafa536eb
                      was admitted but could not be assembled into a graph: ValueError: END cannot be
                      a start node. Propose something that addresses that.
                      

                      There is no reason code, no remedy, and nothing on the admission trace event's failed-check list — because admission did not fail. The gate said yes to a graph that cannot exist.

                      The prompt already tells models the right rule (proposal.py: "__start__ and __end__ are the graph's own entry and exit. Never use..."). The gate is what does not enforce it, and the gate is the part that is supposed to hold when the model does not.

                      Where in the code

                      • grapharc/planner/admission.py_check_endpoints, the loop over ("source", ...), ("target", ...)
                      • grapharc/planner/proposal.py_SENTINELS, and the prompt text that already states the rule
                      • grapharc/planner/loop.pyexcept MaterializationError, and the two separate max_consecutive_* counters

                      What to change

                      Reject END as a source and START as a target under Check.REGISTRY, with a reason code and a remedy in the same shape every other rejection uses. Both endpoints of an edge should still be reported rather than only the first, matching the existing posture.

                      Deliberately not in scope: whether a MaterializationError should count against the rejection allowance in general. That is a separate question about the loop, and closing this one removes the only known way to reach it from a well-formed proposal.

                      Acceptance criteria

                      • A proposal with END -> x or x -> START is refused by admission with a reason code and a remedy, and appears on the admission trace event's failed-check list
                      • Nothing is materialised and no factory is called
                      • The normal START -> ... -> END shape still admits
                      • uv run pytest green, uv run ruff check . clean

                      Activity

                      Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

                      Metadata

                      Metadata

                      Assignees

                      No one assigned

                        Labels

                        No labels
                        No labels

                        Type

                        No type

                        Projects

                        No projects

                          Milestone

                          No milestone

                          Relationships

                          None yet

                          Development

                          No branches or pull requests

                          Issue actions

                          , 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Remove or un-stick sticky/fixed headers that block content\n(function() {\n function unstick() {\n document.querySelectorAll('header, nav, [role=\"banner\"], .header, .navbar, .sticky, .fixed-top, [style*=\"position: fixed\"], [style*=\"position:sticky\"]').forEach(function(el) {\n if (el.style.position === 'fixed' || el.style.position === 'sticky' || \n getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') {\n el.style.position = 'static';\n el.style.top = 'auto';\n el.style.zIndex = 'auto';\n }\n });\n }\n \n unstick();\n \n var observer = new MutationObserver(unstick);\n observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] });\n})();", "Kill Sticky Headers"); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
                          Skip to content

                          admission: END is accepted as an edge source and START as a target, so a graph that cannot be built is admitted #108

                          Description

                          @Shashankss1205

                          What happens

                          _check_endpoints accepts START and END in either role:

                          forrole, endpointin (("source", edge.source), ("target", edge.target)):
                          ifendpointin_SENTINELSorendpointinnamesorendpointinself.known_nodes:
                          continue

                          But the sentinels are directional — START is the graph's entry and END its exit — so a proposal carrying END -> x or x -> START is admitted and then dies in Materializer:

                          END -> work admitted=True -> MaterializationError: ... ValueError: END cannot be a start node
                          work -> START admitted=True -> MaterializationError: ... ValueError: START cannot be an end node
                          

                          Reproduce:

                          fromgrapharc.plannerimport (
                          AdmissionChecker, CostEstimate, EdgePolicy, EdgeRule, Materializer,
                          NodeRegistry, NodeSpec, ProposedEdge, ProposedNode, Subgraph,
                          )
                          fromgrapharc.runtime.graphimportSTART, ENDfromgrapharc.runtime.stateimportGraphARCStateclassS(GraphARCState):
                          note: str=""reg=NodeRegistry([NodeSpec(name="work", description="w",
                          worst_case=CostEstimate(iterations=1),
                          factory=lambdabuild: (lambdastate: {"note": "ran"}))])
                          ck=AdmissionChecker(registry=reg, edge_policy=EdgePolicy(rules=(EdgeRule(action="allow"),)))
                          mz=Materializer(registry=reg, state_schema=S, writes={"work": {"note"}})
                          sub=Subgraph(
                          nodes=(ProposedNode(name="work", kind="work"),),
                          edges=(ProposedEdge(source=START, target="work"),
                          ProposedEdge(source=END, target="work")),
                          )
                          r=ck.check(sub)
                          print(r.admitted) # Truemz.materialize(r, sub) # MaterializationError: END cannot be a start node

                          Why it matters

                          Not because the run proceeds — it does not — but because the failure is charged to the wrong allowance and reaches the planner in the wrong shape.

                          GovernedLoop counts a MaterializationError as an execution failure:

                          exceptMaterializationErrorasexc:
                          return_Execution(state=state, materialization_error=f"could not be built: {exc}")

                          which lands in failed_in_a_row against max_consecutive_execution_failures (2) rather than rejected_in_a_row against max_consecutive_rejections (3). So a planner gets fewer retries for a mistake admission is supposed to catch than for one it does catch, and two of these in a row end the run with LoopStop.EXECUTION_FAILED — a stop reason that says the graph ran and failed, when nothing ran at all.

                          The second half is the shape. A rejection is meant to be data: AdmissionResult.feedback() hands the planner a per-check list of codes and remedies, and the loop never retries an identical proposal. What the planner gets here instead is prose assembled from an exception:

                          The subgraph you proposed did not run: could not be built: proposal 0fcdafa536eb
                          was admitted but could not be assembled into a graph: ValueError: END cannot be
                          a start node. Propose something that addresses that.
                          

                          There is no reason code, no remedy, and nothing on the admission trace event's failed-check list — because admission did not fail. The gate said yes to a graph that cannot exist.

                          The prompt already tells models the right rule (proposal.py: "__start__ and __end__ are the graph's own entry and exit. Never use..."). The gate is what does not enforce it, and the gate is the part that is supposed to hold when the model does not.

                          Where in the code

                          • grapharc/planner/admission.py_check_endpoints, the loop over ("source", ...), ("target", ...)
                          • grapharc/planner/proposal.py_SENTINELS, and the prompt text that already states the rule
                          • grapharc/planner/loop.pyexcept MaterializationError, and the two separate max_consecutive_* counters

                          What to change

                          Reject END as a source and START as a target under Check.REGISTRY, with a reason code and a remedy in the same shape every other rejection uses. Both endpoints of an edge should still be reported rather than only the first, matching the existing posture.

                          Deliberately not in scope: whether a MaterializationError should count against the rejection allowance in general. That is a separate question about the loop, and closing this one removes the only known way to reach it from a well-formed proposal.

                          Acceptance criteria

                          • A proposal with END -> x or x -> START is refused by admission with a reason code and a remedy, and appears on the admission trace event's failed-check list
                          • Nothing is materialised and no factory is called
                          • The normal START -> ... -> END shape still admits
                          • uv run pytest green, uv run ruff check . clean

                          Activity

                          Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

                          Metadata

                          Metadata

                          Assignees

                          No one assigned

                            Labels

                            No labels
                            No labels

                            Type

                            No type

                            Projects

                            No projects

                              Milestone

                              No milestone

                              Relationships

                              None yet

                              Development

                              No branches or pull requests

                              Issue actions

                              , 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Universal Dark Mode - works on any site\n(function() {\n var enabled = true;\n \n function applyDarkMode() {\n if (!enabled) return;\n \n // Create style element if it doesn't exist\n var style = document.getElementById('universal-dark-mode-style');\n if (!style) {\n style = document.createElement('style');\n style.id = 'universal-dark-mode-style';\n document.head.appendChild(style);\n }\n \n // Dark mode CSS - inverts colors but preserves images/video\n style.textContent = '\n /* Invert everything except media */\n html {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #1a1a2e !important;\n }\n \n /* Restore images, videos, iframes, canvas */\n img, video, iframe, canvas, svg, picture, [style*=\"background-image\"] {\n filter: invert(1) hue-rotate(180deg) !important;\n }\n \n /* Preserve specific elements that should not be inverted */\n .no-dark-mode, .no-dark-mode *,\n [data-theme=\"light\"], [data-theme=\"light\"],\n .ace_editor, .ace_editor *,\n .CodeMirror, .CodeMirror *,\n .monaco-editor, .monaco-editor *,\n .markdown-body pre, .markdown-body pre *,\n .highlight, .highlight *,\n pre code, pre code * {\n filter: none !important;\n }\n \n /* Fix common UI elements */\n .modal, .popup, .dropdown-menu, .tooltip, .popover {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #2d2d44 !important;\n border-color: #444 !important;\n }\n \n /* Scrollbars */\n ::-webkit-scrollbar { background: #1a1a2e !important; }\n ::-webkit-scrollbar-thumb { background: #444 !important; }\n ::-webkit-scrollbar-thumb:hover { background: #555 !important; }\n \n /* Selection */\n ::selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ';\n }\n \n function removeDarkMode() {\n var style = document.getElementById('universal-dark-mode-style');\n if (style) style.remove();\n }\n \n // Toggle with Alt+Shift+D\n document.addEventListener('keydown', function(e) {\n if (e.altKey && e.shiftKey && e.key === 'D') {\n e.preventDefault();\n enabled = !enabled;\n if (enabled) {\n applyDarkMode();\n console.log('[Universal Dark Mode] Enabled');\n } else {\n removeDarkMode();\n console.log('[Universal Dark Mode] Disabled');\n }\n }\n });\n \n // Apply on load\n applyDarkMode();\n \n // Re-apply on dynamic content\n var observer = new MutationObserver(function(mutations) {\n if (enabled && !document.getElementById('universal-dark-mode-style')) {\n applyDarkMode();\n }\n });\n observer.observe(document.head, { childList: true });\n \n console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle');\n})();", "Universal Dark Mode"); } } catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); } })(); })();
                              Skip to content

                              admission: END is accepted as an edge source and START as a target, so a graph that cannot be built is admitted #108

                              Description

                              @Shashankss1205

                              What happens

                              _check_endpoints accepts START and END in either role:

                              forrole, endpointin (("source", edge.source), ("target", edge.target)):
                              ifendpointin_SENTINELSorendpointinnamesorendpointinself.known_nodes:
                              continue

                              But the sentinels are directional — START is the graph's entry and END its exit — so a proposal carrying END -> x or x -> START is admitted and then dies in Materializer:

                              END -> work admitted=True -> MaterializationError: ... ValueError: END cannot be a start node
                              work -> START admitted=True -> MaterializationError: ... ValueError: START cannot be an end node
                              

                              Reproduce:

                              fromgrapharc.plannerimport (
                              AdmissionChecker, CostEstimate, EdgePolicy, EdgeRule, Materializer,
                              NodeRegistry, NodeSpec, ProposedEdge, ProposedNode, Subgraph,
                              )
                              fromgrapharc.runtime.graphimportSTART, ENDfromgrapharc.runtime.stateimportGraphARCStateclassS(GraphARCState):
                              note: str=""reg=NodeRegistry([NodeSpec(name="work", description="w",
                              worst_case=CostEstimate(iterations=1),
                              factory=lambdabuild: (lambdastate: {"note": "ran"}))])
                              ck=AdmissionChecker(registry=reg, edge_policy=EdgePolicy(rules=(EdgeRule(action="allow"),)))
                              mz=Materializer(registry=reg, state_schema=S, writes={"work": {"note"}})
                              sub=Subgraph(
                              nodes=(ProposedNode(name="work", kind="work"),),
                              edges=(ProposedEdge(source=START, target="work"),
                              ProposedEdge(source=END, target="work")),
                              )
                              r=ck.check(sub)
                              print(r.admitted) # Truemz.materialize(r, sub) # MaterializationError: END cannot be a start node

                              Why it matters

                              Not because the run proceeds — it does not — but because the failure is charged to the wrong allowance and reaches the planner in the wrong shape.

                              GovernedLoop counts a MaterializationError as an execution failure:

                              exceptMaterializationErrorasexc:
                              return_Execution(state=state, materialization_error=f"could not be built: {exc}")

                              which lands in failed_in_a_row against max_consecutive_execution_failures (2) rather than rejected_in_a_row against max_consecutive_rejections (3). So a planner gets fewer retries for a mistake admission is supposed to catch than for one it does catch, and two of these in a row end the run with LoopStop.EXECUTION_FAILED — a stop reason that says the graph ran and failed, when nothing ran at all.

                              The second half is the shape. A rejection is meant to be data: AdmissionResult.feedback() hands the planner a per-check list of codes and remedies, and the loop never retries an identical proposal. What the planner gets here instead is prose assembled from an exception:

                              The subgraph you proposed did not run: could not be built: proposal 0fcdafa536eb
                              was admitted but could not be assembled into a graph: ValueError: END cannot be
                              a start node. Propose something that addresses that.
                              

                              There is no reason code, no remedy, and nothing on the admission trace event's failed-check list — because admission did not fail. The gate said yes to a graph that cannot exist.

                              The prompt already tells models the right rule (proposal.py: "__start__ and __end__ are the graph's own entry and exit. Never use..."). The gate is what does not enforce it, and the gate is the part that is supposed to hold when the model does not.

                              Where in the code

                              • grapharc/planner/admission.py_check_endpoints, the loop over ("source", ...), ("target", ...)
                              • grapharc/planner/proposal.py_SENTINELS, and the prompt text that already states the rule
                              • grapharc/planner/loop.pyexcept MaterializationError, and the two separate max_consecutive_* counters

                              What to change

                              Reject END as a source and START as a target under Check.REGISTRY, with a reason code and a remedy in the same shape every other rejection uses. Both endpoints of an edge should still be reported rather than only the first, matching the existing posture.

                              Deliberately not in scope: whether a MaterializationError should count against the rejection allowance in general. That is a separate question about the loop, and closing this one removes the only known way to reach it from a well-formed proposal.

                              Acceptance criteria

                              • A proposal with END -> x or x -> START is refused by admission with a reason code and a remedy, and appears on the admission trace event's failed-check list
                              • Nothing is materialised and no factory is called
                              • The normal START -> ... -> END shape still admits
                              • uv run pytest green, uv run ruff check . clean

                              Activity

                              Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

                              Metadata

                              Metadata

                              Assignees

                              No one assigned

                                Labels

                                No labels
                                No labels

                                Type

                                No type

                                Projects

                                No projects

                                  Milestone

                                  No milestone

                                  Relationships

                                  None yet

                                  Development

                                  No branches or pull requests

                                  Issue actions