{"id":"W2397721975","doi":"","title":"Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability.","year":2014,"lang":"en","type":"article","venue":"Mathematical Foundations of Computer Science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reachability; Planar graph; Computer science; Directed graph; Planar; Algorithm; Time complexity; Graph; Polynomial; Combinatorics; Mathematics; Discrete mathematics; Computer graphics (images)","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.001714897,0.002745288,0.002216776,0.001714631,0.001852832,0.00358567,0.006877317,0.002656691,0.03979541],"category_scores_gemma":[0.01038325,0.000846479,0.002157539,0.003707735,0.002225958,0.009312718,0.004622286,0.004390883,0.00894795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005869945,"about_ca_system_score_gemma":0.007694503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008568107,"about_ca_topic_score_gemma":0.02253355,"domain_scores_codex":[0.9957235,0.0008487286,0.0002285195,0.00131621,0.001014453,0.0008686223],"domain_scores_gemma":[0.9891587,0.006262609,0.000508053,0.002834663,0.0006757409,0.000560075],"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.004521688,0.00200884,0.003819727,0.003040427,0.0005731989,0.0004338761,0.0008289389,0.1026241,0.02991672,0.1012281,0.1309864,0.620018],"study_design_scores_gemma":[0.001999946,0.0005960087,0.002722643,0.0002012492,0.000581736,0.0009613237,0.0006092716,0.6398209,0.01719541,0.3025838,0.03255875,0.000168883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07011542,0.004153946,0.8048536,0.008105977,0.0007119598,0.001039159,0.005785078,0.03720345,0.06803143],"genre_scores_gemma":[0.44813,0.000993775,0.5165547,0.001258519,0.0003475491,0.001194027,0.007594202,0.001825751,0.02210149],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03979541,"threshold_uncertainty_score":0.1331289,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00982317101792221,"score_gpt":0.2444755355935422,"score_spread":0.2346523645756199,"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."}}