{"schema_version":1,"experiment_id":"eoa_inverse_innovation_exp04_retrieval_first_paired20_20260802","cell_id":"computability_boundary_mapping__ethnography_qualitative_methods","hypothesis_id":"H4","search_queries":["static analysis information flow data provenance transformation programs policy compliance","workflow transformation script provenance integrity verification formal methods","patent policy enforcement data lineage transformation consent metadata","qualitative research software API script export consent audit trail","consent-aware dataflow static analysis provenance transformation code research","verified DSL data transformation provenance policy enforcement information flow","undecidability noninterference static analysis arbitrary programs Rice theorem","Google patents data lineage consent policy transformation program verification"],"sources":[{"source_id":"S1","title":"Constraints of the PROV Data Model","publisher":"World Wide Web Consortium","url":"https://www.w3.org/TR/2013/REC-prov-constraints-20130430/","source_class":"STANDARD","claims_supported":["PROV defines decidable normalization, validity, and equivalence checking for formally represented provenance instances.","Its termination guarantee depends on the specification's weakly acyclic constraint system and does not verify arbitrary transformation-program behavior."]},{"source_id":"S2","title":"QOMPLIANCE: Declarative Data-Centric Policy Compliance","publisher":"IBM Research","url":"https://research.ibm.com/publications/qompliance-declarative-data-centric-policy-compliance","source_class":"PRIMARY_RESEARCH","claims_supported":["QOMPLIANCE statically analyzes SQL-defined data movements and matches them against declarative, tag-based policies.","It is a close restricted-language analogue for pre-execution compliance checking, but it does not claim exact verification of arbitrary scripts."]},{"source_id":"S3","title":"Precise, Dynamic Information Flow for Database-Backed Applications","publisher":"arXiv / research authors","url":"https://arxiv.org/abs/1507.03513","source_class":"PRIMARY_RESEARCH","claims_supported":["The Jacqueline/Jeeves framework factors policies from application code and proves termination-insensitive noninterference and policy compliance within a defined runtime and core language.","The paper explicitly limits its guarantees to the managed runtime, illustrating strong guarantees obtained through a restricted execution model rather than universal script analysis."]},{"source_id":"S4","title":"Decidable Verification of Uninterpreted Programs","publisher":"Proceedings of the ACM on Programming Languages / arXiv","url":"https://arxiv.org/abs/1811.00192","source_class":"PRIMARY_RESEARCH","claims_supported":["The paper proves verification undecidable for its general uninterpreted-program class and identifies coherent and k-coherent subclasses with decidable verification.","This closely matches the boundary-mapping move from unrestricted verification to enforceable decidable subclasses."]},{"source_id":"S5","title":"Tracking Data Lineage and Applying Data Removal to Enforce Data Removal Policies","publisher":"Microsoft / Justia Patents","url":"https://patents.justia.com/patent/12380071","source_class":"AUTHORITATIVE_SECONDARY","claims_supported":["The patent describes lineage graphs recording transformations and graph traversal that applies removal policies to source and derived data.","It overlaps consent-withdrawal and derivative-deletion concerns but verifies recorded lineage state rather than all semantic behavior of transformation code."]},{"source_id":"S6","title":"YesWorkflow: A User-Oriented, Language-Independent Tool for Recovering Workflow Information from Scripts","publisher":"arXiv / research authors","url":"https://arxiv.org/abs/1502.02403","source_class":"PRIMARY_RESEARCH","claims_supported":["YesWorkflow recovers prospective workflow and dataflow descriptions from annotated scientific scripts in Python, R, MATLAB, and other languages.","It supports provenance visibility for script-based research workflows but does not establish semantic preservation or universal safety."]},{"source_id":"S7","title":"Taguette, the Free and Open-Source Qualitative Data Analysis Tool","publisher":"Taguette","url":"https://www.taguette.org/","source_class":"OFFICIAL_PRODUCT_DOCUMENTATION","claims_supported":["A qualitative-research product supports importing materials, coding excerpts, and exporting projects, codebooks, quotations, and documents.","It establishes the relevant qualitative import-transform-export setting but documents no boundary-aware verifier for custom transformations."]}],"proximity":"ADJACENT_PRIOR_ART","closest_analogues":[{"name":"QOMPLIANCE declarative compliance analysis","similarity":"Performs static, pre-execution policy evaluation over formally represented data movements.","remaining_difference":"Its analyzable language is SQL-defined movement, and it does not route arbitrary qualitative scripts among explicitly labeled exact, approximate, bounded, and human modes.","source_ids":["S2"]},{"name":"Jacqueline/Jeeves policy-agnostic information-flow enforcement","similarity":"Provides formally proved policy compliance for sensitive-data transformations inside a controlled programming framework.","remaining_difference":"It enforces policies through a specialized runtime rather than classifying unrestricted scripts and exposing weaker guarantee modes for code outside that runtime.","source_ids":["S3"]},{"name":"Decidable verification of coherent programs","similarity":"Explicitly separates an undecidable general verification problem from syntactically characterized decidable program subclasses.","remaining_difference":"It supplies the theoretical restriction mechanism but not qualitative provenance, consent, contextual-link properties, or an operational fallback router.","source_ids":["S4"]},{"name":"W3C PROV constraint validation","similarity":"Offers terminating, formal checks for consistency and equivalence of provenance representations.","remaining_difference":"It validates provenance records under a bounded formal constraint system, not whether arbitrary code preserves provenance, consent restrictions, or interpretive links.","source_ids":["S1"]},{"name":"Lineage-driven data-removal policy enforcement","similarity":"Tracks transformations in a lineage graph and propagates removal obligations to derived data.","remaining_difference":"It acts on reported lineage and removal state rather than proving semantic preservation by arbitrary transformation programs.","source_ids":["S5"]},{"name":"YesWorkflow provenance recovery from scientific scripts","similarity":"Addresses provenance and dataflow visibility for research transformations implemented in general-purpose scripting languages.","remaining_difference":"Its annotation-based recovery does not certify behavior or assign guarantee labels when program semantics cannot be decided exactly.","source_ids":["S6"]}],"overlapping_components":["Formal provenance representation and consistency checking","Static policy evaluation over declared data movements","Information-flow policy enforcement inside a restricted runtime","Explicit separation of undecidable general verification from decidable subclasses","Lineage tracking across transformations","Propagation of deletion or removal obligations to derived data","Provenance recovery from scientific scripts","Qualitative-data import, coding, and export workflows"],"remaining_contrastive_claim":"Within this bounded search, no opened source implements a qualitative-research transformation gate that expressly withholds an exact-safe label from unrestricted code while routing each script to a verified language, sound abstraction, bounded test, or human escalation with the resulting guarantee visibly labeled.","claim_falsifier":"A pre-existing paper, product manual, standard, or patent would falsify the contrastive claim if it documented that complete qualitative-script routing pattern—including an explicit unrestricted-verification boundary, enforceable restricted mode, sound or bounded fallbacks, human escalation, and non-escalating guarantee labels—before transformations run.","problem_support":"MODERATE","recommendation":"RESEARCH","world_novelty_boundary":"No world-novelty conclusion is made or warranted: this is only a bounded outcome from eight ordinary-web queries and seven opened direct sources, and unindexed systems, non-English literature, paywalled publications, patent families, internal professional practices, or differently named mechanisms could contain a closer match."}