{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00132417,0.0009819551,0.002053163,0.003697128,0.004138041,0.007650007,0.002651725,0.002810772,0.01998526],"category_scores_gemma":[0.006867134,0.001206355,0.001811053,0.005190562,0.004055133,0.007665763,0.002886313,0.00748623,0.001459297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004369618,"about_ca_system_score_gemma":0.00130209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003869788,"about_ca_topic_score_gemma":0.004487277,"domain_scores_codex":[0.9985014,0.0004310719,0.00007563746,0.0002523048,0.0004127734,0.0003268693],"domain_scores_gemma":[0.9952862,0.003086061,0.0003233195,0.0003468503,0.0003576739,0.0005998955],"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.00002434542,0.00004078533,0.0002063629,0.00007428449,0.00001098477,0.00005414898,0.0001272698,0.003216854,0.0001183919,0.9849097,0.004402258,0.006814765],"study_design_scores_gemma":[0.00002329386,0.000009564286,0.0002005321,0.0000384,0.00001001148,0.0001043596,0.000143923,0.010615,0.00008536295,0.9823803,0.006378104,0.00001107577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3510836,0.01142607,0.2621999,0.01796672,0.00076562,0.000229827,0.001695197,0.0004937313,0.3541392],"genre_scores_gemma":[0.8034398,0.008111641,0.09687988,0.001618134,0.001069481,0.0002548018,0.001940549,0.0002229014,0.08646282],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01998526,"threshold_uncertainty_score":0.06685734,"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."}}