{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002729788,0.000640947,0.001062061,0.0006752216,0.001086859,0.002600672,0.002141101,0.00135988,0.005929928],"category_scores_gemma":[0.01639002,0.0006766275,0.001889602,0.001254827,0.00249154,0.005375482,0.00206712,0.002689962,0.0004653709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002485286,"about_ca_system_score_gemma":0.003550617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009087777,"about_ca_topic_score_gemma":0.01214626,"domain_scores_codex":[0.9974119,0.001134917,0.000135726,0.0004929809,0.0004502988,0.0003741375],"domain_scores_gemma":[0.9736922,0.02341703,0.0007733536,0.001487199,0.0003357814,0.0002943208],"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.0007529359,0.0003180593,0.005499708,0.0007899096,0.0002099021,0.0003601271,0.000642418,0.7255532,0.005024202,0.1516676,0.00615074,0.1030313],"study_design_scores_gemma":[0.00009650977,0.00005254647,0.0006740395,0.00002569546,0.00004153946,0.00006335178,0.0001555488,0.7342358,0.00212506,0.2614505,0.001062674,0.00001664914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4749523,0.0007419289,0.4949385,0.006535955,0.0001076104,0.000377483,0.001488002,0.002364367,0.01849387],"genre_scores_gemma":[0.8357627,0.0003286636,0.159358,0.0002894706,0.00007499348,0.0002051139,0.001440883,0.0002361811,0.002303832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009087777,"threshold_uncertainty_score":0.01983756,"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."}}