{"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 <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"M1\"><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:math>-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":"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.96438664,0.0013558435,0.0016534603,0.00010284492,0.0046132086,0.000021066733,0.000038789094,0.000036744284,0.027791416],"genre_scores_gemma":[0.9984424,0.00030351116,0.0004144372,0.00012613529,0.0004685775,0.0000199027,0.000032116397,0.00012483413,0.0000680662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969412,0.00012138557,0.00090376526,0.0002599561,0.0013193897,0.00045428608],"domain_scores_gemma":[0.99743813,0.00037490434,0.001023689,0.00038293374,0.00044293035,0.00033738898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011408344,0.00028404497,0.0002178504,0.00032907835,0.00012988967,0.00026108063,0.0008683157,0.00040770572,0.0007494898],"category_scores_gemma":[0.00024690316,0.00037917847,0.00046512033,0.00033659875,0.00018529582,0.00050117593,0.00018478149,0.0007088847,0.00015908208],"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.00046857697,0.00019214799,0.00014068384,0.00028822708,0.0012221511,0.0007282116,0.0018091021,0.005426247,0.00066336227,0.98602694,0.0028079022,0.00022641843],"study_design_scores_gemma":[0.011104277,0.007478559,0.000748768,0.007756522,0.0021907242,0.0070281136,0.006948169,0.34052485,0.56076014,0.035283048,0.017714912,0.0024618981],"about_ca_topic_score_codex":0.00009309603,"about_ca_topic_score_gemma":0.00004045934,"teacher_disagreement_score":0.9507439,"about_ca_system_score_codex":0.000026753261,"about_ca_system_score_gemma":0.00035248318,"threshold_uncertainty_score":0.999866},"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":"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.70393753,0.0017702936,0.18857467,0.0009690377,0.016044613,0.00045897605,0.00009211193,0.000055338438,0.08809742],"genre_scores_gemma":[0.98202264,0.00035475413,0.016853284,0.000024217758,0.00024368444,0.0000021346414,0.0000016543394,0.000032603664,0.00046502164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634606,0.00013617663,0.0017691472,0.0001428171,0.0013848867,0.00022090912],"domain_scores_gemma":[0.9926813,0.0007965019,0.0029540795,0.00028564176,0.003140336,0.00014211159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010849099,0.00023878072,0.0005807885,0.00033440968,0.00004217692,0.0000393143,0.0012977858,0.00017306686,0.00043456646],"category_scores_gemma":[0.0021672794,0.00021058826,0.0003103781,0.00025607843,0.0003385539,0.0006706649,0.00015043606,0.0004360697,0.000033272067],"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.0002361495,0.0011047347,0.0014934762,0.00015290135,0.00045632242,0.00007931663,0.003403199,0.0000048886586,0.0010314886,0.9905398,0.00028899394,0.0012087153],"study_design_scores_gemma":[0.0008909076,0.00044082484,0.0014259161,0.0004984141,0.0001611723,0.00022850289,0.0013139335,0.00015024163,0.016264917,0.97768205,0.00075698004,0.00018614646],"about_ca_topic_score_codex":0.0000055935056,"about_ca_topic_score_gemma":9.197848e-7,"teacher_disagreement_score":0.2780851,"about_ca_system_score_codex":0.00022831919,"about_ca_system_score_gemma":0.0002614982,"threshold_uncertainty_score":0.85875404},"labels":[],"label_agreement":null},{"id":"W2032200582","doi":"10.1155/2010/851857","title":"Classification of Base Sequences BS(<i>n</i> + 1,<i>n</i>)","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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98332846,0.000160914,0.0018667959,0.00013673093,0.008895552,0.000035415498,0.000008097161,0.000024054947,0.0055439966],"genre_scores_gemma":[0.9995286,0.000056028224,0.00016235009,0.000014637012,0.00019103264,0.0000012996592,0.0000018722482,0.000010954391,0.00003326852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989673,0.000025184503,0.00045992844,0.000048617712,0.0004210942,0.00007790039],"domain_scores_gemma":[0.9989344,0.00008957569,0.00024793754,0.00010885492,0.0005595811,0.000059664435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004244402,0.000079956364,0.00014502331,0.00018853352,0.00001546035,0.000026202042,0.0004597415,0.00006702153,0.000041905645],"category_scores_gemma":[0.000077087905,0.00007252091,0.00010153888,0.0001339013,0.000048366062,0.00022957141,0.0000126151235,0.00027743753,0.0000066186244],"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.000042123036,0.00015607609,0.014790881,0.000041565498,0.00022193561,0.000044278877,0.00035904328,0.00085589435,0.41181383,0.56701684,0.0019081837,0.002749338],"study_design_scores_gemma":[0.0033198728,0.00038905034,0.03859415,0.00033853794,0.00011294753,0.0012392575,0.00082260673,0.010151123,0.39283237,0.4909642,0.06054943,0.00068645447],"about_ca_topic_score_codex":0.0000023835155,"about_ca_topic_score_gemma":0.0000022153763,"teacher_disagreement_score":0.07605265,"about_ca_system_score_codex":0.000030091322,"about_ca_system_score_gemma":0.00003608066,"threshold_uncertainty_score":0.2957317},"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":"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.9609291,0.0006800646,0.0011001576,0.005142169,0.010166698,0.00062453054,0.000106243235,0.00004169657,0.021209335],"genre_scores_gemma":[0.99407226,0.0005847772,0.0003473105,0.0005326551,0.00054002134,0.000014427002,0.0000071789805,0.00011085728,0.0037904985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928692,0.0004842186,0.0014477429,0.0003707686,0.004157607,0.0006704581],"domain_scores_gemma":[0.990416,0.0031004285,0.0015776877,0.0006655137,0.0037324692,0.0005079315],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019589602,0.0005218061,0.00076359895,0.0012117953,0.00015874954,0.0009374143,0.0026218789,0.0003739779,0.0018547287],"category_scores_gemma":[0.0024873046,0.0004614396,0.00067113974,0.0003259762,0.00025522866,0.0008085013,0.0004064418,0.0018489538,0.0009936017],"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.00060732977,0.0025540923,0.0078037805,0.00011718691,0.0013674205,0.0010447213,0.0028865018,0.000044477805,0.0005821017,0.94794935,0.028332423,0.006710612],"study_design_scores_gemma":[0.0036873228,0.0012881759,0.0063695,0.0009542923,0.000105221894,0.0004437798,0.0010522655,0.00060908194,0.0032156254,0.97494596,0.0067897746,0.0005390147],"about_ca_topic_score_codex":0.000066742025,"about_ca_topic_score_gemma":0.000006226111,"teacher_disagreement_score":0.03314317,"about_ca_system_score_codex":0.00083445536,"about_ca_system_score_gemma":0.00035285563,"threshold_uncertainty_score":0.99978423},"labels":[],"label_agreement":null},{"id":"W2114080680","doi":"10.1155/2011/206930","title":"Cayley Graphs of Order <i>27p</i> 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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9403405,0.0051089693,0.0025368526,0.00016634115,0.028637966,0.00016558287,0.000080102094,0.000041385727,0.022922283],"genre_scores_gemma":[0.9985201,0.0006752198,0.00021677454,0.00004871938,0.00021230483,0.0000018562919,0.0000024256285,0.00004932885,0.0002732748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972056,0.00012893388,0.0012838459,0.0001480751,0.00096426776,0.00026923598],"domain_scores_gemma":[0.996028,0.00011191261,0.0012189264,0.0002707784,0.0021794117,0.0001909512],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070317875,0.00029078382,0.00056574296,0.00060244504,0.000043705648,0.000048135968,0.0011829564,0.0002133238,0.0002155704],"category_scores_gemma":[0.0001484861,0.00028641216,0.00040928627,0.0004869728,0.0001114147,0.00036885572,0.000081683145,0.0005682796,0.000030434046],"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.0005085391,0.0014774416,0.06833214,0.00034956445,0.003488678,0.0010263451,0.0071882294,0.0009007226,0.0029128261,0.9078631,0.0042219395,0.0017304937],"study_design_scores_gemma":[0.0094235875,0.0016500792,0.089612536,0.004284556,0.0007658944,0.0021982754,0.004700646,0.0010311411,0.045420345,0.7986896,0.040503852,0.0017194687],"about_ca_topic_score_codex":0.000056554392,"about_ca_topic_score_gemma":0.000008187324,"teacher_disagreement_score":0.109173454,"about_ca_system_score_codex":0.00013811702,"about_ca_system_score_gemma":0.000109714274,"threshold_uncertainty_score":0.9999588},"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":"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.95888793,0.0043405383,0.018824864,0.0010168952,0.0142036425,0.00016730672,0.00005927247,0.000080939135,0.002418583],"genre_scores_gemma":[0.9984739,0.0007003336,0.00030867892,0.000018407034,0.0003511347,0.0000027292997,5.0615625e-7,0.000011807202,0.00013250674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909675,0.000019279889,0.00040963048,0.0000761071,0.00028159085,0.00011661879],"domain_scores_gemma":[0.9990197,0.0003717661,0.0001865486,0.00007445475,0.0002791045,0.00006843759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043202023,0.00009138458,0.00014469105,0.00015261436,0.000030822343,0.00005381744,0.00032765177,0.000044643497,0.0000015037532],"category_scores_gemma":[0.00016082994,0.000064763495,0.00007130092,0.000059001082,0.000032078053,0.0003942809,0.000022607728,0.00007289676,0.0000035411006],"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.00031410024,0.00007304446,0.0013465263,0.000099307144,0.00033191175,0.00008148099,0.0005454574,0.00023931812,0.00829756,0.97932196,0.0016353545,0.0077139926],"study_design_scores_gemma":[0.0063542947,0.0004894474,0.002565902,0.0013072551,0.00006614361,0.0006405196,0.00024902122,0.0021029066,0.011237476,0.94070256,0.033805262,0.00047919923],"about_ca_topic_score_codex":7.1340287e-7,"about_ca_topic_score_gemma":2.138943e-7,"teacher_disagreement_score":0.039585937,"about_ca_system_score_codex":0.00007455025,"about_ca_system_score_gemma":0.00001567155,"threshold_uncertainty_score":0.26409787},"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":"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.8497425,0.00046373217,0.13762516,0.0008198671,0.0066650873,0.00006403528,0.0000090903295,0.0000874188,0.0045231283],"genre_scores_gemma":[0.99877155,0.00002095016,0.00018316807,0.0000088406805,0.00047479017,5.691423e-7,4.4433898e-7,0.000014926409,0.0005247703],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909425,0.00003612917,0.00036622598,0.000045839024,0.0003600145,0.00009757125],"domain_scores_gemma":[0.9990674,0.000405562,0.00012464152,0.00008021725,0.00021220437,0.00010993667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027561805,0.0000822632,0.00012712227,0.00019648361,0.000019475945,0.00003028398,0.00037086342,0.000060596107,0.000031780124],"category_scores_gemma":[0.00014795543,0.00005986577,0.00009674536,0.00011093869,0.00001226536,0.00023381201,0.000014284807,0.00012745302,0.000044234952],"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.000041095453,0.00004558474,0.49686778,0.000013563778,0.00043747356,0.000081808765,0.0003155421,0.00041180264,0.0022263862,0.47372472,0.018074753,0.007759473],"study_design_scores_gemma":[0.0025208483,0.00016027014,0.1718499,0.00033833834,0.000058434223,0.00030906187,0.00003919475,0.00003413636,0.006844514,0.7792052,0.038345926,0.0002941401],"about_ca_topic_score_codex":0.0000010516477,"about_ca_topic_score_gemma":2.6468632e-7,"teacher_disagreement_score":0.32501787,"about_ca_system_score_codex":0.00011736926,"about_ca_system_score_gemma":0.000041707208,"threshold_uncertainty_score":0.24412555},"labels":[],"label_agreement":null}]}