{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72275555,0.0017196843,0.20995013,0.0038127385,0.0002411718,0.00014630334,0.00039626,0.00016334273,0.060814753],"genre_scores_gemma":[0.975233,0.00097399525,0.018826254,0.00033255437,0.00042918717,0.00005604961,0.0005752346,0.0000660592,0.0035076255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613684,0.0012234551,0.0002991665,0.0007017863,0.0010387643,0.0005999712],"domain_scores_gemma":[0.97923,0.015610813,0.0015175729,0.0017132777,0.0013302336,0.0005981529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003260693,0.0003769698,0.00084980135,0.0017019528,0.001898282,0.0026970035,0.0013177972,0.0017735013,0.004397976],"category_scores_gemma":[0.020554833,0.00036593157,0.0006943148,0.0015441513,0.0048021236,0.011975747,0.0027946862,0.002791694,0.00046893876],"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.00030843323,0.00012641739,0.002334287,0.000097926575,0.000016381568,0.00021823644,0.0011157339,0.006360656,0.0019162875,0.9521943,0.001121386,0.034189858],"study_design_scores_gemma":[0.000026833197,0.00008176794,0.0007115411,0.000034070606,0.000011472854,0.00025045505,0.00034932946,0.013387944,0.001817314,0.9806317,0.0026781019,0.000019529089],"about_ca_topic_score_codex":0.0010471715,"about_ca_topic_score_gemma":0.0005320163,"teacher_disagreement_score":0.004397976,"about_ca_system_score_codex":0.0013825248,"about_ca_system_score_gemma":0.00095228694,"threshold_uncertainty_score":0.017244339},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60544574,0.0003570876,0.36472112,0.00044341883,0.00012751909,0.00012581848,0.00062155584,0.0004952968,0.02766244],"genre_scores_gemma":[0.8612135,0.00035892482,0.12902297,0.0001229179,0.00004647732,0.00013438454,0.00077079085,0.00012896892,0.008200958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939585,0.00015336457,0.0000507079,0.00007828271,0.00017476008,0.00014702862],"domain_scores_gemma":[0.99892646,0.0003616945,0.00013119397,0.0002427156,0.00018779878,0.00015007949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039225785,0.00040189648,0.00042204035,0.0010473422,0.0008264324,0.0011516195,0.0007710841,0.000480893,0.0031199167],"category_scores_gemma":[0.0018176957,0.0003094002,0.0004407556,0.0010506565,0.0011020714,0.0014447268,0.0015853908,0.0010055553,0.0008224961],"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.00017901306,0.00007733217,0.0023935128,0.00016101982,0.000012341575,0.00034350404,0.00060980435,0.014170577,0.031271435,0.8896823,0.0020238645,0.05907539],"study_design_scores_gemma":[0.000052586718,0.00026361828,0.0014276126,0.00011331725,0.000031514963,0.0014750905,0.00041168582,0.15715936,0.06747374,0.75522953,0.016246242,0.00011573023],"about_ca_topic_score_codex":0.00040457133,"about_ca_topic_score_gemma":0.0006011672,"teacher_disagreement_score":0.0031199167,"about_ca_system_score_codex":0.00071211846,"about_ca_system_score_gemma":0.0008878802,"threshold_uncertainty_score":0.010437131},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17579864,0.0012563686,0.7233517,0.0020439273,0.00023381448,0.00011860267,0.00066735037,0.0008789581,0.095650606],"genre_scores_gemma":[0.837162,0.00079912296,0.13859653,0.0006225318,0.00032400488,0.00032140577,0.00063619384,0.000491657,0.021046381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970386,0.00065541425,0.00016438917,0.00054457405,0.00082853506,0.0007684765],"domain_scores_gemma":[0.99257517,0.0041955905,0.000890502,0.0009001702,0.0006973561,0.0007411253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039105066,0.0010862547,0.0010444144,0.0014486016,0.0015251553,0.0043878597,0.0016531219,0.0012452572,0.013179291],"category_scores_gemma":[0.011764564,0.0007415932,0.0014795638,0.0015552901,0.0033528318,0.0065303277,0.002993495,0.0030629113,0.0016541871],"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.00024892227,0.00005611644,0.0005221012,0.00014127868,0.000017042736,0.00013108815,0.00028614295,0.020166108,0.0028228331,0.9636374,0.0021226301,0.009848329],"study_design_scores_gemma":[0.0000577641,0.00022206218,0.00039301976,0.00010551771,0.00004825285,0.00020215118,0.00018133732,0.1322983,0.006280117,0.8512739,0.008878292,0.000059311962],"about_ca_topic_score_codex":0.001504223,"about_ca_topic_score_gemma":0.0012903466,"teacher_disagreement_score":0.013179291,"about_ca_system_score_codex":0.003533861,"about_ca_system_score_gemma":0.0016455294,"threshold_uncertainty_score":0.04408914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89016926,0.00070951146,0.06104885,0.0016800744,0.00016717544,0.000067731475,0.00033420106,0.00035467895,0.045468513],"genre_scores_gemma":[0.9696679,0.00036008976,0.020119987,0.00030232337,0.000052202802,0.00005818331,0.0007487079,0.00008863768,0.008601926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954516,0.000124802,0.000017617023,0.00011606961,0.00012364598,0.000072622315],"domain_scores_gemma":[0.9979831,0.0007606901,0.00028776453,0.000283984,0.00035378902,0.00033061183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036740824,0.00038784067,0.00031216553,0.0011756255,0.0017137562,0.0015631194,0.00081740064,0.0011298319,0.0036386843],"category_scores_gemma":[0.0025933094,0.000495467,0.0005313671,0.0006497509,0.0019837231,0.0022968648,0.00096292875,0.0013375826,0.00024299943],"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.000118988035,0.000062090105,0.0038632434,0.000081383034,0.000026122827,0.0021102955,0.0016133985,0.0039833584,0.0090974085,0.9653828,0.003320754,0.010340134],"study_design_scores_gemma":[0.00007343621,0.00008618689,0.0062665534,0.00010910224,0.000055564564,0.0033869902,0.0026129412,0.029452665,0.0080213025,0.9175039,0.032365523,0.000065849206],"about_ca_topic_score_codex":0.00202497,"about_ca_topic_score_gemma":0.002688333,"teacher_disagreement_score":0.0036386843,"about_ca_system_score_codex":0.0010931226,"about_ca_system_score_gemma":0.0004907271,"threshold_uncertainty_score":0.012172639},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011192349,0.0043738442,0.0003600699,0.09359557,0.8758943,0.00006397956,0.00066897256,0.0002928663,0.024638543],"genre_scores_gemma":[0.0021378587,0.0076980535,0.00086256006,0.12853527,0.55612975,0.00014831622,0.00092755485,0.0005000263,0.3030606],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996104,0.00033948533,0.0003880956,0.0008938171,0.0018800298,0.0003945354],"domain_scores_gemma":[0.9862221,0.0021067571,0.0007251998,0.00084149046,0.0074421717,0.0026622508],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0037087009,0.0015984563,0.001392315,0.0018709537,0.0020922748,0.0070297825,0.003427395,0.0072278045,0.21580122],"category_scores_gemma":[0.023569003,0.0005747574,0.0014876882,0.0015717997,0.0010228213,0.0050089653,0.0025312172,0.0073806015,0.14432836],"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.00001234891,0.000006017047,0.000023622866,0.00006923455,0.0000021434892,0.000031038406,0.000009751889,0.000008180538,0.000047488105,0.00034914847,0.99191916,0.007521937],"study_design_scores_gemma":[0.0000065503855,0.00000602374,0.00007774967,0.00006552457,0.0000023696064,0.00004833322,0.000017998973,0.000015463895,0.00004822764,0.00022751131,0.9994803,0.000003928442],"about_ca_topic_score_codex":0.0014477342,"about_ca_topic_score_gemma":0.0029596514,"teacher_disagreement_score":0.78419876,"about_ca_system_score_codex":0.001979645,"about_ca_system_score_gemma":0.0044028563,"threshold_uncertainty_score":0.72192705},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016089491,0.0054365797,0.0005947174,0.13212043,0.8281404,0.000065330096,0.00074807386,0.00027848242,0.032455128],"genre_scores_gemma":[0.0028743844,0.0077358917,0.0010998101,0.10870882,0.46488562,0.00010803842,0.0007365729,0.00042003454,0.4134309],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967614,0.00025798279,0.0003356487,0.00073161063,0.0015995367,0.0003138619],"domain_scores_gemma":[0.9868717,0.0018163172,0.00054606824,0.000628512,0.0073893676,0.0027479634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00331794,0.0013573484,0.0012581438,0.0014645172,0.0018391921,0.0058618723,0.0025609182,0.0058641485,0.17228702],"category_scores_gemma":[0.02061021,0.0004516586,0.0011778958,0.0011839692,0.00078692957,0.004676577,0.0020182792,0.0062231175,0.10492806],"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.000009131002,0.0000050892054,0.000026093545,0.00004711176,0.0000017138361,0.000031355914,0.000010542091,0.000009690615,0.000044553963,0.00058017875,0.9912646,0.007969965],"study_design_scores_gemma":[0.0000044588564,0.000004674838,0.00005907247,0.000040452393,0.0000017210433,0.000056450514,0.000015938505,0.000021037884,0.00004593164,0.00031855406,0.99942833,0.0000033498989],"about_ca_topic_score_codex":0.001268063,"about_ca_topic_score_gemma":0.0032390421,"teacher_disagreement_score":0.17228702,"about_ca_system_score_codex":0.00170332,"about_ca_system_score_gemma":0.0041371514,"threshold_uncertainty_score":0.5763575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9347481,0.00031053313,0.032550566,0.00090168585,0.00007031544,0.00004096233,0.00016959869,0.00020887033,0.030999372],"genre_scores_gemma":[0.98430055,0.00012452812,0.010085904,0.00022201508,0.00003681606,0.00006222711,0.00036362253,0.00003070054,0.004773649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994842,0.00011217318,0.000029477202,0.00014706083,0.00010817186,0.00011891917],"domain_scores_gemma":[0.998444,0.000751118,0.00024119255,0.00023016048,0.00013104024,0.00020248059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034398568,0.00042075125,0.0003655679,0.000704315,0.0017168875,0.0016720918,0.000791659,0.0009115526,0.005668653],"category_scores_gemma":[0.0021279855,0.00035924517,0.00064578775,0.0006245099,0.0022321725,0.0021946735,0.0015176731,0.0010455179,0.00042152367],"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.00017464928,0.00010628411,0.0023232736,0.00015440963,0.00006307223,0.0010012832,0.0016318524,0.0053211055,0.010705002,0.9580385,0.002744182,0.017736351],"study_design_scores_gemma":[0.00006775442,0.000052246825,0.0006336313,0.000020021675,0.00003983651,0.00040366693,0.00054347434,0.012720777,0.006416503,0.972064,0.0070112287,0.000026734611],"about_ca_topic_score_codex":0.00060118467,"about_ca_topic_score_gemma":0.0013623922,"teacher_disagreement_score":0.005668653,"about_ca_system_score_codex":0.00079207926,"about_ca_system_score_gemma":0.00053934264,"threshold_uncertainty_score":0.018963516},"labels":[],"label_agreement":null}]}