{"id":"W3193864805","doi":"10.4230/lipics.esa.2021.58","title":"QCSP on Reflexive Tournaments","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Tournament; Mathematics; Constraint satisfaction problem; Graph; Statistics","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.001894306,0.0009815819,0.00117565,0.0008250272,0.001259405,0.003712475,0.002010888,0.001223714,0.008842974],"category_scores_gemma":[0.008922559,0.000515152,0.001815816,0.002176847,0.00188896,0.004624311,0.002862545,0.003763936,0.0005709766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002022308,"about_ca_system_score_gemma":0.001378805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004730935,"about_ca_topic_score_gemma":0.003186822,"domain_scores_codex":[0.9966371,0.0008611152,0.0002277664,0.0008974841,0.0007736486,0.000602878],"domain_scores_gemma":[0.9903219,0.006548378,0.0007920916,0.000951199,0.0008000722,0.0005864203],"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.0005657702,0.0004460488,0.002068418,0.000908436,0.0002829633,0.0007974526,0.0008676272,0.2180283,0.008683528,0.6874644,0.01259745,0.06728968],"study_design_scores_gemma":[0.0001407128,0.00009977438,0.0005051187,0.00004912395,0.0000622501,0.0001959565,0.0001175439,0.3797886,0.001783809,0.6113074,0.005911964,0.00003764475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1818305,0.001001281,0.7858038,0.003852104,0.0002519978,0.00039962,0.002331703,0.00104668,0.02348246],"genre_scores_gemma":[0.7698987,0.0009005349,0.2123225,0.001251184,0.000425164,0.0005515916,0.003610929,0.0002907897,0.01074865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008842974,"threshold_uncertainty_score":0.02958268,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03019630424719371,"score_gpt":0.3282804791982487,"score_spread":0.298084174951055,"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."}}