{"meta":{"query_hash":"94d58b6447b0","filters":{"venue":"Undergraduate topics in computer science"},"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/94d58b6447b0","api":"https://metacan.xera.ac/api/v1/cohort?venue=Undergraduate+topics+in+computer+science"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03443815039716676,"score_gpt":0.28481126624538416,"score_spread":0.2503731158482174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12912828","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020350276,0.0675637,0.017938636,0.0060443003,0.0043643066,0.000046518584,0.00031333533,0.00034199137,0.9013523],"genre_scores_gemma":[0.033797964,0.059478994,0.010903407,0.0027644702,0.004555155,0.00011613551,0.0005991843,0.00051292364,0.88727176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978656,0.000053346655,0.0000067973665,0.00004488646,0.00008530928,0.00002312446],"domain_scores_gemma":[0.9997758,0.00009558202,0.000012055473,0.00004028218,0.000042174717,0.00003405184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018922961,0.00095025456,0.0006715523,0.0018599443,0.0012024496,0.002907798,0.000837348,0.0009150116,0.051235113],"category_scores_gemma":[0.0008246287,0.00042479145,0.00039439116,0.003609369,0.0017485805,0.0040730494,0.001171308,0.0022592635,0.018406622],"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.000007866926,0.000022009226,0.000074464566,0.00020046426,0.000007874478,0.000034845067,0.0004172519,0.0005741557,0.0003070552,0.6458856,0.25469518,0.09777312],"study_design_scores_gemma":[0.0000029831226,0.0000061518454,0.0001406948,0.000117581134,0.000004691884,0.00006762602,0.00012494241,0.00029374883,0.00008021404,0.3144019,0.6847547,0.0000047012363],"about_ca_topic_score_codex":0.0017905139,"about_ca_topic_score_gemma":0.004087274,"teacher_disagreement_score":0.051235113,"about_ca_system_score_codex":0.0015356226,"about_ca_system_score_gemma":0.00081518426,"threshold_uncertainty_score":0.17139852},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Mathematics education; Computer science; Mathematics","score_opus":0.031752211745043564,"score_gpt":0.2879310124659907,"score_spread":0.2561788007209471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479956216","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014489648,0.04567918,0.045712344,0.005667646,0.005043806,0.00006736972,0.0005146144,0.00053592405,0.8953301],"genre_scores_gemma":[0.041031983,0.078833364,0.0502168,0.003202968,0.010094293,0.00036122862,0.0010016924,0.00064617826,0.81461143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995968,0.0000539778,0.00001996775,0.00006358514,0.00022881865,0.0000368593],"domain_scores_gemma":[0.9995459,0.00021247617,0.000021836591,0.000066113455,0.000090603084,0.00006315007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039931512,0.0012469016,0.0009997269,0.0017068898,0.0010102262,0.0029152413,0.00094905164,0.00072002306,0.042987842],"category_scores_gemma":[0.0011010031,0.00043849912,0.0004341106,0.0024485153,0.0015889512,0.0027222976,0.0010341095,0.004198907,0.020804374],"study_design_candidate":"not_applicable","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.000017166121,0.0000639894,0.00017610726,0.000552851,0.000010908963,0.00003938725,0.00023788417,0.00087425654,0.0010071014,0.49816853,0.23874591,0.26010585],"study_design_scores_gemma":[0.00001033087,0.00001853298,0.00047822722,0.0001964502,0.00000604458,0.00010951194,0.00006335925,0.0012480961,0.0002819819,0.25192744,0.74565095,0.00000908217],"about_ca_topic_score_codex":0.0009370713,"about_ca_topic_score_gemma":0.0017521065,"teacher_disagreement_score":0.042987842,"about_ca_system_score_codex":0.0021001857,"about_ca_system_score_gemma":0.0018680905,"threshold_uncertainty_score":0.14380872},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01858481578848988,"score_gpt":0.2691263714431604,"score_spread":0.2505415556546705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241786261","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051685954,0.0040317546,0.031917088,0.0011848449,0.00635883,0.00008986667,0.0011805334,0.0006361856,0.94943213],"genre_scores_gemma":[0.03535754,0.0041410676,0.012354818,0.00045367362,0.0016955682,0.0001192164,0.0015038544,0.000489401,0.9438849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99954695,0.00006465374,0.00003086604,0.00012463903,0.00018557513,0.00004736118],"domain_scores_gemma":[0.99967957,0.000051008497,0.000021938355,0.00006106152,0.00012383929,0.00006258758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038802667,0.0011759324,0.0006138424,0.0020409245,0.0013885485,0.003556696,0.0007822806,0.00046764017,0.09021025],"category_scores_gemma":[0.00171331,0.00032816664,0.0003735064,0.002370582,0.0012952436,0.0040821508,0.0015071731,0.0019073108,0.042871825],"study_design_candidate":"not_applicable","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.000021202182,0.000015646068,0.000075050506,0.00010522496,0.0000045349857,0.000034407647,0.00022067995,0.00027169453,0.00063797337,0.8114184,0.0797309,0.10746422],"study_design_scores_gemma":[0.0000050268927,0.000020553905,0.00014072418,0.000067716435,0.0000048790434,0.000107861066,0.00009528214,0.00035941435,0.00047212033,0.26164243,0.73707604,0.000007943621],"about_ca_topic_score_codex":0.0008753055,"about_ca_topic_score_gemma":0.0011326154,"teacher_disagreement_score":0.09021025,"about_ca_system_score_codex":0.0012205301,"about_ca_system_score_gemma":0.0010808212,"threshold_uncertainty_score":0.30178338},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04505898733537834,"score_gpt":0.30019110386243564,"score_spread":0.2551321165270573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244488833","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009683176,0.026253711,0.32048792,0.0048724995,0.010098567,0.00012266921,0.0011896841,0.0014669303,0.6258249],"genre_scores_gemma":[0.1319725,0.03146938,0.17958267,0.0035347505,0.009885598,0.00033547622,0.002223299,0.0021196231,0.63887674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941087,0.00013091318,0.000044112236,0.00016540442,0.00019532628,0.00005349521],"domain_scores_gemma":[0.99927264,0.00037570423,0.000049561633,0.00016279191,0.00009528307,0.000044008535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044827285,0.0009167359,0.00055450527,0.0012938664,0.0011173248,0.0023789078,0.0008148848,0.0007359024,0.031463984],"category_scores_gemma":[0.002226923,0.00046662183,0.0005258953,0.0034672718,0.002204728,0.009336655,0.0013663775,0.0022748378,0.013702683],"study_design_candidate":"not_applicable","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.000019329647,0.000013868436,0.000057461417,0.00022573263,0.0000041483713,0.000051896324,0.00034505042,0.0004736085,0.001263454,0.86331177,0.041384358,0.092849225],"study_design_scores_gemma":[0.0000044773683,0.000018799903,0.0000997371,0.00011667267,0.0000056025265,0.00020033526,0.000089394634,0.00062802224,0.00080255355,0.5465696,0.4514528,0.000012055921],"about_ca_topic_score_codex":0.0010784001,"about_ca_topic_score_gemma":0.0017060831,"teacher_disagreement_score":0.031463984,"about_ca_system_score_codex":0.0010208231,"about_ca_system_score_gemma":0.0005331877,"threshold_uncertainty_score":0.10525751},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02651627759676215,"score_gpt":0.25796109282492985,"score_spread":0.2314448152281677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254365644","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013710358,0.0031432204,0.03557559,0.0021659974,0.0010772597,0.000043298285,0.00032294143,0.00060746295,0.9556931],"genre_scores_gemma":[0.06464504,0.0051581142,0.024178375,0.001305319,0.0010916629,0.00019362076,0.00079757936,0.00050386577,0.9021265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956423,0.00008972895,0.000016834987,0.00010810421,0.00017310047,0.00004803064],"domain_scores_gemma":[0.9997253,0.0000890603,0.00001302322,0.000097288445,0.00004837421,0.000026943442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002749156,0.000702408,0.00048212238,0.0009395615,0.0011879157,0.0029577804,0.00096986745,0.0010474245,0.07798372],"category_scores_gemma":[0.0014905739,0.00042601838,0.00041483267,0.0008833324,0.0019079798,0.0047609196,0.0018201475,0.0022731384,0.041052166],"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.000008062537,0.00000791909,0.000025332629,0.00008847709,0.000003890253,0.000018043846,0.0001106925,0.00023332206,0.00045707606,0.90867376,0.051234573,0.039138794],"study_design_scores_gemma":[0.0000038955945,0.0000062698755,0.000071288116,0.00006403854,0.000003668077,0.00007982444,0.000034700268,0.0005384328,0.0009139671,0.42063284,0.5776459,0.0000051693705],"about_ca_topic_score_codex":0.0003430811,"about_ca_topic_score_gemma":0.0005505741,"teacher_disagreement_score":0.07798372,"about_ca_system_score_codex":0.001078988,"about_ca_system_score_gemma":0.0007052096,"threshold_uncertainty_score":0.26088154},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018086392220796037,"score_gpt":0.2351433232438299,"score_spread":0.21705693102303386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255497863","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020448784,0.049769584,0.017805157,0.0070524327,0.0052480674,0.000042386222,0.00038096812,0.0003843884,0.91727215],"genre_scores_gemma":[0.032448944,0.043756224,0.009729804,0.0028244278,0.004400294,0.00009776999,0.0006804119,0.00054370327,0.90551835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974924,0.000058275204,0.000006507523,0.000054865275,0.00010340679,0.000027646622],"domain_scores_gemma":[0.99973935,0.000103256374,0.000014022665,0.00004736609,0.000051497605,0.000044479355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020125596,0.00089600607,0.0005748637,0.0017678619,0.001112981,0.0031874538,0.00079313444,0.0009268713,0.062681794],"category_scores_gemma":[0.0009881073,0.0003839321,0.00036779305,0.0031360367,0.0016823668,0.0039539197,0.0012997474,0.0022904836,0.025945943],"study_design_candidate":"not_applicable","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.000007560397,0.000020024054,0.000073235235,0.00018414321,0.0000069851994,0.000027611197,0.00030287853,0.00053403864,0.00028717247,0.63446164,0.27103075,0.093063995],"study_design_scores_gemma":[0.0000024958565,0.0000049904966,0.00012262253,0.000110639485,0.0000038300996,0.000050832336,0.000102640864,0.00027749463,0.00008066337,0.30878913,0.6904508,0.0000038227427],"about_ca_topic_score_codex":0.0015168807,"about_ca_topic_score_gemma":0.0032238325,"teacher_disagreement_score":0.062681794,"about_ca_system_score_codex":0.0015596449,"about_ca_system_score_gemma":0.00089990074,"threshold_uncertainty_score":0.20969146},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03275955338909642,"score_gpt":0.25815284226995433,"score_spread":0.2253932888808579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58369529","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012912743,0.14124018,0.09308275,0.007347177,0.0029820497,0.000056062905,0.0003646231,0.00035454414,0.7416598],"genre_scores_gemma":[0.40920675,0.108901374,0.08142445,0.0034281085,0.011304449,0.00049985514,0.0012397867,0.00038176155,0.3836135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994573,0.00017163335,0.00003410208,0.000103011975,0.00019666567,0.00003727923],"domain_scores_gemma":[0.99940145,0.00038573256,0.00003770235,0.00006852839,0.00007158137,0.000034987526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005867665,0.0007811092,0.0006875074,0.0021128021,0.0014926881,0.003946468,0.0009506815,0.000976395,0.010961211],"category_scores_gemma":[0.0028394973,0.00039868217,0.0003972773,0.0039219833,0.0043719546,0.0066587836,0.001043983,0.0022179235,0.0020488014],"study_design_candidate":"not_applicable","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.0000053510034,0.000005903858,0.000070603644,0.00006645508,0.0000021770506,0.000008713047,0.00013378402,0.00041213096,0.000061120496,0.96824944,0.010242987,0.020741338],"study_design_scores_gemma":[0.000002103685,0.000004274843,0.00009537228,0.00005275941,0.0000022706313,0.000033684006,0.000068336456,0.00055130373,0.00004248262,0.94421774,0.05492647,0.0000032067546],"about_ca_topic_score_codex":0.0018320287,"about_ca_topic_score_gemma":0.002578818,"teacher_disagreement_score":0.010961211,"about_ca_system_score_codex":0.002054778,"about_ca_system_score_gemma":0.0009934746,"threshold_uncertainty_score":0.036668897},"labels":[],"label_agreement":null}]}