{"id":"W156350744","doi":"","title":"Hamiltonian cycles in sparse vertex-adjacency duals","year":2004,"lang":"en","type":"article","venue":"Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Dual polyhedron; Adjacency list; Vertex (graph theory); Combinatorics; Hamiltonian path; Adjacency matrix; Hamiltonian (control theory); Mathematics; Computer science; Discrete mathematics; Graph; Mathematical optimization","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.0005115795,0.0006125221,0.000533689,0.00131026,0.001118635,0.0003624709,0.00220916,0.0005022415,0.000141745],"category_scores_gemma":[0.00008365496,0.0007791244,0.0003486486,0.002795652,0.0002738963,0.003375179,0.0009232894,0.0006614235,0.0002757264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001744535,"about_ca_system_score_gemma":0.001996164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001031775,"about_ca_topic_score_gemma":0.0009078766,"domain_scores_codex":[0.9962109,0.0002813271,0.0005054142,0.001120755,0.0006427673,0.001238864],"domain_scores_gemma":[0.9977798,0.0001855533,0.0002849163,0.0008659668,0.000204018,0.0006797718],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0006139359,0.0009402764,0.006503003,0.0001289366,0.0001971397,0.003564542,0.01748224,0.360496,0.005701578,0.5629902,0.007816562,0.03356551],"study_design_scores_gemma":[0.04488666,0.001090115,0.3741653,0.001659892,0.0004130127,0.004370687,0.01584893,0.2295706,0.01845169,0.08243132,0.2210784,0.006033393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6442322,0.001374055,0.3417341,0.004308095,0.0006281458,0.0004824628,0.0000438819,0.0006017857,0.006595333],"genre_scores_gemma":[0.9535444,0.001070052,0.04226781,0.001153251,0.0001940175,0.000008491282,0.0001133833,0.0000478863,0.001600746],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4805589,"threshold_uncertainty_score":0.9994659,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01064741706530499,"score_gpt":0.2000205512561657,"score_spread":0.1893731341908607,"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."}}