{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":7,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":7,"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":"45734b2f3a3b","filters":{"venue":"Journal of Algebra Combinatorics Discrete Structures and Applications"}},"results":[{"id":"W2732089117","doi":"10.13069/jacodesmath.327375","title":"On the equivalence of cyclic and quasi-cyclic codes over finite fields","year":2017,"lang":"en","type":"article","venue":"Journal of Algebra Combinatorics Discrete Structures and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Cyclic code; Huffman coding; Mathematics; Cyclic group; Combinatorics; Discrete mathematics; Equivalence (formal languages); Prime (order theory); Linear code; Block code; Algorithm; Decoding methods; Data compression","authors":[{"name":"Kenza Guenda","is_ca":true},{"name":"T. Aaron Gulliver","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0127679018977343,"gpt":0.2660729161778279,"spread":0.2533050142800936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002969275,0.0001146814,0.000186908,0.00008033489,0.0005775093,0.0002535182,0.0009651737,0.00005612088,0.000007379945],"category_scores_gemma":[0.0001058637,0.0000733705,0.00008905469,0.0001257436,0.0002510468,0.0002348793,0.0002289125,0.0002416951,2.26344e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005833584,"about_ca_system_score_gemma":0.00002110295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000595252,"about_ca_topic_score_gemma":0.000001546457,"domain_scores_codex":[0.9991935,0.00004847891,0.0002625844,0.0001530913,0.0002195716,0.0001227323],"domain_scores_gemma":[0.9981673,0.0005180784,0.0005440593,0.0006017166,0.00008509542,0.00008376432],"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.000009158734,0.00002381254,0.0009462793,0.00001391362,0.00002847188,9.100539e-7,0.0001618665,0.000006711536,0.000210453,0.9937739,0.00008230788,0.004742245],"study_design_scores_gemma":[0.0002392512,0.0002079041,0.02830346,0.00003318455,0.00002245703,0.00001620995,0.00003927209,0.0003619456,0.000597433,0.9695349,0.000555171,0.00008887088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8913795,0.0007439064,0.1039681,0.002433253,0.0001919714,0.0001794341,0.00001049077,0.00001252528,0.001080789],"genre_scores_gemma":[0.998973,0.0004211493,0.0004060357,0.0001332195,0.00004442435,0.000005749859,2.808933e-7,0.000004624799,0.00001157852],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1075934,"threshold_uncertainty_score":0.4441793,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2986162624","doi":"10.13069/jacodesmath.645015","title":"Construction of quasi-twisted codes and enumeration of defining polynomials","year":2019,"lang":"en","type":"article","venue":"Journal of Algebra Combinatorics Discrete Structures and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Enumeration; Hamming code; Combinatorics; Mathematics; Linear code; Minimum distance; Hamming distance; Code (set theory); Finite field; Discrete mathematics; Block code; Algorithm; Computer science; Decoding methods","authors":[{"name":"T. Aaron Gulliver","is_ca":true},{"name":"V. Ch. Venkaiah","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004648419889312304,"gpt":0.2245317418811273,"spread":0.219883321991815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000261685,0.00009177596,0.0002605284,0.0001675048,0.00008174384,0.00005201484,0.0002211292,0.00005478888,0.000005027178],"category_scores_gemma":[0.00002013464,0.00007813737,0.00006783378,0.0003111172,0.0001195207,0.0002397901,0.0000682631,0.0001146477,1.882437e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008124812,"about_ca_system_score_gemma":0.00004003695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000547008,"about_ca_topic_score_gemma":5.28247e-7,"domain_scores_codex":[0.9991398,0.00005521532,0.0004249784,0.0001279019,0.0001701518,0.00008193618],"domain_scores_gemma":[0.9987512,0.0001572292,0.0006552623,0.0001958419,0.0001816759,0.00005885014],"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.00001508844,0.00001858937,0.005308605,0.00004196846,0.00003702737,1.349901e-7,0.000215983,0.00001088312,0.006105842,0.9792341,0.000008464283,0.009003327],"study_design_scores_gemma":[0.0006983017,0.0004120906,0.01894416,0.00004836881,0.00005218599,0.00009145516,0.0003075531,0.0005401902,0.008483881,0.9697919,0.0004961956,0.0001337027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9042345,0.001105579,0.09398206,0.0001257728,0.0001460716,0.0001419493,0.00001301399,0.000008756775,0.0002422672],"genre_scores_gemma":[0.9918455,0.0001718008,0.00793687,0.00001625953,0.00001838874,0.000002202776,0.000002254731,0.000004203535,0.00000248249],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.087611,"threshold_uncertainty_score":0.318635,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3027070930","doi":"10.13069/jacodesmath.867644","title":"Two families of graphs that are Cayley on nonisomorphic groups","year":2021,"lang":"en","type":"preprint","venue":"Journal of Algebra Combinatorics Discrete Structures and Applications","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Cayley graph; Abelian group; Combinatorics; Cayley's theorem; Mathematics; Vertex-transitive graph; Cayley transform; Graph; Discrete mathematics; Voltage graph; Line graph","authors":[{"name":"Joy Morris","is_ca":true},{"name":"Josip Smolcic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04255680671570617,"gpt":0.3246140440347098,"spread":0.2820572373190036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006770252,0.0004610692,0.001112071,0.0005334027,0.0002320268,0.0002124548,0.000923034,0.000339514,0.00004885143],"category_scores_gemma":[0.0002501715,0.0003814857,0.0004688385,0.0004722955,0.0003632629,0.0001147303,0.0007240832,0.001742987,6.95731e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001015028,"about_ca_system_score_gemma":0.0002237157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002228056,"about_ca_topic_score_gemma":0.00001582184,"domain_scores_codex":[0.996932,0.0002485004,0.001002843,0.0004456204,0.001036024,0.0003350365],"domain_scores_gemma":[0.995029,0.000909688,0.002010303,0.0009994,0.0008048828,0.0002467211],"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.00006239887,0.0001909095,0.002229567,0.000840549,0.0003793875,0.0000231421,0.0005221366,0.00005408209,0.000281266,0.9946766,0.0002237581,0.0005162323],"study_design_scores_gemma":[0.0008336467,0.0001722854,0.005409861,0.0004149843,0.0002450594,0.00009186935,0.002392686,0.00004165009,0.001579986,0.9883254,0.0001635653,0.0003290113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9923832,0.002297744,0.002455288,0.0003576896,0.0004118991,0.0007443834,0.000212439,0.00002775105,0.001109538],"genre_scores_gemma":[0.9958289,0.001896715,0.001873712,0.00004080321,0.0001540203,0.00005631407,0.00004024553,0.00007210589,0.00003716872],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006351176,"threshold_uncertainty_score":0.9998637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W918463335","doi":"10.13069/jacodesmath.66457","title":"Infinitely many nonsolvable groups whose Cayley graphs are hamiltonian","year":2016,"lang":"en","type":"article","venue":"Journal of Algebra Combinatorics Discrete Structures and Applications","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Cayley graph; Mathematics; Hamiltonian (control theory); Combinatorics; Pure mathematics; Graph","authors":[{"name":"Dave Witte Morris","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02525233172852083,"gpt":0.2979818062608756,"spread":0.2727294745323548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006423761,0.0002820836,0.000486839,0.0003645112,0.0003532381,0.0001448303,0.0006203501,0.0001674917,0.0001048138],"category_scores_gemma":[0.0003335672,0.0001825775,0.0001974203,0.0005571377,0.0002890107,0.0003297154,0.0001922081,0.0004537326,0.00000910613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008866374,"about_ca_system_score_gemma":0.00008360702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005213893,"about_ca_topic_score_gemma":0.000007095891,"domain_scores_codex":[0.9978324,0.0001267824,0.0007336311,0.000287137,0.000598792,0.0004212777],"domain_scores_gemma":[0.9969657,0.0008674162,0.0007594906,0.0005788869,0.0004761755,0.0003523108],"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.00004955904,0.00007882505,0.003368589,0.00007683628,0.0001062389,0.00001320172,0.0001581072,5.83642e-7,0.001365954,0.991381,0.001300298,0.002100733],"study_design_scores_gemma":[0.001092917,0.0001806735,0.01216022,0.00009510793,0.00007745987,0.0001520301,0.0003172991,0.000009368285,0.000647789,0.9783647,0.006651834,0.0002506035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9797321,0.000987794,0.01411449,0.001853311,0.0002602132,0.000675125,0.0001180038,0.00006790577,0.002191082],"genre_scores_gemma":[0.9969647,0.0005315104,0.001857305,0.00006871398,0.0001579716,0.0000384804,0.000002629354,0.00005395013,0.0003247171],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01723265,"threshold_uncertainty_score":0.7445295,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W7139166370","doi":"","title":"Editor’s note","year":2016,"lang":"en","type":"other","venue":"Journal of Algebra Combinatorics Discrete Structures and Applications","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Combinatorial design; Algebraic combinatorics; Automorphism group; Group (periodic table); Mathematical sciences; Hamming distance; Permutation (music); Permutation group; Vision","authors":[{"name":"Vladimir D. Tonchev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004879831947441337,"gpt":0.2709185962633325,"spread":0.2660387643158912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002137992,0.0005036502,0.0007399422,0.0006243945,0.0001615436,0.0001332454,0.0007243536,0.00047688,0.001100522],"category_scores_gemma":[0.00004730884,0.0003491676,0.0002637903,0.0003238261,0.0002847139,0.0001297759,0.0001549203,0.0006579041,0.0001768947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001425083,"about_ca_system_score_gemma":0.0001940434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001410443,"about_ca_topic_score_gemma":0.000006883496,"domain_scores_codex":[0.9977265,0.00006948336,0.0007150737,0.0003633989,0.0007593404,0.000366203],"domain_scores_gemma":[0.9965696,0.0001158197,0.002036405,0.0005980614,0.0002828833,0.0003972112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001277846,0.00002694113,0.00003355874,0.00005718167,0.0001692271,0.000004391795,0.000018375,5.286412e-7,0.000161501,0.2830693,0.7147616,0.001684587],"study_design_scores_gemma":[0.0007017396,0.00006252604,0.0001359636,0.0001163946,0.0001982934,0.00008261327,0.00001791629,0.000002030592,0.00004356235,0.2335851,0.7647199,0.0003338815],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0001520486,0.02388088,0.03861339,0.001722956,0.01903827,0.002846452,0.00313613,0.0005991307,0.9100108],"genre_scores_gemma":[0.08959895,0.01616293,0.009354063,0.0005047655,0.1494502,0.0003308585,0.0002916573,0.008373111,0.7259335],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1840772,"threshold_uncertainty_score":0.999896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W7013347212","doi":"","title":"Editor’s note","year":2017,"lang":"en","type":"other","venue":"Journal of Algebra Combinatorics Discrete Structures and Applications","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Czech; Axiom; Coding theory; Ring (chemistry); Point (geometry); Algebra over a field; Hamming code","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.006840246102485028,"gpt":0.2803604119420163,"spread":0.2735201658395313,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002450991,0.0005161691,0.0008250304,0.0005445262,0.0003676085,0.0003063134,0.001151886,0.0005309602,0.0002833159],"category_scores_gemma":[0.00008965156,0.0004210617,0.0002814463,0.0002027513,0.0003625489,0.000162877,0.0002083061,0.0009482686,0.00005365352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001154479,"about_ca_system_score_gemma":0.0002268946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004658675,"about_ca_topic_score_gemma":0.00002155911,"domain_scores_codex":[0.9978853,0.00005692319,0.0005703187,0.0003745088,0.0007616894,0.0003513013],"domain_scores_gemma":[0.9951066,0.00007184737,0.003142909,0.0009935474,0.0002913172,0.0003937574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001211293,0.00003269104,0.00004610086,0.00008392474,0.0002080378,0.000008089336,0.00002548292,0.000001748956,0.0000664387,0.164887,0.8325634,0.002064962],"study_design_scores_gemma":[0.0006607283,0.00007340524,0.0003019008,0.0001445681,0.0002869001,0.000100693,0.00001777898,0.000007225943,0.00002714939,0.163024,0.8349836,0.0003720364],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0001382281,0.03265163,0.01341885,0.0008404508,0.01885291,0.00246323,0.002130341,0.0004155647,0.9290888],"genre_scores_gemma":[0.145039,0.01954479,0.01108616,0.0003511154,0.1432466,0.0003037571,0.0005186466,0.007643541,0.6722664],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2568224,"threshold_uncertainty_score":0.9998241,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3022250425","doi":"10.13069/jacodesmath.729446","title":"Some bounds arising from a polynomial ideal associated to any $t$-design","year":2020,"lang":"en","type":"article","venue":"Journal of Algebra Combinatorics Discrete Structures and Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Ideal (ethics); Degree (music); Integer (computer science); Polynomial; Lambda; Mathematics; Zero (linguistics); Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","authors":[{"name":"William J. Martin","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01020955117552986,"gpt":0.2150842456940489,"spread":0.204874694518519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001478868,0.0001773892,0.0003230547,0.00008774312,0.0001650906,0.0001566859,0.0002538032,0.000105611,0.00001099664],"category_scores_gemma":[0.00003739458,0.0001608981,0.0001001273,0.0003356427,0.0000333495,0.0001781395,0.0000378108,0.0003127097,0.000002677006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005288685,"about_ca_system_score_gemma":0.00003004209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008067628,"about_ca_topic_score_gemma":8.077679e-7,"domain_scores_codex":[0.9989395,0.0000530514,0.0004438338,0.0001465779,0.0002169426,0.0002000658],"domain_scores_gemma":[0.9992013,0.00008438116,0.0001731653,0.0001304537,0.00007265504,0.0003380572],"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.0002791413,0.0001141132,0.00238252,0.0001721352,0.001719239,0.00004294819,0.006575616,0.02019393,0.0951921,0.8339183,0.03505298,0.00435693],"study_design_scores_gemma":[0.002120411,0.0005576502,0.01681779,0.00008851841,0.0003018448,0.00004229626,0.001066049,0.005917097,0.005447851,0.9515619,0.01524665,0.0008318799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9261686,0.003056667,0.06828568,0.0009768964,0.0006414456,0.0004417236,0.0001056355,0.0001259449,0.0001974006],"genre_scores_gemma":[0.9986982,0.00008361718,0.0004446486,0.0001908815,0.0005301208,0.00001063013,0.000007807218,0.00002981518,0.000004282739],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1176436,"threshold_uncertainty_score":0.6561233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}