{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002359028,0.0001132413,0.0001952138,0.00004182656,0.00009464452,0.00004498191,0.0004660615,0.00007416118,0.00001429627],"category_scores_gemma":[0.00003306256,0.00009397068,0.00007455022,0.0002601459,0.00003135395,0.0002575196,0.00006886236,0.00009455376,0.000003399262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001164577,"about_ca_system_score_gemma":0.00004596127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001928574,"about_ca_topic_score_gemma":0.000004196806,"domain_scores_codex":[0.9990985,0.00003821947,0.0002053112,0.0002504386,0.0001503179,0.0002571604],"domain_scores_gemma":[0.9991075,0.0001804107,0.0001020452,0.0004356351,0.00009387348,0.00008049512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001806003,0.0003287876,0.0008344718,0.00003710408,0.00007046055,0.00001131944,0.0004135356,0.02339812,0.0001363087,0.02229117,0.0785772,0.8738835],"study_design_scores_gemma":[0.0004132901,0.0001071614,0.0002239049,0.00003644912,0.000005398791,0.000006339863,0.000006456755,0.9207602,0.0006033173,0.0008581458,0.07685971,0.000119683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002039555,0.0005726718,0.9976981,0.00005203388,0.0004143286,0.0001507894,0.00001079464,0.00006368524,0.0008336848],"genre_scores_gemma":[0.08989371,0.00006146453,0.9090576,0.0002322584,0.0003139412,0.00001127256,0.00002392024,0.00001736918,0.0003885387],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.897362,"threshold_uncertainty_score":0.3832013,"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."}}