{"id":"W2006278327","doi":"10.1109/tsmcb.2012.2221695","title":"Efficient Shortest-Path-Tree Computation in Network Routing Based on Pulse-Coupled Neural Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Dijkstra's algorithm; Computer science; Shortest path problem; Computation; Router; Path (computing); Tree (set theory); K shortest path routing; State (computer science); Routing (electronic design automation); Link-state routing protocol; Algorithm; Routing protocol; Theoretical computer science; Mathematics; Computer network; Graph","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003690076,0.0002946557,0.0002433244,0.000139068,0.0003034852,0.0001590766,0.0004494158,0.0001403092,0.00001640251],"category_scores_gemma":[0.000004274156,0.0002940563,0.0001330796,0.001139515,0.00005202217,0.000141628,0.000006277363,0.0005814563,0.00003300208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001193137,"about_ca_system_score_gemma":0.00002724468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004509363,"about_ca_topic_score_gemma":0.00007306325,"domain_scores_codex":[0.9977586,0.0001295374,0.0004641767,0.0004687973,0.0003878718,0.000791034],"domain_scores_gemma":[0.9985352,0.0005201221,0.0001277344,0.0005350342,0.00006017715,0.0002217311],"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.0000148743,0.0004002507,0.0002886881,0.000001976825,0.00000550259,0.000003193077,0.00009195067,0.9584929,0.00002902466,0.0006467092,0.00007617898,0.03994875],"study_design_scores_gemma":[0.0004628503,0.0001222136,0.006010343,0.00004812804,0.00001722414,0.000006002786,0.00001055904,0.9928352,0.00009976618,0.00005634657,0.00004008866,0.0002912612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06448461,0.00004556411,0.9327943,0.0004557642,0.001174278,0.0004428498,0.000002591127,0.0002122032,0.0003878225],"genre_scores_gemma":[0.988094,0.000007914006,0.01065453,0.0007958064,0.0002891209,0.00008701224,0.000006089973,0.00003266452,0.00003290905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9236093,"threshold_uncertainty_score":0.9999512,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01619248070171676,"score_gpt":0.2442163678952547,"score_spread":0.2280238871935379,"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."}}