{"id":"W2985259086","doi":"10.1007/978-3-030-39881-1_8","title":"Packing Trees into 1-Planar Graphs","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Planar; Packing problems; Disjoint sets; Matching (statistics); Path (computing); Graph; Computer science","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.0002309269,0.0007825154,0.0007363134,0.00110876,0.0007710794,0.001421605,0.0008777994,0.001161402,0.005752403],"category_scores_gemma":[0.002112922,0.0008045868,0.0007431577,0.001984395,0.0008924358,0.003257644,0.002340687,0.001055832,0.001383069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006095553,"about_ca_system_score_gemma":0.0002491064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007385208,"about_ca_topic_score_gemma":0.0006837536,"domain_scores_codex":[0.9994673,0.0000876377,0.00003665511,0.0001381846,0.0001195094,0.0001507282],"domain_scores_gemma":[0.9993549,0.0002653695,0.0001823279,0.00009319008,0.00004899316,0.00005528527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003873914,0.0002874069,0.004313735,0.00108344,0.00009822553,0.001823778,0.001157017,0.3419688,0.0312933,0.4072033,0.01381611,0.1965676],"study_design_scores_gemma":[0.00006724928,0.0003838548,0.002666162,0.0001670306,0.00007006396,0.00236514,0.0008073112,0.3541523,0.01504842,0.5929547,0.03126508,0.00005281885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5355185,0.001926536,0.4276098,0.0006378879,0.0001569746,0.0002104296,0.001122685,0.0008838999,0.03193327],"genre_scores_gemma":[0.7458631,0.003129405,0.2364746,0.0003611155,0.0001672974,0.0001757762,0.002544867,0.0003631531,0.01092059],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005752403,"threshold_uncertainty_score":0.01924372,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02224383213300857,"score_gpt":0.2724450679724637,"score_spread":0.2502012358394551,"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."}}