{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":29,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":29,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"c9e14d9513a8","filters":{"venue":"Mathematics in Computer Science"}},"results":[{"id":"W2063841356","doi":"10.1007/s11786-007-0024-4","title":"Lempel–Ziv Factorization Using Less Time & Space","year":2008,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Compressed suffix array; Generalized suffix tree; Suffix tree; Suffix array; Factorization; Suffix; String (physics); Data structure; Mathematics; Time complexity; Algorithm; Alphabet; Combinatorics; Computer science; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07001208019824393,"gpt":0.2851699233784816,"spread":0.2151578431802376,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007002475,0.0001891872,0.0002401495,0.0003283605,0.0004277683,0.0003194528,0.002109736,0.00005595633,0.000009958874],"category_scores_gemma":[0.00005486214,0.0001667284,0.00003914149,0.001552363,0.0002698326,0.001595081,0.001334515,0.0001522246,0.0001083485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001316609,"about_ca_system_score_gemma":0.0002215127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002792839,"about_ca_topic_score_gemma":0.000002304039,"domain_scores_codex":[0.997751,0.00003830567,0.0003588391,0.0006035912,0.0008094867,0.0004387602],"domain_scores_gemma":[0.9983629,0.0001277845,0.000166594,0.001065888,0.0001461945,0.0001306233],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000196437,0.004641026,0.01329422,0.0006342758,0.00005936366,0.0006895197,0.09196434,0.1667963,0.1261503,0.2555058,0.006275152,0.3339701],"study_design_scores_gemma":[0.0001575673,0.00002062939,0.0007065501,0.00008538875,0.000001133426,0.0001226434,0.00000512827,0.990591,0.001763128,0.006072388,0.0002456125,0.0002287712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1563862,0.00001759096,0.8425944,0.00007798303,0.0004658641,0.0001345754,0.000001643576,0.0001189719,0.0002028438],"genre_scores_gemma":[0.1547206,0.000006982109,0.8450316,0.00006047343,0.00008779921,0.000002466096,0.000001873814,0.000009018385,0.00007913954],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8237947,"threshold_uncertainty_score":0.6798988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018508868","doi":"10.1007/s11786-013-0149-6","title":"Near Sets: An Introduction","year":2013,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disjoint sets; Mathematics; Set (abstract data type); Combinatorics; Relation (database); Space (punctuation); Discrete mathematics; Data mining; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01423836951559186,"gpt":0.2504741927382823,"spread":0.2362358232226904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006379511,0.0001027809,0.0001109863,0.0002202567,0.0001914364,0.0009869114,0.0009394075,0.00003111829,0.00008156303],"category_scores_gemma":[0.00004314112,0.00009517264,0.00001866739,0.001110555,0.000233267,0.002631191,0.0002517739,0.000105233,0.0001507372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007993904,"about_ca_system_score_gemma":0.0001075072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001473419,"about_ca_topic_score_gemma":0.000007830573,"domain_scores_codex":[0.9986442,0.00002893286,0.000263079,0.0004336196,0.0003688321,0.0002613366],"domain_scores_gemma":[0.9989355,0.000041048,0.00008080452,0.0006819417,0.0001523138,0.0001083957],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[4.152907e-7,0.0002414282,0.0008939566,0.00002426946,0.000002532593,0.000003493207,0.005400152,0.04996397,0.000643765,0.1477848,0.0005985796,0.7944427],"study_design_scores_gemma":[0.00009146928,0.00003565114,0.004507522,0.000007586438,4.776188e-7,0.0000320779,0.0000164092,0.9794263,0.0002340841,0.01544643,0.00008426367,0.0001177005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06560889,0.000002152573,0.9310324,0.002120095,0.0006201944,0.0001909923,1.454961e-7,0.0001560154,0.000269155],"genre_scores_gemma":[0.2748832,0.000001104664,0.7248589,0.0001751844,0.00005689001,0.00001067084,5.038585e-7,0.000003429355,0.00001020716],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9294624,"threshold_uncertainty_score":0.9516808,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3199228775","doi":"10.1007/11786.1661-8289","title":"Mathematics in Computer Science","year":2013,"lang":"en","type":"paratext","venue":"Mathematics in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Mathematics education; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03441838138543281,"gpt":0.2910074292922361,"spread":0.2565890479068033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.008409411,0.001473828,0.002181857,0.004303806,0.0006586992,0.004390493,0.02095711,0.0005425905,0.0002348138],"category_scores_gemma":[0.0003459264,0.001363713,0.0003054662,0.01185674,0.003976887,0.003248435,0.01327613,0.001865921,0.00564809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001994251,"about_ca_system_score_gemma":0.002946969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001296165,"about_ca_topic_score_gemma":0.00004911232,"domain_scores_codex":[0.9852316,0.0002081461,0.002878158,0.00420108,0.004417045,0.003063923],"domain_scores_gemma":[0.9894605,0.001390539,0.001197195,0.006091062,0.001136496,0.0007241699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009131142,0.01180238,0.0003403401,0.00640508,0.00009672592,0.0008008551,0.04598694,0.1962447,0.00148337,0.1234002,0.03550123,0.577929],"study_design_scores_gemma":[0.0005418957,0.0002117087,0.0003003087,0.001132195,0.000007109587,0.0001930711,0.00002358398,0.952616,0.0005836824,0.04238202,0.0005501348,0.001458342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006982173,0.0002250439,0.9734436,0.000485676,0.009530502,0.002040627,0.0000126343,0.000308586,0.006971176],"genre_scores_gemma":[0.01212587,0.00006726071,0.9853771,0.0004744313,0.0006989517,0.0001643267,0.000006302144,0.00008709084,0.0009986565],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7563712,"threshold_uncertainty_score":0.9998011,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139371904","doi":"10.1007/s11786-014-0175-z","title":"Formal Analysis of Optical Systems","year":2014,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Photonic and Optical Devices","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Abstraction; Complement (music); Pencil (optics); Theoretical computer science; Automated theorem proving; Computer engineering; Physics; Optics","retraction":null,"screen_n_in":null,"score":{"opus":0.01262243156106682,"gpt":0.2334254782053058,"spread":0.220803046644239,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006763658,0.00005730987,0.000210116,0.0002385456,0.00001905383,0.00004245831,0.0003319307,0.00002210028,0.000003370895],"category_scores_gemma":[0.00002385229,0.00004699458,0.00003375751,0.001021166,0.0001191969,0.0001398179,0.00007784052,0.00005182025,0.000006803163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002303362,"about_ca_system_score_gemma":0.000008082935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002127683,"about_ca_topic_score_gemma":0.000002967554,"domain_scores_codex":[0.9992463,0.000004265717,0.0002318015,0.00009504384,0.0002302947,0.000192272],"domain_scores_gemma":[0.9995456,0.0001358703,0.00002112113,0.0002204941,0.00002826019,0.00004863774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[3.077192e-7,0.00004099214,0.0002445049,0.0002026265,0.00003713755,9.454743e-7,0.0005649797,0.7424003,0.0005071221,0.2519282,0.000003778193,0.004069054],"study_design_scores_gemma":[0.00003936142,0.00001215988,0.001590826,0.00003010753,0.0000221579,0.000001198174,0.000008953311,0.9969539,0.000620276,0.0006513849,0.00001375827,0.00005592313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3032907,0.0000126713,0.6902348,0.000002616812,0.0001254476,0.00003150458,4.484139e-7,0.0000277591,0.006274001],"genre_scores_gemma":[0.9124077,0.000001785536,0.0875652,0.000006387844,0.0000117824,0.000002159748,2.047133e-7,0.000002769147,0.000002024226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.609117,"threshold_uncertainty_score":0.1916384,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050429600","doi":"10.1007/s11786-007-0010-x","title":"Pseudospectra of Matrix Polynomials that Are Expressed in Alternative Bases","year":2007,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Toronto; Western University","funders":"","keywords":"Mathematics; Matrix polynomial; Polynomial matrix; Basis (linear algebra); Lagrange polynomial; Vandermonde matrix; Polynomial interpolation; Matrix (chemical analysis); Lebesgue integration; Interpolation (computer graphics); Matrix analysis; Scalar (mathematics); Polynomial; Pure mathematics; Algebra over a field; Mathematical analysis; Eigenvalues and eigenvectors; Linear interpolation; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02013958722648946,"gpt":0.2952151792826439,"spread":0.2750755920561544,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007384374,0.0001199162,0.0002930346,0.0004371022,0.00001768875,0.00002390568,0.0005365325,0.00002924516,0.000007283921],"category_scores_gemma":[0.00004536993,0.0001097688,0.00003656828,0.0009718707,0.0001642113,0.0002269492,0.0001164411,0.0001123165,0.000002906804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001235975,"about_ca_system_score_gemma":0.000009748339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000137536,"about_ca_topic_score_gemma":0.00002125489,"domain_scores_codex":[0.9988148,0.000008521058,0.0003847341,0.000198308,0.0003188468,0.0002747935],"domain_scores_gemma":[0.9992619,0.0002581988,0.0001050052,0.0002950693,0.0000335466,0.00004630903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002484812,0.0012303,0.0254626,0.001033583,0.00004968452,0.0002672229,0.01102895,0.5955901,0.2662234,0.01819042,0.000207189,0.08069173],"study_design_scores_gemma":[0.0001208176,0.0000184052,0.002202746,0.0001998149,0.000002114674,0.000003161217,0.00005978812,0.5669996,0.4118736,0.0183577,0.00001023644,0.0001519276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.307859,0.00004225273,0.6916361,0.00001180421,0.00005057448,0.00008623723,0.000001573541,0.00007356543,0.0002388481],"genre_scores_gemma":[0.6371938,0.00001641088,0.3627526,0.000009768344,0.00001446136,0.000003413096,1.176462e-7,0.000006935849,0.000002465792],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3293348,"threshold_uncertainty_score":0.4476243,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067675443","doi":"10.1007/s11786-010-0033-6","title":"Fast, Practical Algorithms for Computing All the Repeats in a String","year":2010,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Suffix array; Algorithm; Byte; Suffix tree; String searching algorithm; Computer science; Suffix; String (physics); Generalized suffix tree; Pattern matching; Compressed suffix array; Data structure; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05655433533544037,"gpt":0.3537429007534002,"spread":0.2971885654179598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003784622,0.000188065,0.0002415936,0.0002588185,0.000281942,0.0007316543,0.002724357,0.00006835783,0.000001943527],"category_scores_gemma":[0.0003134374,0.0001324148,0.00005139864,0.001045984,0.0002641263,0.00102488,0.001884312,0.0005361535,0.000008538096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005759068,"about_ca_system_score_gemma":0.00020336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002186499,"about_ca_topic_score_gemma":0.00003507449,"domain_scores_codex":[0.9974658,0.00004188344,0.0005258573,0.0007118444,0.0006265992,0.0006279958],"domain_scores_gemma":[0.9972551,0.001096915,0.0001904772,0.001222213,0.0001227112,0.0001125699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006213381,0.0008822526,0.00055944,0.0001130471,0.000009744418,0.000100226,0.01239943,0.007923703,0.002875524,0.4063655,0.0005353888,0.5682296],"study_design_scores_gemma":[0.0003095205,0.00004500513,0.0008140708,0.00007895079,0.000001507265,0.00009665834,0.00003435606,0.9757599,0.0005441338,0.02177871,0.0003606366,0.0001765237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03268209,0.000009440726,0.9644825,0.001112133,0.001063524,0.0004470304,0.000001706966,0.0000791142,0.000122424],"genre_scores_gemma":[0.1610853,0.000001789744,0.8385286,0.0002007264,0.0001494387,0.00001811838,7.640554e-7,0.000008103817,0.000007118542],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9678362,"threshold_uncertainty_score":0.705536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003890915","doi":"10.1007/s11786-013-0145-x","title":"Signature-based Perceptual Nearness: Application of Near Sets to Image Retrieval","year":2013,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Pattern recognition (psychology); Artificial intelligence; Image (mathematics); Similarity (geometry); Set (abstract data type); Pixel; Matching (statistics); Mathematics; Signature (topology); Image retrieval; Digital image; Feature (linguistics); Computer science; Feature vector; Computer vision; Image processing","retraction":null,"screen_n_in":null,"score":{"opus":0.01438558382856747,"gpt":0.2934001250738474,"spread":0.2790145412452799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009437752,0.0001848499,0.0002762444,0.0003155501,0.0001327821,0.0003991596,0.002375924,0.00006620007,0.00001351158],"category_scores_gemma":[0.0001982545,0.0001647434,0.00005449294,0.002566112,0.0004164746,0.001278026,0.0006868915,0.0001950573,0.0001020804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009684676,"about_ca_system_score_gemma":0.0001753117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001810178,"about_ca_topic_score_gemma":9.293345e-7,"domain_scores_codex":[0.9977639,0.00003436335,0.0004683943,0.0005890104,0.0007372333,0.0004071453],"domain_scores_gemma":[0.9979188,0.0002133726,0.0001768879,0.001089118,0.0004487585,0.0001530429],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001607979,0.001008788,0.0004279521,0.0003734958,0.000007882612,0.00001839469,0.00958609,0.004684856,0.2689391,0.02696948,0.0005256263,0.6874422],"study_design_scores_gemma":[0.0001378282,0.0001611221,0.001041099,0.00007158786,0.000001290047,0.000005357586,0.00001534053,0.8530124,0.1288941,0.0163874,0.0000707035,0.0002018024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04568308,0.00001487304,0.952819,0.0003835739,0.00009888501,0.0006697563,0.000001156501,0.0001781417,0.0001515468],"genre_scores_gemma":[0.3363513,9.930328e-7,0.6633173,0.0002823564,0.00001482551,0.00001983539,4.646811e-7,0.000007458352,0.000005408297],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8483275,"threshold_uncertainty_score":0.6718041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977906522","doi":"10.1007/s11786-012-0136-3","title":"On Solving Parametric Polynomial Systems","year":2012,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Parametric statistics; Discriminant; Mathematics; Polynomial; Computation; Projection (relational algebra); Matrix polynomial; Pure mathematics; Algebra over a field; Alternating polynomial; Discrete mathematics; Applied mathematics; Mathematical analysis; Algorithm; Computer science; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02480472848550547,"gpt":0.2610001570369275,"spread":0.2361954285514221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001743236,0.0001792193,0.0002302381,0.0007155613,0.0002004067,0.0005528466,0.001679211,0.00004571531,0.000002432538],"category_scores_gemma":[0.000137486,0.0001552857,0.00004722543,0.002213763,0.0001322255,0.001182706,0.0006270756,0.0001735425,0.000156499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001996469,"about_ca_system_score_gemma":0.0001231258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001595219,"about_ca_topic_score_gemma":7.088477e-7,"domain_scores_codex":[0.9977651,0.00004532059,0.0004010143,0.0004140846,0.000667526,0.0007069127],"domain_scores_gemma":[0.9983994,0.0005370045,0.0001481112,0.0006532749,0.00005441355,0.0002077528],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003645616,0.0009569081,0.0009668017,0.000108874,0.000009110806,0.00001530085,0.006343778,0.03733789,0.0005244139,0.8018208,0.001055037,0.1508574],"study_design_scores_gemma":[0.000188438,0.00006445203,0.001904688,0.00008317604,0.000001278966,0.00003720762,0.000009770709,0.9910692,0.0004754294,0.005843735,0.0001058538,0.0002167919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2027803,0.00007324693,0.7933838,0.00009156491,0.002507699,0.0002267439,3.3622e-7,0.0001240463,0.0008122757],"genre_scores_gemma":[0.8217986,0.000001564774,0.1777982,0.000139418,0.000222009,0.00001618747,1.804669e-7,0.000006279575,0.00001753084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9537313,"threshold_uncertainty_score":0.6332366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104191500","doi":"10.1007/s11786-014-0186-9","title":"The 3 ×  3 ×  3 Hyperdeterminant as a Polynomial in the Fundamental Invariants for $${{SL_3(\\mathbb{C}) \\times SL_3(\\mathbb{C}) \\times SL_3(\\mathbb{C})}}$$ S L 3 ( C ) × S L 3 ( C ) × S L 3 ( C )","year":2014,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Saskatchewan","funders":"","keywords":"Invariant theory; Invariant (physics); Polynomial; Algebra over a field; Action (physics); Alternating polynomial; Invariant polynomial; Group theory","retraction":null,"screen_n_in":null,"score":{"opus":0.05852512899978808,"gpt":0.3559044107329234,"spread":0.2973792817331353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.01931309,0.0009968386,0.001295851,0.0009230165,0.001726854,0.002027316,0.006992714,0.0003353184,0.0001093254],"category_scores_gemma":[0.004970959,0.0006511483,0.0004107371,0.002290535,0.002360669,0.0009741255,0.002064575,0.001143887,0.0004104502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005316942,"about_ca_system_score_gemma":0.0006715411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006713114,"about_ca_topic_score_gemma":0.0001798744,"domain_scores_codex":[0.9899457,0.0008760921,0.00220989,0.001591017,0.002731619,0.002645694],"domain_scores_gemma":[0.9817989,0.01355212,0.0007857213,0.003101849,0.0003914539,0.0003699929],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004736201,0.004036224,0.0008936889,0.00178899,0.0001509815,0.0001775275,0.05280934,0.0003201055,0.003295826,0.8799086,0.01193703,0.04420807],"study_design_scores_gemma":[0.0030198,0.001008389,0.0005687669,0.0008216753,0.00006700383,0.0004393968,0.002486489,0.4004759,0.002190743,0.5834771,0.004194421,0.001250344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8921306,0.0001940411,0.08709156,0.003506921,0.002187746,0.006086099,0.00008390751,0.0003536301,0.008365469],"genre_scores_gemma":[0.84795,0.00004170552,0.1483648,0.0008620975,0.000684388,0.0008245186,0.00001019488,0.0001864303,0.001075893],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4001558,"threshold_uncertainty_score":0.999594,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2771217056","doi":"10.1007/s11786-018-0364-2","title":"Minimal Height Companion Matrices for Euclid Polynomials","year":2018,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lambda; Mathematics; Integer (computer science); Combinatorics; Algebra over a field; Pure mathematics; Physics; Quantum mechanics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0187788676311769,"gpt":0.2507788742923151,"spread":0.2320000066611382,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009445379,0.0001134219,0.000185435,0.0001966278,0.0001176904,0.0001226852,0.000528901,0.00003616238,0.00001044526],"category_scores_gemma":[0.0000165347,0.0001005456,0.00003752825,0.0004700453,0.0002228165,0.0001942078,0.00006967611,0.00004802374,0.0000505579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003643426,"about_ca_system_score_gemma":0.00001591725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001414882,"about_ca_topic_score_gemma":0.000004141506,"domain_scores_codex":[0.999037,0.00001167771,0.0002937104,0.0001887073,0.0001760919,0.0002928204],"domain_scores_gemma":[0.9994277,0.0001495884,0.00004575213,0.0002671197,0.00005404714,0.00005582083],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006437628,0.001147961,0.003519502,0.005376779,0.000138533,0.00003014761,0.06572375,0.02331372,0.1227572,0.6679043,0.01991584,0.0901079],"study_design_scores_gemma":[0.0002402875,0.00008780725,0.0003730254,0.0001477707,0.000003994815,0.00001897282,0.00006191419,0.9623111,0.01677289,0.0188656,0.0009056621,0.0002108966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.521409,0.00004416102,0.4757363,0.00001982367,0.001140732,0.0002212943,0.00000343102,0.0001172576,0.001308027],"genre_scores_gemma":[0.8774245,0.000002770924,0.122245,0.00002538892,0.0002619356,0.00001566692,3.929565e-7,0.00001129254,0.00001299145],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9389974,"threshold_uncertainty_score":0.410013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3003474032","doi":"10.1007/s11786-020-00458-0","title":"Calculation and Properties of Zonal Polynomials","year":2020,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Polynomial; Representation (politics); Symmetric polynomial; Algebra over a field; Symbolic computation; Differential (mechanical device); Multivariate statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.08944298529576389,"gpt":0.3068864308924438,"spread":0.2174434455966799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006907062,0.0001453318,0.0003688379,0.0001166755,0.00006362694,0.00005024043,0.0004172794,0.00004313217,0.000003720239],"category_scores_gemma":[0.0008712185,0.0001222484,0.00003149259,0.0005628716,0.0003953982,0.0002655296,0.0003615204,0.0001074109,0.000003733473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004124819,"about_ca_system_score_gemma":0.00008024536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001685969,"about_ca_topic_score_gemma":8.506415e-7,"domain_scores_codex":[0.9984124,0.00002563512,0.0005688164,0.000277226,0.0004930258,0.0002229507],"domain_scores_gemma":[0.9989844,0.0002616613,0.0002453815,0.0002827591,0.0001244984,0.0001013235],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001880383,0.0004049609,0.0003414256,0.002204106,0.00001558298,0.00001031834,0.02417469,0.0005770941,0.05099747,0.9132333,0.0000736902,0.007948533],"study_design_scores_gemma":[0.0004441192,0.0001020002,0.0001194424,0.0003703097,0.00001053522,0.0000128355,0.00009241981,0.3484621,0.03385072,0.6163168,0.00000986091,0.0002088807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6129298,0.00004777626,0.3861487,0.0003000305,0.0001221863,0.0002821869,0.000001006883,0.0000474794,0.0001208585],"genre_scores_gemma":[0.6471304,0.000003173879,0.3527705,0.00003309515,0.00004396013,0.000005336058,5.385755e-8,0.00001007203,0.000003409408],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.347885,"threshold_uncertainty_score":0.4985146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2346641114","doi":"10.1007/s11786-016-0273-1","title":"Topological Sorting of Finitely Near Sets","year":2016,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Disjoint sets; Mathematics; Topological space; Sorting; Combinatorics; Closed set; Space (punctuation); Topology (electrical circuits); Set (abstract data type); Discrete mathematics; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04279358418637936,"gpt":0.2918718828044226,"spread":0.2490782986180433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001489994,0.0001151674,0.0002773571,0.0003333757,0.0001106912,0.00009972208,0.002461687,0.00004608911,0.00003907209],"category_scores_gemma":[0.0005922892,0.00006375189,0.00006669404,0.002832115,0.0006899923,0.0005279571,0.001336655,0.00007453813,0.00005466699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003549943,"about_ca_system_score_gemma":0.00007053022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009110984,"about_ca_topic_score_gemma":0.000002384523,"domain_scores_codex":[0.9980794,0.00003550571,0.0004902312,0.0004659621,0.0005454469,0.000383469],"domain_scores_gemma":[0.9981713,0.0006856198,0.0001972336,0.0007451674,0.0001038008,0.0000969206],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001747565,0.000443589,0.006248194,0.00003229705,0.000009611075,0.00004269251,0.001008037,0.0004294568,0.001037908,0.3932062,0.00009570145,0.5974445],"study_design_scores_gemma":[0.0003594925,0.000232407,0.01113475,0.0001173274,0.00000479004,0.00003404261,0.00001603842,0.6455774,0.003523498,0.3385346,0.0001538055,0.0003118195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1643699,0.0000196187,0.8341916,0.0007233708,0.0001368097,0.00005298752,0.000001750772,0.00005089717,0.0004530235],"genre_scores_gemma":[0.5523326,0.000005924035,0.4475636,0.00007265736,0.00001003042,0.000001872642,8.082875e-8,0.000001328371,0.00001189006],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.645148,"threshold_uncertainty_score":0.4574467,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2609945833","doi":"10.1007/s11786-017-0320-6","title":"Branch Structure and Implementation of Lambert W","year":2017,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Sports Dynamics and Biomechanics","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Computer science; Algebra over a field; Arithmetic; Algorithm; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.008311430262110866,"gpt":0.2604206133191566,"spread":0.2521091830570458,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001482873,0.00004145666,0.00006777896,0.00005536661,0.00004869021,0.00007100113,0.0002121603,0.00001417439,0.000004531026],"category_scores_gemma":[0.000002708361,0.00003633713,0.000005913606,0.00006051939,0.00006331888,0.0001153806,0.00008535262,0.00002775403,2.046819e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000120874,"about_ca_system_score_gemma":0.000008425715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007859184,"about_ca_topic_score_gemma":0.00005237797,"domain_scores_codex":[0.9996368,6.479329e-7,0.000105882,0.00007126138,0.0001034422,0.00008199771],"domain_scores_gemma":[0.9997137,0.000006593219,0.00003927726,0.000206429,0.0000173444,0.00001664403],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001980249,0.00006936491,0.04028455,0.00115317,0.00002221801,0.00001219528,0.01173916,0.007731395,0.1140241,0.1020548,0.00005965328,0.7228475],"study_design_scores_gemma":[0.00009800592,0.000008060741,0.03414401,0.00002747865,0.000001241925,0.000005878358,0.00001435053,0.9385034,0.009094146,0.01803929,0.0000054373,0.00005865603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8756674,0.000006252289,0.1240387,0.00001397989,0.0001738584,0.00004744171,0.000002725461,0.000009462998,0.00004023282],"genre_scores_gemma":[0.9407028,0.000007048,0.05927139,0.000003366893,0.00001075294,4.972215e-7,2.75898e-7,0.000002918946,9.274232e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9307721,"threshold_uncertainty_score":0.1481785,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3005566958","doi":"10.1007/s11786-020-00457-1","title":"Problem Solving as a Path to Comprehension","year":2020,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Cognitive and developmental aspects of mathematical skills","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trent University","funders":"","keywords":"Comprehension; Mathematical notation; Computer science; Notation; Usability; Mathematical software; Software; Human–computer interaction; Mathematical problem; User interface; Artificial intelligence; Mathematics education; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0520391503404732,"gpt":0.3097761538726907,"spread":0.2577370035322175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008206714,0.0002444194,0.0004154598,0.0001733381,0.0001653432,0.0002019117,0.0008002481,0.00004477432,0.00009547613],"category_scores_gemma":[0.0009459319,0.000205203,0.00006161886,0.001278957,0.0001625263,0.0002624344,0.001053213,0.0001915076,0.0006265766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009846163,"about_ca_system_score_gemma":0.0001169008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003324208,"about_ca_topic_score_gemma":0.000004085333,"domain_scores_codex":[0.9974154,0.00002686592,0.0005938605,0.0005796436,0.0008617234,0.0005224755],"domain_scores_gemma":[0.998312,0.0006868076,0.0001180781,0.0003217224,0.0001672876,0.000394133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009041185,0.004357373,0.0007555648,0.005105592,0.00007003218,0.0009039249,0.146496,0.0003984682,0.02577775,0.6691692,0.01586145,0.1310142],"study_design_scores_gemma":[0.0005202524,0.0003242067,0.0002707208,0.00109298,0.000009767194,0.00006963869,0.0004255313,0.1040394,0.005445429,0.8870872,0.0001554619,0.0005593722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3839914,0.000009871242,0.6021096,0.002340321,0.0001178969,0.0009326856,0.000002133989,0.0003170914,0.01017904],"genre_scores_gemma":[0.3166823,0.000001359438,0.6817978,0.001402068,0.00005599392,0.00001579677,3.549762e-7,0.00001822326,0.00002607363],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.217918,"threshold_uncertainty_score":0.8367937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018051263","doi":"10.1007/s11786-013-0144-y","title":"Flow Graphs: Analysis with Near Sets","year":2013,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Flow (mathematics); Mathematics; Computer science; Combinatorics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01554929231676407,"gpt":0.2345312868809513,"spread":0.2189819945641872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007507725,0.0001876117,0.0003058698,0.0005172402,0.0002442031,0.001364188,0.002454267,0.00003876166,0.00002409708],"category_scores_gemma":[0.00001465872,0.0001289748,0.00007412465,0.005862962,0.0004053958,0.001102829,0.0006045756,0.0001406243,0.0001302956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004737093,"about_ca_system_score_gemma":0.0001061167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004742954,"about_ca_topic_score_gemma":0.00002145533,"domain_scores_codex":[0.9977733,0.00002914619,0.000322446,0.0006354702,0.000719938,0.0005197122],"domain_scores_gemma":[0.9982511,0.0001156684,0.0001162914,0.001206548,0.0001531791,0.0001572281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002890682,0.001193308,0.01679211,0.0001370226,0.0002181989,0.0001569275,0.02092688,0.2479912,0.00006579249,0.09913916,0.001022687,0.6123539],"study_design_scores_gemma":[0.0001243734,0.00007291904,0.007741346,0.00002143438,0.00001014548,0.00001762709,0.0000120986,0.9573814,0.00002467535,0.03438367,0.00001559548,0.0001946631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09205978,0.00001457834,0.905942,0.0003252926,0.0001415398,0.0002144771,5.110896e-7,0.0001129393,0.001188898],"genre_scores_gemma":[0.3355341,0.000002037188,0.6642107,0.0002196219,0.000008615014,0.00001623027,3.687525e-7,0.00000395682,0.000004428752],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7093903,"threshold_uncertainty_score":0.9996725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2583611270","doi":"10.1007/s11786-016-0288-7","title":"Palindromic Subsequence Automata and Longest Common Palindromic Subsequence","year":2017,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Subsequence; Palindrome; Longest increasing subsequence; Automaton; Combinatorics; Longest common subsequence problem; Mathematics; Palindromic sequence; Discrete mathematics; Computer science; Theoretical computer science; Genetics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.02976186163097517,"gpt":0.2988133188211195,"spread":0.2690514571901443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002151371,0.0003357013,0.0004630567,0.0002921247,0.001179231,0.003142948,0.007752944,0.0001066263,0.000004788248],"category_scores_gemma":[0.000150746,0.0002961277,0.00004961564,0.0004371828,0.001323949,0.003156434,0.004647992,0.0003464032,0.00005475225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001267653,"about_ca_system_score_gemma":0.000234111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001482956,"about_ca_topic_score_gemma":0.00005551036,"domain_scores_codex":[0.9966019,0.00005599094,0.0005932834,0.001153145,0.0008569865,0.0007387201],"domain_scores_gemma":[0.9951274,0.000232215,0.0004733926,0.003774369,0.0001170926,0.0002755382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001507104,0.001163904,0.03494865,0.0005624922,0.00002975554,0.001609802,0.007752948,0.00161753,0.008153982,0.4298806,0.0003694077,0.5138959],"study_design_scores_gemma":[0.0004300822,0.00008035818,0.03661066,0.0003608097,0.000003634096,0.0003498146,0.000008880369,0.9152865,0.001446764,0.04496609,0.00004621676,0.0004101363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4242167,0.00007622624,0.5736229,0.0005969057,0.0007487113,0.0002655441,0.000006922277,0.0001505684,0.0003155014],"genre_scores_gemma":[0.6329093,0.00004679145,0.3668564,0.00009851179,0.0000524994,0.00001162663,0.000001272772,0.00001031989,0.00001329544],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.913669,"threshold_uncertainty_score":0.9999491,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4297880405","doi":"10.1007/s11786-022-00534-7","title":"Factoring Multivariate Polynomials Represented by Black Boxes: A Maple + C Implementation","year":2022,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Toeplitz matrix; Mathematics; Polynomial; Polynomial matrix; Sylvester matrix; Difference polynomials; Multivariate statistics; Algorithm; Algebra over a field; Discrete mathematics; Combinatorics; Matrix polynomial; Pure mathematics; Orthogonal polynomials","retraction":null,"screen_n_in":null,"score":{"opus":0.02432263382272556,"gpt":0.3023487761771989,"spread":0.2780261423544734,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001530294,0.0001844992,0.0002338799,0.0003776618,0.0004902288,0.0004353976,0.002114576,0.0000205991,0.00004112887],"category_scores_gemma":[0.0000389746,0.000190424,0.00005737575,0.001637781,0.0001296873,0.0006858275,0.002334161,0.0001570693,0.0000219487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003538736,"about_ca_system_score_gemma":0.0001830171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002044134,"about_ca_topic_score_gemma":0.000009248287,"domain_scores_codex":[0.9972399,0.00009846209,0.0005638794,0.0007162354,0.0008525933,0.0005288626],"domain_scores_gemma":[0.9986737,0.000217031,0.0002563274,0.0006780452,0.00005765733,0.0001172492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002699556,0.001908849,0.002934447,0.0002251516,0.00007019179,0.0001147935,0.1358316,0.09492802,0.1495774,0.1419732,0.008176812,0.4642325],"study_design_scores_gemma":[0.0005896429,0.00009803408,0.001105517,0.00001761067,0.000002165175,0.00001914061,0.0002136835,0.9735696,0.008208814,0.01532552,0.0005739643,0.0002763273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2490513,0.00001530208,0.749135,0.0005965087,0.0006465162,0.0003023139,0.000008092287,0.0001291276,0.0001158829],"genre_scores_gemma":[0.8490829,0.000001447845,0.1505309,0.000236797,0.00005500685,0.00004437445,0.000005117889,0.00000938938,0.00003403324],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8786415,"threshold_uncertainty_score":0.7765265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3155462286","doi":"10.1007/s11786-021-00507-2","title":"Phylogenetics of Indo-European Language Families via an Algebro-Geometric Analysis of Their Syntactic Structures","year":2021,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Language and cultural evolution","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Perimeter Institute","funders":"","keywords":"Germanic languages; Historical linguistics; Slavic languages; Indo-European languages; Computer science; Set (abstract data type); Phylogenetic tree; Linguistics; Romance languages; Mathematics; Programming language; Biology; German","retraction":null,"screen_n_in":null,"score":{"opus":0.01892453345003019,"gpt":0.2947455989421328,"spread":0.2758210654921026,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001032249,0.00008608541,0.0002582555,0.0004996823,0.0001276868,0.0000617948,0.0005919696,0.00003360908,0.00004336538],"category_scores_gemma":[0.0002222093,0.0000666113,0.00007704256,0.005725801,0.0004491398,0.0001879487,0.0001616904,0.00007017374,0.000001383604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004934324,"about_ca_system_score_gemma":0.0001045998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003049694,"about_ca_topic_score_gemma":0.0009444469,"domain_scores_codex":[0.9985659,0.0001734767,0.0003084347,0.0002228905,0.0005229132,0.0002064096],"domain_scores_gemma":[0.9990065,0.0001629289,0.0001900974,0.0003551453,0.00022421,0.00006113765],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"observational","study_design_scores_codex":[0.000005005736,0.0007856574,0.0149412,0.0002302807,0.0002714411,0.00005675732,0.5895944,0.008727303,0.1208007,0.02336689,0.0000131396,0.2412073],"study_design_scores_gemma":[0.0006967966,0.0002865049,0.4732704,0.0002301704,0.0006225471,0.00002047142,0.1239527,0.2121317,0.1671817,0.02051917,0.00006939104,0.00101847],"study_design_candidate":"qualitative","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9526787,0.0002419862,0.04576166,0.00001481362,0.00009664845,0.0000667934,0.000005828207,0.00001519003,0.001118408],"genre_scores_gemma":[0.9673687,0.00003784052,0.03250622,0.00002869051,0.00003710322,7.318362e-7,0.000003566168,0.0000038876,0.00001332149],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4656416,"threshold_uncertainty_score":0.2751058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029410925","doi":"10.1007/s11786-007-0040-4","title":"The Computational Complexity of Extrapolation Methods","year":2008,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Extrapolation; Mathematics; Polynomial; Applied mathematics; Computational complexity theory; Algorithm; Ordinary differential equation; Mathematical optimization; Differential equation; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.297797761049804,"gpt":0.4617480980965442,"spread":0.1639503370467402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003031662,0.0001198347,0.0002650961,0.0001689185,0.0004521756,0.00004146451,0.0007020366,0.00003310775,0.00001232985],"category_scores_gemma":[0.001138198,0.00008554705,0.00007005117,0.00105939,0.001964959,0.0001623895,0.0002185899,0.0001464871,0.000004535189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006855296,"about_ca_system_score_gemma":0.0001241232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007972182,"about_ca_topic_score_gemma":0.000005867264,"domain_scores_codex":[0.9980012,0.000213244,0.0006604636,0.0002291249,0.0006363298,0.0002596249],"domain_scores_gemma":[0.9950075,0.003946054,0.000304033,0.000446085,0.0002344399,0.00006185649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003745163,0.0003332619,0.000288185,0.00005856231,0.00001009,0.000001289524,0.003007171,0.001411067,0.000956137,0.9314094,0.00002575069,0.06249541],"study_design_scores_gemma":[0.00009187849,0.00002048342,0.002516503,0.00001938783,0.000003059977,0.00001309686,0.00001553817,0.3730917,0.0007737316,0.6233866,0.000008549489,0.00005945967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06669278,0.00001305306,0.9323149,0.0001633719,0.0002449716,0.000226304,0.000001781171,0.00003722774,0.0003056161],"genre_scores_gemma":[0.1834212,0.000002912104,0.8165097,0.00001363169,0.0000227739,0.000009068952,5.09585e-7,0.000007830183,0.00001239614],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3716806,"threshold_uncertainty_score":0.7239975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963295477","doi":"10.1007/s11786-020-00477-x","title":"A Short Contribution to the Theory of Regular Chains","year":2020,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Computation; Context (archaeology); Differential (mechanical device); Mathematics; Mathematical economics; Computer science; Algebra over a field; Pure mathematics; Algorithm; Engineering; History","retraction":null,"screen_n_in":null,"score":{"opus":0.02465842990380594,"gpt":0.2516511212117934,"spread":0.2269926913079875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00156456,0.0001005896,0.0001728426,0.0001133697,0.0001129154,0.0001324768,0.00200159,0.00002114126,0.000001272089],"category_scores_gemma":[0.0001939234,0.00007082552,0.00004190304,0.001649122,0.0001594865,0.0002780419,0.0008322487,0.00009212895,0.00001935385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004173701,"about_ca_system_score_gemma":0.00007887895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001365577,"about_ca_topic_score_gemma":0.000001593479,"domain_scores_codex":[0.9985656,0.00005411481,0.0003238675,0.0003387975,0.0004637539,0.0002538549],"domain_scores_gemma":[0.999021,0.000205752,0.0000720415,0.0004680965,0.000117443,0.0001156956],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003333991,0.00006412488,0.00006165611,0.00002267771,0.000003591218,0.00000420577,0.008958184,0.008120378,0.001705861,0.8393066,0.00009132497,0.1416581],"study_design_scores_gemma":[0.00009689746,0.00008543285,0.002096847,0.00004276557,0.000001655322,0.00000662963,0.0000191709,0.9470892,0.005989555,0.04434745,0.0001246095,0.00009979343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1046778,0.00001725831,0.8900691,0.004661932,0.0002132863,0.0002483272,9.094867e-7,0.00005205724,0.00005928876],"genre_scores_gemma":[0.8457708,8.85475e-7,0.153254,0.0008909728,0.00006950612,0.000007430678,2.126423e-7,0.000002782956,0.00000339425],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9389688,"threshold_uncertainty_score":0.3719485,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2600164031","doi":"10.1007/s11786-017-0312-6","title":"Mathematics in Computer Science: After 10 Years","year":2017,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Mathematics education; Computer science; Algebra over a field; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03030883264722834,"gpt":0.2968656084747126,"spread":0.2665567758274842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.007020567,0.0005176442,0.0007669924,0.001356018,0.0007477149,0.004007815,0.01301348,0.0001448392,0.00004399755],"category_scores_gemma":[0.0004577514,0.0004927132,0.0001439768,0.002608989,0.003295037,0.003292769,0.008846518,0.0005398294,0.0002988116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006029166,"about_ca_system_score_gemma":0.0007669123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004391722,"about_ca_topic_score_gemma":0.00007041189,"domain_scores_codex":[0.9929304,0.00007101853,0.001179305,0.001923743,0.002326692,0.001568814],"domain_scores_gemma":[0.9929603,0.0004271402,0.0005451139,0.005246288,0.000430347,0.0003908503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001576079,0.004546881,0.01254041,0.0006594206,0.00002433475,0.001385991,0.0321515,0.01619092,0.0007675894,0.08975609,0.0002491513,0.8417119],"study_design_scores_gemma":[0.0005150924,0.0001183889,0.03945018,0.0002530457,0.000003148479,0.00008950564,0.00001612519,0.8853049,0.0003604106,0.07327256,0.00006106616,0.0005556261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2388809,0.00002956283,0.7575548,0.000378518,0.001661323,0.0006566874,0.000002184395,0.0001741309,0.0006619603],"genre_scores_gemma":[0.4161476,0.000004317582,0.5834725,0.0001354747,0.0001430974,0.00005077009,2.208635e-7,0.00001723076,0.00002874426],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8691139,"threshold_uncertainty_score":0.9997525,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401820908","doi":"10.1007/s11786-024-00590-1","title":"Applications of Rational Orthogonal Matrices","year":2024,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Algebra over a field; Computer science; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.014074862802703,"gpt":0.2790660317597138,"spread":0.2649911689570109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001314854,0.00008969023,0.0001255628,0.0004202012,0.00008581355,0.0002980446,0.001462587,0.00002415342,0.0000175056],"category_scores_gemma":[0.00001606298,0.00007603585,0.00004245738,0.002238953,0.000219993,0.0006551265,0.0004021625,0.00009808288,0.00005151474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003042678,"about_ca_system_score_gemma":0.000223942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001012003,"about_ca_topic_score_gemma":7.005884e-7,"domain_scores_codex":[0.9986335,0.000018534,0.0003276317,0.0003484367,0.0004823498,0.0001895688],"domain_scores_gemma":[0.999055,0.0003121233,0.00006235429,0.0004351202,0.00008330919,0.00005208092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[1.726118e-7,0.00006144976,0.00001667951,0.0001063315,0.000002081339,0.000004595986,0.0006554561,0.0005507092,0.0001896141,0.914088,0.00002835317,0.08429652],"study_design_scores_gemma":[0.00003299284,0.00001462603,0.00005342658,0.00006602638,0.000001174174,0.00002723719,0.000005166981,0.7242244,0.0009078809,0.2741463,0.0004476921,0.00007301005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003127985,0.000192624,0.9947956,0.000202235,0.000312402,0.0001556297,0.000002668162,0.0001033461,0.001107494],"genre_scores_gemma":[0.2828946,0.000008377488,0.7169126,0.00003312275,0.00007925048,0.00002432499,5.018401e-7,0.00000363175,0.00004357305],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7236738,"threshold_uncertainty_score":0.3100652,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389001533","doi":"10.1007/s11786-023-00574-7","title":"Some Polynomial Conditions for Cyclic Quadrilaterals, Tilted Kites and Other Quadrilaterals","year":2023,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Mathematics and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Quadrilateral; Mathematics; Euclidean geometry; Computation; Polynomial; Regular polygon; Combinatorics; Geometry; Mathematical analysis; Algorithm; Finite element method; Structural engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.08699299893677097,"gpt":0.3753170493473945,"spread":0.2883240504106235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001356206,0.0002336156,0.0003986337,0.0004750174,0.0003437663,0.00028207,0.0005759527,0.00007822967,0.00002231446],"category_scores_gemma":[0.0002150675,0.0002051147,0.00007532428,0.0008772755,0.0003532497,0.0002615201,0.0002770614,0.0001109064,0.00006950423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000470937,"about_ca_system_score_gemma":0.0000590795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006756916,"about_ca_topic_score_gemma":0.000009302917,"domain_scores_codex":[0.9979787,0.00002300942,0.0006473886,0.0004766686,0.0003437594,0.0005304685],"domain_scores_gemma":[0.9977515,0.001200928,0.0002134722,0.0006160836,0.00008488853,0.0001330755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008026327,0.0008054241,0.0006648041,0.001354873,0.00005203055,0.000008359735,0.01328406,0.0002887777,0.02317146,0.9201917,0.03872381,0.001446658],"study_design_scores_gemma":[0.0004295522,0.0000405336,0.0003569501,0.0001813115,0.00001567958,0.0000180034,0.0000717588,0.3526814,0.001873742,0.6430948,0.0009434109,0.0002929197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9281955,0.00002237041,0.06833287,0.0009740869,0.000307956,0.001371593,0.0001008651,0.0003689832,0.0003258159],"genre_scores_gemma":[0.5299553,0.0000204699,0.4678138,0.0004694604,0.0003957291,0.0005454231,0.00001331199,0.0000828828,0.0007036725],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3994809,"threshold_uncertainty_score":0.8364335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3035945966","doi":"10.1007/s11786-020-00483-z","title":"Symmetry-Based Algorithms for Invertible Mappings of Polynomially Nonlinear PDE to Linear PDE","year":2020,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Differential algebra; Ode; Invertible matrix; Algebra over a field; Uniqueness; Nonlinear system; Polynomial; Homogeneous space; Algorithm; Pure mathematics; Applied mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03981148747950762,"gpt":0.302600018488748,"spread":0.2627885310092404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003922875,0.0001425714,0.0002920602,0.0001367642,0.00008188497,0.00006472338,0.0006331822,0.00002551303,0.00001638253],"category_scores_gemma":[0.00003573869,0.000132274,0.00009277988,0.0007833259,0.0001256542,0.00009614623,0.0002133387,0.000100378,0.00002020828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002177117,"about_ca_system_score_gemma":0.000236956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003019209,"about_ca_topic_score_gemma":0.000001328621,"domain_scores_codex":[0.9986622,0.00001016398,0.0003973382,0.0003325658,0.0002686515,0.0003291299],"domain_scores_gemma":[0.9991421,0.0001354157,0.0001149251,0.0002873742,0.000128368,0.0001918158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002752502,0.008409426,0.02680739,0.004466262,0.0003315283,0.00002901795,0.05742381,0.2477408,0.119761,0.2538799,0.007126302,0.2737492],"study_design_scores_gemma":[0.0003956724,0.0001503602,0.00005524006,0.00007501221,0.000005503203,2.053384e-7,0.00006173818,0.9736099,0.02228273,0.002408892,0.0007999645,0.0001548057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09757876,0.000002946101,0.9005674,0.001014928,0.0001411634,0.0003527572,0.00006074533,0.00001916825,0.0002621325],"genre_scores_gemma":[0.1992883,1.164614e-7,0.7997159,0.0005739364,0.0003740096,0.00001024771,0.000005433491,0.00001333725,0.00001870911],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7258691,"threshold_uncertainty_score":0.5393978,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4365455748","doi":"10.1007/s11786-023-00557-8","title":"Foreword","year":2023,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05849244152024106,"gpt":0.3238741975548891,"spread":0.265381756034648,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002269591,0.0001008024,0.0001397861,0.000635238,0.0001149761,0.0001110279,0.001030254,0.00002238858,0.00001694807],"category_scores_gemma":[0.0001370769,0.00008984489,0.00002668216,0.004944162,0.0003749006,0.0002887785,0.0005904395,0.00009826633,0.007592747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009612148,"about_ca_system_score_gemma":0.00007861044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000269065,"about_ca_topic_score_gemma":0.000008609541,"domain_scores_codex":[0.9982757,0.00001280453,0.0002465327,0.0003225436,0.0006564003,0.0004860179],"domain_scores_gemma":[0.9990682,0.0001758973,0.00006168268,0.0005537255,0.00006183597,0.00007867889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001136338,0.001382526,0.0143516,0.0007051759,0.00002358991,0.0005455062,0.05831667,0.06653625,0.02678738,0.5996252,0.04300319,0.1887116],"study_design_scores_gemma":[0.0001130291,0.00001614913,0.004251988,0.00006140992,8.325204e-7,0.00001205381,0.00002745682,0.9268842,0.0008725195,0.06752076,0.0001239799,0.0001155862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7290894,0.000003537618,0.2679575,0.0001381708,0.0004737347,0.0002012112,0.000006609531,0.000459943,0.00166983],"genre_scores_gemma":[0.6987605,7.960767e-7,0.3009539,0.00006348815,0.00005541333,0.00001383362,8.76618e-7,0.00002299857,0.0001281329],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.860348,"threshold_uncertainty_score":0.99318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3082404028","doi":"10.1007/s11786-020-00475-z","title":"Foreword","year":2020,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03062298929035083,"gpt":0.2539979995728978,"spread":0.223375010282547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004352113,0.0001102332,0.000151507,0.0001315372,0.0000986481,0.0002243841,0.001931881,0.0000219862,0.000004140834],"category_scores_gemma":[0.00006508447,0.00009864158,0.00003439107,0.0015643,0.0001268723,0.0007122749,0.0008388786,0.0001117652,0.0001007042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004205314,"about_ca_system_score_gemma":0.0001165821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000266071,"about_ca_topic_score_gemma":0.000001491974,"domain_scores_codex":[0.9985598,0.00001436437,0.0002696832,0.0004340538,0.0004097152,0.0003123786],"domain_scores_gemma":[0.9992669,0.00009605604,0.00007145175,0.0003531113,0.00004901939,0.0001634785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001980414,0.000162161,0.0002659611,0.00008185646,0.000003748067,0.00004418931,0.01388668,0.007956601,0.001461829,0.4993106,0.0005816872,0.4762427],"study_design_scores_gemma":[0.0001385387,0.00005181066,0.0006240605,0.0000211823,4.836845e-7,0.000009094088,0.000005368699,0.9549338,0.001165694,0.04280794,0.0001192977,0.0001227441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04576973,0.00001294449,0.9502701,0.003015925,0.0002991556,0.0001101533,5.073337e-7,0.000133995,0.0003875571],"genre_scores_gemma":[0.5389576,6.92012e-7,0.4599608,0.001000586,0.00007031812,0.000002920641,1.203773e-7,0.000002757952,0.000004219455],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9469772,"threshold_uncertainty_score":0.4022487,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4235684925","doi":"10.1007/s11786-019-00391-x","title":"Foreword","year":2019,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; École de Technologie Supérieure","funders":"","keywords":"Computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0138625784130462,"gpt":0.2447117283599842,"spread":0.230849149946938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007703914,0.0001117078,0.0001574693,0.0002803315,0.00006994439,0.0002205257,0.001864917,0.0000260636,0.00001028206],"category_scores_gemma":[0.00002124264,0.00009781248,0.00003565503,0.001274885,0.0000918177,0.0008386562,0.0007614084,0.0001048782,0.0003503478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007505528,"about_ca_system_score_gemma":0.0001212835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005036875,"about_ca_topic_score_gemma":0.000002934197,"domain_scores_codex":[0.9984916,0.00001380548,0.0002614722,0.0004366051,0.0004427821,0.0003537262],"domain_scores_gemma":[0.9990093,0.000129529,0.0000769118,0.0006519573,0.00005388402,0.0000784116],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001131687,0.0001960136,0.001327305,0.00006681115,0.000003024203,0.00001302244,0.003569617,0.006559782,0.001392948,0.6917288,0.0001373837,0.2950042],"study_design_scores_gemma":[0.0001622562,0.00004210321,0.002674401,0.00004402231,3.399494e-7,0.0000163369,0.000004335233,0.9114624,0.0008822393,0.08449804,0.0000844078,0.0001291004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2675731,0.000008515383,0.7303223,0.0002362126,0.0007024531,0.0001347552,2.635466e-7,0.00007444312,0.000947966],"genre_scores_gemma":[0.6057656,5.912416e-7,0.3939523,0.0001839314,0.00003123625,0.000003185223,1.327648e-7,0.000002943365,0.00006005679],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9049026,"threshold_uncertainty_score":0.4503129,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4245144801","doi":"10.1007/s11786-018-0388-7","title":"Foreword","year":2018,"lang":"en","type":"article","venue":"Mathematics in Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01225182957901668,"gpt":0.2225237147053616,"spread":0.2102718851263449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005141837,0.00006088862,0.00007961805,0.0001195483,0.00005348619,0.00004064201,0.0003743796,0.00001826742,0.00001272899],"category_scores_gemma":[0.000008350285,0.00005356875,0.00001413698,0.0005135898,0.0002256233,0.0001234333,0.00005508225,0.00004817963,0.0001103589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002181156,"about_ca_system_score_gemma":0.000007945797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.209312e-7,"about_ca_topic_score_gemma":0.000004109105,"domain_scores_codex":[0.9994243,0.000004650568,0.0001361516,0.0001044039,0.0001421138,0.0001883402],"domain_scores_gemma":[0.9996496,0.00003116081,0.00001215107,0.0002456689,0.00002533393,0.00003602538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003510128,0.0002240786,0.001859117,0.0006900394,0.0000216803,0.00003142534,0.03397972,0.01670459,0.01240603,0.7950706,0.002405371,0.1366038],"study_design_scores_gemma":[0.00005240468,0.00002064441,0.0003117391,0.00006051091,5.617899e-7,0.00001218196,0.00001906352,0.9446743,0.003889617,0.05070301,0.0001716973,0.00008433735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4244627,0.000009374078,0.5709283,0.000005529517,0.0006650101,0.00005115094,4.978816e-7,0.00008286777,0.003794545],"genre_scores_gemma":[0.9336296,5.429046e-7,0.06622664,0.00001949475,0.00009728126,0.00000365226,5.842982e-8,0.000005568867,0.00001715088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9279696,"threshold_uncertainty_score":0.218447,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3032866416","doi":"10.1007/s11786-020-00495-9","title":"Common Factors in Fraction-Free Matrix Decompositions","year":2020,"lang":"en","type":"preprint","venue":"Mathematics in Computer Science","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Austrian Science Fund","keywords":"Fraction (chemistry); Mathematics; Matrix (chemical analysis); Reduction (mathematics); Decomposition; LU decomposition; Triangular matrix; Computation; Gauss; Combinatorics; Matrix decomposition; Statistics; Eigenvalues and eigenvectors; Algorithm; Pure mathematics; Physics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03184862625771293,"gpt":0.3115852861953499,"spread":0.279736659937637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001596659,0.0004462748,0.0007210507,0.0009109569,0.0002314187,0.001036914,0.008086772,0.000205809,0.00001626351],"category_scores_gemma":[0.0001451574,0.0004351247,0.0001505759,0.002020914,0.0003065736,0.0007939729,0.008677891,0.001246665,0.00005636401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00036342,"about_ca_system_score_gemma":0.0003986244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006757839,"about_ca_topic_score_gemma":0.00004469413,"domain_scores_codex":[0.9961382,0.0001419398,0.0009357592,0.001231954,0.0009301172,0.0006221014],"domain_scores_gemma":[0.9962113,0.0006489373,0.0004007828,0.002406908,0.0001010685,0.0002309988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008964436,0.001975796,0.003934972,0.001415716,0.00004076403,0.0004756236,0.0210398,0.08633749,0.00064992,0.8650745,0.0006949314,0.01835153],"study_design_scores_gemma":[0.0001603523,0.00002728109,0.001050944,0.0002590507,0.000002985605,0.00001348891,0.00002191425,0.5850385,0.0005513753,0.4125417,0.00002586114,0.0003065077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06602283,0.0000488452,0.9296907,0.001242098,0.001585157,0.000499465,0.00001597376,0.0002546238,0.0006402813],"genre_scores_gemma":[0.3645622,0.0000122101,0.6351069,0.0001460556,0.0001094458,0.00003100979,0.000005186663,0.0000162892,0.0000107346],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4987011,"threshold_uncertainty_score":0.999899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}