{"id":"W2277107861","doi":"10.1007/978-3-642-40104-6_31","title":"Planar Packing of Binary Trees","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Planar graph; Binary tree; Embedding; Trémaux tree; Colored; Mathematics; Time complexity; Book embedding; Tree (set theory); Spanning tree; Computer science; Graph; Discrete mathematics; 1-planar graph; Line graph; Pathwidth; 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.00008035759,0.0005620219,0.0006947453,0.0009485025,0.0006427584,0.00156676,0.0006475729,0.0006090098,0.01272655],"category_scores_gemma":[0.0008638173,0.0006204312,0.00039625,0.002525125,0.0006065334,0.001669892,0.001615635,0.001660816,0.003052858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005035395,"about_ca_system_score_gemma":0.0002137823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006834835,"about_ca_topic_score_gemma":0.0007820104,"domain_scores_codex":[0.9997804,0.00002613884,0.000009895114,0.00004158596,0.0001059643,0.00003604075],"domain_scores_gemma":[0.9998511,0.00005486951,0.00001845595,0.00003159271,0.00002083684,0.00002308867],"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.0001311549,0.00008665314,0.0002761116,0.0004879158,0.00002722281,0.0002574443,0.0003389846,0.013372,0.008095241,0.6912823,0.0309231,0.2547219],"study_design_scores_gemma":[0.00003631582,0.00008874339,0.001102321,0.0001592318,0.00002963279,0.0007883278,0.0002287595,0.03265502,0.004109447,0.8421439,0.1186337,0.00002455148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1554245,0.009748857,0.2175548,0.001133921,0.0008829732,0.0001124452,0.0008738323,0.0007795266,0.6134892],"genre_scores_gemma":[0.6265426,0.01584849,0.1421844,0.0004294326,0.0008970498,0.0001851365,0.003513094,0.0008290297,0.2095708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01272655,"threshold_uncertainty_score":0.04257452,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02479043039623776,"score_gpt":0.2757201054813904,"score_spread":0.2509296750851526,"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."}}