{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20278029,0.00007324693,0.7933838,0.00009156491,0.0025076992,0.00022674388,3.3621995e-7,0.00012404633,0.0008122757],"genre_scores_gemma":[0.8217986,0.0000015647738,0.17779823,0.00013941801,0.00022200904,0.000016187465,1.8046686e-7,0.0000062795752,0.000017530836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977651,0.00004532059,0.00040101432,0.0004140846,0.000667526,0.00070691266],"domain_scores_gemma":[0.99839944,0.0005370045,0.00014811115,0.0006532749,0.000054413547,0.00020775282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017432356,0.00017921929,0.00023023813,0.0007155613,0.0002004067,0.0005528466,0.0016792114,0.000045715315,0.0000024325384],"category_scores_gemma":[0.00013748603,0.00015528568,0.000047225425,0.0022137633,0.00013222553,0.0011827056,0.00062707555,0.00017354249,0.00015649901],"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.0000036456156,0.0009569081,0.0009668017,0.000108873995,0.000009110806,0.000015300853,0.006343778,0.037337888,0.0005244139,0.8018208,0.0010550366,0.1508574],"study_design_scores_gemma":[0.00018843803,0.000064452026,0.0019046876,0.00008317604,0.000001278966,0.000037207617,0.000009770709,0.9910692,0.00047542938,0.005843735,0.000105853826,0.0002167919],"about_ca_topic_score_codex":0.000015952186,"about_ca_topic_score_gemma":7.0884767e-7,"teacher_disagreement_score":0.9537313,"about_ca_system_score_codex":0.00019964686,"about_ca_system_score_gemma":0.00012312578,"threshold_uncertainty_score":0.63323665},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045683082,0.000014873044,0.952819,0.0003835739,0.00009888501,0.0006697563,0.0000011565006,0.00017814172,0.00015154682],"genre_scores_gemma":[0.3363513,9.930328e-7,0.6633173,0.00028235643,0.000014825512,0.000019835388,4.6468105e-7,0.000007458352,0.0000054082966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977639,0.000034363347,0.00046839425,0.00058901036,0.0007372333,0.00040714533],"domain_scores_gemma":[0.99791884,0.00021337262,0.0001768879,0.001089118,0.00044875854,0.00015304293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094377523,0.0001848499,0.00027624445,0.00031555007,0.00013278214,0.0003991596,0.0023759238,0.000066200075,0.000013511578],"category_scores_gemma":[0.00019825449,0.0001647434,0.00005449294,0.002566112,0.00041647465,0.0012780265,0.0006868915,0.00019505734,0.000102080354],"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.000016079794,0.001008788,0.0004279521,0.00037349583,0.000007882612,0.00001839469,0.00958609,0.0046848557,0.2689391,0.026969478,0.0005256263,0.68744224],"study_design_scores_gemma":[0.00013782819,0.00016112207,0.0010410992,0.000071587856,0.0000012900467,0.0000053575864,0.000015340533,0.8530124,0.1288941,0.016387403,0.0000707035,0.00020180237],"about_ca_topic_score_codex":0.000018101782,"about_ca_topic_score_gemma":9.293345e-7,"teacher_disagreement_score":0.8483275,"about_ca_system_score_codex":0.00009684676,"about_ca_system_score_gemma":0.00017531174,"threshold_uncertainty_score":0.6718041},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092059776,0.000014578337,0.90594196,0.00032529255,0.0001415398,0.0002144771,5.110896e-7,0.00011293929,0.0011888981],"genre_scores_gemma":[0.33553407,0.0000020371879,0.6642107,0.00021962191,0.000008615014,0.000016230266,3.687525e-7,0.00000395682,0.000004428752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977733,0.000029146193,0.00032244597,0.0006354702,0.00071993796,0.0005197122],"domain_scores_gemma":[0.9982511,0.000115668416,0.00011629138,0.001206548,0.00015317909,0.00015722809],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00075077254,0.00018761172,0.00030586985,0.0005172402,0.0002442031,0.001364188,0.0024542669,0.000038761664,0.00002409708],"category_scores_gemma":[0.000014658724,0.00012897482,0.00007412465,0.0058629615,0.0004053958,0.0011028292,0.00060457556,0.00014062434,0.0001302956],"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.000002890682,0.0011933077,0.016792115,0.00013702262,0.00021819891,0.00015692752,0.020926883,0.24799116,0.00006579249,0.09913916,0.0010226867,0.61235386],"study_design_scores_gemma":[0.00012437344,0.00007291904,0.0077413456,0.000021434382,0.000010145482,0.000017627093,0.000012098597,0.9573814,0.000024675352,0.034383673,0.000015595482,0.0001946631],"about_ca_topic_score_codex":0.00004742954,"about_ca_topic_score_gemma":0.000021455327,"teacher_disagreement_score":0.7093903,"about_ca_system_score_codex":0.000047370926,"about_ca_system_score_gemma":0.000106116735,"threshold_uncertainty_score":0.9996725},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06560889,0.0000021525727,0.93103236,0.002120095,0.0006201944,0.00019099226,1.4549607e-7,0.00015601536,0.00026915496],"genre_scores_gemma":[0.27488315,0.0000011046643,0.7248589,0.0001751844,0.000056890014,0.000010670844,5.0385853e-7,0.000003429355,0.000010207158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986442,0.000028932858,0.00026307898,0.00043361957,0.0003688321,0.00026133657],"domain_scores_gemma":[0.9989355,0.000041048002,0.00008080452,0.00068194175,0.00015231379,0.00010839573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006379511,0.000102780934,0.00011098627,0.00022025673,0.00019143641,0.0009869114,0.0009394075,0.000031118292,0.000081563034],"category_scores_gemma":[0.000043141124,0.00009517264,0.000018667391,0.0011105554,0.00023326697,0.0026311914,0.0002517739,0.000105232975,0.00015073722],"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":[4.1529069e-7,0.00024142824,0.00089395663,0.000024269457,0.0000025325933,0.000003493207,0.005400152,0.04996397,0.000643765,0.14778481,0.00059857965,0.79444265],"study_design_scores_gemma":[0.00009146928,0.000035651137,0.004507522,0.000007586438,4.7761876e-7,0.000032077896,0.000016409198,0.9794263,0.00023408407,0.015446427,0.000084263665,0.00011770053],"about_ca_topic_score_codex":0.0000147341925,"about_ca_topic_score_gemma":0.000007830573,"teacher_disagreement_score":0.9294624,"about_ca_system_score_codex":0.00007993904,"about_ca_system_score_gemma":0.00010750723,"threshold_uncertainty_score":0.95168084},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066692784,0.000013053059,0.9323149,0.00016337191,0.0002449716,0.000226304,0.0000017811706,0.000037227735,0.00030561612],"genre_scores_gemma":[0.18342118,0.0000029121043,0.8165097,0.000013631687,0.0000227739,0.000009068952,5.0958505e-7,0.000007830183,0.0000123961445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980012,0.00021324395,0.0006604636,0.00022912491,0.00063632976,0.00025962488],"domain_scores_gemma":[0.9950075,0.0039460543,0.000304033,0.000446085,0.00023443993,0.00006185649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030316617,0.000119834716,0.00026509614,0.00016891853,0.00045217565,0.00004146451,0.0007020366,0.000033107746,0.000012329848],"category_scores_gemma":[0.0011381978,0.00008554705,0.000070051174,0.0010593904,0.0019649593,0.0001623895,0.00021858988,0.00014648715,0.000004535189],"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.0000037451628,0.00033326188,0.00028818497,0.00005856231,0.000010090003,0.0000012895239,0.0030071707,0.0014110674,0.000956137,0.93140936,0.000025750689,0.06249541],"study_design_scores_gemma":[0.000091878486,0.00002048342,0.0025165027,0.000019387831,0.000003059977,0.00001309686,0.000015538171,0.3730917,0.0007737316,0.6233866,0.000008549489,0.00005945967],"about_ca_topic_score_codex":0.000007972182,"about_ca_topic_score_gemma":0.000005867264,"teacher_disagreement_score":0.37168062,"about_ca_system_score_codex":0.00006855296,"about_ca_system_score_gemma":0.00012412321,"threshold_uncertainty_score":0.7239975},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.307859,0.00004225273,0.69163615,0.000011804207,0.00005057448,0.00008623723,0.0000015735405,0.00007356543,0.00023884806],"genre_scores_gemma":[0.6371938,0.000016410877,0.36275262,0.000009768344,0.000014461364,0.000003413096,1.176462e-7,0.000006935849,0.0000024657925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988148,0.000008521058,0.00038473407,0.00019830803,0.00031884684,0.0002747935],"domain_scores_gemma":[0.99926186,0.00025819882,0.00010500518,0.00029506933,0.000033546603,0.00004630903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007384374,0.00011991623,0.00029303462,0.00043710216,0.000017688752,0.000023905679,0.0005365325,0.000029245157,0.0000072839207],"category_scores_gemma":[0.00004536993,0.00010976882,0.000036568275,0.0009718707,0.00016421135,0.00022694915,0.00011644107,0.000112316455,0.0000029068042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.000024848121,0.0012303004,0.025462601,0.0010335833,0.000049684524,0.00026722287,0.011028949,0.59559005,0.26622343,0.01819042,0.00020718903,0.080691725],"study_design_scores_gemma":[0.00012081763,0.000018405199,0.002202746,0.00019981487,0.0000021146736,0.0000031612167,0.000059788115,0.5669996,0.41187364,0.018357698,0.000010236438,0.00015192755],"about_ca_topic_score_codex":0.000013753596,"about_ca_topic_score_gemma":0.000021254895,"teacher_disagreement_score":0.3293348,"about_ca_system_score_codex":0.00012359752,"about_ca_system_score_gemma":0.000009748339,"threshold_uncertainty_score":0.44762427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15638617,0.00001759096,0.8425944,0.00007798303,0.00046586408,0.00013457538,0.0000016435756,0.00011897189,0.00020284377],"genre_scores_gemma":[0.1547206,0.0000069821094,0.8450316,0.00006047343,0.000087799206,0.0000024660965,0.0000018738137,0.000009018385,0.00007913954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997751,0.00003830567,0.00035883905,0.00060359115,0.00080948666,0.0004387602],"domain_scores_gemma":[0.9983629,0.00012778451,0.00016659398,0.0010658884,0.00014619452,0.00013062333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007002475,0.00018918715,0.00024014947,0.00032836047,0.0004277683,0.00031945284,0.002109736,0.000055956327,0.000009958874],"category_scores_gemma":[0.000054862143,0.00016672842,0.000039141487,0.0015523629,0.00026983264,0.0015950812,0.0013345147,0.00015222457,0.00010834851],"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.0000196437,0.0046410263,0.013294215,0.0006342758,0.00005936366,0.0006895197,0.09196434,0.16679633,0.12615027,0.2555058,0.006275152,0.33397007],"study_design_scores_gemma":[0.0001575673,0.000020629388,0.00070655014,0.00008538875,0.0000011334258,0.00012264344,0.0000051282695,0.99059105,0.0017631275,0.006072388,0.0002456125,0.0002287712],"about_ca_topic_score_codex":0.000027928392,"about_ca_topic_score_gemma":0.0000023040388,"teacher_disagreement_score":0.8237947,"about_ca_system_score_codex":0.00013166091,"about_ca_system_score_gemma":0.00022151267,"threshold_uncertainty_score":0.6798988},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032682087,0.000009440726,0.96448255,0.0011121335,0.0010635243,0.00044703038,0.0000017069665,0.0000791142,0.00012242397],"genre_scores_gemma":[0.16108534,0.0000017897445,0.83852863,0.00020072638,0.00014943874,0.000018118382,7.6405536e-7,0.000008103817,0.0000071185423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746585,0.000041883442,0.0005258573,0.0007118444,0.00062659924,0.0006279958],"domain_scores_gemma":[0.9972551,0.0010969145,0.00019047716,0.0012222131,0.00012271122,0.00011256991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037846216,0.00018806502,0.00024159356,0.00025881853,0.00028194202,0.00073165435,0.0027243567,0.000068357826,0.0000019435272],"category_scores_gemma":[0.0003134374,0.00013241479,0.00005139864,0.0010459842,0.00026412634,0.0010248796,0.0018843124,0.0005361535,0.000008538096],"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.000006213381,0.00088225264,0.00055944,0.000113047114,0.000009744418,0.00010022595,0.01239943,0.007923703,0.0028755239,0.40636545,0.00053538877,0.56822956],"study_design_scores_gemma":[0.00030952046,0.00004500513,0.0008140708,0.00007895079,0.0000015072645,0.00009665834,0.000034356064,0.9757599,0.00054413377,0.021778714,0.00036063656,0.00017652374],"about_ca_topic_score_codex":0.000021864995,"about_ca_topic_score_gemma":0.00003507449,"teacher_disagreement_score":0.9678362,"about_ca_system_score_codex":0.00005759068,"about_ca_system_score_gemma":0.00020336,"threshold_uncertainty_score":0.705536},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8921306,0.00019404115,0.08709156,0.0035069215,0.0021877463,0.0060860994,0.000083907515,0.00035363005,0.008365469],"genre_scores_gemma":[0.84795,0.00004170552,0.14836483,0.00086209754,0.000684388,0.00082451856,0.000010194879,0.00018643032,0.0010758926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899457,0.0008760921,0.00220989,0.0015910168,0.002731619,0.0026456944],"domain_scores_gemma":[0.9817989,0.013552122,0.00078572135,0.003101849,0.0003914539,0.00036999286],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.019313091,0.0009968386,0.0012958508,0.0009230165,0.0017268544,0.0020273163,0.0069927145,0.00033531841,0.000109325425],"category_scores_gemma":[0.0049709594,0.00065114826,0.00041073712,0.0022905353,0.0023606692,0.00097412546,0.0020645747,0.0011438874,0.00041045024],"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.00047362008,0.004036224,0.00089368894,0.0017889905,0.00015098153,0.00017752747,0.05280934,0.00032010546,0.0032958258,0.8799086,0.011937028,0.044208072],"study_design_scores_gemma":[0.0030198,0.0010083886,0.0005687669,0.00082167535,0.00006700383,0.0004393968,0.0024864888,0.40047586,0.002190743,0.58347714,0.004194421,0.0012503441],"about_ca_topic_score_codex":0.000067131135,"about_ca_topic_score_gemma":0.00017987436,"teacher_disagreement_score":0.40015575,"about_ca_system_score_codex":0.00053169415,"about_ca_system_score_gemma":0.0006715411,"threshold_uncertainty_score":0.999594},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30329072,0.000012671305,0.69023484,0.0000026168118,0.00012544756,0.000031504584,4.4841394e-7,0.000027759095,0.0062740007],"genre_scores_gemma":[0.9124077,0.000001785536,0.0875652,0.0000063878438,0.0000117823965,0.0000021597475,2.047133e-7,0.0000027691472,0.0000020242255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992463,0.000004265717,0.00023180146,0.00009504384,0.00023029468,0.00019227201],"domain_scores_gemma":[0.99954563,0.00013587033,0.000021121134,0.0002204941,0.000028260187,0.000048637736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006763658,0.000057309866,0.00021011605,0.00023854557,0.000019053829,0.00004245831,0.00033193067,0.00002210028,0.0000033708952],"category_scores_gemma":[0.000023852286,0.000046994584,0.000033757507,0.0010211661,0.000119196855,0.00013981794,0.00007784052,0.00005182025,0.000006803163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.077192e-7,0.00004099214,0.00024450492,0.00020262651,0.000037137546,9.454743e-7,0.00056497974,0.74240035,0.00050712214,0.2519282,0.0000037781933,0.004069054],"study_design_scores_gemma":[0.00003936142,0.000012159878,0.001590826,0.000030107527,0.000022157903,0.0000011981741,0.000008953311,0.9969539,0.000620276,0.00065138494,0.0000137582665,0.000055923127],"about_ca_topic_score_codex":0.0000021276826,"about_ca_topic_score_gemma":0.0000029675537,"teacher_disagreement_score":0.609117,"about_ca_system_score_codex":0.000023033625,"about_ca_system_score_gemma":0.000008082935,"threshold_uncertainty_score":0.19163835},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1643699,0.000019618701,0.8341916,0.0007233708,0.0001368097,0.00005298752,0.0000017507722,0.000050897168,0.0004530235],"genre_scores_gemma":[0.5523326,0.0000059240347,0.44756362,0.000072657356,0.000010030416,0.0000018726423,8.082875e-8,0.0000013283712,0.000011890059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807936,0.000035505705,0.0004902312,0.0004659621,0.0005454469,0.00038346899],"domain_scores_gemma":[0.99817127,0.00068561983,0.0001972336,0.0007451674,0.0001038008,0.0000969206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014899942,0.00011516739,0.00027735706,0.0003333757,0.0001106912,0.000099722085,0.0024616867,0.000046089113,0.00003907209],"category_scores_gemma":[0.0005922892,0.00006375189,0.00006669404,0.0028321154,0.00068999233,0.0005279571,0.0013366545,0.00007453813,0.00005466699],"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.0000017475652,0.00044358903,0.0062481943,0.000032297048,0.000009611075,0.000042692514,0.0010080372,0.00042945676,0.001037908,0.3932062,0.00009570145,0.59744453],"study_design_scores_gemma":[0.0003594925,0.00023240701,0.0111347465,0.00011732744,0.00000479004,0.000034042612,0.00001603842,0.64557743,0.0035234983,0.3385346,0.00015380554,0.00031181946],"about_ca_topic_score_codex":0.000009110984,"about_ca_topic_score_gemma":0.0000023845225,"teacher_disagreement_score":0.645148,"about_ca_system_score_codex":0.000035499434,"about_ca_system_score_gemma":0.00007053022,"threshold_uncertainty_score":0.45744672},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4242167,0.00007622624,0.57362294,0.00059690565,0.0007487113,0.0002655441,0.0000069222774,0.00015056842,0.00031550135],"genre_scores_gemma":[0.6329093,0.00004679145,0.3668564,0.00009851179,0.000052499403,0.000011626629,0.0000012727718,0.000010319887,0.000013295438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966019,0.00005599094,0.0005932834,0.0011531445,0.0008569865,0.0007387201],"domain_scores_gemma":[0.9951274,0.00023221504,0.00047339257,0.003774369,0.000117092626,0.00027553816],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021513705,0.00033570133,0.00046305673,0.00029212466,0.0011792313,0.0031429478,0.0077529442,0.000106626285,0.000004788248],"category_scores_gemma":[0.000150746,0.00029612775,0.00004961564,0.00043718278,0.0013239494,0.0031564336,0.0046479916,0.00034640322,0.000054752254],"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.00001507104,0.0011639039,0.03494865,0.0005624922,0.000029755543,0.0016098018,0.007752948,0.0016175299,0.0081539815,0.42988062,0.00036940773,0.51389587],"study_design_scores_gemma":[0.00043008217,0.00008035818,0.036610663,0.00036080973,0.0000036340957,0.00034981457,0.000008880369,0.91528654,0.0014467643,0.044966087,0.000046216755,0.00041013627],"about_ca_topic_score_codex":0.00014829561,"about_ca_topic_score_gemma":0.000055510358,"teacher_disagreement_score":0.91366905,"about_ca_system_score_codex":0.00012676533,"about_ca_system_score_gemma":0.00023411095,"threshold_uncertainty_score":0.9999491},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23888086,0.000029562827,0.75755477,0.000378518,0.001661323,0.00065668736,0.0000021843948,0.00017413092,0.00066196034],"genre_scores_gemma":[0.41614762,0.0000043175824,0.5834725,0.00013547474,0.00014309744,0.00005077009,2.2086351e-7,0.000017230755,0.000028744262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929304,0.000071018534,0.0011793053,0.0019237428,0.0023266918,0.0015688144],"domain_scores_gemma":[0.9929603,0.00042714018,0.00054511393,0.005246288,0.00043034705,0.00039085027],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.007020567,0.00051764416,0.0007669924,0.0013560181,0.0007477149,0.004007815,0.013013479,0.00014483924,0.000043997552],"category_scores_gemma":[0.0004577514,0.00049271324,0.00014397684,0.0026089891,0.003295037,0.0032927692,0.008846518,0.00053982943,0.0002988116],"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.00001576079,0.0045468807,0.012540415,0.0006594206,0.000024334751,0.0013859912,0.032151498,0.016190918,0.00076758943,0.089756094,0.00024915132,0.84171194],"study_design_scores_gemma":[0.0005150924,0.00011838888,0.03945018,0.00025304573,0.0000031484785,0.000089505644,0.00001612519,0.88530487,0.00036041057,0.07327256,0.00006106616,0.0005556261],"about_ca_topic_score_codex":0.00004391722,"about_ca_topic_score_gemma":0.00007041189,"teacher_disagreement_score":0.8691139,"about_ca_system_score_codex":0.00060291664,"about_ca_system_score_gemma":0.0007669123,"threshold_uncertainty_score":0.99975246},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8756674,0.000006252289,0.12403868,0.000013979893,0.0001738584,0.000047441714,0.0000027254607,0.000009462998,0.00004023282],"genre_scores_gemma":[0.9407028,0.000007048,0.05927139,0.0000033668928,0.000010752936,4.972215e-7,2.7589797e-7,0.0000029189464,9.2742323e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963677,6.4793295e-7,0.00010588197,0.000071261384,0.000103442224,0.000081997714],"domain_scores_gemma":[0.9997137,0.0000065932186,0.00003927726,0.00020642897,0.000017344397,0.000016644035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014828729,0.00004145666,0.000067778965,0.000055366607,0.000048690214,0.00007100113,0.00021216035,0.000014174392,0.000004531026],"category_scores_gemma":[0.0000027083613,0.00003633713,0.000005913606,0.000060519385,0.000063318876,0.000115380564,0.00008535262,0.000027754035,2.0468194e-7],"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.000001980249,0.000069364905,0.04028455,0.0011531698,0.000022218012,0.000012195281,0.011739162,0.007731395,0.114024095,0.102054775,0.000059653285,0.72284746],"study_design_scores_gemma":[0.00009800592,0.0000080607415,0.034144007,0.000027478647,0.000001241925,0.000005878358,0.000014350532,0.93850344,0.009094146,0.01803929,0.0000054373,0.00005865603],"about_ca_topic_score_codex":0.000007859184,"about_ca_topic_score_gemma":0.000052377974,"teacher_disagreement_score":0.93077207,"about_ca_system_score_codex":0.000012087402,"about_ca_system_score_gemma":0.000008425715,"threshold_uncertainty_score":0.14817852},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.521409,0.00004416102,0.4757363,0.000019823667,0.0011407317,0.00022129428,0.0000034310196,0.00011725761,0.0013080266],"genre_scores_gemma":[0.87742454,0.0000027709243,0.12224502,0.000025388923,0.00026193555,0.000015666916,3.929565e-7,0.000011292542,0.000012991445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903697,0.00001167771,0.00029371036,0.00018870727,0.00017609193,0.00029282036],"domain_scores_gemma":[0.9994277,0.00014958845,0.000045752135,0.00026711967,0.000054047137,0.000055820834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009445379,0.00011342186,0.00018543503,0.00019662778,0.000117690404,0.00012268523,0.000528901,0.00003616238,0.0000104452565],"category_scores_gemma":[0.000016534696,0.0001005456,0.00003752825,0.00047004534,0.00022281654,0.00019420782,0.000069676105,0.00004802374,0.0000505579],"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.00006437628,0.0011479607,0.0035195015,0.005376779,0.000138533,0.000030147607,0.065723754,0.02331372,0.12275715,0.6679043,0.019915842,0.090107895],"study_design_scores_gemma":[0.0002402875,0.000087807246,0.00037302537,0.00014777071,0.000003994815,0.00001897282,0.000061914194,0.96231115,0.016772892,0.018865598,0.0009056621,0.00021089657],"about_ca_topic_score_codex":0.0000014148821,"about_ca_topic_score_gemma":0.0000041415055,"teacher_disagreement_score":0.93899745,"about_ca_system_score_codex":0.000036434256,"about_ca_system_score_gemma":0.000015917249,"threshold_uncertainty_score":0.41001305},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104677826,0.000017258315,0.8900691,0.004661932,0.00021328626,0.00024832718,9.0948674e-7,0.000052057236,0.000059288763],"genre_scores_gemma":[0.8457708,8.85475e-7,0.15325403,0.0008909728,0.00006950612,0.0000074306777,2.1264228e-7,0.0000027829558,0.0000033942497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985656,0.00005411481,0.00032386745,0.0003387975,0.0004637539,0.00025385487],"domain_scores_gemma":[0.999021,0.00020575196,0.000072041505,0.00046809652,0.000117443036,0.00011569557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015645603,0.00010058964,0.00017284257,0.00011336972,0.00011291539,0.00013247682,0.0020015899,0.000021141263,0.0000012720894],"category_scores_gemma":[0.00019392345,0.00007082552,0.000041903037,0.0016491225,0.00015948649,0.00027804187,0.0008322487,0.00009212895,0.000019353849],"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.0000033339913,0.000064124884,0.00006165611,0.000022677707,0.0000035912183,0.00000420577,0.008958184,0.0081203785,0.0017058608,0.8393066,0.00009132497,0.14165808],"study_design_scores_gemma":[0.000096897464,0.000085432854,0.002096847,0.00004276557,0.0000016553219,0.0000066296298,0.000019170895,0.9470892,0.0059895553,0.044347454,0.00012460955,0.00009979343],"about_ca_topic_score_codex":0.0000013655771,"about_ca_topic_score_gemma":0.0000015934789,"teacher_disagreement_score":0.93896884,"about_ca_system_score_codex":0.000041737014,"about_ca_system_score_gemma":0.000078878955,"threshold_uncertainty_score":0.37194854},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6129298,0.000047776262,0.3861487,0.00030003052,0.00012218629,0.0002821869,0.0000010068826,0.0000474794,0.000120858545],"genre_scores_gemma":[0.64713037,0.0000031738791,0.35277054,0.00003309515,0.000043960128,0.000005336058,5.3857548e-8,0.000010072026,0.0000034094082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984124,0.000025635121,0.00056881644,0.00027722598,0.00049302576,0.00022295066],"domain_scores_gemma":[0.9989844,0.0002616613,0.0002453815,0.00028275905,0.00012449839,0.00010132347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006907062,0.00014533181,0.0003688379,0.000116675474,0.00006362694,0.000050240433,0.00041727943,0.00004313217,0.0000037202387],"category_scores_gemma":[0.0008712185,0.00012224841,0.00003149259,0.0005628716,0.00039539818,0.00026552958,0.0003615204,0.00010741086,0.0000037334732],"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.000018803834,0.0004049609,0.0003414256,0.0022041057,0.000015582984,0.000010318336,0.024174694,0.0005770941,0.050997473,0.91323334,0.0000736902,0.007948533],"study_design_scores_gemma":[0.00044411916,0.000102000246,0.00011944241,0.00037030972,0.0000105352165,0.000012835497,0.00009241981,0.3484621,0.03385072,0.6163168,0.00000986091,0.00020888071],"about_ca_topic_score_codex":0.0000016859689,"about_ca_topic_score_gemma":8.506415e-7,"teacher_disagreement_score":0.347885,"about_ca_system_score_codex":0.00004124819,"about_ca_system_score_gemma":0.00008024536,"threshold_uncertainty_score":0.49851456},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3839914,0.000009871242,0.60210955,0.0023403212,0.00011789693,0.00093268557,0.0000021339895,0.0003170914,0.010179042],"genre_scores_gemma":[0.31668234,0.0000013594384,0.6817978,0.0014020681,0.00005599392,0.000015796768,3.549762e-7,0.000018223263,0.000026073634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974154,0.000026865919,0.00059386046,0.00057964365,0.00086172344,0.00052247546],"domain_scores_gemma":[0.998312,0.00068680756,0.00011807808,0.00032172236,0.00016728762,0.000394133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082067144,0.00024441944,0.0004154598,0.00017333812,0.00016534318,0.0002019117,0.0008002481,0.000044774315,0.000095476134],"category_scores_gemma":[0.00094593194,0.00020520302,0.00006161886,0.001278957,0.00016252625,0.0002624344,0.0010532127,0.00019150761,0.0006265766],"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.00009041185,0.004357373,0.00075556483,0.0051055923,0.00007003218,0.0009039249,0.14649601,0.00039846823,0.02577775,0.66916925,0.015861446,0.13101417],"study_design_scores_gemma":[0.00052025245,0.0003242067,0.00027072078,0.0010929797,0.000009767194,0.00006963869,0.00042553127,0.10403942,0.0054454287,0.8870872,0.0001554619,0.0005593722],"about_ca_topic_score_codex":0.0000033242084,"about_ca_topic_score_gemma":0.0000040853333,"teacher_disagreement_score":0.21791796,"about_ca_system_score_codex":0.00009846163,"about_ca_system_score_gemma":0.00011690077,"threshold_uncertainty_score":0.83679366},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06602283,0.000048845202,0.9296907,0.001242098,0.0015851571,0.00049946504,0.00001597376,0.00025462382,0.0006402813],"genre_scores_gemma":[0.36456215,0.0000122101,0.6351069,0.00014605555,0.00010944585,0.00003100979,0.000005186663,0.000016289205,0.000010734604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613816,0.00014193985,0.0009357592,0.0012319535,0.00093011715,0.0006221014],"domain_scores_gemma":[0.9962113,0.0006489373,0.0004007828,0.0024069084,0.00010106848,0.00023099876],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001596659,0.00044627485,0.00072105066,0.0009109569,0.0002314187,0.0010369144,0.008086772,0.000205809,0.000016263511],"category_scores_gemma":[0.0001451574,0.0004351247,0.00015057591,0.0020209143,0.00030657355,0.00079397287,0.0086778905,0.0012466651,0.000056364006],"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.000008964436,0.0019757957,0.0039349715,0.0014157164,0.000040764033,0.00047562362,0.021039797,0.08633749,0.00064991997,0.8650745,0.00069493137,0.018351533],"study_design_scores_gemma":[0.0001603523,0.00002728109,0.0010509435,0.00025905072,0.0000029856053,0.000013488913,0.000021914246,0.58503854,0.0005513753,0.41254166,0.000025861138,0.00030650766],"about_ca_topic_score_codex":0.00006757839,"about_ca_topic_score_gemma":0.000044694134,"teacher_disagreement_score":0.49870107,"about_ca_system_score_codex":0.00036341997,"about_ca_system_score_gemma":0.00039862437,"threshold_uncertainty_score":0.99989897},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097578764,0.0000029461014,0.9005674,0.0010149281,0.00014116344,0.00035275723,0.00006074533,0.00001916825,0.00026213253],"genre_scores_gemma":[0.1992883,1.1646141e-7,0.79971594,0.0005739364,0.0003740096,0.00001024771,0.0000054334914,0.000013337252,0.000018709114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986622,0.000010163977,0.00039733815,0.00033256577,0.00026865146,0.00032912992],"domain_scores_gemma":[0.9991421,0.00013541567,0.00011492505,0.0002873742,0.00012836799,0.0001918158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039228747,0.0001425714,0.00029206017,0.00013676421,0.00008188497,0.000064723376,0.00063318224,0.000025513025,0.000016382526],"category_scores_gemma":[0.00003573869,0.00013227401,0.00009277988,0.00078332593,0.00012565422,0.00009614623,0.00021333872,0.00010037803,0.000020208283],"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.00027525018,0.008409426,0.026807386,0.0044662617,0.00033152825,0.000029017949,0.057423808,0.24774085,0.11976099,0.25387993,0.0071263015,0.27374923],"study_design_scores_gemma":[0.0003956724,0.00015036021,0.000055240056,0.00007501221,0.0000055032033,2.0533835e-7,0.00006173818,0.97360986,0.022282727,0.0024088924,0.00079996453,0.00015480569],"about_ca_topic_score_codex":0.00003019209,"about_ca_topic_score_gemma":0.0000013286206,"teacher_disagreement_score":0.72586906,"about_ca_system_score_codex":0.000021771168,"about_ca_system_score_gemma":0.00023695598,"threshold_uncertainty_score":0.5393978},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04576973,0.00001294449,0.95027006,0.003015925,0.00029915562,0.00011015334,5.073337e-7,0.00013399498,0.00038755705],"genre_scores_gemma":[0.5389576,6.92012e-7,0.45996076,0.0010005863,0.00007031812,0.0000029206412,1.2037725e-7,0.0000027579524,0.000004219455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855983,0.000014364368,0.00026968322,0.00043405377,0.00040971517,0.0003123786],"domain_scores_gemma":[0.99926686,0.00009605604,0.00007145175,0.0003531113,0.000049019385,0.00016347846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043521132,0.000110233195,0.00015150705,0.0001315372,0.000098648095,0.00022438407,0.0019318807,0.000021986203,0.000004140834],"category_scores_gemma":[0.000065084474,0.000098641576,0.00003439107,0.0015643004,0.00012687227,0.00071227486,0.00083887856,0.000111765214,0.000100704165],"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.000001980414,0.00016216097,0.0002659611,0.00008185646,0.0000037480665,0.000044189306,0.013886682,0.007956601,0.0014618287,0.49931058,0.0005816872,0.47624272],"study_design_scores_gemma":[0.00013853873,0.00005181066,0.0006240605,0.000021182304,4.8368446e-7,0.000009094088,0.0000053686986,0.95493376,0.0011656944,0.042807937,0.00011929774,0.00012274408],"about_ca_topic_score_codex":0.0000026607097,"about_ca_topic_score_gemma":0.0000014919735,"teacher_disagreement_score":0.9469772,"about_ca_system_score_codex":0.00004205314,"about_ca_system_score_gemma":0.00011658208,"threshold_uncertainty_score":0.40224868},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9526787,0.00024198624,0.045761663,0.000014813619,0.00009664845,0.0000667934,0.000005828207,0.000015190031,0.0011184082],"genre_scores_gemma":[0.96736866,0.00003784052,0.032506216,0.000028690509,0.00003710322,7.318362e-7,0.0000035661683,0.0000038876,0.000013321485],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99856585,0.00017347667,0.00030843465,0.00022289048,0.0005229132,0.0002064096],"domain_scores_gemma":[0.9990065,0.00016292887,0.00019009743,0.0003551453,0.00022420999,0.000061137645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010322492,0.000086085405,0.00025825555,0.0004996823,0.00012768677,0.000061794795,0.00059196964,0.000033609078,0.00004336538],"category_scores_gemma":[0.00022220929,0.000066611305,0.00007704256,0.005725801,0.00044913977,0.00018794868,0.00016169038,0.00007017374,0.0000013836037],"study_design_candidate":"qualitative","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.0000050057356,0.00078565744,0.014941196,0.00023028071,0.0002714411,0.00005675732,0.58959436,0.008727303,0.12080066,0.023366887,0.000013139601,0.24120733],"study_design_scores_gemma":[0.00069679663,0.00028650486,0.47327042,0.00023017036,0.0006225471,0.000020471423,0.12395271,0.2121317,0.16718167,0.020519175,0.00006939104,0.00101847],"about_ca_topic_score_codex":0.0003049694,"about_ca_topic_score_gemma":0.00094444695,"teacher_disagreement_score":0.46564165,"about_ca_system_score_codex":0.000049343238,"about_ca_system_score_gemma":0.00010459982,"threshold_uncertainty_score":0.27510577},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006982173,0.00022504387,0.97344357,0.000485676,0.009530502,0.0020406267,0.000012634299,0.00030858602,0.0069711762],"genre_scores_gemma":[0.012125875,0.00006726071,0.98537713,0.00047443135,0.00069895166,0.00016432673,0.000006302144,0.00008709084,0.0009986565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98523164,0.0002081461,0.0028781577,0.00420108,0.004417045,0.0030639227],"domain_scores_gemma":[0.9894605,0.001390539,0.0011971946,0.006091062,0.0011364956,0.0007241699],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.008409411,0.0014738282,0.002181857,0.0043038055,0.0006586992,0.0043904926,0.02095711,0.00054259045,0.00023481382],"category_scores_gemma":[0.0003459264,0.001363713,0.00030546615,0.011856737,0.0039768866,0.0032484345,0.013276129,0.001865921,0.00564809],"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.000009131142,0.011802384,0.00034034014,0.00640508,0.00009672592,0.0008008551,0.045986943,0.19624472,0.0014833695,0.12340024,0.035501227,0.57792896],"study_design_scores_gemma":[0.00054189574,0.00021170874,0.00030030872,0.0011321949,0.0000071095874,0.00019307106,0.000023583976,0.952616,0.00058368244,0.042382017,0.0005501348,0.0014583416],"about_ca_topic_score_codex":0.00012961651,"about_ca_topic_score_gemma":0.00004911232,"teacher_disagreement_score":0.7563712,"about_ca_system_score_codex":0.0019942506,"about_ca_system_score_gemma":0.0029469691,"threshold_uncertainty_score":0.9998011},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2675731,0.000008515383,0.7303223,0.00023621263,0.00070245314,0.00013475522,2.6354658e-7,0.000074443116,0.000947966],"genre_scores_gemma":[0.6057656,5.912416e-7,0.39395234,0.00018393139,0.000031236254,0.0000031852232,1.3276478e-7,0.0000029433645,0.00006005679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984916,0.000013805478,0.00026147216,0.0004366051,0.0004427821,0.00035372615],"domain_scores_gemma":[0.9990093,0.00012952897,0.0000769118,0.0006519573,0.00005388402,0.0000784116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007703914,0.00011170782,0.0001574693,0.0002803315,0.00006994439,0.00022052572,0.0018649173,0.000026063597,0.0000102820595],"category_scores_gemma":[0.00002124264,0.00009781248,0.000035655026,0.0012748847,0.0000918177,0.00083865615,0.0007614084,0.0001048782,0.00035034784],"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.0000011316866,0.00019601364,0.0013273051,0.00006681115,0.0000030242027,0.000013022435,0.0035696174,0.006559782,0.0013929481,0.6917288,0.00013738369,0.29500416],"study_design_scores_gemma":[0.00016225617,0.000042103213,0.002674401,0.00004402231,3.3994942e-7,0.000016336904,0.0000043352334,0.9114624,0.00088223926,0.08449804,0.0000844078,0.0001291004],"about_ca_topic_score_codex":0.000005036875,"about_ca_topic_score_gemma":0.0000029341973,"teacher_disagreement_score":0.90490264,"about_ca_system_score_codex":0.00007505528,"about_ca_system_score_gemma":0.000121283505,"threshold_uncertainty_score":0.45031294},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42446274,0.000009374078,0.5709283,0.0000055295172,0.00066501007,0.000051150935,4.978816e-7,0.000082867766,0.0037945453],"genre_scores_gemma":[0.93362963,5.429046e-7,0.06622664,0.00001949475,0.00009728126,0.00000365226,5.8429823e-8,0.000005568867,0.000017150882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942434,0.000004650568,0.00013615158,0.00010440394,0.00014211383,0.00018834023],"domain_scores_gemma":[0.99964964,0.000031160806,0.000012151068,0.0002456689,0.00002533393,0.000036025383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005141837,0.000060888622,0.00007961805,0.000119548335,0.000053486194,0.000040642008,0.0003743796,0.000018267423,0.000012728994],"category_scores_gemma":[0.000008350285,0.00005356875,0.000014136984,0.0005135898,0.00022562327,0.00012343329,0.000055082248,0.000048179627,0.00011035889],"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.000003510128,0.00022407855,0.0018591174,0.0006900394,0.000021680302,0.00003142534,0.033979718,0.016704587,0.012406025,0.79507065,0.0024053706,0.13660379],"study_design_scores_gemma":[0.00005240468,0.000020644411,0.00031173913,0.000060510913,5.617899e-7,0.000012181957,0.000019063516,0.94467425,0.0038896166,0.050703008,0.00017169733,0.00008433735],"about_ca_topic_score_codex":5.2093117e-7,"about_ca_topic_score_gemma":0.000004109105,"teacher_disagreement_score":0.92796963,"about_ca_system_score_codex":0.000021811558,"about_ca_system_score_gemma":0.000007945797,"threshold_uncertainty_score":0.21844701},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2490513,0.000015302077,0.74913496,0.0005965087,0.00064651616,0.00030231389,0.000008092287,0.00012912757,0.00011588286],"genre_scores_gemma":[0.8490829,0.0000014478452,0.15053093,0.000236797,0.000055006847,0.000044374447,0.0000051178895,0.0000093893805,0.000034033244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723995,0.000098462086,0.0005638794,0.00071623543,0.0008525933,0.0005288626],"domain_scores_gemma":[0.9986737,0.00021703099,0.00025632745,0.0006780452,0.000057657326,0.000117249234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015302941,0.0001844992,0.00023387991,0.0003776618,0.00049022876,0.0004353976,0.0021145763,0.000020599104,0.000041128875],"category_scores_gemma":[0.0000389746,0.00019042398,0.000057375753,0.0016377808,0.0001296873,0.00068582746,0.002334161,0.00015706928,0.000021948697],"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.000026995564,0.0019088488,0.0029344468,0.00022515158,0.00007019179,0.00011479354,0.1358316,0.09492802,0.14957741,0.14197324,0.008176812,0.4642325],"study_design_scores_gemma":[0.0005896429,0.000098034085,0.0011055175,0.000017610673,0.0000021651747,0.000019140614,0.00021368345,0.9735696,0.008208814,0.015325519,0.00057396427,0.0002763273],"about_ca_topic_score_codex":0.00020441342,"about_ca_topic_score_gemma":0.000009248287,"teacher_disagreement_score":0.87864155,"about_ca_system_score_codex":0.00035387362,"about_ca_system_score_gemma":0.00018301708,"threshold_uncertainty_score":0.77652645},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72908944,0.000003537618,0.2679575,0.0001381708,0.0004737347,0.00020121121,0.0000066095313,0.00045994302,0.0016698301],"genre_scores_gemma":[0.6987605,7.9607673e-7,0.30095392,0.00006348815,0.000055413326,0.000013833623,8.76618e-7,0.000022998565,0.00012813293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982757,0.000012804532,0.00024653273,0.00032254358,0.0006564003,0.00048601793],"domain_scores_gemma":[0.9990682,0.0001758973,0.00006168268,0.0005537255,0.00006183597,0.00007867889],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022695907,0.000100802376,0.00013978609,0.000635238,0.0001149761,0.00011102794,0.0010302544,0.000022388582,0.000016948068],"category_scores_gemma":[0.00013707687,0.000089844885,0.000026682155,0.0049441615,0.00037490058,0.0002887785,0.0005904395,0.00009826633,0.007592747],"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.000011363382,0.0013825257,0.014351601,0.00070517586,0.000023589906,0.0005455062,0.058316674,0.06653625,0.026787376,0.5996252,0.043003187,0.1887116],"study_design_scores_gemma":[0.00011302908,0.000016149132,0.004251988,0.00006140992,8.325204e-7,0.00001205381,0.000027456821,0.92688423,0.0008725195,0.06752076,0.00012397986,0.000115586205],"about_ca_topic_score_codex":0.0000026906503,"about_ca_topic_score_gemma":0.000008609541,"teacher_disagreement_score":0.860348,"about_ca_system_score_codex":0.00009612148,"about_ca_system_score_gemma":0.000078610436,"threshold_uncertainty_score":0.99318},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9281955,0.00002237041,0.068332866,0.00097408687,0.00030795595,0.0013715929,0.00010086512,0.00036898316,0.0003258159],"genre_scores_gemma":[0.52995527,0.000020469903,0.4678138,0.00046946044,0.00039572915,0.0005454231,0.000013311993,0.0000828828,0.00070367253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979787,0.000023009421,0.00064738863,0.00047666865,0.00034375937,0.0005304685],"domain_scores_gemma":[0.99775153,0.001200928,0.00021347225,0.0006160836,0.00008488853,0.00013307547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013562059,0.00023361562,0.00039863368,0.00047501735,0.0003437663,0.00028207,0.0005759527,0.00007822967,0.000022314458],"category_scores_gemma":[0.00021506746,0.00020511469,0.00007532428,0.0008772755,0.00035324972,0.00026152012,0.0002770614,0.0001109064,0.00006950423],"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.000008026327,0.0008054241,0.0006648041,0.0013548727,0.000052030548,0.000008359735,0.013284064,0.00028877772,0.023171458,0.9201917,0.038723808,0.0014466578],"study_design_scores_gemma":[0.0004295522,0.000040533603,0.00035695007,0.00018131154,0.000015679583,0.000018003397,0.000071758805,0.35268137,0.0018737422,0.6430948,0.0009434109,0.00029291966],"about_ca_topic_score_codex":0.0000067569163,"about_ca_topic_score_gemma":0.000009302917,"teacher_disagreement_score":0.3994809,"about_ca_system_score_codex":0.0000470937,"about_ca_system_score_gemma":0.000059079495,"threshold_uncertainty_score":0.8364335},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003127985,0.00019262401,0.9947956,0.00020223498,0.000312402,0.00015562974,0.0000026681619,0.000103346065,0.0011074939],"genre_scores_gemma":[0.28289458,0.000008377488,0.7169126,0.000033122746,0.00007925048,0.000024324989,5.018401e-7,0.0000036317497,0.000043573047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986335,0.000018533998,0.0003276317,0.0003484367,0.00048234983,0.00018956879],"domain_scores_gemma":[0.999055,0.0003121233,0.00006235429,0.00043512016,0.00008330919,0.000052080915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013148539,0.000089690235,0.00012556283,0.00042020122,0.000085813546,0.00029804456,0.0014625873,0.000024153422,0.000017505605],"category_scores_gemma":[0.000016062977,0.000076035845,0.000042457377,0.0022389535,0.00021999297,0.0006551265,0.0004021625,0.00009808288,0.000051514737],"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":[1.7261183e-7,0.00006144976,0.000016679509,0.000106331485,0.0000020813386,0.000004595986,0.0006554561,0.0005507092,0.0001896141,0.914088,0.000028353174,0.084296525],"study_design_scores_gemma":[0.000032992844,0.000014626027,0.000053426582,0.00006602638,0.0000011741741,0.00002723719,0.0000051669813,0.72422445,0.0009078809,0.27414632,0.00044769206,0.00007301005],"about_ca_topic_score_codex":0.0000010120029,"about_ca_topic_score_gemma":7.005884e-7,"teacher_disagreement_score":0.72367376,"about_ca_system_score_codex":0.00003042678,"about_ca_system_score_gemma":0.00022394204,"threshold_uncertainty_score":0.31006518},"labels":[],"label_agreement":null}]}