{"id":"W2752311959","doi":"10.48550/arxiv.1709.02311","title":"A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank","year":2017,"lang":"en","type":"preprint","venue":"TU/e Research Portal","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Omega; Upper and lower bounds; Parameterized complexity; Mathematics; Hamiltonian (control theory); Modulo; Discrete mathematics; Physics; Quantum mechanics; Mathematical analysis","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.01274877,0.0005726478,0.00110882,0.0004650411,0.001018139,0.0008682547,0.00154903,0.0008097492,0.0002444969],"category_scores_gemma":[0.004909456,0.0005196882,0.0007011354,0.0001113738,0.000527652,0.0001549996,0.001845499,0.002144708,0.000003907554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001810741,"about_ca_system_score_gemma":0.0009419975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004640371,"about_ca_topic_score_gemma":0.0006809963,"domain_scores_codex":[0.9942437,0.0005202394,0.0008794118,0.001132897,0.001691097,0.001532699],"domain_scores_gemma":[0.9934274,0.00191755,0.0005997882,0.002490292,0.00115275,0.0004122436],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001666869,0.001801757,0.00158125,0.022209,0.002488784,0.002371278,0.004267961,0.00002484203,0.00859657,0.1067778,0.7839334,0.0642805],"study_design_scores_gemma":[0.004693158,0.0006644554,0.0004641099,0.004032932,0.000514606,0.0002095454,0.0009575778,0.01507679,0.003620391,0.449212,0.5172516,0.003302963],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5259178,0.005718729,0.07221965,0.003001299,0.007307558,0.01541963,0.001836141,0.0009044175,0.3676748],"genre_scores_gemma":[0.6939642,0.001024241,0.1801267,0.00008443167,0.006558978,0.002800239,0.0005008794,0.0007891817,0.1141511],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3424342,"threshold_uncertainty_score":0.9997255,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2143072427806552,"score_gpt":0.5094347241514807,"score_spread":0.2951274813708255,"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."}}