{"id":"W4248887642","doi":"10.1016/j.disc.2006.03.009","title":"Edmonds polytopes and a hierarchy of combinatorial problems","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Polytope; Closure (psychology); Polyhedron; Rank (graph theory); Integer (computer science); Bounded function; Discrete mathematics; Integer programming; Order (exchange); Upper and lower bounds; Set (abstract data type); Linear programming; Linear inequality; Inequality; Mathematical optimization","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.0003434042,0.0001176954,0.0002152889,0.0001180912,0.00007026016,0.00007329674,0.0005247407,0.00004255715,0.000005095854],"category_scores_gemma":[0.00005592402,0.00009567844,0.00004756541,0.0003349461,0.0001913082,0.0002485474,0.0003127585,0.0001027543,0.000004977357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001076093,"about_ca_system_score_gemma":0.0000242347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001297799,"about_ca_topic_score_gemma":0.00000216274,"domain_scores_codex":[0.998886,0.00004356834,0.0002860233,0.0002034271,0.0003378573,0.0002431009],"domain_scores_gemma":[0.9991187,0.0001814151,0.0001156211,0.0004573268,0.00007001212,0.00005694972],"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.000002936373,0.00006911435,0.0002529619,0.0001261732,0.000007848135,0.000002658953,0.0005978132,0.00002061355,0.002410903,0.9957133,0.00005923757,0.0007364741],"study_design_scores_gemma":[0.000361598,0.00009447758,0.0002215597,0.00004949511,0.000004292569,0.00001019329,0.00004549105,0.01084148,0.005384144,0.9825357,0.0003277992,0.0001237548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2132339,0.000530614,0.7662658,0.0004722231,0.0002119029,0.0006013656,0.00001495703,0.0001799784,0.0184892],"genre_scores_gemma":[0.8873599,0.00001234139,0.1122005,0.00001007304,0.00003962872,0.000018281,0.000002355399,0.00001464417,0.0003423291],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.674126,"threshold_uncertainty_score":0.3901653,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01297511228276546,"score_gpt":0.2628553980357212,"score_spread":0.2498802857529557,"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."}}