{"id":"W2920555783","doi":"","title":"On the Complexity of Orthogonal Colouring Games and the NP-Completeness of Recognising Graphs Admitting a Strictly Matched Involution","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Involution (esoterism); Mathematics; Combinatorics; Completeness (order theory); Discrete mathematics; Psychology","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.004375937,0.00217433,0.003033054,0.001633653,0.002512021,0.008446681,0.004886465,0.003957995,0.007384876],"category_scores_gemma":[0.02995751,0.001417886,0.003618992,0.002643088,0.006103723,0.01354384,0.004600497,0.006849961,0.0007430929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005369335,"about_ca_system_score_gemma":0.003465534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009054434,"about_ca_topic_score_gemma":0.006752619,"domain_scores_codex":[0.9924968,0.002485668,0.0004054494,0.001884034,0.001181338,0.00154664],"domain_scores_gemma":[0.9258839,0.0658422,0.002656199,0.002792842,0.001190666,0.001634257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003189856,0.001229325,0.009870128,0.001802857,0.0006845535,0.001299005,0.002739052,0.5363019,0.00907383,0.3718241,0.01515409,0.04683135],"study_design_scores_gemma":[0.0003077979,0.0001468929,0.00113125,0.0000663928,0.000131365,0.0002881105,0.0003237093,0.3370571,0.001668508,0.6571915,0.001620771,0.00006668699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6781074,0.001885187,0.2737376,0.01200056,0.0002334675,0.0005042845,0.003366788,0.001383612,0.02878109],"genre_scores_gemma":[0.9146784,0.001176612,0.07063036,0.001110032,0.0004472927,0.0005497519,0.003008506,0.0004681953,0.007930782],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009054434,"threshold_uncertainty_score":0.03895742,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04372877556751693,"score_gpt":0.2635209263663286,"score_spread":0.2197921507988117,"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."}}