{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002955455,0.002756553,0.001863931,0.003052189,0.002123626,0.005460574,0.00412824,0.002362189,0.01787443],"category_scores_gemma":[0.02869916,0.001179901,0.001814228,0.003788291,0.003208441,0.0163662,0.004141594,0.006892647,0.005445754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003125807,"about_ca_system_score_gemma":0.002584401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002316865,"about_ca_topic_score_gemma":0.004205965,"domain_scores_codex":[0.9950343,0.0008577146,0.0002082132,0.00134172,0.001534397,0.001023689],"domain_scores_gemma":[0.9810429,0.0118301,0.001046421,0.004038539,0.001264732,0.0007773623],"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.0008086913,0.0003929953,0.004435945,0.0008565006,0.0001571869,0.0002926805,0.0007491193,0.03803274,0.02116908,0.7555138,0.03294919,0.1446421],"study_design_scores_gemma":[0.00007089476,0.0001520899,0.0009210982,0.0001161896,0.00009529266,0.0002579592,0.0001119764,0.1808634,0.008778227,0.7972898,0.01124008,0.0001029295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09059012,0.003148293,0.8056611,0.008141293,0.0006826763,0.0003832382,0.00376159,0.004262664,0.0833689],"genre_scores_gemma":[0.6459404,0.002150543,0.3158179,0.003032097,0.001478323,0.0008643862,0.003336343,0.001847308,0.0255328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01787443,"threshold_uncertainty_score":0.05979592,"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."}}