{"id":"W94179444","doi":"10.1002/net.10092","title":"A linear algorithm for compact box‐drawings of trees","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tree (set theory); Node (physics); Algorithm; Combinatorics; Computer science; Mathematics; Discrete mathematics; Engineering","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.0006547699,0.0009105132,0.001092696,0.001469821,0.0005373514,0.001122881,0.001463689,0.000878882,0.01199491],"category_scores_gemma":[0.003694441,0.0006356836,0.0006623536,0.002293911,0.0005921168,0.002999502,0.001957987,0.0009206377,0.002548795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007207793,"about_ca_system_score_gemma":0.0006583629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001704881,"about_ca_topic_score_gemma":0.002379759,"domain_scores_codex":[0.9991447,0.0001702645,0.00006857223,0.0001693544,0.0003385114,0.0001085896],"domain_scores_gemma":[0.9981874,0.001014641,0.0001497011,0.0003452086,0.0002343467,0.00006872803],"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.0004305277,0.0001275544,0.0005130951,0.0003469714,0.00004131145,0.0001713817,0.0003147361,0.0783677,0.01263373,0.04002879,0.01889827,0.8481259],"study_design_scores_gemma":[0.000249501,0.0001824789,0.0003456917,0.00006968143,0.00003345585,0.0004128734,0.0001674182,0.8937962,0.01439163,0.06791893,0.0223948,0.00003729071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01595647,0.0004616634,0.9761717,0.0001306177,0.000036941,0.0001584901,0.0002665968,0.003876353,0.002941007],"genre_scores_gemma":[0.07641503,0.0002872603,0.9188892,0.00004769361,0.00002811271,0.0002613992,0.001040799,0.0003181868,0.002712327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01199491,"threshold_uncertainty_score":0.04012692,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01584166116086022,"score_gpt":0.2590103615594873,"score_spread":0.243168700398627,"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."}}