{"id":"W2952697189","doi":"10.48550/arxiv.1101.2630","title":"Minimum degree condition forcing complete graph immersion","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Disjoint sets; Complement graph; Graph power; Line graph","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004350605,0.0004094758,0.0004101711,0.0007537664,0.0003589299,0.0001026936,0.003020645,0.0003218915,0.00009182262],"category_scores_gemma":[0.00002887137,0.0004827173,0.0003601259,0.0009170792,0.0003240293,0.0007596241,0.003409647,0.0009038901,0.0002795697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002019888,"about_ca_system_score_gemma":0.0001374705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001095864,"about_ca_topic_score_gemma":0.00001908563,"domain_scores_codex":[0.9970956,0.0003047843,0.0002536573,0.001496816,0.0001843406,0.0006648125],"domain_scores_gemma":[0.9970756,0.0001992668,0.0003242145,0.001845456,0.0002654211,0.0002900918],"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.0001353762,0.0001282777,0.001433479,0.0001291046,0.0001819602,0.0006067089,0.0004084443,0.01552738,0.001485758,0.9777657,0.0005081142,0.001689662],"study_design_scores_gemma":[0.0008860773,0.0001519741,0.001566312,0.0001681572,0.00006514687,0.00001516216,0.0001729262,0.1194764,0.001444805,0.8749561,0.0002617141,0.0008351633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1776532,0.0000798818,0.814912,0.00003987759,0.0005603394,0.0004238219,0.00002884619,0.0002749877,0.006027154],"genre_scores_gemma":[0.9947413,0.000156547,0.00402427,0.00007589527,0.00004712743,0.000002225538,0.00004993917,0.00002950283,0.0008731778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8170881,"threshold_uncertainty_score":0.9997625,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1731671707257376,"score_gpt":0.2335203467820918,"score_spread":0.06035317605635418,"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."}}