{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":29,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":29,"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":"c9e14d9513a8","filters":{"venue":"Mathematics in Computer Science"}},"results":[{"id":"W2063841356","doi":"10.1007/s11786-007-0024-4","title":"Lempel–Ziv Factorization Using Less Time & Space","year":2008,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Compressed suffix array; Generalized suffix tree; Suffix tree; Suffix array; Factorization; Suffix; String (physics); Data structure; Mathematics; Time complexity; Algorithm; Alphabet; Combinatorics; Computer science; Discrete mathematics","authors":[{"name":"Gang Chen","is_ca":true},{"name":"Simon J. Puglisi","is_ca":false},{"name":"W. F. Smyth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07001208019824393,"gpt":0.2851699233784816,"spread":0.2151578431802376,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001341454,0.00197408,0.00167142,0.001955036,0.001800828,0.002985955,0.001558633,0.00141512,0.04032224],"category_scores_gemma":[0.007541475,0.0005027546,0.001414748,0.002241382,0.001620379,0.006030014,0.003053661,0.002170575,0.01863824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001030771,"about_ca_system_score_gemma":0.00178675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001624302,"about_ca_topic_score_gemma":0.003574793,"domain_scores_codex":[0.997131,0.0007328003,0.0001928246,0.0004933607,0.001013502,0.0004365697],"domain_scores_gemma":[0.9962114,0.001225155,0.0002308095,0.001629946,0.0005463763,0.0001562786],"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.001596588,0.0004429691,0.0005790239,0.0007180255,0.0001095578,0.0004632341,0.0004383166,0.01938046,0.04827212,0.2754731,0.04911785,0.6034086],"study_design_scores_gemma":[0.000494358,0.000727986,0.0007185666,0.0002260024,0.0001511576,0.00168484,0.0006531667,0.2497789,0.09030858,0.5267339,0.1283153,0.0002073034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03087218,0.00147718,0.9240168,0.001784514,0.001012628,0.0003075339,0.0008380011,0.004212051,0.03547902],"genre_scores_gemma":[0.1949899,0.0007279757,0.7644397,0.001153571,0.000890651,0.0004023641,0.001852619,0.0008089749,0.03473422],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04032224,"threshold_uncertainty_score":0.1348913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018508868","doi":"10.1007/s11786-013-0149-6","title":"Near Sets: An Introduction","year":2013,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disjoint sets; Mathematics; Set (abstract data type); Combinatorics; Relation (database); Space (punctuation); Discrete mathematics; Data mining; Computer science","authors":[{"name":"James F. Peters","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01423836951559186,"gpt":0.2504741927382823,"spread":0.2362358232226904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002034268,0.001622832,0.001307257,0.00523131,0.002494821,0.006381841,0.002658177,0.003283754,0.02025764],"category_scores_gemma":[0.005476879,0.000957211,0.001883949,0.005269811,0.004705478,0.01267237,0.004600032,0.006027728,0.007468836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003034674,"about_ca_system_score_gemma":0.001598035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002183135,"about_ca_topic_score_gemma":0.001160622,"domain_scores_codex":[0.9969718,0.0008216416,0.0002842045,0.000754951,0.0009931658,0.0001741939],"domain_scores_gemma":[0.997126,0.001824823,0.0001351607,0.0003016342,0.0004759013,0.0001364362],"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.00001803714,0.00004356739,0.0004736099,0.0009365843,0.00002587607,0.0002297664,0.0006530312,0.001364198,0.0003589739,0.8840832,0.02712057,0.08469269],"study_design_scores_gemma":[0.000004140672,0.00003601208,0.0003125361,0.0005533315,0.0000124667,0.0007896284,0.000226251,0.001856858,0.0001611801,0.4499356,0.5460846,0.00002741165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"methods","genre_scores_codex":[0.005018665,0.3760805,0.2827682,0.01050762,0.009764954,0.0002914055,0.001512389,0.0006534538,0.3134028],"genre_scores_gemma":[0.1418833,0.44471,0.2633976,0.01449449,0.02616525,0.001540591,0.004268108,0.001166094,0.1023746],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.02025764,"threshold_uncertainty_score":0.06776851,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3199228775","doi":"10.1007/11786.1661-8289","title":"Mathematics in Computer Science","year":2013,"lang":"en","type":"paratext","venue":"Mathematics in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Mathematics education; Computer science","authors":[{"name":"Dardo Goyeneche","is_ca":true},{"name":"Ilias Kotsireas","is_ca":true},{"name":"Padraig Ó Catháin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03441838138543281,"gpt":0.2910074292922361,"spread":0.2565890479068033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00126979,0.001069358,0.001233519,0.002586548,0.002540617,0.01173011,0.0009120183,0.002063878,0.08585935],"category_scores_gemma":[0.005956643,0.0004237096,0.0004619716,0.004348493,0.005193247,0.00796825,0.002426247,0.006557048,0.02347078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005534989,"about_ca_system_score_gemma":0.003014351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002225632,"about_ca_topic_score_gemma":0.003001274,"domain_scores_codex":[0.9983405,0.0006022945,0.00009659843,0.0003295209,0.0005356325,0.00009540913],"domain_scores_gemma":[0.9979013,0.001087002,0.0001232996,0.0002826325,0.0003898849,0.0002159596],"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.000008572682,0.00001266506,0.00009872841,0.0001615249,0.000005664224,0.00001726248,0.000204831,0.000138522,0.0001190163,0.8669472,0.1009316,0.03135438],"study_design_scores_gemma":[0.000007063915,0.000008374195,0.0002803183,0.0001317327,0.000006733503,0.00006273529,0.0001045516,0.0005116989,0.00007922434,0.5579001,0.4409013,0.000006128007],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.002858829,0.05047663,0.02948208,0.03959011,0.008659291,0.00006170324,0.0007646099,0.0005705875,0.8675362],"genre_scores_gemma":[0.1591336,0.06153746,0.02445958,0.008247657,0.02252523,0.0004045897,0.001282032,0.001201942,0.721208],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.08585935,"threshold_uncertainty_score":0.2872282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139371904","doi":"10.1007/s11786-014-0175-z","title":"Formal Analysis of Optical Systems","year":2014,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Photonic and Optical Devices","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Abstraction; Complement (music); Pencil (optics); Theoretical computer science; Automated theorem proving; Computer engineering; Physics; Optics","authors":[{"name":"Sanaz Khan-Afshar","is_ca":true},{"name":"Umair Siddique","is_ca":true},{"name":"Mohamed Yousri Mahmoud","is_ca":true},{"name":"Vincent Aravantinos","is_ca":true},{"name":"Ons Seddiki","is_ca":true},{"name":"Osman Hasan","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01262243156106682,"gpt":0.2334254782053058,"spread":0.220803046644239,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00168938,0.0006515693,0.0004807532,0.001747149,0.001041928,0.002876579,0.0009759928,0.0006885434,0.00511353],"category_scores_gemma":[0.004296451,0.0004372329,0.00107339,0.0008801424,0.003348852,0.004171094,0.001443185,0.001948473,0.0005859126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002112141,"about_ca_system_score_gemma":0.001100191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001775578,"about_ca_topic_score_gemma":0.001045213,"domain_scores_codex":[0.9985607,0.0005158483,0.00008059442,0.0001958771,0.0005005532,0.0001463714],"domain_scores_gemma":[0.9978934,0.001191998,0.0001737735,0.0002474107,0.0004267948,0.00006657838],"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.000005113995,0.000007477203,0.00004725053,0.00002168732,0.000004220548,0.00001248914,0.00009971268,0.001710882,0.0002764854,0.9943153,0.0004211948,0.003078148],"study_design_scores_gemma":[0.000004501003,0.000004425435,0.0000467185,0.00001261346,0.000004344793,0.00001538136,0.00003470566,0.009927274,0.0003214919,0.9854023,0.004221711,0.000004478575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03791732,0.002339959,0.8968168,0.00340739,0.000289065,0.00006071846,0.0002734274,0.0003403726,0.05855491],"genre_scores_gemma":[0.8698021,0.002109273,0.1066665,0.0006406719,0.0007177273,0.0001422456,0.0004069969,0.0002002953,0.01931412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00511353,"threshold_uncertainty_score":0.01710647,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050429600","doi":"10.1007/s11786-007-0010-x","title":"Pseudospectra of Matrix Polynomials that Are Expressed in Alternative Bases","year":2007,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Toronto; Western University","funders":"","keywords":"Mathematics; Matrix polynomial; Polynomial matrix; Basis (linear algebra); Lagrange polynomial; Vandermonde matrix; Polynomial interpolation; Matrix (chemical analysis); Lebesgue integration; Interpolation (computer graphics); Matrix analysis; Scalar (mathematics); Polynomial; Pure mathematics; Algebra over a field; Mathematical analysis; Eigenvalues and eigenvectors; Linear interpolation; Geometry; Computer science","authors":[{"name":"Robert M. Corless","is_ca":true},{"name":"Nargol Rezvani","is_ca":true},{"name":"Amirhossein Amiraslani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02013958722648946,"gpt":0.2952151792826439,"spread":0.2750755920561544,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001240091,0.001086813,0.0004765309,0.001875112,0.0007372926,0.002981349,0.0009689355,0.001174673,0.00820419],"category_scores_gemma":[0.005222395,0.0003982725,0.0006625323,0.00167996,0.001903115,0.004022053,0.001388872,0.002032682,0.001702421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003714607,"about_ca_system_score_gemma":0.000551035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001665024,"about_ca_topic_score_gemma":0.0002526083,"domain_scores_codex":[0.9985037,0.0003542471,0.00006836146,0.0001841143,0.0006698634,0.0002196944],"domain_scores_gemma":[0.997135,0.0008916549,0.0004201467,0.0006634067,0.0006023991,0.0002872415],"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.00008955174,0.00003952796,0.0002744729,0.00004736476,0.00001833627,0.0002388333,0.0001873195,0.002736871,0.006324939,0.9736969,0.0009668157,0.01537893],"study_design_scores_gemma":[0.00001790343,0.00007887983,0.0005457074,0.00003659699,0.000019274,0.000828888,0.0001711597,0.04099243,0.005340067,0.9465528,0.005354095,0.00006219566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.240518,0.0007093123,0.6965832,0.0008635216,0.001027092,0.00006993961,0.0003311349,0.0004561967,0.05944157],"genre_scores_gemma":[0.8682934,0.001252498,0.1043712,0.0005515206,0.0008742993,0.00009548949,0.0003525967,0.0004081422,0.0238008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00820419,"threshold_uncertainty_score":0.02744573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067675443","doi":"10.1007/s11786-010-0033-6","title":"Fast, Practical Algorithms for Computing All the Repeats in a String","year":2010,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Suffix array; Algorithm; Byte; Suffix tree; String searching algorithm; Computer science; Suffix; String (physics); Generalized suffix tree; Pattern matching; Compressed suffix array; Data structure; Mathematics","authors":[{"name":"Simon J. Puglisi","is_ca":false},{"name":"W.F. Smyth","is_ca":true},{"name":"Munina Yusufu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05655433533544037,"gpt":0.3537429007534002,"spread":0.2971885654179598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002363771,0.002635651,0.00192745,0.002806956,0.001780674,0.003470712,0.00370916,0.002338184,0.01143194],"category_scores_gemma":[0.0153161,0.001007329,0.001589502,0.004006229,0.001808472,0.007095273,0.003529622,0.004255143,0.006328175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001552368,"about_ca_system_score_gemma":0.003058688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001732995,"about_ca_topic_score_gemma":0.004471669,"domain_scores_codex":[0.9970805,0.0005984919,0.0002730358,0.0006494932,0.001169913,0.0002285644],"domain_scores_gemma":[0.9918384,0.004051533,0.000425464,0.002489537,0.000984629,0.0002104657],"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.0006632417,0.0002023661,0.001123844,0.0005160226,0.0001183112,0.0001066027,0.0003306273,0.03697527,0.01250196,0.07392929,0.0185942,0.8549383],"study_design_scores_gemma":[0.0004675537,0.0003252756,0.0007365121,0.0001096301,0.0001307954,0.0006273654,0.000359307,0.5353876,0.02158877,0.4198369,0.02032316,0.0001071826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006562877,0.0005971788,0.9870207,0.0002570953,0.0001368792,0.000104803,0.0002133543,0.003162017,0.001945119],"genre_scores_gemma":[0.0490067,0.0004567942,0.9458495,0.0001154319,0.0001474072,0.0002688437,0.000755902,0.0003618681,0.00303752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01143194,"threshold_uncertainty_score":0.03824365,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003890915","doi":"10.1007/s11786-013-0145-x","title":"Signature-based Perceptual Nearness: Application of Near Sets to Image Retrieval","year":2013,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Pattern recognition (psychology); Artificial intelligence; Image (mathematics); Similarity (geometry); Set (abstract data type); Pixel; Matching (statistics); Mathematics; Signature (topology); Image retrieval; Digital image; Feature (linguistics); Computer science; Feature vector; Computer vision; Image processing","authors":[{"name":"Christopher J. Henry","is_ca":true},{"name":"Sheela Ramanna","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01438558382856747,"gpt":0.2934001250738474,"spread":0.2790145412452799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001619681,0.0005583831,0.001423072,0.002731735,0.000705091,0.00179535,0.001096445,0.001018707,0.001998027],"category_scores_gemma":[0.009200308,0.0003633196,0.000801183,0.002508313,0.001288116,0.003392443,0.002279184,0.001171245,0.0006373479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006590865,"about_ca_system_score_gemma":0.0006936471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000773773,"about_ca_topic_score_gemma":0.0004904435,"domain_scores_codex":[0.9985381,0.0003423936,0.0000988702,0.000263382,0.0006845098,0.00007267255],"domain_scores_gemma":[0.9965522,0.001446418,0.0004110975,0.0006905024,0.000691423,0.0002084329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008280802,0.0003829117,0.002356461,0.0004749694,0.0001251604,0.0002785321,0.0004185914,0.1230402,0.09688179,0.1024286,0.002249677,0.670535],"study_design_scores_gemma":[0.00002954985,0.0003247415,0.001731736,0.00003340421,0.0000476586,0.0005450583,0.0001263953,0.8882632,0.02706472,0.07925422,0.002508422,0.00007093016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04126752,0.0005271591,0.9550068,0.0001173998,0.00007977401,0.00006907224,0.00009138375,0.0003145161,0.002526368],"genre_scores_gemma":[0.6098742,0.001058553,0.3852169,0.0001251626,0.0002219728,0.00009476277,0.000256617,0.0001316394,0.003020144],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002731735,"threshold_uncertainty_score":0.008565784,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977906522","doi":"10.1007/s11786-012-0136-3","title":"On Solving Parametric Polynomial Systems","year":2012,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Parametric statistics; Discriminant; Mathematics; Polynomial; Computation; Projection (relational algebra); Matrix polynomial; Pure mathematics; Algebra over a field; Alternating polynomial; Discrete mathematics; Applied mathematics; Mathematical analysis; Algorithm; Computer science; Artificial intelligence; Statistics","authors":[{"name":"Marc Moreno Maza","is_ca":true},{"name":"Bican Xia","is_ca":false},{"name":"Rong Xiao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02480472848550547,"gpt":0.2610001570369275,"spread":0.2361954285514221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001879705,0.001420968,0.001300798,0.001130053,0.001620995,0.002173298,0.002059621,0.001340344,0.01984717],"category_scores_gemma":[0.01115553,0.000701785,0.001473847,0.002298427,0.00272602,0.007396987,0.00604197,0.004721528,0.002029045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001412634,"about_ca_system_score_gemma":0.001235626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002676278,"about_ca_topic_score_gemma":0.003920231,"domain_scores_codex":[0.9980259,0.000617507,0.00008941843,0.0003398101,0.0006312549,0.0002960983],"domain_scores_gemma":[0.9961397,0.002599227,0.000117719,0.0007269985,0.0002940712,0.0001223143],"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.0001861223,0.00009867814,0.0007176322,0.0004192384,0.00006004301,0.00007583477,0.0006272834,0.05071753,0.002199419,0.7437035,0.01059798,0.1905968],"study_design_scores_gemma":[0.00003823829,0.00004310709,0.0001886926,0.00004260439,0.00003584998,0.00006093649,0.0001608236,0.1031885,0.001498286,0.8799686,0.01475876,0.00001555355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04704845,0.00133818,0.8642316,0.002797341,0.000439616,0.0002203632,0.0003079142,0.001235181,0.08238136],"genre_scores_gemma":[0.6026502,0.002127778,0.3482194,0.0009648085,0.0004925674,0.0002383804,0.001171532,0.0007625934,0.04337289],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01984717,"threshold_uncertainty_score":0.06639546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104191500","doi":"10.1007/s11786-014-0186-9","title":"The 3 ×  3 ×  3 Hyperdeterminant as a Polynomial in the Fundamental Invariants for $${{SL_3(\\mathbb{C}) \\times SL_3(\\mathbb{C}) \\times SL_3(\\mathbb{C})}}$$ S L 3 ( C ) × S L 3 ( C ) × S L 3 ( C )","year":2014,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Saskatchewan","funders":"","keywords":"Invariant theory; Invariant (physics); Polynomial; Algebra over a field; Action (physics); Alternating polynomial; Invariant polynomial; Group theory","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.05852512899978808,"gpt":0.3559044107329234,"spread":0.2973792817331353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000967685,0.0009686148,0.0005671105,0.003129902,0.001825894,0.00305457,0.001426922,0.001842137,0.01035679],"category_scores_gemma":[0.001927512,0.0004967954,0.001078359,0.001211958,0.00400392,0.003654477,0.001723216,0.002609267,0.001061675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002032924,"about_ca_system_score_gemma":0.001313955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001817397,"about_ca_topic_score_gemma":0.002044701,"domain_scores_codex":[0.9991527,0.0001525143,0.00002772055,0.0001776417,0.0002152036,0.000274204],"domain_scores_gemma":[0.9988865,0.0003008705,0.0002197459,0.0001040285,0.0001383532,0.0003504968],"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.00008558988,0.00005072634,0.0003013948,0.0000213859,0.000007262419,0.0001726003,0.0003208423,0.0009513272,0.003891113,0.9857653,0.001333173,0.007099157],"study_design_scores_gemma":[0.00004279715,0.00007014487,0.001768472,0.00002226211,0.00001791262,0.0004036936,0.0001827732,0.01990808,0.003705213,0.9689738,0.004807341,0.00009746521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8524008,0.0003482726,0.07513252,0.002309277,0.0007793486,0.00007512272,0.0003547143,0.0006288125,0.0679711],"genre_scores_gemma":[0.9805813,0.0001671868,0.007043435,0.0003301681,0.000349499,0.00003654514,0.0001563959,0.0003254578,0.01100988],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01035679,"threshold_uncertainty_score":0.03464687,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2771217056","doi":"10.1007/s11786-018-0364-2","title":"Minimal Height Companion Matrices for Euclid Polynomials","year":2018,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lambda; Mathematics; Integer (computer science); Combinatorics; Algebra over a field; Pure mathematics; Physics; Quantum mechanics; Computer science","authors":[{"name":"Eunice Y. S. Chan","is_ca":true},{"name":"Robert M. Corless","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0187788676311769,"gpt":0.2507788742923151,"spread":0.2320000066611382,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003347585,0.000531456,0.0004078152,0.0008979107,0.0008609463,0.001608335,0.0006273068,0.0006244783,0.009125547],"category_scores_gemma":[0.003004697,0.0002887124,0.0002710954,0.0009625853,0.001072451,0.001603138,0.001427814,0.001728092,0.001348235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006978432,"about_ca_system_score_gemma":0.0005729557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005851762,"about_ca_topic_score_gemma":0.0008485197,"domain_scores_codex":[0.999527,0.00009066715,0.00001873231,0.00009075642,0.0001670628,0.0001058018],"domain_scores_gemma":[0.9986999,0.0005543859,0.0001890551,0.0001225017,0.0001865971,0.0002475332],"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.0001376346,0.00004386988,0.0002959844,0.00006925741,0.000007619293,0.0001388257,0.0003833315,0.004137353,0.006743654,0.9604023,0.003650856,0.02398927],"study_design_scores_gemma":[0.00003620732,0.0000665054,0.0004686362,0.00001841127,0.000007578408,0.0001893424,0.0001505617,0.01787317,0.00329298,0.9712453,0.006623389,0.00002801687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.436975,0.0006442331,0.4817155,0.001518302,0.000366167,0.0001115302,0.0007395487,0.0006174878,0.07731225],"genre_scores_gemma":[0.9373558,0.0004141263,0.04410408,0.0002928048,0.000255898,0.00007382311,0.0004388765,0.0001304718,0.01693414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009125547,"threshold_uncertainty_score":0.03052807,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3003474032","doi":"10.1007/s11786-020-00458-0","title":"Calculation and Properties of Zonal Polynomials","year":2020,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Polynomial; Representation (politics); Symmetric polynomial; Algebra over a field; Symbolic computation; Differential (mechanical device); Multivariate statistics","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.08944298529576389,"gpt":0.3068864308924438,"spread":0.2174434455966799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008410416,0.0004390683,0.000460103,0.003026275,0.001473951,0.003020792,0.001220892,0.0004639063,0.00743539],"category_scores_gemma":[0.004603953,0.0002933233,0.0005907825,0.002687607,0.002937583,0.004208314,0.001645459,0.001625254,0.001048648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001315491,"about_ca_system_score_gemma":0.0007943957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002076011,"about_ca_topic_score_gemma":0.001684988,"domain_scores_codex":[0.9994299,0.0001173082,0.00002650034,0.0001053627,0.0002232513,0.00009773082],"domain_scores_gemma":[0.9987878,0.000526923,0.000159809,0.0001396364,0.000255459,0.0001303418],"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.00002762652,0.00001467829,0.0004890463,0.00003708991,0.000005907919,0.00003485132,0.0001818314,0.0008738216,0.0008891535,0.9864421,0.0007201992,0.01028373],"study_design_scores_gemma":[0.00001179429,0.00001820513,0.0008673904,0.00001890238,0.00001173652,0.000178569,0.00009931871,0.006150098,0.001736988,0.9831828,0.007700408,0.00002370467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.538159,0.003190844,0.2500415,0.002116113,0.0004653717,0.0001074501,0.0006278106,0.0004265475,0.2048654],"genre_scores_gemma":[0.9403225,0.001032962,0.03695677,0.0001531885,0.0003326662,0.00004589501,0.0002635364,0.0001328766,0.02075955],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00743539,"threshold_uncertainty_score":0.02487385,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2346641114","doi":"10.1007/s11786-016-0273-1","title":"Topological Sorting of Finitely Near Sets","year":2016,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Disjoint sets; Mathematics; Topological space; Sorting; Combinatorics; Closed set; Space (punctuation); Topology (electrical circuits); Set (abstract data type); Discrete mathematics; Algorithm; Computer science","authors":[{"name":"I. Dochviri","is_ca":false},{"name":"James F. Peters","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04279358418637936,"gpt":0.2918718828044226,"spread":0.2490782986180433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001297881,0.0003188727,0.0009276341,0.003210125,0.002717966,0.006203297,0.001542253,0.001240268,0.006171304],"category_scores_gemma":[0.01494664,0.0004811871,0.0006946023,0.002833047,0.002622052,0.006927778,0.002816474,0.001556678,0.0007586372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001835825,"about_ca_system_score_gemma":0.00141965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001111508,"about_ca_topic_score_gemma":0.001285704,"domain_scores_codex":[0.9984547,0.0003674454,0.0001437078,0.0003171104,0.0005377205,0.0001793268],"domain_scores_gemma":[0.9888469,0.0056826,0.001316382,0.001583347,0.001580594,0.0009900617],"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.0002953165,0.0001110222,0.004623058,0.0001190923,0.00003452931,0.0002224354,0.000946402,0.009367441,0.003957565,0.9516727,0.001357466,0.02729278],"study_design_scores_gemma":[0.00002279843,0.00007609282,0.001541439,0.00005767599,0.00003679735,0.0003865407,0.0008653458,0.03388299,0.003757844,0.9526066,0.006733702,0.00003215392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7675763,0.0004826004,0.2092503,0.0009102175,0.00009099888,0.00006318547,0.0006007043,0.0005662433,0.02045933],"genre_scores_gemma":[0.9401204,0.0002797883,0.04781438,0.0001490199,0.0000682484,0.00006632006,0.001422942,0.0001132832,0.009965575],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006203297,"threshold_uncertainty_score":0.02064508,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2609945833","doi":"10.1007/s11786-017-0320-6","title":"Branch Structure and Implementation of Lambert W","year":2017,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Sports Dynamics and Biomechanics","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Computer science; Algebra over a field; Arithmetic; Algorithm; Pure mathematics","authors":[{"name":"David J. Jeffrey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008311430262110866,"gpt":0.2604206133191566,"spread":0.2521091830570458,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001674033,0.0004534573,0.0006206595,0.001490966,0.001032812,0.002188414,0.001954898,0.001534153,0.01564294],"category_scores_gemma":[0.009063487,0.0005322364,0.0006213324,0.001334455,0.001036668,0.002864699,0.002512585,0.001791839,0.005317522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008662192,"about_ca_system_score_gemma":0.001389427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001852482,"about_ca_topic_score_gemma":0.002236093,"domain_scores_codex":[0.9988719,0.0002838658,0.00008540201,0.0001857346,0.0003713988,0.0002017576],"domain_scores_gemma":[0.9973616,0.0008307918,0.0001180033,0.0009116651,0.0006296324,0.0001482161],"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.0005203183,0.000237671,0.002043673,0.00008866421,0.00003678144,0.0001335973,0.0004624315,0.03435449,0.01067042,0.6537496,0.008626635,0.2890757],"study_design_scores_gemma":[0.0001048756,0.0001386667,0.0004405849,0.00004873257,0.0000294796,0.00009340904,0.0001049687,0.6058497,0.01890721,0.3546906,0.01955574,0.00003604211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02875239,0.00007677348,0.9538284,0.0002063696,0.0000592772,0.00005788097,0.0001002961,0.003158684,0.01375989],"genre_scores_gemma":[0.4586531,0.0001487777,0.5142514,0.0002031412,0.00006360925,0.0002989381,0.0005888188,0.001451504,0.02434087],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01564294,"threshold_uncertainty_score":0.05233085,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3005566958","doi":"10.1007/s11786-020-00457-1","title":"Problem Solving as a Path to Comprehension","year":2020,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Cognitive and developmental aspects of mathematical skills","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trent University","funders":"","keywords":"Comprehension; Mathematical notation; Computer science; Notation; Usability; Mathematical software; Software; Human–computer interaction; Mathematical problem; User interface; Artificial intelligence; Mathematics education; Mathematics; Programming language","authors":[{"name":"Seyeon Kim","is_ca":true},{"name":"Marco Pollanen","is_ca":true},{"name":"Michael Reynolds","is_ca":true},{"name":"Wesley S. Burr","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0520391503404732,"gpt":0.3097761538726907,"spread":0.2577370035322175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001262419,0.0003140084,0.0002128151,0.001186201,0.0006826463,0.004485332,0.0008684794,0.001435756,0.006585759],"category_scores_gemma":[0.01027824,0.0004023281,0.0003740052,0.0009663408,0.003702381,0.005953786,0.001523366,0.003081203,0.0007585211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001184104,"about_ca_system_score_gemma":0.003390017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003822319,"about_ca_topic_score_gemma":0.00239237,"domain_scores_codex":[0.9987312,0.0006036466,0.00004261045,0.0002351022,0.0002837143,0.0001037428],"domain_scores_gemma":[0.9934754,0.004024156,0.0006482233,0.0004335607,0.000957347,0.0004613623],"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.00009899802,0.0003288964,0.02370918,0.000273625,0.00004745042,0.00100072,0.01918703,0.004490243,0.008261047,0.8645161,0.002193546,0.07589318],"study_design_scores_gemma":[0.00002939717,0.0001225975,0.03851724,0.0001643712,0.00003478425,0.0007402782,0.005216342,0.007045787,0.004934428,0.9247547,0.01840079,0.00003924442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5455416,0.002478621,0.1053228,0.008920779,0.00007430686,0.0001875042,0.0005181903,0.0004870698,0.3364691],"genre_scores_gemma":[0.9575871,0.0008844112,0.03530463,0.0002460221,0.00001538398,0.0001156932,0.0002520818,0.00007886351,0.005515777],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006585759,"threshold_uncertainty_score":0.02203155,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018051263","doi":"10.1007/s11786-013-0144-y","title":"Flow Graphs: Analysis with Near Sets","year":2013,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Flow (mathematics); Mathematics; Computer science; Combinatorics; Geometry","authors":[{"name":"Sheela Ramanna","is_ca":true},{"name":"Doungrat Chitcharoen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01554929231676407,"gpt":0.2345312868809513,"spread":0.2189819945641872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002997801,0.0007950296,0.00118903,0.004719556,0.001255582,0.00290065,0.001443975,0.001292612,0.006127237],"category_scores_gemma":[0.0142765,0.0006525257,0.001633294,0.003138518,0.002137399,0.006957724,0.002323703,0.002065646,0.0006205146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001430235,"about_ca_system_score_gemma":0.0009118918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00205707,"about_ca_topic_score_gemma":0.0009516322,"domain_scores_codex":[0.9987079,0.000652648,0.00005435579,0.000252266,0.0002636431,0.00006921397],"domain_scores_gemma":[0.9946109,0.003611092,0.0004593002,0.0004925375,0.0004952978,0.0003309402],"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.00005705424,0.00005260923,0.0005398404,0.00009711717,0.00004050605,0.00005132167,0.0001553745,0.048383,0.0003935298,0.9157075,0.001864936,0.03265723],"study_design_scores_gemma":[0.000008195022,0.00002120684,0.0001454306,0.00002336603,0.00002496002,0.0000287892,0.00005838847,0.1937403,0.0001897429,0.8034598,0.002288828,0.00001102717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01558032,0.0005017159,0.9800239,0.0003474887,0.00007094019,0.00005180631,0.0001595725,0.0001565277,0.003107695],"genre_scores_gemma":[0.4977164,0.002291941,0.4845432,0.0003460319,0.0004232425,0.0003890976,0.0006853113,0.0003034668,0.01330125],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006127237,"threshold_uncertainty_score":0.02049768,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2583611270","doi":"10.1007/s11786-016-0288-7","title":"Palindromic Subsequence Automata and Longest Common Palindromic Subsequence","year":2017,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Subsequence; Palindrome; Longest increasing subsequence; Automaton; Combinatorics; Longest common subsequence problem; Mathematics; Palindromic sequence; Discrete mathematics; Computer science; Theoretical computer science; Genetics; Biology","authors":[{"name":"Md. Mahbubul Hasan","is_ca":false},{"name":"A. S. M. Sohidull Islam","is_ca":true},{"name":"M. Sohel Rahman","is_ca":false},{"name":"Ayon Sen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02976186163097517,"gpt":0.2988133188211195,"spread":0.2690514571901443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001135763,0.0006064611,0.001021959,0.002401982,0.001717121,0.002504067,0.001983399,0.001454929,0.006629006],"category_scores_gemma":[0.01076574,0.0004934985,0.001227795,0.003401605,0.002257145,0.00579169,0.001812448,0.001742728,0.00178504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001001637,"about_ca_system_score_gemma":0.00106273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008059031,"about_ca_topic_score_gemma":0.0008775548,"domain_scores_codex":[0.9982095,0.00035333,0.0002646925,0.000608806,0.0004318382,0.0001319135],"domain_scores_gemma":[0.991551,0.00395393,0.0007938684,0.002246669,0.00120613,0.0002483457],"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.0003257224,0.0001120669,0.00172062,0.000245661,0.00005093528,0.0005746711,0.0006936853,0.02025688,0.006800525,0.8847619,0.002263717,0.08219345],"study_design_scores_gemma":[0.00001767289,0.00009669555,0.000263571,0.00004828762,0.00003436654,0.0004921039,0.0001759581,0.09371074,0.003987452,0.8947255,0.006418685,0.00002885603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1282108,0.001698136,0.8478943,0.0007062143,0.0004787555,0.0001390088,0.0008437862,0.001756403,0.0182726],"genre_scores_gemma":[0.7331215,0.0008488345,0.2517537,0.0003889928,0.0003698763,0.0003071782,0.001501156,0.0004574725,0.01125135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006629006,"threshold_uncertainty_score":0.02217627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4297880405","doi":"10.1007/s11786-022-00534-7","title":"Factoring Multivariate Polynomials Represented by Black Boxes: A Maple + C Implementation","year":2022,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Toeplitz matrix; Mathematics; Polynomial; Polynomial matrix; Sylvester matrix; Difference polynomials; Multivariate statistics; Algorithm; Algebra over a field; Discrete mathematics; Combinatorics; Matrix polynomial; Pure mathematics; Orthogonal polynomials","authors":[{"name":"Tian Chen","is_ca":true},{"name":"Michael Monagan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02432263382272556,"gpt":0.3023487761771989,"spread":0.2780261423544734,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009659367,0.001458351,0.0009959447,0.001005204,0.0008501249,0.002181685,0.002520225,0.00117729,0.04936955],"category_scores_gemma":[0.005001221,0.001026293,0.001578289,0.001399182,0.0008574871,0.003411029,0.003175666,0.00166419,0.01434409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008134658,"about_ca_system_score_gemma":0.001261954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003699424,"about_ca_topic_score_gemma":0.003799398,"domain_scores_codex":[0.9990653,0.0001262869,0.00006351952,0.0002221113,0.0002977238,0.0002251044],"domain_scores_gemma":[0.9984657,0.0005085183,0.00007942064,0.0005386225,0.0002955104,0.0001123062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002677955,0.0003834166,0.002554109,0.0007772258,0.0002360794,0.0006551261,0.000634545,0.02604933,0.03745018,0.09215929,0.08510944,0.7513133],"study_design_scores_gemma":[0.00108734,0.0003991527,0.00120748,0.0003231476,0.0002276045,0.000668251,0.0002593979,0.4802139,0.1592601,0.131071,0.2250097,0.0002730009],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.01032981,0.0001339611,0.9237984,0.0001218269,0.00009162736,0.0001078383,0.0004864782,0.05652171,0.0084084],"genre_scores_gemma":[0.172484,0.0002141236,0.797222,0.0003734838,0.00009504642,0.0002863112,0.001329824,0.01332785,0.01466738],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.04936955,"threshold_uncertainty_score":0.1651576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3155462286","doi":"10.1007/s11786-021-00507-2","title":"Phylogenetics of Indo-European Language Families via an Algebro-Geometric Analysis of Their Syntactic Structures","year":2021,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Language and cultural evolution","field":"Social Sciences","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 Toronto; Perimeter Institute","funders":"","keywords":"Germanic languages; Historical linguistics; Slavic languages; Indo-European languages; Computer science; Set (abstract data type); Phylogenetic tree; Linguistics; Romance languages; Mathematics; Programming language; Biology; German","authors":[{"name":"Kevin Shu","is_ca":false},{"name":"Andrew Ortegaray","is_ca":false},{"name":"Robert C. Berwick","is_ca":false},{"name":"Matilde Marcolli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01892453345003019,"gpt":0.2947455989421328,"spread":0.2758210654921026,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005200576,0.0001447319,0.0001990956,0.002061803,0.001591687,0.001547244,0.0004335522,0.0004162252,0.003554728],"category_scores_gemma":[0.002320915,0.0001708733,0.0003413213,0.002046431,0.001364382,0.001603343,0.0008182481,0.0005096207,0.0003008905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006932347,"about_ca_system_score_gemma":0.0003585853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002411732,"about_ca_topic_score_gemma":0.003171626,"domain_scores_codex":[0.9996873,0.0001521517,0.00001364817,0.0000596748,0.00003408827,0.0000530496],"domain_scores_gemma":[0.9989578,0.0005691552,0.0001288654,0.00008107491,0.0002020411,0.00006110081],"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.0002437592,0.00005959875,0.0387231,0.00006715018,0.0001010668,0.0004609037,0.006564985,0.009086918,0.008827663,0.8767613,0.001083293,0.05802033],"study_design_scores_gemma":[0.00004594375,0.0001056168,0.2434325,0.0001372327,0.0001791471,0.001700989,0.005766563,0.07719938,0.002427613,0.6387736,0.03014435,0.00008712035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9565269,0.0005378116,0.02734932,0.000388386,0.00001378038,0.00001044627,0.0002031598,0.00005607488,0.01491413],"genre_scores_gemma":[0.9903016,0.0001966824,0.007939448,0.00003085486,0.00001458303,0.00001203507,0.0002216056,0.00003103964,0.001252215],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003554728,"threshold_uncertainty_score":0.01189178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029410925","doi":"10.1007/s11786-007-0040-4","title":"The Computational Complexity of Extrapolation Methods","year":2008,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Extrapolation; Mathematics; Polynomial; Applied mathematics; Computational complexity theory; Algorithm; Ordinary differential equation; Mathematical optimization; Differential equation; Mathematical analysis","authors":[{"name":"Silvana Ilie","is_ca":false},{"name":"Robert M. Corless","is_ca":true},{"name":"Chris Essex","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.297797761049804,"gpt":0.4617480980965442,"spread":0.1639503370467402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005295828,0.0009400482,0.001532992,0.001232298,0.001404279,0.003079795,0.002303343,0.001872403,0.009768172],"category_scores_gemma":[0.05199479,0.0007124253,0.001354006,0.001595662,0.003199401,0.009273624,0.003634786,0.005232926,0.001555291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00128786,"about_ca_system_score_gemma":0.001892979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002824601,"about_ca_topic_score_gemma":0.002540008,"domain_scores_codex":[0.9950026,0.002479937,0.0002360114,0.000410464,0.001556113,0.0003148363],"domain_scores_gemma":[0.9405294,0.0522603,0.0008552994,0.003537412,0.002302155,0.0005154358],"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.001075042,0.000221729,0.003490929,0.0008512987,0.0001569073,0.0003711307,0.0005324828,0.2495962,0.003232373,0.5786674,0.02090273,0.1409018],"study_design_scores_gemma":[0.00006406101,0.00003286978,0.0005542274,0.00006731718,0.00002996243,0.00008830761,0.00007946893,0.6082344,0.001048449,0.3868987,0.002879398,0.00002289954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1238493,0.00849898,0.7942573,0.01549123,0.001074541,0.0001833998,0.0009406929,0.001040036,0.05466451],"genre_scores_gemma":[0.707377,0.005038229,0.2669322,0.001112888,0.001449966,0.0004411823,0.001222996,0.0007579488,0.01566751],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009768172,"threshold_uncertainty_score":0.03267777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963295477","doi":"10.1007/s11786-020-00477-x","title":"A Short Contribution to the Theory of Regular Chains","year":2020,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Polynomial and algebraic computation","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":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Computation; Context (archaeology); Differential (mechanical device); Mathematics; Mathematical economics; Computer science; Algebra over a field; Pure mathematics; Algorithm; Engineering; History","authors":[{"name":"François Boulier","is_ca":false},{"name":"François Lemaire","is_ca":false},{"name":"Marc Moreno Maza","is_ca":true},{"name":"Adrien Poteaux","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02465842990380594,"gpt":0.2516511212117934,"spread":0.2269926913079875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001257536,0.00140097,0.0009362252,0.002569971,0.002100542,0.003340744,0.001756792,0.00228702,0.02431842],"category_scores_gemma":[0.00493296,0.000602896,0.001495571,0.003428028,0.003141477,0.009079614,0.003692123,0.005019859,0.009589564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001340129,"about_ca_system_score_gemma":0.0008587321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007670994,"about_ca_topic_score_gemma":0.0007246963,"domain_scores_codex":[0.9986571,0.0002691313,0.00008619196,0.0003983464,0.0004524892,0.0001367346],"domain_scores_gemma":[0.9968495,0.001783149,0.0001441351,0.0004460625,0.0004701693,0.0003069903],"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.00009402791,0.00006635884,0.0003215431,0.0005464293,0.00003651155,0.0001823343,0.0002429793,0.001833769,0.001411789,0.8708178,0.05667774,0.06776878],"study_design_scores_gemma":[0.000008978674,0.0000283785,0.000167405,0.00009782637,0.00002257536,0.0001566126,0.00004265582,0.002437316,0.0003746756,0.8539978,0.1426417,0.00002419231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01623902,0.05419408,0.5582824,0.03184513,0.05552896,0.0001174495,0.001398075,0.0015968,0.280798],"genre_scores_gemma":[0.2975459,0.07365959,0.2445159,0.01393302,0.1122876,0.0002881098,0.002875497,0.002214583,0.2526798],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02431842,"threshold_uncertainty_score":0.08135325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2600164031","doi":"10.1007/s11786-017-0312-6","title":"Mathematics in Computer Science: After 10 Years","year":2017,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Computability, Logic, AI Algorithms","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":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Mathematics education; Computer science; Algebra over a field; Pure mathematics","authors":[{"name":"Ilias Kotsireas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03030883264722834,"gpt":0.2968656084747126,"spread":0.2665567758274842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02010176,0.001725232,0.001170909,0.004635129,0.003764543,0.01095948,0.001504395,0.003974242,0.02649102],"category_scores_gemma":[0.02247973,0.0004814365,0.001034669,0.004041848,0.009773354,0.01344745,0.009080625,0.008923016,0.007799639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01137182,"about_ca_system_score_gemma":0.01417441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004952648,"about_ca_topic_score_gemma":0.008846418,"domain_scores_codex":[0.9935888,0.001982569,0.0004603184,0.0006252429,0.002282548,0.001060532],"domain_scores_gemma":[0.9801891,0.003630561,0.0008315935,0.001370519,0.007751825,0.006226513],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002738225,0.0003373172,0.00188724,0.001321045,0.00009858417,0.0001964835,0.001869231,0.0006067166,0.0007135995,0.2938838,0.4304529,0.2683594],"study_design_scores_gemma":[0.00002037557,0.0001073091,0.002518278,0.0007352538,0.00002034753,0.0001371064,0.0007155406,0.0002338695,0.0002720146,0.03316328,0.9620558,0.00002088288],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.01243302,0.50246,0.008525493,0.3023381,0.1110708,0.0001449529,0.0007872833,0.0003087698,0.06193166],"genre_scores_gemma":[0.257265,0.3451954,0.01954686,0.08438507,0.09718821,0.000346906,0.001729447,0.0009585157,0.1933847],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.02649102,"threshold_uncertainty_score":0.1063095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401820908","doi":"10.1007/s11786-024-00590-1","title":"Applications of Rational Orthogonal Matrices","year":2024,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Matrix Theory and Algorithms","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":"Western University","funders":"","keywords":"Mathematics; Algebra over a field; Computer science; Pure mathematics","authors":[{"name":"Johannes Middeke","is_ca":true},{"name":"David J. Jeffrey","is_ca":true},{"name":"Aishat Olagunju","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.014074862802703,"gpt":0.2790660317597138,"spread":0.2649911689570109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005896813,0.0006840204,0.0004639388,0.001532293,0.0005947712,0.001544103,0.0004537782,0.0005467302,0.006763518],"category_scores_gemma":[0.004695552,0.000240555,0.0004419694,0.001244446,0.001421865,0.001250499,0.001743995,0.001001428,0.001261628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005558936,"about_ca_system_score_gemma":0.0005260796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005638067,"about_ca_topic_score_gemma":0.0005680321,"domain_scores_codex":[0.9993672,0.0002143534,0.00003236972,0.0000931301,0.0002104247,0.00008252262],"domain_scores_gemma":[0.9989917,0.0004091473,0.0001085754,0.0001629328,0.0002411781,0.00008652957],"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.0000595758,0.00002185085,0.0002962862,0.00008513631,0.000009337228,0.0001087657,0.0001124688,0.006496953,0.003565827,0.9214338,0.001919648,0.06589027],"study_design_scores_gemma":[0.00002645901,0.00005348906,0.000263613,0.00005694848,0.00001432744,0.0004868696,0.0001271446,0.06780105,0.004600598,0.8944725,0.03206975,0.00002717869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08390943,0.006607435,0.6968295,0.002055072,0.001648763,0.00007550029,0.0001166592,0.0007098305,0.2080479],"genre_scores_gemma":[0.7785141,0.007567283,0.1793751,0.0005071744,0.001353474,0.00006530043,0.0001430835,0.000256464,0.03221806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006763518,"threshold_uncertainty_score":0.02262622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389001533","doi":"10.1007/s11786-023-00574-7","title":"Some Polynomial Conditions for Cyclic Quadrilaterals, Tilted Kites and Other Quadrilaterals","year":2023,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Mathematics and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Quadrilateral; Mathematics; Euclidean geometry; Computation; Polynomial; Regular polygon; Combinatorics; Geometry; Mathematical analysis; Algorithm; Finite element method; Structural engineering; Engineering","authors":[{"name":"Manuele Santoprete","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08699299893677097,"gpt":0.3753170493473945,"spread":0.2883240504106235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00148084,0.001073532,0.001403851,0.00212865,0.001886375,0.002631117,0.001994768,0.001540725,0.02314679],"category_scores_gemma":[0.009892144,0.0007414042,0.001578647,0.001809588,0.00343286,0.00487616,0.002558268,0.00432463,0.002852778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001527334,"about_ca_system_score_gemma":0.001270849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0043088,"about_ca_topic_score_gemma":0.005152978,"domain_scores_codex":[0.9988778,0.000215817,0.00008801523,0.0002326739,0.0002916979,0.0002939507],"domain_scores_gemma":[0.9954887,0.002548208,0.000380823,0.0002640612,0.0008099434,0.0005082454],"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.0002711994,0.00007710828,0.0005635851,0.0002381149,0.00001972023,0.0003534731,0.0003986759,0.008012161,0.004456684,0.9593226,0.00807296,0.01821365],"study_design_scores_gemma":[0.0001107812,0.0001461296,0.0007886131,0.00007279823,0.00003482042,0.0003043895,0.0006010716,0.04052065,0.004330893,0.9418656,0.01114871,0.00007563007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3038475,0.002048519,0.4650102,0.003073455,0.00157804,0.0004884177,0.00257289,0.0007594615,0.2206216],"genre_scores_gemma":[0.8834062,0.001396266,0.06600235,0.0007220964,0.0009264344,0.0003005438,0.002822911,0.0005346687,0.04388852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02314679,"threshold_uncertainty_score":0.07743371,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3035945966","doi":"10.1007/s11786-020-00483-z","title":"Symmetry-Based Algorithms for Invertible Mappings of Polynomially Nonlinear PDE to Linear PDE","year":2020,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Differential algebra; Ode; Invertible matrix; Algebra over a field; Uniqueness; Nonlinear system; Polynomial; Homogeneous space; Algorithm; Pure mathematics; Applied mathematics; Mathematical analysis","authors":[{"name":"Zahra Mohammadi","is_ca":true},{"name":"Gregory J. Reid","is_ca":true},{"name":"S.-L. Tracy Huang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03981148747950762,"gpt":0.302600018488748,"spread":0.2627885310092404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001338589,0.0007645951,0.0006920277,0.0009368696,0.0005179652,0.001021376,0.001294319,0.0008447763,0.006139573],"category_scores_gemma":[0.006119584,0.0004686492,0.001289218,0.0006537524,0.001170963,0.00195766,0.002839551,0.002689524,0.001584473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005856002,"about_ca_system_score_gemma":0.001124562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001352831,"about_ca_topic_score_gemma":0.001601988,"domain_scores_codex":[0.9994461,0.0001846008,0.00004114383,0.00009394675,0.0001796244,0.00005460459],"domain_scores_gemma":[0.9980589,0.001166289,0.0001087478,0.0002658514,0.000305116,0.00009521399],"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.0002321072,0.0002186139,0.0007688157,0.0002146023,0.00006770806,0.0001582759,0.0003654355,0.1798047,0.01444535,0.480661,0.005095475,0.317968],"study_design_scores_gemma":[0.00003421355,0.00006457183,0.00008799029,0.0000119731,0.000009360335,0.00006072127,0.00003609008,0.8466902,0.003245194,0.1474855,0.00226152,0.00001252208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007135874,0.0000678838,0.9908727,0.00007494521,0.00005227689,0.00003446551,0.00001913876,0.0002080807,0.001534646],"genre_scores_gemma":[0.1997907,0.0003332162,0.7898294,0.0001332195,0.0001257321,0.0001947793,0.0002396343,0.000522931,0.008830295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006139573,"threshold_uncertainty_score":0.02053893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4365455748","doi":"10.1007/s11786-023-00557-8","title":"Foreword","year":2023,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Computer science","authors":[{"name":"Ilias Kotsireas","is_ca":true},{"name":"Dimitris E. Simos","is_ca":false},{"name":"Ali Kemal Uncu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05849244152024106,"gpt":0.3238741975548891,"spread":0.265381756034648,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001345959,0.0009947773,0.0009005689,0.001772614,0.002020571,0.004550831,0.001329061,0.003702736,0.3278489],"category_scores_gemma":[0.01077831,0.0002978574,0.0006972313,0.0009786433,0.0008864314,0.002973901,0.002538777,0.005262684,0.3477909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00181011,"about_ca_system_score_gemma":0.002720225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002135265,"about_ca_topic_score_gemma":0.003829153,"domain_scores_codex":[0.9988569,0.0001529278,0.0000611344,0.0001729928,0.0006260801,0.0001300243],"domain_scores_gemma":[0.9948797,0.0008289236,0.0002305243,0.0003454293,0.00258739,0.001128026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000995482,0.000004830829,0.00001464399,0.00004065207,0.000001111614,0.00001201641,0.000007274703,0.000005824897,0.00005304568,0.001684258,0.9833287,0.0148377],"study_design_scores_gemma":[0.000004315734,0.000007548144,0.00006272781,0.00008052897,0.000001971753,0.00003258132,0.00001398364,0.00001055865,0.00005943029,0.001473253,0.9982503,0.000002703887],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0003120392,0.01370703,0.002150171,0.1339318,0.528782,0.0001938234,0.001529859,0.0007492183,0.3186441],"genre_scores_gemma":[0.002082457,0.004714689,0.0007475071,0.05483457,0.0805116,0.0001475659,0.0009924141,0.0006001481,0.855369],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.6721511,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3082404028","doi":"10.1007/s11786-020-00475-z","title":"Foreword","year":2020,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Polynomial and algebraic computation","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 Waterloo","funders":"","keywords":"Computer science; Mathematics","authors":[{"name":"George Labahn","is_ca":true},{"name":"James H. Davenport","is_ca":false},{"name":"Josef Urban","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03062298929035083,"gpt":0.2539979995728978,"spread":0.223375010282547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001130329,0.0009204443,0.0008058667,0.001697576,0.001902005,0.004131266,0.001304785,0.002826623,0.4362795],"category_scores_gemma":[0.007943937,0.000275532,0.0005991183,0.001007404,0.0007286665,0.002816508,0.002597769,0.004077687,0.4581577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0016747,"about_ca_system_score_gemma":0.00246738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001927775,"about_ca_topic_score_gemma":0.00379316,"domain_scores_codex":[0.9991096,0.0001162526,0.00004199888,0.0001408906,0.0004831751,0.0001079979],"domain_scores_gemma":[0.996537,0.0004849709,0.0001539458,0.0002472703,0.001636591,0.0009403127],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001143559,0.000006322635,0.00001901575,0.00004254594,9.959274e-7,0.00001387983,0.00001009658,0.000007095976,0.00006440195,0.001905613,0.9761237,0.02179492],"study_design_scores_gemma":[0.000003679508,0.000006514298,0.00005707411,0.0000652326,0.000001325724,0.00002917121,0.00001563462,0.000009282069,0.0000513205,0.001274512,0.9984841,0.000002295671],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"editorial","genre_scores_codex":[0.000451497,0.01470642,0.002573953,0.1057476,0.3630141,0.0002366651,0.002203893,0.001039049,0.5100268],"genre_scores_gemma":[0.001533459,0.00317045,0.0005681521,0.02727721,0.03535893,0.0001060971,0.0009776433,0.0004812636,0.9305268],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.4362795,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4235684925","doi":"10.1007/s11786-019-00391-x","title":"Foreword","year":2019,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Polynomial and algebraic computation","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":"Wilfrid Laurier University; École de Technologie Supérieure","funders":"","keywords":"Computer science; Mathematics","authors":[{"name":"Michel Beaudin","is_ca":true},{"name":"Thierry Dana-Picard","is_ca":false},{"name":"Alexander Levin","is_ca":false},{"name":"Christoph Koutschan","is_ca":false},{"name":"Ilias Kotsireas","is_ca":true},{"name":"Daniel Robertz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0138625784130462,"gpt":0.2447117283599842,"spread":0.230849149946938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001171413,0.0009237772,0.0007957887,0.001655735,0.001897809,0.004106057,0.001305288,0.002970473,0.4013368],"category_scores_gemma":[0.008320427,0.0002700738,0.0006031431,0.0009762257,0.0007679902,0.002812053,0.002625234,0.004238634,0.4179261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001703531,"about_ca_system_score_gemma":0.002533942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001854115,"about_ca_topic_score_gemma":0.003555562,"domain_scores_codex":[0.9990752,0.0001234564,0.00004486517,0.0001478453,0.0004977034,0.0001109389],"domain_scores_gemma":[0.9964166,0.0005104649,0.0001636954,0.0002566327,0.001691341,0.0009612464],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001166497,0.000006312207,0.00001902825,0.00004479499,0.00000106919,0.0000146303,0.00001009804,0.000007226953,0.00006350389,0.002010196,0.9756613,0.02215018],"study_design_scores_gemma":[0.000003721488,0.000006618238,0.00005630349,0.00006878345,0.000001394697,0.00003156831,0.00001485624,0.000009113374,0.00005092465,0.00135156,0.9984028,0.000002311926],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"editorial","genre_scores_codex":[0.0004373541,0.01625352,0.002543202,0.1175654,0.4063724,0.0002284742,0.002004182,0.0009484618,0.4536469],"genre_scores_gemma":[0.001702332,0.003753448,0.0006222628,0.03307595,0.04446141,0.000117106,0.0009665182,0.000480521,0.9148204],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.5986632,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4245144801","doi":"10.1007/s11786-018-0388-7","title":"Foreword","year":2018,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Computer science","authors":[{"name":"Dardo Goyeneche","is_ca":false},{"name":"Ilias Kotsireas","is_ca":true},{"name":"Padraig Ó Catháin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01225182957901668,"gpt":0.2225237147053616,"spread":0.2102718851263449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001302909,0.0009864926,0.0009018132,0.001826946,0.001856644,0.004633998,0.001348639,0.003191281,0.3630644],"category_scores_gemma":[0.01060397,0.000269399,0.0005828381,0.001068407,0.0008293695,0.00292726,0.002610485,0.004427256,0.3933385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001774571,"about_ca_system_score_gemma":0.002667291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001666458,"about_ca_topic_score_gemma":0.003146811,"domain_scores_codex":[0.9988871,0.0001458392,0.00005671698,0.0001736001,0.0006049108,0.0001318492],"domain_scores_gemma":[0.9952501,0.0007165888,0.0002252863,0.0003256925,0.002254179,0.001228097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000104636,0.000005946374,0.00001730171,0.00004559972,0.000001160104,0.00001533822,0.000009119804,0.00000889145,0.00006169423,0.001825147,0.9774383,0.02056117],"study_design_scores_gemma":[0.000003433468,0.000007148608,0.0000521687,0.00007645577,0.00000139816,0.00003666115,0.00001523965,0.00001067825,0.00004801772,0.001387452,0.998359,0.00000241767],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0004023247,0.02016061,0.002343496,0.1162362,0.4869769,0.0001989666,0.001558998,0.0008067139,0.3713158],"genre_scores_gemma":[0.001873503,0.005327325,0.0007122062,0.03982934,0.0667541,0.0001294053,0.0009556243,0.0005323468,0.8838862],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.3630644,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3032866416","doi":"10.1007/s11786-020-00495-9","title":"Common Factors in Fraction-Free Matrix Decompositions","year":2020,"lang":"en","type":"preprint","venue":"Mathematics in Computer Science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Austrian Science Fund","keywords":"Fraction (chemistry); Mathematics; Matrix (chemical analysis); Reduction (mathematics); Decomposition; LU decomposition; Triangular matrix; Computation; Gauss; Combinatorics; Matrix decomposition; Statistics; Eigenvalues and eigenvectors; Algorithm; Pure mathematics; Physics; Geometry","authors":[{"name":"Johannes Middeke","is_ca":false},{"name":"David J. Jeffrey","is_ca":true},{"name":"Christoph Koutschan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03184862625771293,"gpt":0.3115852861953499,"spread":0.279736659937637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00198082,0.0007831421,0.0007548137,0.001668766,0.0007467727,0.0018058,0.0007456662,0.0006038924,0.008068553],"category_scores_gemma":[0.01084154,0.0003562926,0.000727351,0.0007458492,0.002235571,0.002207379,0.001140435,0.0008986511,0.00115872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006441533,"about_ca_system_score_gemma":0.0005767665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001446596,"about_ca_topic_score_gemma":0.001023591,"domain_scores_codex":[0.9984818,0.000449701,0.00007594802,0.0002376999,0.0005488159,0.0002060818],"domain_scores_gemma":[0.9959404,0.001816763,0.0004381122,0.0009699099,0.0006337229,0.0002010541],"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.0001468811,0.00006103564,0.0009755751,0.0001207459,0.00002973874,0.0002669352,0.0004206666,0.05245414,0.006297415,0.9093592,0.002111477,0.02775617],"study_design_scores_gemma":[0.00001960504,0.00006075134,0.0004752612,0.00002715108,0.00001090195,0.0001276643,0.00009999137,0.3762504,0.005801302,0.6141016,0.002991599,0.00003373983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1792513,0.0004394778,0.8078969,0.000273078,0.0001175727,0.00008509686,0.0001973042,0.0006299354,0.01110929],"genre_scores_gemma":[0.8772553,0.0002505152,0.1153669,0.0001569832,0.0001195359,0.0001207912,0.0002824796,0.0003662324,0.006081242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008068553,"threshold_uncertainty_score":0.02699202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}