{"id":"W2274293958","doi":"10.1142/s0129054116500313","title":"Exploration of Faulty Hamiltonian Graphs","year":2016,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Computer science; Node (physics); Overhead (engineering); Competitive analysis; Situated; Hamiltonian path; Algorithm; Mathematics; Theoretical computer science; Graph; Engineering; Upper and lower bounds; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.0006260868,0.0004304613,0.0005461143,0.0005127337,0.000526532,0.0007038909,0.0009326915,0.0007390283,0.002435974],"category_scores_gemma":[0.005525019,0.0003793307,0.0004913955,0.0006778916,0.00104947,0.002014994,0.001312407,0.0005268194,0.0001771533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007179429,"about_ca_system_score_gemma":0.0004476268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001611583,"about_ca_topic_score_gemma":0.001362637,"domain_scores_codex":[0.9994889,0.0002029169,0.00001930356,0.0000929528,0.00009514849,0.0001006081],"domain_scores_gemma":[0.9968821,0.002112306,0.0003634378,0.0003265394,0.0001433282,0.0001723503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002387661,0.00004087125,0.00181343,0.0001613983,0.00006243442,0.0004886827,0.0002367151,0.923983,0.004041276,0.04765027,0.001055705,0.02022752],"study_design_scores_gemma":[0.00003056397,0.00004414739,0.0003437362,0.00001157793,0.00001566724,0.0001448538,0.0001116462,0.8900798,0.001656708,0.1061261,0.001425834,0.000009317245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5581217,0.0008135163,0.4323097,0.0007823604,0.00004781887,0.00007620206,0.0003598969,0.0004046715,0.007084044],"genre_scores_gemma":[0.9274676,0.0004556145,0.06876537,0.00008146301,0.00002190545,0.00006025783,0.0002753307,0.00007525917,0.002797235],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002435974,"threshold_uncertainty_score":0.008149147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05308547114641386,"score_gpt":0.3491501009345286,"score_spread":0.2960646297881147,"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."}}