{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001486256,0.0006397326,0.001125907,0.002201197,0.002903864,0.003867415,0.001907473,0.001625793,0.00598953],"category_scores_gemma":[0.009884391,0.0006323653,0.001003907,0.003162596,0.004234317,0.008399702,0.002552009,0.003185886,0.0004668447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001115931,"about_ca_system_score_gemma":0.0006833301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001868449,"about_ca_topic_score_gemma":0.001493926,"domain_scores_codex":[0.9988617,0.0003499434,0.00005980194,0.0002924438,0.0002624304,0.000173801],"domain_scores_gemma":[0.9907429,0.005781349,0.0008912578,0.0006204768,0.0009218656,0.001042295],"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.0000510855,0.0000312163,0.0006139238,0.00003036173,0.00001115346,0.00006634874,0.0003390498,0.001440969,0.0008353163,0.9918544,0.0008865954,0.003839561],"study_design_scores_gemma":[0.00001264165,0.0000175906,0.0003505223,0.000008024613,0.000009108935,0.00008077874,0.0001002958,0.005507927,0.0001791413,0.9928057,0.0009190518,0.000009207427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7486934,0.001066837,0.1712262,0.003020411,0.0002552562,0.00005550428,0.0004904799,0.0002614195,0.07493044],"genre_scores_gemma":[0.974571,0.0006876815,0.01469078,0.0004856542,0.0005321347,0.00009426488,0.0004674669,0.00009937166,0.008371725],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00598953,"threshold_uncertainty_score":0.02003694,"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."}}