{"id":"W2120741525","doi":"10.1007/s10586-006-9746-3","title":"Finding Hamiltonian paths in tournaments on clusters","year":2006,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Scalability; Tournament; Computation; Parallel computing; Computer cluster; Cluster (spacecraft); Parallel algorithm; Graph; Running time; Hamiltonian (control theory); Reuse; Theoretical computer science; Algorithm; Distributed computing; Combinatorics; Mathematical optimization; Mathematics; Operating system","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":[],"consensus_categories":[],"category_scores_codex":[0.0004827198,0.0002165763,0.000226202,0.0003643123,0.000270055,0.0003009498,0.0009392403,0.00007142472,0.000005874138],"category_scores_gemma":[0.00002148621,0.000222515,0.0001005053,0.0006265608,0.0000451082,0.0002698102,0.0006223468,0.0003373004,0.00005024352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001529415,"about_ca_system_score_gemma":0.00002871909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001069317,"about_ca_topic_score_gemma":0.00006640604,"domain_scores_codex":[0.9980162,0.0001190514,0.0004322919,0.0005336164,0.0003337744,0.0005651045],"domain_scores_gemma":[0.9990521,0.0002250489,0.0001365498,0.0004856824,0.00002966216,0.0000709626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005502335,0.00122355,0.07472108,0.0001463969,0.00005899657,0.0007670443,0.007519961,0.1820506,0.0004554856,0.09881777,0.007958728,0.6262254],"study_design_scores_gemma":[0.001092514,0.00008756661,0.05068948,0.0002659146,0.000002329531,0.00003551624,0.00005451193,0.9369143,0.0001663839,0.008760185,0.001549109,0.0003821903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4964337,0.00006255676,0.4894731,0.001110245,0.00146117,0.0002610795,0.000001467531,0.0002586031,0.01093807],"genre_scores_gemma":[0.9535709,0.000001081676,0.04491569,0.001101981,0.0002272533,0.00000293385,0.000002913316,0.00001387066,0.0001633575],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7548637,"threshold_uncertainty_score":0.9073898,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01880286002196621,"score_gpt":0.253541145276148,"score_spread":0.2347382852541817,"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."}}