{"id":"W1953770551","doi":"10.37236/550","title":"Hamiltonicity of $k$-Traceable Graphs","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Hamiltonian path; Graph; Path (computing); Vertex (graph theory); Induced path; Integer (computer science); Discrete mathematics; Longest path problem; Shortest path problem; Computer science","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.002507224,0.0001247308,0.0002711922,0.0002142964,0.0001175849,0.00002026055,0.00262466,0.0000508844,0.00001275603],"category_scores_gemma":[0.0001187284,0.0000835074,0.0001815055,0.001084196,0.0001717166,0.0004808499,0.0001966674,0.0008235663,0.000004879744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001230316,"about_ca_system_score_gemma":0.0004832663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000877927,"about_ca_topic_score_gemma":0.000002359614,"domain_scores_codex":[0.9979584,0.0002485128,0.0004524665,0.0001247919,0.0006017672,0.0006140272],"domain_scores_gemma":[0.9980521,0.000235656,0.0005102966,0.0006226251,0.0004899693,0.00008937272],"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.00004880341,0.0001626778,0.0003392099,0.000007200082,0.0000619392,0.000007489755,0.0005370694,0.00001982264,0.0006171424,0.997345,0.00005895389,0.0007946763],"study_design_scores_gemma":[0.0004443294,0.0008600932,0.0006039864,0.00001564693,0.00001411769,0.000136231,0.00005257505,0.0001934592,0.02349189,0.9736913,0.0004127072,0.00008364842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4177398,0.007551214,0.5679381,0.0003229174,0.0005982402,0.0002021179,5.525454e-7,0.00003809318,0.005608959],"genre_scores_gemma":[0.9984186,0.0008329661,0.0005369196,0.00002737042,0.00001258752,0.000001438043,4.71239e-8,0.0000104913,0.0001595428],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5806789,"threshold_uncertainty_score":0.4877316,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02183922895665276,"score_gpt":0.2527308645314063,"score_spread":0.2308916355747536,"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."}}