{"id":"W2514085586","doi":"10.37236/6958","title":"Simplicial Complexes are Game Complexes","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universität Darmstadt; Killam Trusts","keywords":"Simplicial complex; Mathematics; Flag (linear algebra); Abstract simplicial complex; Invariant (physics); Combinatorics; Simplicial approximation theorem; Class (philosophy); Combinatorial game theory; Simplicial homology; h-vector; Pure mathematics; Sequential game; Game theory; Computer science; Simplicial set; Algebra over a field; Mathematical economics; Artificial intelligence; Homotopy","routes":{"ca_aff":true,"ca_fund":true,"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","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001907903,0.0005141272,0.001041874,0.0003000495,0.0002104951,0.0005014613,0.007323454,0.000305227,0.00002014862],"category_scores_gemma":[0.0002547209,0.0003780209,0.0005577424,0.0005346208,0.0002281969,0.0003523041,0.002073032,0.003685586,0.00009596937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008330546,"about_ca_system_score_gemma":0.001748687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004574129,"about_ca_topic_score_gemma":0.00002761132,"domain_scores_codex":[0.9954225,0.0004573524,0.0012694,0.0004524096,0.001259629,0.001138701],"domain_scores_gemma":[0.9939898,0.0007717562,0.002559838,0.001570537,0.0009622832,0.0001457404],"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.00003976497,0.0002023053,0.0004711766,0.00005328378,0.0002374485,0.00002251722,0.0009867131,0.008539226,0.0002467998,0.9838799,0.003466062,0.00185476],"study_design_scores_gemma":[0.0002081073,0.0004591685,0.0005602838,0.0001694976,0.00007611103,0.0001909637,0.000172754,0.01030598,0.003338323,0.9735239,0.01056652,0.0004283822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1755969,0.01016207,0.7984273,0.006753712,0.007266649,0.0006840233,0.000009055231,0.0001451418,0.000955139],"genre_scores_gemma":[0.9976364,0.0009914715,0.0001484427,0.0003481769,0.0005689632,0.00000618273,0.000001955178,0.00004494232,0.0002534629],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8220395,"threshold_uncertainty_score":0.9998672,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0278143150206662,"score_gpt":0.2876050605225206,"score_spread":0.2597907455018544,"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."}}