{"schema_version":1,"experiment_id":"eoa_inverse_innovation_exp05_complete_proposal_portfolio20_20260803","cell_id":"computability_boundary_mapping__economics_finance","portfolio_valid":true,"proposal_assessments":[{"proposal_index":1,"complete":true,"causally_faithful":true,"materially_distinct":true,"reason":"Specifies the unrestricted solvency class and computation model, conditions impossibility on a checked reduction, constructs an enforceable decidable fragment, preserves one-directional and unknown statuses, and governs reclassification. Its clearinghouse contract-listing problem and fragment-plus-abstraction intervention are distinct."},{"proposal_index":2,"complete":true,"causally_faithful":true,"materially_distinct":true,"reason":"Replaces impossible universal proof generation with terminating certificate checking, checked counterexamples, fair one-sided search, and explicit UNKNOWN under a frozen auction model. Proof-carrying auction admission is materially different from fragment analysis, allocation search, oracle passports, and runtime mediation."},{"proposal_index":3,"complete":true,"causally_faithful":true,"materially_distinct":true,"reason":"Correctly places finitely encoded collateral allocation on the decidable side by exhibiting a total exhaustive decider, proving its termination and correctness, separating instance cutoffs from class-wide decidability, and handing practical limits to complexity analysis. This positive computability classification is operationally independent of the other four."},{"proposal_index":4,"complete":true,"causally_faithful":true,"materially_distinct":true,"reason":"Makes external solvers, live information, and human selections explicit computational capabilities; states guarantees relative to named oracle contracts and promises; tests withdrawal and abstention; and retains bounded or unresolved results honestly. Capability-relative policy-model governance is a distinct intervention and causal path."},{"proposal_index":5,"complete":true,"causally_faithful":true,"materially_distinct":true,"reason":"Tests the unrestricted ex-ante analyzer claim but replaces it with a narrower, constructively verified guarantee over completely mediated order events and finite-prefix safety rules. The shift from whole-program prediction to runtime enforcement is faithful to honest fallback design and materially distinct from all other proposals."}],"pairwise_assessments":[{"proposal_a":1,"proposal_b":2,"same_problem":false,"same_intervention":false,"independent_opportunity":true,"key_difference":"Proposal 1 governs collateral-solvency analysis for programmable derivatives through an enforceable finite contract fragment and sound abstraction; proposal 2 governs auction truthfulness and termination through proof-carrying admission and certificate-versus-counterexample search."},{"proposal_a":1,"proposal_b":3,"same_problem":false,"same_intervention":false,"independent_opportunity":true,"key_difference":"Proposal 1 addresses an open-ended universal property of executable contracts and narrows the language; proposal 3 addresses finite collateral-assignment snapshots by constructing a total exhaustive decider and separating cutoff uncertainty from proven infeasibility."},{"proposal_a":1,"proposal_b":4,"same_problem":false,"same_intervention":false,"independent_opportunity":true,"key_difference":"Proposal 1 draws a static solvency boundary for clearinghouse contract admission; proposal 4 exposes external and human computational capabilities in macroeconomic equilibrium claims through oracle-relative passports and withdrawal tests."},{"proposal_a":1,"proposal_b":5,"same_problem":false,"same_intervention":false,"independent_opportunity":true,"key_difference":"Proposal 1 analyzes contracts before listing using restriction, exact search, and sound abstraction; proposal 5 mediates actual outbound trading events at runtime under a finite-state safety-rule fragment."},{"proposal_a":2,"proposal_b":3,"same_problem":false,"same_intervention":false,"independent_opportunity":true,"key_difference":"Proposal 2 checks designer-supplied proofs of auction truthfulness and termination while preserving unsuccessful discovery as UNKNOWN; proposal 3 directly decides finite collateral feasibility through complete enumeration and reserves negative verdicts for exhaustive coverage."},{"proposal_a":2,"proposal_b":4,"same_problem":false,"same_intervention":false,"independent_opportunity":true,"key_difference":"Proposal 2 changes universal proof discovery into proof-carrying auction admission; proposal 4 classifies policy-model conclusions relative to registered external solvers, information sources, and human selectors."},{"proposal_a":2,"proposal_b":5,"same_problem":false,"same_intervention":false,"independent_opportunity":true,"key_difference":"Proposal 2 certifies a model-relative property of an auction rule before admission using supplied proof artifacts; proposal 5 declines whole-strategy certification and instead blocks forbidden observable order prefixes through complete runtime mediation."},{"proposal_a":3,"proposal_b":4,"same_problem":false,"same_intervention":false,"independent_opportunity":true,"key_difference":"Proposal 3 establishes unconditional decidability for finite static collateral snapshots and then analyzes complexity; proposal 4 identifies conditional solvability of open-ended policy-model queries relative to explicit oracle capabilities and promises."},{"proposal_a":3,"proposal_b":5,"same_problem":false,"same_intervention":false,"independent_opportunity":true,"key_difference":"Proposal 3 produces witnessed feasibility or exhaustively proved infeasibility for a frozen allocation instance; proposal 5 enforces a safety invariant incrementally on live-order event prefixes without deciding the strategy's future behavior."},{"proposal_a":4,"proposal_b":5,"same_problem":false,"same_intervention":false,"independent_opportunity":true,"key_difference":"Proposal 4 governs provenance and conditional computational power in macroeconomic equilibrium analysis; proposal 5 changes the guarantee object and enforces monitorable trading-conduct rules through a finite-state gateway monitor."}],"replacement_indices":[],"rationale":"All five proposals are operationally complete, preserve the archetype's model-relative distinction among decidable, relative, incomplete, bounded, unresolved, and impractical computation, and provide explicit evidence obligations, fallbacks, status behavior, authority limits, falsifiers, and bounded next steps. Every pair differs in the affected decision problem, primary intervention, and causal path; shared boundary-analysis artifacts are archetype infrastructure rather than duplicated opportunities."}