{"meta":{"query_hash":"45734b2f3a3b","filters":{"venue":"Journal of Algebra Combinatorics Discrete Structures and Applications"},"cohort_total":7,"direct_labels_cover":0,"predictions_cover":7,"exported":7,"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/45734b2f3a3b","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012767901897734298,"score_gpt":0.2660729161778279,"score_spread":0.2533050142800936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732089117","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.8913795,0.00074390636,0.103968136,0.0024332535,0.00019197138,0.00017943412,0.000010490766,0.000012525284,0.0010807891],"genre_scores_gemma":[0.99897295,0.0004211493,0.00040603572,0.0001332195,0.00004442435,0.000005749859,2.808933e-7,0.0000046247987,0.000011578521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919355,0.000048478913,0.0002625844,0.00015309129,0.0002195716,0.00012273225],"domain_scores_gemma":[0.9981673,0.0005180784,0.00054405926,0.00060171663,0.000085095424,0.00008376432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002969275,0.00011468135,0.00018690803,0.00008033489,0.0005775093,0.00025351823,0.0009651737,0.000056120876,0.0000073799447],"category_scores_gemma":[0.0001058637,0.0000733705,0.00008905469,0.00012574357,0.0002510468,0.00023487932,0.00022891248,0.00024169513,2.2634397e-7],"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.0000091587335,0.000023812541,0.0009462793,0.000013913617,0.000028471884,9.100539e-7,0.00016186654,0.0000067115357,0.00021045297,0.9937739,0.00008230788,0.0047422447],"study_design_scores_gemma":[0.00023925115,0.00020790406,0.028303456,0.000033184555,0.000022457027,0.00001620995,0.000039272094,0.00036194563,0.00059743295,0.9695349,0.000555171,0.00008887088],"about_ca_topic_score_codex":0.0000059525196,"about_ca_topic_score_gemma":0.0000015464566,"teacher_disagreement_score":0.10759345,"about_ca_system_score_codex":0.0000058335836,"about_ca_system_score_gemma":0.000021102955,"threshold_uncertainty_score":0.4441793},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.004648419889312304,"score_gpt":0.22453174188112726,"score_spread":0.21988332199181496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986162624","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.9042345,0.0011055792,0.093982056,0.00012577284,0.00014607164,0.00014194928,0.000013013986,0.000008756775,0.00024226717],"genre_scores_gemma":[0.99184555,0.00017180083,0.00793687,0.00001625953,0.000018388744,0.0000022027757,0.0000022547308,0.000004203535,0.0000024824901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913985,0.00005521532,0.00042497838,0.00012790189,0.00017015185,0.00008193618],"domain_scores_gemma":[0.99875116,0.00015722921,0.0006552623,0.00019584195,0.00018167589,0.000058850143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026168497,0.00009177596,0.00026052844,0.00016750475,0.00008174384,0.000052014835,0.00022112922,0.000054788878,0.0000050271783],"category_scores_gemma":[0.000020134641,0.000078137375,0.00006783378,0.00031111724,0.00011952068,0.00023979008,0.0000682631,0.00011464768,1.8824366e-7],"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.000015088435,0.000018589366,0.005308605,0.000041968462,0.000037027366,1.3499012e-7,0.00021598303,0.000010883116,0.0061058416,0.9792341,0.000008464283,0.009003327],"study_design_scores_gemma":[0.0006983017,0.00041209062,0.01894416,0.000048368805,0.000052185987,0.00009145516,0.00030755307,0.0005401902,0.008483881,0.9697919,0.0004961956,0.0001337027],"about_ca_topic_score_codex":0.00000547008,"about_ca_topic_score_gemma":5.2824697e-7,"teacher_disagreement_score":0.087611005,"about_ca_system_score_codex":0.000008124812,"about_ca_system_score_gemma":0.000040036946,"threshold_uncertainty_score":0.318635},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010209551175529859,"score_gpt":0.21508424569404885,"score_spread":0.204874694518519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022250425","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.9261686,0.0030566666,0.06828568,0.0009768964,0.00064144563,0.00044172365,0.000105635525,0.0001259449,0.0001974006],"genre_scores_gemma":[0.9986982,0.00008361718,0.00044464864,0.00019088149,0.0005301208,0.000010630126,0.000007807218,0.000029815175,0.000004282739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989395,0.0000530514,0.00044383382,0.00014657794,0.00021694257,0.00020006583],"domain_scores_gemma":[0.9992013,0.000084381165,0.00017316526,0.00013045374,0.00007265504,0.00033805717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001478868,0.00017738921,0.00032305467,0.00008774312,0.00016509056,0.00015668588,0.00025380315,0.00010561105,0.000010996636],"category_scores_gemma":[0.000037394584,0.00016089808,0.00010012729,0.00033564275,0.000033349505,0.00017813948,0.0000378108,0.00031270972,0.0000026770056],"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.00027914133,0.000114113194,0.0023825204,0.00017213525,0.0017192389,0.000042948188,0.006575616,0.020193925,0.0951921,0.83391833,0.035052985,0.0043569296],"study_design_scores_gemma":[0.0021204106,0.00055765023,0.016817793,0.000088518405,0.00030184485,0.000042296262,0.0010660486,0.005917097,0.005447851,0.9515619,0.015246655,0.00083187985],"about_ca_topic_score_codex":0.000008067628,"about_ca_topic_score_gemma":8.0776795e-7,"teacher_disagreement_score":0.1176436,"about_ca_system_score_codex":0.000052886848,"about_ca_system_score_gemma":0.00003004209,"threshold_uncertainty_score":0.6561233},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04255680671570617,"score_gpt":0.3246140440347098,"score_spread":0.2820572373190036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027070930","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.99238324,0.0022977437,0.0024552878,0.00035768963,0.00041189906,0.00074438343,0.00021243897,0.000027751046,0.001109538],"genre_scores_gemma":[0.9958289,0.0018967154,0.0018737118,0.00004080321,0.00015402028,0.00005631407,0.000040245526,0.00007210589,0.00003716872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693197,0.00024850038,0.0010028429,0.00044562042,0.001036024,0.00033503646],"domain_scores_gemma":[0.99502903,0.000909688,0.0020103029,0.0009994,0.00080488285,0.00024672115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006770252,0.0004610692,0.0011120714,0.00053340266,0.00023202678,0.00021245478,0.00092303404,0.000339514,0.00004885143],"category_scores_gemma":[0.00025017152,0.00038148568,0.0004688385,0.00047229548,0.00036326292,0.00011473032,0.0007240832,0.0017429873,6.9573105e-7],"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.00006239887,0.0001909095,0.0022295674,0.000840549,0.0003793875,0.000023142098,0.00052213663,0.000054082095,0.000281266,0.9946766,0.00022375814,0.0005162323],"study_design_scores_gemma":[0.00083364674,0.00017228539,0.0054098614,0.0004149843,0.00024505943,0.000091869355,0.0023926855,0.00004165009,0.0015799863,0.9883254,0.00016356533,0.00032901132],"about_ca_topic_score_codex":0.000022280565,"about_ca_topic_score_gemma":0.000015821843,"teacher_disagreement_score":0.006351176,"about_ca_system_score_codex":0.00010150276,"about_ca_system_score_gemma":0.00022371572,"threshold_uncertainty_score":0.9998637},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Czech; Axiom; Coding theory; Ring (chemistry); Point (geometry); Algebra over a field; Hamming code","score_opus":0.006840246102485028,"score_gpt":0.28036041194201633,"score_spread":0.2735201658395313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7013347212","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013822809,0.032651626,0.013418853,0.0008404508,0.018852912,0.0024632302,0.0021303408,0.00041556472,0.9290888],"genre_scores_gemma":[0.14503899,0.019544793,0.011086164,0.0003511154,0.1432466,0.00030375714,0.0005186466,0.007643541,0.67226636],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978853,0.000056923192,0.0005703187,0.0003745088,0.00076168944,0.00035130134],"domain_scores_gemma":[0.99510664,0.00007184737,0.003142909,0.0009935474,0.00029131724,0.0003937574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024509907,0.00051616906,0.00082503044,0.0005445262,0.0003676085,0.00030631345,0.001151886,0.0005309602,0.0002833159],"category_scores_gemma":[0.00008965156,0.00042106168,0.00028144632,0.00020275125,0.00036254886,0.00016287697,0.00020830605,0.0009482686,0.000053653523],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00001211293,0.00003269104,0.000046100857,0.000083924744,0.00020803782,0.000008089336,0.000025482917,0.000001748956,0.0000664387,0.16488703,0.8325634,0.0020649622],"study_design_scores_gemma":[0.00066072826,0.00007340524,0.00030190084,0.0001445681,0.00028690015,0.00010069298,0.000017778975,0.0000072259427,0.000027149386,0.16302396,0.83498365,0.00037203642],"about_ca_topic_score_codex":0.000046586745,"about_ca_topic_score_gemma":0.000021559112,"teacher_disagreement_score":0.2568224,"about_ca_system_score_codex":0.00011544785,"about_ca_system_score_gemma":0.00022689458,"threshold_uncertainty_score":0.9998241},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0048798319474413375,"score_gpt":0.27091859626333253,"score_spread":0.2660387643158912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7139166370","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015204857,0.023880877,0.03861339,0.0017229562,0.019038266,0.0028464522,0.0031361303,0.0005991307,0.91001076],"genre_scores_gemma":[0.089598946,0.016162934,0.009354063,0.00050476554,0.14945017,0.0003308585,0.00029165728,0.0083731115,0.7259335],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977265,0.00006948336,0.00071507366,0.00036339887,0.0007593404,0.000366203],"domain_scores_gemma":[0.99656963,0.000115819705,0.0020364046,0.0005980614,0.0002828833,0.00039721117],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021379918,0.0005036502,0.00073994225,0.0006243945,0.00016154365,0.00013324541,0.0007243536,0.00047688003,0.0011005217],"category_scores_gemma":[0.00004730884,0.00034916762,0.0002637903,0.0003238261,0.00028471387,0.00012977592,0.00015492033,0.00065790414,0.00017689468],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000012778462,0.00002694113,0.00003355874,0.000057181674,0.00016922707,0.000004391795,0.000018374996,5.286412e-7,0.00016150095,0.28306928,0.7147616,0.0016845872],"study_design_scores_gemma":[0.00070173957,0.000062526036,0.00013596361,0.00011639464,0.00019829339,0.000082613275,0.000017916285,0.0000020305918,0.00004356235,0.23358515,0.7647199,0.00033388153],"about_ca_topic_score_codex":0.000014104432,"about_ca_topic_score_gemma":0.000006883496,"teacher_disagreement_score":0.18407725,"about_ca_system_score_codex":0.0001425083,"about_ca_system_score_gemma":0.00019404344,"threshold_uncertainty_score":0.99989605},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Cayley graph; Mathematics; Hamiltonian (control theory); Combinatorics; Pure mathematics; Graph","score_opus":0.025252331728520826,"score_gpt":0.2979818062608756,"score_spread":0.2727294745323548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W918463335","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.9797321,0.000987794,0.014114491,0.0018533106,0.00026021324,0.000675125,0.00011800381,0.00006790577,0.002191082],"genre_scores_gemma":[0.9969647,0.0005315104,0.0018573054,0.000068713976,0.00015797158,0.000038480397,0.0000026293544,0.000053950127,0.0003247171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783236,0.00012678241,0.0007336311,0.000287137,0.000598792,0.00042127765],"domain_scores_gemma":[0.9969657,0.0008674162,0.0007594906,0.0005788869,0.00047617548,0.00035231077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064237614,0.00028208358,0.00048683898,0.00036451124,0.00035323808,0.00014483032,0.0006203501,0.0001674917,0.000104813786],"category_scores_gemma":[0.00033356724,0.00018257751,0.00019742028,0.00055713765,0.00028901067,0.00032971543,0.00019220806,0.0004537326,0.00000910613],"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.000049559043,0.00007882505,0.0033685886,0.00007683628,0.00010623894,0.000013201723,0.00015810724,5.8364196e-7,0.0013659542,0.99138105,0.0013002977,0.0021007333],"study_design_scores_gemma":[0.0010929174,0.00018067347,0.012160217,0.00009510793,0.000077459874,0.00015203007,0.00031729907,0.000009368285,0.000647789,0.9783647,0.006651834,0.00025060354],"about_ca_topic_score_codex":0.0000052138926,"about_ca_topic_score_gemma":0.0000070958913,"teacher_disagreement_score":0.017232647,"about_ca_system_score_codex":0.000088663735,"about_ca_system_score_gemma":0.00008360702,"threshold_uncertainty_score":0.7445295},"labels":[],"label_agreement":null}]}