{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.139229,0.00070995523,0.85006887,0.0052076024,0.00078874454,0.00035405028,0.00000271875,0.00054621807,0.0030928669],"genre_scores_gemma":[0.3927939,0.00009527119,0.6065933,0.000367188,0.00008719784,0.000014521124,0.000002255073,0.000012270015,0.000034074954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980566,0.0003444529,0.0004827475,0.00045868583,0.00023788562,0.0004196502],"domain_scores_gemma":[0.99355286,0.0014880985,0.00014639132,0.004610766,0.00007344405,0.00012841797],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00060340157,0.00021619996,0.00029026234,0.00025037822,0.0005094864,0.00013163078,0.0064262873,0.000091931484,0.000026690454],"category_scores_gemma":[0.00021934797,0.00021820125,0.00013146472,0.0009446226,0.00020607797,0.0005569468,0.0034545378,0.00063133147,0.00014904655],"study_design_candidate":"design_other","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.0000032524645,0.0002222443,0.0025327445,0.0000046428663,0.000020645464,0.000026070811,0.00090152473,0.00009312887,0.00014828349,0.0018613406,0.00054530404,0.99364084],"study_design_scores_gemma":[0.003065936,0.000699958,0.31726667,0.0002445272,0.00002392764,0.0014097731,0.000099074634,0.5768339,0.0015296686,0.018331423,0.07807842,0.002416726],"about_ca_topic_score_codex":0.00018819426,"about_ca_topic_score_gemma":0.000018002102,"teacher_disagreement_score":0.9912241,"about_ca_system_score_codex":0.000101678794,"about_ca_system_score_gemma":0.00014059062,"threshold_uncertainty_score":0.9989494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.967012,0.00017752305,0.01874017,0.011795169,0.00009337292,0.0011141916,0.00003755938,0.00007909159,0.0009509444],"genre_scores_gemma":[0.7433816,0.000057259786,0.2559807,0.00045855032,0.00001826247,0.00004855263,0.00001860048,0.000015368685,0.000021073647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848104,0.00026298422,0.0005956263,0.00026055874,0.00018620041,0.00021359726],"domain_scores_gemma":[0.9929956,0.0035950937,0.00024038054,0.0028313126,0.0002946714,0.00004294349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040018777,0.00019708554,0.00033984074,0.00016757153,0.00027671602,0.00003728368,0.0014937938,0.00009961338,0.000007620112],"category_scores_gemma":[0.0016040676,0.00016321082,0.00009689474,0.00073360413,0.00041410205,0.00025961245,0.00072454015,0.0002675542,0.0000018536507],"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.000060543614,0.0011271175,0.0050818073,0.00010836702,0.00012586224,2.5381283e-7,0.008117016,0.00015884204,0.002306109,0.97511405,0.001043533,0.0067564924],"study_design_scores_gemma":[0.0014446675,0.00015667135,0.11779123,0.00016038312,0.00003735023,0.000008783569,0.0003979133,0.02279877,0.0010158768,0.8544689,0.0014374292,0.00028205145],"about_ca_topic_score_codex":0.00001492173,"about_ca_topic_score_gemma":0.00006549058,"teacher_disagreement_score":0.23724054,"about_ca_system_score_codex":0.000055130666,"about_ca_system_score_gemma":0.00012250587,"threshold_uncertainty_score":0.6655544},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5820331,0.00025903835,0.41621447,0.00011956962,0.00010661722,0.0006214426,0.000008950398,0.000028111692,0.0006087033],"genre_scores_gemma":[0.967873,0.000053815376,0.0318796,0.000022967182,0.000020508794,0.00011226459,0.000014883721,0.0000124469225,0.000010518601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803966,0.00085102767,0.0006474684,0.00015905991,0.00014699931,0.00015576897],"domain_scores_gemma":[0.9954922,0.002195745,0.00018211134,0.0020456952,0.00005332692,0.000030905932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005476237,0.00012981473,0.00028980905,0.00017409757,0.00011207871,0.00003511114,0.0012218951,0.000075512864,0.0000136303015],"category_scores_gemma":[0.00024690057,0.00009612881,0.00004421178,0.00035215713,0.00018120657,0.00012293506,0.0005310697,0.0002171945,0.0000032209216],"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.0000061868313,0.00039745242,0.0049117845,0.000048607468,0.000022150069,7.143869e-7,0.005488005,0.00002362818,0.000028349694,0.9864667,0.000011339589,0.002595104],"study_design_scores_gemma":[0.000615626,0.000047223275,0.10548761,0.00022469115,0.000039621787,0.000012722422,0.0008726419,0.109060004,0.000005259523,0.78344053,0.00001826922,0.00017582651],"about_ca_topic_score_codex":0.0003042455,"about_ca_topic_score_gemma":0.0004104241,"teacher_disagreement_score":0.3858399,"about_ca_system_score_codex":0.000027047956,"about_ca_system_score_gemma":0.000021063124,"threshold_uncertainty_score":0.3920019},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93822163,0.00040527093,0.04810296,0.0016962243,0.00027712726,0.0007612032,0.000013448731,0.0005594741,0.009962667],"genre_scores_gemma":[0.56440055,0.00018445551,0.43481216,0.0001511836,0.00010288249,0.000046259935,0.000012532625,0.00004335021,0.00024661722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792224,0.00017000073,0.00094790437,0.00030624843,0.00027192375,0.0003816788],"domain_scores_gemma":[0.991239,0.0038417266,0.00029181704,0.004426786,0.00010804063,0.00009261905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046828503,0.00025504318,0.00047249676,0.00025031707,0.0003664338,0.000059106344,0.0025592155,0.00012597338,0.00004084268],"category_scores_gemma":[0.001156708,0.00026632278,0.00013128998,0.0003709797,0.00035378648,0.00028582456,0.0019872105,0.00048534735,0.000113009846],"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.000037769296,0.0027484447,0.014046149,0.00049081194,0.0003121996,0.00013830469,0.011044439,0.00044790993,0.0017016251,0.9006649,0.01074842,0.057619013],"study_design_scores_gemma":[0.0007132281,0.000035314468,0.016781636,0.00030261395,0.000027432872,0.00020206769,0.00009923026,0.005763894,0.00024342423,0.97438765,0.0009583411,0.00048516155],"about_ca_topic_score_codex":0.000121452395,"about_ca_topic_score_gemma":0.00032578697,"teacher_disagreement_score":0.3867092,"about_ca_system_score_codex":0.0001662823,"about_ca_system_score_gemma":0.00013012045,"threshold_uncertainty_score":0.9999789},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008373936,0.0001466592,0.98780113,0.002501699,0.0002715468,0.00061144936,0.00009059189,0.00009816681,0.0001048001],"genre_scores_gemma":[0.49204674,0.000017326423,0.50768113,0.00007095675,0.00004023578,0.000055626828,0.00007517005,0.000010457614,0.000002365774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971628,0.00040706518,0.0011748883,0.00043329928,0.00042031417,0.00040158757],"domain_scores_gemma":[0.99298686,0.0035492799,0.0004784505,0.0024496168,0.00041814175,0.000117677075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005162609,0.00024295683,0.0005733498,0.00034484192,0.00044482172,0.000040902924,0.004027535,0.00011150953,0.00001774962],"category_scores_gemma":[0.00032480469,0.00025224258,0.00026099212,0.0010394346,0.0009094477,0.00041941385,0.002110851,0.0003537717,0.0000059517183],"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.0000112284315,0.0020657675,0.00080410903,0.00006760038,0.00010283489,0.0000012753443,0.0012950095,0.008892643,0.00019133055,0.9155512,0.00022212086,0.07079489],"study_design_scores_gemma":[0.00081517705,0.0001850377,0.02679933,0.000059193957,0.000013751977,0.000021149033,0.000008516358,0.7101097,0.00008529162,0.2615446,0.00013584942,0.00022239401],"about_ca_topic_score_codex":0.00018239304,"about_ca_topic_score_gemma":0.000016041839,"teacher_disagreement_score":0.70121706,"about_ca_system_score_codex":0.00006903086,"about_ca_system_score_gemma":0.00033970122,"threshold_uncertainty_score":0.99999297},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049637174,0.0009426719,0.98090315,0.008093212,0.0012439408,0.0003001147,8.476297e-7,0.0002477279,0.0033046142],"genre_scores_gemma":[0.12982051,0.00017947421,0.8692609,0.0004961517,0.00011803993,0.000073127405,0.000007080515,0.00001104888,0.000033668635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767214,0.0007941445,0.0005031042,0.00032926953,0.00035508577,0.0003462715],"domain_scores_gemma":[0.9900909,0.001196783,0.0001692665,0.008224669,0.00021134618,0.0001070497],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0029117088,0.00015948342,0.00015760557,0.00014348829,0.0004664883,0.00046025033,0.012194381,0.00007845067,0.000001924911],"category_scores_gemma":[0.0005332512,0.00013407817,0.000058632846,0.0009381298,0.00023372407,0.000819654,0.0061175893,0.00043957977,0.00010123961],"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.0000037899738,0.0000732648,0.0012052738,0.0000026603955,0.000012549026,0.0000014065484,0.0016587644,0.0002968569,0.00000809855,0.5270539,0.0026510758,0.46703237],"study_design_scores_gemma":[0.00038086026,0.00008501956,0.010496759,0.000034848486,0.000004482355,0.00003460432,0.00005664806,0.797322,0.000075921096,0.102700986,0.08853679,0.00027108644],"about_ca_topic_score_codex":0.00004809508,"about_ca_topic_score_gemma":0.000058356163,"teacher_disagreement_score":0.79702514,"about_ca_system_score_codex":0.00018394417,"about_ca_system_score_gemma":0.00016515602,"threshold_uncertainty_score":0.9931501},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8314393,0.0033470236,0.0963103,0.028294308,0.0027214983,0.0022254325,0.00012017228,0.0010244374,0.034517523],"genre_scores_gemma":[0.57453954,0.0005097308,0.41869596,0.0008656238,0.0005441509,0.00044344037,0.00015659099,0.00007230309,0.0041726413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983535,0.0002966058,0.000654764,0.00026033574,0.00017605734,0.0002587476],"domain_scores_gemma":[0.9950204,0.0015607205,0.00014830189,0.0029197682,0.00017325205,0.00017755982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010395616,0.00020001005,0.00034887652,0.00019100722,0.00032777697,0.0000824338,0.0008978544,0.00012373565,0.0001346953],"category_scores_gemma":[0.001036735,0.00018509604,0.00006901011,0.00038502365,0.00024512075,0.00024319188,0.0015219561,0.0003428256,0.00012186029],"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.00001859259,0.0008186159,0.0013686058,0.000049867253,0.00008081993,0.0000013349521,0.0019539176,0.000014030406,0.000010113046,0.69041824,0.2846492,0.020616645],"study_design_scores_gemma":[0.0010683875,0.00019958749,0.00033114932,0.00023384826,0.000083466046,0.00005019301,0.0004107536,0.013427609,0.000027374246,0.722987,0.26078776,0.00039286973],"about_ca_topic_score_codex":0.000055804332,"about_ca_topic_score_gemma":0.00016551997,"teacher_disagreement_score":0.32238567,"about_ca_system_score_codex":0.000094226736,"about_ca_system_score_gemma":0.0000821826,"threshold_uncertainty_score":0.7547997},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44636953,0.0002274049,0.49252468,0.05555523,0.0004403648,0.00058535323,0.0000035528406,0.00023526266,0.0040586223],"genre_scores_gemma":[0.86012006,0.000034216046,0.13846308,0.0013343226,0.000020305759,0.000010740024,0.000006576071,0.00000353652,0.000007150813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986967,0.00028258312,0.00039690014,0.00024913807,0.00020586264,0.00016884353],"domain_scores_gemma":[0.9945406,0.0015483969,0.00017415425,0.0036196292,0.00008171368,0.000035558623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225207,0.00011773645,0.00017265361,0.00019057584,0.00016153973,0.00008758845,0.0040793912,0.000043226417,0.0000075224757],"category_scores_gemma":[0.00014414698,0.00009492956,0.000067979345,0.00096428825,0.000127427,0.00030952418,0.0008884551,0.00022418216,0.000024821842],"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.0000037744207,0.00012941047,0.00028612633,0.0000016442777,0.000008503849,9.1311205e-7,0.00065022794,0.0005128534,0.00014218768,0.7047634,0.001156452,0.2923445],"study_design_scores_gemma":[0.00040687172,0.0001515057,0.031560257,0.00006288859,0.0000038860844,0.000016052409,0.000021379432,0.23927408,0.0013046095,0.72677904,0.0002592475,0.00016016245],"about_ca_topic_score_codex":0.00003553362,"about_ca_topic_score_gemma":0.0000113438555,"teacher_disagreement_score":0.41375053,"about_ca_system_score_codex":0.00003662209,"about_ca_system_score_gemma":0.00005713725,"threshold_uncertainty_score":0.75805914},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2257479,0.0023096653,0.76035094,0.006417675,0.00044038313,0.00026128776,0.0000018111034,0.00032805704,0.004142287],"genre_scores_gemma":[0.65788347,0.00014678555,0.3413469,0.0005617522,0.00003485957,0.000008484163,0.0000021306466,0.0000051220686,0.000010532552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987069,0.0001928928,0.00034276125,0.00033959936,0.00012764714,0.00029023804],"domain_scores_gemma":[0.99498177,0.0011410997,0.000080164355,0.0036585794,0.000048739428,0.000089657704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015984518,0.0001368775,0.00016479255,0.0003502819,0.00025615696,0.00020183738,0.0042462265,0.000065573484,0.000008162772],"category_scores_gemma":[0.000059088616,0.00013939239,0.00005155926,0.00084809423,0.00025173445,0.0005034807,0.0029102324,0.00023548547,0.000018856384],"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.0000067893593,0.00014742,0.010185028,0.0000074442146,0.000023973047,0.0000065311538,0.001919491,0.000013825391,0.00034599734,0.6067245,0.0005590008,0.38006],"study_design_scores_gemma":[0.0010325247,0.0002135215,0.17607448,0.00017664694,0.0000168528,0.00015556277,0.00016655565,0.029877149,0.0013401821,0.76094985,0.029087579,0.00090911664],"about_ca_topic_score_codex":0.000051595493,"about_ca_topic_score_gemma":0.0000825243,"teacher_disagreement_score":0.43213555,"about_ca_system_score_codex":0.000027392665,"about_ca_system_score_gemma":0.000039269795,"threshold_uncertainty_score":0.7890616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49284866,0.00028978792,0.47786868,0.013511942,0.0016534051,0.00036057027,0.000003731165,0.00091404445,0.012549178],"genre_scores_gemma":[0.63704354,0.000026001759,0.36236843,0.00048418227,0.000046645207,0.000013466252,0.000004129297,0.000006225023,0.0000073732535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989199,0.000097460084,0.00029467818,0.00029959404,0.00014229969,0.00024603464],"domain_scores_gemma":[0.99188936,0.00074211025,0.000079569756,0.007149907,0.00006306642,0.000076001896],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00059853966,0.00013752753,0.00013966937,0.00026648244,0.00022648083,0.00021707106,0.009341316,0.000084604864,0.000035178884],"category_scores_gemma":[0.00006803376,0.00014370926,0.00008741031,0.00074994407,0.00016867867,0.0004929038,0.0032269654,0.00070305454,0.00012956445],"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.00000132158,0.00019047986,0.003908031,0.0000030386789,0.000008858259,0.0000028376744,0.00044171594,0.0000068897425,0.00040560044,0.7088483,0.00046795313,0.28571498],"study_design_scores_gemma":[0.0005608385,0.00006224401,0.26034248,0.0000494155,0.000005310083,0.00006750666,0.00001343233,0.026884435,0.00024048149,0.66535,0.04590149,0.00052233884],"about_ca_topic_score_codex":0.000027772321,"about_ca_topic_score_gemma":0.00026325035,"teacher_disagreement_score":0.28519267,"about_ca_system_score_codex":0.000013014042,"about_ca_system_score_gemma":0.000070538736,"threshold_uncertainty_score":0.99601865},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58193254,0.00055227755,0.41219893,0.0032746645,0.00037723363,0.0005353783,0.0000030288563,0.00024771603,0.0008782194],"genre_scores_gemma":[0.7164981,0.00009514835,0.2830367,0.00026817172,0.000027952285,0.00004325408,0.00001130165,0.000008971934,0.00001040558],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99831396,0.00024354008,0.00051381846,0.00047840964,0.00015145022,0.0002988349],"domain_scores_gemma":[0.9964474,0.00041377003,0.0001361223,0.0028558762,0.000054864195,0.000091953945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048633097,0.00018804311,0.00022445158,0.00041667683,0.00015054675,0.00011207098,0.0032641017,0.00009563468,0.0000068574363],"category_scores_gemma":[0.00007165804,0.00020104565,0.000044160286,0.00070732005,0.00012954739,0.000732326,0.0037212614,0.00030792685,0.000044762455],"study_design_candidate":"design_other","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.00001756862,0.00068583764,0.047032587,0.00001593353,0.000015333553,0.000008547297,0.00901979,0.00011778384,0.000277699,0.04856262,0.00059143285,0.8936549],"study_design_scores_gemma":[0.0011070383,0.00008423087,0.5748917,0.00007365669,0.0000034221848,0.000015967893,0.000023554823,0.3836091,0.0002351381,0.038418002,0.0011967315,0.00034146698],"about_ca_topic_score_codex":0.0005431832,"about_ca_topic_score_gemma":0.00046840977,"teacher_disagreement_score":0.8933134,"about_ca_system_score_codex":0.00008095764,"about_ca_system_score_gemma":0.00005496277,"threshold_uncertainty_score":0.8198404},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06300663,0.0006647279,0.9349081,0.000073429655,0.000095000505,0.00059142645,0.000008105815,0.0004725134,0.00018004453],"genre_scores_gemma":[0.6387401,0.000053673517,0.3609888,0.000019922049,0.00005582877,0.00006355105,0.00005112337,0.00002526927,0.0000016845136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908346,0.000016220652,0.00045626558,0.0001411198,0.00009014508,0.00021281799],"domain_scores_gemma":[0.9981013,0.0009229676,0.00006288407,0.00081165903,0.00005236533,0.00004884492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046323784,0.00014515013,0.00021325133,0.00018220562,0.0000948852,0.00009108905,0.00047084634,0.00009729706,0.0000021100304],"category_scores_gemma":[0.00003964653,0.00015656391,0.00003749019,0.00015603969,0.000016640612,0.00020126285,0.00024463085,0.00015411318,0.0000030565998],"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.000031459498,0.000890803,0.008162857,0.001674449,0.0003960271,0.0000053279537,0.029703902,0.23865683,0.1630321,0.032651972,0.0019941896,0.5228001],"study_design_scores_gemma":[0.00042972437,0.000012507743,0.0025461519,0.0002808939,0.0000074785453,0.0000022741701,0.000056701916,0.99124736,0.00094573403,0.002878213,0.0014225185,0.00017042564],"about_ca_topic_score_codex":0.000017687606,"about_ca_topic_score_gemma":0.000034633264,"teacher_disagreement_score":0.75259054,"about_ca_system_score_codex":0.00005491891,"about_ca_system_score_gemma":0.000005582746,"threshold_uncertainty_score":0.6384491},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38900506,0.00307477,0.5654485,0.03882701,0.0008170061,0.0012186164,0.000011116806,0.00030539295,0.001292489],"genre_scores_gemma":[0.94101393,0.00007447995,0.058313485,0.0003073201,0.00019241637,0.000043451615,0.000015045295,0.000015771951,0.000024109315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975963,0.00082851923,0.0005515283,0.0002508062,0.0002627216,0.0005101131],"domain_scores_gemma":[0.9942057,0.0018073228,0.00025780647,0.0036093357,0.00004844544,0.00007140415],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011219124,0.00018920444,0.00025931394,0.0002362643,0.00042916805,0.00017322142,0.0060129766,0.000066506436,0.0000018049535],"category_scores_gemma":[0.000027437673,0.00012189575,0.00006935661,0.0013455685,0.00038122426,0.00083581504,0.004629662,0.00046392233,0.000008793212],"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.000038822564,0.0010381958,0.044922926,0.000060280203,0.00012321185,0.0000050049953,0.03676382,0.017834032,0.000116493895,0.75449103,0.008751751,0.13585445],"study_design_scores_gemma":[0.0008849404,0.00010283032,0.20601861,0.00019932564,0.000014714754,0.00005637389,0.00056526373,0.78349483,0.000051846484,0.0032434487,0.0049988218,0.00036899836],"about_ca_topic_score_codex":0.0006373295,"about_ca_topic_score_gemma":0.00021785336,"teacher_disagreement_score":0.7656608,"about_ca_system_score_codex":0.000070251706,"about_ca_system_score_gemma":0.00018155876,"threshold_uncertainty_score":0.999365},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033049587,0.0016927505,0.94222,0.008922114,0.00046155634,0.0003407431,0.0000045739976,0.0006495603,0.012659131],"genre_scores_gemma":[0.55679196,0.00006155561,0.44232228,0.00060908287,0.000079619895,0.000028409922,0.000018999242,0.000009643777,0.00007843603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982811,0.00014809292,0.00054391415,0.00041846815,0.00021098596,0.00039742776],"domain_scores_gemma":[0.99335253,0.0005715871,0.00015289843,0.005775036,0.00008373455,0.00006423459],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00030983292,0.00020257689,0.00021691382,0.0002392485,0.0002422058,0.00018939852,0.0071363742,0.000091324306,0.000011039829],"category_scores_gemma":[0.0000423506,0.00020683178,0.00007734227,0.0008223806,0.00014029759,0.0007287186,0.003068369,0.00037940606,0.0002380412],"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.0000027407293,0.0006586153,0.0052194484,0.000011668934,0.000014929158,0.000029619752,0.00032204902,0.005828421,0.00016885165,0.8241491,0.0077930004,0.15580161],"study_design_scores_gemma":[0.0007636135,0.000070213304,0.14777422,0.00005556786,0.0000058746664,0.00006150169,0.000009947232,0.0820557,0.00030077717,0.7161434,0.052145537,0.00061361585],"about_ca_topic_score_codex":0.0001841191,"about_ca_topic_score_gemma":0.0002588941,"teacher_disagreement_score":0.5237424,"about_ca_system_score_codex":0.00007657473,"about_ca_system_score_gemma":0.00006276262,"threshold_uncertainty_score":0.99823546},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03822117,0.00037730133,0.95106894,0.00832503,0.0005551332,0.00025195855,0.000006283502,0.00015896812,0.0010352444],"genre_scores_gemma":[0.6587225,0.000025061854,0.3405995,0.00052703236,0.00005669977,0.000018932275,0.000028765284,0.0000067523474,0.000014742375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983156,0.00027939142,0.0005746663,0.00030310138,0.00030018832,0.00022706638],"domain_scores_gemma":[0.9955599,0.00081883586,0.00020121307,0.0030493857,0.00021400418,0.00015666762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503105,0.00015420275,0.00023573097,0.00032918528,0.00009989412,0.00010552727,0.0049660206,0.00007095541,0.000007357611],"category_scores_gemma":[0.00030527808,0.00016147786,0.00006274141,0.0009904258,0.00013429833,0.0007374302,0.00319233,0.0002257571,0.00006755073],"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.000016978562,0.0007498703,0.006087879,0.000019841858,0.000056754077,0.00000834856,0.005734719,0.0062146136,0.00016382488,0.7444321,0.004902307,0.23161276],"study_design_scores_gemma":[0.0011383598,0.00012506891,0.019866858,0.00006476612,0.0000054115435,0.00001742226,0.000026187918,0.6953042,0.00018105046,0.28023478,0.002753944,0.00028191588],"about_ca_topic_score_codex":0.000103892984,"about_ca_topic_score_gemma":0.00007917979,"teacher_disagreement_score":0.6890896,"about_ca_system_score_codex":0.00007522444,"about_ca_system_score_gemma":0.0003222062,"threshold_uncertainty_score":0.9228184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055038135,0.00013003539,0.9419721,0.0015992614,0.00007248636,0.0009917645,0.000003704106,0.00010844431,0.00008408891],"genre_scores_gemma":[0.29092202,0.00021548147,0.70849276,0.00006540387,0.000022327054,0.00014200673,0.000099821045,0.000025112506,0.000015083225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982737,0.0003560849,0.0005761251,0.0003065471,0.00023147275,0.00025608807],"domain_scores_gemma":[0.9972527,0.0010302669,0.0001600177,0.0012802692,0.00021050073,0.00006622873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002658519,0.00018019437,0.0002506804,0.0005190858,0.00013343191,0.00014052578,0.00083079585,0.000115603754,0.000074284006],"category_scores_gemma":[0.0003098424,0.00019364977,0.000026858468,0.00073382974,0.0001242447,0.00059386576,0.0009208974,0.00036457132,0.000012046081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016186952,0.0008819298,0.017702194,0.00014979411,0.00006878309,0.0000038486587,0.004625529,0.5182498,0.00017231399,0.023080582,0.0007942324,0.43425483],"study_design_scores_gemma":[0.00079036725,0.000020810661,0.019835735,0.000045820314,0.000003982246,0.0000053951553,0.000062424595,0.86226463,0.000017422046,0.11677958,0.000011969183,0.00016184036],"about_ca_topic_score_codex":0.00008382445,"about_ca_topic_score_gemma":0.0001267897,"teacher_disagreement_score":0.43409297,"about_ca_system_score_codex":0.00016069153,"about_ca_system_score_gemma":0.000032827495,"threshold_uncertainty_score":0.7896809},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121926535,0.00033479655,0.9834195,0.0014292208,0.000773313,0.00081265316,0.000013578359,0.0003794491,0.0006448448],"genre_scores_gemma":[0.23644875,0.00004241148,0.76236945,0.0008025622,0.00016544081,0.0000948564,0.0000316365,0.000024236906,0.000020647856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975046,0.0002883588,0.0007831882,0.00066198054,0.00019155712,0.0005703436],"domain_scores_gemma":[0.9944156,0.0011403818,0.00031578736,0.0037998934,0.00018380868,0.0001445617],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006927043,0.0003135079,0.0004179927,0.00043032103,0.00040388267,0.00019034666,0.0071967402,0.00012975693,0.000007753885],"category_scores_gemma":[0.00008902544,0.0003416045,0.0001821819,0.00078906363,0.00017627422,0.00067060825,0.0038638243,0.00033638874,0.000063889536],"study_design_candidate":"design_other","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.000006884551,0.00028289921,0.00027050526,0.000009147278,0.000042049815,0.0000038110932,0.0041382173,0.00006370685,0.00004298411,0.055584252,0.0008523714,0.9387032],"study_design_scores_gemma":[0.0013749279,0.00020937312,0.009379307,0.00011108538,0.000016152238,0.000048744278,0.000060606195,0.85256696,0.00056624383,0.13301012,0.002059087,0.00059740816],"about_ca_topic_score_codex":0.00019967694,"about_ca_topic_score_gemma":0.00005607837,"teacher_disagreement_score":0.93810576,"about_ca_system_score_codex":0.00015004678,"about_ca_system_score_gemma":0.0001599409,"threshold_uncertainty_score":0.9999036},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019606875,0.0001336341,0.97145265,0.0074662254,0.00029466648,0.00047230473,0.0000076071956,0.00018206576,0.00038394536],"genre_scores_gemma":[0.5034875,0.00002255584,0.4953342,0.0010320136,0.000047110436,0.000051920324,0.0000066297384,0.000011204694,0.0000068168024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720323,0.0010768403,0.0006686749,0.00043204892,0.00024293899,0.00037623866],"domain_scores_gemma":[0.98940647,0.0026583108,0.00023796939,0.0074576703,0.00012042211,0.00011916153],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001356087,0.00025681788,0.00042869349,0.00033616365,0.00036756918,0.00018955504,0.010962027,0.00008023695,0.000004837885],"category_scores_gemma":[0.000103886116,0.00021315015,0.00016002204,0.0012804883,0.00026756292,0.00028428863,0.0065541132,0.00036240456,0.000051877712],"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.000012767725,0.00045803667,0.0028508324,0.000009836297,0.000063257976,0.0000015921428,0.0031930453,0.001641997,0.00009262435,0.342382,0.0006266881,0.6486673],"study_design_scores_gemma":[0.0011760484,0.00035257183,0.06388675,0.00017653893,0.0000239829,0.000022603354,0.000026138769,0.7687775,0.00021337505,0.15142551,0.013385806,0.0005331504],"about_ca_topic_score_codex":0.0003128901,"about_ca_topic_score_gemma":0.00014481341,"teacher_disagreement_score":0.7671355,"about_ca_system_score_codex":0.000032738422,"about_ca_system_score_gemma":0.000037594717,"threshold_uncertainty_score":0.9943891},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65667725,0.0010436678,0.00024239368,0.0035248972,0.0003559117,0.00026379956,0.000011713007,0.00017643724,0.3377039],"genre_scores_gemma":[0.99299866,0.00006003412,0.004778826,0.0008814919,0.00020988764,0.000026066264,0.0000633038,0.000014450614,0.000967268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920106,0.00009731075,0.0002825992,0.00015024828,0.00011881936,0.00014996839],"domain_scores_gemma":[0.998315,0.0002655437,0.000064329266,0.0011760462,0.00011243648,0.000066677174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035439697,0.00011402955,0.00013041504,0.00016404573,0.0002813246,0.0009130886,0.0009348227,0.000027771819,0.0000842002],"category_scores_gemma":[0.000093477116,0.00011017802,0.000026027707,0.00005709958,0.00028449736,0.0008095832,0.00091161946,0.00025254165,0.00005611243],"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.000007214585,0.00010649561,0.0010503966,0.000006726852,0.000010423273,0.0000025125196,0.031025052,0.0000014191095,0.0000019696613,0.85963464,0.0020961629,0.106056966],"study_design_scores_gemma":[0.0018302992,0.0007920075,0.0065095234,0.00051820534,0.0000335197,0.000041707804,0.02657216,0.005259234,0.00002744436,0.60824174,0.3492655,0.0009086788],"about_ca_topic_score_codex":0.00021328138,"about_ca_topic_score_gemma":0.0022558093,"teacher_disagreement_score":0.3471693,"about_ca_system_score_codex":0.000045769975,"about_ca_system_score_gemma":0.00002971292,"threshold_uncertainty_score":0.88049346},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24974927,0.0002691207,0.74121624,0.0066486304,0.0007336712,0.0005347519,0.0000088992865,0.00043911708,0.00040027764],"genre_scores_gemma":[0.5548533,0.000047739693,0.44393995,0.0008143291,0.0001794464,0.000044635162,0.000044380522,0.000016947703,0.000059273854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803954,0.000105512416,0.00064621854,0.00047871252,0.0001986878,0.00053132616],"domain_scores_gemma":[0.9948707,0.0013084422,0.00017423693,0.0034512978,0.000066010914,0.0001292769],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00068320154,0.00023759008,0.00027922718,0.00043940963,0.00032741585,0.00025957977,0.0058726138,0.00010973355,0.000008901586],"category_scores_gemma":[0.00005608914,0.00025299905,0.00009146632,0.0009270238,0.00013534323,0.001202919,0.0033576617,0.00031442379,0.00005664985],"study_design_candidate":"design_other","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.000042373664,0.00040815296,0.0032001215,0.000035339242,0.00003401454,0.0000059764106,0.000941136,0.00037399132,0.00011277132,0.09748052,0.006305319,0.8910603],"study_design_scores_gemma":[0.0028412456,0.00045664186,0.14930736,0.0001564012,0.00001964663,0.00006504193,0.000024511082,0.73199844,0.002892659,0.07472668,0.03653145,0.0009798999],"about_ca_topic_score_codex":0.000047934285,"about_ca_topic_score_gemma":0.0000406459,"teacher_disagreement_score":0.8900804,"about_ca_system_score_codex":0.0000797863,"about_ca_system_score_gemma":0.00014480148,"threshold_uncertainty_score":0.99999225},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0914432,0.0001750996,0.90434074,0.0014580358,0.00072574714,0.0006407242,0.000004724257,0.0007571013,0.00045462494],"genre_scores_gemma":[0.51445955,0.000014248844,0.48503593,0.00018950149,0.00014314939,0.00009109261,0.000020933758,0.000015616548,0.000029986773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978828,0.00017195762,0.000727908,0.0005093623,0.00023528816,0.00047272822],"domain_scores_gemma":[0.99570554,0.0012154884,0.00025832813,0.002479068,0.00023547556,0.000106118765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056264276,0.00026013568,0.0003516099,0.00037709385,0.00079402025,0.00021263346,0.0039875642,0.00013124313,0.0000096017075],"category_scores_gemma":[0.00014149207,0.00028215672,0.000104478764,0.0012584878,0.00009960942,0.0009104431,0.0015652236,0.00032678386,0.00004938915],"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.000040136958,0.0015040449,0.007736146,0.00040211238,0.00026382034,0.000015107584,0.00563495,0.008824261,0.001411546,0.3093933,0.01658979,0.6481848],"study_design_scores_gemma":[0.0008241216,0.00008243834,0.011648437,0.00011791725,0.000009944942,0.0001899975,0.000016300066,0.98108625,0.000071606955,0.003217681,0.002407068,0.00032821065],"about_ca_topic_score_codex":0.00029408155,"about_ca_topic_score_gemma":0.00010017633,"teacher_disagreement_score":0.972262,"about_ca_system_score_codex":0.00031445513,"about_ca_system_score_gemma":0.0005145346,"threshold_uncertainty_score":0.99996305},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039194882,0.00018201306,0.9960304,0.0013890478,0.0001621093,0.00071956747,0.000005351934,0.000525123,0.00059446605],"genre_scores_gemma":[0.050911486,0.00017408338,0.9480566,0.0003056274,0.000050069128,0.00042295727,0.00004470801,0.000016516387,0.00001800297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862087,0.00014441181,0.00045537818,0.0004087243,0.000108692744,0.0002619158],"domain_scores_gemma":[0.99430174,0.00049663906,0.0001613321,0.0047779265,0.00020391133,0.000058451467],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005013503,0.00017290603,0.00018859448,0.00034847774,0.0002763083,0.000120153134,0.006410785,0.00010329347,0.000007550302],"category_scores_gemma":[0.00007964293,0.00019229946,0.00009728306,0.0007353417,0.00012483964,0.00048917864,0.0024363461,0.00020715124,0.000010728487],"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.00001014268,0.0006272572,0.0010164217,0.000027223126,0.000028812317,9.931582e-7,0.0021978498,0.0007198919,0.000049041944,0.5029321,0.0004456577,0.49194464],"study_design_scores_gemma":[0.0003152556,0.00008910932,0.0018418174,0.000042362688,0.000006246066,0.00000956966,0.000011828574,0.8760479,0.00060889055,0.11776221,0.0030037053,0.00026108933],"about_ca_topic_score_codex":0.00008085838,"about_ca_topic_score_gemma":0.00005969324,"teacher_disagreement_score":0.875328,"about_ca_system_score_codex":0.000061160776,"about_ca_system_score_gemma":0.000046933874,"threshold_uncertainty_score":0.998965},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48292676,0.0001326701,0.46524522,0.04811154,0.00039756054,0.00087451993,0.000005307638,0.00025159967,0.0020548522],"genre_scores_gemma":[0.8293745,0.000014366276,0.16923527,0.0012848024,0.000036333116,0.000026010955,0.000008521522,0.000009100267,0.000011104005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978264,0.00054448564,0.0006579157,0.00035625932,0.0002902095,0.00032475026],"domain_scores_gemma":[0.99182373,0.0030552857,0.00027080358,0.0046015372,0.00018022499,0.000068442874],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00064932613,0.00019769583,0.00027184456,0.00021351043,0.00031513014,0.00017731347,0.00753443,0.00006287485,0.000024844067],"category_scores_gemma":[0.0002715159,0.00015373332,0.00008985645,0.0010135677,0.000505599,0.000366638,0.0038232226,0.00040308296,0.00013889483],"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.000003135821,0.00026344237,0.00043585815,0.000008487319,0.00002326624,9.1120944e-7,0.0018583693,0.00075313513,0.00014934453,0.86807215,0.0029389984,0.12549293],"study_design_scores_gemma":[0.00031502912,0.0000669956,0.04426405,0.000081368584,0.0000021352778,0.0000050415274,0.000029636387,0.5841047,0.00019760783,0.37060508,0.0001625837,0.0001657773],"about_ca_topic_score_codex":0.00044028694,"about_ca_topic_score_gemma":0.00005783638,"teacher_disagreement_score":0.58335155,"about_ca_system_score_codex":0.00006610396,"about_ca_system_score_gemma":0.000070958384,"threshold_uncertainty_score":0.9978353},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029971102,0.00074892124,0.95456296,0.011393071,0.00060238986,0.0002751862,0.000003225601,0.0005587348,0.0018843795],"genre_scores_gemma":[0.5618718,0.00005350605,0.4370445,0.0007912941,0.00014926842,0.00002844992,0.000020457623,0.000012157614,0.000028520477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826646,0.0002423732,0.00047752328,0.0004020235,0.00030682146,0.00030481193],"domain_scores_gemma":[0.99256307,0.0006116526,0.0001553317,0.0063216104,0.0001749481,0.00017338035],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00056316133,0.00019035388,0.0002442595,0.00032098885,0.00017504818,0.00028309907,0.008044798,0.0000812023,0.0000054704833],"category_scores_gemma":[0.00033659488,0.00020109072,0.00007123693,0.0010558956,0.00007205888,0.0010970958,0.005992223,0.00038077938,0.0001428235],"study_design_candidate":"design_other","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.000014479953,0.0005915189,0.012340584,0.000023431998,0.0000720768,0.000020513377,0.0050392738,0.0014422458,0.00012335242,0.27011093,0.019663528,0.6905581],"study_design_scores_gemma":[0.001909685,0.00013865864,0.03501666,0.0001362858,0.000010878841,0.00005284574,0.00005379731,0.5532196,0.0001828366,0.33975783,0.06880954,0.0007113578],"about_ca_topic_score_codex":0.00014053972,"about_ca_topic_score_gemma":0.000025755191,"teacher_disagreement_score":0.6898467,"about_ca_system_score_codex":0.00021136798,"about_ca_system_score_gemma":0.00014208684,"threshold_uncertainty_score":0.99732214},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010685457,0.00019474393,0.98527676,0.0007266213,0.000073323165,0.000110702116,0.0000011090689,0.000579803,0.0023514905],"genre_scores_gemma":[0.5790389,0.00013978322,0.4205996,0.00012898438,0.000028152896,0.000026598233,0.000019967336,0.000013542372,0.000004424336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992953,0.000095122974,0.00026785635,0.00012850949,0.00007239139,0.00014082107],"domain_scores_gemma":[0.9973485,0.0003544628,0.000037518712,0.0021843612,0.000039037015,0.000036123234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014685557,0.00011040764,0.00016120053,0.00016901785,0.000050415412,0.000024030089,0.0013050163,0.000052941672,0.00001505493],"category_scores_gemma":[0.00007651952,0.00012019515,0.000044948785,0.00040730365,0.00006586055,0.00017508384,0.0005206323,0.00025287218,0.000057894256],"study_design_candidate":"design_other","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.000005772012,0.00018974443,0.0063970196,0.000029827823,0.00008929434,0.0000012023951,0.0011926504,0.01942492,0.0010403816,0.061209284,0.00603037,0.90438956],"study_design_scores_gemma":[0.000123514,0.000027239312,0.0030414471,0.000049232498,0.0000088444,0.0000024612916,0.000010223065,0.8828962,0.00033131414,0.09485273,0.01846213,0.00019465052],"about_ca_topic_score_codex":0.000013221643,"about_ca_topic_score_gemma":0.000045533503,"teacher_disagreement_score":0.9041949,"about_ca_system_score_codex":0.000067515924,"about_ca_system_score_gemma":0.000003265211,"threshold_uncertainty_score":0.4901416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0126149235,0.002210477,0.980067,0.0043156585,0.00019531389,0.00048881344,0.000007803431,0.000047880287,0.00005211752],"genre_scores_gemma":[0.45414087,0.00004353655,0.5457087,0.000036571313,0.00003490327,0.0000125422375,0.000011863499,0.000005642368,0.0000053854237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984422,0.00029430617,0.0005288441,0.00033517386,0.00019983336,0.00019969334],"domain_scores_gemma":[0.99066734,0.0033221603,0.0002584533,0.0054924516,0.00020310438,0.0000564583],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0015090922,0.000121125464,0.00023098389,0.00010767001,0.00016205697,0.00012066469,0.006292272,0.00004418877,2.8677684e-7],"category_scores_gemma":[0.001207121,0.00009504698,0.000026106267,0.00041409812,0.00025146359,0.00040213016,0.006408913,0.0001311299,9.638701e-7],"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.00003911919,0.000214479,0.0007422422,0.00011317526,0.0000908102,0.0000011719313,0.00534865,0.0007665619,0.0004127648,0.5232978,0.0033603497,0.4656129],"study_design_scores_gemma":[0.00042781356,0.00006706201,0.0016276223,0.00004689906,0.000009628058,0.00001424922,0.00006236741,0.5864033,0.00075899047,0.41005048,0.00041799946,0.000113549984],"about_ca_topic_score_codex":0.0000397861,"about_ca_topic_score_gemma":0.000013365299,"teacher_disagreement_score":0.5856368,"about_ca_system_score_codex":0.00001691578,"about_ca_system_score_gemma":0.00016856175,"threshold_uncertainty_score":0.9990842},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11798065,0.00074200594,0.8748828,0.0034757913,0.0004590776,0.00029021857,0.000001598546,0.0005224377,0.0016454064],"genre_scores_gemma":[0.5577342,0.00008815873,0.44149095,0.0005675773,0.000056035897,0.000028906336,0.0000066377793,0.000010589354,0.000016989321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981248,0.00026577755,0.0005581643,0.0004557985,0.0002155649,0.00037990676],"domain_scores_gemma":[0.99476266,0.00033947336,0.0001988592,0.0044991532,0.000092667375,0.0001071897],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005270952,0.0002113911,0.0002361355,0.0003855765,0.0002761342,0.00014868758,0.0073774443,0.00008757073,0.000012334884],"category_scores_gemma":[0.00007408846,0.00022088179,0.00009192976,0.001094467,0.00012419102,0.0008744455,0.0048970236,0.00031970793,0.00010592196],"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.0000054357747,0.00038670521,0.005311216,0.00001880031,0.00003843772,0.000013352738,0.008448456,0.0001603957,0.00011492248,0.4742425,0.0008189624,0.5104408],"study_design_scores_gemma":[0.00054476014,0.000086190325,0.0372622,0.000095111805,0.000008299937,0.000033778175,0.000038989667,0.74575645,0.00048324562,0.21344914,0.0017758845,0.00046596996],"about_ca_topic_score_codex":0.00030223146,"about_ca_topic_score_gemma":0.00011590968,"teacher_disagreement_score":0.74559605,"about_ca_system_score_codex":0.000082190796,"about_ca_system_score_gemma":0.00007958526,"threshold_uncertainty_score":0.9979931},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21410163,0.0018261959,0.7478818,0.027828962,0.00253817,0.0009649318,0.0000073412266,0.0014916053,0.0033593178],"genre_scores_gemma":[0.680644,0.000041356627,0.31776813,0.0011311152,0.00023100754,0.00007302506,0.000038959344,0.000022270851,0.000050153183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971352,0.00044100426,0.0007249008,0.0006655702,0.00043235143,0.00060093973],"domain_scores_gemma":[0.99289423,0.00058163767,0.00020534293,0.0057873754,0.00019618272,0.0003352415],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00090962707,0.00033251705,0.00038218303,0.00042886627,0.00023949203,0.00047850353,0.009109363,0.0001438562,0.000008121861],"category_scores_gemma":[0.00016304196,0.00034683483,0.00013980026,0.0015039465,0.00022833198,0.0011281171,0.006018427,0.0005191863,0.00033716875],"study_design_candidate":"design_other","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.000018804507,0.0006761415,0.005030958,0.000011187113,0.00005129159,0.000022766111,0.0032899904,0.00046844097,0.00005299223,0.09506675,0.015486426,0.8798243],"study_design_scores_gemma":[0.0043306733,0.0005357398,0.028466526,0.00014066961,0.000026631766,0.0001883216,0.00011525442,0.6983447,0.00035940812,0.18023886,0.085686535,0.0015666868],"about_ca_topic_score_codex":0.00030142965,"about_ca_topic_score_gemma":0.00018646722,"teacher_disagreement_score":0.8782576,"about_ca_system_score_codex":0.00023745319,"about_ca_system_score_gemma":0.00035003075,"threshold_uncertainty_score":0.9998984},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44538924,0.0001497683,0.5380212,0.011839372,0.0002747862,0.00079188513,0.000005609247,0.0003597545,0.0031683485],"genre_scores_gemma":[0.6237347,0.000020411773,0.37525064,0.0005296284,0.00020813133,0.00010748722,0.00001326098,0.000050930703,0.00008480451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754107,0.00062783255,0.0006718211,0.00042517317,0.00029585013,0.0004382481],"domain_scores_gemma":[0.9886456,0.0041262377,0.00035578528,0.0066516893,0.00014050626,0.00008014753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008003363,0.0003452267,0.00045890003,0.00017339658,0.00048407886,0.00016133435,0.004605701,0.00013750662,0.00007003603],"category_scores_gemma":[0.0005858983,0.0002513112,0.00010412313,0.00046578675,0.00043745356,0.00027269372,0.0026904035,0.00092516915,0.000050441027],"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.000016010341,0.0002669348,0.0014443535,0.000035092744,0.00009808327,0.0000017631731,0.0023180703,0.00012054682,0.00009376891,0.93026686,0.0028678803,0.06247064],"study_design_scores_gemma":[0.0011629963,0.0001391331,0.0046765027,0.00021279207,0.000062512714,0.000031609106,0.00020097906,0.030596294,0.00031246117,0.95259213,0.009442104,0.00057048834],"about_ca_topic_score_codex":0.000027828162,"about_ca_topic_score_gemma":0.00024132118,"teacher_disagreement_score":0.17834546,"about_ca_system_score_codex":0.00011788257,"about_ca_system_score_gemma":0.000051030056,"threshold_uncertainty_score":0.9999939},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.978609,0.0001424611,0.020161381,0.0005307291,0.00022072927,0.00016518077,0.0000024421947,0.00005669102,0.00011137497],"genre_scores_gemma":[0.9837505,0.00010753454,0.016011283,0.00006162193,0.00002314762,0.00001365737,0.000016473936,0.000013914648,0.0000018176763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938184,0.00003809324,0.00028039204,0.00010541261,0.00008207967,0.00011218833],"domain_scores_gemma":[0.9987448,0.00012214376,0.000040603933,0.0010386985,0.00003099754,0.000022743292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017749099,0.00009255119,0.00013173121,0.00012775886,0.00004577312,0.000021665197,0.00061376014,0.000084977626,0.0000036962174],"category_scores_gemma":[0.00001630761,0.000082021004,0.000029986753,0.0004464883,0.000060267572,0.00007642464,0.00037217428,0.00036759916,0.0000022058402],"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.00003158928,0.0008724053,0.23755392,0.000205595,0.00013202426,0.0000033283648,0.005548803,0.21137187,0.0051457607,0.07184622,0.00069165166,0.46659684],"study_design_scores_gemma":[0.00018773884,0.000010645636,0.12159561,0.00002819633,0.00000472722,0.0000066940497,0.000016717368,0.8724923,0.000032510103,0.005190779,0.0003544004,0.0000796836],"about_ca_topic_score_codex":0.00008134684,"about_ca_topic_score_gemma":0.00025114603,"teacher_disagreement_score":0.6611204,"about_ca_system_score_codex":0.00002467858,"about_ca_system_score_gemma":0.000012863007,"threshold_uncertainty_score":0.33447194},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0123843225,0.0021440354,0.98309344,0.0008913146,0.00051149575,0.0006138143,0.000005291403,0.00033929365,0.000016996812],"genre_scores_gemma":[0.1889423,0.00005193788,0.8105061,0.00013369304,0.00020693212,0.00010146423,0.00002483823,0.000024583584,0.000008151937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978804,0.0001424261,0.0006905825,0.0005703899,0.00018018414,0.00053602096],"domain_scores_gemma":[0.99468344,0.0025307306,0.00017008769,0.002354745,0.000094555566,0.00016643817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017012851,0.00028644633,0.0003962107,0.0003701931,0.00030387205,0.00037666285,0.0033128406,0.00014613605,4.0095446e-7],"category_scores_gemma":[0.00021821709,0.00030731756,0.0000979704,0.0005070775,0.00009613059,0.00055474794,0.0027581353,0.00034020675,0.0000033444078],"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.000014119842,0.00021485763,0.0006947261,0.00010577402,0.00009607372,0.0000047475196,0.0022392403,0.020321397,0.00030591062,0.09176668,0.00029042558,0.88394606],"study_design_scores_gemma":[0.0006265494,0.000058737132,0.0084455935,0.000075849704,0.0000108823715,0.00004334645,0.000045386776,0.98514104,0.00007997553,0.0030663395,0.0020398682,0.00036643562],"about_ca_topic_score_codex":0.00008161764,"about_ca_topic_score_gemma":0.000018283561,"teacher_disagreement_score":0.9648196,"about_ca_system_score_codex":0.00010734213,"about_ca_system_score_gemma":0.00008003384,"threshold_uncertainty_score":0.9999379},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7286766,0.00006272244,0.26929653,0.0007071171,0.00018035507,0.00016463478,0.000044765005,0.000035782246,0.0008314501],"genre_scores_gemma":[0.92825836,0.000023149358,0.071254954,0.00007313847,0.00016459027,0.000018498069,0.00013462198,0.00001626947,0.000056403318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884814,0.0002183519,0.00038669925,0.00021248742,0.0001202077,0.0002141186],"domain_scores_gemma":[0.99653786,0.0005969262,0.00012250933,0.0026011346,0.00007390251,0.00006765613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109976434,0.00016422302,0.00028992974,0.00010387952,0.00016519369,0.000033128832,0.0013554513,0.000041997846,0.0000869431],"category_scores_gemma":[0.000014840224,0.00013380942,0.00011735725,0.0001741896,0.00019022713,0.0000727347,0.0013493496,0.00022993807,0.000018627576],"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.000021020387,0.0025733828,0.20456876,0.000039957555,0.00024098296,5.936168e-7,0.0013543651,0.00056143967,0.0040577953,0.33119664,0.0010790634,0.45430598],"study_design_scores_gemma":[0.0016130575,0.00015700753,0.2817377,0.0002131457,0.000086411506,0.0000025932213,0.000086519365,0.50327563,0.0017453944,0.20159853,0.008761506,0.0007225038],"about_ca_topic_score_codex":0.0003679219,"about_ca_topic_score_gemma":0.000045178156,"teacher_disagreement_score":0.5027142,"about_ca_system_score_codex":0.000011678379,"about_ca_system_score_gemma":0.000020333846,"threshold_uncertainty_score":0.54565895},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015801629,0.000087120294,0.9748614,0.0010067987,0.00044585092,0.00017551528,0.0000019690347,0.00019687638,0.0074228346],"genre_scores_gemma":[0.6635354,0.000037377937,0.33526367,0.0010596162,0.000032129068,0.000019719606,0.0000059619592,0.000006824231,0.000039293755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998796,0.00026231376,0.00031925488,0.00028582753,0.00013141855,0.00020522768],"domain_scores_gemma":[0.9943652,0.0008871732,0.0000979555,0.0045497552,0.00004337181,0.000056521756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039642834,0.00014420666,0.00014597122,0.00024058101,0.00014068224,0.00008659086,0.0048943902,0.000084502804,0.00010668681],"category_scores_gemma":[0.00008721973,0.00014387835,0.00006504379,0.00045844197,0.00007707165,0.0004624505,0.0023636664,0.0003551718,0.00017873765],"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.000009896448,0.00031653605,0.0008425485,0.000005155653,0.000016102607,0.0000065308777,0.0034627577,0.00010872896,0.0000057014972,0.90210205,0.0009173979,0.09220661],"study_design_scores_gemma":[0.00035286596,0.00012776155,0.0075855483,0.000063463485,0.000003382831,0.000006575751,0.000009542344,0.5348138,0.00008682323,0.45532018,0.0014066475,0.00022336986],"about_ca_topic_score_codex":0.000052790383,"about_ca_topic_score_gemma":0.000037558657,"teacher_disagreement_score":0.6477338,"about_ca_system_score_codex":0.000028283122,"about_ca_system_score_gemma":0.00002742754,"threshold_uncertainty_score":0.9095077},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29275662,0.00012939918,0.70138484,0.0039876634,0.00032649146,0.00020227743,0.0000024326284,0.00015961121,0.0010506494],"genre_scores_gemma":[0.6785453,0.000016031729,0.32118005,0.0001571717,0.000062891886,0.000015681324,0.000011777153,0.0000054966636,0.000005617836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985964,0.00020564938,0.0005055286,0.00029107026,0.00020056881,0.00020081784],"domain_scores_gemma":[0.99687356,0.00057619513,0.00021467998,0.0022186474,0.00008566931,0.000031267857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025721782,0.00014608835,0.00021519003,0.00027893507,0.00013916328,0.00007643034,0.0027179748,0.000059297035,0.000005263094],"category_scores_gemma":[0.00004283646,0.00015075585,0.000071964205,0.0007061066,0.00022521491,0.000380385,0.0012141991,0.00019454217,0.000018981844],"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.000008858811,0.0002700722,0.003635122,0.0000080262835,0.000013023302,0.0000010968986,0.00047399427,0.001157118,0.0004105871,0.8016008,0.0003361685,0.1920851],"study_design_scores_gemma":[0.0015240271,0.00022703044,0.09980329,0.00016579768,0.000009226196,0.000027899578,0.000020947964,0.3310859,0.007862087,0.5553423,0.0034592631,0.0004721816],"about_ca_topic_score_codex":0.00016074906,"about_ca_topic_score_gemma":0.00003119982,"teacher_disagreement_score":0.38578865,"about_ca_system_score_codex":0.000050239534,"about_ca_system_score_gemma":0.000059952807,"threshold_uncertainty_score":0.6147645},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86568886,0.0004083662,0.13063611,0.0012118872,0.00048796445,0.00045642047,0.000010287589,0.00018461319,0.00091549713],"genre_scores_gemma":[0.65899986,0.00007708318,0.34061545,0.000087953464,0.00006656115,0.00003211283,0.00002422226,0.00003138958,0.00006537258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976804,0.00035417458,0.00084411696,0.00036272194,0.00041912752,0.00033945183],"domain_scores_gemma":[0.9922581,0.0016212942,0.00033228233,0.005382359,0.0002616928,0.0001443257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004009487,0.0002820413,0.0005337597,0.00025742128,0.00010853073,0.000035586516,0.0031693624,0.00015794337,0.000038087896],"category_scores_gemma":[0.0008015914,0.00027315778,0.00010922184,0.00046271895,0.00036066162,0.0001829412,0.0036110485,0.0004871095,0.00002912166],"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.000040719926,0.0011043445,0.011314923,0.00007732431,0.00008773854,0.000005889275,0.0031468067,0.000026024643,0.0007970081,0.9488393,0.0018663557,0.032693576],"study_design_scores_gemma":[0.0012229785,0.00011495359,0.008237041,0.00016254376,0.000033640958,0.000015437865,0.00007635612,0.005357562,0.0011591881,0.982606,0.0006811458,0.00033314145],"about_ca_topic_score_codex":0.000036967336,"about_ca_topic_score_gemma":0.00008602443,"teacher_disagreement_score":0.20997936,"about_ca_system_score_codex":0.00013659667,"about_ca_system_score_gemma":0.000089447254,"threshold_uncertainty_score":0.99997205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04397791,0.00011596774,0.9540698,0.0007223434,0.00027302894,0.0006819961,0.000020628668,0.00008300547,0.00005532298],"genre_scores_gemma":[0.46490118,0.000018060051,0.53456813,0.0001399744,0.00010639142,0.0001470676,0.000080683785,0.000016840695,0.000021649652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988847,0.00016219121,0.00042664047,0.00022515559,0.00012206092,0.00017929972],"domain_scores_gemma":[0.99607897,0.0024264904,0.00012808928,0.0012222705,0.00009352938,0.000050634924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003186696,0.00014903361,0.0002666202,0.00009494753,0.00018240711,0.00013198759,0.00064763933,0.00008604536,0.0000036110932],"category_scores_gemma":[0.00037548217,0.00013429973,0.000039601433,0.00015965749,0.00010756513,0.00017431901,0.0003845468,0.0001450289,0.0000048360776],"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.00004414836,0.00032500268,0.00065460237,0.00051007385,0.000044071094,8.243423e-7,0.0011485299,0.000065803855,0.00027985146,0.64162713,0.002482287,0.35281765],"study_design_scores_gemma":[0.0006605601,0.000069594644,0.0016904875,0.00007214331,0.000017260372,0.000014060966,0.000014379764,0.719034,0.000031138552,0.27664316,0.0015985817,0.00015463006],"about_ca_topic_score_codex":0.000025180198,"about_ca_topic_score_gemma":0.000025206726,"teacher_disagreement_score":0.7189682,"about_ca_system_score_codex":0.000034813012,"about_ca_system_score_gemma":0.0000114597,"threshold_uncertainty_score":0.54765844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055111974,0.00016756485,0.9427757,0.0006123714,0.0003291671,0.00022320128,7.6339785e-7,0.000092797025,0.00068643136],"genre_scores_gemma":[0.46671906,0.00006523961,0.53295785,0.00019780599,0.000015822334,0.00002754544,0.0000015596424,0.0000085786105,0.0000065107843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981477,0.00036138273,0.0004920761,0.00045328107,0.00017149553,0.0003740574],"domain_scores_gemma":[0.996144,0.00068106,0.000104323255,0.002926112,0.000035402976,0.000109113826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066977006,0.00018456762,0.00027193595,0.00035068952,0.00024771207,0.00017446757,0.003788536,0.00007546749,0.00000511112],"category_scores_gemma":[0.00010140857,0.00017966104,0.000047402988,0.0011135247,0.00014664554,0.00056491734,0.004087768,0.00039614487,0.000015306616],"study_design_candidate":"design_other","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.000005317408,0.00080224394,0.022367096,0.000016684302,0.000018753635,0.000026580368,0.008467944,0.00016098862,0.0008359219,0.04315701,0.000042471052,0.92409897],"study_design_scores_gemma":[0.00072510785,0.000115826,0.14720497,0.00033348362,0.000007284618,0.00002498038,0.00012566076,0.725633,0.00038677835,0.12437941,0.00050482526,0.00055865076],"about_ca_topic_score_codex":0.00017517083,"about_ca_topic_score_gemma":0.00003511678,"teacher_disagreement_score":0.92354035,"about_ca_system_score_codex":0.00006517553,"about_ca_system_score_gemma":0.000036909198,"threshold_uncertainty_score":0.7326365},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6329697,0.00019068833,0.35237104,0.012630758,0.0005644554,0.00040918885,0.0000068727354,0.00015636407,0.00070096296],"genre_scores_gemma":[0.9274972,0.000058728343,0.07140274,0.0008643175,0.00007988146,0.000035073852,0.000029172388,0.000010396615,0.000022490296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99820083,0.00029757564,0.00060611207,0.00033802108,0.00031405804,0.0002434104],"domain_scores_gemma":[0.99410784,0.0024724663,0.00027152096,0.0029682438,0.000117497424,0.00006241354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004708591,0.00019570361,0.00024236976,0.00025085325,0.00040594104,0.000063180276,0.0035553158,0.00007433933,0.000026907981],"category_scores_gemma":[0.00011191454,0.00015836961,0.00012814147,0.00059902004,0.00020608796,0.0003662107,0.0015370888,0.00035731957,0.000063583655],"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.00005177328,0.0015228507,0.002425632,0.000014639218,0.000103437436,0.000009962796,0.0022793117,0.0070202374,0.0017004292,0.8658622,0.007337397,0.11167214],"study_design_scores_gemma":[0.0015140848,0.00024682097,0.6130844,0.0001797709,0.000012650343,0.00011544385,0.000015872985,0.27637136,0.0018439693,0.10429522,0.0017983954,0.00052204874],"about_ca_topic_score_codex":0.00015190316,"about_ca_topic_score_gemma":0.000059645183,"teacher_disagreement_score":0.761567,"about_ca_system_score_codex":0.00009154815,"about_ca_system_score_gemma":0.00017242711,"threshold_uncertainty_score":0.660672},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013237194,0.0003753369,0.9785299,0.0013654495,0.000057867255,0.00041923166,0.0000014249782,0.00050665054,0.005507003],"genre_scores_gemma":[0.44793952,0.000050833052,0.55147266,0.00031103627,0.000035571542,0.00017663662,0.0000018740395,0.0000074861673,0.000004357386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988566,0.00015385346,0.00031098738,0.00035804248,0.00009231672,0.00022817998],"domain_scores_gemma":[0.99552464,0.0004308521,0.000076108794,0.0037975053,0.00006864985,0.00010226002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056706986,0.00014100282,0.00015035349,0.0003863993,0.00035542142,0.00015930571,0.004679652,0.00005637398,0.0000058309597],"category_scores_gemma":[0.00003392507,0.0001560094,0.000045181394,0.0010442548,0.00011086484,0.00036907144,0.0046608425,0.00023326543,0.000018200972],"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.0000017490742,0.00009869211,0.005420841,0.0000054877546,0.000008012561,0.000001379244,0.0019031465,0.0000011689326,0.00004038785,0.5116472,0.000080522776,0.48079136],"study_design_scores_gemma":[0.0005204076,0.00031198695,0.025499852,0.00032634134,0.000022878414,0.00013463285,0.00012319288,0.020803269,0.002745582,0.8520774,0.09627481,0.0011596003],"about_ca_topic_score_codex":0.000051878254,"about_ca_topic_score_gemma":0.00010742269,"teacher_disagreement_score":0.47963178,"about_ca_system_score_codex":0.000026751399,"about_ca_system_score_gemma":0.000021468926,"threshold_uncertainty_score":0.8696036},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3749753,0.00033153998,0.58506244,0.023851845,0.0014624577,0.0021839736,0.00015146998,0.00023594874,0.011745036],"genre_scores_gemma":[0.8042755,0.0000169261,0.19420606,0.0003527657,0.00012614184,0.00030845005,0.000111165944,0.000025395077,0.0005775672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987298,0.0002407347,0.0004983218,0.00016751161,0.00019516158,0.00016847503],"domain_scores_gemma":[0.9928362,0.004256545,0.00020258546,0.002358989,0.0002912843,0.000054415297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009085429,0.00013815254,0.00024597978,0.0001016401,0.00025741354,0.000039763643,0.0012472507,0.00007517783,0.00007512428],"category_scores_gemma":[0.0012920791,0.00010555955,0.00011114143,0.00032818477,0.00017375166,0.000099937846,0.00045128682,0.00026815143,0.000037408685],"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.000023667888,0.00043456623,0.0014340366,0.000018233399,0.00008092507,3.2788202e-7,0.0013979474,0.00008699565,0.000020217527,0.875558,0.11647697,0.0044680783],"study_design_scores_gemma":[0.0013134112,0.0003324637,0.0011786912,0.000262166,0.000089563706,0.000012204785,0.0020219074,0.019951899,0.000097793156,0.93913585,0.03531858,0.0002854813],"about_ca_topic_score_codex":0.000033625725,"about_ca_topic_score_gemma":0.00013691683,"teacher_disagreement_score":0.42930025,"about_ca_system_score_codex":0.000068191446,"about_ca_system_score_gemma":0.00010877207,"threshold_uncertainty_score":0.43045935},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014922123,0.0005274088,0.97845525,0.002098857,0.0004127498,0.00043500072,0.0000056920867,0.0004896964,0.0026532228],"genre_scores_gemma":[0.4629003,0.00006897523,0.5366569,0.0001908118,0.000046368783,0.00006664617,0.000011388563,0.000011472132,0.000047102403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980964,0.0004011707,0.0004990072,0.00047075335,0.00018804215,0.00034459308],"domain_scores_gemma":[0.99174505,0.00048455497,0.00017200546,0.0073753754,0.00011251181,0.000110472734],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00067733816,0.00021480511,0.00022679374,0.0002592294,0.00025771649,0.00012120273,0.00865518,0.000108296445,0.00004921994],"category_scores_gemma":[0.00008451516,0.00022063781,0.0000917823,0.0008627087,0.00015461321,0.00072779425,0.0037590927,0.00038622014,0.00029795582],"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.000009559669,0.0007060427,0.0026809636,0.000016160388,0.000036466685,0.000010164235,0.0053692586,0.00003829346,0.00016241046,0.81213313,0.00089078397,0.17794675],"study_design_scores_gemma":[0.0015459502,0.00025081984,0.04590357,0.0001092326,0.000025562904,0.00010225106,0.00010111046,0.6649694,0.0019679924,0.2632458,0.02065855,0.001119791],"about_ca_topic_score_codex":0.00013791044,"about_ca_topic_score_gemma":0.000050105824,"teacher_disagreement_score":0.66493106,"about_ca_system_score_codex":0.00007150453,"about_ca_system_score_gemma":0.000065945926,"threshold_uncertainty_score":0.99670845},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17933205,0.004676659,0.8070799,0.0032529775,0.0009077594,0.0005272975,0.000013772526,0.00042177856,0.0037878132],"genre_scores_gemma":[0.4954242,0.0003882427,0.50394195,0.00017430805,0.000028110422,0.000019193329,0.0000073639135,0.000007103969,0.0000095205005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826455,0.00019710214,0.0005622337,0.00031955366,0.0003717885,0.00028476556],"domain_scores_gemma":[0.9930568,0.0010580155,0.00020575685,0.0053741867,0.00019935741,0.00010591746],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006852539,0.00017913783,0.00030791934,0.0008235849,0.00012040846,0.0001332332,0.008503407,0.000081736245,0.000005183914],"category_scores_gemma":[0.00017797809,0.00018103907,0.000105531384,0.0028887303,0.0002478826,0.0007400534,0.0056921793,0.00030377458,0.000027966267],"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.000008847356,0.00083916995,0.021388981,0.00004272705,0.00006974634,0.0000065432996,0.00431152,0.000565586,0.000011453736,0.46980664,0.003687694,0.49926108],"study_design_scores_gemma":[0.001132801,0.00021670487,0.0355472,0.00009769885,0.000012786607,0.0000277647,0.00013533758,0.5312558,0.00013248509,0.41577956,0.015193465,0.0004684025],"about_ca_topic_score_codex":0.00032111214,"about_ca_topic_score_gemma":0.00010444075,"teacher_disagreement_score":0.5306902,"about_ca_system_score_codex":0.00007324281,"about_ca_system_score_gemma":0.000120775236,"threshold_uncertainty_score":0.99686104},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13314676,0.00031069384,0.8603326,0.0035089725,0.00038234465,0.00028787015,0.0000035003259,0.0003556493,0.0016716289],"genre_scores_gemma":[0.5470387,0.00006765709,0.45238018,0.00039655578,0.00004490381,0.000018365661,0.000014472956,0.000010340265,0.000028834182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980709,0.0002880873,0.0005393419,0.00044981876,0.0003037109,0.00034815993],"domain_scores_gemma":[0.994576,0.0009741495,0.00016102509,0.003998065,0.00018864319,0.00010214392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005741587,0.00022046771,0.0002554317,0.00033761904,0.00050710834,0.00011887397,0.0053001237,0.000091724854,0.000024435896],"category_scores_gemma":[0.000094060786,0.00022896854,0.000090096066,0.001386109,0.00021501906,0.00028355507,0.0027321705,0.000413621,0.00021563521],"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.000015343918,0.0024226522,0.0046519474,0.000042638807,0.00008861415,0.00009347566,0.006677463,0.07320286,0.00007867753,0.27947906,0.0031604876,0.6300868],"study_design_scores_gemma":[0.00067938596,0.000051744017,0.032801162,0.000047157842,0.0000047802328,0.00016390841,0.000017203902,0.94758385,0.00006511197,0.016113074,0.002108788,0.0003638028],"about_ca_topic_score_codex":0.000053557138,"about_ca_topic_score_gemma":0.000020647803,"teacher_disagreement_score":0.874381,"about_ca_system_score_codex":0.000086708,"about_ca_system_score_gemma":0.00017136331,"threshold_uncertainty_score":0.9849037},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019382901,0.00007350778,0.9780314,0.0010594066,0.00009557295,0.00053270016,0.0000058605992,0.00037962347,0.00043900678],"genre_scores_gemma":[0.4441233,0.00007057793,0.55557966,0.00010615309,0.000015149365,0.000049856062,0.000043524073,0.000007728471,0.00000406312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986272,0.00023971584,0.00043814682,0.00035616622,0.0001037225,0.000235076],"domain_scores_gemma":[0.99703836,0.00037436414,0.00018601623,0.0021790469,0.00016016938,0.000062019746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005569773,0.00015892203,0.00018655315,0.0002257181,0.00031643242,0.00011789493,0.0023173115,0.000075635355,0.0000048526613],"category_scores_gemma":[0.00003617738,0.00017439316,0.000044469074,0.00037339045,0.00011607104,0.0004957825,0.0017222461,0.00015890064,0.000003081183],"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.000020956206,0.0003484895,0.032976206,0.000031082163,0.00004958093,0.0000012776278,0.011032082,0.00035935492,0.0000815745,0.75849646,0.0009038562,0.19569908],"study_design_scores_gemma":[0.0006798606,0.00010726044,0.10232141,0.000022090207,0.000008062805,0.0000061173973,0.00003660823,0.7972436,0.00014787208,0.09889022,0.0003178346,0.00021907357],"about_ca_topic_score_codex":0.0006226527,"about_ca_topic_score_gemma":0.00050286885,"teacher_disagreement_score":0.79688424,"about_ca_system_score_codex":0.000067470115,"about_ca_system_score_gemma":0.000051462008,"threshold_uncertainty_score":0.7111547},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2657336,0.00023809994,0.7286594,0.0020742326,0.0009554673,0.0002518421,0.000003779478,0.00019649856,0.0018870493],"genre_scores_gemma":[0.5594596,0.00005710239,0.44032076,0.00008388697,0.000042708536,0.000011214302,0.0000025971356,0.0000058173773,0.00001628938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884737,0.00010121034,0.00040111493,0.00025588842,0.00017017109,0.00022423049],"domain_scores_gemma":[0.99388164,0.0006690602,0.00015003292,0.0051466324,0.000088027744,0.00006462382],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005252691,0.00013606844,0.00020905714,0.0002666443,0.00014282555,0.0001014457,0.007820747,0.00007939273,0.0000182312],"category_scores_gemma":[0.00005975749,0.00013573645,0.00007106588,0.0007779302,0.00012907079,0.00057221897,0.0036631771,0.000454322,0.000038223134],"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.000005488831,0.0006099149,0.012851868,0.00007467378,0.00005138924,0.000006672182,0.004983429,0.00020919854,0.008963144,0.44882327,0.0003970332,0.5230239],"study_design_scores_gemma":[0.0010535878,0.00013579367,0.027501656,0.00015453278,0.000014854919,0.00004391642,0.000066050314,0.8220381,0.015552631,0.11859041,0.014118926,0.00072950765],"about_ca_topic_score_codex":0.000079193174,"about_ca_topic_score_gemma":0.000037850332,"teacher_disagreement_score":0.82182896,"about_ca_system_score_codex":0.000016126987,"about_ca_system_score_gemma":0.000058708873,"threshold_uncertainty_score":0.9975474},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011804753,0.00043350007,0.9598486,0.018521724,0.00047486238,0.0007224757,0.00000644194,0.00042014846,0.007767514],"genre_scores_gemma":[0.4796815,0.000028494242,0.51926106,0.00073657697,0.000043382497,0.00007409287,0.000054941484,0.000012043905,0.000107895714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846137,0.00017361311,0.00043603472,0.00035380863,0.00027787779,0.00029731335],"domain_scores_gemma":[0.9952954,0.00016464065,0.00008117506,0.004165239,0.00016183303,0.00013172453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005639849,0.00016462799,0.00017749394,0.00024274066,0.00010043479,0.00033162025,0.004940453,0.000038032846,0.0000054158068],"category_scores_gemma":[0.00007164111,0.0001660133,0.000055421006,0.0009406337,0.00008060521,0.001514463,0.0013620972,0.00019022719,0.00012038143],"study_design_candidate":"design_other","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.000011090908,0.00048895896,0.0011773667,0.000013938915,0.000038218324,0.000006390428,0.0076823398,0.000070608454,0.00006550352,0.08459632,0.011960946,0.8938883],"study_design_scores_gemma":[0.0036971807,0.0005194219,0.00700691,0.00013181048,0.000019761532,0.00011190665,0.00017652746,0.51816064,0.0016641726,0.3396908,0.12776724,0.0010536127],"about_ca_topic_score_codex":0.00006604981,"about_ca_topic_score_gemma":0.00007548063,"teacher_disagreement_score":0.8928347,"about_ca_system_score_codex":0.00011277306,"about_ca_system_score_gemma":0.00016099075,"threshold_uncertainty_score":0.9180673},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055670064,0.0005424004,0.9389855,0.0017777503,0.00008519521,0.0005900602,0.000012472838,0.00018387575,0.002152671],"genre_scores_gemma":[0.4314937,0.00006882894,0.5682381,0.000037187267,0.000027351298,0.000030218263,0.000045398283,0.00001857381,0.000040687766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842656,0.00024462593,0.0006502787,0.00020275712,0.00025750324,0.00021827451],"domain_scores_gemma":[0.9958081,0.0016274935,0.00021273807,0.0020106537,0.00030497467,0.00003603693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038102595,0.00014027282,0.00027827005,0.00030969715,0.00011376369,0.000034945613,0.0015071292,0.00007742423,0.000022251303],"category_scores_gemma":[0.00027559468,0.00015209531,0.000057686146,0.0007196546,0.0002534578,0.0001918549,0.0010241043,0.00025675865,0.000020603804],"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.000030049117,0.0028997927,0.015414012,0.00030607142,0.000115490366,0.000007668309,0.0022877622,0.054711204,0.00079967844,0.82039577,0.006809381,0.0962231],"study_design_scores_gemma":[0.00074803305,0.000038666705,0.005861507,0.000102231024,0.000009749474,0.000008149006,0.000048506845,0.41066426,0.000537354,0.5814433,0.00034341202,0.0001948063],"about_ca_topic_score_codex":0.00010110662,"about_ca_topic_score_gemma":0.00008705429,"teacher_disagreement_score":0.37582365,"about_ca_system_score_codex":0.000080204634,"about_ca_system_score_gemma":0.000057470068,"threshold_uncertainty_score":0.6202267},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007479556,0.00030377816,0.97973233,0.006027994,0.0011468265,0.00030148058,5.1803704e-7,0.00042508368,0.004582422],"genre_scores_gemma":[0.6959123,0.000035216723,0.30354822,0.00032891033,0.000077379234,0.000042655458,0.0000063851417,0.00000853543,0.000040391722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986829,0.00016026096,0.00035870066,0.0003302627,0.00017543664,0.00029243834],"domain_scores_gemma":[0.9929769,0.00036911253,0.000083454775,0.00640449,0.000081092214,0.00008493514],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00056734856,0.00014934872,0.00018883972,0.00017479056,0.000195062,0.00023710675,0.008229597,0.000111333524,0.000014782691],"category_scores_gemma":[0.00004826372,0.00014220299,0.00007579896,0.0006049893,0.00014256874,0.00041404527,0.0017338037,0.00056817685,0.00017876498],"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":[6.7166917e-7,0.00016406192,0.0023251942,0.0000061196624,0.000010780726,0.000003893862,0.0014449169,0.0000068321337,0.00019421044,0.7715486,0.00040594127,0.22388874],"study_design_scores_gemma":[0.0012871817,0.00015902013,0.024104731,0.000014992384,0.000011347738,0.00015052709,0.00002944771,0.15418331,0.00046413555,0.4943536,0.32441458,0.0008271195],"about_ca_topic_score_codex":0.00012219828,"about_ca_topic_score_gemma":0.0005144459,"teacher_disagreement_score":0.68843275,"about_ca_system_score_codex":0.00002122555,"about_ca_system_score_gemma":0.00006285698,"threshold_uncertainty_score":0.99713635},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039388664,0.0013502713,0.92614514,0.02916915,0.00053339737,0.0004345183,0.0000011061838,0.0005348274,0.002442933],"genre_scores_gemma":[0.58650225,0.00003995543,0.41195688,0.0013079691,0.000058039263,0.00007246914,0.0000076191573,0.000007888557,0.00004695494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854076,0.00018604078,0.00041397187,0.00035234584,0.00017852648,0.00032836988],"domain_scores_gemma":[0.99471605,0.0005362803,0.0000990391,0.0044502937,0.00009514367,0.000103177794],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022455146,0.00016725113,0.0001855701,0.00026432026,0.0001851233,0.0003368203,0.0069175926,0.00006559588,0.000036782058],"category_scores_gemma":[0.00005229381,0.00016871307,0.000069458016,0.00079897424,0.00009902514,0.0010620457,0.004257863,0.0002786222,0.0007949892],"study_design_candidate":"design_other","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":[5.4586934e-7,0.0001451356,0.0012740245,0.0000037445513,0.000011298004,0.0000016345117,0.0006351054,0.00003050629,0.00007558783,0.12068001,0.0033746762,0.87376773],"study_design_scores_gemma":[0.000574148,0.00006926517,0.09676222,0.00004508025,0.0000032199384,0.000030060712,0.000015123988,0.60225743,0.0001622343,0.29197645,0.0076796827,0.0004250919],"about_ca_topic_score_codex":0.00034939102,"about_ca_topic_score_gemma":0.0000455385,"teacher_disagreement_score":0.87334263,"about_ca_system_score_codex":0.00006891531,"about_ca_system_score_gemma":0.00007097958,"threshold_uncertainty_score":0.999983},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52335966,0.0028981632,0.4629523,0.004531934,0.002138719,0.0005462691,0.000009632597,0.0010031107,0.0025602102],"genre_scores_gemma":[0.97697735,0.0004154079,0.021834379,0.0005392448,0.000117718104,0.000036650497,0.00004895074,0.000022854905,0.000007459977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992871,0.00006781834,0.00027560056,0.0001146164,0.00008344996,0.00017138454],"domain_scores_gemma":[0.9973217,0.00040467692,0.000040735766,0.0021720484,0.0000323624,0.000028442064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043392772,0.00012203132,0.00013623387,0.00012192263,0.00012519585,0.00007050636,0.0013822111,0.000067352,0.0000059903637],"category_scores_gemma":[0.000030657986,0.000097988246,0.000052661835,0.00027701296,0.00005042679,0.00012420162,0.00049726694,0.0003094958,0.00003140769],"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.000008933738,0.00006240598,0.0018553669,0.000014025775,0.00006542083,7.072705e-7,0.000607828,0.004860427,0.00021411099,0.52166337,0.00085372414,0.46979365],"study_design_scores_gemma":[0.00021586384,0.000038002396,0.00846655,0.00003522218,0.00001200873,0.000004492359,0.00004109464,0.90600795,0.000015279893,0.07210752,0.012906281,0.00014975152],"about_ca_topic_score_codex":0.00002718317,"about_ca_topic_score_gemma":0.00023660906,"teacher_disagreement_score":0.9011475,"about_ca_system_score_codex":0.000052312007,"about_ca_system_score_gemma":0.000008404791,"threshold_uncertainty_score":0.39958447},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6775653,0.00046036363,0.31902707,0.00068310293,0.0007591243,0.00020165277,0.000005998513,0.00032078396,0.0009765942],"genre_scores_gemma":[0.9083269,0.00029731134,0.09117939,0.00006224135,0.00003531502,0.000013477008,0.000051960433,0.000017255717,0.000016092557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941134,0.000038988255,0.00027584174,0.00008862611,0.00007222908,0.00011294136],"domain_scores_gemma":[0.99815035,0.0000661004,0.000039637707,0.0016797483,0.000040844236,0.000023324626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018032725,0.00009342116,0.00015031236,0.0001225808,0.000036866084,0.000017676508,0.0007283455,0.000060507144,0.00001364492],"category_scores_gemma":[0.000012358766,0.000098027565,0.000040739935,0.00026302983,0.000038509712,0.00009639206,0.0003290016,0.000113947804,0.0000087904245],"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.000046873625,0.00041736616,0.011831136,0.00023312069,0.0002720181,0.0000016950538,0.001233119,0.05574936,0.008429201,0.5214848,0.0021840169,0.3981173],"study_design_scores_gemma":[0.00030212637,0.000043670854,0.0157497,0.000037605918,0.000013729154,0.000005734501,0.000008194209,0.95243865,0.00022219775,0.023315484,0.00770145,0.00016145014],"about_ca_topic_score_codex":0.000028768896,"about_ca_topic_score_gemma":0.00012609008,"teacher_disagreement_score":0.8966893,"about_ca_system_score_codex":0.000028862105,"about_ca_system_score_gemma":0.000007074201,"threshold_uncertainty_score":0.3997448},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8375467,0.00010943054,0.15974794,0.00052563025,0.00019686164,0.00027925536,0.000056572255,0.000025550422,0.0015120655],"genre_scores_gemma":[0.9917952,0.000004976116,0.007824612,0.00003390637,0.00015853156,0.0000117902655,0.00012435814,0.000010256719,0.000036362348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891937,0.00013275658,0.0004315185,0.00016827187,0.00010960738,0.00023846241],"domain_scores_gemma":[0.9978517,0.00042103647,0.00011496939,0.0015446497,0.000028133496,0.000039492497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018148031,0.00012262401,0.00023536013,0.00024778835,0.00012162969,0.00005928909,0.0010021578,0.000041394444,0.00002943583],"category_scores_gemma":[0.000017922372,0.00012681073,0.000078828656,0.0003233826,0.00003965733,0.00010683465,0.0005249105,0.0003215856,0.00001240083],"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.00002570486,0.0022053376,0.061583262,0.000026057862,0.00009357094,0.0000014489553,0.0023650397,0.007996095,0.00049567444,0.89375603,0.00037421548,0.031077536],"study_design_scores_gemma":[0.002383659,0.00017027,0.14796801,0.00054743746,0.000027301672,8.485419e-7,0.00049613946,0.82373786,0.00015007173,0.023539744,0.00046023322,0.0005184057],"about_ca_topic_score_codex":0.00036735495,"about_ca_topic_score_gemma":0.00004075038,"teacher_disagreement_score":0.8702163,"about_ca_system_score_codex":0.00003663636,"about_ca_system_score_gemma":0.000032936798,"threshold_uncertainty_score":0.51711917},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1792306,0.00006032416,0.8149919,0.003884377,0.00028496666,0.0007541502,0.000019115862,0.00023386505,0.00054071733],"genre_scores_gemma":[0.5512199,0.000021245458,0.4483342,0.0002512144,0.000040142302,0.00007090593,0.00004642663,0.00000842789,0.000007603623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827176,0.00015336131,0.0005829402,0.00052937074,0.00013408026,0.00032848513],"domain_scores_gemma":[0.99573386,0.00068428164,0.00023930648,0.0031004706,0.00013777637,0.00010432545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005266052,0.00021915547,0.0002483373,0.00027784615,0.0003733554,0.0001216869,0.0033767256,0.00009645586,0.0000013904582],"category_scores_gemma":[0.00007787801,0.00023323826,0.000065594104,0.0005014149,0.00022223218,0.0006018409,0.0016743429,0.00022511122,0.000014094951],"study_design_candidate":"design_other","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.0005121881,0.0012969424,0.007966738,0.00012081015,0.00007388199,0.0000032479406,0.008783891,0.00036779922,0.000639927,0.09029707,0.0019876075,0.8879499],"study_design_scores_gemma":[0.0018447774,0.00020361863,0.14116031,0.0000501578,0.0000070965025,0.000006353301,0.000006607852,0.8457997,0.00040646485,0.009401619,0.0008549299,0.00025837656],"about_ca_topic_score_codex":0.00022873825,"about_ca_topic_score_gemma":0.00011467453,"teacher_disagreement_score":0.8876915,"about_ca_system_score_codex":0.00008291807,"about_ca_system_score_gemma":0.00011734168,"threshold_uncertainty_score":0.951118},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112919725,0.00036581923,0.8790401,0.003668397,0.0023925253,0.0010075044,0.000009432734,0.00036635742,0.00023012514],"genre_scores_gemma":[0.65808594,0.00002101773,0.3410997,0.0002514675,0.00023960578,0.000241825,0.000021609509,0.000015396223,0.000023413448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981059,0.00012138528,0.00060429645,0.0005055843,0.00020407676,0.00045876802],"domain_scores_gemma":[0.99256736,0.0021846902,0.00020992973,0.004765857,0.00014250047,0.00012965869],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00075625017,0.00023210177,0.00031268795,0.0005453118,0.00036290052,0.00055215025,0.0069044475,0.00014310691,0.0000032082544],"category_scores_gemma":[0.00032419444,0.00024204544,0.00013093413,0.0011441595,0.00012328857,0.0006733901,0.0028068104,0.0005418111,0.00004824878],"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.000017974644,0.0006856802,0.0028806932,0.00006654415,0.0000780174,0.000006942785,0.0018394953,0.0007898987,0.0035224466,0.38116312,0.010283538,0.59866565],"study_design_scores_gemma":[0.0010905117,0.00010695361,0.008274079,0.000048045942,0.000010196749,0.000045971236,0.000016942515,0.9503776,0.00033347614,0.019064886,0.02015391,0.00047741787],"about_ca_topic_score_codex":0.00015319919,"about_ca_topic_score_gemma":0.00012892096,"teacher_disagreement_score":0.9495877,"about_ca_system_score_codex":0.000069450165,"about_ca_system_score_gemma":0.00017380217,"threshold_uncertainty_score":0.9984687},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0237098,0.0029755177,0.76857907,0.1952626,0.0008339593,0.00053447025,0.0000021866567,0.0010721107,0.0070303064],"genre_scores_gemma":[0.7153145,0.00037964832,0.28093797,0.0031205707,0.00010934941,0.000020388567,0.000010073228,0.000008027042,0.00009948337],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856544,0.00023962016,0.00039806106,0.00029926642,0.0001800756,0.00031753397],"domain_scores_gemma":[0.99407035,0.00097393803,0.00010281652,0.0047417628,0.000034815752,0.000076286175],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00030284515,0.00015417379,0.0001456723,0.0001412834,0.0005195509,0.0005484061,0.0093596475,0.000054931315,0.0000033654644],"category_scores_gemma":[0.00004690069,0.00012307358,0.00007547715,0.00085584907,0.000108849774,0.0010153691,0.0028094794,0.00032196566,0.00007927219],"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.0000020283755,0.00007859241,0.00016845683,7.492275e-7,0.0000053250833,0.000001983579,0.0003129506,0.00013257898,0.000013954838,0.36225304,0.0038655205,0.6331648],"study_design_scores_gemma":[0.00032325913,0.00008055076,0.035632856,0.000027471697,0.0000023431087,0.000017807635,0.0000072979146,0.39752853,0.0000855409,0.5278791,0.03818583,0.00022937136],"about_ca_topic_score_codex":0.000011022546,"about_ca_topic_score_gemma":0.000013046181,"teacher_disagreement_score":0.6916047,"about_ca_system_score_codex":0.000034174616,"about_ca_system_score_gemma":0.00009316283,"threshold_uncertainty_score":0.9960002},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35067156,0.00068508077,0.6338734,0.010812617,0.0014402294,0.0010485961,0.000011447791,0.00041981996,0.001037223],"genre_scores_gemma":[0.5256049,0.00008153547,0.47385445,0.00027924677,0.00006730011,0.000050977902,0.000038325863,0.000017530225,0.0000057372235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956841,0.0007283877,0.0015719517,0.00081055163,0.0005867186,0.0006183197],"domain_scores_gemma":[0.9898456,0.0015381454,0.0004124194,0.007358988,0.0005637961,0.0002811048],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015415946,0.00040055512,0.00064466393,0.00072966015,0.00013749677,0.0002348749,0.009275128,0.00018775598,0.000019200608],"category_scores_gemma":[0.00030296872,0.00042866665,0.00014071859,0.002429781,0.00031852693,0.0009929716,0.0059153424,0.0007269637,0.00007290065],"study_design_candidate":"design_other","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.00003676575,0.0049648364,0.06391734,0.000079826204,0.00010717801,0.000055227665,0.016971337,0.045689456,0.000085049265,0.09806295,0.0022005104,0.76782954],"study_design_scores_gemma":[0.0018653205,0.0002951159,0.24999134,0.00013435054,0.00001210267,0.000042322026,0.000095106996,0.6397279,0.00017319819,0.10391464,0.0030399254,0.0007086887],"about_ca_topic_score_codex":0.00066323485,"about_ca_topic_score_gemma":0.0014046843,"teacher_disagreement_score":0.76712084,"about_ca_system_score_codex":0.00036893773,"about_ca_system_score_gemma":0.00041541166,"threshold_uncertainty_score":0.99981654},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10905796,0.00014192189,0.8882757,0.0009363616,0.00022225118,0.0005396776,0.00012682613,0.00018095915,0.0005183351],"genre_scores_gemma":[0.3182358,0.000023921752,0.6812772,0.00012532456,0.00009588125,0.00012298825,0.00007158751,0.000028944696,0.000018299246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853677,0.00017102849,0.00055004813,0.00026868263,0.00019526943,0.00027819272],"domain_scores_gemma":[0.99141663,0.0026914272,0.00021769063,0.005308955,0.0002353985,0.00012987119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005445752,0.00017902651,0.00031219283,0.00033271065,0.00023949245,0.00003277703,0.0025578944,0.00011296476,0.0000067104556],"category_scores_gemma":[0.0008611398,0.00019098126,0.00009663461,0.00055666064,0.00014847562,0.0002983181,0.0009287513,0.0003000564,0.000006952217],"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.00003352022,0.002513625,0.001121845,0.00006281829,0.00012367473,0.0000027236517,0.0042806566,0.00067950797,0.0001577201,0.49389896,0.011651728,0.48547325],"study_design_scores_gemma":[0.0012373574,0.00038374198,0.00069177983,0.000098685625,0.000033065426,0.0000123600885,0.00043872817,0.093108036,0.00028164397,0.9005157,0.0029442876,0.00025461963],"about_ca_topic_score_codex":0.000011758479,"about_ca_topic_score_gemma":0.0001302127,"teacher_disagreement_score":0.4852186,"about_ca_system_score_codex":0.000109980516,"about_ca_system_score_gemma":0.00008738759,"threshold_uncertainty_score":0.778799},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065784246,0.0012049697,0.8597647,0.06964823,0.0003245908,0.00045842293,0.0000027301137,0.00062218506,0.0021899461],"genre_scores_gemma":[0.5601005,0.0000411814,0.4372723,0.0022762353,0.00012359048,0.00005309366,0.000021067412,0.000021542412,0.00009051451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978411,0.00046939528,0.00039809948,0.0004677121,0.0003969191,0.00042677103],"domain_scores_gemma":[0.99307156,0.0009964815,0.00016816008,0.005489426,0.00009310681,0.00018125474],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00066892855,0.00024950906,0.00024898935,0.00036508005,0.00033421733,0.0004807111,0.00917684,0.00007580771,0.000005509671],"category_scores_gemma":[0.000049554495,0.0001809689,0.00007176688,0.0020554052,0.00030062854,0.0014020754,0.006369158,0.00051501254,0.00007484381],"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.000022642196,0.00032725133,0.0030966273,0.000014597159,0.000076562195,0.000028652577,0.006413561,0.0026826789,0.000023470438,0.41804412,0.017130833,0.552139],"study_design_scores_gemma":[0.0032481945,0.0005738951,0.030048952,0.00026167897,0.000031467196,0.000322457,0.00037692068,0.5431953,0.00031741473,0.20591563,0.21432126,0.0013868482],"about_ca_topic_score_codex":0.000053821634,"about_ca_topic_score_gemma":0.00007224083,"teacher_disagreement_score":0.55075216,"about_ca_system_score_codex":0.000077106786,"about_ca_system_score_gemma":0.00031308905,"threshold_uncertainty_score":0.996184},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005166189,0.00030947322,0.98536193,0.0126429945,0.00025719547,0.000486269,0.000010493201,0.00023217525,0.00018287326],"genre_scores_gemma":[0.0056557846,0.00016491425,0.9927431,0.0009956997,0.000055418648,0.000073274685,0.00012954412,0.0000141601995,0.00016815157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985667,0.00024069884,0.00037652385,0.0003146768,0.00022869192,0.00027272978],"domain_scores_gemma":[0.99532574,0.00050129875,0.000098109966,0.0035969291,0.0003181358,0.00015977571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068570004,0.0001346559,0.0001809189,0.00028294633,0.00015859981,0.00016648025,0.0052184924,0.00008490729,0.0000033537249],"category_scores_gemma":[0.00015456234,0.00013903451,0.00006293621,0.00080430234,0.0000852977,0.000587433,0.0034748712,0.00025373374,0.00004805448],"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.0000061921037,0.0006912574,0.00032314484,0.000012986943,0.00002684718,0.0000030817935,0.002185475,0.0033575543,0.000011783185,0.072667904,0.021981556,0.89873224],"study_design_scores_gemma":[0.00109189,0.000107268184,0.00014140297,0.000027329432,0.000002600076,0.000006522135,0.000028142023,0.9360948,0.000011116064,0.027393898,0.034939513,0.0001554749],"about_ca_topic_score_codex":0.00004393329,"about_ca_topic_score_gemma":0.000043141532,"teacher_disagreement_score":0.9327373,"about_ca_system_score_codex":0.00012140855,"about_ca_system_score_gemma":0.00017776161,"threshold_uncertainty_score":0.9697344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036144607,0.0001190992,0.95671946,0.005442436,0.0006654974,0.00039023548,0.0000034982752,0.00024935964,0.0002658213],"genre_scores_gemma":[0.4900901,0.0000033107897,0.5092603,0.0005041735,0.00008425202,0.000023187293,0.000016407163,0.000010256632,0.000007980474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807006,0.00022389217,0.00060921756,0.00045791516,0.00028333216,0.00035559837],"domain_scores_gemma":[0.9954708,0.0005884549,0.00017703249,0.0032820394,0.00024797494,0.00023366247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071576604,0.00021976841,0.000257546,0.0005323008,0.0002154905,0.00028772102,0.004169575,0.00007684582,0.0000042989027],"category_scores_gemma":[0.00038054856,0.00023814444,0.000071908806,0.0014141849,0.000066497065,0.0009692154,0.0046464764,0.00026399142,0.00015033376],"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.000044122025,0.0011690415,0.0026668117,0.000019603927,0.00010458067,0.000017297556,0.021494122,0.06415705,0.0038835965,0.52712584,0.0022271886,0.37709075],"study_design_scores_gemma":[0.0006283016,0.00006732794,0.003000447,0.00006783327,0.0000069438497,0.000012063575,0.000032463497,0.95687145,0.00011060426,0.037929792,0.0009974944,0.0002752832],"about_ca_topic_score_codex":0.00047096517,"about_ca_topic_score_gemma":0.00017199927,"teacher_disagreement_score":0.8927144,"about_ca_system_score_codex":0.00019480732,"about_ca_system_score_gemma":0.00021165841,"threshold_uncertainty_score":0.9711248},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.223823,0.00050035043,0.75114065,0.022181943,0.0010115278,0.000446873,0.0000066481152,0.00046364928,0.00042533752],"genre_scores_gemma":[0.94863904,0.0005823726,0.04979399,0.0006596951,0.00013773788,0.00006350443,0.0000092374685,0.000023115243,0.000091326736],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777275,0.00031953704,0.000520833,0.0006342424,0.0003005638,0.0004520746],"domain_scores_gemma":[0.9939071,0.0018193474,0.00015843437,0.0038627137,0.00008350118,0.00016892653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029281667,0.00030951275,0.0003376163,0.0004087721,0.0002983772,0.00025733793,0.0045940652,0.00013272675,0.000011176367],"category_scores_gemma":[0.000115597395,0.00024796146,0.00008516054,0.00072249066,0.00022629315,0.0005846066,0.0042293305,0.00034304455,0.00009686539],"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.000006204623,0.000268151,0.0006628061,0.000006935392,0.00002508532,0.0000050419853,0.00051202177,0.000009226901,0.00017313969,0.35509664,0.0006171684,0.6426176],"study_design_scores_gemma":[0.0043191123,0.00034614775,0.11096624,0.000676802,0.000022927437,0.00007898616,0.000024882756,0.19543068,0.0005277283,0.67987555,0.0064041377,0.001326816],"about_ca_topic_score_codex":0.000025499881,"about_ca_topic_score_gemma":0.000022335567,"teacher_disagreement_score":0.724816,"about_ca_system_score_codex":0.00013406176,"about_ca_system_score_gemma":0.000072037656,"threshold_uncertainty_score":0.99999726},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25457114,0.0014091472,0.7268628,0.0120334225,0.0022419614,0.00045031274,0.000016234075,0.00079354976,0.0016214545],"genre_scores_gemma":[0.9715827,0.00089862035,0.026787901,0.00045316742,0.00011132337,0.000041614614,0.000020591313,0.000027010348,0.00007704668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932855,0.000046576322,0.00024685691,0.00011710142,0.00009127366,0.00016965317],"domain_scores_gemma":[0.9973622,0.00022887264,0.000032360178,0.0023175906,0.000031684533,0.00002727171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025366104,0.00011239244,0.00010665212,0.00007625059,0.000104436665,0.000050272556,0.0013413241,0.00006200929,0.00001906231],"category_scores_gemma":[0.000013622544,0.000070686765,0.000050388564,0.00019091967,0.00004455048,0.00012540324,0.0005698569,0.00014733082,0.000052260228],"study_design_candidate":"design_other","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.000015836682,0.00011368327,0.002611634,0.000017974106,0.00013352187,0.0000029588762,0.0009521162,0.0018100296,0.00765425,0.10031475,0.009882721,0.87649053],"study_design_scores_gemma":[0.0011580512,0.00003717362,0.009159071,0.00015512756,0.00003676521,0.000018201294,0.000039000977,0.73835784,0.00038489766,0.056287937,0.1937997,0.0005662231],"about_ca_topic_score_codex":0.000015808924,"about_ca_topic_score_gemma":0.00031807623,"teacher_disagreement_score":0.8759243,"about_ca_system_score_codex":0.000075045835,"about_ca_system_score_gemma":0.000010452358,"threshold_uncertainty_score":0.28825226},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06803255,0.00045477485,0.8978995,0.023687482,0.00082785543,0.00041076686,0.0000050493013,0.0006023125,0.008079718],"genre_scores_gemma":[0.62976116,0.0001690513,0.3691716,0.000721679,0.00009281398,0.000024768386,0.0000062584763,0.000013090027,0.000039607236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982175,0.00028270765,0.00041385353,0.0004840158,0.00021938073,0.0003824913],"domain_scores_gemma":[0.9818866,0.00057518954,0.00023816571,0.01708179,0.000106621585,0.00011163445],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0007975336,0.00022518387,0.00026190706,0.00027014787,0.0010379793,0.00068139716,0.020927059,0.00010824136,0.000018530945],"category_scores_gemma":[0.00018243596,0.00023769223,0.0001539043,0.0003847343,0.00055994495,0.0010486695,0.010556163,0.0004902426,0.00024325692],"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.000005811001,0.00031741156,0.006440996,0.000010988088,0.000042307944,0.000010739662,0.0016491612,0.000063426305,0.00004968576,0.8342049,0.0017965217,0.15540801],"study_design_scores_gemma":[0.0011709415,0.00015896566,0.06329592,0.00017824168,0.00001753254,0.000030406454,0.0000315039,0.2188921,0.0003386605,0.67411244,0.040967662,0.0008056051],"about_ca_topic_score_codex":0.000051962656,"about_ca_topic_score_gemma":0.00007339468,"teacher_disagreement_score":0.5617286,"about_ca_system_score_codex":0.000038272046,"about_ca_system_score_gemma":0.00006289069,"threshold_uncertainty_score":0.9974463},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1274631,0.0006467342,0.77641034,0.09456702,0.00012285198,0.00024533406,0.0000018405183,0.00025305984,0.00028973466],"genre_scores_gemma":[0.7692199,0.00009838504,0.2296386,0.0009197496,0.000052613173,0.000014953061,0.0000022744796,0.000010676079,0.00004286622],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858993,0.00027599803,0.0002761451,0.00036903436,0.00018711392,0.00030178012],"domain_scores_gemma":[0.9949561,0.0018451096,0.00012534486,0.002930677,0.000069872876,0.00007294074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003739569,0.00018736853,0.00018828669,0.00015067292,0.0004589262,0.00033429175,0.00398071,0.000048433925,0.0000022351762],"category_scores_gemma":[0.000058527006,0.000106082174,0.00003526641,0.0005725538,0.00060002465,0.0009072428,0.0035882795,0.00019079374,0.000011513748],"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.000009061701,0.00005705466,0.0025962316,0.0000062308454,0.000027984011,0.0000044023577,0.0033453603,0.000038106835,0.000115154624,0.45927498,0.000751882,0.53377354],"study_design_scores_gemma":[0.004372392,0.00087662204,0.3129239,0.0009984334,0.00003820525,0.00041493023,0.0004920277,0.23637536,0.0013529874,0.39189038,0.04838458,0.0018801495],"about_ca_topic_score_codex":0.000025209894,"about_ca_topic_score_gemma":0.00010579129,"teacher_disagreement_score":0.6417568,"about_ca_system_score_codex":0.00003414074,"about_ca_system_score_gemma":0.00009197425,"threshold_uncertainty_score":0.73972166},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115361854,0.00007990435,0.8822903,0.001239209,0.00012540596,0.00036678146,0.000008845421,0.00007002361,0.00045769458],"genre_scores_gemma":[0.64479357,0.000043545362,0.35505605,0.000014197037,0.000022227561,0.000019609899,0.0000044827993,0.000014292911,0.000032010103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987464,0.00019222373,0.00040701777,0.00020401568,0.00024762572,0.00020269814],"domain_scores_gemma":[0.9926254,0.0006504553,0.0003385396,0.006146299,0.00018585764,0.000053448108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004945351,0.00012011737,0.00022907916,0.00019701442,0.00047374007,0.00007605586,0.003293914,0.00007760487,0.000022258999],"category_scores_gemma":[0.0005848535,0.00012732825,0.00006201238,0.00017293182,0.00027156534,0.00011613104,0.002860044,0.0003184131,0.000022562652],"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.00004486348,0.002603346,0.022097081,0.00031539483,0.00016137345,0.000014038107,0.0037310456,0.023867443,0.00096917606,0.024232863,0.0003772575,0.9215861],"study_design_scores_gemma":[0.00077461917,0.000044217228,0.030030932,0.00012245853,0.000012431242,0.000008109273,0.00004507109,0.9350383,0.00085110374,0.032546617,0.00032028774,0.00020582147],"about_ca_topic_score_codex":0.00009299827,"about_ca_topic_score_gemma":0.00023374506,"teacher_disagreement_score":0.9213803,"about_ca_system_score_codex":0.000096551776,"about_ca_system_score_gemma":0.000034781133,"threshold_uncertainty_score":0.61209667},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17014536,0.00021837221,0.82679343,0.0012644068,0.00067950366,0.00056151126,0.00003061464,0.00009937581,0.00020739672],"genre_scores_gemma":[0.8389096,0.00009592842,0.16079947,0.0000069648263,0.00004704681,0.00006332172,0.00005943794,0.000012320888,0.0000058699156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994675,0.000012314764,0.00026373458,0.000087616114,0.000056822235,0.00011201788],"domain_scores_gemma":[0.9976293,0.00008766384,0.00010241125,0.0020981452,0.000065329485,0.000017153205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002120567,0.00007902488,0.00013132305,0.000091205475,0.00015861461,0.000050222625,0.0012516989,0.000064639375,0.0000021623014],"category_scores_gemma":[0.000049591843,0.000087053355,0.00004768301,0.00006000277,0.000060454822,0.00021737698,0.00043755956,0.000082358376,0.0000010036795],"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.00008194964,0.00038427423,0.0035661734,0.00028225733,0.00015288388,0.0000010638786,0.0013159519,0.009980433,0.005202984,0.13033567,0.0009853374,0.847711],"study_design_scores_gemma":[0.00039522274,0.000038462516,0.007864275,0.00004255849,0.000009181214,0.0000018760652,0.000005918778,0.9750602,0.0009124177,0.0142243365,0.0013346733,0.0001108513],"about_ca_topic_score_codex":0.000025792842,"about_ca_topic_score_gemma":0.000220735,"teacher_disagreement_score":0.9650798,"about_ca_system_score_codex":0.000048883838,"about_ca_system_score_gemma":0.000018545063,"threshold_uncertainty_score":0.35499325},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6589032,0.00025383808,0.32889268,0.009471514,0.00049939315,0.0003649501,0.000009528289,0.00012868084,0.0014762279],"genre_scores_gemma":[0.71876585,0.00020040656,0.28087884,0.000068864094,0.000039382674,0.000011466264,0.0000097593165,0.000009342245,0.0000161063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811375,0.00025083913,0.0007338019,0.0003590933,0.00028050365,0.00026201035],"domain_scores_gemma":[0.9895899,0.000562027,0.0006902202,0.008901926,0.00017786487,0.00007803881],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00064768794,0.00018606216,0.00041494254,0.00028231888,0.00030263723,0.00011427862,0.010856612,0.00009405114,0.0000041377543],"category_scores_gemma":[0.00015366227,0.00019714196,0.00013076763,0.00027853716,0.0003832043,0.0006201102,0.005944319,0.00022773446,0.0000121522135],"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.000020158928,0.0009915251,0.009773423,0.000059074977,0.0000802456,0.0000062506033,0.002804425,0.00022758872,0.0018791333,0.54695046,0.00043337623,0.43677437],"study_design_scores_gemma":[0.0015635326,0.00027896042,0.40466082,0.00032215938,0.000016575576,0.000018565806,0.000021537222,0.45688334,0.0039534853,0.13100073,0.0008339692,0.0004463192],"about_ca_topic_score_codex":0.0005758708,"about_ca_topic_score_gemma":0.00015110803,"teacher_disagreement_score":0.45665577,"about_ca_system_score_codex":0.00004935711,"about_ca_system_score_gemma":0.000105775296,"threshold_uncertainty_score":0.99449515},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84417427,0.0023025891,0.0030452816,0.13846445,0.00089239556,0.0025295417,0.00008305352,0.00006858972,0.008439822],"genre_scores_gemma":[0.9217191,0.00022896734,0.07578137,0.0010722608,0.00013727606,0.00039675503,0.00046020185,0.000009618911,0.00019449003],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99928796,0.00005841524,0.00025389137,0.0001634733,0.000084725594,0.00015151195],"domain_scores_gemma":[0.997201,0.0004937564,0.00009440929,0.0021045895,0.000060439637,0.000045807054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019973189,0.00009458236,0.00019828472,0.00012348655,0.000249118,0.0000400159,0.0010225073,0.000065831184,0.00019693958],"category_scores_gemma":[0.00008433444,0.00009087307,0.00005906816,0.00005467319,0.000111744004,0.00014715297,0.0007317266,0.00017133002,0.000011130283],"study_design_candidate":"observational","study_design_consensus":"observational","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.0006838972,0.004242563,0.64666986,0.00015255195,0.00025930762,0.000033045875,0.0031115278,0.00015275467,0.002955736,0.033829734,0.17743133,0.13047771],"study_design_scores_gemma":[0.009720353,0.00022962938,0.8364772,0.00032736943,0.000057286547,0.00003326174,0.000034768575,0.024604259,0.000716532,0.03316564,0.09435808,0.0002756245],"about_ca_topic_score_codex":0.00008480562,"about_ca_topic_score_gemma":0.0003741399,"teacher_disagreement_score":0.18980736,"about_ca_system_score_codex":0.00010006351,"about_ca_system_score_gemma":0.00010600975,"threshold_uncertainty_score":0.37056965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6461385,0.00105272,0.3470281,0.0031859356,0.0010727695,0.0005735922,0.00004772836,0.00014124584,0.00075939996],"genre_scores_gemma":[0.70543104,0.00009750038,0.2943116,0.000057360252,0.00007247432,0.0000043980062,0.0000067115852,0.000008979631,0.00000994174],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9979196,0.00035450328,0.00091840257,0.0003293932,0.0002099453,0.00026812954],"domain_scores_gemma":[0.98919237,0.0010568488,0.0011955429,0.008342347,0.00014749641,0.00006541626],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0010044706,0.00019966884,0.0005571854,0.00029191456,0.00039536582,0.00020885069,0.012996839,0.00009976986,0.000013133318],"category_scores_gemma":[0.00029283445,0.00020122532,0.0001246601,0.00026858805,0.00038594083,0.0005908155,0.006393813,0.00024394221,0.000008534872],"study_design_candidate":"design_other","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.000041816995,0.00064769364,0.018937178,0.00027472657,0.00020195119,0.00001107664,0.0048821843,0.0002665351,0.008921429,0.33791617,0.0004237268,0.6274755],"study_design_scores_gemma":[0.0031429862,0.0002969048,0.49415234,0.0009811688,0.000076100674,0.00008039615,0.000088980385,0.33176768,0.023679705,0.14252906,0.0019022074,0.0013024674],"about_ca_topic_score_codex":0.00015893046,"about_ca_topic_score_gemma":0.000023067765,"teacher_disagreement_score":0.626173,"about_ca_system_score_codex":0.000030782452,"about_ca_system_score_gemma":0.00009680852,"threshold_uncertainty_score":0.9923433},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97247815,0.00080761785,0.0055907113,0.008426238,0.00024831097,0.0003515581,0.00005578004,0.000050042196,0.011991618],"genre_scores_gemma":[0.93646246,0.00010203492,0.062958516,0.00007915349,0.0002334233,0.000016809494,0.000028269542,0.000010632709,0.000108687665],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99935484,0.000057839043,0.00021026279,0.00016247744,0.000055750832,0.00015884473],"domain_scores_gemma":[0.9963555,0.00022500586,0.00012515551,0.003214754,0.000027728202,0.00005188257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015721713,0.00010428244,0.00016032715,0.00005764894,0.0005602317,0.00027882925,0.0018647786,0.000030415364,0.00004648738],"category_scores_gemma":[0.00001230139,0.00010292034,0.00004480984,0.000042278032,0.00014792486,0.00021843099,0.0021378428,0.00017334872,0.000026513073],"study_design_candidate":"observational","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.000007837791,0.00033146807,0.39766744,0.000014252805,0.000099049736,0.00000162021,0.0007725469,0.000020887814,0.000062091895,0.13826565,0.0021467744,0.4606104],"study_design_scores_gemma":[0.0020299114,0.000073493786,0.7084957,0.00016702706,0.00004985383,0.0000061362357,0.00020776669,0.036781244,0.0001997418,0.18428853,0.066952206,0.00074841024],"about_ca_topic_score_codex":0.000635071,"about_ca_topic_score_gemma":0.000058832426,"teacher_disagreement_score":0.45986196,"about_ca_system_score_codex":0.0000094201905,"about_ca_system_score_gemma":0.000026121636,"threshold_uncertainty_score":0.43089056},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53675497,0.0054891594,0.11056366,0.20511168,0.0017012182,0.009698719,0.000084606734,0.0013656146,0.12923038],"genre_scores_gemma":[0.72195774,0.0011535299,0.27567932,0.00015133088,0.00015324893,0.00045680828,0.000010553797,0.000029764955,0.00040771006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894196,0.00012989556,0.0003724434,0.00018777326,0.00014000744,0.00022791751],"domain_scores_gemma":[0.9870963,0.0019554058,0.00026434162,0.010576271,0.00007428424,0.000033408684],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00070141436,0.00012651867,0.00016760718,0.000057606263,0.0022680627,0.0004522047,0.006961481,0.000061002305,0.0000054763477],"category_scores_gemma":[0.0005077226,0.00009396317,0.00008300206,0.00014267252,0.00029697063,0.00016743311,0.0024294045,0.00030043966,0.000047935686],"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.0000101303,0.00029048265,0.0032109404,0.000022490876,0.000059644553,0.0000013877033,0.0011522521,0.000004913782,0.00002382815,0.8356407,0.030483533,0.12909967],"study_design_scores_gemma":[0.0010086421,0.000024301597,0.010777972,0.000065357875,0.000033064098,0.000013902789,0.000115075614,0.014757629,0.00005850309,0.804326,0.16854021,0.0002793632],"about_ca_topic_score_codex":0.00017722168,"about_ca_topic_score_gemma":0.0005464175,"teacher_disagreement_score":0.20496035,"about_ca_system_score_codex":0.000043612188,"about_ca_system_score_gemma":0.00006456263,"threshold_uncertainty_score":0.9990308},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09336288,0.00020453102,0.8960063,0.009083004,0.0006390078,0.00051136065,0.000008868281,0.00008713844,0.000096911135],"genre_scores_gemma":[0.77250004,0.000054365126,0.22686356,0.00031131794,0.00012686386,0.000096156924,0.000017823306,0.000012952006,0.000016921516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984075,0.0001741253,0.0004941601,0.00039841965,0.00021499126,0.00031082338],"domain_scores_gemma":[0.9887866,0.0012497763,0.00035362676,0.009312479,0.00022448105,0.000073062554],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00051994174,0.00019939302,0.00027487258,0.00012557567,0.0011977094,0.00067494664,0.013733257,0.00008829255,0.000010006174],"category_scores_gemma":[0.00019119511,0.0001592651,0.00013255827,0.00024214185,0.00041135508,0.0009216916,0.0037489112,0.00025449082,0.000008054061],"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.000022303508,0.00061445584,0.003406803,0.000024698775,0.000104946674,8.1277165e-7,0.0026164306,0.00035925387,0.0004396342,0.46287718,0.0007759766,0.5287575],"study_design_scores_gemma":[0.0009293599,0.00013151103,0.12048646,0.000037774844,0.000020854352,0.000006981896,0.000016575352,0.7527605,0.00023004106,0.12290016,0.0022326743,0.0002470636],"about_ca_topic_score_codex":0.0002727175,"about_ca_topic_score_gemma":0.00023225688,"teacher_disagreement_score":0.7524013,"about_ca_system_score_codex":0.000038346818,"about_ca_system_score_gemma":0.00014953954,"threshold_uncertainty_score":0.9916029},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17266834,0.00021835785,0.7550118,0.05845896,0.0074381847,0.0015632745,0.00013521916,0.00043387755,0.0040719653],"genre_scores_gemma":[0.61707205,0.00002233116,0.37996188,0.0023173469,0.00016124352,0.00005103856,0.000053358825,0.000008432769,0.00035233682],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975375,0.00017899918,0.0008004278,0.00044179359,0.0007634886,0.00027776835],"domain_scores_gemma":[0.9778964,0.001310621,0.00038273213,0.019999906,0.00029199812,0.000118359756],"candidate_categories":["scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.004054294,0.00013742974,0.00021392082,0.00056881824,0.0010912627,0.003066706,0.017388884,0.0000507568,0.000029788373],"category_scores_gemma":[0.006663486,0.00012189734,0.000071715025,0.00046269622,0.00016810762,0.0026187235,0.01747267,0.00021296844,0.0019362635],"study_design_candidate":"design_other","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.000004659405,0.00006289334,0.005783373,0.0000029975351,0.000008298583,8.1219736e-7,0.0008871916,0.000368641,0.0000039236725,0.012025289,0.05269021,0.92816174],"study_design_scores_gemma":[0.0008226442,0.00008432163,0.28791842,0.000079971964,0.000009439007,0.0000036771446,0.00026983034,0.09440917,0.000034478137,0.19405404,0.4218585,0.0004555085],"about_ca_topic_score_codex":0.00017706091,"about_ca_topic_score_gemma":0.00014772303,"teacher_disagreement_score":0.9277062,"about_ca_system_score_codex":0.00006886838,"about_ca_system_score_gemma":0.000055718272,"threshold_uncertainty_score":0.99884087},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5952069,0.0012388695,0.38524666,0.003279086,0.00018048326,0.0012652177,0.00006650234,0.00011437365,0.013401872],"genre_scores_gemma":[0.5504128,0.00037336576,0.44911394,0.000010269373,0.000020932308,0.00002458145,0.000009455021,0.000010923778,0.000023740931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889666,0.00006141076,0.00064013136,0.00013689889,0.00015946077,0.000105448955],"domain_scores_gemma":[0.9922148,0.00085039774,0.0006913562,0.0060385615,0.00017896653,0.00002592613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042267557,0.00010294041,0.00028311656,0.00014029592,0.00018718567,0.00005074654,0.003199277,0.00006434152,0.000015227217],"category_scores_gemma":[0.00024235075,0.000102273596,0.000070179674,0.00017187934,0.00021840249,0.000120698314,0.0013437651,0.0001334848,0.000009563306],"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.000007675765,0.0014637389,0.005296808,0.0003683322,0.00008645978,5.423731e-7,0.0023213474,0.000036545887,0.002527214,0.94369936,0.0065994603,0.03759254],"study_design_scores_gemma":[0.0010768987,0.00007875888,0.025692433,0.00064859615,0.00007410298,0.0000051172246,0.00016145899,0.05971009,0.002309704,0.89940995,0.010437812,0.00039507687],"about_ca_topic_score_codex":0.000044223958,"about_ca_topic_score_gemma":0.000026173964,"teacher_disagreement_score":0.06386728,"about_ca_system_score_codex":0.000016172511,"about_ca_system_score_gemma":0.000031658776,"threshold_uncertainty_score":0.59451056},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0738597,0.0009010337,0.92215836,0.0009929861,0.00011106979,0.0004930643,0.00000891604,0.0003111073,0.0011637543],"genre_scores_gemma":[0.60144705,0.0002469942,0.39817676,0.000021118703,0.000015772968,0.00006237931,0.000013015826,0.000013247796,0.0000036822807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989607,0.00013638519,0.00044222068,0.00013225678,0.00017626693,0.00015220561],"domain_scores_gemma":[0.99429435,0.00017510721,0.00016600238,0.005184599,0.00014163436,0.000038332902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000602789,0.0001337156,0.00027266366,0.0001462037,0.00014505646,0.00004457221,0.0026995067,0.000066178116,0.000020600048],"category_scores_gemma":[0.00022521267,0.00014210737,0.00007582575,0.00012867022,0.00017293256,0.0003044871,0.0010917884,0.00020292873,0.00001894524],"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.000007953526,0.00047202368,0.011103742,0.000039686336,0.00019573764,0.0000010739242,0.0012087674,0.1441712,0.0029427658,0.0029575678,0.0010361078,0.83586335],"study_design_scores_gemma":[0.00052101654,0.000015825071,0.033295438,0.00006268101,0.00004202672,0.0000014903386,0.00002066717,0.95356315,0.0013915193,0.010558285,0.00034002695,0.00018786505],"about_ca_topic_score_codex":0.00009101583,"about_ca_topic_score_gemma":0.00018995097,"teacher_disagreement_score":0.83567554,"about_ca_system_score_codex":0.000108628425,"about_ca_system_score_gemma":0.000018022905,"threshold_uncertainty_score":0.579497},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24436715,0.0005538224,0.73290426,0.015899802,0.00083206483,0.0023926683,0.00006687514,0.00031563183,0.002667702],"genre_scores_gemma":[0.27341098,0.0010795373,0.7247072,0.000073550524,0.00015127209,0.0001594739,0.000115334355,0.000037779704,0.0002648578],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857014,0.00013718432,0.00043291986,0.0003030031,0.0002972262,0.00025951306],"domain_scores_gemma":[0.9961756,0.0004539132,0.0003007273,0.0028830643,0.000119920944,0.000066783134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049725786,0.00018096132,0.00021986302,0.00024951977,0.0010656642,0.00044266152,0.0016418769,0.000104062725,0.000025159454],"category_scores_gemma":[0.0002855544,0.00018751797,0.000040346113,0.00012985834,0.00019130395,0.0007987104,0.001518912,0.0003914241,0.000015551794],"study_design_candidate":"design_other","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.00015529829,0.0011716273,0.0019788549,0.00015654904,0.00012012289,0.0000046691293,0.008617066,0.0009865736,0.0003898314,0.06259852,0.008402675,0.9154182],"study_design_scores_gemma":[0.005520955,0.0005046719,0.0051350486,0.0004617944,0.000055257195,0.00006326367,0.00037729484,0.47428402,0.0014284439,0.48444027,0.026584964,0.0011440167],"about_ca_topic_score_codex":0.000024398736,"about_ca_topic_score_gemma":0.00002340912,"teacher_disagreement_score":0.9142742,"about_ca_system_score_codex":0.00019256979,"about_ca_system_score_gemma":0.000031431315,"threshold_uncertainty_score":0.81963354},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39325178,0.0005115158,0.5885888,0.014861393,0.00073008245,0.0005320664,0.000001992338,0.00017899962,0.0013433961],"genre_scores_gemma":[0.84324664,0.000024708776,0.15582035,0.00081696146,0.000042808264,0.000007781437,0.0000062851923,0.00000969512,0.000024749792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820775,0.00034566846,0.00058132404,0.00033679916,0.00024574818,0.00028269688],"domain_scores_gemma":[0.99346566,0.0014241524,0.00024650505,0.004712138,0.00010431475,0.000047243604],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007343996,0.00017186692,0.00026962903,0.00022239565,0.00013886894,0.000112220456,0.007523688,0.00006268313,0.000013505232],"category_scores_gemma":[0.00006744188,0.00013781841,0.00010780766,0.00092233927,0.00014726528,0.00039763455,0.005306479,0.00037576855,0.00013136647],"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.000011176103,0.00041623355,0.016736852,0.00004055545,0.00006991619,0.000002349604,0.0068816068,0.0020308627,0.0004892982,0.4745312,0.0010564642,0.49773347],"study_design_scores_gemma":[0.0007152919,0.000109813336,0.056066427,0.00016115753,0.00000625425,0.0000269258,0.000061144005,0.88107365,0.0003543807,0.058914844,0.0022213086,0.00028878992],"about_ca_topic_score_codex":0.00013717983,"about_ca_topic_score_gemma":0.00003650592,"teacher_disagreement_score":0.8790428,"about_ca_system_score_codex":0.00006102263,"about_ca_system_score_gemma":0.00009781031,"threshold_uncertainty_score":0.99784607},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4030072,0.004879629,0.49266517,0.078721225,0.0033425328,0.0014112506,0.000010920614,0.0015642974,0.014397764],"genre_scores_gemma":[0.8331858,0.00033518978,0.16393335,0.0019676026,0.0002946895,0.00006490454,0.000014812964,0.000021852133,0.00018178347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977728,0.0004421375,0.0005951837,0.00044361336,0.00023476663,0.00051147805],"domain_scores_gemma":[0.9915616,0.003292528,0.00015831857,0.00482193,0.00006487188,0.000100770674],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00055084337,0.00021626215,0.00021518998,0.00031542266,0.0005283168,0.000567287,0.010074425,0.00009234118,0.0000045646148],"category_scores_gemma":[0.00022646197,0.00018432098,0.00007613081,0.0017093638,0.00039979315,0.0011292453,0.006774821,0.0004521647,0.00018378551],"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.0000046025766,0.0003420665,0.0076751877,0.000008264333,0.000031533134,0.0000146284365,0.0058793165,0.00012944931,0.000060360726,0.3689843,0.022027059,0.5948432],"study_design_scores_gemma":[0.0009432796,0.00018379767,0.0993317,0.000113939655,0.000004700298,0.00004619255,0.000117069,0.46589515,0.00045581989,0.28408974,0.14856209,0.00025653152],"about_ca_topic_score_codex":0.00010131101,"about_ca_topic_score_gemma":0.00041545983,"teacher_disagreement_score":0.5945867,"about_ca_system_score_codex":0.00006848965,"about_ca_system_score_gemma":0.00019630362,"threshold_uncertainty_score":0.9952815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037048895,0.00029192585,0.9463821,0.011441883,0.0007589476,0.00022657927,0.0000014404891,0.00047649772,0.0033717114],"genre_scores_gemma":[0.6027355,0.000033582295,0.3958142,0.0011568784,0.0001889608,0.000021502925,0.000006471283,0.000008524512,0.000034360546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843824,0.00020382144,0.00041034864,0.0004142115,0.00019576344,0.00033762894],"domain_scores_gemma":[0.9941854,0.00045801248,0.00010552236,0.0050250157,0.00013435225,0.00009171596],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003916426,0.0001713471,0.00018970382,0.00028764675,0.00028942004,0.00021524975,0.0075050127,0.00006984236,0.000018579512],"category_scores_gemma":[0.000072348295,0.00017773909,0.000066829416,0.0010336192,0.00025245512,0.0006629162,0.004964471,0.00024880902,0.00046730283],"study_design_candidate":"design_other","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.0000037388643,0.00021867892,0.001403188,0.0000048130355,0.00001697739,0.000003878575,0.0017786754,0.00004138125,0.00014574356,0.30291718,0.0038566482,0.6896091],"study_design_scores_gemma":[0.00076030055,0.00020040403,0.033287708,0.00006643478,0.000005193712,0.0000409307,0.000012490084,0.6596662,0.0005413337,0.27206004,0.032864343,0.00049462455],"about_ca_topic_score_codex":0.000071928036,"about_ca_topic_score_gemma":0.00011289102,"teacher_disagreement_score":0.6891145,"about_ca_system_score_codex":0.00007719807,"about_ca_system_score_gemma":0.0000950649,"threshold_uncertainty_score":0.99786484},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38029027,0.0003018908,0.60809034,0.0077640046,0.0013178012,0.0008788977,0.000010111228,0.0003580103,0.0009886515],"genre_scores_gemma":[0.5400324,0.00008699378,0.45932162,0.00034429808,0.00012238517,0.000042684715,0.000026674648,0.00001736274,0.000005587104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578744,0.0006239081,0.0015675228,0.00087986566,0.00048227693,0.0006589757],"domain_scores_gemma":[0.9893213,0.0016587225,0.00041639444,0.007858619,0.00056703103,0.00017791918],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011647018,0.00040300319,0.00060898793,0.00075227354,0.0002484949,0.0002330848,0.009651615,0.00019079183,0.00006169159],"category_scores_gemma":[0.00020592561,0.0004314844,0.00014807285,0.0025992922,0.00060278404,0.00089143426,0.0059382557,0.0006593973,0.000112244124],"study_design_candidate":"design_other","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.000027913838,0.003556748,0.041608218,0.000068340094,0.000095576914,0.000025464362,0.011385429,0.0044061295,0.00023022901,0.087392956,0.0011833354,0.85001963],"study_design_scores_gemma":[0.0011773861,0.00036393956,0.41165772,0.00015021936,0.0000109766515,0.000031200194,0.000041819178,0.51192075,0.00046776258,0.07072545,0.0028117776,0.0006410126],"about_ca_topic_score_codex":0.00052581966,"about_ca_topic_score_gemma":0.0021524215,"teacher_disagreement_score":0.84937865,"about_ca_system_score_codex":0.000256843,"about_ca_system_score_gemma":0.0002558219,"threshold_uncertainty_score":0.9998137},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4261168,0.0010554058,0.56791395,0.0029914633,0.00034246323,0.00033037257,0.000004112254,0.0002663332,0.0009790878],"genre_scores_gemma":[0.63487446,0.00018164021,0.36434022,0.0005102328,0.000057392488,0.000012483322,0.000003301384,0.0000061096957,0.000014191106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984129,0.0004345782,0.00033858424,0.00040058157,0.00014431267,0.0002690538],"domain_scores_gemma":[0.9944319,0.0013790434,0.00012054335,0.0038056448,0.00018310771,0.0000797608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038755938,0.00017471632,0.0002674869,0.000316583,0.00032758102,0.00022832608,0.004294759,0.000069067304,0.000009089415],"category_scores_gemma":[0.000110526285,0.00017362605,0.00004247817,0.0012399466,0.0006257717,0.0005119065,0.0050434554,0.00027292094,0.00005660353],"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.000008156925,0.00034475056,0.012728846,0.000026422855,0.000056528846,0.000007451358,0.0038157997,0.000017460246,0.00026396054,0.5727707,0.0005885136,0.40937144],"study_design_scores_gemma":[0.0014971466,0.0005027605,0.30192798,0.0001235899,0.00001244918,0.00009701015,0.00010224389,0.37410787,0.00087510224,0.29255697,0.027390294,0.00080660015],"about_ca_topic_score_codex":0.000030087418,"about_ca_topic_score_gemma":0.000010046001,"teacher_disagreement_score":0.40856484,"about_ca_system_score_codex":0.000024959429,"about_ca_system_score_gemma":0.000035697358,"threshold_uncertainty_score":0.79808027},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012549934,0.000393293,0.9396949,0.045034375,0.0007681679,0.0004568445,0.0000053262906,0.00056843547,0.0005287587],"genre_scores_gemma":[0.40639237,0.000139153,0.5926262,0.0005763038,0.00009667784,0.00008193985,0.0000086281925,0.000017529375,0.00006118628],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968735,0.00066968537,0.000749231,0.00075832405,0.00043594794,0.00051332795],"domain_scores_gemma":[0.9871274,0.002614854,0.00021564189,0.009566744,0.00032204232,0.00015331114],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011631504,0.0002977298,0.000348732,0.00043810435,0.00025056856,0.00025083707,0.010796716,0.00015046302,0.000023242663],"category_scores_gemma":[0.00040097767,0.00024650665,0.00013076806,0.0012439038,0.0002907397,0.0011000666,0.007977325,0.00034779776,0.00035689134],"study_design_candidate":"design_other","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.000005607338,0.00051465986,0.007921644,0.000014165799,0.000038710474,0.000007670667,0.0016759816,0.00014138498,0.00030065834,0.11579039,0.0048594465,0.86872965],"study_design_scores_gemma":[0.002041211,0.00026161716,0.10902936,0.00020003818,0.000014165253,0.00006787577,0.00001900984,0.27542904,0.00031683085,0.5788967,0.032714047,0.0010101033],"about_ca_topic_score_codex":0.00006102067,"about_ca_topic_score_gemma":0.00010300846,"teacher_disagreement_score":0.8677196,"about_ca_system_score_codex":0.00031556052,"about_ca_system_score_gemma":0.00016778902,"threshold_uncertainty_score":0.9999987},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95918083,0.00041644907,0.030272793,0.0010734318,0.00047711158,0.00062244135,0.0000057487246,0.00027914665,0.0076720403],"genre_scores_gemma":[0.6880431,0.00008266192,0.3112534,0.00026353815,0.00006767778,0.000043758122,0.000047995487,0.00003104535,0.00016684317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979428,0.0003877957,0.00068426214,0.0003445757,0.00029175263,0.00034880044],"domain_scores_gemma":[0.99165714,0.0037757617,0.0002346565,0.004136468,0.00012800428,0.00006799091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012448311,0.00023254925,0.00036468313,0.0007202488,0.00020173492,0.00010866118,0.0025839654,0.00015997275,0.0002755244],"category_scores_gemma":[0.00058466924,0.00024325578,0.000102541104,0.0020374102,0.00008495847,0.00044136692,0.0018858633,0.0005796049,0.0005829065],"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.00002246556,0.0010003097,0.0676235,0.00017833825,0.00016028422,0.000005204166,0.0032390011,0.00014395312,0.00018323511,0.63070935,0.0018522467,0.2948821],"study_design_scores_gemma":[0.001577112,0.00012885491,0.024841616,0.00022078627,0.00003489707,0.000042326938,0.00031523439,0.05094514,0.00028521218,0.9162681,0.004609104,0.0007316165],"about_ca_topic_score_codex":0.000027052683,"about_ca_topic_score_gemma":0.000011859836,"teacher_disagreement_score":0.29415047,"about_ca_system_score_codex":0.00010401867,"about_ca_system_score_gemma":0.000048259353,"threshold_uncertainty_score":0.9919683},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95312023,0.022791123,0.0050386763,0.012404392,0.0010443083,0.0012180608,0.000006913852,0.00034056956,0.004035734],"genre_scores_gemma":[0.99765193,0.0010569422,0.0009562815,0.00018668013,0.000038849237,0.000054051052,0.0000070436754,0.000015531603,0.000032663593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991787,0.0002721999,0.00021772138,0.0001017937,0.00007212057,0.00015747883],"domain_scores_gemma":[0.9954531,0.0016625047,0.00003260245,0.002816964,0.000011255661,0.00002356419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000537843,0.00011428718,0.00014975389,0.000037031707,0.00022852333,0.00010942655,0.0016559137,0.00005713113,0.0000050784256],"category_scores_gemma":[0.00001733358,0.00006859902,0.000045424098,0.00019379893,0.000246569,0.000077455,0.00044515906,0.00033389777,0.00005918889],"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.000019483943,0.000022672859,0.007781253,0.00003609254,0.00012844967,8.5102135e-7,0.0050369147,0.0036378014,0.000026752026,0.9468053,0.001776409,0.03472802],"study_design_scores_gemma":[0.0027411135,0.000051531006,0.038739916,0.00017556449,0.000034334575,0.000089463225,0.00039912385,0.33873636,0.000053145206,0.41991398,0.198573,0.0004925079],"about_ca_topic_score_codex":0.000018145063,"about_ca_topic_score_gemma":0.000093246905,"teacher_disagreement_score":0.52689135,"about_ca_system_score_codex":0.000020610021,"about_ca_system_score_gemma":0.0000068491727,"threshold_uncertainty_score":0.3077127},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40069586,0.0004611385,0.5955555,0.0017953055,0.00021902409,0.0001914299,0.0000013840655,0.000113709546,0.00096665893],"genre_scores_gemma":[0.71649194,0.000071120696,0.283031,0.00037624183,0.000011441984,0.0000031345014,0.0000026851335,0.000005133965,0.0000073311353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988952,0.00017424361,0.0003476915,0.00027528653,0.0001217902,0.00018577464],"domain_scores_gemma":[0.9950108,0.0015299058,0.00013524976,0.0032167602,0.00006408869,0.00004319164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005150763,0.00012435766,0.00022510708,0.00025781165,0.000101382626,0.00008078154,0.0035490203,0.000070386435,0.0000112498365],"category_scores_gemma":[0.000045293404,0.00013237962,0.00006334617,0.00064230006,0.00013374459,0.0002941428,0.0038373847,0.00026850827,0.000017199078],"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.000007541617,0.0002148934,0.038381815,0.000049615337,0.000040078306,0.000002044232,0.0053019105,0.0007449949,0.00020299265,0.78277177,0.00020614706,0.1720762],"study_design_scores_gemma":[0.0008647101,0.00023438441,0.029612673,0.00026339432,0.00000890247,0.000023520812,0.00006401651,0.7539279,0.0002782043,0.2121878,0.002142759,0.000391782],"about_ca_topic_score_codex":0.00002503944,"about_ca_topic_score_gemma":0.000008009522,"teacher_disagreement_score":0.7531829,"about_ca_system_score_codex":0.000011196707,"about_ca_system_score_gemma":0.000023354287,"threshold_uncertainty_score":0.65950215},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70159674,0.00040305246,0.28741947,0.006615258,0.0013436512,0.001273451,0.0000100412935,0.00032143036,0.0010169185],"genre_scores_gemma":[0.5812742,0.00011273114,0.4181565,0.00029861982,0.000046733097,0.00004331002,0.00003815236,0.000018927623,0.00001084569],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958296,0.00059160515,0.0015460391,0.0008969046,0.00050626555,0.00062959635],"domain_scores_gemma":[0.9887322,0.0020057636,0.00042249108,0.008333081,0.00034927562,0.00015717284],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010891943,0.00040487753,0.00068417663,0.00073471083,0.00013075734,0.00021798974,0.009395408,0.00019278428,0.00007905387],"category_scores_gemma":[0.00012348233,0.0004347095,0.00017071342,0.0022638047,0.00022627319,0.0009571507,0.0056392187,0.00077658385,0.00017812323],"study_design_candidate":"design_other","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.000029696692,0.0041686343,0.15315624,0.00015188639,0.00011683199,0.000027609172,0.00906752,0.038834475,0.00035134534,0.11713028,0.00062185293,0.6763436],"study_design_scores_gemma":[0.0012356037,0.00020844453,0.45039415,0.00014600491,0.000007848733,0.000021973467,0.00004116118,0.5049652,0.00019073075,0.040571015,0.0016566761,0.0005611862],"about_ca_topic_score_codex":0.00044722535,"about_ca_topic_score_gemma":0.00082596584,"teacher_disagreement_score":0.67578244,"about_ca_system_score_codex":0.00027070753,"about_ca_system_score_gemma":0.00024639178,"threshold_uncertainty_score":0.99981046},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011672919,0.00026202988,0.98453474,0.0016677413,0.0006423,0.0004415261,0.000004976311,0.00030383255,0.00046994042],"genre_scores_gemma":[0.15097153,0.000039436156,0.8481917,0.00061670376,0.00007114702,0.000027018259,0.000020517737,0.000017344586,0.000044649918],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984622,0.00018779594,0.000393766,0.00044115307,0.00015574221,0.0003593472],"domain_scores_gemma":[0.9928946,0.00168922,0.00013728946,0.00509475,0.00008195372,0.000102177655],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00055389706,0.00020616449,0.00025668836,0.0002965396,0.00023211566,0.00025430118,0.006826965,0.000087942884,0.000013530213],"category_scores_gemma":[0.000043049353,0.0002107973,0.0001619937,0.00091676705,0.000045752688,0.0005326883,0.0029669916,0.00027991732,0.00005975035],"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.0000030278443,0.00012060371,0.0037866752,0.00001009591,0.00004156806,5.8001984e-7,0.002060439,0.00005780377,0.00007733754,0.40809613,0.0009577536,0.58478796],"study_design_scores_gemma":[0.0014775607,0.00023164088,0.00697142,0.00013086398,0.000015503523,0.0000111338295,0.00006219052,0.43150264,0.00028752626,0.5286868,0.029942716,0.00067995937],"about_ca_topic_score_codex":0.000061256265,"about_ca_topic_score_gemma":0.000012474676,"teacher_disagreement_score":0.584108,"about_ca_system_score_codex":0.000037378653,"about_ca_system_score_gemma":0.00008988547,"threshold_uncertainty_score":0.9985466},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5577237,0.00035740403,0.42327797,0.016341012,0.0004754162,0.0009479544,0.000014207126,0.00022386009,0.00063849526],"genre_scores_gemma":[0.67749995,0.000058937807,0.3219598,0.00037525562,0.000029926072,0.000022439184,0.00003491979,0.000012336489,0.000006457682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780875,0.00033034498,0.00063789566,0.0005880549,0.0002130129,0.00042192018],"domain_scores_gemma":[0.9949711,0.002861246,0.00013252744,0.001802845,0.00011872335,0.000113552596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007319973,0.0002488624,0.0004261634,0.00038556196,0.00018671433,0.0002796712,0.0023711442,0.00010254335,0.00000609287],"category_scores_gemma":[0.00011578328,0.00026582295,0.00007865012,0.00064739917,0.00026381147,0.0008089364,0.0015686913,0.00032794193,0.000030153356],"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.00008160286,0.0011007369,0.051331505,0.00019812424,0.000051917134,0.000007550565,0.0056096446,0.0071171923,0.00054484257,0.71834755,0.0012216057,0.21438771],"study_design_scores_gemma":[0.0011521828,0.00015471119,0.14206728,0.00008957119,0.000004400483,0.000011501478,0.000046631096,0.7139219,0.000029627885,0.14186703,0.00037156508,0.00028357687],"about_ca_topic_score_codex":0.0004994381,"about_ca_topic_score_gemma":0.00035334218,"teacher_disagreement_score":0.70680475,"about_ca_system_score_codex":0.00014032837,"about_ca_system_score_gemma":0.0000980366,"threshold_uncertainty_score":0.9999794},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5697938,0.004254486,0.20118581,0.21248782,0.00030782144,0.0003828234,0.00010794845,0.00045810651,0.011021347],"genre_scores_gemma":[0.907617,0.0002813348,0.08951602,0.002340445,0.000048644342,9.079825e-7,0.00017287121,0.0000013504648,0.0000214794],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992251,0.00013302635,0.00020280725,0.00019003771,0.00009667977,0.00015239709],"domain_scores_gemma":[0.9985221,0.00024034115,0.0000407878,0.0010707784,0.00003730509,0.00008868298],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013579256,0.00008015421,0.00014206914,0.00004401319,0.00010679711,0.000056399687,0.001906914,0.000043307944,0.00079143944],"category_scores_gemma":[0.00007124151,0.000069159054,0.000045602235,0.00033214543,0.00007164316,0.000091791226,0.00026818304,0.00021452429,0.00097166724],"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.000011317357,0.000073162686,0.4952755,0.000010872558,0.000039665167,0.000006899109,0.0013566437,0.053641867,0.000007508336,0.0023340466,0.0082789445,0.4389636],"study_design_scores_gemma":[0.00011954967,0.000045495137,0.111010075,0.0000086230675,0.0000063401826,0.0000014686169,0.000028305078,0.8744064,0.0000019437011,0.006592989,0.007667742,0.000111102665],"about_ca_topic_score_codex":0.0008157439,"about_ca_topic_score_gemma":0.00095534825,"teacher_disagreement_score":0.8207645,"about_ca_system_score_codex":0.0000016724515,"about_ca_system_score_gemma":0.00002054243,"threshold_uncertainty_score":0.99980617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076939344,0.0020222354,0.69746697,0.21110632,0.0011927957,0.0077456976,0.00008332583,0.0005794554,0.0028638486],"genre_scores_gemma":[0.78555447,0.0001563815,0.2117851,0.0017941764,0.00015619956,0.00046795717,0.000027095584,0.00004485025,0.000013784206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807304,0.00045828125,0.0006725581,0.00022639759,0.00023641455,0.00033333237],"domain_scores_gemma":[0.98186094,0.013733008,0.00020058856,0.004094788,0.00006117882,0.000049490063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009527381,0.00020849747,0.00030790645,0.000052764823,0.0003491567,0.00013589504,0.0051418897,0.00009232775,0.0000048451316],"category_scores_gemma":[0.0011573201,0.0001416815,0.000095613635,0.00043896114,0.00016913659,0.00012999498,0.0010796328,0.0005876148,0.000024056253],"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.0000316736,0.00042619774,0.00025097135,0.00009600657,0.000041813368,0.000004963771,0.017600037,0.000018268916,0.000032107477,0.94921404,0.012458734,0.019825166],"study_design_scores_gemma":[0.001018074,0.00011964387,0.00031519937,0.00008745712,0.00001671756,0.0000070197257,0.0008177455,0.0140027525,0.00002869815,0.9695522,0.013833608,0.00020085351],"about_ca_topic_score_codex":0.0000069275425,"about_ca_topic_score_gemma":0.00013370717,"teacher_disagreement_score":0.7086151,"about_ca_system_score_codex":0.000058953377,"about_ca_system_score_gemma":0.000034730463,"threshold_uncertainty_score":0.9554996},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016787028,0.00067942723,0.9615331,0.02007533,0.00020023555,0.0003015072,0.0000014296576,0.00027460628,0.00014732472],"genre_scores_gemma":[0.4644806,0.000038464896,0.53295624,0.0024205493,0.00008235843,0.000007695953,0.0000034093189,0.000010083835,5.9534597e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997343,0.001146679,0.000466558,0.00045267472,0.00026327462,0.00032779784],"domain_scores_gemma":[0.9937558,0.0015466298,0.00017807624,0.004315593,0.00009414485,0.000109745335],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011881393,0.00020385084,0.00026048406,0.000180883,0.000593761,0.00029183648,0.008556175,0.00006947754,0.000006518686],"category_scores_gemma":[0.00010633267,0.00017569622,0.00014290186,0.0020131695,0.00014714575,0.00033114103,0.006724794,0.00053375546,0.000020327472],"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.0000142691815,0.00041584278,0.003069046,0.000034544304,0.00013160982,0.000007809682,0.010226631,0.008975952,0.001753871,0.48219016,0.00053088926,0.49264938],"study_design_scores_gemma":[0.00031568782,0.00007427163,0.0033702462,0.00007516528,0.000017965338,0.000016881222,0.00005073734,0.94349986,0.00027381603,0.04887101,0.0031684216,0.0002659542],"about_ca_topic_score_codex":0.000047124857,"about_ca_topic_score_gemma":0.000016870576,"teacher_disagreement_score":0.9345239,"about_ca_system_score_codex":0.00005095229,"about_ca_system_score_gemma":0.00005314915,"threshold_uncertainty_score":0.996808},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06658416,0.0043612,0.073945306,0.83514494,0.00429937,0.0010647064,0.000047988975,0.0003681027,0.014184216],"genre_scores_gemma":[0.9294443,0.00076173694,0.05671163,0.011213759,0.0012322946,0.000049898896,0.00003462161,0.000026950423,0.0005248081],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99639696,0.00095817714,0.0009232289,0.00045865905,0.0009512997,0.00031167665],"domain_scores_gemma":[0.9837939,0.009971519,0.00031205645,0.0054980335,0.0002665056,0.00015798968],"candidate_categories":["metaresearch","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0043905685,0.00015436226,0.0002751265,0.00012019587,0.00068704085,0.0019168895,0.028418763,0.00013816167,0.00005985087],"category_scores_gemma":[0.009174327,0.00010213959,0.00010524756,0.0016856585,0.00029930763,0.0011014446,0.009801158,0.0010422122,0.00075731246],"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.000022908976,0.00004551017,0.006150821,9.432126e-7,0.000022012404,0.0000015665736,0.0023378532,0.0001411296,0.000017972445,0.01929148,0.72553444,0.24643336],"study_design_scores_gemma":[0.0006210174,0.00004100992,0.013955317,0.000016231972,0.0000082298375,0.0000056593135,0.00023829649,0.053031135,0.00003701252,0.10928442,0.82250607,0.00025558402],"about_ca_topic_score_codex":0.000077968194,"about_ca_topic_score_gemma":0.000056324396,"teacher_disagreement_score":0.86286014,"about_ca_system_score_codex":0.000045231503,"about_ca_system_score_gemma":0.0001446713,"threshold_uncertainty_score":0.9991718},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023198912,0.008256631,0.87148565,0.094218604,0.00046137942,0.0008381795,0.0000070642436,0.00070270046,0.0008308905],"genre_scores_gemma":[0.5903833,0.002057169,0.3950137,0.012356073,0.00007714858,0.000072213974,0.000013714305,0.00001987696,0.0000068371164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980386,0.000327778,0.0004632854,0.000559541,0.00024778387,0.00036305023],"domain_scores_gemma":[0.9942022,0.0007800628,0.00011898466,0.00464727,0.00007713902,0.00017433353],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00026102248,0.00024841286,0.00030840645,0.0002412476,0.00023664396,0.00017752928,0.007602558,0.00008031277,0.000010481932],"category_scores_gemma":[0.00013872629,0.00023749455,0.00014715205,0.001722029,0.00017674796,0.00030157337,0.0033472276,0.00053350296,0.00010955914],"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.000032375487,0.0024117786,0.005776717,0.00044060932,0.00028528133,0.000060837603,0.0056060962,0.0017829834,0.0017041754,0.19658528,0.012381632,0.77293223],"study_design_scores_gemma":[0.0010770193,0.0005643833,0.017911203,0.00031956777,0.000029597222,0.000026079091,0.000021369613,0.95517087,0.000360922,0.016227162,0.007561034,0.0007308015],"about_ca_topic_score_codex":0.000032658205,"about_ca_topic_score_gemma":0.000017621376,"teacher_disagreement_score":0.95338786,"about_ca_system_score_codex":0.000032705084,"about_ca_system_score_gemma":0.000065424654,"threshold_uncertainty_score":0.9977668},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09018685,0.0011029713,0.88712186,0.018760204,0.0007649072,0.000504836,0.000021587886,0.0003848104,0.0011519551],"genre_scores_gemma":[0.5579875,0.00006895645,0.43967575,0.0019611653,0.000106230524,0.000045150777,0.00008410425,0.000025034244,0.00004611733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603915,0.0007793304,0.0012119638,0.00093364686,0.00039147577,0.0006444168],"domain_scores_gemma":[0.99145865,0.0011097755,0.0003052333,0.006653207,0.00025571135,0.00021742826],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00071436696,0.00037400692,0.00071266753,0.00074100203,0.00016945464,0.0007485813,0.010335427,0.00021892467,0.000026470461],"category_scores_gemma":[0.00014017272,0.00040432895,0.00017947411,0.0045678397,0.00009822537,0.0012631096,0.011015622,0.00073283573,0.00005212258],"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.00004922918,0.0029526942,0.16473284,0.0003863593,0.00027427147,0.00025223472,0.011409619,0.03301588,0.0004116507,0.118188865,0.07772814,0.5905982],"study_design_scores_gemma":[0.0025577357,0.0003657312,0.083217844,0.0017806191,0.00001999855,0.00025093064,0.00004778227,0.79001576,0.00096515,0.04105952,0.07812086,0.001598049],"about_ca_topic_score_codex":0.00034198456,"about_ca_topic_score_gemma":0.00038834775,"teacher_disagreement_score":0.7569999,"about_ca_system_score_codex":0.00010717648,"about_ca_system_score_gemma":0.0004390357,"threshold_uncertainty_score":0.99984086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004416202,0.0008664231,0.9372282,0.055653557,0.0008175234,0.00030238778,0.0000024895844,0.00029400695,0.00041918526],"genre_scores_gemma":[0.16391113,0.0005900814,0.8342094,0.0008710655,0.00018025952,0.00011434702,0.0000019840472,0.000019290434,0.000102446225],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975261,0.00068505976,0.00051759754,0.0004651244,0.00027120564,0.00053489156],"domain_scores_gemma":[0.9884316,0.003665658,0.00014725061,0.0075240666,0.00009870526,0.00013273227],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0010950037,0.00021638995,0.00023653568,0.00011507428,0.0005636033,0.0003873173,0.011588522,0.00008182437,0.0000078647845],"category_scores_gemma":[0.00024239991,0.00012567322,0.0001281654,0.0008883345,0.0004302052,0.0005092997,0.0055947336,0.000313922,0.00014980051],"study_design_candidate":"design_other","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.0000024610572,0.000092392664,0.0008358193,0.0000011497681,0.000014916992,0.0000022009206,0.00012110023,9.127859e-7,0.00008100964,0.07213592,0.001172818,0.9255393],"study_design_scores_gemma":[0.00231399,0.00040402726,0.040246505,0.00020104599,0.00001719913,0.00008274687,0.00003583642,0.08185286,0.000811966,0.3857695,0.4870816,0.0011827544],"about_ca_topic_score_codex":0.00006035691,"about_ca_topic_score_gemma":0.000045498426,"teacher_disagreement_score":0.9243565,"about_ca_system_score_codex":0.00009433793,"about_ca_system_score_gemma":0.00008239007,"threshold_uncertainty_score":0.9937593},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8417932,0.0000878012,0.032348588,0.04483333,0.0006007857,0.0005370823,0.0000072735556,0.00018467558,0.079607256],"genre_scores_gemma":[0.7898602,0.0001025511,0.20567042,0.0021863761,0.00012002722,0.00008717701,0.00008943854,0.000021312046,0.0018624788],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866074,0.00014149591,0.000411736,0.00028318656,0.00024189793,0.00026091997],"domain_scores_gemma":[0.99669874,0.00029371807,0.00011525223,0.0027646017,0.000044211527,0.00008348288],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00044240948,0.0001549565,0.00015127155,0.00006709023,0.00033309465,0.000075274475,0.0019734013,0.000089342524,0.004178124],"category_scores_gemma":[0.00011626811,0.00014066987,0.00004889015,0.0006608307,0.000236879,0.0005434243,0.0019314748,0.00030284605,0.0071618212],"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.000004012397,0.0007092918,0.47060072,0.000009297047,0.0000193226,3.6872487e-7,0.0011230931,0.0012150574,0.0002566436,0.016995145,0.33013853,0.17892848],"study_design_scores_gemma":[0.00022852804,0.000022805125,0.33202752,0.000040584833,0.0000055552,0.000010187872,0.00004204079,0.039280932,0.000036834677,0.021416552,0.6066425,0.00024598453],"about_ca_topic_score_codex":0.0007169837,"about_ca_topic_score_gemma":0.00066509005,"teacher_disagreement_score":0.27650392,"about_ca_system_score_codex":0.00017679908,"about_ca_system_score_gemma":0.000026071244,"threshold_uncertainty_score":0.9967322},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35067156,0.00068508077,0.6338734,0.010812617,0.0014402294,0.0010485961,0.000011447791,0.00041981996,0.001037223],"genre_scores_gemma":[0.5256049,0.00008153547,0.47385445,0.00027924677,0.00006730011,0.000050977902,0.000038325863,0.000017530225,0.0000057372235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956841,0.0007283877,0.0015719517,0.00081055163,0.0005867186,0.0006183197],"domain_scores_gemma":[0.9898456,0.0015381454,0.0004124194,0.007358988,0.0005637961,0.0002811048],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015415946,0.00040055512,0.00064466393,0.00072966015,0.00013749677,0.0002348749,0.009275128,0.00018775598,0.000019200608],"category_scores_gemma":[0.00030296872,0.00042866665,0.00014071859,0.002429781,0.00031852693,0.0009929716,0.0059153424,0.0007269637,0.00007290065],"study_design_candidate":"design_other","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.00003676575,0.0049648364,0.06391734,0.000079826204,0.00010717801,0.000055227665,0.016971337,0.045689456,0.000085049265,0.09806295,0.0022005104,0.76782954],"study_design_scores_gemma":[0.0018653205,0.0002951159,0.24999134,0.00013435054,0.00001210267,0.000042322026,0.000095106996,0.6397279,0.00017319819,0.10391464,0.0030399254,0.0007086887],"about_ca_topic_score_codex":0.00066323485,"about_ca_topic_score_gemma":0.0014046843,"teacher_disagreement_score":0.76712084,"about_ca_system_score_codex":0.00036893773,"about_ca_system_score_gemma":0.00041541166,"threshold_uncertainty_score":0.99981654},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08060048,0.002637769,0.03062582,0.012928643,0.005956812,0.00068627036,0.00016650178,0.0003105102,0.8660872],"genre_scores_gemma":[0.7705291,0.0012020714,0.12370521,0.0021378428,0.00039262706,0.000113801674,0.000102421494,0.000057759014,0.10175919],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984554,0.00006695866,0.00066647824,0.00046077618,0.00003611998,0.0003142396],"domain_scores_gemma":[0.99637413,0.00023030574,0.0002483783,0.0030305202,0.000043331755,0.00007333484],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008420864,0.0001742863,0.0003991097,0.00018397065,0.00028394983,0.00015923998,0.0019646855,0.00009655463,0.006724122],"category_scores_gemma":[0.00008643384,0.00020645859,0.0001093178,0.00029608965,0.00020795426,0.00039316158,0.0019444838,0.0002289386,0.08133646],"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.0000031185536,0.00019297459,0.10845563,0.000014924606,0.000061774226,5.445476e-7,0.0011308191,0.0002256339,8.681096e-7,0.058663007,0.8203303,0.01092036],"study_design_scores_gemma":[0.00039094404,0.000012045128,0.015589001,0.000025190806,0.0000045112433,0.0000026611328,0.00006846341,0.052682813,0.000002143242,0.021962423,0.90900177,0.00025806102],"about_ca_topic_score_codex":0.0002819053,"about_ca_topic_score_gemma":0.000113755734,"teacher_disagreement_score":0.764328,"about_ca_system_score_codex":0.000099010664,"about_ca_system_score_gemma":0.000011385726,"threshold_uncertainty_score":0.99418384},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48006207,0.00042185033,0.4973086,0.017429648,0.0017296129,0.0011804265,0.000015967085,0.00034487364,0.0015069596],"genre_scores_gemma":[0.5724329,0.00015533093,0.42705077,0.00019134054,0.000072031995,0.000049694965,0.000023658386,0.00001705761,0.0000072074536],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9960965,0.00047737887,0.0014579367,0.00086508406,0.00047654498,0.00062658254],"domain_scores_gemma":[0.98360384,0.0014319615,0.0007144847,0.013690114,0.00038125832,0.00017837131],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012226242,0.00040489563,0.00066034665,0.0005597999,0.00054490205,0.00059392134,0.016525712,0.0001930545,0.000031205072],"category_scores_gemma":[0.00036719898,0.00043544624,0.00017212942,0.0008397318,0.0005245473,0.0014022487,0.009255273,0.00076476554,0.000057089645],"study_design_candidate":"design_other","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.000017504186,0.0026496677,0.084024064,0.00006924058,0.00007990058,0.000039958304,0.005143024,0.0072917286,0.00011295908,0.077129744,0.0005192198,0.822923],"study_design_scores_gemma":[0.0009565863,0.00011638903,0.6291799,0.0001236832,0.000008102372,0.000018094364,0.00001959545,0.3139577,0.00015828948,0.053865284,0.0011496192,0.0004467551],"about_ca_topic_score_codex":0.0009452729,"about_ca_topic_score_gemma":0.0024066113,"teacher_disagreement_score":0.8224762,"about_ca_system_score_codex":0.00023088689,"about_ca_system_score_gemma":0.00024182585,"threshold_uncertainty_score":0.99980974},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23982562,0.00049271947,0.722667,0.034342002,0.00069167255,0.001012756,0.00001430449,0.00044419747,0.0005097302],"genre_scores_gemma":[0.5470708,0.00012611164,0.4516803,0.00094512134,0.00007990531,0.000041593637,0.000036365844,0.000018050921,0.0000017810631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585116,0.0006093512,0.0015829998,0.0008983923,0.0004822344,0.00057586544],"domain_scores_gemma":[0.99188423,0.0016508894,0.00039793013,0.0054855687,0.00032313075,0.00025825071],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00073050515,0.0004008654,0.0006666695,0.00044156978,0.00016514157,0.00022166297,0.0095692035,0.00016980372,0.000044004977],"category_scores_gemma":[0.0002628239,0.00043823963,0.00016758016,0.0026853401,0.0002778432,0.0008440142,0.0060924757,0.00081742555,0.000074961674],"study_design_candidate":"design_other","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.00003820621,0.0032322223,0.04606142,0.00015703186,0.000121121884,0.000059627502,0.02008949,0.04023484,0.00031999664,0.080174066,0.0014528771,0.8080591],"study_design_scores_gemma":[0.0011633087,0.000252636,0.22403124,0.00009488404,0.000010574934,0.000015753229,0.000051747957,0.7443071,0.0002449029,0.027003046,0.002253098,0.0005717043],"about_ca_topic_score_codex":0.00028718417,"about_ca_topic_score_gemma":0.00053306465,"teacher_disagreement_score":0.80748737,"about_ca_system_score_codex":0.00018537184,"about_ca_system_score_gemma":0.00024168036,"threshold_uncertainty_score":0.99980694},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3470636,0.0010752693,0.63424677,0.014302283,0.0013157306,0.00074308,0.00001512169,0.0003469768,0.00089114415],"genre_scores_gemma":[0.49682266,0.00024047878,0.50234747,0.00039464264,0.00006056645,0.00004470388,0.00006288527,0.000017566439,0.000009010246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955769,0.0008068082,0.0015857101,0.0009256315,0.0004955483,0.0006093873],"domain_scores_gemma":[0.98874825,0.0020974916,0.0003633161,0.008030857,0.00058542576,0.00017465913],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009340315,0.00038600608,0.0006593835,0.0005469395,0.00019111703,0.00026990206,0.007332255,0.00018739293,0.00006320542],"category_scores_gemma":[0.00027615143,0.00043582104,0.00018311256,0.0029175265,0.00026813595,0.0008083946,0.0065906527,0.00077761814,0.000052364216],"study_design_candidate":"design_other","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.00001565541,0.00497894,0.043521866,0.00011361111,0.0001224611,0.00013545854,0.008084709,0.022837404,0.00039613436,0.11040148,0.0008069145,0.80858535],"study_design_scores_gemma":[0.001420053,0.00014608278,0.43997106,0.00019711086,0.000014945731,0.000079117985,0.00007738488,0.47430676,0.00088239985,0.07931797,0.0028549412,0.00073217734],"about_ca_topic_score_codex":0.00030797176,"about_ca_topic_score_gemma":0.0018348191,"teacher_disagreement_score":0.80785316,"about_ca_system_score_codex":0.00026546212,"about_ca_system_score_gemma":0.00044323152,"threshold_uncertainty_score":0.9998094},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3470636,0.0010752693,0.63424677,0.014302283,0.0013157306,0.00074308,0.00001512169,0.0003469768,0.00089114415],"genre_scores_gemma":[0.49682266,0.00024047878,0.50234747,0.00039464264,0.00006056645,0.00004470388,0.00006288527,0.000017566439,0.000009010246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955769,0.0008068082,0.0015857101,0.0009256315,0.0004955483,0.0006093873],"domain_scores_gemma":[0.98874825,0.0020974916,0.0003633161,0.008030857,0.00058542576,0.00017465913],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009340315,0.00038600608,0.0006593835,0.0005469395,0.00019111703,0.00026990206,0.007332255,0.00018739293,0.00006320542],"category_scores_gemma":[0.00027615143,0.00043582104,0.00018311256,0.0029175265,0.00026813595,0.0008083946,0.0065906527,0.00077761814,0.000052364216],"study_design_candidate":"design_other","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.00001565541,0.00497894,0.043521866,0.00011361111,0.0001224611,0.00013545854,0.008084709,0.022837404,0.00039613436,0.11040148,0.0008069145,0.80858535],"study_design_scores_gemma":[0.001420053,0.00014608278,0.43997106,0.00019711086,0.000014945731,0.000079117985,0.00007738488,0.47430676,0.00088239985,0.07931797,0.0028549412,0.00073217734],"about_ca_topic_score_codex":0.00030797176,"about_ca_topic_score_gemma":0.0018348191,"teacher_disagreement_score":0.80785316,"about_ca_system_score_codex":0.00026546212,"about_ca_system_score_gemma":0.00044323152,"threshold_uncertainty_score":0.9998094},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005210187,0.00042764496,0.9739702,0.018277986,0.0010029235,0.00062271196,0.000026107129,0.00032600085,0.00013625856],"genre_scores_gemma":[0.30189168,0.000027679162,0.69629776,0.0008979903,0.00009397849,0.00059971225,0.000083067964,0.000015755215,0.00009237404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826324,0.00031104207,0.00043774233,0.0004285829,0.00023086385,0.0003285475],"domain_scores_gemma":[0.9958918,0.00070648035,0.00014833493,0.003108892,0.00007756988,0.00006691476],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005801937,0.00017468454,0.00021823692,0.0002549125,0.0007596686,0.00016193108,0.006235104,0.00003493484,0.000015361034],"category_scores_gemma":[0.00005461187,0.00019607277,0.00010579678,0.00073418417,0.00007233761,0.0005292772,0.007641607,0.00032054234,0.00001302399],"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.000022598304,0.00064402143,0.00036918555,0.000016851061,0.000053373227,0.000005681422,0.0039568264,0.0069133327,0.00015101957,0.38765928,0.00557053,0.5946373],"study_design_scores_gemma":[0.000989106,0.00021682143,0.0037127594,0.000013293941,0.000006123818,0.000039045106,0.000050263174,0.784083,0.00008092845,0.14630885,0.0641634,0.000336382],"about_ca_topic_score_codex":0.00010191768,"about_ca_topic_score_gemma":0.000054377313,"teacher_disagreement_score":0.7771697,"about_ca_system_score_codex":0.0001599337,"about_ca_system_score_gemma":0.00011895575,"threshold_uncertainty_score":0.99914163},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028172357,0.00030337763,0.98940206,0.0054858592,0.00089801033,0.00059247273,0.000015825426,0.00031130368,0.00017385268],"genre_scores_gemma":[0.25451458,0.000011934655,0.74435145,0.00072648143,0.00015765904,0.000078589896,0.00008647682,0.000016939824,0.000055907683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977539,0.00035481082,0.0006509397,0.00054402044,0.00030346288,0.00039285334],"domain_scores_gemma":[0.9953933,0.0012788083,0.00026164428,0.0028630204,0.00009504004,0.00010821745],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007993148,0.00021150112,0.00026632877,0.00041038377,0.0007775471,0.00022776735,0.006181304,0.00004896021,0.000014615997],"category_scores_gemma":[0.00008278326,0.0002511674,0.00011801422,0.0012071328,0.00004486097,0.00051929656,0.007627946,0.00043104152,0.000014041302],"study_design_candidate":"design_other","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.000006915441,0.00012895142,0.00014262083,0.000004018945,0.000018631948,0.0000017634344,0.0018728314,0.0012569706,0.000047900772,0.029275523,0.003712591,0.96353126],"study_design_scores_gemma":[0.0010344959,0.0001554521,0.0020017994,0.000024758267,0.0000053781164,0.000025766773,0.00004281573,0.93126583,0.000029005196,0.05381827,0.011327773,0.00026866794],"about_ca_topic_score_codex":0.00018252998,"about_ca_topic_score_gemma":0.000041865387,"teacher_disagreement_score":0.9632626,"about_ca_system_score_codex":0.00022547624,"about_ca_system_score_gemma":0.00022691285,"threshold_uncertainty_score":0.99999404},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.353591,0.001714246,0.6233305,0.016228838,0.0011328678,0.0007768628,0.000034954268,0.000819401,0.0023713608],"genre_scores_gemma":[0.9318346,0.000111332556,0.067026906,0.0007581352,0.00003952442,0.00012290844,0.000032174958,0.000017003711,0.00005742348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977892,0.0006008363,0.00045918234,0.0005002251,0.00028278775,0.0003677459],"domain_scores_gemma":[0.99176294,0.00096477236,0.00016028967,0.0069871037,0.000043673117,0.00008120451],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0008232212,0.00019267503,0.00024626058,0.00035182305,0.00069274876,0.00021328295,0.010704254,0.000045146186,0.000044970548],"category_scores_gemma":[0.000052060725,0.00022688616,0.00013322617,0.0014284017,0.0001641044,0.00043112706,0.012849316,0.0005976883,0.000030226583],"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.00008304563,0.004032481,0.045898322,0.000060476064,0.0004719781,0.000047218004,0.035974868,0.0060707796,0.007920112,0.4179306,0.09088499,0.39062512],"study_design_scores_gemma":[0.0030821485,0.0007080896,0.027181536,0.00014050529,0.000041242798,0.0000899863,0.0005803802,0.47628742,0.0025687634,0.20108974,0.28606474,0.002165434],"about_ca_topic_score_codex":0.00011198274,"about_ca_topic_score_gemma":0.000013435948,"teacher_disagreement_score":0.5782436,"about_ca_system_score_codex":0.00011792641,"about_ca_system_score_gemma":0.00006199718,"threshold_uncertainty_score":0.9951346},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45000586,0.0015159412,0.51379925,0.028905584,0.00079928787,0.00078499224,0.000005016873,0.0015705712,0.0026135002],"genre_scores_gemma":[0.71336365,0.00059312634,0.28561798,0.0003048385,0.000022499145,0.00006132328,0.000011046854,0.000009488528,0.00001609336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985211,0.00022834113,0.00038209304,0.0003462117,0.00018033716,0.00034190755],"domain_scores_gemma":[0.99400604,0.0008223251,0.00005861237,0.0050214953,0.000036653226,0.00005487961],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005806134,0.00014217499,0.00019587549,0.0008908618,0.00014750824,0.00015081897,0.006290313,0.000074608826,0.0000041511357],"category_scores_gemma":[0.00006385753,0.00014537963,0.00007646063,0.0032407993,0.00012129091,0.0003880216,0.00484625,0.0003525907,0.00016629133],"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.0000027681288,0.00047855478,0.043800313,0.000034875633,0.00003256315,0.00006684267,0.004871124,0.003214476,0.000080386235,0.57832766,0.0027276708,0.36636278],"study_design_scores_gemma":[0.00048587107,0.00003368002,0.3787633,0.00011171512,0.0000024244557,0.000013359954,0.000038963433,0.4289976,0.00004374971,0.18815336,0.0030824235,0.00027357167],"about_ca_topic_score_codex":0.0001152401,"about_ca_topic_score_gemma":0.0004042799,"teacher_disagreement_score":0.42578313,"about_ca_system_score_codex":0.000035168596,"about_ca_system_score_gemma":0.000035337434,"threshold_uncertainty_score":0.99908614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07241664,0.0006011996,0.9050314,0.019142069,0.000559901,0.00030259482,0.0000073195993,0.0009616822,0.0009772021],"genre_scores_gemma":[0.608657,0.00088179344,0.38945967,0.00086051814,0.000049087805,0.00004109054,0.000014780102,0.000009522267,0.000026547215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869794,0.00030519097,0.0002640722,0.00032148283,0.0001458865,0.00026544053],"domain_scores_gemma":[0.9940722,0.002432588,0.00003748581,0.0033263594,0.000055570104,0.00007579752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006826854,0.00012579949,0.00015603751,0.0005225704,0.00036539082,0.00020631921,0.0033602268,0.00006906451,0.000009714455],"category_scores_gemma":[0.00011516321,0.00013602043,0.00005656775,0.0017757332,0.00021126194,0.00036586847,0.004357109,0.0003539424,0.00006712582],"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.0000026375526,0.00006448178,0.004861546,0.00001107987,0.000025482756,0.000008069927,0.0015381948,0.00016662302,0.000020446603,0.40514162,0.0013185274,0.5868413],"study_design_scores_gemma":[0.00061773096,0.00015022432,0.02130352,0.00010419317,0.000007864497,0.000064060136,0.0001351131,0.6243391,0.00014366384,0.34013078,0.012585887,0.000417864],"about_ca_topic_score_codex":0.000045469693,"about_ca_topic_score_gemma":0.000029205832,"teacher_disagreement_score":0.62417245,"about_ca_system_score_codex":0.00001522035,"about_ca_system_score_gemma":0.000037621485,"threshold_uncertainty_score":0.62441933},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2282441,0.0006601851,0.7393438,0.025806407,0.0009896533,0.00072119397,0.000006341276,0.0017637124,0.002464572],"genre_scores_gemma":[0.7451897,0.00018386771,0.25348923,0.0009621552,0.000039239283,0.000077565,0.0000144493615,0.000015884281,0.000027859005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980854,0.00032299495,0.00037898615,0.0004847176,0.00030751113,0.00042040276],"domain_scores_gemma":[0.9914303,0.0012832395,0.00007670926,0.007043755,0.00007085966,0.00009515578],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00059549743,0.00020316974,0.00022689442,0.000899226,0.0003070587,0.00021616918,0.007177752,0.00007734847,0.00000789841],"category_scores_gemma":[0.000095802956,0.0001992835,0.00013476901,0.0032112354,0.00015621228,0.0002973161,0.003951612,0.0004566181,0.00053590845],"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.000004440636,0.0004542986,0.0015327315,0.000014718077,0.000057643723,0.000049372167,0.0014774369,0.0067057717,0.00018754583,0.8251971,0.003069376,0.16124958],"study_design_scores_gemma":[0.00070953986,0.00009655822,0.031033836,0.00007999062,0.0000063302914,0.000019316756,0.00001320235,0.6168241,0.000108637316,0.34836692,0.0024290683,0.00031252872],"about_ca_topic_score_codex":0.000060215603,"about_ca_topic_score_gemma":0.00004662293,"teacher_disagreement_score":0.61011827,"about_ca_system_score_codex":0.000043935106,"about_ca_system_score_gemma":0.000049615144,"threshold_uncertainty_score":0.9981939},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006387342,0.00076404994,0.98318964,0.0063787065,0.0018917501,0.0005495691,0.00001711734,0.000685834,0.00013600414],"genre_scores_gemma":[0.4900508,0.00004798326,0.5090595,0.000285239,0.00033537712,0.00009452818,0.00007092623,0.000022381746,0.000033251887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997953,0.00019357611,0.00061531767,0.00062139,0.00020326869,0.00041343182],"domain_scores_gemma":[0.9955709,0.0016893145,0.0001128362,0.0024100041,0.000116282645,0.00010066395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005764042,0.00025739276,0.0002627552,0.00043489583,0.00031914667,0.00067519874,0.003656414,0.0001194472,0.0000045452775],"category_scores_gemma":[0.00014417904,0.00026701624,0.00014249739,0.0009998532,0.000079096164,0.0009953475,0.0021252295,0.00033799466,0.000061943174],"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.000008521557,0.00019530699,0.00022397244,0.000054940698,0.0000681887,0.000006984909,0.0038225653,0.0009695955,0.000617474,0.13531847,0.0025558872,0.8561581],"study_design_scores_gemma":[0.0005029995,0.00006783406,0.0022451887,0.00012810981,0.000010679295,0.00001521258,0.000011910633,0.9359017,0.00017828599,0.045506638,0.015107837,0.00032362062],"about_ca_topic_score_codex":0.00013943165,"about_ca_topic_score_gemma":0.00003881093,"teacher_disagreement_score":0.9349321,"about_ca_system_score_codex":0.00016344691,"about_ca_system_score_gemma":0.00019139446,"threshold_uncertainty_score":0.9999782},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05176829,0.0014528399,0.88780665,0.05407129,0.0010883904,0.001487056,0.0000640277,0.0018427739,0.0004186855],"genre_scores_gemma":[0.6539025,0.000060222093,0.34457615,0.0008855144,0.0001217429,0.00019400108,0.000049166592,0.000027742755,0.00018298613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975869,0.00030074647,0.0006130132,0.00072477455,0.00027091528,0.00050366006],"domain_scores_gemma":[0.9952094,0.00094719045,0.00008339301,0.0034771136,0.00007785435,0.00020502426],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00036257904,0.00030684858,0.0003249633,0.00043975128,0.00019868866,0.00096102874,0.006052217,0.00011059724,0.000020867172],"category_scores_gemma":[0.00008695211,0.00030472153,0.00013209287,0.00141653,0.00012495731,0.00076979323,0.0046461183,0.00040537576,0.000526865],"study_design_candidate":"design_other","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.000006064152,0.00040613394,0.00016770215,0.000034767203,0.000067560904,0.000010073157,0.004518396,0.00024122234,0.0011254753,0.019243065,0.034044713,0.9401348],"study_design_scores_gemma":[0.00052885606,0.0002784463,0.0057991394,0.00026042428,0.000011739194,0.000016772352,0.000021049438,0.77484214,0.0007152761,0.02258821,0.19423464,0.0007033007],"about_ca_topic_score_codex":0.00030338985,"about_ca_topic_score_gemma":0.0000673575,"teacher_disagreement_score":0.93943155,"about_ca_system_score_codex":0.00017476731,"about_ca_system_score_gemma":0.00014921634,"threshold_uncertainty_score":0.9999405},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16175938,0.0014371829,0.8149313,0.019489586,0.0006899781,0.00044168462,0.0000013815283,0.00023200159,0.0010175094],"genre_scores_gemma":[0.8732375,0.0002742981,0.12525322,0.0010219043,0.000030989224,0.000064421816,0.00000816805,0.0000072722187,0.00010221558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983995,0.00028286414,0.0004841106,0.0004313907,0.00012939748,0.00027275854],"domain_scores_gemma":[0.9964717,0.00086980144,0.00008867015,0.002460853,0.000055984452,0.00005297328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045822706,0.00017763354,0.00024177246,0.0006955274,0.00014411694,0.00022519485,0.0027209015,0.000095993135,0.0000040401787],"category_scores_gemma":[0.000103396786,0.00018699966,0.000046800407,0.0012717013,0.0001307193,0.0006300551,0.003398428,0.0004239549,0.000015014462],"study_design_candidate":"design_other","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.000008404331,0.0003389567,0.010193423,0.000032036383,0.00002580981,0.000005278522,0.0012888111,0.0005133042,0.00013164194,0.19472407,0.0011189249,0.79161936],"study_design_scores_gemma":[0.00084441126,0.000040721734,0.14837423,0.00022566812,0.000007308172,0.000014910773,0.000032843225,0.66765463,0.00019196817,0.1753117,0.006994769,0.00030683549],"about_ca_topic_score_codex":0.00025598766,"about_ca_topic_score_gemma":0.00032460503,"teacher_disagreement_score":0.7913125,"about_ca_system_score_codex":0.00011799036,"about_ca_system_score_gemma":0.000109342356,"threshold_uncertainty_score":0.76256245},"labels":[],"label_agreement":null}]}