{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002197066,0.0004600046,0.0004564307,0.000235794,0.0001768921,0.0003060422,0.0007270024,0.0004515089,0.0001019949],"category_scores_gemma":[0.0004257497,0.0004777189,0.0001516409,0.0002368318,0.0002932147,0.0001264004,0.0006623861,0.0007015399,0.00003723666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001100833,"about_ca_system_score_gemma":0.00007083458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003239646,"about_ca_topic_score_gemma":0.0006893093,"domain_scores_codex":[0.9968194,0.001311662,0.0005285613,0.0006366196,0.0002977563,0.0004060155],"domain_scores_gemma":[0.9965392,0.0004728828,0.0001870771,0.001702063,0.0008892203,0.0002096012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005634916,0.001334408,0.003511528,0.002999124,0.001123952,0.00007903277,0.05029992,0.000330839,0.1254448,0.03806124,0.09011169,0.6866471],"study_design_scores_gemma":[0.001977544,0.000005452592,0.009384502,0.008174546,0.0003298591,0.00007096804,0.0004077186,0.3710245,0.5173366,0.02171946,0.06586139,0.003707401],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4141003,0.004622752,0.4286322,0.002053429,0.0006907616,0.00125906,0.0002807536,0.003572843,0.1447879],"genre_scores_gemma":[0.9509645,0.001626554,0.04301034,0.00004187372,0.00005762507,0.0001212163,0.0003846795,0.0001270146,0.003666226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6829396,"threshold_uncertainty_score":0.9997674,"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."}}