{"id":"W2155901243","doi":"10.1109/tvcg.2010.60","title":"Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Visualization and Computer Graphics","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Computer science; Theoretical computer science; Graph; Lattice graph; Line graph; Voltage graph","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.000990081,0.002436492,0.001432499,0.003899647,0.001045643,0.002813988,0.002288926,0.001242385,0.0142822],"category_scores_gemma":[0.005550027,0.001267777,0.001460426,0.003794021,0.000688509,0.005793679,0.003568394,0.001965823,0.003619791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000789539,"about_ca_system_score_gemma":0.00112419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01284137,"about_ca_topic_score_gemma":0.02437798,"domain_scores_codex":[0.9992742,0.0001555891,0.00005281224,0.0001806215,0.0002437552,0.00009311522],"domain_scores_gemma":[0.9972895,0.001158473,0.0001500795,0.0008748758,0.0003597307,0.0001673572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009590432,0.0002532525,0.004279193,0.001049771,0.0002110258,0.0004833715,0.003038652,0.03324729,0.04327206,0.02647143,0.09257922,0.7941557],"study_design_scores_gemma":[0.0003401981,0.0002619368,0.002645124,0.0002442609,0.000173446,0.0007159632,0.001247949,0.7248144,0.04712602,0.1043761,0.1178131,0.0002413777],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03286196,0.001059743,0.8307557,0.000403748,0.0001341579,0.0002482987,0.003107162,0.1253933,0.006035907],"genre_scores_gemma":[0.1319439,0.0007391848,0.8461298,0.0002215561,0.00005061287,0.0002234137,0.005914096,0.01094901,0.003828515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0142822,"threshold_uncertainty_score":0.04777873,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0222614381989004,"score_gpt":0.2859705117104769,"score_spread":0.2637090735115765,"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."}}