{"id":"W2046240182","doi":"10.1017/s0963548314000169","title":"The First<i>k</i>-Regular Subgraph is Large","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Integer (computer science); Discrete mathematics; Computer science","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.001295289,0.0005822023,0.001320527,0.001172643,0.001724791,0.002600538,0.002010031,0.001427258,0.005498831],"category_scores_gemma":[0.01265177,0.0006052548,0.001112428,0.0007684617,0.003298462,0.002977492,0.001849217,0.002190056,0.0009362329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002356862,"about_ca_system_score_gemma":0.00123564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002090024,"about_ca_topic_score_gemma":0.002073621,"domain_scores_codex":[0.9986394,0.0002523118,0.00003426713,0.0005180158,0.0002153184,0.0003406421],"domain_scores_gemma":[0.9906144,0.004404317,0.001434556,0.001725218,0.0007591942,0.001062248],"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.001140784,0.0003396591,0.0197832,0.001076917,0.0002892662,0.001997341,0.001732155,0.03783722,0.05565936,0.8225951,0.02176625,0.03578279],"study_design_scores_gemma":[0.0002308461,0.0004080102,0.02077129,0.0001982743,0.0002643437,0.003657335,0.0008665827,0.2259364,0.03335413,0.69927,0.01486031,0.0001825793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7910686,0.0009674144,0.1477163,0.007181566,0.0001458199,0.0002537105,0.001777393,0.00204564,0.04884359],"genre_scores_gemma":[0.9803424,0.0003655132,0.01211749,0.0006191391,0.0001062697,0.0001762643,0.0006645526,0.0002768696,0.00533143],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005498831,"threshold_uncertainty_score":0.01839542,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01952974264315668,"score_gpt":0.2640621058884285,"score_spread":0.2445323632452719,"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."}}