{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009044724,0.0004750932,0.0006106571,0.001432952,0.0001871637,0.0002440001,0.005105169,0.0002726003,0.0000583318],"category_scores_gemma":[0.0001154575,0.0004165282,0.0001559177,0.0009117841,0.001414533,0.0008827449,0.001512167,0.0008616021,0.00008483872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001672284,"about_ca_system_score_gemma":0.0004028662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002058651,"about_ca_topic_score_gemma":0.00002868172,"domain_scores_codex":[0.9959406,0.00005762598,0.0005499867,0.001374312,0.001301922,0.0007755893],"domain_scores_gemma":[0.9964178,0.0008492513,0.0003363074,0.001878096,0.000324293,0.0001942275],"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.00001090094,0.00004132945,0.0001165965,0.00007163254,0.00002019142,0.0001373888,0.0007516359,0.01617946,0.003423746,0.2390075,0.00004763171,0.740192],"study_design_scores_gemma":[0.0002401364,0.0003473811,0.0003490938,0.0005314344,0.000004266398,0.00005442735,2.845092e-7,0.1669732,0.003737601,0.826399,0.0007255948,0.0006375804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003295711,0.0006760003,0.9927369,0.0003615513,0.0007074839,0.0003884014,0.000005493537,0.0001193726,0.004675174],"genre_scores_gemma":[0.3382542,0.0001051118,0.6596914,0.0005393745,0.0003156316,0.00001654674,0.000005012961,0.00006239233,0.001010371],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7395544,"threshold_uncertainty_score":0.9998286,"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."}}