Codifying a Tacit Tradition: A Position Paper on the elix-researches Program for Vietnamese Chuyên Tin / IOI-Pipeline Pedagogy

Vietnam has placed at the International Olympiad in Informatics every year since 1989 [1] and operates a national network of seventy-seven specialised informatics (chuyên Tin) classes feeding the pipeline — an elite sliver of order 103 active students per cohort year, less than ∼0.01 % of the MOET Circular 32/2018 Tin học population. This paper is about that sliver, not the general K-12 population. The pedagogy that produces the country's IOI result is carried almost entirely as practitioner-tacit knowledge in textbooks, on the VNOI wiki, and through an alumni-mentor network; a Scopus / Web of Science / VCGate scan of Vietnamese- and English-language venues over 2000–2025 returns no peer-reviewed publication of its theory or its evidence base. This paper introduces elix-researches, a theoretical, document-analytic, and simulation research program whose object of study is precisely this tradition — chuyên Tin / VNOI / IOI-pipeline pedagogy — viewed under a competitiveprogramming lens. The program does no cohort work, does not touch minors, and does not gate execution on legal or regulatory review. We commit explicitly to the chuyên Tin / IOIpipeline target population and bracket the broader Layer-C nonchuyên question as deferred. We name the program's first-mover contribution as a four-layer novelty stack: a Vietnamese-canon to IOI Syllabus 2024 crosswalk (N1), a four-way comparative pedagogy matrix across Vietnam / USACO / CSES / Codeforces (N2), a variation-axis coverage schema operationalised against VNOJ (N3), and the Spine-Cluster framework for LayerD procedural-tuning under Anderson ACT-R + Chi-Glaser + Ericsson bounds (N4, forthcoming). We position the program against Vietnamese literature (sparse, practitioner-dominated, no programmatic line on K-12 informatics pedagogy) and international literatures (CSTA, CAS / PRIMM, Brennan-Resnick, Olympiads in Informatics) and report three honest seams: T-1 now resolved by commitment, T-2 and T-3 with V1.5 resolution paths. The program is not seam-free; it is seam-mapped. The paper's contribution is a published statement of an emerging research program in the form its claims demand.