{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002166542,0.00005941967,0.00007390314,0.0003373009,0.00009864372,0.00002800233,0.000121139,0.00002533023,0.000004192389],"category_scores_gemma":[0.00003742703,0.00005739575,0.00002366062,0.000807016,0.00002308465,0.0003150595,0.0000512211,0.00003365549,0.000002610097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002228267,"about_ca_system_score_gemma":0.00003595446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002713149,"about_ca_topic_score_gemma":0.00001390762,"domain_scores_codex":[0.9993427,0.00001558071,0.0001458533,0.0002116427,0.0001411975,0.0001430476],"domain_scores_gemma":[0.9996986,0.0001074,0.00002765867,0.00008493893,0.00003824933,0.00004317923],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003695615,0.0002537394,0.01187556,0.00003713624,0.00003085187,0.00003334089,0.001990695,0.02498462,0.0008523643,0.06195008,0.001994014,0.8959606],"study_design_scores_gemma":[0.001786208,0.0002052384,0.09501559,0.00001048338,0.000003517708,0.00005448509,0.00009695127,0.8925706,0.005905562,0.003390678,0.0007041272,0.0002565613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1731061,0.00006826675,0.8257245,0.0001089768,0.0001073293,0.0001150626,4.265358e-7,0.00002837248,0.0007409753],"genre_scores_gemma":[0.966452,0.00001178043,0.03300564,0.0001815298,0.00002990219,0.000009119467,0.000003304373,0.000002278271,0.0003044351],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8957041,"threshold_uncertainty_score":0.2340531,"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."}}