{"id":"W2174409790","doi":"10.1007/s10107-012-0537-8","title":"On generalizations of network design problems with degree bounds","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Spanning tree; Degree (music); Combinatorics; Matroid; Rounding; Approximation algorithm; Minimum spanning tree; Discrete mathematics; Bounded function; Mathematical analysis","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.0005774708,0.0001314652,0.0001907339,0.00005653648,0.0001654964,0.0001034578,0.000420503,0.00004266359,0.00002264539],"category_scores_gemma":[0.00005435972,0.00009553636,0.00005365308,0.0005804583,0.0001149566,0.0002424536,0.0001102658,0.0001050097,0.00002065463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000154707,"about_ca_system_score_gemma":0.00002198963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002132326,"about_ca_topic_score_gemma":0.000001075551,"domain_scores_codex":[0.9987555,0.0000692351,0.0002484209,0.0001708017,0.0003115834,0.000444464],"domain_scores_gemma":[0.9990415,0.0002802245,0.00009595145,0.0004066982,0.00005470677,0.000120944],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002929333,0.0003208946,0.0001273038,0.00006785969,0.00002271735,0.000001068388,0.0006309762,0.002624252,0.000008268304,0.9516194,0.0001438821,0.04443047],"study_design_scores_gemma":[0.0004309326,0.0006818081,0.0001898964,0.0004162399,0.00003847262,0.00005889398,0.00003800213,0.2569413,0.0004620342,0.7372993,0.002997805,0.0004453319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008832936,0.0001011434,0.9969564,0.00009826053,0.0000704266,0.0003432423,2.704337e-7,0.0001417622,0.00140521],"genre_scores_gemma":[0.2087693,0.000001017635,0.7910006,0.00004693864,0.00006356508,0.00005754007,9.461931e-7,0.00001031179,0.00004975656],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2543171,"threshold_uncertainty_score":0.3895859,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08827442949770972,"score_gpt":0.2684862981794572,"score_spread":0.1802118686817475,"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."}}