{"id":"W2949184891","doi":"10.48550/arxiv.math/0612751","title":"Hamilton cycles in highly connected and expanding graphs","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Combinatorics; Indifference graph; Random graph; Enhanced Data Rates for GSM Evolution; Mathematics; Cograph; Variety (cybernetics); Graph; Dense graph; Pathwidth; Chordal graph; Discrete mathematics; Computer science; 1-planar graph; Line graph; Artificial intelligence; Statistics","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.0006161938,0.0003716296,0.0004477399,0.001241761,0.001053125,0.001006773,0.0008757901,0.0007423773,0.0031696],"category_scores_gemma":[0.004370423,0.0004526369,0.0002626963,0.000851609,0.002156586,0.001654505,0.001435819,0.0009559178,0.0002719489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007751118,"about_ca_system_score_gemma":0.0005956213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0019485,"about_ca_topic_score_gemma":0.002575481,"domain_scores_codex":[0.9994422,0.0001494337,0.0000278276,0.0001109705,0.0001678488,0.0001016562],"domain_scores_gemma":[0.9961545,0.002376926,0.0004703732,0.000171321,0.0004124631,0.0004144263],"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.0000405803,0.00002139537,0.00091383,0.00008417459,0.00001541845,0.0005664372,0.0005072794,0.01273117,0.005921723,0.9710231,0.001026943,0.00714788],"study_design_scores_gemma":[0.00003114063,0.00002741894,0.0005526817,0.00002542931,0.00001224068,0.0002487735,0.0002231245,0.04953808,0.002066893,0.9434973,0.003760123,0.00001673957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7247537,0.0007852265,0.2380222,0.0008950566,0.00004435559,0.0001210612,0.0002348515,0.0002622102,0.03488138],"genre_scores_gemma":[0.9654867,0.0004017114,0.02806074,0.0002018247,0.0000463264,0.0001342467,0.0001865737,0.00004208713,0.005439733],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0031696,"threshold_uncertainty_score":0.01060337,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05230583427344748,"score_gpt":0.306984042397521,"score_spread":0.2546782081240735,"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."}}