{"id":"W3135927772","doi":"10.1613/jair.1.12283","title":"Computational Complexity of Computing Symmetries in Finite-Domain Planning","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Vetenskapsrådet; Israel Academy of Sciences and Humanities","keywords":"Graph automorphism; Graph isomorphism; Automorphism; Time complexity; Homogeneous space; Mathematics; Isomorphism (crystallography); PSPACE; Discrete mathematics; Pruning; Graph; Automorphism group; Computational complexity theory; Combinatorics; Theoretical computer science; Computer science; Algorithm; Voltage graph; Line graph","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.006568556,0.0001118047,0.0003587757,0.0008619165,0.0002272881,0.0002107213,0.0008547265,0.00007852506,0.00003048789],"category_scores_gemma":[0.002261582,0.0001091651,0.0001085494,0.002326789,0.0003318556,0.0003525107,0.0003138497,0.0009618261,0.0000124252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001033804,"about_ca_system_score_gemma":0.0008233588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005415505,"about_ca_topic_score_gemma":0.00001631756,"domain_scores_codex":[0.996243,0.0007742003,0.00110493,0.0002393049,0.001185332,0.0004532549],"domain_scores_gemma":[0.9932536,0.004026923,0.0003631227,0.000226007,0.001998439,0.0001318971],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001084915,0.0003844688,0.01044986,0.0001166894,0.000050854,0.0009576468,0.01248789,0.6946983,0.002107501,0.2214264,0.0003072971,0.05690458],"study_design_scores_gemma":[0.00008976316,0.000336707,0.002303169,0.0007260945,0.000002639182,0.0001287615,0.004559953,0.6043928,0.02706358,0.3601136,0.0001239157,0.0001590833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1880637,0.0005578258,0.8091534,0.001584597,0.0002033491,0.00005763215,0.000002628699,0.0000100437,0.0003668091],"genre_scores_gemma":[0.8430505,0.00001078408,0.1567799,0.00004364775,0.0000978737,4.138801e-7,0.000002095979,0.000005947127,0.000008774326],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6549869,"threshold_uncertainty_score":0.4451623,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2931864096118457,"score_gpt":0.4398397417830984,"score_spread":0.1466533321712526,"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."}}