{"schema_version":1,"research_id":"eoa_inverse_innovation_exp05_external_evaluation_20260803","source_assessment_id":"computability_boundary_mapping__film_media_production:P4:v0","cell_id":"computability_boundary_mapping__film_media_production","search_queries":["site:loc.gov preservation digital formats executable dependencies audiovisual exact bit-level file formats sustainability","shortest program uncomputable Kolmogorov complexity proof official lecture notes","FFV1 lossless video preservation standard RFC 9043 archival","digital preservation executable media software dependencies emulation procedural media","site:loc.gov recommended formats statement moving image lossless source master 2025 2026","site:archives.gov audiovisual digital preservation preferred formats lossless video master","exact program synthesis minimum size bounded exhaustive search superoptimization research","BLS software developers median pay 2025 occupational outlook","How Incomputable Is Kolmogorov Complexity 2020 publication date Ferbus-Zanda Grigorieff","BoSy An Experimentation Framework for Bounded Synthesis publication date 2018 authors","RFC 9043 publication date August 2021"],"sources":[{"source_id":"S1","title":"How Incomputable Is Kolmogorov Complexity?","publisher":"Entropy (MDPI)","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC7516884/","source_class":"PRIMARY_RESEARCH","publication_date":"2020-04-01","accessed_at":"2026-08-03","claims_supported":["Kolmogorov complexity is the length of a shortest program reconstructing a finite file or string relative to a fixed universal machine.","The unrestricted shortest-program-length function is not computable because determining which candidate programs halt cannot be decided generally.","Approximation or success on short examples does not remove the class-wide incomputability result."]},{"source_id":"S2","title":"RFC 9043: FFV1 Video Coding Format Versions 0, 1, and 3","publisher":"RFC Editor / Internet Engineering Task Force","url":"https://www.rfc-editor.org/rfc/rfc9043.html","source_class":"STANDARD","publication_date":"2021-08","accessed_at":"2026-08-03","claims_supported":["FFV1 is a specified lossless video codec intended in part for long-term audiovisual preservation.","Existing preservation-oriented compression already supplies frame fixity, self-description, and exact losslessness without claiming unrestricted shortest-program minimality.","The RFC is informational, reflects IETF consensus and public review, and supplies a concrete fixed-codec comparator."]},{"source_id":"S3","title":"Sustainability Factors","publisher":"Library of Congress","url":"https://www.loc.gov/preservation/digital/formats/sustain/sustain.shtml","source_class":"OFFICIAL_GUIDANCE","publication_date":"undated","accessed_at":"2026-08-03","claims_supported":["Long-term preservation depends on disclosure, adoption, transparency, self-documentation, and control of external dependencies.","Compression can inhibit transparency, although archives routinely need disclosed, adopted lossless compression for practical storage or transmission reasons.","A compact procedural package is not automatically a sustainable preservation object; documentation, dependencies, and metadata remain material."]},{"source_id":"S4","title":"Bit Level Preservation and Long Term Usability","publisher":"Library of Congress","url":"https://www.loc.gov/programs/digital-collections-management/digital-formats/bit-level-preservation-and-long-term-usability/","source_class":"OFFICIAL_GUIDANCE","publication_date":"undated","accessed_at":"2026-08-03","claims_supported":["The Library preserves inventoried collection content at the bit level and treats the original bitstream as supporting future authenticity and reuse.","Bit preservation alone does not ensure renderability when codecs, software, licensing, or hardware dependencies become unavailable.","The source master should not be discarded merely because a reconstruction package currently executes successfully."]},{"source_id":"S5","title":"Library of Congress Recommended Formats Statement 2025-2026","publisher":"Library of Congress","url":"https://www.loc.gov/preservation/resources/rfs/","source_class":"OFFICIAL_GUIDANCE","publication_date":"2025","accessed_at":"2026-08-03","claims_supported":["The Library publishes current format preferences to maximize survival and continued accessibility of creative content.","The statement is used by collection-development and recommending officers, identifying a credible institutional authorizer for format and preservation-policy decisions.","Files containing DRM or encryption that prevents use are outside the Library's stated preference."]},{"source_id":"S6","title":"Preservation Master","publisher":"U.S. National Archives and Records Administration","url":"https://www.archives.gov/preservation/products/definitions/preservation-copy","source_class":"GOVERNMENT_OR_REGULATOR","publication_date":"2023-10-26","accessed_at":"2026-08-03","claims_supported":["NARA creates high-specification digital preservation masters for long-term preservation and high-quality reuse.","Preservation masters are retained over the long term in secure storage and are used to make derivative copies.","NARA is an identifiable preservation authority, but this source does not request minimum-description certificates."]},{"source_id":"S7","title":"BoSy: An Experimentation Framework for Bounded Synthesis","publisher":"arXiv / Peter Faymonville, Bernd Finkbeiner, and Leander Tentrup","url":"https://arxiv.org/abs/1803.09566","source_class":"PRIMARY_RESEARCH","publication_date":"2018-03-26","accessed_at":"2026-08-03","claims_supported":["Bounded synthesis can establish solution minimality by increasing an explicit size bound and solving each bounded existence problem.","BoSy uses SAT, QBF, DQBF, EPR, and SMT encodings and can extract implementations that are independently checked.","Certified minimality within an explicitly bounded representation is established prior art outside media packaging."]},{"source_id":"S8","title":"Software Developers, Quality Assurance Analysts, and Testers","publisher":"U.S. Bureau of Labor Statistics","url":"https://www.bls.gov/ooh/Computer-and-Information-Technology/Software-developers.htm","source_class":"GOVERNMENT_OR_REGULATOR","publication_date":"2025","accessed_at":"2026-08-03","claims_supported":["The May 2024 median annual wage was $133,080 for software developers and $102,610 for software quality-assurance analysts and testers.","Software development and testing are normally collaborative, full-time activities involving requirements, security, testing, and documentation.","These wage figures provide a public labor anchor for broad 2026 resource-equivalent cost estimates, but not a vendor quote."]}],"problem_evidence":{"support":"WEAK","rationale":"The mathematical boundary is strongly supported: unrestricted shortest exact program descriptions are not computable, while official preservation sources establish that exactness, dependencies, storage, authenticity, and retention matter. However, no searched source documents a real mastering or archival service claiming globally shortest packages across arbitrary executable decoders or making retention decisions from such a claim. The proposal therefore joins a real theorem and real preservation stakes to an externally unverified prevalence premise.","source_ids":["S1","S2","S3","S4","S6"]},"stakeholder_evidence":{"support":"WEAK","rationale":"The Library of Congress and NARA are identifiable preservation authorities with expressed needs for sustainable formats, authentic masters, continued accessibility, and dependency management. Neither expresses demand for bounded minimality certificates, reports the alleged global-optimality error, commits to adoption, or authorizes this service. Institutional relevance is visible; stakeholder pull for the proposed intervention is not.","source_ids":["S3","S4","S5","S6"]},"prior_art":{"proximity":"ADJACENT_PRIOR_ART","closest_analogues":[{"name":"Kolmogorov-complexity incomputability result","similarity":"Directly establishes that the unrestricted shortest reconstructing program length cannot be computed generally, matching the proposal's central boundary argument.","remaining_difference":"It is a general mathematical result, not a preservation workflow, certificate schema, decoder sandbox, or media-specific service.","source_ids":["S1"]},{"name":"BoSy bounded synthesis","similarity":"Already establishes minimality by searching explicitly size-bounded implementation spaces and supports independently checkable solutions.","remaining_difference":"Its objects are reactive implementations satisfying temporal specifications, not executable packages reconstructing canonical audiovisual masters.","source_ids":["S7"]},{"name":"FFV1 lossless preservation codec","similarity":"Provides exact lossless reconstruction, storage compression, fixity, self-description, and preservation applicability under a fixed decoder specification.","remaining_difference":"It optimizes within a codec design and does not certify shortest packages across a declared program language.","source_ids":["S2"]},{"name":"Library of Congress and NARA preservation-master practices","similarity":"Already distinguish authoritative preservation masters from derivatives and evaluate transparency, dependencies, documentation, and future usability.","remaining_difference":"They do not issue formal MINIMAL-WITHIN-BOUND certificates or computability-tiered optimizer outputs.","source_ids":["S3","S4","S5","S6"]}],"distinctive_claim_remaining":"For canonical audiovisual byte strings and one mechanically enforceable finite decoder fragment, a guarantee-tiered service can enumerate every admissible package, reproduce outputs exactly, and issue a checkable MINIMAL-WITHIN-BOUND certificate while structurally preventing timeout, UNKNOWN, exact reproduction, heuristic best-found, and global minimality from being conflated. Distinctiveness is limited to this preservation-specific integration and labeling contract; the impossibility theorem, bounded minimality method, lossless codecs, and master-retention practice are established separately.","confidence":"MODERATE"},"implementation_evidence":{"support":"MODERATE","rationale":"A deliberately tiny bounded prototype is technically credible because finite enumeration terminates, exact byte comparison is available, and bounded synthesis provides a close methodological analogue. FFV1 and official preservation guidance support fixed decoder specifications, fixity, self-description, dependencies, and retention controls. Practical scale is poor because candidate counts grow exponentially; no source validates the proposed certificate format, exhaustive media DSL, isolation of adversarial decoders, dependency accounting, workflow integration, licensing posture, or production performance. Synthetic rights-cleared masters and a non-Turing-complete bounded DSL avoid the principal legal and execution hazards for the first study only.","source_ids":["S1","S2","S3","S4","S7"]},"scores":{"meaningful_impact":{"score":2,"rationale":"Avoiding false lower bounds and preserving authoritative masters could prevent serious errors, but no evidence establishes that unrestricted-minimality claims occur often or currently influence storage or deletion decisions.","source_ids":["S3","S4","S6"]},"stakeholder_pull":{"score":2,"rationale":"Major archives express adjacent preservation needs, but no adopter requests this certificate or reports the target failure mode.","source_ids":["S5","S6"]},"incremental_advantage":{"score":3,"rationale":"The tiered result vocabulary and coverage certificate are plausibly clearer than an undocumented codec-catalog search, but no comparative workflow or decision-quality effect has been measured.","source_ids":["S1","S2","S7"]},"distinctiveness_plausibility":{"score":2,"rationale":"The core mathematical boundary, bounded-minimality approach, lossless preservation codecs, and preservation-master controls all have close prior art. Only their media-preservation integration remains potentially distinctive, and the eight-source search cannot establish novelty.","source_ids":["S1","S2","S3","S4","S6","S7"]},"technical_implementability":{"score":4,"rationale":"A tiny finite decoder language, exhaustive enumerator, byte comparator, and certificate generator are implementable; production-scale usefulness is constrained by combinatorial growth and unresolved isolation and dependency accounting.","source_ids":["S2","S7"]},"adoption_authority_feasibility":{"score":3,"rationale":"Archive custodians and format-policy officers are identifiable authorities, and the pilot can preserve all masters without changing policy. Their willingness to sponsor, accept, or operationalize these certificates is unknown.","source_ids":["S5","S6"]},"evidence_readiness":{"score":3,"rationale":"The theorem and bounded-search method are documented, and a synthetic fixture study is well bounded. Prevalence, demand, production safety, and operational advantage require new empirical evidence.","source_ids":["S1","S7"]},"safety_net_benefit":{"score":4,"rationale":"Explicit UNKNOWN states, certificate invalidation, and mandatory retention of the authoritative master provide strong reversible safeguards if enforced. No evidence yet shows downstream systems will honor the labels.","source_ids":["S4","S6"]},"scalability":{"score":2,"rationale":"Exhaustive certification scales exponentially with package length and execution bounds; useful production coverage is unproven even though a small pilot is feasible.","source_ids":["S7"]}},"score_confidence":"MODERATE","costs":{"first_evidence":{"band_2026_usd":"50K_TO_250K","scope":"A 12-week partnered study covering an independent computability-proof review, artifact and stakeholder audit, tiny bounded-decoder prototype, two comparator implementations, and 20 synthetic fixtures.","confidence":"MODERATE","assumptions":["Approximately 0.25-0.5 software-engineer FTE, 0.1-0.25 QA/research FTE, and paid independent formal-methods review.","Loaded labor is assumed to exceed wages by 30-60 percent for benefits, management, equipment, and overhead.","Synthetic masters avoid licensing, clearance, and confidential-media costs."],"source_ids":["S8"]},"initial_deployment_startup":{"band_2026_usd":"50K_TO_250K","scope":"Turn a successful prototype into an internal non-production service with a versioned decoder DSL, reproducible runner, certificate schema, fixture suite, audit log, and one archive-system integration.","confidence":"LOW","assumptions":["One to two engineers for roughly three to nine months.","Only bounded, non-Turing-complete packages are executed.","No high-availability, external customer support, or production security accreditation is included."],"source_ids":["S7","S8"]},"operational_launch":{"band_2026_usd":"250K_TO_1M","scope":"Production hardening for one institution: adversarial testing, isolated execution architecture, identity and access controls, preservation-system integration, monitoring, independent verification, documentation, governance, and staff training.","confidence":"LOW","assumptions":["A multidisciplinary team of two to five staff-equivalents for six to twelve months.","The authoritative master remains in the existing preservation repository.","Licensing or rights disputes, major procurement, and multi-institution interoperability could move the cost above this band."],"source_ids":["S3","S4","S8"]},"annual_recurring":{"band_2026_usd":"50K_TO_250K","scope":"Operation for one institution, including 0.5-1.0 engineering/QA FTE, compute and storage, decoder and dependency updates, certificate revalidation, security review, and user support.","confidence":"LOW","assumptions":["Workload remains modest and bounded searches are queued rather than latency-critical.","Existing repository, identity, logging, and backup infrastructure are reused.","The range is resource-equivalent, not a procurement quote."],"source_ids":["S7","S8"]}},"verified_pipeline_gates":{"externally_supported_problem":{"status":"UNCERTAIN","reason":"The impossibility boundary and preservation consequences are externally supported, but the claimed real-world behavior—global-minimum labeling across arbitrary executable decoders—was not found.","source_ids":["S1","S3","S4","S6"]},"externally_credible_adopter_or_authorizer":{"status":"UNCERTAIN","reason":"The Library of Congress and NARA are credible preservation authorities, but neither source expresses demand, pilot interest, funding intent, or adoption authority for this particular certification service.","source_ids":["S5","S6"]},"distinct_testable_incremental_claim":{"status":"YES","reason":"The proposal can be tested against codec-catalog and heuristic-search baselines for complete in-bound enumeration, exact reconstruction, correct minimum selection, explicit UNKNOWN behavior, dependency accounting, and label strength.","source_ids":["S1","S2","S7"]},"bounded_next_evidence_step":{"status":"YES","reason":"A 12-week, two-institution audit plus a 20-fixture synthetic benchmark has explicit sample limits, comparators, recorded outputs, and failure conditions.","source_ids":["S7","S8"]},"no_unresolved_safety_or_authority_stop":{"status":"YES","reason":"For the next study only, synthetic masters, an enforceable non-Turing-complete bounded decoder, no changes to production packages, and mandatory retention of originals avoid destructive authority, content-rights, and unrestricted-code-execution stops. Production deployment remains unresolved.","source_ids":["S4","S6"]},"credible_cost_scope_and_range":{"status":"YES","reason":"All four estimates name staffing, duration, infrastructure assumptions, and exclusions and are anchored to public developer and QA wages; precision remains low because there is no prototype measurement or vendor quote.","source_ids":["S8"]}},"next_evidence_step":"Run one 12-week partnered, non-production study with two audiovisual archives. Audit 30 recent codec, packaging, or procedural-media optimization records and interview 6 responsible staff to determine whether any output is communicated as globally smallest, whether search bounds and dependencies are recorded, and whether such claims affect retention or storage decisions. In parallel, have an independent reviewer check the exact diagonal theorem statement for the frozen decoder and master encoding, then implement a tiny finite decoder DSL and test the proposal and two comparators—current finite codec-catalog search and heuristic best-found search—on 20 synthetic masters: six with independently derived shortest in-bound programs, four with valid nonminimal heuristic packages, four with no in-bound reconstruction, two operational timeouts outside the bounded tier, two omitted-dependency packages, and two model-change invalidations. Record candidate counts, bounds, hashes, dependency totals, output tiers, reviewer findings, staff interpretation, and elapsed resources. Falsify the problem premise if the audit finds no unrestricted-minimum communication and staff confirm that all universes and guarantees are already bounded and correctly labeled. Falsify the intervention if the proof does not match the frozen model, any known shorter in-bound program is missed, an omitted dependency passes, a timeout becomes NO, a changed model preserves a certificate, any output displays unrestricted global minimality, or neither archive identifies a decision for which the certificate improves on its current record.","blocking_evidence":["No direct evidence that a real film, mastering, distribution, or archival pipeline claims shortest packages across arbitrary executable decoders.","No archive, studio, distributor, or funder has expressed demand or committed to a pilot.","The proposal's specific diagonal construction has not been independently checked against a formal audiovisual-master encoding and decoder machine.","No implementation demonstrates complete enumeration, exact comparison, dependency accounting, certificate invalidation, or usability on the proposed fixtures.","No measured comparison shows that tiered certificates improve decisions over documented finite codec-catalog searches.","Production execution isolation, decoder licensing, confidential-media handling, and integration authority remain unevaluated.","Costs are labor-based planning ranges rather than measured prototype costs or procurement quotes."],"research_disposition":"PROBLEM_PREVALENCE_STUDY","world_novelty_boundary":"World novelty, patentability, freedom to operate, market size, and realized impact were not measured. This assessment used exactly eight direct sources and found established theoretical, bounded-synthesis, codec, and preservation-policy components but no exact media-specific match; absence from this bounded search is not evidence of novelty.","arm":"COMPLETE_PROPOSAL_PORTFOLIO","candidate_version":0,"controller_recommendation":{"action":"STOP_EMPIRICAL_RESEARCH_NEEDED","repairable":false,"material_progress_observed":true,"progress_targets":["Obtain field evidence that unrestricted or ambiguously global minimum-package claims occur and affect a preservation, storage, or distribution decision.","Identify a named archive, studio, or repository owner willing and authorized to sponsor the bounded study.","Secure an independent written review of the formal theorem-to-media mapping and its assumptions.","Demonstrate the tiny bounded prototype against both comparators and all 20 falsification fixtures.","Define and review the production security, rights, dependency-accounting, retention-authority, and certificate-invalidation controls.","Replace labor-only cost assumptions with measured prototype effort, runtime, and integration estimates."],"reason":"Web research establishes the mathematical boundary, adjacent bounded-minimality prior art, preservation stakes, and credible institutional authorities, but it does not establish visible prevalence, stakeholder pull, workflow advantage, or production safety. Resolving those uncertainties requires archive artifact access, interviews, independent proof review, and live prototype testing rather than additional bounded web search."},"proposal_index":4}