{"id":"W2025257509","doi":"10.1016/s0166-218x(01)00197-4","title":"Antidirected hamiltonian paths between specified vertices of a tournament","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Tournament; Mathematics; Vertex (graph theory); Hamiltonian path; Combinatorics; Hamiltonian path problem; Hamiltonian (control theory); Neighbourhood (mathematics); Discrete mathematics; Graph; Mathematical optimization; Mathematical analysis","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.0004410721,0.0003248871,0.0003730383,0.0007627542,0.001900276,0.002256993,0.001146484,0.001074221,0.008424533],"category_scores_gemma":[0.001768714,0.0003761567,0.000407403,0.0007417123,0.0008781019,0.001048835,0.001105823,0.0008344905,0.0006440596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005512071,"about_ca_system_score_gemma":0.0005111285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009253407,"about_ca_topic_score_gemma":0.001764073,"domain_scores_codex":[0.9995115,0.0001265304,0.00002923084,0.0000990987,0.0001017564,0.0001319899],"domain_scores_gemma":[0.9985101,0.0005069425,0.0001988165,0.0001513483,0.0002014719,0.0004313482],"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.000778163,0.000332348,0.006353556,0.0001960378,0.0001118579,0.001321642,0.0009431666,0.02044849,0.02912845,0.8992944,0.003679862,0.03741219],"study_design_scores_gemma":[0.0002429963,0.0003740821,0.003270871,0.00005886313,0.0001041902,0.000724539,0.0008228935,0.1094939,0.0118199,0.8587651,0.01425526,0.00006748054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8448194,0.00009334402,0.1201559,0.0003009175,0.0001504844,0.0001210391,0.0003848952,0.0002048576,0.03376923],"genre_scores_gemma":[0.9459179,0.0000754293,0.04352745,0.00009961874,0.00001730426,0.00009136395,0.0003358037,0.00006010177,0.009874994],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008424533,"threshold_uncertainty_score":0.0281828,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04023299807498762,"score_gpt":0.2759715821944236,"score_spread":0.235738584119436,"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."}}