{"id":"W1981830842","doi":"10.1177/1473871614550536","title":"A search-set model of path tracing in graphs","year":2014,"lang":"en","type":"article","venue":"Information Visualization","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Shortest path problem; Set (abstract data type); Path (computing); Tracing; Node (physics); Graph; Theoretical computer science; Algorithm; Data mining","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.003096251,0.0009051519,0.001157826,0.003202547,0.0009020589,0.002595885,0.003193873,0.00195934,0.006151426],"category_scores_gemma":[0.03063947,0.0009351163,0.001721608,0.002402366,0.002719015,0.006226946,0.001757342,0.002165187,0.0009767012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002377347,"about_ca_system_score_gemma":0.001471315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01341814,"about_ca_topic_score_gemma":0.007770269,"domain_scores_codex":[0.9979691,0.0007189598,0.00009015158,0.0006052252,0.0004260509,0.0001904545],"domain_scores_gemma":[0.980961,0.01425867,0.001678585,0.001568589,0.001028258,0.0005048735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001167302,0.00008396828,0.003690629,0.0001102627,0.00004432335,0.0001510532,0.0008953637,0.8682051,0.001558901,0.1099981,0.0009424275,0.01420307],"study_design_scores_gemma":[0.000009276952,0.00002266422,0.0004225293,0.00001254182,0.000009143368,0.00004314247,0.00003558707,0.9523975,0.0001803892,0.04664762,0.00020625,0.00001321787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1123824,0.0002197884,0.8792212,0.0009045678,0.00002576461,0.000143441,0.0006427811,0.00105727,0.005402848],"genre_scores_gemma":[0.8481053,0.000315794,0.145419,0.0001418067,0.00003915523,0.0005264922,0.0007138707,0.0002889263,0.004449824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01341814,"threshold_uncertainty_score":0.02668005,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03033082628332921,"score_gpt":0.3100612597525527,"score_spread":0.2797304334692234,"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."}}