{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001437776,0.000192542,0.0003402161,0.0002167695,0.0004420108,0.00007061638,0.002466784,0.00005689091,0.000004193384],"category_scores_gemma":[0.00004734975,0.0001228975,0.0001274565,0.001448488,0.000249775,0.0007608811,0.0001644987,0.001201121,0.000006843674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002356037,"about_ca_system_score_gemma":0.0008531327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007969609,"about_ca_topic_score_gemma":0.00000767543,"domain_scores_codex":[0.9971634,0.0002468249,0.0003516366,0.0002020709,0.00106248,0.0009735722],"domain_scores_gemma":[0.9980332,0.0002752821,0.0003611774,0.0006563849,0.0005264095,0.0001475755],"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.0001782932,0.0002389067,0.0007910407,0.000006241768,0.0001019987,0.000130695,0.000358506,0.0002332531,0.0002249459,0.9969169,0.00007212663,0.0007471278],"study_design_scores_gemma":[0.0014238,0.001687678,0.00139987,0.0000311402,0.00002171836,0.003154255,0.00009366485,0.0004194449,0.004371434,0.9864293,0.0007555545,0.0002120978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5504813,0.002975401,0.4442638,0.001080874,0.0002075908,0.000156403,3.203375e-7,0.00003922279,0.000795079],"genre_scores_gemma":[0.99806,0.0008310092,0.000520411,0.00004370406,0.00004907884,0.000004657463,1.830853e-7,0.00002187006,0.0004690641],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4475787,"threshold_uncertainty_score":0.5218341,"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."}}