{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002102118,0.0006093667,0.0009913832,0.0001745753,0.0002303894,0.0001875823,0.001418804,0.0004685265,0.0004390918],"category_scores_gemma":[0.001198355,0.000384834,0.0003294394,0.0001594229,0.0004111184,0.00009843955,0.0008665699,0.001005481,0.00000662913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001250897,"about_ca_system_score_gemma":0.00009605356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000170183,"about_ca_topic_score_gemma":0.00007866527,"domain_scores_codex":[0.9965701,0.0003886209,0.001191345,0.000565451,0.0007898508,0.0004946106],"domain_scores_gemma":[0.9946589,0.001569616,0.001007441,0.002461126,0.0001617756,0.000141157],"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.0002977708,0.001355045,0.0001552667,0.002703146,0.0004554055,0.00006910361,0.08568115,0.0001718692,0.0004651691,0.9066694,0.00167479,0.0003018553],"study_design_scores_gemma":[0.0003787757,0.0003782083,0.0002155112,0.001261564,0.0001413051,0.00001040114,0.002977615,0.004143596,0.0009264466,0.9890227,0.00006911359,0.0004747372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9922072,0.00004314923,0.0003499783,0.0001847053,0.0006347355,0.001200075,0.000162858,0.00007111479,0.005146225],"genre_scores_gemma":[0.9823587,0.00002915679,0.01672865,0.0001833932,0.000263347,0.00009613016,0.00002255181,0.0001292564,0.0001887981],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08270353,"threshold_uncertainty_score":0.9998603,"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."}}