{"id":"W2402639370","doi":"","title":"The Hamiltonian number of graphs with prescribed connectivity.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian (control theory); Combinatorics; Mathematical optimization","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005170061,0.0001403557,0.0001781277,0.00005957236,0.0002693253,0.00009268727,0.001277451,0.0000442493,0.000004545533],"category_scores_gemma":[0.00009864767,0.00009283003,0.0000626368,0.0008452369,0.0002359526,0.000408331,0.0001355853,0.0002204726,0.00001778579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002477826,"about_ca_system_score_gemma":0.00007021715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001239798,"about_ca_topic_score_gemma":0.000008113546,"domain_scores_codex":[0.9984674,0.0001807412,0.0001781564,0.0003127347,0.000462681,0.0003983048],"domain_scores_gemma":[0.9981297,0.0004419873,0.0001014129,0.001022648,0.0002032439,0.0001010329],"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.00005059074,0.00009215266,0.003674276,0.000002774492,0.00001956905,0.00001008341,0.0002253757,0.00000688185,0.0004056304,0.9892052,0.0001990975,0.00610833],"study_design_scores_gemma":[0.0007296276,0.0002894043,0.01426296,0.00001658147,0.00000331494,0.00001607218,0.00002074015,0.0003450531,0.004661427,0.9784502,0.001073854,0.0001307551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9805797,0.0002093993,0.00477073,0.001339277,0.0005068993,0.0004218734,0.000001633492,0.0001823155,0.01198812],"genre_scores_gemma":[0.9972042,0.00001884198,0.002464263,0.00007307759,0.000002060956,0.00001354114,3.922295e-7,0.000008708082,0.0002149471],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01662441,"threshold_uncertainty_score":0.3785499,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01062008269438518,"score_gpt":0.2704613049083753,"score_spread":0.2598412222139901,"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."}}