{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003598682,0.0002175034,0.000424692,0.0001743904,0.0001101297,0.00008838988,0.001199776,0.00007147701,0.00009188933],"category_scores_gemma":[0.00007638507,0.0001849215,0.0001008464,0.0006566057,0.000139308,0.0002035816,0.0003605799,0.0001969612,0.0000921113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003734233,"about_ca_system_score_gemma":0.00001472763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001629109,"about_ca_topic_score_gemma":0.000001087461,"domain_scores_codex":[0.9979873,0.00003577035,0.0005343572,0.0003577219,0.0006374262,0.0004473774],"domain_scores_gemma":[0.9980765,0.000326716,0.000347527,0.001018909,0.00007673424,0.0001535857],"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.00001526225,0.0003746384,0.0003370179,0.0003900998,0.0001790642,0.00002215316,0.008928465,0.00005634932,0.03503125,0.9212366,0.0004477368,0.03298137],"study_design_scores_gemma":[0.003183343,0.0004901816,0.004858335,0.0004870384,0.0001596185,0.00002608818,0.001635342,0.102904,0.252071,0.6291689,0.003161483,0.001854687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2046846,0.0002546621,0.7379644,0.0003295528,0.00008730955,0.0008533983,0.00002225713,0.0003282164,0.05547564],"genre_scores_gemma":[0.7927476,0.00005618944,0.2069094,0.00002416959,0.00003662922,0.0000300864,0.000002594521,0.00002406046,0.0001693747],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5880629,"threshold_uncertainty_score":0.754088,"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."}}