{"meta":{"query_hash":"b775345ec586","filters":{"venue":"ACM communications in computer algebra"},"cohort_total":111,"direct_labels_cover":1,"predictions_cover":111,"exported":111,"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/b775345ec586","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+communications+in+computer+algebra"},"results":[{"id":"W1966566700","doi":"10.1145/1394042.1394096","title":"Detecting polynomial perfect powers (abstract only)","year":2008,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Numerical Methods 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":"University of Waterloo","funders":"","keywords":"Lacunary function; Polynomial; Perfect power; Mathematics; Finite field; Integer (computer science); Power (physics); Field (mathematics); Discrete mathematics; Combinatorics; Computer science; Pure mathematics","score_opus":0.05866989292685982,"score_gpt":0.323229655634231,"score_spread":0.2645597627073712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966566700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38307726,0.0008853202,0.58979183,0.0022204178,0.0003628966,0.00026121057,0.0012558623,0.0035278075,0.018617406],"genre_scores_gemma":[0.921375,0.00021284941,0.07247366,0.00029507396,0.00017152734,0.000057076384,0.00089044985,0.00024054176,0.0042837774],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970732,0.00048740095,0.00020023755,0.0009415798,0.0008112484,0.0004863066],"domain_scores_gemma":[0.9887321,0.006172716,0.00096449244,0.0025975034,0.0010415327,0.0004915321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018403699,0.0008002101,0.0013925578,0.0009764043,0.0010302367,0.0019118903,0.0013704749,0.0011731683,0.007927096],"category_scores_gemma":[0.017482646,0.00061126833,0.0008602394,0.0010910331,0.0029642237,0.008026002,0.0042020124,0.0014960249,0.0017995095],"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.004013799,0.00033346898,0.033834487,0.0017565084,0.00023543366,0.004029695,0.0014277222,0.09013827,0.061804,0.35204783,0.03591236,0.41446647],"study_design_scores_gemma":[0.00017734319,0.0004488672,0.0023261954,0.00014666346,0.00008876174,0.0017511827,0.00057002745,0.25876644,0.08492866,0.63590956,0.014798447,0.00008787492],"about_ca_topic_score_codex":0.0009317141,"about_ca_topic_score_gemma":0.00096640707,"teacher_disagreement_score":0.007927096,"about_ca_system_score_codex":0.0008701357,"about_ca_system_score_gemma":0.00094888924,"threshold_uncertainty_score":0.026518762},"labels":[],"label_agreement":null},{"id":"W1967219124","doi":"10.1145/1504347.1504364","title":"Unified formulas for arbitrary order symbolic derivatives and anti-derivatives of the power-inverse hyperbolic class 1","year":2009,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Functional Equations Stability Results","field":"Mathematics","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":"Concordia University","funders":"","keywords":"Mathematics; Hyperbolic function; Inverse; Order (exchange); Pure mathematics; Inverse function; Function (biology); Integer (computer science); Class (philosophy); Inverse trigonometric functions; Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.06760571465389643,"score_gpt":0.32492423220963457,"score_spread":0.25731851755573815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967219124","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14327964,0.0029672938,0.74148023,0.0010549774,0.00067300233,0.00006960514,0.00016680994,0.00018448742,0.11012402],"genre_scores_gemma":[0.81995606,0.0023597733,0.13071436,0.00059980765,0.0007749513,0.00009490027,0.00017853889,0.00026267205,0.045059018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995939,0.00006829886,0.000032795848,0.000066899884,0.00017751516,0.000060623566],"domain_scores_gemma":[0.99952185,0.00013465037,0.00006409536,0.00006966309,0.00014564676,0.00006419342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009894831,0.00058437244,0.00055372174,0.0020173304,0.00073396123,0.001751617,0.0010719937,0.00093034847,0.0048410385],"category_scores_gemma":[0.0032221014,0.00022021105,0.0007055094,0.0009228996,0.001833963,0.004393592,0.0014444786,0.0019472251,0.0007630694],"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.0000052361543,0.000007933065,0.00021139138,0.000025339219,0.0000025134486,0.00006986981,0.00012283298,0.0012502895,0.00090118975,0.98784596,0.0005547383,0.009002883],"study_design_scores_gemma":[0.0000062792465,0.000025474252,0.00041711488,0.000042482465,0.000008250931,0.00023354263,0.0001266281,0.06547404,0.0012506216,0.91950923,0.012883595,0.0000228042],"about_ca_topic_score_codex":0.0010344066,"about_ca_topic_score_gemma":0.0014615378,"teacher_disagreement_score":0.0048410385,"about_ca_system_score_codex":0.0013662388,"about_ca_system_score_gemma":0.00068070384,"threshold_uncertainty_score":0.01619488},"labels":[],"label_agreement":null},{"id":"W1971606922","doi":"10.1145/1940475.1940505","title":"Invariants and symbolic calculations in the theory of quadratic differential systems","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","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":"Université de Montréal","funders":"","keywords":"Symbolic computation; Quadratic equation; Quadratic differential; Algebra over a field; Class (philosophy); Differential (mechanical device); Computation; Mathematics; Polynomial; Space (punctuation); Computer science; Theoretical computer science; Applied mathematics; Pure mathematics; Algorithm; Mathematical analysis; Artificial intelligence","score_opus":0.1364744079541299,"score_gpt":0.33107745551630896,"score_spread":0.19460304756217905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971606922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32466695,0.0031833602,0.51859874,0.0033580235,0.00041354116,0.000068388596,0.00024677403,0.0007017298,0.14876252],"genre_scores_gemma":[0.9418829,0.0009074231,0.04706774,0.00013503688,0.00032232283,0.00004595354,0.00015672624,0.000105811094,0.009376011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993445,0.00017538386,0.000029683682,0.000054738877,0.00031713638,0.00007851884],"domain_scores_gemma":[0.9990828,0.00050410617,0.00009885962,0.00012133542,0.00011851236,0.000074346266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084109773,0.00047898485,0.00056736544,0.0023558785,0.0012871504,0.002229676,0.0009621219,0.0004785214,0.0066211806],"category_scores_gemma":[0.0035073245,0.00022666702,0.00060464774,0.001463478,0.0035038048,0.003979296,0.0014424223,0.001620083,0.00077255623],"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.000008907618,0.000014310391,0.00013840277,0.000024378387,0.0000022694906,0.000028292992,0.000109895365,0.006044122,0.0002855538,0.9882472,0.0003619782,0.0047347676],"study_design_scores_gemma":[0.0000044430462,0.000008312871,0.00011520643,0.000009510242,0.0000016361724,0.000022270975,0.00003809837,0.034436118,0.0003672986,0.96362567,0.0013646818,0.0000067261985],"about_ca_topic_score_codex":0.0010457968,"about_ca_topic_score_gemma":0.0008953072,"teacher_disagreement_score":0.0066211806,"about_ca_system_score_codex":0.0014649649,"about_ca_system_score_gemma":0.0008231767,"threshold_uncertainty_score":0.02215004},"labels":[],"label_agreement":null},{"id":"W1973168804","doi":"10.1145/1394042.1394063","title":"Calculating really big cyclotomic polynomials (abstract only)","year":2008,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Mathematical Identities","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Algebra over a field; Computer science; Pure mathematics","score_opus":0.14536975098044097,"score_gpt":0.3703078411539135,"score_spread":0.22493809017347255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973168804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20094712,0.0021639352,0.56523407,0.0034903083,0.0030270985,0.00021502559,0.0011022284,0.003296594,0.22052369],"genre_scores_gemma":[0.8287946,0.0008419444,0.14262144,0.0008360259,0.00051645975,0.000101817925,0.0007946731,0.0009059446,0.024587104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996619,0.00006805655,0.0000114214545,0.00005885811,0.00013662702,0.00006316511],"domain_scores_gemma":[0.9993893,0.00022157302,0.0000309149,0.00019476943,0.00008420982,0.00007930617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004520861,0.0006286872,0.0006922916,0.00070231064,0.00087916467,0.0009955302,0.00075470516,0.00065190444,0.032818925],"category_scores_gemma":[0.0025635348,0.00025105607,0.0005393161,0.0008800418,0.00091130333,0.0024723785,0.0015293136,0.0015264649,0.0031935303],"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.00039396342,0.00013141453,0.001265651,0.0007321597,0.00006011222,0.00048787304,0.00028256452,0.012417345,0.015109459,0.77665365,0.05242669,0.14003927],"study_design_scores_gemma":[0.000085189364,0.00012903793,0.00090715603,0.00008441798,0.000032109114,0.00058952445,0.00017425744,0.051794413,0.018290007,0.8994034,0.028467692,0.000042702155],"about_ca_topic_score_codex":0.00037810768,"about_ca_topic_score_gemma":0.001190812,"teacher_disagreement_score":0.032818925,"about_ca_system_score_codex":0.0005553328,"about_ca_system_score_gemma":0.0006242325,"threshold_uncertainty_score":0.109790206},"labels":[],"label_agreement":null},{"id":"W1974678454","doi":"10.1145/1394042.1394060","title":"Computational complexity of numerical solutions of initial value problems for differential algebraic equations (abstract only)","year":2008,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Numerical Methods 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":"","keywords":"Mathematics; Ordinary differential equation; Polynomial; Algebraic number; Ode; Differential equation; Differential (mechanical device); Applied mathematics; Class (philosophy); Exponential function; Differential algebraic equation; Value (mathematics); Mathematical optimization; Computer science; Mathematical analysis","score_opus":0.17770210566112915,"score_gpt":0.37951268894123513,"score_spread":0.20181058328010598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974678454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3726266,0.0015581133,0.59390295,0.0042149057,0.00026306318,0.00019679789,0.0003133405,0.00062657817,0.026297584],"genre_scores_gemma":[0.8416952,0.0005686903,0.15276931,0.00021822998,0.0001094166,0.0002085688,0.0003594564,0.00021538865,0.0038557518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865854,0.000587331,0.0000648921,0.00015323564,0.0003692213,0.00016681752],"domain_scores_gemma":[0.982011,0.01612012,0.0004517465,0.0005841941,0.00061811117,0.00021482578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026845618,0.00066334195,0.0008103221,0.00051001966,0.0006397881,0.0016805921,0.00090286246,0.00093886984,0.00396626],"category_scores_gemma":[0.015754173,0.00033672803,0.0006986081,0.0006133208,0.0014112251,0.0016392985,0.0013985038,0.0015716149,0.0003355956],"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.0005553391,0.0001420094,0.003497668,0.00039250538,0.000075645665,0.00019129584,0.00020486148,0.8322898,0.004070608,0.08824668,0.0029729202,0.06736069],"study_design_scores_gemma":[0.000016557795,0.000023088698,0.000205263,0.000008801776,0.000005400121,0.000012642179,0.000018157489,0.98027325,0.00077810447,0.018399782,0.0002547574,0.0000042654806],"about_ca_topic_score_codex":0.003059461,"about_ca_topic_score_gemma":0.0026021565,"teacher_disagreement_score":0.00396626,"about_ca_system_score_codex":0.0013090109,"about_ca_system_score_gemma":0.0012544021,"threshold_uncertainty_score":0.014197469},"labels":[],"label_agreement":null},{"id":"W1984067593","doi":"10.1145/2768577.2768578","title":"The SDEval benchmarking toolkit","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Executable; Benchmarking; Computer science; Focus (optics); Field (mathematics); Task (project management); Symbolic computation; Programming language; Software engineering; Software; Code (set theory); Systems engineering; Engineering; Set (abstract data type); Mathematics","score_opus":0.11450411911506599,"score_gpt":0.355765799854737,"score_spread":0.24126168073967103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984067593","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033392783,0.003658926,0.54489726,0.0012157199,0.0011922899,0.0007879773,0.017055536,0.3266084,0.07119118],"genre_scores_gemma":[0.32878157,0.002791378,0.47372967,0.0011096448,0.0001947061,0.0018690493,0.08491301,0.08540942,0.021201575],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9892959,0.0041229203,0.0011491742,0.0010884542,0.003502498,0.0008411002],"domain_scores_gemma":[0.99202615,0.0031090034,0.00035676273,0.0025143728,0.0015279821,0.00046560614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070283655,0.001814658,0.0013095052,0.0031616825,0.0007579593,0.0035232226,0.005240604,0.0013586481,0.014545472],"category_scores_gemma":[0.019873833,0.00111742,0.0014062264,0.0026766758,0.001096402,0.004179526,0.005243197,0.003314498,0.007293443],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021115188,0.0011381988,0.010430086,0.0045844815,0.0006004711,0.00067477,0.0010238446,0.14350338,0.01006298,0.18921095,0.30645025,0.3302091],"study_design_scores_gemma":[0.00053976005,0.00044250107,0.0032603708,0.00084109,0.000121654375,0.000525226,0.0003762276,0.37362233,0.02416371,0.10107146,0.49475303,0.00028269092],"about_ca_topic_score_codex":0.003347312,"about_ca_topic_score_gemma":0.0029517259,"teacher_disagreement_score":0.014545472,"about_ca_system_score_codex":0.0012310891,"about_ca_system_score_gemma":0.0026658906,"threshold_uncertainty_score":0.048659444},"labels":[],"label_agreement":null},{"id":"W1991557646","doi":"10.1145/2768577.2768651","title":"Piecewise functions and convolution integrals (part I, part II)","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Mathematical functions and polynomials","field":"Mathematics","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":"École de Technologie Supérieure","funders":"","keywords":"Convolution (computer science); Piecewise; Mathematics; Applied mathematics; Pure mathematics; Mathematical analysis; Calculus (dental); Algebra over a field; Computer science; Artificial intelligence","score_opus":0.17772645469116105,"score_gpt":0.3498927156745609,"score_spread":0.17216626098339982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991557646","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060233,0.16544911,0.22012313,0.011227705,0.017408201,0.000101433725,0.0020119133,0.000870446,0.5225751],"genre_scores_gemma":[0.5732489,0.093545124,0.03714944,0.0021765055,0.014110096,0.0001956219,0.0026748981,0.0006766549,0.27622277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998246,0.00003512151,0.000010331231,0.00003892576,0.0000598201,0.000031217376],"domain_scores_gemma":[0.9993554,0.00032226613,0.00009374223,0.00007747425,0.0000922676,0.0000589357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044207688,0.00077983673,0.00059048436,0.0013787997,0.00040712286,0.0016205536,0.0006139088,0.00075549167,0.04704307],"category_scores_gemma":[0.0017616962,0.0002771132,0.00071110396,0.0026158479,0.0011109065,0.0019686907,0.0008394275,0.0013320893,0.009171109],"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.00027733165,0.000108724744,0.0007654962,0.0014348225,0.00009790365,0.0004920537,0.00032931575,0.004615719,0.010665065,0.62909645,0.102641374,0.24947572],"study_design_scores_gemma":[0.00002219556,0.00018939035,0.0051880414,0.0003388401,0.00011000972,0.0011574469,0.00021031547,0.009160975,0.005337542,0.79702616,0.18121204,0.000047126312],"about_ca_topic_score_codex":0.00096375064,"about_ca_topic_score_gemma":0.0007056399,"teacher_disagreement_score":0.04704307,"about_ca_system_score_codex":0.0006682156,"about_ca_system_score_gemma":0.0003734288,"threshold_uncertainty_score":0.15737468},"labels":[],"label_agreement":null},{"id":"W1997380739","doi":"10.1145/1504347.1504368","title":"On the representation of constructible sets","year":2009,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"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":"","keywords":"Representation (politics); Computer science; Mathematics; Political science","score_opus":0.043850947264163165,"score_gpt":0.3126611112219152,"score_spread":0.26881016395775204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997380739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06589235,0.005355206,0.5665033,0.005049036,0.0010724552,0.00012440965,0.0010154053,0.0008540188,0.35413384],"genre_scores_gemma":[0.7683628,0.0060054595,0.14211659,0.00092525873,0.0010429318,0.00026830286,0.0018686497,0.00042957184,0.078980446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913365,0.00030664296,0.00005112622,0.00013597599,0.00024536348,0.00012725625],"domain_scores_gemma":[0.99877125,0.00064636447,0.00008424559,0.00028446747,0.00012418353,0.00008946217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013769291,0.0007598614,0.0008248829,0.0020683943,0.0014247464,0.0036034079,0.0012883879,0.0009533655,0.0152918575],"category_scores_gemma":[0.003154053,0.00039583206,0.0008849836,0.0028538285,0.0039689997,0.007707964,0.003209844,0.0032282975,0.0022920587],"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.000014807112,0.0000062076706,0.000029352355,0.000026047659,0.0000026266064,0.000015445228,0.00013391937,0.00046251295,0.00013057371,0.9909909,0.0011319136,0.0070556286],"study_design_scores_gemma":[0.0000046882124,0.0000070323927,0.00004032458,0.000021351882,0.0000035028504,0.000026631906,0.000041553783,0.0013736048,0.00013195856,0.9920884,0.006256831,0.000004254036],"about_ca_topic_score_codex":0.0010467726,"about_ca_topic_score_gemma":0.0009660563,"teacher_disagreement_score":0.0152918575,"about_ca_system_score_codex":0.0017815297,"about_ca_system_score_gemma":0.0005069337,"threshold_uncertainty_score":0.0511564},"labels":[],"label_agreement":null},{"id":"W2001572656","doi":"10.1145/1358183.1358185","title":"Irreducible polynomials and barker sequences","year":2007,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Division of Computing and Communication Foundations","keywords":"Mathematics; Irreducibility; Combinatorics; Sequence (biology); Conjecture; Prime (order theory); Modulo; Integer (computer science); Discrete mathematics; Polynomial; Degree (music); Pure mathematics","score_opus":0.038182062635979064,"score_gpt":0.30782306990029473,"score_spread":0.26964100726431567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001572656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75409496,0.006223131,0.09251738,0.0038780363,0.00050984405,0.0000598962,0.00033974825,0.0003374129,0.14203946],"genre_scores_gemma":[0.97431743,0.001568984,0.010376446,0.0003302734,0.00041005618,0.000022950258,0.00020290757,0.000031946278,0.012739101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993037,0.00012323145,0.000037118556,0.0001537232,0.00020402906,0.00017813491],"domain_scores_gemma":[0.9982286,0.00082387,0.00036756074,0.00019066436,0.00016607948,0.00022319809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008445164,0.00033884743,0.00041994423,0.001391315,0.0016006975,0.0011581215,0.0003630809,0.0005253101,0.00475275],"category_scores_gemma":[0.004098,0.00020378456,0.00045465276,0.0009890675,0.0034737645,0.0032887738,0.0017692703,0.002085097,0.0006086668],"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.00005415552,0.000020205258,0.00050966477,0.00004315629,0.000003295333,0.0001290588,0.00051214645,0.0007553509,0.0011246831,0.9846784,0.0009293115,0.011240607],"study_design_scores_gemma":[0.000011139273,0.00004000728,0.0005449671,0.000025977608,0.000005984544,0.00027349664,0.0001559394,0.001894139,0.0012866197,0.9874072,0.008339571,0.0000149292555],"about_ca_topic_score_codex":0.0007057048,"about_ca_topic_score_gemma":0.00058175804,"teacher_disagreement_score":0.00475275,"about_ca_system_score_codex":0.0008981468,"about_ca_system_score_gemma":0.0005034735,"threshold_uncertainty_score":0.015899539},"labels":[],"label_agreement":null},{"id":"W2003148723","doi":"10.1145/1838599.1838614","title":"Abstract only","year":2010,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","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":"University of Waterloo","funders":"","keywords":"Multiplicative function; Finite field; Univariate; Mathematics; Binomial (polynomial); Constant (computer programming); Order (exchange); Degree (music); Polynomial; Combinatorics; Discrete mathematics; Applied mathematics; Computer science; Statistics; Multivariate statistics; Mathematical analysis","score_opus":0.027788230282145096,"score_gpt":0.29051167572209324,"score_spread":0.26272344543994813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003148723","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065402593,0.0023308173,0.03266095,0.020107815,0.0106834695,0.0002470681,0.0068652313,0.0049630986,0.9156014],"genre_scores_gemma":[0.063754275,0.0016667733,0.007829579,0.0045506097,0.0023206074,0.000109036926,0.0064379573,0.0014083493,0.91192275],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897337,0.0001391395,0.000043773372,0.00033351828,0.00035674882,0.00015339933],"domain_scores_gemma":[0.997349,0.00033396887,0.00014509859,0.00094417954,0.00066000025,0.0005677636],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00072833116,0.00066851405,0.0009680548,0.00091340614,0.0019560421,0.0045797406,0.0015506055,0.0017756865,0.5639569],"category_scores_gemma":[0.004331216,0.00033832583,0.00079368224,0.0015007299,0.00097188534,0.004308923,0.0039642826,0.002173034,0.50011367],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026559824,0.00013247108,0.0009699183,0.00035520407,0.000025469615,0.00039696187,0.00019879398,0.00094480737,0.003064126,0.09569269,0.7086151,0.18933885],"study_design_scores_gemma":[0.000029950981,0.000055124394,0.0006201305,0.00010864977,0.000014039457,0.0003982796,0.00011461234,0.0016556176,0.0018426514,0.03344253,0.9616985,0.000019863168],"about_ca_topic_score_codex":0.0016505388,"about_ca_topic_score_gemma":0.002766142,"teacher_disagreement_score":0.43604308,"about_ca_system_score_codex":0.0013101521,"about_ca_system_score_gemma":0.0013471716,"threshold_uncertainty_score":0.62196255},"labels":[],"label_agreement":null},{"id":"W2003274056","doi":"10.1145/1940475.1940521","title":"Sparse polynomial multiplication and division in Maple 14","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Division (mathematics); Multiplication (music); Speedup; Polynomial; Computer science; Mathematics; Parallel computing; Arithmetic; Combinatorics; Botany","score_opus":0.056069229062558394,"score_gpt":0.27938956956586103,"score_spread":0.22332034050330263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003274056","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082528844,0.00050552364,0.7485506,0.0005957896,0.000225864,0.00020608169,0.0031036956,0.10761882,0.056664877],"genre_scores_gemma":[0.435644,0.00031862524,0.5342077,0.00047345168,0.00015221526,0.00048704236,0.0051482804,0.009323621,0.014245046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984944,0.0002827242,0.00009897851,0.00020842702,0.00066562823,0.00024975082],"domain_scores_gemma":[0.9976355,0.00088084803,0.0001763138,0.00071079814,0.0004646925,0.00013180044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010733334,0.00085437484,0.0007464325,0.0009641856,0.00075158954,0.0018828937,0.0015564383,0.0005911004,0.019222273],"category_scores_gemma":[0.0054010716,0.00051028805,0.00078145025,0.0015625122,0.0009033676,0.0032826304,0.0024401522,0.0013520219,0.007436002],"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.00300687,0.00043180783,0.004480808,0.0009834239,0.00014155461,0.00063199317,0.0010428595,0.061192628,0.030338153,0.18476097,0.16569342,0.5472955],"study_design_scores_gemma":[0.0006796201,0.00064788817,0.0019080385,0.0001553705,0.00008398388,0.0006779017,0.0002059646,0.3605467,0.15614854,0.17287715,0.30585533,0.00021352485],"about_ca_topic_score_codex":0.001254165,"about_ca_topic_score_gemma":0.0017618176,"teacher_disagreement_score":0.019222273,"about_ca_system_score_codex":0.00083408586,"about_ca_system_score_gemma":0.0014200637,"threshold_uncertainty_score":0.06430489},"labels":[],"label_agreement":null},{"id":"W2005397991","doi":"10.1145/1358183.1358188","title":"Symbolic computation techniques for solving large expression problems from mathematics and engineering","year":2007,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Real-time simulation and control systems","field":"Engineering","cited_by":3,"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":"","keywords":"Computation; Expression (computer science); Symbolic computation; Symbolic-numeric computation; Computer science; Theoretical computer science; Algebra over a field; Mathematics education; Mathematics; Algorithm; Programming language; Pure mathematics","score_opus":0.019367912326231265,"score_gpt":0.27019824294271466,"score_spread":0.2508303306164834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005397991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020191,0.0008202191,0.98721737,0.00034101226,0.00008521941,0.000036253845,0.000073539995,0.00064501516,0.008762297],"genre_scores_gemma":[0.12784074,0.0032876285,0.85177803,0.00018202515,0.00031864757,0.00039534643,0.0005980713,0.0008105545,0.014789059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992061,0.0002498328,0.000043901393,0.000058835933,0.00038042932,0.000060877333],"domain_scores_gemma":[0.9986883,0.00093183754,0.000053173884,0.00018827972,0.00010658754,0.000031866457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096255686,0.0011257066,0.0011943608,0.00096840074,0.00093810435,0.0011897938,0.001578096,0.00076632854,0.01803569],"category_scores_gemma":[0.004693084,0.00038882988,0.0009506557,0.002271253,0.0015884021,0.0021099588,0.0020567079,0.00343234,0.0044645574],"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.00011536242,0.000069199865,0.00023525451,0.0006605047,0.00007568049,0.00019141093,0.0002829994,0.095741674,0.0058245156,0.62931544,0.012447602,0.25504044],"study_design_scores_gemma":[0.00004829481,0.000035712423,0.00007383129,0.00007766899,0.000026733622,0.00010422938,0.000056453955,0.2607551,0.0030626717,0.71351504,0.022230318,0.000013950339],"about_ca_topic_score_codex":0.0009929806,"about_ca_topic_score_gemma":0.0020667668,"teacher_disagreement_score":0.01803569,"about_ca_system_score_codex":0.0007292791,"about_ca_system_score_gemma":0.0009564629,"threshold_uncertainty_score":0.060335338},"labels":[],"label_agreement":null},{"id":"W2008160486","doi":"10.1145/2110170.2110174","title":"Computing the real solutions of polynomial systems with the RegularChains library in Maple","year":2012,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University","funders":"","keywords":"Citation; China; Maple; Library science; Computer science; History; Archaeology; Botany; Biology","score_opus":0.035293267495734894,"score_gpt":0.2624975572434372,"score_spread":0.22720428974770232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008160486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018264625,0.0005024787,0.91390014,0.0008909965,0.00024737383,0.00011651341,0.0015209095,0.024758592,0.03979845],"genre_scores_gemma":[0.4426509,0.0010067028,0.512414,0.00039883473,0.00034362756,0.0004844195,0.0044543645,0.0051309504,0.033116203],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856025,0.00042710858,0.00006661125,0.00012201219,0.00062572845,0.00019814621],"domain_scores_gemma":[0.99706584,0.0013941927,0.000112080335,0.00077899656,0.00044864937,0.0002001559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019668243,0.0008611505,0.0011063853,0.0012489312,0.0009197215,0.002850411,0.0016316109,0.0007507706,0.044493273],"category_scores_gemma":[0.009535429,0.00061358354,0.0011298169,0.0017187913,0.0009682153,0.004909346,0.004091381,0.001790553,0.018473543],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090421736,0.00023073965,0.0023713056,0.0007662253,0.00011514497,0.00034063208,0.00048521045,0.12933172,0.0042126295,0.32652155,0.11764653,0.41707408],"study_design_scores_gemma":[0.00017077113,0.000088633016,0.0003306131,0.00007745445,0.000024309797,0.00011367567,0.00009572891,0.5775855,0.006421044,0.35868552,0.056358136,0.00004852082],"about_ca_topic_score_codex":0.0019361695,"about_ca_topic_score_gemma":0.0037720862,"teacher_disagreement_score":0.044493273,"about_ca_system_score_codex":0.0009557656,"about_ca_system_score_gemma":0.0013516621,"threshold_uncertainty_score":0.1488449},"labels":[],"label_agreement":null},{"id":"W2008418270","doi":"10.1145/1182553.1182565","title":"WWCA 2006 abstracts","year":2006,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"George (robot); Library science; China; State (computer science); Sociology; Political science; Art history; History; Law; Mathematics; Computer science; Algorithm","score_opus":0.027499002313740084,"score_gpt":0.2826450610855237,"score_spread":0.2551460587717836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008418270","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014633231,0.015763376,0.015082448,0.02390704,0.050523177,0.0006614239,0.019976946,0.0056008203,0.8670214],"genre_scores_gemma":[0.003956783,0.0064728134,0.0043279044,0.0025290854,0.005134375,0.0003088249,0.020674469,0.0016089389,0.95498693],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974605,0.00028581326,0.0001924326,0.0005177453,0.0012625703,0.00028100298],"domain_scores_gemma":[0.99485415,0.00028862676,0.00012787853,0.0006748884,0.0031443662,0.0009101536],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002135004,0.0014599902,0.0013872485,0.0030989028,0.0029789784,0.01081779,0.0025783253,0.0026630887,0.5769815],"category_scores_gemma":[0.005714216,0.0007202822,0.0013942478,0.0037632252,0.00069121737,0.004663956,0.003713738,0.0033809014,0.46321952],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002798607,0.000021699838,0.000050591047,0.00009782577,0.000004732163,0.000021131846,0.000021166477,0.00006711109,0.0001944867,0.003318779,0.9593028,0.036871683],"study_design_scores_gemma":[0.000005752723,0.000006058093,0.00014560319,0.000065894295,0.0000028183147,0.000026204489,0.000028596338,0.000084373845,0.00009077452,0.0012373121,0.99830186,0.0000048255724],"about_ca_topic_score_codex":0.014701934,"about_ca_topic_score_gemma":0.017483817,"teacher_disagreement_score":0.42301852,"about_ca_system_score_codex":0.0049865595,"about_ca_system_score_gemma":0.0062869163,"threshold_uncertainty_score":0.60338455},"labels":[],"label_agreement":null},{"id":"W2011207950","doi":"10.1145/2768577.2768641","title":"Rational invariants of finite abelian groups","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Abelian group; Mathematics; Pure mathematics; Algebra over a field","score_opus":0.06751433941925224,"score_gpt":0.2975233244416609,"score_spread":0.23000898502240869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011207950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4902224,0.0022598654,0.036317866,0.0021580225,0.00075485226,0.00006747702,0.00064716965,0.00084436993,0.46672806],"genre_scores_gemma":[0.967373,0.0005564367,0.0019029627,0.000057610425,0.000370828,0.000012549305,0.00033600134,0.000057885463,0.029332604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996586,0.000058194448,0.0000148232975,0.0000638298,0.00010637788,0.000098210396],"domain_scores_gemma":[0.99935895,0.00023775446,0.0001070436,0.00009316531,0.00008325655,0.00011971028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042783734,0.0003887087,0.00049399235,0.002050008,0.00074212055,0.001903398,0.00043119086,0.00031493118,0.016900677],"category_scores_gemma":[0.001333443,0.00014697363,0.00035193213,0.0009818914,0.0024250816,0.0022876302,0.00091386324,0.00078180555,0.0021011173],"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.000102962,0.000047697016,0.0005424922,0.00006274721,0.0000086903065,0.00012222308,0.00031796418,0.0010648222,0.001396515,0.971557,0.0040752664,0.020701597],"study_design_scores_gemma":[0.00003328405,0.000056651785,0.00094470306,0.000025736606,0.000017256936,0.00012591913,0.0001900231,0.002717708,0.0019386453,0.98049957,0.013436468,0.000014125379],"about_ca_topic_score_codex":0.00089590496,"about_ca_topic_score_gemma":0.00072198827,"teacher_disagreement_score":0.016900677,"about_ca_system_score_codex":0.0014527811,"about_ca_system_score_gemma":0.000497268,"threshold_uncertainty_score":0.056538463},"labels":[],"label_agreement":null},{"id":"W2011613539","doi":"10.1145/2429135.2429150","title":"Structured computation in optimization and algorithmic differentiation","year":2013,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computation; Automatic differentiation; Computer science; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.052052283369908726,"score_gpt":0.3556649149947944,"score_spread":0.30361263162488566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011613539","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015789468,0.057226293,0.55511737,0.019427342,0.005066528,0.000093809474,0.0009930907,0.0009562162,0.34532994],"genre_scores_gemma":[0.50349236,0.06731003,0.22907764,0.0022776045,0.007688441,0.00041103052,0.0022377882,0.00083337975,0.18667169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909186,0.00040110515,0.000042775446,0.00014766434,0.00024776856,0.00006887079],"domain_scores_gemma":[0.9979849,0.0012826358,0.00010812254,0.0003002548,0.00021127315,0.00011273587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014394542,0.0009151781,0.0014391306,0.0012590789,0.000688763,0.002402133,0.0007897098,0.00082095823,0.03727266],"category_scores_gemma":[0.0045056073,0.00031327162,0.0008570502,0.0038089713,0.0024778116,0.0031589412,0.0015657627,0.0028288364,0.0072794813],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006996534,0.000029843877,0.00025608786,0.00034915726,0.00004287489,0.0000566374,0.00012531212,0.0042571556,0.00043551734,0.8988717,0.030877158,0.06462842],"study_design_scores_gemma":[0.00002145298,0.000037362566,0.00030121364,0.00012538624,0.000017729497,0.00008180986,0.00006315811,0.010990275,0.00041677736,0.91855186,0.06938087,0.000012139026],"about_ca_topic_score_codex":0.0014542234,"about_ca_topic_score_gemma":0.0019126685,"teacher_disagreement_score":0.03727266,"about_ca_system_score_codex":0.0015705947,"about_ca_system_score_gemma":0.0011490881,"threshold_uncertainty_score":0.12468946},"labels":[],"label_agreement":null},{"id":"W2012117787","doi":"10.1145/1940475.1940479","title":"A fast recursive algorithm for computing cyclotomic polynomials","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","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":"Simon Fraser University","funders":"","keywords":"Computer science; Algorithm; Algebra over a field; Parallel computing; Mathematics; Pure mathematics","score_opus":0.05293683255233263,"score_gpt":0.2971493538939185,"score_spread":0.2442125213415859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012117787","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014120598,0.00080320507,0.9661216,0.0003836713,0.00024966896,0.00024873234,0.0003520905,0.0047358084,0.01298465],"genre_scores_gemma":[0.14045914,0.00045590455,0.84481275,0.00019460537,0.00017888009,0.0003873672,0.0012558766,0.0005713517,0.011684125],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991412,0.00015232524,0.000055125314,0.0002060021,0.00028889245,0.00015645578],"domain_scores_gemma":[0.9988452,0.00044705058,0.0000514283,0.0003267621,0.00025468096,0.00007484914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007733927,0.0012911495,0.0010480513,0.0016414039,0.0015269476,0.0016743691,0.001997819,0.0010959728,0.022876529],"category_scores_gemma":[0.0034212992,0.0004857678,0.0009354781,0.002162566,0.0009197491,0.0023721512,0.002360825,0.0018934427,0.0073562684],"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.0004974356,0.00023159027,0.00064294453,0.00033270582,0.00007046735,0.00017243187,0.00024695083,0.014128695,0.020923732,0.08817918,0.02805608,0.84651774],"study_design_scores_gemma":[0.0011303236,0.00070329726,0.0018750828,0.00019134794,0.0002106054,0.00132418,0.00034241079,0.40214285,0.05182697,0.43768835,0.10234381,0.00022072374],"about_ca_topic_score_codex":0.0033361223,"about_ca_topic_score_gemma":0.0073583163,"teacher_disagreement_score":0.022876529,"about_ca_system_score_codex":0.0012406211,"about_ca_system_score_gemma":0.0020552923,"threshold_uncertainty_score":0.07652962},"labels":[],"label_agreement":null},{"id":"W2018206679","doi":"10.1145/2576802.2576817","title":"A parallel algorithm to compute the greatest common divisor of sparse multivariate polynomials","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multivariate statistics; Divisor (algebraic geometry); Mathematics; Greatest common divisor; Combinatorics; Algorithm; Statistics","score_opus":0.038761719089005574,"score_gpt":0.2948750600822716,"score_spread":0.25611334099326605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018206679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05081044,0.00076932483,0.9273412,0.0007590086,0.00035736212,0.0003490998,0.0006433708,0.005500527,0.013469662],"genre_scores_gemma":[0.22435606,0.0003950361,0.75731516,0.00021534286,0.00029565202,0.00042142748,0.00196364,0.00045234352,0.014585284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993523,0.0000885794,0.000051545954,0.00018007115,0.00020789252,0.00011956755],"domain_scores_gemma":[0.9990061,0.00031389718,0.000061278435,0.00031792454,0.0001984562,0.00010233776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072164804,0.0013975931,0.0011022341,0.0018731563,0.0014242559,0.0015650935,0.001585106,0.0008117425,0.016056372],"category_scores_gemma":[0.0024064388,0.000542612,0.0009857424,0.0024441017,0.0007740197,0.0024350837,0.002487445,0.0013542282,0.004912489],"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.0011817026,0.00042999262,0.0018596153,0.00029352633,0.00013737795,0.00029526284,0.00021803916,0.03938744,0.027336715,0.032619532,0.02804046,0.8682004],"study_design_scores_gemma":[0.001347009,0.0007185959,0.0019386193,0.00006657754,0.00018404188,0.00089064636,0.0002467666,0.7857496,0.03883918,0.13994281,0.029971141,0.00010503225],"about_ca_topic_score_codex":0.0040476047,"about_ca_topic_score_gemma":0.009743439,"teacher_disagreement_score":0.016056372,"about_ca_system_score_codex":0.0010888879,"about_ca_system_score_gemma":0.0026395796,"threshold_uncertainty_score":0.053713858},"labels":[],"label_agreement":null},{"id":"W2022316771","doi":"10.1145/2768577.2768649","title":"RUBI and integration as term re-writing","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Digital Humanities and Scholarship","field":"Arts and Humanities","cited_by":1,"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":"","keywords":"Term (time); Computer science; Physics; Astronomy","score_opus":0.14897221589042972,"score_gpt":0.31152116702036436,"score_spread":0.16254895112993464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022316771","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027463367,0.0062269554,0.44270167,0.0072471797,0.001969763,0.00033138786,0.0006866627,0.00916398,0.5042089],"genre_scores_gemma":[0.5367996,0.0021855775,0.24918982,0.0008038397,0.0009965952,0.0002760032,0.0015740857,0.004951191,0.2032233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99485296,0.0021291499,0.00041698103,0.0008159181,0.0013508523,0.00043423264],"domain_scores_gemma":[0.98898774,0.0031481392,0.0009580204,0.0044052196,0.0018896286,0.00061123125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005180895,0.00072274375,0.0011058016,0.0026773354,0.0023308995,0.0056427782,0.002376952,0.0011290078,0.05526791],"category_scores_gemma":[0.020400485,0.0006513778,0.0012450614,0.0029496104,0.0037711347,0.012775325,0.006073678,0.003478631,0.018352738],"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.00028891762,0.000073168,0.0006501465,0.00032559995,0.000034920165,0.00018636126,0.00277929,0.00083102245,0.0026551501,0.744921,0.022852194,0.2244021],"study_design_scores_gemma":[0.000073121664,0.0001294827,0.0010025318,0.00028141396,0.0000812785,0.00061805564,0.0014223341,0.010343527,0.00816904,0.7165638,0.26123115,0.00008422475],"about_ca_topic_score_codex":0.0018143946,"about_ca_topic_score_gemma":0.0018782832,"teacher_disagreement_score":0.05526791,"about_ca_system_score_codex":0.0018236256,"about_ca_system_score_gemma":0.0019075713,"threshold_uncertainty_score":0.18488961},"labels":[],"label_agreement":null},{"id":"W2022344882","doi":"10.1145/1358190.1358203","title":"A maple library for high performance sparse polynomial arithmetic","year":2007,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","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":"Simon Fraser University","funders":"","keywords":"Maple; Inefficiency; Implementation; Computer science; Arithmetic; Polynomial; Mathematics; Programming language; Botany; Biology","score_opus":0.029339437587312223,"score_gpt":0.2697053565679183,"score_spread":0.24036591898060605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022344882","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008592908,0.00033081474,0.8583666,0.0002502098,0.00012665911,0.00012241745,0.0016066683,0.11226858,0.018335167],"genre_scores_gemma":[0.1911643,0.0008749082,0.7459767,0.0005948428,0.0003364832,0.00081328675,0.007937634,0.01711602,0.03518579],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989436,0.0001450679,0.00006691665,0.00010720677,0.00057594094,0.00016130334],"domain_scores_gemma":[0.9981298,0.0005367873,0.00010772241,0.00056978466,0.00053999916,0.00011606011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009379498,0.0008493731,0.00080231065,0.0013301634,0.0010697187,0.0022726257,0.0028563887,0.00069339556,0.028064108],"category_scores_gemma":[0.0048024976,0.0007636368,0.0010134726,0.0021368535,0.0005803652,0.004266038,0.0025729537,0.0021334044,0.016450174],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010043544,0.00025003697,0.0020924022,0.0010459956,0.00009963784,0.00055450015,0.0005349747,0.016923718,0.03194327,0.14451484,0.19105943,0.60997677],"study_design_scores_gemma":[0.0004564175,0.00038727964,0.0018028643,0.00022501044,0.00010715383,0.0011895875,0.00015552907,0.23918468,0.133505,0.13160932,0.49113286,0.00024432296],"about_ca_topic_score_codex":0.0009773234,"about_ca_topic_score_gemma":0.0013606002,"teacher_disagreement_score":0.028064108,"about_ca_system_score_codex":0.00059144443,"about_ca_system_score_gemma":0.0013426086,"threshold_uncertainty_score":0.09388375},"labels":[],"label_agreement":null},{"id":"W2040416064","doi":"10.1145/1394042.1394090","title":"Automatic variable order selection for polynomial system solving (abstract only)","year":2008,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"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; University of Waterloo","funders":"","keywords":"Solver; Weighting; Variable (mathematics); Dependency (UML); Polynomial; Computer science; Computation; Variable elimination; Graph; System of polynomial equations; Applied mathematics; Decomposition; Basis (linear algebra); Mathematical optimization; Mathematics; Algebra over a field; Theoretical computer science; Algorithm; Pure mathematics; Artificial intelligence; Inference","score_opus":0.03329260327179587,"score_gpt":0.27392579266457423,"score_spread":0.24063318939277836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040416064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055896044,0.00025949365,0.9272762,0.00023049137,0.00004204547,0.00010305067,0.00020634805,0.009174074,0.0068122335],"genre_scores_gemma":[0.31805328,0.00017465212,0.6731386,0.000112599046,0.000046118894,0.00013075465,0.00066774274,0.0012243948,0.0064519043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993647,0.0002373786,0.00002645185,0.000088811255,0.00021967145,0.0000630435],"domain_scores_gemma":[0.9988661,0.0006970611,0.00006227562,0.00020140925,0.00013327022,0.000039960752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006770539,0.0005018849,0.0005911131,0.00053824205,0.00055690674,0.0008752867,0.0006681936,0.0002872145,0.011387806],"category_scores_gemma":[0.0025514949,0.00029331996,0.0003048277,0.0011443234,0.0004766949,0.0011297108,0.001077248,0.00088692945,0.0017942172],"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.00076157047,0.00024186748,0.0018178932,0.0003390062,0.000040398067,0.00011980527,0.0003352881,0.059381146,0.03336503,0.060184557,0.023617223,0.8197961],"study_design_scores_gemma":[0.00023090732,0.00011284626,0.00054590014,0.000021615337,0.000023510756,0.00007091188,0.000066644156,0.87506914,0.034338415,0.07490132,0.014593486,0.000025360288],"about_ca_topic_score_codex":0.0016179972,"about_ca_topic_score_gemma":0.0049638487,"teacher_disagreement_score":0.011387806,"about_ca_system_score_codex":0.0004731669,"about_ca_system_score_gemma":0.00081204885,"threshold_uncertainty_score":0.03809595},"labels":[],"label_agreement":null},{"id":"W2042361512","doi":"10.1145/1940475.1940488","title":"Optimization techniques for small matrix multiplication","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"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":"","keywords":"Strassen algorithm; Multiplication (music); Matrix multiplication; Mathematics; Multiplication algorithm; Base (topology); Matrix (chemical analysis); Code (set theory); Differential (mechanical device); Computer science; Arithmetic; Algebra over a field; Algorithm; Combinatorics; Pure mathematics","score_opus":0.09747031034217751,"score_gpt":0.3175422735804849,"score_spread":0.2200719632383074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042361512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029201796,0.0009524521,0.9450979,0.00045452555,0.00015617583,0.00015147826,0.000273046,0.0031397322,0.020572731],"genre_scores_gemma":[0.21946086,0.00059897796,0.7710738,0.00020459954,0.00012441786,0.00028284107,0.00048267285,0.0011647824,0.0066069956],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987943,0.0002731032,0.000066967674,0.00015017802,0.0005044326,0.00021096534],"domain_scores_gemma":[0.99708694,0.0015411814,0.0002500895,0.0005417674,0.0005028221,0.000077259625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012147282,0.0011826217,0.00066381943,0.0011932674,0.00059838354,0.0010640809,0.0013380221,0.00060735364,0.019866025],"category_scores_gemma":[0.007314457,0.00032115536,0.00069068203,0.001744648,0.00064669095,0.002277997,0.00094361964,0.0015845839,0.0036759826],"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.0005094254,0.00034546078,0.0013391597,0.0005288116,0.00006669225,0.00011678776,0.00012883412,0.37798962,0.015296039,0.08405189,0.02103666,0.49859065],"study_design_scores_gemma":[0.00012308899,0.00027882683,0.0005713456,0.000057946672,0.000050408402,0.00016927128,0.00006340183,0.8819818,0.019800788,0.07707047,0.019792588,0.000040149625],"about_ca_topic_score_codex":0.0018347837,"about_ca_topic_score_gemma":0.0035277824,"teacher_disagreement_score":0.019866025,"about_ca_system_score_codex":0.00085919816,"about_ca_system_score_gemma":0.0016553932,"threshold_uncertainty_score":0.06645846},"labels":[],"label_agreement":null},{"id":"W2043679401","doi":"10.1145/2429135.2429157","title":"On the complexity of computing certain resultants","year":2013,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","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":"","keywords":"Computer science; Mathematics; Algebra over a field; Pure mathematics","score_opus":0.07873152433325852,"score_gpt":0.3010978102388472,"score_spread":0.22236628590558866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043679401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4606786,0.0028602039,0.4152477,0.009981155,0.0005098291,0.00048058358,0.0067917434,0.0050913845,0.098358795],"genre_scores_gemma":[0.79151535,0.0013098513,0.18123887,0.00066222716,0.0007016513,0.00020775557,0.008047607,0.0010680433,0.015248626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936923,0.0012527201,0.00052079395,0.0011846323,0.002392806,0.0009568532],"domain_scores_gemma":[0.9327086,0.05730446,0.0018136029,0.004976542,0.0020658348,0.0011308623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035835155,0.0012174039,0.0020136395,0.002896624,0.0029812483,0.007444598,0.003336314,0.0017874168,0.026231188],"category_scores_gemma":[0.033191916,0.0007825042,0.0029780823,0.0050198133,0.0036569734,0.01643368,0.0046968604,0.004016877,0.0031487858],"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.0031828631,0.0006697287,0.010798791,0.0019276085,0.0003507302,0.00071358186,0.0013442927,0.09874232,0.009190544,0.55900836,0.041810807,0.27226037],"study_design_scores_gemma":[0.00020014525,0.000116994124,0.0015106719,0.000084135776,0.00014179786,0.00038433677,0.0002636212,0.13843939,0.00471276,0.84839684,0.0056918883,0.000057475725],"about_ca_topic_score_codex":0.0031586047,"about_ca_topic_score_gemma":0.0064975894,"teacher_disagreement_score":0.026231188,"about_ca_system_score_codex":0.0035581142,"about_ca_system_score_gemma":0.002536963,"threshold_uncertainty_score":0.087752104},"labels":[],"label_agreement":null},{"id":"W2043879721","doi":"10.1145/2733693.2733709","title":"Fraction-Free Factoring Revisited","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","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":"","keywords":"Fraction (chemistry); Univariate; Gaussian elimination; Mathematics; Factoring; Matrix (chemical analysis); Gaussian; Algorithm; Computer science; Applied mathematics; Algebra over a field; Pure mathematics; Statistics; Multivariate statistics","score_opus":0.07127638644566496,"score_gpt":0.3133354543455222,"score_spread":0.2420590678998572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043879721","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052892797,0.0011470004,0.93265563,0.00038500153,0.00016424937,0.00006309808,0.00019121631,0.0015457866,0.010955191],"genre_scores_gemma":[0.6042003,0.0010275092,0.3822243,0.00042147946,0.00016001811,0.000063744425,0.00035976348,0.00071657717,0.0108263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991019,0.00016936849,0.000042373187,0.00017982561,0.00035565018,0.00015093597],"domain_scores_gemma":[0.9982911,0.0006554098,0.000095110794,0.0006385781,0.0002696954,0.000050154104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000849905,0.0007678355,0.0007463472,0.0008997216,0.00078205025,0.0012911267,0.0008567815,0.00056151696,0.0068255262],"category_scores_gemma":[0.0049458803,0.00027864584,0.0006884391,0.0011307131,0.0015570482,0.0024697715,0.0014416209,0.0010380198,0.0015637922],"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.000721754,0.00012972139,0.002705015,0.000374705,0.00008974851,0.00040970652,0.00091618835,0.08995119,0.025405861,0.46182546,0.010035935,0.40743476],"study_design_scores_gemma":[0.00014555929,0.00025916597,0.0007334102,0.00012119349,0.000076518336,0.0009216487,0.0002957768,0.31968275,0.056929503,0.5430183,0.077732354,0.00008378144],"about_ca_topic_score_codex":0.0029275543,"about_ca_topic_score_gemma":0.0030825753,"teacher_disagreement_score":0.0068255262,"about_ca_system_score_codex":0.00067795813,"about_ca_system_score_gemma":0.0009993474,"threshold_uncertainty_score":0.022833705},"labels":[],"label_agreement":null},{"id":"W2046283333","doi":"10.1145/2576802.2576815","title":"Recursive sparse interpolation","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Interpolation (computer graphics); Computer science; Mathematics; Algorithm; Artificial intelligence","score_opus":0.02142148638450745,"score_gpt":0.28240433769836026,"score_spread":0.2609828513138528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046283333","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052965893,0.0008790516,0.9465972,0.00054183765,0.00045422447,0.000057859343,0.0005938269,0.0019273369,0.04365218],"genre_scores_gemma":[0.249029,0.0022655735,0.61398053,0.00038181854,0.00066480273,0.0001819294,0.0033445223,0.0013245773,0.12882724],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971277,0.0000754275,0.000009330044,0.000055995904,0.000106534404,0.00003999207],"domain_scores_gemma":[0.9993166,0.00025907886,0.000033405107,0.00021762041,0.00014030047,0.000033088614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003927557,0.00057134486,0.00078951305,0.00061776827,0.00028296353,0.0006276988,0.00060623314,0.0005963441,0.049826607],"category_scores_gemma":[0.0030088383,0.00022521999,0.0004963545,0.0012229035,0.00038356593,0.0008922666,0.0011391639,0.0013254452,0.015549479],"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.00042384636,0.000095028205,0.00044323783,0.0003595601,0.000054454074,0.00016854862,0.00008562548,0.046105597,0.0147224795,0.15018849,0.072864935,0.71448827],"study_design_scores_gemma":[0.00009976087,0.00014965174,0.00068573636,0.00016098861,0.00005909949,0.00056275283,0.000057158733,0.66906965,0.017586341,0.14697316,0.1645521,0.000043582135],"about_ca_topic_score_codex":0.0013896583,"about_ca_topic_score_gemma":0.0029281585,"teacher_disagreement_score":0.049826607,"about_ca_system_score_codex":0.0003019546,"about_ca_system_score_gemma":0.0006055356,"threshold_uncertainty_score":0.1666866},"labels":[],"label_agreement":null},{"id":"W2049605943","doi":"10.1145/2733693.2733720","title":"The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Computer science; Object (grammar); Kernel (algebra); Algebra over a field; Mathematics; Pure mathematics; Artificial intelligence","score_opus":0.15658605195261344,"score_gpt":0.345271712053709,"score_spread":0.18868566010109555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049605943","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003789935,0.00034692005,0.98176736,0.00039545563,0.0003331395,0.0002311184,0.0007949543,0.0077084927,0.00463275],"genre_scores_gemma":[0.056002013,0.0004868405,0.92582756,0.0007870688,0.00028339666,0.0011223499,0.0028662418,0.0030714972,0.009553083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99337775,0.0014085503,0.001019304,0.0012530838,0.0023697866,0.00057141326],"domain_scores_gemma":[0.9870739,0.002532671,0.00087189116,0.0048683286,0.0039877356,0.0006653702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005113979,0.0012988193,0.0016999785,0.0023944278,0.0024927051,0.0069105923,0.0044193245,0.0014112418,0.0079275165],"category_scores_gemma":[0.018821642,0.0019314243,0.002535731,0.0040637157,0.0034582596,0.014174831,0.0071137967,0.0051854113,0.007820235],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013186539,0.00021644284,0.0027087226,0.0008625375,0.00014865743,0.00036509635,0.0012199702,0.0093331635,0.011498743,0.53253525,0.076050825,0.36374193],"study_design_scores_gemma":[0.00033404992,0.00061062374,0.0007038558,0.00031645823,0.00013100186,0.0008730346,0.00029498505,0.07372811,0.07745972,0.263563,0.58165723,0.00032798425],"about_ca_topic_score_codex":0.0022456197,"about_ca_topic_score_gemma":0.0021588625,"teacher_disagreement_score":0.0079275165,"about_ca_system_score_codex":0.0021107732,"about_ca_system_score_gemma":0.0042817323,"threshold_uncertainty_score":0.027045608},"labels":[],"label_agreement":null},{"id":"W2049626594","doi":"10.1145/2016567.2016590","title":"Inverting matrices modulo regular chains","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"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":"","keywords":"Modulo; Mathematics; Arithmetic; Computer science; Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.06077053493012863,"score_gpt":0.2744791578736379,"score_spread":0.21370862294350929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049626594","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3195038,0.0011039831,0.42778513,0.0014147407,0.0011870578,0.00023958091,0.0006548382,0.0021834583,0.24592748],"genre_scores_gemma":[0.8675815,0.0011859845,0.07408727,0.0004000404,0.00083261717,0.000102928345,0.0007192553,0.00043130532,0.054659076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995067,0.00007918685,0.000025262085,0.00011106216,0.00014359741,0.0001341592],"domain_scores_gemma":[0.9991547,0.00029535836,0.00010077249,0.00020393329,0.00012753726,0.0001176625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044817288,0.0006805135,0.00050234655,0.0007823771,0.0007588081,0.0013419369,0.00041592596,0.0004107348,0.019645229],"category_scores_gemma":[0.0018866064,0.00028572953,0.00046051416,0.00070965046,0.001117384,0.0024587451,0.0017169971,0.0013952798,0.0035611535],"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.0002183266,0.00011304881,0.0005184735,0.00017686177,0.000022730528,0.00033817184,0.00040709137,0.0041682976,0.012984095,0.8906708,0.008681523,0.08170061],"study_design_scores_gemma":[0.000037184967,0.0001220727,0.00017011982,0.000045108874,0.0000139503745,0.00025960788,0.00011734769,0.014987086,0.011958809,0.95616525,0.016104547,0.000018946635],"about_ca_topic_score_codex":0.0004801121,"about_ca_topic_score_gemma":0.00091200345,"teacher_disagreement_score":0.019645229,"about_ca_system_score_codex":0.0003782232,"about_ca_system_score_gemma":0.00056702323,"threshold_uncertainty_score":0.0657199},"labels":[],"label_agreement":null},{"id":"W2050816636","doi":"10.1145/2733693.2733723","title":"Basic Polynomial Algebra Subprograms","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"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":"","keywords":"Multiplication (music); Computer science; Polynomial; Univariate; Prime (order theory); Division (mathematics); Integer (computer science); Algebra over a field; Isolation (microbiology); Variety (cybernetics); Arithmetic; Mathematics; Theoretical computer science; Programming language; Multivariate statistics; Pure mathematics; Combinatorics","score_opus":0.0583955977594663,"score_gpt":0.30028140686234356,"score_spread":0.24188580910287727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050816636","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00843213,0.001031855,0.7865816,0.0010618764,0.00034765343,0.0008214372,0.0142211765,0.054060295,0.13344194],"genre_scores_gemma":[0.14841674,0.0019817823,0.66981936,0.002003287,0.0008278203,0.0022520928,0.042406842,0.022886198,0.10940585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981395,0.00026689898,0.00014838655,0.0003738449,0.0007940504,0.00027732967],"domain_scores_gemma":[0.99820113,0.0006038048,0.00011849849,0.00035485378,0.0005987087,0.00012301966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015025731,0.0010528709,0.0011209288,0.0017633723,0.0014096824,0.00289385,0.002524711,0.0009961752,0.09021201],"category_scores_gemma":[0.004288184,0.0008874189,0.0019910804,0.0020197239,0.0012297092,0.0035535456,0.002969526,0.0033784762,0.058757223],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004947501,0.00033394326,0.0015308611,0.0013043878,0.00006460871,0.0002777219,0.00072169566,0.0053233155,0.008560897,0.5397324,0.17061028,0.27104524],"study_design_scores_gemma":[0.0001287722,0.0000966825,0.00070178113,0.00013580447,0.0000449726,0.0006571843,0.00010689996,0.021255644,0.014662473,0.4048525,0.5572916,0.00006562542],"about_ca_topic_score_codex":0.0014476149,"about_ca_topic_score_gemma":0.0014432487,"teacher_disagreement_score":0.09021201,"about_ca_system_score_codex":0.0013077211,"about_ca_system_score_gemma":0.0022118303,"threshold_uncertainty_score":0.30178928},"labels":[],"label_agreement":null},{"id":"W2053788420","doi":"10.1145/2576802.2576821","title":"Annihilating monomials with the integro-differential Weyl algebra","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Topics in Algebra","field":"Mathematics","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":"","keywords":"Annihilator; Monomial; Monomial basis; Mathematics; Polynomial ring; Weyl algebra; Differential (mechanical device); Action (physics); Polynomial; Algebraic differential equation; Algebra over a field; Ring (chemistry); Pure mathematics; Differential equation; Mathematical analysis; Physics; Ordinary differential equation","score_opus":0.06192131178506532,"score_gpt":0.33456317235436756,"score_spread":0.27264186056930223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053788420","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6432224,0.0005439949,0.3010384,0.00060432893,0.00029844054,0.000083720966,0.00018309827,0.0004129171,0.053612676],"genre_scores_gemma":[0.9645269,0.00035564823,0.021287601,0.00012005273,0.00028445345,0.000046221066,0.0001749638,0.00016113117,0.013042972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990858,0.00014907698,0.00005479583,0.00010830605,0.00040005348,0.00020203518],"domain_scores_gemma":[0.9994574,0.00008181671,0.00010917111,0.000090192916,0.000098947254,0.00016257267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010243494,0.00063466904,0.0004973879,0.0012495605,0.0011301297,0.0023602995,0.0008077891,0.00046527002,0.0036396906],"category_scores_gemma":[0.001679112,0.00031748213,0.0007511628,0.00083037344,0.0026370988,0.0038204563,0.0023044792,0.0014862954,0.00069111923],"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.000029202296,0.000025911506,0.00031219836,0.000023293762,0.00000567802,0.00014636463,0.00025729302,0.0014169671,0.0028090472,0.9911862,0.00031746094,0.0034704013],"study_design_scores_gemma":[0.000019671616,0.00008358534,0.0005407791,0.000023428378,0.00001750581,0.00046158652,0.00020732565,0.033382885,0.008771875,0.949898,0.0065521826,0.000041182368],"about_ca_topic_score_codex":0.0006287331,"about_ca_topic_score_gemma":0.0005975899,"teacher_disagreement_score":0.0036396906,"about_ca_system_score_codex":0.0006889757,"about_ca_system_score_gemma":0.0007039305,"threshold_uncertainty_score":0.012175977},"labels":[],"label_agreement":null},{"id":"W2055516972","doi":"10.1145/1823931.1823957","title":"Numerical and symbolic computation of the Lambert W function in C <sup>nxn</sup>","year":2010,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Sports Dynamics and Biomechanics","field":"Engineering","cited_by":1,"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":"","keywords":"Lambert W function; Symbolic computation; Mathematics; Maple; Scalar (mathematics); Function (biology); Applied mathematics; Computation; Newton's method; Iterative method; Matrix (chemical analysis); Algebra over a field; Algorithm; Pure mathematics; Mathematical analysis; Geometry; Nonlinear system","score_opus":0.00989188187118672,"score_gpt":0.2289620646689676,"score_spread":0.21907018279778087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055516972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011221827,0.0002758936,0.96751225,0.00021860414,0.00008842292,0.000058105084,0.000052324234,0.00059737434,0.019975126],"genre_scores_gemma":[0.19525297,0.0006203715,0.7861795,0.00016565395,0.00010193865,0.00024292497,0.00022605447,0.0006067796,0.016603924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919754,0.00016377204,0.000050282775,0.000062151244,0.0004608905,0.00006540846],"domain_scores_gemma":[0.9978002,0.0011255877,0.00015315709,0.00043585166,0.00042952696,0.000055615114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013486274,0.0007630752,0.0005451005,0.0009193281,0.0007070872,0.0019776921,0.0010594124,0.00078415434,0.0077529466],"category_scores_gemma":[0.00699283,0.00025715595,0.0005659701,0.0010574758,0.0016545187,0.0021474098,0.0010586628,0.0014852217,0.0025367492],"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.00010416994,0.00004028238,0.00057221507,0.00022160719,0.000028985241,0.00026410766,0.00027088838,0.21736106,0.012103172,0.59209865,0.0069494406,0.16998537],"study_design_scores_gemma":[0.000009959324,0.000025530639,0.0001263871,0.000031609732,0.000007770515,0.0001242557,0.000035549572,0.89674383,0.010638508,0.0814261,0.010813617,0.000016883254],"about_ca_topic_score_codex":0.0017183069,"about_ca_topic_score_gemma":0.0021386102,"teacher_disagreement_score":0.0077529466,"about_ca_system_score_codex":0.0012032698,"about_ca_system_score_gemma":0.0012390037,"threshold_uncertainty_score":0.025936246},"labels":[],"label_agreement":null},{"id":"W2058898308","doi":"10.1145/1358190.1358195","title":"Fast algorithms, modular methods, parallel approaches and software engineering for solving polynomial systems symbolically","year":2007,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"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":"","keywords":"Computer science; Modular design; Theoretical computer science; Task (project management); Software; Decomposition; Symbolic computation; Polynomial; Symbolic execution; Symbolic-numeric computation; Algorithm; Parallel computing; Mathematics; Programming language; Computation","score_opus":0.05350815632308686,"score_gpt":0.30470801981036955,"score_spread":0.2511998634872827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058898308","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004368246,0.0014077384,0.9888177,0.0004067272,0.00008820394,0.00004007173,0.000021750355,0.00038615207,0.004463362],"genre_scores_gemma":[0.0926453,0.0051233396,0.8961625,0.00020567072,0.0003550487,0.00028571277,0.00012244812,0.0003413469,0.004758632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985555,0.00040182183,0.00006006134,0.00016405825,0.0007075073,0.000111016685],"domain_scores_gemma":[0.99809474,0.0010430062,0.00015899571,0.00037913668,0.00028188026,0.00004229258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016992505,0.0013093881,0.0006907142,0.0010750766,0.000652856,0.0013253979,0.001127834,0.00078417786,0.0039936434],"category_scores_gemma":[0.006083992,0.0004930482,0.001125692,0.0017167904,0.0019339527,0.0030588547,0.0014652286,0.002136576,0.0016015673],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007112505,0.00006678133,0.00044253463,0.0004794853,0.00007879509,0.00006481675,0.00022631878,0.122010626,0.007456063,0.5919344,0.005193788,0.2719753],"study_design_scores_gemma":[0.00009099599,0.0001028313,0.00026474008,0.00010918363,0.00004912959,0.000121304794,0.000059818107,0.42344445,0.010243118,0.5310277,0.034447473,0.00003933592],"about_ca_topic_score_codex":0.0008856395,"about_ca_topic_score_gemma":0.00096881326,"teacher_disagreement_score":0.0039936434,"about_ca_system_score_codex":0.0009129446,"about_ca_system_score_gemma":0.0014878184,"threshold_uncertainty_score":0.0133600235},"labels":[],"label_agreement":null},{"id":"W2060482068","doi":"10.1145/2576802.2576810","title":"Gelfand-Kirillov dimensions of differential difference modules via Gröbner bases","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","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":"University of Manitoba","funders":"","keywords":"Differential (mechanical device); Mathematics; Pure mathematics; Algebra over a field; Physics","score_opus":0.02101367838431939,"score_gpt":0.27842197442489214,"score_spread":0.25740829604057275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060482068","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5357765,0.0023305481,0.24491517,0.0034588135,0.0005241904,0.0001139597,0.00056490727,0.00028506666,0.2120309],"genre_scores_gemma":[0.95122266,0.0006626316,0.02827469,0.0003094457,0.0003133586,0.00009519394,0.00019926626,0.00008106743,0.018841803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993679,0.0001795953,0.000027965627,0.00008881696,0.0002218825,0.00011385698],"domain_scores_gemma":[0.9991177,0.00031518194,0.00010807487,0.00008628058,0.00018087919,0.00019187437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010548547,0.0005919715,0.0005900771,0.002256023,0.0009885611,0.0024054719,0.0008814776,0.0006580932,0.0076483167],"category_scores_gemma":[0.0019797555,0.0003564359,0.0006107436,0.001074943,0.0020943596,0.004450712,0.0021074163,0.0020623764,0.00071311573],"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.000009351884,0.000011896237,0.00006678797,0.000011830142,0.0000030766855,0.000017032045,0.000097842865,0.00042840999,0.00033342338,0.996003,0.00036719936,0.0026502905],"study_design_scores_gemma":[0.000008094031,0.000009401551,0.00008748293,0.000006315504,0.0000019533347,0.000029527417,0.000024282983,0.0029232143,0.00020473878,0.99553984,0.0011589748,0.0000062162508],"about_ca_topic_score_codex":0.0005970951,"about_ca_topic_score_gemma":0.0007296685,"teacher_disagreement_score":0.0076483167,"about_ca_system_score_codex":0.0014768259,"about_ca_system_score_gemma":0.00061129517,"threshold_uncertainty_score":0.025586188},"labels":[],"label_agreement":null},{"id":"W2061177641","doi":"10.1145/1940475.1940493","title":"On sparse interpolation over finite fields","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","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":"Simon Fraser University","funders":"","keywords":"Interpolation (computer graphics); Computer science; Mathematics; Finite field; Applied mathematics; Algorithm; Artificial intelligence; Discrete mathematics","score_opus":0.05602838422521382,"score_gpt":0.28940966552503694,"score_spread":0.2333812812998231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061177641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047204673,0.002692036,0.8510282,0.0022679747,0.0009061462,0.00008918255,0.0007145379,0.0008153897,0.094281875],"genre_scores_gemma":[0.61949915,0.007509734,0.27917653,0.0010409844,0.0022733072,0.00020884318,0.0030799026,0.0007234825,0.086488076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946684,0.00019177784,0.000019548303,0.00006091209,0.00018448461,0.00007655827],"domain_scores_gemma":[0.9979658,0.0012759494,0.0000900559,0.00036658978,0.0002106589,0.00009093055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009661539,0.0006256561,0.0008834389,0.0015915063,0.00064627745,0.0007162833,0.0006600117,0.00060738664,0.016345479],"category_scores_gemma":[0.0045747478,0.00025929295,0.00040905844,0.0024863307,0.0012415425,0.002462322,0.0022623902,0.0019529476,0.0025778017],"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.00030965602,0.00008011849,0.00061948627,0.00027365203,0.00003740299,0.00014153121,0.00019279934,0.0410188,0.003328951,0.7168009,0.026066937,0.21112974],"study_design_scores_gemma":[0.000029030636,0.000073821204,0.00029852317,0.0000804421,0.0000119664155,0.0001387236,0.00006678858,0.14212655,0.0018836672,0.83441013,0.020863375,0.00001702145],"about_ca_topic_score_codex":0.0012498046,"about_ca_topic_score_gemma":0.0018674922,"teacher_disagreement_score":0.016345479,"about_ca_system_score_codex":0.00053733785,"about_ca_system_score_gemma":0.00046410706,"threshold_uncertainty_score":0.054681063},"labels":[],"label_agreement":null},{"id":"W2065726567","doi":"10.1145/1182553.1182557","title":"Construction of rankings on partial derivatives","year":2006,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Ranking (information retrieval); Mathematics; Differential (mechanical device); Order (exchange); Term (time); Relation (database); Partial derivative; Indeterminate; Algebra over a field; Pure mathematics; Computer science; Information retrieval; Mathematical analysis; Economics; Data mining; Physics","score_opus":0.02364437554622768,"score_gpt":0.2705984342591211,"score_spread":0.24695405871289344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065726567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10454675,0.0006761895,0.77539164,0.00084670604,0.00072758493,0.00032699478,0.0009786368,0.002159435,0.11434606],"genre_scores_gemma":[0.71625817,0.0007331153,0.22734825,0.000520368,0.0003311653,0.0002832461,0.0013583876,0.00096298935,0.05220426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979399,0.00045940655,0.000117632684,0.00023050961,0.0008450311,0.00040749714],"domain_scores_gemma":[0.9987967,0.00022589858,0.0000887585,0.00022519262,0.00039194853,0.00027153108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011899201,0.00072224735,0.0007400595,0.002356699,0.001847564,0.0031539614,0.0009127002,0.0006971841,0.008089861],"category_scores_gemma":[0.0023576287,0.0006132196,0.00093353435,0.0017484607,0.0021230287,0.0035081543,0.0030341777,0.0020795185,0.0028198012],"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.000019428702,0.000023174742,0.00019649448,0.00004078235,0.000007439523,0.00011229066,0.00017247788,0.0014460069,0.002382612,0.98138773,0.0018044756,0.012407168],"study_design_scores_gemma":[0.00002757694,0.000065477776,0.00030446058,0.000036606678,0.000018742046,0.00020274776,0.00021319697,0.01233012,0.0056499257,0.94215924,0.0389423,0.000049597707],"about_ca_topic_score_codex":0.00095988036,"about_ca_topic_score_gemma":0.0014887261,"teacher_disagreement_score":0.008089861,"about_ca_system_score_codex":0.0014148671,"about_ca_system_score_gemma":0.001279622,"threshold_uncertainty_score":0.02706331},"labels":[],"label_agreement":null},{"id":"W2066759926","doi":"10.1145/2768577.2768642","title":"Gelfand-Kirillov dimension of differential difference algebras","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Topics in Algebra","field":"Mathematics","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":"University of Manitoba","funders":"","keywords":"Dimension (graph theory); Differential (mechanical device); Mathematics; Pure mathematics; Algebra over a field; Physics","score_opus":0.11356785691475821,"score_gpt":0.3616636303331875,"score_spread":0.24809577341842928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066759926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5938343,0.0046431962,0.09981001,0.0048598414,0.00093427283,0.000061931336,0.00074254797,0.00028930334,0.29482463],"genre_scores_gemma":[0.9724587,0.00095701363,0.0072733895,0.00019323459,0.00029967888,0.00003480202,0.00021088099,0.00003824157,0.01853406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995776,0.00008750464,0.000018278597,0.0000649084,0.00016317255,0.000088605804],"domain_scores_gemma":[0.999027,0.00033152028,0.00012199882,0.000073836774,0.00020379738,0.00024188985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074210466,0.00035342242,0.0006896411,0.002612675,0.0012246561,0.0023530135,0.00077781465,0.0006409868,0.008655843],"category_scores_gemma":[0.0021289953,0.00021053287,0.00044975706,0.0011105218,0.0018539213,0.0041691614,0.0013355229,0.0014867244,0.0007778751],"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.000019805395,0.000010324517,0.00018655488,0.00002418021,0.000004683548,0.00002524067,0.000078338875,0.00037399717,0.0003957973,0.99489504,0.00068208267,0.0033039998],"study_design_scores_gemma":[0.000006550816,0.000006975024,0.00023212274,0.000008138485,0.0000026653029,0.000061377315,0.000032475644,0.0022666964,0.00024970982,0.9955562,0.0015702862,0.0000068363256],"about_ca_topic_score_codex":0.0007649999,"about_ca_topic_score_gemma":0.0007197898,"teacher_disagreement_score":0.008655843,"about_ca_system_score_codex":0.0018496757,"about_ca_system_score_gemma":0.0008487975,"threshold_uncertainty_score":0.028956711},"labels":[],"label_agreement":null},{"id":"W2066880569","doi":"10.1145/2576802.2576811","title":"Newton-like iteration for determinantal systems and structured low rank approximation","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":3,"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":"","keywords":"Rank (graph theory); Mathematics; Applied mathematics; Determinantal point process; Newton's method; Mathematical economics; Combinatorics; Physics; Nonlinear system; Eigenvalues and eigenvectors; Random matrix","score_opus":0.04577739578534687,"score_gpt":0.3257585690847457,"score_spread":0.27998117329939887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066880569","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01486887,0.0005934166,0.9698835,0.0004895452,0.00016684724,0.000030949235,0.00009578966,0.00027047293,0.013600565],"genre_scores_gemma":[0.51799786,0.0012401383,0.4366172,0.00035037467,0.00030919895,0.0001404368,0.00050724077,0.00047095038,0.042366605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995147,0.0002405523,0.000013970224,0.000045940124,0.00014657748,0.000038255734],"domain_scores_gemma":[0.99891245,0.0005730475,0.000103203936,0.0001692258,0.0001491461,0.00009297327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076724665,0.0004181068,0.0006196151,0.0005554693,0.00034995182,0.00083989155,0.0006735088,0.0006140033,0.004854141],"category_scores_gemma":[0.0049861385,0.00023709754,0.0004146346,0.000626298,0.0013774,0.0010746825,0.0011641136,0.0014821627,0.0013571713],"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.000114562376,0.00006270811,0.00048539863,0.00019166055,0.000039608316,0.00010182181,0.0001680895,0.14633027,0.0027080267,0.7790573,0.012236769,0.058503773],"study_design_scores_gemma":[0.000009327104,0.00002429442,0.0000957116,0.000013585386,0.0000038149565,0.000043985685,0.00001766941,0.6979051,0.0006583943,0.29761708,0.0036006877,0.000010322254],"about_ca_topic_score_codex":0.0014558558,"about_ca_topic_score_gemma":0.0025560241,"teacher_disagreement_score":0.004854141,"about_ca_system_score_codex":0.0004906778,"about_ca_system_score_gemma":0.00075136253,"threshold_uncertainty_score":0.016238749},"labels":[],"label_agreement":null},{"id":"W2067308523","doi":"10.1145/2016567.2016570","title":"Rounding coefficients and artificially underflowing terms in non-numeric expressions","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"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":"","keywords":"Rounding; Irrational number; Monomial; Mathematics; Point (geometry); Invariant (physics); Rational number; Discrete mathematics; Applied mathematics; Computer science","score_opus":0.08829774085748635,"score_gpt":0.3313756011568825,"score_spread":0.24307786029939618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067308523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08502964,0.0003768393,0.8950648,0.0011660287,0.0004636797,0.000066150606,0.000048122056,0.0009149183,0.016869782],"genre_scores_gemma":[0.5276054,0.00059717335,0.4607891,0.00057688303,0.0003672537,0.000119825076,0.00009056644,0.0012390978,0.008614687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955584,0.0012003417,0.00032056475,0.0005020077,0.0020474228,0.000371186],"domain_scores_gemma":[0.9927771,0.0025706668,0.00070366176,0.0031911347,0.0006338584,0.00012358277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041402057,0.00090720906,0.00081587426,0.00090493157,0.0010388136,0.002850118,0.0016000972,0.00063675264,0.0043237642],"category_scores_gemma":[0.024928516,0.0005042432,0.00082537514,0.00090409047,0.0045728306,0.004449368,0.0036645562,0.0029208115,0.001323616],"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.00033815965,0.000043828248,0.0011636023,0.00022494838,0.000032957832,0.0004934399,0.0011092402,0.02997094,0.018125188,0.8707217,0.0021089837,0.07566697],"study_design_scores_gemma":[0.0000842913,0.00018494467,0.00062505977,0.0001951796,0.000090969465,0.00053088163,0.00054503477,0.11330944,0.061877012,0.78349507,0.03897212,0.0000899593],"about_ca_topic_score_codex":0.0003829963,"about_ca_topic_score_gemma":0.0005065485,"teacher_disagreement_score":0.0043237642,"about_ca_system_score_codex":0.00084460573,"about_ca_system_score_gemma":0.0007145951,"threshold_uncertainty_score":0.021895826},"labels":[],"label_agreement":null},{"id":"W2067400984","doi":"10.1145/1394042.1394099","title":"On the functional decomposition of multivariate laurent polynomials (abstract only)","year":2008,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","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":"","keywords":"Univariate; Mathematics; Monomial; Laurent polynomial; Degree (music); Polynomial; Multivariate statistics; Decomposition; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Statistics; Mathematical analysis","score_opus":0.05435184648983851,"score_gpt":0.29881568433017414,"score_spread":0.24446383784033562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067400984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047368146,0.00030941743,0.9438465,0.00020894206,0.00006716006,0.000027511825,0.00012449436,0.00028385347,0.007763957],"genre_scores_gemma":[0.38178185,0.00090727006,0.6025114,0.00018344923,0.00029514835,0.00007198583,0.00082976994,0.0005054483,0.012913705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999627,0.000087915745,0.000015349728,0.00007308761,0.00014891995,0.00004761552],"domain_scores_gemma":[0.9993104,0.00027366466,0.000065683394,0.00013285455,0.00015795881,0.00005953165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097415654,0.00056544546,0.0004588742,0.00084590376,0.00058484555,0.0008737676,0.000575394,0.00025461818,0.0040726396],"category_scores_gemma":[0.0027955237,0.00020636483,0.00043336992,0.0013260046,0.0010169308,0.0014735353,0.0007068218,0.0009136434,0.0014030228],"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.0002588179,0.000069537695,0.0016098662,0.00019198882,0.000025178615,0.0002395982,0.00026536788,0.0495932,0.013231012,0.56941086,0.0079615535,0.35714307],"study_design_scores_gemma":[0.000022294029,0.00009092386,0.00087725196,0.00004890676,0.000025519164,0.0003417702,0.0000893008,0.32571247,0.012895319,0.6429447,0.016920533,0.000031083444],"about_ca_topic_score_codex":0.0009222628,"about_ca_topic_score_gemma":0.0009908675,"teacher_disagreement_score":0.0040726396,"about_ca_system_score_codex":0.00042192207,"about_ca_system_score_gemma":0.00034205872,"threshold_uncertainty_score":0.0136243105},"labels":[],"label_agreement":null},{"id":"W2068228420","doi":"10.1145/2016567.2016582","title":"Root lifting techniques and applications to list decoding","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","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":"","keywords":"Root (linguistics); Series (stratigraphy); Mathematics; Decoding methods; Polynomial; Root-finding algorithm; Algorithm; Discrete mathematics; Algebra over a field; Applied mathematics; Computer science; Combinatorics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.05913432196443307,"score_gpt":0.30342949215306286,"score_spread":0.24429517018862978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068228420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019051734,0.00041594522,0.96881837,0.000510532,0.0001372249,0.00005780263,0.0000572989,0.0008269957,0.010124159],"genre_scores_gemma":[0.2495137,0.0015746997,0.7244535,0.00034801132,0.00034378664,0.00015714907,0.00023860711,0.0005305236,0.022840066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994153,0.00015405622,0.00003475512,0.00006713839,0.00023929653,0.00008938814],"domain_scores_gemma":[0.9993105,0.00031732372,0.000048835092,0.00019337858,0.000099633944,0.000030360565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062727294,0.0007780908,0.0007349177,0.0012595226,0.00080399786,0.0012456373,0.0010107085,0.00093162974,0.0066661295],"category_scores_gemma":[0.0033737493,0.00036849317,0.00090478634,0.0013939675,0.0013213545,0.0019172865,0.0028083634,0.0022864377,0.0030774625],"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.00012850823,0.00009260834,0.00038597186,0.00015456589,0.00002851641,0.00023078927,0.0005086566,0.048801538,0.019724276,0.61675286,0.004740755,0.30845088],"study_design_scores_gemma":[0.000057683254,0.000114516275,0.00019683407,0.0000627917,0.000029778777,0.0004168913,0.000117306656,0.40346158,0.0240359,0.5493813,0.022067014,0.000058343398],"about_ca_topic_score_codex":0.00070986926,"about_ca_topic_score_gemma":0.0009909794,"teacher_disagreement_score":0.0066661295,"about_ca_system_score_codex":0.0006205243,"about_ca_system_score_gemma":0.00065271696,"threshold_uncertainty_score":0.022300422},"labels":[],"label_agreement":null},{"id":"W2071215756","doi":"10.1145/2768577.2768654","title":"Unwinding paths on the Riemann sphere for continuous integrals of rational functions","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Meromorphic and Entire Functions","field":"Mathematics","cited_by":2,"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":"","keywords":"Riemann sphere; Mathematics; Riemann hypothesis; Pure mathematics; Mathematical analysis; Riemann surface","score_opus":0.22288578999283049,"score_gpt":0.35557246063029074,"score_spread":0.13268667063746026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071215756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28832555,0.001492319,0.5559059,0.0019523026,0.00087893923,0.0001290843,0.00048115986,0.0015451763,0.14928955],"genre_scores_gemma":[0.8365016,0.0015808443,0.11156869,0.00045379472,0.000348308,0.000100449695,0.0006110478,0.0012358576,0.047599345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873084,0.00028297433,0.00006836469,0.00024226871,0.00041076043,0.00026484166],"domain_scores_gemma":[0.99596477,0.0024335994,0.00019938003,0.0007019937,0.0004249544,0.00027536988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015019759,0.00084924034,0.00081882614,0.0027659892,0.0017594729,0.0035169085,0.00096850033,0.0013907898,0.015824242],"category_scores_gemma":[0.008360743,0.0005681674,0.0011914156,0.0016721936,0.0031494983,0.0080033615,0.0050312155,0.0042855497,0.0030053286],"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.000046211946,0.00001881772,0.00015289837,0.00003668147,0.0000056643253,0.000121545985,0.00031261725,0.00086098234,0.0006781512,0.9846777,0.0013536926,0.011735127],"study_design_scores_gemma":[0.000008352704,0.000009978151,0.00007264596,0.000015493039,0.000003724927,0.00006535939,0.00007426962,0.001894776,0.00068355,0.9930749,0.0040899087,0.00000707289],"about_ca_topic_score_codex":0.0007515369,"about_ca_topic_score_gemma":0.0006092431,"teacher_disagreement_score":0.015824242,"about_ca_system_score_codex":0.0012846568,"about_ca_system_score_gemma":0.00080436835,"threshold_uncertainty_score":0.05293733},"labels":[],"label_agreement":null},{"id":"W2075789590","doi":"10.1145/1940475.1940490","title":"Cache friendly sparse matrix-vector multiplication","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","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":"University of Lethbridge; Western University","funders":"","keywords":"Multiplication (music); Computer science; Matrix multiplication; Kernel (algebra); Sparse matrix; Parallel computing; Column (typography); Cache; Matrix (chemical analysis); Conjugate gradient method; Cache-oblivious algorithm; CPU cache; Algorithm; Computational complexity theory; Cache algorithms; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.05468255262939944,"score_gpt":0.2969070496063049,"score_spread":0.24222449697690543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075789590","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07604027,0.00078361225,0.9089192,0.00033044931,0.00014102984,0.00006289717,0.00031690646,0.0048198216,0.008585693],"genre_scores_gemma":[0.52992636,0.00037836257,0.4610367,0.0001423951,0.00010506649,0.0001393544,0.0007690444,0.00037628732,0.007126393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920136,0.0001749927,0.000044878714,0.000069394795,0.00041692663,0.00009248629],"domain_scores_gemma":[0.99756,0.00081095396,0.00017387186,0.0007157234,0.0006516269,0.00008772409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004673296,0.00049126626,0.0006403344,0.00052021275,0.0006105533,0.0008239744,0.0009875054,0.0004932008,0.004894355],"category_scores_gemma":[0.0042666337,0.00022036818,0.0002479874,0.0013255292,0.00033389192,0.0015201372,0.0010429318,0.00070780556,0.0018264541],"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.0011569023,0.0002709266,0.0043575265,0.00042270782,0.00010718324,0.00050094665,0.000294527,0.26522908,0.057850976,0.07914682,0.03542125,0.5552412],"study_design_scores_gemma":[0.000043605287,0.00012743521,0.0004061633,0.000013128541,0.0000109701,0.00014911834,0.000037389564,0.9563692,0.016636202,0.019621778,0.006570227,0.000014756972],"about_ca_topic_score_codex":0.0022344335,"about_ca_topic_score_gemma":0.0060560894,"teacher_disagreement_score":0.004894355,"about_ca_system_score_codex":0.00040242384,"about_ca_system_score_gemma":0.0012645653,"threshold_uncertainty_score":0.016373217},"labels":[],"label_agreement":null},{"id":"W2076347651","doi":"10.1145/2733693.2733702","title":"Zigzag Form over Families of Parametric Matrices","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Complexity and Algorithms in Graphs","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":true,"ca_institutions":"Western University","funders":"","keywords":"Citation; Zigzag; Computer science; Library science; Genealogy; History; Archaeology","score_opus":0.07643292070875024,"score_gpt":0.320113334141787,"score_spread":0.24368041343303676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076347651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13762975,0.0013238518,0.5241225,0.002682423,0.0014156725,0.0001800144,0.0010703563,0.0015236083,0.3300519],"genre_scores_gemma":[0.7359428,0.0016869601,0.114408,0.0010930407,0.0009895265,0.0002307375,0.0012579783,0.001005958,0.14338502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942786,0.00014764049,0.000033764944,0.00013319889,0.00016761624,0.00008996243],"domain_scores_gemma":[0.999141,0.00022773814,0.00009512144,0.00020946874,0.00021381679,0.000112822236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000515836,0.00047281996,0.00040638848,0.0010837885,0.0012801144,0.0017933513,0.0005196636,0.00060604105,0.036997832],"category_scores_gemma":[0.002081433,0.0002930684,0.0005720864,0.0013207644,0.0011329429,0.0032412028,0.0017616198,0.0014323368,0.0078352485],"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.000055542187,0.0000143257885,0.00018912827,0.000045783276,0.0000048468205,0.00013741737,0.00022827023,0.001681315,0.0014649852,0.95329607,0.011873105,0.03100925],"study_design_scores_gemma":[0.0000072656094,0.000031430907,0.00016150888,0.000021592774,0.0000042219367,0.00027800378,0.000118591415,0.005426829,0.0008876879,0.95031166,0.042736024,0.000015210565],"about_ca_topic_score_codex":0.00055735366,"about_ca_topic_score_gemma":0.0007502292,"teacher_disagreement_score":0.036997832,"about_ca_system_score_codex":0.00059090497,"about_ca_system_score_gemma":0.00038688665,"threshold_uncertainty_score":0.12377006},"labels":[],"label_agreement":null},{"id":"W2076398485","doi":"10.1145/1394042.1394103","title":"Efficient order basis computation (abstract only)","year":2008,"lang":"en","type":"article","venue":"ACM communications in computer algebra","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":"University of Waterloo","funders":"","keywords":"Basis (linear algebra); Computation; Mathematics; Polynomial basis; Matrix (chemical analysis); Reduction (mathematics); Order (exchange); Interpolation (computer graphics); Basis function; Computer science; Applied mathematics; Algorithm; Mathematical analysis; Geometry; Artificial intelligence","score_opus":0.038041249625672124,"score_gpt":0.2937833124075733,"score_spread":0.2557420627819012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076398485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022521654,0.0002975815,0.9232565,0.00031546724,0.0003541837,0.000111078094,0.0010379266,0.009308134,0.042797472],"genre_scores_gemma":[0.38569444,0.00041091064,0.54807484,0.00027337202,0.00028472478,0.00018660388,0.0046616993,0.0033830274,0.05703038],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995265,0.00006221151,0.000021657708,0.00006863756,0.00023942588,0.00008159297],"domain_scores_gemma":[0.99944264,0.00007545123,0.000017212478,0.00025998036,0.00017058125,0.00003420623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003035942,0.0007155801,0.00085465744,0.0009535595,0.00068660284,0.0016134706,0.00087562826,0.00044612563,0.037751738],"category_scores_gemma":[0.0015768958,0.00033799603,0.0008003558,0.0012131279,0.00050543103,0.0017452867,0.001811646,0.0011150854,0.015980223],"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.00038033084,0.000107922686,0.0007390252,0.00039514108,0.00006182443,0.000282739,0.00021503761,0.027548607,0.02108843,0.39411455,0.08518197,0.46988454],"study_design_scores_gemma":[0.00009966366,0.00009324522,0.0005278531,0.000067180714,0.00003370792,0.00033050004,0.00008999749,0.3556804,0.049451355,0.49172786,0.10184545,0.000052803814],"about_ca_topic_score_codex":0.0010607763,"about_ca_topic_score_gemma":0.0024666754,"teacher_disagreement_score":0.037751738,"about_ca_system_score_codex":0.00048796224,"about_ca_system_score_gemma":0.0007290929,"threshold_uncertainty_score":0.12629211},"labels":[],"label_agreement":null},{"id":"W2081252282","doi":"10.1145/1940475.1940483","title":"Cache complexity and multicore implementation for univariate real root isolation","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"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":"","keywords":"Computer science; Isolation (microbiology); Multi-core processor; Univariate; Parallel computing; Cache; Root (linguistics); Theoretical computer science; CPU cache; Computer architecture; Multivariate statistics; Machine learning","score_opus":0.13294683543674232,"score_gpt":0.36146923933304537,"score_spread":0.22852240389630304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081252282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85062057,0.0018424768,0.13207969,0.0009103059,0.00010675276,0.0000541072,0.00022855293,0.0017107928,0.012446782],"genre_scores_gemma":[0.9464196,0.0002655276,0.05031211,0.000098545876,0.00003649412,0.000052982497,0.00019785174,0.00009525623,0.0025216944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891293,0.0001695176,0.00007084568,0.00014700412,0.00043845174,0.00026129154],"domain_scores_gemma":[0.99724764,0.0013646865,0.00028355504,0.000540816,0.00046179496,0.00010143496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070030254,0.00036050842,0.00034418495,0.00058888237,0.0007030158,0.0013256043,0.0013898569,0.0004404171,0.003466079],"category_scores_gemma":[0.0041162833,0.00023222627,0.00029049965,0.0013397473,0.00049295893,0.00223736,0.0007224297,0.00081308454,0.00032471682],"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.0021474054,0.0008558545,0.027070118,0.00068119494,0.0002664539,0.00066315214,0.00085121236,0.32733488,0.11825485,0.12027333,0.015756339,0.38584524],"study_design_scores_gemma":[0.00004745106,0.00022339038,0.0022272838,0.000025405894,0.000057290094,0.000118572054,0.00013147255,0.94644594,0.029926175,0.018194372,0.002575585,0.000026993566],"about_ca_topic_score_codex":0.0038766004,"about_ca_topic_score_gemma":0.011307227,"teacher_disagreement_score":0.0038766004,"about_ca_system_score_codex":0.0016991041,"about_ca_system_score_gemma":0.001903579,"threshold_uncertainty_score":0.0123279095},"labels":[],"label_agreement":null},{"id":"W2087700323","doi":"10.1145/1838599.1838602","title":"LU factoring of non-invertible matrices","year":2010,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":19,"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":"","keywords":"Factoring; Invertible matrix; Rank (graph theory); Extension (predicate logic); Mathematics; Matrix (chemical analysis); Basis (linear algebra); Fraction (chemistry); Computation; Algebra over a field; Computer science; Algorithm; Pure mathematics; Combinatorics; Programming language","score_opus":0.02447850481722616,"score_gpt":0.2936675261053943,"score_spread":0.26918902128816813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087700323","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069732754,0.00020921114,0.9880966,0.000059695434,0.00006284378,0.000024764942,0.000064438944,0.00051212363,0.0039970474],"genre_scores_gemma":[0.27195984,0.0009311495,0.7092828,0.00033711785,0.00036089803,0.00016939423,0.0005759824,0.0007606431,0.015622106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878865,0.00028304415,0.00009434792,0.00025314538,0.00044317567,0.00013774988],"domain_scores_gemma":[0.9977003,0.0006761908,0.00020208428,0.0006507156,0.00067491835,0.00009577838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000945052,0.0009990133,0.0006086401,0.0010332316,0.00054169603,0.0016404822,0.0005713497,0.0004890432,0.007915735],"category_scores_gemma":[0.0065851226,0.00028395292,0.0006179279,0.00086592615,0.0017916843,0.002904214,0.0014304952,0.0011953857,0.0030249446],"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.0002275422,0.000052198622,0.0007131659,0.00028499006,0.000034641966,0.0003123938,0.00078076636,0.032081433,0.027552558,0.6541434,0.008084574,0.27573234],"study_design_scores_gemma":[0.000043405093,0.0002970551,0.0004298199,0.00012963782,0.000030018871,0.0006678712,0.0002731389,0.20172437,0.054059077,0.6812697,0.060976375,0.00009947983],"about_ca_topic_score_codex":0.00086106063,"about_ca_topic_score_gemma":0.0009018871,"teacher_disagreement_score":0.007915735,"about_ca_system_score_codex":0.00041040423,"about_ca_system_score_gemma":0.0005552822,"threshold_uncertainty_score":0.026480794},"labels":[],"label_agreement":null},{"id":"W2090885898","doi":"10.1145/2733693.2733698","title":"A Truncated Fourier Transform middle product","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":2,"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; University of Waterloo","funders":"","keywords":"Product (mathematics); Fast Fourier transform; Power–delay product; Mathematics; Fourier transform; Polynomial; Fourier series; Multiplication (music); Power (physics); Computer science; Algorithm; Combinatorics; Mathematical analysis; Physics; Power consumption; Geometry","score_opus":0.15501080625201058,"score_gpt":0.3264301351854981,"score_spread":0.17141932893348755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090885898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056522577,0.00016974975,0.9864885,0.00011206022,0.00017501815,0.00003080087,0.000055146582,0.00085554103,0.006460948],"genre_scores_gemma":[0.13047627,0.00037411577,0.84907174,0.0002825697,0.00024801027,0.00010352271,0.00034244714,0.00060509844,0.018496292],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987569,0.00016077104,0.00006631363,0.00022664611,0.0006689332,0.00012050362],"domain_scores_gemma":[0.9986902,0.00029271055,0.000077798744,0.00037207073,0.00048402516,0.00008324219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006366,0.0009993608,0.00086824445,0.0010006703,0.0008071536,0.0025316086,0.0014539555,0.0012089014,0.017001742],"category_scores_gemma":[0.0042513437,0.000371843,0.0010137439,0.0011290379,0.0013333643,0.004003275,0.0020133483,0.001806141,0.0071067405],"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.00067116425,0.000098438744,0.00056968146,0.00017757136,0.000069337104,0.0006053059,0.0002834783,0.039581425,0.061663263,0.422387,0.01212048,0.4617729],"study_design_scores_gemma":[0.00009407779,0.000405566,0.00039735655,0.000103163555,0.00007211502,0.0014575168,0.00012377926,0.58024365,0.10090574,0.2407857,0.075299196,0.00011218906],"about_ca_topic_score_codex":0.0009473704,"about_ca_topic_score_gemma":0.00087207253,"teacher_disagreement_score":0.017001742,"about_ca_system_score_codex":0.00075414794,"about_ca_system_score_gemma":0.0012894786,"threshold_uncertainty_score":0.05687654},"labels":[],"label_agreement":null},{"id":"W2102483896","doi":"10.1145/1151446.1151453","title":"Symbolic computation of Fenchel conjugates","year":2006,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Subderivative; Conic optimization; Convex analysis; Convex optimization; Proper convex function; Mathematical optimization; Mathematics; Optimization problem; Computation; Computer science; Linear matrix inequality; Symbolic regression; Regular polygon; Algorithm; Genetic programming; Artificial intelligence","score_opus":0.07513176899859404,"score_gpt":0.3909259048507741,"score_spread":0.3157941358521801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102483896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036575936,0.00038087709,0.9374395,0.0004085159,0.00015115016,0.000033396656,0.0001735191,0.0011048437,0.023732295],"genre_scores_gemma":[0.6264515,0.0008430484,0.3560142,0.00023478051,0.00013638102,0.0001379681,0.0004382686,0.00090239104,0.014841424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931324,0.00017603507,0.000044327036,0.00010526743,0.0002862486,0.00007484209],"domain_scores_gemma":[0.9988758,0.00059115,0.00007617256,0.00021964106,0.00019203164,0.000045070537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007132616,0.00065360684,0.0010692863,0.0014235203,0.0008503182,0.0024641566,0.0010079623,0.00084638223,0.010373883],"category_scores_gemma":[0.0068702395,0.00032694347,0.0006944153,0.0011741846,0.0020609607,0.0033457233,0.0022211908,0.001265064,0.002261525],"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.000058547357,0.000015344618,0.000402545,0.00009674246,0.000017538832,0.00020332164,0.00027607344,0.058733653,0.0020462826,0.8693966,0.003090748,0.06566253],"study_design_scores_gemma":[0.000014323157,0.000022345297,0.000113774295,0.000036724534,0.000009700159,0.0001257847,0.000089435336,0.31779376,0.0067764064,0.6584702,0.01652373,0.000023734463],"about_ca_topic_score_codex":0.00073839404,"about_ca_topic_score_gemma":0.0010241298,"teacher_disagreement_score":0.010373883,"about_ca_system_score_codex":0.0009644483,"about_ca_system_score_gemma":0.0009208118,"threshold_uncertainty_score":0.03470415},"labels":[],"label_agreement":null},{"id":"W2102702231","doi":"10.1145/1838599.1838624","title":"transalpyne","year":2010,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"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":"","keywords":"Computer science; Scripting language; Feature (linguistics); Theoretical computer science; Programming language; Function (biology); Transposition (logic); Computer program; Algorithm; Artificial intelligence","score_opus":0.038135902718204585,"score_gpt":0.2919257759695366,"score_spread":0.253789873251332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102702231","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009985232,0.00040110535,0.88563573,0.00033006602,0.0005104852,0.00017728064,0.001970968,0.06792658,0.033062562],"genre_scores_gemma":[0.23014863,0.0010505917,0.6364422,0.0019908636,0.00031867763,0.00082641304,0.0069041797,0.029457642,0.09286088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887985,0.00023972138,0.00009982397,0.0002930044,0.00035240964,0.000135201],"domain_scores_gemma":[0.99850625,0.00037287487,0.00007961923,0.0006256634,0.00031517356,0.00010033054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011864438,0.0007171828,0.00062571577,0.00047906404,0.00051825185,0.0023498712,0.0017894496,0.0005768616,0.023242114],"category_scores_gemma":[0.0025647152,0.0005439918,0.00084294507,0.00033991615,0.0012272028,0.003721567,0.0028657452,0.0023554773,0.011034647],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090086093,0.00026369203,0.003187655,0.0014886308,0.00011057233,0.0012741783,0.0015991115,0.010662916,0.045472432,0.5095278,0.08941976,0.3360924],"study_design_scores_gemma":[0.00007400083,0.00018149329,0.0006844373,0.00017718488,0.000048207618,0.0014248935,0.00015804391,0.035435077,0.05576827,0.09480735,0.8111328,0.00010837408],"about_ca_topic_score_codex":0.00069644436,"about_ca_topic_score_gemma":0.0008702928,"teacher_disagreement_score":0.023242114,"about_ca_system_score_codex":0.00044780606,"about_ca_system_score_gemma":0.0010707751,"threshold_uncertainty_score":0.07775265},"labels":[],"label_agreement":null},{"id":"W2105849952","doi":"10.1145/2429135.2429173","title":"POLY","year":2013,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Speedup; Computer science; Kernel (algebra); Scalability; Parallel computing; Overhead (engineering); Data structure; Theoretical computer science; Mathematics; Operating system; Combinatorics; Botany","score_opus":0.029636398076779175,"score_gpt":0.2762222967101013,"score_spread":0.24658589863332211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105849952","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025844453,0.00069917546,0.6310675,0.0013361595,0.0013982301,0.0001836687,0.0069213947,0.018716093,0.31383333],"genre_scores_gemma":[0.37527317,0.0010090366,0.33228964,0.001987736,0.00074124266,0.0006353664,0.020394318,0.007635602,0.26003394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916875,0.00007078904,0.000048191145,0.0002398955,0.00032852456,0.0001438623],"domain_scores_gemma":[0.99925333,0.000077807665,0.000050622057,0.00030789644,0.00024106966,0.00006919512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027108792,0.000585485,0.00050973945,0.00079402834,0.001060103,0.0025634982,0.0010598439,0.00040873827,0.09005038],"category_scores_gemma":[0.0014385285,0.00025955908,0.00059776765,0.0010497711,0.0005795534,0.0027069345,0.00287085,0.0012497385,0.041162044],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040945283,0.00015220615,0.0017667104,0.00033206018,0.000040850446,0.00039026712,0.00020290003,0.008787625,0.01272451,0.5966924,0.15386869,0.22463238],"study_design_scores_gemma":[0.0000673734,0.00010149262,0.001203631,0.00006209157,0.000028903029,0.0006017917,0.00010697574,0.05325164,0.023091646,0.24198648,0.679442,0.000056125926],"about_ca_topic_score_codex":0.001424357,"about_ca_topic_score_gemma":0.0025162245,"teacher_disagreement_score":0.09005038,"about_ca_system_score_codex":0.00059629924,"about_ca_system_score_gemma":0.00086479157,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2108508505","doi":"10.1145/2644288.2644297","title":"Some definite integrals containing the Tree T function","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Sports Dynamics and Biomechanics","field":"Engineering","cited_by":3,"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":"","keywords":"Symbolic computation; Point (geometry); Mathematics; Function (biology); Order of integration (calculus); Algebra over a field; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.022727164088714332,"score_gpt":0.23580431003258367,"score_spread":0.21307714594386934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108508505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2441761,0.001147414,0.63708377,0.0013986706,0.00068593386,0.000054730714,0.00022921966,0.00064544874,0.11457884],"genre_scores_gemma":[0.89795494,0.0008221787,0.06912072,0.0004716951,0.00052289973,0.0000778875,0.00025481326,0.00060036115,0.030174496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993197,0.00015921255,0.00003590082,0.000111217196,0.0002648846,0.0001091108],"domain_scores_gemma":[0.9990441,0.0002849694,0.00015199932,0.000119526914,0.00022824701,0.00017114992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012404929,0.00069427106,0.00061108574,0.0021973837,0.0016806953,0.002631097,0.0010077218,0.0018231388,0.004757805],"category_scores_gemma":[0.0043762783,0.00031573174,0.0010068177,0.0012910548,0.0021904286,0.0040289727,0.0010309671,0.0018814695,0.0009387728],"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.000020624959,0.000011161827,0.00009225667,0.000019872698,0.000004633467,0.00022111267,0.000139722,0.0013568136,0.0009360643,0.9929569,0.0008693326,0.0033715416],"study_design_scores_gemma":[0.000012511077,0.000036499823,0.00017800227,0.000016999638,0.000007678504,0.00039820097,0.00008464809,0.02874167,0.0013232144,0.96540713,0.0037668168,0.000026670525],"about_ca_topic_score_codex":0.000742734,"about_ca_topic_score_gemma":0.00048421771,"teacher_disagreement_score":0.004757805,"about_ca_system_score_codex":0.0010363716,"about_ca_system_score_gemma":0.00069520663,"threshold_uncertainty_score":0.015916407},"labels":[],"label_agreement":null},{"id":"W2134848647","doi":"10.1145/2576802.2576804","title":"Asymptotic series of generalized Lambert W function","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Sports Dynamics and Biomechanics","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lambert W function; Generalization; Series (stratigraphy); Function (biology); Mathematics; Applied mathematics; Calculus (dental); Mathematical analysis","score_opus":0.014043769241973461,"score_gpt":0.22175665342448073,"score_spread":0.20771288418250727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134848647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12157803,0.0019246751,0.8168399,0.0011406095,0.000664673,0.000057781366,0.00014033918,0.0005659635,0.05708812],"genre_scores_gemma":[0.83080006,0.0035653068,0.11238885,0.0008779315,0.0013501544,0.00019469441,0.00028151093,0.00054389896,0.04999761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995528,0.0001391939,0.000021321583,0.00007575654,0.00014077505,0.000070131064],"domain_scores_gemma":[0.99869555,0.00041925762,0.000141706,0.00023411946,0.0003580207,0.00015144184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001301729,0.0007321977,0.00067187496,0.0020673159,0.0005963399,0.0015349896,0.0011638963,0.00098644,0.006082014],"category_scores_gemma":[0.0067463988,0.0002780967,0.0009149846,0.0010113544,0.0017672057,0.0037886307,0.0011486707,0.0019280777,0.0012771362],"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.000020321297,0.000016015027,0.00026670718,0.00006236079,0.000012726497,0.00017299196,0.000121268524,0.010663684,0.0032307385,0.9719996,0.0015635627,0.011870022],"study_design_scores_gemma":[0.000008584895,0.000035073917,0.00051795744,0.000046464775,0.000011828899,0.0003197852,0.00009107031,0.2166263,0.0017396621,0.77324593,0.007322044,0.000035263016],"about_ca_topic_score_codex":0.0006968165,"about_ca_topic_score_gemma":0.00058319484,"teacher_disagreement_score":0.006082014,"about_ca_system_score_codex":0.0006908745,"about_ca_system_score_gemma":0.0004927304,"threshold_uncertainty_score":0.020346403},"labels":[],"label_agreement":null},{"id":"W2137993616","doi":"10.1145/1504347.1504354","title":"On solving large systems of polynomial equations appearing In discrete differential geometry","year":2009,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","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":"Brock University","funders":"Freie Universität Berlin; Technische Universität Berlin","keywords":"Overdetermined system; Mathematics; Integrable system; Scalar (mathematics); Homogeneous polynomial; Polynomial; Homogeneous; Differential equation; Algebraic number; Differential algebraic geometry; Applied mathematics; Algebra over a field; Mathematical analysis; Pure mathematics; Differential algebraic equation; Matrix polynomial; Ordinary differential equation; Geometry; Combinatorics","score_opus":0.021856739043848834,"score_gpt":0.29936553565404106,"score_spread":0.27750879661019223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137993616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04445327,0.0016050237,0.9347587,0.002418915,0.00028326394,0.00014757572,0.00019370513,0.0010824398,0.015057183],"genre_scores_gemma":[0.18668571,0.0017809249,0.80086666,0.00048023064,0.0005121707,0.0002666273,0.0004778069,0.00041645858,0.008513439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986192,0.0006117837,0.000058755966,0.00014606665,0.00046890447,0.000095240015],"domain_scores_gemma":[0.99517643,0.0038793709,0.00012582631,0.00045742124,0.00023461891,0.00012624518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025887412,0.0012281009,0.0012340124,0.0007248161,0.0013161515,0.0015835712,0.00096715,0.0009170129,0.0052315607],"category_scores_gemma":[0.008856605,0.0006328998,0.00096317974,0.0013833598,0.0026868787,0.0045403233,0.0036047501,0.0029776858,0.0012531744],"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.00033423473,0.00019943893,0.0019156566,0.0011322851,0.00020823287,0.00045008402,0.0018032899,0.23036897,0.007531288,0.49968156,0.020873057,0.23550192],"study_design_scores_gemma":[0.00009081544,0.00007044817,0.00031791764,0.00004586135,0.000023333525,0.00011440113,0.00024079134,0.5259917,0.0019978075,0.45876274,0.012314196,0.000030027571],"about_ca_topic_score_codex":0.0018033604,"about_ca_topic_score_gemma":0.002911568,"teacher_disagreement_score":0.0052315607,"about_ca_system_score_codex":0.0007373502,"about_ca_system_score_gemma":0.0008590586,"threshold_uncertainty_score":0.017501295},"labels":[],"label_agreement":null},{"id":"W2158950080","doi":"10.1145/1940475.1940484","title":"Complexity and performance results for non FFT-based univariate polynomial multiplication","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","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":"","keywords":"Univariate; Computer science; Multiplication (music); Fast Fourier transform; Parallel computing; Arithmetic; Polynomial; Theoretical computer science; Algorithm; Mathematics; Multivariate statistics","score_opus":0.08529995648316663,"score_gpt":0.29066177376049873,"score_spread":0.2053618172773321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158950080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6822766,0.0035726049,0.27945456,0.0014843014,0.00015173531,0.0001223311,0.00058643933,0.0015590164,0.030792363],"genre_scores_gemma":[0.93000364,0.0010556909,0.06298095,0.00009944271,0.00023858294,0.00008252924,0.0006476652,0.00022579146,0.0046657603],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977641,0.00034757992,0.00016644003,0.0002980455,0.0010935226,0.00033035083],"domain_scores_gemma":[0.9888144,0.007904714,0.0008495682,0.001346817,0.00086504145,0.0002194253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016069233,0.0006634169,0.00065575977,0.0015430835,0.00084486377,0.0022968014,0.0014675175,0.0005175092,0.0057403157],"category_scores_gemma":[0.014431811,0.00025560183,0.00070925936,0.0027242624,0.0013607407,0.0058887852,0.0012470668,0.0013329827,0.00081965595],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029636554,0.00078449736,0.01508972,0.0010367298,0.00016230356,0.00044975593,0.00078297564,0.31899232,0.040133674,0.28443673,0.009210065,0.32595754],"study_design_scores_gemma":[0.000088089146,0.0002528546,0.0030517706,0.000031113916,0.00006128525,0.0002736864,0.00009704086,0.8797398,0.019255966,0.094528966,0.002575747,0.000043504235],"about_ca_topic_score_codex":0.0018285243,"about_ca_topic_score_gemma":0.0024965936,"teacher_disagreement_score":0.0057403157,"about_ca_system_score_codex":0.0019199875,"about_ca_system_score_gemma":0.0018297806,"threshold_uncertainty_score":0.019203246},"labels":[],"label_agreement":null},{"id":"W2168645231","doi":"10.1145/1823931.1823933","title":"A package for solving parametric polynomial systems","year":2010,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":32,"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":"","keywords":"Discriminant; Polynomial; Parametric statistics; Generalization; Univariate; Variety (cybernetics); Complement (music); Algebraic variety; Mathematics; Algebra over a field; Applied mathematics; Discrete mathematics; Pure mathematics; Algebraic number; Computer science; Mathematical analysis; Artificial intelligence; Multivariate statistics","score_opus":0.03375460156274802,"score_gpt":0.2942596164167215,"score_spread":0.2605050148539735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168645231","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005592163,0.00024529814,0.94130343,0.00012823057,0.00009901419,0.000108474225,0.0037784432,0.043910842,0.009867202],"genre_scores_gemma":[0.02141083,0.0008557902,0.91328365,0.0004117149,0.00019316077,0.001294489,0.014047868,0.018866744,0.02963575],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990934,0.00014767022,0.00007792998,0.00013375134,0.00045145,0.00009584226],"domain_scores_gemma":[0.9986945,0.0005951218,0.0000591251,0.00027227908,0.0003294109,0.000049507835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009861055,0.0019163669,0.001636532,0.0018483564,0.0006799965,0.002163067,0.002734785,0.0011282467,0.1323348],"category_scores_gemma":[0.0037171587,0.0011657437,0.002400858,0.0014182194,0.000508629,0.0027889328,0.0029548572,0.0033218057,0.054769825],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018032563,0.00019390354,0.00082743226,0.0015626502,0.00016179585,0.0005008434,0.00027858219,0.021357944,0.008793061,0.13272612,0.2647076,0.5687098],"study_design_scores_gemma":[0.00024604006,0.00011730607,0.0006914952,0.00019680192,0.00007807364,0.0010041277,0.00008945818,0.1526981,0.011360742,0.17799169,0.6554209,0.00010530944],"about_ca_topic_score_codex":0.0008306124,"about_ca_topic_score_gemma":0.0016182954,"teacher_disagreement_score":0.1323348,"about_ca_system_score_codex":0.0005448023,"about_ca_system_score_gemma":0.001022869,"threshold_uncertainty_score":0.44270402},"labels":[],"label_agreement":null},{"id":"W2168997143","doi":"10.1145/1504347.1504374","title":"The modpn library","year":2009,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University","funders":"","keywords":"Citation; Library science; Media studies; Computer science; History; Sociology","score_opus":0.024823367506232718,"score_gpt":0.2725117109034723,"score_spread":0.2476883433972396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168997143","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008850291,0.0017991193,0.33600986,0.0012607027,0.0011099962,0.00027354644,0.02405175,0.3608893,0.27372068],"genre_scores_gemma":[0.029081328,0.006279847,0.32202587,0.0027926941,0.0015672316,0.0011439876,0.08971264,0.2044961,0.34290028],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99776137,0.00026647135,0.00016822912,0.0003194727,0.0011888612,0.00029568016],"domain_scores_gemma":[0.99745435,0.00049376785,0.00010870965,0.0009543811,0.00073801476,0.00025083314],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017382536,0.0017472284,0.0017841256,0.0035023885,0.001507351,0.0053472617,0.0046427622,0.001333043,0.44039842],"category_scores_gemma":[0.008234641,0.0016853879,0.0019306018,0.0045864405,0.0008589296,0.008519782,0.006319261,0.0031756265,0.43725196],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010317509,0.00004709616,0.0002202131,0.00046750318,0.00002619192,0.00010463019,0.00009884011,0.00068505073,0.0011569402,0.031725343,0.7319833,0.23338169],"study_design_scores_gemma":[0.000038143153,0.00001887733,0.00016495113,0.00008770561,0.000010796223,0.00015664496,0.00002388324,0.0026010997,0.002179505,0.027347779,0.9673379,0.00003273096],"about_ca_topic_score_codex":0.0018213487,"about_ca_topic_score_gemma":0.0026467408,"teacher_disagreement_score":0.44039842,"about_ca_system_score_codex":0.0015333067,"about_ca_system_score_gemma":0.0028203146,"threshold_uncertainty_score":0.7982037},"labels":[],"label_agreement":null},{"id":"W2226773755","doi":"10.1145/2815111.2815165","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Computer science; Computation; Algebra over a field; Quarter (Canadian coin); Library science; Mathematics; Programming language; Pure mathematics; History","score_opus":0.1060856837289224,"score_gpt":0.34347593216693467,"score_spread":0.23739024843801226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2226773755","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004029072,0.13809901,0.027923288,0.03749376,0.22486465,0.0008396166,0.01281382,0.0020632958,0.55187345],"genre_scores_gemma":[0.012315434,0.072111376,0.011933432,0.0043867202,0.08786426,0.0006986377,0.014127527,0.0018662896,0.7946963],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99665064,0.00047908572,0.00028756316,0.00043556796,0.0019747892,0.00017245884],"domain_scores_gemma":[0.98574847,0.0018583925,0.00057514565,0.0010041983,0.007889947,0.0029238542],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032608854,0.0017195998,0.0016869177,0.006480153,0.002008229,0.006665347,0.001212328,0.0012101491,0.30960426],"category_scores_gemma":[0.014147046,0.00059391785,0.0018645561,0.0062246597,0.00079613493,0.0036430832,0.002633774,0.0037615912,0.18504319],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005266629,0.000041063286,0.00012029594,0.0005599082,0.000024077828,0.000037303955,0.000103709004,0.00015970551,0.0007038056,0.0068508815,0.9123044,0.07904212],"study_design_scores_gemma":[0.000013496895,0.00003080644,0.00045751076,0.00028240733,0.000017718949,0.00009274976,0.000080727455,0.0002224686,0.00028527036,0.005833624,0.9926704,0.000012908733],"about_ca_topic_score_codex":0.00076539145,"about_ca_topic_score_gemma":0.0011749689,"teacher_disagreement_score":0.30960426,"about_ca_system_score_codex":0.0028221325,"about_ca_system_score_gemma":0.0033907616,"threshold_uncertainty_score":0.9847657},"labels":[],"label_agreement":null},{"id":"W2242762634","doi":"10.1145/2815111.2815148","title":"An algorithm for determining actions of semisimple Lie groups on free resolutions","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Algebra and Geometry","field":"Mathematics","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":"Queen's University","funders":"","keywords":"Computer science; Algorithm; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.20104030738167808,"score_gpt":0.4182267279179784,"score_spread":0.2171864205363003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242762634","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021866187,0.0002821351,0.9589795,0.00027557474,0.00009642542,0.00029760436,0.0007526142,0.0065386733,0.010911401],"genre_scores_gemma":[0.09166073,0.0001726137,0.8973831,0.000078806515,0.00004067776,0.00022158754,0.0026646126,0.00083557307,0.0069424114],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991742,0.00013221739,0.00009233167,0.00022313271,0.0002516246,0.00012640504],"domain_scores_gemma":[0.9983935,0.0006635272,0.000080371414,0.00036606882,0.00037876546,0.00011791218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091141154,0.001229092,0.0011571451,0.002280734,0.0014984459,0.0029194162,0.0026394024,0.0015623575,0.023283573],"category_scores_gemma":[0.003449833,0.0007336445,0.0012180905,0.0021730391,0.0009301002,0.0030564114,0.003228319,0.0015816032,0.008264963],"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.0006687745,0.00034592085,0.0024570117,0.0005327477,0.00012675293,0.0003336353,0.0006123208,0.020229118,0.018015996,0.07925092,0.03546694,0.8419598],"study_design_scores_gemma":[0.0004998636,0.0003071405,0.0023240312,0.00015079186,0.00016296806,0.00076542795,0.0010202086,0.3804192,0.03157079,0.52692986,0.05569733,0.00015235909],"about_ca_topic_score_codex":0.0020019268,"about_ca_topic_score_gemma":0.004044146,"teacher_disagreement_score":0.023283573,"about_ca_system_score_codex":0.00092821504,"about_ca_system_score_gemma":0.0017063218,"threshold_uncertainty_score":0.07789129},"labels":[],"label_agreement":null},{"id":"W2269514674","doi":"10.1145/2815111.2815129","title":"Doing algebraic geometry with the RegularChains library","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","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":"","keywords":"Algebraic geometry; Algebra over a field; Computer science; Mathematics; Algebraic number; Geometry; Pure mathematics; Mathematical analysis","score_opus":0.03209267997214615,"score_gpt":0.2642245279890959,"score_spread":0.23213184801694975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269514674","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050770557,0.00041747006,0.8110626,0.0008345975,0.00043935067,0.00012007617,0.0026302657,0.0737269,0.10569163],"genre_scores_gemma":[0.18187791,0.0016851993,0.6562978,0.0005170735,0.0005829172,0.0003217049,0.012481824,0.03234228,0.11389333],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815804,0.0004428456,0.00010086436,0.00030493975,0.0007808952,0.00021229938],"domain_scores_gemma":[0.9978896,0.0005737032,0.000068201974,0.0010420842,0.00022928692,0.0001972073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016441012,0.001068435,0.0015187793,0.0019893784,0.0017676045,0.0032898947,0.0027150526,0.0006263711,0.19727059],"category_scores_gemma":[0.0039508017,0.0010942505,0.0018576364,0.0028703543,0.0015926476,0.0065212506,0.0061705587,0.0023634937,0.07737746],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050833,0.00023637738,0.0010463261,0.0006537578,0.00015383966,0.0002531641,0.0006313907,0.0059010102,0.006351621,0.34892622,0.22089691,0.41444108],"study_design_scores_gemma":[0.000214858,0.00010033577,0.00038938457,0.0001872241,0.00006660939,0.00036484966,0.00019160232,0.03248623,0.014552141,0.4499215,0.50143284,0.000092567905],"about_ca_topic_score_codex":0.0014915442,"about_ca_topic_score_gemma":0.004167663,"teacher_disagreement_score":0.19727059,"about_ca_system_score_codex":0.0009090045,"about_ca_system_score_gemma":0.0015260711,"threshold_uncertainty_score":0.65993583},"labels":[],"label_agreement":null},{"id":"W2293719789","doi":"10.1145/2733693.2733713","title":"A Relaxed Algorithm for Online Matrix Inversion","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Inversion (geology); Algorithm; Computer science; Matrix (chemical analysis); Geology; Chemistry","score_opus":0.1002151269805669,"score_gpt":0.3613357831181379,"score_spread":0.261120656137571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293719789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020606476,0.00010882554,0.9888101,0.0002763597,0.00014545908,0.00010749073,0.00020127601,0.0011604427,0.0071294326],"genre_scores_gemma":[0.059095807,0.00019307242,0.9223318,0.0004285154,0.00028616094,0.00043621578,0.0011728731,0.0009130988,0.015142504],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99669194,0.0010611201,0.00018556249,0.0004935836,0.0011747578,0.0003930565],"domain_scores_gemma":[0.99418277,0.0026669952,0.00019827385,0.0017019638,0.001017214,0.0002327446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002550916,0.0019409392,0.001415148,0.0014343604,0.001144807,0.0022573445,0.0032098151,0.0019073407,0.03701497],"category_scores_gemma":[0.014150264,0.0011154541,0.001988621,0.002042932,0.0013829916,0.00413105,0.005007708,0.004827403,0.015317362],"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.00081917085,0.00044229845,0.0005930283,0.0004171431,0.00013756352,0.00032042392,0.00033053255,0.13523363,0.009232668,0.15816589,0.07186604,0.62244165],"study_design_scores_gemma":[0.00020760969,0.0001971201,0.00025676817,0.000062250714,0.00003757578,0.0002917841,0.00012274568,0.74588966,0.0044122986,0.22436091,0.024094792,0.00006646985],"about_ca_topic_score_codex":0.0039061494,"about_ca_topic_score_gemma":0.0049716365,"teacher_disagreement_score":0.03701497,"about_ca_system_score_codex":0.00086173986,"about_ca_system_score_gemma":0.002685646,"threshold_uncertainty_score":0.1238274},"labels":[],"label_agreement":null},{"id":"W2343589186","doi":"10.1145/2850449.2850459","title":"Using sparse interpolation to solve multivariate diophantine equations","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multivariate statistics; Diophantine equation; Mathematics; Interpolation (computer graphics); Combinatorics; Prime (order theory); Ideal (ethics); Polynomial interpolation; Polynomial; Multivariate analysis; Discrete mathematics; Applied mathematics; Computer science; Statistics; Linear interpolation; Mathematical analysis; Artificial intelligence","score_opus":0.15579689585547074,"score_gpt":0.3596140019620466,"score_spread":0.20381710610657588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343589186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069420174,0.00018137532,0.9238673,0.00029254673,0.00006682156,0.000036036938,0.000073372255,0.00030136088,0.0057609994],"genre_scores_gemma":[0.54082555,0.00041240294,0.44971687,0.0001043247,0.00014787806,0.000080331236,0.00019926229,0.00013158005,0.008381671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984515,0.00003506266,0.0000054260427,0.00001986313,0.000066542634,0.000027857626],"domain_scores_gemma":[0.99968886,0.0001761177,0.000029570896,0.00004575538,0.000036362868,0.000023342787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040479144,0.00041652625,0.0006248623,0.0004429283,0.00030398867,0.00041453398,0.000544495,0.00035431812,0.0021682975],"category_scores_gemma":[0.0021196806,0.000247099,0.00042141517,0.0007220209,0.00062102283,0.00080053695,0.0011545065,0.0013115348,0.00028177284],"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.00019224925,0.000120760844,0.0019511153,0.00017486616,0.000062326966,0.00026544707,0.00028978442,0.5327175,0.010589346,0.28223893,0.00377014,0.16762751],"study_design_scores_gemma":[0.000025908263,0.00003431338,0.00014220751,0.0000071752656,0.0000066908005,0.000030738374,0.000025951143,0.9359317,0.0018907443,0.059724595,0.0021716964,0.000008342614],"about_ca_topic_score_codex":0.0018064497,"about_ca_topic_score_gemma":0.0038718325,"teacher_disagreement_score":0.0021682975,"about_ca_system_score_codex":0.00042349298,"about_ca_system_score_gemma":0.00059182936,"threshold_uncertainty_score":0.0072537065},"labels":[],"label_agreement":null},{"id":"W2345030160","doi":"10.1145/2930964.2930968","title":"Workshop on symbolic combinatorics and algorithmic differential algebra","year":2016,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","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":true,"ca_institutions":"Western University","funders":"","keywords":"Symbolic computation; Algebra over a field; Differential (mechanical device); Focus (optics); Differential algebra; Computer science; Mathematics; Pure mathematics; Physics","score_opus":0.028185824010308513,"score_gpt":0.2770596913392333,"score_spread":0.2488738673289248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345030160","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026608923,0.042858396,0.29634464,0.08490496,0.051695645,0.00035091751,0.003763351,0.0012178862,0.49225533],"genre_scores_gemma":[0.28670505,0.027783398,0.121472925,0.006935244,0.027810477,0.0004598876,0.0053427503,0.0011364887,0.52235377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979607,0.000562795,0.00011183387,0.00051276415,0.0005785281,0.00027341783],"domain_scores_gemma":[0.99778914,0.0006850715,0.000046905498,0.00032579462,0.00063582836,0.0005172644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036461584,0.0012896735,0.0012584667,0.0016210089,0.0015339303,0.0069440324,0.0019067463,0.0013478916,0.026617404],"category_scores_gemma":[0.004624614,0.000548029,0.0021688826,0.0018023992,0.0022213473,0.0045255413,0.0035367867,0.0056207534,0.00650406],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012556209,0.00010864336,0.0004046462,0.00027452898,0.00008072104,0.0002269459,0.0007385318,0.003006083,0.0019218547,0.70886797,0.21825196,0.0659925],"study_design_scores_gemma":[0.000052906653,0.00006264602,0.00054587447,0.0002241197,0.000043270815,0.00021493703,0.00019596654,0.008972422,0.0021213612,0.3590352,0.62849134,0.00003983991],"about_ca_topic_score_codex":0.002536484,"about_ca_topic_score_gemma":0.0038918066,"teacher_disagreement_score":0.026617404,"about_ca_system_score_codex":0.004531274,"about_ca_system_score_gemma":0.003934527,"threshold_uncertainty_score":0.089044094},"labels":[],"label_agreement":null},{"id":"W2410607505","doi":"10.1145/2992274.2992275","title":"Fleshing out the generalized Lambert <i>W</i> function","year":2016,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Sports Dynamics and Biomechanics","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Limoges; Simon Fraser University; Forschungszentrum Jülich","keywords":"Lambert W function; Transcendental number; Function (biology); Transcendental function; Transcendental equation; Mathematics; Algebraic number; Calculus (dental); Applied mathematics; Mathematical analysis; Differential equation","score_opus":0.024451264697318464,"score_gpt":0.24293101694948874,"score_spread":0.21847975225217028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2410607505","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052276205,0.0014049425,0.8936404,0.001886051,0.001141572,0.000033911834,0.00006719419,0.0003246969,0.049225],"genre_scores_gemma":[0.61127305,0.0037233043,0.30954984,0.0015568808,0.0012390479,0.000076281554,0.00013729148,0.0006804459,0.071763694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959224,0.00007724808,0.000030004181,0.00011032739,0.00013422583,0.000056032794],"domain_scores_gemma":[0.99946326,0.00013371793,0.000057638754,0.0001476108,0.00013623467,0.000061567735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009954106,0.0010343746,0.0006047082,0.0015317935,0.00092535495,0.0018337737,0.0012305756,0.0011505899,0.005159163],"category_scores_gemma":[0.0023976476,0.000290759,0.0010222845,0.000854427,0.002883541,0.0056235627,0.0018142634,0.003098467,0.0013590597],"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.000014755811,0.000007824819,0.00013755956,0.000056225283,0.00000959089,0.00020507754,0.00021534429,0.0021608057,0.0048160674,0.970509,0.0013566094,0.020511108],"study_design_scores_gemma":[0.0000065793542,0.00005472559,0.00020733899,0.000034409564,0.000014303539,0.0005728619,0.00015499146,0.027121877,0.0070862,0.93836546,0.026342016,0.000039313076],"about_ca_topic_score_codex":0.00066454103,"about_ca_topic_score_gemma":0.00055952265,"teacher_disagreement_score":0.005159163,"about_ca_system_score_codex":0.00071283244,"about_ca_system_score_gemma":0.00062582904,"threshold_uncertainty_score":0.017259121},"labels":[],"label_agreement":null},{"id":"W2513122423","doi":"10.1145/3055282.3055291","title":"Black box linear algebra","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Preconditioner; Matrix (chemical analysis); Computation; Algebra over a field; Linear algebra; Discrete mathematics; Algorithm; Applied mathematics; Pure mathematics; Iterative method","score_opus":0.050840463047151535,"score_gpt":0.31764888645870837,"score_spread":0.26680842341155686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513122423","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00631467,0.0030377756,0.88455266,0.0028888371,0.0013128467,0.0001097714,0.00059078494,0.0009033719,0.10028925],"genre_scores_gemma":[0.26153722,0.0051569534,0.5756717,0.002616266,0.0018796425,0.00069179706,0.0011682358,0.0008630352,0.15041515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896884,0.0003203227,0.000041696578,0.00022692869,0.0003625188,0.00007973713],"domain_scores_gemma":[0.999169,0.0002890733,0.0000420674,0.00027551153,0.0001855214,0.00003881478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014135898,0.0008184937,0.0010351918,0.00079051056,0.0010473861,0.0019485608,0.0008786739,0.000808389,0.02900848],"category_scores_gemma":[0.0027673813,0.00045349836,0.00088154944,0.0012891766,0.0018557397,0.0032410505,0.0019389578,0.0032025215,0.010692578],"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.000038516668,0.000017430983,0.00011097704,0.00009220241,0.000017907916,0.000032091986,0.00009515573,0.004378551,0.00086615817,0.93998367,0.012773795,0.041593548],"study_design_scores_gemma":[0.000019287852,0.000018998513,0.000054582943,0.00003440068,0.0000047778676,0.00003225942,0.00001595899,0.030447483,0.00074282015,0.92722815,0.041392192,0.000009084083],"about_ca_topic_score_codex":0.00082198874,"about_ca_topic_score_gemma":0.0010222095,"teacher_disagreement_score":0.02900848,"about_ca_system_score_codex":0.0010264971,"about_ca_system_score_gemma":0.000953992,"threshold_uncertainty_score":0.09704304},"labels":[],"label_agreement":null},{"id":"W2548940749","doi":"10.1145/3015306.3015311","title":"Computing limits with the regularchains and powerseries libraries","year":2016,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"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":"","keywords":"Symbolic computation; Computation; Rational function; Algebra over a field; Algebraic number; Maple; Computer science; Mathematics; Theoretical computer science; Pure mathematics; Algorithm","score_opus":0.025835854624451985,"score_gpt":0.25356021832426767,"score_spread":0.2277243636998157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548940749","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040917426,0.0004981781,0.92485195,0.0005945168,0.00012551298,0.0001087716,0.00067649764,0.013708239,0.01851893],"genre_scores_gemma":[0.5239838,0.0008571106,0.45264217,0.00035629937,0.0002807815,0.00033360324,0.00207348,0.0030073,0.016465425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99581194,0.00095310487,0.00042088766,0.00079556974,0.0016689667,0.00034946698],"domain_scores_gemma":[0.99280566,0.002357107,0.0004242861,0.0031441879,0.00080343767,0.00046530992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037178015,0.00084756373,0.0012519397,0.0030084793,0.0016235914,0.0059654303,0.0024795968,0.0010682971,0.013576683],"category_scores_gemma":[0.02109566,0.0010620625,0.0013767155,0.003049064,0.0037197978,0.024148153,0.0063687465,0.002038425,0.007022803],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045906316,0.00017376977,0.0027752433,0.00031809628,0.000070313195,0.00033303633,0.0007526377,0.02705033,0.0045343395,0.7483132,0.010402053,0.20481798],"study_design_scores_gemma":[0.000031480165,0.000043511416,0.00011835064,0.000054251006,0.000019923542,0.00011579553,0.00008833884,0.07912383,0.007099688,0.8956738,0.017593993,0.00003682321],"about_ca_topic_score_codex":0.0012723573,"about_ca_topic_score_gemma":0.0019053702,"teacher_disagreement_score":0.013576683,"about_ca_system_score_codex":0.0010316923,"about_ca_system_score_gemma":0.0016148031,"threshold_uncertainty_score":0.04541856},"labels":[],"label_agreement":null},{"id":"W2591955687","doi":"10.1145/3055282.3055287","title":"Efficient detection of hessian matrix sparsity pattern","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"China Scholarship Council","keywords":"Hessian matrix; Scalar (mathematics); Matrix (chemical analysis); Algorithm; Computer science; Sparse matrix; Graph; Mathematics; Mathematical optimization; Applied mathematics; Theoretical computer science; Physics","score_opus":0.09837801155960461,"score_gpt":0.4108543438131306,"score_spread":0.31247633225352595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591955687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04675588,0.00005979953,0.9494261,0.00015377055,0.000030231435,0.000061520564,0.00028760548,0.0016440107,0.0015811208],"genre_scores_gemma":[0.4642355,0.00010591502,0.53119457,0.00009014301,0.000032167056,0.00010689689,0.0011681387,0.0005550784,0.0025115276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991935,0.00019374429,0.00003958689,0.000112521804,0.00037401824,0.00008665541],"domain_scores_gemma":[0.99497,0.0018827994,0.00043130992,0.0011029829,0.0013801595,0.00023285806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094696914,0.00066651043,0.0007872487,0.0012651134,0.00031384826,0.00087606144,0.0008714662,0.0005706226,0.0029513498],"category_scores_gemma":[0.00985174,0.00045164052,0.0003466754,0.0009333387,0.00056758936,0.0013238607,0.001164022,0.0009442938,0.0012167188],"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.0009082488,0.0002994784,0.011570433,0.0003824078,0.00011477296,0.0005629607,0.0003197071,0.19646804,0.17838866,0.05091134,0.019640632,0.5404333],"study_design_scores_gemma":[0.000026910413,0.0000650116,0.0018781653,0.0000074475447,0.000006691648,0.000138287,0.00003435339,0.9544221,0.024369908,0.017704492,0.0013246925,0.000021919257],"about_ca_topic_score_codex":0.0015735377,"about_ca_topic_score_gemma":0.002608806,"teacher_disagreement_score":0.0029513498,"about_ca_system_score_codex":0.00032716856,"about_ca_system_score_gemma":0.0009910889,"threshold_uncertainty_score":0.009873271},"labels":[],"label_agreement":null},{"id":"W2592304289","doi":"10.1145/3055282.3055284","title":"Proof of a series solution for euler's trinomial equation","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Sports Dynamics and Biomechanics","field":"Engineering","cited_by":3,"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":"","keywords":"Transcendental function; Lambert W function; Euler's formula; Transcendental number; Series (stratigraphy); Trinomial; Mathematics; Transcendental equation; Applied mathematics; Mathematical analysis; Calculus (dental); Differential equation; Discrete mathematics","score_opus":0.04891690804353627,"score_gpt":0.28118755496651104,"score_spread":0.23227064692297478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592304289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043679845,0.0056732297,0.57708585,0.015733033,0.008288198,0.00019981655,0.0010228406,0.0010247211,0.34729242],"genre_scores_gemma":[0.60160744,0.0104468735,0.20126197,0.007934533,0.005145945,0.000588639,0.0012286743,0.0011700679,0.17061585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951017,0.00009526165,0.000037106685,0.00007795699,0.00021416848,0.00006541882],"domain_scores_gemma":[0.9989975,0.00038738322,0.00005771181,0.00007804768,0.00039953337,0.00007975905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010928665,0.0009564889,0.00075118645,0.0014648952,0.000883125,0.00082920626,0.00084247894,0.00093948044,0.018590562],"category_scores_gemma":[0.00518751,0.00030830957,0.0013645906,0.0008613343,0.0015817779,0.002336078,0.0025953946,0.0044745975,0.0032452755],"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.000013605418,0.000021081167,0.00010330876,0.00010768557,0.0000106459365,0.0002596397,0.00023242853,0.0007935464,0.0017240959,0.9738766,0.010087338,0.012770046],"study_design_scores_gemma":[0.000016559135,0.000031579635,0.00019136189,0.0000822677,0.000012988108,0.0003662158,0.00008708024,0.005558607,0.0014469785,0.94964486,0.04254158,0.000019896353],"about_ca_topic_score_codex":0.0010849837,"about_ca_topic_score_gemma":0.0008256957,"teacher_disagreement_score":0.018590562,"about_ca_system_score_codex":0.00096503296,"about_ca_system_score_gemma":0.00097010913,"threshold_uncertainty_score":0.062191665},"labels":[],"label_agreement":null},{"id":"W2592477357","doi":"10.1145/3055282.3055286","title":"Real limit points of quasi-componenets of regular chains","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","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":"","keywords":"Limit (mathematics); Mathematics; Computer science; Mathematical analysis","score_opus":0.046737191950376594,"score_gpt":0.3067473367608639,"score_spread":0.26001014481048734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592477357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7927698,0.00055244524,0.1436894,0.0005561877,0.00015778757,0.000089195215,0.00027212722,0.0002935312,0.06161945],"genre_scores_gemma":[0.94808376,0.0003938471,0.02314183,0.000085858635,0.000121096935,0.00010189725,0.00031427204,0.00018189452,0.02757559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926347,0.00013443081,0.000051463176,0.00017006423,0.00021136536,0.00016928768],"domain_scores_gemma":[0.9973515,0.0010494612,0.0003377489,0.000268546,0.0004318564,0.0005608296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010191222,0.0005405848,0.0005671989,0.0030063088,0.0021265065,0.004374629,0.001123618,0.0011327233,0.011548908],"category_scores_gemma":[0.0051082447,0.0006431475,0.00070184126,0.0012757223,0.00358395,0.004637688,0.002539445,0.002134376,0.0011708194],"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.000053054915,0.000024275674,0.00054506445,0.000029768804,0.000008684004,0.00018725694,0.0002799396,0.0010182314,0.0012901552,0.9937218,0.00027265216,0.0025690596],"study_design_scores_gemma":[0.000024586967,0.0000384134,0.00047718408,0.000037849964,0.000008574785,0.00014495892,0.00032045608,0.013117228,0.0017630449,0.981808,0.0022459533,0.000013696275],"about_ca_topic_score_codex":0.0010154388,"about_ca_topic_score_gemma":0.0016486447,"teacher_disagreement_score":0.011548908,"about_ca_system_score_codex":0.0014462176,"about_ca_system_score_gemma":0.00047728253,"threshold_uncertainty_score":0.038634956},"labels":[],"label_agreement":null},{"id":"W2594425395","doi":"10.1145/3055282.3055299","title":"Fermat benchmarks for rational expressionals in maple","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Cancer Treatment and Pharmacology","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Fermat's Last Theorem; Benchmark (surveying); Set (abstract data type); Undo; Factor (programming language); Computer science; Fermat number; Mathematics; Algebra over a field; Discrete mathematics; Programming language; Pure mathematics","score_opus":0.10578383142872837,"score_gpt":0.43353890776434156,"score_spread":0.3277550763356132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594425395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06904588,0.0021312255,0.5415829,0.001780225,0.0008303937,0.00042721344,0.009293788,0.21916401,0.15574434],"genre_scores_gemma":[0.33148283,0.0009156859,0.5845236,0.0009765397,0.00034033312,0.00072998606,0.020413797,0.03397217,0.026645077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943321,0.0012485413,0.00049784774,0.00066440215,0.0024408957,0.00081624446],"domain_scores_gemma":[0.9910657,0.004720628,0.00036158925,0.0020379538,0.001562719,0.0002513562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039490326,0.002283495,0.001370687,0.0024657864,0.0016228983,0.003987814,0.0037855403,0.0013597951,0.05397853],"category_scores_gemma":[0.019044796,0.00093869405,0.002047969,0.004191025,0.0012729622,0.0075840713,0.0031551667,0.0030764926,0.02128711],"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.0023688974,0.00054418505,0.003232754,0.0018979384,0.00013970045,0.00058201526,0.00060036563,0.026832473,0.015939446,0.23240739,0.33269385,0.38276106],"study_design_scores_gemma":[0.0009282623,0.00057704735,0.0021294234,0.00040164942,0.0001283622,0.0008140816,0.00041846585,0.33729655,0.10230051,0.2256218,0.32914302,0.00024089773],"about_ca_topic_score_codex":0.002385856,"about_ca_topic_score_gemma":0.0046473723,"teacher_disagreement_score":0.05397853,"about_ca_system_score_codex":0.0024643652,"about_ca_system_score_gemma":0.002283254,"threshold_uncertainty_score":0.1805762},"labels":[],"label_agreement":null},{"id":"W2594857936","doi":"10.1145/3055282.3055297","title":"Computing characteristic polynomials of matrices of structured polynomials","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Orthogonal polynomials; Difference polynomials; Discrete orthogonal polynomials; Classical orthogonal polynomials; Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.034678326920184695,"score_gpt":0.31711031432879794,"score_spread":0.28243198740861325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594857936","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.299455,0.00029490748,0.6860877,0.0005104486,0.00011796226,0.000099858866,0.0007025409,0.0007181896,0.012013405],"genre_scores_gemma":[0.86253995,0.00027070125,0.12901516,0.00016886227,0.0001842675,0.000055488777,0.0012396816,0.00018741918,0.0063385163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933976,0.0001014028,0.000027442788,0.00016436962,0.0002005416,0.00016659606],"domain_scores_gemma":[0.99720216,0.0013911941,0.00035557096,0.00039380908,0.00043082595,0.00022646558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053491944,0.00054971356,0.0006431178,0.0010834737,0.0005863187,0.0016328744,0.0011545429,0.0007351131,0.0057067056],"category_scores_gemma":[0.0064303563,0.00030678397,0.0005608823,0.0016600507,0.0010375861,0.004334396,0.0011338892,0.0014652063,0.0012114149],"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.0004943762,0.00030059888,0.0063484665,0.00057326467,0.00007555639,0.00067982206,0.00057790964,0.06610854,0.028713604,0.70911014,0.010643398,0.1763743],"study_design_scores_gemma":[0.000049281807,0.00017421585,0.0013625277,0.000031541585,0.00002239848,0.00045505492,0.0001941177,0.1504406,0.012335108,0.8304573,0.0044355383,0.00004219129],"about_ca_topic_score_codex":0.0007047709,"about_ca_topic_score_gemma":0.001838066,"teacher_disagreement_score":0.0057067056,"about_ca_system_score_codex":0.00063743454,"about_ca_system_score_gemma":0.00085144833,"threshold_uncertainty_score":0.019090831},"labels":[],"label_agreement":null},{"id":"W2594872624","doi":"10.1145/3055282.3055288","title":"Fibonacci-mandelbrot polynomials and matrices","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":3,"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":"","keywords":"Mandelbrot set; Fibonacci polynomials; Fibonacci number; Mathematics; Pure mathematics; Combinatorics; Eigenvalues and eigenvectors; Orthogonal polynomials; Classical orthogonal polynomials; Mathematical analysis; Fractal; Physics","score_opus":0.036627719945167544,"score_gpt":0.3367330267204845,"score_spread":0.30010530677531694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594872624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26517764,0.0025099718,0.67670214,0.0010479831,0.0003006938,0.000096143434,0.00018297773,0.0003933056,0.053589206],"genre_scores_gemma":[0.77627224,0.001201205,0.20999323,0.00020992995,0.00018961755,0.00009120519,0.00011957251,0.00009730118,0.011825741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997043,0.00007748017,0.000008064191,0.000043266158,0.00008914409,0.000077652665],"domain_scores_gemma":[0.99960977,0.00019054508,0.000058415466,0.00003844778,0.00006327637,0.000039605875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055582315,0.0004154029,0.00030020965,0.0013343589,0.001069024,0.000991733,0.00060415117,0.00090456265,0.0036719227],"category_scores_gemma":[0.0024609084,0.00023757185,0.00048048934,0.0011015324,0.0015683284,0.0015960908,0.0005138928,0.00076071225,0.0005831448],"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.000019410294,0.000011494648,0.00027799225,0.000025613794,0.0000033725626,0.000093654475,0.00010770787,0.017853836,0.0022555825,0.96979505,0.0006059903,0.00895024],"study_design_scores_gemma":[0.000018663646,0.00004582379,0.00054138066,0.000023506504,0.0000041600756,0.0002511019,0.000103504295,0.18901318,0.002902346,0.79872024,0.008342487,0.000033698558],"about_ca_topic_score_codex":0.0028169225,"about_ca_topic_score_gemma":0.002807785,"teacher_disagreement_score":0.0036719227,"about_ca_system_score_codex":0.0007159396,"about_ca_system_score_gemma":0.0006382114,"threshold_uncertainty_score":0.012283802},"labels":[],"label_agreement":null},{"id":"W2594898845","doi":"10.1145/3055282.3055289","title":"The bohemian eigenvalue project","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":11,"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":"","keywords":"Eigenvalues and eigenvectors; Bounded function; Cardinality (data modeling); Mathematics; Universality (dynamical systems); Combinatorics; Dimension (graph theory); Integer (computer science); Computer science; Mathematical analysis; Physics","score_opus":0.13766239715398093,"score_gpt":0.4142061094430495,"score_spread":0.27654371228906854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594898845","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18521398,0.0037863636,0.38783336,0.0053498736,0.0012580875,0.00014890976,0.0014021026,0.0007932154,0.41421407],"genre_scores_gemma":[0.88792825,0.0016910782,0.045159277,0.0012732563,0.0009438128,0.00026100868,0.0008155343,0.00045204224,0.061475664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998863,0.00035101757,0.00003252124,0.0002276611,0.00035788427,0.00016786068],"domain_scores_gemma":[0.9992047,0.00027701946,0.00005950095,0.0001336363,0.000161182,0.00016391429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000786192,0.00052225566,0.0005532738,0.0014081361,0.0018203683,0.0026507378,0.00071188476,0.0008168069,0.020095823],"category_scores_gemma":[0.0035240415,0.00030076684,0.00042585292,0.00075459364,0.0027678919,0.003863659,0.0032642146,0.0017168508,0.003395899],"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.000013146594,0.00000596842,0.000061061386,0.000018016623,0.0000027000629,0.000017740922,0.00009741097,0.00036637773,0.0003177552,0.9927609,0.0022875625,0.004051445],"study_design_scores_gemma":[0.0000071187405,0.000006718262,0.00013960812,0.00001177094,0.000001638074,0.000042001833,0.000046884234,0.0033620766,0.0002723335,0.98707587,0.009024994,0.000009051555],"about_ca_topic_score_codex":0.00076627237,"about_ca_topic_score_gemma":0.0003979188,"teacher_disagreement_score":0.020095823,"about_ca_system_score_codex":0.0008185378,"about_ca_system_score_gemma":0.0007992949,"threshold_uncertainty_score":0.067227244},"labels":[],"label_agreement":null},{"id":"W2614749082","doi":"10.1145/3096730.3096736","title":"An upper bound for the order of a differential algebraic variety","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","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":"McMaster University","funders":"","keywords":"Upper and lower bounds; Variety (cybernetics); Mathematics; Differential algebraic geometry; Differential (mechanical device); Context (archaeology); Algebraic number; Order (exchange); Algebraic variety; Pure mathematics; Algebra over a field; Differential equation; Differential algebraic equation; Mathematical analysis; Ordinary differential equation; Physics","score_opus":0.041479160193682495,"score_gpt":0.3243343731031736,"score_spread":0.2828552129094911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614749082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20484714,0.0060898694,0.60627156,0.0033610063,0.00064237206,0.00010498744,0.0010294772,0.002089022,0.17556459],"genre_scores_gemma":[0.8870312,0.003200713,0.08427297,0.00046842874,0.00087531336,0.00013205057,0.0010255456,0.0006650843,0.02232864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712783,0.0003139276,0.0001740221,0.000598005,0.0010821277,0.000704067],"domain_scores_gemma":[0.9890555,0.005954647,0.00046039472,0.0019241489,0.0013529263,0.0012523696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026090492,0.0012277873,0.0014384402,0.0042197774,0.0020586466,0.0054976633,0.0021236998,0.0011940332,0.008458815],"category_scores_gemma":[0.009398391,0.00074637425,0.0014506729,0.002231442,0.0043377043,0.009207843,0.0052480116,0.00583959,0.0022557685],"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.00014514777,0.00005246062,0.0016687985,0.00017572282,0.00002323368,0.00027275886,0.0003880611,0.0050963066,0.0052401647,0.96310776,0.002304116,0.021525443],"study_design_scores_gemma":[0.000018228116,0.00009812755,0.0013644336,0.0001344209,0.00006329062,0.00043680865,0.00013678378,0.021028202,0.00768217,0.95108414,0.017889269,0.0000641445],"about_ca_topic_score_codex":0.0011965215,"about_ca_topic_score_gemma":0.0013372266,"teacher_disagreement_score":0.008458815,"about_ca_system_score_codex":0.0022314843,"about_ca_system_score_gemma":0.00091178186,"threshold_uncertainty_score":0.028297603},"labels":[],"label_agreement":null},{"id":"W2614861664","doi":"10.1145/3096730.3096731","title":"Some steps to improve software information","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"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; Mathematical software; Software; Metadata; Key (lock); Citation; Software engineering; Data science; World Wide Web; Programming language; Computer security","score_opus":0.13798110445143344,"score_gpt":0.40592436147715844,"score_spread":0.26794325702572497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614861664","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0137382895,0.047174893,0.55559224,0.29339415,0.008468295,0.0014455114,0.0010057399,0.010328919,0.068852045],"genre_scores_gemma":[0.065784395,0.043764867,0.83438015,0.016633373,0.0042630294,0.00089292903,0.0035397154,0.0017433054,0.028998151],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.979961,0.0073260115,0.002484084,0.0016506973,0.0071192905,0.0014589437],"domain_scores_gemma":[0.92318547,0.018516388,0.0020009046,0.020110296,0.03318194,0.0030050203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03129962,0.0026092848,0.0016421034,0.010766392,0.0044602123,0.011285844,0.005889399,0.0073227747,0.024996439],"category_scores_gemma":[0.061140545,0.0013558697,0.0030585013,0.007309515,0.0045259558,0.040211406,0.008458447,0.010409115,0.013442647],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001452118,0.000925765,0.0032759348,0.0028243097,0.00013440812,0.00046617803,0.0022361006,0.0026895166,0.0039294316,0.23804894,0.12445901,0.6208652],"study_design_scores_gemma":[0.00010221898,0.000437493,0.0030409,0.0035201777,0.00020105543,0.0007713794,0.0033264467,0.0090252645,0.006472897,0.27809286,0.69476086,0.00024840707],"about_ca_topic_score_codex":0.007945177,"about_ca_topic_score_gemma":0.0049109133,"teacher_disagreement_score":0.03129962,"about_ca_system_score_codex":0.003716867,"about_ca_system_score_gemma":0.009398919,"threshold_uncertainty_score":0.1655302},"labels":[],"label_agreement":null},{"id":"W2615693544","doi":"10.1145/3096730.3096735","title":"Linearization of a specific family of Bézout matrices","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Mathematics and Applications","field":"Mathematics","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":"","keywords":"Sequence (biology); Linearization; Mathematics; Combinatorics; Algebra over a field; Pure mathematics; Genetics; Nonlinear system; Physics; Biology","score_opus":0.15615584852794404,"score_gpt":0.3857033953573074,"score_spread":0.22954754682936337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615693544","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5026455,0.0009027389,0.3917858,0.0014611824,0.00057685684,0.00014221919,0.0006616901,0.0011099754,0.100714035],"genre_scores_gemma":[0.910049,0.0008141836,0.036432527,0.00039138866,0.00038723336,0.00010521231,0.0007117878,0.00031668277,0.050792035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997534,0.00003987316,0.0000075087178,0.00005550711,0.00007104446,0.00007269746],"domain_scores_gemma":[0.99965036,0.00006512283,0.00006209438,0.000032551838,0.00009333452,0.000096527874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022299096,0.0005169503,0.00038141588,0.0010974036,0.0010274617,0.00097363786,0.00062598236,0.0005276944,0.011570751],"category_scores_gemma":[0.0012605451,0.00020334357,0.00049568596,0.00039411866,0.0008293216,0.0015576599,0.0006378757,0.0012881168,0.002178957],"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.00015761971,0.00008852599,0.0010430947,0.00016731331,0.000021702213,0.00057783973,0.00045936691,0.0048960084,0.022965038,0.94004583,0.00476586,0.024811866],"study_design_scores_gemma":[0.00006668555,0.0004051221,0.0019905905,0.00009207654,0.000033403263,0.0021377467,0.0006738182,0.053904057,0.023070546,0.88842845,0.0290737,0.00012384937],"about_ca_topic_score_codex":0.0007775375,"about_ca_topic_score_gemma":0.0008101383,"teacher_disagreement_score":0.011570751,"about_ca_system_score_codex":0.00056198146,"about_ca_system_score_gemma":0.00047229292,"threshold_uncertainty_score":0.03870803},"labels":[],"label_agreement":null},{"id":"W2615855543","doi":"10.1145/3096730.3096732","title":"Fast parallel multi-point evaluation of sparse polynomials","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bivariate analysis; A priori and a posteriori; Mathematics; Combinatorics; Polynomial; Value (mathematics); Point (geometry); Discrete mathematics; Algorithm; Statistics; Mathematical analysis; Geometry","score_opus":0.0969491973978745,"score_gpt":0.36617443926151,"score_spread":0.2692252418636355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615855543","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046031486,0.00044939743,0.9445193,0.00037768247,0.00013497057,0.000072551375,0.00014903735,0.0014727406,0.0067927986],"genre_scores_gemma":[0.45658174,0.00034410862,0.5315736,0.00014091683,0.0001567248,0.00013626396,0.00040921452,0.00043683176,0.010220569],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939823,0.00015174336,0.000022958395,0.00007763845,0.00026163447,0.00008776965],"domain_scores_gemma":[0.99867344,0.00064813375,0.00006562263,0.0002602914,0.00028295052,0.000069586175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001070465,0.00094431534,0.0012465239,0.0006321197,0.0006826177,0.001075031,0.0010126358,0.00065697083,0.0070276367],"category_scores_gemma":[0.0043269023,0.00036554158,0.00060816924,0.0013804033,0.00080003025,0.0021568472,0.0017223343,0.0013882931,0.0019139878],"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.0026021716,0.00021042571,0.0025072005,0.0006748103,0.00016871128,0.00075127045,0.00070486416,0.26757765,0.02570902,0.1393057,0.02299374,0.5367945],"study_design_scores_gemma":[0.00010405778,0.00011622265,0.00023870934,0.000019021543,0.0000193474,0.0001938431,0.00008224436,0.93616617,0.013676481,0.04392687,0.0054378957,0.000019158466],"about_ca_topic_score_codex":0.0017432792,"about_ca_topic_score_gemma":0.0034072143,"teacher_disagreement_score":0.0070276367,"about_ca_system_score_codex":0.00067729136,"about_ca_system_score_gemma":0.00061272894,"threshold_uncertainty_score":0.02350974},"labels":[],"label_agreement":null},{"id":"W2615873886","doi":"10.1145/3096730.3096740","title":"Finding maximum rank moment matrices by facial reduction on primal form and Douglas-Rachford iteration","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"","keywords":"Reduction (mathematics); Semidefinite programming; Rank (graph theory); Mathematics; Matrix (chemical analysis); Moment (physics); Positive-definite matrix; Mathematical optimization; Dimension (graph theory); Algorithm; Computer science; Combinatorics; Eigenvalues and eigenvectors","score_opus":0.0893228140613989,"score_gpt":0.39748519678033445,"score_spread":0.30816238271893553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615873886","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078109154,0.000037391,0.9897343,0.00008461592,0.000020799323,0.000051447998,0.00003447641,0.00022608554,0.0020000588],"genre_scores_gemma":[0.16638842,0.000101076315,0.8272465,0.00011831441,0.000048900667,0.00022254046,0.00020097975,0.00031357148,0.0053597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993967,0.000198526,0.000020812919,0.00006495511,0.0002485367,0.00007042155],"domain_scores_gemma":[0.99914384,0.0004104321,0.00006764994,0.00016415898,0.00016463138,0.000049300423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012115274,0.0010707837,0.001123633,0.0006833806,0.00053091143,0.000848687,0.0008923656,0.00085695094,0.004411707],"category_scores_gemma":[0.0036832164,0.00044383807,0.0010861218,0.00038358752,0.0015307094,0.0008807795,0.001850729,0.002237063,0.0014531569],"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.00023923324,0.00019172739,0.0008845378,0.000275679,0.000046929737,0.0002907574,0.0003766953,0.46060902,0.019918006,0.28170165,0.008110515,0.22735533],"study_design_scores_gemma":[0.000023976661,0.00008323388,0.00009589174,0.000015539068,0.000007018149,0.000061648585,0.00003239658,0.90378153,0.005008793,0.08805261,0.0028217363,0.000015615933],"about_ca_topic_score_codex":0.0013695993,"about_ca_topic_score_gemma":0.0019607926,"teacher_disagreement_score":0.004411707,"about_ca_system_score_codex":0.0006964666,"about_ca_system_score_gemma":0.0011725454,"threshold_uncertainty_score":0.014758587},"labels":[],"label_agreement":null},{"id":"W2767728188","doi":"10.1145/3338637.3338642","title":"Computing the integer points of a polyhedron","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"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":"","keywords":"Polyhedron; Integer (computer science); Integer programming; Omega; Computer science; Discrete mathematics; Combinatorics; Quantifier elimination; Constructive; Loop (graph theory); Mathematics; Algorithm; Theoretical computer science; Programming language","score_opus":0.02432456423391149,"score_gpt":0.28343462349146314,"score_spread":0.25911005925755165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767728188","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2870594,0.00029743157,0.6879304,0.00042264556,0.00013394674,0.0001307376,0.0017396471,0.0019514142,0.02033443],"genre_scores_gemma":[0.7145297,0.00022654707,0.2776482,0.0001015344,0.000069457965,0.00011666739,0.0023164682,0.0003273806,0.0046640546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988778,0.0001331798,0.000109504756,0.000257834,0.00042940507,0.00019222149],"domain_scores_gemma":[0.9970688,0.0014276296,0.00029662997,0.0005776716,0.0004816805,0.00014748708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047163203,0.000508901,0.0008001408,0.0014821627,0.00093023846,0.0025001466,0.00093864265,0.0007676336,0.008064413],"category_scores_gemma":[0.005903103,0.00047949553,0.0009111844,0.001393144,0.0018202204,0.0049576256,0.001707404,0.001441614,0.0015801896],"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.0011328467,0.00022747129,0.0155012105,0.00072290085,0.00011506013,0.0007379575,0.0011628622,0.1415055,0.025006987,0.51417714,0.009871679,0.2898383],"study_design_scores_gemma":[0.00006678342,0.00026951203,0.0024133392,0.0001308449,0.00003846191,0.00032951203,0.00063975086,0.30436447,0.021765435,0.65557086,0.014341933,0.00006905847],"about_ca_topic_score_codex":0.0016480938,"about_ca_topic_score_gemma":0.0012355996,"teacher_disagreement_score":0.008064413,"about_ca_system_score_codex":0.0005634935,"about_ca_system_score_gemma":0.00054955797,"threshold_uncertainty_score":0.026978195},"labels":[],"label_agreement":null},{"id":"W2781905375","doi":"10.1145/3177795.3177798","title":"The polyhedra library in m <scp>aple</scp>","year":2018,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","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":"","keywords":"Polyhedron; Integer (computer science); Integer programming; Combinatorics; Computer science; Presburger arithmetic; Loop (graph theory); Parametric statistics; Integer points in convex polyhedra; Discrete mathematics; Mathematics; Theoretical computer science; Algorithm; Branch and price; Programming language; Statistics","score_opus":0.02492440184752486,"score_gpt":0.27319472175174525,"score_spread":0.24827031990422038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781905375","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011200943,0.0011535054,0.5303933,0.000827979,0.0009444831,0.00021586583,0.04053056,0.27287132,0.15194297],"genre_scores_gemma":[0.025595205,0.003126663,0.49580604,0.0021522876,0.0007955965,0.0012077691,0.14835364,0.1825531,0.14040963],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970952,0.00034008524,0.0002493854,0.0005070412,0.0014908897,0.00031739817],"domain_scores_gemma":[0.9973551,0.0006137246,0.00012631986,0.0010143535,0.0007177293,0.00017284857],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015516668,0.0030155228,0.0028803125,0.0040613757,0.0019878347,0.0063760835,0.0072722835,0.0025301545,0.33631298],"category_scores_gemma":[0.005202589,0.0025815943,0.00423835,0.006134265,0.0014045059,0.0077313418,0.0057858117,0.0055209803,0.26231974],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021149483,0.00010455425,0.0003078259,0.001082476,0.00007963054,0.00015862542,0.00012717294,0.004411724,0.0032459516,0.076060414,0.75595295,0.15825717],"study_design_scores_gemma":[0.00013060312,0.00003195986,0.00021469618,0.00019543762,0.000025147068,0.00017371526,0.000033789544,0.014989339,0.007303625,0.05644928,0.92037874,0.00007366547],"about_ca_topic_score_codex":0.0046847365,"about_ca_topic_score_gemma":0.008554375,"teacher_disagreement_score":0.33631298,"about_ca_system_score_codex":0.0023897407,"about_ca_system_score_gemma":0.0023754046,"threshold_uncertainty_score":0.946669},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"not_applicable","genre":"software","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2782078086","doi":"10.1145/3177795.3177799","title":"<b>CUMODP</b>","year":2018,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"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":"","keywords":"CUDA; Computer science; Modular design; Solver; Graphics; Floating point; Integer (computer science); Modular arithmetic; Polynomial; Parallel computing; Software; Double-precision floating-point format; Computational science; Mathematics; Computer graphics (images); Programming language","score_opus":0.03904536777839753,"score_gpt":0.3033831524561591,"score_spread":0.2643377846777616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782078086","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004864326,0.0009150477,0.4402731,0.0014138288,0.0013714529,0.00025534088,0.026843494,0.35118917,0.17287429],"genre_scores_gemma":[0.0973927,0.0013006884,0.4733328,0.0038488281,0.0013089834,0.0009343243,0.09107316,0.14768252,0.183126],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891496,0.0001334716,0.0000690985,0.00018605248,0.0005266791,0.00016974506],"domain_scores_gemma":[0.99838924,0.00021673384,0.00014445739,0.00041167668,0.0006599512,0.000177902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008761725,0.0015754543,0.0008786698,0.00207899,0.0012586381,0.0029642393,0.0025304733,0.0010598893,0.19372736],"category_scores_gemma":[0.0031252673,0.00079345645,0.000883835,0.002260356,0.00073676935,0.002801461,0.0025918852,0.0020192272,0.13307174],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025775947,0.000054672346,0.0005614625,0.00033491067,0.000028330875,0.00015625985,0.00008513634,0.0017337346,0.0059016333,0.0390002,0.82883096,0.123054914],"study_design_scores_gemma":[0.00007570072,0.00004458053,0.0006435893,0.0000803229,0.000010272019,0.00030254797,0.000021813077,0.01840225,0.01972763,0.013242691,0.9473834,0.00006511797],"about_ca_topic_score_codex":0.004903679,"about_ca_topic_score_gemma":0.0058250353,"teacher_disagreement_score":0.19372736,"about_ca_system_score_codex":0.0012642533,"about_ca_system_score_gemma":0.00161398,"threshold_uncertainty_score":0.6480826},"labels":[],"label_agreement":null},{"id":"W2782150885","doi":"10.1145/3177795.3177802","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2018,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI 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":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Symbolic computation; Computation; Computer science; Quarter (Canadian coin); Algebra over a field; Library science; Mathematics; Algorithm; History; Pure mathematics","score_opus":0.06863021176894922,"score_gpt":0.3376415976700802,"score_spread":0.26901138590113094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782150885","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004021804,0.1395018,0.028494706,0.038435366,0.22935978,0.00083168375,0.012694699,0.0021051234,0.54455507],"genre_scores_gemma":[0.012704744,0.07536224,0.0125175435,0.004587814,0.09215371,0.0007104488,0.014496501,0.0019663807,0.7855007],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965791,0.0004880374,0.00029512678,0.00045179835,0.0020100896,0.00017580272],"domain_scores_gemma":[0.9854638,0.0019059344,0.00058126944,0.0010289833,0.008044225,0.0029757759],"candidate_categories":["bibliometrics","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033295995,0.0017051899,0.0016916131,0.006423134,0.0020268885,0.006724273,0.0012241754,0.0012238823,0.30893123],"category_scores_gemma":[0.01455142,0.0006003272,0.0018382584,0.0061856834,0.0008089974,0.003752047,0.0026609835,0.0038470805,0.18514183],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051351457,0.000040949813,0.00012095862,0.00056446774,0.000024236546,0.000036572364,0.00010640745,0.00016033679,0.0006865037,0.0069387266,0.9117873,0.07948223],"study_design_scores_gemma":[0.000013215998,0.000030350171,0.0004421706,0.00028182045,0.00001779698,0.000093324146,0.00008164234,0.00022149323,0.00028469006,0.0059735603,0.9925471,0.000012879291],"about_ca_topic_score_codex":0.00074564305,"about_ca_topic_score_gemma":0.0011401539,"teacher_disagreement_score":0.9935769,"about_ca_system_score_codex":0.0028189567,"about_ca_system_score_gemma":0.0034291688,"threshold_uncertainty_score":0.9857257},"labels":[],"label_agreement":null},{"id":"W2894966397","doi":"10.1145/3282678.3282680","title":"Comprehensive anti-derivatives and parametric continuity","year":2018,"lang":"en","type":"article","venue":"ACM communications in computer algebra","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":"","keywords":"Parametric statistics; Software; Computer science; Applied mathematics; Mathematics; Calculus (dental); Mathematical optimization; Programming language; Statistics","score_opus":0.039728391059332374,"score_gpt":0.30970397895029883,"score_spread":0.26997558789096643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894966397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012170793,0.00044617578,0.95280224,0.00046886603,0.00028144542,0.00002901219,0.00014756976,0.0026808397,0.030973125],"genre_scores_gemma":[0.3785431,0.0010269205,0.5868231,0.00044692043,0.00036690765,0.00009483509,0.0004262485,0.0051876665,0.027084291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987423,0.00023063227,0.000100667225,0.0001899905,0.0006374128,0.00009891371],"domain_scores_gemma":[0.9977196,0.00074979645,0.00013186749,0.0008970779,0.0003424025,0.0001592075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001775285,0.00081513566,0.00065763545,0.0012299856,0.0010321371,0.004170359,0.0016521487,0.0010324961,0.016094333],"category_scores_gemma":[0.0067564426,0.0005800378,0.00094806694,0.0010278393,0.002012059,0.005697614,0.003721873,0.002697609,0.004134879],"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.000103678125,0.000035304995,0.0005657349,0.00014928638,0.000021425367,0.0005345001,0.00037912544,0.0047507472,0.0076485123,0.90637934,0.005754312,0.073677935],"study_design_scores_gemma":[0.000022311346,0.00005081049,0.000360892,0.0000839494,0.000021064208,0.0010684594,0.00011669434,0.06058689,0.017043099,0.8451333,0.0754494,0.000063191874],"about_ca_topic_score_codex":0.00039627758,"about_ca_topic_score_gemma":0.00043318735,"teacher_disagreement_score":0.016094333,"about_ca_system_score_codex":0.00050733256,"about_ca_system_score_gemma":0.00061644614,"threshold_uncertainty_score":0.053840876},"labels":[],"label_agreement":null},{"id":"W2915542037","doi":"10.1145/2893803.2893804","title":"Jenks prize 2015 award citation","year":2016,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Library science; Thematic map; Computer science; Geography; Cartography","score_opus":0.053310550003086966,"score_gpt":0.3168423321230978,"score_spread":0.2635317821200108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915542037","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032417797,0.016809747,0.0033611127,0.097135745,0.23448254,0.0002289529,0.0073587536,0.0014000804,0.6359813],"genre_scores_gemma":[0.009506009,0.0071181715,0.0012333682,0.0051425546,0.014148413,0.00010945889,0.0050843633,0.0004878505,0.95716995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968209,0.00024509945,0.00017662862,0.00040369702,0.0015397721,0.00081386],"domain_scores_gemma":[0.9942873,0.00016596608,0.00015743621,0.00026643366,0.0020009968,0.0031218692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032871407,0.0011442183,0.001266953,0.0030540715,0.0022969248,0.007340543,0.0018542627,0.0039135055,0.23189645],"category_scores_gemma":[0.008302921,0.00040930207,0.00096760475,0.0020485353,0.00082867313,0.0031482382,0.005049073,0.0030421184,0.21592623],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037961898,0.000017866842,0.000101501835,0.00006269099,0.0000067367664,0.00003691949,0.000013017187,0.000083102925,0.00012213277,0.008742933,0.9555107,0.03526445],"study_design_scores_gemma":[0.000010864008,0.000017404118,0.000302192,0.000057506237,0.000004598308,0.000039022485,0.00001605477,0.000086702414,0.00008907012,0.0030182668,0.9963498,0.000008600648],"about_ca_topic_score_codex":0.003710481,"about_ca_topic_score_gemma":0.007420318,"teacher_disagreement_score":0.23189645,"about_ca_system_score_codex":0.004911997,"about_ca_system_score_gemma":0.00786359,"threshold_uncertainty_score":0.7757709},"labels":[],"label_agreement":null},{"id":"W2915991097","doi":"10.1145/3313880.3313893","title":"Accelerating indefinite hypergeometric summation algorithms","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Hypergeometric distribution; Mathematics; Hypergeometric function; Term (time); Rational function; Function (biology); Operator (biology); Basic hypergeometric series; Pure mathematics; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.09651014964186747,"score_gpt":0.3328344550084913,"score_spread":0.23632430536662383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915991097","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034625746,0.00056956714,0.95191866,0.00037744318,0.0001471555,0.00009055591,0.00016606915,0.0016875484,0.010417298],"genre_scores_gemma":[0.23879622,0.00038521417,0.7484146,0.00024141747,0.00019574817,0.00018418675,0.00051379594,0.00045070518,0.010818049],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991678,0.00020534148,0.000054330845,0.0001079293,0.0003439472,0.00012064313],"domain_scores_gemma":[0.99821246,0.00084337615,0.00013238017,0.00035989846,0.00034044182,0.00011151676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016950316,0.00065694796,0.0011125099,0.0012315835,0.00071035314,0.0017877095,0.0025724997,0.0009443329,0.008673796],"category_scores_gemma":[0.006060494,0.0003650716,0.0006855495,0.0015885881,0.0009235026,0.0032936605,0.0024619014,0.0013929192,0.0026885045],"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.00050322124,0.00029146564,0.002180486,0.00036570482,0.000112237045,0.00029608942,0.00040117576,0.16335839,0.009900383,0.30340558,0.012515832,0.50666946],"study_design_scores_gemma":[0.000056915847,0.000052262058,0.00017990501,0.000020749172,0.000018564686,0.00009307989,0.000035345587,0.8798076,0.0031830193,0.111094534,0.0054454394,0.000012589919],"about_ca_topic_score_codex":0.0013404799,"about_ca_topic_score_gemma":0.003219819,"teacher_disagreement_score":0.008673796,"about_ca_system_score_codex":0.0011076945,"about_ca_system_score_gemma":0.0013564581,"threshold_uncertainty_score":0.029016733},"labels":[],"label_agreement":null},{"id":"W2917622917","doi":"10.1145/3313880.3313889","title":"The SAT+CAS paradigm and the Williamson conjecture","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Conjecture; Preprint; Construct (python library); Symbolic computation; Set (abstract data type); Order (exchange); Satisfiability; Computer science; Computation; Mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Pure mathematics; Algorithm; Programming language","score_opus":0.009385561501334055,"score_gpt":0.22276111223814815,"score_spread":0.2133755507368141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917622917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15875493,0.0021815354,0.6139933,0.0153545225,0.0008441018,0.00014766608,0.0010114145,0.0007222953,0.20699035],"genre_scores_gemma":[0.8163086,0.0014280506,0.150697,0.0027075328,0.0009786966,0.0002832039,0.00085230556,0.00018270366,0.02656201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829453,0.0005399971,0.00006900871,0.00043122715,0.00042024432,0.00024499616],"domain_scores_gemma":[0.9958301,0.0026565206,0.00029040768,0.00076645444,0.00028801226,0.0001685261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015875448,0.000635026,0.00070607645,0.0013361641,0.0019506104,0.003129311,0.0015461472,0.0015380811,0.009659884],"category_scores_gemma":[0.0050078365,0.00044240063,0.0009334036,0.0016194067,0.004674462,0.008679124,0.0022529606,0.003828057,0.0013529346],"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.00002707492,0.000012070423,0.0001521158,0.000024455185,0.0000031987947,0.000025986545,0.000053038082,0.0014304669,0.00021706992,0.99145585,0.0014983374,0.005100273],"study_design_scores_gemma":[0.000007847335,0.000011123727,0.000064009575,0.000011219913,0.0000031959403,0.000039343577,0.000038643397,0.010606721,0.00034238878,0.984721,0.004148655,0.0000057710945],"about_ca_topic_score_codex":0.0020792058,"about_ca_topic_score_gemma":0.0030944645,"teacher_disagreement_score":0.009659884,"about_ca_system_score_codex":0.0016965647,"about_ca_system_score_gemma":0.001516062,"threshold_uncertainty_score":0.032315552},"labels":[],"label_agreement":null},{"id":"W2947382456","doi":"10.1145/3338637.3338639","title":"Computing isomorphisms and embeddings of finite fields","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Embedding; Automorphism; Prime (order theory); Prime power; Field (mathematics); Mathematics; Combinatorics; Discrete mathematics; Physics; Pure mathematics; Computer science","score_opus":0.021110576094278227,"score_gpt":0.2708240089321153,"score_spread":0.24971343283783706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947382456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42651886,0.0012311,0.5556735,0.0011308293,0.00019151847,0.000119052114,0.0008908555,0.0041432483,0.010101018],"genre_scores_gemma":[0.7366509,0.0005157221,0.2539853,0.00017132299,0.00019186952,0.000111566646,0.0022129787,0.000499005,0.0056614093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963522,0.00093706365,0.00039266632,0.0009356483,0.0008348071,0.0005475376],"domain_scores_gemma":[0.9904018,0.005637179,0.00072464,0.002033166,0.00068024494,0.0005229495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025692717,0.0009608627,0.0009881788,0.0024654425,0.0011824983,0.00460705,0.0020498137,0.0012074065,0.0040437505],"category_scores_gemma":[0.015211426,0.0009907396,0.0014528504,0.0030885434,0.003992864,0.015535157,0.0049394662,0.002346922,0.0010486766],"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.0007853908,0.0003635691,0.010642463,0.0005190938,0.0001399724,0.00051882904,0.0030471093,0.041324105,0.008801734,0.70703393,0.006031833,0.22079197],"study_design_scores_gemma":[0.000046237787,0.000102703416,0.00072185224,0.00006105507,0.00003526957,0.0001453757,0.00057119527,0.04798116,0.005487594,0.9392153,0.0055979537,0.000034367822],"about_ca_topic_score_codex":0.0015799649,"about_ca_topic_score_gemma":0.0018276307,"teacher_disagreement_score":0.00460705,"about_ca_system_score_codex":0.0019711102,"about_ca_system_score_gemma":0.0010851631,"threshold_uncertainty_score":0.014301479},"labels":[],"label_agreement":null},{"id":"W2947984620","doi":"10.1145/3338637.3338651","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI 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":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Symbolic computation; Computer science; Computation; Algebra over a field; Quarter (Canadian coin); Library science; Mathematics; Programming language; History; Pure mathematics","score_opus":0.0520830374533527,"score_gpt":0.3190488895562089,"score_spread":0.2669658521028562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947984620","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00392314,0.13477294,0.026926562,0.03534497,0.21844395,0.0008370032,0.0131325545,0.0019839278,0.5646349],"genre_scores_gemma":[0.010770231,0.06712144,0.011352514,0.0039037985,0.079130694,0.0006491484,0.0135649955,0.0017042799,0.8118029],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968771,0.00045267752,0.0002753954,0.00041191958,0.0018206969,0.00016224793],"domain_scores_gemma":[0.9863578,0.0017748809,0.0005465477,0.0009551626,0.0076189507,0.0027467145],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031287265,0.0017347703,0.0016944265,0.0064250855,0.0019692858,0.0066108285,0.0011848294,0.0011627121,0.31992325],"category_scores_gemma":[0.0130923195,0.0005836939,0.0018459272,0.006439924,0.00077036076,0.0034731291,0.0025158932,0.003622751,0.19200279],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005242793,0.000041642546,0.00011712827,0.0005345979,0.000022971202,0.00003597118,0.00009523505,0.00015623962,0.0007238619,0.006418326,0.91426885,0.077532694],"study_design_scores_gemma":[0.000013589541,0.000029858422,0.00046106608,0.00026291845,0.000017441462,0.00008908954,0.000078104094,0.0002333426,0.00028127304,0.0052639963,0.99325657,0.00001263133],"about_ca_topic_score_codex":0.00081420835,"about_ca_topic_score_gemma":0.0012272864,"teacher_disagreement_score":0.31992325,"about_ca_system_score_codex":0.0026990843,"about_ca_system_score_gemma":0.0033378524,"threshold_uncertainty_score":0.97004694},"labels":[],"label_agreement":null},{"id":"W2995380196","doi":"10.1145/3377006.3377021","title":"New bivariate Hensel lifting algorithm for <i>n</i> factors","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Burnaby Hospital","funders":"","keywords":"Monic polynomial; Bivariate analysis; Univariate; Mathematics; Bounded function; Degree (music); Polynomial; Algorithm; Combinatorics; Finite field; Field (mathematics); Applied mathematics; Pure mathematics; Mathematical analysis; Multivariate statistics; Physics; Statistics","score_opus":0.03193140114877477,"score_gpt":0.28122522502960706,"score_spread":0.2492938238808323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995380196","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030179227,0.00016443437,0.95779556,0.00018645388,0.00011386495,0.000120450386,0.00027818794,0.005317139,0.0058447435],"genre_scores_gemma":[0.2047127,0.00025398808,0.7838983,0.0001325918,0.00011106198,0.00014269809,0.0012223216,0.00058380974,0.008942559],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950206,0.000038189966,0.000040067574,0.000114394286,0.00017047836,0.00013479686],"domain_scores_gemma":[0.9995683,0.00005882471,0.00003304264,0.00017450476,0.00012171804,0.000043732576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004001479,0.0006951613,0.00060681236,0.0010627761,0.0007206653,0.0009319853,0.00085333886,0.00040273028,0.009876087],"category_scores_gemma":[0.0011805361,0.00034354685,0.0009382282,0.000923057,0.0005589102,0.0014828361,0.0020340707,0.0010204216,0.0038442817],"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.00044427754,0.00017032224,0.002189605,0.00027776073,0.00005582395,0.0004452782,0.00037589416,0.011359646,0.05172507,0.047197636,0.015774691,0.86998403],"study_design_scores_gemma":[0.00043512977,0.0008464604,0.0036241435,0.00017628966,0.00023255064,0.00241374,0.0007345509,0.4508897,0.25026843,0.13972948,0.15040022,0.00024937507],"about_ca_topic_score_codex":0.0019851415,"about_ca_topic_score_gemma":0.0019162537,"teacher_disagreement_score":0.009876087,"about_ca_system_score_codex":0.00048723436,"about_ca_system_score_gemma":0.0011643803,"threshold_uncertainty_score":0.033038855},"labels":[],"label_agreement":null},{"id":"W2995572343","doi":"10.1145/3377006.3377014","title":"Bit complexity for critical point computation in smooth and compact real hypersurfaces","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypersurface; Jacobian matrix and determinant; Mathematics; Extension (predicate logic); Polynomial; Projection (relational algebra); Rank (graph theory); Algebraic number; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Computer science; Mathematical analysis; Applied mathematics; Combinatorics","score_opus":0.06155402739645428,"score_gpt":0.337018664761806,"score_spread":0.2754646373653517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995572343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41826555,0.0006676275,0.5708858,0.001120527,0.000055775527,0.0001094627,0.00049199763,0.0006094832,0.0077938493],"genre_scores_gemma":[0.9477969,0.00029597682,0.048964545,0.00010042781,0.00009942624,0.00015799,0.00046554406,0.00017836984,0.0019408236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782014,0.0005077659,0.00014036614,0.0003265921,0.000810272,0.00039489317],"domain_scores_gemma":[0.98249614,0.012504843,0.0011862528,0.0021300046,0.0010637654,0.00061905826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028168757,0.0007104205,0.0012836776,0.0026431659,0.0010867092,0.0033284586,0.0017347654,0.0010060085,0.005089826],"category_scores_gemma":[0.021728128,0.00046708243,0.0009067221,0.0017012998,0.004063959,0.008239667,0.0037451393,0.0024606579,0.0005112615],"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.0007891066,0.000075340926,0.0059972014,0.00030684896,0.00007383299,0.00017284404,0.00045709682,0.1590081,0.0072077825,0.7943396,0.0026014207,0.02897087],"study_design_scores_gemma":[0.000021813801,0.00006108009,0.0009295797,0.000021263199,0.00001883998,0.000056732802,0.00004630935,0.49200144,0.0028088992,0.50337607,0.0006273398,0.00003061649],"about_ca_topic_score_codex":0.0013057546,"about_ca_topic_score_gemma":0.0010976739,"teacher_disagreement_score":0.005089826,"about_ca_system_score_codex":0.002393486,"about_ca_system_score_gemma":0.0010369716,"threshold_uncertainty_score":0.017366052},"labels":[],"label_agreement":null},{"id":"W3033090804","doi":"10.1145/3388974.3388976","title":"Maple Conference 2019","year":2020,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Geological Modeling and Analysis","field":"Earth and Planetary Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Maple; Computer science; Botany; Biology","score_opus":0.08381707205763166,"score_gpt":0.2671030068318212,"score_spread":0.18328593477418953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033090804","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004841553,0.005217965,0.030971758,0.0572209,0.036374632,0.00046591854,0.08107728,0.03421034,0.7496196],"genre_scores_gemma":[0.0153558105,0.0035140095,0.013485871,0.0047346815,0.0040482664,0.0003515751,0.08135066,0.0058234553,0.8713356],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835676,0.00025605402,0.000048593505,0.00019885389,0.0008299921,0.00030971874],"domain_scores_gemma":[0.9944852,0.00040673235,0.00012011428,0.00056343235,0.002687915,0.00173658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032191514,0.0010559597,0.0008247587,0.0025537433,0.0024048095,0.008729105,0.0020947172,0.0018010691,0.29460916],"category_scores_gemma":[0.005794011,0.000403031,0.0008648801,0.0030878054,0.0005645351,0.0043977676,0.0036428026,0.0022825522,0.21425597],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056387653,0.000012726211,0.00006650334,0.000032160842,0.0000040523987,0.000030275423,0.000016358927,0.00013140477,0.00012393677,0.0025835014,0.9828829,0.014059583],"study_design_scores_gemma":[0.000007755308,0.000007141616,0.00016085403,0.000013359241,0.0000018416431,0.000012070428,0.000019876132,0.00025506775,0.00011829218,0.0009255433,0.9984723,0.0000059568038],"about_ca_topic_score_codex":0.032952577,"about_ca_topic_score_gemma":0.055024832,"teacher_disagreement_score":0.29460916,"about_ca_system_score_codex":0.0027796426,"about_ca_system_score_gemma":0.006018339,"threshold_uncertainty_score":0.98556584},"labels":[],"label_agreement":null},{"id":"W3044525010","doi":"10.1145/3427218.3427220","title":"The Sage package comb_walks for walks in the quarter plane","year":2020,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Software package; Plane (geometry); Software; Quarter (Canadian coin); Computer science; Interface (matter); Computer graphics (images); Random walk; Operating system; Mathematics; Geometry; History","score_opus":0.08755887603188912,"score_gpt":0.34860880903658115,"score_spread":0.26104993300469204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044525010","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049232934,0.0001924711,0.88545626,0.00013453061,0.00024580504,0.00007958657,0.0054812375,0.079584256,0.023902487],"genre_scores_gemma":[0.08458189,0.00075154094,0.76678276,0.0005389053,0.0004707822,0.00087130436,0.021079382,0.06745564,0.057467736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993498,0.00011508653,0.000054564036,0.0001241008,0.00028464044,0.00007183931],"domain_scores_gemma":[0.99904627,0.00036012044,0.00006185826,0.00027043247,0.00019168489,0.00006955309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059894985,0.0011849847,0.000975712,0.0020346108,0.0006594628,0.0016594076,0.0015148,0.0006974632,0.063682094],"category_scores_gemma":[0.0028986738,0.00062301353,0.0014367055,0.0016977425,0.0005729216,0.0024731688,0.0019069194,0.0015589633,0.03054227],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002624133,0.00013268917,0.002726847,0.0006867185,0.00011128256,0.00045126234,0.0004898724,0.0067544812,0.010501602,0.36395347,0.26921266,0.34471673],"study_design_scores_gemma":[0.00014944776,0.000100047844,0.0021096799,0.00013565704,0.00006409006,0.0010309098,0.00009542927,0.08092605,0.020757027,0.4044352,0.49003285,0.00016350416],"about_ca_topic_score_codex":0.0007525213,"about_ca_topic_score_gemma":0.0016335695,"teacher_disagreement_score":0.063682094,"about_ca_system_score_codex":0.0003087013,"about_ca_system_score_gemma":0.00062311743,"threshold_uncertainty_score":0.21303785},"labels":[],"label_agreement":null},{"id":"W3045916595","doi":"10.1145/3457341.3457342","title":"Computing one billion roots using the tangent Graeffe method","year":2020,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Tangent; Degree (music); Factorization; Prime factor; Polynomial; Fast Fourier transform; Prime (order theory); Tangent vector; Combinatorics; Algorithm; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.12045959822385764,"score_gpt":0.345415546345897,"score_spread":0.22495594812203934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045916595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10474989,0.0004717348,0.8625443,0.00046829763,0.00027715124,0.000111132686,0.00075745705,0.010790598,0.019829474],"genre_scores_gemma":[0.28055447,0.00022045447,0.70527375,0.00014413125,0.0000552052,0.00012257496,0.0011223096,0.0017383582,0.010768671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993536,0.000088628956,0.000051027957,0.000106073654,0.00027195958,0.00012870262],"domain_scores_gemma":[0.99855274,0.0006682641,0.00007795714,0.00028206527,0.00035478923,0.00006414929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066536485,0.0010255357,0.0010206564,0.0015462267,0.00068328646,0.0013850697,0.0012073071,0.0009240514,0.019794345],"category_scores_gemma":[0.0055922023,0.00045228977,0.00091913366,0.0015254057,0.0008820187,0.002898594,0.001282071,0.0011579539,0.0056086476],"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.00081295107,0.00024931735,0.0042490833,0.0005783971,0.00013179934,0.0007174131,0.00067259313,0.2006971,0.027332956,0.15741867,0.034637276,0.57250243],"study_design_scores_gemma":[0.0001882227,0.00014656548,0.0006350033,0.00005979786,0.000032157408,0.00028336636,0.00021833592,0.8495409,0.021070004,0.10572547,0.022037206,0.000062911575],"about_ca_topic_score_codex":0.0035861318,"about_ca_topic_score_gemma":0.0059479782,"teacher_disagreement_score":0.019794345,"about_ca_system_score_codex":0.00087400863,"about_ca_system_score_gemma":0.0013632455,"threshold_uncertainty_score":0.066218674},"labels":[],"label_agreement":null},{"id":"W3090354659","doi":"10.1145/3427218.3427226","title":"The 2019 Richard D. Jenks memorial prize","year":2020,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Academic Publishing and Open Access","field":"Decision Sciences","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":"Simon Fraser University","funders":"","keywords":"Philosophy","score_opus":0.14274272438558078,"score_gpt":0.406016551618459,"score_spread":0.26327382723287823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090354659","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040429565,0.08261765,0.0045047305,0.19966868,0.25520918,0.00013472556,0.0051908456,0.00057120353,0.4480601],"genre_scores_gemma":[0.01412558,0.02346171,0.001335312,0.006419515,0.019026536,0.00004243896,0.0017030173,0.00024326652,0.9336426],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993782,0.00005929731,0.00003266069,0.0001439302,0.00023460772,0.00015133739],"domain_scores_gemma":[0.9978969,0.00010402205,0.00005636826,0.00008327726,0.0004792463,0.0013801042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014007724,0.0010170717,0.00086243235,0.001093593,0.000825687,0.0027543684,0.0010503533,0.002514008,0.19244736],"category_scores_gemma":[0.0021627827,0.00028850025,0.00064619555,0.0005889747,0.0007673228,0.0016072186,0.0024712991,0.002472421,0.14179687],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018630068,0.000024739402,0.00011502097,0.000098595585,0.000018524219,0.00006396993,0.000017539282,0.000104555846,0.00058181555,0.010578752,0.93705046,0.051159687],"study_design_scores_gemma":[0.000012766482,0.000029070721,0.00029527632,0.00005866239,0.0000071360673,0.00006742831,0.000015029944,0.00006255212,0.0002622685,0.002721278,0.99646324,0.000005264311],"about_ca_topic_score_codex":0.0012989005,"about_ca_topic_score_gemma":0.0029209906,"teacher_disagreement_score":0.19244736,"about_ca_system_score_codex":0.002071896,"about_ca_system_score_gemma":0.0024021287,"threshold_uncertainty_score":0.64380056},"labels":[],"label_agreement":null},{"id":"W3124639266","doi":"10.1145/3457341.3457345","title":"Improved divisor arithmetic on generic hyperelliptic curves","year":2020,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Cryptography and Residue Arithmetic","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":"University of Calgary","funders":"","keywords":"Divisor (algebraic geometry); Hyperelliptic curve cryptography; Mathematics; Finite field; Hyperelliptic curve; Abelian group; Magma; Algebra over a field; Group (periodic table); Class (philosophy); Arithmetic; Algebraic number; Algebraic geometry; Field (mathematics); Cryptography; Discrete mathematics; Pure mathematics; Computer science; Elliptic curve cryptography; Algorithm; Encryption; Public-key cryptography","score_opus":0.05469412100311326,"score_gpt":0.2745955631548803,"score_spread":0.21990144215176705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124639266","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6521126,0.004328133,0.15414335,0.002743974,0.00080336945,0.00009140075,0.0004609585,0.00088971975,0.18442647],"genre_scores_gemma":[0.9539625,0.0015234217,0.027172802,0.0001824915,0.000649234,0.000030737905,0.00026011534,0.00010930277,0.016109388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991517,0.00015376683,0.000042229505,0.0001326304,0.00035453818,0.00016501415],"domain_scores_gemma":[0.9991592,0.00016923517,0.00011686802,0.00028703245,0.00015043835,0.00011720217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001280751,0.00067507394,0.0009499539,0.0022233392,0.0010736964,0.002509091,0.0010041187,0.0006825692,0.008260273],"category_scores_gemma":[0.002451872,0.00026037355,0.00055444683,0.0017278838,0.002455831,0.0053574154,0.0031884916,0.001962529,0.0017495038],"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.00026091203,0.0000385136,0.00056060776,0.000078876525,0.000011930639,0.00021732408,0.0002919218,0.012547244,0.004865605,0.9447933,0.0024393296,0.033894334],"study_design_scores_gemma":[0.000067476365,0.00013990831,0.00086837594,0.000060389,0.000021652102,0.00025629238,0.00013031502,0.048573412,0.0056594587,0.9279304,0.016248204,0.00004409268],"about_ca_topic_score_codex":0.00068274623,"about_ca_topic_score_gemma":0.00072181725,"teacher_disagreement_score":0.008260273,"about_ca_system_score_codex":0.0017672039,"about_ca_system_score_gemma":0.00065363676,"threshold_uncertainty_score":0.027633369},"labels":[],"label_agreement":null},{"id":"W4205583524","doi":"10.1145/3511528.3511529","title":"A call to build a publicly accessible library of lecture recordings in computer algebra","year":2021,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Distributed and Parallel Computing Systems","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":"Simon Fraser University","funders":"","keywords":"Computer science; Algebra over a field; Quality (philosophy); Symbolic computation; Mathematics education; Mathematics; Pure mathematics","score_opus":0.03005436340919315,"score_gpt":0.287046681578331,"score_spread":0.25699231816913787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205583524","genre_codex":"software","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052986145,0.0027916064,0.23505089,0.045228362,0.029652791,0.0049408725,0.08705298,0.35212803,0.23785572],"genre_scores_gemma":[0.017046029,0.0031338406,0.2098903,0.010249825,0.01596604,0.0030009164,0.098927855,0.08620928,0.5555759],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940508,0.0014301699,0.00066594576,0.00074793893,0.0026809524,0.0004241272],"domain_scores_gemma":[0.90587,0.023334017,0.00518721,0.025270706,0.021011053,0.01932702],"candidate_categories":["scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009050858,0.0014177792,0.0019377706,0.011661278,0.003104194,0.008090228,0.0035734503,0.002441342,0.45615438],"category_scores_gemma":[0.048760533,0.0018954861,0.0016395608,0.008665424,0.001007415,0.014139838,0.010797287,0.0065904055,0.44891122],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017621755,0.00015518359,0.00036016875,0.00019337828,0.000014130644,0.00014598393,0.0001997456,0.00009991458,0.0013822594,0.0012370504,0.87538135,0.12065467],"study_design_scores_gemma":[0.00006551831,0.00009559606,0.0014891825,0.0002262039,0.000016571203,0.00023743592,0.0002824444,0.0004750127,0.0010698166,0.0012446626,0.99471235,0.00008520858],"about_ca_topic_score_codex":0.0016584637,"about_ca_topic_score_gemma":0.002916916,"teacher_disagreement_score":0.9964265,"about_ca_system_score_codex":0.0017300055,"about_ca_system_score_gemma":0.0031463709,"threshold_uncertainty_score":0.7757298},"labels":[],"label_agreement":null},{"id":"W4206215463","doi":"10.1145/3015306.3015312","title":"The basic polynomial algebra subprograms","year":2016,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Numerical Methods 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; Microsoft (Canada)","funders":"","keywords":"Computer science; Multiplication (music); Prime (order theory); Univariate; Polynomial; Division (mathematics); Rational function; Variety (cybernetics); Isolation (microbiology); Algebra over a field; Arithmetic; Rational number; Code (set theory); Theoretical computer science; Mathematics; Programming language; Discrete mathematics; Multivariate statistics; Pure mathematics; Set (abstract data type); Combinatorics","score_opus":0.04041744860613087,"score_gpt":0.316534470289144,"score_spread":0.2761170216830131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206215463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071721985,0.0010402171,0.845425,0.0010491248,0.00037957757,0.00063188584,0.007777453,0.02996347,0.10656106],"genre_scores_gemma":[0.13374875,0.0019174987,0.7465908,0.0019341112,0.00084770494,0.0017847791,0.020837786,0.013305173,0.07903349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99820364,0.0002616951,0.00013277208,0.00038303915,0.00076707033,0.00025175564],"domain_scores_gemma":[0.9984669,0.00048001876,0.00011446189,0.00037877305,0.0004511359,0.00010867005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013431732,0.0010212896,0.0008893671,0.0014921962,0.0013217252,0.0029963467,0.0022617725,0.00086342316,0.056255117],"category_scores_gemma":[0.004801969,0.0008997777,0.001804146,0.001730008,0.0014688832,0.0038362392,0.0030286051,0.0037634182,0.046381835],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030660932,0.0002041154,0.0012795472,0.0009321278,0.00004703419,0.00018316138,0.00053482974,0.005586778,0.006614887,0.5329114,0.1373276,0.31407198],"study_design_scores_gemma":[0.00008724853,0.000071682494,0.00070519606,0.00015992523,0.000038276776,0.0005692093,0.00009820344,0.021630544,0.013473674,0.4541414,0.50896,0.00006462025],"about_ca_topic_score_codex":0.0017393038,"about_ca_topic_score_gemma":0.0015599285,"teacher_disagreement_score":0.056255117,"about_ca_system_score_codex":0.0010173547,"about_ca_system_score_gemma":0.002660957,"threshold_uncertainty_score":0.18819213},"labels":[],"label_agreement":null},{"id":"W4231919371","doi":"10.1145/3264349","title":"Session details: Volume 47, Number 4, Issue 186, December 2013","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Educational Reforms and Innovations","field":"Environmental 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":"Wilfrid Laurier University","funders":"","keywords":"Session (web analytics); Volume (thermodynamics); Computer science; World Wide Web; Physics","score_opus":0.02170449589604246,"score_gpt":0.29751017067730157,"score_spread":0.2758056747812591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231919371","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028224275,0.005462576,0.0027161872,0.1743826,0.28758454,0.00091121544,0.007158541,0.0037745822,0.51518726],"genre_scores_gemma":[0.0042475974,0.0014822532,0.00035948472,0.014207704,0.018675327,0.00029028318,0.001131308,0.0004216305,0.95918435],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894243,0.00018559823,0.000042507265,0.00015544567,0.00042355136,0.000250466],"domain_scores_gemma":[0.9966169,0.000359168,0.00012444137,0.0001666865,0.001289288,0.0014435444],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0030960066,0.0013364002,0.0015736837,0.0012219552,0.003636258,0.006415251,0.0012260006,0.006313422,0.57349664],"category_scores_gemma":[0.003540661,0.00047926573,0.0012582258,0.0012339513,0.000649583,0.0026578608,0.0027117082,0.0048757484,0.43428233],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051661205,0.00003125323,0.00009568742,0.000040837807,0.0000030029992,0.000011135045,0.000009760964,0.000013775317,0.000064614454,0.00016035805,0.9922516,0.0072662956],"study_design_scores_gemma":[0.00006377435,0.000060102215,0.001596756,0.000105477455,0.000013482121,0.00002644577,0.00012700266,0.0001830538,0.00018028765,0.00038523093,0.9972416,0.000016830712],"about_ca_topic_score_codex":0.0047816983,"about_ca_topic_score_gemma":0.014370214,"teacher_disagreement_score":0.42650336,"about_ca_system_score_codex":0.0019028725,"about_ca_system_score_gemma":0.004472588,"threshold_uncertainty_score":0.6083553},"labels":[],"label_agreement":null},{"id":"W4234157679","doi":"10.1145/2768577.2791243","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Computation; Computer science; Algebra over a field; Library science; Quarter (Canadian coin); Mathematics; Algorithm; History; Pure mathematics","score_opus":0.1060856837289224,"score_gpt":0.34347593216693467,"score_spread":0.23739024843801226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234157679","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004029072,0.13809901,0.027923288,0.03749376,0.22486465,0.0008396166,0.01281382,0.0020632958,0.55187345],"genre_scores_gemma":[0.012315434,0.072111376,0.011933432,0.0043867202,0.08786426,0.0006986377,0.014127527,0.0018662896,0.7946963],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99665064,0.00047908572,0.00028756316,0.00043556796,0.0019747892,0.00017245884],"domain_scores_gemma":[0.98574847,0.0018583925,0.00057514565,0.0010041983,0.007889947,0.0029238542],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032608854,0.0017195998,0.0016869177,0.006480153,0.002008229,0.006665347,0.001212328,0.0012101491,0.30960426],"category_scores_gemma":[0.014147046,0.00059391785,0.0018645561,0.0062246597,0.00079613493,0.0036430832,0.002633774,0.0037615912,0.18504319],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005266629,0.000041063286,0.00012029594,0.0005599082,0.000024077828,0.000037303955,0.000103709004,0.00015970551,0.0007038056,0.0068508815,0.9123044,0.07904212],"study_design_scores_gemma":[0.000013496895,0.00003080644,0.00045751076,0.00028240733,0.000017718949,0.00009274976,0.000080727455,0.0002224686,0.00028527036,0.005833624,0.9926704,0.000012908733],"about_ca_topic_score_codex":0.00076539145,"about_ca_topic_score_gemma":0.0011749689,"teacher_disagreement_score":0.30960426,"about_ca_system_score_codex":0.0028221325,"about_ca_system_score_gemma":0.0033907616,"threshold_uncertainty_score":0.9847657},"labels":[],"label_agreement":null},{"id":"W4238182396","doi":"10.1145/3264348","title":"Session details: Volume 47, Number 3, Issue 185, September 2013","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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":"Wilfrid Laurier University","funders":"","keywords":"Session (web analytics); Volume (thermodynamics); Computer science; World Wide Web; Physics; Thermodynamics","score_opus":0.0466562155593154,"score_gpt":0.2619076048416755,"score_spread":0.21525138928236012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238182396","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027567511,0.006116444,0.00400501,0.101882584,0.29104835,0.00094717386,0.012080354,0.005423408,0.57574004],"genre_scores_gemma":[0.0044509647,0.0017642446,0.00049714633,0.00845935,0.01931911,0.00024159109,0.0023186412,0.0006689692,0.96228004],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990421,0.00015710495,0.00003696815,0.00016270128,0.0003809673,0.00022013586],"domain_scores_gemma":[0.99706024,0.00026746452,0.00010261361,0.00015902083,0.0010823099,0.0013284046],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0025901033,0.0013300033,0.0017819513,0.0013521584,0.0033656177,0.006711685,0.0013193457,0.004227864,0.6279924],"category_scores_gemma":[0.0028993108,0.00044892757,0.0012718108,0.0013364193,0.0005823877,0.002881296,0.0028421436,0.0039385227,0.5076124],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004830107,0.000027077449,0.00007164796,0.000036723904,0.0000034174648,0.00001008557,0.000007215101,0.000015357831,0.00007400759,0.00018093525,0.9918833,0.007641983],"study_design_scores_gemma":[0.00005863926,0.00004982552,0.0011620349,0.00008887248,0.000014672305,0.000022640417,0.00008154977,0.00021852489,0.00020707265,0.0005029654,0.997577,0.000016040838],"about_ca_topic_score_codex":0.004286964,"about_ca_topic_score_gemma":0.0128682535,"teacher_disagreement_score":0.3720076,"about_ca_system_score_codex":0.0019475736,"about_ca_system_score_gemma":0.003796733,"threshold_uncertainty_score":0.5306237},"labels":[],"label_agreement":null},{"id":"W4239945522","doi":"10.1145/3151131.3151135","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Computation; Algebra over a field; Computer science; Quarter (Canadian coin); Library science; Mathematics education; Mathematics; Algorithm; Pure mathematics; History","score_opus":0.08591355631602832,"score_gpt":0.3517769376764778,"score_spread":0.26586338136044946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239945522","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005311576,0.1633348,0.03294399,0.043783497,0.28393748,0.0009737797,0.012201482,0.0021119458,0.45540142],"genre_scores_gemma":[0.016092725,0.08306249,0.013219877,0.0050923396,0.11566002,0.00087568467,0.014006981,0.0021333299,0.74985665],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99612623,0.0005323508,0.00029809593,0.0004663569,0.0023698187,0.00020714612],"domain_scores_gemma":[0.9827172,0.0022541303,0.0006369264,0.0010962086,0.009540225,0.0037552253],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0034711952,0.0018278603,0.0019781515,0.0069584134,0.0021641375,0.0064160167,0.0012640993,0.00125161,0.26926],"category_scores_gemma":[0.016344981,0.00057531754,0.0021127185,0.0069339024,0.0008920519,0.0037541208,0.0029155628,0.0041138562,0.14892294],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063324806,0.00005376064,0.00015881851,0.0006748927,0.000031307653,0.000045237422,0.00013168111,0.00021172884,0.0008855106,0.007649338,0.900507,0.08958745],"study_design_scores_gemma":[0.000018319948,0.00004738908,0.0006788965,0.0003545009,0.000024455418,0.00012748098,0.00010723208,0.00030325438,0.00040920664,0.0077406527,0.9901698,0.000018784876],"about_ca_topic_score_codex":0.0007875286,"about_ca_topic_score_gemma":0.0012807711,"teacher_disagreement_score":0.9930416,"about_ca_system_score_codex":0.0030980292,"about_ca_system_score_gemma":0.0038515453,"threshold_uncertainty_score":0.9007644},"labels":[],"label_agreement":null},{"id":"W4255317507","doi":"10.1145/3388974.3388977","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2020,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Computation; Algebra over a field; Computer science; Quarter (Canadian coin); Library science; Mathematics education; Mathematics; Algorithm; Pure mathematics; History","score_opus":0.08633072774261363,"score_gpt":0.32632190049880827,"score_spread":0.23999117275619464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255317507","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048529385,0.15790124,0.028491642,0.037831686,0.25608638,0.0009701462,0.012773565,0.0019616734,0.49913076],"genre_scores_gemma":[0.0121705625,0.07068423,0.010921358,0.0040143956,0.09191472,0.0007734309,0.012766024,0.001688763,0.7950666],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965861,0.00047838426,0.00026385084,0.0004002999,0.0020899817,0.00018136832],"domain_scores_gemma":[0.9845766,0.0019716294,0.0005613948,0.0009567021,0.008709539,0.003224228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031327086,0.0018781743,0.00195076,0.00683004,0.0021080272,0.00617447,0.0011978569,0.001169766,0.28490987],"category_scores_gemma":[0.014125567,0.00056198094,0.0020443352,0.0072160778,0.0007986732,0.003358241,0.0026209934,0.0037892358,0.16034234],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060840255,0.00005174458,0.00014179063,0.00060512655,0.000026849317,0.000041727693,0.00011110949,0.00019342371,0.00085861864,0.0064751366,0.90838665,0.08304701],"study_design_scores_gemma":[0.000017850203,0.000043324384,0.000682465,0.00030922864,0.000021837408,0.00011100342,0.000096496835,0.00029276285,0.00035092182,0.0060325395,0.9920249,0.000016642694],"about_ca_topic_score_codex":0.0009163246,"about_ca_topic_score_gemma":0.001463754,"teacher_disagreement_score":0.28490987,"about_ca_system_score_codex":0.0028867961,"about_ca_system_score_gemma":0.0036935636,"threshold_uncertainty_score":0.9531185},"labels":[],"label_agreement":null},{"id":"W4285369719","doi":"10.1145/3511528.3511540","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2021,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Computation; Algebra over a field; Computer science; Quarter (Canadian coin); Library science; Mathematics education; Mathematics; Algorithm; History; Pure mathematics","score_opus":0.06720036151748661,"score_gpt":0.33045710510841414,"score_spread":0.26325674359092754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285369719","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004866294,0.15886267,0.028699199,0.038324773,0.25762767,0.0009638915,0.012687712,0.0019481359,0.49601966],"genre_scores_gemma":[0.012301951,0.071011916,0.010931089,0.0040417486,0.092699446,0.00077535276,0.012693594,0.0016903522,0.7938546],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965551,0.0004854702,0.00026600837,0.00040597096,0.0021046877,0.00018290039],"domain_scores_gemma":[0.9843754,0.0019985985,0.00056674384,0.00096839096,0.0088561885,0.0032346137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031552163,0.0018808973,0.0019728285,0.0068266867,0.002127045,0.0062261294,0.0011955816,0.0011757548,0.28180492],"category_scores_gemma":[0.014199801,0.0005655257,0.002055882,0.007248953,0.0008052104,0.00337012,0.0026265786,0.0038298373,0.15830721],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006081037,0.00005170787,0.00014352918,0.0006045043,0.00002712384,0.000041981308,0.00011248439,0.00019514123,0.0008593547,0.006582714,0.90844715,0.08287355],"study_design_scores_gemma":[0.000018000812,0.00004347616,0.0006902573,0.0003109916,0.000022142118,0.00011150072,0.00009814141,0.00029810442,0.00035416882,0.006158938,0.99187744,0.00001683552],"about_ca_topic_score_codex":0.00092415884,"about_ca_topic_score_gemma":0.0014743698,"teacher_disagreement_score":0.28180492,"about_ca_system_score_codex":0.0029177205,"about_ca_system_score_gemma":0.0036972698,"threshold_uncertainty_score":0.9427314},"labels":[],"label_agreement":null},{"id":"W4288065989","doi":"10.1145/3551872.3551873","title":"Abstracts of recent doctoral dissertations in computer algebra","year":2021,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Symbolic computation; Algebra over a field; Computation; Computer science; Quarter (Canadian coin); Library science; Mathematics education; Mathematics; Algorithm; Pure mathematics; History","score_opus":0.06720036151748661,"score_gpt":0.33045710510841414,"score_spread":0.26325674359092754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288065989","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004866294,0.15886267,0.028699199,0.038324773,0.25762767,0.0009638915,0.012687712,0.0019481359,0.49601966],"genre_scores_gemma":[0.012301951,0.071011916,0.010931089,0.0040417486,0.092699446,0.00077535276,0.012693594,0.0016903522,0.7938546],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965551,0.0004854702,0.00026600837,0.00040597096,0.0021046877,0.00018290039],"domain_scores_gemma":[0.9843754,0.0019985985,0.00056674384,0.00096839096,0.0088561885,0.0032346137],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0031552163,0.0018808973,0.0019728285,0.0068266867,0.002127045,0.0062261294,0.0011955816,0.0011757548,0.28180492],"category_scores_gemma":[0.014199801,0.0005655257,0.002055882,0.007248953,0.0008052104,0.00337012,0.0026265786,0.0038298373,0.15830721],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006081037,0.00005170787,0.00014352918,0.0006045043,0.00002712384,0.000041981308,0.00011248439,0.00019514123,0.0008593547,0.006582714,0.90844715,0.08287355],"study_design_scores_gemma":[0.000018000812,0.00004347616,0.0006902573,0.0003109916,0.000022142118,0.00011150072,0.00009814141,0.00029810442,0.00035416882,0.006158938,0.99187744,0.00001683552],"about_ca_topic_score_codex":0.00092415884,"about_ca_topic_score_gemma":0.0014743698,"teacher_disagreement_score":0.9931733,"about_ca_system_score_codex":0.0029177205,"about_ca_system_score_gemma":0.0036972698,"threshold_uncertainty_score":0.9427314},"labels":[],"label_agreement":null},{"id":"W4312377476","doi":"10.1145/3572867.3572877","title":"Algorithms for multivariate laurent series","year":2022,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","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":"","keywords":"Mathematics; Series (stratigraphy); Set (abstract data type); Dimension (graph theory); Zero (linguistics); Multivariate statistics; Laurent series; Decomposition; Field (mathematics); Combinatorics; Discrete mathematics; Pure mathematics; Statistics; Computer science; Chemistry","score_opus":0.051850534137806666,"score_gpt":0.31124842502778605,"score_spread":0.2593978908899794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312377476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015007399,0.0009823657,0.9651828,0.0005632881,0.00021010936,0.00012229034,0.0004650743,0.003881639,0.013585062],"genre_scores_gemma":[0.22659746,0.0009797672,0.7506426,0.00026404715,0.0003845597,0.0002873888,0.001804915,0.0011027459,0.01793662],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998694,0.00030280653,0.000108895016,0.00029108376,0.00038367926,0.00021952383],"domain_scores_gemma":[0.997823,0.0010155628,0.00012750109,0.00060320686,0.00032001786,0.00011075987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014210586,0.0010851331,0.0010315577,0.0017856983,0.0009006878,0.003225713,0.0020098763,0.00082675536,0.016942887],"category_scores_gemma":[0.008456587,0.00052144093,0.0010744066,0.0023495157,0.000756515,0.0050342837,0.0026093794,0.001986297,0.0056219553],"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.00033792827,0.00017388232,0.0013057857,0.00036160855,0.00010728282,0.00012383627,0.00027769466,0.06485344,0.0032156517,0.36954638,0.024315856,0.5353806],"study_design_scores_gemma":[0.00011081899,0.00005565021,0.00021389437,0.000071910625,0.000032951917,0.00013128492,0.00010241645,0.42069072,0.0032620116,0.5498929,0.025410999,0.000024380153],"about_ca_topic_score_codex":0.0015664673,"about_ca_topic_score_gemma":0.0033022135,"teacher_disagreement_score":0.016942887,"about_ca_system_score_codex":0.0013367516,"about_ca_system_score_gemma":0.0013189128,"threshold_uncertainty_score":0.056679606},"labels":[],"label_agreement":null},{"id":"W4312719737","doi":"10.1145/3572867.3572883","title":"A new interpolation algorithm for computing dixon resultants","year":2022,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","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":"Simon Fraser University","funders":"","keywords":"Monic polynomial; Interpolation (computer graphics); Algorithm; Polynomial interpolation; Subroutine; Mathematics; Polynomial; Computer science; Bilinear interpolation; Algebra over a field; Spline interpolation; Pure mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.03726532653356616,"score_gpt":0.30605302826103253,"score_spread":0.26878770172746635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312719737","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012552853,0.00007486502,0.9795991,0.000060535625,0.000058552007,0.00004595116,0.00014191287,0.0020610357,0.0054052537],"genre_scores_gemma":[0.12222878,0.00014439107,0.8691317,0.000061134946,0.00006175962,0.00007028923,0.0006758318,0.00039412876,0.0072319545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993569,0.0000758803,0.0000457847,0.00012056935,0.00031271967,0.00008820402],"domain_scores_gemma":[0.9993616,0.00015602191,0.000049203027,0.00013547121,0.0002575543,0.000040157112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061082107,0.00074955256,0.00054108276,0.0016444902,0.00076992076,0.0010019109,0.0011375059,0.00038157534,0.009400561],"category_scores_gemma":[0.0023112064,0.00033462615,0.0006266808,0.0015687331,0.0005915164,0.0019862424,0.0015652784,0.0012202582,0.0025281697],"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.00035105343,0.000096977914,0.0012622669,0.00021836311,0.00003912258,0.00019635867,0.0003157624,0.04896672,0.034128733,0.1814047,0.01062224,0.72239774],"study_design_scores_gemma":[0.00011968884,0.0002936033,0.00087335595,0.00005042432,0.000046232657,0.0004982268,0.0002010248,0.7096588,0.10272812,0.11450682,0.07089633,0.00012731375],"about_ca_topic_score_codex":0.0016061418,"about_ca_topic_score_gemma":0.003347328,"teacher_disagreement_score":0.009400561,"about_ca_system_score_codex":0.00070078595,"about_ca_system_score_gemma":0.001007472,"threshold_uncertainty_score":0.031448066},"labels":[],"label_agreement":null},{"id":"W4312939501","doi":"10.1145/3572867.3572881","title":"Factoring non-monic polynomials represented by black boxes","year":2022,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","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":"Simon Fraser University","funders":"","keywords":"Monic polynomial; Factorization; Factoring; Subroutine; Mathematics; Square (algebra); Maple; Black box; Polynomial; Computer science; Combinatorics; Algorithm; Discrete mathematics; Algebra over a field; Pure mathematics; Programming language; Artificial intelligence","score_opus":0.02913105223767142,"score_gpt":0.28632427609355016,"score_spread":0.2571932238558787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312939501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16346122,0.00017317217,0.8300672,0.00016008141,0.00007461123,0.00007729015,0.00018319291,0.0016016151,0.0042015556],"genre_scores_gemma":[0.57455635,0.000324963,0.4167943,0.00012848791,0.00007594826,0.000101029415,0.00053949066,0.0003601933,0.0071192738],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937135,0.00009696237,0.000029851264,0.00013370258,0.00016401577,0.00020407615],"domain_scores_gemma":[0.99914765,0.00032479994,0.00009753397,0.00023418055,0.00011896623,0.00007679382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000976474,0.0007650936,0.00092731026,0.0006640577,0.0005744491,0.00086773257,0.0004908822,0.0004295339,0.0071319016],"category_scores_gemma":[0.0023972497,0.00032013067,0.0008250787,0.000770762,0.0009586937,0.002150633,0.001996216,0.0010324258,0.0020358728],"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.0025062186,0.0003377067,0.0039585633,0.00065943314,0.00013031374,0.0011367403,0.0010210845,0.1206495,0.12596196,0.2847136,0.008091322,0.45083362],"study_design_scores_gemma":[0.0002686372,0.00094155216,0.0014551767,0.00018390849,0.000103256774,0.00059415074,0.0005195663,0.4625061,0.18161616,0.31872758,0.032955956,0.00012797485],"about_ca_topic_score_codex":0.0009237068,"about_ca_topic_score_gemma":0.0013980297,"teacher_disagreement_score":0.0071319016,"about_ca_system_score_codex":0.00039216442,"about_ca_system_score_gemma":0.00078748807,"threshold_uncertainty_score":0.023858607},"labels":[],"label_agreement":null},{"id":"W4385628833","doi":"10.1145/3614408.3614417","title":"Drinfeld Modules in SageMath","year":2023,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Concordia University","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Programming language","score_opus":0.03958561973493107,"score_gpt":0.2996038609761693,"score_spread":0.26001824124123823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385628833","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011835056,0.00053868734,0.8584303,0.00037646462,0.0003967664,0.00012784939,0.0015618049,0.077294014,0.049438965],"genre_scores_gemma":[0.20550634,0.0011038366,0.67369837,0.0012410264,0.00048555518,0.0004488185,0.0076409504,0.035828136,0.07404691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973878,0.00046457184,0.00019770832,0.00041310655,0.0011659882,0.00037075934],"domain_scores_gemma":[0.99824,0.00038545683,0.000079047204,0.0006779717,0.0004908343,0.00012672986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021092312,0.0007913366,0.0007456974,0.0013443552,0.00092322024,0.002888555,0.0025434482,0.0009147831,0.03268501],"category_scores_gemma":[0.005137169,0.00066955393,0.0011654772,0.0013741663,0.0013486865,0.0062753926,0.0036949043,0.003071647,0.018942984],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005388735,0.00021387023,0.0012737624,0.00060742977,0.00009944268,0.00028750417,0.001437601,0.0057322127,0.024009958,0.6242021,0.07444449,0.26715273],"study_design_scores_gemma":[0.00019032303,0.00013961615,0.0005529261,0.00023183272,0.00006415129,0.0004853228,0.00015179404,0.021225877,0.052971147,0.2895294,0.63426775,0.000189784],"about_ca_topic_score_codex":0.0010643136,"about_ca_topic_score_gemma":0.0014656186,"teacher_disagreement_score":0.03268501,"about_ca_system_score_codex":0.00080891803,"about_ca_system_score_gemma":0.0011172662,"threshold_uncertainty_score":0.10934228},"labels":[],"label_agreement":null},{"id":"W4385640144","doi":"10.1145/3614408.3614416","title":"FFCSA - Finite Field Constructions, Search, and Algorithms","year":2023,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Parameterized complexity; Finite field; Computer science; Field (mathematics); Algorithm; Implementation; Space (punctuation); Cryptography; Search algorithm; Theoretical computer science; Mathematics; Programming language; Discrete mathematics","score_opus":0.04537242768353807,"score_gpt":0.3067459312607776,"score_spread":0.26137350357723954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385640144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073454026,0.00076719304,0.96925956,0.00044389835,0.00014465107,0.000098124605,0.00037382534,0.0052818297,0.016285557],"genre_scores_gemma":[0.27740335,0.0015411167,0.6972113,0.00086240325,0.00035846428,0.00088278047,0.002080376,0.0033672967,0.016292894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958359,0.0013001289,0.00027663552,0.0004964238,0.001636077,0.00045482442],"domain_scores_gemma":[0.99567324,0.0023142367,0.0001888216,0.0012538069,0.0004636998,0.00010615778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003823639,0.0012309226,0.0010911744,0.0018690208,0.0013039124,0.003056782,0.001975195,0.0015915912,0.013575418],"category_scores_gemma":[0.008688922,0.0009261673,0.0022518977,0.0017712624,0.003572963,0.006723753,0.0038839877,0.0031164996,0.0061659464],"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.00022274445,0.0000536852,0.000570415,0.00034251774,0.000032964403,0.00009217936,0.0002594632,0.019455275,0.003323174,0.84870315,0.012197186,0.11474719],"study_design_scores_gemma":[0.00007439163,0.00016192567,0.00019283911,0.00018976508,0.00005294495,0.00035494796,0.000082452476,0.07542273,0.01200366,0.81033415,0.10105149,0.00007882277],"about_ca_topic_score_codex":0.0008142022,"about_ca_topic_score_gemma":0.0006308913,"teacher_disagreement_score":0.013575418,"about_ca_system_score_codex":0.001826581,"about_ca_system_score_gemma":0.0023408604,"threshold_uncertainty_score":0.04541427},"labels":[],"label_agreement":null},{"id":"W4389670345","doi":"10.1145/3637529.3637534","title":"On a Two-Layer Modular Arithmetic","year":2023,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Cryptography and Residue Arithmetic","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":"University of Waterloo","funders":"","keywords":"Moduli; Layer (electronics); Modular design; Arithmetic; Modular arithmetic; Computer science; Reduction (mathematics); Mathematics; Parallel computing; Algorithm; Geometry; Programming language; Materials science; Nanotechnology","score_opus":0.04662519339983078,"score_gpt":0.31625338015213533,"score_spread":0.26962818675230454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389670345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14830722,0.0010962484,0.7677354,0.00067089853,0.00032509462,0.00024387432,0.00022306528,0.0021397974,0.07925838],"genre_scores_gemma":[0.62275267,0.0011063046,0.34463856,0.0002799775,0.0002239094,0.00012756488,0.00026007358,0.000114244875,0.030496696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996977,0.000050984032,0.000018231383,0.000064376756,0.0001167153,0.00005201981],"domain_scores_gemma":[0.9998462,0.000022492191,0.000016360063,0.000069999216,0.000033055014,0.000011870561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018796278,0.0006778493,0.00033489006,0.0005224601,0.00040711433,0.0013260937,0.0007231251,0.0005154629,0.006081161],"category_scores_gemma":[0.0003189855,0.0002344566,0.00043099932,0.00053308095,0.0004887084,0.001590096,0.0009784438,0.0007052806,0.002613033],"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.00074201263,0.00022584054,0.00096198265,0.00071989663,0.00007642,0.0009412698,0.00038269188,0.05226069,0.27736935,0.3793054,0.007976808,0.27903765],"study_design_scores_gemma":[0.00015574391,0.0010966655,0.0022283397,0.00022299372,0.00016446118,0.0017812968,0.00016244303,0.514334,0.18539469,0.20361201,0.090696074,0.00015118008],"about_ca_topic_score_codex":0.000372074,"about_ca_topic_score_gemma":0.00043037266,"teacher_disagreement_score":0.006081161,"about_ca_system_score_codex":0.0003819187,"about_ca_system_score_gemma":0.0003540262,"threshold_uncertainty_score":0.020343542},"labels":[],"label_agreement":null},{"id":"W4407385828","doi":"10.1145/3717582.3717595","title":"Sparse Hensel Lifting Algorithms for Multivariate Polynomial Factorization","year":2024,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multivariate statistics; Factorization; Polynomial; Computer science; Algorithm; Mathematics; Machine learning","score_opus":0.06592509873222369,"score_gpt":0.330300286538179,"score_spread":0.2643751878059553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407385828","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030399043,0.00010710648,0.96466166,0.00010506872,0.000040136674,0.00006372934,0.00010648013,0.0017883857,0.0027283372],"genre_scores_gemma":[0.30456233,0.00024566252,0.6887268,0.000100786194,0.000100042416,0.00014305345,0.0005055845,0.00033017131,0.0052855453],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993144,0.00009831816,0.00003838902,0.000117323616,0.00025932476,0.00017227043],"domain_scores_gemma":[0.9989994,0.00034754013,0.000086793974,0.00032073358,0.00018082,0.00006471157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007805311,0.00060270325,0.00065190444,0.0007544013,0.00066266337,0.0007557354,0.00073592586,0.00039622112,0.0070978464],"category_scores_gemma":[0.002719795,0.0003165374,0.0007871298,0.00084245886,0.00064247544,0.0019226978,0.0017713846,0.0011869746,0.0017764625],"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.0008148119,0.00021888052,0.0022161487,0.0003061004,0.00006544172,0.000257514,0.00048723453,0.132132,0.035882972,0.19160685,0.009677981,0.62633413],"study_design_scores_gemma":[0.00016630194,0.00027701174,0.0006738997,0.000045697067,0.000034615758,0.00018463821,0.00011019522,0.77535516,0.032363944,0.17665808,0.014080536,0.00004986974],"about_ca_topic_score_codex":0.0014750165,"about_ca_topic_score_gemma":0.0021014272,"teacher_disagreement_score":0.0070978464,"about_ca_system_score_codex":0.00061712007,"about_ca_system_score_gemma":0.00088171795,"threshold_uncertainty_score":0.023744643},"labels":[],"label_agreement":null},{"id":"W4407385849","doi":"10.1145/3717582.3717588","title":"A Maple Program to Factor Multivariate Polynomials Given by Black Boxes","year":2024,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","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":"Simon Fraser University","funders":"","keywords":"Maple; Factor (programming language); Multivariate statistics; Mathematics; Multivariate analysis; Algebra over a field; Pure mathematics; Computer science; Statistics; Programming language; Botany; Biology","score_opus":0.03666088420154946,"score_gpt":0.32913825764884397,"score_spread":0.2924773734472945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407385849","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010989514,0.000069418886,0.9259009,0.00010213972,0.000039980867,0.00010868062,0.00071743474,0.053662304,0.008409685],"genre_scores_gemma":[0.19983761,0.00015916921,0.76302385,0.00025624855,0.0000743328,0.00070474605,0.002953846,0.01265294,0.020337332],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995585,0.00009246184,0.000026060716,0.000109695444,0.00013492667,0.00007839206],"domain_scores_gemma":[0.9987871,0.0006715185,0.00006832174,0.00020583958,0.00019083072,0.000076292585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007375031,0.00082209095,0.0005793196,0.0008560511,0.0004880155,0.0010224374,0.0009386033,0.0005668768,0.03697684],"category_scores_gemma":[0.0036636405,0.00052442664,0.00075223297,0.0007539716,0.00051117217,0.0016495883,0.0014697872,0.0009969306,0.009175048],"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.0019566922,0.0004525764,0.003749134,0.0008682814,0.00014303613,0.00068882987,0.0008215312,0.07009241,0.030648408,0.11002328,0.11619553,0.6643602],"study_design_scores_gemma":[0.00059325446,0.00031764994,0.0015083185,0.00019876246,0.000049148708,0.00044253416,0.00015730392,0.6424621,0.07143664,0.1217432,0.16096704,0.00012402533],"about_ca_topic_score_codex":0.0009310245,"about_ca_topic_score_gemma":0.0010271985,"teacher_disagreement_score":0.03697684,"about_ca_system_score_codex":0.00056017976,"about_ca_system_score_gemma":0.0007486531,"threshold_uncertainty_score":0.123699844},"labels":[],"label_agreement":null},{"id":"W7124934559","doi":"10.1145/3787957.3787958","title":"Integer Hulls, Z-Polyhedra and Presburger Arithmetic in Action","year":2025,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":1,"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":"","keywords":"Presburger arithmetic; Undecidable problem; Integer (computer science); Decidability; Algebra over a field; Integer programming; Integer points in convex polyhedra; Action (physics)","score_opus":0.03513085089192196,"score_gpt":0.3165719697226975,"score_spread":0.28144111883077555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124934559","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22310595,0.005025102,0.29212958,0.004890997,0.000820616,0.00011163404,0.0007799853,0.0006829115,0.47245315],"genre_scores_gemma":[0.90216935,0.002908606,0.05055537,0.00062077335,0.0007638097,0.00008775384,0.00062790216,0.00013745316,0.042128917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996873,0.00005375767,0.000015590189,0.00006541744,0.00010852681,0.00006940828],"domain_scores_gemma":[0.9997602,0.0000845021,0.000056831283,0.00002789636,0.00003175893,0.000038831447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038693406,0.00047831368,0.00034842634,0.0011289761,0.0013203815,0.0022056154,0.0004862966,0.00049046637,0.0089916345],"category_scores_gemma":[0.0009420728,0.00019758118,0.00042251655,0.0010197739,0.003745542,0.003838585,0.0014726418,0.0017754481,0.0015187532],"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.000012960978,0.0000048160396,0.000046343263,0.0000125210545,8.187419e-7,0.00002025773,0.00006503638,0.0006009329,0.00018041249,0.99346817,0.0007418798,0.00484583],"study_design_scores_gemma":[0.0000051791963,0.000008039119,0.00007944252,0.0000067453025,0.0000011634963,0.000025697202,0.00004656647,0.0015557044,0.00019503322,0.9922735,0.0057988963,0.0000040422074],"about_ca_topic_score_codex":0.0016395843,"about_ca_topic_score_gemma":0.0015133662,"teacher_disagreement_score":0.0089916345,"about_ca_system_score_codex":0.0010450692,"about_ca_system_score_gemma":0.0005644718,"threshold_uncertainty_score":0.03008002},"labels":[],"label_agreement":null}]}