{"id":"W2407021550","doi":"10.1137/15m1009767","title":"Algorithms for Group Isomorphism via Group Extensions and Cohomology","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Group (periodic table); Mathematics; Abelian group; Isomorphism (crystallography); Group isomorphism; Extension (predicate logic); Divide and conquer algorithms; Cohomology; Equivalence (formal languages); Quotient group; Combinatorics; Group cohomology; Normal subgroup; Time complexity; Discrete mathematics; Algebra over a field; Cyclic group; Computer science; Pure mathematics; Algorithm","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002936208,0.0002217674,0.0004342716,0.0001792256,0.002263318,0.0003336209,0.0005652076,0.0001429939,0.0000404295],"category_scores_gemma":[0.001790026,0.000189445,0.0001477103,0.00004913368,0.0002683221,0.0001658702,0.0003440702,0.0007772655,0.00002231919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006831233,"about_ca_system_score_gemma":0.00002729127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006201335,"about_ca_topic_score_gemma":0.000004926876,"domain_scores_codex":[0.9980441,0.0002266887,0.0004696185,0.0003211072,0.0003331388,0.0006053671],"domain_scores_gemma":[0.9960416,0.002448652,0.0005288275,0.0005310113,0.0001972698,0.0002526219],"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.0006787009,0.0009648869,0.003169113,0.0003547237,0.0004884604,0.00124312,0.001628098,0.00003890232,0.01063325,0.6329054,0.008170182,0.3397251],"study_design_scores_gemma":[0.004197549,0.001869658,0.01069351,0.0004920663,0.00008210252,0.00457511,0.0002129328,0.07244861,0.0001907067,0.9005853,0.004094675,0.0005577579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6266448,0.0002282152,0.3672752,0.001937756,0.001550019,0.0006355715,0.0000120596,0.00009178751,0.00162457],"genre_scores_gemma":[0.9199875,0.00002972379,0.07834595,0.0002579062,0.001094076,0.000005668425,0.000002781281,0.0000643697,0.0002120251],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3391674,"threshold_uncertainty_score":0.9990356,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1373638796531967,"score_gpt":0.4026025739951591,"score_spread":0.2652386943419625,"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."}}