{"id":"W2164431548","doi":"10.1109/iccv.2007.4408970","title":"Capacity Scaling for Graph Cuts in Vision","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"","keywords":"Scaling; Maxima and minima; Computer science; Graph; Maximum cut; Maximum flow problem; Time complexity; Context (archaeology); Algorithm; Theoretical computer science; Mathematics; Discrete mathematics; Combinatorics; Geometry","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.0005902444,0.00006418769,0.00008229365,0.0001372038,0.00004463583,0.00003663228,0.0002837302,0.00004088459,0.000002145295],"category_scores_gemma":[0.00006449161,0.00005414473,0.00004149977,0.0003850387,0.0000194062,0.0005449186,0.00007024086,0.00006634436,0.0000031668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002479155,"about_ca_system_score_gemma":0.000007490904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002141281,"about_ca_topic_score_gemma":0.00002811594,"domain_scores_codex":[0.9993019,0.000007819353,0.0001601828,0.0002074221,0.0001022492,0.0002205028],"domain_scores_gemma":[0.9995492,0.0001178084,0.00002916832,0.0002089252,0.00005140671,0.00004345222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002482394,0.00009188737,0.001758202,0.00002075324,0.000002473811,0.0000119133,0.0002706666,0.000009909142,0.02179557,0.1265857,0.0009104902,0.8485177],"study_design_scores_gemma":[0.000352171,0.0001587279,0.00592056,0.00003859587,9.890265e-7,0.000006149287,0.00001597678,0.006634606,0.7879606,0.1889861,0.009714015,0.0002115517],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01014255,0.00003770395,0.9866729,0.0001579805,0.00006623512,0.0001722121,3.191209e-7,0.0002233638,0.002526747],"genre_scores_gemma":[0.4606953,0.000009238826,0.5389017,0.0002778724,0.00001725944,0.000003468883,3.075475e-7,0.000003148719,0.00009168973],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8483061,"threshold_uncertainty_score":0.2207958,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02652783890698657,"score_gpt":0.3351410557630669,"score_spread":0.3086132168560803,"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."}}