{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9915349,0.00038641633,0.0012795074,0.0014928203,0.00058200746,0.00019601404,0.0000072115436,0.000026928303,0.0044942214],"genre_scores_gemma":[0.94425774,0.000036816295,0.054971438,0.00020055627,0.00036442195,0.0000029655125,0.000001781277,0.000026866483,0.00013743392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977993,0.00026377547,0.00093719346,0.000275486,0.00021347738,0.0005108172],"domain_scores_gemma":[0.9980646,0.0004957915,0.0006764999,0.0003945797,0.00020436334,0.00016417168],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009869257,0.00024410103,0.000952648,0.0006423534,0.000090041656,0.000018918729,0.0005352454,0.0002120909,0.0009318933],"category_scores_gemma":[0.0015908058,0.00020840332,0.00010380964,0.00042370864,0.00059919845,0.00024662097,0.00026503307,0.0005517713,0.000031717023],"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.0015309033,0.0031309922,0.049309727,0.00026820632,0.00041950966,0.0009986102,0.006491031,7.7070814e-7,0.0021095844,0.8549116,0.07869424,0.002134798],"study_design_scores_gemma":[0.0039664754,0.0019240446,0.0635464,0.00004177179,0.00009565526,0.0026454523,0.00043575733,0.00005590992,0.0005232464,0.9247828,0.0016561123,0.0003263882],"about_ca_topic_score_codex":0.000098764256,"about_ca_topic_score_gemma":0.00008350121,"teacher_disagreement_score":0.077038124,"about_ca_system_score_codex":0.00006631956,"about_ca_system_score_gemma":0.000111785375,"threshold_uncertainty_score":0.9999814},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9621551,0.00007129377,0.03566542,0.0008693539,0.00030611837,0.0001399412,0.000009854943,0.0000063915318,0.00077654864],"genre_scores_gemma":[0.9621565,0.000021662081,0.03769597,0.000033883818,0.00006888083,0.000004268751,5.3374805e-7,0.000009298997,0.000009023954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985412,0.00021444546,0.0008285284,0.00007694125,0.00017866831,0.00016026651],"domain_scores_gemma":[0.99585146,0.002296026,0.0010944959,0.00037447005,0.00032219637,0.00006137679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001329401,0.00010173045,0.00050122256,0.00012988115,0.00011935728,0.00000766465,0.00048437793,0.00009139061,0.00010737874],"category_scores_gemma":[0.0006782974,0.000063747415,0.00032139284,0.00018892573,0.0009904968,0.00005459577,0.000039431703,0.00042662845,0.0000018296577],"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.00025975256,0.00019841485,0.0012295997,0.000028400946,0.0001111753,0.0000017090728,0.00033034437,6.330842e-7,0.037355147,0.95937926,0.0006758333,0.0004297507],"study_design_scores_gemma":[0.0011639115,0.00014688798,0.0039375797,0.000013776305,0.0000772907,0.00017003003,0.00016499635,0.000015952339,0.007933402,0.98531467,0.0010047087,0.00005681775],"about_ca_topic_score_codex":0.000007132237,"about_ca_topic_score_gemma":0.00011715802,"teacher_disagreement_score":0.029421747,"about_ca_system_score_codex":0.000004252505,"about_ca_system_score_gemma":0.00003514808,"threshold_uncertainty_score":0.36495268},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9411549,0.00027694576,0.021113295,0.02573339,0.0008889142,0.00034902195,0.0000048576126,0.000021016927,0.010457644],"genre_scores_gemma":[0.9641813,0.000037307265,0.03481521,0.00049495045,0.0003871286,0.0000058192786,0.0000012618575,0.00001738842,0.00005961963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749476,0.0005217326,0.00089375454,0.00021046159,0.00036833956,0.000510928],"domain_scores_gemma":[0.9960323,0.0014028876,0.0015430589,0.0007427355,0.00017545116,0.00010355502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002221049,0.00022691324,0.00080347486,0.00036816034,0.00041716782,0.00010794465,0.0017620717,0.00020370985,0.00032439057],"category_scores_gemma":[0.00184154,0.00014775801,0.00022674624,0.00020485734,0.0010434123,0.00028110188,0.00023215392,0.00092098635,0.000028688131],"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.00009376472,0.0003517649,0.022967828,0.000044802997,0.0000637201,0.0002674208,0.0008891759,0.0000010551057,0.00007940311,0.96715236,0.0071469317,0.0009417662],"study_design_scores_gemma":[0.001615434,0.00049923966,0.10714932,0.000031195046,0.00004472023,0.001845426,0.00069053983,0.000027078044,0.000013124828,0.8821714,0.0057655876,0.00014695928],"about_ca_topic_score_codex":0.00013303121,"about_ca_topic_score_gemma":0.00052232656,"teacher_disagreement_score":0.084980994,"about_ca_system_score_codex":0.000062545674,"about_ca_system_score_gemma":0.000071754344,"threshold_uncertainty_score":0.60253966},"labels":[],"label_agreement":null}]}