{"schema_version":1,"experiment_id":"eoa_inverse_innovation_exp03_full320_20260801","cell_id":"computability_boundary_mapping__archaeology_paleontology","trajectory_id":"R","attempt_index":0,"candidate_sha256":"8913966200a11b9c03382107917a18bf297f295522417ba1cfa77ce30941045a","gates":{"G1":{"status":"PASS","reason":"The operational problem is independently stated as an analyzer making universal reachability and timeout-derived inconsistency claims; the archaeological analogy is not used as proof."},"G2":{"status":"PASS","reason":"The proposal preserves the archetype's unrestricted class, explicit representation and computation contracts, solvability lattice, enforceable decidable fragments, honest fallback, and recheck structure."},"G3":{"status":"PASS","reason":"Mechanical fragment admission, guarantee-aware routing, and distinct UNKNOWN behavior directly prevent resource exhaustion from being converted into a negative historical claim."},"G4":{"status":"PASS","reason":"All named components receive coherent domain realizations, and the load-bearing mechanisms have explicit contributions and removal counterfactuals without assigning proof work to administrative artifacts."},"G5":{"status":"RESEARCH_NEEDED","reason":"The packet contains neither evidence of a deployed service making the diagnosed unrestricted guarantee nor a completed, independently checked source-to-target reduction establishing undecidability for the proposed language."},"G6":{"status":"PASS","reason":"The production audit falsifies the diagnosed problem independently of the synthetic-oracle test that falsifies the intervention, with observable routing, termination, and labeling outcomes."},"G7":{"status":"PASS","reason":"The first step is synthetic, jointly authorized, independently reviewed, reversible, and expressly barred from changing collections, provenance, or archaeological interpretations."}},"scores":{"structural_fit":{"score":4,"reason":"The mapping closely preserves the full computability-boundary structure, including quantifiers, representations, model relativity, restricted regions, proof obligations, fallback guarantees, and complexity follow-on."},"domain_fidelity":{"score":3,"reason":"Site-formation and taphonomic reachability are framed as properties of formal transition models, while the candidate explicitly refuses to transfer computability conclusions to the physical past; actual deployment relevance remains unverified."},"causal_plausibility":{"score":3,"reason":"Enforced fragment membership and labeled routing would block the stated timeout-to-NO failure, but the need for the unrestricted branch depends on an unverified language and claim profile."},"component_translation":{"score":4,"reason":"The component map is complete and translates each function into a concrete modeling, proof, governance, or output-semantics obligation."},"adversarial_survival":{"score":3,"reason":"The candidate survives finite-state, semantic-fidelity, reduction-direction, abstraction-soundness, and downstream-coercion challenges, but its central empirical and impossibility premises remain open."},"reframing_gain":{"score":4,"reason":"It usefully separates formal model reachability from historical truth and separates undecidability, bounded decidability, tractability, timeout, and negative evidence."},"practicality_testability":{"score":3,"reason":"The synthetic grammar, exhaustive oracle, routing checks, and proof review form a feasible pilot, although the unrestricted reduction and production-language audit still require execution."},"expected_value_risk":{"score":4,"reason":"A synthetic-only, reversible pilot can prevent false negative claims and wasted universal-solver effort while tightly limiting authority and collection risk."},"novelty_evidence":{"score":0,"reason":"Prior art is explicitly unsearched and the packet supplies no comparative evidence supporting novelty."}},"weighted_total":82.5,"disposition":"RESEARCH_NEEDED","fabrication_findings":[],"weak_dimensions":["novelty_evidence"],"actionable_critique":[{"priority":"HIGH","issue":"The diagnosed production condition is hypothetical: no accepted grammar, output contract, timeout behavior, or deployed universal claim is evidenced.","repair":"Audit the actual service specification and accepted production inputs; either document an unrestricted class-wide claim with the observed timeout semantics or rewrite the proposal as a prospective design safeguard.","evidence_boundary":"The current packet supports a coherent conditional diagnosis, not the assertion that such a deployed archaeological or paleontological service exists."},{"priority":"HIGH","issue":"The impossibility branch is only a proposed test and does not yet establish that the model language can encode a known-undecidable source while preserving reachability.","repair":"Provide the total computable translation, prove answer preservation under the frozen semantics, register every expressiveness assumption, and obtain independent proof review; otherwise retain UNRESOLVED and remove any undecidability verdict.","evidence_boundary":"General facts about unbounded transition systems cannot establish the status of this particular language without the encoding and preservation proof."},{"priority":"MEDIUM","issue":"The abstraction disposition does not state which reachability verdict is sound under its chosen approximation direction.","repair":"Specify the abstraction relation and verdict polarity, then test that every definitive output is justified by that relation and that abstraction-induced ambiguity is labeled UNKNOWN.","evidence_boundary":"The supplied mechanism description gives a generic safety-property polarity that does not automatically transfer to existential archaeological reachability."}],"repairs":[{"repair_id":"repair_empirical_premise","target":"production problem premise","operation_code":"BOUND_EVIDENCE","affected_identifiers":["problem_id:unbounded_site_formation_reachability_claim","proposal.problem","proposal.observable_state","classification.evidence_maturity"],"acceptance_test":"A versioned audit identifies the deployed grammar, accepted input bounds, published guarantee, and timeout output semantics; if no unrestricted universal claim with deceptive negative behavior exists, the candidate is rewritten as prospective and makes no present-tense production diagnosis.","materially_distinct":true,"supersedes":null,"repair_fingerprint":"67a99e175301c6c09b61daabf8250915e0f6b08aacdaf486b7867d2050686d08"},{"repair_id":"repair_reduction_certificate","target":"unrestricted language impossibility branch","operation_code":"REPAIR_CAUSAL_CHAIN","affected_identifiers":["causal_lever_id:enforceable_model_fragment_and_labeled_fallback","structural_mapping:possible_undecidability_boundary","mechanism:halting_problem_reduction","causal_chain"],"acceptance_test":"An explicit total computable source-to-target translation is supplied, reachability answer preservation is proved under the frozen model semantics, all assumptions are registered, and an independent reviewer accepts the proof; otherwise the status remains unresolved and no impossibility claim is shipped.","materially_distinct":true,"supersedes":null,"repair_fingerprint":"c4959c58d277fdaa599b2de7476e1452c47c1afb82e90a94f9f625366c892971"},{"repair_id":"repair_abstraction_polarity","target":"abstract reachability fallback","operation_code":"REVISE_MECHANISM_USE","affected_identifiers":["mechanism:abstract_interpretation_or_model_checking","proposal.mechanism_dispositions","negative_tests.failure_condition","proposal.causal_chain"],"acceptance_test":"The abstraction contract states whether behaviors are over-approximated or under-approximated, identifies which reachability verdict is sound, and passes synthetic tests showing that every opposite-polarity or abstraction-induced ambiguous result is labeled unknown.","materially_distinct":true,"supersedes":null,"repair_fingerprint":"41385556791d0271cb7befeb7489ba8606440144427447184408b208bfa349ca"}],"improvement_attribution":{"kind":"NONE","reason":"This is an original attempt with unchanged problem and causal-lever identifiers and no prior repair registry; the remaining weakness is evidentiary rather than attributable to a revision."},"trajectory_replacement":false,"arm_guess":"MECHANISM_PACKET","recommendation":"RESEARCH_NEEDED","tester_summary":"The candidate is structurally strong, domain-conscious, falsifiable, and safely scoped. Advancement is blocked by missing production evidence, an uncompleted language-specific undecidability proof, and an unresolved abstraction-polarity contract; these gaps must remain hypotheses rather than be guessed."}