{"schema_version":1,"assessment_id":"eoa_inverse_innovation_exp03_opportunity320_20260801","source_experiment_id":"eoa_inverse_innovation_exp03_full320_20260801","cell_id":"computability_boundary_mapping__computer_science","archetype_slug":"computability_boundary_mapping","domain_slug":"computer_science","title":"Model-Relative Termination Routing for Workflow Admission","opportunity_summary":"Replace an asserted total-exact Boolean termination gate for unrestricted workflows with an enforceable exact fragment, bounded or sound-incomplete analysis for other workflows, and explicit UNKNOWN, timeout, out-of-scope, and observed-nontermination states. The opportunity is conditional on confirming that the current admitted class is genuinely unrestricted rather than already bounded or structurally terminating.","adopter_authorizer":"The workflow-platform owner can authorize a sandboxed non-production pilot; production guarantee changes require engineering, reliability, and security sign-off following independent proof review.","scores":{"meaningful_impact":{"score":4,"rationale":"If the described unrestricted Boolean gate exists, the proposal could prevent false termination guarantees, wasted attempts to build an impossible total-exact analyzer, and unsafe downstream conflation of NO with analysis failure. Realized impact remains uncertain because prevalence and affected workload volume are unsupported."},"stakeholder_pull":{"score":3,"rationale":"Workflow authors, operators, downstream service owners, and security and reliability reviewers have plausible reasons to want truthful admission labels and platform availability. The sealed candidate supplies no evidence that these stakeholders currently prioritize the issue or would accept frequent UNKNOWN outcomes."},"incremental_advantage":{"score":4,"rationale":"Relative to the Boolean analyzer baseline and the rival of adding resources and heuristics, enforceable decidable fragments plus guarantee-aware routing directly address the specification error and preserve uncertainty instead of hiding it. Advantage could shrink if an audit finds that existing semantics are already finitely bounded and correctly labeled."},"distinctiveness_plausibility":{"score":2,"rationale":"The composition of a halting-boundary check, mechanically enforced fragments, and multi-state routing is coherent, but prior art is expressly unsearched and no closed-book basis establishes that this combination is distinctive in workflow platforms."},"technical_implementability":{"score":4,"rationale":"A non-production interpreter snapshot, one restricted subset, an exact terminating lane, YES/UNKNOWN fallback, and exhaustive testing over tiny bounded programs form an implementable pilot. Semantic fidelity, enforceable membership, external calls, and computational practicality prevent the highest score."},"adoption_authority_feasibility":{"score":4,"rationale":"The packet identifies a platform owner for sandbox authorization and engineering, reliability, and security reviewers for production sign-off, with prohibited actions and rollback triggers. Independent proof review and cross-functional production approval add material coordination burden."},"evidence_readiness":{"score":4,"rationale":"The candidate provides separate problem and intervention falsifiers, a non-production test setting, bounded exhaustive comparisons, and explicit counterexample and rollback criteria. Evidence about actual interpreter semantics, workload coverage, and stakeholder behavior is still absent."},"safety_net_benefit":{"score":5,"rationale":"Preserving UNKNOWN, timeout, out-of-scope, and observed nontermination as distinct states directly limits overclaiming, while sandboxing, scope enforcement, independent review, prohibited relabeling, and rollback on counterexamples provide strong proposal-specific safeguards."},"scalability":{"score":3,"rationale":"The routing pattern could be reused across workflow classes and model versions, but every interpreter, extension, external-call model, and guarantee change may require new semantic work. Useful coverage and the operational rate of UNKNOWN are unmeasured."}},"score_confidence":"MODERATE","costs":{"first_evidence":{"band_2026_usd":"50K_TO_250K","scope":"Audit the admitted workflow class and interpreter semantics; formalize one subset; check the halting reduction; prototype an exact lane with YES/UNKNOWN routing; and exhaustively test tiny bounded programs in non-production.","confidence":"LOW","assumptions":["A usable interpreter snapshot and relevant specifications are available.","The work uses a small team with formal-methods and platform-engineering capability.","No production integration, live workflow admission, or broad semantic model is included.","Labor, coordination, software, and independent proof review are included."]},"initial_deployment_startup":{"band_2026_usd":"250K_TO_1M","scope":"Engineer a production-candidate scoped router, enforce fragment membership, integrate structured outcomes with the admission interface, validate semantic correspondence, add monitoring and documentation, and complete security, reliability, and proof reviews.","confidence":"LOW","assumptions":["The pilot succeeds and one or a few useful fragments are selected.","Existing workflow infrastructure can expose the required interpreter and routing hooks.","The scope excludes wholesale workflow-language replacement and major downstream redesign.","Compliance and partner coordination are moderate rather than unusually extensive."]},"operational_launch":{"band_2026_usd":"1M_TO_5M","scope":"Launch across the platform with downstream consumer migration from Boolean verdicts, author guidance, exception governance, staged rollout, coverage evaluation, incident preparation, and multidisciplinary production sign-off.","confidence":"LOW","assumptions":["Multiple downstream services currently depend on Boolean admission results.","Backward-compatible migration is possible but requires material engineering and coordination.","No specialized hardware or complete formal verification of the entire platform is required.","The estimate includes evaluation, training, security, reliability, and rollout labor."]},"annual_recurring":{"band_2026_usd":"250K_TO_1M","scope":"Maintain proofs and analyzers, revalidate guarantees after interpreter or language changes, monitor UNKNOWN and override behavior, review incidents, and update fragment definitions and documentation.","confidence":"LOW","assumptions":["The platform and workflow language evolve regularly.","A small continuing engineering and review function is required.","Recurring scope covers several supported fragments but not continuous whole-platform formal verification.","External-service semantics remain governed or explicitly outside exact guarantees."]}},"research_burden":"HIGH","earliest_credible_horizon":"3_TO_12_MONTHS","pipeline_gates":{"recognizable_externally_supportable_problem":{"status":"YES","reason":"The candidate specifies an observable unrestricted Boolean gate, timeouts collapsed into verdicts, affected actors, concrete misclassification consequences, and a problem falsifier based on auditing enforced bounds and existing state distinctions."},"identifiable_adopter_or_authorizer":{"status":"YES","reason":"The workflow-platform owner is identified as sandbox-pilot authorizer, while engineering, reliability, and security functions are identified as required production signatories."},"distinct_testable_incremental_claim":{"status":"YES","reason":"The proposal claims that an enforced exact fragment plus explicit UNKNOWN routing will avoid stronger unsupported labels relative to the current Boolean analyzer and resource-intensive heuristic rival; bounded counterexamples and routing errors can falsify that claim."},"bounded_next_evidence_step":{"status":"YES","reason":"The packet authorizes work on a non-production interpreter snapshot, one subset, fixed tiny-program bounds, and a YES/UNKNOWN fallback, with explicit comparison, counterexample, halt, and rollback conditions."},"no_unresolved_safety_or_authority_stop":{"status":"YES","reason":"The first step is sandboxed and within stated platform-owner authority; production admission is excluded, prohibited claims are explicit, and counterexamples, abstraction omissions, mislabeled guarantees, or bypassable enforcement trigger a stop and rollback."},"implementation_cost_scope_and_range":{"status":"UNCERTAIN","reason":"The packet bounds the pilot activities but supplies no staffing, platform size, integration topology, downstream dependency count, compliance context, or workload scale, so only low-confidence resource-equivalent bands can be assigned."}},"blocking_evidence":["An audit must establish whether admitted workflows are actually unrestricted or instead subject to enforced finite-fuel or structurally terminating semantics.","The formal interpreter model must be shown to preserve every concrete behavior relevant to the advertised guarantee, including the treatment of external calls and nondeterminism.","Fragment membership and finite bounds must be mechanically enforceable and resistant to escape through extensions or configuration.","The exact lane must survive exhaustive bounded tests without a counterexample or stronger routing label than the evidence supports.","Useful-workload coverage, UNKNOWN frequency, computational practicality, and downstream handling of non-Boolean states are unmeasured.","Prior art and existing platform practices have not been searched or verified."],"next_evidence_step":"On a frozen non-production interpreter snapshot, first audit whether the current admission class is mechanically bounded or structurally terminating; then formalize one enforceable subset, compare the proposed exact-fragment plus YES/UNKNOWN router against the current Boolean gate on every well-formed program within fixed syntax, input, state, and step bounds, and reject the intervention if any advertised exact result is wrong, any concrete behavior is missing from the abstraction, fragment enforcement is bypassable, or the router emits a stronger label than its evidence supports.","research_questions":["Is the actual admitted workflow class unrestricted, or are finite fuel, structural restrictions, or existing state distinctions already enforced?","Does the formal interpreter model faithfully represent nondeterminism, external services, schedulers, and other behaviors relevant to operational completion?","Can fragment membership and execution bounds be enforced across all language extensions and configuration paths?","What share of decision-relevant workflows enters the exact lane, and what share returns UNKNOWN under the proposed routing?","How do downstream consumers and human reviewers respond to UNKNOWN, and does it increase unsafe manual overrides?","Is the exact decision procedure computationally practical for useful workflows within platform latency and availability constraints?","What prior systems, publications, or platform features already implement comparable model-relative termination routing?","What staffing, integration, review, migration, and recurring maintenance resources would the actual platform require?"] ,"recommendation":"VALIDATE_PROBLEM_FIRST","uncertainty_constraints":["Closed-book assessment provides no evidence of problem prevalence, stakeholder demand, workload volume, or realized impact.","The candidate may be falsified if the existing platform already enforces a finite or structurally terminating computation model and distinguishes NO, UNKNOWN, and timeout.","The halting reduction applies only to the declared computation model and may not represent workflows involving humans, sensors, nondeterministic scheduling, or changing external services.","Distinctiveness cannot be established without prior-art research.","Cost bands are low-confidence resource equivalents because staffing, platform scale, integration complexity, and compliance requirements are unstated.","Production feasibility depends on useful fragment coverage, acceptable UNKNOWN rates, semantic fidelity, and downstream migration behavior."],"closed_book_prior_art_boundary":"Prior art is unsearched and unverified. This closed-book assessment therefore makes no claim about novelty, distinctiveness in the field, prevalence of comparable systems, or whether workflow platforms already use equivalent bounded-fragment and UNKNOWN-routing designs."}