{"id":"W2013713597","doi":"10.1016/s0012-365x(99)00355-6","title":"On hamiltonian connectedness of K1,4-free graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Social connectedness; Pancyclic graph; Discrete mathematics; Graph; Hamiltonian (control theory); Connectivity; 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.0003596583,0.0001805164,0.0002860548,0.0001700619,0.0000971261,0.00006017523,0.00191809,0.00006097121,0.0002654274],"category_scores_gemma":[0.0002184912,0.0001476976,0.0001219687,0.0006770215,0.0001974958,0.0002303413,0.0002002631,0.0001697462,0.0001333417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001757423,"about_ca_system_score_gemma":0.0000305227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003527856,"about_ca_topic_score_gemma":0.000003519578,"domain_scores_codex":[0.9983697,0.00007670442,0.0003499282,0.0003065491,0.0005431224,0.0003540214],"domain_scores_gemma":[0.9974905,0.0004351409,0.0001059614,0.00176893,0.00008430488,0.0001152085],"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.00001493713,0.0001110867,0.00001529056,0.00007056517,0.00002225676,0.00001067244,0.00129337,0.0001416338,0.0003903667,0.9919594,0.0002343996,0.005736019],"study_design_scores_gemma":[0.0004779995,0.0001686729,0.0001196629,0.0001004204,0.000005747856,0.00001116941,0.00008704155,0.0136352,0.004104692,0.9808058,0.0002860135,0.000197583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6050808,0.0001247114,0.2948833,0.0006705804,0.0001794604,0.0007242621,0.00005980606,0.0004267481,0.09785027],"genre_scores_gemma":[0.8960469,0.00003394298,0.1019408,0.0001366626,0.00001498432,0.00003021266,0.000004420772,0.0000360607,0.001755987],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2909661,"threshold_uncertainty_score":0.6022934,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01738388388004704,"score_gpt":0.2803122943302075,"score_spread":0.2629284104501605,"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."}}