{"id":"W2104070086","doi":"10.1007/s10878-012-9462-2","title":"Finding paths with minimum shared edges","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Disjoint sets; Heuristics; Theory of computation; Combinatorics; Mathematics; Approximation algorithm; Generalization; Graph; Maximum flow problem; Constant (computer programming); Discrete mathematics; Computer science; Algorithm; Mathematical optimization","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.0008313355,0.0001099053,0.0001950711,0.0002564048,0.0001158436,0.0001357512,0.0005790596,0.00005994598,0.00002333289],"category_scores_gemma":[0.0002230524,0.00008521137,0.00006043584,0.000589861,0.00003820795,0.002524635,0.00009366424,0.0002178198,0.000004888052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008180528,"about_ca_system_score_gemma":0.0001055566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.452273e-7,"about_ca_topic_score_gemma":2.318781e-8,"domain_scores_codex":[0.9985791,0.0001419364,0.0003142775,0.0001032213,0.0005657325,0.0002957704],"domain_scores_gemma":[0.998524,0.0001775738,0.0003992362,0.0002206953,0.0004917855,0.0001867331],"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.0009164387,0.001167263,0.01220113,0.00005909176,0.000219151,0.00008312896,0.004539221,0.3161932,0.001741279,0.6474009,0.002536657,0.01294255],"study_design_scores_gemma":[0.04383309,0.01389055,0.01100415,0.001613672,0.0003554005,0.002520182,0.001374954,0.5204754,0.06979055,0.3074816,0.02346002,0.004200426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008126068,0.0002144381,0.9876491,0.000240761,0.002997473,0.0001081953,6.349035e-7,0.00002825047,0.0006351015],"genre_scores_gemma":[0.7564029,0.00003118999,0.2429303,0.00002812045,0.00054724,0.00000255953,0.000001239334,0.0000144865,0.00004201881],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7482768,"threshold_uncertainty_score":0.3474818,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02160757127980269,"score_gpt":0.2802607690312165,"score_spread":0.2586531977514138,"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."}}