{"id":"W2999464824","doi":"10.37236/742","title":"Maximal Nontraceable Graphs with Toughness less than One","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"University of South Africa; National Research Foundation","keywords":"Combinatorics; Mathematics; Hamiltonian path; Vertex (graph theory); Graph; Pancyclic graph; Discrete mathematics; Pathwidth; Line 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005634965,0.0008372236,0.0008461967,0.001743782,0.002101417,0.00186788,0.001952723,0.000839886,0.008616672],"category_scores_gemma":[0.004672911,0.0008563526,0.0009708108,0.001454169,0.00289924,0.004230117,0.002354206,0.001815335,0.0005302932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009385523,"about_ca_system_score_gemma":0.0006764827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00137057,"about_ca_topic_score_gemma":0.002249467,"domain_scores_codex":[0.9989865,0.0001321937,0.00006338544,0.0003432402,0.000209831,0.0002647799],"domain_scores_gemma":[0.9927982,0.0030541,0.001606044,0.0007538607,0.0005312106,0.001256651],"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.0009368167,0.0002894411,0.01078702,0.000974032,0.0002159051,0.002525659,0.002368034,0.03372894,0.03346571,0.8701248,0.01017081,0.03441284],"study_design_scores_gemma":[0.0001154818,0.0002295823,0.00933024,0.0001115498,0.000147818,0.002631272,0.001275545,0.06583188,0.009810991,0.8958258,0.01457948,0.0001103019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8983892,0.0004476153,0.07374314,0.001092861,0.0001271263,0.0001412343,0.001343597,0.0003717112,0.02434346],"genre_scores_gemma":[0.9602907,0.0003103976,0.02907013,0.0002590797,0.0001039983,0.0001856546,0.001883707,0.0001045994,0.007791833],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008616672,"threshold_uncertainty_score":0.0288257,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01966331848267848,"score_gpt":0.2405495525547593,"score_spread":0.2208862340720808,"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."}}