{"id":"W1493227459","doi":"10.1109/rams.2015.7105176","title":"An improved d-MP search algorithm for multi-state networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Integer (computer science); Backtracking; Binary number; Algorithm; Path (computing); State (computer science); Computer science; Value (mathematics); State vector; Binary search algorithm; Mathematics; Search algorithm; Physics; Arithmetic","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":[],"consensus_categories":[],"category_scores_codex":[0.0002599315,0.00007760307,0.00008440357,0.00002379558,0.00002409185,0.00003722106,0.00007976998,0.00005589252,0.00000873902],"category_scores_gemma":[0.00001520124,0.00006833931,0.00002596806,0.00007313623,0.00001617144,0.0001841308,0.00000948039,0.00006981229,0.000006582918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004804905,"about_ca_system_score_gemma":0.0000149253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004606809,"about_ca_topic_score_gemma":0.00003434152,"domain_scores_codex":[0.999477,0.00001074111,0.000112335,0.000121721,0.00005005322,0.0002281576],"domain_scores_gemma":[0.9995681,0.00001441333,0.000006662293,0.0001599885,0.000126833,0.0001240222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005143076,0.00001862066,0.0000137485,0.000007818703,0.000006402961,2.152546e-7,0.0001292617,0.8870529,0.0001096779,0.00002915532,0.0006344634,0.1119926],"study_design_scores_gemma":[0.0005621765,0.00007200581,0.00003346397,0.000002701915,0.000002713866,6.079666e-7,0.0001016407,0.9974378,0.0006580559,0.00006947164,0.0009585928,0.0001007903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001430505,0.00003923112,0.9971807,0.00002198972,0.0002759098,0.00032508,0.000006399942,0.0002954942,0.0004246957],"genre_scores_gemma":[0.1107688,0.00006791233,0.8873965,0.00007059664,0.0001361254,0.00007712268,0.00006805005,0.00004662966,0.001368307],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1118918,"threshold_uncertainty_score":0.2786796,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03301198021849107,"score_gpt":0.2771858809276127,"score_spread":0.2441739007091216,"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."}}