{"id":"W2022630997","doi":"10.1002/jgt.20560","title":"Disjoint Hamilton cycles in the random geometric graph","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Disjoint sets; Hamiltonian path; Pairwise comparison; Discrete mathematics; Line graph; Random graph; Graph","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.003928259,0.0001095932,0.0001943885,0.0008570942,0.00007317564,0.0001256594,0.001873777,0.00002752379,0.00002193702],"category_scores_gemma":[0.00006644569,0.00005613522,0.0002039394,0.001532829,0.0000671127,0.0008745242,0.0001174614,0.0002416552,0.000008225667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009035116,"about_ca_system_score_gemma":0.00001133068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008716017,"about_ca_topic_score_gemma":0.000004871712,"domain_scores_codex":[0.9985845,0.0003226079,0.0003858263,0.0001288343,0.0003735237,0.0002047182],"domain_scores_gemma":[0.998974,0.0002908887,0.0002862138,0.000348768,0.00005009238,0.00005000056],"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.0004034909,0.0009352038,0.005894489,0.00003137443,0.0002484029,0.0007451278,0.009217599,0.00002158886,0.0001579566,0.5460187,0.005077603,0.4312485],"study_design_scores_gemma":[0.002739763,0.0004158965,0.145001,0.00008501671,0.00006014503,0.0001590305,0.0009180658,0.0001972041,0.0004724792,0.8448657,0.004800291,0.0002853583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2929801,0.002533081,0.6924496,0.0004943372,0.001603655,0.000284034,0.000004420145,0.00004084653,0.009609882],"genre_scores_gemma":[0.9921153,0.0006340301,0.006644797,0.0004372166,0.0001177332,0.000003324316,8.261456e-7,0.000004525014,0.00004226937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6991352,"threshold_uncertainty_score":0.3481975,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02557476282706089,"score_gpt":0.2294983793032437,"score_spread":0.2039236164761828,"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."}}