{"id":"W2388273729","doi":"","title":"Research on Shortest Path Parallel Computing Method in Dynamic Routing Optimization","year":2010,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Shortest path problem; Constrained Shortest Path First; K shortest path routing; Private Network-to-Network Interface; Equal-cost multi-path routing; Routing (electronic design automation); Path (computing); Path vector protocol; Mathematical optimization; Link-state routing protocol; Distributed computing; Routing protocol; Computer network; Theoretical computer science; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001559527,0.000195265,0.0001949962,0.0004333743,0.000541615,0.0004654238,0.001120629,0.0001538205,0.000005335282],"category_scores_gemma":[0.000004758326,0.0002049542,0.00004842624,0.001958284,0.0000601789,0.0003036164,0.0003312092,0.000867907,0.00005136391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008911113,"about_ca_system_score_gemma":0.0001086055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002452455,"about_ca_topic_score_gemma":0.00003569104,"domain_scores_codex":[0.9977195,0.0001959466,0.0004278034,0.0008136549,0.0003111925,0.0005319595],"domain_scores_gemma":[0.9984124,0.0004308964,0.000129847,0.0006618056,0.0002559506,0.0001090637],"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.000002128818,0.0001563399,0.0002222206,0.000007155833,0.000004076559,0.000001935625,0.0003767401,0.7697127,0.0005823122,0.02048614,0.0001955756,0.2082527],"study_design_scores_gemma":[0.0002623329,0.0000256845,0.0009502003,0.00004349128,0.000002142143,0.00001673776,0.00002629009,0.9938918,0.0001520589,0.001460539,0.002956579,0.0002121331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001471083,0.00002797878,0.995599,0.0007400336,0.00006420186,0.0005962716,0.000001715125,0.0002872623,0.001212494],"genre_scores_gemma":[0.2101595,0.000008390906,0.789256,0.0002104871,0.0001375026,0.0001175945,0.00003789233,0.00002094719,0.00005172446],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2241791,"threshold_uncertainty_score":0.835779,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02250664080653481,"score_gpt":0.3586867498326547,"score_spread":0.3361801090261199,"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."}}