{"id":"W2963663072","doi":"","title":"Rainbow perfect matchings and Hamilton cycles in the random\\ngeometric graph","year":2017,"lang":"en","type":"article","venue":"Insecta mundi","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"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; Random regular graph; Vertex (graph theory); Discrete mathematics; Hamiltonian path; Graph; Line graph; 1-planar graph","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001423455,0.0001959412,0.0002984687,0.0003051402,0.0009998723,0.0002812494,0.0007543224,0.0001133264,0.00003100156],"category_scores_gemma":[0.00104551,0.0001199041,0.00011621,0.0001837302,0.0002984296,0.0001896723,0.0001615969,0.0003394787,0.000002696227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001469171,"about_ca_system_score_gemma":0.00001002946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001333713,"about_ca_topic_score_gemma":0.0006872934,"domain_scores_codex":[0.9987575,0.0002088816,0.0002433625,0.0002453268,0.0002582529,0.0002866394],"domain_scores_gemma":[0.9976183,0.001264945,0.0001786331,0.0008702598,0.00002392892,0.00004391691],"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.0005537956,0.0002488958,0.4505869,0.0004321939,0.0002090353,0.0001652252,0.06361216,0.000002680682,0.001022108,0.4624563,0.002387276,0.01832337],"study_design_scores_gemma":[0.001874947,0.00005781371,0.3006203,0.00005292216,0.00003532477,0.00006975147,0.0001068935,0.00003157425,0.00004033475,0.6962436,0.0006663586,0.0002002202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9905527,0.0004964537,0.00004687046,0.0002096781,0.0002883707,0.0003336839,0.000006810501,0.00003799578,0.008027415],"genre_scores_gemma":[0.9988381,0.0002352598,0.0004224104,0.0002239571,0.0001093656,0.00002516583,0.00000132945,0.00002377111,0.0001206931],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2337873,"threshold_uncertainty_score":0.769031,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04590574373742391,"score_gpt":0.3236284613387166,"score_spread":0.2777227176012927,"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."}}