{"id":"W2150974686","doi":"10.1109/glocom.1991.188368","title":"A neural network shortest path algorithm for optimum routing in packet-switched communications networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Shortest path problem; Artificial neural network; Robustness (evolution); Network packet; Routing (electronic design automation); Computation; Path (computing); Algorithm; Computer network; Artificial intelligence; Theoretical computer science","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.0005587931,0.0002014151,0.0002402999,0.00007014976,0.0003950905,0.0003516677,0.001224946,0.0001201644,0.00001252765],"category_scores_gemma":[0.0000345093,0.0001938552,0.00007676548,0.001056518,0.0000555164,0.0005710545,0.0003411187,0.0002661831,0.000006484089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005388057,"about_ca_system_score_gemma":0.00002129833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000147093,"about_ca_topic_score_gemma":0.00005243678,"domain_scores_codex":[0.9982544,0.0001064352,0.0004330901,0.0004259402,0.000152299,0.0006278424],"domain_scores_gemma":[0.9982784,0.0003654179,0.0001458453,0.000982166,0.0001193962,0.0001087123],"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.000001795316,0.000114231,0.00121723,0.000002923088,0.000009591281,0.000002937951,0.0003707751,0.4536944,9.324647e-7,0.005754937,0.003908399,0.5349218],"study_design_scores_gemma":[0.0004223822,0.00005165842,0.0002033178,0.00004724794,0.000006818754,0.00000855189,0.00002882402,0.9977901,0.000001740678,0.000751588,0.0004449327,0.0002428397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001326429,0.0008165702,0.9943571,0.00132539,0.0002997789,0.0003397941,9.939384e-7,0.0003242005,0.002403527],"genre_scores_gemma":[0.4264448,0.0001635272,0.5721492,0.000587123,0.0002356283,0.00007553421,0.00002106671,0.00001866534,0.0003044915],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5440957,"threshold_uncertainty_score":0.7905185,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03249872416982492,"score_gpt":0.2580709072216661,"score_spread":0.2255721830518412,"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."}}