{"id":"W22225833","doi":"10.48550/arxiv.1311.4860","title":"Computing Covers of Plane Forests","year":2013,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Cover (algebra); Disjoint sets; Combinatorics; Convex hull; Bounding overwatch; Mathematics; Plane (geometry); Function (biology); Pairwise comparison; Set (abstract data type); Regular polygon; Discrete mathematics; Computer science; Geometry; Artificial intelligence","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.0003142578,0.0007510447,0.0009254435,0.001669733,0.0008563628,0.002121377,0.001080503,0.000986942,0.005673928],"category_scores_gemma":[0.003484255,0.0007299025,0.001021114,0.001997305,0.0008706553,0.003910947,0.001985232,0.0007788597,0.001316147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001263331,"about_ca_system_score_gemma":0.0006504687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006567459,"about_ca_topic_score_gemma":0.008187662,"domain_scores_codex":[0.9990669,0.00008428709,0.00005016882,0.0002173568,0.0003366484,0.0002446459],"domain_scores_gemma":[0.998591,0.0007009216,0.0001434634,0.0003070296,0.0001573826,0.0001002513],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001433001,0.000183494,0.02382347,0.000768468,0.0002843348,0.0009632311,0.001393748,0.4039755,0.0347325,0.1411216,0.02194305,0.3693776],"study_design_scores_gemma":[0.00006236854,0.0001465906,0.006145357,0.00009328082,0.00007931467,0.0008476715,0.0005975113,0.7886154,0.02124371,0.1590063,0.02311096,0.0000514682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5498839,0.001841422,0.4246956,0.0004417794,0.0000668128,0.0001430715,0.005047919,0.003446103,0.01443333],"genre_scores_gemma":[0.7957843,0.0007438223,0.1874195,0.0001239781,0.0000751323,0.0001516953,0.01024918,0.0005265456,0.004925977],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006567459,"threshold_uncertainty_score":0.01898116,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0210147564405527,"score_gpt":0.2365894507730449,"score_spread":0.2155746943324922,"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."}}