{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008663789,0.0004324018,0.0003710296,0.0001880753,0.001189086,0.001296975,0.004488283,0.0003294234,0.00002170799],"category_scores_gemma":[0.0007212921,0.0003586534,0.0002722575,0.0005596352,0.0003567502,0.0002229299,0.004107356,0.0009559287,0.0001302554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000677568,"about_ca_system_score_gemma":0.0004071157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001264713,"about_ca_topic_score_gemma":0.001017106,"domain_scores_codex":[0.9929969,0.003808789,0.000760971,0.001181095,0.0005977161,0.0006545488],"domain_scores_gemma":[0.9909765,0.001346395,0.0006731799,0.004499569,0.002234664,0.0002697675],"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.00000488864,0.0003257747,0.0002423638,0.00008901639,0.0000881009,0.000006270138,0.009996727,0.000148767,0.001649961,0.9247106,0.002143129,0.06059438],"study_design_scores_gemma":[0.0008812177,0.000001388333,0.0006731329,0.002921533,0.00006761993,0.00002957456,0.0001088608,0.1100357,0.03563371,0.8181798,0.03017954,0.001287829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06973621,0.0125308,0.6067761,0.06033817,0.002552575,0.002050752,0.000043153,0.002726478,0.2432458],"genre_scores_gemma":[0.5705806,0.001439372,0.4145609,0.000375564,0.00001687641,0.0001950951,0.00007842543,0.00008170708,0.01267143],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5008444,"threshold_uncertainty_score":0.9998866,"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."}}