{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001852295,0.0002608372,0.0003029543,0.0004706337,0.0004854246,0.0008391217,0.0006641719,0.0004590236,0.007261619],"category_scores_gemma":[0.001234646,0.0002832459,0.0003401606,0.000633269,0.0005390237,0.001525759,0.001191434,0.0005173021,0.001569625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003902687,"about_ca_system_score_gemma":0.0005374738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001824226,"about_ca_topic_score_gemma":0.002716423,"domain_scores_codex":[0.9997149,0.00003139328,0.00002229693,0.0000560695,0.0001326194,0.00004262131],"domain_scores_gemma":[0.9995433,0.0001149924,0.00004992978,0.0001898177,0.00007900788,0.00002300535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005004362,0.0001225821,0.003420673,0.0003677519,0.00006080221,0.0005949946,0.0006773772,0.09494915,0.1578397,0.1757213,0.01138977,0.5543555],"study_design_scores_gemma":[0.0001129449,0.0005276548,0.002196747,0.00008563828,0.00008422958,0.001069926,0.0005386872,0.5879882,0.1265489,0.1433457,0.1374055,0.00009580227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08121415,0.0001169457,0.9022002,0.0002693605,0.00006709007,0.00008901147,0.0003606472,0.002307459,0.01337519],"genre_scores_gemma":[0.4063249,0.0002617271,0.5805875,0.0001129921,0.00001233782,0.00009704869,0.0009149174,0.000364138,0.01132446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007261619,"threshold_uncertainty_score":0.02429247,"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."}}