{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001575151,0.0002783052,0.0002337299,0.0006231112,0.0005529025,0.0007776238,0.0005437417,0.0003650063,0.003496384],"category_scores_gemma":[0.001401878,0.0002250017,0.0003169988,0.0005710935,0.0009084616,0.001050791,0.0006679104,0.0005794546,0.0002516329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007457596,"about_ca_system_score_gemma":0.0005394603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003341408,"about_ca_topic_score_gemma":0.004082494,"domain_scores_codex":[0.9997781,0.00003374252,0.0000131301,0.00005562061,0.00004278406,0.00007668671],"domain_scores_gemma":[0.999033,0.0004585775,0.0002097473,0.00008059749,0.00009444897,0.0001236521],"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.0003490316,0.0001585454,0.009837728,0.0002668552,0.00005962964,0.001409466,0.001556416,0.05241397,0.03566586,0.8660786,0.003998633,0.02820516],"study_design_scores_gemma":[0.00007905785,0.00009340055,0.003760433,0.00002988024,0.00002651968,0.0004905189,0.0005729207,0.1075581,0.009619119,0.8729935,0.004736327,0.00004034307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9508885,0.0001963165,0.0342897,0.0002910198,0.00001520845,0.00004064621,0.0003752934,0.0001404213,0.01376287],"genre_scores_gemma":[0.9908048,0.0001709531,0.005072363,0.00005169925,0.00001653229,0.00003215871,0.0003058434,0.00002796292,0.003517771],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003496384,"threshold_uncertainty_score":0.01169658,"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."}}