{"meta":{"query_hash":"39cec85fb1fd","filters":{"venue":"International Journal of Combinatorics"},"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/39cec85fb1fd","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Combinatorics"},"results":[{"id":"W1679611287","doi":"10.1155/2015/528083","title":"Starter Labelling of k-Windmill Graphs with Small Defects","year":2015,"lang":"lv","type":"article","venue":"International Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Algorithm; Artificial intelligence; Computer science","score_opus":0.018822687982401817,"score_gpt":0.2232062879342021,"score_spread":0.20438359995180028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1679611287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04550624,0.00034048062,0.5012119,0.0017667457,0.0025960603,0.00060464954,0.016523983,0.021102032,0.41034794],"genre_scores_gemma":[0.21934812,0.0006377805,0.25345492,0.0010765529,0.00027455448,0.00073128316,0.030358175,0.013941273,0.48017722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999406,0.00011117728,0.00003492921,0.00014248923,0.00019112787,0.00011432309],"domain_scores_gemma":[0.99872893,0.00029205382,0.00007995432,0.00044818007,0.00033868596,0.00011213022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047969533,0.0008777856,0.0006597699,0.0011103684,0.0012388981,0.0017581853,0.0012319648,0.0009558043,0.0915703],"category_scores_gemma":[0.0019006749,0.0005122162,0.0007659376,0.0010703406,0.0008578962,0.0023964208,0.001274248,0.0019029113,0.038490366],"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.00077066285,0.00021736386,0.0006887276,0.0005202627,0.000028580018,0.0006397126,0.0007770088,0.004143948,0.03379222,0.54529524,0.27312255,0.14000382],"study_design_scores_gemma":[0.00008345253,0.00013866274,0.0008104468,0.00011904568,0.00002869989,0.0002701952,0.0002834066,0.0063188337,0.04083367,0.20353507,0.74749327,0.000085313084],"about_ca_topic_score_codex":0.0019638306,"about_ca_topic_score_gemma":0.004610852,"teacher_disagreement_score":0.0915703,"about_ca_system_score_codex":0.00091925275,"about_ca_system_score_gemma":0.0008449672,"threshold_uncertainty_score":0.30633318},"labels":[],"label_agreement":null},{"id":"W2026188069","doi":"10.1155/2011/937941","title":"Classification of Normal Sequences","year":2011,"lang":"lv","type":"article","venue":"International Journal of Combinatorics","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":1,"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; Compute Canada","keywords":"Algorithm; Computer science","score_opus":0.0851218003877353,"score_gpt":0.3392077157781097,"score_spread":0.2540859153903744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026188069","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.3186565,0.0041713705,0.47633013,0.0042280327,0.002718426,0.0007968439,0.021261396,0.010498542,0.16133867],"genre_scores_gemma":[0.62831026,0.00269389,0.17740428,0.0010384162,0.0015014954,0.0006235832,0.07455672,0.0021116312,0.111759715],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728155,0.00034380917,0.00030742664,0.00072121766,0.0009482529,0.00039770268],"domain_scores_gemma":[0.993512,0.0017663636,0.00060994196,0.00085613935,0.002678922,0.0005766339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010742162,0.001111099,0.0009651194,0.006201515,0.0018334971,0.004160422,0.0011666373,0.001431751,0.019742373],"category_scores_gemma":[0.010432329,0.0004405273,0.0009630651,0.0035719278,0.0020865113,0.004494378,0.0016972035,0.0021041026,0.01148008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.0009236616,0.000310617,0.013496927,0.0007309503,0.00005574991,0.0012483585,0.0016810454,0.0056732986,0.013659949,0.40374205,0.076908916,0.48156843],"study_design_scores_gemma":[0.00008581855,0.00030937386,0.0057938695,0.00033529574,0.00006159418,0.002850574,0.0011910711,0.07593133,0.013820693,0.69506884,0.20444867,0.000102793],"about_ca_topic_score_codex":0.0038367677,"about_ca_topic_score_gemma":0.0020950094,"teacher_disagreement_score":0.019742373,"about_ca_system_score_codex":0.0022057488,"about_ca_system_score_gemma":0.0016154243,"threshold_uncertainty_score":0.06604481},"labels":[],"label_agreement":null},{"id":"W2032200582","doi":"10.1155/2010/851857","title":"Classification of Base Sequences BS(n + 1,n)","year":2010,"lang":"en","type":"article","venue":"International Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"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; Compute Canada","keywords":"Mathematics; Conjecture; Combinatorics; Base (topology); Hadamard transform; Equivalence (formal languages); Equivalence relation; Monotonic function; Sequence (biology); Discrete mathematics; Mathematical analysis","score_opus":0.009034156212700232,"score_gpt":0.22968156833038914,"score_spread":0.2206474121176889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032200582","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.924073,0.000998789,0.031782787,0.00029603794,0.0001334989,0.00015529891,0.0032539447,0.00044904562,0.038857564],"genre_scores_gemma":[0.95980066,0.0007171824,0.025427174,0.00012651292,0.00007618831,0.00020135757,0.0061700945,0.0001275745,0.0073532686],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934095,0.00008821237,0.000079617275,0.000119099146,0.00020398162,0.00016816249],"domain_scores_gemma":[0.99708766,0.0011022199,0.00043428183,0.0003296493,0.00065683504,0.00038930107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060204504,0.00039254047,0.00033103616,0.0030284252,0.00096820376,0.0012128345,0.0006463154,0.0007194613,0.0061634807],"category_scores_gemma":[0.0032612665,0.00017363287,0.00027682984,0.0017514878,0.00094525877,0.001385346,0.0007081807,0.0008074639,0.001111224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.0023317903,0.0006935437,0.08819255,0.00072617596,0.000091422,0.001431923,0.0021495363,0.0091617815,0.105753325,0.36827785,0.014872312,0.40631774],"study_design_scores_gemma":[0.00029020524,0.0015469901,0.1096208,0.00047970662,0.00014166691,0.0059594847,0.0032841011,0.08848378,0.124933824,0.5231445,0.14187507,0.00023988145],"about_ca_topic_score_codex":0.0006705933,"about_ca_topic_score_gemma":0.00048042863,"teacher_disagreement_score":0.0061634807,"about_ca_system_score_codex":0.00060523895,"about_ca_system_score_gemma":0.0006284407,"threshold_uncertainty_score":0.020618916},"labels":[],"label_agreement":null},{"id":"W2107465763","doi":"10.1155/2013/725809","title":"On Cayley Digraphs That Do Not Have Hamiltonian Paths","year":2013,"lang":"lv","type":"article","venue":"International Journal of Combinatorics","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":"Australian Research Council","keywords":"Algorithm; Artificial intelligence; Computer science","score_opus":0.04671005731414036,"score_gpt":0.3225066968918635,"score_spread":0.27579663957772316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107465763","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.36673856,0.0011540003,0.42334825,0.0019547513,0.00048805415,0.00030050887,0.004731313,0.0019356514,0.19934888],"genre_scores_gemma":[0.82527316,0.00094163103,0.08102323,0.0009499926,0.00009440116,0.00030203804,0.006044498,0.00052483863,0.08484612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992084,0.00015858204,0.000045511057,0.00022859345,0.0001505419,0.00020844779],"domain_scores_gemma":[0.99721044,0.0016016848,0.00020726008,0.0003378424,0.00033742908,0.00030547506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066780084,0.0010430908,0.00058055273,0.0012098962,0.0017383603,0.0022431188,0.0010209832,0.00091057905,0.01724685],"category_scores_gemma":[0.0032575112,0.0008493796,0.0012502231,0.0012484893,0.001298815,0.0032922002,0.0016155472,0.0017835278,0.0025866097],"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.0001753044,0.00011681122,0.0009963642,0.00024701146,0.00006363854,0.0007472243,0.00035687283,0.020730995,0.003114296,0.94537103,0.009700823,0.018379632],"study_design_scores_gemma":[0.0000797545,0.00006306808,0.00042694903,0.000064194035,0.000044856515,0.00025669043,0.00017054402,0.04047948,0.0021843193,0.93844646,0.01775185,0.00003166874],"about_ca_topic_score_codex":0.0037723945,"about_ca_topic_score_gemma":0.0077417805,"teacher_disagreement_score":0.01724685,"about_ca_system_score_codex":0.0020884373,"about_ca_system_score_gemma":0.0009625,"threshold_uncertainty_score":0.05769646},"labels":[],"label_agreement":null},{"id":"W2114080680","doi":"10.1155/2011/206930","title":"Cayley Graphs of Order 27p Are Hamiltonian","year":2011,"lang":"lv","type":"article","venue":"International Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"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 Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Artificial intelligence; Computer science","score_opus":0.016780788610991342,"score_gpt":0.21359947469598076,"score_spread":0.19681868608498942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114080680","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.53736985,0.0006510579,0.12755081,0.0034322527,0.00073320785,0.0004887726,0.0037497375,0.0016636209,0.32436076],"genre_scores_gemma":[0.90277976,0.0006119941,0.020487366,0.0013383598,0.00018229398,0.0002597325,0.002709991,0.00024659763,0.071383946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993643,0.000085021435,0.000024638995,0.00014681899,0.0001249696,0.00025417935],"domain_scores_gemma":[0.9984888,0.0004805989,0.00028417967,0.0001949182,0.00026901482,0.00028257977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035193164,0.00063245476,0.00047456648,0.00078049727,0.0015982707,0.0019981756,0.00078774814,0.0008027626,0.026753925],"category_scores_gemma":[0.0016597781,0.000605875,0.0006701618,0.00079276913,0.0013665324,0.00216247,0.0008619887,0.0012381715,0.0032077895],"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.00018016399,0.00014329432,0.0011293417,0.00018410131,0.000061898136,0.0013159394,0.0005504339,0.0028748736,0.008484881,0.95285994,0.021292774,0.010922341],"study_design_scores_gemma":[0.00018916307,0.00011569174,0.0014832147,0.00003995303,0.00004050444,0.00087770016,0.00062475214,0.0121593615,0.006941167,0.9481939,0.029274654,0.00005981483],"about_ca_topic_score_codex":0.0025065492,"about_ca_topic_score_gemma":0.003879028,"teacher_disagreement_score":0.026753925,"about_ca_system_score_codex":0.0012366576,"about_ca_system_score_gemma":0.001263149,"threshold_uncertainty_score":0.089500844},"labels":[],"label_agreement":null},{"id":"W2276998446","doi":"10.1155/2016/2162849","title":"Some Nonexistence and Asymptotic Existence Results for Weighing Matrices","year":2016,"lang":"en","type":"article","venue":"International Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"University of Lethbridge","keywords":"Algorithm; Computer science; Artificial intelligence; Mathematics","score_opus":0.010831190863685116,"score_gpt":0.2323785495239046,"score_spread":0.2215473586602195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276998446","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.14258775,0.0029704268,0.7716571,0.0033508097,0.00051474693,0.000112085094,0.00029684487,0.00052243477,0.07798781],"genre_scores_gemma":[0.8356058,0.004093147,0.12452819,0.0014531497,0.0014069648,0.00056881795,0.00070721103,0.00036821177,0.031268556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964445,0.0012060215,0.00019184231,0.0008041573,0.00091259717,0.00044082908],"domain_scores_gemma":[0.9665772,0.025274325,0.0021231037,0.0019107751,0.0029390187,0.0011755738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040643355,0.0016275559,0.0011971074,0.0024220773,0.0020647105,0.002390383,0.0018215576,0.002149918,0.008445379],"category_scores_gemma":[0.041430995,0.0012513328,0.0019810419,0.0016913555,0.0047500166,0.0073638908,0.0043710475,0.005921451,0.0016833111],"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.00011378362,0.00009145501,0.001270801,0.00027692525,0.00005069358,0.00032312056,0.00049742055,0.0097494945,0.005406539,0.9607713,0.0037921818,0.017656209],"study_design_scores_gemma":[0.00003528851,0.00014417077,0.0005750355,0.0001131959,0.000046751014,0.0006741369,0.00024801056,0.08781356,0.0036141842,0.90064096,0.0060180305,0.000076634264],"about_ca_topic_score_codex":0.0004815501,"about_ca_topic_score_gemma":0.00039865574,"teacher_disagreement_score":0.008445379,"about_ca_system_score_codex":0.0014157845,"about_ca_system_score_gemma":0.0010626748,"threshold_uncertainty_score":0.028252602},"labels":[],"label_agreement":null},{"id":"W2480068526","doi":"10.1155/2016/7092474","title":"A New Relationship between Block Designs","year":2016,"lang":"en","type":"article","venue":"International Journal of Combinatorics","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":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Sherbrooke","keywords":"Block (permutation group theory); Set (abstract data type); Computer science; Algorithm; Order (exchange); Type (biology); Mathematics; Combinatorics","score_opus":0.0327433514048982,"score_gpt":0.2546510512809855,"score_spread":0.22190769987608727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480068526","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.09300414,0.00031818534,0.869261,0.00025803066,0.000096051815,0.00017367028,0.00022936267,0.00047770428,0.036181793],"genre_scores_gemma":[0.48760074,0.00051014754,0.47582918,0.00027642061,0.0001813959,0.0004345119,0.0004495234,0.00031461185,0.034403462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738735,0.0008657293,0.00014987712,0.00063539244,0.0006743175,0.00028733886],"domain_scores_gemma":[0.9957461,0.0014555774,0.0004893389,0.0012020768,0.00076505996,0.00034197854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001550604,0.0004873684,0.0005335161,0.0012159003,0.002098782,0.0017689451,0.00081468525,0.0009148791,0.010451209],"category_scores_gemma":[0.004636011,0.00081369106,0.0009311793,0.0011403918,0.0014921856,0.004871535,0.002394781,0.0014526693,0.0018662801],"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.00010104806,0.00007330631,0.001656665,0.00009724168,0.000024767356,0.00031824928,0.0010342693,0.0030785282,0.008811791,0.91592807,0.002087726,0.066788234],"study_design_scores_gemma":[0.0000700703,0.00081235514,0.0019331661,0.00009382678,0.0001182992,0.002219405,0.0006248402,0.037702147,0.02187739,0.75497717,0.17947918,0.00009213151],"about_ca_topic_score_codex":0.00077702606,"about_ca_topic_score_gemma":0.0010944512,"teacher_disagreement_score":0.010451209,"about_ca_system_score_codex":0.0008718216,"about_ca_system_score_gemma":0.00079757994,"threshold_uncertainty_score":0.034962714},"labels":[],"label_agreement":null}]}