{"id":"W2113016580","doi":"10.1112/s1461157014000400","title":"Computing symmetry groups of polyhedra","year":2014,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"Ministry of Education, India; Hausdorff Research Institute for Mathematics; Mathematisches Forschungsinstitut Oberwolfach; University of Cambridge; Alexander von Humboldt-Stiftung","keywords":"Polyhedron; Mathematics; Integer points in convex polyhedra; Symmetry group; Computation; Symmetry (geometry); Automorphism group; Homogeneous space; Linear programming; Polyhedral combinatorics; Group (periodic table); Integer programming; Combinatorics; Tetrahedral symmetry; Discrete mathematics; Automorphism; Algorithm; Regular polygon; Rotational symmetry; Geometry; Branch and price; Convex set","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.0006149738,0.000529559,0.0006875743,0.001134268,0.0008320688,0.001843863,0.0008187142,0.0005979323,0.006414391],"category_scores_gemma":[0.003337304,0.0002879177,0.001153546,0.000953177,0.001624812,0.003124828,0.001654138,0.001338469,0.0009634564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008195439,"about_ca_system_score_gemma":0.0006823461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001850503,"about_ca_topic_score_gemma":0.001657156,"domain_scores_codex":[0.9990349,0.0002431321,0.00005953357,0.0001841469,0.0003198237,0.0001584942],"domain_scores_gemma":[0.9980241,0.0007851549,0.0001736935,0.0006122722,0.0002892075,0.0001155371],"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.0008242488,0.000263103,0.006940408,0.0003980005,0.0001161596,0.0004842774,0.001295324,0.1369653,0.02304253,0.6391896,0.006567021,0.1839141],"study_design_scores_gemma":[0.00007497338,0.0001546164,0.0006434687,0.00003262575,0.00002142606,0.0001144858,0.0003624028,0.207738,0.01251289,0.771566,0.006752362,0.00002672511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4409822,0.0002262255,0.5388727,0.0005201263,0.0001422363,0.0002126317,0.0006317119,0.001222188,0.01719003],"genre_scores_gemma":[0.8471531,0.0001201061,0.1476526,0.00007834002,0.00006886444,0.00007607355,0.001068912,0.0002378881,0.003544231],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006414391,"threshold_uncertainty_score":0.02145827,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01821865012316153,"score_gpt":0.3046875970628987,"score_spread":0.2864689469397371,"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."}}