{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001016018,0.0007283372,0.0007170223,0.0009053599,0.000551832,0.001055226,0.004527754,0.0003632251,0.00004681055],"category_scores_gemma":[0.0001538295,0.0007025168,0.0002948693,0.001161553,0.0007792909,0.0005241096,0.00233553,0.001515964,0.00007452992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000363907,"about_ca_system_score_gemma":0.0007297407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000301913,"about_ca_topic_score_gemma":0.00005128504,"domain_scores_codex":[0.994408,0.00006376415,0.0006229595,0.002373264,0.001515149,0.001016851],"domain_scores_gemma":[0.9962181,0.0007209693,0.0003022637,0.002217272,0.0002724926,0.0002689124],"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.00000577794,0.00005593789,0.00002029925,0.00002957137,0.00001701919,0.000391903,0.0006460935,0.01727942,0.00003417163,0.268564,0.00006251266,0.7128933],"study_design_scores_gemma":[0.0003957544,0.0003821435,0.0001151101,0.001422565,0.00001038191,0.0001869449,7.461881e-7,0.7210718,0.001753155,0.267232,0.005957327,0.001472004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007164706,0.0004499218,0.982308,0.001561068,0.003799006,0.0002769683,0.000007325102,0.0002766964,0.01124935],"genre_scores_gemma":[0.1170186,0.0001277207,0.8711469,0.007976216,0.001776673,0.00001682366,0.00001867755,0.00009537598,0.001823021],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7114213,"threshold_uncertainty_score":0.9999818,"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."}}