{"id":"W4300040415","doi":"","title":"Locating any two vertices on Hamiltonian cycles","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Jewish General Hospital","funders":"","keywords":"Hamiltonian (control theory); Hamiltonian path; Combinatorics; Mathematics; Physics; Computer science; Graph; Mathematical optimization","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002440948,0.0005115833,0.0005991243,0.0006541144,0.001655295,0.0008652185,0.001215401,0.001232053,0.006349942],"category_scores_gemma":[0.003466705,0.0006229206,0.0005291515,0.0008097921,0.001398241,0.0024201,0.00300102,0.001156004,0.0008873178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005205438,"about_ca_system_score_gemma":0.0005543375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001899967,"about_ca_topic_score_gemma":0.001995262,"domain_scores_codex":[0.9995302,0.00008489739,0.00001833818,0.0001486428,0.000091492,0.0001263996],"domain_scores_gemma":[0.9989171,0.0005745692,0.0001349592,0.0001626997,0.00009820524,0.0001124344],"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.0004757956,0.00007818211,0.006163571,0.00068372,0.00007025249,0.002296244,0.002234678,0.02743945,0.02263296,0.8712154,0.006363209,0.06034642],"study_design_scores_gemma":[0.0001128087,0.000129,0.002368812,0.0001864011,0.0000841852,0.001055816,0.001465269,0.07699467,0.01400222,0.8654764,0.0380479,0.00007661766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5930211,0.001188453,0.3485818,0.001455768,0.0003697822,0.0001964159,0.0004627342,0.0005244651,0.05419943],"genre_scores_gemma":[0.9134098,0.0005522204,0.07628917,0.0003046906,0.00005964622,0.0001297947,0.0003809612,0.0001156839,0.008757965],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006349942,"threshold_uncertainty_score":0.02124268,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02352390016396591,"score_gpt":0.287574474175542,"score_spread":0.2640505740115761,"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."}}