{"meta":{"query_hash":"91ec30a3d280","filters":{"venue":"journal of Groups complexity cryptology"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/91ec30a3d280","api":"https://metacan.xera.ac/api/v1/cohort?venue=journal+of+Groups+complexity+cryptology"},"results":[{"id":"W1981151457","doi":"10.1515/gcc.2011.005","title":"Polynomial time conjugacy in wreath products and free solvable groups","year":2011,"lang":"en","type":"article","venue":"journal of Groups complexity cryptology","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Wreath product; Conjugacy problem; Mathematics; Conjugacy class; Solvable group; Decidability; Combinatorics; Embedding; Discrete mathematics; Product (mathematics); Abelian group; Computer science; Geometry","score_opus":0.10159915672616239,"score_gpt":0.2809278124003784,"score_spread":0.17932865567421602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981151457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68521345,0.00055037567,0.28196704,0.0034660173,0.00010867533,0.00031213797,0.0006996625,0.0012583162,0.026424423],"genre_scores_gemma":[0.942295,0.00029018775,0.04631499,0.00020683576,0.00011413322,0.00014626875,0.0009503418,0.00017868249,0.00950364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672335,0.00068053085,0.00028017096,0.00091691135,0.000772813,0.0006262791],"domain_scores_gemma":[0.98911744,0.007827338,0.0009253928,0.0013842502,0.00039450114,0.00035111944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022498984,0.0007223327,0.0009650821,0.00078505406,0.0017628805,0.005408272,0.0017407492,0.0012581821,0.00707608],"category_scores_gemma":[0.010253397,0.0006658867,0.0020829213,0.0010681612,0.0032881282,0.016899442,0.0043731816,0.004061983,0.0007681084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001067185,0.0006163028,0.005122891,0.00063115935,0.00014370792,0.00068707403,0.0030315386,0.043687977,0.009440613,0.85995364,0.003935133,0.0716827],"study_design_scores_gemma":[0.00015935402,0.0000997798,0.00042317776,0.000027996655,0.00006627557,0.00022024142,0.00040876956,0.072269306,0.013929454,0.9082206,0.004133922,0.00004109488],"about_ca_topic_score_codex":0.0028719695,"about_ca_topic_score_gemma":0.0022363726,"teacher_disagreement_score":0.00707608,"about_ca_system_score_codex":0.0027154349,"about_ca_system_score_gemma":0.0022494607,"threshold_uncertainty_score":0.023671865},"labels":[],"label_agreement":null},{"id":"W2159543556","doi":"10.1515/gcc.2010.004","title":"The diameter of a random Cayley graph of ℤ q","year":2010,"lang":"en","type":"article","venue":"journal of Groups complexity cryptology","topic":"Graph theory and applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cayley graph; Combinatorics; Mathematics; Graph; Vertex-transitive graph; Cyclic group; Prime (order theory); Discrete mathematics; Order (exchange); Random graph; Voltage graph; Line graph; Abelian group","score_opus":0.051414020622385634,"score_gpt":0.3215825098806511,"score_spread":0.2701684892582655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159543556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9597853,0.0005571551,0.03135786,0.0021892448,0.00008180162,0.000033304696,0.0006913623,0.00021500472,0.005089016],"genre_scores_gemma":[0.9943001,0.00023588861,0.003952303,0.000118745906,0.00006664626,0.00003472684,0.0002535259,0.00004004116,0.000997995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994012,0.00020092897,0.000019204259,0.00019572921,0.00007452474,0.0001084008],"domain_scores_gemma":[0.9881164,0.008043646,0.0011330704,0.0011025887,0.00060553354,0.000998816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016112278,0.0003006407,0.00059102156,0.0012151997,0.00084546005,0.0017284392,0.0010648613,0.000971703,0.0018337588],"category_scores_gemma":[0.011512984,0.00050408003,0.0002714099,0.0006249356,0.0022499184,0.0028158699,0.00095879723,0.0008758841,0.00025034376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024878369,0.00020283493,0.049620535,0.0004868728,0.00033866309,0.0012019023,0.0017656595,0.18443766,0.06811792,0.6407112,0.020064544,0.030564344],"study_design_scores_gemma":[0.00025302722,0.00038199974,0.02041857,0.00009507166,0.000113419264,0.0011189544,0.0007340763,0.5871973,0.016500028,0.36638334,0.006643972,0.00016027997],"about_ca_topic_score_codex":0.0014484242,"about_ca_topic_score_gemma":0.001339526,"teacher_disagreement_score":0.0018337588,"about_ca_system_score_codex":0.0016489954,"about_ca_system_score_gemma":0.00050768326,"threshold_uncertainty_score":0.011964321},"labels":[],"label_agreement":null},{"id":"W2605695276","doi":"10.1515/gcc-2017-0005","title":"Log-space conjugacy problem in the Grigorchuk group","year":2017,"lang":"en","type":"article","venue":"journal of Groups complexity cryptology","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Champlain Regional College","funders":"","keywords":"Conjugacy class; Space (punctuation); Group (periodic table); Mathematics; Combinatorics; Pure mathematics; Computer science; Physics; Operating system","score_opus":0.11630180828129263,"score_gpt":0.3556580237808279,"score_spread":0.23935621549953526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605695276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8438535,0.00045259498,0.087876715,0.010168385,0.00021225316,0.00012512848,0.0005141943,0.00028914135,0.05650814],"genre_scores_gemma":[0.9915427,0.00014310765,0.003882794,0.00025136545,0.00013614856,0.00005899319,0.0001677111,0.000033206878,0.0037840153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981489,0.0005209111,0.000079735386,0.00032692598,0.00055023975,0.00037334303],"domain_scores_gemma":[0.9907363,0.006437891,0.000642673,0.0012553177,0.00036333018,0.00056440756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013549255,0.00037935653,0.0011456682,0.0010508362,0.0028499719,0.0049716174,0.0010804475,0.0020385804,0.008301379],"category_scores_gemma":[0.0104053775,0.0003027883,0.0008877631,0.001196261,0.004794826,0.00999384,0.004799816,0.005378983,0.0008968602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002802048,0.00009681855,0.0023007435,0.000076752396,0.000025442245,0.00026706725,0.0005397204,0.0067313514,0.0012996574,0.97828203,0.0031714381,0.006928786],"study_design_scores_gemma":[0.00005811939,0.00003315701,0.00039099765,0.000010409109,0.000011251505,0.00015589151,0.00014161997,0.015135974,0.001203458,0.98086643,0.001975377,0.000017293796],"about_ca_topic_score_codex":0.0009956548,"about_ca_topic_score_gemma":0.00054859667,"teacher_disagreement_score":0.008301379,"about_ca_system_score_codex":0.0021733793,"about_ca_system_score_gemma":0.001610602,"threshold_uncertainty_score":0.027770877},"labels":[],"label_agreement":null}]}