{"id":"W4287826148","doi":"","title":"Expected Complexity of Routing in Θ 6 and Half-Θ 6 Graphs","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Routing (electronic design automation); Computer network","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.001636179,0.00073881,0.001085314,0.001128244,0.0009983743,0.004473476,0.002260632,0.002118471,0.01353735],"category_scores_gemma":[0.02101222,0.000717391,0.001085967,0.001357202,0.001307054,0.006349412,0.001554472,0.002481606,0.0008432034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00285238,"about_ca_system_score_gemma":0.001870725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001979627,"about_ca_topic_score_gemma":0.002336468,"domain_scores_codex":[0.9979739,0.0006021163,0.0000762277,0.0003932848,0.0004309267,0.00052355],"domain_scores_gemma":[0.9723847,0.02163898,0.001566324,0.001911159,0.0009388535,0.001560109],"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.003071701,0.0005560429,0.01473423,0.0009106103,0.0002882952,0.0006949258,0.0006013763,0.4757259,0.01523478,0.4074333,0.03002039,0.0507285],"study_design_scores_gemma":[0.0001917187,0.0001532767,0.003903524,0.00003974377,0.00008928527,0.0004032115,0.0002175708,0.5752115,0.003282761,0.4145727,0.00189199,0.00004259681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.842106,0.0007045036,0.124078,0.006513499,0.0001535568,0.0001073071,0.004307897,0.000673507,0.02135574],"genre_scores_gemma":[0.9678199,0.0004786169,0.02251777,0.0004130466,0.0001968392,0.0001144004,0.002487941,0.0002402496,0.005731294],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01353735,"threshold_uncertainty_score":0.04528695,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05238669419876203,"score_gpt":0.2651282707307061,"score_spread":0.2127415765319441,"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."}}