{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01303817,0.003697301,0.002879092,0.006233758,0.001951689,0.007690853,0.0044393,0.004515894,0.01241086],"category_scores_gemma":[0.07952127,0.001651767,0.002785692,0.003357691,0.005189056,0.007794043,0.006562822,0.01101265,0.001773381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004315995,"about_ca_system_score_gemma":0.00359686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002781785,"about_ca_topic_score_gemma":0.002243428,"domain_scores_codex":[0.9940679,0.002521216,0.0003010735,0.0005724001,0.001552475,0.0009848952],"domain_scores_gemma":[0.9190059,0.06915522,0.003416843,0.001730782,0.004298754,0.002392408],"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.0001254119,0.0001107854,0.0003912729,0.0003514191,0.00008366996,0.00007525455,0.0003515039,0.08066474,0.00131149,0.894318,0.003796699,0.01841976],"study_design_scores_gemma":[0.00002237882,0.00004015926,0.0002900069,0.0002398458,0.00005936563,0.00006896116,0.00008160548,0.3997103,0.0008236361,0.5959111,0.002690653,0.00006197683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03034402,0.01420852,0.9104611,0.005808525,0.0007292476,0.0001230275,0.0004384126,0.0003987066,0.03748848],"genre_scores_gemma":[0.6681316,0.02742389,0.2441186,0.0026509,0.004119642,0.001256191,0.001561098,0.0008928271,0.04984525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01303817,"threshold_uncertainty_score":0.06895328,"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."}}