CITATION.bib

% Generated by scripts/citations.mjs — do not edit by hand.
% This work, then every reference it cites whose DOI resolved to the title shown.

@software{zeropoint-node,
  title    = {ZeroPoint Node},
  author   = {Rouschev, Tsvetan},
  year     = {2026},
  version  = {1.5.9},
  doi      = {10.5281/zenodo.22178675},
  url      = {https://node.zeropoint.bg},
  note     = {59 of 83 statements accepted by the Lean 4 kernel},
}

@misc{10_1145_3493244_3493271,
  title = {Technical Debt Guild},
  doi   = {10.1145/3493244.3493271},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1145_3210459_3210461,
  title = {Construct Validity in Software Engineering Research and Software Metrics},
  doi   = {10.1145/3210459.3210461},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1186_1471_2202_5_42,
  title = {An information integration theory of consciousness},
  doi   = {10.1186/1471-2202-5-42},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1016_S0010_0277_00_00123_2,
  title = {Towards a cognitive neuroscience of consciousness: basic evidence and a workspace framework},
  doi   = {10.1016/S0010-0277(00)00123-2},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1016_j_tics_2011_05_009,
  title = {Empirical support for higher-order theories of conscious awareness},
  doi   = {10.1016/j.tics.2011.05.009},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1145_321738_321743,
  title = {Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment},
  doi   = {10.1145/321738.321743},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1016_j_ress_2022_108933,
  title = {Graphical safety assurance case using Goal Structuring Notation (GSN) — challenges, opportunities and a framework for autonomous trains},
  doi   = {10.1016/j.ress.2022.108933},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1109_C_M_1978_218136,
  title = {Hints on Test Data Selection: Help for the Practicing Programmer},
  doi   = {10.1109/C-M.1978.218136},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1109_TSE_2010_62,
  title = {An Analysis and Survey of the Development of Mutation Testing},
  doi   = {10.1109/TSE.2010.62},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1109_saner_2018_8330226,
  title = {An extensible approach for taming the challenges of JavaScript dead code elimination},
  doi   = {10.1109/saner.2018.8330226},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1145_3517745_3561427,
  title = {Muzeel},
  doi   = {10.1145/3517745.3561427},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1145_3372885_3373824,
  title = {The lean mathematical library},
  doi   = {10.1145/3372885.3373824},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1093_comjnl_27_2_97,
  title = {Literate Programming},
  doi   = {10.1093/comjnl/27.2.97},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1016_j_procs_2012_04_047,
  title = {Literate Program Execution for Reproducible Research and Executable Papers},
  doi   = {10.1016/j.procs.2012.04.047},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_6028_NIST_FIPS_203,
  title = {Module-lattice-based key-encapsulation mechanism standard},
  doi   = {10.6028/NIST.FIPS.203},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1007_978_1_4471_0963_1_5,
  title = {Extensionality and quotient types},
  doi   = {10.1007/978-1-4471-0963-1_5},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1145_2914770_2837638,
  title = {Type theory in type theory using quotient inductive types},
  doi   = {10.1145/2914770.2837638},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1007_978_3_642_79361_5_3,
  title = {Using Reflection to Explain and Enhance Type Theory},
  doi   = {10.1007/978-3-642-79361-5_3},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_1109_cac48633_2019_8996365,
  title = {A Formal Proof in Coq of Cantor-Bernstein-Schroeder’s Theorem without axiom of choice},
  doi   = {10.1109/cac48633.2019.8996365},
  note  = {resolved against Crossref on 2026-09-04},
}

@misc{10_5281_zenodo_22717782,
  title = {QPU},
  doi   = {10.5281/zenodo.22717782},
  note  = {resolved against Crossref on 2026-09-12},
}

@misc{10_1109_TSE_1985_231893,
  title = {The N-Version Approach to Fault-Tolerant Software},
  doi   = {10.1109/TSE.1985.231893},
  note  = {resolved against Crossref on 2026-09-12},
}