{"meta":{"query_hash":"45fc18fbc93e","filters":{"venue":"Journal of Automated Reasoning"},"cohort_total":27,"direct_labels_cover":0,"predictions_cover":27,"exported":27,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/45fc18fbc93e","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011645318810620517,"score_gpt":0.24429414951481207,"score_spread":0.23264883070419157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505627668","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051831182,0.005924679,0.45260733,0.010636477,0.001655361,0.00018931672,0.0013808021,0.0027721394,0.47300264],"genre_scores_gemma":[0.7617156,0.004148649,0.16946237,0.0021225407,0.0027150493,0.00021250936,0.0021235612,0.0006607691,0.056839038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977035,0.0005764868,0.00017351155,0.0005653058,0.0007308294,0.00025031573],"domain_scores_gemma":[0.99568284,0.0025360116,0.0002182329,0.00077489915,0.00058756844,0.00020041004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028677434,0.00090092083,0.0009590453,0.002047697,0.0031779956,0.0055471915,0.0015881909,0.0009085213,0.014068614],"category_scores_gemma":[0.006196674,0.0006905866,0.0015314741,0.001929628,0.0037758294,0.0097791925,0.0033146178,0.005222027,0.0027388728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050018203,0.000048804115,0.00027814368,0.000075301854,0.000017803271,0.000052040916,0.00022828713,0.0002879587,0.00046217762,0.96788967,0.00645932,0.024150485],"study_design_scores_gemma":[0.000033040327,0.000012688726,0.00015885665,0.000023837805,0.000026414269,0.000084699146,0.000042372907,0.0017958527,0.001199359,0.981357,0.015259973,0.0000060318794],"about_ca_topic_score_codex":0.0009522221,"about_ca_topic_score_gemma":0.00077209075,"teacher_disagreement_score":0.014068614,"about_ca_system_score_codex":0.0019023481,"about_ca_system_score_gemma":0.001324678,"threshold_uncertainty_score":0.047064185},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01094980265880392,"score_gpt":0.26148411851399683,"score_spread":0.2505343158551929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510672616","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017562538,0.0016625044,0.9527574,0.0015371166,0.0006334508,0.00039435743,0.002738724,0.006776665,0.015937218],"genre_scores_gemma":[0.13000624,0.0017170499,0.8451891,0.0007816459,0.00037677345,0.0003521045,0.0055340272,0.0011385175,0.014904592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597013,0.0007394721,0.000674358,0.0007929357,0.0015294881,0.00029362625],"domain_scores_gemma":[0.9937808,0.0015416105,0.0003298451,0.0021246648,0.0016477625,0.0005753182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037495955,0.0007670219,0.0019047499,0.004704102,0.003718303,0.009881604,0.004256458,0.002486511,0.013848995],"category_scores_gemma":[0.013425299,0.0022046694,0.0015796346,0.0058606775,0.0025202911,0.021520564,0.0097241625,0.0044031534,0.005232573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026146468,0.00023244151,0.0012306193,0.000553673,0.00008431973,0.00054661,0.0014462549,0.00469818,0.0037017714,0.7409057,0.027456615,0.21888225],"study_design_scores_gemma":[0.00012783447,0.0000586784,0.00039534108,0.00038658665,0.00020531111,0.00071077596,0.0009301456,0.034954816,0.0076912963,0.78342223,0.17098671,0.00013021725],"about_ca_topic_score_codex":0.0044172183,"about_ca_topic_score_gemma":0.005654576,"teacher_disagreement_score":0.013848995,"about_ca_system_score_codex":0.0017849826,"about_ca_system_score_gemma":0.0032701525,"threshold_uncertainty_score":0.0463295},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05308342773294895,"score_gpt":0.29909218086303746,"score_spread":0.24600875313008852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551936078","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09366484,0.010578104,0.6796348,0.10291296,0.0029050529,0.0002984081,0.0031281032,0.002856362,0.10402136],"genre_scores_gemma":[0.45707247,0.006405939,0.46635723,0.00817317,0.0040561385,0.00049368065,0.007009943,0.0022394455,0.048192028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99428636,0.0022073733,0.0004572796,0.0011408101,0.0013940834,0.00051408814],"domain_scores_gemma":[0.97796404,0.0146640735,0.0007266674,0.0032209256,0.002330223,0.0010940675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00784856,0.00094939215,0.0016838962,0.0022473694,0.0051523396,0.011556292,0.0036328284,0.0071790465,0.026495323],"category_scores_gemma":[0.03408926,0.0015025453,0.0033956796,0.0033068154,0.008071473,0.0416242,0.0065956027,0.011938532,0.0046662786],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019004467,0.00010076183,0.0012548392,0.0002578905,0.000042752,0.00021490054,0.0007782043,0.003190117,0.000422534,0.891574,0.040713266,0.06126059],"study_design_scores_gemma":[0.000017990222,0.000008736492,0.00015661473,0.00007546401,0.000014615714,0.0001263889,0.00034211559,0.0072750286,0.00027858926,0.96893567,0.022746563,0.00002230816],"about_ca_topic_score_codex":0.0047948277,"about_ca_topic_score_gemma":0.005304866,"teacher_disagreement_score":0.026495323,"about_ca_system_score_codex":0.0032965795,"about_ca_system_score_gemma":0.0030581597,"threshold_uncertainty_score":0.08863562},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mathematics","score_opus":0.015101783410440592,"score_gpt":0.29959176747971816,"score_spread":0.28448998406927756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576724046","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015395355,0.7716403,0.086564325,0.07235564,0.0019238698,0.000059238908,0.0002736383,0.0011208865,0.050666798],"genre_scores_gemma":[0.14429726,0.68007743,0.14034176,0.014544889,0.009088909,0.00024008397,0.0010221289,0.0005064586,0.009881182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940205,0.0019789902,0.0006256489,0.0012606771,0.0015686777,0.00054550765],"domain_scores_gemma":[0.9602022,0.028858436,0.0020008618,0.0023101596,0.004798582,0.0018296841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014397917,0.0007213053,0.0015149876,0.005495085,0.0014225229,0.013315466,0.0056476737,0.0042277253,0.016445084],"category_scores_gemma":[0.0205578,0.0010753097,0.0011284617,0.008113937,0.011417316,0.035837602,0.003723242,0.004889223,0.0038767129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023132612,0.0001689119,0.001518283,0.0021727453,0.000036895985,0.000077738725,0.0009326454,0.0011134783,0.001125957,0.5906273,0.017137967,0.38485667],"study_design_scores_gemma":[0.00006568553,0.000107041764,0.0008158229,0.0015473827,0.000056385747,0.0005826221,0.0016665562,0.0041675507,0.0009363567,0.4618733,0.5281164,0.00006491198],"about_ca_topic_score_codex":0.0020584136,"about_ca_topic_score_gemma":0.002175674,"teacher_disagreement_score":0.016445084,"about_ca_system_score_codex":0.0034213332,"about_ca_system_score_gemma":0.0053001572,"threshold_uncertainty_score":0.0761444},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013289680983207519,"score_gpt":0.2462505761073052,"score_spread":0.23296089512409768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585415359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001899504,0.024321148,0.91550475,0.0051477496,0.00506813,0.00012453855,0.0010079573,0.0029972857,0.04392894],"genre_scores_gemma":[0.034686834,0.021577407,0.8977556,0.0023449007,0.008161903,0.0002601872,0.0018929663,0.0029287816,0.03039142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540627,0.001252547,0.0007272982,0.0006805633,0.0017251337,0.00020819955],"domain_scores_gemma":[0.992855,0.0034579693,0.00020864716,0.0016905958,0.0015113745,0.000276367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061771357,0.0011858959,0.0016356247,0.0030608342,0.0018196972,0.0072821863,0.004219651,0.001527709,0.01781217],"category_scores_gemma":[0.011493068,0.0019620508,0.0017149249,0.0055969507,0.005383983,0.012203562,0.0035214298,0.00675331,0.010936476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005995283,0.000042751337,0.00013382752,0.0007030226,0.00003227554,0.000109194865,0.00042063076,0.0035408083,0.0009669923,0.66959065,0.07021901,0.25418088],"study_design_scores_gemma":[0.00001983584,0.00004445486,0.00014684627,0.00019417955,0.000033795935,0.0002894808,0.00007213465,0.008307036,0.0011485239,0.37480906,0.6148694,0.00006532466],"about_ca_topic_score_codex":0.0012481094,"about_ca_topic_score_gemma":0.0025172865,"teacher_disagreement_score":0.01781217,"about_ca_system_score_codex":0.0020133972,"about_ca_system_score_gemma":0.0023082823,"threshold_uncertainty_score":0.059587598},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Structuring; Correctness; Computer science; Automated theorem proving; Programming language; Theoretical computer science","score_opus":0.019583075904262302,"score_gpt":0.26718545928573706,"score_spread":0.24760238338147475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588366745","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011480248,0.00010166422,0.9746215,0.0010461402,0.00011638277,0.00015291356,0.00022428231,0.0007935718,0.011463275],"genre_scores_gemma":[0.18105769,0.00019878284,0.80975425,0.00038721279,0.0001183162,0.0002100823,0.00064617407,0.00026750533,0.007359955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981187,0.00057284825,0.0001523064,0.00028806942,0.00068594905,0.0001821114],"domain_scores_gemma":[0.9961796,0.0019651756,0.0001353591,0.0008580432,0.0007287304,0.00013313862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023475753,0.000358863,0.0006204921,0.0012871835,0.0015845237,0.0029001117,0.0019983866,0.0010858332,0.011906783],"category_scores_gemma":[0.0069136075,0.0008726977,0.0022663462,0.00083410495,0.0026957428,0.0053513944,0.0037805352,0.0028488352,0.0016282519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004715394,0.0000732147,0.00030616528,0.000094000214,0.000026073658,0.00013444877,0.00027110105,0.004609942,0.0019751056,0.9601387,0.0030156903,0.029308358],"study_design_scores_gemma":[0.000052027186,0.00004007243,0.000105210725,0.00004873055,0.00003459378,0.00011388192,0.00009759034,0.058805108,0.0035629533,0.92575127,0.011370428,0.000018191382],"about_ca_topic_score_codex":0.0012459535,"about_ca_topic_score_gemma":0.0027574808,"teacher_disagreement_score":0.011906783,"about_ca_system_score_codex":0.0013616761,"about_ca_system_score_gemma":0.0021338766,"threshold_uncertainty_score":0.039832115},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023214735034764365,"score_gpt":0.2570563489167325,"score_spread":0.23384161388196814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589528070","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066939997,0.0012655886,0.9550756,0.003521285,0.0005648657,0.00010014107,0.00037753457,0.0012827829,0.031118175],"genre_scores_gemma":[0.31456134,0.0018000033,0.6508754,0.0019519527,0.0011434656,0.00030187648,0.0017671325,0.0009504058,0.026648477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99341476,0.0023776342,0.0007289262,0.0010892571,0.0018240074,0.0005654956],"domain_scores_gemma":[0.99166554,0.004604621,0.00030986188,0.0016874115,0.0014141895,0.00031837568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072915275,0.00094595744,0.0017210082,0.0029410277,0.0028367701,0.006643513,0.003368,0.0031449029,0.017356688],"category_scores_gemma":[0.016492806,0.0011498086,0.0044002193,0.0030324245,0.0044393274,0.020817118,0.0072027636,0.008047134,0.003614385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006380359,0.00004163392,0.00013695416,0.00014443904,0.000055987868,0.000110952875,0.00022836831,0.0027942418,0.000566291,0.96124804,0.005212476,0.029396769],"study_design_scores_gemma":[0.000018405328,0.000007642818,0.000027966105,0.000024857185,0.000031445717,0.00006634521,0.000048466707,0.010714915,0.00087354466,0.9820957,0.0060763927,0.0000143101815],"about_ca_topic_score_codex":0.0020840971,"about_ca_topic_score_gemma":0.0028835738,"teacher_disagreement_score":0.017356688,"about_ca_system_score_codex":0.0022995642,"about_ca_system_score_gemma":0.0027161387,"threshold_uncertainty_score":0.058063924},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015968935075559625,"score_gpt":0.2606211021731402,"score_spread":0.2446521670975806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608678069","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014051649,0.0001988817,0.98108494,0.00026220456,0.0000615712,0.00012965038,0.00007855035,0.0022498488,0.001882641],"genre_scores_gemma":[0.18724799,0.00023368192,0.8081149,0.00025186135,0.000087930166,0.00015665473,0.00045996165,0.0006351806,0.002811866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99429625,0.0015269655,0.00042936756,0.001501898,0.0016247382,0.0006208457],"domain_scores_gemma":[0.981941,0.00885844,0.0012249815,0.0059317634,0.00166807,0.00037575085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006734012,0.0012393591,0.002113327,0.00272951,0.0015113156,0.0031671212,0.0054208804,0.0020525975,0.0041090082],"category_scores_gemma":[0.022786958,0.0012447597,0.0020009761,0.0019552473,0.0036058158,0.0067628417,0.0063866833,0.0035053368,0.0014522197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087592885,0.0004925005,0.0027337624,0.00058780896,0.00019689697,0.00025762923,0.0008325181,0.051837046,0.016791752,0.21081373,0.013520779,0.7010597],"study_design_scores_gemma":[0.00021549613,0.00017980539,0.000647672,0.00008177028,0.00015913672,0.0005491465,0.00031456782,0.52919286,0.02739227,0.43035465,0.010794866,0.000117797514],"about_ca_topic_score_codex":0.0019836691,"about_ca_topic_score_gemma":0.0025320395,"teacher_disagreement_score":0.006734012,"about_ca_system_score_codex":0.0009660908,"about_ca_system_score_gemma":0.0021167235,"threshold_uncertainty_score":0.0356133},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Programming language; Mathematics","score_opus":0.01484449246328016,"score_gpt":0.23039942048336498,"score_spread":0.21555492802008483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1946985707","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022884104,0.00761249,0.17607132,0.06677393,0.042264525,0.0005538714,0.015469267,0.025880957,0.6424896],"genre_scores_gemma":[0.19681194,0.007987626,0.1441112,0.01658168,0.007770865,0.000791128,0.07203962,0.025980493,0.5279255],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99616396,0.0012307393,0.00015744014,0.00046095633,0.0013666531,0.0006202697],"domain_scores_gemma":[0.9899058,0.0025655578,0.00016421439,0.0021217105,0.0027071615,0.0025354708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009125909,0.0011559421,0.0018634533,0.0012768935,0.002784429,0.00674345,0.003986687,0.004154803,0.11306779],"category_scores_gemma":[0.014294814,0.00093386124,0.0015778276,0.0027133115,0.0013991626,0.0076275207,0.0040395604,0.0048557417,0.058051366],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005568238,0.00021005263,0.00024232958,0.00018156762,0.00003205981,0.00016462458,0.000047114172,0.002233324,0.0008530436,0.054756694,0.8593138,0.081408575],"study_design_scores_gemma":[0.00039839774,0.00019704248,0.0008182336,0.00011141026,0.000040696115,0.00031865237,0.000116870026,0.019370167,0.0020912837,0.10102953,0.8754523,0.00005545386],"about_ca_topic_score_codex":0.0058102976,"about_ca_topic_score_gemma":0.00867296,"teacher_disagreement_score":0.11306779,"about_ca_system_score_codex":0.0015580344,"about_ca_system_score_gemma":0.0055917143,"threshold_uncertainty_score":0.37824947},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0038877114493820015,"score_gpt":0.23696334589476348,"score_spread":0.23307563444538149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970823361","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012351535,0.03180126,0.009847798,0.026658362,0.85615087,0.0003448544,0.003847384,0.0012664706,0.068847924],"genre_scores_gemma":[0.0111231385,0.027310502,0.00710107,0.008864783,0.35843685,0.00043121833,0.01306719,0.0026617132,0.57100356],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774194,0.0002968172,0.00023240839,0.0003197844,0.001230256,0.00017883892],"domain_scores_gemma":[0.98582745,0.002127562,0.0005560225,0.0010497745,0.008643312,0.0017958574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031252126,0.002108322,0.0022574156,0.008007614,0.0017639893,0.0074383323,0.0022070715,0.002135335,0.19132963],"category_scores_gemma":[0.012016082,0.0006634109,0.0012814862,0.005143728,0.00057247403,0.0030254493,0.0021809028,0.0027414293,0.086216845],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056774268,0.000025827967,0.000070582304,0.00017472802,0.000010114657,0.000030603216,0.000008381379,0.00015432095,0.00022059736,0.0004932274,0.9714792,0.027275817],"study_design_scores_gemma":[0.00003228758,0.00005766366,0.00076854636,0.00020756514,0.000023371373,0.00008132748,0.000027366019,0.0005976174,0.00034509882,0.0012598734,0.9965803,0.000019138497],"about_ca_topic_score_codex":0.0027394409,"about_ca_topic_score_gemma":0.004891838,"teacher_disagreement_score":0.19132963,"about_ca_system_score_codex":0.002080235,"about_ca_system_score_gemma":0.0023791092,"threshold_uncertainty_score":0.6400614},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Guelph","funders":"","keywords":"Computer science; Cognitive science; Management science; Epistemology; Psychology; Philosophy; Economics","score_opus":0.010693111983015832,"score_gpt":0.2717349721788356,"score_spread":0.26104186019581976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983313062","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028284546,0.040318415,0.0063579422,0.03905714,0.8732931,0.00009833793,0.0007855946,0.00021063558,0.039596036],"genre_scores_gemma":[0.0042369827,0.029114831,0.002651862,0.008485481,0.82181823,0.00011177491,0.0016444123,0.00044131425,0.13149512],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983657,0.00029989477,0.00018801833,0.00030558518,0.0007280368,0.00011275953],"domain_scores_gemma":[0.9892397,0.0038195073,0.00042067285,0.000757629,0.0046582515,0.0011042929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030178318,0.002028196,0.0020672006,0.0049829814,0.0023522747,0.0067026475,0.002094502,0.0034281602,0.09559934],"category_scores_gemma":[0.0128350975,0.0007117732,0.0015978013,0.004276474,0.0013039515,0.0068816165,0.0023270715,0.0069558034,0.04337209],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022313032,0.00001810853,0.000043006992,0.00021321572,0.00000919182,0.00003369807,0.000019186833,0.00014253489,0.0000851818,0.0029216558,0.9700979,0.026394038],"study_design_scores_gemma":[0.000012104048,0.000032716733,0.0004258974,0.0003330382,0.000018016584,0.00010631393,0.000037357797,0.00046626054,0.00011727189,0.010710067,0.98772347,0.000017522729],"about_ca_topic_score_codex":0.0020161776,"about_ca_topic_score_gemma":0.0027561267,"teacher_disagreement_score":0.09559934,"about_ca_system_score_codex":0.0025231373,"about_ca_system_score_gemma":0.002083858,"threshold_uncertainty_score":0.31981164},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.023768570543806867,"score_gpt":0.2980693273525292,"score_spread":0.27430075680872235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997780525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04854298,0.0006743657,0.94127196,0.0016063628,0.00009566109,0.00018357218,0.001411837,0.0024408097,0.003772531],"genre_scores_gemma":[0.26465127,0.00049791334,0.72824365,0.00034666664,0.00013596677,0.00016445972,0.0041628988,0.0003134766,0.0014836563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953216,0.0019327194,0.00044975293,0.00096145226,0.0010127965,0.00032158487],"domain_scores_gemma":[0.9723697,0.02367097,0.00086292415,0.0015093934,0.0011651627,0.00042193636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045078453,0.0012373839,0.0017229541,0.005232298,0.002132079,0.004928645,0.004071549,0.0029095197,0.008023235],"category_scores_gemma":[0.028897833,0.0012156055,0.0036830644,0.003398301,0.0022806462,0.011313519,0.0035788245,0.0032575268,0.0012129482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080713985,0.001123748,0.017005414,0.0015183401,0.0008391638,0.0016189689,0.0018045916,0.16652025,0.006872475,0.35408342,0.015564728,0.4322417],"study_design_scores_gemma":[0.00007777247,0.000044235174,0.00068905804,0.000092129165,0.00017693362,0.00019327561,0.0003228677,0.32741794,0.00255205,0.6640773,0.0043175397,0.00003895102],"about_ca_topic_score_codex":0.0037986506,"about_ca_topic_score_gemma":0.008281637,"teacher_disagreement_score":0.008023235,"about_ca_system_score_codex":0.0013486024,"about_ca_system_score_gemma":0.0016598484,"threshold_uncertainty_score":0.026840389},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"octopus (software); Automated theorem proving; Computer science; Artificial intelligence; Theoretical computer science","score_opus":0.016793824533640863,"score_gpt":0.2775686066946598,"score_spread":0.26077478216101896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998720940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10281914,0.004625767,0.80617374,0.0020473364,0.0011592687,0.00066683855,0.0036608975,0.059592716,0.019254282],"genre_scores_gemma":[0.37298918,0.00142572,0.60516304,0.0008274571,0.0005570141,0.0005177504,0.0072540017,0.0029218674,0.00834398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974367,0.0008408053,0.00025973335,0.0005384947,0.00066794583,0.00025634115],"domain_scores_gemma":[0.9911493,0.00543975,0.00026256414,0.0018110067,0.0009218191,0.0004156122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003930453,0.0016143841,0.0037387686,0.0058820336,0.0015342342,0.0035487418,0.0044940365,0.0023835476,0.011725378],"category_scores_gemma":[0.017093904,0.0011527401,0.001547455,0.008376979,0.001190521,0.009752015,0.004761525,0.0018852609,0.0033660654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002325302,0.0011235898,0.004479703,0.0005535534,0.00054902094,0.00018684808,0.00015507897,0.1568095,0.001863044,0.017827902,0.05427439,0.75985205],"study_design_scores_gemma":[0.00049988827,0.00017599683,0.00050782715,0.000037764163,0.00014383429,0.00008045689,0.00008988447,0.94190407,0.0014545774,0.04970646,0.00536323,0.00003602217],"about_ca_topic_score_codex":0.015620851,"about_ca_topic_score_gemma":0.025214087,"teacher_disagreement_score":0.015620851,"about_ca_system_score_codex":0.0015980325,"about_ca_system_score_gemma":0.0038390209,"threshold_uncertainty_score":0.03922528},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026200420908421347,"score_gpt":0.2924356150562363,"score_spread":0.26623519414781494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015771391","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058298234,0.000395574,0.89177454,0.00057509396,0.00034506328,0.00018779364,0.0008159563,0.043864597,0.00374327],"genre_scores_gemma":[0.41642523,0.00019328482,0.5618755,0.0008698891,0.00018341633,0.00019256929,0.002825481,0.010286707,0.0071478914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.991168,0.0020364597,0.0007782129,0.0017281782,0.0031592946,0.0011299324],"domain_scores_gemma":[0.97787094,0.009162479,0.0010550675,0.009249319,0.0022527843,0.00040948074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049841492,0.0019194924,0.0027476978,0.0023231348,0.0014649371,0.0044408576,0.0048822537,0.0019234723,0.015130522],"category_scores_gemma":[0.01821765,0.0019898165,0.005538998,0.001950497,0.0017488252,0.011447398,0.0067021297,0.0036500322,0.002672049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034525434,0.0013997357,0.012997105,0.0017249567,0.0011092891,0.0011681495,0.0013387111,0.12815042,0.10227693,0.11498045,0.03171536,0.59968644],"study_design_scores_gemma":[0.0005866071,0.00028749,0.0021304504,0.00016580148,0.0005774135,0.00040785744,0.0003008026,0.74498487,0.060688425,0.17038952,0.019233556,0.0002471302],"about_ca_topic_score_codex":0.009683816,"about_ca_topic_score_gemma":0.020833107,"teacher_disagreement_score":0.015130522,"about_ca_system_score_codex":0.0021091145,"about_ca_system_score_gemma":0.005085344,"threshold_uncertainty_score":0.050616622},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.04461471312132197,"score_gpt":0.3306390048068866,"score_spread":0.28602429168556465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016884416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033449013,0.00008068938,0.96316415,0.00010233017,0.000026367472,0.00014596141,0.00006761173,0.0010693304,0.0018946155],"genre_scores_gemma":[0.52088624,0.00024447506,0.47587693,0.00006828074,0.000036931706,0.000257278,0.00024834156,0.00037727543,0.0020042278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99077773,0.0032820918,0.00084100117,0.0010416927,0.0032900504,0.0007674034],"domain_scores_gemma":[0.97375476,0.017411571,0.001429412,0.0049881823,0.00218382,0.00023228159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007629293,0.0008808261,0.0009448009,0.0012827934,0.00096700666,0.001641733,0.0018547615,0.000898517,0.0019950734],"category_scores_gemma":[0.02606417,0.0013483872,0.002701608,0.00093323993,0.0040098955,0.0030079328,0.0028761525,0.0021016812,0.00048784248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011002737,0.0002929828,0.0056161624,0.0008768357,0.0002257364,0.0014542751,0.0029260346,0.25323084,0.05339513,0.54121643,0.001542593,0.13812268],"study_design_scores_gemma":[0.00037998147,0.00023061378,0.0006590792,0.00014456456,0.0002563574,0.00030358424,0.00024823897,0.5923929,0.058037397,0.33923137,0.008024593,0.00009120608],"about_ca_topic_score_codex":0.0085053975,"about_ca_topic_score_gemma":0.007432966,"teacher_disagreement_score":0.0085053975,"about_ca_system_score_codex":0.0010755509,"about_ca_system_score_gemma":0.0022474322,"threshold_uncertainty_score":0.040348053},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010342703078796884,"score_gpt":0.28285217948543406,"score_spread":0.2725094764066372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063428900","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14681265,0.00036230384,0.8451148,0.0003344124,0.000097213495,0.00011592246,0.00027765846,0.0037515687,0.0031334562],"genre_scores_gemma":[0.84465724,0.00013396183,0.15233538,0.0002204024,0.00009803203,0.000059650265,0.0002724507,0.00031046403,0.0019122767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570364,0.0007673799,0.00032799464,0.00053440913,0.0018772017,0.0007894595],"domain_scores_gemma":[0.98594695,0.006320867,0.0016062463,0.0036118627,0.0021888583,0.00032523912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003739049,0.0008649358,0.00085120584,0.0041378764,0.0011916682,0.0020055901,0.0022556644,0.0012527156,0.002248979],"category_scores_gemma":[0.015274383,0.00079522963,0.0026920305,0.0014050665,0.0027023635,0.003171362,0.0021237694,0.0019279785,0.00036546472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029792648,0.0005825654,0.042090528,0.0006138605,0.0005968431,0.0013154658,0.0012346996,0.18017909,0.06298578,0.22591816,0.0060564396,0.47544733],"study_design_scores_gemma":[0.00008523265,0.00025252157,0.004748845,0.00008111554,0.0003502292,0.00042662313,0.00016069457,0.7006409,0.07930924,0.21140781,0.0024200478,0.00011669626],"about_ca_topic_score_codex":0.0052554803,"about_ca_topic_score_gemma":0.004483838,"teacher_disagreement_score":0.0052554803,"about_ca_system_score_codex":0.0013488207,"about_ca_system_score_gemma":0.0032896884,"threshold_uncertainty_score":0.019774199},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010980371768939567,"score_gpt":0.26614270668747114,"score_spread":0.2551623349185316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066986855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047288157,0.0010151016,0.8907417,0.0028548087,0.00033543093,0.00013848288,0.0005427173,0.0029974915,0.05408618],"genre_scores_gemma":[0.5552073,0.00091948843,0.40313533,0.0012237347,0.00047851563,0.00021589597,0.0016788022,0.0015368985,0.035604056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960814,0.0012618448,0.00043147514,0.00080535177,0.00090552017,0.0005144277],"domain_scores_gemma":[0.98731726,0.007989402,0.0004474595,0.0024500235,0.0015288928,0.00026697502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003579282,0.0009362386,0.0010040858,0.0032837882,0.0024936693,0.004322623,0.001804225,0.0019318131,0.014532915],"category_scores_gemma":[0.012024061,0.0017156376,0.002772306,0.0025444855,0.002751907,0.016065197,0.0054607866,0.0060423333,0.0029152136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073818235,0.00006952328,0.0005892388,0.00014936047,0.00004026478,0.00026271687,0.0007792838,0.0008284361,0.0021096861,0.9581532,0.003602166,0.03334237],"study_design_scores_gemma":[0.00001734914,0.000019402025,0.00018163417,0.00006278833,0.00005720973,0.00038407755,0.00023234134,0.0069574695,0.0032865636,0.973488,0.015289313,0.000023853772],"about_ca_topic_score_codex":0.0018597726,"about_ca_topic_score_gemma":0.0019396435,"teacher_disagreement_score":0.014532915,"about_ca_system_score_codex":0.0015668814,"about_ca_system_score_gemma":0.0011428234,"threshold_uncertainty_score":0.048617482},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01880295743059998,"score_gpt":0.24981032957761376,"score_spread":0.23100737214701378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073165288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04770183,0.0013472721,0.9258347,0.0044789775,0.0002419498,0.000107668086,0.00050196314,0.0005174916,0.019268034],"genre_scores_gemma":[0.6966978,0.002539078,0.2850409,0.0014918387,0.00051444286,0.00026215074,0.0012348236,0.0005363284,0.011682827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99358267,0.002831305,0.0006006842,0.0010510031,0.001168193,0.00076613756],"domain_scores_gemma":[0.97271717,0.02170031,0.0008277175,0.0029085448,0.0010984461,0.00074776437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0102725765,0.0009674131,0.0018181128,0.0030528943,0.0032986011,0.00820861,0.0032575473,0.0032006039,0.0049811234],"category_scores_gemma":[0.023347616,0.0018591292,0.0037081796,0.004514175,0.010695004,0.041058753,0.005413204,0.0072183087,0.00072669494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003960033,0.000019542918,0.00028580407,0.000036348698,0.000010352454,0.000059095433,0.00041851902,0.0018861756,0.00013839376,0.9897682,0.0006003719,0.006737531],"study_design_scores_gemma":[0.000010240074,0.0000051016928,0.00003850473,0.000018689216,0.00002168539,0.000023327437,0.00008551623,0.0073574004,0.00022752213,0.99064636,0.001556272,0.000009413548],"about_ca_topic_score_codex":0.0087463055,"about_ca_topic_score_gemma":0.0068405024,"teacher_disagreement_score":0.0102725765,"about_ca_system_score_codex":0.0039003505,"about_ca_system_score_gemma":0.0022260414,"threshold_uncertainty_score":0.05432725},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.035131381346365564,"score_gpt":0.32424610219894545,"score_spread":0.2891147208525799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115178223","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008924612,0.000058551304,0.98944294,0.0002969431,0.00004243107,0.00003575679,0.000052498013,0.0004592391,0.00068697054],"genre_scores_gemma":[0.60467744,0.00021966844,0.39241162,0.00054299494,0.00021165822,0.00024219512,0.00025651124,0.00044133223,0.0009966354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.95892954,0.018149475,0.0030698911,0.006222995,0.010783281,0.0028449],"domain_scores_gemma":[0.68673897,0.27823144,0.0075415676,0.018053615,0.008185638,0.0012487244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03635799,0.0017020353,0.0027434325,0.0026239904,0.0018203831,0.0061076065,0.0041695572,0.002581469,0.003249364],"category_scores_gemma":[0.18283206,0.0018003869,0.005808221,0.0015872326,0.009355793,0.01247823,0.0060236584,0.007323007,0.0006703809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042315415,0.0002213927,0.0047555063,0.00038359498,0.00050571223,0.0006046767,0.00062041805,0.1023038,0.004956016,0.8473018,0.0014357169,0.03648818],"study_design_scores_gemma":[0.00010657837,0.00007168748,0.00034952065,0.00003921521,0.0000836611,0.00012955807,0.000037695958,0.39649102,0.0071077324,0.59489596,0.00064155314,0.00004588204],"about_ca_topic_score_codex":0.0030098297,"about_ca_topic_score_gemma":0.0020474058,"teacher_disagreement_score":0.03635799,"about_ca_system_score_codex":0.0032004276,"about_ca_system_score_gemma":0.0048141484,"threshold_uncertainty_score":0.19228172},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022932527700165545,"score_gpt":0.28076397970697303,"score_spread":0.25783145200680746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136755926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18026088,0.00018064231,0.8070832,0.0008304345,0.00008379348,0.00020045802,0.00022417327,0.00303088,0.0081055295],"genre_scores_gemma":[0.9700523,0.00007717404,0.027077192,0.00008124087,0.0000360367,0.0001143944,0.00013626348,0.00030519866,0.0021201724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9902154,0.003507143,0.00048933405,0.0009419783,0.0029561056,0.0018900374],"domain_scores_gemma":[0.9592413,0.027419038,0.002123648,0.0061656283,0.004401466,0.0006490175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013847731,0.001365041,0.0012230607,0.0019925162,0.0016384231,0.0034007002,0.0026992797,0.001562234,0.0056139054],"category_scores_gemma":[0.035929967,0.00075855444,0.001639084,0.00084860617,0.0052259103,0.0070035267,0.002746795,0.0025018537,0.000709011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021544963,0.00040114918,0.007888685,0.00052309065,0.00017934138,0.0007171217,0.0011320816,0.3531733,0.028514892,0.5640054,0.0023604936,0.03894999],"study_design_scores_gemma":[0.00008693556,0.00020549787,0.0007236692,0.000040996772,0.00011986699,0.00007666667,0.00012575582,0.83401495,0.023788923,0.1399722,0.00079790206,0.000046710516],"about_ca_topic_score_codex":0.005241044,"about_ca_topic_score_gemma":0.0031648038,"teacher_disagreement_score":0.013847731,"about_ca_system_score_codex":0.0029393535,"about_ca_system_score_gemma":0.004517208,"threshold_uncertainty_score":0.07323462},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01017665470751357,"score_gpt":0.25082584540069075,"score_spread":0.24064919069317717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140849218","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040377576,0.0013064411,0.45432863,0.0012511294,0.001622586,0.0002773323,0.0039521605,0.014692094,0.48219204],"genre_scores_gemma":[0.40771905,0.0008018523,0.22325282,0.0011459619,0.00023878655,0.00029922198,0.008268581,0.002591837,0.3556818],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992901,0.00007042875,0.000030813142,0.00020476546,0.00029285514,0.0001110258],"domain_scores_gemma":[0.9990771,0.00013217656,0.000032883814,0.00040014024,0.00028133468,0.000076369484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054308824,0.00050012703,0.00048507977,0.0012370463,0.0012328107,0.0031257353,0.0015531619,0.000999615,0.08027704],"category_scores_gemma":[0.0014146913,0.00040277213,0.0007389051,0.0011144775,0.00065062306,0.0029720948,0.002362191,0.0011973588,0.020107685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009547207,0.00036685384,0.002987598,0.00031672165,0.00014519725,0.00033692858,0.0004164905,0.014971584,0.021293161,0.41274303,0.11095412,0.43451354],"study_design_scores_gemma":[0.00018071757,0.00021577884,0.0019875644,0.00014012851,0.0001576173,0.00088271644,0.00040705997,0.07531946,0.036205992,0.2071636,0.6772401,0.000099239376],"about_ca_topic_score_codex":0.0022742688,"about_ca_topic_score_gemma":0.003525857,"teacher_disagreement_score":0.08027704,"about_ca_system_score_codex":0.00074983976,"about_ca_system_score_gemma":0.0011563369,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016383695167651317,"score_gpt":0.2659575518394582,"score_spread":0.24957385667180687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142949137","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039188262,0.000050176604,0.9497344,0.0001331392,0.00006136028,0.00011749078,0.00020703368,0.009181445,0.0013265613],"genre_scores_gemma":[0.6072633,0.00010226348,0.3885146,0.00009594999,0.00002493047,0.00020908614,0.0005830875,0.0011642054,0.0020426225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98874027,0.004437736,0.0012478057,0.0009183924,0.0035521649,0.0011035281],"domain_scores_gemma":[0.9570385,0.02401328,0.0021012037,0.010550625,0.0057595503,0.00053698634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007989064,0.0010846788,0.0012063535,0.0016725201,0.0013003381,0.005269136,0.0036491547,0.0024744703,0.0043129306],"category_scores_gemma":[0.029693238,0.0014137009,0.002613776,0.0010187795,0.0028795307,0.0048898305,0.0038305141,0.0036354254,0.0014416559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024090365,0.0008618244,0.010278903,0.0013018738,0.00048907485,0.0029009297,0.0028881873,0.24793124,0.1274029,0.39057842,0.007459798,0.2054978],"study_design_scores_gemma":[0.00025874973,0.00016884199,0.00046471308,0.00010324578,0.00015633763,0.00029888196,0.00018107158,0.788745,0.11001551,0.09233746,0.007158256,0.00011193957],"about_ca_topic_score_codex":0.0035436857,"about_ca_topic_score_gemma":0.004878007,"teacher_disagreement_score":0.007989064,"about_ca_system_score_codex":0.0014832626,"about_ca_system_score_gemma":0.0041577616,"threshold_uncertainty_score":0.042250693},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010669031447320055,"score_gpt":0.26377637250171027,"score_spread":0.2531073410543902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904404870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059131846,0.00089784205,0.8628253,0.0044238386,0.0005006306,0.0002114693,0.00060555805,0.0012763244,0.07012734],"genre_scores_gemma":[0.777538,0.0005811797,0.20327295,0.0016215391,0.0007333258,0.00038452153,0.00047449296,0.0005562918,0.014837621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760014,0.0007545487,0.00019730508,0.00041364433,0.00066064415,0.00037371222],"domain_scores_gemma":[0.9976458,0.0010367123,0.00017142031,0.0003863871,0.0005028895,0.00025683956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003058955,0.0007130665,0.0015811288,0.0032683825,0.0026708816,0.006481379,0.002938765,0.0019354941,0.009217666],"category_scores_gemma":[0.0039461115,0.0010534272,0.002273015,0.0018150416,0.0061189667,0.007870743,0.004218121,0.0054213204,0.0011829659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064973287,0.000014739144,0.000052546045,0.00001349108,0.000005137497,0.000037513662,0.00012092086,0.00034683236,0.00027188496,0.997929,0.00031034276,0.0008912137],"study_design_scores_gemma":[0.000017988963,0.000014149463,0.000090062764,0.000024796283,0.0000147881065,0.00006806676,0.00008050601,0.010901889,0.00052191276,0.98485017,0.0033948433,0.00002069299],"about_ca_topic_score_codex":0.0031129152,"about_ca_topic_score_gemma":0.003655384,"teacher_disagreement_score":0.009217666,"about_ca_system_score_codex":0.0038596254,"about_ca_system_score_gemma":0.0031430542,"threshold_uncertainty_score":0.030836225},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03488639177182947,"score_gpt":0.2576629082741037,"score_spread":0.22277651650227423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905126952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30405018,0.030431572,0.47290435,0.06149187,0.002021146,0.0010271462,0.005825677,0.017459905,0.10478823],"genre_scores_gemma":[0.84629405,0.004314292,0.12926553,0.0035507712,0.0016384406,0.00029319728,0.004391696,0.0019075993,0.0083445115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.96209615,0.0151710985,0.002741529,0.0039627766,0.013202914,0.002825481],"domain_scores_gemma":[0.7526069,0.19902317,0.003372406,0.03197705,0.010823264,0.0021971983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.029304238,0.0016499566,0.0041092266,0.0051441626,0.0027418009,0.009901686,0.005766345,0.004408797,0.018627793],"category_scores_gemma":[0.16707794,0.0016909087,0.0023305325,0.009116514,0.004869337,0.043654695,0.008885726,0.0054996316,0.0033293336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046422756,0.0010775651,0.014640703,0.0012035429,0.0007031176,0.00069954497,0.0014687332,0.12215647,0.008322034,0.21112007,0.09995647,0.53400946],"study_design_scores_gemma":[0.00042903464,0.0001405197,0.0014837062,0.00014807498,0.00029880207,0.00029787252,0.0006127282,0.723026,0.004255418,0.26112372,0.008110849,0.0000733653],"about_ca_topic_score_codex":0.018914146,"about_ca_topic_score_gemma":0.011566678,"teacher_disagreement_score":0.029304238,"about_ca_system_score_codex":0.0053268946,"about_ca_system_score_gemma":0.0053866263,"threshold_uncertainty_score":0.15497744},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012645934950046225,"score_gpt":0.2963992426726911,"score_spread":0.28375330772264484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943910961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04890647,0.001123797,0.8896553,0.004564427,0.00029731542,0.00012001992,0.00046554086,0.0015119377,0.053355236],"genre_scores_gemma":[0.7727532,0.0010943947,0.21068679,0.0006566459,0.00045082776,0.00010902242,0.0008612962,0.00036189426,0.013026027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942027,0.002812926,0.00035064798,0.0007208184,0.0015291353,0.00038379463],"domain_scores_gemma":[0.9859139,0.010344691,0.00032032802,0.0020579554,0.001109591,0.00025362108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004336564,0.00080432725,0.00089161727,0.0027120858,0.001851231,0.0050189802,0.0016888293,0.0012196788,0.010661721],"category_scores_gemma":[0.021789769,0.00096018455,0.002750256,0.0024035114,0.0044816206,0.02006589,0.0059950254,0.0032844516,0.0013887753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008229674,0.000042984364,0.0006360513,0.00012784876,0.00007043733,0.000204563,0.00052064186,0.0059509235,0.00049689115,0.9605651,0.0032538068,0.028048646],"study_design_scores_gemma":[0.000011911412,0.000005707054,0.00006704986,0.000014915245,0.000026594653,0.00005628622,0.00006916388,0.014002528,0.000620004,0.9811383,0.003979926,0.00000751416],"about_ca_topic_score_codex":0.0021006784,"about_ca_topic_score_gemma":0.0016163952,"teacher_disagreement_score":0.010661721,"about_ca_system_score_codex":0.0013244597,"about_ca_system_score_gemma":0.0010806909,"threshold_uncertainty_score":0.035667002},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Programming language","score_opus":0.012866011335541131,"score_gpt":0.23485084603943085,"score_spread":0.22198483470388972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231890083","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013790075,0.0057462975,0.011644807,0.028453663,0.14854054,0.00063702447,0.018154211,0.0020174615,0.783427],"genre_scores_gemma":[0.005572643,0.002543985,0.0035928288,0.004577684,0.015023575,0.00028838302,0.009916472,0.000917237,0.95756716],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992962,0.0001122533,0.00004449022,0.00012676757,0.00036158934,0.000058813966],"domain_scores_gemma":[0.9945799,0.00090286526,0.00016739136,0.00056401023,0.003166843,0.00061896606],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014401535,0.0007877834,0.00059617596,0.0032714286,0.0028546061,0.0035662742,0.001215528,0.0009130655,0.5304703],"category_scores_gemma":[0.012055039,0.000272261,0.0005496549,0.002410519,0.0006139553,0.0026771813,0.0020744335,0.0024284234,0.3270913],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026354799,0.000019188743,0.000091392496,0.000068805464,0.0000015686664,0.000026396981,0.000060028826,0.000050726667,0.00010262961,0.0061197085,0.9526276,0.040805493],"study_design_scores_gemma":[0.0000046394894,0.000008637777,0.00024957093,0.0000828341,0.0000018654991,0.000024038649,0.00007457334,0.00003777946,0.00009766881,0.004186845,0.99522734,0.0000041050557],"about_ca_topic_score_codex":0.0063894344,"about_ca_topic_score_gemma":0.008074047,"teacher_disagreement_score":0.4695297,"about_ca_system_score_codex":0.0020639836,"about_ca_system_score_gemma":0.0024261845,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Mathematics; Calculus (dental); Programming language; Medicine","score_opus":0.011845415772537267,"score_gpt":0.24757013554682306,"score_spread":0.2357247197742858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399335583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024666715,0.00045671512,0.95883745,0.0009804411,0.00015296537,0.000033679382,0.00022632747,0.00033185026,0.014313841],"genre_scores_gemma":[0.70380074,0.0007590308,0.28012982,0.00051825884,0.00043375223,0.00018908722,0.00042337636,0.00025140043,0.013494523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981365,0.00080511457,0.00017595293,0.00028999275,0.00042259882,0.0001696932],"domain_scores_gemma":[0.9959584,0.0025795733,0.0002271485,0.00046365257,0.0006274039,0.0001439167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034900862,0.00069685566,0.0005978335,0.0021480916,0.0008684592,0.002966437,0.0009967939,0.0007783118,0.0053409124],"category_scores_gemma":[0.005653488,0.00053131767,0.0017607512,0.0012826071,0.0034654487,0.0068260175,0.0021349816,0.002826427,0.0006532553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031807416,0.000024268664,0.00024905585,0.00004223285,0.000013787073,0.000060125923,0.0002367256,0.002672243,0.00092610513,0.9858429,0.0005595546,0.009341118],"study_design_scores_gemma":[0.000012407485,0.000015042752,0.00010679017,0.00001967024,0.000014373265,0.000052161893,0.000052662734,0.020838793,0.00084805227,0.97515047,0.0028786957,0.000010873635],"about_ca_topic_score_codex":0.0013944348,"about_ca_topic_score_gemma":0.0010354132,"teacher_disagreement_score":0.0053409124,"about_ca_system_score_codex":0.0018553336,"about_ca_system_score_gemma":0.00086904236,"threshold_uncertainty_score":0.018457592},"labels":[],"label_agreement":null}]}