{"id":"W2975132448","doi":"10.1109/cig.2019.8848065","title":"Taksim: A Constrained Graph Partitioning Framework for Procedural Content Generation","year":2019,"lang":"en","type":"article","venue":"2019 IEEE Conference on Games (CoG)","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Answer set programming; Graph; Theoretical computer science; Key (lock); Logic programming; Operating system","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":[],"consensus_categories":[],"category_scores_codex":[0.0002839356,0.0002316204,0.0002886195,0.0001221936,0.0001384357,0.0003476728,0.0004089911,0.0001585718,0.00009858082],"category_scores_gemma":[0.00009027487,0.0002054589,0.0001228817,0.0001715227,0.00003671262,0.0004945124,0.00002996716,0.0001593436,0.0003023136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003734373,"about_ca_system_score_gemma":0.0001549379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003522331,"about_ca_topic_score_gemma":0.00002247024,"domain_scores_codex":[0.9982523,0.00007405038,0.0003988939,0.0005885062,0.0003115478,0.0003746952],"domain_scores_gemma":[0.9986322,0.0001299948,0.0002957261,0.0004976989,0.0003288759,0.0001154855],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004782112,0.0001397288,0.001360262,0.0001158086,0.00007950352,0.000002149505,0.001285015,0.000573285,0.06308617,0.9176621,0.005962618,0.009685512],"study_design_scores_gemma":[0.003228579,0.001222653,0.006742813,0.0009738432,0.00005610433,0.00001930172,0.0003562517,0.9275465,0.03890425,0.01703396,0.002724571,0.00119117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1307786,0.00006368254,0.8626809,0.001480702,0.002271019,0.001753397,0.00002781714,0.0001845713,0.0007592811],"genre_scores_gemma":[0.9826712,0.00001629054,0.01466547,0.000823322,0.0002593086,0.0002523138,0.00003839305,0.00001569103,0.001258034],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9269732,"threshold_uncertainty_score":0.8378371,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1081753279986317,"score_gpt":0.294793417072607,"score_spread":0.1866180890739753,"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."}}