{"schema_version":1,"research_id":"eoa_inverse_innovation_exp03_external48_20260801","source_assessment_id":"eoa_inverse_innovation_exp03_opportunity320_20260801","cell_id":"computability_boundary_mapping__history_historiography","selection_stratum":"MIDDLE_BAND_AUDIT_Q1","search_queries":["site:cidoc-crm.org temporal reasoning consistency historical data rules checker","digital history executable event rules temporal consistency checker historical models","historical event database temporal consistency validation chronology software","digital humanities temporal reasoning model checking history","\"Models and Algorithms for Chronology\" Geeraerts Levy Pluquet PDF","\"Chronological Networks in Archaeology\" formalised scheme PDF","ChronoLog consistency algorithm complexity chronology","site:microsoft.github.io/z3guide unknown reason_unknown timeout official","site:z3prover.github.io api reason_unknown timeout unknown","site:alloytools.org bounded analysis no counterexample scope official","Turing 1936 halting problem arbitrary programs undecidable","digital humanities historians temporal uncertainty provenance machine inference workflow study","historical data uncertainty digital humanities guidelines provenance interpretation","site:bls.gov/ooh software developers median pay 2025","site:bls.gov/ooh historians median pay 2025","site:bls.gov employer costs employee compensation March 2026 benefits","\"timeout\" \"inconsistent\" historical model checker chronology","\"timeout\" \"consistent\" archaeology chronology software","digital history rule engine timeout consistency verdict","historical model checker \"unknown\" temporal consistency"],"sources":[{"source_id":"S1","title":"ChronoLog: A tool for computer-assisted chronological research","publisher":"ChronoLog, Université libre de Bruxelles","url":"https://chrono.ulb.be/","source_class":"OFFICIAL_PRODUCT_DOCUMENTATION","publication_date":"2026-06-08","accessed_at":"2026-08-02","claims_supported":["ChronoLog supports archaeological chronological models consisting of sequences, date and duration bounds, and synchronisms.","It automatically checks model validity and computes tight chronological ranges.","The product page does not describe unrestricted scholar-authored executable rules or timeout-coerced verdicts."]},{"source_id":"S2","title":"ChronoLog 2.1 User Manual","publisher":"ChronoLog, Université libre de Bruxelles","url":"https://chrono.ulb.be/wp-content/uploads/2023/04/chronolog-manual-2-1.pdf","source_class":"OFFICIAL_PRODUCT_DOCUMENTATION","publication_date":"2023-04-02","accessed_at":"2026-08-02","claims_supported":["The admitted model consists of periods, sequences, bounds, and a fixed set of synchronisms.","ChronoLog automatically checks consistency after model changes and provides an explanation for inconsistency.","The software exposes traces for computed bounds and allows unknown date or duration bounds."]},{"source_id":"S3","title":"Models and Algorithms for Chronology","publisher":"Schloss Dagstuhl—Leibniz-Zentrum für Informatik","url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2017.13","source_class":"PRIMARY_RESEARCH","publication_date":"2017-09-25","accessed_at":"2026-08-02","claims_supported":["The chronology formalism fixes a finite set of periods and represents temporal knowledge as difference constraints over integer variables.","Satisfiability and tightening reduce to all-pairs shortest paths.","The proposed satisfiability and tightening algorithms run in polynomial time.","The work was motivated by archaeological chronology and automated checking of chronological properties."]},{"source_id":"S4","title":"Towards Model Checking Product Lines in the Digital Humanities: An Application to Historical Data","publisher":"University of Limerick research repository","url":"https://pure.ul.ie/en/publications/towards-model-checking-product-lines-in-the-digital-humanities-an/","source_class":"PRIMARY_RESEARCH","publication_date":"2019","accessed_at":"2026-08-02","claims_supported":["A digital-humanities historical-data project proposed model checking through a specific Context-Free Modal Transition Systems formalism.","The project used constrained DTD product lines and standard DTD checking rather than an unrestricted universal temporal checker."]},{"source_id":"S5","title":"Temporal Reasoning in Historical Humanities Data: The Case of Muzio Clementi and the Music Trade","publisher":"Semantic Web Journal preprint server","url":"https://semantic-web-journal.net/system/files/swj3911.pdf","source_class":"PRIMARY_RESEARCH","publication_date":"undated preprint","accessed_at":"2026-08-02","claims_supported":["Historical temporal data is frequently incomplete or imprecise and requires uncertainty-aware modeling.","A historical case study used CIDOC CRM, Allen interval logic, Notation3 rules, and the EYE reasoner.","Small encoding choices materially changed inferred temporal relations.","The authors call for workflows that preserve the distinction between historian-supplied or inductive relations and machine-deduced relations."]},{"source_id":"S6","title":"Interpretable Outputs: Criteria for Machine Learning in the Humanities","publisher":"Digital Humanities Quarterly","url":"https://dhq.digitalhumanities.org/vol/15/2/000555/000555.html","source_class":"PRIMARY_RESEARCH","publication_date":"2021","accessed_at":"2026-08-02","claims_supported":["Humanities computation should expose complexity and ambiguity rather than hide it.","Model and data-format choices can suppress evidence and support unwarranted claims.","Computational humanities outputs need interpretable assumptions and evidence."]},{"source_id":"S7","title":"Making the Whole Greater than the Sum of its Parts: Taxonomy development as a site of negotiation and compromise in an interdisciplinary software development project","publisher":"Digital Humanities Quarterly","url":"https://www.digitalhumanities.org/dhq/vol/17/3/000701/000701.html","source_class":"PRIMARY_RESEARCH","publication_date":"2023","accessed_at":"2026-08-02","claims_supported":["The PROVIDEDH project developed an uncertainty taxonomy collaboratively across humanities and technical stakeholder groups.","The taxonomy distinguished machine-induced and human-induced uncertainty.","The study documents substantial coordination and disciplinary negotiation requirements for uncertainty-aware humanities software."]},{"source_id":"S8","title":"Alloy Tutorial: Checking Assertions in a Bounded Scope","publisher":"AlloyTools","url":"https://alloytools.org/tutorials/online/maintext-FS-1.html","source_class":"OFFICIAL_PRODUCT_DOCUMENTATION","publication_date":"undated","accessed_at":"2026-08-02","claims_supported":["Alloy can return a witnessed counterexample within a specified scope.","No counterexample in scope does not guarantee the property for larger scopes.","This is established prior art for explicit scope-limited formal claims."]}],"problem_evidence":{"support":"NOT_FOUND","rationale":"The bounded search found relevant chronology and digital-history verification systems, but none documented the candidate's alleged combination of unrestricted executable event rules, an exact total Boolean promise, and timeout coercion. The closest operational system, ChronoLog, admits a fixed temporal-constraint data model whose consistency procedure is polynomial-time; the historical-data model-checking publication likewise selects a specific formalism. This does not establish that no problematic system exists, but the candidate's prevalence claim remains unsupported.","source_ids":["S1","S2","S3","S4","S5"]},"stakeholder_evidence":{"support":"MODERATE","rationale":"Historical-computing research supports the underlying need for uncertainty-aware, interpretable, provenance-sensitive reasoning: temporal data is imprecise, encoding choices affect results, and human versus machine inference should remain distinguishable. An implemented humanities platform also required cross-disciplinary negotiation over uncertainty. However, no source reports a repository requesting this exact fragment-plus-UNKNOWN mechanism, accepting its expressiveness limits, or funding adoption.","source_ids":["S5","S6","S7"]},"prior_art":{"proximity":"SUBSTANTIAL_COLLISION","closest_analogues":[{"name":"ChronoLog","similarity":"Domain-specific system with an enforceable, fixed chronology language; automatic exact consistency checking; bounded unknown dates and durations; optimized range computation; and explanatory traces.","remaining_difference":"It does not accept an unrestricted executable rule language, route out-of-language programs to bounded search, or document a version-linked UNKNOWN result for unsupported computation. The remaining opportunity is therefore an extension/governance layer, not a new core consistency-checking concept.","source_ids":["S1","S2","S3"]},{"name":"Alloy bounded analysis","similarity":"Performs exhaustive analysis within an explicit finite scope, returns witnessed counterexamples, and explicitly limits a no-counterexample conclusion to the analyzed scope.","remaining_difference":"It is a general modeling tool rather than a historical chronology workflow, and it does not itself define historical semantics, provenance wording, governance, or downstream preservation of UNKNOWN.","source_ids":["S8"]},{"name":"Digital-humanities CFMTS/DTD model checking","similarity":"Applies a deliberately selected formalism and model-checking workflow to historical-data infrastructure rather than promising verification over arbitrary executable rules.","remaining_difference":"It concerns product-line and document-model verification, not temporal consistency of scholar-authored event rules, and the publication does not describe the proposed UNKNOWN router or public claim controls.","source_ids":["S4"]}],"distinctive_claim_remaining":"If a real historical system with an unrestricted executable-rule extension is found, the remaining testable claim is narrow: a versioned admission classifier and result router can preserve exact checking for admitted models, return witnessed contradictions or explicit UNKNOWN elsewhere, and prevent downstream Boolean coercion without excluding routine scholarly models. No world-novelty claim remains supportable from this search.","confidence":"HIGH"},"implementation_evidence":{"support":"MODERATE","rationale":"The main technical components are independently credible: ChronoLog demonstrates a finite historical chronology language with polynomial-time exact checking and explanations, while Alloy demonstrates scoped exhaustive analysis and appropriately limited negative findings. What remains unverified is the candidate-specific grammar, its membership algorithm, translation semantics, coverage of routine historiography, UNKNOWN-preserving integrations, and an independently reviewed proof for the composed system.","source_ids":["S2","S3","S8"]},"scores":{"meaningful_impact":{"score":2,"rationale":"Temporal encoding choices can alter historical inferences, and unwarranted computational claims can obscure ambiguity. Impact is capped because no actual unrestricted Boolean checker, affected population, incident, or realized harm was found.","source_ids":["S5","S6"]},"stakeholder_pull":{"score":2,"rationale":"Researchers demonstrably care about temporal reasoning, uncertainty, interpretability, and distinguishing human from machine inference, but no adopter requested this mechanism or demonstrated willingness to accept UNKNOWN and a restricted rule language.","source_ids":["S5","S6","S7"]},"incremental_advantage":{"score":3,"rationale":"Against the hypothesized baseline, enforceable admission, witnessed contradictions, scoped negative results, and UNKNOWN would materially improve claim discipline. The advantage is conditional because the baseline was not found and ChronoLog already provides much of the exact restricted-checking functionality.","source_ids":["S1","S2","S3","S8"]},"distinctiveness_plausibility":{"score":2,"rationale":"The domain-specific core substantially collides with ChronoLog, and scope-limited exhaustive checking with counterexamples is established in Alloy. Only the integrated admission, provenance, governance, and UNKNOWN-preservation layer remains potentially distinctive.","source_ids":["S1","S2","S3","S8"]},"technical_implementability":{"score":4,"rationale":"A fixed finite chronology grammar and exact polynomial-time checker have already been implemented for archaeology. Implementability is not scored 5 because the candidate's broader executable-rule boundary, formal membership proof, and integration behavior are unspecified.","source_ids":["S1","S2","S3"]},"adoption_authority_feasibility":{"score":2,"rationale":"Relevant users and interdisciplinary collaborators are identifiable, but the search found no named repository governance board, empowered data steward, methods reviewer, approval process, or downstream enforcement owner for this candidate.","source_ids":["S4","S5","S7"]},"evidence_readiness":{"score":2,"rationale":"Strong prior art and safe synthetic test patterns exist, but the central problem instance, adopter, concrete grammar, proof obligations, coverage benchmark, and UNKNOWN-preservation evidence are missing.","source_ids":["S1","S3","S4","S8"]},"safety_net_benefit":{"score":4,"rationale":"Scoped conclusions, counterexample witnesses, explanatory traces, and explicit preservation of ambiguity directly reduce overinterpretation. The expected benefit remains conditional because no observed historical system currently coerces timeout into a Boolean verdict.","source_ids":["S2","S5","S6","S8"]},"scalability":{"score":3,"rationale":"The fixed-constraint approach has polynomial algorithms and has been applied to archaeological chronology, supporting reuse within similar models. Scaling across historiographical practices remains constrained by heterogeneous semantics, stakeholder negotiation, and the need to preserve historical imprecision and provenance.","source_ids":["S3","S5","S7"]}},"score_confidence":"MODERATE","costs":{"first_evidence":{"band_2026_usd":"10K_TO_50K","scope":"A four-to-six-week, non-deployment audit of two identified workflows, including historian, formal-methods, and software-review labor; documentation and rule-language inspection; synthetic test construction; output and timeout tracing; stakeholder interviews; coordination; and a decision memo. Existing workstations and open-source or no-cost tools are assumed; no production historical records are processed.","confidence":"MODERATE","assumptions":["Approximately 0.2 to 0.4 FTE each of historian, formal-methods reviewer, and software engineer for four to six weeks.","Latest published U.S. medians of $133,080 for software developers and $74,050 for historians are used only as labor anchors; broad bands absorb specialty premiums and inflation.","Benefits and other employer compensation are loaded consistently with March 2026 BLS data showing benefits as 31.6% of civilian compensation.","Data compliance is limited to synthetic models and public documentation.","Software licenses and new equipment are negligible; evaluation and coordination labor are included."],"source_ids":["S1","S2","S5","S6","S7"]},"initial_deployment_startup":{"band_2026_usd":"250K_TO_1M","scope":"For one institution: formally specify a versioned rule grammar and semantics; implement admission checking, exact checking, bounded fallback, evidence records, and APIs; build synthetic and representative de-identified test corpora; obtain independent formal review; conduct security, accessibility, provenance, and governance review; and provide computing, software, integration, project-management, and evaluation resources.","confidence":"LOW","assumptions":["One to three loaded FTE-years across software engineering, formal methods, digital history, UX, QA, and coordination.","The host exposes its rule representation and result pipeline without major data migration.","Existing model-checking or constraint-solving libraries can be reused.","Institutional compliance covers provenance, accessibility, security, records management, and public wording rather than regulated personal data.","The fragment proof closes without a fundamental redesign."],"source_ids":["S2","S3","S5","S7","S8"]},"operational_launch":{"band_2026_usd":"250K_TO_1M","scope":"Harden and document a single-institution service; validate correctness, termination, and failure handling; test UNKNOWN preservation through exports and downstream interfaces; train scholars and stewards; run usability and interpretation studies; provision monitored compute and support; complete governance and independent methods approval; and stage a rollback-capable limited release.","confidence":"LOW","assumptions":["One bounded fragment and one institutional workflow.","No automated alteration of archival records or historical-truth adjudication.","Computing uses ordinary institutional infrastructure rather than specialized hardware.","One to two loaded FTE-years plus independent evaluation, training, compliance, and coordination.","Launch proceeds only after synthetic and de-identified evaluation meets predefined criteria."],"source_ids":["S2","S3","S5","S6","S7","S8"]},"annual_recurring":{"band_2026_usd":"50K_TO_250K","scope":"Maintain the grammar, checker, tests, dependencies, documentation, compute, and security posture; review every semantics or scheduler change; rerun affected models; monitor output interpretation and UNKNOWN coercion; support users; convene governance review; and fund periodic independent evaluation.","confidence":"LOW","assumptions":["Approximately 0.3 to 1.0 loaded FTE across engineering, formal review, historian/steward support, and coordination.","One repository or a small related collection of workflows.","Open-source core software and ordinary workstation/server equipment.","Rule-language changes and manual escalations remain infrequent.","The band includes benefits, software and infrastructure, compliance, training, monitoring, and evaluation—not salary alone."],"source_ids":["S2","S3","S5","S7"]}},"verified_pipeline_gates":{"externally_supported_problem":{"status":"NO","reason":"No inspected source documents an unrestricted exact terminating historical checker or timeout-to-Boolean coercion. The closest operational and research examples deliberately use fixed formalisms.","source_ids":["S1","S2","S3","S4","S5"]},"externally_credible_adopter_or_authorizer":{"status":"UNCERTAIN","reason":"Archaeologists, digital historians, and interdisciplinary software teams are credible stakeholders, but no source identifies a specific empowered repository board, steward, methods reviewer, or committed adopting institution for this change.","source_ids":["S1","S4","S5","S7"]},"distinct_testable_incremental_claim":{"status":"YES","reason":"On the same synthetic inputs, the proposed router can be compared with existing behavior for admission accuracy, termination, contradiction witnesses, scoped negative findings, UNKNOWN output, and downstream non-coercion.","source_ids":["S2","S3","S8"]},"bounded_next_evidence_step":{"status":"YES","reason":"A two-workflow, four-to-six-week documentation and synthetic lab audit can test the problem falsifier without production data, public verdicts, or historical-truth claims.","source_ids":["S1","S2","S4","S5"]},"no_unresolved_safety_or_authority_stop":{"status":"YES","reason":"The next step is read-only or synthetic, produces no public historical verdict, and explicitly tests the distinction between encoded inference and historical interpretation. Any observed coercion or proof gap stops further work.","source_ids":["S5","S6","S7"]},"credible_cost_scope_and_range":{"status":"YES","reason":"The ranges are broad, assumption-driven resource equivalents anchored to the documented mix of software, historical, evaluation, and coordination work. Host-specific estimates remain low confidence, but labor, benefits, data, compliance, equipment, software, coordination, and evaluation are included.","source_ids":["S2","S3","S5","S7"]}},"next_evidence_step":"Run a four-to-six-week, non-deployment audit of exactly two identified workflows: ChronoLog and the published CIDOC-CRM/Notation3/EYE historical-reasoning workflow. First compare their admitted syntax, semantics, termination claims, timeout behavior, explanations, and result taxonomy with a reference three-result harness using synthetic consistent, contradictory, cyclic/unbounded, malformed, and out-of-fragment models. The problem is falsified for this bounded sample if neither workflow accepts arbitrary executable rules nor converts timeout or unsupported input into consistent/inconsistent. Proceed only if unrestricted Boolean behavior is reproduced; otherwise classify the opportunity as known-practice diffusion or deprioritize it.","blocking_evidence":["A documented and reproducible digital-history system that accepts a computation-unbounded rule class while promising or operationally implying an exact terminating Boolean temporal-consistency verdict.","Evidence that such a system converts timeout, resource exhaustion, unsupported syntax, or incomplete search into consistent or inconsistent.","A formal definition of the proposed grammar, computation model, scheduler, membership algorithm, and exact consistency property.","Independent proof or mechanized review of membership soundness, termination, and correctness for every admitted model.","Benchmarks showing routine scholarly questions fit the fragment and remain computationally practical.","A named adopting institution, empowered authorizer, funding owner, and downstream-system owner.","User evidence that witnesses, scope labels, and UNKNOWN are understood and preserved rather than treated as historical truth or coerced into Boolean outputs."],"research_disposition":"PROBLEM_PREVALENCE_STUDY","world_novelty_boundary":"This was a bounded search across chronology software, digital-humanities model checking, historical temporal reasoning, and general formal-analysis documentation. It found substantial prior art for the core mechanisms in S1-S4 and S8. It did not find the alleged problematic system or an exact prior implementation of the full governance wrapper. Neither result supports a world-novelty or world-absence claim."}