{"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028648262,0.002697313,0.8789641,0.0040623425,0.0019497119,0.00061857904,0.0000051844177,0.0003685879,0.11104766],"genre_scores_gemma":[0.12895629,0.005736188,0.67323035,0.0017953626,0.0009508357,0.00004906808,0.000009787886,0.00017041234,0.18910171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635607,0.00004617736,0.00042759982,0.0012569056,0.0010256566,0.000887606],"domain_scores_gemma":[0.99762166,0.00021089143,0.00017579318,0.0014729153,0.0001654701,0.0003532478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001118778,0.0004356228,0.0004309074,0.0012344773,0.00029769714,0.00045403867,0.0029974768,0.00018455325,0.000009741909],"category_scores_gemma":[0.00002638053,0.00041862787,0.000095340096,0.00055778056,0.0014804461,0.0012451694,0.0024710502,0.0007281925,0.00005194028],"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.0000013929875,0.00001329857,0.00010638975,0.000013602797,0.0000055706946,0.000028360553,0.000120228164,0.000038344515,0.000010617205,0.75743866,0.00006078347,0.24216276],"study_design_scores_gemma":[0.00021135439,0.00008638717,0.0003934161,0.00010528919,0.000003897017,0.000060160775,8.135363e-7,0.015199228,0.00007467709,0.96724176,0.016139908,0.0004831101],"about_ca_topic_score_codex":0.000008319232,"about_ca_topic_score_gemma":0.00004483139,"teacher_disagreement_score":0.24167965,"about_ca_system_score_codex":0.00016685778,"about_ca_system_score_gemma":0.00023922762,"threshold_uncertainty_score":0.99982655},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004741076,0.00023876491,0.9836011,0.0015403896,0.0071196267,0.0014821292,0.00003227933,0.00023347928,0.0052781138],"genre_scores_gemma":[0.024166485,0.000050839604,0.9641131,0.0005966435,0.0016555558,0.00006307851,0.000017440118,0.000060896047,0.009275944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9910921,0.00010904195,0.0014900627,0.002780917,0.0025882022,0.001939691],"domain_scores_gemma":[0.99380827,0.00063364726,0.00089611585,0.0031926369,0.00092163595,0.0005476742],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.004481613,0.0008670323,0.0012331824,0.0017092129,0.00061397173,0.0010474946,0.010064369,0.0002919423,0.000006276885],"category_scores_gemma":[0.000087774286,0.0008206646,0.00037277525,0.002417395,0.0041628066,0.0022367286,0.0067201806,0.0006932776,0.000034600413],"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.000010960758,0.00038777714,0.00036485057,0.00044713126,0.00003580511,0.000026053594,0.0010931274,0.0041012354,0.00012338236,0.6642452,0.0014649142,0.32769957],"study_design_scores_gemma":[0.0007167488,0.00053122226,0.0008905008,0.00035229823,0.000021720149,0.0000629535,0.0000028634954,0.73559946,0.00068078964,0.24916455,0.010886594,0.0010902876],"about_ca_topic_score_codex":0.000034916935,"about_ca_topic_score_gemma":0.000025287904,"teacher_disagreement_score":0.73149824,"about_ca_system_score_codex":0.0017204402,"about_ca_system_score_gemma":0.0035577698,"threshold_uncertainty_score":0.9999895},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034497492,0.00004635856,0.5151846,0.001969061,0.00029915333,0.00023458268,0.000015007605,0.000037933947,0.48186836],"genre_scores_gemma":[0.0794667,0.00016843878,0.35889578,0.0003502561,0.002974605,0.000044083976,0.000020620608,0.000063963154,0.5580156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909234,0.000003476176,0.00018537953,0.00037079243,0.00016120181,0.0001868066],"domain_scores_gemma":[0.99945974,0.000042075088,0.00008585681,0.00028552933,0.000060429484,0.00006634754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011863275,0.00015788911,0.00018070405,0.000067189496,0.0001652156,0.000110324305,0.00029956963,0.000033653057,0.00011282945],"category_scores_gemma":[0.0000021065678,0.00013828659,0.000028710203,0.00006878284,0.0011279933,0.0001772585,0.00026811086,0.00014069508,0.000031187832],"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":[4.6773738e-7,0.0000050000467,0.00001610298,0.000007827667,0.0000033421088,6.755096e-7,0.000067716166,0.000011027105,0.0000027255805,0.9746126,0.00007060073,0.025201907],"study_design_scores_gemma":[0.00004536029,0.00002661379,0.000005324608,0.00006360944,0.000003833712,0.0000021341184,0.00000723913,0.00096065213,0.00007705683,0.9636251,0.035026923,0.00015616138],"about_ca_topic_score_codex":0.0000046158852,"about_ca_topic_score_gemma":0.0000034936786,"teacher_disagreement_score":0.1562888,"about_ca_system_score_codex":0.00002331568,"about_ca_system_score_gemma":0.00006774964,"threshold_uncertainty_score":0.5639163},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029754388,0.00050249865,0.7129511,0.0048894067,0.0022669982,0.00046339014,0.0000043116315,0.0002323123,0.27866018],"genre_scores_gemma":[0.058064528,0.0012046965,0.50245583,0.0027333538,0.0033792797,0.000069335634,0.00001684248,0.00016507643,0.43191108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950066,0.000086887565,0.0006470147,0.0014902073,0.0017676938,0.0010015977],"domain_scores_gemma":[0.9966994,0.0004511877,0.00030246453,0.0019103182,0.00031133855,0.0003253094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016276785,0.00052453484,0.00047130056,0.0015100455,0.00043699387,0.0005759174,0.0048382236,0.00025762265,0.000053026215],"category_scores_gemma":[0.000090053974,0.00049734977,0.00016205516,0.0008159983,0.0012771464,0.0014618371,0.0015525799,0.0012582779,0.00074561493],"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.0000036436647,0.000029726722,0.000038937993,0.000009825869,0.000007635151,0.00005263788,0.00016035809,0.00089365797,0.000007872335,0.87356436,0.0002414586,0.12498987],"study_design_scores_gemma":[0.00018096392,0.00017394075,0.00010307442,0.00025405092,0.000003746725,0.00003242155,0.0000012076047,0.016699405,0.00012751727,0.9390966,0.04275474,0.0005722786],"about_ca_topic_score_codex":0.000008213885,"about_ca_topic_score_gemma":0.00004176306,"teacher_disagreement_score":0.21049534,"about_ca_system_score_codex":0.0007217007,"about_ca_system_score_gemma":0.0007916521,"threshold_uncertainty_score":0.9997478},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022310772,0.00020710904,0.89279187,0.0036408058,0.0067077195,0.00048057994,0.0000040017885,0.00051153055,0.0954333],"genre_scores_gemma":[0.010333924,0.00017788197,0.8836958,0.0016048341,0.0042549265,0.000020482117,0.000008559185,0.00010458055,0.09979901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940199,0.000060110044,0.00088632706,0.0024898131,0.00151386,0.0010299705],"domain_scores_gemma":[0.9958546,0.00022874288,0.00036839998,0.0028012109,0.00042915964,0.00031789488],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013838813,0.00075342384,0.000720411,0.0010926571,0.00040381902,0.0010589849,0.0067717843,0.00029897012,0.000058489637],"category_scores_gemma":[0.000057092573,0.0007318676,0.00022462293,0.0006960429,0.0012880608,0.0009901831,0.005307856,0.00087137875,0.00030396087],"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.0000027700207,0.000073410185,0.00011089366,0.00007847815,0.000019635487,0.00022609172,0.00047700424,0.0010151478,0.000008995031,0.6252299,0.0011031398,0.37165454],"study_design_scores_gemma":[0.00021920245,0.00014934939,0.0002434031,0.00015445791,0.0000067757387,0.00008261608,4.7258328e-7,0.36895424,0.00007373872,0.61103064,0.0183646,0.000720513],"about_ca_topic_score_codex":0.0000418261,"about_ca_topic_score_gemma":0.00012156246,"teacher_disagreement_score":0.37093404,"about_ca_system_score_codex":0.00063781935,"about_ca_system_score_gemma":0.0006456161,"threshold_uncertainty_score":0.999978},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085305725,0.0004908821,0.8729582,0.0031975876,0.0037142856,0.00040132547,0.0000055824235,0.0003753209,0.1180038],"genre_scores_gemma":[0.07484898,0.0015080692,0.6614543,0.0036014393,0.0014679637,0.000025302386,0.000010125468,0.0001233224,0.2569605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711436,0.000031697087,0.00040025267,0.0012895379,0.00063164916,0.0005325162],"domain_scores_gemma":[0.9982068,0.000103795945,0.0001781202,0.00115475,0.00014967537,0.000206873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008008166,0.00040396885,0.00038115244,0.00086408993,0.00031278742,0.0005858336,0.0024970174,0.00017315448,0.000015597376],"category_scores_gemma":[0.000013447295,0.00037944128,0.00009692413,0.0004242852,0.0015635964,0.00071101595,0.0014783451,0.00041290955,0.00005560695],"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":[9.946848e-7,0.000012107914,0.00002607592,0.000010424057,0.000006865113,0.000044701323,0.000267176,0.000015594378,0.000004143282,0.8932783,0.00023088585,0.10610272],"study_design_scores_gemma":[0.00019386358,0.00014781122,0.00017031415,0.0001355768,0.0000046918526,0.00005708914,0.0000011510947,0.03917237,0.00006087551,0.94931775,0.010294394,0.00044411322],"about_ca_topic_score_codex":0.000006019224,"about_ca_topic_score_gemma":0.000036950314,"teacher_disagreement_score":0.21150386,"about_ca_system_score_codex":0.00007056381,"about_ca_system_score_gemma":0.00018667502,"threshold_uncertainty_score":0.9998658},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036272718,0.0020677326,0.9328682,0.0051746224,0.0043633743,0.00066266523,0.0000070500146,0.0004438033,0.054049868],"genre_scores_gemma":[0.05710699,0.0011963571,0.9181629,0.0018359561,0.0017582893,0.000022128164,0.000010788536,0.00009126606,0.019815331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99493515,0.000061315885,0.0007642957,0.0018607338,0.0013039227,0.0010745557],"domain_scores_gemma":[0.99702233,0.00029338,0.00037558758,0.0016579943,0.00028854556,0.00036218285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019703456,0.00063744874,0.000655371,0.0007278784,0.00039970945,0.0009930583,0.0034599907,0.00028993873,0.0000137462475],"category_scores_gemma":[0.000045713758,0.0006330968,0.000112572125,0.000531779,0.0012643534,0.0014043478,0.0039149844,0.0008729531,0.000062362546],"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":[7.292048e-7,0.000027021522,0.0003602937,0.00005237314,0.000008681278,0.000063933694,0.0002515318,0.00021566336,0.000005179324,0.59087366,0.000114387185,0.40802655],"study_design_scores_gemma":[0.00029116747,0.000114300725,0.00094222743,0.0002306351,0.000012203364,0.00024219051,0.000001946686,0.3011686,0.000040272444,0.666244,0.02966007,0.0010524046],"about_ca_topic_score_codex":0.000071908355,"about_ca_topic_score_gemma":0.00007967706,"teacher_disagreement_score":0.40697414,"about_ca_system_score_codex":0.00053524115,"about_ca_system_score_gemma":0.0006069374,"threshold_uncertainty_score":0.99961203},"labels":[],"label_agreement":null}]}