{"id":"W2751759068","doi":"10.1016/j.disc.2018.09.013","title":"A lower bound on the size of an absorbing set in an arc-coloured tournament","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Tournament; Combinatorics; Vertex (graph theory); Monochromatic color; Mathematics; Integer (computer science); Upper and lower bounds; Arc (geometry); Path (computing); Discrete mathematics; Physics; Graph; Computer science; Geometry; Optics; 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.00449636,0.001837199,0.00291516,0.002234141,0.00280257,0.008961728,0.007003441,0.004453407,0.0144999],"category_scores_gemma":[0.03539922,0.001849333,0.002704667,0.002106732,0.00495669,0.0105526,0.005294798,0.006203594,0.00115822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002442762,"about_ca_system_score_gemma":0.001512392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009027545,"about_ca_topic_score_gemma":0.0009482123,"domain_scores_codex":[0.9957619,0.001104134,0.0002434177,0.001079014,0.0009679151,0.0008435537],"domain_scores_gemma":[0.9269524,0.05902693,0.002391508,0.004339277,0.001994141,0.00529578],"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.002619888,0.0007166672,0.007032234,0.001057748,0.0005061284,0.0008912131,0.001209304,0.09547589,0.03653705,0.8044114,0.01545869,0.03408368],"study_design_scores_gemma":[0.0002067397,0.0002693327,0.001470561,0.0001135602,0.0002538727,0.0005715957,0.0001910449,0.2917656,0.005324294,0.696388,0.003364615,0.0000808456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5094823,0.002329818,0.4102736,0.006627424,0.0008222532,0.0002361997,0.00186545,0.001582836,0.06678003],"genre_scores_gemma":[0.9258819,0.0008754054,0.06053301,0.0008505456,0.0006564752,0.0003166275,0.001146949,0.0005144594,0.009224726],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0144999,"threshold_uncertainty_score":0.04850703,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05452929737514468,"score_gpt":0.3354209737109293,"score_spread":0.2808916763357847,"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."}}