{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006507629,0.0002341836,0.0004162264,0.0005105049,0.00009198867,0.0002153652,0.001000497,0.00007204251,0.00001540934],"category_scores_gemma":[0.00001643905,0.0001703503,0.0001900672,0.001001702,0.0002289838,0.0008210114,0.0001219702,0.0004894506,0.000004342616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005832934,"about_ca_system_score_gemma":0.0001729122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001402769,"about_ca_topic_score_gemma":0.0001692558,"domain_scores_codex":[0.9977873,0.0000946786,0.0007421205,0.000285067,0.0006562651,0.0004345689],"domain_scores_gemma":[0.9987205,0.0001002837,0.0004716283,0.000354629,0.000215157,0.0001378341],"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.0002152239,0.002953044,0.0571897,0.0002885883,0.0005925623,0.005492561,0.004454071,0.02370062,0.002256349,0.5629753,0.007596244,0.3322857],"study_design_scores_gemma":[0.01129918,0.004463645,0.08445729,0.001509035,0.000105597,0.008471521,0.0007219636,0.1257442,0.002958209,0.7396493,0.01845505,0.002165079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0446457,0.001232481,0.9454012,0.002507847,0.0007115917,0.0003567157,0.00002523417,0.00008651655,0.005032735],"genre_scores_gemma":[0.738214,0.00008312271,0.2611392,0.0001687762,0.0002508791,0.000009045893,0.000003942929,0.00002178131,0.0001092485],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6935683,"threshold_uncertainty_score":0.6946684,"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."}}