{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Ebrahim Ghaderpour","is_ca":true},{"name":"Dave Witte Morris","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003519316,0.0006324548,0.0004745665,0.0007804973,0.001598271,0.001998176,0.0007877481,0.0008027626,0.02675392],"category_scores_gemma":[0.001659778,0.000605875,0.0006701618,0.0007927691,0.001366532,0.00216247,0.0008619887,0.001238171,0.00320779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001236658,"about_ca_system_score_gemma":0.001263149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002506549,"about_ca_topic_score_gemma":0.003879028,"domain_scores_codex":[0.9993643,0.00008502143,0.000024639,0.000146819,0.0001249696,0.0002541794],"domain_scores_gemma":[0.9984888,0.0004805989,0.0002841797,0.0001949182,0.0002690148,0.0002825798],"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.000180164,0.0001432943,0.001129342,0.0001841013,0.00006189814,0.001315939,0.0005504339,0.002874874,0.008484881,0.9528599,0.02129277,0.01092234],"study_design_scores_gemma":[0.0001891631,0.0001156917,0.001483215,0.00003995303,0.00004050444,0.0008777002,0.0006247521,0.01215936,0.006941167,0.9481939,0.02927465,0.00005981483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5373698,0.0006510579,0.1275508,0.003432253,0.0007332079,0.0004887726,0.003749738,0.001663621,0.3243608],"genre_scores_gemma":[0.9027798,0.0006119941,0.02048737,0.00133836,0.000182294,0.0002597325,0.002709991,0.0002465976,0.07138395],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02675392,"threshold_uncertainty_score":0.08950084,"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","authors":[{"name":"Dragomir Ž. Ðoković","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000602045,0.0003925405,0.0003310362,0.003028425,0.0009682038,0.001212834,0.0006463154,0.0007194613,0.006163481],"category_scores_gemma":[0.003261267,0.0001736329,0.0002768298,0.001751488,0.0009452588,0.001385346,0.0007081807,0.0008074639,0.001111224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000605239,"about_ca_system_score_gemma":0.0006284407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006705933,"about_ca_topic_score_gemma":0.0004804286,"domain_scores_codex":[0.999341,0.00008821237,0.00007961728,0.0001190991,0.0002039816,0.0001681625],"domain_scores_gemma":[0.9970877,0.00110222,0.0004342818,0.0003296493,0.000656835,0.0003893011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00233179,0.0006935437,0.08819255,0.000726176,0.000091422,0.001431923,0.002149536,0.009161782,0.1057533,0.3682778,0.01487231,0.4063177],"study_design_scores_gemma":[0.0002902052,0.00154699,0.1096208,0.0004797066,0.0001416669,0.005959485,0.003284101,0.08848378,0.1249338,0.5231445,0.1418751,0.0002398815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.924073,0.000998789,0.03178279,0.0002960379,0.0001334989,0.0001552989,0.003253945,0.0004490456,0.03885756],"genre_scores_gemma":[0.9598007,0.0007171824,0.02542717,0.0001265129,0.00007618831,0.0002013576,0.006170094,0.0001275745,0.007353269],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006163481,"threshold_uncertainty_score":0.02061892,"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","authors":[{"name":"Dave Witte Morris","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006678008,0.001043091,0.0005805527,0.001209896,0.00173836,0.002243119,0.001020983,0.0009105791,0.01724685],"category_scores_gemma":[0.003257511,0.0008493796,0.001250223,0.001248489,0.001298815,0.0032922,0.001615547,0.001783528,0.00258661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002088437,"about_ca_system_score_gemma":0.0009625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003772394,"about_ca_topic_score_gemma":0.00774178,"domain_scores_codex":[0.9992084,0.000158582,0.00004551106,0.0002285934,0.0001505419,0.0002084478],"domain_scores_gemma":[0.9972104,0.001601685,0.0002072601,0.0003378424,0.0003374291,0.0003054751],"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.0001753044,0.0001168112,0.0009963642,0.0002470115,0.00006363854,0.0007472243,0.0003568728,0.02073099,0.003114296,0.945371,0.009700823,0.01837963],"study_design_scores_gemma":[0.0000797545,0.00006306808,0.000426949,0.00006419404,0.00004485652,0.0002566904,0.000170544,0.04047948,0.002184319,0.9384465,0.01775185,0.00003166874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3667386,0.001154,0.4233482,0.001954751,0.0004880542,0.0003005089,0.004731313,0.001935651,0.1993489],"genre_scores_gemma":[0.8252732,0.000941631,0.08102323,0.0009499926,0.00009440116,0.000302038,0.006044498,0.0005248386,0.08484612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01724685,"threshold_uncertainty_score":0.05769646,"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","authors":[{"name":"Ebrahim Ghaderpour","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004064335,0.001627556,0.001197107,0.002422077,0.00206471,0.002390383,0.001821558,0.002149918,0.008445379],"category_scores_gemma":[0.04143099,0.001251333,0.001981042,0.001691355,0.004750017,0.007363891,0.004371047,0.005921451,0.001683311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001415784,"about_ca_system_score_gemma":0.001062675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004815501,"about_ca_topic_score_gemma":0.0003986557,"domain_scores_codex":[0.9964445,0.001206022,0.0001918423,0.0008041573,0.0009125972,0.0004408291],"domain_scores_gemma":[0.9665772,0.02527433,0.002123104,0.001910775,0.002939019,0.001175574],"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.0001137836,0.00009145501,0.001270801,0.0002769252,0.00005069358,0.0003231206,0.0004974206,0.009749494,0.005406539,0.9607713,0.003792182,0.01765621],"study_design_scores_gemma":[0.00003528851,0.0001441708,0.0005750355,0.0001131959,0.00004675101,0.0006741369,0.0002480106,0.08781356,0.003614184,0.900641,0.00601803,0.00007663426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1425878,0.002970427,0.7716571,0.00335081,0.0005147469,0.0001120851,0.0002968449,0.0005224348,0.07798781],"genre_scores_gemma":[0.8356058,0.004093147,0.1245282,0.00145315,0.001406965,0.000568818,0.000707211,0.0003682118,0.03126856],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008445379,"threshold_uncertainty_score":0.0282526,"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","authors":[{"name":"Dragomir Ž. Ðoković","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001074216,0.001111099,0.0009651194,0.006201515,0.001833497,0.004160422,0.001166637,0.001431751,0.01974237],"category_scores_gemma":[0.01043233,0.0004405273,0.0009630651,0.003571928,0.002086511,0.004494378,0.001697203,0.002104103,0.01148008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002205749,"about_ca_system_score_gemma":0.001615424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003836768,"about_ca_topic_score_gemma":0.002095009,"domain_scores_codex":[0.9972816,0.0003438092,0.0003074266,0.0007212177,0.0009482529,0.0003977027],"domain_scores_gemma":[0.993512,0.001766364,0.000609942,0.0008561393,0.002678922,0.0005766339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009236616,0.000310617,0.01349693,0.0007309503,0.00005574991,0.001248359,0.001681045,0.005673299,0.01365995,0.403742,0.07690892,0.4815684],"study_design_scores_gemma":[0.00008581855,0.0003093739,0.005793869,0.0003352957,0.00006159418,0.002850574,0.001191071,0.07593133,0.01382069,0.6950688,0.2044487,0.000102793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3186565,0.004171371,0.4763301,0.004228033,0.002718426,0.0007968439,0.0212614,0.01049854,0.1613387],"genre_scores_gemma":[0.6283103,0.00269389,0.1774043,0.001038416,0.001501495,0.0006235832,0.07455672,0.002111631,0.1117597],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01974237,"threshold_uncertainty_score":0.06604481,"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","authors":[{"name":"Alexander Shramchenko","is_ca":false},{"name":"Vasilisa Shramchenko","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001550604,0.0004873684,0.0005335161,0.0012159,0.002098782,0.001768945,0.0008146852,0.0009148791,0.01045121],"category_scores_gemma":[0.004636011,0.0008136911,0.0009311793,0.001140392,0.001492186,0.004871535,0.002394781,0.001452669,0.00186628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008718216,"about_ca_system_score_gemma":0.0007975799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007770261,"about_ca_topic_score_gemma":0.001094451,"domain_scores_codex":[0.9973873,0.0008657293,0.0001498771,0.0006353924,0.0006743175,0.0002873389],"domain_scores_gemma":[0.9957461,0.001455577,0.0004893389,0.001202077,0.00076506,0.0003419785],"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.0001010481,0.00007330631,0.001656665,0.00009724168,0.00002476736,0.0003182493,0.001034269,0.003078528,0.008811791,0.9159281,0.002087726,0.06678823],"study_design_scores_gemma":[0.0000700703,0.0008123551,0.001933166,0.00009382678,0.0001182992,0.002219405,0.0006248402,0.03770215,0.02187739,0.7549772,0.1794792,0.00009213151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09300414,0.0003181853,0.869261,0.0002580307,0.00009605182,0.0001736703,0.0002293627,0.0004777043,0.03618179],"genre_scores_gemma":[0.4876007,0.0005101475,0.4758292,0.0002764206,0.0001813959,0.0004345119,0.0004495234,0.0003146119,0.03440346],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01045121,"threshold_uncertainty_score":0.03496271,"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","authors":[{"name":"Farej Omer","is_ca":true},{"name":"Nabil Shalaby","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004796953,0.0008777856,0.0006597699,0.001110368,0.001238898,0.001758185,0.001231965,0.0009558043,0.0915703],"category_scores_gemma":[0.001900675,0.0005122162,0.0007659376,0.001070341,0.0008578962,0.002396421,0.001274248,0.001902911,0.03849037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009192528,"about_ca_system_score_gemma":0.0008449672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001963831,"about_ca_topic_score_gemma":0.004610852,"domain_scores_codex":[0.999406,0.0001111773,0.00003492921,0.0001424892,0.0001911279,0.0001143231],"domain_scores_gemma":[0.9987289,0.0002920538,0.00007995432,0.0004481801,0.000338686,0.0001121302],"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.0007706629,0.0002173639,0.0006887276,0.0005202627,0.00002858002,0.0006397126,0.0007770088,0.004143948,0.03379222,0.5452952,0.2731225,0.1400038],"study_design_scores_gemma":[0.00008345253,0.0001386627,0.0008104468,0.0001190457,0.00002869989,0.0002701952,0.0002834066,0.006318834,0.04083367,0.2035351,0.7474933,0.00008531308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04550624,0.0003404806,0.5012119,0.001766746,0.00259606,0.0006046495,0.01652398,0.02110203,0.4103479],"genre_scores_gemma":[0.2193481,0.0006377805,0.2534549,0.001076553,0.0002745545,0.0007312832,0.03035817,0.01394127,0.4801772],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0915703,"threshold_uncertainty_score":0.3063332,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}