{"id":"W3103645939","doi":"10.1007/978-3-030-83508-8_44","title":"Routing on Heavy-Path WSPD-Spanners","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Combinatorics; Routing (electronic design automation); Equal-cost multi-path routing; Path (computing); Mathematics; Routing algorithm; Bounded function; Graph; Discrete mathematics; Static routing; Computer science; Computer network; Distributed computing; Routing protocol","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003058267,0.0006306376,0.0006500572,0.0008509159,0.0007385176,0.00145692,0.001208757,0.0005447795,0.01198534],"category_scores_gemma":[0.001134044,0.0003737048,0.0004365759,0.001707019,0.0004921833,0.002604181,0.002088943,0.0009465727,0.001939752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006401916,"about_ca_system_score_gemma":0.0004437587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000882125,"about_ca_topic_score_gemma":0.001497866,"domain_scores_codex":[0.9997206,0.00003947323,0.00002388088,0.00007364976,0.0000713301,0.00007099979],"domain_scores_gemma":[0.9993711,0.0001497492,0.00006564394,0.0002096619,0.0001019525,0.0001018852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006528331,0.0002072038,0.001026783,0.0005331641,0.00009143192,0.0005810398,0.0003294492,0.1632361,0.03327908,0.5294492,0.01781363,0.2528001],"study_design_scores_gemma":[0.0000537474,0.0002421466,0.0005783782,0.00008481739,0.00004431601,0.0004308393,0.0002004353,0.2942639,0.01181546,0.6662552,0.02599702,0.00003368501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2929634,0.0007239924,0.6133813,0.0006249066,0.0003819985,0.0003341336,0.001957577,0.002075325,0.08755742],"genre_scores_gemma":[0.7148985,0.001235891,0.2197182,0.0002510787,0.0001481404,0.0002113993,0.002378795,0.0004962974,0.06066169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01198534,"threshold_uncertainty_score":0.04009491,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02440027243317933,"score_gpt":0.2493121159716375,"score_spread":0.2249118435384581,"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."}}