{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003681579,0.0004102985,0.0006122154,0.0003541606,0.0001688221,0.0000555241,0.000333297,0.0004893243,0.00002718287],"category_scores_gemma":[0.000199484,0.0003598096,0.0001483547,0.0001663444,0.0001956497,0.00006671646,0.0005500251,0.0007672238,0.000003052341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005236508,"about_ca_system_score_gemma":0.00002531157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002218229,"about_ca_topic_score_gemma":0.000189794,"domain_scores_codex":[0.9981164,0.0001522996,0.0005512069,0.0005958218,0.000204217,0.0003800557],"domain_scores_gemma":[0.9984567,0.0004903235,0.0002700756,0.000656659,0.00005115177,0.00007509645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004851512,0.00009274972,0.844247,0.0006315013,0.000126108,0.00007578517,0.002850128,0.00002654512,0.0007634526,0.1497066,0.0008319045,0.0005997295],"study_design_scores_gemma":[0.0004701236,0.0000185057,0.3591925,0.0003240962,0.00005625466,0.00000776101,0.0001014373,0.00004632311,0.0009118929,0.6383208,0.000153352,0.0003969535],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9946603,0.0007976083,0.00007437874,0.00005464428,0.0007057949,0.000386543,0.00003256234,0.0001743949,0.003113731],"genre_scores_gemma":[0.9978427,0.0002213588,0.001363658,0.00008263872,0.0001426843,0.00004080525,0.00003639612,0.00006325244,0.0002064578],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4886142,"threshold_uncertainty_score":0.9998854,"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."}}