{"id":"W2037387767","doi":"10.1016/j.jda.2006.05.002","title":"Cut problems in graphs with a budget constraint","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Maximum cut; Approximation algorithm; Constraint (computer-aided design); Mathematics; Mathematical optimization; Constant (computer programming); Combinatorics; Computer science; Graph","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.003079261,0.001459036,0.002614579,0.001867814,0.001652505,0.005077172,0.003880456,0.004059106,0.01080805],"category_scores_gemma":[0.02173494,0.001923631,0.001528144,0.003674546,0.002346906,0.01115028,0.003575157,0.005440635,0.0008059161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002379676,"about_ca_system_score_gemma":0.001822356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003106628,"about_ca_topic_score_gemma":0.003390409,"domain_scores_codex":[0.9977679,0.0009545818,0.0001235137,0.000391736,0.0004034036,0.00035883],"domain_scores_gemma":[0.9750752,0.0212566,0.0009954883,0.0008805722,0.00066059,0.00113154],"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.0005544988,0.000396313,0.001814006,0.0008366854,0.0001779925,0.0002914315,0.000397351,0.2174922,0.00196208,0.6987667,0.01830943,0.05900123],"study_design_scores_gemma":[0.0001419651,0.00005165729,0.0003182819,0.00009284012,0.0000584341,0.0001548104,0.0001555428,0.2890893,0.0008363927,0.7050731,0.004001895,0.0000257599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1226038,0.003228196,0.8357934,0.008081479,0.0004425881,0.0004580737,0.001494604,0.0004915482,0.02740639],"genre_scores_gemma":[0.6160634,0.003562401,0.3492098,0.001210967,0.0007852582,0.000862247,0.002222696,0.0006089346,0.02547421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01080805,"threshold_uncertainty_score":0.03615654,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01064658217234741,"score_gpt":0.2290906437144165,"score_spread":0.2184440615420691,"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."}}