{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003463396,0.0004915876,0.0005271032,0.001984472,0.001137029,0.002377321,0.000858773,0.0008870351,0.02144401],"category_scores_gemma":[0.003130893,0.000548789,0.0005646002,0.001635084,0.0009592967,0.003046973,0.001469253,0.001478622,0.001677149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007356338,"about_ca_system_score_gemma":0.0004024821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009869077,"about_ca_topic_score_gemma":0.001441791,"domain_scores_codex":[0.9996548,0.000090298,0.00001807555,0.00007646635,0.00009812483,0.00006230268],"domain_scores_gemma":[0.9987605,0.0005729351,0.0001383317,0.0001278858,0.000210732,0.0001895903],"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.0001115241,0.00008687832,0.0003553706,0.0001410517,0.00001590124,0.0001162097,0.0002721167,0.006480421,0.001286505,0.9592695,0.007151697,0.02471288],"study_design_scores_gemma":[0.00002902886,0.00001231674,0.0001415744,0.00002069714,0.000009737343,0.00008159737,0.00008381017,0.0175914,0.000655468,0.9766311,0.004735414,0.000007729858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5613539,0.0008071638,0.2854234,0.002232491,0.000357623,0.0003059972,0.003245695,0.0008499769,0.1454238],"genre_scores_gemma":[0.8868744,0.0005480116,0.06238902,0.000515504,0.0002113422,0.0002265198,0.002460268,0.0006043704,0.0461706],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02144401,"threshold_uncertainty_score":0.07173741,"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."}}