{"id":"W2151612990","doi":"10.1016/j.disc.2005.12.030","title":"On an adjacency property of almost all tournaments","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Combinatorics; Mathematics; Vertex (graph theory); Adjacency list; Discrete mathematics; Property (philosophy); Integer (computer science); Graph; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.0003815523,0.0002673013,0.0004159002,0.00009507323,0.0001288365,0.00003158886,0.0003631948,0.0001143417,0.0002313539],"category_scores_gemma":[0.0001909968,0.00015368,0.0001572748,0.0001191111,0.0001214589,0.0001186248,0.0001016417,0.000168214,0.00001142748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003016792,"about_ca_system_score_gemma":0.00001698118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003572394,"about_ca_topic_score_gemma":0.0000150164,"domain_scores_codex":[0.9982706,0.00007509252,0.0006247788,0.0002393729,0.0004802788,0.0003098936],"domain_scores_gemma":[0.9985035,0.0002116388,0.0003475761,0.0007705319,0.00008443883,0.00008232316],"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.00003051868,0.0005365348,0.0002518679,0.000372067,0.00006467932,0.000008745508,0.002592772,0.00001956993,0.0007765375,0.9918061,0.00306415,0.0004764922],"study_design_scores_gemma":[0.0004039289,0.0002127057,0.0002621934,0.0001696093,0.00008063584,0.00001282402,0.0001687184,0.0007677099,0.003306471,0.9936214,0.0007356331,0.000258155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9407735,0.00003109353,0.002355626,0.00006687494,0.0001732468,0.0004526541,0.00004715149,0.00009817391,0.05600167],"genre_scores_gemma":[0.9596329,0.00001081145,0.03776312,0.00008670489,0.00009735538,0.00001649659,0.00001963157,0.00006782819,0.002305179],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05369649,"threshold_uncertainty_score":0.626689,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03215702963553921,"score_gpt":0.3041861461422333,"score_spread":0.2720291165066941,"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."}}