{"id":"W2982460817","doi":"10.48550/arxiv.1910.14289","title":"Expected Complexity of Routing in $Θ$ 6 and Half-$Θ$ 6 Graphs","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Equal-cost multi-path routing; Static routing; Multipath routing; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Combinatorics; Computer science; Mathematics; Dynamic Source Routing; Discrete mathematics; Algorithm; Routing (electronic design automation); Computer network; 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.002989693,0.001220009,0.0014518,0.001156845,0.001102196,0.002763631,0.004231527,0.002063988,0.00619306],"category_scores_gemma":[0.0233323,0.001035746,0.001468078,0.001629831,0.001484772,0.00683545,0.002162899,0.00199494,0.0009194678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003409665,"about_ca_system_score_gemma":0.001947951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004907338,"about_ca_topic_score_gemma":0.004062462,"domain_scores_codex":[0.9954038,0.001384023,0.000261567,0.001092665,0.0009050223,0.000952945],"domain_scores_gemma":[0.972551,0.0199296,0.002324437,0.002999179,0.001240565,0.0009551664],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000839917,0.0002177791,0.003328531,0.0003752098,0.0001806685,0.0002475522,0.0001988593,0.8743911,0.005716021,0.0560662,0.007940993,0.05049713],"study_design_scores_gemma":[0.00005716025,0.00007119369,0.0007242985,0.0000141564,0.00004069001,0.0001416392,0.00007906605,0.9378034,0.001572455,0.05829477,0.00118157,0.00001957694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5060699,0.001274919,0.468253,0.004315438,0.0002105985,0.0003180368,0.00252445,0.002854851,0.01417887],"genre_scores_gemma":[0.836485,0.0008066671,0.1533078,0.0006418983,0.0001370386,0.0002918848,0.002518263,0.0006986303,0.005112845],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00619306,"threshold_uncertainty_score":0.02473897,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.103561986002293,"score_gpt":0.1993505511072041,"score_spread":0.09578856510491114,"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."}}