{"id":"W84587889","doi":"10.1007/978-3-642-24372-1_8","title":"Formalization of Finite-State Discrete-Time Markov Chains in HOL","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Computer science; Markov chain; Automated theorem proving; Markov process; Theoretical computer science; Examples of Markov chains; Probabilistic logic; Binary number; Markov model; Scalability; Variable-order Markov model; Markov property; Algorithm; Mathematics; Programming language; Artificial intelligence; Machine learning","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001923874,0.0004468296,0.0005641346,0.001361377,0.000100049,0.0001533992,0.003264836,0.0002945141,0.00003053177],"category_scores_gemma":[0.0002925181,0.000423793,0.000110646,0.001047555,0.0006425613,0.001204028,0.001091874,0.0005748858,0.00003385399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002360288,"about_ca_system_score_gemma":0.0003381931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004110172,"about_ca_topic_score_gemma":0.00004514108,"domain_scores_codex":[0.9965003,0.00009343944,0.0008706905,0.001130865,0.0008146864,0.0005900274],"domain_scores_gemma":[0.9971358,0.0003608136,0.0006138941,0.001530451,0.0002454676,0.0001135589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002920285,0.00006106329,0.0001695437,0.0001330314,0.00001024757,0.00004853267,0.004299563,0.05122102,0.000364484,0.07350775,0.000007494449,0.8701481],"study_design_scores_gemma":[0.000206795,0.0001945388,0.0004932576,0.0004094043,0.000004176846,0.00002001391,1.182335e-7,0.8876553,0.005564339,0.1047013,0.0002408219,0.0005099812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001595706,0.0001239864,0.9928705,0.00008765852,0.0008472554,0.0004932247,0.000009813883,0.00008920913,0.005318858],"genre_scores_gemma":[0.07428856,0.00007688407,0.9246465,0.000307479,0.00009309123,0.00001533259,0.00001115751,0.00003595328,0.0005250666],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8696381,"threshold_uncertainty_score":0.9998214,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02202561707330057,"score_gpt":0.2588579265956386,"score_spread":0.236832309522338,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}