{"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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001639757,0.0001811818,0.0003564312,0.00175692,0.00009934555,0.0004494968,0.005825776,0.00008668114,0.00002257844],"category_scores_gemma":[0.0002299016,0.0001476866,0.0002504672,0.0006880499,0.0006396945,0.003717748,0.001666958,0.0002924051,0.000006000003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000161615,"about_ca_system_score_gemma":0.001748068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001239234,"about_ca_topic_score_gemma":0.000003392717,"domain_scores_codex":[0.9958836,0.0001053566,0.001284315,0.0003604034,0.002163585,0.0002027291],"domain_scores_gemma":[0.9896031,0.0001755666,0.002121519,0.0006333791,0.007322934,0.0001434877],"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.00005252797,0.000708935,0.001008478,0.00008779481,0.0003775682,0.00002352409,0.004171404,0.1237074,0.006989647,0.5916417,0.001197322,0.2700338],"study_design_scores_gemma":[0.001930632,0.0006827607,0.007328738,0.00194658,0.00003640288,0.0001537551,0.0000443002,0.4502169,0.01854598,0.5150799,0.003380768,0.000653282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005426769,0.00004735778,0.9846128,0.004269443,0.004748333,0.0001572175,0.00001923864,0.00002147427,0.0006974348],"genre_scores_gemma":[0.6539325,0.0001642834,0.3455962,0.00007976717,0.0001771939,0.000003607759,0.000004992393,0.000006538824,0.00003488269],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6485057,"threshold_uncertainty_score":0.9995532,"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."}}