{"id":"W1989295643","doi":"10.1007/s00186-005-0008-6","title":"Upper and lower bounds for the solutions of Markov renewal equations","year":2005,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Markov chain; Upper and lower bounds; Markov process; Mathematics; Applied mathematics; Markov renewal process; Construct (python library); Renewal theory; Mathematical optimization; Markov model; Markov property; Computer science; Mathematical analysis; Statistics","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":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03365747,0.00008415104,0.0002934489,0.0002746654,0.0008292241,0.0001872775,0.0006590285,0.00009115611,0.0006322533],"category_scores_gemma":[0.04710994,0.00004612868,0.0001399653,0.0007593902,0.001169348,0.0002708763,0.0004116527,0.0002096975,0.00002292049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002937516,"about_ca_system_score_gemma":0.0002208117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003040952,"about_ca_topic_score_gemma":0.0001171297,"domain_scores_codex":[0.9959922,0.001378611,0.0008899902,0.0002985387,0.001130062,0.0003106015],"domain_scores_gemma":[0.9654524,0.0319806,0.00005106212,0.0008466591,0.001572175,0.00009710195],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000326492,0.0003425225,0.000009997038,0.00002653215,0.0000271679,4.381813e-8,0.001309172,0.002748797,0.003601827,0.8940412,0.000820448,0.09703967],"study_design_scores_gemma":[0.0001403833,0.00008078432,0.00004259276,0.00001418384,0.00001231639,0.00000159006,0.00050786,0.4415596,0.001541972,0.5547237,0.001333043,0.00004189217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007444082,0.0003760614,0.9741274,0.01376463,0.00004188743,0.0007459606,0.0000439566,0.000007341618,0.003448642],"genre_scores_gemma":[0.2960519,0.00002463837,0.7015814,0.0000268854,0.00004504679,0.0001726746,0.000001039876,0.000006548289,0.002089902],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4388108,"threshold_uncertainty_score":0.995053,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.5802904042036138,"score_gpt":0.6155566351697195,"score_spread":0.0352662309661057,"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."}}