{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.004481613,0.0008670323,0.001233182,0.001709213,0.0006139717,0.001047495,0.01006437,0.0002919423,0.000006276885],"category_scores_gemma":[0.00008777429,0.0008206646,0.0003727752,0.002417395,0.004162807,0.002236729,0.006720181,0.0006932776,0.00003460041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00172044,"about_ca_system_score_gemma":0.00355777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003491693,"about_ca_topic_score_gemma":0.0000252879,"domain_scores_codex":[0.9910921,0.0001090419,0.001490063,0.002780917,0.002588202,0.001939691],"domain_scores_gemma":[0.9938083,0.0006336473,0.0008961158,0.003192637,0.0009216359,0.0005476742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001096076,0.0003877771,0.0003648506,0.0004471313,0.00003580511,0.00002605359,0.001093127,0.004101235,0.0001233824,0.6642452,0.001464914,0.3276996],"study_design_scores_gemma":[0.0007167488,0.0005312223,0.0008905008,0.0003522982,0.00002172015,0.0000629535,0.000002863495,0.7355995,0.0006807896,0.2491646,0.01088659,0.001090288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004741076,0.0002387649,0.9836011,0.00154039,0.007119627,0.001482129,0.00003227933,0.0002334793,0.005278114],"genre_scores_gemma":[0.02416649,0.0000508396,0.9641131,0.0005966435,0.001655556,0.00006307851,0.00001744012,0.00006089605,0.009275944],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7314982,"threshold_uncertainty_score":0.9999895,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001118778,0.0004356228,0.0004309074,0.001234477,0.0002976971,0.0004540387,0.002997477,0.0001845533,0.000009741909],"category_scores_gemma":[0.00002638053,0.0004186279,0.0000953401,0.0005577806,0.001480446,0.001245169,0.00247105,0.0007281925,0.00005194028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001668578,"about_ca_system_score_gemma":0.0002392276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008319232,"about_ca_topic_score_gemma":0.00004483139,"domain_scores_codex":[0.9963561,0.00004617736,0.0004275998,0.001256906,0.001025657,0.000887606],"domain_scores_gemma":[0.9976217,0.0002108914,0.0001757932,0.001472915,0.0001654701,0.0003532478],"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.000001392988,0.00001329857,0.0001063898,0.0000136028,0.000005570695,0.00002836055,0.0001202282,0.00003834451,0.0000106172,0.7574387,0.00006078347,0.2421628],"study_design_scores_gemma":[0.0002113544,0.00008638717,0.0003934161,0.0001052892,0.000003897017,0.00006016078,8.135363e-7,0.01519923,0.00007467709,0.9672418,0.01613991,0.0004831101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002864826,0.002697313,0.8789641,0.004062342,0.001949712,0.000618579,0.000005184418,0.0003685879,0.1110477],"genre_scores_gemma":[0.1289563,0.005736188,0.6732304,0.001795363,0.0009508357,0.00004906808,0.000009787886,0.0001704123,0.1891017],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2416797,"threshold_uncertainty_score":0.9998266,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001970346,0.0006374487,0.000655371,0.0007278784,0.0003997094,0.0009930583,0.003459991,0.0002899387,0.00001374625],"category_scores_gemma":[0.00004571376,0.0006330968,0.0001125721,0.000531779,0.001264353,0.001404348,0.003914984,0.0008729531,0.00006236255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005352412,"about_ca_system_score_gemma":0.0006069374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007190835,"about_ca_topic_score_gemma":0.00007967706,"domain_scores_codex":[0.9949352,0.00006131588,0.0007642957,0.001860734,0.001303923,0.001074556],"domain_scores_gemma":[0.9970223,0.00029338,0.0003755876,0.001657994,0.0002885456,0.0003621829],"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":[7.292048e-7,0.00002702152,0.0003602937,0.00005237314,0.000008681278,0.00006393369,0.0002515318,0.0002156634,0.000005179324,0.5908737,0.0001143872,0.4080265],"study_design_scores_gemma":[0.0002911675,0.0001143007,0.0009422274,0.0002306351,0.00001220336,0.0002421905,0.000001946686,0.3011686,0.00004027244,0.666244,0.02966007,0.001052405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003627272,0.002067733,0.9328682,0.005174622,0.004363374,0.0006626652,0.000007050015,0.0004438033,0.05404987],"genre_scores_gemma":[0.05710699,0.001196357,0.9181629,0.001835956,0.001758289,0.00002212816,0.00001078854,0.00009126606,0.01981533],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4069741,"threshold_uncertainty_score":0.999612,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001186327,0.0001578891,0.0001807041,0.0000671895,0.0001652156,0.0001103243,0.0002995696,0.00003365306,0.0001128295],"category_scores_gemma":[0.000002106568,0.0001382866,0.0000287102,0.00006878284,0.001127993,0.0001772585,0.0002681109,0.0001406951,0.00003118783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002331568,"about_ca_system_score_gemma":0.00006774964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004615885,"about_ca_topic_score_gemma":0.000003493679,"domain_scores_codex":[0.9990923,0.000003476176,0.0001853795,0.0003707924,0.0001612018,0.0001868066],"domain_scores_gemma":[0.9994597,0.00004207509,0.00008585681,0.0002855293,0.00006042948,0.00006634754],"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":[4.677374e-7,0.000005000047,0.00001610298,0.000007827667,0.000003342109,6.755096e-7,0.00006771617,0.0000110271,0.000002725581,0.9746126,0.00007060073,0.02520191],"study_design_scores_gemma":[0.00004536029,0.00002661379,0.000005324608,0.00006360944,0.000003833712,0.000002134118,0.00000723913,0.0009606521,0.00007705683,0.9636251,0.03502692,0.0001561614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0003449749,0.00004635856,0.5151846,0.001969061,0.0002991533,0.0002345827,0.0000150076,0.00003793395,0.4818684],"genre_scores_gemma":[0.0794667,0.0001684388,0.3588958,0.0003502561,0.002974605,0.00004408398,0.00002062061,0.00006396315,0.5580156],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.1562888,"threshold_uncertainty_score":0.5639163,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008008166,0.0004039689,0.0003811524,0.0008640899,0.0003127874,0.0005858336,0.002497017,0.0001731545,0.00001559738],"category_scores_gemma":[0.00001344729,0.0003794413,0.00009692413,0.0004242852,0.001563596,0.0007110159,0.001478345,0.0004129095,0.00005560695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007056381,"about_ca_system_score_gemma":0.000186675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006019224,"about_ca_topic_score_gemma":0.00003695031,"domain_scores_codex":[0.9971144,0.00003169709,0.0004002527,0.001289538,0.0006316492,0.0005325162],"domain_scores_gemma":[0.9982068,0.0001037959,0.0001781202,0.00115475,0.0001496754,0.000206873],"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":[9.946848e-7,0.00001210791,0.00002607592,0.00001042406,0.000006865113,0.00004470132,0.000267176,0.00001559438,0.000004143282,0.8932783,0.0002308859,0.1061027],"study_design_scores_gemma":[0.0001938636,0.0001478112,0.0001703141,0.0001355768,0.000004691853,0.00005708914,0.000001151095,0.03917237,0.00006087551,0.9493178,0.01029439,0.0004441132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008530573,0.0004908821,0.8729582,0.003197588,0.003714286,0.0004013255,0.000005582423,0.0003753209,0.1180038],"genre_scores_gemma":[0.07484898,0.001508069,0.6614543,0.003601439,0.001467964,0.00002530239,0.00001012547,0.0001233224,0.2569605],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2115039,"threshold_uncertainty_score":0.9998658,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001627679,0.0005245348,0.0004713006,0.001510045,0.0004369939,0.0005759174,0.004838224,0.0002576227,0.00005302622],"category_scores_gemma":[0.00009005397,0.0004973498,0.0001620552,0.0008159983,0.001277146,0.001461837,0.00155258,0.001258278,0.0007456149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007217007,"about_ca_system_score_gemma":0.0007916521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008213885,"about_ca_topic_score_gemma":0.00004176306,"domain_scores_codex":[0.9950066,0.00008688756,0.0006470147,0.001490207,0.001767694,0.001001598],"domain_scores_gemma":[0.9966994,0.0004511877,0.0003024645,0.001910318,0.0003113385,0.0003253094],"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.000003643665,0.00002972672,0.00003893799,0.000009825869,0.000007635151,0.00005263788,0.0001603581,0.000893658,0.000007872335,0.8735644,0.0002414586,0.1249899],"study_design_scores_gemma":[0.0001809639,0.0001739407,0.0001030744,0.0002540509,0.000003746725,0.00003242155,0.000001207605,0.01669941,0.0001275173,0.9390966,0.04275474,0.0005722786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002975439,0.0005024986,0.7129511,0.004889407,0.002266998,0.0004633901,0.000004311632,0.0002323123,0.2786602],"genre_scores_gemma":[0.05806453,0.001204696,0.5024558,0.002733354,0.00337928,0.00006933563,0.00001684248,0.0001650764,0.4319111],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2104953,"threshold_uncertainty_score":0.9997478,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001383881,0.0007534238,0.000720411,0.001092657,0.000403819,0.001058985,0.006771784,0.0002989701,0.00005848964],"category_scores_gemma":[0.00005709257,0.0007318676,0.0002246229,0.0006960429,0.001288061,0.0009901831,0.005307856,0.0008713788,0.0003039609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006378194,"about_ca_system_score_gemma":0.0006456161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000418261,"about_ca_topic_score_gemma":0.0001215625,"domain_scores_codex":[0.9940199,0.00006011004,0.0008863271,0.002489813,0.00151386,0.00102997],"domain_scores_gemma":[0.9958546,0.0002287429,0.0003684,0.002801211,0.0004291596,0.0003178949],"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.000002770021,0.00007341018,0.0001108937,0.00007847815,0.00001963549,0.0002260917,0.0004770042,0.001015148,0.000008995031,0.6252299,0.00110314,0.3716545],"study_design_scores_gemma":[0.0002192025,0.0001493494,0.0002434031,0.0001544579,0.000006775739,0.00008261608,4.725833e-7,0.3689542,0.00007373872,0.6110306,0.0183646,0.000720513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002231077,0.000207109,0.8927919,0.003640806,0.00670772,0.0004805799,0.000004001789,0.0005115306,0.0954333],"genre_scores_gemma":[0.01033392,0.000177882,0.8836958,0.001604834,0.004254926,0.00002048212,0.000008559185,0.0001045805,0.09979901],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.370934,"threshold_uncertainty_score":0.999978,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}