{"id":"W3188681872","doi":"10.37236/10655","title":"On Automorphisms of the Double Cover of a Circulant Graph","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Circulant matrix; Automorphism; Combinatorics; Circulant graph; Mathematics; Modulo; Prime (order theory); Graph; Cover (algebra); Order (exchange); Discrete mathematics; Line graph; Voltage 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":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004720606,0.0003270206,0.001031064,0.0002561995,0.0001028826,0.00004422502,0.002367439,0.0002901538,0.00009242802],"category_scores_gemma":[0.0007853516,0.0001893048,0.000877255,0.0007116593,0.0003017097,0.00005322117,0.0007891142,0.003800618,0.00000260373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005784736,"about_ca_system_score_gemma":0.002539261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001804795,"about_ca_topic_score_gemma":0.000004717205,"domain_scores_codex":[0.9953502,0.000816739,0.001187344,0.0002094455,0.001809424,0.0006268919],"domain_scores_gemma":[0.9932979,0.001749136,0.002363977,0.001464738,0.001050726,0.00007356702],"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.0003387798,0.0007028811,0.00007315951,0.0004271849,0.0007773489,0.00001540356,0.0008692063,0.0005167967,0.001307956,0.9940273,0.0009060189,0.00003793712],"study_design_scores_gemma":[0.001541978,0.0005756486,0.0001205641,0.000698524,0.0003108678,0.0001539928,0.0001354848,0.000108437,0.01497694,0.9811143,0.000110622,0.000152648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9901857,0.003214046,0.002602033,0.0006616402,0.001114824,0.0005831718,0.00001204175,0.00001278737,0.001613767],"genre_scores_gemma":[0.9987026,0.0007112226,0.00002725069,0.00002945138,0.0000597158,0.000007790358,0.000001875669,0.00006064064,0.0003994149],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01366899,"threshold_uncertainty_score":0.9984977,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04256794565999561,"score_gpt":0.3111170023555422,"score_spread":0.2685490566955466,"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."}}