{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":835,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":835,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"c5c6f302455f","filters":{"topic":"Logic, Reasoning, and Knowledge"}},"results":[{"id":"W2062205093","doi":"10.1016/s0004-3702(00)00031-x","title":"ConGolog, a concurrent programming language based on the situation calculus","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":496,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; York University","funders":"","keywords":"Concurrency; Programming language; Computer science; Axiom; Rotation formalisms in three dimensions; Situation calculus; Process calculus; Semantics (computer science); Operational semantics; Pi calculus; Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04249999969817588,"gpt":0.2945950837513873,"spread":0.2520950840532114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004602241,0.0001414918,0.0001152619,0.00004504739,0.0002474463,0.0002260654,0.0006977887,0.00005622669,0.000457622],"category_scores_gemma":[0.0001977483,0.00009506336,0.0000786523,0.0003953166,0.0001285374,0.0001318904,0.00004820349,0.0001712094,0.001423533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004014642,"about_ca_system_score_gemma":0.00006562571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009661425,"about_ca_topic_score_gemma":0.0001226708,"domain_scores_codex":[0.9987012,0.0001372632,0.0002406394,0.0003543532,0.0002466197,0.000319939],"domain_scores_gemma":[0.9989998,0.0003348567,0.00006269055,0.0004543365,0.00007269608,0.00007558332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006420127,0.0001049255,0.00002624244,0.000002537881,0.000003511132,0.00001099905,0.0025368,0.0005337514,0.0001794219,0.2289893,0.0001149634,0.7674912],"study_design_scores_gemma":[0.00003864379,0.0002685634,0.0001769674,0.00003710843,0.000008433713,0.000005670474,0.0004133317,0.9469504,0.03813849,0.005427385,0.008262656,0.0002723456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08359794,0.0001651913,0.8981801,0.002315505,0.0005928445,0.0005297983,0.000002064958,0.0003272445,0.01428932],"genre_scores_gemma":[0.9978868,0.000005648832,0.0009915842,0.0006736718,0.0001211618,0.00004861385,0.000003273624,0.000006366547,0.0002628267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9464167,"threshold_uncertainty_score":0.9993539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070368455","doi":"10.1016/s0004-3702(02)00365-x","title":"Knowledge, action, and the frame problem","year":2003,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":276,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Action (physics); Computer science; GRASP; Frame (networking); Frame problem; Knowledge representation and reasoning; Artificial intelligence; Object (grammar); Affect (linguistics); Successor cardinal; Cognitive science; Knowledge management; Mathematics; Programming language; Psychology; Communication","retraction":null,"screen_n_in":null,"score":{"opus":0.06070968582728412,"gpt":0.3073802869727568,"spread":0.2466706011454727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007901231,0.0001378017,0.0001487994,0.00005083952,0.0003554943,0.0002804772,0.0005425801,0.00006820034,0.00005116957],"category_scores_gemma":[0.0003544445,0.00008957816,0.00005890813,0.0004637805,0.0003151837,0.0002802049,0.0001272369,0.0001916131,0.0005470905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002124241,"about_ca_system_score_gemma":0.00008214718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003500573,"about_ca_topic_score_gemma":0.0001375377,"domain_scores_codex":[0.9987569,0.0002007963,0.0002614121,0.0003625982,0.0001308585,0.0002874264],"domain_scores_gemma":[0.9989159,0.0003603835,0.00007439051,0.0004179459,0.0001432332,0.0000882191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005608028,0.00004860659,0.00007262434,0.000005156349,0.000006758592,0.000001257147,0.002547898,0.00001310424,0.0001164204,0.9068983,0.0002801461,0.09000407],"study_design_scores_gemma":[0.00006394892,0.00005873701,0.00007871917,0.00001525475,0.00000938523,0.0000362045,0.0004008251,0.02371877,0.02668262,0.9072629,0.04144915,0.0002235058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003266797,0.001336011,0.9192292,0.0008510193,0.0007617224,0.0002673501,2.820621e-7,0.0001483311,0.07413927],"genre_scores_gemma":[0.9916534,0.000131566,0.006848569,0.0001855467,0.0001001669,0.00003133971,2.171239e-7,0.000007079922,0.001042138],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9883866,"threshold_uncertainty_score":0.7031925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046769817","doi":"10.1145/1147376.1147391","title":"Consistent query answering in databases","year":2006,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":201,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Database; Set (abstract data type); Query optimization; Query language; View; Sargable; Data integrity; Information retrieval; Distributed database; Web search query; Database design; Programming language; Search engine","retraction":null,"screen_n_in":null,"score":{"opus":0.02901131692479943,"gpt":0.2536003828049169,"spread":0.2245890658801175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002252819,0.000138544,0.0001848697,0.000116437,0.00007075725,0.00007991371,0.0008536645,0.00004252582,0.00002739832],"category_scores_gemma":[0.0001893008,0.00012327,0.00006114512,0.0003063088,0.00003950408,0.0003920101,0.0005188677,0.0001275874,0.00009381381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005486753,"about_ca_system_score_gemma":0.00006349735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001334443,"about_ca_topic_score_gemma":0.002162681,"domain_scores_codex":[0.9988182,0.00005718988,0.0002426689,0.0004123642,0.0001371624,0.0003323812],"domain_scores_gemma":[0.9987214,0.0002364535,0.00006797305,0.000880454,0.0000378399,0.00005593876],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003138121,0.0006769823,0.4250862,0.0000929528,0.00003271577,0.0005359004,0.0007933219,0.0001944781,0.005265261,0.1959942,0.02792714,0.3433695],"study_design_scores_gemma":[0.003964967,0.0005376692,0.3688931,0.0005465216,0.00003953171,0.000270976,0.0002622786,0.0528937,0.01978951,0.07754246,0.4724321,0.002827182],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7790526,0.001721679,0.1568066,0.0009188441,0.00229658,0.0003467353,0.00000696766,0.0005284566,0.05832152],"genre_scores_gemma":[0.9621798,0.00004325312,0.0363954,0.0001490789,0.0001814324,0.00001776449,0.000007820392,0.000009839302,0.001015626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4445049,"threshold_uncertainty_score":0.5026806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W36235450","doi":"10.3390/plants11192584","title":"A knowledge-based approach to planning with incomplete information and sensing","year":2002,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence Planning Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":199,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Akademie Věd České Republiky; Grantová Agentura České Republiky; Deutsche Forschungsgemeinschaft","keywords":"Planner; Computer science; Representation (politics); Knowledge representation and reasoning; Domain (mathematical analysis); Set (abstract data type); Automated planning and scheduling; Domain knowledge; Complete information; Modal; State (computer science); Artificial intelligence; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.143869249412177,"gpt":0.3114971796020732,"spread":0.1676279301898962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000426942,0.0002804736,0.0002689497,0.0005133434,0.000257037,0.00130246,0.0007461246,0.00009589367,0.00001600945],"category_scores_gemma":[0.000147799,0.0002375657,0.00004003101,0.0004111439,0.0000825879,0.0007273115,0.0001313129,0.0002568254,0.0003198889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00011157,"about_ca_system_score_gemma":0.00006973887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008656877,"about_ca_topic_score_gemma":0.000006732788,"domain_scores_codex":[0.9980302,0.0001050475,0.0005289994,0.0004792746,0.0004948815,0.0003615575],"domain_scores_gemma":[0.998566,0.0001944348,0.0002334684,0.0003187262,0.000488081,0.0001993211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001084635,0.0001855999,0.0008134005,0.00007235574,0.00006649251,0.00003435628,0.01957434,0.0807969,0.0003232711,0.8285385,0.0006406276,0.06884572],"study_design_scores_gemma":[0.00007663808,0.0002216633,0.0001165062,0.0004999466,0.000004856891,0.00006283719,0.001312097,0.9927477,0.0005046834,0.0009242049,0.003193201,0.0003356803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008794785,0.00008750661,0.9020005,0.0003796436,0.0008015613,0.0003256368,0.000007959394,0.0002049175,0.08739746],"genre_scores_gemma":[0.9891096,0.000002265999,0.01028368,0.0002174445,0.0001735576,0.00003054066,0.00001743533,0.00001119023,0.0001542613],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9803149,"threshold_uncertainty_score":0.9997343,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1552562496","doi":"","title":"Decision-Theoretic, High-Level Agent Programming in the Situation Calculus","year":2000,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":195,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Markov decision process; Computer science; Situation calculus; Interpreter; Domain (mathematical analysis); Programming language; Programming domain; Symbolic programming; Artificial intelligence; Inductive programming; Logic programming; Partially observable Markov decision process; Process calculus; Theoretical computer science; Markov process; Programming paradigm; Markov chain; Machine learning; Mathematics; Markov model","retraction":null,"screen_n_in":null,"score":{"opus":0.02206810531537987,"gpt":0.2568810325249191,"spread":0.2348129272095393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006672902,0.0001052646,0.00009907955,0.00005415433,0.0001375294,0.0002204398,0.000821913,0.00005052088,0.0003261363],"category_scores_gemma":[0.00005812823,0.00006039891,0.00004884572,0.0004213839,0.00004254601,0.0002062727,0.00005798465,0.00009948791,0.0005128559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003913794,"about_ca_system_score_gemma":0.00004651436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001406184,"about_ca_topic_score_gemma":0.0003637928,"domain_scores_codex":[0.9988708,0.00009917669,0.0001903169,0.0002814532,0.0002920932,0.0002661945],"domain_scores_gemma":[0.9992279,0.0002193954,0.00002913967,0.0004328082,0.0000404011,0.000050378],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003098928,0.00007629042,0.00009741777,0.000001475191,0.000001813568,0.00001286967,0.00267877,0.00004890026,0.000005429023,0.355065,0.0004711659,0.6415377],"study_design_scores_gemma":[0.00365511,0.0007350909,0.1074074,0.0001531029,0.00003655817,0.0001938365,0.0009346262,0.3016735,0.00208709,0.3497203,0.2318908,0.001512596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1264492,0.0001118798,0.820553,0.000731939,0.0002403895,0.0003361333,3.971523e-7,0.0001290091,0.05144806],"genre_scores_gemma":[0.9520065,0.00002725031,0.04594788,0.0003433703,0.00005993391,0.00002493223,0.000001793195,0.000004225253,0.001584151],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8255572,"threshold_uncertainty_score":0.6591896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1537230380","doi":"10.1017/cbo9780511676277","title":"Logical Foundations of Proof Complexity","year":2010,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Proof complexity; Complexity class; Structural proof theory; Soundness; PH; Mathematics; Proof theory; Structural complexity theory; Discrete mathematics; Mathematical proof; Descriptive complexity theory; Propositional calculus; Hierarchy; Polynomial hierarchy; Algebra over a field; Computer science; Time complexity; Quantum complexity theory; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04752521863913661,"gpt":0.2337792296146979,"spread":0.1862540109755613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001755851,0.0003243858,0.0005117948,0.0001791856,0.0002644224,0.00008329904,0.002207631,0.0005019166,0.000007300041],"category_scores_gemma":[0.00004067023,0.0003339927,0.000286854,0.00003721313,0.000724103,0.0001869656,0.001313882,0.0007594887,0.00002086154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001736285,"about_ca_system_score_gemma":0.0006530833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006575368,"about_ca_topic_score_gemma":0.00001747755,"domain_scores_codex":[0.9983562,0.0001031633,0.000241662,0.0006345274,0.0003328174,0.0003315905],"domain_scores_gemma":[0.9978165,0.0001428507,0.0003675361,0.00106813,0.0004027987,0.0002021974],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000112313,0.00004840144,0.000004250589,0.00007598004,0.00005017993,0.00005400422,0.00009654539,6.96886e-7,0.00004615833,0.947571,0.05095238,0.001089216],"study_design_scores_gemma":[0.0004774602,0.0001023118,0.0001340044,0.00007159143,0.00007878039,0.0000238112,0.000007350363,0.0009276844,0.0006474653,0.0008919791,0.996203,0.0004345551],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00006281152,0.00004918371,0.06228048,0.00001927746,0.000474805,0.0004009685,0.00008591628,0.0001787738,0.9364478],"genre_scores_gemma":[0.002438207,0.000009239207,0.003810888,0.00002819504,0.0001529823,0.000001220983,0.00005952954,0.00001583835,0.9934839],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.946679,"threshold_uncertainty_score":0.9999112,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044849666","doi":"10.1016/j.evalprogplan.2010.04.001","title":"Program theory evaluation: Logic analysis","year":2010,"lang":"en","type":"article","venue":"Evaluation and Program Planning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Hôpital Charles-Le Moyne","funders":"Canadian Institutes of Health Research; Canadian Health Services Research Foundation","keywords":"Logic model; Computer science; Engineering; Political science; Public administration","retraction":null,"screen_n_in":null,"score":{"opus":0.06455360024763711,"gpt":0.4119331162399644,"spread":0.3473795159923273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007113377,0.0001851681,0.0002171975,0.0002649928,0.0003417217,0.0005791797,0.0004001416,0.0001345547,0.0003513141],"category_scores_gemma":[0.0005900353,0.0001500082,0.0001132277,0.001159207,0.00009136916,0.0003945878,0.0001178268,0.0002823331,0.00004160309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002746759,"about_ca_system_score_gemma":0.000165662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004848293,"about_ca_topic_score_gemma":0.00001700508,"domain_scores_codex":[0.9975293,0.0005163793,0.0002696043,0.0005414529,0.0008230472,0.0003202336],"domain_scores_gemma":[0.9984279,0.0001976612,0.0001677042,0.0004713621,0.000585636,0.0001497568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006855738,0.0001487156,0.01055289,0.000006638317,0.0001307557,0.000002198455,0.001716002,0.0002557546,0.00003783486,0.04046949,0.0002117189,0.9464611],"study_design_scores_gemma":[0.0006550761,0.0002620446,0.06985502,0.00001310116,0.0005499329,0.00001602077,0.00012363,0.8815262,0.00005152764,0.03762551,0.009044387,0.0002775151],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5508474,0.009387887,0.2422535,0.001560019,0.002843057,0.008196295,0.000004397256,0.003364141,0.1815432],"genre_scores_gemma":[0.9381653,0.000007106436,0.06063381,0.0001339202,0.0001625565,0.0006642154,0.00006559443,0.000007469597,0.0001600215],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9461836,"threshold_uncertainty_score":0.6117157,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063972032","doi":"10.1016/j.tcs.2004.09.035","title":"A behavioural pseudometric for probabilistic transition systems","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Probabilistic logic; Mathematics; Coalgebra; Functor; Equivalence (formal languages); Metric space; Modal logic; Discrete mathematics; Metric (unit); Algebra over a field; Pure mathematics; Modal; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01971950583662881,"gpt":0.2498040748160415,"spread":0.2300845689794127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001432339,0.0002057197,0.0002539786,0.0003349336,0.0005072937,0.0006869444,0.001985615,0.0000714889,0.000004746478],"category_scores_gemma":[0.0001761133,0.0001599492,0.0001148984,0.00204237,0.001478691,0.0006706633,0.0002735183,0.0001420696,0.00005020832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001952108,"about_ca_system_score_gemma":0.0002413788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001134983,"about_ca_topic_score_gemma":7.777571e-7,"domain_scores_codex":[0.9975482,0.0000608267,0.0003104697,0.00079483,0.0005831355,0.0007024989],"domain_scores_gemma":[0.9983954,0.0002413379,0.00007267946,0.0006264985,0.0003528743,0.0003111773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006674831,0.000120719,0.00001347987,0.00002289256,0.000002379608,0.000007104293,0.0006771827,0.001522421,0.0001146066,0.9934074,0.0000116005,0.00409353],"study_design_scores_gemma":[0.0009403726,0.0008220678,0.0006945981,0.00005973411,0.00001565819,0.0001670342,0.00001217709,0.6218219,0.0008777651,0.37419,0.00003593521,0.00036274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04181741,0.00007296335,0.9544945,0.0004983836,0.001193048,0.0005963941,0.000003052409,0.0002907915,0.001033404],"genre_scores_gemma":[0.9036738,0.000001583982,0.09594779,0.0001422126,0.0001606737,0.00005611365,0.000001434618,0.000008176033,0.000008184757],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8618564,"threshold_uncertainty_score":0.6624221,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2616737215","doi":"10.1016/s0304-3975(02)00737-5","title":"Scalar aggregation in inconsistent databases","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Scalar (mathematics); Database; Computer science; Mathematics; Set (abstract data type); Characterization (materials science); Theoretical computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0173094157674278,"gpt":0.2560617708558215,"spread":0.2387523550883937,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002132802,0.0001663014,0.0001917118,0.0002411398,0.0002623477,0.0002971522,0.001521583,0.00003667882,0.00004082347],"category_scores_gemma":[0.0004437434,0.0001330625,0.00005059524,0.001533305,0.001571293,0.000852872,0.0006247224,0.0001768284,0.0001380772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009270749,"about_ca_system_score_gemma":0.0002115169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006056075,"about_ca_topic_score_gemma":0.000005848961,"domain_scores_codex":[0.9976422,0.0002182156,0.0002763089,0.0007616244,0.0005311987,0.0005704062],"domain_scores_gemma":[0.9984468,0.0002623012,0.00005860833,0.0008600809,0.0001376843,0.0002345605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001674168,0.0000809557,0.00105778,0.000004085002,0.000001040124,0.00001924046,0.0002518945,0.00003955448,0.00009817624,0.9765477,0.00002769452,0.02187023],"study_design_scores_gemma":[0.0007816991,0.0002405317,0.00877771,0.0001162795,0.000005624628,0.000172848,0.00002147164,0.5180898,0.01672451,0.4517574,0.002685548,0.0006266025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04696441,0.0001246696,0.9299664,0.0002635801,0.0006517124,0.000147555,6.211509e-7,0.0001312399,0.02174983],"genre_scores_gemma":[0.8765677,0.000009075855,0.1230274,0.0003295416,0.00004118304,0.000006306159,6.086902e-7,0.000004366245,0.00001380361],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8296033,"threshold_uncertainty_score":0.5789495,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056850725","doi":"10.1145/1119439.1119440","title":"Unfolding partiality and disjunctions in stable model semantics","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Partial evaluation; Computer science; Stable model semantics; Semantics (computer science); Modular design; Programming language; Program transformation; Model transformation; Theoretical computer science; Disjunctive normal form; Transformation (genetics); Stability (learning theory); Core (optical fiber); State (computer science); Operational semantics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02826933730030486,"gpt":0.2572350780560444,"spread":0.2289657407557395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002012962,0.000145849,0.0001556454,0.0001380489,0.0003151812,0.000127574,0.0003061928,0.0000677994,0.00001454599],"category_scores_gemma":[0.00002181297,0.0001377064,0.00005758926,0.0004419348,0.0000618058,0.0003723658,0.00002187754,0.0001761616,0.00002375897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007405273,"about_ca_system_score_gemma":0.00008213166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009341087,"about_ca_topic_score_gemma":0.000177584,"domain_scores_codex":[0.998843,0.00006085612,0.0002597908,0.0003738413,0.0002145826,0.0002479065],"domain_scores_gemma":[0.999222,0.0002973961,0.00005540006,0.0002822347,0.0000816521,0.00006134038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004586852,0.000203538,0.000508462,0.000007377858,0.000006205617,0.000003755023,0.00009537423,0.768661,0.00002720281,0.2282507,0.00005917136,0.002172553],"study_design_scores_gemma":[0.0002738938,0.00003110326,0.005731964,0.000008663006,0.000006484068,0.0000104774,0.00001134675,0.6472245,0.00006387549,0.346417,0.00009851399,0.0001220844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02688276,0.0000728716,0.9698123,0.001354618,0.0001703883,0.0001265564,0.000009732352,0.0001431665,0.001427631],"genre_scores_gemma":[0.9081866,0.00001208153,0.091282,0.0001657361,0.0000251814,0.00002230712,0.000009770581,0.000006307157,0.0002900785],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8813038,"threshold_uncertainty_score":0.5615503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2335720172","doi":"10.1016/j.inffus.2016.02.006","title":"The basic principles of uncertain information fusion. An organised review of merging rules in different representation frameworks","year":2016,"lang":"en","type":"article","venue":"Information Fusion","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast","keywords":"Computer science; Formalism (music); Consistency (knowledge bases); Representation (politics); Set (abstract data type); Theoretical computer science; Complete information; Fusion rules; Possibility theory; Data mining; Artificial intelligence; Mathematics; Mathematical economics; Fuzzy set; Fuzzy logic","retraction":null,"screen_n_in":null,"score":{"opus":0.01800898211087913,"gpt":0.2640093276521168,"spread":0.2460003455412377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008321517,0.000128207,0.0002080824,0.0001876635,0.0001395111,0.00007209253,0.0005541979,0.0001135953,0.00004307488],"category_scores_gemma":[0.0008692394,0.00006678182,0.00006088378,0.0004235681,0.00004992463,0.003647364,0.0002451912,0.0001209827,0.00003716799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007641762,"about_ca_system_score_gemma":0.00007935677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004049067,"about_ca_topic_score_gemma":0.00001656577,"domain_scores_codex":[0.9981801,0.0001415691,0.0009555906,0.0001001836,0.0004533569,0.0001692381],"domain_scores_gemma":[0.9979458,0.0002830309,0.0007948427,0.0005285002,0.0003962832,0.00005151427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00004776239,0.00007214573,0.003913454,0.001197537,0.000008805559,2.982798e-7,0.01008575,0.000149515,0.001549243,0.1106744,0.0005489415,0.8717522],"study_design_scores_gemma":[0.007347321,0.001104074,0.4865122,0.03773435,0.00008206968,0.00003491972,0.004287733,0.2599788,0.07594974,0.02537273,0.09980081,0.001795258],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4814767,0.001260392,0.5001181,0.003537626,0.0008376125,0.001454984,0.00001710127,0.0001895387,0.01110792],"genre_scores_gemma":[0.9893767,0.007268708,0.002784387,0.0003840434,0.00003666351,0.00003792353,0.00006647212,0.000004784567,0.00004026566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8699569,"threshold_uncertainty_score":0.2723283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2174235632","doi":"10.1017/s1471068402001539","title":"A framework for compiling preferences in logic programs","year":2003,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":129,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Logic programming; Logic program; Answer set programming; Programming language; Set (abstract data type); Stable model semantics; Semantics (computer science); Compiler; Theoretical computer science; Implementation; Preference; Range (aeronautics); Program transformation; Operational semantics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06676812964106243,"gpt":0.3393231874155429,"spread":0.2725550577744805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006031319,0.0001893143,0.0003086524,0.0000882634,0.0001641209,0.0001877198,0.0004539211,0.0001515657,0.000007116456],"category_scores_gemma":[0.007125098,0.0001469058,0.00006856693,0.0004161189,0.0001824174,0.0006593638,0.0001110453,0.0002771851,0.000003493763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000170168,"about_ca_system_score_gemma":0.00006806925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006881708,"about_ca_topic_score_gemma":0.000005261587,"domain_scores_codex":[0.9976472,0.0009857331,0.000342095,0.0004354268,0.0001547944,0.0004347083],"domain_scores_gemma":[0.9933169,0.005826415,0.000321598,0.0003132833,0.000135693,0.00008604146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001102637,0.0002652947,0.0004659854,0.00007384113,0.00001745057,0.000006953701,0.002080565,0.000005352369,0.00002340882,0.7730833,0.000001088282,0.2238665],"study_design_scores_gemma":[0.000406282,0.0007219985,0.00006527644,0.0001243337,0.00002873289,0.00007510544,0.002269848,0.0002482231,0.0002416154,0.9860529,0.009545353,0.0002203657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008074726,0.004449002,0.9675447,0.0002714053,0.0002317039,0.0008581387,5.371901e-7,0.0001403456,0.01842941],"genre_scores_gemma":[0.5822746,0.00007771058,0.4173998,0.0001113023,0.00002243132,0.00008043736,0.000001222088,0.000005200583,0.00002733933],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5741999,"threshold_uncertainty_score":0.8529923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154093507","doi":"10.1016/j.jcss.2006.10.013","title":"First-order query rewriting for inconsistent databases","year":2006,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Rewriting; Computer science; Conjunctive query; Boolean conjunctive query; Class (philosophy); Set (abstract data type); Query language; Query optimization; Database; Sargable; Order (exchange); Data integrity; Database query; Theoretical computer science; Information retrieval; Web search query; Relational database; Programming language; Search engine; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03061450247099549,"gpt":0.2605431602986567,"spread":0.2299286578276612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001638801,0.0001203503,0.0002933558,0.0001769425,0.000467254,0.0004528423,0.0006435072,0.00002739183,7.884011e-7],"category_scores_gemma":[0.00003402061,0.00008005489,0.0001024879,0.0003046863,0.0001194934,0.0007779149,0.0001747041,0.00006968854,0.000001624277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003086963,"about_ca_system_score_gemma":0.0001387009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004176323,"about_ca_topic_score_gemma":0.00003291067,"domain_scores_codex":[0.9985703,0.00007325298,0.0005261379,0.0002454087,0.0003371681,0.0002477844],"domain_scores_gemma":[0.9985991,0.0004301883,0.0004059779,0.0001507591,0.0003266857,0.00008725604],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002359365,0.0002240004,0.03152381,0.0006921304,0.0000647249,0.0001342422,0.001249498,0.003404124,0.000134965,0.9153719,0.01914496,0.02803204],"study_design_scores_gemma":[0.001852916,0.001299884,0.01791014,0.001604284,0.00005022863,0.004169815,0.000912492,0.9326092,0.0002989516,0.004583624,0.03406144,0.0006470096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02724362,0.001983348,0.9661132,0.0004455843,0.001275226,0.0001127998,0.000001893526,0.00003489248,0.002789489],"genre_scores_gemma":[0.8098055,0.00001486612,0.1892665,0.00007156265,0.0007830824,0.000002322815,2.731331e-7,0.000002991485,0.00005289472],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9292051,"threshold_uncertainty_score":0.4366769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1499053674","doi":"10.1007/s10994-011-5259-2","title":"ILP turns 20","year":2011,"lang":"en","type":"article","venue":"Machine Learning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Biotechnology and Biological Sciences Research Council; Microsoft Research; University of Oxford; Imperial College London; University of New South Wales; Royal Academy of Engineering; Jawaharlal Nehru University","keywords":"Inductive logic programming; Analogy; Subject (documents); Implementation; Computer science; Artificial intelligence; Development (topology); Projection (relational algebra); Cognitive science; Machine learning; Epistemology; Psychology; Programming language; Mathematics; Algorithm; Library science","retraction":null,"screen_n_in":null,"score":{"opus":0.02463525336756793,"gpt":0.2229630992481061,"spread":0.1983278458805381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002867598,0.0001255106,0.0001306007,0.00007109987,0.0001605389,0.00007586957,0.000648656,0.00005596195,0.000300937],"category_scores_gemma":[0.0001176382,0.0001022247,0.00006729466,0.0002152551,0.00003080445,0.0002292362,0.0002044829,0.0003343872,0.0005621173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001842395,"about_ca_system_score_gemma":0.00002205958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001087343,"about_ca_topic_score_gemma":0.0000542672,"domain_scores_codex":[0.999059,0.0001015048,0.0001263113,0.0002900965,0.0001326425,0.0002904602],"domain_scores_gemma":[0.9994503,0.00004672141,0.00007012935,0.0002975463,0.00003749639,0.00009775574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002597922,0.0003243928,0.3337207,0.00007055476,0.00008673107,0.0002855208,0.06400905,0.0002833721,0.001875062,0.4122467,0.002977057,0.1840949],"study_design_scores_gemma":[0.001412905,0.0007246406,0.08740404,0.0000588516,0.00002916232,0.0001915651,0.0001650882,0.2860895,0.002984132,0.02379225,0.5959365,0.001211382],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03242247,0.001267568,0.3115771,0.0002773168,0.0007539078,0.0001119868,6.503285e-7,0.000939865,0.6526492],"genre_scores_gemma":[0.9767629,0.00001415351,0.01366651,0.0001679649,0.0001119543,0.000004448857,0.000002609745,0.00001157341,0.009257906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9443404,"threshold_uncertainty_score":0.7225068,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120747446","doi":"10.1007/s10992-011-9191-5","title":"On the Ternary Relation and Conditionality","year":2011,"lang":"en","type":"article","venue":"Journal of Philosophical Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Conditionality; Relation (database); Ternary operation; Semantics (computer science); Mathematical economics; Epistemology; Binary relation; Mathematics; Computer science; Discrete mathematics; Philosophy; Political science; Law; Data mining; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.07743447063397903,"gpt":0.2576858007410835,"spread":0.1802513301071045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005948952,0.00007894911,0.0001244535,0.00004904869,0.0001081005,0.00003493565,0.0004093327,0.00006511572,0.0000960656],"category_scores_gemma":[0.0002658334,0.00004094318,0.000077209,0.00009283896,0.0001062647,0.0002300535,0.0000836196,0.000317892,0.0000332442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002004561,"about_ca_system_score_gemma":0.00002695013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.831715e-7,"about_ca_topic_score_gemma":1.522865e-7,"domain_scores_codex":[0.9991689,0.0001392432,0.0002385074,0.0001157456,0.0002369321,0.0001006215],"domain_scores_gemma":[0.9991026,0.0003184773,0.0002208308,0.0001615002,0.0001095275,0.00008704315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001824789,0.00008648042,0.0009062122,0.000002048889,0.00001222665,0.00004880941,0.0001666145,0.000001978961,0.00005171425,0.9980956,0.0002806483,0.0003293596],"study_design_scores_gemma":[0.0001775023,0.0003794846,0.0674885,0.0000166897,0.00000660128,0.0002079938,0.000003238421,0.00049608,0.00006086214,0.9310008,0.0001097959,0.00005249775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5682452,0.001191941,0.1248892,0.09532312,0.001471473,0.0002960142,0.00000464187,0.00009452732,0.2084838],"genre_scores_gemma":[0.9963286,0.00002144618,0.00193908,0.001432046,0.0002525813,9.281585e-7,2.123118e-7,0.000002430206,0.0000226871],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4280833,"threshold_uncertainty_score":0.1669614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118078906","doi":"10.1142/s0218213001000623","title":"EFFICIENT DEFEASIBLE REASONING SYSTEMS","year":2001,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Australian Research Council; Griffith University","keywords":"Defeasible estate; Forward chaining; Computer science; Non-monotonic logic; Defeasible reasoning; Backward chaining; Chaining; Logic programming; Simplicity; Description logic; Monotonic function; Theoretical computer science; Artificial intelligence; Programming language; Inference engine; Expert system; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06739144958469796,"gpt":0.3207842718029209,"spread":0.2533928222182229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001045075,0.0001744439,0.0002635465,0.0003475375,0.000108622,0.0009395748,0.002073451,0.00008017077,0.00006235111],"category_scores_gemma":[0.0007150588,0.0001457355,0.0002165996,0.0003912793,0.00006116352,0.0005469344,0.0001573711,0.0002802944,0.0002361458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001888372,"about_ca_system_score_gemma":0.0001892328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002616537,"about_ca_topic_score_gemma":0.00000659041,"domain_scores_codex":[0.9975277,0.0001014495,0.000890752,0.0002535987,0.0009100749,0.0003164783],"domain_scores_gemma":[0.9973928,0.0002430402,0.0005873851,0.0002657195,0.001331938,0.0001790581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009791301,0.0003242306,0.0004605559,0.000003369314,0.00009355223,0.0005648108,0.001027496,0.06227547,0.001348418,0.5991895,0.0003911726,0.3342235],"study_design_scores_gemma":[0.0002492578,0.0007747686,0.001611205,0.0005510321,0.00004023022,0.004365072,0.001190718,0.903924,0.01579116,0.05099833,0.01976084,0.0007433296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07306461,0.000687519,0.9108782,0.000852841,0.004700581,0.0001089506,0.000001753086,0.00006094747,0.009644533],"genre_scores_gemma":[0.9897953,0.0001016932,0.008661092,0.0001438382,0.001082286,0.000002689384,9.785592e-7,0.000008771995,0.0002033093],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9167307,"threshold_uncertainty_score":0.9060342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143134544","doi":"10.1111/j.1467-9329.2007.00379.x","title":"RULE‐FOLLOWING WITHOUT REASONS: WITTGENSTEIN'S QUIETISM AND THE CONSTITUTIVE QUESTION","year":2007,"lang":"en","type":"article","venue":"Ratio","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Conflation; Epistemology; Objectivity (philosophy); Meaning (existential); Philosophy; Focus (optics)","retraction":null,"screen_n_in":null,"score":{"opus":0.008774348466961375,"gpt":0.2528014911494923,"spread":0.2440271426825309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001308246,0.0001182869,0.0001544755,0.00004443292,0.0003195477,0.0001900901,0.0002657043,0.00006245414,0.000003850068],"category_scores_gemma":[0.0002475306,0.00007705696,0.00005592014,0.0001880129,0.0002338237,0.0003867521,0.0001071074,0.0001211591,0.00004224257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003588828,"about_ca_system_score_gemma":0.0000846818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007240585,"about_ca_topic_score_gemma":0.00009929614,"domain_scores_codex":[0.9990556,0.0001134044,0.0001621357,0.0002660785,0.0001814609,0.0002213558],"domain_scores_gemma":[0.9992676,0.0002242539,0.00007708724,0.0002919835,0.00006419876,0.00007481144],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001594015,0.0000133161,0.004253637,0.000003279306,0.00002061532,0.00002094697,0.002319123,0.000004036614,0.0002097635,0.9801962,0.0002004126,0.01274275],"study_design_scores_gemma":[0.02719413,0.0009067506,0.2076004,0.001245728,0.0005045512,0.001518299,0.003085318,0.1131158,0.02490135,0.5347599,0.08117505,0.00399269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04227147,0.001761163,0.8539602,0.0007073128,0.0008236404,0.0003359105,5.851641e-7,0.0001926335,0.09994715],"genre_scores_gemma":[0.9881454,0.00003272159,0.01051871,0.0002910227,0.0001339678,0.000009497991,0.000001344555,0.000004677628,0.0008626385],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.945874,"threshold_uncertainty_score":0.3142292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162068502","doi":"10.1111/j.0824-7935.2004.00240.x","title":"A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; European Commission","keywords":"Preference; Artificial intelligence; Set (abstract data type); Variety (cybernetics); Computer science; Representation (politics); Machine learning; Qualitative reasoning; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1967773018483017,"gpt":0.3044729413807262,"spread":0.1076956395324244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000667777,0.0001169045,0.0001705978,0.0001395529,0.00006876713,0.0000738448,0.0004498929,0.00005857991,0.000002227786],"category_scores_gemma":[0.0003118329,0.0001130453,0.00002380525,0.000558138,0.000112567,0.0003071177,0.0001440565,0.0001306235,0.00001171068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000648918,"about_ca_system_score_gemma":0.0002248781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002458416,"about_ca_topic_score_gemma":0.0002075783,"domain_scores_codex":[0.998816,0.0000921947,0.0003331876,0.0003931553,0.000191538,0.0001739961],"domain_scores_gemma":[0.9990233,0.0003892465,0.0001506839,0.0001967299,0.0001828837,0.00005715005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001626706,0.000162638,0.06920705,0.0000410386,0.00001142626,0.000002814597,0.003557516,0.2216778,0.00005761099,0.6652869,0.000002378127,0.03997651],"study_design_scores_gemma":[0.00009534768,0.00004020296,0.44877,0.00007145036,0.000001324786,0.000008031058,0.00004661111,0.5060926,0.0005351647,0.04423392,0.000002964918,0.0001023489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2150272,0.000487256,0.7835643,0.00004951524,0.00005863311,0.0001195984,0.000001592842,0.00002934903,0.0006625714],"genre_scores_gemma":[0.9274231,0.00004197811,0.07247086,0.00001581941,0.000009129388,0.00001344061,0.00001113876,0.000004551409,0.00001004072],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7123958,"threshold_uncertainty_score":0.4609853,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971508608","doi":"10.1016/j.artint.2004.11.004","title":"Partition-based logical reasoning for first-order and propositional theories","year":2004,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Soundness; Axiom; Computer science; Theoretical computer science; Completeness (order theory); Propositional calculus; Propositional formula; Automated reasoning; Satisfiability; Propositional variable; Mathematics; Algorithm; Description logic; Intermediate logic; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0351189575418359,"gpt":0.2849085808585126,"spread":0.2497896233166767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003064404,0.0001432666,0.0001361565,0.00005013764,0.0004709354,0.0002335074,0.0003219577,0.00007517128,0.00003677664],"category_scores_gemma":[0.0003942029,0.0001182486,0.00006047268,0.0002658741,0.0002369781,0.0002694794,0.00007585249,0.00009380431,0.00007021648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004120724,"about_ca_system_score_gemma":0.0001344518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000251138,"about_ca_topic_score_gemma":0.0001169535,"domain_scores_codex":[0.9988458,0.00002995745,0.0002377821,0.0004134126,0.0001665758,0.0003065345],"domain_scores_gemma":[0.9990992,0.0002918594,0.00006581628,0.0002192451,0.0002208805,0.0001030059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002322636,0.0001103356,0.0001629362,0.00001244197,0.000005514824,0.000005127655,0.0005507009,0.0021038,0.0001552803,0.9871186,0.00002445314,0.009727564],"study_design_scores_gemma":[0.00006900971,0.0002635277,0.0002489824,0.000046166,0.000007188963,0.0000111712,0.00007792222,0.07026698,0.03075523,0.897495,0.0005452987,0.0002135485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01115305,0.0001588544,0.984601,0.002375712,0.0002605132,0.0002676199,0.000004590949,0.0001417889,0.001036864],"genre_scores_gemma":[0.9314735,0.00000925173,0.06788866,0.0003486792,0.0001501712,0.00008710659,0.000006935243,0.000006858597,0.00002885925],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9203205,"threshold_uncertainty_score":0.4822039,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042629502","doi":"10.1145/1342991.1342998","title":"A logic of nonmonotone inductive definitions","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Datalog; Iterated function; Higher-order logic; Inductive logic programming; Stable model semantics; Logic programming; Computational logic; Rotation formalisms in three dimensions; Computer science; Classical logic; Dynamic logic (digital electronics); Programming language; Semantics (computer science); Theoretical computer science; Mathematics; Multimodal logic; Description logic","retraction":null,"screen_n_in":null,"score":{"opus":0.08719166760923303,"gpt":0.273118851588242,"spread":0.185927183979009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001218203,0.000194716,0.0002511922,0.0002757478,0.0004558666,0.00002538375,0.0007631589,0.0001051299,0.0001112909],"category_scores_gemma":[0.00007157862,0.0001761084,0.0001817202,0.0007364351,0.0002215764,0.0003252352,0.00002720816,0.000256241,0.0002579741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006841662,"about_ca_system_score_gemma":0.000196183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002652646,"about_ca_topic_score_gemma":0.000008033145,"domain_scores_codex":[0.9985338,0.0001021498,0.0003397038,0.000424512,0.0003520143,0.0002477983],"domain_scores_gemma":[0.998307,0.0006551835,0.0001405484,0.0004828719,0.0003124242,0.000102001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004586393,0.001902764,0.0003200193,0.00002293503,0.000151034,0.00006682426,0.002363994,0.1397116,0.0002420059,0.8408493,0.0003538299,0.01396982],"study_design_scores_gemma":[0.001134911,0.0007403982,0.01907398,0.00002981502,0.00003111065,0.0003602596,0.00009188653,0.02706919,0.001088136,0.9495775,0.0003475019,0.0004553024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01538821,0.00007208137,0.976098,0.0009446272,0.000281427,0.0001947457,0.00002401309,0.0001841412,0.006812778],"genre_scores_gemma":[0.7944648,0.00004343054,0.2049014,0.0003897377,0.00002895222,0.00004188987,0.00001245804,0.000007744123,0.0001096134],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7790766,"threshold_uncertainty_score":0.7181492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W14927176","doi":"","title":"On How Agents Make Friends: Mechanisms for Trust Acquisition","year":2000,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Simple (philosophy); Cognition; Knowledge acquisition; Knowledge management; Psychology; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.01753937689623419,"gpt":0.2417128593504206,"spread":0.2241734824541864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001489161,0.000123568,0.0001122655,0.0000509675,0.0001551607,0.000191267,0.0004756301,0.00006939158,0.000927809],"category_scores_gemma":[0.00001170298,0.00009623318,0.00008648624,0.0001444677,0.00001272496,0.0002008624,0.00004440204,0.00004669809,0.0004159222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003322358,"about_ca_system_score_gemma":0.00001854235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000374751,"about_ca_topic_score_gemma":0.000005624627,"domain_scores_codex":[0.9990796,0.00002437773,0.00008999977,0.0003575822,0.0001690327,0.0002794234],"domain_scores_gemma":[0.9994294,0.00005129648,0.00003083519,0.0003569704,0.00004315913,0.00008834183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001418744,0.00009220807,0.000006882834,0.000006063026,0.00001083216,0.000005442922,0.000328954,0.00001490108,0.0001542754,0.8919117,0.009795557,0.09765898],"study_design_scores_gemma":[0.00301892,0.00176914,0.002054647,0.00005141819,0.00003112347,0.00003559529,0.000122623,0.2087345,0.02660645,0.6385636,0.1180656,0.0009463887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009710168,0.00001738247,0.8343267,0.0007848562,0.0004117997,0.0002379922,0.000004277047,0.0002611661,0.1542456],"genre_scores_gemma":[0.9226496,0.000008282786,0.03561914,0.00162487,0.0001136105,0.00004877283,0.000009103691,0.00001033404,0.03991628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9129394,"threshold_uncertainty_score":0.9999855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039987681","doi":"10.1016/j.artint.2014.03.007","title":"On our best behaviour","year":2014,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Clearance; Computer science; Epistemology; Context (archaeology); Cognitive science; Artificial intelligence; Artificial general intelligence; Psychology; Data science; Philosophy; History","retraction":null,"screen_n_in":null,"score":{"opus":0.05246896499110883,"gpt":0.3039279630235122,"spread":0.2514589980324033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003965579,0.000163768,0.0001530674,0.0000886005,0.0001978498,0.000208507,0.001017985,0.00007922139,0.00003631191],"category_scores_gemma":[0.0002958544,0.0001422285,0.00008521682,0.0003175166,0.00003927807,0.0002145413,0.0001693942,0.0001817276,0.005757063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003075236,"about_ca_system_score_gemma":0.00003599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007594478,"about_ca_topic_score_gemma":0.00008904487,"domain_scores_codex":[0.9986047,0.00008202311,0.0002634475,0.0004682058,0.0002122325,0.0003693829],"domain_scores_gemma":[0.9989179,0.0001268007,0.00007599498,0.0006302624,0.000105211,0.0001438802],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003905186,0.0001471134,0.0002417523,0.000001969928,0.000002594844,0.000004923684,0.0003958633,0.0001094728,0.0002308815,0.8130439,0.0005151495,0.1853025],"study_design_scores_gemma":[0.00005477064,0.001212725,0.0009235966,0.00007005421,0.00001808184,0.00002555242,0.0004330256,0.1305547,0.1314179,0.7271287,0.007318646,0.0008422564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04309573,0.00003599436,0.9231673,0.0009529438,0.001536251,0.0001213176,9.062776e-7,0.0002275796,0.03086195],"genre_scores_gemma":[0.9951158,0.000006139389,0.003376288,0.0004036054,0.000269268,0.00001159158,0.000001006699,0.000009870496,0.0008064462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.95202,"threshold_uncertainty_score":0.9950171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058110750","doi":"10.1016/s0743-1066(99)00071-0","title":"Abducing through negation as failure: stable models within the independent choice logic","year":2000,"lang":"en","type":"article","venue":"The Journal of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Negation; Stable model semantics; Semantics (computer science); Proposition; Logic program; Computer science; Programming language; Higher-order logic; Set (abstract data type); Circumscription; Simple (philosophy); Theoretical computer science; Non-monotonic logic; Game semantics; Logic programming; Mathematics; Description logic; Epistemology; Operational semantics; Denotational semantics","retraction":null,"screen_n_in":null,"score":{"opus":0.03285870710316814,"gpt":0.2698132210536349,"spread":0.2369545139504667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003043138,0.0002280434,0.0002843741,0.00005526739,0.000661139,0.0004901626,0.002052786,0.0001029555,0.0000612198],"category_scores_gemma":[0.0001989021,0.0001095678,0.000154303,0.0005671472,0.000127941,0.001478697,0.0002030397,0.0007248148,0.00005503044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00011553,"about_ca_system_score_gemma":0.0001844866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002150179,"about_ca_topic_score_gemma":0.00007658671,"domain_scores_codex":[0.9975625,0.0004250318,0.0006095507,0.0002341212,0.0006943527,0.0004744203],"domain_scores_gemma":[0.9980202,0.0004069895,0.0006730884,0.0005492308,0.0002530492,0.00009738885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001595145,0.0005583349,0.0004715102,0.00005434445,0.000286423,0.0001422264,0.05492112,0.1253067,0.0008242246,0.4765216,0.00142741,0.3393266],"study_design_scores_gemma":[0.001535334,0.001291961,0.0005036068,0.0002342516,0.0001857137,0.002899396,0.003285249,0.07509162,0.001795997,0.8908703,0.02166567,0.0006408462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1147338,0.004820846,0.8515945,0.00757349,0.0008827786,0.0007651308,5.181508e-7,0.0002072491,0.0194217],"genre_scores_gemma":[0.9624177,0.000163558,0.03570784,0.0007852279,0.0003581346,0.000008081798,4.333625e-7,0.00001252552,0.0005464532],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.847684,"threshold_uncertainty_score":0.5085014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159100004","doi":"10.1016/j.is.2008.01.005","title":"The complexity and approximation of fixing numerical attributes in databases under integrity constraints","year":2008,"lang":"en","type":"article","venue":"Information Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Database; Data integrity; Conjunctive query; Consistency (knowledge bases); Semantics (computer science); Computational complexity theory; Approximation algorithm; Aggregate (composite); Theoretical computer science; Time complexity; Relational database; Algorithm; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1007824357512097,"gpt":0.2798962895402359,"spread":0.1791138537890262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005750991,0.00006858188,0.0001371005,0.00006224618,0.0001663983,0.00008947508,0.0002171915,0.00003153693,0.000001289338],"category_scores_gemma":[0.0001688836,0.0000461976,0.00001853242,0.0002141165,0.0002350328,0.001330466,0.000100556,0.00009088418,0.00001159309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003653421,"about_ca_system_score_gemma":0.00006077046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001770017,"about_ca_topic_score_gemma":0.00001427316,"domain_scores_codex":[0.9991244,0.00009177178,0.0004014499,0.00007397008,0.000186074,0.0001222972],"domain_scores_gemma":[0.9991965,0.0002371458,0.0002091763,0.0001922345,0.0001310612,0.00003388204],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006915877,0.00003058084,0.03005589,0.0001085892,0.00001122033,9.392084e-7,0.005699186,0.0002295978,0.00001904268,0.9570096,0.0006371082,0.00619136],"study_design_scores_gemma":[0.001191911,0.00007217216,0.1866257,0.0002183942,0.000004346303,0.0003573491,0.004132112,0.7943742,0.000527896,0.002629724,0.009531344,0.0003348739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06342655,0.0001731066,0.9308814,0.0001522721,0.0002520075,0.0002548547,0.00001449741,0.00005392816,0.004791322],"genre_scores_gemma":[0.9983103,0.00001941634,0.001593111,0.00002575644,0.00001459407,0.0000106981,0.00001677004,0.000001023703,0.000008301987],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9543799,"threshold_uncertainty_score":0.1883883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155378065","doi":"10.1609/aaai.v29i1.9398","title":"asprin: Customizing Answer Set Preferences without a Headache","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Preference; Computer science; Set (abstract data type); Dominance (genetics); Logic program; Extensibility; Artificial intelligence; Theoretical computer science; Machine learning; Logic programming; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1649001642550685,"gpt":0.3202468155818483,"spread":0.1553466513267798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001083625,0.0003344723,0.0004065301,0.0001471622,0.0002171489,0.0004719486,0.003115426,0.0001471662,0.00004178272],"category_scores_gemma":[0.0008426568,0.000227418,0.0001488495,0.000774527,0.0003571588,0.0007232637,0.0007093917,0.0004321951,0.0002731744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008175712,"about_ca_system_score_gemma":0.0003501503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000104934,"about_ca_topic_score_gemma":0.00004610129,"domain_scores_codex":[0.9973904,0.00004461736,0.0005865329,0.0006993581,0.0007451159,0.0005339631],"domain_scores_gemma":[0.9976025,0.00009229542,0.0004467848,0.0004595159,0.001146614,0.0002523328],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008307229,0.0001779454,0.002965618,0.0000370127,0.00002617995,9.186867e-7,0.007172117,0.00003293122,0.005473911,0.947022,0.001046891,0.03596144],"study_design_scores_gemma":[0.0001483755,0.0006925995,0.0007385162,0.0004559828,0.00003836176,0.00002555239,0.003399387,0.07922384,0.4256529,0.4865638,0.002264932,0.000795714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6277146,0.0002977062,0.06049097,0.006061125,0.002768207,0.001434084,0.000009962097,0.0006796662,0.3005437],"genre_scores_gemma":[0.9945934,0.00002556577,0.004196766,0.0002044038,0.0001500772,0.00003550976,4.666803e-7,0.00001492381,0.0007788673],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4604582,"threshold_uncertainty_score":0.9273837,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093837890","doi":"10.1007/s11229-005-6198-x","title":"Argumentation Schemes and Enthymemes","year":2005,"lang":"en","type":"article","venue":"Synthese","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Argumentation theory; Philosophy of language; Defeasible estate; Epistemology; Philosophy of science; Metaphysics; Class (philosophy); Computer science; Defeasible reasoning; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.008882417552413664,"gpt":0.2331486018250246,"spread":0.224266184272611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001221848,0.00006775159,0.00006696685,0.00004000022,0.00006653547,0.00009340388,0.0002043965,0.00002591323,0.00005195368],"category_scores_gemma":[0.00006345278,0.00005492502,0.00002114243,0.00007714088,0.00003097496,0.0003655157,0.00009416328,0.00003811204,0.0001740412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001611071,"about_ca_system_score_gemma":0.0000143094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000512508,"about_ca_topic_score_gemma":0.00001006509,"domain_scores_codex":[0.9994859,0.00002425226,0.00007808869,0.0001832729,0.00009268748,0.0001358038],"domain_scores_gemma":[0.9996507,0.00006480281,0.00002970956,0.0001800378,0.00002076773,0.00005398915],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003953827,0.0000922457,0.005530777,0.00001532359,0.0000199469,0.000004979789,0.003397515,0.000005291898,0.004274672,0.1829854,0.001531147,0.8021387],"study_design_scores_gemma":[0.001205532,0.0001990964,0.02539183,0.0001058668,0.00003159242,0.00008208087,0.000586377,0.05886422,0.2922341,0.01708519,0.6032245,0.0009896125],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7304424,0.004029976,0.1645091,0.004191992,0.000504578,0.0002794898,0.000001984635,0.0005143308,0.09552616],"genre_scores_gemma":[0.9833336,0.00005164674,0.01527867,0.0001385353,0.0001045014,0.000007672631,4.590795e-7,0.000003420446,0.00108144],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8011491,"threshold_uncertainty_score":0.2239777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W152378237","doi":"","title":"Planning with qualitative temporal preferences","year":2006,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Planner; Computer science; Preference; Semantics (computer science); Situation calculus; Markov decision process; Theoretical computer science; Forward chaining; Chaining; Artificial intelligence; Bounded function; Markov process; Programming language; Mathematics; Expert system","retraction":null,"screen_n_in":null,"score":{"opus":0.03629015454195903,"gpt":0.30038045848939,"spread":0.2640903039474309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001842041,0.00009383045,0.0001021977,0.00004146453,0.00008973402,0.0001222715,0.0003597056,0.00002798988,0.0000251437],"category_scores_gemma":[0.000009552998,0.00005610908,0.000020175,0.0001920049,0.00004743403,0.0003196482,0.00006586534,0.00006034521,0.00006027888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001179979,"about_ca_system_score_gemma":0.00005218709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003495605,"about_ca_topic_score_gemma":0.0001648731,"domain_scores_codex":[0.9992526,0.00006515808,0.0001050002,0.0002357795,0.0001548489,0.000186667],"domain_scores_gemma":[0.999579,0.0001013419,0.00005217492,0.0001713693,0.00005741435,0.0000387661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001091408,0.00009372271,0.03853808,0.00001070267,0.00001669685,0.00002571223,0.02150417,0.00009338638,0.00005360426,0.9280588,0.008892658,0.002701541],"study_design_scores_gemma":[0.004178085,0.003346681,0.2062016,0.0003357902,0.00003939055,0.0001429499,0.02293065,0.04576444,0.01245999,0.6454087,0.0559812,0.003210514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0997182,0.0001334321,0.5034629,0.000131965,0.00007308982,0.00006453309,4.242192e-7,0.0002311588,0.3961843],"genre_scores_gemma":[0.9425265,3.562712e-7,0.05196835,0.00005000713,0.00005417513,0.000007026333,0.000002333561,0.000002932546,0.005388371],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8428082,"threshold_uncertainty_score":0.2288062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W19153916","doi":"10.1080/00048670802607154","title":"A framework for representing and solving NP search problems","year":2005,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Answer set programming; Constraint programming; Parameterized complexity; Computer science; Constraint satisfaction; Extension (predicate logic); Satisfiability; Boolean satisfiability problem; Set (abstract data type); Theoretical computer science; Solver; Strengths and weaknesses; Backtracking; Constraint (computer-aided design); Mathematical optimization; Programming language; Mathematics; Artificial intelligence; Algorithm; Stochastic programming","retraction":null,"screen_n_in":null,"score":{"opus":0.2083022900782457,"gpt":0.3866366578885083,"spread":0.1783343678102626,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009645208,0.0001502718,0.0001524644,0.0001491809,0.0003555831,0.0004894396,0.0005948741,0.0001124307,0.00006720248],"category_scores_gemma":[0.001352691,0.0001412029,0.00005788861,0.0003037931,0.0001092156,0.0004107865,0.0001793735,0.0002613326,0.0001170001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006389032,"about_ca_system_score_gemma":0.0002094692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001367171,"about_ca_topic_score_gemma":0.00004961733,"domain_scores_codex":[0.9981775,0.00006033606,0.0003325891,0.0005692844,0.0005023201,0.0003580163],"domain_scores_gemma":[0.9979953,0.0008015443,0.00009865077,0.0002296977,0.0007628423,0.0001119186],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008458258,0.00006072026,0.00005900293,0.00001048513,0.000005858249,5.296998e-7,0.0009449069,0.0006875041,0.0005532519,0.8416809,0.00007571036,0.1559126],"study_design_scores_gemma":[0.00001965027,0.00006729896,0.0001080255,0.00004953081,0.000001661474,0.000004450539,0.00007024685,0.4523407,0.007587567,0.5384727,0.001132256,0.0001458974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003245312,0.00009548604,0.9782361,0.004834598,0.0001975451,0.0003234149,0.000004053729,0.0001121786,0.01295132],"genre_scores_gemma":[0.9019688,0.0000263159,0.0969623,0.0003437997,0.0003441234,0.00005437749,0.000002777247,0.000007847427,0.0002896302],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8987235,"threshold_uncertainty_score":0.5758089,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2188435450","doi":"10.1609/aaai.v29i1.9665","title":"Planning Over Multi-Agent Epistemic States: A Classical Planning Approach","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Plan (archaeology); Computer science; Task (project management); Perspective (graphical); Automated planning and scheduling; Management science; Artificial intelligence; Engineering; Systems engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1946618284340639,"gpt":0.3375614251305387,"spread":0.1428995966964748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009157324,0.000348118,0.0004059556,0.0001573007,0.0002292758,0.0004240136,0.002488499,0.0001560816,0.00001285],"category_scores_gemma":[0.000599406,0.0002475949,0.0001548615,0.0006445662,0.0003289673,0.0005146972,0.0007132264,0.0005242855,0.0001045267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001368209,"about_ca_system_score_gemma":0.0002247883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003248277,"about_ca_topic_score_gemma":0.000002081288,"domain_scores_codex":[0.997269,0.00004179897,0.0006430065,0.0007482834,0.0007045316,0.000593413],"domain_scores_gemma":[0.9981076,0.0001172525,0.0004653764,0.0003856198,0.0006397114,0.0002844579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001446873,0.0006337359,0.004233587,0.0001018124,0.00004838038,0.000006135599,0.02671795,0.001832332,0.005499001,0.9439465,0.002032032,0.01480381],"study_design_scores_gemma":[0.000164999,0.000382797,0.0006781907,0.0004948731,0.00002355631,0.00002660073,0.004237961,0.8498269,0.04906346,0.09377453,0.0007465255,0.0005795672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2692319,0.0003792295,0.6622857,0.002097161,0.001676486,0.00107626,0.000008867323,0.0005240614,0.06272036],"genre_scores_gemma":[0.9887456,0.000009966427,0.01019625,0.0001928036,0.0001253528,0.0000396622,0.000001399498,0.00001935571,0.0006696656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.850172,"threshold_uncertainty_score":0.9999976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977208552","doi":"10.1145/383779.383780","title":"On knowledge-based programming with sensing in the situation calculus","year":2001,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Axiom; Computer science; Interpreter; Situation calculus; Modality (human–computer interaction); Artificial intelligence; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02945810078838233,"gpt":0.2759510668570427,"spread":0.2464929660686604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003634844,0.0001850889,0.0001382904,0.0002382008,0.0003888438,0.0001707527,0.0005438717,0.00006520627,0.00001331888],"category_scores_gemma":[0.00004285612,0.0001235167,0.00007422692,0.001019266,0.00006729205,0.0001870698,0.000006823499,0.0002787881,0.0001030419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001153633,"about_ca_system_score_gemma":0.0001509995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002080516,"about_ca_topic_score_gemma":0.0001641883,"domain_scores_codex":[0.9985436,0.0002098797,0.0002067242,0.0003979443,0.000369065,0.0002728185],"domain_scores_gemma":[0.9981757,0.001144706,0.00007056406,0.0003999825,0.0001550272,0.00005397918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007024954,0.0008133386,0.0001098534,0.00001044177,0.00001824063,0.00007219181,0.002008301,0.6840578,0.000007897092,0.05046314,0.00003807498,0.2623305],"study_design_scores_gemma":[0.001553205,0.0009316435,0.007354265,0.00009379749,0.0000206216,0.0001495192,0.0001886074,0.9306037,0.00007974255,0.0578617,0.0007911724,0.0003720392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02002904,0.00002917536,0.9751883,0.002116438,0.0001444548,0.0003212606,0.000001054718,0.0001548165,0.00201548],"genre_scores_gemma":[0.9226236,0.000001784607,0.07642996,0.000808738,0.00003537302,0.00002812197,0.00001114451,0.000008660698,0.00005262676],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9025946,"threshold_uncertainty_score":0.5036867,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1019278634228602,"gpt":0.3532861719610607,"spread":0.2513583085382004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006050183,0.00007071069,0.0001253486,0.00005900071,0.00004202841,0.0000346637,0.0002529116,0.00002928294,0.00002369542],"category_scores_gemma":[0.000185147,0.00004897867,0.00002796635,0.0001953771,0.00004810767,0.00007957594,0.00008563816,0.00004923243,0.00001654045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004734395,"about_ca_system_score_gemma":0.00002238814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007409506,"about_ca_topic_score_gemma":0.0001897142,"domain_scores_codex":[0.9992611,0.00003291851,0.0003414968,0.0001279076,0.0001301681,0.0001064139],"domain_scores_gemma":[0.9992028,0.0003642349,0.0001337467,0.0001977115,0.00007498315,0.00002654503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004168353,0.0001171643,0.00002906331,0.000008562523,0.000005414783,6.223978e-7,0.009968369,0.0004982408,0.00126899,0.9438589,0.00002012337,0.04422037],"study_design_scores_gemma":[0.00001199935,0.0001036062,0.0002164235,0.00004493602,0.000001887261,3.067013e-7,0.00075547,0.002920898,0.2247164,0.7711772,0.000006475052,0.00004446939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5222778,0.0000234918,0.4764397,0.0009342065,0.00002991206,0.0001097979,0.000002225249,0.000004817892,0.0001780661],"genre_scores_gemma":[0.9839255,0.00003797364,0.01574402,0.0002676992,0.00001193196,0.000005596564,8.869061e-7,0.000002983065,0.00000336608],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4616477,"threshold_uncertainty_score":0.1997292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078103992","doi":"10.1016/j.ic.2005.02.004","title":"Bisimulation and cocongruence for probabilistic systems","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; University of Oxford","keywords":"Bisimulation; Mathematics; Equivalence (formal languages); Probabilistic logic; Event (particle physics); Characterization (materials science); Algebra over a field; Discrete mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01105095026478895,"gpt":0.2372247477449823,"spread":0.2261737974801933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001692594,0.0000659639,0.00007265854,0.00007696254,0.000135276,0.0003932124,0.00006156777,0.00003645767,2.864462e-7],"category_scores_gemma":[0.00003462072,0.00005888106,0.00001172818,0.0001065602,0.00002199009,0.001341653,0.00002549327,0.00002364364,0.000006510223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000195482,"about_ca_system_score_gemma":0.00002290425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004988892,"about_ca_topic_score_gemma":0.000005395944,"domain_scores_codex":[0.9994952,0.00001647083,0.0002186261,0.000092305,0.00008847986,0.00008891675],"domain_scores_gemma":[0.9995166,0.00009822965,0.0001186773,0.00005875491,0.0001786141,0.00002912405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008526627,0.00001751826,0.001244718,0.0001934793,0.000004269669,1.756329e-7,0.001147943,0.05738368,0.00001863512,0.8323973,0.0006284427,0.1069553],"study_design_scores_gemma":[0.0003899894,0.00004673967,0.0117451,0.00001325639,0.000002961695,0.000009066227,0.0000355283,0.9671335,0.00001106417,0.01716943,0.003362321,0.0000810424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05040921,0.00009642971,0.946988,0.0001058294,0.0001853171,0.0003995154,0.000002083588,0.0001011746,0.001712413],"genre_scores_gemma":[0.9938852,0.000003689423,0.005914967,0.00005634359,0.00003489008,0.00003139531,0.00003667258,0.000001626052,0.0000352568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.943476,"threshold_uncertainty_score":0.3791756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W65369927","doi":"","title":"Iterated revision as prioritized merging","year":2006,"lang":"en","type":"preprint","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Iterated function; Sequence (biology); Interpretation (philosophy); Belief revision; Computer science; Operator (biology); Pearl; Mathematical economics; Epistemology; Artificial intelligence; Theoretical computer science; Mathematics; Philosophy; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0156652635409444,"gpt":0.2693463618526725,"spread":0.2536810983117281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004527667,0.0003551478,0.0004586799,0.000175393,0.0001488564,0.0007852111,0.001552479,0.0003195709,0.0001370249],"category_scores_gemma":[0.0001113762,0.0002871343,0.0002145874,0.0003167533,0.00003066491,0.0002174871,0.002390011,0.0005244974,0.0005685549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009887188,"about_ca_system_score_gemma":0.0002406247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003037027,"about_ca_topic_score_gemma":0.00001365483,"domain_scores_codex":[0.9977096,0.0001448175,0.000425796,0.000959777,0.0003578834,0.0004020762],"domain_scores_gemma":[0.9981824,0.00008976297,0.0002074894,0.001136115,0.0002597135,0.0001245663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002979004,0.0004337139,0.001586194,0.0007045108,0.0001524884,0.0004924113,0.002687719,0.0004608917,0.001318707,0.5123464,0.1174656,0.3623216],"study_design_scores_gemma":[0.002764616,0.000218902,0.004598884,0.002458282,0.0001062641,0.000162218,0.00003320934,0.4543888,0.006731421,0.1349119,0.3897367,0.00388889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01037702,0.00198667,0.5780092,0.000542631,0.00208304,0.0004538652,0.00000198149,0.001192612,0.405353],"genre_scores_gemma":[0.7099822,0.0004109378,0.2224624,0.0007774225,0.001117993,0.00004699062,0.0001205986,0.00006399625,0.06501745],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6996052,"threshold_uncertainty_score":0.9999581,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984778493","doi":"10.1016/j.datak.2010.01.005","title":"The consistency extractor system: Answer set programs for consistent query answering in databases","year":2010,"lang":"en","type":"article","venue":"Data & Knowledge Engineering","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Datalog; Answer set programming; Database theory; Consistency (knowledge bases); Extractor; Programming language; Relational database; Deductive database; Set (abstract data type); Information retrieval; Database; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.05562206053334146,"gpt":0.2879527423906523,"spread":0.2323306818573109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001715842,0.0003577741,0.0003832351,0.000147296,0.0002853672,0.0004477024,0.002568144,0.0001122716,0.000003240793],"category_scores_gemma":[0.0008591687,0.0002772148,0.00009797751,0.0004491321,0.0000981108,0.0009895324,0.001093125,0.0004798523,0.00004680631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008306347,"about_ca_system_score_gemma":0.000219988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005242854,"about_ca_topic_score_gemma":0.001190141,"domain_scores_codex":[0.9975635,0.00006342433,0.0005496275,0.0008498347,0.0001996825,0.0007739195],"domain_scores_gemma":[0.9960417,0.001087762,0.0001144306,0.002382209,0.0001712233,0.0002026791],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000668346,0.0008457435,0.009182418,0.003307548,0.0003199284,0.0001509809,0.003266337,0.00006354248,0.0190269,0.6273285,0.01139465,0.3250466],"study_design_scores_gemma":[0.0007315585,0.00005155501,0.002181541,0.0004060371,0.00003166293,0.00009638934,0.0002639345,0.6499594,0.0008074042,0.00003382256,0.3448209,0.0006156866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07192456,0.01370325,0.8768162,0.0002592513,0.02199094,0.004119345,0.0009596533,0.002587637,0.007639124],"genre_scores_gemma":[0.941013,0.00006540693,0.05710709,0.00001228937,0.0006653691,0.000355376,0.0005393531,0.00006540387,0.0001766874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8690885,"threshold_uncertainty_score":0.999968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128924604","doi":"10.1145/544741.544746","title":"The cognitive agents specification language and verification environment for multiagent systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science; Programming language; Specification language; Language Of Temporal Ordering Specification; Multi-agent system; Formal verification; Formal specification; Frame (networking); Model checking; Verification; Software engineering; Artificial intelligence; Software system; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.04007593874261665,"gpt":0.2436014835689504,"spread":0.2035255448263338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001785759,0.00006775143,0.00005453131,0.00001618742,0.0002144099,0.0001502571,0.0001882886,0.00002621056,0.00001863404],"category_scores_gemma":[0.00003529083,0.00004389253,0.00002189832,0.00003901204,0.00003334307,0.0001076103,0.00004471237,0.00002779458,0.0001425124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002971411,"about_ca_system_score_gemma":0.000002396403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009491261,"about_ca_topic_score_gemma":0.000002515865,"domain_scores_codex":[0.9993998,0.00003869993,0.0001123907,0.0002199577,0.0001017034,0.0001274418],"domain_scores_gemma":[0.9995027,0.0001485987,0.00006039739,0.0002203115,0.00002435369,0.00004370462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001956818,0.0004091939,0.0008891938,0.0000628241,0.00008585185,0.000004871757,0.02956459,0.00004623584,0.00224565,0.2550217,0.01526264,0.6963876],"study_design_scores_gemma":[0.001349634,0.0001765188,0.02418206,0.0000279951,0.00002710073,0.00001293988,0.004356346,0.7973886,0.003500574,0.0002380785,0.1683851,0.0003551582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0198645,0.003410737,0.9630431,0.0004367114,0.000348631,0.0009750472,0.000004956287,0.00009021385,0.01182613],"genre_scores_gemma":[0.9920586,0.0005422798,0.001547798,0.00003512493,0.00006567786,0.0001236367,0.000005101489,0.0000042482,0.005617539],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9721941,"threshold_uncertainty_score":0.1831756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1814275833","doi":"10.1007/978-3-642-14052-5_27","title":"On the Formalization of the Lebesgue Integration Theory in HOL","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Lebesgue integration; Mathematics; Discrete mathematics; Algebra over a field; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01240906446906039,"gpt":0.2241418883832711,"spread":0.2117328239142107,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001708346,0.0002962923,0.0002644793,0.0003502046,0.0002370658,0.0002175348,0.003520539,0.0002799342,0.00001993972],"category_scores_gemma":[0.0004567252,0.0001543626,0.0001137401,0.0006423742,0.0007413752,0.0003425003,0.0007844903,0.001005339,0.00001331532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001198044,"about_ca_system_score_gemma":0.0003254257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001807851,"about_ca_topic_score_gemma":0.0004645749,"domain_scores_codex":[0.9979433,0.0001050736,0.0003776498,0.0006340645,0.0006201983,0.000319663],"domain_scores_gemma":[0.9972179,0.0009644567,0.0003152608,0.001271567,0.0001899836,0.0000408323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004402136,0.00002245037,0.00005339805,0.000008715941,0.000002303529,0.000002315617,0.00218238,0.002532484,0.0003654475,0.8351406,0.000009847372,0.1596756],"study_design_scores_gemma":[0.000128895,0.0000994233,0.0006084453,0.0003706591,0.000003728919,0.00001348287,6.580873e-7,0.1683828,0.01421964,0.8155906,0.0003280063,0.0002537098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008897542,0.00009724068,0.9832696,0.0006274686,0.001727945,0.0004282919,0.000001462639,0.00003545912,0.01292282],"genre_scores_gemma":[0.9840466,0.00001640189,0.01407031,0.00126679,0.0001845304,0.00001159157,0.000001746576,0.00001541738,0.0003866218],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9831569,"threshold_uncertainty_score":0.6542097,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134275439","doi":"10.1016/j.artint.2010.04.003","title":"Iterated belief change in the situation calculus","year":2010,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Belief revision; Situation calculus; Introspection; Computer science; Iterated function; Formalism (music); Action (physics); Artificial intelligence; Calculus (dental); Cognitive science; Epistemology; Mathematics; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.07049695495656967,"gpt":0.3167840827131049,"spread":0.2462871277565353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006918695,0.0001146697,0.0000976463,0.00008918031,0.0001537956,0.0002507198,0.0009813224,0.00008206977,0.00006184946],"category_scores_gemma":[0.0002066872,0.00008036628,0.00004271474,0.0007529966,0.00007322735,0.0004221619,0.0001056678,0.0002991913,0.0006185859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001525679,"about_ca_system_score_gemma":0.00003669244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004043483,"about_ca_topic_score_gemma":0.003624707,"domain_scores_codex":[0.9988641,0.00009248611,0.0002455325,0.0003043685,0.0002093617,0.0002841469],"domain_scores_gemma":[0.9991615,0.0001580739,0.00006136795,0.0004642896,0.0001045564,0.00005024394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003518492,0.0001227938,0.0005311249,0.000002535634,0.000001836741,0.00001838541,0.0170776,0.0000126434,0.003563885,0.6974657,0.00006758366,0.2811324],"study_design_scores_gemma":[0.00007535872,0.0002841499,0.0215123,0.00003829013,0.00001056482,0.00006067139,0.0007395741,0.6804764,0.08604488,0.2007046,0.009349379,0.0007037523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4426852,0.0001710704,0.5381221,0.004703021,0.002688037,0.0006675034,0.000001989455,0.0002274638,0.01073366],"genre_scores_gemma":[0.997677,0.000009787212,0.001185484,0.0007265732,0.0002986409,0.00004973882,0.000002783222,0.000004664841,0.00004536713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6804638,"threshold_uncertainty_score":0.7950876,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001364423","doi":"10.1111/j.1368-0005.2004.00066.x","title":"Symmetry in Structure Building","year":2004,"lang":"en","type":"article","venue":"Syntax","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Specifier; Complement (music); Selection (genetic algorithm); Locality; Head (geology); Computer science; Repertoire; Symmetry (geometry); Composition (language); Mathematics; Theoretical computer science; Artificial intelligence; Physics; Linguistics; Philosophy; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.00782222753060681,"gpt":0.2343997856214841,"spread":0.2265775580908773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001018415,0.00009099668,0.0001077144,0.00009679847,0.00005380077,0.00007119677,0.000535445,0.00006391905,0.00001671934],"category_scores_gemma":[0.00005773043,0.00007675789,0.00003393498,0.0003842433,0.00002014118,0.0002209435,0.0001544356,0.0001431579,0.00005156515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009001476,"about_ca_system_score_gemma":0.00006038316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009337653,"about_ca_topic_score_gemma":0.0001141357,"domain_scores_codex":[0.9992606,0.0000205648,0.0001066294,0.0002534835,0.0001185214,0.0002401855],"domain_scores_gemma":[0.9995786,0.00002673784,0.00003261169,0.0002873046,0.00001823004,0.00005649354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001767447,0.00003671597,0.005643765,0.00001573757,0.000006358608,0.00007304204,0.001113518,0.0001927197,0.004305162,0.9670352,0.000136833,0.02143917],"study_design_scores_gemma":[0.001943126,0.0001567247,0.0776359,0.0002262756,0.00000869484,0.0002100638,0.0001506988,0.002899604,0.07541535,0.831771,0.008679181,0.0009033931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8398871,0.0005799749,0.1404875,0.0005990589,0.0009132581,0.0001164206,0.00000185966,0.0001924199,0.01722245],"genre_scores_gemma":[0.9713299,0.000004695825,0.02834816,0.0001400481,0.00008483649,0.000001992669,4.474163e-7,0.00000484578,0.00008509344],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1352642,"threshold_uncertainty_score":0.3130096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998261607","doi":"10.1016/j.apal.2004.06.004","title":"Dynamic topological logic","year":2004,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Topological space; Topological dynamics; Topology (electrical circuits); Mathematics; Topological vector space; Topological entropy in physics; Topological algebra; Topological quantum number; Context (archaeology); Category of topological spaces; Connected space; Zero-dimensional space; Topological manifold; Topological tensor product; Pure mathematics; Physics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.03988905272719816,"gpt":0.2942966727551921,"spread":0.2544076200279939,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002662512,0.0001914514,0.0003093501,0.00007057281,0.0001218707,0.00005884354,0.0005855887,0.0001611688,0.00003032598],"category_scores_gemma":[0.00003177568,0.0001342605,0.00009080536,0.0002570524,0.0001767876,0.0001125854,0.0002694066,0.0001616646,0.00007070661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008593856,"about_ca_system_score_gemma":0.00003745865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006111426,"about_ca_topic_score_gemma":0.00001094923,"domain_scores_codex":[0.9987577,0.00002456452,0.0002360437,0.0004349615,0.0001697128,0.0003770574],"domain_scores_gemma":[0.9992945,0.00005731967,0.0001133825,0.0003456331,0.00006360328,0.0001255861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008495204,0.0001277471,0.00005544951,0.00001664885,0.00001292523,0.00001569788,0.0002635648,0.00008053468,0.001098268,0.9892764,0.0002508639,0.008793385],"study_design_scores_gemma":[0.0004378773,0.0003410444,0.003674815,0.00001247184,0.000007177808,0.00003281726,0.00009225133,0.0001877649,0.003403974,0.9901419,0.001411976,0.0002559797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.449946,0.006882268,0.296472,0.01539967,0.0004770716,0.0007368505,0.000009419148,0.0006299989,0.2294467],"genre_scores_gemma":[0.9882945,0.0003423399,0.008872933,0.002277149,0.00004146448,0.00001404903,0.000003284062,0.000005320642,0.0001489969],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5383484,"threshold_uncertainty_score":0.5474983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975880448","doi":"10.1145/502090.502100","title":"Logics with aggregate operators","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Bell (Canada)","funders":"","keywords":"Aggregate (composite); Rotation formalisms in three dimensions; Computer science; Class (philosophy); Query language; Set (abstract data type); Theoretical computer science; Relation (database); Deductive database; Mathematics; Programming language; Database; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01872268061635748,"gpt":0.2368956651088596,"spread":0.2181729844925021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003340837,0.00007655352,0.0001250253,0.00003775364,0.0001104625,0.0001152061,0.003336279,0.00002918484,0.00001347231],"category_scores_gemma":[0.0003472379,0.00003323522,0.0000831481,0.0002843112,0.00003813587,0.0002927101,0.0005295991,0.0001908914,0.00002290293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003204584,"about_ca_system_score_gemma":0.00009512847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002586303,"about_ca_topic_score_gemma":0.000006518245,"domain_scores_codex":[0.9993215,0.00005793063,0.0001578393,0.00008112018,0.0002307628,0.0001509038],"domain_scores_gemma":[0.998696,0.00004956494,0.0002342796,0.0007897169,0.0001568852,0.00007351813],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004284223,0.001281269,0.4489037,0.00005325067,0.0007590792,0.003518818,0.01504936,0.004805371,0.006202351,0.1316733,0.1949005,0.1924246],"study_design_scores_gemma":[0.006277125,0.003477004,0.164861,0.0008367259,0.0001986323,0.02514372,0.0004877452,0.008522926,0.02523298,0.1995478,0.5640287,0.001385628],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9406466,0.001201245,0.03127129,0.01180858,0.001559829,0.00008578564,2.358295e-7,0.00003447508,0.01339191],"genre_scores_gemma":[0.9821184,0.0001272515,0.01549832,0.0006541972,0.000261691,3.517734e-7,1.869048e-8,0.000004947477,0.001334803],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3691282,"threshold_uncertainty_score":0.6199692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2172984480","doi":"","title":"Iterated Belief Change in the Situation Calculus","year":2000,"lang":"en","type":"article","venue":"RMIT Research Repository (RMIT University Library)","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Belief revision; Situation calculus; Introspection; Computer science; Iterated function; Formalism (music); Artificial intelligence; Action (physics); Calculus (dental); Cognitive science; Epistemology; Mathematics; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.04489300842060951,"gpt":0.2688608055038994,"spread":0.2239677970832899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005917777,0.0001604447,0.0001632477,0.0004082113,0.000763826,0.0004968931,0.002179625,0.0001462074,0.000163753],"category_scores_gemma":[0.00002961156,0.0001323547,0.00009219749,0.002139585,0.0001704797,0.003092314,0.0003917777,0.0005929678,0.0002710008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001371271,"about_ca_system_score_gemma":0.0002363089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008171299,"about_ca_topic_score_gemma":0.00009160219,"domain_scores_codex":[0.9967095,0.001278867,0.0001684622,0.0005491343,0.0006901662,0.0006039206],"domain_scores_gemma":[0.9986007,0.0002916283,0.00004487134,0.0007752912,0.0001101109,0.0001774078],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000550293,0.002612354,0.09704044,0.0001916597,0.0001580119,0.01449063,0.08497174,0.0001012687,0.001828529,0.4752088,0.1288652,0.1939811],"study_design_scores_gemma":[0.002452464,0.0008748721,0.3108919,0.0002098267,0.00002061635,0.0001700479,0.001200803,0.04706826,0.005029966,0.001937732,0.629196,0.0009475101],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5732637,0.0004890502,0.0005838925,0.003914696,0.0002054633,0.0007614255,0.00000343583,0.0003416574,0.4204367],"genre_scores_gemma":[0.9519078,0.0001421109,0.0003576739,0.0001867725,0.0002378436,0.000006681975,0.00001179779,0.00001093985,0.04713834],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5003307,"threshold_uncertainty_score":0.5874809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976639815","doi":"10.1016/s0004-3702(00)00049-7","title":"Expressing preferences in default logic","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Default logic; Default; Default rule; Non-monotonic logic; Preference; Computer science; Context (archaeology); Mathematical economics; Representation (politics); Artificial intelligence; Mathematics; Economics; Multimodal logic; Autoepistemic logic; Microeconomics; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.07587255919728449,"gpt":0.3066760791920676,"spread":0.2308035199947832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003219276,0.0001568215,0.0001710023,0.00009682329,0.0001389558,0.0002551609,0.001022363,0.00008657289,0.0005805079],"category_scores_gemma":[0.0001003944,0.0001333566,0.0000559804,0.0005729496,0.0001062139,0.0005145587,0.0001101024,0.0001827312,0.001445415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003436736,"about_ca_system_score_gemma":0.00006252006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002033064,"about_ca_topic_score_gemma":0.0003653979,"domain_scores_codex":[0.9984263,0.0001009797,0.0003626503,0.0004857669,0.0002050213,0.0004193425],"domain_scores_gemma":[0.9992387,0.0001474462,0.00005543124,0.0004156879,0.00005308149,0.00008960322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009724455,0.0001263467,0.0006699209,0.00000509692,0.000002683618,0.00002654413,0.002608533,0.0009339082,0.0006246011,0.1793204,0.00007443935,0.8155978],"study_design_scores_gemma":[0.00003931339,0.000157358,0.002436547,0.00009264892,0.000004072288,0.00001905373,0.000325888,0.1218396,0.06007349,0.811586,0.002902733,0.000523348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3709047,0.0008669365,0.5014852,0.000541523,0.0006575129,0.0002779995,0.000001223543,0.0003795906,0.1248853],"genre_scores_gemma":[0.9914672,0.00006974011,0.007690926,0.0001854118,0.00009370198,0.00001686817,8.9626e-7,0.000005795691,0.0004694257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8150744,"threshold_uncertainty_score":0.9993321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2795456052","doi":"10.1017/s1471068415000150","title":"Abstract gringo","year":2015,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Griffith University; Deutsche Forschungsgemeinschaft; Simon Fraser University; National Science Foundation","keywords":"Computer science; Programming language; ASCII; Semantics (computer science); Syntax; Operational semantics; Natural language processing","retraction":null,"screen_n_in":null,"score":{"opus":0.04921704846220617,"gpt":0.3125891107936691,"spread":0.2633720623314629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005306801,0.0001193499,0.000164958,0.00004989204,0.00009175191,0.0001325691,0.0004135053,0.00006908301,0.000008201406],"category_scores_gemma":[0.003490038,0.00009218481,0.00003914656,0.0001839714,0.0001215944,0.0009956666,0.0002285691,0.0001680168,0.0000325163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001344504,"about_ca_system_score_gemma":0.000061499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001522299,"about_ca_topic_score_gemma":0.000001146502,"domain_scores_codex":[0.9987851,0.0003474745,0.0001949858,0.0002510105,0.0001771113,0.0002443058],"domain_scores_gemma":[0.9974965,0.001664415,0.0002272062,0.0003064117,0.0001549219,0.0001504956],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009071916,0.0001049625,0.0000796286,0.00002165026,0.00001775619,0.0000279022,0.002818306,0.000003012376,0.0001135311,0.7403656,0.00004116072,0.2563158],"study_design_scores_gemma":[0.001252443,0.001012632,0.0010034,0.00008368936,0.0000840477,0.0007636251,0.004378193,0.0002638996,0.001564271,0.722815,0.2661837,0.0005950312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02326371,0.00901609,0.3840271,0.001478279,0.0007573366,0.0004463969,8.573177e-7,0.0004967086,0.5805136],"genre_scores_gemma":[0.9342471,0.00005260469,0.06525294,0.0001861057,0.00007733503,0.000008320333,7.401818e-7,0.000005306927,0.0001695087],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9109834,"threshold_uncertainty_score":0.4178154,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043753407","doi":"10.1007/s11229-005-9063-z","title":"The Case for Psychologism in Default and Inheritance Reasoning","year":2005,"lang":"en","type":"article","venue":"Synthese","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Division of Materials Research; Natural Sciences and Engineering Research Council of Canada; Universität Salzburg; University of Alberta","keywords":"Object (grammar); Semantic reasoner; Non-monotonic logic; Class (philosophy); Default logic; Inference; Zeno's paradoxes; Defeasible reasoning; Computer science; Default rule; Epistemology; Statement (logic); Artificial intelligence; Philosophy; Sociology; Description logic","retraction":null,"screen_n_in":null,"score":{"opus":0.02037252022230052,"gpt":0.2858765888486398,"spread":0.2655040686263393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006480195,0.00009599825,0.0001021003,0.00003204944,0.000207759,0.000131513,0.000386676,0.00005569716,0.00000202413],"category_scores_gemma":[0.0005513853,0.00006343141,0.0000318144,0.0001425979,0.00007672534,0.0002146385,0.00009838142,0.00009881829,0.00001630086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002830294,"about_ca_system_score_gemma":0.00001960611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003745624,"about_ca_topic_score_gemma":0.0009378088,"domain_scores_codex":[0.9991696,0.00006159143,0.0001392977,0.0002856918,0.00005645259,0.0002873313],"domain_scores_gemma":[0.9990546,0.0004453996,0.00004843823,0.0003618249,0.00003335191,0.00005634784],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001681974,0.00006967894,0.001940578,0.00001201129,0.000009494728,0.0002430313,0.002696388,0.00002086213,0.0002127997,0.1657182,0.00175416,0.827306],"study_design_scores_gemma":[0.003704164,0.0005266067,0.03082327,0.0003801545,0.00002784242,0.00723192,0.00229278,0.3957337,0.003754823,0.09128802,0.4624874,0.001749226],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7819359,0.009744252,0.1646642,0.01010749,0.0007909179,0.0008374479,0.000004932255,0.0003120881,0.03160279],"genre_scores_gemma":[0.9749046,0.00009327509,0.02424137,0.0001743628,0.00009698285,0.00006371784,1.16182e-7,0.000006568794,0.0004190213],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8255568,"threshold_uncertainty_score":0.2586658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1511767298","doi":"10.1023/a:1026761331498","title":"Ability and Knowing How in the Situation Calculus","year":2000,"lang":"en","type":"article","venue":"Studia Logica","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; York University","funders":"","keywords":"Executable; Computer science; Plan (archaeology); Frame (networking); Artificial intelligence; Programming language; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02141528186502651,"gpt":0.2447857400587642,"spread":0.2233704581937377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000556235,0.00008510598,0.0001095618,0.00002109926,0.0001664396,0.0001217811,0.0003619543,0.00003822634,0.00002512373],"category_scores_gemma":[0.00009976434,0.00004945413,0.00002996083,0.0002653062,0.00005909933,0.0001747795,0.00008824633,0.0001031444,0.00003532463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002301578,"about_ca_system_score_gemma":0.00002344468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000280153,"about_ca_topic_score_gemma":0.00009289142,"domain_scores_codex":[0.9991608,0.0001554273,0.00008769003,0.0002762441,0.0001319048,0.000187926],"domain_scores_gemma":[0.9994861,0.0001680979,0.0000216572,0.0002712375,0.0000235402,0.00002931968],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0000145736,0.0004494778,0.03907232,0.00002431235,0.00002293789,0.00006925748,0.04366672,0.00004702349,0.0002505078,0.1961257,0.002769658,0.7174875],"study_design_scores_gemma":[0.0005792914,0.0001871528,0.9497229,0.00001191164,0.000008346117,0.00001730133,0.0005636452,0.004593274,0.00004190948,0.01962663,0.02440249,0.000245156],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7841108,0.00143707,0.01035339,0.005647963,0.0001688711,0.0004345178,8.541193e-7,0.0001214711,0.1977251],"genre_scores_gemma":[0.9987251,0.00007520053,0.0006913873,0.0002370799,0.00005396475,0.00001990102,5.062366e-7,0.000001612142,0.0001952659],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9106506,"threshold_uncertainty_score":0.2016681,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035142469","doi":"10.1017/s1471068414000210","title":"<tt>claspfolio</tt>2: Advances in Algorithm Selection for Answer Set Programming","year":2014,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Solver; Computer science; Selection (genetic algorithm); Modular design; Portfolio; Answer set programming; Set (abstract data type); Schedule; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01772871674396846,"gpt":0.3088274356007915,"spread":0.291098718856823,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006353862,0.000222616,0.0003222121,0.0001564399,0.0002291561,0.00018859,0.0004030555,0.000133478,0.000004710006],"category_scores_gemma":[0.002783243,0.0001867394,0.00007688875,0.0005302646,0.0001492548,0.001875954,0.0001367662,0.000240488,0.000004299202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003078269,"about_ca_system_score_gemma":0.00004981306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001779257,"about_ca_topic_score_gemma":0.00002088011,"domain_scores_codex":[0.9976026,0.0008228433,0.0003672879,0.0005127323,0.0001915372,0.0005030127],"domain_scores_gemma":[0.9957637,0.003289685,0.0003827247,0.0002591437,0.0002054384,0.00009930693],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001215943,0.0001319227,0.0001838895,0.00007775964,0.00001222201,0.000002160042,0.001176663,0.00001296081,0.00006308957,0.3155413,0.00000667916,0.6826698],"study_design_scores_gemma":[0.001865239,0.00250833,0.0001592589,0.0001466655,0.0001090867,0.0003230558,0.002178352,0.0206548,0.00148255,0.3228453,0.6470047,0.0007226481],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001388162,0.004135617,0.9877658,0.0002783128,0.0003083844,0.0006731539,0.000001152561,0.0001847757,0.005264683],"genre_scores_gemma":[0.4689618,0.0002886554,0.5300543,0.000188887,0.0001960629,0.0001643873,0.000005997433,0.0000161183,0.0001238247],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6819472,"threshold_uncertainty_score":0.7615011,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997780525","doi":"10.1007/s10817-007-9082-1","title":"Inferring Phylogenetic Trees Using Answer Set Programming","year":2007,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Austrian Science Fund; National Science Foundation","keywords":"Cladistics; Phylogenetic tree; Computer science; Taxon; Set (abstract data type); Formalism (music); Phylogenetics; Theoretical computer science; Representation (politics); Artificial intelligence; Programming language; Biology; Paleontology","retraction":null,"screen_n_in":null,"score":{"opus":0.02376857054380687,"gpt":0.2980693273525292,"spread":0.2743007568087223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001936728,0.0002528098,0.0004071772,0.0004525445,0.0002730371,0.0003500698,0.0008414992,0.0001496094,0.000009029505],"category_scores_gemma":[0.0003463748,0.0002054778,0.0002091831,0.0008348884,0.00006319574,0.0007125559,0.0001936592,0.0003947648,0.000009359329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001815149,"about_ca_system_score_gemma":0.0002214642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002460523,"about_ca_topic_score_gemma":0.00001859276,"domain_scores_codex":[0.9976709,0.0001016907,0.0007693358,0.0002687712,0.000511317,0.000677955],"domain_scores_gemma":[0.9980382,0.0001791473,0.0007935509,0.0003144578,0.000394965,0.0002797109],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002011122,0.0009882543,0.2400466,0.000263767,0.001173577,0.005924863,0.03117246,0.03687591,0.1597115,0.01549846,0.001238671,0.5069049],"study_design_scores_gemma":[0.00226641,0.0007836327,0.1021864,0.001463708,0.000159122,0.007137577,0.0008026409,0.8507912,0.02678573,0.0005427835,0.006034627,0.001046149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.739432,0.00128332,0.2566566,0.00003653147,0.0009098304,0.0001002244,3.213003e-7,0.0004161592,0.001164913],"genre_scores_gemma":[0.8451947,0.0000182659,0.1543531,0.00004143908,0.0003409506,5.711451e-7,4.607996e-7,0.00002127841,0.00002920244],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8139153,"threshold_uncertainty_score":0.8379143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028246200","doi":"10.1016/s0004-3702(03)00111-5","title":"A consistency-based approach for belief change","year":2003,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief revision; Disjoint sets; Computer science; Knowledge base; Sentence; Consistency (knowledge bases); Theoretical computer science; Implementation; Artificial intelligence; Natural language processing; Programming language; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1367035714510194,"gpt":0.3043874597105095,"spread":0.1676838882594901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005737065,0.0001844667,0.0002031213,0.00009690876,0.0002783007,0.0001604101,0.0006882597,0.00009495104,0.00003250769],"category_scores_gemma":[0.0003930659,0.000165682,0.0001421376,0.0004655912,0.0001282897,0.0002409362,0.00005586268,0.0001065496,0.0001588287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003647694,"about_ca_system_score_gemma":0.0001512776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002998464,"about_ca_topic_score_gemma":0.00003131649,"domain_scores_codex":[0.9984038,0.00008486493,0.000312435,0.0005477384,0.0001874262,0.0004637586],"domain_scores_gemma":[0.9987915,0.0002261914,0.00009478709,0.0005512748,0.0002017742,0.0001345362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007052035,0.0002098026,0.00009802264,0.0000205347,0.000006919384,0.000002885166,0.0007845825,0.0001002559,0.0002202063,0.9435861,0.0001685015,0.05479521],"study_design_scores_gemma":[0.0001328509,0.0005457199,0.00007769981,0.00003398783,0.00002709263,0.00002164997,0.0004194283,0.5455819,0.1546405,0.2679626,0.02969837,0.0008581789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004246388,0.0003877113,0.9783598,0.000241456,0.0005476163,0.0005328815,0.000003361841,0.0001741514,0.01932839],"genre_scores_gemma":[0.8480442,0.0000077111,0.1506854,0.0006821096,0.0001347263,0.0002575288,0.000004617939,0.00001233508,0.0001713298],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8476196,"threshold_uncertainty_score":0.6756317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W130404319","doi":"","title":"Tractable reasoning with incomplete first-order knowledge in dynamic systems with context-dependent actions","year":2005,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Sequence (biology); Computer science; Context (archaeology); Projection (relational algebra); Knowledge base; Action (physics); Knowledge-based systems; Order (exchange); Artificial intelligence; Base (topology); Theoretical computer science; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01608835302861022,"gpt":0.2447324675509788,"spread":0.2286441145223686,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003882612,0.0003104572,0.0004017997,0.0002315305,0.0003074705,0.0003460323,0.0007307431,0.0001016055,0.00005756022],"category_scores_gemma":[0.00002436515,0.0002123818,0.00005085594,0.0008469019,0.0000701143,0.001047478,0.0001579346,0.0003242744,0.0002471574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003624198,"about_ca_system_score_gemma":0.0002495648,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001134025,"about_ca_topic_score_gemma":0.04985492,"domain_scores_codex":[0.997977,0.00009183022,0.0003302852,0.0006726669,0.0003083326,0.0006199292],"domain_scores_gemma":[0.9986002,0.0001702674,0.00012881,0.0006966092,0.0002203787,0.0001837496],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004632891,0.005104298,0.06099528,0.0005879353,0.0009186873,0.0004504068,0.03120766,0.08283405,0.0005926145,0.6791522,0.004861464,0.1328321],"study_design_scores_gemma":[0.003470791,0.0005683771,0.01480364,0.0004948386,0.00004079254,0.000592333,0.001804215,0.8914796,0.0001324354,0.0000802836,0.08550603,0.001026624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07109137,0.002658473,0.7084805,0.0006975863,0.0004435192,0.0009261814,0.000004141903,0.000731419,0.2149668],"genre_scores_gemma":[0.976773,0.00003068436,0.01282922,0.00006268706,0.00007983173,0.0001117832,0.000003163632,0.00002673786,0.01008291],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9056816,"threshold_uncertainty_score":0.9674827,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2172181603","doi":"10.1016/j.artint.2007.02.002","title":"Inductive situation calculus","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Calculus (dental); Situation calculus; Rotation formalisms in three dimensions; Inductive logic programming; Many-valued logic; Monotone polygon; Inductive reasoning; Representation (politics); Algebra over a field; Computer science; Artificial intelligence; Pure mathematics; Description logic","retraction":null,"screen_n_in":null,"score":{"opus":0.05741505432868664,"gpt":0.3118936394500684,"spread":0.2544785851213818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007238376,0.0001242288,0.000115426,0.0001113466,0.0001815055,0.0001213815,0.0006086341,0.00008514807,0.0000446966],"category_scores_gemma":[0.0002336418,0.0001126334,0.00006091085,0.0006166914,0.00008989765,0.0004361222,0.0001511085,0.0001558741,0.001131254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007042546,"about_ca_system_score_gemma":0.00005949931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001320714,"about_ca_topic_score_gemma":0.0003605408,"domain_scores_codex":[0.9986737,0.000039432,0.0003036643,0.0003764197,0.0002373008,0.0003695316],"domain_scores_gemma":[0.9990742,0.0001644438,0.00008756288,0.00036511,0.0001893826,0.000119354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000005470915,0.00005609874,0.0001094094,0.000001419291,0.000004381392,0.00001394755,0.002656494,0.00002939996,0.002361899,0.6263527,0.00006181124,0.368347],"study_design_scores_gemma":[0.00003124912,0.0002100138,0.002791266,0.00001787624,0.000009253298,0.00002258437,0.0009751295,0.05348992,0.5454494,0.3927253,0.003792689,0.0004853894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04034494,0.00007025765,0.9393356,0.000247314,0.0008892915,0.0001193658,3.290504e-7,0.0001666456,0.01882624],"genre_scores_gemma":[0.9895404,0.000006273064,0.009778916,0.0001726724,0.0002652512,0.000004644214,0.000001158458,0.000006083215,0.000224625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9491954,"threshold_uncertainty_score":0.9996465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}