{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"91ec30a3d280","filters":{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Svetla Vassileva","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1015991567261624,"gpt":0.2809278124003784,"spread":0.179328655674216,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009869257,0.000244101,0.000952648,0.0006423534,0.00009004166,0.00001891873,0.0005352454,0.0002120909,0.0009318933],"category_scores_gemma":[0.001590806,0.0002084033,0.0001038096,0.0004237086,0.0005991985,0.000246621,0.0002650331,0.0005517713,0.00003171702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006631956,"about_ca_system_score_gemma":0.0001117854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009876426,"about_ca_topic_score_gemma":0.00008350121,"domain_scores_codex":[0.9977993,0.0002637755,0.0009371935,0.000275486,0.0002134774,0.0005108172],"domain_scores_gemma":[0.9980646,0.0004957915,0.0006764999,0.0003945797,0.0002043633,0.0001641717],"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.001530903,0.003130992,0.04930973,0.0002682063,0.0004195097,0.0009986102,0.006491031,7.707081e-7,0.002109584,0.8549116,0.07869424,0.002134798],"study_design_scores_gemma":[0.003966475,0.001924045,0.0635464,0.00004177179,0.00009565526,0.002645452,0.0004357573,0.00005590992,0.0005232464,0.9247828,0.001656112,0.0003263882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9915349,0.0003864163,0.001279507,0.00149282,0.0005820075,0.000196014,0.000007211544,0.0000269283,0.004494221],"genre_scores_gemma":[0.9442577,0.00003681629,0.05497144,0.0002005563,0.000364422,0.000002965513,0.000001781277,0.00002686648,0.0001374339],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07703812,"threshold_uncertainty_score":0.9999814,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gideon Amir","is_ca":true},{"name":"Ori Gurel-Gurevich","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05141402062238563,"gpt":0.3215825098806511,"spread":0.2701684892582655,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001329401,0.0001017305,0.0005012226,0.0001298812,0.0001193573,0.00000766465,0.0004843779,0.00009139061,0.0001073787],"category_scores_gemma":[0.0006782974,0.00006374741,0.0003213928,0.0001889257,0.0009904968,0.00005459577,0.0000394317,0.0004266285,0.000001829658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004252505,"about_ca_system_score_gemma":0.00003514808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007132237,"about_ca_topic_score_gemma":0.000117158,"domain_scores_codex":[0.9985412,0.0002144455,0.0008285284,0.00007694125,0.0001786683,0.0001602665],"domain_scores_gemma":[0.9958515,0.002296026,0.001094496,0.0003744701,0.0003221964,0.00006137679],"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.0002597526,0.0001984149,0.0012296,0.00002840095,0.0001111753,0.000001709073,0.0003303444,6.330842e-7,0.03735515,0.9593793,0.0006758333,0.0004297507],"study_design_scores_gemma":[0.001163912,0.000146888,0.00393758,0.00001377631,0.0000772907,0.00017003,0.0001649964,0.00001595234,0.007933402,0.9853147,0.001004709,0.00005681775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9621551,0.00007129377,0.03566542,0.0008693539,0.0003061184,0.0001399412,0.000009854943,0.000006391532,0.0007765486],"genre_scores_gemma":[0.9621565,0.00002166208,0.03769597,0.00003388382,0.00006888083,0.000004268751,5.337481e-7,0.000009298997,0.000009023954],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02942175,"threshold_uncertainty_score":0.3649527,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alexei Miasnikov","is_ca":false},{"name":"Svetla Vassileva","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1163018082812926,"gpt":0.3556580237808279,"spread":0.2393562154995353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002221049,0.0002269132,0.0008034749,0.0003681603,0.0004171678,0.0001079447,0.001762072,0.0002037098,0.0003243906],"category_scores_gemma":[0.00184154,0.000147758,0.0002267462,0.0002048573,0.001043412,0.0002811019,0.0002321539,0.0009209863,0.00002868813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006254567,"about_ca_system_score_gemma":0.00007175434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001330312,"about_ca_topic_score_gemma":0.0005223266,"domain_scores_codex":[0.9974948,0.0005217326,0.0008937545,0.0002104616,0.0003683396,0.000510928],"domain_scores_gemma":[0.9960323,0.001402888,0.001543059,0.0007427355,0.0001754512,0.000103555],"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.00009376472,0.0003517649,0.02296783,0.000044803,0.0000637201,0.0002674208,0.0008891759,0.000001055106,0.00007940311,0.9671524,0.007146932,0.0009417662],"study_design_scores_gemma":[0.001615434,0.0004992397,0.1071493,0.00003119505,0.00004472023,0.001845426,0.0006905398,0.00002707804,0.00001312483,0.8821714,0.005765588,0.0001469593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9411549,0.0002769458,0.0211133,0.02573339,0.0008889142,0.000349022,0.000004857613,0.00002101693,0.01045764],"genre_scores_gemma":[0.9641813,0.00003730727,0.03481521,0.0004949505,0.0003871286,0.000005819279,0.000001261858,0.00001738842,0.00005961963],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08498099,"threshold_uncertainty_score":0.6025397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}