{"meta":{"query_hash":"211aaa780ee2","filters":{"venue":"Annals of Mathematics and Artificial Intelligence"},"cohort_total":44,"direct_labels_cover":0,"predictions_cover":44,"exported":44,"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/211aaa780ee2","api":"https://metacan.xera.ac/api/v1/cohort?venue=Annals+of+Mathematics+and+Artificial+Intelligence"},"results":[{"id":"W1528496018","doi":"10.1023/a:1014444525059","title":"An Optimal Strategy for the Constrained Cycle Cover Problem","year":2002,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Cover (algebra); Decomposition; Constraint (computer-aided design); Set cover problem; Set (abstract data type); Complex system; Theoretical computer science; Mathematics; Artificial intelligence; Engineering","score_opus":0.17371864583893756,"score_gpt":0.3546069838677639,"score_spread":0.18088833802882634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528496018","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.017859701,0.00023436648,0.9799435,0.001271046,0.000046746503,0.00021927833,0.000007318592,0.000018453287,0.00039956588],"genre_scores_gemma":[0.90452343,0.0000884953,0.095131405,0.00014180114,0.000050611903,0.000014459977,0.0000014673612,0.000003590754,0.000044759185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928945,0.000013607772,0.00028249173,0.00015107194,0.00013449935,0.00012885766],"domain_scores_gemma":[0.9991593,0.00032811824,0.00010702667,0.00018197933,0.00017748648,0.00004613004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038206961,0.00007650792,0.000102018894,0.00003839078,0.00013990907,0.00014085411,0.00026770076,0.0000273838,0.000049264425],"category_scores_gemma":[0.000046835317,0.000056095185,0.000041490704,0.00014648058,0.00008229624,0.00021943267,0.000030788044,0.00003860148,0.000009340441],"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.0000029302955,0.00017974719,4.19617e-7,0.0000260354,0.000012114914,3.6893087e-7,0.0009363295,0.071998514,0.00075062574,0.65151536,0.00015633114,0.27442124],"study_design_scores_gemma":[0.000011561071,0.0001650562,0.0000031287047,0.00000984881,0.0000036406698,0.000003899022,0.00017776611,0.82340914,0.024972474,0.15095937,0.00022264918,0.00006147629],"about_ca_topic_score_codex":0.0000029355251,"about_ca_topic_score_gemma":0.0000018155202,"teacher_disagreement_score":0.88666373,"about_ca_system_score_codex":0.000001329196,"about_ca_system_score_gemma":0.000014506452,"threshold_uncertainty_score":0.22874953},"labels":[],"label_agreement":null},{"id":"W1545897260","doi":"10.1023/a:1018952121991","title":"Higher order generalization and its application in program verification","year":2000,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Generalization; Unification; Computer science; Mathematical proof; Inductive reasoning; Order (exchange); Theoretical computer science; Inference; Algebra over a field; Artificial intelligence; Algorithm; Mathematics; Programming language; Pure mathematics","score_opus":0.1061203702815848,"score_gpt":0.3413464726257647,"score_spread":0.23522610234417987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545897260","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.2340495,0.0010607091,0.7607398,0.0012306635,0.00008524053,0.00089245493,8.966093e-7,0.0001017914,0.0018389632],"genre_scores_gemma":[0.9912028,0.00041013624,0.0081688985,0.000049146878,0.000026013766,0.000047073245,0.0000024797466,0.0000045845572,0.000088887224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923337,0.000020328262,0.00032000543,0.00019192735,0.00011420844,0.000120162185],"domain_scores_gemma":[0.99956286,0.000027550814,0.00009924064,0.00016660677,0.0001074232,0.00003629403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003026648,0.00007670734,0.00011953572,0.000052060474,0.00004424962,0.00007416123,0.0001482546,0.000049354083,0.000014898574],"category_scores_gemma":[0.000019623414,0.00006696793,0.000014266033,0.0002862227,0.000038308535,0.00016884685,0.000024928917,0.00003633672,0.000018055143],"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.0000012277646,0.00012457992,0.000031831503,0.000041837877,0.0000022248232,2.5003774e-7,0.0005988725,0.00005770688,0.00042504558,0.6010925,0.0000052947375,0.39761862],"study_design_scores_gemma":[0.00002815273,0.000144062,0.00040024827,0.00002115793,0.0000042517154,0.0000039304164,0.00010158118,0.48774263,0.027934901,0.4792629,0.004167034,0.000189151],"about_ca_topic_score_codex":0.00004249608,"about_ca_topic_score_gemma":0.00001901635,"teacher_disagreement_score":0.7571533,"about_ca_system_score_codex":0.0000024419116,"about_ca_system_score_gemma":0.000009942493,"threshold_uncertainty_score":0.2730873},"labels":[],"label_agreement":null},{"id":"W1583206423","doi":"10.1023/a:1022955412266","title":"Meta-Stylesheets for the Conversion of Mathematical Documents into Multiple Forms","year":2003,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Mathematics, Computing, and Information Processing","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; XSLT; Presentational and representational acting; Information retrieval; XML; World Wide Web","score_opus":0.1760456789143388,"score_gpt":0.3477313850796697,"score_spread":0.1716857061653309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583206423","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.010987065,0.0003606053,0.98684967,0.0003575362,0.0000717306,0.0003670655,0.0000027083404,0.000021737062,0.0009818833],"genre_scores_gemma":[0.7781333,0.000114625225,0.22152656,0.00014190323,0.000009524748,0.000023576647,6.7342927e-7,0.00000813908,0.00004174128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982717,0.000022743949,0.0009948505,0.00017057256,0.00032243205,0.00021771152],"domain_scores_gemma":[0.9972983,0.0012482592,0.00061546377,0.00040730275,0.00036480336,0.000065848886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016824345,0.000164439,0.00041988186,0.00008740346,0.00020188837,0.00011260747,0.0005336271,0.000056020053,0.000044971035],"category_scores_gemma":[0.00078073144,0.00010180335,0.00019022932,0.00019202016,0.00016801225,0.00042004176,0.0001284177,0.00006825943,0.000009254391],"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.0000031817813,0.00017964582,0.000003973792,0.0009761839,0.00016131696,1.4335954e-7,0.0062732943,0.00015489066,0.00025816026,0.98084354,0.00007486035,0.011070818],"study_design_scores_gemma":[0.000027313547,0.000057401743,7.4195947e-7,0.00006297392,0.00005739356,0.0000034645568,0.001016512,0.29603094,0.17905502,0.5232524,0.000346499,0.000089292414],"about_ca_topic_score_codex":0.000005078829,"about_ca_topic_score_gemma":0.0000012440391,"teacher_disagreement_score":0.76714617,"about_ca_system_score_codex":0.0000037981035,"about_ca_system_score_gemma":0.00003684274,"threshold_uncertainty_score":0.415142},"labels":[],"label_agreement":null},{"id":"W1838030265","doi":"10.1023/a:1026153912205","title":"Database Repairs and Analytic Tableaux","year":2003,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relational database; Computer science; Data integrity; Set (abstract data type); Closing (real estate); Relational model; Basis (linear algebra); Deductive database; Functional dependency; Database; Information retrieval; Theoretical computer science; Data mining; Programming language; Mathematics","score_opus":0.13024555120690365,"score_gpt":0.3348983845880137,"score_spread":0.20465283338111004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1838030265","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.13096227,0.002464556,0.8512444,0.0005882377,0.00018288531,0.00022330711,0.000007001437,0.00008026684,0.014247062],"genre_scores_gemma":[0.95085937,0.0007689799,0.048060298,0.00012405838,0.000021089858,0.0000038738967,7.4890727e-7,0.000006997866,0.00015457945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893606,0.000032819426,0.00037018,0.0002808162,0.00015651007,0.00022362346],"domain_scores_gemma":[0.99898046,0.00022341996,0.00014289745,0.00040022956,0.00013691424,0.000116054485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008212652,0.00012703639,0.00022987687,0.000080935446,0.0001084615,0.00010975964,0.00025470115,0.000042073516,0.000026544476],"category_scores_gemma":[0.0005382959,0.000104708655,0.000045623914,0.000251644,0.00014207978,0.00023061705,0.00012665663,0.00007494341,0.00001852825],"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.0000012433285,0.0001345501,0.00005471032,0.00008378179,0.000013573987,0.0000056338536,0.0011607625,0.000009292154,0.00048270304,0.9800669,0.00017424008,0.017812587],"study_design_scores_gemma":[0.000024626628,0.00016649334,0.00003336149,0.00013252854,0.000017404082,0.000039902872,0.0010046086,0.104740985,0.13793798,0.7539641,0.0016509688,0.00028700032],"about_ca_topic_score_codex":0.000017370354,"about_ca_topic_score_gemma":0.000016273812,"teacher_disagreement_score":0.8198971,"about_ca_system_score_codex":0.0000023146117,"about_ca_system_score_gemma":0.00003539234,"threshold_uncertainty_score":0.4269895},"labels":[],"label_agreement":null},{"id":"W1972866855","doi":"10.1007/s10472-011-9237-y","title":"Weight constraint programs with evaluable functions","year":2010,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Stable model semantics; Answer set programming; Constraint programming; Constraint logic programming; Constraint satisfaction; Semantics (computer science); Computer science; Context (archaeology); Logic programming; Constraint (computer-aided design); Programming language; Set (abstract data type); Constraint satisfaction problem; Domain (mathematical analysis); Theoretical computer science; Mathematical optimization; Operational semantics; Mathematics; Artificial intelligence; Stochastic programming","score_opus":0.10151281518515387,"score_gpt":0.31877689055681596,"score_spread":0.2172640753716621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972866855","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.17336926,0.00013055338,0.81021374,0.00093280326,0.00029442218,0.0002868058,0.000002804257,0.000092395574,0.014677228],"genre_scores_gemma":[0.93699527,0.000037292968,0.06264378,0.000051562416,0.000061199964,0.000016052589,0.0000010982747,0.000006901638,0.00018685228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990029,0.000013578321,0.00030504478,0.00023626459,0.00020549296,0.00023672468],"domain_scores_gemma":[0.99895453,0.0001201899,0.00014604442,0.00036192927,0.00030576048,0.000111552705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052442995,0.00012836068,0.00019065056,0.000059162372,0.00013819287,0.000144179,0.00034504844,0.000058427933,0.00006174237],"category_scores_gemma":[0.00009890952,0.00008962881,0.00005121036,0.00023352212,0.00030531202,0.00017682607,0.00009226034,0.00015270333,0.000048504073],"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.000002835401,0.0003327842,0.00007886007,0.000038280614,0.000017859737,0.0000029412365,0.0011762029,0.0000070166043,0.0017084504,0.8334092,0.000080650345,0.16314492],"study_design_scores_gemma":[0.00005080051,0.0007771197,0.00006498066,0.00016553329,0.000028748056,0.00009989781,0.0013012715,0.12062985,0.1631077,0.70908856,0.0042327894,0.00045274015],"about_ca_topic_score_codex":0.000015477164,"about_ca_topic_score_gemma":0.000086194006,"teacher_disagreement_score":0.76362604,"about_ca_system_score_codex":0.0000015548165,"about_ca_system_score_gemma":0.00006540042,"threshold_uncertainty_score":0.36549568},"labels":[],"label_agreement":null},{"id":"W1981334977","doi":"10.1007/s10472-010-9191-0","title":"Tradeoffs in the empirical evaluation of competing algorithm designs","year":2010,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Algorithm; Parameterized complexity; Set (abstract data type); Algorithm design; Integer programming","score_opus":0.4438438458895254,"score_gpt":0.4265607545525879,"score_spread":0.017283091336937506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981334977","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.1115069,0.000033022072,0.88558364,0.0020738777,0.00007070565,0.00015915988,0.0000013718985,0.000007408319,0.00056393957],"genre_scores_gemma":[0.8431685,0.00002416379,0.15667671,0.0001112228,0.000012756882,0.0000039061274,4.873261e-7,0.0000017781197,4.954032e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990137,0.00007835488,0.00038330883,0.00010647101,0.00033181766,0.00008631959],"domain_scores_gemma":[0.99898016,0.0004240109,0.00014730726,0.00017652406,0.0002509347,0.000021060108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025733092,0.000057340672,0.00010788265,0.00007336949,0.00004093775,0.000039840135,0.00022269359,0.000036067104,0.000021465698],"category_scores_gemma":[0.0003997238,0.000042898846,0.000030718646,0.00023674016,0.00009943855,0.00012483165,0.000027973232,0.000099290395,0.0000016668067],"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.0000010118174,0.00018002033,0.00007261263,0.000013712827,0.0000044121716,4.8300103e-7,0.009374819,0.00067525887,0.0014922208,0.21373151,0.000011754858,0.7744422],"study_design_scores_gemma":[0.000014775777,0.000034481516,0.00031472306,0.000022767581,0.0000053736317,0.000007675992,0.002060658,0.8733056,0.023080321,0.10108292,0.000020814497,0.00004989564],"about_ca_topic_score_codex":0.0000114781815,"about_ca_topic_score_gemma":0.00002769324,"teacher_disagreement_score":0.87263036,"about_ca_system_score_codex":0.0000015745494,"about_ca_system_score_gemma":0.000040153558,"threshold_uncertainty_score":0.17493641},"labels":[],"label_agreement":null},{"id":"W1986563142","doi":"10.1007/s10472-010-9176-z","title":"A description logic based situation calculus","year":2010,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Situation calculus; Decidability; Axiom; Operator (biology); Projection (relational algebra); Calculus (dental); Fragment (logic); Description logic; Mathematics; Computer science; Algebra over a field; Theoretical computer science; Algorithm; Artificial intelligence; Pure mathematics","score_opus":0.14122521408593885,"score_gpt":0.3337764627817117,"score_spread":0.19255124869577284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986563142","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.11131493,0.0000666567,0.88591975,0.000745911,0.00020582564,0.00010552296,0.0000012004018,0.00004367032,0.0015965126],"genre_scores_gemma":[0.93948555,0.00002741822,0.060224645,0.0001682418,0.000048843194,0.000006077623,0.0000011102992,0.0000044699136,0.00003362282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990982,0.000019548626,0.00032817517,0.00020282101,0.00017478155,0.0001764811],"domain_scores_gemma":[0.99908876,0.00014582179,0.00016009732,0.00029246428,0.00023574612,0.000077085395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060852314,0.00010651496,0.00015884622,0.000080767364,0.000098887365,0.00012456105,0.00031824765,0.000072510644,0.000034714358],"category_scores_gemma":[0.00033896285,0.00008680612,0.00006049924,0.00019469886,0.000104377854,0.00021182555,0.00007292576,0.000113682574,0.000043486947],"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.0000021454944,0.00020419835,0.000018628614,0.000038481085,0.0000041714006,0.0000017142193,0.0011272437,0.000035919205,0.018151563,0.91750056,0.000059230868,0.062856145],"study_design_scores_gemma":[0.000011088586,0.00008232919,0.00006231383,0.000024675772,0.0000039051624,0.0000038517796,0.00010713646,0.4200479,0.14120035,0.43822512,0.0001277873,0.00010351889],"about_ca_topic_score_codex":0.000020960624,"about_ca_topic_score_gemma":0.000065722554,"teacher_disagreement_score":0.82817066,"about_ca_system_score_codex":0.000002301923,"about_ca_system_score_gemma":0.000036850488,"threshold_uncertainty_score":0.35398507},"labels":[],"label_agreement":null},{"id":"W1989224068","doi":"10.1007/s10472-006-9041-2","title":"An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs","year":2006,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Satisfiability; Semidefinite embedding; Mathematical proof; Mathematics; Dimension (graph theory); Discrete mathematics; Grid; Characterization (materials science); Theoretical computer science; Combinatorics; Computer science; Quadratically constrained quadratic program; Mathematical optimization; Quadratic programming","score_opus":0.12182966411229584,"score_gpt":0.3611550192838475,"score_spread":0.23932535517155168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989224068","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.46138352,0.000014681756,0.5381329,0.000082098006,0.00007594948,0.00016305181,0.00002723337,0.000016419403,0.0001041757],"genre_scores_gemma":[0.76933676,0.000047492475,0.2304973,0.000043253516,0.000036639907,0.000020886077,0.000009266207,0.000005580978,0.0000028434565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987292,0.000044900935,0.00065216713,0.00023129403,0.00019659536,0.00014580655],"domain_scores_gemma":[0.9986909,0.00022672165,0.0004119704,0.00038215326,0.00025224467,0.00003603244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096472807,0.00011074125,0.00021920532,0.00009062343,0.000069368056,0.00005134355,0.0003203771,0.000052646858,0.000003974916],"category_scores_gemma":[0.00016987811,0.00010193931,0.000056177316,0.0002133001,0.00009593677,0.00036587345,0.000031038646,0.000044648023,0.0000012199235],"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.000013099486,0.0002657834,0.000052573043,0.00012053816,0.0000034679774,8.0878976e-8,0.00059404277,0.00011246993,0.06463222,0.8871742,0.0000045350052,0.047027007],"study_design_scores_gemma":[0.000010302065,0.00025068063,0.000692653,0.000054779634,0.0000025309432,4.792964e-7,0.00009050324,0.089619845,0.5592427,0.349913,0.00003861569,0.00008385746],"about_ca_topic_score_codex":0.00002712028,"about_ca_topic_score_gemma":0.00000996957,"teacher_disagreement_score":0.5372612,"about_ca_system_score_codex":0.0000038681437,"about_ca_system_score_gemma":0.000017168406,"threshold_uncertainty_score":0.41569644},"labels":[],"label_agreement":null},{"id":"W2009254877","doi":"10.1007/s10472-013-9372-8","title":"A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes","year":2013,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Schema (genetic algorithms); Computer science; Computation; Data mining; Association rule learning; Scalability; Algorithm; Theoretical computer science; Machine learning; Database","score_opus":0.14313485498643166,"score_gpt":0.35577840393732607,"score_spread":0.2126435489508944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009254877","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.12476537,0.00022026927,0.87372386,0.00081015675,0.000049713915,0.0002978957,0.000052531628,0.000039098963,0.000041076026],"genre_scores_gemma":[0.25619358,0.00011117995,0.7433957,0.000121266654,0.00011908898,0.000025212827,0.000010596403,0.00001077575,0.000012619976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985803,0.000018617158,0.000584206,0.0003565886,0.00017301159,0.00028731517],"domain_scores_gemma":[0.9983253,0.00070861407,0.0002664497,0.00031658882,0.00025627302,0.00012680456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049823936,0.00016686237,0.0003070215,0.00008243743,0.00024478784,0.00038511798,0.00045041644,0.000090926565,0.0000037971706],"category_scores_gemma":[0.000085108404,0.0001532937,0.00004780552,0.00020183604,0.00016515896,0.0003176595,0.00027653752,0.00011280961,0.0000064435176],"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":[2.6492316e-7,0.00007465586,0.00003867721,0.0000773248,0.000020380263,4.3602742e-7,0.0011394573,0.000010935352,0.0006867506,0.047981877,0.00024937434,0.94971985],"study_design_scores_gemma":[0.000025291296,0.00012780527,0.000116571864,0.00014640152,0.000011111832,0.0000059790777,0.00083671784,0.9096373,0.023804178,0.064764455,0.00031239263,0.00021180519],"about_ca_topic_score_codex":0.000040915864,"about_ca_topic_score_gemma":0.0000025304373,"teacher_disagreement_score":0.9495081,"about_ca_system_score_codex":0.0000031224295,"about_ca_system_score_gemma":0.0000269914,"threshold_uncertainty_score":0.62511355},"labels":[],"label_agreement":null},{"id":"W2016444913","doi":"10.1007/s10472-011-9246-x","title":"Remarks on the future of AI: machines and communication","year":2011,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Tracing; Complex system; Communications system; Cognitive science; Natural (archaeology); Artificial intelligence; Human communication; Data science; Human–computer interaction; Communication; Sociology; Psychology; Telecommunications; Biology","score_opus":0.24792477903047966,"score_gpt":0.42205632653201863,"score_spread":0.17413154750153897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016444913","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.86207026,0.0018094601,0.0011383172,0.0693788,0.00014188628,0.0004010573,0.000015437214,0.00002112188,0.06502366],"genre_scores_gemma":[0.99383605,0.0043690847,0.0011604814,0.0005397676,0.000048232945,0.000001933592,3.4924432e-7,0.0000044296803,0.000039682018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928856,0.0000898223,0.00025985207,0.000070861235,0.00018431748,0.00010660643],"domain_scores_gemma":[0.99883777,0.00049158983,0.00017016026,0.00017778247,0.0002746189,0.000048092483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016159777,0.000063188054,0.0001384879,0.00002987584,0.00029661626,0.000039579747,0.0002018174,0.00008010833,0.00006553132],"category_scores_gemma":[0.00053679047,0.00004318371,0.000036882677,0.000096356765,0.0007089565,0.000096905365,0.00004612559,0.0001483303,0.0000016964025],"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.0000063235757,0.000084861174,0.000051761384,0.000023382901,0.000009451498,1.1788416e-7,0.0472404,2.8471226e-7,0.00007963199,0.927489,0.00012689165,0.02488791],"study_design_scores_gemma":[0.0000045549737,0.00006864778,0.00013736868,0.00008937283,0.0000068127774,1.5828049e-7,0.02304333,0.00024904686,0.007270927,0.9686267,0.00044829844,0.00005482594],"about_ca_topic_score_codex":0.0007734324,"about_ca_topic_score_gemma":0.00091633736,"teacher_disagreement_score":0.13176578,"about_ca_system_score_codex":0.0000015032895,"about_ca_system_score_gemma":0.000029482228,"threshold_uncertainty_score":0.26121798},"labels":[],"label_agreement":null},{"id":"W2045652725","doi":"10.1007/s10472-013-9349-7","title":"A model for learning the news in social networks","year":2013,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Timestamp; Computer science; Set (abstract data type); Social network (sociolinguistics); Scheme (mathematics); Search engine indexing; Social media; Theoretical computer science; Information retrieval; World Wide Web; Mathematics; Computer security","score_opus":0.19949455705435598,"score_gpt":0.3370618862868441,"score_spread":0.1375673292324881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045652725","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.08446736,0.000107450636,0.9122426,0.0028195742,0.000032476524,0.00017641198,4.3352796e-7,0.000015148467,0.00013854972],"genre_scores_gemma":[0.99391514,0.000081483464,0.0055615134,0.00028381002,0.000046659985,0.000029153354,3.0255438e-7,0.0000044603776,0.00007749912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992953,0.000019074616,0.00029039994,0.00013071585,0.00009293392,0.00017157926],"domain_scores_gemma":[0.9994122,0.0002378916,0.000103358594,0.00012376047,0.0000981741,0.000024613972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041544894,0.00007288497,0.00013389527,0.000039651088,0.0001403538,0.00012356903,0.00029735372,0.00003576372,0.00000241439],"category_scores_gemma":[0.00008752538,0.000052397754,0.00006110352,0.00011307556,0.000051967832,0.00014198718,0.00008974845,0.00010501706,0.000003761217],"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.0000039955694,0.00011212207,0.00003233787,0.00003288931,0.000010385878,3.5310805e-7,0.005172024,0.04248171,0.00054338865,0.669899,0.00047649437,0.28123534],"study_design_scores_gemma":[0.0000067330143,0.000021979175,0.000007708979,0.00001782351,0.0000013155341,4.8659405e-7,0.00049847836,0.7574095,0.0002914978,0.24168245,0.000013570979,0.00004842531],"about_ca_topic_score_codex":0.00008306479,"about_ca_topic_score_gemma":0.000037125552,"teacher_disagreement_score":0.9094478,"about_ca_system_score_codex":0.000001941386,"about_ca_system_score_gemma":0.000012141292,"threshold_uncertainty_score":0.21367185},"labels":[],"label_agreement":null},{"id":"W2046893664","doi":"10.1007/s10472-012-9329-3","title":"Relational concept analysis: mining concept lattices from multi-relational data","year":2013,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":150,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Relational database; Formal concept analysis; Data mining; Relational calculus; sort; Theoretical computer science; Set (abstract data type); Relational model; Cluster analysis; Relational database management system; Knowledge extraction; Process (computing); Data science; Information retrieval; Machine learning; Algorithm; Programming language","score_opus":0.3591188805311848,"score_gpt":0.3688164840243443,"score_spread":0.009697603493159512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046893664","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.041088805,0.0008982321,0.95568305,0.0016044854,0.000096209806,0.00014947062,0.00009360813,0.00003392416,0.0003521907],"genre_scores_gemma":[0.6074733,0.00004788289,0.39212814,0.00019064778,0.00005250285,0.0000047796284,0.000069611895,0.000004686802,0.000028458811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837357,0.000039433864,0.0006522075,0.00040487232,0.00033011616,0.00019978711],"domain_scores_gemma":[0.9979878,0.0007132961,0.00034004342,0.00064253254,0.00022149378,0.00009484504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035496545,0.00014526276,0.00029827692,0.00010675945,0.00013353689,0.00017552065,0.0007800093,0.000075711636,0.0002680754],"category_scores_gemma":[0.00021592036,0.000121164034,0.00007444927,0.00039499835,0.00019720182,0.0007633428,0.00038391026,0.00009559102,0.00005318655],"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.0000027076906,0.00043383028,0.00092659146,0.000018543466,0.00048141138,0.0000035356509,0.0090330485,0.0059864474,0.00016696774,0.8815775,0.0008828362,0.10048657],"study_design_scores_gemma":[0.000020141895,0.000030415413,0.0017934947,0.000031492807,0.000045759327,7.8141903e-7,0.00076426583,0.8959346,0.0008868446,0.100222275,0.000120447556,0.00014952493],"about_ca_topic_score_codex":0.00020046488,"about_ca_topic_score_gemma":0.000028271796,"teacher_disagreement_score":0.8899481,"about_ca_system_score_codex":0.000002720132,"about_ca_system_score_gemma":0.000035227946,"threshold_uncertainty_score":0.49409258},"labels":[],"label_agreement":null},{"id":"W2053024197","doi":"10.1007/s10472-005-9016-8","title":"Regular path queries under approximate semantics","year":2006,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Concordia University","funders":"","keywords":"Containment (computer programming); Path (computing); Focus (optics); Semantics (computer science); Mathematics; Query language; Query optimization; Computer science; Polynomial; Automaton; Theoretical computer science; Algorithm; Database; Programming language","score_opus":0.07877425589486078,"score_gpt":0.3108494660789743,"score_spread":0.2320752101841135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053024197","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.024868065,0.00042583593,0.97307134,0.0008776008,0.00008508457,0.000119268,0.000014564698,0.000054800577,0.00048343398],"genre_scores_gemma":[0.6141776,0.00026336528,0.3851735,0.00012496681,0.00008274352,0.0000105773015,0.0000059302615,0.00001537183,0.00014597745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987452,0.000019435083,0.0005343813,0.00024044869,0.00022762734,0.00023287802],"domain_scores_gemma":[0.9990049,0.00010509098,0.00023086488,0.00044908057,0.0001601599,0.00004990659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038031366,0.00014857076,0.00026028385,0.00006351461,0.000118260956,0.0000727735,0.00023598704,0.00004613596,0.0000066853627],"category_scores_gemma":[0.00004715694,0.00012407305,0.000056395333,0.00019137537,0.00018521122,0.00035532037,0.00017087311,0.00006146938,0.000009589796],"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.0000016234127,0.00010299159,0.0000074244795,0.00012714636,0.0000071107333,0.00000406504,0.00033532223,0.0002520704,0.0021065194,0.99065584,0.00011118147,0.0062886886],"study_design_scores_gemma":[0.000010387417,0.000057450055,0.000016939917,0.00013512558,0.0000043438595,0.0000135760365,0.00081766193,0.053067587,0.16123031,0.7828078,0.0016470463,0.00019173183],"about_ca_topic_score_codex":0.00007112469,"about_ca_topic_score_gemma":0.000025658548,"teacher_disagreement_score":0.5893095,"about_ca_system_score_codex":0.000002631149,"about_ca_system_score_gemma":0.000021078957,"threshold_uncertainty_score":0.5059552},"labels":[],"label_agreement":null},{"id":"W2054275301","doi":"10.1007/s10472-007-9064-3","title":"Region–based theory of discrete spaces: A proximity approach","year":2007,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Complex system; Mathematics; Computer science; Statistical physics; Topology (electrical circuits); Algebra over a field; Pure mathematics; Physics; Artificial intelligence; Combinatorics","score_opus":0.16192205515226704,"score_gpt":0.35175972258948685,"score_spread":0.1898376674372198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054275301","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.009050578,0.00017042714,0.98582816,0.00025569473,0.00001691052,0.00015488373,0.0000016790599,0.00007197388,0.004449694],"genre_scores_gemma":[0.6485813,0.000014242447,0.35131449,0.000054013843,0.0000073175543,0.0000031992909,3.0774902e-7,0.0000055823166,0.000019566829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988118,0.000021206506,0.0005052768,0.00022005776,0.00024169925,0.00019995157],"domain_scores_gemma":[0.9986628,0.00027833672,0.00033124225,0.00041131643,0.00025067176,0.00006559416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014971996,0.00012243357,0.00023358462,0.00012489266,0.00004509591,0.000110471745,0.0005533408,0.00005046149,0.0000013564849],"category_scores_gemma":[0.00032579846,0.000099564895,0.00006903929,0.00031576876,0.0003373587,0.00041672905,0.00015702905,0.00007326289,0.0000011914954],"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.000010517745,0.00032281835,0.000011754657,0.00028278207,0.000008302942,0.0000027348608,0.0011029763,0.0000110589,0.0009145575,0.855635,0.000020179848,0.14167735],"study_design_scores_gemma":[0.000005129033,0.00007219624,0.0000048766074,0.0001185466,0.000003024745,0.0000035708479,0.00027014222,0.036461014,0.38173226,0.5812283,0.000019610774,0.000081293125],"about_ca_topic_score_codex":0.000005094817,"about_ca_topic_score_gemma":0.0000011206124,"teacher_disagreement_score":0.6395307,"about_ca_system_score_codex":0.0000025378508,"about_ca_system_score_gemma":0.000034409062,"threshold_uncertainty_score":0.40601388},"labels":[],"label_agreement":null},{"id":"W2054320689","doi":"10.1007/s10472-006-9035-0","title":"A formal mathematical framework for modeling probabilistic hybrid systems","year":2007,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Probabilistic logic; Hybrid system; Dynamical systems theory; Theoretical computer science; Asynchronous communication; Semantics (computer science); Complex system; Artificial intelligence; Programming language; Machine learning","score_opus":0.23910518440028664,"score_gpt":0.4056549268499324,"score_spread":0.16654974244964574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054320689","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.025375618,0.00013668259,0.97334164,0.00014391678,0.00018128354,0.0005140986,0.0000049748237,0.00005433063,0.0002474721],"genre_scores_gemma":[0.41816792,0.000018069952,0.58170736,0.00002827635,0.000044042827,0.000021480188,5.208424e-7,0.000007806652,0.0000045374654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814326,0.000020540925,0.0009136186,0.0002546265,0.00027802648,0.00038995576],"domain_scores_gemma":[0.9980628,0.0007791045,0.00026729796,0.0004497909,0.0003343077,0.00010673333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034346972,0.00014932017,0.0002936641,0.00010662313,0.00013003172,0.00013448442,0.0004971287,0.00007752283,0.0000030016045],"category_scores_gemma":[0.001507793,0.00013022994,0.00008311342,0.00018752068,0.00009895971,0.00035965396,0.0001260217,0.00011261113,0.000009160288],"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.000009413171,0.00014359016,4.489607e-7,0.00045296724,0.000009898568,8.350609e-7,0.0009312278,0.0022618466,0.00015806936,0.9595482,0.0000037639709,0.03647978],"study_design_scores_gemma":[0.000005006789,0.00006703678,2.8916207e-7,0.000118373864,0.00000392871,0.000008885079,0.0002833689,0.5027091,0.014752229,0.48196694,0.000009460084,0.00007534421],"about_ca_topic_score_codex":0.0000039283213,"about_ca_topic_score_gemma":6.234242e-7,"teacher_disagreement_score":0.5004473,"about_ca_system_score_codex":0.000007709733,"about_ca_system_score_gemma":0.000025863086,"threshold_uncertainty_score":0.53106225},"labels":[],"label_agreement":null},{"id":"W2059326695","doi":"10.1023/b:amai.0000034523.18162.6b","title":"Representing von Neumann–Morgenstern Games in the Situation Calculus","year":2004,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Von Neumann architecture; Formalism (music); Stochastic game; Nash equilibrium; Game theory; Computer science; Variety (cybernetics); Situation calculus; Mathematical economics; Mathematics; Calculus (dental); Artificial intelligence; Pure mathematics","score_opus":0.12865549613399657,"score_gpt":0.3436359137128901,"score_spread":0.21498041757889352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059326695","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.47631222,0.00033766555,0.51894635,0.0019270668,0.0001083462,0.00016739627,6.561257e-7,0.0000250152,0.0021752724],"genre_scores_gemma":[0.99459594,0.0001298394,0.005043923,0.0001500099,0.000044467964,0.0000064017377,5.4332435e-7,0.00000419974,0.000024665824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989142,0.000036213627,0.0004120157,0.0002152871,0.00021820802,0.00020407178],"domain_scores_gemma":[0.99916255,0.00018713498,0.00016672423,0.00033886667,0.000109429726,0.000035291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090900983,0.00010276452,0.00016138141,0.00007494524,0.00009288568,0.00013820185,0.0004820839,0.00004220498,0.0000042183015],"category_scores_gemma":[0.00029519532,0.000071780334,0.000057328798,0.00027644847,0.00008434116,0.00020293177,0.00012644129,0.000093801915,0.000021465268],"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.0000018909901,0.00025116638,0.000085162115,0.00005127021,0.000006389129,0.00001007899,0.022346744,0.00051209587,0.0009132957,0.91408396,0.000025608924,0.061712347],"study_design_scores_gemma":[0.00003016409,0.000105791754,0.0004427125,0.00015856362,0.0000056355325,0.000018961362,0.0026664268,0.091430396,0.07799344,0.8268663,0.00010658357,0.0001750174],"about_ca_topic_score_codex":0.00009410419,"about_ca_topic_score_gemma":0.00012168019,"teacher_disagreement_score":0.5182837,"about_ca_system_score_codex":0.000004313974,"about_ca_system_score_gemma":0.00002495539,"threshold_uncertainty_score":0.2927117},"labels":[],"label_agreement":null},{"id":"W2059979378","doi":"10.1007/s10472-013-9371-9","title":"Domain adaptation–can quantity compensate for quality?","year":2013,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Classifier (UML); Computer science; Artificial intelligence; Machine learning; Domain adaptation; Test data; Training set; Sample (material); Labeled data; Adaptation (eye); Probability distribution; Pattern recognition (psychology); Mathematics; Statistics","score_opus":0.29257208716208033,"score_gpt":0.4001518648282202,"score_spread":0.10757977766613985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059979378","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.079788685,0.0000416112,0.9173024,0.0022633148,0.000041877032,0.00030847685,0.0000237196,0.00007009602,0.00015977258],"genre_scores_gemma":[0.4061909,0.000049529564,0.5935245,0.00016871699,0.000013814599,0.00003286973,0.0000035372407,0.000005500474,0.000010595896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884915,0.000028533068,0.0005293379,0.00021857099,0.00018520904,0.0001891843],"domain_scores_gemma":[0.998555,0.00042833237,0.00024811891,0.00041750103,0.00028518788,0.00006587202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008117649,0.00011002708,0.00023106614,0.000072653405,0.00008631471,0.00018314998,0.0005793017,0.00004097303,0.0000114682825],"category_scores_gemma":[0.00019390152,0.00009868852,0.000056716035,0.00013778264,0.000116978415,0.00029591235,0.00016446624,0.00004765904,0.000016776208],"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.0000013741264,0.00010290272,0.000015211297,0.00006794433,0.000008868313,2.1744935e-7,0.0014687077,0.000007633503,0.0014592191,0.92728055,0.0002473312,0.06934005],"study_design_scores_gemma":[0.000009077531,0.00011241573,0.000066922934,0.00007798602,0.0000021814506,0.0000014101166,0.0007084615,0.054354813,0.06997985,0.87433636,0.00022735864,0.0001231442],"about_ca_topic_score_codex":0.0002017431,"about_ca_topic_score_gemma":0.000054484677,"teacher_disagreement_score":0.32640222,"about_ca_system_score_codex":0.000002653597,"about_ca_system_score_gemma":0.000022360926,"threshold_uncertainty_score":0.4024401},"labels":[],"label_agreement":null},{"id":"W2064126174","doi":"10.1007/s10472-007-9044-7","title":"On a rule-based interpretation of default conditionals","year":2007,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Defeasible estate; Interpretation (philosophy); Defeasible reasoning; Non-monotonic logic; Inference; Default logic; Conditional probability; Rule of inference; Mathematics; Computer science; Theoretical computer science; Artificial intelligence; Mathematical economics; Description logic; Programming language","score_opus":0.08515365237624793,"score_gpt":0.3483287366739617,"score_spread":0.26317508429771375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064126174","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.15258184,0.000089339635,0.843948,0.00019897184,0.000071532486,0.00008918278,0.000004541101,0.000018432062,0.00299815],"genre_scores_gemma":[0.9797447,0.000015201546,0.020009555,0.00018771474,0.000017155538,0.0000026358089,0.0000017974896,0.0000043510972,0.000016936625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989531,0.00001831749,0.00048621843,0.00016398451,0.00022295017,0.00015540246],"domain_scores_gemma":[0.9983996,0.0007698244,0.00026864916,0.00021595809,0.00028561932,0.00006032464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084633374,0.0000990446,0.00019733016,0.00013147893,0.000047666108,0.000032762826,0.0002757938,0.000049564343,0.000025899912],"category_scores_gemma":[0.00039168578,0.00008281295,0.00007485771,0.00019007927,0.00012437758,0.00010051174,0.00004510404,0.000059501344,0.000020807529],"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.000016125923,0.0003250175,0.000014384798,0.00007990326,0.000011189877,0.0000021163771,0.001371143,0.0002561432,0.001917842,0.9409468,0.000054571046,0.055004757],"study_design_scores_gemma":[0.000015716749,0.00018248461,0.0000720627,0.00014175444,0.0000034813665,0.0000015737552,0.0001638777,0.1263884,0.3371822,0.53575325,0.00001630397,0.00007890343],"about_ca_topic_score_codex":0.000008108222,"about_ca_topic_score_gemma":0.0000091999145,"teacher_disagreement_score":0.8271628,"about_ca_system_score_codex":0.000003575375,"about_ca_system_score_gemma":0.00003196226,"threshold_uncertainty_score":0.3377014},"labels":[],"label_agreement":null},{"id":"W2078761037","doi":"10.1007/s10472-007-9056-3","title":"Relational concept discovery in structured datasets","year":2007,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Binary relation; Formal concept analysis; Relational database; Class diagram; Relational calculus; Entity–relationship model; Knowledge extraction; Relation (database); Field (mathematics); Class (philosophy); Data science; Relational model; Theoretical computer science; Data mining; Unified Modeling Language; Software; Artificial intelligence; Programming language; Mathematics; Algorithm","score_opus":0.1503343058578551,"score_gpt":0.3482971329661513,"score_spread":0.19796282710829619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078761037","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.08948833,0.00024888964,0.9086782,0.0006692213,0.00010920676,0.00011316701,0.000034566863,0.0000142638055,0.0006441994],"genre_scores_gemma":[0.9301553,0.00005329605,0.06956568,0.00017566205,0.000028972132,9.797948e-7,0.000009856053,0.0000033338329,0.0000069352445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989567,0.000012083243,0.00046161906,0.0001869482,0.00019319997,0.00018948062],"domain_scores_gemma":[0.99927855,0.00024552684,0.00013412909,0.00024944296,0.00004312741,0.000049242837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006100296,0.00008984261,0.00015154578,0.00008753207,0.000044799435,0.00007001496,0.00029519005,0.000047308436,0.000010625036],"category_scores_gemma":[0.00011016796,0.00007365586,0.0000312491,0.00021118058,0.0001048242,0.00035995408,0.00012259322,0.000083547406,0.0000048069637],"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.0000033169567,0.00009250541,0.0000895289,0.000015496587,0.0000044949315,0.000008638314,0.0011011041,0.00018794084,0.00026311664,0.93225414,0.00009005202,0.06588965],"study_design_scores_gemma":[0.000023400513,0.000071066774,0.0022514933,0.000063568805,0.0000022373315,0.000009205537,0.00049652875,0.045672838,0.034998298,0.91597027,0.00026704115,0.00017406605],"about_ca_topic_score_codex":0.000023633733,"about_ca_topic_score_gemma":0.000046027122,"teacher_disagreement_score":0.84066695,"about_ca_system_score_codex":0.0000031366815,"about_ca_system_score_gemma":0.000018345032,"threshold_uncertainty_score":0.30035987},"labels":[],"label_agreement":null},{"id":"W2100330382","doi":"10.1023/a:1022971915900","title":"An Overview of a Formal Framework for Managing Mathematics","year":2003,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Mitacs","keywords":"Complex system; Computer science; Mathematics; Artificial intelligence","score_opus":0.2547688236814281,"score_gpt":0.39638182878650957,"score_spread":0.14161300510508146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100330382","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.006044192,0.0007934157,0.99199295,0.00011096353,0.00011065267,0.00029392916,0.000001906639,0.000027371783,0.0006245925],"genre_scores_gemma":[0.67303646,0.00023570472,0.3266298,0.000047529913,0.00001951261,0.000013469042,4.7662442e-7,0.000008114558,0.000008949226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865496,0.00002547317,0.00064608717,0.00019807949,0.00020542243,0.00026994725],"domain_scores_gemma":[0.99858236,0.00030459656,0.000374467,0.00045321393,0.00020812856,0.0000772483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001178181,0.00013512175,0.00033742783,0.000077708944,0.000087825436,0.000088222565,0.00042875874,0.000072813345,0.000009175428],"category_scores_gemma":[0.00025273292,0.00011186565,0.00010293715,0.00020995317,0.00008393947,0.00028277567,0.000059148733,0.00006249531,0.000004229534],"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.0000015598846,0.0002797178,0.0000066749776,0.0007181103,0.000017114076,6.461599e-7,0.0032866925,0.000033693417,0.00016345699,0.95395774,0.0000063804596,0.041528217],"study_design_scores_gemma":[0.000011699301,0.00021802617,0.0000015994485,0.000078473095,0.0000085094025,0.000005867142,0.001217173,0.051763725,0.042353585,0.90405476,0.00017177912,0.00011480142],"about_ca_topic_score_codex":0.0000080157715,"about_ca_topic_score_gemma":0.0000038582934,"teacher_disagreement_score":0.66699225,"about_ca_system_score_codex":0.0000022736629,"about_ca_system_score_gemma":0.000025480573,"threshold_uncertainty_score":0.4561749},"labels":[],"label_agreement":null},{"id":"W2105848344","doi":"10.1007/s10472-009-9120-2","title":"Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach","year":2008,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":200,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Robot; Computer science; Mobile robot; Set (abstract data type); Task (project management); Distributed computing; Cover (algebra); Greedy algorithm; Algorithm; Real-time computing; Artificial intelligence; Engineering","score_opus":0.1974527357382306,"score_gpt":0.3430350180906082,"score_spread":0.1455822823523776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105848344","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.08697973,0.00016583035,0.9121322,0.00013050291,0.00012515234,0.00019804777,0.000005793604,0.0000803721,0.00018238346],"genre_scores_gemma":[0.42273515,0.00007108655,0.57704055,0.000062499705,0.000040785268,0.00000755535,0.0000019384515,0.000010846556,0.000029561572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981334,0.000052085084,0.00060094445,0.00043877153,0.0004011738,0.00037362095],"domain_scores_gemma":[0.99864036,0.00012904363,0.00024790087,0.0005968599,0.00020512457,0.00018073499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005834601,0.00021624306,0.00034867148,0.00013061285,0.00022556861,0.00008465778,0.00068500114,0.000086913205,0.0000048760476],"category_scores_gemma":[0.00012539992,0.00019464012,0.00007732079,0.00031939984,0.00023172828,0.0001543379,0.00017947434,0.00016429841,0.000024982188],"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.000019811572,0.0065880357,0.000106693355,0.00037867803,0.00010424257,0.00019522176,0.02697745,0.5434901,0.0072433036,0.19878541,0.00014536321,0.21596566],"study_design_scores_gemma":[0.000029311204,0.00017517181,0.00011897725,0.00004546029,0.0000047690346,0.000100486875,0.00027161167,0.97670424,0.016035207,0.0062902346,0.00000876352,0.00021577545],"about_ca_topic_score_codex":0.000040611583,"about_ca_topic_score_gemma":5.2128246e-7,"teacher_disagreement_score":0.4332141,"about_ca_system_score_codex":0.0000070403703,"about_ca_system_score_gemma":0.000056004057,"threshold_uncertainty_score":0.7937194},"labels":[],"label_agreement":null},{"id":"W2106001557","doi":"10.1007/s10472-014-9411-0","title":"Generalized pattern extraction from concept lattices","year":2014,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Generalization; Cardinality (data modeling); Formal concept analysis; Simple (philosophy); Set (abstract data type); Computer science; Complex system; Theoretical computer science; Mathematics; Artificial intelligence; Algorithm; Data mining","score_opus":0.14008205127269194,"score_gpt":0.34911829272515865,"score_spread":0.20903624145246671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106001557","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.12562676,0.00023993892,0.8719029,0.0012304054,0.00015785103,0.00006911657,0.000005248618,0.000034066292,0.0007337123],"genre_scores_gemma":[0.9325624,0.0001599452,0.06676228,0.00039862114,0.000094857816,0.0000032355754,0.0000022452773,0.0000052948353,0.000011123239],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990385,0.00003538476,0.00037676646,0.00021647189,0.00017627377,0.00015661164],"domain_scores_gemma":[0.9990723,0.00027403733,0.00020301277,0.00030217433,0.0000849956,0.00006345116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028689313,0.00010681678,0.0002020291,0.000039897128,0.00007400475,0.00013008682,0.0003346065,0.00005009738,0.00004379102],"category_scores_gemma":[0.00008011798,0.00008604054,0.000052140807,0.000094516894,0.00007810294,0.00020528109,0.000090170615,0.00006344019,0.000028393159],"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.000001756241,0.00013156564,0.000022102791,0.000020019572,0.00001418373,0.0000014223956,0.0020233542,0.00012841317,0.0014087848,0.37024295,0.000115891606,0.62588954],"study_design_scores_gemma":[0.00001589751,0.000089821064,0.000084927495,0.00004248926,0.0000058066776,0.0000018516084,0.00021479704,0.39969033,0.06947479,0.5296068,0.0006366199,0.00013582422],"about_ca_topic_score_codex":0.0001449099,"about_ca_topic_score_gemma":0.000016852508,"teacher_disagreement_score":0.8069356,"about_ca_system_score_codex":0.000001420461,"about_ca_system_score_gemma":0.000007314889,"threshold_uncertainty_score":0.35086313},"labels":[],"label_agreement":null},{"id":"W21188937","doi":"","title":"Generalizations of Watched Literals for Backtracking Search.","year":2002,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":19,"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":"Backtracking; Complex system; Mathematics; Theoretical computer science; Computer science; Algorithm; Discrete mathematics; Algebra over a field; Artificial intelligence; Pure mathematics","score_opus":0.2993484997997068,"score_gpt":0.39995187156042145,"score_spread":0.10060337176071465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21188937","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.009810084,0.0005029692,0.98860097,0.0006677009,0.00002246127,0.00018388651,0.000008945818,0.00003057379,0.00017241151],"genre_scores_gemma":[0.58294815,0.0010171097,0.41583422,0.000100207,0.00002342141,0.0000082096185,0.000001011983,0.0000073982483,0.00006025708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99908847,0.000013373475,0.0004493646,0.00015310672,0.00013905615,0.00015661074],"domain_scores_gemma":[0.9989818,0.00022741467,0.0001507573,0.00025126486,0.00034419814,0.000044564633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033535142,0.00008417456,0.00019669201,0.000080171914,0.000059075275,0.00004840157,0.0002952348,0.000035571906,0.00001869893],"category_scores_gemma":[0.00019276174,0.000073825984,0.000068942136,0.0002356169,0.00008750972,0.00027152308,0.00008116796,0.0000396878,0.000002366857],"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.0000021003168,0.00020534407,0.000008042328,0.00019186991,0.0000131890065,6.508339e-7,0.0028875936,0.00009202663,0.016478138,0.68592757,0.00016794383,0.29402554],"study_design_scores_gemma":[0.000006065808,0.0000829637,0.0000014222908,0.00006213611,0.0000022366294,0.0000011673218,0.00007578077,0.10405242,0.60107845,0.2944086,0.00017193035,0.000056831403],"about_ca_topic_score_codex":0.0000048151674,"about_ca_topic_score_gemma":8.9107937e-7,"teacher_disagreement_score":0.5846003,"about_ca_system_score_codex":0.0000016686505,"about_ca_system_score_gemma":0.000006411146,"threshold_uncertainty_score":0.30105364},"labels":[],"label_agreement":null},{"id":"W2139630036","doi":"10.1023/b:amai.0000031197.13122.aa","title":"On the Semantics of Deliberation in IndiGolog — from Theory to Implementation","year":2004,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Deliberation; Computer science; Semantics (computer science); Simple (philosophy); Plan (archaeology); Situation calculus; Bounded function; Programming language; Theoretical computer science; Artificial intelligence; Epistemology; Mathematics","score_opus":0.10192786342286023,"score_gpt":0.35328617196106066,"score_spread":0.2513583085382004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139630036","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.5222778,0.0000234918,0.47643968,0.00093420653,0.000029912062,0.000109797926,0.0000022252489,0.0000048178917,0.0001780661],"genre_scores_gemma":[0.9839255,0.00003797364,0.015744025,0.0002676992,0.000011931964,0.0000055965643,8.869061e-7,0.000002983065,0.0000033660797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992611,0.000032918513,0.0003414968,0.00012790761,0.00013016813,0.00010641387],"domain_scores_gemma":[0.9992028,0.0003642349,0.0001337467,0.00019771146,0.000074983145,0.000026545033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060501834,0.00007071069,0.00012534858,0.000059000715,0.000042028412,0.000034663703,0.0002529116,0.000029282935,0.000023695418],"category_scores_gemma":[0.000185147,0.00004897867,0.000027966345,0.0001953771,0.00004810767,0.00007957594,0.00008563816,0.000049232425,0.000016540449],"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.0000041683534,0.000117164265,0.000029063305,0.000008562523,0.000005414783,6.223978e-7,0.009968369,0.00049824076,0.0012689895,0.9438589,0.000020123367,0.044220373],"study_design_scores_gemma":[0.000011999352,0.000103606246,0.00021642349,0.000044936016,0.0000018872611,3.0670125e-7,0.00075547,0.002920898,0.22471638,0.7711772,0.000006475052,0.000044469394],"about_ca_topic_score_codex":0.000074095056,"about_ca_topic_score_gemma":0.00018971418,"teacher_disagreement_score":0.46164775,"about_ca_system_score_codex":0.000004734395,"about_ca_system_score_gemma":0.000022388143,"threshold_uncertainty_score":0.19972922},"labels":[],"label_agreement":null},{"id":"W2274126126","doi":"10.1007/s10472-015-9492-4","title":"How many crowdsourced workers should a requester hire?","year":2016,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":20,"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; University of Waterloo","keywords":"Crowdsourcing; Aggregate (composite); Computer science; Payment; Task (project management); Bootstrapping (finance); Process (computing); Set (abstract data type); Data science; Econometrics; Economics; World Wide Web","score_opus":0.15540755052225516,"score_gpt":0.3250190013130534,"score_spread":0.16961145079079823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274126126","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.19999485,0.00016903743,0.78762305,0.011397899,0.0001180052,0.00011723469,0.0000019705424,0.000078376135,0.00049956224],"genre_scores_gemma":[0.97761804,0.00009821031,0.021375664,0.00023863696,0.00006463038,0.0000061467595,1.7455898e-7,0.000014447489,0.00058406784],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985884,0.00002692719,0.00041923637,0.00034311062,0.0002844701,0.00033785412],"domain_scores_gemma":[0.99860394,0.000327834,0.0002231203,0.0005849365,0.00013379722,0.00012639002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006324897,0.00018386202,0.0002770111,0.000107139575,0.00011602647,0.0003115169,0.0004679551,0.00008496329,0.000009120191],"category_scores_gemma":[0.00024592236,0.00012232483,0.00010163653,0.00020775717,0.00020511835,0.00034503953,0.00017723936,0.00008452068,0.0000192929],"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.000010396344,0.00016343691,0.00011084648,0.00009484479,0.00003990171,0.00001647082,0.002530118,0.000018282553,0.040403508,0.39823887,0.00059262244,0.5577807],"study_design_scores_gemma":[0.00003911728,0.00016446834,0.000059847134,0.0007665429,0.000012696094,0.000033510754,0.001131244,0.015901003,0.63858694,0.34118482,0.001707,0.00041279325],"about_ca_topic_score_codex":0.000011428115,"about_ca_topic_score_gemma":0.000006041106,"teacher_disagreement_score":0.7776232,"about_ca_system_score_codex":0.0000056196664,"about_ca_system_score_gemma":0.000024333913,"threshold_uncertainty_score":0.49882615},"labels":[],"label_agreement":null},{"id":"W2793317393","doi":"10.1007/s10472-018-9578-x","title":"Efficient suspect selection in unreachable state diagnosis","year":2018,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Benchmark (surveying); Suspect; Computer science; Set (abstract data type); Root cause; Root (linguistics); Root cause analysis; Speedup; Selection (genetic algorithm); State (computer science); Process (computing); Algorithm; Mathematical optimization; Reliability engineering; Machine learning; Mathematics; Parallel computing; Programming language; Engineering","score_opus":0.12156842139252379,"score_gpt":0.3374677578527973,"score_spread":0.21589933646027354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793317393","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.5757998,0.0000853504,0.42301753,0.00030923812,0.00004881683,0.00008465784,0.0000010617447,0.000032302534,0.00062123954],"genre_scores_gemma":[0.99425817,0.000058478374,0.005551804,0.00006753379,0.000037284713,0.000007144165,1.4468641e-7,0.000005234644,0.000014187389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895966,0.00002285473,0.000392684,0.00022096504,0.00016225074,0.00024156617],"domain_scores_gemma":[0.9992926,0.00021596655,0.00013224766,0.00013950143,0.0001652539,0.000054417473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006664616,0.00009686904,0.00016791969,0.00014210504,0.00009161831,0.000077962475,0.00024734982,0.00002863458,0.000015044414],"category_scores_gemma":[0.00022422316,0.00008848468,0.000033508648,0.0005021972,0.00010218752,0.00008138158,0.00008365965,0.00007161455,0.00002333078],"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.0000012382084,0.0007425156,0.0017390585,0.00011120329,0.00001596775,0.00000832155,0.0077325385,0.0026975132,0.006080019,0.369838,0.000072902294,0.6109607],"study_design_scores_gemma":[0.000010441368,0.00016775314,0.00025500526,0.00013539231,0.0000019196227,0.000005350208,0.00022022112,0.61700946,0.21224704,0.16980329,0.000022598895,0.000121520345],"about_ca_topic_score_codex":0.00012757284,"about_ca_topic_score_gemma":0.00013084454,"teacher_disagreement_score":0.61431193,"about_ca_system_score_codex":0.0000061238934,"about_ca_system_score_gemma":0.000024833926,"threshold_uncertainty_score":0.36083004},"labels":[],"label_agreement":null},{"id":"W2921963619","doi":"10.1007/s10472-019-09681-3","title":"The SAT+CAS method for combinatorial search with applications to best matrices","year":2019,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Satisfiability; Computer science; DPLL algorithm; Variety (cybernetics); Mathematics; Theoretical computer science; Combinatorics; Algorithm; Discrete mathematics; Artificial intelligence","score_opus":0.08461102999157805,"score_gpt":0.36037610158704764,"score_spread":0.2757650715954696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921963619","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.22336413,0.00050892454,0.77310836,0.00029841278,0.00018284815,0.0012999548,0.000027141119,0.000040901767,0.0011693136],"genre_scores_gemma":[0.9855304,0.00012043592,0.014053555,0.00001649955,0.00006955815,0.0001313691,0.0000014217248,0.000018390978,0.00005839346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993595,0.000013899981,0.0002535612,0.00009953175,0.0001164038,0.00015712022],"domain_scores_gemma":[0.9990415,0.0005504162,0.00003974125,0.00019801994,0.000118927754,0.000051381645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006691305,0.00008490871,0.00015153759,0.000034853223,0.00009959754,0.000058573507,0.00016352527,0.000032837695,0.000005904677],"category_scores_gemma":[0.000018950956,0.00005706974,0.00003719423,0.00016770542,0.000037716676,0.000035887846,0.000019132227,0.000051493447,0.000042959495],"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.000021531181,0.000053836728,0.000011583277,0.00030834405,0.000038018345,1.0602649e-7,0.0010321086,0.0029241266,0.0024750605,0.9630966,0.000050203762,0.029988488],"study_design_scores_gemma":[0.000043837055,0.00046930555,0.0000070149244,0.00018636239,0.000029789717,0.0000055518685,0.0076823365,0.08887771,0.2515309,0.6427016,0.008192424,0.00027316826],"about_ca_topic_score_codex":0.000007563897,"about_ca_topic_score_gemma":0.000010020825,"teacher_disagreement_score":0.76216626,"about_ca_system_score_codex":0.0000022343338,"about_ca_system_score_gemma":0.0000072016105,"threshold_uncertainty_score":0.23272365},"labels":[],"label_agreement":null},{"id":"W3021101329","doi":"10.1007/s10472-020-09698-z","title":"Leveraging cluster backbones for improving MAP inference in statistical relational models","year":2020,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Inference; Computer science; Scalability; Smoothing; Maximum a posteriori estimation; A priori and a posteriori; Relational database; Belief propagation; Theoretical computer science; Parameterized complexity; Algorithm; Artificial intelligence; Machine learning; Data mining; Mathematics","score_opus":0.29144412803498987,"score_gpt":0.36130099035543195,"score_spread":0.06985686232044208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021101329","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.009332507,0.00009188052,0.9859128,0.004344589,0.000043031978,0.00016297634,0.000009781505,0.000024570923,0.00007786803],"genre_scores_gemma":[0.7200005,0.00001850114,0.2795457,0.0003913174,0.000023393228,0.000009475937,0.0000017463049,0.0000053145136,0.000004040653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987537,0.000021503914,0.0005406576,0.00028781232,0.00017948986,0.00021681316],"domain_scores_gemma":[0.9987562,0.00070323213,0.00013103143,0.00014736335,0.00016366546,0.00009854961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000445973,0.00012090125,0.00021855971,0.000058074223,0.00005976621,0.00009299008,0.00028232514,0.000054845434,0.0000068568006],"category_scores_gemma":[0.0003835051,0.00011436395,0.000037547645,0.00013584964,0.00006949426,0.0003210065,0.00014008654,0.00011599827,0.0000068680547],"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.000009322436,0.000059967777,0.000011988049,0.00018441446,0.0000042563133,0.0000011119204,0.0031267134,0.014130041,0.00037183272,0.9332386,0.00002313095,0.048838574],"study_design_scores_gemma":[0.000013221547,0.00004957447,0.0000042549154,0.000040596988,0.0000016653166,4.180285e-7,0.00013684304,0.5678163,0.002349282,0.42950612,0.0000063180096,0.000075387885],"about_ca_topic_score_codex":0.000020072743,"about_ca_topic_score_gemma":0.0000052994465,"teacher_disagreement_score":0.710668,"about_ca_system_score_codex":0.0000035830865,"about_ca_system_score_gemma":0.000055718247,"threshold_uncertainty_score":0.46636268},"labels":[],"label_agreement":null},{"id":"W3160257224","doi":"10.1023/a:1016636024246","title":"Multi-robot collaboration for robust exploration","year":2001,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":162,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; McGill University","funders":"","keywords":"Robot; Odometry; Computer science; Artificial intelligence; Computer vision; Modality (human–computer interaction); Mobile robot","score_opus":0.23778299215723417,"score_gpt":0.344475517158919,"score_spread":0.10669252500168483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160257224","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.030651612,0.00016834508,0.96840906,0.00031315247,0.00010101681,0.00022392637,0.000008485104,0.00004158633,0.00008284132],"genre_scores_gemma":[0.85388815,0.0009251435,0.14495066,0.00005478522,0.00007503569,0.00002404069,0.0000233105,0.000025377552,0.000033480857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993567,0.0000058316773,0.00034554795,0.000090998576,0.0000848132,0.00011613563],"domain_scores_gemma":[0.9995078,0.0000730284,0.00006118579,0.000100942016,0.00021895878,0.000038092043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017215223,0.00008901588,0.00013401412,0.000061480925,0.000056043475,0.000049659622,0.000049439892,0.000051536896,0.000013503368],"category_scores_gemma":[0.00009256314,0.00008797113,0.000029812538,0.00016127266,0.000030976174,0.00014491058,0.000006314623,0.000029222978,0.000005254656],"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.0000084296,0.00011567972,0.0000044344483,0.00016173598,0.000015584834,7.102608e-7,0.0013946743,0.9327926,0.012197744,0.03535825,0.00016471824,0.017785452],"study_design_scores_gemma":[0.000017031163,0.000048320177,0.0000031645604,0.000038223185,0.0000070376204,8.5466104e-7,0.0012347171,0.8973715,0.08368797,0.017357051,0.00014427312,0.00008987002],"about_ca_topic_score_codex":0.0000029662717,"about_ca_topic_score_gemma":0.000028369293,"teacher_disagreement_score":0.8234584,"about_ca_system_score_codex":0.0000039836655,"about_ca_system_score_gemma":0.000007340121,"threshold_uncertainty_score":0.35873586},"labels":[],"label_agreement":null},{"id":"W3164395633","doi":"10.1007/s10472-021-09748-0","title":"Learning tractable NAT-modeled Bayesian networks","year":2021,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bayesian network; Conditional independence; Exponential family; Treewidth; Nat; Graphical model; Inference; Computer science; Artificial intelligence; Mathematics; Machine learning; Theoretical computer science; Statistics; Graph","score_opus":0.10558307949341135,"score_gpt":0.32680304602057864,"score_spread":0.2212199665271673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164395633","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.018666439,0.0005762187,0.97822076,0.00096568995,0.00008620112,0.000051453644,8.261334e-7,0.000055914777,0.0013764987],"genre_scores_gemma":[0.9281904,0.00059875246,0.07084934,0.00018014469,0.00003956146,0.000003946496,0.0000014340462,0.000009106873,0.00012729688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986657,0.00004582856,0.00048268453,0.00030458512,0.0002102592,0.00029092305],"domain_scores_gemma":[0.9988777,0.00021425547,0.00016024106,0.0003170373,0.00031803595,0.00011274607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005425177,0.00014181148,0.00026565298,0.00005499435,0.00014463392,0.00019938133,0.00033883893,0.0000843019,0.000030934727],"category_scores_gemma":[0.00018482906,0.00013557992,0.00007675374,0.00032075905,0.00006799707,0.00024004708,0.00015532764,0.00021962018,0.000010553027],"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.0000026859204,0.00022157413,0.000012825521,0.000061155326,0.000021845355,0.000016806043,0.0013458824,0.020666119,0.0016930446,0.75272804,0.00005072074,0.22317928],"study_design_scores_gemma":[0.0000072925363,0.00005481443,0.0000028550494,0.000081770966,0.000004100632,0.000012774185,0.00030598821,0.73640555,0.04578383,0.21716686,0.000055213673,0.00011894878],"about_ca_topic_score_codex":0.000014750605,"about_ca_topic_score_gemma":0.000009072419,"teacher_disagreement_score":0.90952396,"about_ca_system_score_codex":0.0000029269763,"about_ca_system_score_gemma":0.000061351035,"threshold_uncertainty_score":0.55287886},"labels":[],"label_agreement":null},{"id":"W4210660386","doi":"10.1007/s10472-022-09784-4","title":"Computing triadic generators and association rules from triadic contexts","year":2022,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Representation (politics); Preprocessor; Set (abstract data type); Computer science; Computation; Association (psychology); Association rule learning; Theoretical computer science; Artificial intelligence; Algorithm; Psychology; Programming language","score_opus":0.10627649923251277,"score_gpt":0.31877215509899776,"score_spread":0.212495655866485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210660386","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.82609206,0.0015726157,0.16989668,0.0015616463,0.00028672494,0.0001923741,0.0000405143,0.000043050888,0.00031435155],"genre_scores_gemma":[0.9732797,0.00022486506,0.02606118,0.00033733158,0.0000675436,0.000005688423,0.0000043668965,0.000006550335,0.000012783899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998642,0.0000894577,0.0005057376,0.0002549196,0.00030958324,0.00019828106],"domain_scores_gemma":[0.9987332,0.00054965424,0.00036977543,0.00020104782,0.00007662796,0.000069679634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011386409,0.000116021634,0.00027999366,0.00007959791,0.00030264616,0.00014980033,0.0003153333,0.00004094748,0.000029968898],"category_scores_gemma":[0.00018615599,0.00010631552,0.00005569895,0.00018040807,0.000047836664,0.00012028956,0.00030512473,0.00012813298,0.0000056268254],"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.000014914773,0.00036136297,0.00034409855,0.00004217363,0.00008235883,0.000009462309,0.007968489,0.00042242883,0.0012816433,0.5001801,0.0006433011,0.48864964],"study_design_scores_gemma":[0.00008060585,0.00025746098,0.00032388917,0.00003740349,0.000017477852,0.000005418619,0.0012011506,0.35404545,0.009388787,0.6336748,0.00071043655,0.00025712978],"about_ca_topic_score_codex":0.000078844714,"about_ca_topic_score_gemma":0.0000070664823,"teacher_disagreement_score":0.48839253,"about_ca_system_score_codex":0.00001183937,"about_ca_system_score_gemma":0.000026935668,"threshold_uncertainty_score":0.43354213},"labels":[],"label_agreement":null},{"id":"W4234580447","doi":"10.1023/b:amai.0000031230.18901.7b","title":"Introduction","year":2004,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"","field":"","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Complex system; Computer science; Artificial intelligence","score_opus":0.1553457494808421,"score_gpt":0.3632001058967381,"score_spread":0.20785435641589603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234580447","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.91906875,0.00025389728,0.07243181,0.006336996,0.00017034203,0.00022476763,0.000017606275,0.000082204,0.0014136039],"genre_scores_gemma":[0.9860833,0.00012062372,0.013435568,0.000060713974,0.00023830116,0.0000047428102,0.0000023876983,0.000022428423,0.00003190796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989732,0.000009964318,0.00045029522,0.00017991796,0.00020210104,0.00018455989],"domain_scores_gemma":[0.9992854,0.000048981314,0.00017679959,0.00022994028,0.00019262488,0.00006627392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005204279,0.0001113286,0.00018994388,0.000099540855,0.00006631732,0.00003523444,0.00011378094,0.0000424904,0.00013255843],"category_scores_gemma":[0.00031522513,0.000100589736,0.000052040512,0.00023409163,0.00020057552,0.00013086176,0.00004027626,0.00007434937,0.0005919901],"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.000012823757,0.0004231123,0.000003707537,0.00007291493,0.000019686466,0.0000016458198,0.0016304528,0.00094695,0.037874654,0.93688744,0.0003530396,0.02177359],"study_design_scores_gemma":[0.000007492355,0.000069755515,0.0000084162875,0.000034505534,0.0000066446196,0.0000072662024,0.00081111555,0.0007361838,0.49102616,0.50674814,0.0004642685,0.0000800479],"about_ca_topic_score_codex":0.00003260937,"about_ca_topic_score_gemma":0.00001846623,"teacher_disagreement_score":0.45315152,"about_ca_system_score_codex":0.0000056438325,"about_ca_system_score_gemma":0.0000202622,"threshold_uncertainty_score":0.7609032},"labels":[],"label_agreement":null},{"id":"W4254008670","doi":"10.1007/s10472-019-09677-z","title":"Guest editorial: revised selected papers from the LION 12 conference","year":2019,"lang":"en","type":"editorial","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Complex system; Computer science; Library science; Cognitive science; Artificial intelligence; Psychology","score_opus":0.08136435086754375,"score_gpt":0.313219814734329,"score_spread":0.2318554638667853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254008670","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019821867,0.0005913359,0.055785842,0.0004930136,0.9416602,0.00047369464,0.00007067485,0.00008896601,0.00063801],"genre_scores_gemma":[0.004470294,0.0015071724,0.0021444354,0.00005420213,0.9904493,0.000020812186,0.00004969051,0.000047186473,0.0012569022],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964661,0.00016870846,0.0010911342,0.00066845,0.001177269,0.0004283248],"domain_scores_gemma":[0.9928831,0.0036662219,0.0010014132,0.0009263577,0.0014196627,0.00010328575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014471165,0.00043595664,0.000770197,0.00009052181,0.0002177344,0.0005872731,0.0015976446,0.0005484744,0.000027396465],"category_scores_gemma":[0.0028172566,0.00031431793,0.00017609827,0.0003016417,0.00014243739,0.0002223234,0.00037744254,0.0008762421,0.000110912115],"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.000017886203,0.00013963095,0.0000051813695,0.00032188703,0.00013910767,0.0000042736146,0.0035198566,0.000050231767,0.0013548454,0.11984559,0.86754274,0.00705879],"study_design_scores_gemma":[0.000024251953,0.00021170916,0.0000028787551,0.0017833094,0.000034806868,7.418318e-7,0.00040829714,0.00365373,0.008415407,0.010618002,0.9743939,0.00045295357],"about_ca_topic_score_codex":0.0004456211,"about_ca_topic_score_gemma":0.000046685884,"teacher_disagreement_score":0.10922759,"about_ca_system_score_codex":0.000018422768,"about_ca_system_score_gemma":0.0003052143,"threshold_uncertainty_score":0.9999309},"labels":[],"label_agreement":null},{"id":"W4288685268","doi":"10.1007/s10472-022-09808-z","title":"Preface selected revised papers from the LION 14 conference","year":2022,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"History and advancements in chemistry","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Complex system; Computer science; Cognitive science; Library science; Artificial intelligence; Psychology","score_opus":0.11469419844379511,"score_gpt":0.32064728666230596,"score_spread":0.20595308821851085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288685268","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.9832655,0.0010399194,0.0019538798,0.0009440869,0.00011112873,0.00012980199,0.00019093213,0.00005173464,0.012312969],"genre_scores_gemma":[0.9977407,0.00030714917,0.00084144634,0.00016826429,0.00005736477,0.000024932388,0.000023846083,0.000012102522,0.00082420046],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989563,0.000015717043,0.00039041784,0.00021083035,0.00026487772,0.00016180621],"domain_scores_gemma":[0.9990013,0.00030558574,0.00023148299,0.00030485677,0.00010904254,0.00004768059],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023989507,0.00012510036,0.00018109143,0.000011284888,0.000309357,0.000025385854,0.00033158012,0.00003673482,0.0039245724],"category_scores_gemma":[0.0002492173,0.000103152095,0.000049276892,0.00013108391,0.00015287485,0.000038764974,0.00013820156,0.00022467504,0.0000068699273],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079598765,0.0006370056,0.00009127919,0.00035933746,0.00010810175,0.0000074995205,0.006907993,0.00041587223,0.9092736,0.028366165,0.0015966682,0.05215688],"study_design_scores_gemma":[0.00002666559,0.00003458828,0.0000041146322,0.00013357395,0.000024217941,0.00000315741,0.0042426973,0.0027317975,0.9350663,0.03876734,0.018773478,0.0001920851],"about_ca_topic_score_codex":0.000014018232,"about_ca_topic_score_gemma":0.0000045386555,"teacher_disagreement_score":0.051964793,"about_ca_system_score_codex":0.000010646271,"about_ca_system_score_gemma":0.00003928818,"threshold_uncertainty_score":0.996986},"labels":[],"label_agreement":null},{"id":"W4323825557","doi":"10.1007/s10472-023-09838-1","title":"Preface: Selected revised papers from the LION 15 conference","year":2023,"lang":"en","type":"editorial","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Origins and Evolution of Life","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Complex system; Computer science; Cognitive science; Artificial intelligence; Psychology","score_opus":0.08913233811127177,"score_gpt":0.3410295004330448,"score_spread":0.25189716232177306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323825557","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047461245,0.0015634465,0.023299402,0.0050804117,0.9033738,0.002062182,0.009012597,0.00032974654,0.007817194],"genre_scores_gemma":[0.24437954,0.0033523196,0.0018136323,0.00010839739,0.74605376,0.00011287353,0.0013777069,0.00019135345,0.0026104583],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981839,0.00003892226,0.0006947789,0.0003248167,0.0004742928,0.00028327442],"domain_scores_gemma":[0.9968362,0.0016398282,0.0004972159,0.0003763282,0.00056127855,0.000089190886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046764076,0.0002782246,0.00047862096,0.000045192413,0.00017032294,0.00014159965,0.00038961114,0.00018946492,0.00054788846],"category_scores_gemma":[0.0004437343,0.00020089866,0.00013897632,0.00026281725,0.00018065087,0.000059660422,0.00011546992,0.00041715038,0.00009922939],"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.000017314913,0.00016542806,0.000029484512,0.00012350299,0.00018003861,7.2392174e-7,0.0010007112,0.000024363562,0.00027302545,0.045575894,0.9402478,0.012361759],"study_design_scores_gemma":[0.00007319224,0.0002208673,0.000045914505,0.0019219297,0.0002137127,1.1124627e-7,0.0033254263,0.006846386,0.012191431,0.27233407,0.70195603,0.00087092357],"about_ca_topic_score_codex":0.00045117605,"about_ca_topic_score_gemma":0.00004116704,"teacher_disagreement_score":0.23829173,"about_ca_system_score_codex":0.000004778707,"about_ca_system_score_gemma":0.00017671601,"threshold_uncertainty_score":0.819241},"labels":[],"label_agreement":null},{"id":"W4376870868","doi":"10.1007/s10472-023-09855-0","title":"Correction to: Preface: Selected revised papers from the LION 15 conference","year":2023,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Muon and positron interactions and applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Library science; Complex system; Computer science; Artificial intelligence","score_opus":0.09928665120890265,"score_gpt":0.33238695909670524,"score_spread":0.2331003078878026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376870868","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.923541,0.00014433208,0.06745369,0.0022756779,0.00069969066,0.00042163362,0.00006296652,0.0002650808,0.0051359087],"genre_scores_gemma":[0.99862313,0.00054429274,0.0004186663,0.000082466184,0.000050572293,0.000027708018,0.000011339726,0.000008652755,0.00023316553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949306,0.000007114191,0.00022991232,0.000087552515,0.00007813178,0.000104251456],"domain_scores_gemma":[0.9994295,0.00025795307,0.000034979643,0.00013836045,0.00009541886,0.000043745746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011244167,0.00007299141,0.00009809468,0.000036664416,0.00008495272,0.000046435343,0.00009267819,0.000025368578,0.00017293978],"category_scores_gemma":[0.00009114163,0.00005549108,0.000028490023,0.0003513741,0.000026190839,0.00003128115,0.000017430437,0.00008023072,0.0001249332],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031130254,0.00023965965,0.00012439126,0.00020486959,0.00017290888,0.0000013891728,0.013998146,0.021772632,0.30466172,0.12440791,0.1372242,0.39716104],"study_design_scores_gemma":[0.000014968657,0.00007227185,0.0009880054,0.00036919164,0.00002322473,0.0000018756679,0.0028802222,0.59939784,0.36079133,0.020699695,0.014528273,0.00023310952],"about_ca_topic_score_codex":0.000043151642,"about_ca_topic_score_gemma":0.000064580956,"teacher_disagreement_score":0.5776252,"about_ca_system_score_codex":0.00000248194,"about_ca_system_score_gemma":0.000007000801,"threshold_uncertainty_score":0.22628607},"labels":[],"label_agreement":null},{"id":"W4380048657","doi":"10.1007/s10472-023-09844-3","title":"Quantifying the relationship between software design principles and performance in Jason: a case study with simulated mobile robots","year":2023,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Software Engineering Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maintainability; Cyclomatic complexity; Cohesion (chemistry); Computer science; Code (set theory); Separation of concerns; Coupling (piping); Software; Software engineering; Artificial intelligence; Reliability engineering; Programming language; Engineering","score_opus":0.4450014916976675,"score_gpt":0.4113975001879414,"score_spread":0.033603991509726094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380048657","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.77944934,0.00007223009,0.2199415,0.00007160956,0.000010619784,0.00038933576,7.2146315e-7,0.00006370947,9.588972e-7],"genre_scores_gemma":[0.9876603,0.000029004357,0.0122587215,0.0000039416477,0.0000087013195,0.00002259957,3.5169163e-7,0.000009856523,0.0000065182],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894655,0.000056590026,0.00033082959,0.00021602487,0.00023659777,0.0002134153],"domain_scores_gemma":[0.9944455,0.0050237537,0.000080489735,0.00030909816,0.000090825015,0.000050319522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015624533,0.00010748907,0.00017045345,0.00016230301,0.00017116596,0.00012351533,0.00027376154,0.000034581113,8.7370086e-7],"category_scores_gemma":[0.0009759566,0.00007446055,0.000014144071,0.0008248366,0.0000835909,0.00017990888,0.00019050181,0.0001570531,0.0000052303],"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.000015724756,0.0002267716,0.63815534,0.00032861313,0.000036090867,0.00032120533,0.025438758,0.28233773,0.0000131059305,0.006116098,0.0000030916635,0.047007456],"study_design_scores_gemma":[0.00005050297,0.0008279584,0.10400513,0.00031727913,0.000009271633,0.00010297129,0.005180215,0.881877,0.0018869857,0.005516825,0.0000029481803,0.00022289569],"about_ca_topic_score_codex":0.00003978445,"about_ca_topic_score_gemma":0.000026829857,"teacher_disagreement_score":0.5995393,"about_ca_system_score_codex":0.0000042327997,"about_ca_system_score_gemma":0.00002567696,"threshold_uncertainty_score":0.30364132},"labels":[],"label_agreement":null},{"id":"W4385458530","doi":"10.1007/s10472-023-09885-8","title":"A study on the predictive strength of fractal dimension of white and grey matter on MRI images in Alzheimer’s disease","year":2023,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Fractal and DNA sequence analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"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":"National Institute of Biomedical Imaging and Bioengineering; Canadian Institutes of Health Research; National Institutes of Health; Servier; Università degli Studi di Firenze; BioClinica; Northern California Institute for Research and Education; F. Hoffmann-La Roche; University of Southern California; Biogen; Eli Lilly and Company; Bristol-Myers Squibb; Eisai; National Institute on Aging; Alzheimer's Association; Foundation for the National Institutes of Health; U.S. Department of Defense","keywords":"Grey matter; White matter; Fractal dimension; Pattern recognition (psychology); Artificial intelligence; Neuroimaging; Mathematics; Fractal; Computer science; Statistics; Psychology; Medicine; Neuroscience; Magnetic resonance imaging; Radiology","score_opus":0.0735710466518416,"score_gpt":0.338067428465727,"score_spread":0.2644963818138854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385458530","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.99879855,0.00014143891,0.00008442497,0.0006418502,0.000010968107,0.00017406375,0.000042672662,0.0000019853067,0.00010406708],"genre_scores_gemma":[0.9995168,0.00032817092,0.000042180738,0.00006542984,0.000011636246,0.00000864952,0.000006952391,0.000006251212,0.000013944649],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999237,0.000035471006,0.00031357916,0.00016944598,0.00014602144,0.000098456505],"domain_scores_gemma":[0.9994332,0.00009823095,0.00015132666,0.0001990806,0.0000814919,0.000036669528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028505933,0.00009639338,0.00017497003,0.000075511685,0.00003798366,0.000007519111,0.00008614976,0.00003222132,0.00000999092],"category_scores_gemma":[0.00012518174,0.00006427556,0.000051114188,0.0001393064,0.00015281112,0.000006048023,0.000096075986,0.000045593748,0.0000029352993],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032648495,0.015439934,0.1636014,0.00084696716,0.0018388876,0.00011033196,0.03040418,0.007944032,0.7100614,0.01872975,0.0034413426,0.044316933],"study_design_scores_gemma":[0.00004867126,0.0013727528,0.019337831,0.00022191324,0.000081268605,6.107105e-7,0.009330736,0.0041753277,0.95348865,0.011784218,0.000009212337,0.00014878623],"about_ca_topic_score_codex":0.000021654145,"about_ca_topic_score_gemma":0.000013593859,"teacher_disagreement_score":0.24342728,"about_ca_system_score_codex":6.337249e-7,"about_ca_system_score_gemma":0.000010719785,"threshold_uncertainty_score":0.26210815},"labels":[],"label_agreement":null},{"id":"W4391400188","doi":"10.1007/s10472-023-09908-4","title":"A knowledge compilation perspective on queries and transformations for belief tracking","year":2024,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Minnow Environmental (Canada)","funders":"Agence Nationale de la Recherche","keywords":"Succinctness; Nondeterministic algorithm; Computer science; Theoretical computer science; Action (physics); State (computer science); Belief revision; Perspective (graphical); Artificial intelligence; Algorithm","score_opus":0.17474759199431658,"score_gpt":0.39334058518358,"score_spread":0.21859299318926342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391400188","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.011113158,0.001627234,0.98302656,0.0028038172,0.000078360885,0.00017322425,0.00002327257,0.000056923105,0.001097447],"genre_scores_gemma":[0.9709734,0.0001560605,0.028739052,0.000053446103,0.000032538763,0.000012293646,0.0000022846643,0.000005939665,0.000025020217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939233,0.000012611367,0.0002466121,0.00015799985,0.00007670907,0.00011375005],"domain_scores_gemma":[0.9990831,0.0006034267,0.000047019952,0.00009169733,0.00013910882,0.000035664743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004183515,0.00008510685,0.0001219719,0.00010338454,0.0001507877,0.00019601588,0.000099531266,0.000033848297,0.000002492636],"category_scores_gemma":[0.00007769713,0.00007377803,0.000039756538,0.00014321902,0.000060834413,0.00025599948,0.000018391298,0.000067396366,0.000003918598],"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.0000031694442,0.000047581085,0.0000015221947,0.00020947936,0.00001201676,3.9875937e-7,0.02908831,0.00017552849,0.00023567452,0.8813165,0.000067952,0.088841856],"study_design_scores_gemma":[0.000008090021,0.00016985893,0.000007472687,0.00039760093,0.000006425747,0.0000033468925,0.001869312,0.49240768,0.0229942,0.48163915,0.00041144912,0.00008543627],"about_ca_topic_score_codex":0.000008781077,"about_ca_topic_score_gemma":0.000011194644,"teacher_disagreement_score":0.9598602,"about_ca_system_score_codex":0.0000047932476,"about_ca_system_score_gemma":0.00002795017,"threshold_uncertainty_score":0.30085808},"labels":[],"label_agreement":null},{"id":"W4393044795","doi":"10.1007/s10472-024-09939-5","title":"Multi-resolution continuous normalizing flows","year":2024,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Fluid Dynamics and Turbulent Flows","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute; Cegep Edouard Montpetit","funders":"Air Force Office of Scientific Research; Canadian Institute for Advanced Research","keywords":"Complex system; Mathematics; Resolution (logic); Computer science; Statistical physics; Physics; Artificial intelligence","score_opus":0.07029291007194335,"score_gpt":0.3000065180827615,"score_spread":0.22971360801081817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393044795","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.39240944,0.0074265967,0.5978363,0.0001982767,0.00058666937,0.00018487939,0.00003221229,0.00023896198,0.0010866426],"genre_scores_gemma":[0.9789747,0.0013551045,0.01952196,0.000017389351,0.00005892028,0.0000060822244,0.00000348712,0.000022844733,0.00003948337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926037,0.000004726677,0.0003497223,0.00011248794,0.00010190069,0.0001707912],"domain_scores_gemma":[0.9997019,0.00006968502,0.0000201705,0.00011355304,0.000046474503,0.000048211117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023102626,0.00011250787,0.00015975717,0.000085394364,0.00003522392,0.00007774229,0.00008027072,0.00005143252,0.000030955194],"category_scores_gemma":[0.000030166093,0.00010240899,0.0000614806,0.00011922484,0.000038446302,0.0000908631,0.000026161086,0.00008860203,0.000040858635],"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.000006910782,0.00026073685,0.000014436124,0.0022864835,0.0001858725,0.000038545284,0.0046396093,0.22414772,0.045780193,0.5048818,0.00084947847,0.21690819],"study_design_scores_gemma":[0.0000053900158,0.000023077304,0.000004370173,0.00019834572,0.000009202994,0.0000047787917,0.00012316759,0.9729869,0.012926192,0.012897703,0.0007106233,0.000110283756],"about_ca_topic_score_codex":0.00001676291,"about_ca_topic_score_gemma":0.0000209649,"teacher_disagreement_score":0.74883914,"about_ca_system_score_codex":0.000003797156,"about_ca_system_score_gemma":0.0000061048645,"threshold_uncertainty_score":0.41761172},"labels":[],"label_agreement":null},{"id":"W4406083866","doi":"10.1007/s10472-024-09958-2","title":"Guest editorial: Revised selected papers from the LION 16 conference","year":2025,"lang":"en","type":"editorial","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Complex system; Computer science; Cognitive science; Artificial intelligence; Psychology","score_opus":0.20660902430468903,"score_gpt":0.4196426037209885,"score_spread":0.21303357941629947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406083866","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028454806,0.00040817232,0.00977256,0.0016140231,0.98466414,0.00037180123,0.0005835889,0.000044434313,0.00225676],"genre_scores_gemma":[0.0041273413,0.0011951864,0.000857389,0.000121460835,0.9913033,0.00001603758,0.00024087667,0.000020886891,0.002117516],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939084,0.00023224701,0.0017529941,0.000967288,0.002801715,0.0003373669],"domain_scores_gemma":[0.9788693,0.015526912,0.0011069338,0.0016815843,0.0027073505,0.000107906926],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0075373705,0.0003325466,0.00073906145,0.00020942652,0.00032165082,0.0013013387,0.002275659,0.00035668007,0.00020667168],"category_scores_gemma":[0.043669663,0.00020995991,0.00017371443,0.0011626343,0.0003705917,0.00012789264,0.00080218544,0.00050562934,0.00010548476],"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.00001824537,0.00009911118,0.0000016531459,0.000048887134,0.000044301865,9.63015e-7,0.00052317494,0.000009942044,0.000048583926,0.0045353156,0.95932543,0.035344396],"study_design_scores_gemma":[0.00001910605,0.00005476322,0.0000028228908,0.0006323304,0.00005170293,8.725041e-8,0.0011486944,0.001754862,0.001258127,0.11685724,0.87800646,0.00021382091],"about_ca_topic_score_codex":0.00041205154,"about_ca_topic_score_gemma":0.0002540907,"teacher_disagreement_score":0.11232192,"about_ca_system_score_codex":0.0000136211775,"about_ca_system_score_gemma":0.00031081293,"threshold_uncertainty_score":0.9997354},"labels":[],"label_agreement":null},{"id":"W4406480091","doi":"10.1007/s10472-025-09966-w","title":"Energy disaggregation via Bayesian non-negative matrix factorization with sum-to-k constraint","year":2025,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Constraint (computer-aided design); Complex system; Factorization; Bayesian probability; Matrix (chemical analysis); Matrix decomposition; Bayesian network; Mathematics; Applied mathematics; Energy (signal processing); Mathematical optimization; Computer science; Algebra over a field; Algorithm; Artificial intelligence; Pure mathematics; Physics; Statistics; Quantum mechanics; Materials science","score_opus":0.04203839224597804,"score_gpt":0.33405096524878636,"score_spread":0.2920125730028083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406480091","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.0062196082,0.000017355705,0.990406,0.0021249568,0.0000387863,0.0001942882,0.0000034979093,0.000059308968,0.0009362371],"genre_scores_gemma":[0.8769172,0.000034102326,0.12264159,0.00031750675,0.00000966662,0.000015867265,0.0000018415531,0.0000051722254,0.000057040157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990176,0.000030494406,0.00039679187,0.00022739798,0.0001886996,0.00013904924],"domain_scores_gemma":[0.9990041,0.0001990382,0.00018518901,0.0002598844,0.0002906212,0.00006114274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031038307,0.000126049,0.00019055294,0.00019009694,0.000082915816,0.00013202893,0.0002657245,0.000054583445,0.0000063103707],"category_scores_gemma":[0.00008057644,0.000106026855,0.00003235016,0.0005086035,0.00010132915,0.00023989007,0.00008346636,0.000059224083,0.000002964313],"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.000006349036,0.00010476187,0.000018709023,0.00003584659,0.000016909531,7.4020244e-7,0.002646333,0.00021560937,0.0022069279,0.9127346,0.000047075086,0.08196611],"study_design_scores_gemma":[0.000010773175,0.00011939021,0.000022188653,0.00014327081,0.000004042426,0.000001275389,0.00028497106,0.14350374,0.44723034,0.40852025,0.00005882518,0.00010092005],"about_ca_topic_score_codex":0.00005713018,"about_ca_topic_score_gemma":0.000056705652,"teacher_disagreement_score":0.8706976,"about_ca_system_score_codex":0.0000069697103,"about_ca_system_score_gemma":0.0000571892,"threshold_uncertainty_score":0.43236497},"labels":[],"label_agreement":null},{"id":"W4406809796","doi":"10.1007/s10472-024-09963-5","title":"Filters-based revision","year":2025,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Complex system; Computer science; Mathematics; Artificial intelligence","score_opus":0.11128949519799006,"score_gpt":0.3573216929110658,"score_spread":0.24603219771307575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406809796","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.011688613,0.0006391388,0.97951776,0.001735237,0.00014220558,0.00010967924,0.0000016800541,0.00004144543,0.0061242636],"genre_scores_gemma":[0.9476937,0.00021389844,0.051321078,0.0005388552,0.000025101854,0.000005982392,7.9608304e-7,0.000004307589,0.0001962995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991195,0.000021966485,0.00035804178,0.00020626649,0.00012998679,0.00016424691],"domain_scores_gemma":[0.99905115,0.0002675004,0.00011665927,0.00034780207,0.00016833961,0.000048565005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049063197,0.00010319297,0.00019664844,0.000105339015,0.000089287576,0.00009565976,0.00043052906,0.000047394697,0.000023885905],"category_scores_gemma":[0.00026709863,0.00008330296,0.00007059673,0.00029811135,0.00008763076,0.00010538829,0.00013819567,0.000064491185,0.000024956695],"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.0000023702014,0.00014139076,0.000014190256,0.00012289402,0.000007079163,0.0000015306085,0.00043820508,0.000033579723,0.0003990487,0.8287926,0.0006855202,0.16936159],"study_design_scores_gemma":[0.000015893012,0.00010216072,0.000022557686,0.00033796518,0.0000064998917,0.0000010710662,0.00015790186,0.23459087,0.21827146,0.54375017,0.002609495,0.00013397067],"about_ca_topic_score_codex":0.0000077638515,"about_ca_topic_score_gemma":0.00000398376,"teacher_disagreement_score":0.93600506,"about_ca_system_score_codex":0.0000027691322,"about_ca_system_score_gemma":0.000043836557,"threshold_uncertainty_score":0.33969963},"labels":[],"label_agreement":null},{"id":"W44082233","doi":"10.1007/s10472-012-9301-2","title":"On the algebra of regular sets","year":2012,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Isomorphism (crystallography); Algebraic number; Topological space; Completeness (order theory); Set (abstract data type); Algebra over a field; Algebraic structure; Representation (politics); Discrete mathematics; Space (punctuation); Pure mathematics; Computer science","score_opus":0.12480186063662461,"score_gpt":0.3278880560106488,"score_spread":0.20308619537402417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44082233","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.1802482,0.00009232526,0.81572825,0.00246551,0.00009499359,0.00010519436,0.0000022237255,0.000014676644,0.0012486384],"genre_scores_gemma":[0.9824838,0.00006808755,0.01724345,0.0001787191,0.0000105907175,0.0000019411154,2.3826615e-7,0.000002575255,0.0000106157395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939084,0.000021153204,0.00026049934,0.00007177084,0.00014899974,0.00010672696],"domain_scores_gemma":[0.999219,0.00028722652,0.0001455793,0.00022470365,0.000085051994,0.000038417664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049594475,0.00005888459,0.000099087556,0.000043591896,0.000049379454,0.000022596221,0.00017377728,0.000024650473,0.00005670186],"category_scores_gemma":[0.00016146073,0.000040088722,0.000036940128,0.00013619663,0.00009321871,0.00012437928,0.00004862705,0.000042009833,0.000011400506],"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":[9.872704e-7,0.00007497272,0.000020177853,0.000014454006,0.0000060198613,7.767676e-8,0.0011542811,0.00007897752,0.00040392418,0.9320732,0.00009073697,0.06608223],"study_design_scores_gemma":[0.0000075765383,0.000070888585,0.00020200986,0.00007408382,0.0000044702338,0.0000041585554,0.0005821618,0.08488429,0.30640623,0.60757905,0.00009227835,0.00009276993],"about_ca_topic_score_codex":0.0000034431446,"about_ca_topic_score_gemma":0.0000010595242,"teacher_disagreement_score":0.8022356,"about_ca_system_score_codex":0.0000011650184,"about_ca_system_score_gemma":0.000008256639,"threshold_uncertainty_score":0.16347706},"labels":[],"label_agreement":null}]}