{"id":"W4231366617","doi":"10.22215/etd/2020-14188","title":"Routing on Heavy Path WSPD Spanners","year":2020,"lang":"en","type":"dissertation","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Spanner; Bounded function; Vertex (graph theory); Mathematics; Parameterized complexity; Routing (electronic design automation); Graph; Spanning tree; Discrete mathematics; Equal-cost multi-path routing; 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.0003371146,0.0004419094,0.000455549,0.0008240925,0.0005995636,0.0009421015,0.0007101,0.0005176949,0.009411247],"category_scores_gemma":[0.001303908,0.0002365383,0.0003285019,0.0008581366,0.0005487642,0.001669103,0.002219807,0.0006422792,0.001398545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004837405,"about_ca_system_score_gemma":0.0003615451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001186657,"about_ca_topic_score_gemma":0.00155037,"domain_scores_codex":[0.9996408,0.0000638479,0.00002631022,0.00008071084,0.0001129502,0.00007526623],"domain_scores_gemma":[0.9993559,0.0001622479,0.00005632296,0.0002088164,0.0001270221,0.00008978281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004436921,0.0000959475,0.0008854441,0.0002112421,0.00005498201,0.0004475861,0.0003192771,0.3405783,0.02127621,0.4460213,0.009871713,0.1797942],"study_design_scores_gemma":[0.0000366819,0.0001433902,0.0003047737,0.00004149898,0.0000147893,0.000147866,0.0001400102,0.5678231,0.008929414,0.3988914,0.02351012,0.00001698578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.142368,0.000484328,0.8192343,0.0003470379,0.0001919558,0.0001835802,0.0007759076,0.001054233,0.03536058],"genre_scores_gemma":[0.7286857,0.0007678584,0.2242364,0.0001931625,0.0001060062,0.0001676066,0.001720578,0.0003330482,0.04378963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009411247,"threshold_uncertainty_score":0.03148377,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01688923497502737,"score_gpt":0.2590103946015039,"score_spread":0.2421211596264766,"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."}}