{"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"},"query_hash":"39cec85fb1fd","filters":{"venue":"International Journal of Combinatorics"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Artificial intelligence; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01678078861099134,"gpt":0.2135994746959808,"spread":0.1968186860849894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007031788,0.0002907838,0.000565743,0.000602445,0.00004370565,0.00004813597,0.001182956,0.0002133238,0.0002155704],"category_scores_gemma":[0.0001484861,0.0002864122,0.0004092863,0.0004869728,0.0001114147,0.0003688557,0.00008168315,0.0005682796,0.00003043405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000138117,"about_ca_system_score_gemma":0.0001097143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005655439,"about_ca_topic_score_gemma":0.000008187324,"domain_scores_codex":[0.9972056,0.0001289339,0.001283846,0.0001480751,0.0009642678,0.000269236],"domain_scores_gemma":[0.996028,0.0001119126,0.001218926,0.0002707784,0.002179412,0.0001909512],"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.0005085391,0.001477442,0.06833214,0.0003495644,0.003488678,0.001026345,0.007188229,0.0009007226,0.002912826,0.9078631,0.004221939,0.001730494],"study_design_scores_gemma":[0.009423587,0.001650079,0.08961254,0.004284556,0.0007658944,0.002198275,0.004700646,0.001031141,0.04542034,0.7986896,0.04050385,0.001719469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9403405,0.005108969,0.002536853,0.0001663412,0.02863797,0.0001655829,0.00008010209,0.00004138573,0.02292228],"genre_scores_gemma":[0.9985201,0.0006752198,0.0002167745,0.00004871938,0.0002123048,0.000001856292,0.000002425629,0.00004932885,0.0002732748],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1091735,"threshold_uncertainty_score":0.9999588,"prediction_status":"machine_predicted_unvalidated"},"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,"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; Compute Canada","keywords":"Mathematics; Conjecture; Combinatorics; Base (topology); Hadamard transform; Equivalence (formal languages); Equivalence relation; Monotonic function; Sequence (biology); Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.009034156212700232,"gpt":0.2296815683303891,"spread":0.2206474121176889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004244402,0.00007995636,0.0001450233,0.0001885335,0.00001546035,0.00002620204,0.0004597415,0.00006702153,0.00004190565],"category_scores_gemma":[0.00007708791,0.00007252091,0.0001015389,0.0001339013,0.00004836606,0.0002295714,0.00001261512,0.0002774375,0.000006618624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003009132,"about_ca_system_score_gemma":0.00003608066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002383515,"about_ca_topic_score_gemma":0.000002215376,"domain_scores_codex":[0.9989673,0.0000251845,0.0004599284,0.00004861771,0.0004210942,0.00007790039],"domain_scores_gemma":[0.9989344,0.00008957569,0.0002479375,0.0001088549,0.0005595811,0.00005966443],"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.00004212304,0.0001560761,0.01479088,0.0000415655,0.0002219356,0.00004427888,0.0003590433,0.0008558944,0.4118138,0.5670168,0.001908184,0.002749338],"study_design_scores_gemma":[0.003319873,0.0003890503,0.03859415,0.0003385379,0.0001129475,0.001239258,0.0008226067,0.01015112,0.3928324,0.4909642,0.06054943,0.0006864545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9833285,0.000160914,0.001866796,0.0001367309,0.008895552,0.0000354155,0.000008097161,0.00002405495,0.005543997],"genre_scores_gemma":[0.9995286,0.00005602822,0.0001623501,0.00001463701,0.0001910326,0.000001299659,0.000001872248,0.00001095439,0.00003326852],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07605265,"threshold_uncertainty_score":0.2957317,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"Australian Research Council","keywords":"Algorithm; Artificial intelligence; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04671005731414036,"gpt":0.3225066968918635,"spread":0.2757966395777232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00195896,0.0005218061,0.0007635989,0.001211795,0.0001587495,0.0009374143,0.002621879,0.0003739779,0.001854729],"category_scores_gemma":[0.002487305,0.0004614396,0.0006711397,0.0003259762,0.0002552287,0.0008085013,0.0004064418,0.001848954,0.0009936017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008344554,"about_ca_system_score_gemma":0.0003528556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006674202,"about_ca_topic_score_gemma":0.000006226111,"domain_scores_codex":[0.9928692,0.0004842186,0.001447743,0.0003707686,0.004157607,0.0006704581],"domain_scores_gemma":[0.990416,0.003100428,0.001577688,0.0006655137,0.003732469,0.0005079315],"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.0006073298,0.002554092,0.00780378,0.0001171869,0.001367421,0.001044721,0.002886502,0.00004447781,0.0005821017,0.9479493,0.02833242,0.006710612],"study_design_scores_gemma":[0.003687323,0.001288176,0.0063695,0.0009542923,0.0001052219,0.0004437798,0.001052266,0.0006090819,0.003215625,0.974946,0.006789775,0.0005390147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9609291,0.0006800646,0.001100158,0.005142169,0.0101667,0.0006245305,0.0001062432,0.00004169657,0.02120933],"genre_scores_gemma":[0.9940723,0.0005847772,0.0003473105,0.0005326551,0.0005400213,0.000014427,0.00000717898,0.0001108573,0.003790498],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03314317,"threshold_uncertainty_score":0.9997842,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"University of Lethbridge","keywords":"Algorithm; Computer science; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01083119086368512,"gpt":0.2323785495239046,"spread":0.2215473586602195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004320202,0.00009138458,0.000144691,0.0001526144,0.00003082234,0.00005381744,0.0003276518,0.0000446435,0.000001503753],"category_scores_gemma":[0.0001608299,0.0000647635,0.00007130092,0.00005900108,0.00003207805,0.0003942809,0.00002260773,0.00007289676,0.000003541101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007455025,"about_ca_system_score_gemma":0.00001567155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.134029e-7,"about_ca_topic_score_gemma":2.138943e-7,"domain_scores_codex":[0.9990968,0.00001927989,0.0004096305,0.0000761071,0.0002815909,0.0001166188],"domain_scores_gemma":[0.9990197,0.0003717661,0.0001865486,0.00007445475,0.0002791045,0.00006843759],"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.0003141002,0.00007304446,0.001346526,0.00009930714,0.0003319118,0.00008148099,0.0005454574,0.0002393181,0.00829756,0.979322,0.001635354,0.007713993],"study_design_scores_gemma":[0.006354295,0.0004894474,0.002565902,0.001307255,0.00006614361,0.0006405196,0.0002490212,0.002102907,0.01123748,0.9407026,0.03380526,0.0004791992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9588879,0.004340538,0.01882486,0.001016895,0.01420364,0.0001673067,0.00005927247,0.00008093913,0.002418583],"genre_scores_gemma":[0.9984739,0.0007003336,0.0003086789,0.00001840703,0.0003511347,0.0000027293,5.061563e-7,0.0000118072,0.0001325067],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03958594,"threshold_uncertainty_score":0.2640979,"prediction_status":"machine_predicted_unvalidated"},"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,"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; Compute Canada","keywords":"Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0851218003877353,"gpt":0.3392077157781097,"spread":0.2540859153903744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108491,0.0002387807,0.0005807885,0.0003344097,0.00004217692,0.0000393143,0.001297786,0.0001730669,0.0004345665],"category_scores_gemma":[0.002167279,0.0002105883,0.0003103781,0.0002560784,0.0003385539,0.0006706649,0.0001504361,0.0004360697,0.00003327207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002283192,"about_ca_system_score_gemma":0.0002614982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005593506,"about_ca_topic_score_gemma":9.197848e-7,"domain_scores_codex":[0.9963461,0.0001361766,0.001769147,0.0001428171,0.001384887,0.0002209091],"domain_scores_gemma":[0.9926813,0.0007965019,0.00295408,0.0002856418,0.003140336,0.0001421116],"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.0002361495,0.001104735,0.001493476,0.0001529014,0.0004563224,0.00007931663,0.003403199,0.000004888659,0.001031489,0.9905398,0.0002889939,0.001208715],"study_design_scores_gemma":[0.0008909076,0.0004408248,0.001425916,0.0004984141,0.0001611723,0.0002285029,0.001313934,0.0001502416,0.01626492,0.9776821,0.00075698,0.0001861465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7039375,0.001770294,0.1885747,0.0009690377,0.01604461,0.0004589761,0.00009211193,0.00005533844,0.08809742],"genre_scores_gemma":[0.9820226,0.0003547541,0.01685328,0.00002421776,0.0002436844,0.000002134641,0.000001654339,0.00003260366,0.0004650216],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2780851,"threshold_uncertainty_score":0.858754,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0327433514048982,"gpt":0.2546510512809855,"spread":0.2219076998760873,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000275618,0.0000822632,0.0001271223,0.0001964836,0.00001947595,0.00003028398,0.0003708634,0.00006059611,0.00003178012],"category_scores_gemma":[0.0001479554,0.00005986577,0.00009674536,0.0001109387,0.00001226536,0.000233812,0.00001428481,0.000127453,0.00004423495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001173693,"about_ca_system_score_gemma":0.00004170721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001051648,"about_ca_topic_score_gemma":2.646863e-7,"domain_scores_codex":[0.9990942,0.00003612917,0.000366226,0.00004583902,0.0003600145,0.00009757125],"domain_scores_gemma":[0.9990674,0.000405562,0.0001246415,0.00008021725,0.0002122044,0.0001099367],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004109545,0.00004558474,0.4968678,0.00001356378,0.0004374736,0.00008180876,0.0003155421,0.0004118026,0.002226386,0.4737247,0.01807475,0.007759473],"study_design_scores_gemma":[0.002520848,0.0001602701,0.1718499,0.0003383383,0.00005843422,0.0003090619,0.00003919475,0.00003413636,0.006844514,0.7792052,0.03834593,0.0002941401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8497425,0.0004637322,0.1376252,0.0008198671,0.006665087,0.00006403528,0.00000909033,0.0000874188,0.004523128],"genre_scores_gemma":[0.9987715,0.00002095016,0.0001831681,0.00000884068,0.0004747902,5.691423e-7,4.44339e-7,0.00001492641,0.0005247703],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3250179,"threshold_uncertainty_score":0.2441255,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Algorithm; Artificial intelligence; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01882268798240182,"gpt":0.2232062879342021,"spread":0.2043835999518003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001140834,0.000284045,0.0002178504,0.0003290783,0.0001298897,0.0002610806,0.0008683157,0.0004077057,0.0007494898],"category_scores_gemma":[0.0002469032,0.0003791785,0.0004651203,0.0003365988,0.0001852958,0.0005011759,0.0001847815,0.0007088847,0.0001590821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002675326,"about_ca_system_score_gemma":0.0003524832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009309603,"about_ca_topic_score_gemma":0.00004045934,"domain_scores_codex":[0.9969412,0.0001213856,0.0009037653,0.0002599561,0.00131939,0.0004542861],"domain_scores_gemma":[0.9974381,0.0003749043,0.001023689,0.0003829337,0.0004429304,0.000337389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000468577,0.000192148,0.0001406838,0.0002882271,0.001222151,0.0007282116,0.001809102,0.005426247,0.0006633623,0.9860269,0.002807902,0.0002264184],"study_design_scores_gemma":[0.01110428,0.007478559,0.000748768,0.007756522,0.002190724,0.007028114,0.006948169,0.3405249,0.5607601,0.03528305,0.01771491,0.002461898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9643866,0.001355844,0.00165346,0.0001028449,0.004613209,0.00002106673,0.00003878909,0.00003674428,0.02779142],"genre_scores_gemma":[0.9984424,0.0003035112,0.0004144372,0.0001261353,0.0004685775,0.0000199027,0.0000321164,0.0001248341,0.0000680662],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9507439,"threshold_uncertainty_score":0.999866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}