{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Giuseppe De Giacomo","is_ca":false},{"name":"Yves Lespérance","is_ca":true},{"name":"Hector J. Levesque","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001892821,0.0006744238,0.0005408698,0.001257498,0.001139461,0.00428333,0.00240215,0.0009600967,0.00798149],"category_scores_gemma":[0.006348699,0.0007223093,0.001098878,0.000971317,0.001621493,0.003880264,0.001641077,0.002149581,0.001575957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008014961,"about_ca_system_score_gemma":0.002639626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002237923,"about_ca_topic_score_gemma":0.003052756,"domain_scores_codex":[0.9990633,0.0002338878,0.0001026168,0.0002133173,0.0002976923,0.00008907147],"domain_scores_gemma":[0.9978714,0.001198736,0.0001672596,0.0003233889,0.0002610199,0.0001781774],"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.0004958277,0.0001707944,0.0009628136,0.0007596578,0.00007682228,0.0004566307,0.000703683,0.01210331,0.01089441,0.8261606,0.02416683,0.1230486],"study_design_scores_gemma":[0.0003919025,0.0001755584,0.0003940357,0.0002371403,0.0002439686,0.000925928,0.0001590189,0.1592296,0.02120594,0.5052261,0.3116573,0.0001535121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004444147,0.0003970851,0.9683884,0.0002742724,0.0002217217,0.00026092,0.0006531069,0.01450685,0.01085337],"genre_scores_gemma":[0.1490338,0.0007316384,0.8310709,0.000612266,0.0001931925,0.0008370463,0.001156838,0.001796163,0.01456811],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00798149,"threshold_uncertainty_score":0.02670074,"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","authors":[{"name":"Richard B. Scherl","is_ca":false},{"name":"Hector J. Levesque","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004245333,0.0007915858,0.001159404,0.002084927,0.003180589,0.006907688,0.002005928,0.005278386,0.0101049],"category_scores_gemma":[0.01165676,0.0006521878,0.001323655,0.002357404,0.0116505,0.01884831,0.003024863,0.003380874,0.0009913457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003824291,"about_ca_system_score_gemma":0.00270457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01584084,"about_ca_topic_score_gemma":0.007767883,"domain_scores_codex":[0.9974963,0.001228845,0.0001664611,0.0004857369,0.0003444213,0.0002782784],"domain_scores_gemma":[0.9940948,0.004490598,0.0003419011,0.0004903695,0.0003324446,0.0002500222],"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.00003596517,0.00001382789,0.00008867598,0.00003723035,0.000006890878,0.00004861175,0.0001971118,0.001142792,0.00004463359,0.9896231,0.001673339,0.007087992],"study_design_scores_gemma":[0.00001293378,0.000003418999,0.00003298731,0.00001624083,0.000005298657,0.00002048004,0.0001000612,0.001881953,0.00004035158,0.9941567,0.003724857,0.000004598406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07490284,0.02133378,0.5578963,0.07161082,0.001306863,0.0001767957,0.0009909999,0.0004869861,0.2712947],"genre_scores_gemma":[0.8484771,0.007530442,0.1157083,0.001839555,0.001004428,0.000272088,0.00101904,0.0001067512,0.02404237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01584084,"threshold_uncertainty_score":0.03380424,"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","authors":[{"name":"Leopoldo Bertossi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03460279,0.0009326924,0.003079035,0.004126355,0.002985293,0.0119176,0.005706687,0.005320413,0.003881936],"category_scores_gemma":[0.0788134,0.00198728,0.002290439,0.008777403,0.006738278,0.01794852,0.008526813,0.005165932,0.001213787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003002761,"about_ca_system_score_gemma":0.003352671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003173642,"about_ca_topic_score_gemma":0.001962613,"domain_scores_codex":[0.9467058,0.0267737,0.005838748,0.006642899,0.01233647,0.00170252],"domain_scores_gemma":[0.9313422,0.04979386,0.002462218,0.009696869,0.005890435,0.0008144685],"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.0004009495,0.0001853069,0.002248037,0.001112123,0.0003312156,0.0008303344,0.002123794,0.0244872,0.002296101,0.8164622,0.01825614,0.1312667],"study_design_scores_gemma":[0.00009506322,0.00004436261,0.0001897888,0.0001123562,0.00008963673,0.0003660146,0.0003826328,0.06352025,0.001256872,0.9201823,0.01372631,0.00003439394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01268266,0.005532105,0.962248,0.01072147,0.0002396578,0.0002866097,0.0008170172,0.001297337,0.006174994],"genre_scores_gemma":[0.257156,0.003882867,0.7246612,0.004543471,0.001156421,0.0007447725,0.003427589,0.0004179732,0.004009767],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03460279,"threshold_uncertainty_score":0.1829993,"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","authors":[{"name":"Ronald P. A. Petrick","is_ca":true},{"name":"Fahiem Bacchus","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003201226,0.001507027,0.002007081,0.003099673,0.001589896,0.00375098,0.004990167,0.00241776,0.008780109],"category_scores_gemma":[0.01040403,0.001300708,0.002238763,0.003721792,0.002015212,0.004876706,0.004560842,0.002418498,0.001015438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002446931,"about_ca_system_score_gemma":0.004921004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01964182,"about_ca_topic_score_gemma":0.02305434,"domain_scores_codex":[0.9978722,0.0007956652,0.0001547401,0.000738211,0.000268085,0.0001709889],"domain_scores_gemma":[0.992819,0.005062128,0.0004915728,0.0007273187,0.0006662988,0.0002336898],"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.0002099254,0.0002305202,0.003078593,0.0008382872,0.0003110262,0.0005983729,0.0009540389,0.6077789,0.001549168,0.08056041,0.007493967,0.2963967],"study_design_scores_gemma":[0.00004496564,0.0001129195,0.0007904879,0.0001771756,0.0001307378,0.0001609547,0.0009519766,0.7805341,0.0009923785,0.20483,0.01118825,0.00008593017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004679375,0.0003279016,0.9891829,0.0007347715,0.00004213278,0.0001893486,0.0005120907,0.0005234778,0.003807944],"genre_scores_gemma":[0.1820797,0.0006889721,0.8118894,0.0003437288,0.00009029456,0.0005846165,0.001528074,0.0001698689,0.002625286],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01964182,"threshold_uncertainty_score":0.03905499,"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","authors":[{"name":"Craig Boutilier","is_ca":true},{"name":"Raymond Reiter","is_ca":true},{"name":"Mikhail Soutchanski","is_ca":true},{"name":"Sebastian Thrun","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002469878,0.0006401483,0.0005856741,0.0006314011,0.001078498,0.003571429,0.00199594,0.001147116,0.003554962],"category_scores_gemma":[0.002464734,0.0006735682,0.001512226,0.0008389078,0.004398766,0.004680107,0.002101016,0.00304425,0.0007030797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001897493,"about_ca_system_score_gemma":0.002075329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003574028,"about_ca_topic_score_gemma":0.004691287,"domain_scores_codex":[0.9988247,0.0005111034,0.00007259087,0.000139516,0.0003014127,0.0001506811],"domain_scores_gemma":[0.9990422,0.0005681764,0.00008260546,0.0001316042,0.00007349619,0.0001017923],"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.000008916802,0.00001325059,0.00005923485,0.00002513892,0.000005981686,0.0000537814,0.0001763066,0.01140871,0.0003481651,0.9834978,0.0003601879,0.004042411],"study_design_scores_gemma":[0.00002092315,0.00001639711,0.00003868469,0.00001979538,0.00001414929,0.0000465624,0.00005345573,0.08147258,0.0006622191,0.9092903,0.008351909,0.00001308763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004445979,0.0002451201,0.9862949,0.0006967667,0.00003436234,0.00004570117,0.00006224553,0.0002857103,0.007889142],"genre_scores_gemma":[0.2383414,0.0006023596,0.7540221,0.0002932015,0.0001019759,0.0002582677,0.0001306379,0.0001114742,0.006138597],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003574028,"threshold_uncertainty_score":0.01376736,"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","authors":[{"name":"Stephen Cook","is_ca":true},{"name":"Phuong Nguyen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364634,0.0007362731,0.0006156623,0.001632566,0.002129018,0.006462173,0.001347339,0.001351746,0.01690562],"category_scores_gemma":[0.005041806,0.0007246413,0.001073746,0.001757481,0.007272355,0.01001661,0.002382577,0.005710397,0.005422459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004725527,"about_ca_system_score_gemma":0.002473824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001610751,"about_ca_topic_score_gemma":0.001088625,"domain_scores_codex":[0.9984893,0.0003395632,0.00009675971,0.0002032201,0.0007383002,0.0001328421],"domain_scores_gemma":[0.9969594,0.002019156,0.0001379334,0.0003521187,0.0004272433,0.0001040583],"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.000001896556,0.000003215189,0.00002138903,0.00005540753,0.000002918011,0.00001410594,0.00009429742,0.0002540353,0.00006138901,0.9843196,0.007083924,0.00808787],"study_design_scores_gemma":[0.00000298897,0.0000028356,0.00005649128,0.00006927386,0.000002632175,0.00004734923,0.00003383881,0.0006391882,0.00008158128,0.9085442,0.0905154,0.000004195631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.002915615,0.03422488,0.1866932,0.01828197,0.001449306,0.00009971821,0.0004544969,0.0007176135,0.7551631],"genre_scores_gemma":[0.3268569,0.0817169,0.210242,0.01014564,0.008078014,0.0009561797,0.002062943,0.001123156,0.3588184],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01690562,"threshold_uncertainty_score":0.05655497,"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","authors":[{"name":"Astrid Brousselle","is_ca":true},{"name":"François Champagne","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008969906,0.00112297,0.001363179,0.003290814,0.001220585,0.006597158,0.002674987,0.001292794,0.01401873],"category_scores_gemma":[0.03362457,0.0008845014,0.001749125,0.003111409,0.004611789,0.01149806,0.003554628,0.003947799,0.001656008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004886867,"about_ca_system_score_gemma":0.003698442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003123755,"about_ca_topic_score_gemma":0.002432376,"domain_scores_codex":[0.990008,0.005340335,0.0004422354,0.000911938,0.002802003,0.0004955665],"domain_scores_gemma":[0.9790909,0.01496201,0.0006418817,0.001938843,0.003000698,0.0003657374],"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.0001090871,0.0001331138,0.0006048567,0.0004048875,0.00005161262,0.00005159018,0.0002482407,0.01024179,0.0004421691,0.8130716,0.009982578,0.1646585],"study_design_scores_gemma":[0.00002433902,0.00001647841,0.0001496864,0.0001125053,0.00004235496,0.00004181799,0.00009549774,0.05346911,0.001255968,0.9364316,0.008345845,0.00001472133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004637887,0.002439819,0.9687876,0.003063837,0.0001500977,0.0001847635,0.0001840821,0.0009010577,0.01965087],"genre_scores_gemma":[0.3637052,0.00328256,0.6141466,0.001286096,0.0008631512,0.0006338229,0.0008502507,0.0008967596,0.01433548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01401873,"threshold_uncertainty_score":0.04743797,"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","authors":[{"name":"Franck van Breugel","is_ca":true},{"name":"James Worrell","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007874497,0.001020909,0.001519345,0.004270452,0.002471063,0.005357291,0.002980613,0.002943746,0.006075034],"category_scores_gemma":[0.03580166,0.0008884658,0.002289972,0.003673066,0.005316569,0.014863,0.006914367,0.007152298,0.001254287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002922508,"about_ca_system_score_gemma":0.002483765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001169902,"about_ca_topic_score_gemma":0.0007377815,"domain_scores_codex":[0.9896175,0.003708705,0.001069448,0.001932547,0.002972467,0.0006994571],"domain_scores_gemma":[0.9729859,0.0146324,0.002268667,0.00251806,0.00429988,0.003295182],"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.00004571658,0.00003574558,0.0003771833,0.00006215736,0.00001018786,0.00003801078,0.0002047125,0.002190304,0.00073154,0.9836802,0.0008987761,0.01172545],"study_design_scores_gemma":[0.00001918258,0.00009754345,0.0003641936,0.00003306088,0.00001715375,0.0001674026,0.00007383322,0.04030931,0.0006359988,0.9526153,0.00562766,0.00003943428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03471328,0.0005471348,0.9493998,0.002437674,0.0003931813,0.0001196182,0.0004556216,0.0004151306,0.01151854],"genre_scores_gemma":[0.5722201,0.001448166,0.4035078,0.001186437,0.00188759,0.001067016,0.001520846,0.0004972063,0.01666465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007874497,"threshold_uncertainty_score":0.04164487,"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","authors":[{"name":"Marcelo Arenas","is_ca":true},{"name":"Leopoldo Bertossi","is_ca":true},{"name":"Jan Chomicki","is_ca":false},{"name":"Xin He","is_ca":false},{"name":"Vijay Raghavan","is_ca":false},{"name":"Jeremy Spinrad","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01411701,0.0005084894,0.002052038,0.00321822,0.002605929,0.007421826,0.002476498,0.001797007,0.003713013],"category_scores_gemma":[0.04577315,0.001249733,0.00118699,0.006771742,0.002782952,0.0155936,0.004942082,0.002540907,0.0005400417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554138,"about_ca_system_score_gemma":0.001674355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001689756,"about_ca_topic_score_gemma":0.001554157,"domain_scores_codex":[0.9888111,0.003783127,0.001725289,0.001337334,0.003753764,0.0005893234],"domain_scores_gemma":[0.9633762,0.0194973,0.003058318,0.008567402,0.004844104,0.0006567057],"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.0005505206,0.0001003134,0.00518444,0.0003378697,0.0001118554,0.0005878178,0.0009965589,0.01902268,0.001370371,0.8864556,0.004892553,0.08038944],"study_design_scores_gemma":[0.00005936218,0.00004510944,0.0005172955,0.0000630635,0.0001345362,0.0005083852,0.0003515616,0.1182129,0.002528851,0.8703769,0.007166809,0.00003517324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09529568,0.002561873,0.8892129,0.002717274,0.0002658154,0.0001037252,0.0003953112,0.001051322,0.008395994],"genre_scores_gemma":[0.6912352,0.001354842,0.3000718,0.0004679625,0.0004570077,0.0001197551,0.0008930016,0.0002352077,0.005165121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01411701,"threshold_uncertainty_score":0.07465881,"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","authors":[{"name":"Tomi Janhunen","is_ca":false},{"name":"Ilkka Niemelä","is_ca":false},{"name":"Dietmar Seipel","is_ca":false},{"name":"Patrik Simons","is_ca":false},{"name":"Jia-Huai You","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002404284,0.0006048529,0.0004608088,0.0008059588,0.0006994105,0.001535825,0.001335108,0.0004943172,0.00278494],"category_scores_gemma":[0.004157874,0.0007605394,0.001388154,0.000840782,0.00291973,0.005343448,0.002856727,0.001879915,0.0005054903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001203011,"about_ca_system_score_gemma":0.001038973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00197701,"about_ca_topic_score_gemma":0.00300512,"domain_scores_codex":[0.9978588,0.0006660138,0.0001245663,0.0004289275,0.0007362855,0.0001853573],"domain_scores_gemma":[0.9981828,0.0008747171,0.0001166342,0.0005039584,0.0002556676,0.00006612324],"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.0001340152,0.0000637554,0.0009847715,0.0001754312,0.00004981449,0.0001699348,0.001171047,0.03692455,0.008593243,0.8528652,0.0008936785,0.09797457],"study_design_scores_gemma":[0.00003422787,0.0001150466,0.0002872513,0.00005153124,0.00006913487,0.0001536114,0.000234883,0.208923,0.01969451,0.7548564,0.01554599,0.00003461625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01275497,0.0000575456,0.9844204,0.0001059808,0.00001039875,0.0000351124,0.00003995757,0.0007182654,0.001857552],"genre_scores_gemma":[0.3454171,0.0002474765,0.6499996,0.00012709,0.00004046722,0.0001434128,0.0002986739,0.0004073969,0.003318738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00278494,"threshold_uncertainty_score":0.01271522,"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","authors":[{"name":"Didier Dubois","is_ca":false},{"name":"Weiru Liu","is_ca":false},{"name":"Jianbing Ma","is_ca":false},{"name":"Henri Prade","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009795048,0.001571295,0.001728501,0.007814262,0.001608373,0.008908327,0.004052355,0.004525567,0.003794776],"category_scores_gemma":[0.01272545,0.001304173,0.002604375,0.007965563,0.01066199,0.01679968,0.003924007,0.004696644,0.001717985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004191196,"about_ca_system_score_gemma":0.002120422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002511554,"about_ca_topic_score_gemma":0.0008620445,"domain_scores_codex":[0.9933224,0.002184672,0.0008943268,0.001056074,0.002230672,0.0003117267],"domain_scores_gemma":[0.9946221,0.003527127,0.0004932305,0.0005470635,0.0007183111,0.00009219405],"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.00001901686,0.00001435186,0.0001890404,0.0008800164,0.00007137874,0.0001131734,0.0006967836,0.003715035,0.0003024888,0.9113407,0.003490987,0.07916699],"study_design_scores_gemma":[0.000005392505,0.00002374615,0.0003561582,0.000997665,0.00004700326,0.0003309001,0.0002104664,0.004661685,0.0006215541,0.8991309,0.09356499,0.0000495018],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.004324961,0.4558381,0.4615681,0.01069138,0.001136014,0.0001951066,0.0003490752,0.0003716059,0.06552573],"genre_scores_gemma":[0.1948011,0.4786898,0.3025978,0.004519577,0.005318077,0.0007936901,0.001069856,0.0004009216,0.01180916],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.009795048,"threshold_uncertainty_score":0.0518018,"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","authors":[{"name":"James P. Delgrande","is_ca":true},{"name":"Torsten Schaub","is_ca":false},{"name":"Hans Tompits","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003406988,0.0008767091,0.000818924,0.001791216,0.001016321,0.002978705,0.00191915,0.001050858,0.004498132],"category_scores_gemma":[0.007546845,0.001051172,0.002271364,0.001776974,0.002454964,0.00485635,0.002902479,0.003091755,0.001321069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00147051,"about_ca_system_score_gemma":0.002222294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002837971,"about_ca_topic_score_gemma":0.002775714,"domain_scores_codex":[0.9970855,0.0007814928,0.000434215,0.0005560017,0.0008554488,0.0002873048],"domain_scores_gemma":[0.9980077,0.00081742,0.0001921693,0.0005649683,0.0003248284,0.00009303092],"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.00005494448,0.00007444104,0.0005595078,0.0003249399,0.00005550935,0.0003008848,0.0008606255,0.04255792,0.00350656,0.8540915,0.003289895,0.09432341],"study_design_scores_gemma":[0.00005243809,0.00006896243,0.000184056,0.0001388326,0.00007319425,0.0002770665,0.0001841104,0.1071955,0.007473874,0.8176726,0.06662522,0.00005432119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001644799,0.00007288629,0.9940512,0.0001629907,0.0000327037,0.00008551,0.0001025621,0.001760842,0.00208637],"genre_scores_gemma":[0.03849817,0.0002408598,0.9583648,0.0001907346,0.00007277945,0.0002679171,0.0002965922,0.0004993001,0.001568971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004498132,"threshold_uncertainty_score":0.01801807,"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","authors":[{"name":"Ariel Fuxman","is_ca":true},{"name":"Renée J. Miller","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01298602,0.0006641238,0.002112208,0.001890118,0.001814605,0.00483345,0.003943878,0.001957653,0.00333284],"category_scores_gemma":[0.03622402,0.001299047,0.002694351,0.002145041,0.003243601,0.008540692,0.00428096,0.00433209,0.0007340403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002313698,"about_ca_system_score_gemma":0.002961481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005258131,"about_ca_topic_score_gemma":0.004889467,"domain_scores_codex":[0.9836636,0.005063333,0.002118101,0.001533438,0.006367383,0.001254196],"domain_scores_gemma":[0.9623588,0.02009491,0.001347843,0.009933002,0.005658024,0.0006074694],"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.0005376618,0.0002518532,0.003264786,0.0008755242,0.0003270418,0.001660534,0.003124444,0.02834287,0.01019962,0.8231716,0.01428816,0.1139558],"study_design_scores_gemma":[0.0001383088,0.00009231028,0.0004536207,0.00008388483,0.0003346118,0.001066427,0.0006352197,0.1546339,0.01550357,0.809095,0.01785831,0.0001047835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03263834,0.001167618,0.9549186,0.001921691,0.0002329426,0.0002127285,0.0005042733,0.002489003,0.0059149],"genre_scores_gemma":[0.4441048,0.0008117325,0.5435937,0.001020664,0.0003001029,0.0001713619,0.001685035,0.001153702,0.007158902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01298602,"threshold_uncertainty_score":0.06867743,"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","authors":[{"name":"Stephen Muggleton","is_ca":false},{"name":"Luc De Raedt","is_ca":false},{"name":"David Poole","is_ca":true},{"name":"Ivan Bratko","is_ca":false},{"name":"Peter Flach","is_ca":false},{"name":"Katsumi Inoue","is_ca":false},{"name":"Ashwin Srinivasan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001663508,0.001133389,0.0007582317,0.001151834,0.002074537,0.005926444,0.001197612,0.001756406,0.0885513],"category_scores_gemma":[0.007198107,0.000526906,0.001374427,0.0007978429,0.004345189,0.00620494,0.002509262,0.005121863,0.02653746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002788725,"about_ca_system_score_gemma":0.001469234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001631607,"about_ca_topic_score_gemma":0.001548218,"domain_scores_codex":[0.9980147,0.000531157,0.0001027086,0.0006677974,0.0004740306,0.0002096221],"domain_scores_gemma":[0.9976108,0.00116262,0.0001269516,0.000416321,0.0005393552,0.0001440681],"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.00002276023,0.00001088939,0.000110531,0.0000485661,0.00001039492,0.000111806,0.0001279805,0.0004993394,0.0001520506,0.9427786,0.04115825,0.01496877],"study_design_scores_gemma":[0.000009802128,0.000007504065,0.00006615809,0.00004294717,0.000007322387,0.00009311191,0.00005330192,0.001217556,0.0002828492,0.8411136,0.1570983,0.000007616823],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"commentary","genre_scores_codex":[0.00356033,0.003304477,0.1763522,0.03261371,0.006245812,0.00007896914,0.001065617,0.001405067,0.7753738],"genre_scores_gemma":[0.3994771,0.006667782,0.0904571,0.02966515,0.01067907,0.0006771402,0.002723052,0.002800883,0.4568527],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.0885513,"threshold_uncertainty_score":0.2962336,"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","authors":[{"name":"Jc Beall","is_ca":false},{"name":"Ross T. Brady","is_ca":false},{"name":"J. Michael Dunn","is_ca":false},{"name":"Allen Hazen","is_ca":true},{"name":"Edwin Mares","is_ca":false},{"name":"Robert K. Meyer","is_ca":false},{"name":"Graham Priest","is_ca":false},{"name":"Greg Restall","is_ca":false},{"name":"David Ripley","is_ca":false},{"name":"John Slaney","is_ca":false},{"name":"Richard Sylvan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006382576,0.0009139403,0.001448913,0.003162778,0.00387573,0.005588141,0.001788723,0.002791884,0.01197964],"category_scores_gemma":[0.02196658,0.001145977,0.002168109,0.003383764,0.01568052,0.0260048,0.004879706,0.0076684,0.001315344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002724556,"about_ca_system_score_gemma":0.001571956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003917318,"about_ca_topic_score_gemma":0.002452308,"domain_scores_codex":[0.996717,0.001377205,0.000248577,0.0006380231,0.000613688,0.0004054505],"domain_scores_gemma":[0.9789966,0.01723654,0.0005983312,0.001432915,0.00128615,0.0004494271],"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.00001184723,0.000004064408,0.00004670137,0.00001377041,0.000002698856,0.00002092482,0.00009095181,0.0002062427,0.00005084065,0.9972646,0.0006425047,0.001644871],"study_design_scores_gemma":[0.000004991715,0.000002500044,0.00003183294,0.00001087514,0.000004562648,0.00002168759,0.00001576669,0.0006036042,0.00005489664,0.9974572,0.001785947,0.00000616785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07403204,0.01882099,0.5853764,0.02952632,0.002938151,0.0001025727,0.0007572382,0.0005249074,0.2879215],"genre_scores_gemma":[0.8850567,0.008114372,0.07981849,0.003921305,0.004355655,0.0002030967,0.0005900256,0.0003712542,0.01756911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01197964,"threshold_uncertainty_score":0.0400759,"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","authors":[{"name":"Michael J. Maher","is_ca":false},{"name":"Andrew Rock","is_ca":false},{"name":"Grigoris Antoniou","is_ca":false},{"name":"David P. Billington","is_ca":false},{"name":"Tristan Miller","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00291019,0.0008781127,0.001135269,0.00137643,0.001469885,0.004006876,0.002140418,0.002078911,0.01338529],"category_scores_gemma":[0.01076216,0.000817623,0.0008590835,0.0015871,0.001136232,0.004478501,0.003047195,0.001511803,0.004019896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001147247,"about_ca_system_score_gemma":0.001452805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001400917,"about_ca_topic_score_gemma":0.001654634,"domain_scores_codex":[0.9967996,0.0008452779,0.0003171628,0.000483449,0.00135602,0.0001984722],"domain_scores_gemma":[0.9961216,0.001953145,0.0002179239,0.001000499,0.0006141736,0.00009269169],"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.0005279946,0.0003813287,0.001268337,0.0009426072,0.0002028513,0.0005734186,0.0007266694,0.1358282,0.0139614,0.4842045,0.02111797,0.3402648],"study_design_scores_gemma":[0.0002719504,0.00008285108,0.0003300333,0.0001001253,0.00009737519,0.0003425045,0.000185919,0.5491797,0.01099335,0.3590887,0.0792885,0.00003895032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02165374,0.001244849,0.9498628,0.001052165,0.0001318635,0.0004952455,0.0006905249,0.003318986,0.02154978],"genre_scores_gemma":[0.2468927,0.001449595,0.7337188,0.0004465225,0.0001157028,0.000525384,0.00234122,0.0003421567,0.01416783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01338529,"threshold_uncertainty_score":0.04477829,"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)","authors":[{"name":"Crispin Wright","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006425636,0.0003119126,0.0007399571,0.00166165,0.002397385,0.007275668,0.001808971,0.003128649,0.005201834],"category_scores_gemma":[0.01274335,0.00040812,0.001124211,0.001249986,0.02608407,0.012769,0.002929511,0.004404696,0.001130791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003105784,"about_ca_system_score_gemma":0.001516468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001888066,"about_ca_topic_score_gemma":0.001114162,"domain_scores_codex":[0.9959223,0.001577434,0.0003011388,0.0008324217,0.001029279,0.0003373854],"domain_scores_gemma":[0.9935673,0.003850206,0.0004291888,0.00117057,0.0007904025,0.0001923673],"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.00000356479,0.000002162093,0.00002012157,0.000008815674,0.000001486338,0.00001752631,0.0002690853,0.00005321452,0.00004096932,0.9980552,0.0004419185,0.001085967],"study_design_scores_gemma":[0.00000447579,0.00000283126,0.00003498542,0.000015019,0.000002687968,0.00002572281,0.0001247264,0.0002222101,0.000122367,0.9935854,0.005855415,0.000004159468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.07057071,0.005168135,0.1448244,0.04068881,0.001091675,0.00009332339,0.0002473322,0.0003400432,0.7369757],"genre_scores_gemma":[0.9718389,0.001126669,0.01020132,0.002407459,0.0005144548,0.00006670113,0.00008129951,0.0001369088,0.01362633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007275668,"threshold_uncertainty_score":0.0339824,"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","authors":[{"name":"James P. Delgrande","is_ca":true},{"name":"Torsten Schaub","is_ca":false},{"name":"Hans Tompits","is_ca":false},{"name":"Kewen Wang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009541159,0.001147485,0.001817248,0.01090154,0.00190472,0.006272529,0.003499557,0.002592009,0.003284272],"category_scores_gemma":[0.008072882,0.001186034,0.002083588,0.01846628,0.003469405,0.009749989,0.002401533,0.003795124,0.00101619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002988119,"about_ca_system_score_gemma":0.002498399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002140041,"about_ca_topic_score_gemma":0.002179314,"domain_scores_codex":[0.9940236,0.001887892,0.0007228919,0.0008091016,0.002145371,0.0004110393],"domain_scores_gemma":[0.9909447,0.00608865,0.0005239612,0.00078056,0.001405265,0.0002569057],"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.000136988,0.000282268,0.002276909,0.004581614,0.0001369145,0.0002429913,0.001387915,0.003448724,0.0008887197,0.3347558,0.007776285,0.644085],"study_design_scores_gemma":[0.0001029304,0.0004186233,0.004860188,0.005681117,0.0002655398,0.002214602,0.002126788,0.03017992,0.002607079,0.5985861,0.3527117,0.0002452607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0111865,0.598737,0.3371737,0.007660891,0.000751646,0.000301338,0.000156792,0.0003433268,0.04368886],"genre_scores_gemma":[0.08764725,0.5946925,0.3054665,0.002316585,0.003164665,0.0004811753,0.0005098025,0.0001486335,0.005572948],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01090154,"threshold_uncertainty_score":0.05045903,"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","authors":[{"name":"Eyal Amir","is_ca":false},{"name":"Sheila A. McIlraith","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005181534,0.001098667,0.001901992,0.003912455,0.002810942,0.006598233,0.004096502,0.002040597,0.008725577],"category_scores_gemma":[0.02441329,0.001249971,0.004454459,0.003735175,0.004633772,0.01541858,0.005352948,0.005230451,0.0009243296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003605304,"about_ca_system_score_gemma":0.002058969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008237594,"about_ca_topic_score_gemma":0.01143306,"domain_scores_codex":[0.9948564,0.001947788,0.0003563121,0.0006024324,0.001814025,0.0004230663],"domain_scores_gemma":[0.9829474,0.01279823,0.000641637,0.00194028,0.001253648,0.0004187264],"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.0001550037,0.00006391868,0.0005796275,0.0002084453,0.0001299597,0.00009022751,0.0006294482,0.02083847,0.000395898,0.9387262,0.003897667,0.03428515],"study_design_scores_gemma":[0.00002522945,0.000009629832,0.0001059983,0.00003163423,0.000050522,0.00004185654,0.00009332738,0.04925662,0.0005018545,0.9475443,0.002326966,0.00001201356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02248716,0.001175535,0.9627589,0.001341987,0.0001511292,0.0001554373,0.0004877635,0.0005780978,0.01086393],"genre_scores_gemma":[0.433933,0.001183339,0.5551876,0.0005448168,0.0002594655,0.0003197102,0.002289212,0.0002084678,0.006074312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008725577,"threshold_uncertainty_score":0.02919,"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","authors":[{"name":"Marc Denecker","is_ca":false},{"name":"Eugenia Ternovska","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003345286,0.0005769735,0.0004952038,0.001427224,0.001355221,0.003299898,0.001696481,0.0009289149,0.003161218],"category_scores_gemma":[0.002959298,0.0005926506,0.001403409,0.001317271,0.004969545,0.008527607,0.002467448,0.003383171,0.00086883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001684289,"about_ca_system_score_gemma":0.001352427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006695699,"about_ca_topic_score_gemma":0.0007424937,"domain_scores_codex":[0.9971788,0.000726064,0.0003014278,0.0007428916,0.0008252985,0.0002254471],"domain_scores_gemma":[0.9973954,0.001331191,0.0002667608,0.0003586955,0.0005224138,0.0001254879],"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.000007023707,0.000008820647,0.00007718894,0.00004428789,0.000006029402,0.00006655815,0.0002161269,0.000352299,0.0006463289,0.9907799,0.0007141884,0.007081155],"study_design_scores_gemma":[0.00001807261,0.00003175522,0.0001533954,0.00005293721,0.00002863652,0.0003580753,0.0001037245,0.007418056,0.003431215,0.9135416,0.07484045,0.00002208107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01132466,0.001590713,0.9464148,0.001743871,0.0003534397,0.0001107281,0.000327203,0.0004910365,0.03764359],"genre_scores_gemma":[0.3293485,0.001765555,0.642746,0.002109565,0.0006457076,0.0003963103,0.0006430264,0.0002765907,0.02206877],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003345286,"threshold_uncertainty_score":0.01769173,"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","authors":[{"name":"Babak Esfandiari","is_ca":true},{"name":"Sanjay Chandrasekharan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007214602,0.0007635357,0.001028723,0.001927705,0.00434988,0.007514051,0.00301808,0.004974057,0.00764748],"category_scores_gemma":[0.03973332,0.001022475,0.001437825,0.001710464,0.009051585,0.02509981,0.006507364,0.003871963,0.001847971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002069524,"about_ca_system_score_gemma":0.001219098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003253532,"about_ca_topic_score_gemma":0.002128329,"domain_scores_codex":[0.9940836,0.002942209,0.0003475471,0.0009727813,0.001171736,0.0004821382],"domain_scores_gemma":[0.9690593,0.01765108,0.003350969,0.006180451,0.002433897,0.00132434],"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.00005021117,0.00002946632,0.0008872245,0.0001198046,0.00006663761,0.0003207537,0.003412631,0.005618922,0.0008295981,0.9553376,0.003656614,0.02967056],"study_design_scores_gemma":[0.00003944653,0.00004331677,0.0004547056,0.0000899233,0.00006656422,0.0003535511,0.0006467966,0.0271253,0.001109137,0.9456256,0.02438495,0.00006078865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03341719,0.002573078,0.8952813,0.01477618,0.0003276011,0.0001881371,0.0001210007,0.0006724705,0.05264306],"genre_scores_gemma":[0.8328716,0.002891259,0.1447936,0.001440192,0.000391612,0.0003580016,0.0001824967,0.0002389647,0.01683241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00764748,"threshold_uncertainty_score":0.03815496,"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","authors":[{"name":"Hector J. Levesque","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002329035,0.001079264,0.0006839425,0.001198564,0.002255819,0.004888448,0.001996637,0.003262329,0.05387124],"category_scores_gemma":[0.01279219,0.0003997684,0.0009762899,0.0007510412,0.001847792,0.0061492,0.002642412,0.003185715,0.01611282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00113307,"about_ca_system_score_gemma":0.002160574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003371028,"about_ca_topic_score_gemma":0.005941647,"domain_scores_codex":[0.9968359,0.001130859,0.0001211634,0.0006045772,0.0007786673,0.0005287199],"domain_scores_gemma":[0.9944552,0.001626883,0.0002396391,0.001699438,0.001292045,0.0006869462],"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.0007186614,0.001047184,0.0119185,0.0005749395,0.0004209754,0.001143532,0.003437312,0.01528711,0.01897182,0.4225532,0.168838,0.3550887],"study_design_scores_gemma":[0.0001109686,0.0004030966,0.00412851,0.000506114,0.0003342738,0.001179477,0.004158054,0.06283129,0.011877,0.5383359,0.3759648,0.0001705754],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"commentary","genre_scores_codex":[0.07467522,0.002501422,0.1899518,0.06907381,0.002230395,0.0004059492,0.001224978,0.005149796,0.6547866],"genre_scores_gemma":[0.6635661,0.002168467,0.10801,0.009711631,0.0007190834,0.0003085771,0.001456674,0.001996855,0.2120627],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.05387124,"threshold_uncertainty_score":0.1802173,"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","authors":[{"name":"David Poole","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007431868,0.001083454,0.001520672,0.001724848,0.001838056,0.005809215,0.004138215,0.00362758,0.005173996],"category_scores_gemma":[0.02356012,0.001142552,0.002628063,0.001838419,0.008707115,0.01487834,0.005295293,0.00480477,0.0006563244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00230217,"about_ca_system_score_gemma":0.002578319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005105812,"about_ca_topic_score_gemma":0.00438761,"domain_scores_codex":[0.9949321,0.002295669,0.0003064387,0.0006667484,0.00128405,0.0005149861],"domain_scores_gemma":[0.9775133,0.0163601,0.00125563,0.002488033,0.001631872,0.0007511654],"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.00008054402,0.00002856851,0.0003266728,0.00003119207,0.00002985059,0.0001006319,0.0002572331,0.0248244,0.0002030938,0.9692922,0.0004458986,0.004379781],"study_design_scores_gemma":[0.00001481956,0.000008216062,0.00001831428,0.000006272066,0.000008226286,0.00001397586,0.00002228334,0.05744035,0.0001272697,0.9420254,0.000307235,0.000007733011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0858872,0.0008348009,0.8803279,0.005123602,0.0001041606,0.00008251346,0.0002606577,0.0003123656,0.02706679],"genre_scores_gemma":[0.908682,0.0006178126,0.08174131,0.0003415389,0.0001385442,0.000111469,0.0002762571,0.0001275583,0.007963535],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007431868,"threshold_uncertainty_score":0.0393039,"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","authors":[{"name":"Leopoldo Bertossi","is_ca":true},{"name":"Loreto Bravo","is_ca":false},{"name":"Enrico Franconi","is_ca":false},{"name":"Andrei Lopatenko","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01524054,0.001390947,0.004500522,0.003104742,0.002828511,0.01334857,0.008031937,0.005782464,0.00678716],"category_scores_gemma":[0.1550526,0.00257279,0.004237107,0.007702594,0.008751255,0.03744861,0.00842388,0.007959457,0.0009261341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008160215,"about_ca_system_score_gemma":0.006759237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01526262,"about_ca_topic_score_gemma":0.01005261,"domain_scores_codex":[0.9763698,0.009628555,0.002018114,0.002989387,0.006952316,0.002041827],"domain_scores_gemma":[0.7806376,0.1849755,0.006889088,0.02130467,0.004352477,0.001840699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002460402,0.0003652422,0.009293603,0.0008865903,0.0003530764,0.0003239748,0.002027418,0.4728467,0.001908775,0.3669315,0.007907336,0.1346953],"study_design_scores_gemma":[0.0001113667,0.00005721515,0.0005793527,0.0000678004,0.0001344883,0.0001375964,0.0003155245,0.5049471,0.0009672726,0.4913793,0.001259715,0.00004329879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2091035,0.003487328,0.7596431,0.01412118,0.0002783684,0.0002341954,0.001334745,0.001593173,0.01020447],"genre_scores_gemma":[0.7243248,0.002464328,0.2645729,0.001161367,0.0005887968,0.0002390099,0.001639168,0.0005887378,0.004420809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01526262,"threshold_uncertainty_score":0.08060062,"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","authors":[{"name":"Gerhard Brewka","is_ca":false},{"name":"James P. Delgrande","is_ca":true},{"name":"Javier Romero","is_ca":false},{"name":"Torsten Schaub","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007811057,0.0009939153,0.000910596,0.001286742,0.0008222422,0.003008687,0.003309881,0.001275053,0.01398096],"category_scores_gemma":[0.01959857,0.0008476377,0.001439165,0.001095988,0.001256953,0.008682886,0.006742039,0.00290183,0.003435525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009968764,"about_ca_system_score_gemma":0.001230616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001071983,"about_ca_topic_score_gemma":0.002007942,"domain_scores_codex":[0.9940818,0.001885568,0.0005173301,0.0009806859,0.00206955,0.0004649577],"domain_scores_gemma":[0.9935936,0.002573073,0.0002301872,0.002514245,0.0008207636,0.0002681518],"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.001518825,0.0005022943,0.002273688,0.0005630716,0.0001479216,0.0004032335,0.001144833,0.03322285,0.02106645,0.262905,0.02233832,0.6539135],"study_design_scores_gemma":[0.0002356153,0.0003841576,0.0006947402,0.0001631702,0.0001027013,0.0004870713,0.0004605157,0.4742421,0.03643049,0.3818781,0.1047976,0.0001237961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009499313,0.0000931833,0.9743062,0.0002335661,0.00006987918,0.0002514181,0.0003426919,0.009731931,0.005471776],"genre_scores_gemma":[0.1790949,0.0001767834,0.8055786,0.0006297749,0.00007807495,0.0005099652,0.001507479,0.002625298,0.009799047],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01398096,"threshold_uncertainty_score":0.04677093,"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","authors":[{"name":"Douglas Walton","is_ca":false},{"name":"Chris Reed","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01127041,0.0008942927,0.0009049437,0.003384949,0.002997191,0.009201841,0.002429066,0.003991581,0.01592873],"category_scores_gemma":[0.03702288,0.0008597944,0.001156566,0.002300559,0.01308849,0.02362964,0.005596677,0.003973173,0.001830882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002195586,"about_ca_system_score_gemma":0.0009264669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004130552,"about_ca_topic_score_gemma":0.0005496104,"domain_scores_codex":[0.9891294,0.007075686,0.0008475738,0.001160235,0.00140516,0.0003819158],"domain_scores_gemma":[0.9768693,0.01604751,0.001228494,0.003709475,0.001607428,0.0005379335],"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.00001771259,0.000006662518,0.00004696524,0.00003118331,0.000005877857,0.00002846769,0.0004819017,0.0002772426,0.0000891248,0.9936563,0.0003585121,0.005000064],"study_design_scores_gemma":[0.00001039589,0.000003781128,0.00002445198,0.00002532587,0.000003843042,0.00003067451,0.0001253795,0.0009617622,0.0001368787,0.9945208,0.004152128,0.000004559262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03871281,0.006786999,0.7758278,0.01333846,0.000543449,0.0001472202,0.0002561046,0.000387655,0.1639994],"genre_scores_gemma":[0.7550249,0.002152817,0.212306,0.0005837354,0.0004616549,0.0002107223,0.0004275742,0.0002051323,0.02862744],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01592873,"threshold_uncertainty_score":0.05960429,"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","authors":[{"name":"Meghyn Bienvenu","is_ca":false},{"name":"Christian Fritz","is_ca":true},{"name":"Sheila A. McIlraith","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003996172,0.0006206456,0.0004128471,0.0009210676,0.0006602609,0.002085297,0.001175952,0.0006125923,0.003294111],"category_scores_gemma":[0.01119743,0.0005200342,0.001052765,0.000829705,0.001750249,0.004226222,0.001612156,0.001192187,0.0005050765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001611454,"about_ca_system_score_gemma":0.002211199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002959889,"about_ca_topic_score_gemma":0.005671709,"domain_scores_codex":[0.9976813,0.001102949,0.0001742509,0.0002294786,0.0006684353,0.0001436418],"domain_scores_gemma":[0.9950015,0.003401835,0.0003739753,0.000529047,0.0005223181,0.0001712809],"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.0001628304,0.00006623185,0.0008367076,0.0003144138,0.00005843285,0.0002986994,0.0009433773,0.1890511,0.00478947,0.7434161,0.00150163,0.05856111],"study_design_scores_gemma":[0.00007197972,0.00009053179,0.000199608,0.0001017129,0.00004710714,0.0001877842,0.0003316245,0.4506207,0.007983139,0.5246149,0.01570237,0.0000484768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008384855,0.00009109827,0.9877297,0.0002342304,0.00001479912,0.00007726545,0.0001418939,0.0003447492,0.002981329],"genre_scores_gemma":[0.3117272,0.000356919,0.6839197,0.0001636464,0.00002294215,0.0004100161,0.0003376798,0.0001145378,0.002947378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003996172,"threshold_uncertainty_score":0.02113408,"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","authors":[{"name":"David G. M. Mitchell","is_ca":true},{"name":"Eugenia Ternovska","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00543383,0.002122176,0.001482221,0.002894539,0.002135702,0.007674553,0.00616708,0.003560746,0.01110929],"category_scores_gemma":[0.0142594,0.001049513,0.004559846,0.003776079,0.005304051,0.009001701,0.005648603,0.004562002,0.00268751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002570286,"about_ca_system_score_gemma":0.004506437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01450931,"about_ca_topic_score_gemma":0.01389455,"domain_scores_codex":[0.9960067,0.001722057,0.0006417679,0.0004782115,0.0008550359,0.0002963691],"domain_scores_gemma":[0.9966565,0.001981554,0.0002210736,0.0005954347,0.0004000744,0.0001453649],"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.00002668928,0.00003489647,0.0002396727,0.0003480704,0.00004682766,0.0001703071,0.0006262401,0.04760859,0.0003431354,0.8910618,0.004056651,0.05543717],"study_design_scores_gemma":[0.00003096871,0.00002688102,0.00005751279,0.0001638828,0.0000270032,0.0001328647,0.0002826079,0.1321461,0.0002769028,0.8249682,0.04186016,0.00002695447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007786952,0.0005127194,0.9909423,0.0009927464,0.00006348867,0.0001824687,0.0001740707,0.0004901338,0.005863363],"genre_scores_gemma":[0.02238987,0.0008916196,0.9718986,0.0001981195,0.00008707107,0.0006658044,0.0004542288,0.0001090915,0.003305617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01450931,"threshold_uncertainty_score":0.03716427,"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","authors":[{"name":"Christian Muise","is_ca":false},{"name":"Vaishak Belle","is_ca":true},{"name":"Paolo Felli","is_ca":false},{"name":"Sheila A. McIlraith","is_ca":true},{"name":"Tim Miller","is_ca":false},{"name":"Adrian R. Pearce","is_ca":false},{"name":"Liz Sonenberg","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003133744,0.0008896671,0.0007161088,0.00140485,0.00136956,0.003014912,0.003037278,0.001799415,0.003114039],"category_scores_gemma":[0.006404125,0.0008742156,0.002473994,0.001441944,0.006487043,0.006402125,0.003517636,0.003528624,0.0005237467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003265184,"about_ca_system_score_gemma":0.002685943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005305467,"about_ca_topic_score_gemma":0.007583106,"domain_scores_codex":[0.9978516,0.0009140549,0.0001520854,0.0003234834,0.0006089705,0.0001497981],"domain_scores_gemma":[0.9959291,0.002870736,0.0002178026,0.0005735286,0.0002623485,0.0001463833],"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.0000214125,0.00002640757,0.0001265219,0.0001247866,0.00003848744,0.0001082124,0.0002876347,0.09462111,0.0004380552,0.8886297,0.0007149961,0.01486252],"study_design_scores_gemma":[0.0000165609,0.00001538195,0.00003968656,0.00004519666,0.00001864604,0.00003753111,0.00005545966,0.2219073,0.0005034457,0.7730502,0.004295587,0.00001506941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00293841,0.0004777704,0.9866251,0.001060387,0.000038624,0.00006591508,0.0000604515,0.0001165075,0.008616837],"genre_scores_gemma":[0.2496613,0.001320074,0.7429487,0.0004067989,0.0001736448,0.0004098538,0.0001495291,0.00007924312,0.00485093],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005305467,"threshold_uncertainty_score":0.0236907,"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","authors":[{"name":"Ray Reiter","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003224055,0.001268215,0.0008777254,0.001119182,0.001643996,0.004063951,0.002652064,0.00179869,0.005000614],"category_scores_gemma":[0.005875969,0.0008270426,0.002406393,0.001568762,0.009181267,0.008354681,0.004642194,0.004113303,0.0008704437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002325387,"about_ca_system_score_gemma":0.002148293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005060987,"about_ca_topic_score_gemma":0.00479188,"domain_scores_codex":[0.9975038,0.0009829958,0.0001390133,0.0003688802,0.0006250949,0.0003801501],"domain_scores_gemma":[0.9976265,0.001571311,0.0001809475,0.0002727851,0.0001576573,0.0001906919],"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.00004494725,0.00004188645,0.0001573623,0.00008450749,0.00001659175,0.0001787139,0.000652245,0.01373627,0.0005670081,0.9735171,0.0007514671,0.0102518],"study_design_scores_gemma":[0.00003004145,0.00003156699,0.00007121809,0.00004094409,0.00002284997,0.00008899376,0.00008458213,0.04155038,0.0007819063,0.9497699,0.007506573,0.00002100258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01094571,0.000449939,0.9678861,0.00155915,0.0000857331,0.0001457732,0.0001076927,0.0008766289,0.01794329],"genre_scores_gemma":[0.3524406,0.001090718,0.6324988,0.001023274,0.0003144611,0.0006481837,0.0003076454,0.0004290335,0.01124732],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005060987,"threshold_uncertainty_score":0.01705068,"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","authors":[{"name":"Sebastian Sardiña","is_ca":true},{"name":"Giuseppe De Giacomo","is_ca":false},{"name":"Yves Lespérance","is_ca":true},{"name":"Hector J. Levesque","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006937534,0.0009849243,0.001493998,0.001841003,0.003257502,0.00968957,0.0040184,0.004585908,0.01001582],"category_scores_gemma":[0.01817402,0.001387819,0.002894607,0.002103172,0.01954113,0.023874,0.007935761,0.007842503,0.001342898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004458337,"about_ca_system_score_gemma":0.003300474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006268574,"about_ca_topic_score_gemma":0.00466157,"domain_scores_codex":[0.9929413,0.003900056,0.0005749566,0.0007606942,0.001078127,0.0007449632],"domain_scores_gemma":[0.9889158,0.006929528,0.0004504486,0.002352796,0.0008871995,0.0004641313],"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.00002070612,0.00001331161,0.00006930496,0.00002472561,0.000007427728,0.00002545631,0.0003575596,0.001452275,0.00006904707,0.9940476,0.0004579579,0.003454567],"study_design_scores_gemma":[0.00001425996,0.0000081024,0.00003033002,0.00002281483,0.000008683806,0.00002010142,0.00009371279,0.005642075,0.0001490215,0.991316,0.002685216,0.00000965409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01554573,0.001508468,0.9218326,0.01043932,0.0003666525,0.0001155345,0.0001785252,0.0008577636,0.04915538],"genre_scores_gemma":[0.6797531,0.001245685,0.3062978,0.001910175,0.0004326651,0.0004033555,0.0002795206,0.0006422176,0.009035412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01001582,"threshold_uncertainty_score":0.03668964,"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","authors":[{"name":"Vincent Danos","is_ca":false},{"name":"Josée Desharnais","is_ca":true},{"name":"François Laviolette","is_ca":true},{"name":"Prakash Panangaden","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006015151,0.0009092557,0.001618678,0.0029241,0.003696901,0.006281464,0.002419276,0.00220852,0.007045334],"category_scores_gemma":[0.02578058,0.001118288,0.002492022,0.002275743,0.008795652,0.01195876,0.005676593,0.007188178,0.0007462683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002954093,"about_ca_system_score_gemma":0.002139147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002499958,"about_ca_topic_score_gemma":0.001897013,"domain_scores_codex":[0.9916416,0.002554754,0.0006885197,0.001583733,0.002441716,0.001089774],"domain_scores_gemma":[0.9724776,0.01940642,0.001207158,0.003425869,0.002228999,0.001254029],"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.00002414323,0.00001387079,0.0001120375,0.00002422834,0.000007074565,0.00004486936,0.0001661816,0.00112493,0.0001553042,0.9958094,0.0002224643,0.002295462],"study_design_scores_gemma":[0.000008147204,0.000007952422,0.00004088607,0.000008940431,0.000008218149,0.00005173577,0.00002289805,0.007320318,0.0002420289,0.991447,0.0008323439,0.00000964805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09837066,0.001825231,0.8386015,0.002983398,0.0004006556,0.0001153261,0.0004090401,0.0006825486,0.05661165],"genre_scores_gemma":[0.9131007,0.0008370875,0.07573026,0.0005329892,0.0005519935,0.0002661815,0.0003874008,0.0002163038,0.008377073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007045334,"threshold_uncertainty_score":0.03181154,"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","authors":[{"name":"James P. Delgrande","is_ca":true},{"name":"Didier Dubois","is_ca":false},{"name":"Jérôme Lang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01143941,0.0006201799,0.0008339921,0.002208015,0.001804416,0.005154417,0.002431435,0.002067663,0.003823554],"category_scores_gemma":[0.02644708,0.0006116378,0.001930358,0.001438618,0.006775512,0.009948829,0.00444864,0.002733069,0.0004486529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003748463,"about_ca_system_score_gemma":0.001923439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002613038,"about_ca_topic_score_gemma":0.001818059,"domain_scores_codex":[0.9891074,0.004399828,0.0007894537,0.001701222,0.003237748,0.0007644701],"domain_scores_gemma":[0.9816451,0.009230178,0.001798314,0.004102848,0.002539281,0.0006843167],"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.0000527184,0.0000250056,0.0005204742,0.00007939566,0.00004719575,0.0002268018,0.001655729,0.005148316,0.0009013457,0.9710076,0.0006816626,0.01965381],"study_design_scores_gemma":[0.00004142416,0.00003532716,0.0003293208,0.00002624659,0.00003342827,0.0001773836,0.0001356245,0.02241858,0.0006443361,0.9722262,0.003905422,0.00002662622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1270481,0.002517812,0.7817591,0.006207284,0.0002804268,0.000363401,0.0002115485,0.0009762361,0.08063614],"genre_scores_gemma":[0.8853615,0.0005626086,0.1053984,0.0006315676,0.0002736954,0.0002068484,0.00009414453,0.00008884705,0.007382478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01143941,"threshold_uncertainty_score":0.06049812,"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","authors":[{"name":"Mónica Caniupán","is_ca":false},{"name":"Leopoldo Bertossi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01001042,0.001363872,0.002285329,0.002463933,0.00120717,0.004572512,0.005496748,0.002741568,0.008407577],"category_scores_gemma":[0.0319539,0.001920828,0.002167032,0.002161601,0.002805467,0.009835663,0.00582619,0.004674274,0.002266024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00106504,"about_ca_system_score_gemma":0.003533918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003138971,"about_ca_topic_score_gemma":0.00366204,"domain_scores_codex":[0.9923626,0.002457143,0.0007664679,0.001032598,0.002982114,0.0003990468],"domain_scores_gemma":[0.9865016,0.009328169,0.000618442,0.002097421,0.001243286,0.0002110669],"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.001690126,0.0006278694,0.004383624,0.001529995,0.000434701,0.0005523483,0.001485287,0.04113708,0.01722122,0.2185422,0.06872012,0.6436754],"study_design_scores_gemma":[0.0007000509,0.0002733127,0.0009731199,0.0002771535,0.0004897598,0.0004224362,0.0003501801,0.6052988,0.05433553,0.2889946,0.04770012,0.0001849462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00322614,0.0001748159,0.9799968,0.0004584052,0.00003037081,0.0001776001,0.0006613549,0.01459269,0.0006819292],"genre_scores_gemma":[0.07574505,0.0003535601,0.9146646,0.0006674454,0.0001371867,0.0004989433,0.002857285,0.002810688,0.00226536],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01001042,"threshold_uncertainty_score":0.05294079,"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","authors":[{"name":"Steven Shapiro","is_ca":true},{"name":"Yves Lespérance","is_ca":true},{"name":"Hector J. Levesque","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006150292,0.0009039035,0.0008766372,0.001312383,0.001139961,0.003515233,0.002966435,0.001598908,0.007327741],"category_scores_gemma":[0.0110696,0.001269719,0.001967355,0.001071794,0.002486826,0.004785694,0.002980292,0.003824436,0.003594762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001733034,"about_ca_system_score_gemma":0.006079559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004733783,"about_ca_topic_score_gemma":0.00425745,"domain_scores_codex":[0.9941179,0.002383363,0.0006986282,0.0005212958,0.001841046,0.0004378285],"domain_scores_gemma":[0.9947565,0.002554848,0.0005410605,0.0009530486,0.0009444089,0.0002500998],"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.0001717671,0.00008108024,0.0004253458,0.0004630366,0.00004864079,0.0006119414,0.0008978729,0.02971354,0.006049699,0.8751463,0.01770427,0.06868649],"study_design_scores_gemma":[0.0003966257,0.000151938,0.0003221449,0.0003868213,0.00007797506,0.0008698248,0.0002250032,0.2399263,0.01964979,0.3926359,0.3451973,0.0001603317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008468649,0.0001128662,0.9909409,0.0002373188,0.00005224501,0.000176866,0.0002243241,0.003625452,0.003783236],"genre_scores_gemma":[0.05431682,0.0003488664,0.9358851,0.00043204,0.0001151439,0.001008153,0.001244937,0.001135229,0.005513662],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007327741,"threshold_uncertainty_score":0.03252625,"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","authors":[{"name":"Tarek Mhamdi","is_ca":true},{"name":"Osman Hasan","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00232618,0.0007480091,0.001206673,0.002072168,0.002083512,0.004719249,0.00160185,0.00148884,0.006871131],"category_scores_gemma":[0.00296569,0.0006391004,0.00158628,0.001969401,0.008979915,0.01112648,0.003124223,0.006322088,0.001135011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002877018,"about_ca_system_score_gemma":0.0009127903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001594295,"about_ca_topic_score_gemma":0.001440332,"domain_scores_codex":[0.998953,0.0003913174,0.00006965639,0.0001331091,0.0003235866,0.0001293328],"domain_scores_gemma":[0.9985465,0.0008364498,0.00008248703,0.0002384266,0.0001999445,0.00009605839],"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.000003990093,0.000003641589,0.0000140317,0.00001033791,0.000001945599,0.00001057211,0.00005128781,0.0001991064,0.00005787527,0.9979327,0.0003716969,0.001342746],"study_design_scores_gemma":[0.000004058988,0.000003423164,0.00003105645,0.0000103291,0.00000202762,0.00001467495,0.00001819502,0.001179824,0.00007552509,0.99542,0.00323701,0.000003815546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02843676,0.008289541,0.701564,0.007231639,0.001080509,0.00008760989,0.0003366983,0.0005722637,0.252401],"genre_scores_gemma":[0.7750868,0.005743812,0.1621791,0.002249845,0.002245982,0.0002669735,0.0005688779,0.0006935472,0.05096503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006871131,"threshold_uncertainty_score":0.02298623,"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","authors":[{"name":"Steven Shapiro","is_ca":true},{"name":"Maurice Pagnucco","is_ca":false},{"name":"Yves Lespérance","is_ca":true},{"name":"Hector J. Levesque","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00518264,0.0005433715,0.001076794,0.001297848,0.001938155,0.005093066,0.002063084,0.002084981,0.005665939],"category_scores_gemma":[0.01697044,0.0007757639,0.001947111,0.00118304,0.005167685,0.009877235,0.002685338,0.003740659,0.0005416111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003073207,"about_ca_system_score_gemma":0.001535291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004061576,"about_ca_topic_score_gemma":0.002291528,"domain_scores_codex":[0.9956641,0.001810731,0.0002518846,0.0005480462,0.001303454,0.0004217814],"domain_scores_gemma":[0.9921251,0.00550269,0.000420918,0.0007311233,0.0008280099,0.0003921853],"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.00003389133,0.0000204106,0.0001511001,0.00002597052,0.00002239337,0.0001002426,0.0003407173,0.003572977,0.0002400162,0.9916518,0.0003329585,0.003507544],"study_design_scores_gemma":[0.00001427202,0.000007589955,0.00005831729,0.000006159783,0.00001396856,0.00003683723,0.00003808922,0.02047519,0.0001297106,0.9786159,0.0005954155,0.000008507126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1201762,0.001757983,0.7822523,0.005132981,0.0002384189,0.0001236101,0.0002099333,0.0003990081,0.08970948],"genre_scores_gemma":[0.9201356,0.0005930094,0.068546,0.0002675323,0.0002219954,0.0001178441,0.0001172493,0.00006676067,0.009933905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005665939,"threshold_uncertainty_score":0.02740872,"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","authors":[{"name":"Peter Hallman","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002119078,0.0004271405,0.0006908515,0.001510214,0.002412742,0.003484418,0.00164688,0.001096465,0.01579645],"category_scores_gemma":[0.005857117,0.0005224021,0.001543174,0.001183358,0.007229385,0.007150523,0.00518608,0.001947499,0.002677292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002100514,"about_ca_system_score_gemma":0.001631149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002089105,"about_ca_topic_score_gemma":0.002187119,"domain_scores_codex":[0.9973937,0.001086095,0.0001704011,0.0005955221,0.0004753713,0.0002788887],"domain_scores_gemma":[0.9973643,0.0008235101,0.0002293079,0.001211025,0.0002374744,0.0001344027],"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.00001365268,0.000008129336,0.0002003474,0.00003757379,0.00000824629,0.00006936298,0.0003311494,0.001313504,0.0004416732,0.983733,0.001156772,0.01268671],"study_design_scores_gemma":[0.000007925303,0.000008901603,0.00009186462,0.00001536293,0.00000626226,0.00005749799,0.00008406761,0.003671331,0.0007195919,0.9852338,0.01009707,0.000006291316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08446816,0.001097481,0.7144267,0.003616521,0.0002853322,0.0003077143,0.000579701,0.002070352,0.193148],"genre_scores_gemma":[0.7895786,0.0004929983,0.1869389,0.0005581892,0.0001280669,0.0002642867,0.0009044035,0.0005501537,0.0205843],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01579645,"threshold_uncertainty_score":0.05284441,"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","authors":[{"name":"Philip Kremer","is_ca":true},{"name":"Grigori Mint︠s︡","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009585489,0.0005242287,0.0006139164,0.001857402,0.001816265,0.004702372,0.0007156749,0.001070561,0.01433399],"category_scores_gemma":[0.002147745,0.0003417621,0.0005808533,0.001454246,0.004475961,0.007284318,0.001845357,0.003208598,0.002172613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002590013,"about_ca_system_score_gemma":0.001075169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001259899,"about_ca_topic_score_gemma":0.001234228,"domain_scores_codex":[0.999329,0.0001947265,0.00003204811,0.0001815803,0.0002046692,0.00005804868],"domain_scores_gemma":[0.9990552,0.0003079332,0.00006241144,0.0002303203,0.0002273176,0.0001167742],"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.000003057447,0.000002145618,0.00001874037,0.000005471686,0.000001307923,0.000005953217,0.00003268386,0.0001029862,0.0000556647,0.9957853,0.001779037,0.002207688],"study_design_scores_gemma":[0.000002971654,0.000003053262,0.00003855913,0.000007037108,0.000003092434,0.00003115869,0.00003453489,0.0007315335,0.0000920392,0.9686474,0.03040571,0.000003009422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02941241,0.01343364,0.2478905,0.02287766,0.001909036,0.00005201001,0.001106939,0.0006297525,0.6826881],"genre_scores_gemma":[0.7681749,0.007751324,0.05032687,0.002609022,0.002296155,0.0001396231,0.001344474,0.0003300947,0.1670276],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01433399,"threshold_uncertainty_score":0.047952,"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","authors":[{"name":"Lauri Hella","is_ca":false},{"name":"Leonid Libkin","is_ca":true},{"name":"Juha Nurmonen","is_ca":false},{"name":"Limsoon Wong","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003905231,0.001015618,0.0007517916,0.001873035,0.002109552,0.004282627,0.002292642,0.001247003,0.004313672],"category_scores_gemma":[0.008460006,0.0008420833,0.00299367,0.002922645,0.004508467,0.01311238,0.004859605,0.003951532,0.0007612943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002341091,"about_ca_system_score_gemma":0.001254293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002966114,"about_ca_topic_score_gemma":0.002415497,"domain_scores_codex":[0.9958884,0.001125917,0.0004080583,0.0008175395,0.001303683,0.0004564758],"domain_scores_gemma":[0.9938075,0.003662389,0.0006740722,0.0009211595,0.0005702227,0.0003646312],"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.00003540987,0.00003409162,0.0003300905,0.0001047385,0.00003010762,0.0001457811,0.000379855,0.004990988,0.001344933,0.973257,0.001215104,0.01813181],"study_design_scores_gemma":[0.00002625341,0.00004433189,0.0001454209,0.00003378013,0.00007189836,0.0002141786,0.0001128799,0.02415367,0.002216026,0.9527496,0.02020705,0.00002501828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02592067,0.0008149419,0.9394845,0.001681396,0.0001585314,0.0001314309,0.0003246232,0.0009415688,0.03054235],"genre_scores_gemma":[0.4372976,0.001300047,0.5461806,0.001745019,0.0007502301,0.0003418438,0.0006140641,0.0002523751,0.01151816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004313672,"threshold_uncertainty_score":0.02065313,"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","authors":[{"name":"Steven Shapiro","is_ca":true},{"name":"Maurice Pagnucco","is_ca":false},{"name":"Yves Lespérance","is_ca":true},{"name":"Hector J. Levesque","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005724949,0.000559677,0.000676107,0.001535007,0.002198887,0.004717807,0.001398191,0.001647354,0.003065891],"category_scores_gemma":[0.01118011,0.0005934855,0.001663136,0.001019639,0.008529039,0.008420968,0.002899902,0.004142979,0.0004279697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00467806,"about_ca_system_score_gemma":0.002068645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00615473,"about_ca_topic_score_gemma":0.003795694,"domain_scores_codex":[0.9946103,0.002258758,0.0003277082,0.0006998366,0.001665227,0.0004380611],"domain_scores_gemma":[0.9948993,0.003094314,0.000376025,0.0005112745,0.0008268019,0.0002923048],"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.00001295426,0.000008496275,0.00008476927,0.00001855368,0.00001159777,0.00008839249,0.0005981826,0.001845464,0.0001562933,0.9934864,0.0004075096,0.003281469],"study_design_scores_gemma":[0.00001622353,0.000008854597,0.00006987166,0.00001307036,0.00001607197,0.00004500077,0.0000776881,0.01004458,0.0001662212,0.9851099,0.004420437,0.00001208771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05271229,0.004400056,0.7711805,0.01086399,0.0005536102,0.0001901236,0.0001706703,0.0004770434,0.1594517],"genre_scores_gemma":[0.8733404,0.001222136,0.1087918,0.000721405,0.0004396844,0.0001956813,0.00009054544,0.00007275281,0.01512568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00615473,"threshold_uncertainty_score":0.03394181,"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","authors":[{"name":"James P. Delgrande","is_ca":true},{"name":"Torsten Schaub","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00598213,0.0004817165,0.0006324466,0.0009540488,0.00106098,0.004343143,0.001633405,0.001484291,0.004883415],"category_scores_gemma":[0.01088732,0.0005368625,0.0008819414,0.001327027,0.002133853,0.01000121,0.002204587,0.002617402,0.0008328981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001668991,"about_ca_system_score_gemma":0.0007621918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001355994,"about_ca_topic_score_gemma":0.002297589,"domain_scores_codex":[0.996403,0.001862665,0.0002868199,0.0004070795,0.0007383859,0.000302107],"domain_scores_gemma":[0.9957318,0.002772151,0.0002464471,0.0005676368,0.0004635515,0.0002185119],"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.000147797,0.00005241024,0.0004609984,0.00007553757,0.00002644204,0.0001437199,0.000444326,0.005038447,0.000971017,0.9661552,0.002840455,0.02364363],"study_design_scores_gemma":[0.00002392762,0.00001092918,0.00006358836,0.00002051287,0.00001625765,0.00005659497,0.00008831738,0.02283188,0.0005851555,0.973582,0.002710361,0.00001046987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06952889,0.001021875,0.8812259,0.003897589,0.0002140373,0.00009734021,0.0005898032,0.0005861818,0.04283849],"genre_scores_gemma":[0.7949466,0.0007553194,0.1955556,0.0008126902,0.0002175107,0.000129305,0.0006662,0.0001142829,0.006802405],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00598213,"threshold_uncertainty_score":0.03163689,"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","authors":[{"name":"Martin Gebser","is_ca":false},{"name":"Amelia Harrison","is_ca":false},{"name":"Roland Kaminski","is_ca":false},{"name":"Vladimir Lifschitz","is_ca":false},{"name":"Torsten Schaub","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001822263,0.0005879993,0.0006022066,0.0008493427,0.0008662497,0.003745179,0.001641068,0.000908697,0.01739073],"category_scores_gemma":[0.004740633,0.0003725942,0.0007027569,0.0008409863,0.001986572,0.005989671,0.003169893,0.002546456,0.006147641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001737192,"about_ca_system_score_gemma":0.001408502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002408565,"about_ca_topic_score_gemma":0.001068566,"domain_scores_codex":[0.9977537,0.00062207,0.000179464,0.0004437747,0.0007031929,0.0002977992],"domain_scores_gemma":[0.9982382,0.0004493029,0.0001214417,0.000491611,0.0005603163,0.0001389821],"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.0001857774,0.0000385286,0.0005722889,0.0002366051,0.00001100061,0.0003429436,0.0006707409,0.003234857,0.00282379,0.9128391,0.02788967,0.05115468],"study_design_scores_gemma":[0.00006525443,0.00006894812,0.0004343155,0.0003020201,0.00002617158,0.0005053079,0.0002772385,0.01910912,0.009209407,0.4816416,0.4882999,0.00006072239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0289618,0.0008008513,0.7318587,0.006291213,0.00092135,0.0003467782,0.00340489,0.01471031,0.2127041],"genre_scores_gemma":[0.5248279,0.001489136,0.3749227,0.003822306,0.000565533,0.0005181634,0.0062963,0.005981827,0.08157615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01739073,"threshold_uncertainty_score":0.05817777,"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","authors":[{"name":"Francis Jeffry Pelletier","is_ca":true},{"name":"Renée Elio","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018509,0.0005206448,0.001414444,0.002961235,0.003183587,0.01227888,0.003411192,0.01008566,0.01829063],"category_scores_gemma":[0.04515671,0.001248952,0.001866904,0.001842725,0.03364128,0.0420858,0.006269192,0.009511873,0.002209132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00450874,"about_ca_system_score_gemma":0.002637296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003310868,"about_ca_topic_score_gemma":0.002261169,"domain_scores_codex":[0.9905084,0.00520614,0.000490561,0.001421639,0.001785379,0.0005878131],"domain_scores_gemma":[0.9653131,0.02406422,0.001079213,0.006199982,0.002110909,0.001232495],"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.00002513853,0.00001535813,0.0002087645,0.0000311522,0.00001145572,0.00004942369,0.0002929962,0.0002135878,0.00004342927,0.994033,0.001131617,0.003944085],"study_design_scores_gemma":[0.00001046416,0.000001209892,0.00003644328,0.000009839475,0.000002061844,0.00002592423,0.00004301072,0.0005012514,0.0000313569,0.9973028,0.002031759,0.000003940426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02845928,0.009332093,0.53039,0.2073379,0.001818076,0.000119703,0.00047988,0.0007079436,0.2213552],"genre_scores_gemma":[0.8216946,0.003073955,0.144917,0.01279495,0.003124385,0.0003012847,0.0002962825,0.0003309654,0.01346656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.018509,"threshold_uncertainty_score":0.09788615,"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","authors":[{"name":"Yves Lespérance","is_ca":true},{"name":"Hector J. Levesque","is_ca":true},{"name":"Fangzhen Lin","is_ca":false},{"name":"Richard B. Scherl","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005652686,0.0009459452,0.001425222,0.002483279,0.00359788,0.0102557,0.002523483,0.003138739,0.008535618],"category_scores_gemma":[0.01199853,0.000987481,0.002636734,0.002340032,0.01496247,0.03143404,0.005475817,0.007215521,0.0007990165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002251085,"about_ca_system_score_gemma":0.001871657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005411348,"about_ca_topic_score_gemma":0.002691613,"domain_scores_codex":[0.9954206,0.001991262,0.0004261378,0.0007255494,0.000777946,0.0006584333],"domain_scores_gemma":[0.9901475,0.00738747,0.0004098125,0.00101191,0.0004530431,0.0005902187],"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.00001361751,0.00001354596,0.0001357214,0.00001966783,0.000009898156,0.00005013131,0.0005233359,0.000704658,0.00005878936,0.9961345,0.0002026312,0.002133477],"study_design_scores_gemma":[0.000006730367,0.000002836931,0.00005640225,0.000005968117,0.000009516372,0.00002292526,0.00007969527,0.001267478,0.00005716384,0.9976181,0.000866053,0.000007072771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1775055,0.004629767,0.5387732,0.01604089,0.0003871749,0.0001854282,0.0005663186,0.000672354,0.2612393],"genre_scores_gemma":[0.9441593,0.001421321,0.04477506,0.0003991975,0.0002614989,0.0001103781,0.0003218178,0.00007239629,0.008478992],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0102557,"threshold_uncertainty_score":0.02989459,"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","authors":[{"name":"Holger H. Hoos","is_ca":true},{"name":"Marius Lindauer","is_ca":false},{"name":"Torsten Schaub","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006405593,0.001120022,0.000792088,0.001761362,0.0007027424,0.003244398,0.003113337,0.001317529,0.0148427],"category_scores_gemma":[0.01544213,0.0006553187,0.001407422,0.002066019,0.00112267,0.00375657,0.003432839,0.003669002,0.004069015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001719473,"about_ca_system_score_gemma":0.00275087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002024165,"about_ca_topic_score_gemma":0.002914487,"domain_scores_codex":[0.9940727,0.002129539,0.0004381186,0.0007701288,0.002285556,0.0003039307],"domain_scores_gemma":[0.9928039,0.004069462,0.0003159902,0.001170929,0.001331253,0.0003084938],"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.0004660668,0.000399739,0.001517032,0.0006236341,0.0001620056,0.000207121,0.0002473997,0.08267284,0.008226175,0.1557542,0.07755086,0.672173],"study_design_scores_gemma":[0.0001989744,0.0001931469,0.000392412,0.0001806839,0.00005416563,0.0003440364,0.00008048136,0.6861024,0.02032997,0.1871219,0.1049482,0.00005367824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005312829,0.0006519615,0.9724076,0.001177516,0.0001802332,0.0001445239,0.0003169586,0.008983539,0.01082486],"genre_scores_gemma":[0.08079989,0.0006009702,0.9085782,0.0006685039,0.0002307042,0.0001883797,0.00143689,0.002015998,0.005480524],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0148427,"threshold_uncertainty_score":0.04965377,"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","authors":[{"name":"Daniel R. Brooks","is_ca":true},{"name":"Esra Erdem","is_ca":false},{"name":"Selim T. Erdoğan","is_ca":false},{"name":"James W. Minett","is_ca":false},{"name":"Don Ringe","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004507845,0.001237384,0.001722954,0.005232298,0.002132079,0.004928645,0.004071549,0.00290952,0.008023235],"category_scores_gemma":[0.02889783,0.001215606,0.003683064,0.003398301,0.002280646,0.01131352,0.003578824,0.003257527,0.001212948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001348602,"about_ca_system_score_gemma":0.001659848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003798651,"about_ca_topic_score_gemma":0.008281637,"domain_scores_codex":[0.9953216,0.001932719,0.0004497529,0.0009614523,0.001012797,0.0003215849],"domain_scores_gemma":[0.9723697,0.02367097,0.0008629241,0.001509393,0.001165163,0.0004219364],"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.0008071398,0.001123748,0.01700541,0.00151834,0.0008391638,0.001618969,0.001804592,0.1665203,0.006872475,0.3540834,0.01556473,0.4322417],"study_design_scores_gemma":[0.00007777247,0.00004423517,0.000689058,0.00009212916,0.0001769336,0.0001932756,0.0003228677,0.3274179,0.00255205,0.6640773,0.00431754,0.00003895102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04854298,0.0006743657,0.941272,0.001606363,0.00009566109,0.0001835722,0.001411837,0.00244081,0.003772531],"genre_scores_gemma":[0.2646513,0.0004979133,0.7282436,0.0003466666,0.0001359668,0.0001644597,0.004162899,0.0003134766,0.001483656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008023235,"threshold_uncertainty_score":0.02684039,"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","authors":[{"name":"James P. Delgrande","is_ca":true},{"name":"Torsten Schaub","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01770621,0.001186355,0.002131686,0.005204651,0.002847389,0.006812986,0.008307878,0.00411925,0.009142019],"category_scores_gemma":[0.08936248,0.001552993,0.003718962,0.004351845,0.005889262,0.01575249,0.007287501,0.007967616,0.001228988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003263163,"about_ca_system_score_gemma":0.003115439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006081798,"about_ca_topic_score_gemma":0.004518935,"domain_scores_codex":[0.9841684,0.006309347,0.001231142,0.002817524,0.004816711,0.0006569464],"domain_scores_gemma":[0.9451798,0.03595665,0.002387314,0.00762437,0.007878754,0.0009731181],"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.0002019824,0.0001206815,0.001394945,0.0002455915,0.0002212955,0.0002311905,0.0009242716,0.03072325,0.0008645958,0.8603473,0.003769603,0.1009552],"study_design_scores_gemma":[0.00005997795,0.00005800791,0.0002957792,0.00006693595,0.0001160316,0.0001560674,0.0001345727,0.1663766,0.0008993591,0.8271624,0.004627333,0.00004688685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002806726,0.0003469821,0.9898303,0.001455066,0.0001389134,0.0001232004,0.0001299214,0.0002195343,0.004949295],"genre_scores_gemma":[0.2859944,0.000548853,0.7050334,0.0008995656,0.0006602246,0.0006336785,0.0005851526,0.0002253663,0.005419369],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01770621,"threshold_uncertainty_score":0.09364057,"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","authors":[{"name":"Yongmei Liu","is_ca":true},{"name":"Hector J. Levesque","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006143825,0.001319609,0.002052726,0.002046559,0.002291335,0.006333712,0.003582072,0.002665394,0.003118008],"category_scores_gemma":[0.02503205,0.001571712,0.003788417,0.003125052,0.005924733,0.01755725,0.005656348,0.006261349,0.0004716837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004056006,"about_ca_system_score_gemma":0.003855508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0128887,"about_ca_topic_score_gemma":0.01204034,"domain_scores_codex":[0.9930455,0.002280995,0.0005169986,0.001355638,0.002046105,0.0007547694],"domain_scores_gemma":[0.9764746,0.01932671,0.001152793,0.001745749,0.0009436344,0.0003566863],"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.0002017827,0.0001146713,0.0008033147,0.0005955663,0.0001741426,0.001436307,0.001558233,0.2274199,0.001553407,0.7258515,0.002480336,0.03781086],"study_design_scores_gemma":[0.00006716438,0.00002468849,0.0001536882,0.00005844515,0.00007008624,0.0001944966,0.000194128,0.1913837,0.001561782,0.8027746,0.003486857,0.00003033541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02797494,0.0008009033,0.9635878,0.002361383,0.00003696119,0.0001419334,0.0004853474,0.0005778359,0.004032929],"genre_scores_gemma":[0.5589627,0.002166347,0.4311397,0.0005342481,0.0003614343,0.0004070742,0.001583696,0.0001308776,0.004713905],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0128887,"threshold_uncertainty_score":0.03249204,"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","authors":[{"name":"Marc Denecker","is_ca":false},{"name":"Eugenia Ternovska","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002516617,0.0009976394,0.0007646158,0.002560815,0.002472768,0.005274772,0.002639839,0.001557693,0.02815249],"category_scores_gemma":[0.005690344,0.0009194145,0.001576448,0.001972464,0.00442106,0.009520422,0.003480258,0.004967642,0.007861235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002712657,"about_ca_system_score_gemma":0.001791299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002104555,"about_ca_topic_score_gemma":0.001656912,"domain_scores_codex":[0.9973668,0.0007855677,0.0001737165,0.0005856837,0.000826468,0.0002617409],"domain_scores_gemma":[0.9979867,0.0009794554,0.00007413386,0.0003503267,0.0004754693,0.0001339328],"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.000009841251,0.00001647018,0.00005110272,0.00002699713,0.00000538094,0.00003277702,0.0001566022,0.0002647641,0.0001350844,0.989473,0.002513407,0.007314475],"study_design_scores_gemma":[0.00001008493,0.000004310446,0.00004892088,0.00002047831,0.00001168275,0.00005965399,0.00005536953,0.002049923,0.0003966868,0.9709432,0.02639246,0.000007361014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006228123,0.001735861,0.6051375,0.003802576,0.0004302108,0.0001928519,0.0008672228,0.001154611,0.3804509],"genre_scores_gemma":[0.4988079,0.003426341,0.3431755,0.002085451,0.0009774942,0.0005638741,0.003401462,0.0006203676,0.1469416],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02815249,"threshold_uncertainty_score":0.09417945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}