{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002249898,0.0007223327,0.0009650821,0.0007850541,0.00176288,0.005408272,0.001740749,0.001258182,0.00707608],"category_scores_gemma":[0.0102534,0.0006658867,0.002082921,0.001068161,0.003288128,0.01689944,0.004373182,0.004061983,0.0007681084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002715435,"about_ca_system_score_gemma":0.002249461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002871969,"about_ca_topic_score_gemma":0.002236373,"domain_scores_codex":[0.9967234,0.0006805309,0.000280171,0.0009169113,0.000772813,0.0006262791],"domain_scores_gemma":[0.9891174,0.007827338,0.0009253928,0.00138425,0.0003945011,0.0003511194],"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.001067185,0.0006163028,0.005122891,0.0006311593,0.0001437079,0.000687074,0.003031539,0.04368798,0.009440613,0.8599536,0.003935133,0.0716827],"study_design_scores_gemma":[0.000159354,0.0000997798,0.0004231778,0.00002799666,0.00006627557,0.0002202414,0.0004087696,0.07226931,0.01392945,0.9082206,0.004133922,0.00004109488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6852134,0.0005503757,0.281967,0.003466017,0.0001086753,0.000312138,0.0006996625,0.001258316,0.02642442],"genre_scores_gemma":[0.942295,0.0002901877,0.04631499,0.0002068358,0.0001141332,0.0001462688,0.0009503418,0.0001786825,0.00950364],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00707608,"threshold_uncertainty_score":0.02367187,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001611228,0.0003006407,0.0005910216,0.0012152,0.00084546,0.001728439,0.001064861,0.000971703,0.001833759],"category_scores_gemma":[0.01151298,0.00050408,0.0002714099,0.0006249356,0.002249918,0.00281587,0.0009587972,0.0008758841,0.0002503438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001648995,"about_ca_system_score_gemma":0.0005076833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001448424,"about_ca_topic_score_gemma":0.001339526,"domain_scores_codex":[0.9994012,0.000200929,0.00001920426,0.0001957292,0.00007452474,0.0001084008],"domain_scores_gemma":[0.9881164,0.008043646,0.00113307,0.001102589,0.0006055335,0.000998816],"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.002487837,0.0002028349,0.04962054,0.0004868728,0.0003386631,0.001201902,0.00176566,0.1844377,0.06811792,0.6407112,0.02006454,0.03056434],"study_design_scores_gemma":[0.0002530272,0.0003819997,0.02041857,0.00009507166,0.0001134193,0.001118954,0.0007340763,0.5871973,0.01650003,0.3663833,0.006643972,0.00016028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9597853,0.0005571551,0.03135786,0.002189245,0.00008180162,0.0000333047,0.0006913623,0.0002150047,0.005089016],"genre_scores_gemma":[0.9943001,0.0002358886,0.003952303,0.0001187459,0.00006664626,0.00003472684,0.0002535259,0.00004004116,0.000997995],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001833759,"threshold_uncertainty_score":0.01196432,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001354925,0.0003793565,0.001145668,0.001050836,0.002849972,0.004971617,0.001080447,0.00203858,0.008301379],"category_scores_gemma":[0.01040538,0.0003027883,0.0008877631,0.001196261,0.004794826,0.00999384,0.004799816,0.005378983,0.0008968602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002173379,"about_ca_system_score_gemma":0.001610602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009956548,"about_ca_topic_score_gemma":0.0005485967,"domain_scores_codex":[0.9981489,0.0005209111,0.00007973539,0.000326926,0.0005502398,0.000373343],"domain_scores_gemma":[0.9907363,0.006437891,0.000642673,0.001255318,0.0003633302,0.0005644076],"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.0002802048,0.00009681855,0.002300743,0.0000767524,0.00002544224,0.0002670673,0.0005397204,0.006731351,0.001299657,0.978282,0.003171438,0.006928786],"study_design_scores_gemma":[0.00005811939,0.00003315701,0.0003909977,0.00001040911,0.00001125151,0.0001558915,0.00014162,0.01513597,0.001203458,0.9808664,0.001975377,0.0000172938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8438535,0.000452595,0.08787671,0.01016838,0.0002122532,0.0001251285,0.0005141943,0.0002891413,0.05650814],"genre_scores_gemma":[0.9915427,0.0001431077,0.003882794,0.0002513654,0.0001361486,0.00005899319,0.0001677111,0.00003320688,0.003784015],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008301379,"threshold_uncertainty_score":0.02777088,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}