{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003260693,0.0003769698,0.0008498013,0.001701953,0.001898282,0.002697004,0.001317797,0.001773501,0.004397976],"category_scores_gemma":[0.02055483,0.0003659316,0.0006943148,0.001544151,0.004802124,0.01197575,0.002794686,0.002791694,0.0004689388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001382525,"about_ca_system_score_gemma":0.0009522869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001047172,"about_ca_topic_score_gemma":0.0005320163,"domain_scores_codex":[0.9961368,0.001223455,0.0002991665,0.0007017863,0.001038764,0.0005999712],"domain_scores_gemma":[0.97923,0.01561081,0.001517573,0.001713278,0.001330234,0.0005981529],"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.0003084332,0.0001264174,0.002334287,0.00009792658,0.00001638157,0.0002182364,0.001115734,0.006360656,0.001916287,0.9521943,0.001121386,0.03418986],"study_design_scores_gemma":[0.0000268332,0.00008176794,0.0007115411,0.00003407061,0.00001147285,0.0002504551,0.0003493295,0.01338794,0.001817314,0.9806317,0.002678102,0.00001952909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7227556,0.001719684,0.2099501,0.003812738,0.0002411718,0.0001463033,0.00039626,0.0001633427,0.06081475],"genre_scores_gemma":[0.975233,0.0009739953,0.01882625,0.0003325544,0.0004291872,0.00005604961,0.0005752346,0.0000660592,0.003507626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004397976,"threshold_uncertainty_score":0.01724434,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003922578,0.0004018965,0.0004220403,0.001047342,0.0008264324,0.001151619,0.0007710841,0.000480893,0.003119917],"category_scores_gemma":[0.001817696,0.0003094002,0.0004407556,0.001050657,0.001102071,0.001444727,0.001585391,0.001005555,0.0008224961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007121185,"about_ca_system_score_gemma":0.0008878802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004045713,"about_ca_topic_score_gemma":0.0006011672,"domain_scores_codex":[0.9993958,0.0001533646,0.0000507079,0.00007828271,0.0001747601,0.0001470286],"domain_scores_gemma":[0.9989265,0.0003616945,0.000131194,0.0002427156,0.0001877988,0.0001500795],"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.0001790131,0.00007733217,0.002393513,0.0001610198,0.00001234157,0.000343504,0.0006098044,0.01417058,0.03127144,0.8896823,0.002023865,0.05907539],"study_design_scores_gemma":[0.00005258672,0.0002636183,0.001427613,0.0001133172,0.00003151496,0.001475091,0.0004116858,0.1571594,0.06747374,0.7552295,0.01624624,0.0001157302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6054457,0.0003570876,0.3647211,0.0004434188,0.0001275191,0.0001258185,0.0006215558,0.0004952968,0.02766244],"genre_scores_gemma":[0.8612135,0.0003589248,0.129023,0.0001229179,0.00004647732,0.0001343845,0.0007707909,0.0001289689,0.008200958],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003119917,"threshold_uncertainty_score":0.01043713,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003674082,0.0003878407,0.0003121655,0.001175625,0.001713756,0.001563119,0.0008174006,0.001129832,0.003638684],"category_scores_gemma":[0.002593309,0.000495467,0.0005313671,0.0006497509,0.001983723,0.002296865,0.0009629288,0.001337583,0.0002429994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001093123,"about_ca_system_score_gemma":0.0004907271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00202497,"about_ca_topic_score_gemma":0.002688333,"domain_scores_codex":[0.9995452,0.000124802,0.00001761702,0.0001160696,0.000123646,0.00007262232],"domain_scores_gemma":[0.9979831,0.0007606901,0.0002877645,0.000283984,0.000353789,0.0003306118],"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.000118988,0.0000620901,0.003863243,0.00008138303,0.00002612283,0.002110295,0.001613399,0.003983358,0.009097409,0.9653828,0.003320754,0.01034013],"study_design_scores_gemma":[0.00007343621,0.00008618689,0.006266553,0.0001091022,0.00005556456,0.00338699,0.002612941,0.02945266,0.008021303,0.9175039,0.03236552,0.00006584921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8901693,0.0007095115,0.06104885,0.001680074,0.0001671754,0.00006773147,0.0003342011,0.000354679,0.04546851],"genre_scores_gemma":[0.9696679,0.0003600898,0.02011999,0.0003023234,0.0000522028,0.00005818331,0.0007487079,0.00008863768,0.008601926],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003638684,"threshold_uncertainty_score":0.01217264,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003439857,0.0004207513,0.0003655679,0.000704315,0.001716887,0.001672092,0.000791659,0.0009115526,0.005668653],"category_scores_gemma":[0.002127985,0.0003592452,0.0006457877,0.0006245099,0.002232173,0.002194674,0.001517673,0.001045518,0.0004215237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007920793,"about_ca_system_score_gemma":0.0005393426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006011847,"about_ca_topic_score_gemma":0.001362392,"domain_scores_codex":[0.9994842,0.0001121732,0.0000294772,0.0001470608,0.0001081719,0.0001189192],"domain_scores_gemma":[0.998444,0.000751118,0.0002411926,0.0002301605,0.0001310402,0.0002024806],"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.0001746493,0.0001062841,0.002323274,0.0001544096,0.00006307223,0.001001283,0.001631852,0.005321105,0.010705,0.9580385,0.002744182,0.01773635],"study_design_scores_gemma":[0.00006775442,0.00005224683,0.0006336313,0.00002002167,0.00003983651,0.0004036669,0.0005434743,0.01272078,0.006416503,0.972064,0.007011229,0.00002673461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9347481,0.0003105331,0.03255057,0.0009016859,0.00007031544,0.00004096233,0.0001695987,0.0002088703,0.03099937],"genre_scores_gemma":[0.9843006,0.0001245281,0.0100859,0.0002220151,0.00003681606,0.00006222711,0.0003636225,0.00003070054,0.004773649],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005668653,"threshold_uncertainty_score":0.01896352,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00331794,0.001357348,0.001258144,0.001464517,0.001839192,0.005861872,0.002560918,0.005864148,0.172287],"category_scores_gemma":[0.02061021,0.0004516586,0.001177896,0.001183969,0.0007869296,0.004676577,0.002018279,0.006223117,0.1049281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00170332,"about_ca_system_score_gemma":0.004137151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001268063,"about_ca_topic_score_gemma":0.003239042,"domain_scores_codex":[0.9967614,0.0002579828,0.0003356487,0.0007316106,0.001599537,0.0003138619],"domain_scores_gemma":[0.9868717,0.001816317,0.0005460682,0.000628512,0.007389368,0.002747963],"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.000009131002,0.000005089205,0.00002609354,0.00004711176,0.000001713836,0.00003135591,0.00001054209,0.000009690615,0.00004455396,0.0005801787,0.9912646,0.007969965],"study_design_scores_gemma":[0.000004458856,0.000004674838,0.00005907247,0.00004045239,0.000001721043,0.00005645051,0.00001593851,0.00002103788,0.00004593164,0.0003185541,0.9994283,0.000003349899],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0001608949,0.00543658,0.0005947174,0.1321204,0.8281404,0.0000653301,0.0007480739,0.0002784824,0.03245513],"genre_scores_gemma":[0.002874384,0.007735892,0.00109981,0.1087088,0.4648856,0.0001080384,0.0007365729,0.0004200345,0.4134309],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.172287,"threshold_uncertainty_score":0.5763575,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003708701,0.001598456,0.001392315,0.001870954,0.002092275,0.007029783,0.003427395,0.007227805,0.2158012],"category_scores_gemma":[0.023569,0.0005747574,0.001487688,0.0015718,0.001022821,0.005008965,0.002531217,0.007380601,0.1443284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001979645,"about_ca_system_score_gemma":0.004402856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001447734,"about_ca_topic_score_gemma":0.002959651,"domain_scores_codex":[0.996104,0.0003394853,0.0003880956,0.0008938171,0.00188003,0.0003945354],"domain_scores_gemma":[0.9862221,0.002106757,0.0007251998,0.0008414905,0.007442172,0.002662251],"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.00001234891,0.000006017047,0.00002362287,0.00006923455,0.000002143489,0.00003103841,0.000009751889,0.000008180538,0.00004748811,0.0003491485,0.9919192,0.007521937],"study_design_scores_gemma":[0.000006550385,0.00000602374,0.00007774967,0.00006552457,0.000002369606,0.00004833322,0.00001799897,0.00001546389,0.00004822764,0.0002275113,0.9994803,0.000003928442],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0001119235,0.004373844,0.0003600699,0.09359557,0.8758943,0.00006397956,0.0006689726,0.0002928663,0.02463854],"genre_scores_gemma":[0.002137859,0.007698053,0.0008625601,0.1285353,0.5561298,0.0001483162,0.0009275549,0.0005000263,0.3030606],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.7841988,"threshold_uncertainty_score":0.721927,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003910507,0.001086255,0.001044414,0.001448602,0.001525155,0.00438786,0.001653122,0.001245257,0.01317929],"category_scores_gemma":[0.01176456,0.0007415932,0.001479564,0.00155529,0.003352832,0.006530328,0.002993495,0.003062911,0.001654187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003533861,"about_ca_system_score_gemma":0.001645529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001504223,"about_ca_topic_score_gemma":0.001290347,"domain_scores_codex":[0.9970386,0.0006554142,0.0001643892,0.0005445741,0.0008285351,0.0007684765],"domain_scores_gemma":[0.9925752,0.004195591,0.000890502,0.0009001702,0.0006973561,0.0007411253],"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.0002489223,0.00005611644,0.0005221012,0.0001412787,0.00001704274,0.0001310881,0.000286143,0.02016611,0.002822833,0.9636374,0.00212263,0.009848329],"study_design_scores_gemma":[0.0000577641,0.0002220622,0.0003930198,0.0001055177,0.00004825285,0.0002021512,0.0001813373,0.1322983,0.006280117,0.8512739,0.008878292,0.00005931196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1757986,0.001256369,0.7233517,0.002043927,0.0002338145,0.0001186027,0.0006673504,0.0008789581,0.09565061],"genre_scores_gemma":[0.837162,0.000799123,0.1385965,0.0006225318,0.0003240049,0.0003214058,0.0006361938,0.000491657,0.02104638],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01317929,"threshold_uncertainty_score":0.04408914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}