{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009426388,0.001624222,0.001879303,0.002389655,0.002027249,0.00182415,0.002970705,0.002933947,0.0156951],"category_scores_gemma":[0.01055251,0.001464575,0.001621151,0.002707223,0.001089153,0.005226925,0.003250146,0.002083287,0.001776528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009910672,"about_ca_system_score_gemma":0.002055144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001110887,"about_ca_topic_score_gemma":0.002438142,"domain_scores_codex":[0.9988311,0.0003327129,0.00006580009,0.0003747871,0.0001779834,0.000217589],"domain_scores_gemma":[0.9939507,0.003724103,0.0005989534,0.0007356146,0.0005010341,0.0004894935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004305201,0.001975148,0.01093813,0.003136483,0.0007570296,0.001331872,0.001533242,0.2982928,0.03552224,0.1376489,0.03164267,0.4729165],"study_design_scores_gemma":[0.0008399746,0.001343069,0.003674329,0.0003749322,0.0004342965,0.001083638,0.001821943,0.5056438,0.01895169,0.4531539,0.01259301,0.00008543588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5900702,0.0007727424,0.3797665,0.00186809,0.0002052412,0.0008572864,0.003273414,0.001289505,0.02189704],"genre_scores_gemma":[0.5507021,0.0004119109,0.4353097,0.0002167801,0.00006640264,0.0005405225,0.003033357,0.0004971097,0.009222184],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0156951,"threshold_uncertainty_score":0.05250531,"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."}}