{"id":"W2061436084","doi":"10.1016/j.dam.2008.01.027","title":"Constant memory routing in quasi-planar and quasi-polyhedral graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; Carleton University","funders":"","keywords":"Mathematics; Constant (computer programming); Planar graph; Combinatorics; Routing (electronic design automation); Planar; Discrete mathematics; Graph; Computer science","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.0007715453,0.0006059298,0.0008655863,0.0008555899,0.001111848,0.002923322,0.002390466,0.001208216,0.009715282],"category_scores_gemma":[0.005561712,0.000643878,0.0004710451,0.001851752,0.001343816,0.006124159,0.001313401,0.00138941,0.0005622293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001779189,"about_ca_system_score_gemma":0.001005997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004232745,"about_ca_topic_score_gemma":0.005615149,"domain_scores_codex":[0.9995592,0.0001026091,0.00002403448,0.0001201469,0.00006007036,0.0001339377],"domain_scores_gemma":[0.9963767,0.00211948,0.0005243837,0.0004473403,0.000268622,0.0002633856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009942889,0.0001341898,0.001593978,0.000524755,0.00005758777,0.0002194718,0.0002926709,0.2647455,0.006399136,0.6600545,0.008474349,0.05650965],"study_design_scores_gemma":[0.0001282517,0.0001431291,0.0007942486,0.00005057958,0.00004696612,0.0002155694,0.0002573339,0.4463525,0.002388183,0.5461171,0.003474257,0.00003189838],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5270292,0.002235405,0.4455533,0.002807224,0.0002144482,0.0001229183,0.001326385,0.0008284656,0.01988271],"genre_scores_gemma":[0.8986455,0.001410207,0.08583054,0.0003587212,0.00009777419,0.0001196152,0.0005374417,0.0002266828,0.01277351],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.009715282,"threshold_uncertainty_score":0.03250086,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02407151804749936,"score_gpt":0.249513418155564,"score_spread":0.2254419001080646,"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."}}