{"id":"W1966530078","doi":"10.1007/s00493-011-2545-3","title":"On the threshold for k-regular subgraphs of random graphs","year":2011,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Induced subgraph; Factor-critical graph; Random regular graph; Random graph; Discrete mathematics; Line graph; Graph power; Pathwidth; Vertex (graph theory)","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.0005923474,0.0001621255,0.000295582,0.00009517038,0.0002401224,0.000007634235,0.0004898208,0.00009141781,0.00009968255],"category_scores_gemma":[0.0003529499,0.00009368257,0.0003019178,0.0002289967,0.0001930956,0.00003115204,0.00006743547,0.0001314375,0.000001578155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001068117,"about_ca_system_score_gemma":0.00001149464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003037962,"about_ca_topic_score_gemma":4.587174e-7,"domain_scores_codex":[0.9990417,0.00007058044,0.0002778309,0.0001814208,0.0002093346,0.0002191653],"domain_scores_gemma":[0.9978274,0.001158529,0.0001607238,0.0006965437,0.0001086182,0.00004818032],"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.0002249967,0.0001514745,0.000285903,0.00004553322,0.00008471284,9.616763e-7,0.000909941,8.732374e-8,0.00005780858,0.991059,0.007033697,0.0001459034],"study_design_scores_gemma":[0.001349749,0.0002361821,0.0002316036,0.00002494899,0.00006097119,0.000001414649,0.00008031487,0.00001495446,0.007924106,0.9894232,0.0005314196,0.0001211304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9453368,0.0003692005,0.001027962,0.0001111895,0.001119005,0.001138781,0.00001795595,0.0000982879,0.05078084],"genre_scores_gemma":[0.9990052,0.00001940486,0.0005911689,0.0001045341,0.00001373781,0.00007458477,9.983086e-7,0.00002767927,0.0001626955],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05366842,"threshold_uncertainty_score":0.3820264,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0697965727121189,"score_gpt":0.2722161232545404,"score_spread":0.2024195505424214,"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."}}