{"id":"W3211932688","doi":"10.1016/j.orl.2023.03.008","title":"On a partition LP relaxation for min-cost 2-node connected spanning subgraphs","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear programming relaxation; Spanning tree; Combinatorics; Partition (number theory); Mathematics; Minimum spanning tree; Relaxation (psychology); Linear programming; Graph partition; Minimum degree spanning tree; Greedy algorithm; Graph factorization; Discrete mathematics; Graph; Mathematical optimization; Line graph; Graph power","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.00143125,0.0001143054,0.0001119753,0.0008270303,0.00136447,0.0005993887,0.0005685549,0.00005318293,0.00003086199],"category_scores_gemma":[0.0008068142,0.0001149667,0.00008357959,0.002383648,0.0001345102,0.0005554435,0.0001359054,0.000300588,0.0002611344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008590995,"about_ca_system_score_gemma":0.0000734928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007611636,"about_ca_topic_score_gemma":0.000113196,"domain_scores_codex":[0.9978797,0.0002867064,0.0002219424,0.0004761071,0.0005838425,0.0005517438],"domain_scores_gemma":[0.9981999,0.0008329428,0.00002199345,0.0005368748,0.0003032432,0.0001050519],"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.00004733852,0.0001651391,0.0001818066,0.00004039429,0.00005402214,0.00003732901,0.002461602,0.09364554,0.05244293,0.6694756,0.1628786,0.01856969],"study_design_scores_gemma":[0.0006628342,0.0001840248,0.002775122,0.00006820495,0.000003262603,0.000004166673,0.0001189258,0.9713321,0.004680612,0.00923161,0.01070606,0.0002330199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3813772,0.00001543062,0.5619844,0.05370054,0.000479041,0.001426017,0.00004777204,0.0004799211,0.0004897004],"genre_scores_gemma":[0.9634701,0.00002647135,0.0320089,0.00194352,0.0002084522,0.001403015,0.0003396175,0.00002642674,0.0005734781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8776866,"threshold_uncertainty_score":0.9999356,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1313485043481517,"score_gpt":0.3851309175006559,"score_spread":0.2537824131525043,"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."}}