{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006077742,0.00007980216,0.0001181294,0.0004597596,0.00004465674,0.0001175132,0.0003003421,0.00005094094,0.000006561553],"category_scores_gemma":[0.0001292966,0.00008096408,0.00002959258,0.0008869041,0.00002094018,0.003167132,0.00006874727,0.00004687577,0.00002308756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002468731,"about_ca_system_score_gemma":0.00005202684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001758475,"about_ca_topic_score_gemma":0.00000440337,"domain_scores_codex":[0.998862,0.00006741723,0.0005039005,0.000095521,0.0003379042,0.0001332665],"domain_scores_gemma":[0.9993122,0.00002987133,0.0001802965,0.0002416244,0.0001908656,0.00004516647],"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.000002374573,0.00002794051,0.001075709,0.00006024037,0.000002308225,4.670333e-8,0.004246277,0.1042859,0.0001123204,0.883165,0.0002178636,0.006804034],"study_design_scores_gemma":[0.0003146888,0.00002689874,0.0004803718,0.00003536189,0.000001636349,5.672139e-7,0.00009983875,0.9932992,0.001344849,0.003951023,0.0003558153,0.00008977597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01584056,0.000002272381,0.9821678,0.00005076377,0.00004617272,0.0000979699,0.000009504575,0.0000747138,0.001710208],"genre_scores_gemma":[0.9938797,0.0000159742,0.005445487,0.0004403011,0.000005667805,0.000004033681,0.0001892265,0.000003850683,0.00001570959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9780392,"threshold_uncertainty_score":0.3301619,"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."}}