{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064441144,0.000644601,0.9010758,0.0012622157,0.00015158848,0.00039657616,0.00024374768,0.0002661958,0.031518172],"genre_scores_gemma":[0.55694205,0.00089120737,0.42006043,0.00048726625,0.00016628674,0.0006545607,0.0005906401,0.00032920315,0.019878358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946433,0.00018131488,0.000022143808,0.00009602059,0.00013597793,0.00010020563],"domain_scores_gemma":[0.9984871,0.0010600266,0.00007026841,0.000088618595,0.00012089495,0.00017310005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009001438,0.001189097,0.0015931574,0.0014796582,0.00087740936,0.0016509866,0.0018901917,0.0028550131,0.010416323],"category_scores_gemma":[0.005398404,0.0007974097,0.00091909425,0.0013090027,0.001120213,0.0023772935,0.0022294577,0.0016873971,0.00068219367],"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.0004674218,0.00040180195,0.0006390669,0.00043317603,0.000107454536,0.00026606058,0.00031289383,0.4304953,0.006845746,0.3771461,0.018618764,0.1642662],"study_design_scores_gemma":[0.00008048967,0.000111660855,0.0001214249,0.000039923823,0.00002550703,0.0000603221,0.00005830316,0.86956847,0.0006637441,0.12626699,0.0029861894,0.000016845972],"about_ca_topic_score_codex":0.0037871301,"about_ca_topic_score_gemma":0.0034282387,"teacher_disagreement_score":0.010416323,"about_ca_system_score_codex":0.0012741842,"about_ca_system_score_gemma":0.0016341943,"threshold_uncertainty_score":0.034846067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02831672,0.001338108,0.95873225,0.0011563253,0.00019639176,0.00005862534,0.00008370715,0.00066454255,0.0094533665],"genre_scores_gemma":[0.6833176,0.0021602293,0.3054513,0.000811229,0.0008257283,0.0001523752,0.00017178713,0.0003387543,0.0067709167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740595,0.00095505215,0.00020136625,0.00061470864,0.00062498945,0.00019790545],"domain_scores_gemma":[0.98241997,0.012982357,0.00077382074,0.002520415,0.0009766892,0.0003267782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054197647,0.0007694898,0.0019256144,0.0026152572,0.0014733206,0.0020547856,0.0018962403,0.0016596897,0.0032999136],"category_scores_gemma":[0.017257879,0.00070011604,0.0035219823,0.0029509498,0.0056630624,0.007922111,0.0036319362,0.006021081,0.00038953312],"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.00008955606,0.00004115218,0.00075507245,0.00010228774,0.000036532736,0.00019101302,0.00036325245,0.017674861,0.0014619444,0.94194883,0.00078026345,0.036555428],"study_design_scores_gemma":[0.000012385207,0.000028703931,0.00019368884,0.000023993076,0.00002860531,0.00010213822,0.000028298806,0.088200316,0.0009592925,0.9081808,0.0022204227,0.000021412765],"about_ca_topic_score_codex":0.0031163474,"about_ca_topic_score_gemma":0.0020975221,"teacher_disagreement_score":0.0054197647,"about_ca_system_score_codex":0.0020943298,"about_ca_system_score_gemma":0.0013198352,"threshold_uncertainty_score":0.0286628},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006300957,0.00055246206,0.9684623,0.0005267986,0.00035540937,0.0002512608,0.0017169054,0.013053091,0.008780831],"genre_scores_gemma":[0.05821055,0.0007679441,0.9161724,0.00033292262,0.00022438848,0.0004811564,0.0038024925,0.0048605967,0.015147573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99714774,0.00054784777,0.0007310076,0.00033355298,0.0010765147,0.00016335503],"domain_scores_gemma":[0.9916859,0.002621176,0.00041200206,0.003929396,0.001104714,0.00024674923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029611152,0.0012549732,0.0011251812,0.002710571,0.0011153064,0.0061235474,0.0034938778,0.0017023627,0.020848287],"category_scores_gemma":[0.012454109,0.0016474169,0.0029910894,0.004160005,0.001471547,0.009018907,0.0037840265,0.0039058048,0.007775123],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005168679,0.00018949201,0.0006810301,0.0006963958,0.00014296148,0.00046271176,0.0009263599,0.0050910385,0.010538213,0.49786788,0.03310741,0.4497797],"study_design_scores_gemma":[0.00019874764,0.00017597104,0.00042179192,0.0004125549,0.00016252064,0.0008781476,0.0002690582,0.056929562,0.037921924,0.62005204,0.28239065,0.00018705492],"about_ca_topic_score_codex":0.0009348646,"about_ca_topic_score_gemma":0.0018160406,"teacher_disagreement_score":0.020848287,"about_ca_system_score_codex":0.00093237875,"about_ca_system_score_gemma":0.0012295868,"threshold_uncertainty_score":0.06974441},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07910758,0.0064111827,0.8565843,0.0070152935,0.0006267277,0.00017643678,0.001159217,0.002006711,0.046912577],"genre_scores_gemma":[0.7052689,0.0031392695,0.2659493,0.0007177302,0.00040132191,0.0001587109,0.0010383942,0.0003827759,0.022943608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687946,0.0009887995,0.00038433375,0.0004891655,0.0009679507,0.00029032942],"domain_scores_gemma":[0.98301816,0.012029054,0.00091528095,0.0025077395,0.0012168434,0.00031292366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004396267,0.0005232742,0.0011529773,0.0018528452,0.0019386534,0.0059732026,0.0026344352,0.0018695927,0.008712645],"category_scores_gemma":[0.023676815,0.0010160587,0.0014920748,0.0028697583,0.004417162,0.01006126,0.0024824834,0.0034027954,0.0010774964],"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.00007553552,0.00002461478,0.00030059725,0.00008473966,0.000017845561,0.00013086876,0.0003335098,0.007459843,0.00040329527,0.9672094,0.0030473727,0.02091252],"study_design_scores_gemma":[0.00001977441,0.000008024259,0.0000502249,0.000020119995,0.000016711318,0.00008853651,0.000076724624,0.012651037,0.00054345705,0.9801035,0.006409168,0.000012542389],"about_ca_topic_score_codex":0.0034048334,"about_ca_topic_score_gemma":0.0033249424,"teacher_disagreement_score":0.008712645,"about_ca_system_score_codex":0.0027924983,"about_ca_system_score_gemma":0.0015495701,"threshold_uncertainty_score":0.02914673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034363277,0.00030203568,0.93636024,0.0011900214,0.00012347018,0.00013070408,0.0002751682,0.0006211067,0.026633987],"genre_scores_gemma":[0.5020003,0.0006541316,0.46426514,0.0004391257,0.00030330778,0.0004101131,0.0006994082,0.00047993832,0.030748645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716276,0.0010075221,0.0001608221,0.00037634387,0.0009317541,0.0003608552],"domain_scores_gemma":[0.9935389,0.0045960485,0.00033358452,0.0005972465,0.0006910931,0.00024306707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035731767,0.0010268487,0.00081606786,0.0015496992,0.0008483766,0.0034373165,0.0020968586,0.001340503,0.007340689],"category_scores_gemma":[0.016343057,0.0007085179,0.0009776661,0.0025676726,0.0023260985,0.007843645,0.0028655708,0.003422974,0.0008112044],"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.000109905544,0.00008244186,0.00030917246,0.000104110375,0.000036382182,0.00009134083,0.00016787882,0.024164034,0.0010580985,0.92912614,0.0026297783,0.042120706],"study_design_scores_gemma":[0.000034492517,0.000018315519,0.00006918813,0.00002481057,0.000028327184,0.000034490608,0.00003451624,0.10446663,0.0012135643,0.889397,0.0046644486,0.000014155889],"about_ca_topic_score_codex":0.0027703347,"about_ca_topic_score_gemma":0.0042554075,"teacher_disagreement_score":0.007340689,"about_ca_system_score_codex":0.0016920721,"about_ca_system_score_gemma":0.001385224,"threshold_uncertainty_score":0.024557114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14427109,0.010865338,0.83012974,0.0046193097,0.00031021822,0.000806206,0.00031565837,0.00042004118,0.00826235],"genre_scores_gemma":[0.62186116,0.0011628241,0.37290654,0.000664536,0.00022325669,0.0010799681,0.00045730599,0.00033083215,0.0013135559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.6250473,0.34257764,0.009535678,0.005246369,0.01632258,0.0012704576],"domain_scores_gemma":[0.11286261,0.86601686,0.0049749184,0.010236404,0.0047664824,0.0011427013],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.28266767,0.0026849268,0.0043227524,0.0052337795,0.0016766886,0.0074362596,0.0056075654,0.00844013,0.00410611],"category_scores_gemma":[0.6881793,0.0027062949,0.003018905,0.0043036873,0.0066814325,0.012280306,0.0056917276,0.006778096,0.0005169469],"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.006226404,0.0008949479,0.018868035,0.0018651506,0.0022299534,0.00021500504,0.001353239,0.5641229,0.00084860704,0.2096616,0.0035534326,0.19016074],"study_design_scores_gemma":[0.0009861911,0.0018458259,0.0026032294,0.00042617435,0.00048018014,0.00027290263,0.00022081702,0.8165006,0.00080910715,0.17393939,0.0017908405,0.00012474235],"about_ca_topic_score_codex":0.0016523352,"about_ca_topic_score_gemma":0.0018069234,"teacher_disagreement_score":0.28266767,"about_ca_system_score_codex":0.0049952595,"about_ca_system_score_gemma":0.0040750774,"threshold_uncertainty_score":0.8845985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005294488,0.00081769517,0.9504388,0.0020067971,0.00029921182,0.0001597581,0.00041182182,0.0009461822,0.03962526],"genre_scores_gemma":[0.29423293,0.0013371716,0.67857474,0.00092516706,0.0004109607,0.00036371136,0.000827289,0.00028489638,0.023043174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973579,0.0007562794,0.0002602072,0.0004368644,0.0009255478,0.00026308346],"domain_scores_gemma":[0.9976441,0.0012550234,0.00009123892,0.0003911182,0.0003883716,0.00023006955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032688766,0.00079030904,0.0012293824,0.0019090315,0.0021333394,0.00719451,0.0033391628,0.0018814382,0.011040347],"category_scores_gemma":[0.0049851686,0.0011183231,0.0025015124,0.0020847565,0.0041294377,0.009975867,0.0044394326,0.0042108227,0.0024043224],"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.000020412288,0.000029491519,0.000053803324,0.000036687914,0.000010152494,0.00009881648,0.00016689324,0.001955798,0.00035907954,0.9844215,0.0015172308,0.01133015],"study_design_scores_gemma":[0.00004163173,0.000013588556,0.00003705544,0.000026403244,0.000031611788,0.00011970167,0.00005088563,0.025345122,0.0006685062,0.95361274,0.02002849,0.000024297959],"about_ca_topic_score_codex":0.0029408939,"about_ca_topic_score_gemma":0.002429647,"teacher_disagreement_score":0.011040347,"about_ca_system_score_codex":0.0020905333,"about_ca_system_score_gemma":0.0024764554,"threshold_uncertainty_score":0.03693366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3226745,0.00020666668,0.63547766,0.0024890762,0.0001321542,0.0003428061,0.0015075667,0.0014843637,0.035685074],"genre_scores_gemma":[0.9304809,0.00011077576,0.06271195,0.00023761675,0.00010529288,0.00015106477,0.0011170259,0.00030171507,0.004783765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979231,0.00054131384,0.00017062071,0.00047662275,0.00051436416,0.00037400474],"domain_scores_gemma":[0.9869183,0.008797992,0.0012295513,0.0015222819,0.0010263877,0.0005055191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020526855,0.0008448553,0.0011534233,0.0017534666,0.0014911026,0.0045984117,0.0024055382,0.001429998,0.008885084],"category_scores_gemma":[0.013992122,0.0010047624,0.00162704,0.0019564359,0.0036112438,0.009996331,0.0028277377,0.0041888505,0.0005556009],"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.00022207103,0.00010879069,0.0015250425,0.00020221321,0.00004065281,0.00035145704,0.0007610123,0.034278445,0.0030912608,0.94364184,0.002611136,0.013166042],"study_design_scores_gemma":[0.000030184581,0.000034510886,0.0002693362,0.000031251067,0.000029573166,0.00015570495,0.00023710584,0.1537082,0.0021540476,0.84160197,0.0017216733,0.000026398258],"about_ca_topic_score_codex":0.0021173086,"about_ca_topic_score_gemma":0.0029221547,"teacher_disagreement_score":0.008885084,"about_ca_system_score_codex":0.0018375228,"about_ca_system_score_gemma":0.0012100413,"threshold_uncertainty_score":0.029723585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032674015,0.00071392435,0.959201,0.00029776822,0.00009291397,0.00058083254,0.0023902312,0.002676859,0.0013723122],"genre_scores_gemma":[0.08069313,0.00026554574,0.90990907,0.00011207921,0.000090510206,0.0005303004,0.0064091505,0.00020044406,0.0017897753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755377,0.00039818737,0.00034980994,0.00072114356,0.0008071993,0.00016984339],"domain_scores_gemma":[0.98792076,0.00831047,0.00058227335,0.001523951,0.0012931316,0.000369428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00316399,0.001596178,0.0031611188,0.0073285517,0.0023688022,0.0032077162,0.0037106974,0.0020828876,0.008268352],"category_scores_gemma":[0.014582873,0.0010399865,0.0020562224,0.009417272,0.0012846354,0.007573527,0.0034718125,0.0023192402,0.0020626846],"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.0016539335,0.0007660627,0.007227093,0.00073776324,0.00034925828,0.00058162434,0.0003290521,0.041906387,0.0069163535,0.04889,0.016624754,0.8740177],"study_design_scores_gemma":[0.0004369705,0.0005699164,0.0017576664,0.000109366876,0.00022427662,0.0009178798,0.0002106924,0.7176883,0.006495764,0.26061398,0.01090471,0.00007044649],"about_ca_topic_score_codex":0.0019786987,"about_ca_topic_score_gemma":0.004434176,"teacher_disagreement_score":0.008268352,"about_ca_system_score_codex":0.001049619,"about_ca_system_score_gemma":0.004323725,"threshold_uncertainty_score":0.02766043},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011910646,0.0071753333,0.003279976,0.9294955,0.0049821865,0.000011807744,0.00015526057,0.000043760858,0.05366513],"genre_scores_gemma":[0.24184175,0.0136912,0.0072658574,0.60486954,0.061715454,0.00018449788,0.00015737746,0.0001450908,0.07012914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644357,0.001854862,0.00013947352,0.00051186426,0.0007971232,0.00025308432],"domain_scores_gemma":[0.9802924,0.015341092,0.0005617573,0.00093784305,0.002248625,0.0006183536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054866774,0.0006094595,0.0008578721,0.0012118234,0.0032462042,0.005193843,0.0024579756,0.012990712,0.024027864],"category_scores_gemma":[0.015234465,0.00033281615,0.00078115537,0.00082608877,0.019116145,0.012623213,0.002186683,0.011631727,0.004604925],"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.00004431196,0.000010502995,0.00008031493,0.000059512426,0.000012141153,0.00009916917,0.00074302405,0.00019174312,0.00006944741,0.9110723,0.08500788,0.0026096234],"study_design_scores_gemma":[0.000027669685,0.000010942992,0.00025790575,0.00011087143,0.0000072520015,0.0000728,0.0006637349,0.00026901308,0.00012284656,0.8244627,0.17397022,0.00002410538],"about_ca_topic_score_codex":0.0057549453,"about_ca_topic_score_gemma":0.0041574873,"teacher_disagreement_score":0.024027864,"about_ca_system_score_codex":0.0026097416,"about_ca_system_score_gemma":0.0012846636,"threshold_uncertainty_score":0.080381155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11679402,0.0018190561,0.857752,0.008543577,0.0002163511,0.00017396257,0.0028303668,0.00076787587,0.011102802],"genre_scores_gemma":[0.8684601,0.0023471755,0.09384616,0.0008266416,0.0005900725,0.0005086695,0.0018924893,0.00018479588,0.031343836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883324,0.0005245878,0.00006998027,0.00029584116,0.00012398639,0.00015243288],"domain_scores_gemma":[0.9837314,0.013629851,0.000805851,0.00062121183,0.00067951484,0.00053224247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002597048,0.0010878998,0.0022650429,0.0022903571,0.0011787399,0.0031467795,0.0035823889,0.005187995,0.009838009],"category_scores_gemma":[0.018411176,0.0010492941,0.0013545745,0.0029336223,0.0020845742,0.008689854,0.0016535833,0.0028719297,0.0013911512],"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.00026771904,0.00026080653,0.0030770593,0.00020806043,0.00014796996,0.00028239563,0.00046329643,0.53265077,0.0007193109,0.42595622,0.0074932654,0.028473172],"study_design_scores_gemma":[0.000051021176,0.000027047801,0.00017154968,0.000015729416,0.000027953829,0.000044169086,0.000029235582,0.85280776,0.000082180624,0.14585403,0.0008738602,0.000015362757],"about_ca_topic_score_codex":0.014426704,"about_ca_topic_score_gemma":0.012301151,"teacher_disagreement_score":0.014426704,"about_ca_system_score_codex":0.0026991693,"about_ca_system_score_gemma":0.0014279092,"threshold_uncertainty_score":0.03291142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017266745,0.0026207208,0.9755089,0.0004950186,0.00012584619,0.0002986275,0.0013676293,0.001264158,0.0010522984],"genre_scores_gemma":[0.11133518,0.0013822182,0.8837466,0.00012810578,0.000110084766,0.0003995673,0.0020846762,0.00010788307,0.0007056603],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643254,0.00095360295,0.0003573098,0.00059035345,0.0015181757,0.00014802928],"domain_scores_gemma":[0.9954621,0.0028075976,0.00044680526,0.0005021679,0.0005970562,0.00018424638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003126575,0.00089118833,0.0017223574,0.005369038,0.0010793447,0.003708236,0.00238328,0.00087667396,0.0023581928],"category_scores_gemma":[0.014797346,0.00074627815,0.002420338,0.006708787,0.0014140072,0.00447006,0.002922288,0.0022722278,0.0012481986],"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.0004888499,0.0004562665,0.007425725,0.003234629,0.0007514526,0.001011927,0.0017188082,0.044131406,0.010291735,0.14692783,0.015700521,0.76786083],"study_design_scores_gemma":[0.00014120917,0.00019116864,0.0021408289,0.00043864455,0.0004794136,0.0013280202,0.0011496203,0.6186323,0.011129537,0.34084234,0.02338933,0.00013758661],"about_ca_topic_score_codex":0.0018765008,"about_ca_topic_score_gemma":0.0018765089,"teacher_disagreement_score":0.005369038,"about_ca_system_score_codex":0.00076204876,"about_ca_system_score_gemma":0.0023575255,"threshold_uncertainty_score":0.016535103},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0714914,0.0028021396,0.88791394,0.0070292335,0.0005519495,0.00011227247,0.0009967886,0.002245925,0.026856309],"genre_scores_gemma":[0.7860084,0.0027448556,0.18964083,0.0019024848,0.0018539988,0.00024248585,0.0022031085,0.0009042048,0.014499667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9899239,0.002336141,0.0010822525,0.0017614275,0.0041860417,0.0007103049],"domain_scores_gemma":[0.97356546,0.016474744,0.0012049623,0.005421446,0.002720073,0.0006134396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006116534,0.0008869358,0.0028392517,0.0026458397,0.0018162938,0.008839681,0.0027912373,0.0027544287,0.0060045524],"category_scores_gemma":[0.0315107,0.0013861166,0.0019319729,0.0045935214,0.005744459,0.03658773,0.0057389713,0.006387086,0.0014155088],"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.00028536483,0.000052188923,0.0004583461,0.00011855696,0.00003856716,0.00008503702,0.00032644966,0.0053049526,0.00068516674,0.96454287,0.0031139916,0.02498848],"study_design_scores_gemma":[0.000026052967,0.00002000753,0.000059742793,0.000013010213,0.00003095959,0.00011555648,0.000056449204,0.014749676,0.00054372265,0.9813291,0.0030438649,0.0000119183305],"about_ca_topic_score_codex":0.0015853944,"about_ca_topic_score_gemma":0.0008791793,"teacher_disagreement_score":0.008839681,"about_ca_system_score_codex":0.0025036228,"about_ca_system_score_gemma":0.002160036,"threshold_uncertainty_score":0.03234774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060349703,0.0020374777,0.9849871,0.0005960774,0.00010746961,0.000014989199,0.000043879016,0.00003669797,0.0061413036],"genre_scores_gemma":[0.5357829,0.0077331723,0.43656778,0.0005911881,0.0014806881,0.00021826604,0.00031111273,0.00019430366,0.017120646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978818,0.0009345911,0.000113446156,0.00038765185,0.0005775475,0.00010487622],"domain_scores_gemma":[0.9957623,0.002445345,0.00039847125,0.0005181085,0.00060781284,0.00026804753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026949123,0.0009613947,0.0018834199,0.00392492,0.0011794408,0.0047217878,0.0028253736,0.0017743838,0.0035344167],"category_scores_gemma":[0.0073776436,0.00096872094,0.002003706,0.0035323196,0.0044607273,0.007819122,0.0038601188,0.0037464385,0.0006505068],"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.000009174619,0.000009668811,0.00007601998,0.000056192883,0.00001923597,0.0000400002,0.00012631348,0.0072646085,0.00037454508,0.9864211,0.0004153823,0.0051877866],"study_design_scores_gemma":[0.0000066217276,0.000032089443,0.00010851526,0.00002081789,0.000016773745,0.000086358545,0.000055182565,0.06506259,0.00023345198,0.9293558,0.0050074104,0.000014407456],"about_ca_topic_score_codex":0.0010219782,"about_ca_topic_score_gemma":0.00054918387,"teacher_disagreement_score":0.0047217878,"about_ca_system_score_codex":0.0017720324,"about_ca_system_score_gemma":0.00057171524,"threshold_uncertainty_score":0.014252245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007345048,0.00024724938,0.9963625,0.00030016288,0.00004199351,0.000021062264,0.00004515053,0.000072711424,0.0021747616],"genre_scores_gemma":[0.22779143,0.0018374426,0.76131386,0.00048819845,0.00065652287,0.00067060906,0.00029651495,0.00015958208,0.0067859003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979773,0.00075662066,0.00021152859,0.00028177828,0.0006319002,0.00014081654],"domain_scores_gemma":[0.99615955,0.0023900256,0.0003651242,0.0004780024,0.00048129036,0.0001259852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041921195,0.0013904057,0.0011509999,0.0021218592,0.0014235515,0.0036135297,0.0033374084,0.0022125263,0.004070621],"category_scores_gemma":[0.0075299237,0.0010275602,0.002528297,0.0015594118,0.0054409597,0.0063631665,0.0024830785,0.0042265872,0.0009586233],"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.000004555139,0.000007978995,0.000043683216,0.000032777898,0.00000939021,0.00004859269,0.00007907377,0.016617006,0.00025039425,0.979603,0.00030623842,0.0029973474],"study_design_scores_gemma":[0.000014561114,0.000017476186,0.000039734612,0.000035059384,0.000018989678,0.000077742,0.00003111948,0.10965158,0.00031807597,0.88144344,0.008333137,0.00001916159],"about_ca_topic_score_codex":0.002776689,"about_ca_topic_score_gemma":0.0022103176,"teacher_disagreement_score":0.0041921195,"about_ca_system_score_codex":0.001731556,"about_ca_system_score_gemma":0.0019114383,"threshold_uncertainty_score":0.022170305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07060285,0.00096019683,0.8733456,0.0020764011,0.00035761806,0.00015305895,0.00037492102,0.00071822724,0.051411033],"genre_scores_gemma":[0.82264555,0.000742665,0.16457726,0.00027712737,0.00019097586,0.00019180324,0.00036205963,0.00016905266,0.010843562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970546,0.0012740656,0.00022447314,0.00037708457,0.0005918785,0.00047786094],"domain_scores_gemma":[0.9980236,0.0010125068,0.00018317516,0.0003105996,0.0002625355,0.00020747619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003294249,0.0010986782,0.0014536357,0.00155597,0.002650348,0.008074849,0.0025818974,0.0023758952,0.008813257],"category_scores_gemma":[0.0071977186,0.00092298404,0.0022145177,0.0019040166,0.0040633027,0.012171616,0.004176076,0.0029303841,0.0012371683],"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.000038700597,0.000020197635,0.00008753495,0.00002155151,0.000013339284,0.000081723614,0.0002310287,0.0077871834,0.00027882532,0.98832244,0.0003503128,0.002767158],"study_design_scores_gemma":[0.00001707056,0.000007944478,0.000016910277,0.000009879946,0.000012981483,0.00002298504,0.00006066827,0.032846816,0.00024131054,0.96471,0.0020421008,0.000011307328],"about_ca_topic_score_codex":0.0043120175,"about_ca_topic_score_gemma":0.0044120066,"teacher_disagreement_score":0.008813257,"about_ca_system_score_codex":0.0025743013,"about_ca_system_score_gemma":0.0019593588,"threshold_uncertainty_score":0.029483318},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22915713,0.007704872,0.7175262,0.018117487,0.0017158496,0.00032179497,0.0012263044,0.002636906,0.021593448],"genre_scores_gemma":[0.9143863,0.0018115727,0.07397972,0.0023036923,0.000997192,0.00011834614,0.00062723743,0.0007728237,0.0050031506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938753,0.0024936267,0.000515637,0.0014087062,0.0014383823,0.00026840923],"domain_scores_gemma":[0.9248366,0.037952878,0.0046996167,0.021343393,0.0093410555,0.001826508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018590394,0.0008303045,0.0015940913,0.0015495516,0.0006743521,0.0043726563,0.0021827363,0.002055743,0.0058354195],"category_scores_gemma":[0.12572448,0.00062949304,0.00078594824,0.0021622262,0.0029188388,0.015975043,0.0037571252,0.002859903,0.0015450432],"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.0023090383,0.00076931145,0.105106436,0.0009296527,0.0012474611,0.0003843077,0.0012252121,0.06967559,0.020444565,0.0783633,0.016757721,0.7027873],"study_design_scores_gemma":[0.00030607585,0.000975353,0.07785162,0.0002871297,0.0006125871,0.0010138107,0.0010930861,0.45089275,0.012326221,0.42392385,0.03047326,0.00024426568],"about_ca_topic_score_codex":0.0018848116,"about_ca_topic_score_gemma":0.0011335036,"teacher_disagreement_score":0.018590394,"about_ca_system_score_codex":0.0010019066,"about_ca_system_score_gemma":0.001147172,"threshold_uncertainty_score":0.09831655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016833972,0.000661072,0.9103722,0.006711862,0.0006984546,0.00014594923,0.0005531576,0.0009708023,0.06305258],"genre_scores_gemma":[0.45233998,0.0008110879,0.5278555,0.0027688458,0.0012256409,0.00025588705,0.0009842907,0.00072340306,0.013035338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949699,0.002088432,0.00045732304,0.000966544,0.0011551018,0.00036260093],"domain_scores_gemma":[0.9908743,0.0050478196,0.0002966057,0.0018949527,0.0016043285,0.00028203375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006825057,0.000986566,0.001533144,0.0032764957,0.0021806136,0.007282273,0.0048652836,0.004703644,0.0135325445],"category_scores_gemma":[0.018568402,0.0014630432,0.0033064866,0.0020910932,0.007857525,0.017187692,0.0047702645,0.0062113353,0.0018374466],"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.000046014527,0.000021807815,0.00015177738,0.000037899426,0.000019806936,0.00014633808,0.0003659719,0.0016184732,0.00047383842,0.98767775,0.0018228083,0.0076175216],"study_design_scores_gemma":[0.00003139589,0.000010058732,0.00008205593,0.000027435824,0.00002949411,0.00008584925,0.00005632618,0.013571587,0.0003764943,0.9807118,0.005001126,0.000016409307],"about_ca_topic_score_codex":0.0034237937,"about_ca_topic_score_gemma":0.0033965106,"teacher_disagreement_score":0.0135325445,"about_ca_system_score_codex":0.0020351813,"about_ca_system_score_gemma":0.0014525828,"threshold_uncertainty_score":0.04527086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1022547,0.0042076893,0.8858109,0.0024455113,0.00014451316,0.0002881944,0.0021953485,0.00089779095,0.0017553192],"genre_scores_gemma":[0.41584834,0.0024929678,0.5742585,0.00032434353,0.00027833684,0.00024025551,0.005362188,0.00006992421,0.0011250969],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906826,0.0030132013,0.0011412792,0.0015537041,0.0032773872,0.0003317935],"domain_scores_gemma":[0.9652043,0.026969157,0.0020457346,0.003594158,0.0016877108,0.00049889256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009288689,0.0006804811,0.0023895623,0.0062188637,0.0013053654,0.0056693624,0.0026463028,0.0016270446,0.0015133605],"category_scores_gemma":[0.041220453,0.001007955,0.0025042885,0.0062267515,0.0016757566,0.012919105,0.0039033957,0.002992913,0.00057462347],"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.0011755101,0.0009431978,0.02832319,0.0024264571,0.0012332876,0.0017366619,0.0023833734,0.0892728,0.007816593,0.14701372,0.012929084,0.7047461],"study_design_scores_gemma":[0.00009464004,0.00014242518,0.0032061734,0.00023516592,0.00034478586,0.0007046468,0.00088828465,0.5700468,0.0071162465,0.4090618,0.008087688,0.00007128404],"about_ca_topic_score_codex":0.0013356482,"about_ca_topic_score_gemma":0.0018801991,"teacher_disagreement_score":0.009288689,"about_ca_system_score_codex":0.001210265,"about_ca_system_score_gemma":0.0022725002,"threshold_uncertainty_score":0.049123824},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00116449,0.024897223,0.9245377,0.008800152,0.0010566936,0.00013824606,0.0004126592,0.0012739461,0.037718907],"genre_scores_gemma":[0.04744326,0.031232057,0.89724106,0.0025704065,0.0033924337,0.0005668033,0.00074726774,0.0006333915,0.016173318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972409,0.0008718772,0.00042351437,0.00039740346,0.00083121465,0.00023505541],"domain_scores_gemma":[0.9973966,0.0012176342,0.00020410046,0.0005529275,0.0004186983,0.00021011192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052237296,0.0013287802,0.0016234663,0.004580708,0.0035986125,0.012195241,0.004188395,0.0037932736,0.009829262],"category_scores_gemma":[0.0051814453,0.0014358001,0.002791317,0.005900462,0.008426696,0.022852803,0.004397695,0.00772131,0.004352795],"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.000007016758,0.000012822075,0.000042036118,0.00009942222,0.0000048969305,0.000033646502,0.000119259574,0.00047477806,0.00013146845,0.98187596,0.004048367,0.01315032],"study_design_scores_gemma":[0.000009293132,0.00000993256,0.00005447499,0.00012340795,0.000010751197,0.00014716975,0.000068665184,0.0032414775,0.00022646603,0.87816924,0.1179188,0.0000203932],"about_ca_topic_score_codex":0.003096114,"about_ca_topic_score_gemma":0.0038201204,"teacher_disagreement_score":0.012195241,"about_ca_system_score_codex":0.0033325679,"about_ca_system_score_gemma":0.003489209,"threshold_uncertainty_score":0.032882154},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010352702,0.00012976024,0.9848161,0.00016074952,0.000013914385,0.00005366211,0.00006606951,0.00019485004,0.004212273],"genre_scores_gemma":[0.3437843,0.00028493986,0.6483477,0.00011244399,0.000040586172,0.0003260376,0.00032539878,0.00018916355,0.0065895463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954885,0.00011238056,0.00001960463,0.00011459161,0.00012309477,0.00008146013],"domain_scores_gemma":[0.9991105,0.0005753885,0.000071479095,0.00009459007,0.00009897,0.000049033013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064097455,0.0008528791,0.001294709,0.0011390081,0.0009675453,0.0014443549,0.002312227,0.0016882303,0.0055837687],"category_scores_gemma":[0.0028900593,0.0008005564,0.0010290287,0.0012593685,0.001068573,0.0018349331,0.00273578,0.001160623,0.000604112],"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.00012002202,0.000069540176,0.0005564302,0.00014731768,0.00003675486,0.00009944882,0.00011609705,0.86599815,0.003096568,0.06760718,0.0021213796,0.060031056],"study_design_scores_gemma":[0.000012687896,0.000022431732,0.00009834502,0.000009202855,0.000008444565,0.0000356109,0.000019463803,0.9795369,0.00051728834,0.018979685,0.00075366214,0.0000062888516],"about_ca_topic_score_codex":0.004446792,"about_ca_topic_score_gemma":0.00555723,"teacher_disagreement_score":0.0055837687,"about_ca_system_score_codex":0.0010935726,"about_ca_system_score_gemma":0.0011371067,"threshold_uncertainty_score":0.01867956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06481366,0.0014160719,0.9253891,0.00039816255,0.00013652774,0.0002933314,0.0020374611,0.0021208923,0.003394758],"genre_scores_gemma":[0.2712791,0.0008009464,0.7211826,0.00010991424,0.00006549723,0.00022500627,0.0040075784,0.00012794771,0.0022015388],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882823,0.0002342837,0.00015161182,0.00026007637,0.0004448956,0.00008095293],"domain_scores_gemma":[0.9984432,0.00059570343,0.00012492863,0.00035448011,0.00042303052,0.00005863054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007225027,0.0006528657,0.0012086055,0.0032976482,0.0005264565,0.0016240375,0.0009880348,0.00054617313,0.0024039748],"category_scores_gemma":[0.004051593,0.0003798092,0.0012722505,0.0037074483,0.0005650818,0.002094822,0.0012851525,0.0009324885,0.0010290149],"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.0005335062,0.00020124367,0.004686992,0.0011919457,0.00026109265,0.0014446344,0.00057288713,0.016353501,0.030364389,0.03883936,0.00985272,0.8956978],"study_design_scores_gemma":[0.00022539955,0.00031430222,0.0062084426,0.00030977844,0.0003672222,0.0034118828,0.00094860885,0.580459,0.040438086,0.3227992,0.044406947,0.00011106502],"about_ca_topic_score_codex":0.001262491,"about_ca_topic_score_gemma":0.0018999804,"teacher_disagreement_score":0.0032976482,"about_ca_system_score_codex":0.0004007333,"about_ca_system_score_gemma":0.0012521805,"threshold_uncertainty_score":0.008042097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02136409,0.0027498088,0.9227747,0.0029374068,0.00083589513,0.0005764047,0.003675472,0.006476871,0.03860942],"genre_scores_gemma":[0.3253236,0.0020088707,0.6341829,0.001974383,0.0009446921,0.00076086435,0.00904828,0.0016974548,0.024059067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972127,0.0008219738,0.00041191647,0.00076493836,0.00055930583,0.0002291598],"domain_scores_gemma":[0.9884653,0.0075519676,0.0004901255,0.0023913581,0.0008598731,0.00024146953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003633079,0.0011201964,0.001156306,0.0037216344,0.0019461892,0.003662927,0.0033834197,0.0023963146,0.023090761],"category_scores_gemma":[0.030976275,0.0009863056,0.0030764255,0.0031919612,0.0028753416,0.014145449,0.003968336,0.0030497655,0.0039228736],"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.00037027863,0.0001594646,0.002090267,0.00081211346,0.00016852202,0.00063096546,0.0013007206,0.02107715,0.0020793506,0.7362029,0.039302718,0.19580567],"study_design_scores_gemma":[0.000049199545,0.000055072458,0.00030654238,0.00015517931,0.00007998809,0.00029115163,0.00018985535,0.0781356,0.000983414,0.89889145,0.020829042,0.00003339498],"about_ca_topic_score_codex":0.0050990344,"about_ca_topic_score_gemma":0.008966684,"teacher_disagreement_score":0.023090761,"about_ca_system_score_codex":0.0017152906,"about_ca_system_score_gemma":0.0014106426,"threshold_uncertainty_score":0.07724625},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015545734,0.0015084682,0.92183256,0.0104393205,0.0003666525,0.00011553451,0.00017852524,0.00085776363,0.049155384],"genre_scores_gemma":[0.6797531,0.0012456852,0.30629784,0.0019101753,0.00043266508,0.00040335552,0.00027952064,0.0006422176,0.009035412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99294126,0.003900056,0.0005749566,0.00076069415,0.001078127,0.00074496324],"domain_scores_gemma":[0.9889158,0.0069295284,0.00045044863,0.0023527963,0.00088719954,0.00046413127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006937534,0.0009849243,0.0014939985,0.0018410033,0.0032575023,0.00968957,0.0040184,0.004585908,0.010015821],"category_scores_gemma":[0.018174017,0.0013878194,0.002894607,0.0021031718,0.019541126,0.023874002,0.007935761,0.007842503,0.0013428977],"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.000020706124,0.000013311614,0.00006930496,0.00002472561,0.000007427728,0.000025456313,0.0003575596,0.0014522745,0.00006904707,0.99404764,0.00045795788,0.0034545672],"study_design_scores_gemma":[0.000014259958,0.0000081024,0.00003033002,0.000022814835,0.000008683806,0.000020101423,0.00009371279,0.005642075,0.00014902148,0.99131596,0.002685216,0.00000965409],"about_ca_topic_score_codex":0.0062685744,"about_ca_topic_score_gemma":0.0046615703,"teacher_disagreement_score":0.010015821,"about_ca_system_score_codex":0.004458337,"about_ca_system_score_gemma":0.0033004736,"threshold_uncertainty_score":0.03668964},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54688346,0.0028400212,0.39456716,0.018333958,0.00059346133,0.001138162,0.0013965137,0.0012934437,0.03295384],"genre_scores_gemma":[0.933326,0.00043627384,0.061176147,0.0005772969,0.00013917858,0.00042121322,0.00026802695,0.000112615264,0.0035432284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9885656,0.0071872566,0.0004072328,0.001819729,0.0011945894,0.0008255316],"domain_scores_gemma":[0.9555976,0.02997854,0.004421747,0.005396763,0.002833423,0.0017719578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015084292,0.0009884579,0.0016679689,0.00075078214,0.0022832854,0.0025669471,0.0023397661,0.002440289,0.008152199],"category_scores_gemma":[0.06629662,0.0007063659,0.00073577964,0.0011994581,0.0019566566,0.0035043894,0.0020355016,0.0019379708,0.0031985007],"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.005312143,0.0015728009,0.091282874,0.0022659719,0.00047876383,0.0008317963,0.0045576743,0.16949534,0.018778672,0.061625075,0.030731328,0.6130677],"study_design_scores_gemma":[0.0009560973,0.0014625031,0.08626467,0.0007964309,0.00034344906,0.0007793733,0.011490812,0.5782366,0.014913677,0.25517663,0.049181882,0.00039793662],"about_ca_topic_score_codex":0.005421855,"about_ca_topic_score_gemma":0.005851977,"teacher_disagreement_score":0.015084292,"about_ca_system_score_codex":0.0021824797,"about_ca_system_score_gemma":0.0029209377,"threshold_uncertainty_score":0.07977432},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112754375,0.0005429235,0.8783686,0.0011571713,0.00011197056,0.00022189274,0.0004069894,0.0037081663,0.002727892],"genre_scores_gemma":[0.79873216,0.00011505952,0.19729991,0.0002363459,0.00006816259,0.0000859258,0.00065783254,0.0001944718,0.002610141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673456,0.0010696459,0.00021297578,0.0004872122,0.0011158985,0.00037967126],"domain_scores_gemma":[0.97986287,0.016507454,0.00063439325,0.0015442235,0.0010975078,0.00035356227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002407063,0.0009791021,0.0018222558,0.0022850512,0.0008662963,0.002028891,0.0022047907,0.0014190625,0.004410488],"category_scores_gemma":[0.018425487,0.0006076643,0.0008172644,0.0010798816,0.0014343979,0.0025356733,0.0030455652,0.0015940176,0.0007243655],"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.0044972873,0.00055707776,0.009337553,0.0006316933,0.00017674228,0.0015312417,0.000568077,0.26813775,0.01915941,0.06389286,0.011357897,0.6201524],"study_design_scores_gemma":[0.00011248239,0.00013724681,0.00041380472,0.000021582515,0.000049504506,0.00022546985,0.00007778027,0.9305256,0.008450883,0.05906498,0.000904793,0.00001597087],"about_ca_topic_score_codex":0.0030664515,"about_ca_topic_score_gemma":0.0050770976,"teacher_disagreement_score":0.004410488,"about_ca_system_score_codex":0.000977647,"about_ca_system_score_gemma":0.0026619378,"threshold_uncertainty_score":0.014754534},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002674197,0.0005395326,0.9820823,0.0003580934,0.00019886887,0.00009711257,0.00029956453,0.001346606,0.012403716],"genre_scores_gemma":[0.08579866,0.00042673404,0.90155774,0.00028490354,0.0003281466,0.00032098952,0.00060327316,0.00078064646,0.009898869],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877304,0.0005245562,0.000049743452,0.00018619395,0.00037044135,0.00009600837],"domain_scores_gemma":[0.996845,0.0021702761,0.00009297359,0.00040649413,0.00039524346,0.00009014069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014155061,0.0013091499,0.0015562108,0.002666815,0.001048655,0.0022990347,0.0032926118,0.0015233206,0.019668069],"category_scores_gemma":[0.007566427,0.00076997315,0.0015505716,0.003583201,0.0014648834,0.0026097526,0.0019178533,0.0031188105,0.0037806018],"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.00025866315,0.00019394123,0.00064858206,0.00044297797,0.00012936519,0.0000991603,0.000075420416,0.2564679,0.0018327303,0.32911855,0.03626119,0.37447152],"study_design_scores_gemma":[0.000056460893,0.000034461395,0.00010240405,0.000028227498,0.000021403279,0.000058436213,0.000015625976,0.85643107,0.00087856187,0.13400258,0.00835364,0.000017123128],"about_ca_topic_score_codex":0.007849046,"about_ca_topic_score_gemma":0.01585102,"teacher_disagreement_score":0.019668069,"about_ca_system_score_codex":0.001261303,"about_ca_system_score_gemma":0.0029636642,"threshold_uncertainty_score":0.065796256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014974186,0.0004467191,0.98114246,0.00035707478,0.00008145258,0.00008187921,0.00052840676,0.001467117,0.0009206924],"genre_scores_gemma":[0.3055333,0.0008652323,0.68512166,0.00040614392,0.0002875687,0.00030951182,0.0037307665,0.00082558603,0.0029203305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689305,0.0011747283,0.00015327855,0.000837195,0.00070872915,0.00023296927],"domain_scores_gemma":[0.9804418,0.012394109,0.0007592689,0.0038943728,0.0018996309,0.000610875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054146214,0.0015498918,0.0030353204,0.0039265514,0.0027191383,0.002840529,0.0054287813,0.002705281,0.0065778145],"category_scores_gemma":[0.040154643,0.0017684553,0.0020709392,0.0053273216,0.0018253478,0.0075461515,0.004999784,0.004699117,0.002512692],"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.0006591878,0.00038797708,0.0060343235,0.00032602565,0.00039839142,0.00017535803,0.00058154593,0.6097896,0.002378894,0.10194103,0.012989258,0.2643384],"study_design_scores_gemma":[0.000021423566,0.000023400022,0.00017861922,0.000018982291,0.00002954476,0.000019363866,0.000034988505,0.9139795,0.0005310648,0.08423944,0.00091006275,0.000013557637],"about_ca_topic_score_codex":0.016091645,"about_ca_topic_score_gemma":0.021601547,"teacher_disagreement_score":0.016091645,"about_ca_system_score_codex":0.0015620355,"about_ca_system_score_gemma":0.0036273252,"threshold_uncertainty_score":0.031995952},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009097427,0.0007101536,0.98760986,0.0001568995,0.00008680073,0.000014698685,0.00002044776,0.0001953443,0.0021083327],"genre_scores_gemma":[0.79448944,0.0008720538,0.19912499,0.00007485563,0.00015494449,0.00014407733,0.00009332152,0.00012694376,0.004919397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920505,0.00026143802,0.000041265066,0.00020240895,0.00022643425,0.00006350975],"domain_scores_gemma":[0.9980007,0.0012573304,0.00016610476,0.00033651662,0.00015770653,0.00008160215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095298997,0.00086872606,0.0014275272,0.00062513695,0.0008461347,0.0010391091,0.001465759,0.0016602657,0.0035268506],"category_scores_gemma":[0.0038127424,0.00044801913,0.00079366897,0.00078421336,0.0010184544,0.002466103,0.0028732521,0.0013825315,0.0005922142],"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.0005755269,0.00010003243,0.00053167803,0.00039903237,0.00022098335,0.0004430781,0.00028692358,0.61118233,0.020882113,0.16514724,0.004252639,0.19597839],"study_design_scores_gemma":[0.000024859366,0.00006933544,0.00012915967,0.000009892287,0.000020004172,0.00011493682,0.000033271856,0.91403824,0.0027014986,0.080584966,0.00225808,0.000015702504],"about_ca_topic_score_codex":0.000519102,"about_ca_topic_score_gemma":0.00049690076,"teacher_disagreement_score":0.0035268506,"about_ca_system_score_codex":0.00033363578,"about_ca_system_score_gemma":0.00044838912,"threshold_uncertainty_score":0.011798441},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050253857,0.00086546317,0.936084,0.0038868352,0.00012357166,0.000068388625,0.0016589998,0.00040002642,0.0066588367],"genre_scores_gemma":[0.8358173,0.0015322752,0.14660262,0.0008426694,0.00043620993,0.0003496445,0.0023368453,0.00018236243,0.011900164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973556,0.0014986714,0.00012102796,0.0005614478,0.00028016267,0.00018314403],"domain_scores_gemma":[0.94315964,0.050959293,0.0020006855,0.001969172,0.001371515,0.0005397482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045111133,0.0008913849,0.0024401776,0.0015891213,0.0010603822,0.003365253,0.0030927793,0.003029413,0.0051162723],"category_scores_gemma":[0.04304619,0.001493741,0.0016947628,0.0019257913,0.0022726203,0.0060252263,0.002358791,0.004046209,0.000819431],"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.00017129717,0.000061871455,0.0024785935,0.00013142168,0.00013389338,0.00020790349,0.00017141043,0.5362424,0.00014517173,0.4398565,0.0042060716,0.016193364],"study_design_scores_gemma":[0.000022075043,0.000005630664,0.00013406907,0.0000134265665,0.0000177403,0.000031258518,0.000014771013,0.6810068,0.000053994474,0.31803185,0.0006592588,0.000009101945],"about_ca_topic_score_codex":0.010343599,"about_ca_topic_score_gemma":0.01595043,"teacher_disagreement_score":0.010343599,"about_ca_system_score_codex":0.0032690135,"about_ca_system_score_gemma":0.0022331593,"threshold_uncertainty_score":0.023857355},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076247774,0.0017754184,0.91533256,0.0005179034,0.0002243432,0.0001971539,0.0012435948,0.0013952993,0.0030660555],"genre_scores_gemma":[0.41726604,0.0012767192,0.5745851,0.00023803601,0.0002658907,0.0003150474,0.003506688,0.00021232363,0.002334166],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675316,0.0009946369,0.0004467618,0.00087941583,0.0007272864,0.00019872353],"domain_scores_gemma":[0.99080116,0.0058957534,0.000620206,0.0012338234,0.0010649565,0.00038419358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003160144,0.0009332115,0.0016018554,0.006136835,0.00091355026,0.003407567,0.0016717209,0.0010149973,0.005390626],"category_scores_gemma":[0.017061671,0.0007357888,0.0017329628,0.005603826,0.0011788248,0.007059917,0.003056221,0.0017080602,0.0011853866],"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.0010565076,0.00049926876,0.009388304,0.0008830074,0.0005685794,0.001383905,0.0015796975,0.08549399,0.005042395,0.3078842,0.012312448,0.5739077],"study_design_scores_gemma":[0.00008615231,0.00014794937,0.0009681059,0.00012043281,0.00018430303,0.00037118708,0.00051751215,0.37949377,0.0021123085,0.60916847,0.0067722956,0.000057515994],"about_ca_topic_score_codex":0.0020653128,"about_ca_topic_score_gemma":0.0037440902,"teacher_disagreement_score":0.006136835,"about_ca_system_score_codex":0.0006687973,"about_ca_system_score_gemma":0.0012211918,"threshold_uncertainty_score":0.018033385},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001137014,0.003996591,0.01158451,0.016272048,0.012841245,0.00012790742,0.00330801,0.00095811905,0.9497745],"genre_scores_gemma":[0.011319321,0.0037728893,0.004882626,0.0056991642,0.004823634,0.0001449204,0.0029046172,0.00041525988,0.9660375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99917185,0.0001226135,0.000033405715,0.00020250533,0.00036877257,0.00010094139],"domain_scores_gemma":[0.9984511,0.00023292318,0.00007357904,0.00024513275,0.00071183365,0.00028534725],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009873469,0.0007173421,0.00040550964,0.0016695283,0.0014378724,0.0043533617,0.0013345134,0.0016452804,0.40831882],"category_scores_gemma":[0.003400094,0.00023957949,0.000490845,0.0013274628,0.0009769994,0.002912545,0.0022764683,0.002034933,0.25827777],"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.000044622553,0.00004006392,0.0003067884,0.00019038675,0.000004591194,0.000056163637,0.0002354373,0.00013729492,0.00050282694,0.16785066,0.6781145,0.15251686],"study_design_scores_gemma":[0.0000023242292,0.000005930109,0.00013516574,0.00004182957,0.0000013324378,0.00003220437,0.00004386817,0.000029173212,0.00009478299,0.0116242245,0.98798615,0.0000030025317],"about_ca_topic_score_codex":0.0016796476,"about_ca_topic_score_gemma":0.0019902883,"teacher_disagreement_score":0.5916812,"about_ca_system_score_codex":0.0012575255,"about_ca_system_score_gemma":0.0018872693,"threshold_uncertainty_score":0.84396136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027697082,0.004526937,0.000075280506,0.025541242,0.9678211,0.000021243139,0.000080682985,0.000042669675,0.001863159],"genre_scores_gemma":[0.00047036732,0.0039661196,0.0001014992,0.015029193,0.95547956,0.000037030874,0.00009580269,0.000086297405,0.024734145],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99302965,0.0011275288,0.000851424,0.00083453726,0.00356386,0.00059303374],"domain_scores_gemma":[0.9719092,0.0053960406,0.0023205734,0.00054712704,0.015432369,0.0043946384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0086853625,0.004078729,0.0051663606,0.0075514205,0.0032929122,0.01265496,0.004097389,0.013762519,0.04285496],"category_scores_gemma":[0.027363034,0.0013204337,0.0026375842,0.0025011315,0.0019899425,0.0038275549,0.0021524664,0.0124905165,0.034062207],"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.00004176405,0.0000064576607,0.000012197658,0.0001139018,0.000011952269,0.00006556225,0.0000046597806,0.000011176475,0.000035011944,0.000079014484,0.9977059,0.0019123969],"study_design_scores_gemma":[0.00009532353,0.00002849274,0.00025466434,0.00035966554,0.00006410817,0.00019939046,0.00002825101,0.00011319322,0.00013168628,0.00047622484,0.99822503,0.000024053088],"about_ca_topic_score_codex":0.0021821652,"about_ca_topic_score_gemma":0.007657206,"teacher_disagreement_score":0.04285496,"about_ca_system_score_codex":0.0047565857,"about_ca_system_score_gemma":0.004216831,"threshold_uncertainty_score":0.14336413},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046371433,0.034206577,0.0012953493,0.052663848,0.7959268,0.00020749893,0.0028556762,0.0004686239,0.11191185],"genre_scores_gemma":[0.0039996402,0.018696526,0.0009543966,0.012500336,0.19778566,0.00020908006,0.0036642647,0.0007382003,0.7614519],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99763834,0.00033908975,0.00015700066,0.0003094203,0.0013293904,0.00022676155],"domain_scores_gemma":[0.98790073,0.0012148574,0.0004980293,0.0004717293,0.008066724,0.0018479802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037752036,0.0016899204,0.0014352916,0.0060738334,0.0023777527,0.010069898,0.0021580975,0.002617157,0.29257426],"category_scores_gemma":[0.011698103,0.000532599,0.00097066845,0.0045495634,0.000634033,0.00341488,0.0025800657,0.0039580986,0.16540222],"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.00003170508,0.000008600153,0.000021860958,0.0000835909,0.0000024620074,0.000010003084,0.000010936501,0.000026323696,0.0000488108,0.00033342012,0.9899629,0.009459434],"study_design_scores_gemma":[0.000014469969,0.000018708573,0.0003092792,0.00017075997,0.000005304732,0.000014081559,0.00004285777,0.00004052518,0.000068376496,0.00051986973,0.9987871,0.000008637216],"about_ca_topic_score_codex":0.0064116386,"about_ca_topic_score_gemma":0.0117952265,"teacher_disagreement_score":0.29257426,"about_ca_system_score_codex":0.0052802744,"about_ca_system_score_gemma":0.0034053107,"threshold_uncertainty_score":0.9787584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024600167,0.0068119867,0.000092397095,0.020634599,0.96753347,0.000027934935,0.000111444206,0.000049961094,0.0047136433],"genre_scores_gemma":[0.0005627977,0.006815895,0.00018923699,0.014490768,0.8964929,0.0000677122,0.0002092672,0.00015841289,0.081013046],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99327224,0.0010368181,0.00068792724,0.00072395935,0.0038664832,0.00041263137],"domain_scores_gemma":[0.97009027,0.0048240656,0.0017311159,0.0007265739,0.01868453,0.003943454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00978973,0.004016564,0.0037640028,0.0111274,0.0044231275,0.015192401,0.00392785,0.00862382,0.06692301],"category_scores_gemma":[0.021725586,0.0010284063,0.0023882315,0.0051502967,0.0018373966,0.0049967812,0.0024525274,0.011218862,0.049385156],"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.000020033762,0.0000064991677,0.0000074468567,0.00008682846,0.000004894931,0.000017184406,0.00000541111,0.000012313779,0.000022082306,0.00011905419,0.9977841,0.0019142419],"study_design_scores_gemma":[0.00003600543,0.000015572406,0.00025675233,0.00028755228,0.000022252814,0.000037073507,0.00003176156,0.00006807628,0.00005772811,0.0006194684,0.9985489,0.000018772858],"about_ca_topic_score_codex":0.0067406497,"about_ca_topic_score_gemma":0.018818941,"teacher_disagreement_score":0.06692301,"about_ca_system_score_codex":0.008081057,"about_ca_system_score_gemma":0.0060741273,"threshold_uncertainty_score":0.22387975},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000070215145,0.0018211218,0.0003617882,0.044922464,0.94775695,0.000024623001,0.00094843446,0.00021977953,0.003874605],"genre_scores_gemma":[0.008542139,0.007850581,0.0023631703,0.076974325,0.5840292,0.00025673874,0.0037035646,0.0022718976,0.31400833],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99146456,0.0013741583,0.0010062228,0.0011953996,0.0042657726,0.00069397036],"domain_scores_gemma":[0.9320085,0.007890459,0.002855739,0.0037208286,0.050503492,0.0030210307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064319014,0.0027817264,0.002185877,0.0073728473,0.004334991,0.010811179,0.004257236,0.007164695,0.10556402],"category_scores_gemma":[0.081402086,0.0009920024,0.0022305015,0.004991812,0.0020184857,0.004859864,0.0037070694,0.01132242,0.079144984],"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.000015497311,0.0000021502788,0.000015809917,0.00006202975,0.0000041652493,0.000020920503,0.000012166577,0.000017949786,0.000014668403,0.00027198408,0.99809486,0.0014678101],"study_design_scores_gemma":[0.000025034888,0.000008855654,0.00042356452,0.00026064122,0.000015652782,0.000052669282,0.00005333202,0.00008729073,0.00012502912,0.0007085541,0.9982168,0.000022527134],"about_ca_topic_score_codex":0.02842624,"about_ca_topic_score_gemma":0.029872749,"teacher_disagreement_score":0.10556402,"about_ca_system_score_codex":0.010472169,"about_ca_system_score_gemma":0.008854114,"threshold_uncertainty_score":0.35314685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99738425,0.000013152562,0.0013490173,0.000049343493,0.0000019465003,0.00002959273,0.000015163532,0.000016532256,0.0011409553],"genre_scores_gemma":[0.9950294,0.000020060128,0.004226461,0.000007875846,0.0000013855275,0.00003943387,0.000035736975,0.000011314392,0.0006283664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857473,0.0007869708,0.000060686638,0.00013965802,0.00028240902,0.00015552189],"domain_scores_gemma":[0.976473,0.01920835,0.0014351537,0.0007438102,0.0013376944,0.00080194446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035638108,0.0005670443,0.0003582957,0.0009501495,0.0011801707,0.0018442834,0.0010355632,0.0014283621,0.0016248178],"category_scores_gemma":[0.01743629,0.00034446002,0.000293055,0.00079113105,0.0016927449,0.0017908957,0.0012574352,0.0008679922,0.00027293962],"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.0058869906,0.009951797,0.23153494,0.0008999109,0.00029274484,0.0026999542,0.023394762,0.5536707,0.03196195,0.024049863,0.0023535062,0.11330292],"study_design_scores_gemma":[0.0004777112,0.011995591,0.13365184,0.00011067587,0.00023910914,0.00044930255,0.020356081,0.79551834,0.02061968,0.01055467,0.0057919794,0.00023502391],"about_ca_topic_score_codex":0.005178253,"about_ca_topic_score_gemma":0.010567692,"teacher_disagreement_score":0.005178253,"about_ca_system_score_codex":0.0019289053,"about_ca_system_score_gemma":0.00141462,"threshold_uncertainty_score":0.018847406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9969014,0.00027753488,0.0021710542,0.00004732348,0.000012541243,0.0000096394115,0.00017002052,0.000022643928,0.00038793392],"genre_scores_gemma":[0.99928564,0.00006209327,0.00046224584,0.0000034157913,0.000007998665,0.0000035858313,0.00012473819,0.0000027011138,0.000047603433],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99968195,0.000114806724,0.00002954087,0.000077371806,0.00006313711,0.00003317678],"domain_scores_gemma":[0.9898769,0.007963089,0.0007217296,0.00044053065,0.00068025285,0.0003174325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018384544,0.00036072466,0.00034113353,0.002389893,0.00019578928,0.00066761754,0.00024510737,0.0005411315,0.0008873795],"category_scores_gemma":[0.011098281,0.00013306046,0.0003698406,0.0009265216,0.00034500528,0.0004871861,0.00023765679,0.00042168944,0.00015134325],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001095787,0.00017848356,0.94698316,0.00005430582,0.00020590503,0.00034408233,0.00025285676,0.011190797,0.004354765,0.00032125445,0.00040920416,0.034609366],"study_design_scores_gemma":[0.000012836407,0.00033324314,0.8577686,0.000037474485,0.000111910806,0.0004907657,0.0002880881,0.13738239,0.0021418335,0.0010763989,0.00032195027,0.000034573357],"about_ca_topic_score_codex":0.0016891693,"about_ca_topic_score_gemma":0.00077749346,"teacher_disagreement_score":0.002389893,"about_ca_system_score_codex":0.00018277814,"about_ca_system_score_gemma":0.00015354615,"threshold_uncertainty_score":0.009722829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032453954,0.00035770968,0.9870331,0.0013948471,0.00006497674,0.000066507084,0.00024185481,0.00064143015,0.006954291],"genre_scores_gemma":[0.26897997,0.0009600027,0.71684027,0.0010339833,0.00048008215,0.00029368448,0.0010710616,0.00074143085,0.009599528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99384815,0.002244241,0.0006087357,0.0010075795,0.0017883583,0.0005029115],"domain_scores_gemma":[0.98416686,0.0103939595,0.00044164006,0.003149243,0.0015395845,0.00030877543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056627453,0.0007568366,0.0013433299,0.002734152,0.0016117609,0.0071900054,0.004697509,0.0023893893,0.008645183],"category_scores_gemma":[0.020503432,0.0015505953,0.003073223,0.003925713,0.007281129,0.018477686,0.0047116405,0.0054328353,0.0012951073],"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.000049751376,0.000031104173,0.00018129182,0.000121462755,0.000033541048,0.00009508116,0.0006884625,0.01167857,0.0005695267,0.9570836,0.0020598916,0.027407732],"study_design_scores_gemma":[0.000017741055,0.000021644351,0.00010122388,0.000051105908,0.000054543936,0.00007872903,0.00020492372,0.06043641,0.0019629488,0.9276212,0.009427665,0.000021928348],"about_ca_topic_score_codex":0.009846894,"about_ca_topic_score_gemma":0.0058083693,"teacher_disagreement_score":0.009846894,"about_ca_system_score_codex":0.0024905826,"about_ca_system_score_gemma":0.002252051,"threshold_uncertainty_score":0.029947758},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03200373,0.0012309072,0.9509961,0.00051269005,0.00030479094,0.0000310371,0.00011277965,0.00048623493,0.014321755],"genre_scores_gemma":[0.6127132,0.0014134475,0.36186054,0.0002297868,0.00055044086,0.0000657312,0.0003204245,0.0005181957,0.022328189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992373,0.0002557937,0.000041962205,0.0001584929,0.00023371895,0.000072799834],"domain_scores_gemma":[0.9973443,0.0011211773,0.00028056832,0.00046166315,0.00054493686,0.00024737243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018925528,0.0007490634,0.0008245827,0.0017912886,0.0007814439,0.0026350215,0.0009480565,0.0011446897,0.0043497877],"category_scores_gemma":[0.0067516244,0.00052519445,0.0005223602,0.0009765802,0.0019321743,0.0042355214,0.0030579038,0.0030661703,0.0006866032],"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.00013413413,0.00005074163,0.00060702366,0.00010419324,0.000036839076,0.00017685894,0.00017986195,0.055464894,0.0077623515,0.87330806,0.0032829004,0.05889206],"study_design_scores_gemma":[0.000016462456,0.000024119818,0.000352232,0.000023728599,0.000013856538,0.0002248466,0.000058418882,0.70223045,0.0046120174,0.28350952,0.008904461,0.000029931325],"about_ca_topic_score_codex":0.0011861912,"about_ca_topic_score_gemma":0.0011448327,"teacher_disagreement_score":0.0043497877,"about_ca_system_score_codex":0.0009625151,"about_ca_system_score_gemma":0.0005795305,"threshold_uncertainty_score":0.01455152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022009974,0.0033826977,0.000070409624,0.027297305,0.96734434,0.000024889507,0.000092125134,0.000036763402,0.0017295263],"genre_scores_gemma":[0.0003550599,0.0030767196,0.000103397026,0.01831402,0.95787185,0.000046033492,0.000095926116,0.00008062335,0.020056264],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99150133,0.0015215448,0.0010139918,0.00096240966,0.004359461,0.00064132625],"domain_scores_gemma":[0.9680296,0.006778409,0.002596626,0.0006748519,0.016861068,0.0050595095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011364907,0.004672679,0.0052878736,0.0075851125,0.003895396,0.014145562,0.0043939217,0.015598767,0.04535736],"category_scores_gemma":[0.034292858,0.0014341767,0.0033828896,0.002680444,0.0021026386,0.003923122,0.0022248335,0.014523946,0.03411502],"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.000038943635,0.0000062798636,0.000010863926,0.000100087804,0.000011524327,0.00005772311,0.0000043278255,0.000011372882,0.000025100058,0.00007499913,0.9982035,0.0014553181],"study_design_scores_gemma":[0.00012029149,0.00002772983,0.00023582202,0.00043737143,0.000067994384,0.00015833158,0.000030027792,0.000119920944,0.000109492496,0.000594831,0.99807274,0.000025383426],"about_ca_topic_score_codex":0.0027774149,"about_ca_topic_score_gemma":0.009228085,"teacher_disagreement_score":0.04535736,"about_ca_system_score_codex":0.005444318,"about_ca_system_score_gemma":0.005337699,"threshold_uncertainty_score":0.15173554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029482278,0.00018839464,0.9944939,0.00014547184,0.000039296,0.0000132260175,0.000097850236,0.00016498227,0.0019086879],"genre_scores_gemma":[0.31696713,0.00072859804,0.6703426,0.00038181435,0.00017281034,0.00014249465,0.00093693676,0.0004485549,0.009879009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993868,0.00016939885,0.000034464567,0.0001450892,0.00020009253,0.00006417961],"domain_scores_gemma":[0.99911374,0.00044756496,0.00007009565,0.00015732419,0.00017117702,0.000040070045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093640643,0.0010959352,0.0013091037,0.0006022806,0.0006218872,0.0013253979,0.0011978215,0.0010074559,0.004388191],"category_scores_gemma":[0.0038141536,0.0005956659,0.00083057873,0.0011291729,0.0008523011,0.0024295314,0.0017276898,0.001660189,0.0015473055],"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.00039382488,0.00014101791,0.00056029187,0.00030792097,0.00014525375,0.00017922252,0.00017748201,0.651618,0.013990839,0.111569665,0.011763884,0.20915261],"study_design_scores_gemma":[0.0000093925055,0.000010825038,0.00008684333,0.000009002868,0.000007035312,0.000028165818,0.000012824707,0.9623478,0.0009412768,0.035228427,0.0013059065,0.000012397835],"about_ca_topic_score_codex":0.004240798,"about_ca_topic_score_gemma":0.0075885984,"teacher_disagreement_score":0.004388191,"about_ca_system_score_codex":0.0005161485,"about_ca_system_score_gemma":0.0011105594,"threshold_uncertainty_score":0.014679909},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06525951,0.0027025512,0.78853506,0.0070557026,0.0019859564,0.00017898284,0.00073640805,0.0019430082,0.13160278],"genre_scores_gemma":[0.8166209,0.0011580688,0.10712546,0.0017595745,0.0020344907,0.00019525607,0.00079237844,0.00079969224,0.0695142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940124,0.0017855316,0.00047052765,0.0015380527,0.0015321295,0.0006613285],"domain_scores_gemma":[0.9754547,0.012008655,0.000991613,0.00567833,0.0047600605,0.0011066252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054831086,0.001052165,0.0023027041,0.0032653396,0.0027585707,0.006155459,0.0025401819,0.0026118837,0.017897334],"category_scores_gemma":[0.02637189,0.0010008052,0.003044348,0.0016369722,0.004567219,0.012419943,0.004587943,0.0046876036,0.0028782866],"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.00014964645,0.000042138206,0.00033117773,0.000064556756,0.00005290242,0.00009278512,0.00023076437,0.0018622399,0.0008655592,0.9700514,0.0052299355,0.021026991],"study_design_scores_gemma":[0.000032066793,0.00002864936,0.00016596948,0.000017529845,0.00003275534,0.00012581423,0.000039183986,0.018739093,0.0006753526,0.97518027,0.0049369647,0.00002641108],"about_ca_topic_score_codex":0.0018089793,"about_ca_topic_score_gemma":0.0016417978,"teacher_disagreement_score":0.017897334,"about_ca_system_score_codex":0.002757945,"about_ca_system_score_gemma":0.0016729851,"threshold_uncertainty_score":0.059872568},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066003084,0.012575129,0.7297882,0.009016837,0.0010681476,0.000113191316,0.0011758979,0.00047011,0.17978947],"genre_scores_gemma":[0.73679924,0.011046719,0.20538573,0.0024346241,0.0037336205,0.0003505153,0.0018485063,0.00033438572,0.03806661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970023,0.0010174165,0.00025201755,0.0005680454,0.0009400881,0.0002200991],"domain_scores_gemma":[0.99463993,0.0030940461,0.0003315997,0.0007001306,0.0008406801,0.00039359662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037302352,0.00092587696,0.0018867996,0.002807351,0.0025107672,0.0054416466,0.0020948998,0.0012194011,0.0072552287],"category_scores_gemma":[0.006596287,0.0008927814,0.0017956969,0.0038817893,0.0076175756,0.012447789,0.0033472676,0.004772533,0.001184628],"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.0000065703175,0.0000068092318,0.00003571142,0.0000149953385,0.000005195567,0.000013374757,0.00006406147,0.00039765198,0.00006983366,0.9971306,0.00049795414,0.0017573277],"study_design_scores_gemma":[0.000003965032,0.00000396366,0.00002451071,0.000005071257,0.0000026288817,0.000015048426,0.000015295087,0.0011432724,0.000033024247,0.996747,0.0020022485,0.000003966708],"about_ca_topic_score_codex":0.0022654322,"about_ca_topic_score_gemma":0.0016920215,"teacher_disagreement_score":0.0072552287,"about_ca_system_score_codex":0.0020582117,"about_ca_system_score_gemma":0.0013393761,"threshold_uncertainty_score":0.02427113},"labels":[],"label_agreement":null}]}