{"id":"W2963282263","doi":"10.1137/1.9781611975031.70","title":"A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Rank (graph theory); Hamiltonian (control theory); Combinatorics; Matrix (chemical analysis); Materials science; Mathematical optimization; Composite material","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.0009881023,0.0005858963,0.0007689472,0.00006636935,0.0007583533,0.0004365234,0.0007155188,0.0009592808,0.00002371193],"category_scores_gemma":[0.00001582379,0.0005197135,0.0008439575,0.00003006855,0.0004288715,0.0000789561,0.0002816177,0.0004312629,0.00001624006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004743629,"about_ca_system_score_gemma":0.0001356481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.933792e-7,"about_ca_topic_score_gemma":0.000001272243,"domain_scores_codex":[0.9977531,0.000004621685,0.0006607409,0.0007099055,0.0003350651,0.000536599],"domain_scores_gemma":[0.9980989,0.0004739624,0.0005721799,0.0005642375,0.0001378734,0.0001529243],"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.00003606966,0.00002990502,3.282105e-8,0.0003312764,0.0003241379,6.963768e-7,0.001846072,6.057003e-7,0.0003108863,0.9751057,0.006461086,0.01555356],"study_design_scores_gemma":[0.001789326,0.0001503287,2.340919e-8,0.0002316877,0.0002155947,0.000009735045,0.00009485067,0.002509479,0.0007182276,0.8672886,0.1263571,0.0006350931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008340748,0.0001948367,0.8232542,0.0001855123,0.001851938,0.005815392,0.0004445725,0.000480623,0.1669389],"genre_scores_gemma":[0.001814196,0.00003393365,0.5884365,0.0006612187,0.005961883,0.0008997142,0.0001176428,0.0003734433,0.4017015],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2348177,"threshold_uncertainty_score":0.9997255,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03601687008750448,"score_gpt":0.2479868785746317,"score_spread":0.2119700084871272,"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."}}