{"id":"W2108558002","doi":"","title":"Memory Requirements for Local Geometric Routing and Traversal in Digraphs","year":2008,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Tree traversal; Graph traversal; Computer science; Strongly connected component; Routing (electronic design automation); Node (physics); Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; Algorithm; 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.0009876272,0.0005389464,0.0007690125,0.0006526731,0.0007864648,0.002114394,0.002290227,0.0008587046,0.00852739],"category_scores_gemma":[0.009125439,0.0004458502,0.0004914976,0.001234585,0.0008339774,0.00631172,0.0017145,0.0006775829,0.0009741047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001352489,"about_ca_system_score_gemma":0.0008842739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001812068,"about_ca_topic_score_gemma":0.003192947,"domain_scores_codex":[0.9989001,0.0002511402,0.0001175163,0.0002330103,0.0002193736,0.000278904],"domain_scores_gemma":[0.9915234,0.005560246,0.0005625075,0.001882114,0.0002581162,0.000213559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002944035,0.0002655108,0.00947599,0.0008629238,0.0001325025,0.000696582,0.0009059195,0.458901,0.03539913,0.1940836,0.01231933,0.2840135],"study_design_scores_gemma":[0.0001618425,0.0004339657,0.001499829,0.00007475699,0.0001304955,0.0005869856,0.0003679119,0.8629575,0.02265,0.105402,0.005676153,0.0000586513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6128795,0.001357467,0.3627791,0.001817607,0.00008291356,0.0001417472,0.001138575,0.00348337,0.01631975],"genre_scores_gemma":[0.9486027,0.0004932117,0.04712024,0.0001321027,0.00003256076,0.0001327369,0.0006223227,0.0001812381,0.002682894],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00852739,"threshold_uncertainty_score":0.02852696,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03611474426571042,"score_gpt":0.2584583483242786,"score_spread":0.2223436040585682,"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."}}