{"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":"94d58b6447b0","filters":{"venue":"Undergraduate topics in computer science"}},"results":[{"id":"W2479956216","doi":"10.1007/978-1-4471-4069-6","title":"Fundamentals of Discrete Math for Computer Science","year":2012,"lang":"en","type":"book","venue":"Undergraduate topics in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Mathematics education; Computer science; Mathematics","authors":[{"name":"Tom Jenkyns","is_ca":true},{"name":"Ben Stephenson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03175221174504356,"gpt":0.2879310124659907,"spread":0.2561788007209471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003993151,0.001246902,0.0009997269,0.00170689,0.001010226,0.002915241,0.0009490516,0.0007200231,0.04298784],"category_scores_gemma":[0.001101003,0.0004384991,0.0004341106,0.002448515,0.001588951,0.002722298,0.00103411,0.004198907,0.02080437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002100186,"about_ca_system_score_gemma":0.00186809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009370713,"about_ca_topic_score_gemma":0.001752106,"domain_scores_codex":[0.9995968,0.0000539778,0.00001996775,0.00006358514,0.0002288187,0.0000368593],"domain_scores_gemma":[0.9995459,0.0002124762,0.00002183659,0.00006611345,0.00009060308,0.00006315007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001716612,0.0000639894,0.0001761073,0.000552851,0.00001090896,0.00003938725,0.0002378842,0.0008742565,0.001007101,0.4981685,0.2387459,0.2601058],"study_design_scores_gemma":[0.00001033087,0.00001853298,0.0004782272,0.0001964502,0.00000604458,0.0001095119,0.00006335925,0.001248096,0.0002819819,0.2519274,0.7456509,0.00000908217],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001448965,0.04567918,0.04571234,0.005667646,0.005043806,0.00006736972,0.0005146144,0.000535924,0.8953301],"genre_scores_gemma":[0.04103198,0.07883336,0.0502168,0.003202968,0.01009429,0.0003612286,0.001001692,0.0006461783,0.8146114],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.04298784,"threshold_uncertainty_score":0.1438087,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W12912828","doi":"10.1007/978-1-4471-4069-6_5","title":"Graphs and Trees","year":2012,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Tree traversal; Graph traversal; Floyd–Warshall algorithm; Dijkstra's algorithm; Computer science; Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Breadth-first search; Algorithm; Discrete mathematics; Shortest path problem; Theoretical computer science; Graph; Artificial intelligence","authors":[{"name":"Tom Jenkyns","is_ca":true},{"name":"Ben Stephenson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03443815039716676,"gpt":0.2848112662453842,"spread":0.2503731158482174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001892296,0.0009502546,0.0006715523,0.001859944,0.00120245,0.002907798,0.000837348,0.0009150116,0.05123511],"category_scores_gemma":[0.0008246287,0.0004247914,0.0003943912,0.003609369,0.00174858,0.004073049,0.001171308,0.002259264,0.01840662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001535623,"about_ca_system_score_gemma":0.0008151843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001790514,"about_ca_topic_score_gemma":0.004087274,"domain_scores_codex":[0.9997866,0.00005334666,0.000006797366,0.00004488646,0.00008530928,0.00002312446],"domain_scores_gemma":[0.9997758,0.00009558202,0.00001205547,0.00004028218,0.00004217472,0.00003405184],"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.000007866926,0.00002200923,0.00007446457,0.0002004643,0.000007874478,0.00003484507,0.0004172519,0.0005741557,0.0003070552,0.6458856,0.2546952,0.09777312],"study_design_scores_gemma":[0.000002983123,0.000006151845,0.0001406948,0.0001175811,0.000004691884,0.00006762602,0.0001249424,0.0002937488,0.00008021404,0.3144019,0.6847547,0.000004701236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.002035028,0.0675637,0.01793864,0.0060443,0.004364307,0.00004651858,0.0003133353,0.0003419914,0.9013523],"genre_scores_gemma":[0.03379796,0.05947899,0.01090341,0.00276447,0.004555155,0.0001161355,0.0005991843,0.0005129236,0.8872718],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.05123511,"threshold_uncertainty_score":0.1713985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W58369529","doi":"10.1007/978-1-4471-4069-6_2","title":"Sets, Sequences, and Counting","year":2012,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Counting problem; Set (abstract data type); Mathematics; Section (typography); Discrete mathematics; Theoretical computer science; Computer science; Algorithm; Combinatorics; Programming language","authors":[{"name":"Tom Jenkyns","is_ca":true},{"name":"Ben Stephenson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03275955338909642,"gpt":0.2581528422699543,"spread":0.2253932888808579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005867665,0.0007811092,0.0006875074,0.002112802,0.001492688,0.003946468,0.0009506815,0.000976395,0.01096121],"category_scores_gemma":[0.002839497,0.0003986822,0.0003972773,0.003921983,0.004371955,0.006658784,0.001043983,0.002217924,0.002048801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002054778,"about_ca_system_score_gemma":0.0009934746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001832029,"about_ca_topic_score_gemma":0.002578818,"domain_scores_codex":[0.9994573,0.0001716333,0.00003410208,0.000103012,0.0001966657,0.00003727923],"domain_scores_gemma":[0.9994015,0.0003857326,0.00003770235,0.00006852839,0.00007158137,0.00003498753],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000005351003,0.000005903858,0.00007060364,0.00006645508,0.000002177051,0.000008713047,0.000133784,0.000412131,0.0000611205,0.9682494,0.01024299,0.02074134],"study_design_scores_gemma":[0.000002103685,0.000004274843,0.00009537228,0.00005275941,0.000002270631,0.00003368401,0.00006833646,0.0005513037,0.00004248262,0.9442177,0.05492647,0.000003206755],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01291274,0.1412402,0.09308275,0.007347177,0.00298205,0.00005606291,0.0003646231,0.0003545441,0.7416598],"genre_scores_gemma":[0.4092067,0.1089014,0.08142445,0.003428109,0.01130445,0.0004998551,0.001239787,0.0003817616,0.3836135],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01096121,"threshold_uncertainty_score":0.0366689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4241786261","doi":"10.1007/978-3-319-70151-6_8","title":"Sequences and Series","year":2018,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Fibonacci number; Series (stratigraphy); Sequence (biology); Zeno's paradoxes; Convergence (economics); Mathematics; Applied mathematics; Order (exchange); Recurrence relation; Calculus (dental); Algebra over a field; Pure mathematics; Mathematical analysis; Discrete mathematics; Geometry; Medicine; Geology","authors":[{"name":"Tom Jenkyns","is_ca":true},{"name":"Ben Stephenson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01858481578848988,"gpt":0.2691263714431604,"spread":0.2505415556546705,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003880267,0.001175932,0.0006138424,0.002040925,0.001388549,0.003556696,0.0007822806,0.0004676402,0.09021025],"category_scores_gemma":[0.00171331,0.0003281666,0.0003735064,0.002370582,0.001295244,0.004082151,0.001507173,0.001907311,0.04287183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00122053,"about_ca_system_score_gemma":0.001080821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008753055,"about_ca_topic_score_gemma":0.001132615,"domain_scores_codex":[0.9995469,0.00006465374,0.00003086604,0.000124639,0.0001855751,0.00004736118],"domain_scores_gemma":[0.9996796,0.0000510085,0.00002193835,0.00006106152,0.0001238393,0.00006258758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002120218,0.00001564607,0.00007505051,0.000105225,0.000004534986,0.00003440765,0.00022068,0.0002716945,0.0006379734,0.8114184,0.0797309,0.1074642],"study_design_scores_gemma":[0.000005026893,0.00002055391,0.0001407242,0.00006771644,0.000004879043,0.0001078611,0.00009528214,0.0003594143,0.0004721203,0.2616424,0.737076,0.000007943621],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.005168595,0.004031755,0.03191709,0.001184845,0.00635883,0.00008986667,0.001180533,0.0006361856,0.9494321],"genre_scores_gemma":[0.03535754,0.004141068,0.01235482,0.0004536736,0.001695568,0.0001192164,0.001503854,0.000489401,0.9438849],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.09021025,"threshold_uncertainty_score":0.3017834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4255497863","doi":"10.1007/978-3-319-70151-6_5","title":"Graphs and Trees","year":2018,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Tree traversal; Graph traversal; Floyd–Warshall algorithm; Dijkstra's algorithm; Computer science; Enhanced Data Rates for GSM Evolution; Combinatorics; Breadth-first search; Mathematics; Algorithm; Discrete mathematics; Shortest path problem; Theoretical computer science; Graph; Artificial intelligence","authors":[{"name":"Tom Jenkyns","is_ca":true},{"name":"Ben Stephenson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01808639222079604,"gpt":0.2351433232438299,"spread":0.2170569310230339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000201256,0.0008960061,0.0005748637,0.001767862,0.001112981,0.003187454,0.0007931344,0.0009268713,0.06268179],"category_scores_gemma":[0.0009881073,0.0003839321,0.0003677931,0.003136037,0.001682367,0.00395392,0.001299747,0.002290484,0.02594594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001559645,"about_ca_system_score_gemma":0.0008999007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001516881,"about_ca_topic_score_gemma":0.003223832,"domain_scores_codex":[0.9997492,0.0000582752,0.000006507523,0.00005486528,0.0001034068,0.00002764662],"domain_scores_gemma":[0.9997393,0.0001032564,0.00001402266,0.00004736609,0.00005149761,0.00004447935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000007560397,0.00002002405,0.00007323523,0.0001841432,0.000006985199,0.0000276112,0.0003028785,0.0005340386,0.0002871725,0.6344616,0.2710308,0.093064],"study_design_scores_gemma":[0.000002495857,0.000004990497,0.0001226225,0.0001106395,0.0000038301,0.00005083234,0.0001026409,0.0002774946,0.00008066337,0.3087891,0.6904508,0.000003822743],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.002044878,0.04976958,0.01780516,0.007052433,0.005248067,0.00004238622,0.0003809681,0.0003843884,0.9172722],"genre_scores_gemma":[0.03244894,0.04375622,0.009729804,0.002824428,0.004400294,0.00009776999,0.0006804119,0.0005437033,0.9055184],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.06268179,"threshold_uncertainty_score":0.2096915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4244488833","doi":"10.1007/978-3-319-70151-6_7","title":"Relations: Especially on (Integer) Sequences","year":2012,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Lexicographical order; Equivalence relation; Notation; Natural number; Mathematics; Order (exchange); Equivalence (formal languages); Set (abstract data type); Binary relation; Integer (computer science); Finite set; Combinatorics; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics; Arithmetic","authors":[{"name":"Tom Jenkyns","is_ca":true},{"name":"Ben Stephenson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04505898733537834,"gpt":0.3001911038624356,"spread":0.2551321165270573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004482729,0.0009167359,0.0005545053,0.001293866,0.001117325,0.002378908,0.0008148848,0.0007359024,0.03146398],"category_scores_gemma":[0.002226923,0.0004666218,0.0005258953,0.003467272,0.002204728,0.009336655,0.001366377,0.002274838,0.01370268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001020823,"about_ca_system_score_gemma":0.0005331877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0010784,"about_ca_topic_score_gemma":0.001706083,"domain_scores_codex":[0.9994109,0.0001309132,0.00004411224,0.0001654044,0.0001953263,0.00005349521],"domain_scores_gemma":[0.9992726,0.0003757042,0.00004956163,0.0001627919,0.00009528307,0.00004400854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001932965,0.00001386844,0.00005746142,0.0002257326,0.000004148371,0.00005189632,0.0003450504,0.0004736085,0.001263454,0.8633118,0.04138436,0.09284922],"study_design_scores_gemma":[0.000004477368,0.0000187999,0.0000997371,0.0001166727,0.000005602526,0.0002003353,0.00008939463,0.0006280222,0.0008025535,0.5465696,0.4514528,0.00001205592],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.009683176,0.02625371,0.3204879,0.004872499,0.01009857,0.0001226692,0.001189684,0.00146693,0.6258249],"genre_scores_gemma":[0.1319725,0.03146938,0.1795827,0.003534751,0.009885598,0.0003354762,0.002223299,0.002119623,0.6388767],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.03146398,"threshold_uncertainty_score":0.1052575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4254365644","doi":"10.1007/978-3-319-70151-6_11","title":"Turing Machines","year":2018,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Ingenuity; Turing; Computer science; Creativity; Description number; Universal Turing machine; Turing machine; Theoretical computer science; Cognitive science; Artificial intelligence; Programming language; Epistemology; Psychology; Philosophy","authors":[{"name":"Tom Jenkyns","is_ca":true},{"name":"Ben Stephenson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02651627759676215,"gpt":0.2579610928249298,"spread":0.2314448152281677,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002749156,0.000702408,0.0004821224,0.0009395615,0.001187916,0.00295778,0.0009698675,0.001047425,0.07798372],"category_scores_gemma":[0.001490574,0.0004260184,0.0004148327,0.0008833324,0.00190798,0.00476092,0.001820148,0.002273138,0.04105217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001078988,"about_ca_system_score_gemma":0.0007052096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003430811,"about_ca_topic_score_gemma":0.0005505741,"domain_scores_codex":[0.9995642,0.00008972895,0.00001683499,0.0001081042,0.0001731005,0.00004803064],"domain_scores_gemma":[0.9997253,0.0000890603,0.00001302322,0.00009728844,0.00004837421,0.00002694344],"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.000008062537,0.00000791909,0.00002533263,0.00008847709,0.000003890253,0.00001804385,0.0001106925,0.0002333221,0.0004570761,0.9086738,0.05123457,0.03913879],"study_design_scores_gemma":[0.000003895595,0.000006269875,0.00007128812,0.00006403854,0.000003668077,0.00007982444,0.00003470027,0.0005384328,0.0009139671,0.4206328,0.5776459,0.000005169371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001371036,0.00314322,0.03557559,0.002165997,0.00107726,0.00004329829,0.0003229414,0.0006074629,0.9556931],"genre_scores_gemma":[0.06464504,0.005158114,0.02417837,0.001305319,0.001091663,0.0001936208,0.0007975794,0.0005038658,0.9021265],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.07798372,"threshold_uncertainty_score":0.2608815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}