{"id":"W2128283887","doi":"10.1109/ijcnn.1991.155205","title":"A continuous-time inference network for minimum-cost path problems","year":2002,"lang":"en","type":"article","venue":"","topic":"Electrochemical Analysis and Applications","field":"Chemistry","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Heuristics; Inference; Computer science; Path (computing); Convergence (economics); Mathematical optimization; Set (abstract data type); Algorithm; Mathematics; Artificial intelligence","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004116659,0.0001085337,0.0001741277,0.00001024816,0.00008888182,0.00003613233,0.0001666694,0.00007510721,0.005873055],"category_scores_gemma":[0.00002931998,0.00008845115,0.0001090511,0.0001439501,0.00002497291,0.00002924258,0.00002271514,0.00008234823,0.000456595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001556914,"about_ca_system_score_gemma":0.000005750598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006543076,"about_ca_topic_score_gemma":0.000004119102,"domain_scores_codex":[0.9991849,0.000002579028,0.0002076879,0.0002339719,0.00008081015,0.0002900259],"domain_scores_gemma":[0.9994351,0.0001387839,0.00006628566,0.0002301524,0.00005198253,0.00007768113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000007283405,0.0003428857,0.001161978,0.00006841708,0.0001074301,4.134881e-7,0.00006851492,0.0001009169,0.7990299,0.006398828,0.1797998,0.01291366],"study_design_scores_gemma":[0.0009440674,0.00005320361,0.00001656251,0.0000810673,0.0001537242,0.00000354235,0.00002608076,0.2045746,0.1257149,0.009673134,0.6581263,0.000632845],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2955225,0.001397026,0.05040217,0.004247378,0.00002848419,0.001210471,0.0001405873,0.0009207973,0.6461306],"genre_scores_gemma":[0.9049575,0.00005868463,0.003828609,0.0003144258,0.0002873904,0.0005842113,0.0001260226,0.00001932722,0.08982384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.673315,"threshold_uncertainty_score":0.9950357,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01528017589955625,"score_gpt":0.2305038017015235,"score_spread":0.2152236258019672,"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."}}