{"id":"W4245919572","doi":"10.1002/rsa.20123","title":"Regular subgraphs of random graphs","year":2006,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random regular graph; Combinatorics; struct; Mathematics; Graph; Random graph; Regular graph; Strongly regular graph; Discrete mathematics; Constant (computer programming); Line graph; Pathwidth; Graph power; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004997211,0.0003382095,0.0007894206,0.0002177008,0.0003205457,0.0000426756,0.0002453315,0.0001883023,0.0001033871],"category_scores_gemma":[0.0001174368,0.0002361108,0.0003370134,0.0002627301,0.0004382476,0.0000928599,0.00009581554,0.0002051759,2.640276e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000736945,"about_ca_system_score_gemma":0.00001513136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001100927,"about_ca_topic_score_gemma":0.00001377285,"domain_scores_codex":[0.9980927,0.0001554713,0.0006211072,0.0003773579,0.000388877,0.0003644514],"domain_scores_gemma":[0.9984576,0.0006127332,0.0002832005,0.0004507507,0.0001039104,0.00009180691],"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.000783472,0.00004245287,0.001436527,0.0001908957,0.000175844,0.00001667364,0.0003741738,0.00001937253,0.001437586,0.9846565,0.001616997,0.009249476],"study_design_scores_gemma":[0.010671,0.00006317393,0.004119426,0.00003421626,0.0001367582,0.00006729628,0.00008663065,0.0001824394,0.005103743,0.9781603,0.001078707,0.0002962649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9873694,0.003575047,0.004480134,0.0000622271,0.0005751766,0.0005782954,0.00007703344,0.0001125967,0.003170131],"genre_scores_gemma":[0.9856436,0.0002183711,0.01356317,0.00004092973,0.0002297566,0.00001353005,0.000014658,0.00004039775,0.0002355463],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009887528,"threshold_uncertainty_score":0.9628319,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01111309453741431,"score_gpt":0.2513121485370848,"score_spread":0.2401990539996705,"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."}}