{"id":"W3010080362","doi":"","title":"Minimum length disjoint paths and Capacitated (rooted) Steiner Tree","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Steiner tree problem; Disjoint sets; Combinatorics; Computer science; Tree (set theory); Mathematics","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.0003812953,0.0006709878,0.0007421715,0.0008903285,0.0006767194,0.001563375,0.001609606,0.001254894,0.00905262],"category_scores_gemma":[0.00402236,0.0005996004,0.0005094769,0.002303782,0.0006615975,0.002451753,0.001305314,0.00132696,0.001053608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001188006,"about_ca_system_score_gemma":0.0008008036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001179698,"about_ca_topic_score_gemma":0.002073997,"domain_scores_codex":[0.9994469,0.0001188973,0.000035774,0.0001621832,0.0001583083,0.00007785792],"domain_scores_gemma":[0.9981719,0.001024578,0.0002629338,0.0001649782,0.0002180935,0.0001573853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008470078,0.0002105762,0.001778318,0.001527555,0.0001497552,0.0007154648,0.0004481611,0.5273277,0.01777446,0.3076966,0.01711799,0.1244063],"study_design_scores_gemma":[0.00009194281,0.0002063663,0.001365782,0.0001109613,0.00008168911,0.0006537444,0.0002251175,0.4770961,0.005305938,0.5041118,0.01070799,0.00004255219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2346763,0.001517977,0.7176691,0.001995181,0.000138773,0.0001993331,0.003061406,0.0006662101,0.04007566],"genre_scores_gemma":[0.7020831,0.001773017,0.2684971,0.0002988715,0.0001471179,0.0002250946,0.002886367,0.0002929162,0.02379642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00905262,"threshold_uncertainty_score":0.03028411,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01251011154035637,"score_gpt":0.2026404312067639,"score_spread":0.1901303196664076,"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."}}