{"id":"W2076192504","doi":"10.1016/s0020-0190(02)00364-2","title":"Parametric analysis of overall min-cuts and applications in undirected networks","year":2002,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematics; Minimum cut; Parametric statistics; Combinatorics; Maximum cut; Algorithm; Cut; Function (biology); Arc (geometry); Discrete mathematics; Ranging; Undirected graph; Computer science; Graph; Artificial intelligence; Geometry; Telecommunications; Statistics","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.004443536,0.001278524,0.00180423,0.002908105,0.0009652265,0.002504963,0.0042522,0.00173883,0.004796484],"category_scores_gemma":[0.04388451,0.001214814,0.001407399,0.003804082,0.00234089,0.005587932,0.002630697,0.003020115,0.0002994016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001238844,"about_ca_system_score_gemma":0.0007344332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001597147,"about_ca_topic_score_gemma":0.001571331,"domain_scores_codex":[0.9980463,0.0008678807,0.00007669454,0.0004191297,0.0003860471,0.0002039104],"domain_scores_gemma":[0.9695011,0.0234324,0.002609568,0.001801613,0.001906926,0.0007483946],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002413121,0.00009338719,0.003526432,0.0002345022,0.00009590791,0.0001440006,0.0004292297,0.6646263,0.002639211,0.2437291,0.001713031,0.08252757],"study_design_scores_gemma":[0.000006947818,0.00006216309,0.001482271,0.0000272793,0.00003483424,0.0001096188,0.000119072,0.7488411,0.0005823468,0.2477626,0.00095054,0.00002124776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08010928,0.0006972893,0.9148719,0.0003553275,0.00003685891,0.00005047239,0.0002080864,0.0001779507,0.003492825],"genre_scores_gemma":[0.8390868,0.001474442,0.1524564,0.0001135014,0.0002768589,0.0002460894,0.000573707,0.0003286823,0.005443445],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004796484,"threshold_uncertainty_score":0.02349997,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01391730901247904,"score_gpt":0.253496347154556,"score_spread":0.239579038142077,"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."}}