{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":27,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":27,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"45fc18fbc93e","filters":{"venue":"Journal of Automated Reasoning"}},"results":[{"id":"W1505627668","doi":"10.1023/a:1027357912519","title":"Theorem Proving Modulo","year":2003,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":214,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Modulo; Sequent calculus; Sequent; Cut-elimination theorem; Mathematics; Mathematical proof; Axiom; Congruence (geometry); Natural deduction; Calculus (dental); Automated theorem proving; Proof theory; Completeness (order theory); Algebra over a field; Resolution (logic); Proof complexity; Discrete mathematics; Algorithm; Computer science; Pure mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01164531881062052,"gpt":0.2442941495148121,"spread":0.2326488307041916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001398059,0.000123345,0.0002380304,0.0001426676,0.0001351252,0.000274373,0.0005267984,0.0000741501,0.000009496168],"category_scores_gemma":[0.000395844,0.00008737286,0.0001182279,0.0003460719,0.000026046,0.0005554072,0.00004692918,0.0002192731,0.00002019551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000624724,"about_ca_system_score_gemma":0.0001651253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007423188,"about_ca_topic_score_gemma":7.773012e-7,"domain_scores_codex":[0.9986008,0.0001928074,0.0004209013,0.0001500547,0.0003490954,0.0002862742],"domain_scores_gemma":[0.9988013,0.00007325828,0.0005421542,0.0002459397,0.0002157427,0.0001215922],"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.000007081995,0.000100066,0.002703099,0.00003678269,0.0001078579,0.0003513916,0.002028567,0.0008229424,0.002302304,0.968645,0.001379579,0.02151527],"study_design_scores_gemma":[0.004540056,0.001861174,0.008858267,0.0005742827,0.0001405322,0.0194336,0.001670404,0.7402167,0.03824214,0.1046151,0.07814989,0.001697861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07068948,0.001692957,0.8962251,0.0002076541,0.002432436,0.0001953217,1.276975e-7,0.000868206,0.02768873],"genre_scores_gemma":[0.9656692,0.00001052433,0.03401944,0.0000438474,0.00009597849,0.00000117467,1.171161e-7,0.00001063515,0.0001491005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8949797,"threshold_uncertainty_score":0.3562962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073165288","doi":"10.1007/s10817-007-9092-z","title":"On Keys and Functional Dependencies as First-Class Citizens in Description Logics","year":2007,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Decidability; Negation; Dependency theory (database theory); Identification (biology); Scope (computer science); Class (philosophy); Functional dependency; Constraint (computer-aided design); Monotone polygon; Computer science; Conjunctive normal form; Mathematics; Theoretical computer science; Logical consequence; Simple (philosophy); Discrete mathematics; Programming language; Artificial intelligence; Epistemology; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.01880295743059998,"gpt":0.2498103295776138,"spread":0.2310073721470138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052551,0.0001044528,0.0001815054,0.000309868,0.000109106,0.0001373353,0.0001988116,0.00009649112,0.00001055188],"category_scores_gemma":[0.0006131862,0.00008145263,0.00004817553,0.0002624569,0.00004046293,0.0004198734,0.00005962318,0.0002469801,0.00001011915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000108553,"about_ca_system_score_gemma":0.0000718104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002804638,"about_ca_topic_score_gemma":0.00006241712,"domain_scores_codex":[0.9988825,0.00004261094,0.0003508355,0.0001394395,0.0003516282,0.000232949],"domain_scores_gemma":[0.9990662,0.0003736385,0.000253527,0.0001081304,0.000123562,0.000074971],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.001365309,0.001099838,0.3435144,0.0002443005,0.0004621886,0.01245285,0.01405584,0.04454249,0.02812267,0.448601,0.01387591,0.09166323],"study_design_scores_gemma":[0.001079397,0.000518947,0.8545163,0.0005486595,0.00001344538,0.002761098,0.0006822149,0.1271833,0.002491322,0.009767387,0.0002374029,0.0002004921],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9272823,0.0003441381,0.06909461,0.0005094128,0.0005938276,0.0000391617,1.202058e-7,0.0001443938,0.001992006],"genre_scores_gemma":[0.9861332,0.00006239579,0.01353824,0.0001645533,0.0000562578,3.529796e-7,2.240098e-7,0.000004447003,0.00004032801],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5110019,"threshold_uncertainty_score":0.3321542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1588366745","doi":"10.1023/a:1026517200045","title":"Structured Theory Development for a Mechanized Logic","year":2001,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Structuring; Correctness; Computer science; Automated theorem proving; Programming language; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0195830759042623,"gpt":0.2671854592857371,"spread":0.2476023833814747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001447883,0.0001413903,0.0002932565,0.0001612857,0.0001780757,0.0001858515,0.0006037076,0.00009328993,0.00001269186],"category_scores_gemma":[0.0002554424,0.00009680832,0.0001193489,0.0002880258,0.00001527989,0.0002926234,0.00006883773,0.0001348385,0.000007345603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008664657,"about_ca_system_score_gemma":0.0002015253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002087621,"about_ca_topic_score_gemma":0.000001849729,"domain_scores_codex":[0.9986356,0.0001130864,0.0004920924,0.0001628455,0.0002929291,0.0003034202],"domain_scores_gemma":[0.9986849,0.000130977,0.0005903967,0.0001781285,0.0003027152,0.0001128868],"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.0001908433,0.0001283002,0.0004375148,0.0000666554,0.000403753,0.0003842185,0.004678899,0.0004246415,0.006131251,0.8341465,0.001362763,0.1516447],"study_design_scores_gemma":[0.01084206,0.001960779,0.00623663,0.0004014347,0.0001873274,0.01349856,0.001511205,0.3019331,0.03345468,0.5106934,0.1176095,0.001671344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01872878,0.0005175932,0.9785566,0.0001236543,0.0009575631,0.0001869674,1.320665e-7,0.000352766,0.0005759505],"genre_scores_gemma":[0.8243628,0.00001055188,0.1752508,0.00008592296,0.0001225301,0.000005366919,8.180953e-7,0.00001029642,0.0001508855],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.805634,"threshold_uncertainty_score":0.3947729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140849218","doi":"10.1007/s10817-010-9194-x","title":"Hybrid","year":2010,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Soundness; HOL; Syntax; Type theory; Abstract syntax; Object (grammar); Semantics (computer science); Theoretical computer science; Type (biology); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01017665470751357,"gpt":0.2508258454006908,"spread":0.2406491906931772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008094282,0.00009404924,0.000191736,0.0001272627,0.00009872808,0.000243147,0.0006811859,0.00005472636,0.00001514445],"category_scores_gemma":[0.0002022597,0.00006762028,0.0001044365,0.0001709531,0.00002683836,0.0004783416,0.0000739305,0.0003749864,0.00004237694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001796239,"about_ca_system_score_gemma":0.0001125551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001291206,"about_ca_topic_score_gemma":0.000001884568,"domain_scores_codex":[0.9989735,0.00004675058,0.000346577,0.0001142732,0.0003001673,0.0002186597],"domain_scores_gemma":[0.9989052,0.00005614695,0.0004484772,0.0002447098,0.0002138445,0.0001316205],"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.00002928779,0.0003668357,0.01005331,0.00007626668,0.0003324514,0.002738287,0.003013979,0.000333335,0.07419311,0.6809053,0.0306152,0.1973426],"study_design_scores_gemma":[0.003199992,0.001170461,0.02510896,0.0001591267,0.00008980238,0.03628697,0.0001988479,0.6300623,0.05874922,0.0316909,0.2121223,0.001161129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.575277,0.0005126318,0.401433,0.000743735,0.008619469,0.0001439635,2.991836e-7,0.001251674,0.01201824],"genre_scores_gemma":[0.9723277,0.000005413489,0.02720773,0.00005088173,0.0002944967,6.105858e-7,2.140813e-7,0.00000745014,0.000105465],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6492144,"threshold_uncertainty_score":0.2757475,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997780525","doi":"10.1007/s10817-007-9082-1","title":"Inferring Phylogenetic Trees Using Answer Set Programming","year":2007,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Austrian Science Fund; National Science Foundation","keywords":"Cladistics; Phylogenetic tree; Computer science; Taxon; Set (abstract data type); Formalism (music); Phylogenetics; Theoretical computer science; Representation (politics); Artificial intelligence; Programming language; Biology; Paleontology","retraction":null,"screen_n_in":null,"score":{"opus":0.02376857054380687,"gpt":0.2980693273525292,"spread":0.2743007568087223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001936728,0.0002528098,0.0004071772,0.0004525445,0.0002730371,0.0003500698,0.0008414992,0.0001496094,0.000009029505],"category_scores_gemma":[0.0003463748,0.0002054778,0.0002091831,0.0008348884,0.00006319574,0.0007125559,0.0001936592,0.0003947648,0.000009359329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001815149,"about_ca_system_score_gemma":0.0002214642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002460523,"about_ca_topic_score_gemma":0.00001859276,"domain_scores_codex":[0.9976709,0.0001016907,0.0007693358,0.0002687712,0.000511317,0.000677955],"domain_scores_gemma":[0.9980382,0.0001791473,0.0007935509,0.0003144578,0.000394965,0.0002797109],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002011122,0.0009882543,0.2400466,0.000263767,0.001173577,0.005924863,0.03117246,0.03687591,0.1597115,0.01549846,0.001238671,0.5069049],"study_design_scores_gemma":[0.00226641,0.0007836327,0.1021864,0.001463708,0.000159122,0.007137577,0.0008026409,0.8507912,0.02678573,0.0005427835,0.006034627,0.001046149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.739432,0.00128332,0.2566566,0.00003653147,0.0009098304,0.0001002244,3.213003e-7,0.0004161592,0.001164913],"genre_scores_gemma":[0.8451947,0.0000182659,0.1543531,0.00004143908,0.0003409506,5.711451e-7,4.607996e-7,0.00002127841,0.00002920244],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8139153,"threshold_uncertainty_score":0.8379143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2905126952","doi":"10.1007/s10817-008-9104-7","title":"On the Scalability of Description Logic Instance Retrieval","year":2008,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":51,"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":"Description logic; Computer science; Scalability; Ontology; Semantic Web; Web Ontology Language; Ontology language; Information retrieval; Knowledge representation and reasoning; Implementation; Representation (politics); OWL-S; Theoretical computer science; Programming language; Semantic Web Stack; Database; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03488639177182947,"gpt":0.2576629082741037,"spread":0.2227765165022742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009645483,0.00008400542,0.0002152571,0.00008438407,0.0001348695,0.00003463393,0.0005914685,0.00005857618,0.000008043018],"category_scores_gemma":[0.001490852,0.00004760207,0.00009797153,0.0003956781,0.0001230187,0.0003398167,0.00005558184,0.0002193524,0.000005057726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005999289,"about_ca_system_score_gemma":0.0001189736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000646164,"about_ca_topic_score_gemma":7.97833e-7,"domain_scores_codex":[0.9987872,0.0001549957,0.0004042617,0.0001080969,0.0003967421,0.0001487274],"domain_scores_gemma":[0.9985204,0.0003800376,0.0005213504,0.0002771872,0.0002622101,0.00003884573],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.001620778,0.001962977,0.1155978,0.0002367256,0.0006456241,0.001981141,0.01945874,0.01436298,0.1265087,0.6696681,0.02381836,0.02413815],"study_design_scores_gemma":[0.0011191,0.001176305,0.668391,0.0008272301,0.00002976808,0.002332484,0.0003953146,0.2683909,0.03867151,0.01822059,0.0001680798,0.0002777175],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9688576,0.0002467993,0.02861795,0.0009178774,0.0003796241,0.00004959639,1.977084e-7,0.0001147578,0.0008156151],"genre_scores_gemma":[0.985067,0.00005754423,0.01470991,0.0001193991,0.00002818996,2.025768e-7,6.307266e-8,0.000003013545,0.00001471347],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6514475,"threshold_uncertainty_score":0.1941156,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1585415359","doi":"10.1023/a:1021966832558","title":"A Compendium of Continuous Lattices in MIZAR","year":2002,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":37,"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":"Compendium; Mathematical proof; Programming language; Computer science; Correctness; Simple (philosophy); Proof assistant; Calculus (dental); Mathematics; Linguistics; Philosophy; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.01328968098320752,"gpt":0.2462505761073052,"spread":0.2329608951240977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003214743,0.00009093823,0.0003183918,0.0002155396,0.00003295872,0.00004026073,0.0005057639,0.00004871143,0.00003212862],"category_scores_gemma":[0.0001377457,0.00007163137,0.00007464003,0.0004056394,0.00003303591,0.0005143932,0.00006270823,0.0001971938,0.000008179494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002855073,"about_ca_system_score_gemma":0.00002115121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005582528,"about_ca_topic_score_gemma":0.000001646897,"domain_scores_codex":[0.9988952,0.00007544737,0.0004932018,0.0001033659,0.000238129,0.0001946997],"domain_scores_gemma":[0.9989174,0.0001398177,0.000617979,0.0001505492,0.000110262,0.00006398138],"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.0003383255,0.005138068,0.1817645,0.0006857764,0.001045289,0.01426158,0.04445181,0.1299058,0.1046976,0.1927511,0.01870295,0.3062572],"study_design_scores_gemma":[0.001977592,0.0005011848,0.03483288,0.0008267308,0.00002018812,0.001256597,0.0002683625,0.9530478,0.00460038,0.00138159,0.001027004,0.0002596959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9681269,0.002857081,0.02505003,0.0004702558,0.0004318061,0.00007420857,6.749723e-7,0.0001711503,0.002817927],"genre_scores_gemma":[0.9484464,0.00007484588,0.05135549,0.00005002049,0.00003139588,3.391631e-7,9.583783e-8,0.000005173503,0.00003621761],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.823142,"threshold_uncertainty_score":0.2921042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1551936078","doi":"10.1007/s10817-015-9327-3","title":"The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract Syntax Representations","year":2015,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Ottawa","funders":"","keywords":"Syntax; Computer science; Variety (cybernetics); Context (archaeology); Automated reasoning; Order (exchange); Reasoning system; Abstract syntax; Programming language; Artificial intelligence; Natural language processing","retraction":null,"screen_n_in":null,"score":{"opus":0.05308342773294895,"gpt":0.2990921808630375,"spread":0.2460087531300885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001737898,0.0001853611,0.0002894728,0.0001061146,0.00044061,0.0007614433,0.0007744856,0.00009402956,0.000002799],"category_scores_gemma":[0.0003206534,0.0001063859,0.0001090499,0.0004253547,0.00006977512,0.0009790743,0.00007892673,0.0002871736,0.00000982928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001042746,"about_ca_system_score_gemma":0.0003563644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008591863,"about_ca_topic_score_gemma":0.00003067193,"domain_scores_codex":[0.9980955,0.0001024588,0.0005733751,0.0002432051,0.0005639549,0.000421483],"domain_scores_gemma":[0.9971253,0.0003349197,0.0009923795,0.0003902358,0.0009329852,0.0002241776],"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.0005135267,0.0009605933,0.005731069,0.0003893026,0.002165247,0.0008548481,0.02908712,0.03660154,0.001068639,0.7272596,0.03711289,0.1582557],"study_design_scores_gemma":[0.01032442,0.005538289,0.01950684,0.001645938,0.0003853669,0.005966263,0.008779748,0.538832,0.001079282,0.0289054,0.3770705,0.001965989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05541998,0.01895453,0.8559459,0.01609241,0.007177722,0.002857544,0.000003596307,0.002852927,0.04069534],"genre_scores_gemma":[0.9575792,0.00007427404,0.04146432,0.00003070071,0.0003414001,0.00003148507,0.00000163433,0.00002607684,0.0004509361],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9021592,"threshold_uncertainty_score":0.7342616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136755926","doi":"10.1007/s10817-008-9105-6","title":"Performance Analysis and Functional Verification of the Stop-and-Wait Protocol in HOL","year":2008,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":22,"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":"HOL; Correctness; Computer science; Automated theorem proving; Protocol (science); Theoretical computer science; Proof assistant; Relation (database); Process (computing); Programming language; Distributed computing; Mathematics; Data mining; Mathematical proof","retraction":null,"screen_n_in":null,"score":{"opus":0.02293252770016554,"gpt":0.280763979706973,"spread":0.2578314520068075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009042248,0.00006533065,0.0001642206,0.0002670395,0.0001051967,0.00002344427,0.0002194425,0.0000454129,0.000002543135],"category_scores_gemma":[0.0001773068,0.0000449243,0.00004896997,0.0009877627,0.00007559815,0.0005512501,0.00005684732,0.0001644371,3.259173e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004225402,"about_ca_system_score_gemma":0.00008555025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008010478,"about_ca_topic_score_gemma":5.749912e-7,"domain_scores_codex":[0.9989914,0.0001336917,0.000399507,0.0001039373,0.0002826968,0.00008879511],"domain_scores_gemma":[0.9989906,0.00004961291,0.0005851043,0.0001876166,0.0001544933,0.00003259421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001703542,0.0001762943,0.9118321,0.0001106885,0.00025266,0.00001052801,0.004423068,0.02346988,0.02473117,0.004053934,0.000104602,0.03066473],"study_design_scores_gemma":[0.0001770097,0.00003774487,0.579895,0.00004629548,0.00001370423,0.0001080914,0.00001381905,0.4149143,0.004724499,0.00001166409,0.00002877511,0.00002916289],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9626006,0.00001738316,0.03572825,0.00007740724,0.00006876046,0.001377824,2.635269e-7,0.0000268447,0.0001026324],"genre_scores_gemma":[0.8818407,0.00001458562,0.1179377,0.00001169657,0.00001425484,0.0001672029,1.415406e-7,0.00000275129,0.00001098741],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3914444,"threshold_uncertainty_score":0.183196,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1946985707","doi":"10.1023/a:1015736313131","title":"The IJCAR ATP System Competition","year":2002,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":17,"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":"Computer science; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01484449246328016,"gpt":0.230399420483365,"spread":0.2155549280200848,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008938497,0.0001039213,0.0001956772,0.00007797056,0.000369117,0.0004311482,0.0006692662,0.00006216553,0.000005027805],"category_scores_gemma":[0.00008117787,0.0000611867,0.0001196142,0.0002913682,0.00003465745,0.0003577248,0.00006181301,0.00019485,0.00007616192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001043216,"about_ca_system_score_gemma":0.00002706211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000113248,"about_ca_topic_score_gemma":0.00000129948,"domain_scores_codex":[0.9986293,0.0001568206,0.0004483595,0.0001125558,0.0004061953,0.0002467428],"domain_scores_gemma":[0.9986866,0.0001311106,0.0005997515,0.0002563047,0.000232844,0.00009340922],"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.00001129669,0.0001005765,0.0009292257,0.0001001747,0.0002223971,0.0005790144,0.004119963,0.0007812206,0.0007427162,0.9368878,0.01018807,0.04533756],"study_design_scores_gemma":[0.000697043,0.0003033349,0.001480714,0.0002236997,0.00003087897,0.004574575,0.0007609759,0.9223472,0.0004756487,0.0004454023,0.06844022,0.0002202729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07132954,0.01822915,0.8204706,0.004667046,0.01437825,0.0007090608,0.000001059828,0.004448195,0.06576712],"genre_scores_gemma":[0.9966967,0.00005362512,0.002791944,0.00002998518,0.0002436262,0.000001654961,1.726073e-7,0.000008064338,0.000174245],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9364424,"threshold_uncertainty_score":0.4157572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1589528070","doi":"10.1023/a:1020116927466","title":"SLT-Resolution for the Well-Founded Semantics","year":2002,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"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":"Prolog; Computer science; Resolution (logic); Computation; Semantics (computer science); Programming language; Algorithm; Extension (predicate logic); Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02321473503476437,"gpt":0.2570563489167325,"spread":0.2338416138819681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001035559,0.0001627145,0.0002600723,0.0001338666,0.0004457393,0.000319539,0.0009735369,0.0001148142,0.0000316336],"category_scores_gemma":[0.0005450014,0.0001011023,0.0002334415,0.0004020251,0.00005628475,0.0005219286,0.000107189,0.0003004488,0.00005142907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009700094,"about_ca_system_score_gemma":0.00006115922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005626091,"about_ca_topic_score_gemma":0.000003670316,"domain_scores_codex":[0.9985232,0.00009870543,0.0004658216,0.0001723351,0.0003639356,0.0003760106],"domain_scores_gemma":[0.9980156,0.0005392631,0.0005986464,0.0003340656,0.0003984799,0.0001139448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001837532,0.001314018,0.003563041,0.0002754066,0.001655594,0.0005387166,0.02035716,0.0414739,0.005361182,0.3157883,0.4834424,0.1260466],"study_design_scores_gemma":[0.0007354727,0.0002420825,0.001353965,0.0001341215,0.00005566914,0.0006398631,0.00009674077,0.9775828,0.0004876781,0.0007249854,0.01780193,0.0001447436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02683329,0.006960704,0.9487613,0.004059337,0.003710931,0.000381787,0.000001467577,0.0007604419,0.008530686],"genre_scores_gemma":[0.9599792,0.0002955203,0.03837517,0.0001562773,0.0004801048,0.000004152573,4.351874e-7,0.00001734725,0.0006917729],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9361088,"threshold_uncertainty_score":0.4122832,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115178223","doi":"10.1007/s10817-008-9113-6","title":"Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables","year":2008,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"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":"HOL; Variance (accounting); Random variable; Probabilistic logic; Computer science; Mathematics; Automated theorem proving; Variable (mathematics); Probabilistic analysis of algorithms; Theoretical computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03513138134636556,"gpt":0.3242461021989455,"spread":0.2891147208525799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00134819,0.0001073021,0.0002270025,0.0001641332,0.0002758785,0.0001164359,0.0003023951,0.00006462233,0.00000108187],"category_scores_gemma":[0.001267409,0.00008969048,0.00005240994,0.0003156085,0.00003107144,0.001046034,0.00005809392,0.0001244557,3.905786e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007692173,"about_ca_system_score_gemma":0.0001200968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005349412,"about_ca_topic_score_gemma":1.484896e-7,"domain_scores_codex":[0.9988554,0.0001572858,0.0004072907,0.0001647473,0.0002232089,0.0001920716],"domain_scores_gemma":[0.9987575,0.0002439304,0.0004922618,0.0001661883,0.0002467067,0.00009344862],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002139524,0.0002120721,0.004178863,0.0003828716,0.0004650115,0.000208494,0.05143698,0.1522971,0.5323291,0.2014569,0.0009895245,0.05390358],"study_design_scores_gemma":[0.0009933808,0.0001524177,0.003495333,0.0002753085,0.00001816938,0.0008448883,0.0001099826,0.9818383,0.01135552,0.0006645719,0.0001248913,0.0001271744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1666564,0.0001042447,0.8324313,0.00009046312,0.0003301432,0.0001820938,6.680493e-7,0.0001045333,0.0001002126],"genre_scores_gemma":[0.3890206,0.00001076085,0.6108609,0.00002585076,0.00006466359,0.00000375331,2.213675e-7,0.000007637327,0.000005632465],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8295413,"threshold_uncertainty_score":0.3657472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2904404870","doi":"10.1007/s10817-019-09527-x","title":"Formalization of Metatheory of the Quipper Quantum Programming Language in a Linear Logic","year":2019,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Soundness; Programming language; Metatheory; Dependent type; Computer science; Linear logic; Syntax; Lambda calculus; Type theory; Theoretical computer science; Typed lambda calculus; Type (biology); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01066903144732005,"gpt":0.2637763725017103,"spread":0.2531073410543902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001455075,0.00009114637,0.0003017376,0.0001659594,0.00002842369,0.00003273605,0.000534912,0.0000703195,0.00000499195],"category_scores_gemma":[0.0001971679,0.00005349122,0.0001400208,0.0005670353,0.00003389515,0.0003515038,0.00009479815,0.0001592283,0.000002731034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003166448,"about_ca_system_score_gemma":0.0001007841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005379419,"about_ca_topic_score_gemma":0.000005919556,"domain_scores_codex":[0.9986111,0.0001852489,0.0005917175,0.0001002069,0.0003316375,0.0001800823],"domain_scores_gemma":[0.9984558,0.00007791663,0.001003038,0.0002431591,0.0001883733,0.00003170981],"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.0001362682,0.0008016652,0.1535656,0.001062396,0.0004045675,0.0001363373,0.05410028,0.01615133,0.05360391,0.6774701,0.0001322592,0.04243528],"study_design_scores_gemma":[0.002406315,0.001076097,0.0285699,0.0009409261,0.0000764651,0.000640467,0.004730608,0.9308848,0.02519834,0.004149821,0.0009552059,0.0003710368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9333494,0.001088708,0.06398454,0.00006496391,0.0007478815,0.000264804,2.627401e-7,0.00007870327,0.0004206885],"genre_scores_gemma":[0.992003,0.00000862891,0.007899047,0.000016578,0.00002620438,0.000001029202,3.694721e-7,0.00000705437,0.00003815078],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9147335,"threshold_uncertainty_score":0.2181309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015771391","doi":"10.1007/s10817-009-9134-9","title":"Faster and More Complete Extended Static Checking for the Java Modeling Language","year":2009,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":11,"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":"Programming language; Computer science; Java Modeling Language; Java; Programming language specification; Model checking; Generics in Java; Real time Java; Java annotation","retraction":null,"screen_n_in":null,"score":{"opus":0.02620042090842135,"gpt":0.2924356150562363,"spread":0.2662351941478149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007749048,0.0001158101,0.0002229494,0.00008265358,0.0002010174,0.0003230235,0.0003879055,0.00004347232,0.000001295658],"category_scores_gemma":[0.0001034774,0.00006917332,0.00007572126,0.0001352426,0.00002089929,0.000339507,0.00004338916,0.0001565444,0.000001159632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002766012,"about_ca_system_score_gemma":0.00004260712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001530268,"about_ca_topic_score_gemma":0.000001376737,"domain_scores_codex":[0.9989712,0.00004919935,0.000361755,0.0001330904,0.0002408335,0.000243941],"domain_scores_gemma":[0.9991223,0.000133471,0.0003380385,0.0001788322,0.0001553153,0.00007200094],"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.0001913488,0.0003447648,0.0007333391,0.0003453119,0.0008165889,0.0007052423,0.1033388,0.08413235,0.02197045,0.1066298,0.002352363,0.6784397],"study_design_scores_gemma":[0.0004815258,0.000181156,0.0006637785,0.00006014078,0.00002597132,0.0004447295,0.001062259,0.9955311,0.0001253804,0.001112024,0.0002176219,0.00009430919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06640595,0.001823316,0.9301727,0.0008526134,0.0002683933,0.0001801406,5.572036e-7,0.0001636354,0.0001326298],"genre_scores_gemma":[0.9698191,0.00001795104,0.02978222,0.0002218965,0.0001202101,0.000001774337,6.718453e-7,0.000007662672,0.00002852763],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9113988,"threshold_uncertainty_score":0.3114923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016884416","doi":"10.1007/s10817-012-9258-1","title":"Specification and Verification of Concurrent Programs Through Refinements","year":2012,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Programming language; Correctness; Automated theorem proving; Predicate abstraction; Gas meter prover; Predicate (mathematical logic); Predicate transformer semantics; TRACE (psycholinguistics); Proof theory; Proof assistant; Separation logic; Automated proof checking; Theoretical computer science; Model checking; Mathematical proof; Operational semantics; Mathematics; Semantics (computer science)","retraction":null,"screen_n_in":null,"score":{"opus":0.04461471312132197,"gpt":0.3306390048068866,"spread":0.2860242916855646,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001222467,0.00008624521,0.000171722,0.00009104043,0.00005661833,0.00005058089,0.0002987896,0.00005479982,0.000003161817],"category_scores_gemma":[0.0002048273,0.00007265792,0.00004127602,0.0003204043,0.00005027999,0.001339083,0.00004836629,0.0001252562,0.000002994377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005943838,"about_ca_system_score_gemma":0.00003670729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003902138,"about_ca_topic_score_gemma":6.807824e-8,"domain_scores_codex":[0.9987381,0.0001299108,0.0005485727,0.00009846048,0.0003179328,0.0001670455],"domain_scores_gemma":[0.9983346,0.0000380338,0.001066422,0.0002255031,0.0002648688,0.00007051572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00004516498,0.0007021028,0.01913127,0.0001759627,0.0001418029,0.000002697353,0.01097026,0.00009899564,0.06827241,0.3045317,0.0006592055,0.5952684],"study_design_scores_gemma":[0.002026791,0.0009904747,0.5081579,0.001274997,0.0001274306,0.0007550016,0.0009070005,0.2794586,0.1871794,0.0009371709,0.01762431,0.0005609428],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.410138,0.001592462,0.5859919,0.0001438164,0.00109117,0.0001724889,6.795846e-7,0.0001461486,0.0007234049],"genre_scores_gemma":[0.5760812,0.0001055956,0.4237446,0.000006655809,0.00005054832,0.00000188073,0.000001286035,0.000004006423,0.000004270257],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5947075,"threshold_uncertainty_score":0.2962904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142949137","doi":"10.1007/s10817-005-0084-6","title":"Tool-Assisted Specification and Verification of Typed Low-Level Languages","year":2006,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Bytecode; Correctness; Computer science; Programming language; Java Card; Java bytecode; Java; Automated theorem proving; Mathematical proof; Java applet; Java annotation","retraction":null,"screen_n_in":null,"score":{"opus":0.01638369516765132,"gpt":0.2659575518394582,"spread":0.2495738566718069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005611507,0.00007587957,0.0001588346,0.0001558851,0.00007851351,0.00008739866,0.0002788759,0.00006030511,0.000004518679],"category_scores_gemma":[0.000132959,0.00006957627,0.00004481495,0.0003408198,0.00003557441,0.0002563528,0.0000332931,0.000110404,0.000002790784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003797869,"about_ca_system_score_gemma":0.00006537962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002167257,"about_ca_topic_score_gemma":9.560061e-7,"domain_scores_codex":[0.9989781,0.00007536951,0.0004915003,0.0001234917,0.0002292593,0.0001022662],"domain_scores_gemma":[0.9986154,0.0001147602,0.0007458139,0.0002015785,0.0002923453,0.00003011209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0001246557,0.0007935681,0.01363108,0.0003309708,0.0001990863,0.00007389545,0.004910366,0.005734407,0.5365099,0.2331229,0.005711911,0.1988572],"study_design_scores_gemma":[0.0006287973,0.00007730115,0.6315052,0.0003340144,0.00002136513,0.000307297,0.0002028127,0.3293569,0.0362994,0.0006919226,0.0004053999,0.0001696533],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.867323,0.0005278231,0.1308042,0.0002950951,0.0002072481,0.00005432449,0.000001546573,0.0001366514,0.0006501086],"genre_scores_gemma":[0.9140165,0.00002185248,0.08582392,0.00001424592,0.00009369348,5.121985e-7,0.000002444885,0.000005163167,0.00002165188],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6178741,"threshold_uncertainty_score":0.2837238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998720940","doi":"10.1007/s10817-004-3243-2","title":"Octopus: Combining Learning and Parallel Search","year":2004,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"McGill University","keywords":"octopus (software); Automated theorem proving; Computer science; Artificial intelligence; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01679382453364086,"gpt":0.2775686066946598,"spread":0.260774782161019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001140279,0.0001271794,0.0002741186,0.0001776346,0.00023843,0.0003590849,0.0003736263,0.00008285764,0.00000333581],"category_scores_gemma":[0.0001621889,0.00009936091,0.0000758983,0.0003077684,0.00004610646,0.0005095085,0.0001317805,0.0004406802,0.0000123465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006704377,"about_ca_system_score_gemma":0.0001469275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004621613,"about_ca_topic_score_gemma":0.000001452689,"domain_scores_codex":[0.9986058,0.0001240443,0.0003990302,0.0001702369,0.0003852521,0.0003155992],"domain_scores_gemma":[0.9990886,0.00008641114,0.0003539902,0.0001239067,0.000183379,0.0001637541],"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.000100033,0.0004587529,0.06372007,0.0002790375,0.000667096,0.003302455,0.03557033,0.06353395,0.008419163,0.7131743,0.0005622136,0.1102125],"study_design_scores_gemma":[0.02003575,0.006712616,0.0559506,0.001909962,0.0001906524,0.03398344,0.008470089,0.7969128,0.00769646,0.04142899,0.02420027,0.002508354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4264464,0.002845412,0.5652433,0.0006950031,0.0008449762,0.0001549242,8.426343e-8,0.0008060578,0.002963826],"genre_scores_gemma":[0.9623268,0.0000774183,0.03738947,0.00003209442,0.00008935656,8.236074e-7,3.360146e-7,0.00001074439,0.00007297039],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7333789,"threshold_uncertainty_score":0.405182,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1510672616","doi":"10.1023/a:1006279127474","title":"A Hyperbase for Binary Lattice Hyperidentities","year":2000,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Arity; Variety (cybernetics); Identity (music); Binary relation; Combinatorics; Binary number; Discrete mathematics; Mathematics; Set (abstract data type); Computer science; Physics; Arithmetic; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01094980265880392,"gpt":0.2614841185139968,"spread":0.2505343158551929,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003086548,0.0001070985,0.0002111736,0.000110308,0.0001573518,0.0001287965,0.0004769035,0.00004700083,0.00005797963],"category_scores_gemma":[0.0001164038,0.00008507427,0.0001300087,0.0002434909,0.00002895368,0.0009648592,0.00003328784,0.0001331192,0.00002115189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000370719,"about_ca_system_score_gemma":0.00008209394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000223067,"about_ca_topic_score_gemma":2.866146e-7,"domain_scores_codex":[0.9990658,0.00004112363,0.0003284731,0.000127296,0.0002049389,0.0002323577],"domain_scores_gemma":[0.9992101,0.0001617715,0.0002190899,0.0001707214,0.0001434562,0.00009489318],"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.0009533056,0.001386465,0.002349762,0.0004558018,0.0009151368,0.004493949,0.009390119,0.09356059,0.04565134,0.14008,0.04543446,0.6553291],"study_design_scores_gemma":[0.002611165,0.001245349,0.006798324,0.0006504111,0.00008845578,0.004084278,0.0003462834,0.9359114,0.00461178,0.01045192,0.03263827,0.000562418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9499037,0.001367909,0.0457825,0.0006389109,0.0004786933,0.00009669104,0.00000178967,0.0004016152,0.001328243],"genre_scores_gemma":[0.7641917,0.0001320075,0.2344046,0.0002906385,0.0002022264,0.000003789327,7.75366e-7,0.00001456645,0.0007596867],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8423508,"threshold_uncertainty_score":0.3469228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066986855","doi":"10.1007/s10817-014-9304-2","title":"Absorption for ABoxes","year":2014,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"SPARQL; Description logic; RDF; Conjunctive query; Negation; Computer science; Logical consequence; Knowledge base; Web Ontology Language; RDF Schema; Ontology; Theoretical computer science; Graph; Class (philosophy); Semantics (computer science); Semantic Web; Relational database; Information retrieval; Programming language; Artificial intelligence; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.01098037176893957,"gpt":0.2661427066874711,"spread":0.2551623349185316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007243473,0.00006606425,0.0001655114,0.0001043654,0.00007237116,0.0001105274,0.0003902804,0.00004765409,0.000002643712],"category_scores_gemma":[0.0005127962,0.00004853909,0.00008752971,0.0001140523,0.00001529008,0.0003724233,0.00003116594,0.00007391178,0.000007463289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002117515,"about_ca_system_score_gemma":0.00004098022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003411479,"about_ca_topic_score_gemma":9.222826e-7,"domain_scores_codex":[0.9993059,0.00003957533,0.0002585993,0.00008410525,0.0001609078,0.0001508826],"domain_scores_gemma":[0.9990984,0.0002164499,0.0003213961,0.0001350426,0.0001817143,0.00004702637],"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.0001410551,0.0002701215,0.008380249,0.0001988723,0.0003556974,0.00008400471,0.004026846,0.008238626,0.05349097,0.3030943,0.03928152,0.5824378],"study_design_scores_gemma":[0.0007527416,0.0003396874,0.02535824,0.0002054025,0.00002010535,0.0003756181,0.0000662777,0.9546726,0.006730563,0.004964089,0.006383947,0.0001306705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2092107,0.0001741135,0.7878705,0.0008557107,0.0008098369,0.00004748816,1.30638e-7,0.0003074133,0.0007240813],"genre_scores_gemma":[0.8195812,0.00001304103,0.1801284,0.00009586418,0.0001438985,9.187763e-7,1.82599e-7,0.000004280578,0.00003218828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.946434,"threshold_uncertainty_score":0.1979367,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1608678069","doi":"10.1023/a:1006241826565","title":"Efficient Algorithms to Detect and Restore Minimality, an Extension of the Regular Restriction of Resolution","year":2000,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Binary tree; Mathematics; Tree (set theory); Resolution (logic); Algorithm; Completeness (order theory); Binary number; Redundancy (engineering); K-ary tree; Discrete mathematics; Computer science; Combinatorics; Tree structure; Arithmetic; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01596893507555962,"gpt":0.2606211021731402,"spread":0.2446521670975806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001244123,0.00008892,0.000219921,0.0001394837,0.0001170638,0.00004394452,0.0003406307,0.00007811744,0.000001822886],"category_scores_gemma":[0.0001428777,0.00005768944,0.00007558623,0.0005298491,0.00004982496,0.0001339198,0.00007041412,0.0001229946,6.901492e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005160955,"about_ca_system_score_gemma":0.0000694936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001246629,"about_ca_topic_score_gemma":0.000005228793,"domain_scores_codex":[0.9984931,0.0002504816,0.0004943461,0.0001617008,0.0004483011,0.0001520926],"domain_scores_gemma":[0.9987363,0.00004486994,0.0005274351,0.0003297566,0.0002720457,0.0000896262],"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.0005637521,0.0005101673,0.005254589,0.0002566999,0.0002004205,0.0001796397,0.01164204,0.1247863,0.1362304,0.01285566,0.001456559,0.7060637],"study_design_scores_gemma":[0.0008391131,0.001793515,0.2076059,0.0004666439,0.00005736866,0.000887552,0.0002439699,0.7715105,0.01428064,0.0008432201,0.00126653,0.0002050281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9618152,0.0004613088,0.03697601,0.0001180215,0.0003036908,0.0001321002,4.156738e-7,0.00006276829,0.0001304732],"genre_scores_gemma":[0.9751753,0.00002347906,0.02470164,0.00001081964,0.00005702603,7.130691e-7,1.770808e-7,0.000005742363,0.00002512587],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7058588,"threshold_uncertainty_score":0.2352507,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2943910961","doi":"10.1007/s10817-019-09524-0","title":"Automated Reasoning with Power Maps","year":2019,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Endomorphism; Mathematical proof; Mathematics; Abelian group; Automated theorem proving; Gas meter prover; Discrete mathematics; Algebra over a field; Torsion (gastropod); Pure mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01264593495004623,"gpt":0.2963992426726911,"spread":0.2837533077226448,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009194529,0.0003609774,0.0007564495,0.0003212719,0.0001355856,0.0001194359,0.0004713332,0.0002131931,0.000271262],"category_scores_gemma":[0.001034971,0.0002701244,0.0001794796,0.0005465937,0.00007266182,0.0006256503,0.00009591887,0.0007736398,0.00009446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002504749,"about_ca_system_score_gemma":0.000222866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003728014,"about_ca_topic_score_gemma":0.000001815371,"domain_scores_codex":[0.9972501,0.0001415421,0.0009234719,0.0002850232,0.000837345,0.000562508],"domain_scores_gemma":[0.9967031,0.0004979962,0.001519914,0.0005263939,0.0005367898,0.0002158073],"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.002552957,0.002025807,0.07507745,0.001596394,0.005659749,0.006904296,0.01561715,0.01221232,0.0451896,0.7401167,0.0887553,0.004292328],"study_design_scores_gemma":[0.04256415,0.01069049,0.09055231,0.05166524,0.002648639,0.05900485,0.01410938,0.3628276,0.06236868,0.2539918,0.04025243,0.009324358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9838067,0.0002478438,0.001993206,0.0001978933,0.0007124127,0.0002677965,0.000004560915,0.001953834,0.01081581],"genre_scores_gemma":[0.784048,0.00001492419,0.2149057,0.00007584723,0.0001192683,0.000002620665,0.00000278142,0.0001104348,0.0007205066],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4861248,"threshold_uncertainty_score":0.9999751,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063428900","doi":"10.1007/s10817-009-9121-1","title":"Interprocedural and Flow-Sensitive Type Analysis for Memory and Type Safety of C Code","year":2009,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Software Engineering Research","field":"Computer Science","cited_by":2,"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":"Computer science; Memory safety; Type safety; Programming language; Type inference; Alias; Static analysis; Control flow; Source code; Data type; Compiler; Parallel computing; Algorithm; Inference; Artificial intelligence; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.01034270307879688,"gpt":0.2828521794854341,"spread":0.2725094764066372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005628993,0.00008304926,0.0002900756,0.0003229903,0.00004521977,0.00005424917,0.0001721857,0.00004742623,0.000001356963],"category_scores_gemma":[0.001353701,0.00006871747,0.00005749916,0.0007176673,0.0000285517,0.0002293459,0.00005031076,0.0001332751,2.701086e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003620909,"about_ca_system_score_gemma":0.00008719764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003607018,"about_ca_topic_score_gemma":0.000001394765,"domain_scores_codex":[0.9992235,0.0000311831,0.0002777952,0.0001216344,0.0001939725,0.0001519483],"domain_scores_gemma":[0.9986751,0.0004410149,0.0001777945,0.0001142286,0.000500974,0.00009088145],"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.00509218,0.0006166128,0.1818142,0.0008493121,0.01036591,0.001040261,0.03631333,0.2853833,0.1247421,0.003702182,0.006756104,0.3433245],"study_design_scores_gemma":[0.0003691307,0.0004325032,0.1842069,0.0001662481,0.00008143485,0.0002145492,0.00006253281,0.8111194,0.003208902,0.00004207737,0.0000166653,0.00007966047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8932967,0.0005572576,0.1055966,0.0002274422,0.000134106,0.00006580834,0.000002266607,0.00009740962,0.00002242317],"genre_scores_gemma":[0.9233479,0.00005103934,0.07652856,0.00002560964,0.00002670142,1.445317e-7,6.12118e-7,0.000004874287,0.00001456309],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5257362,"threshold_uncertainty_score":0.2802217,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4231890083","doi":"10.1007/s10817-009-9141-x","title":"Preface","year":2009,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Historical Art and Culture Studies","field":"Arts and Humanities","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01286601133554113,"gpt":0.2348508460394308,"spread":0.2219848347038897,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001203595,0.00007436964,0.0001720009,0.0000477381,0.0002525036,0.00006255692,0.00008934939,0.00002052364,0.0002540537],"category_scores_gemma":[0.0000674901,0.00004731498,0.00009090732,0.00003160669,0.00003952649,0.0001884258,0.000006454775,0.0001334635,0.00003543669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003693293,"about_ca_system_score_gemma":0.0000174057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003341961,"about_ca_topic_score_gemma":0.000007646972,"domain_scores_codex":[0.9994135,0.00001750665,0.0002344573,0.00004711597,0.0001658743,0.0001215535],"domain_scores_gemma":[0.9995105,0.00001613129,0.0001903415,0.00004425988,0.0001869978,0.00005174447],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001005519,0.0003129443,0.0001471285,0.00002127741,0.0002675579,0.0001878384,0.1709723,0.0001263564,0.002535487,0.2063679,0.5977921,0.02116853],"study_design_scores_gemma":[0.0002735645,0.0003554657,0.0009216898,0.0001374855,0.0000455615,0.00006081393,0.002362941,0.0003282178,0.0001498698,0.0006775824,0.9945695,0.00011728],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2258737,0.004942782,0.00005551396,0.003844054,0.002218458,0.00008790884,0.000002455228,0.0005934381,0.7623817],"genre_scores_gemma":[0.9947172,0.00003144359,0.000396854,0.0001921616,0.0007639612,1.885533e-7,3.525986e-7,0.000004552432,0.003893243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7688436,"threshold_uncertainty_score":0.2781709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983313062","doi":"10.1007/s10817-009-9158-1","title":"Preface: Special Issue on Uncertain Reasoning","year":2009,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge; University of Guelph","funders":"","keywords":"Computer science; Cognitive science; Management science; Epistemology; Psychology; Philosophy; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.01069311198301583,"gpt":0.2717349721788356,"spread":0.2610418601958198,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001295321,0.000246722,0.0003923975,0.0003232113,0.0003057593,0.0003557335,0.0008996399,0.0001473991,0.00006087229],"category_scores_gemma":[0.0004860596,0.0002054769,0.0001579393,0.0005913647,0.00002400565,0.0006787638,0.00005282707,0.000671492,0.00006249416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001537645,"about_ca_system_score_gemma":0.0002412497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009361751,"about_ca_topic_score_gemma":5.228505e-7,"domain_scores_codex":[0.9977759,0.0001908023,0.0006138465,0.0002807344,0.0006565693,0.000482171],"domain_scores_gemma":[0.9982185,0.0002324039,0.0007471191,0.0003515502,0.0002209421,0.0002295274],"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.0004189086,0.0004952829,0.002508153,0.00006105902,0.0002850426,0.003368627,0.01125885,0.2048375,0.004081266,0.02202521,0.3295006,0.4211595],"study_design_scores_gemma":[0.002210144,0.003065896,0.0146228,0.004672665,0.00006716401,0.002227662,0.000256872,0.8949203,0.006462799,0.00177443,0.06878798,0.000931283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5828815,0.004126674,0.1775791,0.0258938,0.01268137,0.0009479289,0.00001406289,0.006182565,0.189693],"genre_scores_gemma":[0.8041727,0.00005118282,0.1883793,0.001168609,0.005458863,0.000001124883,0.000003373038,0.00002933187,0.0007355521],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6900828,"threshold_uncertainty_score":0.8379103,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4399335583","doi":"10.1007/s10817-024-09696-4","title":"Formalized Functional Analysis with Semilinear Maps","year":2024,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Mathematics; Calculus (dental); Programming language; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.01184541577253727,"gpt":0.2475701355468231,"spread":0.2357247197742858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000849547,0.000125194,0.0002902929,0.0004648035,0.0001038268,0.0004705298,0.0003129758,0.00006494668,0.00002690405],"category_scores_gemma":[0.00003935278,0.00007732301,0.0002280387,0.001576683,0.00002467498,0.0006961384,0.00004782613,0.0002293136,0.00002530926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006569507,"about_ca_system_score_gemma":0.0001918729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001732433,"about_ca_topic_score_gemma":0.000004684302,"domain_scores_codex":[0.9986498,0.00007074979,0.0003951656,0.000173435,0.0004881939,0.0002227001],"domain_scores_gemma":[0.9991406,0.00008434685,0.0002482103,0.000182406,0.0002327275,0.0001117284],"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.0004959608,0.0005828488,0.03851696,0.0007555885,0.02753286,0.00996029,0.01224425,0.1042743,0.004324982,0.6443504,0.0640009,0.09296067],"study_design_scores_gemma":[0.0005541093,0.0002953942,0.003396117,0.00008367983,0.0004455472,0.002157594,0.0001148835,0.9704077,0.0004000624,0.0007913275,0.02115037,0.0002031786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02085367,0.002001131,0.9730806,0.0002904234,0.0009173604,0.00006798519,7.724239e-7,0.000774232,0.002013796],"genre_scores_gemma":[0.9787399,0.00001954142,0.02067737,0.00004053808,0.0001994801,0.000001789773,0.000003893169,0.000009894985,0.000307656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9578862,"threshold_uncertainty_score":0.453733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970823361","doi":"10.1007/s10817-010-9212-z","title":"Preface: Special Issue of Selected Extended Papers of CADE-22","year":2010,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Presentation (obstetrics); Implementation; Automated theorem proving; Process (computing); Automated reasoning; Library science; Operations research; Information retrieval; Software engineering; Artificial intelligence; Programming language; Mathematics; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.003887711449382002,"gpt":0.2369633458947635,"spread":0.2330756344453815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005688304,0.0001642585,0.0004290166,0.0003038654,0.00003985717,0.00003442205,0.0008949636,0.0001693509,0.00007547373],"category_scores_gemma":[0.0001842491,0.0001440408,0.0001235935,0.0006530653,0.00005932789,0.000369848,0.000117316,0.0005710229,0.000001652409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004342947,"about_ca_system_score_gemma":0.0002214773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001395084,"about_ca_topic_score_gemma":0.000002311879,"domain_scores_codex":[0.9983246,0.00006026993,0.0006945648,0.0001625837,0.0005181578,0.000239841],"domain_scores_gemma":[0.9979843,0.00008409392,0.0008430776,0.0003627714,0.0006090651,0.0001166857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005794538,0.0002422279,0.001478788,0.000137226,0.0002371815,0.0001097041,0.002488094,0.004649813,0.9079145,0.01247111,0.01014269,0.06007077],"study_design_scores_gemma":[0.0011947,0.0007856799,0.05546556,0.000891466,0.00007758755,0.001056544,0.00002382948,0.3376704,0.5746896,0.0002782133,0.02735606,0.0005102908],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.390627,0.00006886974,0.606734,0.0001168821,0.0008982837,0.0001173678,0.000002909571,0.0006678852,0.0007667582],"genre_scores_gemma":[0.5441373,0.0000171387,0.4554998,0.000007404151,0.0002812737,9.934307e-7,4.918018e-7,0.00001494025,0.00004062368],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3332248,"threshold_uncertainty_score":0.5873812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1576724046","doi":"10.1023/a:1010624702918","title":"Current Trends in Logical Frameworks and Metalanguages","year":2001,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01510178341044059,"gpt":0.2995917674797182,"spread":0.2844899840692776,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007186951,0.0001628626,0.0003585604,0.0004526436,0.00007533865,0.0001958717,0.0004677816,0.0001790296,0.00003848544],"category_scores_gemma":[0.0002829182,0.0001146196,0.0001108354,0.0007955589,0.00004853224,0.0005035582,0.0001444532,0.0007902592,0.000005762428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005825992,"about_ca_system_score_gemma":0.00004417103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000708933,"about_ca_topic_score_gemma":0.000006003919,"domain_scores_codex":[0.9986178,0.0001351681,0.0004354886,0.0002099256,0.0002786283,0.0003229339],"domain_scores_gemma":[0.9990727,0.0001463191,0.0003260315,0.0001789485,0.0001057845,0.0001702346],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00005669002,0.0005066805,0.06578331,0.00002530213,0.0001131525,0.002379723,0.005767103,0.0006735855,0.0005794705,0.02171946,0.003051021,0.8993445],"study_design_scores_gemma":[0.002231126,0.0005674328,0.5456225,0.001072345,0.00006242903,0.006187804,0.0002998796,0.4320608,0.0003249453,0.003074351,0.007895595,0.000600794],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9328827,0.01989534,0.04084036,0.000717488,0.0009710373,0.00005360445,4.415831e-7,0.0003388958,0.004300202],"genre_scores_gemma":[0.9860952,0.0006530575,0.01297067,0.00005523794,0.000155592,0.000001065932,5.950407e-7,0.000007821886,0.00006075643],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8987437,"threshold_uncertainty_score":0.467405,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}