{"id":"W2605053740","doi":"","title":"The minimum labeling Hamiltonian cycle problem","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Hamiltonian path; Computer science; Hamiltonian (control theory); Hamiltonian path problem; Mathematical optimization; Mathematics; Theoretical computer science; Graph","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.0006153414,0.000643931,0.001529949,0.001027872,0.001547199,0.003350198,0.001553796,0.002146191,0.01264882],"category_scores_gemma":[0.00491032,0.0005915183,0.0006961796,0.002259509,0.001329971,0.004095957,0.001481603,0.002706882,0.0009980848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001929802,"about_ca_system_score_gemma":0.001185473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001562065,"about_ca_topic_score_gemma":0.001626444,"domain_scores_codex":[0.9993925,0.0001770247,0.00002133303,0.000221272,0.00009362207,0.00009416982],"domain_scores_gemma":[0.9964179,0.002357711,0.0002680632,0.0003197956,0.0002520859,0.0003844235],"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.0002715049,0.000160752,0.000957196,0.0007381008,0.00004718813,0.0001071499,0.000275786,0.02871722,0.00373181,0.8507875,0.0441361,0.0700698],"study_design_scores_gemma":[0.00006678852,0.00002201832,0.000433833,0.00005382559,0.00002148534,0.00009105422,0.00009962323,0.03782745,0.0008806559,0.9499111,0.01057708,0.00001512808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3869891,0.007013869,0.4084616,0.02155931,0.0009903065,0.0003530639,0.005690414,0.0009754964,0.1679668],"genre_scores_gemma":[0.8026227,0.00441269,0.1475476,0.002103122,0.001208474,0.0004419795,0.006107033,0.0006382868,0.03491813],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01264882,"threshold_uncertainty_score":0.04231453,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01459410182155064,"score_gpt":0.2132189414638392,"score_spread":0.1986248396422886,"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."}}