{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024261,0.0008229341,0.001528877,0.0006474099,0.001175281,0.0007609293,0.001041728,0.0006365134,0.00003289136],"category_scores_gemma":[0.0007896335,0.0004812735,0.0004210914,0.0001981313,0.0006645493,0.0001307944,0.0008045578,0.001647282,3.315917e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002532371,"about_ca_system_score_gemma":0.00003967087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003116863,"about_ca_topic_score_gemma":0.00004479127,"domain_scores_codex":[0.996508,0.0006087373,0.0007193411,0.0009345227,0.0006299927,0.0005993846],"domain_scores_gemma":[0.9954461,0.002518629,0.0006143117,0.001208962,0.00007096292,0.0001409626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.008685864,0.0004054368,0.01461414,0.009966677,0.003637802,0.0009588657,0.112483,0.0004385102,0.0002324026,0.2794453,0.007565269,0.5615668],"study_design_scores_gemma":[0.01129039,0.00005875113,0.01520074,0.0002527952,0.0002873989,0.0002247559,0.0004471347,0.0005501266,0.00005849047,0.9702073,0.0007472861,0.0006748685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9807177,0.01311291,0.001504033,0.000316202,0.001289013,0.001823644,0.0001770068,0.00008686399,0.0009726322],"genre_scores_gemma":[0.987339,0.006816086,0.004672195,0.0002111214,0.000631442,0.0001045767,0.00003451223,0.0000774673,0.0001135507],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.690762,"threshold_uncertainty_score":0.9997639,"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."}}