{"id":"W2287236900","doi":"10.1002/rsa.20717","title":"Rainbow perfect matchings and Hamilton cycles in the random geometric graph","year":2017,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ryerson University; Simons Foundation","keywords":"Combinatorics; Mathematics; Rainbow; Vertex (graph theory); Graph; Hamiltonian path; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.003490899,0.0008583619,0.00150795,0.002587484,0.001988776,0.002745218,0.002303239,0.001732268,0.004823398],"category_scores_gemma":[0.02438403,0.000973849,0.001319953,0.001940867,0.004170831,0.006158914,0.003984309,0.002255096,0.0008093783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003254553,"about_ca_system_score_gemma":0.00142026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002514904,"about_ca_topic_score_gemma":0.002007705,"domain_scores_codex":[0.9970353,0.001127569,0.0001497452,0.0006880506,0.0006207122,0.0003787031],"domain_scores_gemma":[0.9834806,0.010468,0.001851615,0.001867592,0.00101628,0.001315939],"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.0001076824,0.00005264243,0.0008243679,0.0001156344,0.00003698291,0.0001531878,0.0002431892,0.03136717,0.001254934,0.9544177,0.002212734,0.009213817],"study_design_scores_gemma":[0.00005260401,0.0000505249,0.0003325478,0.00004253974,0.00002353661,0.0001704575,0.00005140779,0.1258823,0.0008640832,0.8697538,0.002746155,0.00003002536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4351078,0.002463961,0.5198125,0.003166493,0.0001448994,0.0002748187,0.0007527424,0.0009488546,0.03732784],"genre_scores_gemma":[0.8950179,0.001158331,0.09230239,0.0006436726,0.0001598617,0.0005305321,0.0005261724,0.0002714159,0.009389797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004823398,"threshold_uncertainty_score":0.02361351,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02819839868109865,"score_gpt":0.3037119471072859,"score_spread":0.2755135484261873,"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."}}