{"id":"W7511636","doi":"","title":"Algorithms For The Optimal Hamiltonian Path In Halin Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian path; Hamiltonian path problem; Path (computing); Combinatorics; Discrete mathematics; Graph; Computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000226832,0.0001184411,0.0001171152,0.00001930842,0.0001659531,0.00001208439,0.0002502071,0.0001235645,0.000003375299],"category_scores_gemma":[0.0000818802,0.00007933916,0.000100512,0.0001030935,0.00009940518,0.000001950894,0.00009911406,0.00009526093,0.000003458289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000803152,"about_ca_system_score_gemma":0.00003093399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002393306,"about_ca_topic_score_gemma":0.000005836463,"domain_scores_codex":[0.9992019,0.00004115444,0.0001626197,0.0002603713,0.00007315487,0.0002608123],"domain_scores_gemma":[0.9995962,0.00005349665,0.00004431223,0.0002174043,0.00004563125,0.00004297063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.001163818,0.002213401,0.262295,0.00009337838,0.0005425083,0.0002317236,0.001124282,0.001294823,0.4148709,0.2098578,0.0416569,0.06465538],"study_design_scores_gemma":[0.0149046,0.006445397,0.3914565,0.0001003403,0.00009328708,0.0002718446,0.0006038283,0.01509487,0.1873869,0.1145842,0.2663992,0.002658998],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9977255,0.0007242995,0.0003023748,0.0001864346,0.0005445128,0.0002315391,0.000006639852,0.00001368733,0.0002649816],"genre_scores_gemma":[0.9982858,0.0001424599,0.001038625,0.0002662914,0.00003223869,0.00003545827,0.00003501097,0.00001076464,0.0001533873],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2274841,"threshold_uncertainty_score":0.3235357,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02096053234701034,"score_gpt":0.2545780518503076,"score_spread":0.2336175195032972,"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."}}