{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Gilles Dowek","is_ca":false},{"name":"Thérèse Hardin","is_ca":false},{"name":"Claude Kirchner","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002867743,0.0009009208,0.0009590453,0.002047697,0.003177996,0.005547191,0.001588191,0.0009085213,0.01406861],"category_scores_gemma":[0.006196674,0.0006905866,0.001531474,0.001929628,0.003775829,0.009779193,0.003314618,0.005222027,0.002738873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001902348,"about_ca_system_score_gemma":0.001324678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009522221,"about_ca_topic_score_gemma":0.0007720907,"domain_scores_codex":[0.9977035,0.0005764868,0.0001735116,0.0005653058,0.0007308294,0.0002503157],"domain_scores_gemma":[0.9956828,0.002536012,0.0002182329,0.0007748991,0.0005875684,0.00020041],"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.0000500182,0.00004880412,0.0002781437,0.00007530185,0.00001780327,0.00005204092,0.0002282871,0.0002879587,0.0004621776,0.9678897,0.00645932,0.02415049],"study_design_scores_gemma":[0.00003304033,0.00001268873,0.0001588567,0.00002383781,0.00002641427,0.00008469915,0.00004237291,0.001795853,0.001199359,0.981357,0.01525997,0.000006031879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.05183118,0.005924679,0.4526073,0.01063648,0.001655361,0.0001893167,0.001380802,0.002772139,0.4730026],"genre_scores_gemma":[0.7617156,0.004148649,0.1694624,0.002122541,0.002715049,0.0002125094,0.002123561,0.0006607691,0.05683904],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01406861,"threshold_uncertainty_score":0.04706419,"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","authors":[{"name":"David Toman","is_ca":true},{"name":"Grant Weddell","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01027258,0.0009674131,0.001818113,0.003052894,0.003298601,0.00820861,0.003257547,0.003200604,0.004981123],"category_scores_gemma":[0.02334762,0.001859129,0.00370818,0.004514175,0.010695,0.04105875,0.005413204,0.007218309,0.0007266949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003900351,"about_ca_system_score_gemma":0.002226041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008746305,"about_ca_topic_score_gemma":0.006840502,"domain_scores_codex":[0.9935827,0.002831305,0.0006006842,0.001051003,0.001168193,0.0007661376],"domain_scores_gemma":[0.9727172,0.02170031,0.0008277175,0.002908545,0.001098446,0.0007477644],"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.00003960033,0.00001954292,0.0002858041,0.0000363487,0.00001035245,0.00005909543,0.000418519,0.001886176,0.0001383938,0.9897682,0.0006003719,0.006737531],"study_design_scores_gemma":[0.00001024007,0.000005101693,0.00003850473,0.00001868922,0.00002168539,0.00002332744,0.00008551623,0.0073574,0.0002275221,0.9906464,0.001556272,0.000009413548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04770183,0.001347272,0.9258347,0.004478978,0.0002419498,0.0001076681,0.0005019631,0.0005174916,0.01926803],"genre_scores_gemma":[0.6966978,0.002539078,0.2850409,0.001491839,0.0005144429,0.0002621507,0.001234824,0.0005363284,0.01168283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01027258,"threshold_uncertainty_score":0.05432725,"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","authors":[{"name":"Matt Kaufmann","is_ca":true},{"name":"J Strother Moore","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002347575,0.000358863,0.0006204921,0.001287183,0.001584524,0.002900112,0.001998387,0.001085833,0.01190678],"category_scores_gemma":[0.006913607,0.0008726977,0.002266346,0.000834105,0.002695743,0.005351394,0.003780535,0.002848835,0.001628252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001361676,"about_ca_system_score_gemma":0.002133877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001245953,"about_ca_topic_score_gemma":0.002757481,"domain_scores_codex":[0.9981187,0.0005728483,0.0001523064,0.0002880694,0.0006859491,0.0001821114],"domain_scores_gemma":[0.9961796,0.001965176,0.0001353591,0.0008580432,0.0007287304,0.0001331386],"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.00004715394,0.0000732147,0.0003061653,0.00009400021,0.00002607366,0.0001344488,0.000271101,0.004609942,0.001975106,0.9601387,0.00301569,0.02930836],"study_design_scores_gemma":[0.00005202719,0.00004007243,0.0001052107,0.00004873055,0.00003459378,0.0001138819,0.00009759034,0.05880511,0.003562953,0.9257513,0.01137043,0.00001819138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01148025,0.0001016642,0.9746215,0.00104614,0.0001163828,0.0001529136,0.0002242823,0.0007935718,0.01146328],"genre_scores_gemma":[0.1810577,0.0001987828,0.8097543,0.0003872128,0.0001183162,0.0002100823,0.0006461741,0.0002675053,0.007359955],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01190678,"threshold_uncertainty_score":0.03983212,"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","authors":[{"name":"Amy Felty","is_ca":true},{"name":"Alberto Momigliano","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005430882,0.000500127,0.0004850798,0.001237046,0.001232811,0.003125735,0.001553162,0.0009996149,0.08027704],"category_scores_gemma":[0.001414691,0.0004027721,0.0007389051,0.001114478,0.0006506231,0.002972095,0.002362191,0.001197359,0.02010768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007498398,"about_ca_system_score_gemma":0.001156337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002274269,"about_ca_topic_score_gemma":0.003525857,"domain_scores_codex":[0.9992901,0.00007042875,0.00003081314,0.0002047655,0.0002928551,0.0001110258],"domain_scores_gemma":[0.9990771,0.0001321766,0.00003288381,0.0004001402,0.0002813347,0.00007636948],"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.0009547207,0.0003668538,0.002987598,0.0003167216,0.0001451972,0.0003369286,0.0004164905,0.01497158,0.02129316,0.412743,0.1109541,0.4345135],"study_design_scores_gemma":[0.0001807176,0.0002157788,0.001987564,0.0001401285,0.0001576173,0.0008827164,0.00040706,0.07531946,0.03620599,0.2071636,0.6772401,0.00009923938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04037758,0.001306441,0.4543286,0.001251129,0.001622586,0.0002773323,0.00395216,0.01469209,0.482192],"genre_scores_gemma":[0.407719,0.0008018523,0.2232528,0.001145962,0.0002387866,0.000299222,0.008268581,0.002591837,0.3556818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.08027704,"threshold_uncertainty_score":0,"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":"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","authors":[{"name":"Volker Haarslev","is_ca":true},{"name":"Ralf Möller","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02930424,0.001649957,0.004109227,0.005144163,0.002741801,0.009901686,0.005766345,0.004408797,0.01862779],"category_scores_gemma":[0.1670779,0.001690909,0.002330533,0.009116514,0.004869337,0.0436547,0.008885726,0.005499632,0.003329334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005326895,"about_ca_system_score_gemma":0.005386626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01891415,"about_ca_topic_score_gemma":0.01156668,"domain_scores_codex":[0.9620962,0.0151711,0.002741529,0.003962777,0.01320291,0.002825481],"domain_scores_gemma":[0.7526069,0.1990232,0.003372406,0.03197705,0.01082326,0.002197198],"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.004642276,0.001077565,0.0146407,0.001203543,0.0007031176,0.000699545,0.001468733,0.1221565,0.008322034,0.2111201,0.09995647,0.5340095],"study_design_scores_gemma":[0.0004290346,0.0001405197,0.001483706,0.000148075,0.0002988021,0.0002978725,0.0006127282,0.723026,0.004255418,0.2611237,0.008110849,0.0000733653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3040502,0.03043157,0.4729044,0.06149187,0.002021146,0.001027146,0.005825677,0.0174599,0.1047882],"genre_scores_gemma":[0.846294,0.004314292,0.1292655,0.003550771,0.001638441,0.0002931973,0.004391696,0.001907599,0.008344512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02930424,"threshold_uncertainty_score":0.1549774,"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","authors":[{"name":"Grzegorz Bancerek","is_ca":false},{"name":"Piotr Rudnicki","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006177136,0.001185896,0.001635625,0.003060834,0.001819697,0.007282186,0.004219651,0.001527709,0.01781217],"category_scores_gemma":[0.01149307,0.001962051,0.001714925,0.005596951,0.005383983,0.01220356,0.00352143,0.00675331,0.01093648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002013397,"about_ca_system_score_gemma":0.002308282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001248109,"about_ca_topic_score_gemma":0.002517286,"domain_scores_codex":[0.9954063,0.001252547,0.0007272982,0.0006805633,0.001725134,0.0002081995],"domain_scores_gemma":[0.992855,0.003457969,0.0002086472,0.001690596,0.001511374,0.000276367],"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.00005995283,0.00004275134,0.0001338275,0.0007030226,0.00003227554,0.0001091949,0.0004206308,0.003540808,0.0009669923,0.6695907,0.07021901,0.2541809],"study_design_scores_gemma":[0.00001983584,0.00004445486,0.0001468463,0.0001941795,0.00003379594,0.0002894808,0.00007213465,0.008307036,0.001148524,0.3748091,0.6148694,0.00006532466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001899504,0.02432115,0.9155048,0.00514775,0.00506813,0.0001245386,0.001007957,0.002997286,0.04392894],"genre_scores_gemma":[0.03468683,0.02157741,0.8977556,0.002344901,0.008161903,0.0002601872,0.001892966,0.002928782,0.03039142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01781217,"threshold_uncertainty_score":0.0595876,"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","authors":[{"name":"Amy Felty","is_ca":true},{"name":"Alberto Momigliano","is_ca":false},{"name":"Brigitte Pientka","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00784856,0.0009493922,0.001683896,0.002247369,0.00515234,0.01155629,0.003632828,0.007179047,0.02649532],"category_scores_gemma":[0.03408926,0.001502545,0.00339568,0.003306815,0.008071473,0.0416242,0.006595603,0.01193853,0.004666279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003296579,"about_ca_system_score_gemma":0.00305816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004794828,"about_ca_topic_score_gemma":0.005304866,"domain_scores_codex":[0.9942864,0.002207373,0.0004572796,0.00114081,0.001394083,0.0005140881],"domain_scores_gemma":[0.977964,0.01466407,0.0007266674,0.003220926,0.002330223,0.001094067],"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.0001900447,0.0001007618,0.001254839,0.0002578905,0.000042752,0.0002149005,0.0007782043,0.003190117,0.000422534,0.891574,0.04071327,0.06126059],"study_design_scores_gemma":[0.00001799022,0.000008736492,0.0001566147,0.00007546401,0.00001461571,0.0001263889,0.0003421156,0.007275029,0.0002785893,0.9689357,0.02274656,0.00002230816],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09366484,0.0105781,0.6796348,0.102913,0.002905053,0.0002984081,0.003128103,0.002856362,0.1040214],"genre_scores_gemma":[0.4570725,0.006405939,0.4663572,0.00817317,0.004056138,0.0004936807,0.007009943,0.002239445,0.04819203],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02649532,"threshold_uncertainty_score":0.08863562,"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","authors":[{"name":"Osman Hasan","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01384773,0.001365041,0.001223061,0.001992516,0.001638423,0.0034007,0.00269928,0.001562234,0.005613905],"category_scores_gemma":[0.03592997,0.0007585544,0.001639084,0.0008486062,0.00522591,0.007003527,0.002746795,0.002501854,0.000709011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002939353,"about_ca_system_score_gemma":0.004517208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005241044,"about_ca_topic_score_gemma":0.003164804,"domain_scores_codex":[0.9902154,0.003507143,0.0004893341,0.0009419783,0.002956106,0.001890037],"domain_scores_gemma":[0.9592413,0.02741904,0.002123648,0.006165628,0.004401466,0.0006490175],"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.002154496,0.0004011492,0.007888685,0.0005230907,0.0001793414,0.0007171217,0.001132082,0.3531733,0.02851489,0.5640054,0.002360494,0.03894999],"study_design_scores_gemma":[0.00008693556,0.0002054979,0.0007236692,0.00004099677,0.000119867,0.00007666667,0.0001257558,0.834015,0.02378892,0.1399722,0.0007979021,0.00004671052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1802609,0.0001806423,0.8070832,0.0008304345,0.00008379348,0.000200458,0.0002241733,0.00303088,0.008105529],"genre_scores_gemma":[0.9700523,0.00007717404,0.02707719,0.00008124087,0.0000360367,0.0001143944,0.0001362635,0.0003051987,0.002120172],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01384773,"threshold_uncertainty_score":0.07323462,"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","authors":[{"name":"Geoff Sutcliffe","is_ca":false},{"name":"Christian Suttner","is_ca":false},{"name":"Francis Jeffry Pelletier","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009125909,0.001155942,0.001863453,0.001276894,0.002784429,0.00674345,0.003986687,0.004154803,0.1130678],"category_scores_gemma":[0.01429481,0.0009338612,0.001577828,0.002713311,0.001399163,0.007627521,0.00403956,0.004855742,0.05805137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001558034,"about_ca_system_score_gemma":0.005591714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005810298,"about_ca_topic_score_gemma":0.00867296,"domain_scores_codex":[0.996164,0.001230739,0.0001574401,0.0004609563,0.001366653,0.0006202697],"domain_scores_gemma":[0.9899058,0.002565558,0.0001642144,0.00212171,0.002707161,0.002535471],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005568238,0.0002100526,0.0002423296,0.0001815676,0.00003205981,0.0001646246,0.00004711417,0.002233324,0.0008530436,0.05475669,0.8593138,0.08140858],"study_design_scores_gemma":[0.0003983977,0.0001970425,0.0008182336,0.0001114103,0.00004069612,0.0003186524,0.00011687,0.01937017,0.002091284,0.1010295,0.8754523,0.00005545386],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0228841,0.00761249,0.1760713,0.06677393,0.04226452,0.0005538714,0.01546927,0.02588096,0.6424896],"genre_scores_gemma":[0.1968119,0.007987626,0.1441112,0.01658168,0.007770865,0.000791128,0.07203962,0.02598049,0.5279255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1130678,"threshold_uncertainty_score":0.3782495,"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","authors":[{"name":"Yi-Dong Shen","is_ca":false},{"name":"Li-Yan Yuan","is_ca":true},{"name":"Jia-Huai You","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007291527,0.0009459574,0.001721008,0.002941028,0.00283677,0.006643513,0.003368,0.003144903,0.01735669],"category_scores_gemma":[0.01649281,0.001149809,0.004400219,0.003032424,0.004439327,0.02081712,0.007202764,0.008047134,0.003614385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002299564,"about_ca_system_score_gemma":0.002716139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002084097,"about_ca_topic_score_gemma":0.002883574,"domain_scores_codex":[0.9934148,0.002377634,0.0007289262,0.001089257,0.001824007,0.0005654956],"domain_scores_gemma":[0.9916655,0.004604621,0.0003098619,0.001687411,0.001414189,0.0003183757],"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.00006380359,0.00004163392,0.0001369542,0.000144439,0.00005598787,0.0001109529,0.0002283683,0.002794242,0.000566291,0.961248,0.005212476,0.02939677],"study_design_scores_gemma":[0.00001840533,0.000007642818,0.00002796611,0.00002485719,0.00003144572,0.00006634521,0.00004846671,0.01071491,0.0008735447,0.9820957,0.006076393,0.00001431018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006694,0.001265589,0.9550756,0.003521285,0.0005648657,0.0001001411,0.0003775346,0.001282783,0.03111818],"genre_scores_gemma":[0.3145613,0.001800003,0.6508754,0.001951953,0.001143466,0.0003018765,0.001767133,0.0009504058,0.02664848],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01735669,"threshold_uncertainty_score":0.05806392,"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","authors":[{"name":"Osman Hasan","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03635799,0.001702035,0.002743433,0.00262399,0.001820383,0.006107606,0.004169557,0.002581469,0.003249364],"category_scores_gemma":[0.1828321,0.001800387,0.005808221,0.001587233,0.009355793,0.01247823,0.006023658,0.007323007,0.0006703809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003200428,"about_ca_system_score_gemma":0.004814148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00300983,"about_ca_topic_score_gemma":0.002047406,"domain_scores_codex":[0.9589295,0.01814947,0.003069891,0.006222995,0.01078328,0.0028449],"domain_scores_gemma":[0.686739,0.2782314,0.007541568,0.01805362,0.008185638,0.001248724],"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.0004231542,0.0002213927,0.004755506,0.000383595,0.0005057122,0.0006046767,0.0006204181,0.1023038,0.004956016,0.8473018,0.001435717,0.03648818],"study_design_scores_gemma":[0.0001065784,0.00007168748,0.0003495206,0.00003921521,0.0000836611,0.0001295581,0.00003769596,0.396491,0.007107732,0.594896,0.0006415531,0.00004588204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008924612,0.0000585513,0.9894429,0.0002969431,0.00004243107,0.00003575679,0.00005249801,0.0004592391,0.0006869705],"genre_scores_gemma":[0.6046774,0.0002196684,0.3924116,0.0005429949,0.0002116582,0.0002421951,0.0002565112,0.0004413322,0.0009966354],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03635799,"threshold_uncertainty_score":0.1922817,"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","authors":[{"name":"Mohamed Yousri Mahmoud","is_ca":true},{"name":"Amy Felty","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003058955,0.0007130665,0.001581129,0.003268383,0.002670882,0.006481379,0.002938765,0.001935494,0.009217666],"category_scores_gemma":[0.003946112,0.001053427,0.002273015,0.001815042,0.006118967,0.007870743,0.004218121,0.00542132,0.001182966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003859625,"about_ca_system_score_gemma":0.003143054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003112915,"about_ca_topic_score_gemma":0.003655384,"domain_scores_codex":[0.9976001,0.0007545487,0.0001973051,0.0004136443,0.0006606441,0.0003737122],"domain_scores_gemma":[0.9976458,0.001036712,0.0001714203,0.0003863871,0.0005028895,0.0002568396],"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.000006497329,0.00001473914,0.00005254605,0.00001349108,0.000005137497,0.00003751366,0.0001209209,0.0003468324,0.000271885,0.997929,0.0003103428,0.0008912137],"study_design_scores_gemma":[0.00001798896,0.00001414946,0.00009006276,0.00002479628,0.00001478811,0.00006806676,0.00008050601,0.01090189,0.0005219128,0.9848502,0.003394843,0.00002069299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05913185,0.0008978421,0.8628253,0.004423839,0.0005006306,0.0002114693,0.000605558,0.001276324,0.07012734],"genre_scores_gemma":[0.777538,0.0005811797,0.203273,0.001621539,0.0007333258,0.0003845215,0.000474493,0.0005562918,0.01483762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009217666,"threshold_uncertainty_score":0.03083622,"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","authors":[{"name":"Perry R. James","is_ca":true},{"name":"Patrice Chalin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004984149,0.001919492,0.002747698,0.002323135,0.001464937,0.004440858,0.004882254,0.001923472,0.01513052],"category_scores_gemma":[0.01821765,0.001989817,0.005538998,0.001950497,0.001748825,0.0114474,0.00670213,0.003650032,0.002672049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002109115,"about_ca_system_score_gemma":0.005085344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009683816,"about_ca_topic_score_gemma":0.02083311,"domain_scores_codex":[0.991168,0.00203646,0.0007782129,0.001728178,0.003159295,0.001129932],"domain_scores_gemma":[0.9778709,0.009162479,0.001055068,0.009249319,0.002252784,0.0004094807],"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.003452543,0.001399736,0.0129971,0.001724957,0.001109289,0.00116815,0.001338711,0.1281504,0.1022769,0.1149805,0.03171536,0.5996864],"study_design_scores_gemma":[0.0005866071,0.00028749,0.00213045,0.0001658015,0.0005774135,0.0004078574,0.0003008026,0.7449849,0.06068842,0.1703895,0.01923356,0.0002471302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05829823,0.000395574,0.8917745,0.000575094,0.0003450633,0.0001877936,0.0008159563,0.0438646,0.00374327],"genre_scores_gemma":[0.4164252,0.0001932848,0.5618755,0.0008698891,0.0001834163,0.0001925693,0.002825481,0.01028671,0.007147891],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01513052,"threshold_uncertainty_score":0.05061662,"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)","authors":[{"name":"Sandip Ray","is_ca":false},{"name":"Rob Sumners","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007629293,0.0008808261,0.0009448009,0.001282793,0.0009670067,0.001641733,0.001854762,0.000898517,0.001995073],"category_scores_gemma":[0.02606417,0.001348387,0.002701608,0.0009332399,0.004009895,0.003007933,0.002876153,0.002101681,0.0004878425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001075551,"about_ca_system_score_gemma":0.002247432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008505397,"about_ca_topic_score_gemma":0.007432966,"domain_scores_codex":[0.9907777,0.003282092,0.0008410012,0.001041693,0.00329005,0.0007674034],"domain_scores_gemma":[0.9737548,0.01741157,0.001429412,0.004988182,0.00218382,0.0002322816],"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.001100274,0.0002929828,0.005616162,0.0008768357,0.0002257364,0.001454275,0.002926035,0.2532308,0.05339513,0.5412164,0.001542593,0.1381227],"study_design_scores_gemma":[0.0003799815,0.0002306138,0.0006590792,0.0001445646,0.0002563574,0.0003035842,0.000248239,0.5923929,0.0580374,0.3392314,0.008024593,0.00009120608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03344901,0.00008068938,0.9631642,0.0001023302,0.00002636747,0.0001459614,0.00006761173,0.00106933,0.001894615],"genre_scores_gemma":[0.5208862,0.0002444751,0.4758769,0.00006828074,0.00003693171,0.000257278,0.0002483416,0.0003772754,0.002004228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008505397,"threshold_uncertainty_score":0.04034805,"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","authors":[{"name":"Gilles Barthe","is_ca":false},{"name":"Pierre Courtieu","is_ca":false},{"name":"Guillaume Dufay","is_ca":true},{"name":"Simão Melo de Sousa","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007989064,0.001084679,0.001206354,0.00167252,0.001300338,0.005269136,0.003649155,0.00247447,0.004312931],"category_scores_gemma":[0.02969324,0.001413701,0.002613776,0.001018779,0.002879531,0.00488983,0.003830514,0.003635425,0.001441656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001483263,"about_ca_system_score_gemma":0.004157762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003543686,"about_ca_topic_score_gemma":0.004878007,"domain_scores_codex":[0.9887403,0.004437736,0.001247806,0.0009183924,0.003552165,0.001103528],"domain_scores_gemma":[0.9570385,0.02401328,0.002101204,0.01055062,0.00575955,0.0005369863],"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.002409037,0.0008618244,0.0102789,0.001301874,0.0004890749,0.00290093,0.002888187,0.2479312,0.1274029,0.3905784,0.007459798,0.2054978],"study_design_scores_gemma":[0.0002587497,0.000168842,0.0004647131,0.0001032458,0.0001563376,0.000298882,0.0001810716,0.788745,0.1100155,0.09233746,0.007158256,0.0001119396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03918826,0.0000501766,0.9497344,0.0001331392,0.00006136028,0.0001174908,0.0002070337,0.009181445,0.001326561],"genre_scores_gemma":[0.6072633,0.0001022635,0.3885146,0.00009594999,0.00002493047,0.0002090861,0.0005830875,0.001164205,0.002042623],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007989064,"threshold_uncertainty_score":0.04225069,"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","authors":[{"name":"Monty Newborn","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003930453,0.001614384,0.003738769,0.005882034,0.001534234,0.003548742,0.004494037,0.002383548,0.01172538],"category_scores_gemma":[0.0170939,0.00115274,0.001547455,0.008376979,0.001190521,0.009752015,0.004761525,0.001885261,0.003366065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001598033,"about_ca_system_score_gemma":0.003839021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01562085,"about_ca_topic_score_gemma":0.02521409,"domain_scores_codex":[0.9974367,0.0008408053,0.0002597334,0.0005384947,0.0006679458,0.0002563412],"domain_scores_gemma":[0.9911493,0.00543975,0.0002625641,0.001811007,0.0009218191,0.0004156122],"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.002325302,0.00112359,0.004479703,0.0005535534,0.0005490209,0.0001868481,0.000155079,0.1568095,0.001863044,0.0178279,0.05427439,0.7598521],"study_design_scores_gemma":[0.0004998883,0.0001759968,0.0005078271,0.00003776416,0.0001438343,0.00008045689,0.00008988447,0.9419041,0.001454577,0.04970646,0.00536323,0.00003602217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1028191,0.004625767,0.8061737,0.002047336,0.001159269,0.0006668385,0.003660897,0.05959272,0.01925428],"genre_scores_gemma":[0.3729892,0.00142572,0.605163,0.0008274571,0.0005570141,0.0005177504,0.007254002,0.002921867,0.00834398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01562085,"threshold_uncertainty_score":0.03922528,"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","authors":[{"name":"R. Padmanabhan","is_ca":true},{"name":"Patrick Penner","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003749595,0.0007670219,0.00190475,0.004704102,0.003718303,0.009881604,0.004256458,0.002486511,0.01384899],"category_scores_gemma":[0.0134253,0.002204669,0.001579635,0.005860677,0.002520291,0.02152056,0.009724163,0.004403153,0.005232573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001784983,"about_ca_system_score_gemma":0.003270152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004417218,"about_ca_topic_score_gemma":0.005654576,"domain_scores_codex":[0.9959701,0.0007394721,0.000674358,0.0007929357,0.001529488,0.0002936262],"domain_scores_gemma":[0.9937808,0.00154161,0.0003298451,0.002124665,0.001647762,0.0005753182],"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.0002614647,0.0002324415,0.001230619,0.000553673,0.00008431973,0.00054661,0.001446255,0.00469818,0.003701771,0.7409057,0.02745662,0.2188822],"study_design_scores_gemma":[0.0001278345,0.0000586784,0.0003953411,0.0003865866,0.0002053111,0.000710776,0.0009301456,0.03495482,0.007691296,0.7834222,0.1709867,0.0001302172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01756254,0.001662504,0.9527574,0.001537117,0.0006334508,0.0003943574,0.002738724,0.006776665,0.01593722],"genre_scores_gemma":[0.1300062,0.00171705,0.8451891,0.0007816459,0.0003767734,0.0003521045,0.005534027,0.001138518,0.01490459],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01384899,"threshold_uncertainty_score":0.0463295,"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","authors":[{"name":"Jiewen Wu","is_ca":true},{"name":"Alexander K. Hudek","is_ca":true},{"name":"David Toman","is_ca":true},{"name":"Grant Weddell","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003579282,0.0009362386,0.001004086,0.003283788,0.002493669,0.004322623,0.001804225,0.001931813,0.01453292],"category_scores_gemma":[0.01202406,0.001715638,0.002772306,0.002544485,0.002751907,0.0160652,0.005460787,0.006042333,0.002915214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001566881,"about_ca_system_score_gemma":0.001142823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001859773,"about_ca_topic_score_gemma":0.001939644,"domain_scores_codex":[0.9960814,0.001261845,0.0004314751,0.0008053518,0.0009055202,0.0005144277],"domain_scores_gemma":[0.9873173,0.007989402,0.0004474595,0.002450024,0.001528893,0.000266975],"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.00007381824,0.00006952328,0.0005892388,0.0001493605,0.00004026478,0.0002627169,0.0007792838,0.0008284361,0.002109686,0.9581532,0.003602166,0.03334237],"study_design_scores_gemma":[0.00001734914,0.00001940202,0.0001816342,0.00006278833,0.00005720973,0.0003840775,0.0002323413,0.00695747,0.003286564,0.973488,0.01528931,0.00002385377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04728816,0.001015102,0.8907417,0.002854809,0.0003354309,0.0001384829,0.0005427173,0.002997492,0.05408618],"genre_scores_gemma":[0.5552073,0.0009194884,0.4031353,0.001223735,0.0004785156,0.000215896,0.001678802,0.001536899,0.03560406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01453292,"threshold_uncertainty_score":0.04861748,"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","authors":[{"name":"Bruce Spencer","is_ca":true},{"name":"Joseph D. Horton","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006734012,0.001239359,0.002113327,0.00272951,0.001511316,0.003167121,0.00542088,0.002052597,0.004109008],"category_scores_gemma":[0.02278696,0.00124476,0.002000976,0.001955247,0.003605816,0.006762842,0.006386683,0.003505337,0.00145222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009660908,"about_ca_system_score_gemma":0.002116723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001983669,"about_ca_topic_score_gemma":0.00253204,"domain_scores_codex":[0.9942963,0.001526966,0.0004293676,0.001501898,0.001624738,0.0006208457],"domain_scores_gemma":[0.981941,0.00885844,0.001224982,0.005931763,0.00166807,0.0003757509],"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.0008759288,0.0004925005,0.002733762,0.000587809,0.000196897,0.0002576292,0.0008325181,0.05183705,0.01679175,0.2108137,0.01352078,0.7010597],"study_design_scores_gemma":[0.0002154961,0.0001798054,0.000647672,0.00008177028,0.0001591367,0.0005491465,0.0003145678,0.5291929,0.02739227,0.4303547,0.01079487,0.0001177975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01405165,0.0001988817,0.9810849,0.0002622046,0.0000615712,0.0001296504,0.00007855035,0.002249849,0.001882641],"genre_scores_gemma":[0.187248,0.0002336819,0.8081149,0.0002518613,0.00008793017,0.0001566547,0.0004599617,0.0006351806,0.002811866],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006734012,"threshold_uncertainty_score":0.0356133,"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","authors":[{"name":"G. I. Moghaddam","is_ca":true},{"name":"R. Padmanabhan","is_ca":true},{"name":"Yang Zhang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004336564,0.0008043273,0.0008916173,0.002712086,0.001851231,0.00501898,0.001688829,0.001219679,0.01066172],"category_scores_gemma":[0.02178977,0.0009601846,0.002750256,0.002403511,0.004481621,0.02006589,0.005995025,0.003284452,0.001388775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00132446,"about_ca_system_score_gemma":0.001080691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002100678,"about_ca_topic_score_gemma":0.001616395,"domain_scores_codex":[0.9942027,0.002812926,0.000350648,0.0007208184,0.001529135,0.0003837946],"domain_scores_gemma":[0.9859139,0.01034469,0.000320328,0.002057955,0.001109591,0.0002536211],"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.00008229674,0.00004298436,0.0006360513,0.0001278488,0.00007043733,0.000204563,0.0005206419,0.005950924,0.0004968912,0.9605651,0.003253807,0.02804865],"study_design_scores_gemma":[0.00001191141,0.000005707054,0.00006704986,0.00001491524,0.00002659465,0.00005628622,0.00006916388,0.01400253,0.000620004,0.9811383,0.003979926,0.00000751416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04890647,0.001123797,0.8896553,0.004564427,0.0002973154,0.0001200199,0.0004655409,0.001511938,0.05335524],"genre_scores_gemma":[0.7727532,0.001094395,0.2106868,0.0006566459,0.0004508278,0.0001090224,0.0008612962,0.0003618943,0.01302603],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01066172,"threshold_uncertainty_score":0.035667,"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","authors":[{"name":"Syrine Tlili","is_ca":true},{"name":"Mourad Debbabi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003739049,0.0008649358,0.0008512058,0.004137876,0.001191668,0.00200559,0.002255664,0.001252716,0.002248979],"category_scores_gemma":[0.01527438,0.0007952296,0.002692031,0.001405066,0.002702364,0.003171362,0.002123769,0.001927978,0.0003654647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001348821,"about_ca_system_score_gemma":0.003289688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00525548,"about_ca_topic_score_gemma":0.004483838,"domain_scores_codex":[0.9957036,0.0007673799,0.0003279946,0.0005344091,0.001877202,0.0007894595],"domain_scores_gemma":[0.985947,0.006320867,0.001606246,0.003611863,0.002188858,0.0003252391],"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.002979265,0.0005825654,0.04209053,0.0006138605,0.0005968431,0.001315466,0.0012347,0.1801791,0.06298578,0.2259182,0.00605644,0.4754473],"study_design_scores_gemma":[0.00008523265,0.0002525216,0.004748845,0.00008111554,0.0003502292,0.0004266231,0.0001606946,0.7006409,0.07930924,0.2114078,0.002420048,0.0001166963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1468126,0.0003623038,0.8451148,0.0003344124,0.00009721349,0.0001159225,0.0002776585,0.003751569,0.003133456],"genre_scores_gemma":[0.8446572,0.0001339618,0.1523354,0.0002204024,0.00009803203,0.00005965027,0.0002724507,0.000310464,0.001912277],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00525548,"threshold_uncertainty_score":0.0197742,"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","authors":[{"name":"Jacques Carette","is_ca":true},{"name":"Makarius Wenzel","is_ca":false},{"name":"Freek Wiedijk","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001440153,0.0007877834,0.000596176,0.003271429,0.002854606,0.003566274,0.001215528,0.0009130655,0.5304703],"category_scores_gemma":[0.01205504,0.000272261,0.0005496549,0.002410519,0.0006139553,0.002677181,0.002074433,0.002428423,0.3270913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002063984,"about_ca_system_score_gemma":0.002426184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006389434,"about_ca_topic_score_gemma":0.008074047,"domain_scores_codex":[0.9992962,0.0001122533,0.00004449022,0.0001267676,0.0003615893,0.00005881397],"domain_scores_gemma":[0.9945799,0.0009028653,0.0001673914,0.0005640102,0.003166843,0.0006189661],"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.0000263548,0.00001918874,0.0000913925,0.00006880546,0.000001568666,0.00002639698,0.00006002883,0.00005072667,0.0001026296,0.006119709,0.9526276,0.04080549],"study_design_scores_gemma":[0.000004639489,0.000008637777,0.0002495709,0.0000828341,0.000001865499,0.00002403865,0.00007457334,0.00003777946,0.00009766881,0.004186845,0.9952273,0.000004105056],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001379007,0.005746298,0.01164481,0.02845366,0.1485405,0.0006370245,0.01815421,0.002017461,0.783427],"genre_scores_gemma":[0.005572643,0.002543985,0.003592829,0.004577684,0.01502358,0.000288383,0.009916472,0.000917237,0.9575672],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.4695297,"threshold_uncertainty_score":0,"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","authors":[{"name":"Yang Xiang","is_ca":true},{"name":"Kevin Grant","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003017832,0.002028196,0.002067201,0.004982981,0.002352275,0.006702648,0.002094502,0.00342816,0.09559934],"category_scores_gemma":[0.0128351,0.0007117732,0.001597801,0.004276474,0.001303951,0.006881617,0.002327072,0.006955803,0.04337209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002523137,"about_ca_system_score_gemma":0.002083858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002016178,"about_ca_topic_score_gemma":0.002756127,"domain_scores_codex":[0.9983657,0.0002998948,0.0001880183,0.0003055852,0.0007280368,0.0001127595],"domain_scores_gemma":[0.9892397,0.003819507,0.0004206728,0.000757629,0.004658252,0.001104293],"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.00002231303,0.00001810853,0.00004300699,0.0002132157,0.00000919182,0.00003369807,0.00001918683,0.0001425349,0.0000851818,0.002921656,0.9700979,0.02639404],"study_design_scores_gemma":[0.00001210405,0.00003271673,0.0004258974,0.0003330382,0.00001801658,0.0001063139,0.0000373578,0.0004662605,0.0001172719,0.01071007,0.9877235,0.00001752273],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0002828455,0.04031841,0.006357942,0.03905714,0.8732931,0.00009833793,0.0007855946,0.0002106356,0.03959604],"genre_scores_gemma":[0.004236983,0.02911483,0.002651862,0.008485481,0.8218182,0.0001117749,0.001644412,0.0004413142,0.1314951],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.09559934,"threshold_uncertainty_score":0.3198116,"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","authors":[{"name":"Frédéric Dupuis","is_ca":true},{"name":"Robert Y. Lewis","is_ca":false},{"name":"Heather Macbeth","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003490086,0.0006968557,0.0005978335,0.002148092,0.0008684592,0.002966437,0.0009967939,0.0007783118,0.005340912],"category_scores_gemma":[0.005653488,0.0005313177,0.001760751,0.001282607,0.003465449,0.006826018,0.002134982,0.002826427,0.0006532553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001855334,"about_ca_system_score_gemma":0.0008690424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001394435,"about_ca_topic_score_gemma":0.001035413,"domain_scores_codex":[0.9981365,0.0008051146,0.0001759529,0.0002899927,0.0004225988,0.0001696932],"domain_scores_gemma":[0.9959584,0.002579573,0.0002271485,0.0004636526,0.0006274039,0.0001439167],"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.00003180742,0.00002426866,0.0002490559,0.00004223285,0.00001378707,0.00006012592,0.0002367256,0.002672243,0.0009261051,0.9858429,0.0005595546,0.009341118],"study_design_scores_gemma":[0.00001240748,0.00001504275,0.0001067902,0.00001967024,0.00001437327,0.00005216189,0.00005266273,0.02083879,0.0008480523,0.9751505,0.002878696,0.00001087363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02466672,0.0004567151,0.9588374,0.0009804411,0.0001529654,0.00003367938,0.0002263275,0.0003318503,0.01431384],"genre_scores_gemma":[0.7038007,0.0007590308,0.2801298,0.0005182588,0.0004337522,0.0001890872,0.0004233764,0.0002514004,0.01349452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005340912,"threshold_uncertainty_score":0.01845759,"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","authors":[{"name":"Renate A. Schmidt","is_ca":false},{"name":"Brigitte Pientka","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003125213,0.002108322,0.002257416,0.008007614,0.001763989,0.007438332,0.002207072,0.002135335,0.1913296],"category_scores_gemma":[0.01201608,0.0006634109,0.001281486,0.005143728,0.000572474,0.003025449,0.002180903,0.002741429,0.08621684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002080235,"about_ca_system_score_gemma":0.002379109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002739441,"about_ca_topic_score_gemma":0.004891838,"domain_scores_codex":[0.9977419,0.0002968172,0.0002324084,0.0003197844,0.001230256,0.0001788389],"domain_scores_gemma":[0.9858274,0.002127562,0.0005560225,0.001049774,0.008643312,0.001795857],"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.00005677427,0.00002582797,0.0000705823,0.000174728,0.00001011466,0.00003060322,0.000008381379,0.000154321,0.0002205974,0.0004932274,0.9714792,0.02727582],"study_design_scores_gemma":[0.00003228758,0.00005766366,0.0007685464,0.0002075651,0.00002337137,0.00008132748,0.00002736602,0.0005976174,0.0003450988,0.001259873,0.9965803,0.0000191385],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.001235154,0.03180126,0.009847798,0.02665836,0.8561509,0.0003448544,0.003847384,0.001266471,0.06884792],"genre_scores_gemma":[0.01112314,0.0273105,0.00710107,0.008864783,0.3584369,0.0004312183,0.01306719,0.002661713,0.5710036],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.1913296,"threshold_uncertainty_score":0.6400614,"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","authors":[{"name":"David Basin","is_ca":false},{"name":"Amy Felty","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01439792,0.0007213053,0.001514988,0.005495085,0.001422523,0.01331547,0.005647674,0.004227725,0.01644508],"category_scores_gemma":[0.0205578,0.00107531,0.001128462,0.008113937,0.01141732,0.0358376,0.003723242,0.004889223,0.003876713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003421333,"about_ca_system_score_gemma":0.005300157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002058414,"about_ca_topic_score_gemma":0.002175674,"domain_scores_codex":[0.9940205,0.00197899,0.0006256489,0.001260677,0.001568678,0.0005455076],"domain_scores_gemma":[0.9602022,0.02885844,0.002000862,0.00231016,0.004798582,0.001829684],"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.0002313261,0.0001689119,0.001518283,0.002172745,0.00003689598,0.00007773872,0.0009326454,0.001113478,0.001125957,0.5906273,0.01713797,0.3848567],"study_design_scores_gemma":[0.00006568553,0.0001070418,0.0008158229,0.001547383,0.00005638575,0.0005826221,0.001666556,0.004167551,0.0009363567,0.4618733,0.5281164,0.00006491198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.01539536,0.7716403,0.08656432,0.07235564,0.00192387,0.00005923891,0.0002736383,0.001120887,0.0506668],"genre_scores_gemma":[0.1442973,0.6800774,0.1403418,0.01454489,0.009088909,0.000240084,0.001022129,0.0005064586,0.009881182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01644508,"threshold_uncertainty_score":0.0761444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}