{"id":"W2137815559","doi":"10.1142/s0219265904001234","title":"TRAVERSAL OF A QUASI-PLANAR SUBDIVISION WITHOUT USING MARK BITS","year":2004,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Consejo Nacional de Ciencia y Tecnología","keywords":"Subdivision; Traverse; Tree traversal; Planar; Graph traversal; Planar graph; Computer science; Algorithm; Combinatorics; Graph; Planar straight-line graph; Mathematics; Computer graphics (images); Geography","routes":{"ca_aff":true,"ca_fund":true,"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.0005676783,0.00009906335,0.0002088327,0.0003244443,0.00007203214,0.0000602637,0.0002535986,0.00007177613,0.00001010173],"category_scores_gemma":[0.00005777876,0.00008736413,0.0001343102,0.0004780416,0.00002083072,0.000623556,0.00003075807,0.0002036433,0.00000174937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001103942,"about_ca_system_score_gemma":0.0001087699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002000482,"about_ca_topic_score_gemma":0.00001187481,"domain_scores_codex":[0.9988614,0.00008039681,0.000521715,0.0001294723,0.0002792623,0.0001277734],"domain_scores_gemma":[0.998846,0.00008027898,0.0005172132,0.0001187943,0.0003603842,0.00007733158],"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.0001459715,0.0002252707,0.000680629,0.00001549293,0.00008816281,0.00002342339,0.0005745247,0.9542079,0.006653479,0.01060053,0.0003026577,0.02648197],"study_design_scores_gemma":[0.001853936,0.001397624,0.003184072,0.0004546088,0.00004255175,0.00141587,0.0001284502,0.9749196,0.009922987,0.005986621,0.0004634816,0.0002302285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3325185,0.0001280948,0.6659903,0.0001242959,0.001133599,0.00003667655,2.717705e-7,0.000009488853,0.00005869109],"genre_scores_gemma":[0.9672144,0.00003212403,0.03221884,0.000101111,0.0004133387,3.328137e-7,9.412593e-7,0.000005672132,0.00001325249],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6346958,"threshold_uncertainty_score":0.3562606,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01767068749338882,"score_gpt":0.2611897400789298,"score_spread":0.2435190525855409,"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."}}