{"id":"W3155570673","doi":"10.1145/3508069","title":"QCSP on Reflexive Tournaments","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja; European Commission","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Tournament; Constraint satisfaction problem; Reflexivity; Discrete mathematics; 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.001728993,0.0008543688,0.000961851,0.0008406655,0.001484464,0.00365957,0.002140592,0.001295028,0.01041836],"category_scores_gemma":[0.007821896,0.0004962601,0.001996429,0.002057336,0.002054358,0.00551411,0.003082786,0.003812733,0.0006129596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002027474,"about_ca_system_score_gemma":0.001364063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004480776,"about_ca_topic_score_gemma":0.003380318,"domain_scores_codex":[0.9970582,0.0006990492,0.0001987767,0.0007715851,0.0007135291,0.0005589531],"domain_scores_gemma":[0.9924241,0.004825916,0.0006858542,0.0008499904,0.0006486246,0.0005654208],"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.0005023986,0.0003057116,0.00187191,0.0005046532,0.0001801625,0.000472902,0.0006006045,0.08782452,0.007209492,0.8459517,0.008412216,0.04616387],"study_design_scores_gemma":[0.0001331335,0.0000975019,0.0006261017,0.00004031946,0.00005718273,0.0001728796,0.0001262274,0.2443513,0.00237257,0.7464319,0.005554535,0.00003629598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3262964,0.0006706819,0.625586,0.004856088,0.0002249532,0.0004271338,0.002722007,0.001154555,0.03806204],"genre_scores_gemma":[0.8432865,0.0005297317,0.1404841,0.001135258,0.0002748501,0.0004242644,0.002827289,0.0002594524,0.01077854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01041836,"threshold_uncertainty_score":0.03485286,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05988162739378244,"score_gpt":0.3470112406369147,"score_spread":0.2871296132431323,"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."}}