{"id":"W4235350121","doi":"10.1142/9789812773289_0005","title":"I/O-Optimal Algorithms for Outerplanar Graphs","year":2006,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Algorithm; Mathematics; Combinatorics","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.0003947218,0.001867422,0.0008039591,0.001249546,0.0008203807,0.001828101,0.002787284,0.001108991,0.02294549],"category_scores_gemma":[0.002784511,0.000872304,0.001301001,0.002859737,0.0009535181,0.005857425,0.001910468,0.002333234,0.008045356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002123172,"about_ca_system_score_gemma":0.001341998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002831898,"about_ca_topic_score_gemma":0.003629294,"domain_scores_codex":[0.9992699,0.00008099181,0.00004589437,0.0002140492,0.0002458596,0.0001433182],"domain_scores_gemma":[0.9986441,0.0006683632,0.0001110978,0.0003617371,0.0001723239,0.0000423465],"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.0002400343,0.000304157,0.0006954212,0.001140675,0.00005343212,0.00009386845,0.0003426048,0.07098889,0.01329805,0.2077374,0.05033645,0.654769],"study_design_scores_gemma":[0.0001823593,0.000128482,0.0007189791,0.0001730718,0.00006196642,0.0003615216,0.000188879,0.3557168,0.0165781,0.5412474,0.0845965,0.00004590204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01305092,0.002191712,0.9255947,0.0006933662,0.0001368115,0.0002496802,0.0007771764,0.005943446,0.05136215],"genre_scores_gemma":[0.06279693,0.002358666,0.9123918,0.0002768121,0.0001063978,0.0003256672,0.002499493,0.00138599,0.01785814],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02294549,"threshold_uncertainty_score":0.07676035,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02919255905220694,"score_gpt":0.2506743619185098,"score_spread":0.2214818028663029,"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."}}