{"id":"W153015188","doi":"10.4086/toc.2006.v002a004","title":"","year":2006,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Rank (graph theory); Combinatorics; Mathematics; Pigeonhole principle; Discrete mathematics; Upper and lower bounds","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005596844,0.001836037,0.001432892,0.003537187,0.00223362,0.005970677,0.005680564,0.001759304,0.02218941],"category_scores_gemma":[0.03118616,0.001713729,0.003218145,0.003109014,0.003664308,0.014451,0.00796172,0.01071878,0.006573033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002919429,"about_ca_system_score_gemma":0.003229585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00205155,"about_ca_topic_score_gemma":0.003370554,"domain_scores_codex":[0.9892608,0.002264631,0.0006502735,0.002243808,0.004795102,0.0007854523],"domain_scores_gemma":[0.9682459,0.01506994,0.001772448,0.01094378,0.003124559,0.0008434561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000219306,0.0002508543,0.0009133919,0.0007596196,0.0002120881,0.0001925633,0.0004658435,0.02268814,0.01185467,0.7164364,0.02048516,0.2255219],"study_design_scores_gemma":[0.00009254463,0.0001620496,0.0005323514,0.0001165368,0.0002427618,0.0005592254,0.0001503852,0.1521418,0.02812943,0.7431599,0.07459775,0.0001153527],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.003111896,0.000247058,0.9795999,0.001068456,0.0001655252,0.0001886745,0.0003021993,0.001819151,0.0134971],"genre_scores_gemma":[0.1101963,0.0006039436,0.8739066,0.001368336,0.0005500661,0.0005712123,0.001206242,0.001357274,0.01023991],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9778106,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01345998444829758,"score_gpt":0.2270239102562561,"score_spread":0.2135639258079585,"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."}}