{"id":"W4467802","doi":"","title":"Note: On Directed Odd or Even Minimum (s, t)-Cut Problem and Generalizations.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Maximum cut; Mathematical economics; Graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005616483,0.0001528012,0.0001423355,0.00008774432,0.00009069227,0.0000609228,0.00008868345,0.0000965541,0.0003259687],"category_scores_gemma":[0.00003365519,0.0001412982,0.00002209267,0.0003181541,0.00002170962,0.00009525869,0.00001866058,0.000110186,0.00009004821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003722373,"about_ca_system_score_gemma":0.00000644877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004884841,"about_ca_topic_score_gemma":0.000007606661,"domain_scores_codex":[0.9992976,0.00002921366,0.0001839019,0.0001679127,0.0001258359,0.0001955926],"domain_scores_gemma":[0.9995974,0.00005637874,0.00002796749,0.000185851,0.00004583515,0.00008655032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006300456,0.0006390995,0.004541776,0.000549178,0.0002599217,0.00005235975,0.005941541,0.1914221,0.002265605,0.3343688,0.4408098,0.01908676],"study_design_scores_gemma":[0.003207133,0.0002918984,0.001038502,0.000204979,0.00005317738,0.00002286334,0.00002269722,0.8681905,0.002153278,0.02191191,0.1019213,0.000981802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6427252,0.00383788,0.00385744,0.003634628,0.01449024,0.003507023,0.0001150034,0.0111557,0.3166769],"genre_scores_gemma":[0.9931583,0.0005044315,0.002447371,0.000158131,0.00001662966,0.00003129217,0.00002632694,0.00006028126,0.003597192],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6767684,"threshold_uncertainty_score":0.5761973,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01602978998974036,"score_gpt":0.2202203012802721,"score_spread":0.2041905112905317,"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."}}