{"id":"W2106669190","doi":"10.1109/tvcg.2006.177","title":"Smashing Peacocks Further: Drawing Quasi-Trees from Biconnected Components","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Visualization and Computer Graphics","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia; University of British Columbia Hospital","funders":"","keywords":"Computer science; Biconnected graph; Tree (set theory); Graph; Theoretical computer science; Node (physics); Block graph; Combinatorics; Mathematics; Line graph; Pathwidth","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.0001633168,0.0002938991,0.0002695263,0.0005057782,0.0004849833,0.0006839001,0.0004633022,0.0001394557,0.00002764295],"category_scores_gemma":[0.000002723259,0.0003037813,0.0001165405,0.001049315,0.00008070556,0.0007154882,0.00001297364,0.0001946172,0.00002050537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002941335,"about_ca_system_score_gemma":0.00003431736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003202296,"about_ca_topic_score_gemma":0.000237502,"domain_scores_codex":[0.9980076,0.0001878897,0.0004817386,0.0006062916,0.0004315939,0.0002848802],"domain_scores_gemma":[0.9989242,0.0001690533,0.000160324,0.0004533332,0.0001565534,0.0001365138],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002746086,0.001673084,0.00185884,0.0000417993,0.0001816476,0.00002105318,0.002899559,0.00540595,0.0006583152,0.9722458,0.001050721,0.0139358],"study_design_scores_gemma":[0.000757647,0.0001076961,0.002364696,0.0000724844,0.00003218254,0.000006441213,0.00005257094,0.9914212,0.001322751,0.00194465,0.001543578,0.0003741659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0469829,0.00004768034,0.9513692,0.0001189448,0.0006963555,0.0001447803,0.00004230708,0.0005464462,0.00005141188],"genre_scores_gemma":[0.9956403,0.0001033018,0.002670236,0.001200359,0.0001298963,0.000008426148,0.0001483708,0.00003028577,0.0000688404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9860152,"threshold_uncertainty_score":0.9999414,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01948905818129087,"score_gpt":0.261039845021401,"score_spread":0.2415507868401102,"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."}}