{"meta":{"query_hash":"c9e14d9513a8","filters":{"venue":"Mathematics in Computer Science"},"cohort_total":29,"direct_labels_cover":0,"predictions_cover":29,"exported":29,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/c9e14d9513a8","api":"https://metacan.xera.ac/api/v1/cohort?venue=Mathematics+in+Computer+Science"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024804728485505474,"score_gpt":0.2610001570369275,"score_spread":0.23619542855142206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977906522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047048446,0.0013381802,0.8642316,0.0027973407,0.00043961598,0.00022036325,0.00030791416,0.0012351808,0.08238136],"genre_scores_gemma":[0.60265017,0.0021277785,0.34821936,0.0009648085,0.0004925674,0.00023838044,0.0011715316,0.0007625934,0.04337289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980259,0.000617507,0.00008941843,0.0003398101,0.00063125486,0.00029609833],"domain_scores_gemma":[0.9961397,0.002599227,0.00011771896,0.0007269985,0.00029407116,0.0001223143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018797052,0.0014209679,0.0013007983,0.0011300531,0.0016209949,0.0021732976,0.0020596206,0.001340344,0.019847171],"category_scores_gemma":[0.011155527,0.00070178503,0.001473847,0.0022984268,0.0027260196,0.0073969867,0.0060419696,0.004721528,0.0020290455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018612233,0.00009867814,0.00071763224,0.00041923838,0.00006004301,0.000075834774,0.0006272834,0.05071753,0.0021994188,0.7437035,0.010597979,0.19059676],"study_design_scores_gemma":[0.000038238286,0.000043107088,0.0001886926,0.000042604388,0.000035849982,0.000060936487,0.00016082362,0.10318854,0.0014982858,0.87996864,0.01475876,0.000015553547],"about_ca_topic_score_codex":0.0026762777,"about_ca_topic_score_gemma":0.003920231,"teacher_disagreement_score":0.019847171,"about_ca_system_score_codex":0.0014126342,"about_ca_system_score_gemma":0.0012356262,"threshold_uncertainty_score":0.06639546},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014385583828567469,"score_gpt":0.2934001250738474,"score_spread":0.2790145412452799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003890915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04126752,0.00052715914,0.95500684,0.000117399846,0.00007977401,0.00006907224,0.00009138375,0.0003145161,0.0025263682],"genre_scores_gemma":[0.60987425,0.0010585529,0.38521686,0.00012516262,0.00022197278,0.00009476277,0.00025661703,0.00013163936,0.003020144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853814,0.00034239364,0.0000988702,0.00026338195,0.0006845098,0.00007267255],"domain_scores_gemma":[0.9965522,0.0014464176,0.00041109754,0.0006905024,0.000691423,0.00020843286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016196811,0.00055838306,0.0014230723,0.0027317347,0.00070509105,0.0017953499,0.0010964449,0.0010187067,0.0019980273],"category_scores_gemma":[0.009200308,0.00036331965,0.000801183,0.0025083132,0.0012881162,0.0033924426,0.002279184,0.001171245,0.0006373479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008280802,0.0003829117,0.0023564606,0.00047496945,0.0001251604,0.00027853213,0.00041859143,0.12304016,0.09688179,0.102428615,0.0022496774,0.670535],"study_design_scores_gemma":[0.000029549852,0.00032474147,0.0017317365,0.000033404212,0.000047658603,0.0005450583,0.00012639532,0.88826317,0.027064722,0.07925422,0.002508422,0.00007093016],"about_ca_topic_score_codex":0.000773773,"about_ca_topic_score_gemma":0.0004904435,"teacher_disagreement_score":0.0027317347,"about_ca_system_score_codex":0.00065908645,"about_ca_system_score_gemma":0.0006936471,"threshold_uncertainty_score":0.0085657835},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Flow (mathematics); Mathematics; Computer science; Combinatorics; Geometry","score_opus":0.01554929231676407,"score_gpt":0.23453128688095132,"score_spread":0.21898199456418724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018051263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015580321,0.00050171587,0.9800239,0.00034748868,0.000070940194,0.000051806306,0.00015957252,0.00015652775,0.0031076954],"genre_scores_gemma":[0.49771643,0.0022919409,0.48454323,0.00034603194,0.00042324248,0.0003890976,0.0006853113,0.0003034668,0.013301253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987079,0.00065264804,0.000054355787,0.00025226604,0.0002636431,0.000069213966],"domain_scores_gemma":[0.9946109,0.0036110915,0.00045930024,0.0004925375,0.00049529783,0.00033094018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029978014,0.00079502957,0.0011890301,0.0047195563,0.0012555819,0.0029006496,0.0014439753,0.0012926118,0.006127237],"category_scores_gemma":[0.014276496,0.00065252575,0.0016332943,0.0031385184,0.0021373986,0.006957724,0.002323703,0.002065646,0.00062051456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057054243,0.000052609226,0.0005398404,0.00009711717,0.000040506045,0.000051321673,0.0001553745,0.048382998,0.00039352977,0.9157075,0.0018649359,0.03265723],"study_design_scores_gemma":[0.000008195022,0.000021206844,0.0001454306,0.000023366027,0.000024960023,0.0000287892,0.00005838847,0.1937403,0.00018974293,0.8034598,0.0022888284,0.000011027166],"about_ca_topic_score_codex":0.00205707,"about_ca_topic_score_gemma":0.00095163216,"teacher_disagreement_score":0.006127237,"about_ca_system_score_codex":0.001430235,"about_ca_system_score_gemma":0.0009118918,"threshold_uncertainty_score":0.02049768},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014238369515591863,"score_gpt":0.25047419273828225,"score_spread":0.23623582322269038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018508868","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050186655,0.37608048,0.28276822,0.010507621,0.009764954,0.00029140548,0.0015123887,0.00065345375,0.3134028],"genre_scores_gemma":[0.14188333,0.44471002,0.26339763,0.014494485,0.026165249,0.0015405905,0.0042681084,0.0011660939,0.10237456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697185,0.00082164165,0.00028420452,0.000754951,0.0009931658,0.00017419393],"domain_scores_gemma":[0.99712604,0.0018248226,0.00013516068,0.00030163417,0.00047590132,0.00013643621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002034268,0.0016228325,0.0013072566,0.00523131,0.0024948213,0.006381841,0.002658177,0.003283754,0.020257635],"category_scores_gemma":[0.0054768794,0.00095721096,0.0018839488,0.005269811,0.0047054775,0.012672375,0.0046000318,0.0060277283,0.0074688364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001803714,0.00004356739,0.0004736099,0.0009365843,0.000025876068,0.00022976637,0.00065303117,0.001364198,0.00035897386,0.88408315,0.027120568,0.084692694],"study_design_scores_gemma":[0.0000041406724,0.00003601208,0.00031253614,0.0005533315,0.000012466705,0.00078962836,0.00022625097,0.001856858,0.00016118007,0.44993562,0.5460846,0.00002741165],"about_ca_topic_score_codex":0.0021831351,"about_ca_topic_score_gemma":0.0011606225,"teacher_disagreement_score":0.020257635,"about_ca_system_score_codex":0.003034674,"about_ca_system_score_gemma":0.0015980349,"threshold_uncertainty_score":0.067768514},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.297797761049804,"score_gpt":0.46174809809654416,"score_spread":0.16395033704674017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029410925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12384929,0.00849898,0.79425734,0.015491231,0.0010745408,0.00018339982,0.0009406929,0.0010400364,0.05466451],"genre_scores_gemma":[0.707377,0.0050382293,0.26693225,0.0011128876,0.0014499662,0.00044118226,0.001222996,0.0007579488,0.015667507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99500257,0.002479937,0.00023601137,0.00041046395,0.001556113,0.00031483627],"domain_scores_gemma":[0.9405294,0.0522603,0.00085529935,0.003537412,0.0023021551,0.00051543576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052958275,0.0009400482,0.0015329921,0.0012322981,0.0014042791,0.0030797953,0.0023033428,0.0018724032,0.009768172],"category_scores_gemma":[0.051994786,0.00071242533,0.0013540058,0.0015956615,0.0031994008,0.009273624,0.0036347865,0.0052329255,0.0015552909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010750418,0.00022172897,0.0034909288,0.00085129874,0.00015690734,0.00037113074,0.0005324828,0.24959622,0.0032323727,0.5786674,0.020902734,0.14090179],"study_design_scores_gemma":[0.00006406101,0.000032869782,0.0005542274,0.00006731718,0.000029962433,0.00008830761,0.00007946893,0.6082344,0.0010484494,0.38689873,0.0028793977,0.000022899543],"about_ca_topic_score_codex":0.0028246015,"about_ca_topic_score_gemma":0.0025400077,"teacher_disagreement_score":0.009768172,"about_ca_system_score_codex":0.0012878604,"about_ca_system_score_gemma":0.0018929788,"threshold_uncertainty_score":0.03267777},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020139587226489463,"score_gpt":0.2952151792826439,"score_spread":0.27507559205615445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050429600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.240518,0.00070931227,0.6965832,0.0008635216,0.0010270922,0.00006993961,0.00033113486,0.00045619666,0.05944157],"genre_scores_gemma":[0.8682934,0.0012524982,0.104371205,0.0005515206,0.00087429926,0.000095489486,0.0003525967,0.00040814222,0.023800801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985037,0.0003542471,0.000068361456,0.00018411428,0.0006698634,0.00021969435],"domain_scores_gemma":[0.99713504,0.0008916549,0.00042014668,0.0006634067,0.00060239906,0.0002872415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012400912,0.0010868127,0.00047653087,0.0018751116,0.00073729263,0.002981349,0.0009689355,0.0011746733,0.00820419],"category_scores_gemma":[0.0052223946,0.0003982725,0.0006625323,0.0016799602,0.0019031151,0.0040220525,0.0013888718,0.002032682,0.0017024209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008955174,0.00003952796,0.0002744729,0.000047364756,0.000018336266,0.00023883331,0.00018731946,0.002736871,0.006324939,0.9736969,0.0009668157,0.0153789325],"study_design_scores_gemma":[0.000017903434,0.00007887983,0.0005457074,0.00003659699,0.000019274004,0.00082888803,0.00017115971,0.04099243,0.0053400667,0.94655275,0.005354095,0.000062195664],"about_ca_topic_score_codex":0.00016650236,"about_ca_topic_score_gemma":0.00025260833,"teacher_disagreement_score":0.00820419,"about_ca_system_score_codex":0.0003714607,"about_ca_system_score_gemma":0.00055103505,"threshold_uncertainty_score":0.027445734},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07001208019824393,"score_gpt":0.28516992337848157,"score_spread":0.21515784318023765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063841356","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030872175,0.0014771799,0.9240168,0.0017845137,0.001012628,0.00030753386,0.00083800114,0.004212051,0.035479024],"genre_scores_gemma":[0.19498989,0.0007279757,0.7644397,0.001153571,0.00089065096,0.00040236406,0.0018526193,0.0008089749,0.03473422],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997131,0.00073280034,0.00019282456,0.0004933607,0.0010135025,0.00043656968],"domain_scores_gemma":[0.9962114,0.0012251551,0.0002308095,0.0016299462,0.00054637634,0.00015627856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013414539,0.0019740795,0.0016714201,0.001955036,0.0018008283,0.0029859545,0.0015586332,0.0014151199,0.040322237],"category_scores_gemma":[0.0075414754,0.00050275464,0.001414748,0.0022413821,0.0016203792,0.0060300143,0.0030536607,0.0021705746,0.018638244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015965878,0.00044296912,0.0005790239,0.0007180255,0.00010955783,0.00046323412,0.00043831655,0.019380456,0.048272118,0.27547315,0.04911785,0.60340863],"study_design_scores_gemma":[0.00049435796,0.000727986,0.00071856665,0.00022600238,0.00015115757,0.0016848403,0.00065316673,0.24977885,0.09030858,0.52673393,0.12831533,0.00020730343],"about_ca_topic_score_codex":0.0016243019,"about_ca_topic_score_gemma":0.0035747932,"teacher_disagreement_score":0.040322237,"about_ca_system_score_codex":0.0010307707,"about_ca_system_score_gemma":0.0017867499,"threshold_uncertainty_score":0.13489133},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05655433533544037,"score_gpt":0.3537429007534002,"score_spread":0.29718856541795985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067675443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006562877,0.00059717876,0.9870207,0.0002570953,0.0001368792,0.00010480298,0.00021335426,0.0031620173,0.0019451191],"genre_scores_gemma":[0.049006697,0.00045679417,0.94584954,0.000115431896,0.00014740722,0.0002688437,0.000755902,0.00036186812,0.0030375195],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970805,0.00059849187,0.00027303578,0.0006494932,0.0011699132,0.00022856439],"domain_scores_gemma":[0.9918384,0.0040515326,0.00042546398,0.0024895368,0.000984629,0.00021046573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023637714,0.0026356508,0.0019274501,0.0028069562,0.0017806744,0.003470712,0.0037091605,0.002338184,0.011431938],"category_scores_gemma":[0.015316097,0.0010073291,0.0015895019,0.004006229,0.0018084723,0.007095273,0.0035296215,0.0042551425,0.0063281753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006632417,0.00020236606,0.0011238436,0.0005160226,0.00011831125,0.0001066027,0.00033062726,0.03697527,0.012501964,0.07392929,0.018594204,0.85493827],"study_design_scores_gemma":[0.0004675537,0.00032527556,0.0007365121,0.0001096301,0.0001307954,0.0006273654,0.00035930696,0.53538764,0.021588767,0.41983688,0.020323155,0.00010718258],"about_ca_topic_score_codex":0.001732995,"about_ca_topic_score_gemma":0.004471669,"teacher_disagreement_score":0.011431938,"about_ca_system_score_codex":0.001552368,"about_ca_system_score_gemma":0.0030586876,"threshold_uncertainty_score":0.03824365},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05852512899978808,"score_gpt":0.3559044107329234,"score_spread":0.2973792817331353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104191500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8524008,0.00034827262,0.07513252,0.002309277,0.0007793486,0.00007512272,0.00035471434,0.00062881253,0.0679711],"genre_scores_gemma":[0.9805813,0.00016718675,0.007043435,0.0003301681,0.00034949897,0.00003654514,0.00015639588,0.00032545783,0.011009877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915266,0.00015251435,0.000027720547,0.00017764166,0.00021520363,0.000274204],"domain_scores_gemma":[0.9988865,0.00030087045,0.00021974588,0.000104028535,0.00013835322,0.00035049682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096768496,0.0009686148,0.00056711055,0.0031299016,0.0018258943,0.0030545697,0.0014269217,0.0018421374,0.010356788],"category_scores_gemma":[0.0019275123,0.0004967954,0.0010783585,0.0012119585,0.0040039197,0.0036544774,0.001723216,0.0026092674,0.001061675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008558988,0.000050726336,0.0003013948,0.000021385904,0.0000072624193,0.00017260027,0.0003208423,0.00095132715,0.0038911134,0.9857653,0.001333173,0.0070991567],"study_design_scores_gemma":[0.000042797154,0.000070144866,0.0017684717,0.000022262113,0.000017912622,0.0004036936,0.00018277323,0.019908082,0.0037052126,0.9689738,0.0048073414,0.00009746521],"about_ca_topic_score_codex":0.0018173973,"about_ca_topic_score_gemma":0.002044701,"teacher_disagreement_score":0.010356788,"about_ca_system_score_codex":0.0020329237,"about_ca_system_score_gemma":0.0013139554,"threshold_uncertainty_score":0.03464687},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012622431561066825,"score_gpt":0.23342547820530582,"score_spread":0.220803046644239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139371904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037917316,0.0023399591,0.8968168,0.0034073896,0.000289065,0.000060718463,0.00027342743,0.0003403726,0.05855491],"genre_scores_gemma":[0.8698021,0.0021092733,0.10666648,0.00064067193,0.0007177273,0.0001422456,0.0004069969,0.00020029527,0.019314123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985607,0.0005158483,0.00008059442,0.00019587706,0.00050055323,0.00014637141],"domain_scores_gemma":[0.9978934,0.0011919982,0.00017377346,0.00024741067,0.00042679484,0.00006657838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016893799,0.00065156934,0.0004807532,0.0017471487,0.0010419283,0.0028765793,0.00097599276,0.0006885434,0.00511353],"category_scores_gemma":[0.0042964513,0.0004372329,0.0010733897,0.0008801424,0.0033488523,0.004171094,0.0014431847,0.0019484727,0.00058591255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051139946,0.000007477203,0.00004725053,0.00002168732,0.0000042205484,0.000012489138,0.000099712684,0.0017108823,0.00027648537,0.9943153,0.0004211948,0.003078148],"study_design_scores_gemma":[0.000004501003,0.0000044254352,0.0000467185,0.000012613458,0.0000043447926,0.000015381358,0.00003470566,0.009927274,0.00032149185,0.98540235,0.0042217113,0.0000044785747],"about_ca_topic_score_codex":0.0017755784,"about_ca_topic_score_gemma":0.0010452126,"teacher_disagreement_score":0.00511353,"about_ca_system_score_codex":0.0021121406,"about_ca_system_score_gemma":0.0011001906,"threshold_uncertainty_score":0.017106473},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04279358418637936,"score_gpt":0.2918718828044226,"score_spread":0.24907829861804326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346641114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76757634,0.00048260036,0.2092503,0.0009102175,0.00009099888,0.00006318547,0.00060070434,0.00056624325,0.020459326],"genre_scores_gemma":[0.9401204,0.00027978828,0.047814384,0.00014901989,0.000068248395,0.000066320055,0.0014229419,0.00011328319,0.009965575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984547,0.00036744543,0.0001437078,0.00031711036,0.00053772045,0.00017932682],"domain_scores_gemma":[0.9888469,0.0056825997,0.0013163816,0.0015833471,0.0015805938,0.0009900617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012978808,0.00031887266,0.00092763413,0.0032101248,0.0027179655,0.0062032966,0.0015422534,0.0012402683,0.0061713043],"category_scores_gemma":[0.014946636,0.00048118713,0.0006946023,0.0028330472,0.0026220519,0.0069277775,0.0028164738,0.0015566783,0.00075863715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029531654,0.000111022244,0.0046230583,0.00011909232,0.000034529312,0.00022243542,0.00094640197,0.009367441,0.003957565,0.95167273,0.001357466,0.027292782],"study_design_scores_gemma":[0.000022798433,0.000076092816,0.001541439,0.000057675992,0.000036797348,0.00038654072,0.00086534576,0.033882987,0.0037578442,0.9526066,0.0067337016,0.000032153916],"about_ca_topic_score_codex":0.0011115078,"about_ca_topic_score_gemma":0.0012857039,"teacher_disagreement_score":0.0062032966,"about_ca_system_score_codex":0.001835825,"about_ca_system_score_gemma":0.0014196498,"threshold_uncertainty_score":0.020645082},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029761861630975165,"score_gpt":0.2988133188211195,"score_spread":0.26905145719014434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583611270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12821081,0.0016981364,0.84789425,0.00070621434,0.00047875554,0.0001390088,0.00084378617,0.0017564025,0.018272595],"genre_scores_gemma":[0.73312145,0.00084883446,0.25175366,0.00038899278,0.00036987627,0.0003071782,0.001501156,0.00045747252,0.01125135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982095,0.00035333002,0.00026469253,0.000608806,0.00043183818,0.00013191349],"domain_scores_gemma":[0.99155104,0.0039539295,0.00079386844,0.0022466686,0.0012061305,0.00024834572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011357627,0.00060646114,0.0010219592,0.0024019822,0.0017171215,0.002504067,0.0019833993,0.0014549294,0.0066290065],"category_scores_gemma":[0.010765742,0.00049349846,0.001227795,0.0034016052,0.0022571448,0.00579169,0.0018124484,0.0017427283,0.0017850396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003257224,0.00011206686,0.00172062,0.00024566098,0.00005093528,0.00057467114,0.00069368526,0.020256875,0.0068005254,0.88476187,0.002263717,0.08219345],"study_design_scores_gemma":[0.000017672894,0.00009669555,0.00026357095,0.00004828762,0.00003436654,0.00049210386,0.00017595812,0.09371074,0.003987452,0.8947255,0.0064186854,0.000028856026],"about_ca_topic_score_codex":0.0008059031,"about_ca_topic_score_gemma":0.00087755476,"teacher_disagreement_score":0.0066290065,"about_ca_system_score_codex":0.0010016374,"about_ca_system_score_gemma":0.00106273,"threshold_uncertainty_score":0.022176266},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Mathematics education; Computer science; Algebra over a field; Pure mathematics","score_opus":0.030308832647228338,"score_gpt":0.29686560847471255,"score_spread":0.2665567758274842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600164031","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012433018,0.50246,0.008525493,0.3023381,0.111070834,0.00014495286,0.0007872833,0.0003087698,0.061931662],"genre_scores_gemma":[0.25726497,0.34519538,0.019546859,0.084385075,0.09718821,0.00034690596,0.0017294466,0.0009585157,0.19338468],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9935888,0.001982569,0.00046031838,0.00062524294,0.0022825478,0.0010605316],"domain_scores_gemma":[0.9801891,0.0036305613,0.0008315935,0.0013705189,0.0077518253,0.006226513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020101758,0.0017252325,0.0011709093,0.004635129,0.0037645428,0.010959479,0.0015043948,0.0039742417,0.026491016],"category_scores_gemma":[0.022479728,0.0004814365,0.0010346693,0.004041848,0.009773354,0.013447454,0.009080625,0.008923016,0.0077996394],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027382246,0.0003373172,0.0018872402,0.0013210452,0.00009858417,0.0001964835,0.0018692313,0.00060671655,0.0007135995,0.29388383,0.4304529,0.26835936],"study_design_scores_gemma":[0.000020375566,0.00010730909,0.002518278,0.0007352538,0.000020347527,0.00013710637,0.0007155406,0.00023386949,0.00027201461,0.033163276,0.9620558,0.00002088288],"about_ca_topic_score_codex":0.004952648,"about_ca_topic_score_gemma":0.008846418,"teacher_disagreement_score":0.026491016,"about_ca_system_score_codex":0.011371816,"about_ca_system_score_gemma":0.0141744055,"threshold_uncertainty_score":0.10630953},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Computer science; Algebra over a field; Arithmetic; Algorithm; Pure mathematics","score_opus":0.008311430262110866,"score_gpt":0.2604206133191566,"score_spread":0.25210918305704577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609945833","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028752388,0.00007677348,0.9538284,0.00020636964,0.0000592772,0.00005788097,0.00010029608,0.0031586841,0.013759886],"genre_scores_gemma":[0.45865306,0.00014877772,0.51425135,0.0002031412,0.00006360925,0.00029893813,0.0005888188,0.0014515038,0.02434087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887186,0.00028386578,0.00008540201,0.00018573456,0.0003713988,0.0002017576],"domain_scores_gemma":[0.9973616,0.0008307918,0.00011800328,0.00091166515,0.0006296324,0.00014821606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016740328,0.0004534573,0.0006206595,0.0014909656,0.0010328124,0.0021884139,0.0019548982,0.0015341531,0.015642945],"category_scores_gemma":[0.009063487,0.0005322364,0.0006213324,0.001334455,0.0010366683,0.002864699,0.0025125854,0.0017918395,0.0053175217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052031834,0.00023767097,0.0020436726,0.00008866421,0.000036781443,0.00013359734,0.00046243155,0.034354493,0.010670418,0.65374964,0.008626635,0.28907573],"study_design_scores_gemma":[0.00010487559,0.00013866673,0.0004405849,0.00004873257,0.000029479595,0.00009340904,0.000104968734,0.60584974,0.018907214,0.35469058,0.019555744,0.00003604211],"about_ca_topic_score_codex":0.0018524816,"about_ca_topic_score_gemma":0.0022360927,"teacher_disagreement_score":0.015642945,"about_ca_system_score_codex":0.00086621917,"about_ca_system_score_gemma":0.0013894273,"threshold_uncertainty_score":0.05233085},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018778867631176904,"score_gpt":0.2507788742923151,"score_spread":0.2320000066611382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771217056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.436975,0.00064423314,0.4817155,0.0015183022,0.00036616705,0.000111530215,0.0007395487,0.0006174878,0.07731225],"genre_scores_gemma":[0.9373558,0.00041412632,0.04410408,0.0002928048,0.00025589796,0.00007382311,0.00043887645,0.00013047185,0.016934143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999527,0.00009066715,0.000018732308,0.000090756424,0.00016706278,0.00010580177],"domain_scores_gemma":[0.9986999,0.00055438594,0.00018905506,0.00012250172,0.00018659714,0.0002475332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033475854,0.00053145597,0.00040781524,0.0008979107,0.00086094625,0.0016083346,0.00062730676,0.00062447827,0.009125547],"category_scores_gemma":[0.0030046972,0.00028871238,0.00027109543,0.00096258527,0.0010724514,0.001603138,0.001427814,0.001728092,0.0013482351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013763463,0.000043869884,0.0002959844,0.00006925741,0.000007619293,0.00013882568,0.00038333153,0.0041373526,0.0067436537,0.9604023,0.0036508557,0.023989266],"study_design_scores_gemma":[0.00003620732,0.000066505396,0.0004686362,0.000018411274,0.0000075784083,0.00018934243,0.00015056171,0.017873172,0.0032929797,0.97124535,0.006623389,0.000028016872],"about_ca_topic_score_codex":0.00058517617,"about_ca_topic_score_gemma":0.0008485197,"teacher_disagreement_score":0.009125547,"about_ca_system_score_codex":0.0006978432,"about_ca_system_score_gemma":0.0005729557,"threshold_uncertainty_score":0.030528069},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024658429903805942,"score_gpt":0.25165112121179345,"score_spread":0.2269926913079875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963295477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016239015,0.054194078,0.55828243,0.031845134,0.055528957,0.00011744948,0.0013980746,0.0015968004,0.28079805],"genre_scores_gemma":[0.29754585,0.07365959,0.24451594,0.013933023,0.11228758,0.0002881098,0.0028754966,0.002214583,0.2526798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986571,0.00026913127,0.00008619196,0.0003983464,0.00045248918,0.0001367346],"domain_scores_gemma":[0.9968495,0.0017831485,0.00014413506,0.0004460625,0.00047016927,0.0003069903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012575357,0.0014009698,0.00093622523,0.0025699707,0.0021005424,0.003340744,0.0017567916,0.0022870197,0.024318416],"category_scores_gemma":[0.00493296,0.00060289603,0.0014955713,0.0034280284,0.0031414768,0.009079614,0.0036921233,0.005019859,0.009589564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094027906,0.00006635884,0.00032154308,0.0005464293,0.00003651155,0.00018233435,0.0002429793,0.0018337691,0.0014117886,0.87081784,0.056677744,0.06776878],"study_design_scores_gemma":[0.0000089786745,0.000028378505,0.00016740501,0.00009782637,0.000022575356,0.0001566126,0.00004265582,0.0024373156,0.0003746756,0.85399777,0.14264168,0.000024192306],"about_ca_topic_score_codex":0.0007670994,"about_ca_topic_score_gemma":0.00072469626,"teacher_disagreement_score":0.024318416,"about_ca_system_score_codex":0.001340129,"about_ca_system_score_gemma":0.0008587321,"threshold_uncertainty_score":0.08135325},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08944298529576389,"score_gpt":0.30688643089244383,"score_spread":0.21744344559667994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003474032","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.538159,0.0031908436,0.2500415,0.0021161134,0.00046537168,0.00010745009,0.0006278106,0.00042654754,0.20486543],"genre_scores_gemma":[0.9403225,0.0010329616,0.03695677,0.00015318846,0.00033266624,0.000045895005,0.0002635364,0.0001328766,0.02075955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994299,0.00011730819,0.000026500338,0.00010536268,0.00022325134,0.000097730815],"domain_scores_gemma":[0.9987878,0.000526923,0.00015980899,0.00013963641,0.00025545905,0.00013034177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008410416,0.00043906833,0.00046010298,0.003026275,0.0014739514,0.0030207916,0.0012208917,0.00046390627,0.00743539],"category_scores_gemma":[0.0046039526,0.00029332333,0.0005907825,0.0026876072,0.0029375833,0.004208314,0.001645459,0.0016252542,0.0010486476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027626516,0.000014678294,0.0004890463,0.000037089914,0.0000059079193,0.000034851324,0.00018183145,0.0008738216,0.00088915345,0.9864421,0.0007201992,0.010283731],"study_design_scores_gemma":[0.000011794293,0.00001820513,0.0008673904,0.00001890238,0.000011736518,0.00017856904,0.000099318706,0.0061500976,0.0017369876,0.9831828,0.0077004083,0.000023704666],"about_ca_topic_score_codex":0.0020760107,"about_ca_topic_score_gemma":0.0016849884,"teacher_disagreement_score":0.00743539,"about_ca_system_score_codex":0.0013154912,"about_ca_system_score_gemma":0.0007943957,"threshold_uncertainty_score":0.024873853},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.052039150340473204,"score_gpt":0.3097761538726907,"score_spread":0.2577370035322175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005566958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5455416,0.0024786214,0.10532281,0.0089207785,0.00007430686,0.00018750424,0.00051819027,0.0004870698,0.33646914],"genre_scores_gemma":[0.9575871,0.00088441116,0.03530463,0.00024602213,0.000015383981,0.000115693234,0.0002520818,0.00007886351,0.005515777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987312,0.00060364656,0.000042610445,0.00023510223,0.00028371433,0.0001037428],"domain_scores_gemma":[0.9934754,0.0040241564,0.00064822333,0.00043356066,0.00095734705,0.0004613623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012624189,0.0003140084,0.00021281511,0.0011862015,0.0006826463,0.0044853324,0.00086847943,0.0014357563,0.006585759],"category_scores_gemma":[0.010278241,0.00040232812,0.0003740052,0.00096634077,0.003702381,0.005953786,0.0015233663,0.0030812025,0.00075852114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009899802,0.00032889642,0.02370918,0.00027362502,0.000047450416,0.0010007203,0.019187031,0.0044902433,0.008261047,0.8645161,0.0021935464,0.07589318],"study_design_scores_gemma":[0.000029397168,0.00012259748,0.03851724,0.00016437116,0.00003478425,0.0007402782,0.005216342,0.007045787,0.0049344283,0.9247547,0.01840079,0.00003924442],"about_ca_topic_score_codex":0.0038223187,"about_ca_topic_score_gemma":0.0023923705,"teacher_disagreement_score":0.006585759,"about_ca_system_score_codex":0.001184104,"about_ca_system_score_gemma":0.0033900167,"threshold_uncertainty_score":0.022031546},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031848626257712925,"score_gpt":0.31158528619534986,"score_spread":0.27973665993763697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032866416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17925128,0.00043947776,0.8078969,0.00027307804,0.00011757273,0.00008509686,0.0001973042,0.0006299354,0.011109292],"genre_scores_gemma":[0.87725526,0.0002505152,0.11536686,0.00015698324,0.00011953594,0.000120791236,0.00028247957,0.00036623236,0.0060812416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984818,0.00044970104,0.00007594802,0.00023769986,0.00054881594,0.00020608184],"domain_scores_gemma":[0.99594045,0.001816763,0.00043811218,0.00096990995,0.00063372287,0.00020105406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019808195,0.00078314205,0.0007548137,0.0016687664,0.0007467727,0.0018057998,0.00074566616,0.0006038924,0.008068553],"category_scores_gemma":[0.010841537,0.00035629256,0.000727351,0.00074584916,0.0022355714,0.0022073793,0.0011404352,0.0008986511,0.0011587202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014688108,0.000061035644,0.00097557507,0.000120745855,0.000029738738,0.00026693515,0.00042066665,0.05245414,0.006297415,0.9093592,0.0021114768,0.027756166],"study_design_scores_gemma":[0.00001960504,0.00006075134,0.00047526124,0.000027151082,0.000010901946,0.00012766426,0.00009999137,0.37625045,0.0058013024,0.61410165,0.0029915993,0.00003373983],"about_ca_topic_score_codex":0.0014465965,"about_ca_topic_score_gemma":0.0010235914,"teacher_disagreement_score":0.008068553,"about_ca_system_score_codex":0.0006441533,"about_ca_system_score_gemma":0.0005767665,"threshold_uncertainty_score":0.026992023},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03981148747950762,"score_gpt":0.302600018488748,"score_spread":0.2627885310092404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035945966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007135874,0.0000678838,0.9908727,0.00007494521,0.00005227689,0.000034465505,0.000019138759,0.0002080807,0.0015346458],"genre_scores_gemma":[0.19979069,0.00033321625,0.78982943,0.00013321947,0.00012573213,0.00019477934,0.00023963433,0.000522931,0.008830295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994461,0.0001846008,0.000041143834,0.00009394675,0.00017962442,0.00005460459],"domain_scores_gemma":[0.99805886,0.0011662886,0.00010874775,0.00026585138,0.00030511597,0.00009521399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013385887,0.00076459505,0.00069202774,0.0009368696,0.0005179652,0.0010213762,0.0012943187,0.00084477634,0.006139573],"category_scores_gemma":[0.006119584,0.0004686492,0.0012892184,0.00065375236,0.0011709633,0.0019576596,0.002839551,0.0026895236,0.0015844731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023210724,0.00021861395,0.00076881575,0.00021460227,0.00006770806,0.00015827591,0.00036543552,0.17980473,0.014445349,0.48066097,0.005095475,0.31796795],"study_design_scores_gemma":[0.000034213546,0.00006457183,0.000087990295,0.000011973099,0.000009360335,0.000060721268,0.000036090078,0.84669024,0.0032451935,0.14748551,0.00226152,0.000012522083],"about_ca_topic_score_codex":0.0013528314,"about_ca_topic_score_gemma":0.0016019875,"teacher_disagreement_score":0.006139573,"about_ca_system_score_codex":0.0005856002,"about_ca_system_score_gemma":0.0011245623,"threshold_uncertainty_score":0.020538926},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematics","score_opus":0.030622989290350833,"score_gpt":0.2539979995728978,"score_spread":0.22337501028254697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082404028","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045149698,0.014706423,0.0025739525,0.10574765,0.3630141,0.0002366651,0.0022038934,0.0010390489,0.5100268],"genre_scores_gemma":[0.0015334586,0.0031704505,0.0005681521,0.027277214,0.03535893,0.00010609712,0.0009776433,0.00048126356,0.9305268],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910957,0.00011625262,0.000041998876,0.00014089055,0.00048317507,0.000107997854],"domain_scores_gemma":[0.99653697,0.00048497086,0.00015394576,0.00024727028,0.001636591,0.00094031275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011303293,0.00092044426,0.0008058667,0.0016975761,0.0019020052,0.004131266,0.001304785,0.0028266232,0.4362795],"category_scores_gemma":[0.007943937,0.000275532,0.0005991183,0.001007404,0.0007286665,0.0028165076,0.0025977693,0.004077687,0.4581577],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011435588,0.0000063226353,0.000019015748,0.00004254594,9.959274e-7,0.000013879831,0.000010096578,0.000007095976,0.000064401946,0.0019056135,0.9761237,0.021794919],"study_design_scores_gemma":[0.0000036795082,0.000006514298,0.000057074107,0.0000652326,0.0000013257238,0.00002917121,0.000015634623,0.000009282069,0.0000513205,0.0012745125,0.9984841,0.0000022956706],"about_ca_topic_score_codex":0.0019277747,"about_ca_topic_score_gemma":0.0037931597,"teacher_disagreement_score":0.4362795,"about_ca_system_score_codex":0.0016747,"about_ca_system_score_gemma":0.0024673797,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018924533450030194,"score_gpt":0.29474559894213276,"score_spread":0.27582106549210256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155462286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9565269,0.0005378116,0.02734932,0.000388386,0.000013780375,0.0000104462715,0.00020315978,0.000056074878,0.014914129],"genre_scores_gemma":[0.9903016,0.00019668236,0.007939448,0.000030854855,0.000014583034,0.0000120350705,0.00022160565,0.00003103964,0.0012522147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996873,0.00015215174,0.000013648168,0.000059674803,0.00003408827,0.000053049604],"domain_scores_gemma":[0.99895775,0.0005691552,0.00012886545,0.00008107491,0.00020204106,0.000061100814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052005757,0.00014473191,0.0001990956,0.0020618034,0.0015916865,0.0015472436,0.00043355217,0.00041622517,0.0035547279],"category_scores_gemma":[0.0023209145,0.00017087327,0.00034132125,0.002046431,0.0013643821,0.0016033426,0.00081824814,0.0005096207,0.00030089048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024375922,0.000059598748,0.038723096,0.00006715018,0.00010106685,0.00046090368,0.0065649846,0.009086918,0.008827663,0.87676126,0.0010832932,0.058020327],"study_design_scores_gemma":[0.00004594375,0.00010561678,0.24343246,0.00013723272,0.00017914709,0.0017009893,0.005766563,0.07719938,0.0024276134,0.6387736,0.030144354,0.00008712035],"about_ca_topic_score_codex":0.0024117325,"about_ca_topic_score_gemma":0.0031716258,"teacher_disagreement_score":0.0035547279,"about_ca_system_score_codex":0.00069323473,"about_ca_system_score_gemma":0.00035858533,"threshold_uncertainty_score":0.011891782},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Mathematics education; Computer science","score_opus":0.03441838138543281,"score_gpt":0.2910074292922361,"score_spread":0.2565890479068033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199228775","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028588285,0.050476626,0.029482076,0.039590113,0.008659291,0.00006170324,0.0007646099,0.00057058746,0.8675362],"genre_scores_gemma":[0.15913357,0.061537463,0.024459582,0.008247657,0.02252523,0.00040458966,0.0012820318,0.0012019421,0.721208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983405,0.00060229446,0.00009659843,0.00032952093,0.00053563254,0.00009540913],"domain_scores_gemma":[0.9979013,0.0010870015,0.00012329956,0.00028263254,0.0003898849,0.0002159596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012697895,0.0010693581,0.0012335188,0.002586548,0.0025406168,0.011730108,0.0009120183,0.0020638776,0.08585935],"category_scores_gemma":[0.0059566433,0.00042370963,0.00046197165,0.0043484927,0.0051932465,0.00796825,0.0024262469,0.0065570483,0.023470776],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000085726815,0.000012665058,0.000098728415,0.00016152493,0.000005664224,0.000017262482,0.00020483104,0.00013852201,0.00011901632,0.8669472,0.1009316,0.031354375],"study_design_scores_gemma":[0.0000070639153,0.000008374195,0.00028031835,0.00013173271,0.0000067335027,0.00006273529,0.00010455159,0.0005116989,0.00007922434,0.5579001,0.4409013,0.000006128007],"about_ca_topic_score_codex":0.0022256316,"about_ca_topic_score_gemma":0.0030012738,"teacher_disagreement_score":0.08585935,"about_ca_system_score_codex":0.005534989,"about_ca_system_score_gemma":0.0030143505,"threshold_uncertainty_score":0.28722817},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; École de Technologie Supérieure","funders":"","keywords":"Computer science; Mathematics","score_opus":0.013862578413046204,"score_gpt":0.2447117283599842,"score_spread":0.230849149946938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235684925","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004373541,0.016253518,0.0025432021,0.117565446,0.40637243,0.00022847424,0.0020041822,0.0009484618,0.4536469],"genre_scores_gemma":[0.0017023323,0.0037534481,0.00062226277,0.033075955,0.044461407,0.00011710597,0.0009665182,0.00048052103,0.9148204],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990752,0.0001234564,0.00004486517,0.00014784532,0.00049770344,0.000110938854],"domain_scores_gemma":[0.99641657,0.00051046495,0.00016369544,0.00025663272,0.0016913412,0.00096124643],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011714129,0.00092377723,0.0007957887,0.0016557351,0.0018978094,0.004106057,0.0013052877,0.0029704731,0.40133682],"category_scores_gemma":[0.0083204275,0.00027007383,0.0006031431,0.0009762257,0.00076799025,0.0028120526,0.0026252337,0.004238634,0.4179261],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011664974,0.0000063122075,0.000019028252,0.000044794993,0.0000010691898,0.000014630305,0.000010098043,0.000007226953,0.00006350389,0.002010196,0.9756613,0.022150181],"study_design_scores_gemma":[0.0000037214884,0.000006618238,0.000056303492,0.000068783454,0.0000013946974,0.00003156831,0.000014856241,0.000009113374,0.000050924646,0.0013515602,0.9984028,0.000002311926],"about_ca_topic_score_codex":0.0018541146,"about_ca_topic_score_gemma":0.003555562,"teacher_disagreement_score":0.5986632,"about_ca_system_score_codex":0.0017035308,"about_ca_system_score_gemma":0.002533942,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.01225182957901668,"score_gpt":0.22252371470536159,"score_spread":0.2102718851263449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245144801","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004023247,0.020160606,0.0023434963,0.116236165,0.48697692,0.00019896659,0.0015589985,0.00080671394,0.3713158],"genre_scores_gemma":[0.0018735034,0.0053273253,0.00071220624,0.039829344,0.066754095,0.00012940532,0.00095562433,0.00053234684,0.88388616],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988871,0.00014583924,0.00005671698,0.00017360014,0.0006049108,0.00013184917],"domain_scores_gemma":[0.9952501,0.0007165888,0.00022528628,0.00032569253,0.0022541792,0.0012280974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013029092,0.0009864926,0.0009018132,0.0018269462,0.0018566436,0.004633998,0.0013486395,0.0031912813,0.36306444],"category_scores_gemma":[0.010603975,0.000269399,0.0005828381,0.001068407,0.00082936947,0.0029272595,0.0026104853,0.0044272556,0.3933385],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010463598,0.000005946374,0.000017301709,0.000045599718,0.0000011601044,0.000015338219,0.000009119804,0.00000889145,0.000061694234,0.0018251467,0.9774383,0.020561168],"study_design_scores_gemma":[0.0000034334676,0.0000071486083,0.0000521687,0.00007645577,0.00000139816,0.000036661146,0.000015239646,0.000010678245,0.000048017722,0.0013874521,0.998359,0.0000024176704],"about_ca_topic_score_codex":0.0016664584,"about_ca_topic_score_gemma":0.0031468107,"teacher_disagreement_score":0.36306444,"about_ca_system_score_codex":0.0017745711,"about_ca_system_score_gemma":0.0026672906,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02432263382272556,"score_gpt":0.3023487761771989,"score_spread":0.27802614235447337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297880405","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010329807,0.00013396113,0.92379844,0.00012182689,0.000091627364,0.00010783828,0.0004864782,0.05652171,0.0084084],"genre_scores_gemma":[0.17248398,0.00021412362,0.79722196,0.00037348378,0.00009504642,0.00028631123,0.0013298236,0.013327851,0.014667379],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99906534,0.00012628692,0.000063519525,0.00022211125,0.0002977238,0.00022510438],"domain_scores_gemma":[0.99846566,0.0005085183,0.00007942064,0.0005386225,0.0002955104,0.00011230621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009659367,0.0014583506,0.0009959447,0.0010052042,0.0008501249,0.0021816853,0.0025202252,0.0011772896,0.049369548],"category_scores_gemma":[0.0050012213,0.0010262927,0.001578289,0.0013991819,0.00085748715,0.0034110295,0.0031756656,0.0016641896,0.014344086],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026779547,0.00038341657,0.002554109,0.00077722577,0.0002360794,0.00065512606,0.000634545,0.026049327,0.037450176,0.09215929,0.08510944,0.75131327],"study_design_scores_gemma":[0.0010873402,0.00039915266,0.00120748,0.00032314763,0.00022760445,0.00066825096,0.0002593979,0.48021385,0.1592601,0.13107099,0.22500971,0.00027300086],"about_ca_topic_score_codex":0.0036994237,"about_ca_topic_score_gemma":0.0037993977,"teacher_disagreement_score":0.049369548,"about_ca_system_score_codex":0.0008134658,"about_ca_system_score_gemma":0.0012619536,"threshold_uncertainty_score":0.16515756},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.058492441520241065,"score_gpt":0.32387419755488905,"score_spread":0.265381756034648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365455748","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031203916,0.013707029,0.0021501707,0.13393176,0.52878195,0.00019382345,0.0015298586,0.00074921834,0.3186441],"genre_scores_gemma":[0.0020824568,0.0047146888,0.0007475071,0.05483457,0.0805116,0.0001475659,0.0009924141,0.00060014805,0.855369],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988569,0.00015292778,0.0000611344,0.00017299282,0.0006260801,0.00013002426],"domain_scores_gemma":[0.9948797,0.0008289236,0.00023052427,0.0003454293,0.0025873901,0.0011280264],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013459591,0.0009947773,0.0009005689,0.0017726144,0.002020571,0.0045508314,0.0013290606,0.0037027365,0.3278489],"category_scores_gemma":[0.010778307,0.00029785736,0.0006972313,0.0009786433,0.0008864314,0.0029739013,0.0025387772,0.005262684,0.3477909],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000995482,0.000004830829,0.000014643987,0.00004065207,0.0000011116142,0.000012016407,0.0000072747025,0.0000058248975,0.000053045682,0.0016842578,0.9833287,0.014837697],"study_design_scores_gemma":[0.000004315734,0.000007548144,0.000062727806,0.00008052897,0.000001971753,0.000032581323,0.000013983644,0.0000105586505,0.000059430287,0.0014732534,0.9982503,0.0000027038868],"about_ca_topic_score_codex":0.0021352647,"about_ca_topic_score_gemma":0.0038291535,"teacher_disagreement_score":0.6721511,"about_ca_system_score_codex":0.0018101103,"about_ca_system_score_gemma":0.0027202247,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08699299893677097,"score_gpt":0.37531704934739446,"score_spread":0.2883240504106235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389001533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30384752,0.0020485192,0.4650102,0.0030734546,0.0015780397,0.00048841775,0.0025728897,0.00075946155,0.22062163],"genre_scores_gemma":[0.8834062,0.0013962659,0.06600235,0.0007220964,0.0009264344,0.00030054385,0.002822911,0.00053466874,0.04388852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988778,0.00021581702,0.00008801523,0.00023267386,0.00029169788,0.00029395067],"domain_scores_gemma":[0.9954887,0.0025482085,0.00038082298,0.00026406124,0.00080994336,0.0005082454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014808401,0.0010735318,0.0014038506,0.00212865,0.0018863749,0.0026311174,0.0019947677,0.0015407247,0.023146791],"category_scores_gemma":[0.009892144,0.0007414042,0.0015786466,0.0018095882,0.0034328601,0.00487616,0.0025582681,0.0043246304,0.0028527784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002711994,0.00007710828,0.0005635851,0.00023811488,0.000019720233,0.00035347312,0.00039867588,0.008012161,0.004456684,0.95932263,0.00807296,0.018213646],"study_design_scores_gemma":[0.00011078122,0.00014612959,0.0007886131,0.00007279823,0.00003482042,0.0003043895,0.00060107163,0.040520653,0.004330893,0.94186556,0.011148709,0.000075630065],"about_ca_topic_score_codex":0.0043088,"about_ca_topic_score_gemma":0.0051529775,"teacher_disagreement_score":0.023146791,"about_ca_system_score_codex":0.0015273336,"about_ca_system_score_gemma":0.0012708488,"threshold_uncertainty_score":0.077433705},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Algebra over a field; Computer science; Pure mathematics","score_opus":0.014074862802703,"score_gpt":0.27906603175971384,"score_spread":0.26499116895701086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401820908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08390943,0.0066074347,0.6968295,0.0020550715,0.0016487627,0.00007550029,0.000116659234,0.0007098305,0.20804787],"genre_scores_gemma":[0.77851415,0.0075672828,0.17937507,0.00050717435,0.0013534739,0.00006530043,0.00014308348,0.00025646397,0.032218058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993672,0.00021435341,0.000032369717,0.000093130104,0.00021042467,0.00008252262],"domain_scores_gemma":[0.99899167,0.00040914727,0.00010857536,0.0001629328,0.00024117806,0.00008652957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058968127,0.0006840204,0.00046393878,0.0015322932,0.00059477123,0.0015441027,0.00045377816,0.0005467302,0.006763518],"category_scores_gemma":[0.0046955524,0.00024055502,0.00044196943,0.0012444456,0.0014218654,0.0012504988,0.0017439955,0.0010014275,0.0012616279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059575803,0.000021850847,0.0002962862,0.00008513631,0.000009337228,0.00010876572,0.00011246881,0.0064969533,0.003565827,0.9214338,0.0019196479,0.065890275],"study_design_scores_gemma":[0.000026459014,0.000053489064,0.000263613,0.000056948476,0.000014327438,0.00048686957,0.00012714457,0.06780105,0.0046005985,0.8944725,0.032069754,0.000027178692],"about_ca_topic_score_codex":0.00056380674,"about_ca_topic_score_gemma":0.0005680321,"teacher_disagreement_score":0.006763518,"about_ca_system_score_codex":0.0005558936,"about_ca_system_score_gemma":0.00052607956,"threshold_uncertainty_score":0.022626221},"labels":[],"label_agreement":null}]}