{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001704199,0.001175477,0.0005480583,0.001469819,0.001065492,0.002236001,0.002723289,0.00135024,0.01330143],"category_scores_gemma":[0.004209903,0.0007649565,0.002083413,0.0009760491,0.001711263,0.002650783,0.003493236,0.00248607,0.002528039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001268715,"about_ca_system_score_gemma":0.001538828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003312369,"about_ca_topic_score_gemma":0.007863433,"domain_scores_codex":[0.9986567,0.0004594665,0.00009827688,0.0002033024,0.0004742375,0.0001078358],"domain_scores_gemma":[0.9987888,0.000609068,0.00007384958,0.0002556699,0.0001791366,0.0000935218],"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.0001233528,0.0001782314,0.0004624637,0.0005606708,0.00007661631,0.0004454212,0.001037294,0.1817723,0.01124772,0.6295427,0.01707313,0.1574801],"study_design_scores_gemma":[0.00005665154,0.00005903871,0.00009383805,0.0001027014,0.00003283816,0.0002003869,0.0001536739,0.5801238,0.008686409,0.3442953,0.06615692,0.00003834932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008372994,0.00003014374,0.9945327,0.00008800186,0.00001923556,0.0001277536,0.0001627226,0.001381597,0.002820532],"genre_scores_gemma":[0.03566704,0.0001068121,0.9589869,0.00009510502,0.00001621392,0.0004904585,0.0007985956,0.0009255359,0.002913421],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01330143,"threshold_uncertainty_score":0.04449773,"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."}}