{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003760719,0.0002873372,0.0002490513,0.0007454279,0.0008751933,0.0008059418,0.0005659872,0.0001392911,0.00000922208],"category_scores_gemma":[0.00001035526,0.0002949942,0.0001569342,0.001071676,0.0001139644,0.0007680392,0.00002074294,0.0002938495,0.000003472179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001192359,"about_ca_system_score_gemma":0.00004770818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001105266,"about_ca_topic_score_gemma":0.00002936516,"domain_scores_codex":[0.9980872,0.00009367761,0.00044505,0.0006268218,0.0003737151,0.0003735717],"domain_scores_gemma":[0.9986656,0.0002263459,0.0001497479,0.0005297845,0.0002363862,0.0001920849],"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.00001314599,0.0002716554,0.0001117327,0.0001155327,0.00004796562,0.00000261316,0.001760287,0.001866492,0.0004925107,0.9705041,0.0002515916,0.02456238],"study_design_scores_gemma":[0.0006584621,0.0001345558,0.0001062994,0.00007698254,0.00002532231,0.00001444874,0.00005297563,0.9916951,0.001742834,0.002699631,0.002446043,0.0003473434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02137795,0.00002212074,0.9763058,0.00009966105,0.001367847,0.0003206021,0.00003555352,0.0004257947,0.00004468901],"genre_scores_gemma":[0.9822128,0.0001235374,0.01594393,0.001450501,0.00009140231,0.0000371146,0.00003171738,0.00004082396,0.00006821239],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9898286,"threshold_uncertainty_score":0.9999502,"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."}}