{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004289357,0.0003282389,0.0003157402,0.001859496,0.0008065078,0.001286642,0.0008720878,0.0007604698,0.01192496],"category_scores_gemma":[0.004897363,0.0002610927,0.0002249073,0.0009196063,0.002004911,0.002703041,0.0010246,0.0006952772,0.0008232645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007972665,"about_ca_system_score_gemma":0.0003791985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005689234,"about_ca_topic_score_gemma":0.0009841805,"domain_scores_codex":[0.9996328,0.0001283965,0.00001438504,0.00006382852,0.00008772572,0.00007275798],"domain_scores_gemma":[0.9968696,0.001771491,0.000463913,0.0002431513,0.0001976001,0.0004541859],"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.0001101168,0.00002611345,0.001124843,0.0001538088,0.0000204897,0.0001065398,0.0002402223,0.005064399,0.003332929,0.9670382,0.008314058,0.01446843],"study_design_scores_gemma":[0.00004551922,0.00003210824,0.001893981,0.00005047493,0.00002148126,0.0002987036,0.000215976,0.02359218,0.0019748,0.9647069,0.007147305,0.00002060858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7209117,0.002175407,0.08107954,0.00410331,0.0007116184,0.0000914246,0.002058167,0.0005171543,0.1883518],"genre_scores_gemma":[0.9835015,0.0006567041,0.006387552,0.0001837732,0.0001931056,0.00007575841,0.0004394538,0.00008428216,0.00847779],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01192496,"threshold_uncertainty_score":0.03989291,"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."}}