{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000391823,0.0001787264,0.0002869018,0.0001602885,0.0001767392,0.00009103159,0.0003951616,0.00007130076,0.00001196092],"category_scores_gemma":[0.00003483298,0.0001582673,0.00003802166,0.0003907265,0.0001615862,0.0001992885,0.0001459321,0.0001855169,0.0000257138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002392222,"about_ca_system_score_gemma":0.00006191901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001705868,"about_ca_topic_score_gemma":0.0000124147,"domain_scores_codex":[0.9985592,0.00002866193,0.0004059993,0.0003233424,0.0003135436,0.0003692269],"domain_scores_gemma":[0.9991675,0.0001479478,0.0001209033,0.0004040197,0.00002882237,0.0001307988],"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.000003728199,0.0001315943,0.0001933095,0.00006595076,0.00001032611,0.00002939414,0.00870313,0.0000624721,0.0007359821,0.988676,0.00009807316,0.001290027],"study_design_scores_gemma":[0.002270337,0.0001786004,0.000461335,0.0001525854,0.00001359535,0.0002184519,0.003883064,0.7829883,0.001272437,0.2075492,0.0001064794,0.0009056995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04938212,0.00007992856,0.9114072,0.0004974486,0.00006766818,0.0006344013,0.000005924087,0.0002402085,0.03768506],"genre_scores_gemma":[0.785721,0.00009401279,0.213851,0.0001806097,0.00001071454,0.0000298509,0.000005457687,0.00001609925,0.00009126575],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7829258,"threshold_uncertainty_score":0.6453953,"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."}}