{"meta":{"query_hash":"1c8c82494ccb","filters":{"venue":"Formal Aspects of Computing"},"cohort_total":41,"direct_labels_cover":0,"predictions_cover":41,"exported":41,"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/1c8c82494ccb","api":"https://metacan.xera.ac/api/v1/cohort?venue=Formal+Aspects+of+Computing"},"results":[{"id":"W1216906483","doi":"10.1007/s00165-015-0336-0","title":"Categorical foundations for structured specifications in Z","year":2015,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Algorithm; Categorical variable; Notation; Structuring; Programming language; Artificial intelligence; Theoretical computer science; Machine learning; Mathematics; Arithmetic","score_opus":0.07029911596565051,"score_gpt":0.290714074281569,"score_spread":0.22041495831591845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1216906483","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.0787226,0.0010848854,0.8262917,0.0041570286,0.00022103642,0.00013028407,0.0003997554,0.0014547051,0.08753798],"genre_scores_gemma":[0.8556992,0.0007012139,0.12813456,0.0007818929,0.00017648272,0.00027234052,0.00047324898,0.00020182271,0.013559238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958568,0.0016472397,0.00031000123,0.00056414143,0.0011950422,0.00042688512],"domain_scores_gemma":[0.9957463,0.0019555741,0.00039012244,0.0006316832,0.000937593,0.0003386016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004105628,0.0003444765,0.00043514604,0.0019341147,0.0015703569,0.005606949,0.0010652884,0.0013966524,0.0060484074],"category_scores_gemma":[0.0048255934,0.0005611845,0.0011197019,0.0013765483,0.007293077,0.007658069,0.0046841004,0.0027528428,0.0009886577],"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.0000046594932,0.0000040900477,0.00008215253,0.000010705389,0.0000019374172,0.000021839742,0.00030267786,0.00032023285,0.00019655112,0.9973865,0.00015048886,0.001518201],"study_design_scores_gemma":[0.000023386856,0.000021541775,0.0001799664,0.000030209936,0.000008056501,0.000046138026,0.00038096163,0.0037483652,0.0005909205,0.97635764,0.018597415,0.000015453214],"about_ca_topic_score_codex":0.004131464,"about_ca_topic_score_gemma":0.0028010495,"teacher_disagreement_score":0.0060484074,"about_ca_system_score_codex":0.0031872643,"about_ca_system_score_gemma":0.0018165471,"threshold_uncertainty_score":0.02312535},"labels":[],"label_agreement":null},{"id":"W1990781920","doi":"10.1007/s00165-013-0286-3","title":"Refinement patterns for ASTDs","year":2013,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Computer science; Refinement calculus; Divergence (linguistics); Simple (philosophy); Theoretical computer science; Algorithm","score_opus":0.021674587347506696,"score_gpt":0.2812715598116536,"score_spread":0.25959697246414687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990781920","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.006569308,0.000059495807,0.9870301,0.00021378665,0.000055842065,0.00025806343,0.00018281068,0.001686303,0.003944242],"genre_scores_gemma":[0.16436327,0.00021900122,0.82902795,0.0002155893,0.00005176196,0.00064890954,0.0007936754,0.0006955174,0.0039843423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98879623,0.0037433275,0.0022689817,0.0012167533,0.0034232843,0.00055150036],"domain_scores_gemma":[0.9781075,0.0106198825,0.001498888,0.0052425885,0.004129627,0.00040154482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069895,0.0008241027,0.0005817572,0.0015295445,0.0009874898,0.0020173956,0.0014265684,0.001542614,0.0060567204],"category_scores_gemma":[0.02157836,0.0009491552,0.0018810764,0.0012206767,0.0035143094,0.0045195566,0.0029009779,0.0026870319,0.0016471816],"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.00017105686,0.00007191279,0.0020918588,0.00040810806,0.000044349672,0.00072238955,0.0017007479,0.015620691,0.010714695,0.88100594,0.003253192,0.084195085],"study_design_scores_gemma":[0.00016084152,0.00021541431,0.0005865741,0.00028706426,0.00010474885,0.0010787994,0.00053813873,0.10724279,0.029432602,0.72606426,0.13419922,0.000089530324],"about_ca_topic_score_codex":0.002566311,"about_ca_topic_score_gemma":0.0026430818,"teacher_disagreement_score":0.0069895,"about_ca_system_score_codex":0.0011312842,"about_ca_system_score_gemma":0.0018312791,"threshold_uncertainty_score":0.036964417},"labels":[],"label_agreement":null},{"id":"W1997553387","doi":"10.1007/s00165-012-0252-5","title":"Proving termination of nonlinear command sequences","year":2012,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Theory of computation; Nonlinear system; Simple (philosophy); Computer science; Algorithm; Divergence (linguistics); Class (philosophy); Loop (graph theory); Variable (mathematics); Mathematics; Theoretical computer science; Artificial intelligence; Mathematical analysis; Combinatorics","score_opus":0.02360080994626788,"score_gpt":0.297527706928594,"score_spread":0.2739268969823261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997553387","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.09045764,0.00003857705,0.9015779,0.00017690257,0.000031225572,0.00011416058,0.00008087272,0.0024266783,0.0050960835],"genre_scores_gemma":[0.8089403,0.000054778608,0.1864463,0.00015630412,0.000030054382,0.00013463094,0.00020605989,0.00038359262,0.0036480068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99555355,0.0011228317,0.00021935819,0.0004969435,0.0020949168,0.00051245966],"domain_scores_gemma":[0.9862163,0.009127734,0.0007756332,0.0013887207,0.0021706484,0.00032098722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003008884,0.0008083038,0.00070340344,0.0007460396,0.0010532105,0.0012971837,0.0015291215,0.0007583209,0.0036513328],"category_scores_gemma":[0.016102413,0.00033953332,0.00087524706,0.00038078535,0.004880088,0.002219885,0.0024876392,0.0017780514,0.00080164993],"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.0012513926,0.00043490893,0.010277309,0.00061972096,0.00011607329,0.0017181087,0.0021320968,0.19049491,0.1357505,0.49309853,0.0041170246,0.15998936],"study_design_scores_gemma":[0.000101881466,0.00018262988,0.00058883213,0.000053250864,0.00002934007,0.00019974132,0.00013370831,0.7202342,0.096813954,0.17746486,0.0041585797,0.000039063783],"about_ca_topic_score_codex":0.0033106348,"about_ca_topic_score_gemma":0.0019748453,"teacher_disagreement_score":0.0036513328,"about_ca_system_score_codex":0.0015545321,"about_ca_system_score_gemma":0.0019345916,"threshold_uncertainty_score":0.015912712},"labels":[],"label_agreement":null},{"id":"W2003127245","doi":"10.1007/s00165-010-0158-z","title":"Partial order semantics for use case and task models","year":2010,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Notation; Semantics (computer science); Task (project management); Semantic data model; Programming language; Artificial intelligence","score_opus":0.039650730299265594,"score_gpt":0.28876295825712817,"score_spread":0.2491122279578626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003127245","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.008113919,0.00013776596,0.98182285,0.00048415436,0.000059352566,0.00020464405,0.0002798081,0.0005476454,0.008349803],"genre_scores_gemma":[0.32412326,0.0005173339,0.66566044,0.000326494,0.00015986127,0.0011302544,0.0015043064,0.0003480208,0.006230064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99110985,0.003335299,0.0013163565,0.00088607357,0.0027505343,0.00060196477],"domain_scores_gemma":[0.99117106,0.004051315,0.0007352527,0.001799321,0.0018653162,0.00037766728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007296658,0.0011222914,0.0006540692,0.003204915,0.0019418205,0.0041820374,0.0021365138,0.001986407,0.0035254667],"category_scores_gemma":[0.008829835,0.0009377112,0.002756465,0.0026408252,0.0046507264,0.009675004,0.0036482965,0.0032327427,0.00086683134],"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.000012839,0.00002033851,0.000100567624,0.00005076194,0.000008506375,0.00012523102,0.00050974765,0.0061482354,0.00052304845,0.9872487,0.0005371077,0.0047149216],"study_design_scores_gemma":[0.00003787264,0.00004870917,0.00012585733,0.000083454004,0.00003239434,0.00023513201,0.00034779552,0.07192441,0.002658025,0.8869844,0.0374859,0.00003599201],"about_ca_topic_score_codex":0.0063425596,"about_ca_topic_score_gemma":0.0065679727,"teacher_disagreement_score":0.007296658,"about_ca_system_score_codex":0.0028042665,"about_ca_system_score_gemma":0.002412664,"threshold_uncertainty_score":0.038588822},"labels":[],"label_agreement":null},{"id":"W2007666139","doi":"10.1007/s00165-012-0223-x","title":"Automatic verification of reduction techniques in Higher Order Logic","year":2012,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Computer science; Correctness; Soundness; Reduction (mathematics); Model checking; Programming language; Heuristics; Consistency (knowledge bases); Partial order reduction; Automated theorem proving; Algorithm; Formal verification; Reduction strategy; Theoretical computer science; Mathematics","score_opus":0.04194995695396473,"score_gpt":0.3097887354940638,"score_spread":0.2678387785400991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007666139","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.038042072,0.00006318543,0.95549494,0.00010774908,0.00003200476,0.0001409877,0.000069850976,0.0042643724,0.0017848591],"genre_scores_gemma":[0.57941943,0.00011465098,0.41714993,0.00015391957,0.00003149362,0.00026681516,0.0003171441,0.00067164254,0.0018749936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99266464,0.002557053,0.0003351374,0.0006286925,0.0032383343,0.00057607895],"domain_scores_gemma":[0.98995006,0.006687922,0.00046632218,0.002087608,0.00071526977,0.00009276971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003860137,0.00091901154,0.0007998633,0.0014734975,0.0007250082,0.0013211425,0.001788163,0.00077998976,0.0037947781],"category_scores_gemma":[0.008839778,0.00067839504,0.002624219,0.0005562646,0.0027320827,0.0020234287,0.0024377226,0.0023619123,0.0006499475],"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.0007388724,0.0007823863,0.003597333,0.0009719198,0.0004607894,0.0009972629,0.0010451204,0.34984154,0.14315291,0.3515607,0.0023990832,0.14445208],"study_design_scores_gemma":[0.00019135672,0.00023616088,0.0006283405,0.00005973486,0.000135401,0.00016630674,0.00007154326,0.7567026,0.10084923,0.13483898,0.0060622133,0.00005808233],"about_ca_topic_score_codex":0.0027932287,"about_ca_topic_score_gemma":0.00292931,"teacher_disagreement_score":0.003860137,"about_ca_system_score_codex":0.0012236906,"about_ca_system_score_gemma":0.0016682755,"threshold_uncertainty_score":0.02041459},"labels":[],"label_agreement":null},{"id":"W2008590694","doi":"10.1007/s001650200032","title":"A Refinement Calculus for Shared-Variable Parallel and Distributed Programming","year":2002,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Concurrency; Programming language; Process calculus; Software portability; Theoretical computer science; Communicating sequential processes; Operational semantics; Semantics (computer science)","score_opus":0.01856906399011817,"score_gpt":0.24645460133552305,"score_spread":0.22788553734540487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008590694","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.00417438,0.00024985804,0.9876987,0.0002960707,0.00007888464,0.00009420856,0.000063327345,0.00034622988,0.0069983164],"genre_scores_gemma":[0.19616856,0.00070679764,0.7901313,0.00028608943,0.00020307393,0.0004724223,0.00026193948,0.00028933428,0.011480443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970481,0.00081926474,0.00018035498,0.00029414037,0.0013756657,0.00028258297],"domain_scores_gemma":[0.99698037,0.0016635054,0.00016122662,0.0004092088,0.0006450855,0.00014051524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00505053,0.0005563924,0.0007389798,0.00090063456,0.0016540154,0.0021355443,0.0018181725,0.0007580763,0.0043616407],"category_scores_gemma":[0.005260962,0.0006428512,0.0017841375,0.0013958798,0.0038713857,0.003194206,0.0023775366,0.0029928077,0.00073820376],"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.000015045288,0.000016355007,0.000092198454,0.00003858343,0.000009904217,0.0000791476,0.00018936108,0.010068336,0.0007686389,0.98006433,0.0008094359,0.007848638],"study_design_scores_gemma":[0.000055703633,0.000024992734,0.00007449933,0.000034134122,0.000033510412,0.00007826966,0.000046790552,0.118988454,0.0017198949,0.8535432,0.025376676,0.000023886749],"about_ca_topic_score_codex":0.008267726,"about_ca_topic_score_gemma":0.0061701615,"teacher_disagreement_score":0.008267726,"about_ca_system_score_codex":0.0026609418,"about_ca_system_score_gemma":0.003645741,"threshold_uncertainty_score":0.026710033},"labels":[],"label_agreement":null},{"id":"W2009029954","doi":"10.1007/s00165-009-0114-y","title":"Automating the transformation-based analysis of visual languages","year":2009,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación","keywords":"Petri net; Graph rewriting; Computer science; Transformation (genetics); Model transformation; Programming language; Semantics (computer science); Operational semantics; Graph; Stochastic Petri net; Visual language; Program transformation; Theoretical computer science; Visual modeling; Theory of computation; Unified Modeling Language; Artificial intelligence","score_opus":0.00614976838597775,"score_gpt":0.262775836309977,"score_spread":0.2566260679239992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009029954","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.015847042,0.000037295973,0.97735286,0.00006823919,0.000023119026,0.00013105504,0.00014440714,0.0045388616,0.0018570593],"genre_scores_gemma":[0.38309997,0.00014324534,0.61168814,0.00009400228,0.00001717128,0.00023354065,0.00093106745,0.0016508948,0.0021419462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861276,0.00041630608,0.0000919423,0.00023632708,0.00052615255,0.00011649716],"domain_scores_gemma":[0.9973616,0.0014400063,0.00017543009,0.00043914802,0.00054641697,0.00003725737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012479466,0.0006741532,0.00042783978,0.0012470436,0.00038554374,0.0014984102,0.00080128113,0.00063267176,0.0027396192],"category_scores_gemma":[0.0047215456,0.0004076215,0.0012122351,0.0004908712,0.0010862811,0.0010138844,0.0010836862,0.0009447267,0.000855061],"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.0003538168,0.00028057254,0.0027912192,0.0008756953,0.00015882945,0.0013362218,0.0015737576,0.25905913,0.16308804,0.198374,0.005617142,0.36649147],"study_design_scores_gemma":[0.000056781548,0.00008664579,0.00049345015,0.000077334924,0.00006434401,0.00027805113,0.00022186419,0.70752513,0.15739562,0.110146925,0.023603661,0.00005024573],"about_ca_topic_score_codex":0.0018428355,"about_ca_topic_score_gemma":0.0013399388,"teacher_disagreement_score":0.0027396192,"about_ca_system_score_codex":0.0007121446,"about_ca_system_score_gemma":0.0009488984,"threshold_uncertainty_score":0.009164929},"labels":[],"label_agreement":null},{"id":"W2012369158","doi":"10.1007/s00165-009-0129-4","title":"A game-theoretic framework for specification and verification of cryptographic protocols","year":2009,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cryptographic protocol; Theoretical computer science; Protocol (science); Notation; Semantics (computer science); Theory of computation; Game semantics; Programming language; Set (abstract data type); Cryptography; Simple (philosophy); Operational semantics; Algorithm; Denotational semantics; Mathematics","score_opus":0.018793498317635743,"score_gpt":0.31434787268941844,"score_spread":0.29555437437178267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012369158","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.0020768673,0.0003298004,0.99376833,0.00036514906,0.0000612955,0.00014379922,0.00009787084,0.0002418513,0.0029150562],"genre_scores_gemma":[0.15774556,0.001183312,0.83533776,0.00038085325,0.0001857882,0.0008940194,0.00037159002,0.00015965878,0.0037413875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99315476,0.0034097473,0.0006769507,0.00059976196,0.0016429183,0.000515869],"domain_scores_gemma":[0.99630296,0.0021115385,0.00030235364,0.00050463784,0.0005609377,0.00021748389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007049358,0.0019253461,0.0014865884,0.0023581996,0.0019096287,0.006104163,0.0041767983,0.0022288277,0.003607874],"category_scores_gemma":[0.0071414197,0.0015260507,0.0031090055,0.002458924,0.006464764,0.0066050473,0.003121336,0.0047298167,0.0009354945],"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.000017580167,0.00003211808,0.00007378861,0.00009653309,0.000025046364,0.0001351853,0.00017726883,0.032168955,0.00073575164,0.961974,0.0005289406,0.0040348507],"study_design_scores_gemma":[0.00006809503,0.00006001147,0.00006695792,0.00012295636,0.00006681707,0.000120382145,0.000112499314,0.22919098,0.0016598627,0.7473146,0.021171885,0.0000449849],"about_ca_topic_score_codex":0.010870955,"about_ca_topic_score_gemma":0.009804955,"teacher_disagreement_score":0.010870955,"about_ca_system_score_codex":0.0038139974,"about_ca_system_score_gemma":0.0056411996,"threshold_uncertainty_score":0.037280977},"labels":[],"label_agreement":null},{"id":"W2012984207","doi":"10.1007/s00165-014-0323-x","title":"Proof-based verification approaches for dynamic properties: application to the information system domain","year":2014,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Reachability; Computer science; Property (philosophy); Set (abstract data type); Domain (mathematical analysis); Proof of concept; Range (aeronautics); Theoretical computer science; Programming language; Mathematics; Engineering","score_opus":0.02273141283079378,"score_gpt":0.23938017854015237,"score_spread":0.2166487657093586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012984207","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.0032770983,0.00008309486,0.99399686,0.00016973188,0.000017949013,0.00012425313,0.000028864974,0.0006555153,0.0016466621],"genre_scores_gemma":[0.11702166,0.00024868242,0.8807009,0.00012136412,0.000017840686,0.00021851144,0.000060967017,0.00025224307,0.0013578151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973411,0.0013805397,0.0001986749,0.00024756635,0.00069417566,0.00013790671],"domain_scores_gemma":[0.98687553,0.010981634,0.00043505666,0.00084492064,0.0006791799,0.00018362279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053107487,0.0005273819,0.00053264847,0.0015128094,0.0010666522,0.0019824377,0.0014636018,0.0011555204,0.005394933],"category_scores_gemma":[0.010821118,0.0007611731,0.0010514025,0.0006711528,0.0028629643,0.003638131,0.0025859824,0.0021079388,0.00096322113],"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.0002119989,0.00033309098,0.0008094046,0.00093684625,0.00008192882,0.0013724414,0.0011193644,0.08114396,0.038247753,0.6754022,0.0037317001,0.19660929],"study_design_scores_gemma":[0.0002903773,0.0001393958,0.00020740065,0.00037623764,0.00004900468,0.0006873529,0.00019406974,0.6250395,0.05051119,0.28827804,0.034149516,0.00007789773],"about_ca_topic_score_codex":0.0019968543,"about_ca_topic_score_gemma":0.0016447603,"teacher_disagreement_score":0.005394933,"about_ca_system_score_codex":0.00092852995,"about_ca_system_score_gemma":0.0016895424,"threshold_uncertainty_score":0.028086245},"labels":[],"label_agreement":null},{"id":"W2028754496","doi":"10.1007/s00165-003-0010-9","title":"Exploring Tabular Verification and Refinement","year":2003,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Structuring; Programming language; Theory of computation; Refinement calculus; Theoretical computer science; Formal methods","score_opus":0.0423949639495817,"score_gpt":0.2282793509794044,"score_spread":0.1858843870298227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028754496","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.01862898,0.00025586758,0.97484225,0.00069074327,0.00005304276,0.00008310686,0.00010858485,0.0013304214,0.0040071127],"genre_scores_gemma":[0.4148081,0.00049191766,0.5805914,0.000497431,0.00004404925,0.00019614887,0.00034832055,0.0004686075,0.0025539903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901766,0.005585759,0.0005871647,0.0009647328,0.0019740087,0.0007117596],"domain_scores_gemma":[0.97078484,0.018706731,0.0016634767,0.00592461,0.00263868,0.0002817225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011983885,0.00052689074,0.0007652284,0.001257519,0.0013312211,0.0040531904,0.0018710642,0.0012446417,0.004946378],"category_scores_gemma":[0.03187529,0.00077205873,0.0015250476,0.002045542,0.0056034992,0.008970711,0.0042612525,0.0022158024,0.0007108319],"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.0001689623,0.000049111597,0.0010321226,0.00020957008,0.000030734685,0.00016724071,0.0013974643,0.028102176,0.0035464133,0.90848684,0.0014735279,0.055335857],"study_design_scores_gemma":[0.00007021616,0.000112565445,0.00019267331,0.00022589126,0.00006130416,0.00014586262,0.0005225283,0.25169396,0.0153792435,0.70604837,0.025494775,0.00005264578],"about_ca_topic_score_codex":0.004303803,"about_ca_topic_score_gemma":0.00335577,"teacher_disagreement_score":0.011983885,"about_ca_system_score_codex":0.0017071083,"about_ca_system_score_gemma":0.0024127099,"threshold_uncertainty_score":0.06337762},"labels":[],"label_agreement":null},{"id":"W2033241152","doi":"10.1007/s00165-008-0078-3","title":"Efficient representation of the attacker’s knowledge in cryptographic protocols analysis","year":2008,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council Canada; Politecnico di Torino","keywords":"Computer science; Theory of computation; Cryptographic protocol; Representation (politics); Theoretical computer science; Knowledge representation and reasoning; Cryptography; Associative property; Cryptographic primitive; Term (time); Commutative property; Programming language; Artificial intelligence; Algorithm; Mathematics; Discrete mathematics","score_opus":0.030775611218706474,"score_gpt":0.3300581245652502,"score_spread":0.2992825133465437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033241152","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.019182654,0.00008977097,0.97812325,0.00042928377,0.000018625196,0.000060317157,0.00007490052,0.0004140672,0.0016072193],"genre_scores_gemma":[0.55687976,0.000347112,0.43859905,0.00017823717,0.00007244913,0.00018030775,0.00037788932,0.00015339266,0.0032118298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934077,0.002991419,0.0004240362,0.0006636231,0.0020260082,0.00048719885],"domain_scores_gemma":[0.9884729,0.006675389,0.0006868287,0.0030403594,0.0009411051,0.00018331499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048107663,0.00058961386,0.00092073507,0.0021023073,0.0008862523,0.0047199572,0.0026801263,0.0013753212,0.0026215385],"category_scores_gemma":[0.01645532,0.00057888904,0.001513746,0.0023678006,0.0029454206,0.0110610025,0.0047245915,0.0029623415,0.0006936309],"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.0002973163,0.00012152676,0.000654151,0.00020078057,0.00008061706,0.00026631277,0.00060658995,0.14601523,0.0067566494,0.7292056,0.0013986519,0.114396475],"study_design_scores_gemma":[0.000029584007,0.000050101564,0.00010129098,0.000042514523,0.000054795597,0.000107683416,0.00011606115,0.5138076,0.008823718,0.47378182,0.0030569353,0.000027829716],"about_ca_topic_score_codex":0.0017105679,"about_ca_topic_score_gemma":0.0014632947,"teacher_disagreement_score":0.0048107663,"about_ca_system_score_codex":0.0020200538,"about_ca_system_score_gemma":0.0019462919,"threshold_uncertainty_score":0.025442064},"labels":[],"label_agreement":null},{"id":"W2036570657","doi":"10.1007/s00165-009-0115-x","title":"From a domain analysis to the specification and detection of code and design smells","year":2009,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Software Engineering Research","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Code smell; Computer science; Context (archaeology); Domain (mathematical analysis); Adaptation (eye); Domain analysis; Software engineering; Programming language; Software system; Software; Software development; Software quality; Software construction","score_opus":0.015197072992355601,"score_gpt":0.24887866242311502,"score_spread":0.23368158943075942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036570657","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.15900984,0.00035136586,0.8298387,0.0002946749,0.00001927697,0.0001393224,0.000195954,0.008914248,0.0012364953],"genre_scores_gemma":[0.50646627,0.00025894554,0.4906851,0.00015234764,0.000015990252,0.0001198167,0.00073978945,0.0007221814,0.0008395178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99392384,0.0028873621,0.0005213122,0.00084225356,0.0015862617,0.0002388958],"domain_scores_gemma":[0.96467906,0.02153185,0.0036455013,0.0064846445,0.0032972137,0.00036174373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040538334,0.00094351673,0.0008888854,0.0030970562,0.0004285831,0.0019346615,0.000987153,0.0011518218,0.00087847974],"category_scores_gemma":[0.021162236,0.000746831,0.0012494695,0.0010115654,0.0009688322,0.0016734448,0.0017023821,0.0013858665,0.00055667036],"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.0006787065,0.0007070034,0.04320674,0.0013585002,0.0003148684,0.0015026103,0.002290097,0.10765183,0.16359642,0.016290277,0.004517309,0.65788555],"study_design_scores_gemma":[0.00009296991,0.00032681462,0.009137727,0.00020873672,0.00013572359,0.0010406944,0.00051284354,0.78773683,0.17905994,0.013136397,0.008511772,0.00009958038],"about_ca_topic_score_codex":0.0009787827,"about_ca_topic_score_gemma":0.0009023357,"teacher_disagreement_score":0.0040538334,"about_ca_system_score_codex":0.00076837454,"about_ca_system_score_gemma":0.0013162118,"threshold_uncertainty_score":0.021438956},"labels":[],"label_agreement":null},{"id":"W2046456520","doi":"10.1007/s00165-002-225-1","title":"On Closure UnderStuttering","year":2003,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"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","keywords":"Rotation formalisms in three dimensions; Computer science; Temporal logic; Linear temporal logic; Correctness; Fragment (logic); Model checking; Property (philosophy); Theory of computation; Formalism (music); Programming language; Stuttering; Theoretical computer science; Closure (psychology); Algorithm; Mathematics; Linguistics","score_opus":0.022847237005280765,"score_gpt":0.2745191433185214,"score_spread":0.25167190631324066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046456520","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.10347864,0.008036594,0.6809962,0.026001345,0.002659753,0.0002538575,0.00077775936,0.001489879,0.17630598],"genre_scores_gemma":[0.874487,0.0031580697,0.08437799,0.004466825,0.0022690424,0.00041670122,0.0011879327,0.0009236945,0.028712887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99181056,0.0026322221,0.0007980863,0.0020449099,0.0018149182,0.000899361],"domain_scores_gemma":[0.97371835,0.016566893,0.001632111,0.004313347,0.002906449,0.00086284505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007388001,0.00066174037,0.0011855825,0.0024241046,0.0037466732,0.0040655574,0.0017844067,0.0022944335,0.008883892],"category_scores_gemma":[0.03431058,0.00072322326,0.0019646643,0.001491535,0.0089584,0.018603597,0.009854094,0.0052654156,0.001092139],"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.00006284974,0.000027366643,0.00039601748,0.000089169254,0.000012891507,0.00025374282,0.0009441812,0.0009072792,0.0005470675,0.9802664,0.0039876485,0.0125053935],"study_design_scores_gemma":[0.000018140998,0.000019263096,0.00012769502,0.000056452565,0.000011794175,0.00018265983,0.00023209497,0.0040064612,0.00068328856,0.9767097,0.017938644,0.000013834679],"about_ca_topic_score_codex":0.0020807476,"about_ca_topic_score_gemma":0.0012818237,"teacher_disagreement_score":0.008883892,"about_ca_system_score_codex":0.0027080574,"about_ca_system_score_gemma":0.001296502,"threshold_uncertainty_score":0.039071918},"labels":[],"label_agreement":null},{"id":"W2048713255","doi":"10.1007/s00165-014-0325-8","title":"Synthesizing bounded-time 2-phase fault recovery","year":2014,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Liveness; Computer science; Bounded function; Theory of computation; Fault tolerance; Algorithm; Simple (philosophy); Sequence (biology); Ideal (ethics); Time complexity; Class (philosophy); Distributed computing; Theoretical computer science; Mathematics","score_opus":0.008436181392611425,"score_gpt":0.24146598286907556,"score_spread":0.23302980147646413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048713255","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.078852646,0.00006824868,0.9166348,0.00013624266,0.000028726083,0.00010215319,0.00005483256,0.0012109835,0.002911284],"genre_scores_gemma":[0.7407492,0.000087768196,0.25693217,0.000106478205,0.000011709112,0.00013567951,0.00010912932,0.00013825268,0.00172965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993063,0.00019520434,0.00005195587,0.00009917498,0.00023898903,0.00010843228],"domain_scores_gemma":[0.9981572,0.001009909,0.0002632461,0.00032609573,0.00020034901,0.00004321445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090567564,0.00041649572,0.00028990646,0.00031928456,0.00021181062,0.00043258633,0.00065132783,0.0004166303,0.0019441139],"category_scores_gemma":[0.0030875702,0.00021184656,0.00049747777,0.00024815532,0.0007417667,0.0006248891,0.00072007906,0.000682714,0.0002486567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00036925098,0.0001962282,0.0010335487,0.0003410467,0.00004039828,0.0002650098,0.0003584382,0.7080303,0.10787338,0.0982095,0.000857287,0.082425624],"study_design_scores_gemma":[0.000059376198,0.00016939582,0.00020160117,0.000021124046,0.000021532831,0.00005962537,0.000034853012,0.9153634,0.057552494,0.023219474,0.0032810252,0.000016045702],"about_ca_topic_score_codex":0.0010127226,"about_ca_topic_score_gemma":0.0013734691,"teacher_disagreement_score":0.0019441139,"about_ca_system_score_codex":0.00048548638,"about_ca_system_score_gemma":0.0010045264,"threshold_uncertainty_score":0.006503761},"labels":[],"label_agreement":null},{"id":"W2050254654","doi":"10.1007/s00165-009-0135-6","title":"Lower bounds on lengths of checking sequences","year":2009,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Theory of computation; Sequence (biology); State (computer science); Model checking; Computer science; Algorithm; Upper and lower bounds; Finite-state machine; Mathematics; Theoretical computer science; Combinatorics","score_opus":0.016043546045305543,"score_gpt":0.2687929526499507,"score_spread":0.2527494066046451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050254654","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.1322946,0.0022012605,0.84722555,0.0015972133,0.00025582843,0.0002810074,0.0011424723,0.004730681,0.010271357],"genre_scores_gemma":[0.7010119,0.0009200721,0.28864142,0.0005513487,0.000451552,0.0007210064,0.0024773197,0.0018920433,0.0033333374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9493449,0.012286887,0.0047506723,0.0066012596,0.023177098,0.0038391945],"domain_scores_gemma":[0.5551005,0.3574417,0.017688418,0.042078517,0.021496564,0.006194373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019101933,0.0019161316,0.001859848,0.00533325,0.0019333306,0.0056881797,0.0044513727,0.0030201795,0.0075318348],"category_scores_gemma":[0.17254637,0.0020757616,0.002009767,0.0033455754,0.0046773003,0.012330367,0.005366741,0.009205994,0.002178696],"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.0046264846,0.0008085728,0.024049275,0.0015594615,0.00035238668,0.00061527465,0.0016763471,0.35381776,0.048809916,0.28188634,0.0072416766,0.2745565],"study_design_scores_gemma":[0.00020363128,0.0007502641,0.003208052,0.00038383636,0.00017224488,0.0006002914,0.00026274758,0.69128555,0.056427717,0.23835258,0.008213779,0.0001393253],"about_ca_topic_score_codex":0.0010270086,"about_ca_topic_score_gemma":0.0012900095,"teacher_disagreement_score":0.019101933,"about_ca_system_score_codex":0.0035864026,"about_ca_system_score_gemma":0.0040917057,"threshold_uncertainty_score":0.101021886},"labels":[],"label_agreement":null},{"id":"W2061943950","doi":"10.1007/s00165-010-0157-0","title":"A probability perspective","year":2010,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of California, Irvine; Georgia Institute of Technology","keywords":"Perspective (graphical); Bayesian probability; Computer science; Formalism (music); Equating; Probability theory; Theory of computation; Theoretical computer science; Frequentist probability; Imprecise probability; Mathematics; Artificial intelligence; Algorithm; Statistics","score_opus":0.016045458321300575,"score_gpt":0.25137281756923313,"score_spread":0.23532735924793255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061943950","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.008687112,0.009985128,0.58066195,0.06597537,0.0016121337,0.00007349107,0.00031646757,0.00027513734,0.33241314],"genre_scores_gemma":[0.7903568,0.0119025465,0.1354458,0.0119363805,0.0067590703,0.0002689084,0.00036472586,0.00032722324,0.04263847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939838,0.0029444667,0.0002419065,0.0010572851,0.0014262485,0.0003462244],"domain_scores_gemma":[0.98903614,0.0076880893,0.00046598655,0.0010584868,0.0012018621,0.00054939155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050548445,0.00084959937,0.00080048584,0.0028766354,0.0027589274,0.008035411,0.0019281199,0.0032966938,0.013725632],"category_scores_gemma":[0.010600048,0.0005341603,0.0010814051,0.0017966947,0.015813233,0.019080048,0.0037193296,0.005887819,0.001966115],"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.0000014907264,0.0000016744838,0.000017722452,0.000009416426,0.0000011964418,0.000007448779,0.00005735403,0.00019503986,0.000015665326,0.9981377,0.0005705662,0.000984715],"study_design_scores_gemma":[0.0000027103067,0.0000030361666,0.00002522272,0.000017558341,0.0000019420295,0.000022344919,0.00004557702,0.0010837982,0.000033868873,0.98410255,0.014658441,0.0000030852796],"about_ca_topic_score_codex":0.0027031077,"about_ca_topic_score_gemma":0.0012945918,"teacher_disagreement_score":0.013725632,"about_ca_system_score_codex":0.0046524485,"about_ca_system_score_gemma":0.0022327248,"threshold_uncertainty_score":0.045916855},"labels":[],"label_agreement":null},{"id":"W2071975066","doi":"10.1007/s00165-014-0304-0","title":"Formal probabilistic analysis of detection properties in wireless sensor networks","year":2014,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Wireless sensor network; Computer science; Probabilistic logic; Intrusion detection system; HOL; Probabilistic analysis of algorithms; Theory of computation; Randomness; Event (particle physics); Scheduling (production processes); Automated theorem proving; Distributed computing; Theoretical computer science; Algorithm; Computer network; Data mining; Artificial intelligence; Mathematics","score_opus":0.008872300102288134,"score_gpt":0.20168327551911824,"score_spread":0.19281097541683012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071975066","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.01518989,0.000115407696,0.98218393,0.0002619706,0.000029593053,0.00005311187,0.000052418512,0.0002831897,0.001830557],"genre_scores_gemma":[0.7830647,0.00035324815,0.2142106,0.00021872172,0.00017181374,0.00028895852,0.00014617467,0.00018193015,0.0013638375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99018574,0.0032117784,0.0006035061,0.0010561511,0.0041969637,0.00074584346],"domain_scores_gemma":[0.95687956,0.034262825,0.0036113507,0.0021611569,0.0027434446,0.0003416474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009229672,0.0009303418,0.0006105519,0.0019349599,0.0007518328,0.0028554762,0.002412548,0.0009901102,0.0020847775],"category_scores_gemma":[0.026597315,0.0008171728,0.001827375,0.0012366576,0.0046014143,0.0044655045,0.0021517968,0.002317235,0.00025682052],"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.00006755629,0.00012348128,0.0017606961,0.00020730938,0.00007862613,0.00032478146,0.000272626,0.24387087,0.0059670755,0.7355833,0.0005035274,0.011240194],"study_design_scores_gemma":[0.000025614614,0.000048120102,0.00023721805,0.00003389174,0.00003417033,0.000096704964,0.000033592412,0.78210413,0.0046742978,0.2110141,0.0016768287,0.000021313575],"about_ca_topic_score_codex":0.0015357133,"about_ca_topic_score_gemma":0.0011704587,"teacher_disagreement_score":0.009229672,"about_ca_system_score_codex":0.0022732832,"about_ca_system_score_gemma":0.0018584597,"threshold_uncertainty_score":0.048811793},"labels":[],"label_agreement":null},{"id":"W2074388532","doi":"10.1007/s00165-007-0050-7","title":"Interval timed coloured Petri net: efficient construction of its state class space preserving linear properties","year":2007,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Petri net; Security token; Theory of computation; Computer science; Interval (graph theory); Bounded function; Stochastic Petri net; State space; Contraction (grammar); Theoretical computer science; Class (philosophy); State (computer science); Concurrency; Algorithm; Discrete mathematics; Distributed computing; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.01924687358716634,"score_gpt":0.24514687449924805,"score_spread":0.2259000009120817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074388532","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.024687752,0.000022172726,0.9735935,0.000024606248,0.0000090670965,0.000034105036,0.00004247137,0.00044998946,0.00113633],"genre_scores_gemma":[0.5006733,0.00010991541,0.49677035,0.000045906683,0.000013762461,0.00022652409,0.0003869781,0.00024003933,0.0015331379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932563,0.00020276666,0.000035773417,0.00012498193,0.00022381746,0.00008707348],"domain_scores_gemma":[0.998582,0.000721625,0.00012378817,0.0003104511,0.00017655095,0.00008558976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009874683,0.0004157876,0.0005392308,0.00058591453,0.00037247024,0.0007627266,0.0010210848,0.00034943243,0.00161669],"category_scores_gemma":[0.0025714892,0.00030116655,0.0007150246,0.0006058412,0.0012259433,0.0011733253,0.0013400441,0.0008731988,0.00030680507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0003057856,0.00015335082,0.0015942305,0.00021829245,0.000037923845,0.0003921863,0.00046065677,0.5498924,0.043421604,0.28177497,0.0012179464,0.12053074],"study_design_scores_gemma":[0.000025138226,0.000076357406,0.00015249761,0.000014145513,0.000016480943,0.00006828679,0.00003192301,0.92159283,0.014326337,0.060834095,0.0028479884,0.000013960887],"about_ca_topic_score_codex":0.0018018151,"about_ca_topic_score_gemma":0.0011109593,"teacher_disagreement_score":0.0018018151,"about_ca_system_score_codex":0.0006510849,"about_ca_system_score_gemma":0.0012148161,"threshold_uncertainty_score":0.0054083467},"labels":[],"label_agreement":null},{"id":"W2077894274","doi":"10.1007/s00165-007-0063-2","title":"Contracts for concurrency","year":2008,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Hasler Stiftung; Eidgenössische Technische Hochschule Zürich; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Concurrency; Computer science; Theory of computation; Programming language; Parallel computing","score_opus":0.027059762188727608,"score_gpt":0.25623456008307277,"score_spread":0.22917479789434517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077894274","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.0065514822,0.0009481582,0.95632374,0.004182598,0.00031242674,0.00017705643,0.00016719173,0.0007358562,0.030601421],"genre_scores_gemma":[0.45643392,0.002192058,0.5113173,0.002688872,0.0010126577,0.0010994066,0.00045769292,0.00062416925,0.024173824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99076766,0.0036020316,0.00082724815,0.0011694068,0.0028475467,0.0007860675],"domain_scores_gemma":[0.9870244,0.0066929343,0.0009935928,0.0028473414,0.0017707453,0.00067101134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010352947,0.0007641682,0.0008061389,0.0016301933,0.0027886038,0.0052641626,0.0019146595,0.0024964677,0.0071476437],"category_scores_gemma":[0.012994332,0.000933164,0.0020906217,0.0016257826,0.010808028,0.012071145,0.005187107,0.0052042725,0.0012326809],"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.00000989491,0.000008222397,0.00006266814,0.00002979843,0.0000049104215,0.000058741167,0.0001716365,0.0011824314,0.00016466311,0.99421084,0.0007482745,0.0033479098],"study_design_scores_gemma":[0.00002617882,0.000013319733,0.000032938842,0.000046503737,0.0000084948115,0.00012604144,0.00006462355,0.0071672904,0.00045163094,0.9625358,0.029513529,0.000013801071],"about_ca_topic_score_codex":0.0032325736,"about_ca_topic_score_gemma":0.0015542079,"teacher_disagreement_score":0.010352947,"about_ca_system_score_codex":0.0027893665,"about_ca_system_score_gemma":0.003596257,"threshold_uncertainty_score":0.05475229},"labels":[],"label_agreement":null},{"id":"W2087188285","doi":"10.1007/s00165-008-0073-8","title":"Beyond contracts for concurrency","year":2008,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"SCOOP; Computer science; Concurrency; Atomicity; Programming language; Liveness; Theory of computation; Hoare logic; Semantics (computer science); Separation logic; Theoretical computer science; Database transaction","score_opus":0.022218887839170674,"score_gpt":0.25201120550784656,"score_spread":0.2297923176686759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087188285","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.018233797,0.00065300177,0.96547604,0.0028388526,0.00019399896,0.0000926331,0.00006252943,0.00059136475,0.011857868],"genre_scores_gemma":[0.68845713,0.0010380228,0.29957965,0.0011095694,0.00033161545,0.00031788787,0.0000977657,0.00035214174,0.008716139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99434495,0.0023253006,0.0004129486,0.00073118025,0.0015455822,0.0006400694],"domain_scores_gemma":[0.9873733,0.0068810186,0.00079714286,0.0030242587,0.0014251507,0.00049913116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071550547,0.00045123833,0.0005464517,0.0007959741,0.002026089,0.003541265,0.0013393755,0.0012534633,0.004172211],"category_scores_gemma":[0.01255642,0.00058404787,0.0014971158,0.00077722856,0.009500756,0.009334158,0.0038952944,0.0039958027,0.00049565925],"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.000022530185,0.000010479797,0.00019188407,0.00004262243,0.000008018268,0.00009152815,0.00026094815,0.004031614,0.00063278683,0.9868347,0.0006237173,0.007249186],"study_design_scores_gemma":[0.000018543953,0.00002141822,0.0000546113,0.00003726103,0.000011360084,0.00007427774,0.00006729385,0.022444637,0.0017175985,0.96354395,0.0119946925,0.000014306209],"about_ca_topic_score_codex":0.0032915336,"about_ca_topic_score_gemma":0.0014484111,"teacher_disagreement_score":0.0071550547,"about_ca_system_score_codex":0.0017988064,"about_ca_system_score_gemma":0.0027735177,"threshold_uncertainty_score":0.03784001},"labels":[],"label_agreement":null},{"id":"W2094838194","doi":"10.1007/s001650070035","title":"Algebraic Composition of Function Tables","year":2000,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Composition (language); Theory of computation; Notation; Mathematical proof; Algebra over a field; Representation (politics); Computer science; Function (biology); Mathematics; Theoretical computer science; Algorithm; Pure mathematics; Arithmetic","score_opus":0.012689989583964247,"score_gpt":0.2507308861064802,"score_spread":0.23804089652251595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094838194","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.033614468,0.00026478403,0.9513864,0.00014666072,0.00009875318,0.00010790585,0.0002201527,0.0018849075,0.012275983],"genre_scores_gemma":[0.506736,0.0007105907,0.47352946,0.00024058661,0.00016902781,0.00019012376,0.0014069709,0.0006809847,0.016336266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778277,0.00044964557,0.00020915785,0.00046346826,0.0008873612,0.0002076553],"domain_scores_gemma":[0.99840313,0.0006646153,0.00013081174,0.00027866982,0.00044228486,0.000080485544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014025264,0.0004386728,0.0006599517,0.0014946181,0.0011889368,0.0031770456,0.0009466178,0.00046457027,0.0086047165],"category_scores_gemma":[0.0034908443,0.00046571466,0.0011104102,0.0014161546,0.001596783,0.0052969633,0.0018148939,0.00074886996,0.0018169744],"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.000239984,0.000089360634,0.0014014441,0.00030547305,0.00007178712,0.0004040786,0.0005095118,0.02882071,0.012236285,0.82124656,0.0032626174,0.13141225],"study_design_scores_gemma":[0.000073613075,0.00015435857,0.00054162974,0.000095757445,0.00015071931,0.0005759288,0.00023690365,0.16739874,0.037021987,0.7158284,0.0778515,0.000070405185],"about_ca_topic_score_codex":0.0016789937,"about_ca_topic_score_gemma":0.0014800027,"teacher_disagreement_score":0.0086047165,"about_ca_system_score_codex":0.00097613403,"about_ca_system_score_gemma":0.0012302814,"threshold_uncertainty_score":0.028785586},"labels":[],"label_agreement":null},{"id":"W2127225601","doi":"10.1007/s00165-006-0016-1","title":"Are the Logical Foundations of Verifying Compiler Prototypes Matching user Expectations?","year":2007,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Assertion; Compiler; Programming language; Semantics (computer science); Consistency (knowledge bases); Software engineering; Matching (statistics); Abstract interpretation; Software","score_opus":0.03545459313810563,"score_gpt":0.2909245448275454,"score_spread":0.25546995168943976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127225601","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.18215322,0.00061960606,0.7921838,0.00687728,0.00008573957,0.00027985807,0.0001950632,0.0031344397,0.0144708725],"genre_scores_gemma":[0.78916687,0.00020128203,0.20811325,0.0007978553,0.00004312161,0.00025608682,0.000269982,0.00038537226,0.0007662077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.92027533,0.05096139,0.004945879,0.0035551828,0.018644433,0.0016178141],"domain_scores_gemma":[0.68590856,0.22076133,0.012545355,0.04228623,0.036475994,0.0020224894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.06412879,0.00038678027,0.00078046194,0.002114051,0.0013371859,0.007533325,0.0031750211,0.0030120413,0.0036971238],"category_scores_gemma":[0.25174475,0.0008745768,0.0008049491,0.0013992818,0.006270586,0.015144975,0.002831579,0.0021329466,0.0009584644],"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.0009139372,0.00072788337,0.03322729,0.0008702987,0.00011159898,0.00079022744,0.015586331,0.019426366,0.018222913,0.7312144,0.006481781,0.172427],"study_design_scores_gemma":[0.00022559019,0.0008382688,0.0048855958,0.0007922866,0.00011942344,0.001183882,0.011071096,0.18822733,0.04219211,0.7124997,0.03779286,0.0001719842],"about_ca_topic_score_codex":0.001127979,"about_ca_topic_score_gemma":0.00093482144,"teacher_disagreement_score":0.06412879,"about_ca_system_score_codex":0.0020725904,"about_ca_system_score_gemma":0.002739209,"threshold_uncertainty_score":0.33914948},"labels":[],"label_agreement":null},{"id":"W2128416870","doi":"10.1007/s00165-005-0083-8","title":"Constructing checking sequences for distributed testing","year":2006,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Observability; Controllability; Computer science; Sequence (biology); Finite-state machine; Theory of computation; Synchronization (alternating current); Automaton; Model checking; Implementation; State (computer science); Sequence diagram; Observable; Reset (finance); Distributed computing; Programming language; Theoretical computer science; Unified Modeling Language; Mathematics; Software","score_opus":0.023429877115581837,"score_gpt":0.25895384582965925,"score_spread":0.2355239687140774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128416870","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.041369542,0.00004627491,0.9549347,0.000072916206,0.000031935644,0.00018220075,0.00005735738,0.001999913,0.0013050266],"genre_scores_gemma":[0.3429168,0.000051915453,0.6547126,0.000057839807,0.000026173253,0.0003027858,0.00035026457,0.00023535518,0.0013462756],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962251,0.0014309997,0.00034886991,0.00065446773,0.0010929278,0.00024760625],"domain_scores_gemma":[0.9810404,0.011875452,0.0013709742,0.0030743412,0.0021899834,0.00044879006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035996775,0.00075766357,0.00064515043,0.00143991,0.00084721047,0.0009056743,0.001210687,0.0009583494,0.0029121202],"category_scores_gemma":[0.013913869,0.00059053727,0.00074274844,0.000706617,0.0019139807,0.0016380161,0.0016123158,0.0015799527,0.00065721286],"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.0011253239,0.00059625995,0.0067106183,0.0006416083,0.00007510799,0.0015298297,0.001712985,0.17560638,0.06326568,0.2819869,0.0029301485,0.4638192],"study_design_scores_gemma":[0.00019409077,0.00072053145,0.00090640783,0.00022237489,0.00007876491,0.0006147409,0.00021376183,0.6400704,0.11652376,0.22518247,0.015198302,0.0000744734],"about_ca_topic_score_codex":0.0009892602,"about_ca_topic_score_gemma":0.00093741465,"teacher_disagreement_score":0.0035996775,"about_ca_system_score_codex":0.00077218306,"about_ca_system_score_gemma":0.0016304114,"threshold_uncertainty_score":0.019037127},"labels":[],"label_agreement":null},{"id":"W2134071215","doi":"10.1007/s00165-003-0024-3","title":"ERC – An object-oriented refinement calculus for Eiffel","year":2004,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Eiffel; Refinement calculus; Computer science; Programming language; Executable; Notation; Unified Modeling Language; Process calculus; Context (archaeology); Object-oriented programming; Algorithm; Software; Theoretical computer science; Mathematics","score_opus":0.023043907709131232,"score_gpt":0.3050553951612518,"score_spread":0.28201148745212057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134071215","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.0028333797,0.0001762376,0.98876953,0.00019290292,0.00014696192,0.00011561373,0.00011582219,0.0016657835,0.00598373],"genre_scores_gemma":[0.08278589,0.00044719156,0.9085692,0.00032579803,0.00016482432,0.00032328608,0.00043645682,0.0005104576,0.0064367745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995961,0.0009365225,0.00039937525,0.00036255424,0.0019843157,0.0003562325],"domain_scores_gemma":[0.9958104,0.0021042686,0.00033373298,0.00065649307,0.0009318385,0.00016335763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008207604,0.0006190107,0.0009896891,0.0022631139,0.0013525737,0.0026543734,0.0018653681,0.00168251,0.003929259],"category_scores_gemma":[0.009115773,0.00092532183,0.002193574,0.0015847643,0.002856496,0.0031587337,0.0019239556,0.0023791895,0.0015511513],"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.00006031512,0.0000509756,0.00019738337,0.00018857242,0.00003155981,0.0004440478,0.0003815645,0.024628866,0.0042034322,0.9293912,0.0036742305,0.03674779],"study_design_scores_gemma":[0.0001826582,0.00007406774,0.00023158637,0.00018494285,0.000089737354,0.00048165902,0.00011805983,0.19031526,0.012251619,0.65693533,0.13902125,0.00011387079],"about_ca_topic_score_codex":0.0044824844,"about_ca_topic_score_gemma":0.003391464,"teacher_disagreement_score":0.008207604,"about_ca_system_score_codex":0.0019012124,"about_ca_system_score_gemma":0.0016859816,"threshold_uncertainty_score":0.043406487},"labels":[],"label_agreement":null},{"id":"W2147045827","doi":"10.1007/s00165-005-0082-9","title":"A formal approach to property testing in causally consistent distributed traces","year":2006,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"TRACE (psycholinguistics); Computer science; Theory of computation; Automaton; Property (philosophy); Consistency (knowledge bases); Model checking; Causality (physics); Theoretical computer science; Programming language; Event (particle physics); Formal methods; Artificial intelligence","score_opus":0.01893584562270784,"score_gpt":0.22398797159533837,"score_spread":0.20505212597263053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147045827","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.0033904444,0.000030995896,0.9954092,0.00013044759,0.00001164362,0.000057806436,0.00003715714,0.0004495361,0.00048276086],"genre_scores_gemma":[0.25721428,0.0001394321,0.7404323,0.00016363848,0.00007630121,0.00042240304,0.00020956605,0.00019860303,0.0011434855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918521,0.00319804,0.00069760374,0.00092651515,0.0027168323,0.0006088904],"domain_scores_gemma":[0.9756335,0.016399056,0.0015159597,0.0035345983,0.0025421334,0.00037472628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009056193,0.0009722299,0.0008222097,0.0023990201,0.0011616925,0.0034338422,0.0034600315,0.0015332592,0.0027961258],"category_scores_gemma":[0.023964746,0.001025356,0.0017926139,0.0015469533,0.0074780425,0.0054109273,0.0029181659,0.0030800414,0.0003068343],"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.000071633716,0.00016503928,0.0011925087,0.00014966186,0.000052088555,0.0005570883,0.0007520736,0.13625692,0.004845046,0.8306402,0.0005704399,0.024747184],"study_design_scores_gemma":[0.000053825654,0.000060227394,0.00014494434,0.00008937421,0.000033433415,0.00015598469,0.00010658151,0.6078041,0.007305249,0.37757862,0.006632859,0.00003481123],"about_ca_topic_score_codex":0.0045642783,"about_ca_topic_score_gemma":0.0035578692,"teacher_disagreement_score":0.009056193,"about_ca_system_score_codex":0.0023905684,"about_ca_system_score_gemma":0.0036038926,"threshold_uncertainty_score":0.0478943},"labels":[],"label_agreement":null},{"id":"W2163743319","doi":"10.1007/s00165-005-0079-4","title":"The verified software repository: a step towards the verifying compiler","year":2006,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade Federal de Pernambuco; University of Illinois at Urbana-Champaign; London South Bank University; McMaster University","keywords":"Computer science; Compiler; Dependability; Software engineering; Software development; Software; Programming language","score_opus":0.010244577768595116,"score_gpt":0.21701436317577175,"score_spread":0.20676978540717664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163743319","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.0028664668,0.000391352,0.97094506,0.0029593797,0.00080715853,0.00026111587,0.00021915705,0.018680757,0.002869571],"genre_scores_gemma":[0.023588749,0.00045255397,0.96420413,0.0008914916,0.0002644045,0.00019957649,0.0010622931,0.0058080796,0.0035287046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9653279,0.013511583,0.004032985,0.0024589438,0.013218112,0.0014504746],"domain_scores_gemma":[0.8961848,0.029976573,0.004476908,0.04033286,0.025978139,0.0030507538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04252172,0.0011145486,0.0019165257,0.004028948,0.0018939648,0.009123042,0.007580749,0.004160102,0.008851981],"category_scores_gemma":[0.0779206,0.002248044,0.002384811,0.0024584387,0.004360734,0.023160806,0.008308786,0.011609228,0.009292349],"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.0005048435,0.00060782407,0.0023046595,0.00089389173,0.00010923124,0.0012493691,0.0014032841,0.024111982,0.0119126905,0.49135932,0.077096164,0.38844678],"study_design_scores_gemma":[0.00043645632,0.000680329,0.000649972,0.0015070292,0.00016826506,0.0014994196,0.0005044893,0.18821198,0.044359002,0.2509538,0.51068765,0.00034160513],"about_ca_topic_score_codex":0.0021679,"about_ca_topic_score_gemma":0.0011553592,"teacher_disagreement_score":0.04252172,"about_ca_system_score_codex":0.0019760525,"about_ca_system_score_gemma":0.011737059,"threshold_uncertainty_score":0.22487903},"labels":[],"label_agreement":null},{"id":"W2334113034","doi":"10.1007/s00165-016-0367-1","title":"On the formal analysis of Gaussian optical systems in HOL","year":2016,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Gaussian beam; Computer science; Pathfinder; Gaussian; Optics; Automated theorem proving; HOL; Transformation (genetics); Beam (structure); Physics; Theoretical computer science; Programming language","score_opus":0.012538693863415691,"score_gpt":0.24390707376104223,"score_spread":0.23136837989762654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2334113034","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.051516574,0.00045539413,0.9375534,0.0011607518,0.000042735403,0.0001291677,0.0002963976,0.00082267093,0.008022893],"genre_scores_gemma":[0.75759506,0.00064062595,0.23611078,0.000528682,0.00017939652,0.00022483451,0.0005448855,0.00024510614,0.003930568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953294,0.0015257305,0.00044410815,0.00049759366,0.001608092,0.0005950786],"domain_scores_gemma":[0.9847782,0.010975165,0.0009570468,0.0015974079,0.0013790493,0.00031317736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00751276,0.000586341,0.00061531964,0.0020702523,0.0015632794,0.0050642826,0.0019544563,0.00086905644,0.0030445866],"category_scores_gemma":[0.011049904,0.000575645,0.001803878,0.0024191064,0.005290889,0.008076491,0.0035073028,0.0021069169,0.0003956031],"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.000030408622,0.000041837102,0.0005658855,0.000075200216,0.000015002152,0.00016782261,0.0005713549,0.011053305,0.00076843624,0.9784958,0.0004339523,0.007780948],"study_design_scores_gemma":[0.00003723684,0.000037013328,0.00038105657,0.0000542821,0.000035139663,0.00012481936,0.00026076188,0.11438462,0.0024377285,0.8743015,0.0079177385,0.000028163247],"about_ca_topic_score_codex":0.00591773,"about_ca_topic_score_gemma":0.004065986,"teacher_disagreement_score":0.00751276,"about_ca_system_score_codex":0.0031613233,"about_ca_system_score_gemma":0.002098778,"threshold_uncertainty_score":0.03973174},"labels":[],"label_agreement":null},{"id":"W2595059463","doi":"10.1007/s00165-017-0424-4","title":"Synthesizing and verifying controllers for multi-lane traffic maneuvers","year":2017,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Deutsche Forschungsgemeinschaft","keywords":"Theory of computation; Interleaving; Controller (irrigation); Computer science; Semantics (computer science); Finite-state machine; State (computer science); Transition system; Distributed computing; Control theory (sociology); Control (management); Control engineering; Real-time computing; Theoretical computer science; Programming language; Artificial intelligence; Engineering","score_opus":0.0643636300957055,"score_gpt":0.3309971874528164,"score_spread":0.2666335573571109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595059463","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.072883956,0.00004198988,0.9236758,0.00009708077,0.000028248585,0.00014486059,0.000052153588,0.0017027867,0.0013731786],"genre_scores_gemma":[0.8465016,0.000047493755,0.15235342,0.000047756635,0.000008752662,0.00013241479,0.00009315566,0.00013183942,0.0006836095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976981,0.00060659304,0.00019660353,0.00043328703,0.00081793393,0.00024751993],"domain_scores_gemma":[0.99464095,0.0033444823,0.00050182303,0.00087495876,0.00054765487,0.00009011335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002783305,0.0006084179,0.000557749,0.00050201314,0.00068018865,0.001279781,0.0013502365,0.0010565051,0.00195584],"category_scores_gemma":[0.007439815,0.00060829095,0.0011163381,0.00026300803,0.0020810014,0.0013790262,0.0017242087,0.0011016374,0.00026356732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00023896857,0.00025694273,0.0029425484,0.00043532465,0.00010067291,0.0006920247,0.0007399199,0.77819467,0.058110487,0.10874011,0.0005450003,0.04900323],"study_design_scores_gemma":[0.00005124689,0.000076869386,0.0001645043,0.000021572301,0.000031849973,0.000042058047,0.000057741152,0.93986666,0.035291985,0.02323893,0.0011438217,0.000012864282],"about_ca_topic_score_codex":0.003273155,"about_ca_topic_score_gemma":0.0037638703,"teacher_disagreement_score":0.003273155,"about_ca_system_score_codex":0.0009463816,"about_ca_system_score_gemma":0.0024598446,"threshold_uncertainty_score":0.014719665},"labels":[],"label_agreement":null},{"id":"W2603330110","doi":"10.1007/s00165-017-0426-2","title":"Simulation relations for fault-tolerance","year":2017,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Fondo para la Investigación Científica y Tecnológica","keywords":"Liveness; Fault tolerance; Computer science; Software fault tolerance; Theory of computation; Distributed computing; Fault coverage; Fault model; Relation (database); Fault (geology); Reliability engineering; Theoretical computer science; Algorithm; Data mining; Engineering","score_opus":0.04085635996822392,"score_gpt":0.345178802840271,"score_spread":0.3043224428720471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603330110","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.024420178,0.0002243957,0.9687584,0.00022248898,0.000047839792,0.00007342949,0.00006606187,0.00056550134,0.0056217373],"genre_scores_gemma":[0.76834494,0.00035031573,0.22675572,0.00019564989,0.00008822232,0.00032543307,0.00020207583,0.00027359638,0.003464016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963626,0.0014199091,0.00036802236,0.00059923163,0.00092616415,0.00032411548],"domain_scores_gemma":[0.993686,0.003663546,0.00062875566,0.0011680053,0.0006879304,0.00016577399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029657756,0.00077057653,0.0004152556,0.0010252261,0.00072955375,0.0015439322,0.0011080523,0.0008652061,0.0033434997],"category_scores_gemma":[0.0061252974,0.00036095653,0.0011791072,0.00064782257,0.004549775,0.0031915999,0.0016136457,0.001966405,0.000554301],"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.00004815205,0.000025012565,0.00038184316,0.000057549394,0.000018017454,0.0000959685,0.0003499051,0.04262083,0.0049488647,0.9453267,0.00030054105,0.00582646],"study_design_scores_gemma":[0.000038327464,0.00011122671,0.0002610235,0.000060134127,0.00004244345,0.00020597324,0.00014034934,0.20969632,0.01532766,0.75345165,0.020629324,0.000035663237],"about_ca_topic_score_codex":0.0014102637,"about_ca_topic_score_gemma":0.0009767578,"teacher_disagreement_score":0.0033434997,"about_ca_system_score_codex":0.0014275116,"about_ca_system_score_gemma":0.0009177375,"threshold_uncertainty_score":0.015684724},"labels":[],"label_agreement":null},{"id":"W2768544685","doi":"10.1007/s00165-017-0441-3","title":"Variability-based model transformation: formal foundation and application","year":2017,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"Horizon 2020","keywords":"Correctness; Computer science; Theory of computation; Transformation (genetics); Theoretical computer science; Representation (politics); Set (abstract data type); Key (lock); Component (thermodynamics); ENCODE; Model transformation; Programming language; Artificial intelligence","score_opus":0.011394905461693406,"score_gpt":0.2523440443564946,"score_spread":0.24094913889480118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768544685","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.002648606,0.00006199529,0.99563295,0.0001466524,0.000016443655,0.000035211382,0.000017769913,0.00028671365,0.0011536502],"genre_scores_gemma":[0.20018204,0.00032803285,0.79758614,0.00011341594,0.00006853951,0.00019583254,0.00013187986,0.00021305522,0.0011811194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974491,0.0007463814,0.00024829022,0.0003541118,0.0010676717,0.00013443535],"domain_scores_gemma":[0.99270964,0.004323787,0.0005198926,0.0014069736,0.00091893744,0.000120839286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036422384,0.00040458812,0.00041717137,0.001279132,0.0006452562,0.002303942,0.0016706843,0.0010475372,0.00253373],"category_scores_gemma":[0.0095324395,0.0004865338,0.0012546147,0.0016865806,0.004278257,0.002242199,0.0025230893,0.0027818785,0.00053035404],"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.000022943965,0.00006645366,0.0004266741,0.000092742725,0.000019882136,0.0002176323,0.00029236695,0.083177984,0.004477166,0.8682547,0.00091339496,0.042038053],"study_design_scores_gemma":[0.000022292414,0.00003319546,0.00013502523,0.00008223426,0.000017737148,0.0001937289,0.000050898274,0.48691002,0.006390653,0.4924441,0.013691631,0.000028476943],"about_ca_topic_score_codex":0.0015783868,"about_ca_topic_score_gemma":0.0010601842,"teacher_disagreement_score":0.0036422384,"about_ca_system_score_codex":0.0011727096,"about_ca_system_score_gemma":0.0013156678,"threshold_uncertainty_score":0.019262195},"labels":[],"label_agreement":null},{"id":"W2883153098","doi":"10.1007/s00165-018-0460-8","title":"Parameterized verification of monotone information systems","year":2018,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Parameterized complexity; Theory of computation; Computer science; State space; Theoretical computer science; Computability; Notation; State (computer science); Mathematics; Algebra over a field; Discrete mathematics; Programming language; Algorithm; Pure mathematics; Arithmetic","score_opus":0.018896035897974454,"score_gpt":0.2746004658031187,"score_spread":0.25570442990514425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883153098","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.08774035,0.00013520215,0.90781957,0.00035606636,0.000028242535,0.00012187489,0.00021131159,0.0009948496,0.0025925215],"genre_scores_gemma":[0.86956155,0.0001354365,0.12887596,0.0000712652,0.000031238866,0.00016950759,0.00029505976,0.00011100718,0.00074908213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99090236,0.0038884878,0.0006691425,0.001288568,0.0025667422,0.0006846079],"domain_scores_gemma":[0.9724777,0.019113066,0.0017651756,0.0039564497,0.0022938666,0.00039378635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059354594,0.0006072677,0.00088564586,0.0009210211,0.0007208037,0.0021504038,0.0018396308,0.00095219223,0.0027749809],"category_scores_gemma":[0.02515253,0.0006430252,0.0017615947,0.00090072816,0.002454738,0.0059979097,0.0028505547,0.0018908465,0.00024879046],"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.00045469517,0.00016401114,0.0024678712,0.00035888123,0.00015806586,0.0007657254,0.00043738744,0.31251886,0.02819072,0.61117756,0.0009081727,0.042397935],"study_design_scores_gemma":[0.000056578476,0.00008483195,0.0003007165,0.000042754942,0.000034521072,0.00010673299,0.000061002072,0.76187986,0.016204389,0.21925864,0.0019447351,0.000025298195],"about_ca_topic_score_codex":0.002052786,"about_ca_topic_score_gemma":0.0013926731,"teacher_disagreement_score":0.0059354594,"about_ca_system_score_codex":0.001968731,"about_ca_system_score_gemma":0.0024537223,"threshold_uncertainty_score":0.03139007},"labels":[],"label_agreement":null},{"id":"W2921097798","doi":"10.1007/s00165-019-00480-5","title":"A modeling and verification framework for optical quantum circuits","year":2019,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Concordia University","funders":"","keywords":"Theory of computation; Computer science; Electronic circuit; Quantum; Theoretical computer science; Programming language; Physics; Quantum mechanics","score_opus":0.012930044559586967,"score_gpt":0.24794604474985685,"score_spread":0.23501600019026989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921097798","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.0038142612,0.00013480894,0.99287075,0.00034804738,0.000025448833,0.00009008329,0.000077990626,0.0003308745,0.0023077524],"genre_scores_gemma":[0.3169477,0.00054742803,0.6769676,0.00033720463,0.00015186572,0.0004921996,0.00031839238,0.00019658302,0.0040410166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967411,0.0012384033,0.00019095775,0.00043487575,0.0010124041,0.00038233952],"domain_scores_gemma":[0.9966568,0.001939388,0.00028286592,0.00055159914,0.00044252316,0.00012673515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004271494,0.001090792,0.0006936378,0.0015540776,0.0013352927,0.0030155142,0.002726262,0.0015093029,0.0035246192],"category_scores_gemma":[0.00615261,0.00088145497,0.0029752152,0.0010776314,0.0045992327,0.004889464,0.0026556463,0.0030450153,0.0005772774],"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.000015816735,0.000038130056,0.00013461543,0.00006286823,0.000017269698,0.00011699586,0.0001639474,0.055510372,0.0013269589,0.935173,0.00053340365,0.0069066645],"study_design_scores_gemma":[0.000030281395,0.000032817243,0.000070960115,0.00005512073,0.00002990096,0.00009480049,0.000066954955,0.38070667,0.0025136692,0.60402423,0.012350803,0.000023716853],"about_ca_topic_score_codex":0.007873957,"about_ca_topic_score_gemma":0.006222265,"teacher_disagreement_score":0.007873957,"about_ca_system_score_codex":0.0031191304,"about_ca_system_score_gemma":0.0035789027,"threshold_uncertainty_score":0.02263093},"labels":[],"label_agreement":null},{"id":"W2948911651","doi":"10.1007/s00165-019-00484-1","title":"A verification-driven framework for iterative design of controllers","year":2019,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Horizon 2020 Framework Programme","keywords":"Computer science; Correctness; Iterative and incremental development; Modular design; Reuse; Scalability; Component (thermodynamics); Process (computing); Rework; Formal verification; Systems engineering; Software engineering; Distributed computing; Programming language; Embedded system; Engineering","score_opus":0.028276755830070117,"score_gpt":0.2995027640333482,"score_spread":0.2712260082032781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948911651","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.0040227487,0.00009319541,0.99357986,0.000070955335,0.00001317831,0.00016290921,0.000031261625,0.001161285,0.0008645894],"genre_scores_gemma":[0.108892374,0.00011373381,0.8892879,0.00007286944,0.000013642376,0.00029973732,0.0001687747,0.0002993872,0.00085154304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9890882,0.0050029242,0.0007769395,0.00087914907,0.003538468,0.00071439554],"domain_scores_gemma":[0.9846845,0.008881564,0.0009971128,0.0026137624,0.0024645969,0.00035857345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014841719,0.0014857373,0.00085991353,0.0018295253,0.0010730599,0.0023330606,0.0038048232,0.0020931163,0.0039350875],"category_scores_gemma":[0.01950228,0.0015771112,0.0024979785,0.0005382423,0.00342445,0.002266514,0.0037235902,0.0029268642,0.00078009465],"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.00020730127,0.0002477331,0.0018135306,0.00073810556,0.00014070478,0.0007155841,0.0010415144,0.64421135,0.023491366,0.20396852,0.0017345581,0.12168971],"study_design_scores_gemma":[0.000093939416,0.00017907865,0.00016403885,0.00020661755,0.000049525403,0.00017444718,0.000056664845,0.92615527,0.014875813,0.043260578,0.014724619,0.00005937231],"about_ca_topic_score_codex":0.0059760427,"about_ca_topic_score_gemma":0.005235401,"teacher_disagreement_score":0.014841719,"about_ca_system_score_codex":0.0022459817,"about_ca_system_score_gemma":0.005013297,"threshold_uncertainty_score":0.07849145},"labels":[],"label_agreement":null},{"id":"W2981749759","doi":"10.1007/s00165-019-00493-0","title":"Multiple model synchronization with multiary delta lenses with amendment andK-Putput","year":2019,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Compatibility (geochemistry); Binary number; Synchronization (alternating current); Consistency (knowledge bases); Lens (geology); Theory of computation; Composition (language); Underpinning; Theoretical computer science; Through-the-lens metering; Algorithm; Law; Mathematics; Artificial intelligence; Telecommunications; Physics; Arithmetic; Optics; Political science; Engineering","score_opus":0.006390746909799914,"score_gpt":0.19712678776019513,"score_spread":0.19073604085039522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981749759","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.04505748,0.00012631957,0.94402444,0.00053461886,0.00012860334,0.00010754139,0.0000592657,0.0012236317,0.008738045],"genre_scores_gemma":[0.7688849,0.00012784357,0.22084145,0.00027150105,0.000103509745,0.00016079018,0.000098118515,0.00037810803,0.009133794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950192,0.0012617192,0.00042550347,0.0009619241,0.0017318382,0.0005998415],"domain_scores_gemma":[0.9922321,0.0022642883,0.00088715844,0.002925506,0.0012145324,0.00047649755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044880975,0.0006600605,0.0009980191,0.0012067943,0.0014840184,0.0044715838,0.0018775575,0.0016120471,0.007656869],"category_scores_gemma":[0.01241513,0.0007336141,0.0013502326,0.0010422693,0.0040448084,0.0075243562,0.007256678,0.0029757724,0.00091141113],"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.00023619723,0.00009172578,0.0017884177,0.00010185103,0.00004759828,0.00060831103,0.00079196226,0.035077743,0.008302283,0.92275745,0.0008677266,0.029328743],"study_design_scores_gemma":[0.00009089931,0.00015821417,0.0004422263,0.00008057134,0.000073072806,0.00049336685,0.0003982064,0.38364136,0.034448866,0.56344515,0.016647473,0.00008054476],"about_ca_topic_score_codex":0.0018346894,"about_ca_topic_score_gemma":0.0015309484,"teacher_disagreement_score":0.007656869,"about_ca_system_score_codex":0.0020953324,"about_ca_system_score_gemma":0.0018687014,"threshold_uncertainty_score":0.025614798},"labels":[],"label_agreement":null},{"id":"W2999627722","doi":"10.1007/s00165-019-00502-2","title":"Correction to: Multiple model synchronizationwith multiary delta lenses with amendment andK-Putput","year":2020,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Theory of computation; Amendment; Delta; Computer science; Mathematics; Political science; Law; Algorithm; Physics","score_opus":0.013551040505382996,"score_gpt":0.2039885824714296,"score_spread":0.1904375419660466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999627722","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003229826,0.0006352797,0.0050226403,0.021095049,0.96654296,0.000037736536,0.0013501594,0.0023874666,0.0026058655],"genre_scores_gemma":[0.092247285,0.005985615,0.051259458,0.05238375,0.3212369,0.0004976848,0.009348364,0.010672619,0.4563683],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946824,0.00068702945,0.0009265893,0.001009863,0.0020252531,0.00066893257],"domain_scores_gemma":[0.96380746,0.0066728806,0.0019819683,0.0042643365,0.021664353,0.0016090241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028310367,0.003966015,0.0037994012,0.0049033086,0.0058466005,0.005216915,0.0050563295,0.010375571,0.19561398],"category_scores_gemma":[0.0613882,0.0020188573,0.0026924158,0.0051802457,0.003112242,0.0056627807,0.0043350654,0.010745538,0.09191235],"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.00013939365,0.000016132262,0.0001337726,0.00024557897,0.000032293534,0.00041728123,0.00010311192,0.0002417866,0.0003497775,0.0036558877,0.98379403,0.010870975],"study_design_scores_gemma":[0.00010189395,0.000058110712,0.0014258649,0.00024352435,0.000043660184,0.000908416,0.00023983051,0.003054869,0.0022879757,0.0047034407,0.9868107,0.00012170303],"about_ca_topic_score_codex":0.020685567,"about_ca_topic_score_gemma":0.027407074,"teacher_disagreement_score":0.19561398,"about_ca_system_score_codex":0.005615162,"about_ca_system_score_gemma":0.0046232333,"threshold_uncertainty_score":0.6543939},"labels":[],"label_agreement":null},{"id":"W3003857160","doi":"10.1007/s00165-019-00503-1","title":"Formal reliability and failure analysis of ethernet based communication networks in a smart grid substation","year":2020,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Smart grid; Ethernet; Reliability block diagram; Computer science; Telecommunications network; Reliability (semiconductor); Reliability engineering; Embedded system; Fault tree analysis; Transformer; Automation; Distributed computing; Computer network; Engineering; Electrical engineering; Voltage","score_opus":0.018513417091901543,"score_gpt":0.26544738332224643,"score_spread":0.2469339662303449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003857160","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.09550147,0.000091123526,0.9011768,0.00013537607,0.00001229608,0.00003722164,0.000057069286,0.00028443194,0.0027042315],"genre_scores_gemma":[0.9567487,0.000076963464,0.041941036,0.000025456848,0.000015163794,0.000052307932,0.000055222587,0.00003588488,0.001049248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998978,0.0004414937,0.000045177443,0.00009947681,0.00033610236,0.000099792946],"domain_scores_gemma":[0.99686795,0.0022959313,0.00031430705,0.00020135862,0.00027566013,0.000044774042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001595347,0.0003752727,0.00030232072,0.0009033766,0.00031680637,0.0006595121,0.00062401575,0.00036920386,0.0013927766],"category_scores_gemma":[0.0049970015,0.00020520676,0.0006520437,0.0003637688,0.0017032227,0.0011031743,0.00071010273,0.0006815893,0.00010718784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.000057421938,0.000048396338,0.0015245572,0.000066808534,0.00002678834,0.00026162787,0.00025893343,0.66634333,0.005504701,0.31414673,0.00030240198,0.011458417],"study_design_scores_gemma":[0.000007496921,0.000014372368,0.00016637113,0.0000068529107,0.0000064771143,0.000019509062,0.000019235453,0.943435,0.0016050364,0.05430808,0.00040673852,0.000004845572],"about_ca_topic_score_codex":0.0039882604,"about_ca_topic_score_gemma":0.0019240049,"teacher_disagreement_score":0.0039882604,"about_ca_system_score_codex":0.001277921,"about_ca_system_score_gemma":0.000710211,"threshold_uncertainty_score":0.009272039},"labels":[],"label_agreement":null},{"id":"W3143871025","doi":"10.1007/s00165-005-0082-8","title":"A formal approach to property testing in causally consistent distributed traces","year":2006,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"TRACE (psycholinguistics); Computer science; Theory of computation; Property (philosophy); Automaton; Consistency (knowledge bases); Model checking; Causality (physics); Theoretical computer science; Programming language; Property testing; Event (particle physics); Relation (database); Algorithm; Data mining; Artificial intelligence","score_opus":0.025169513752820116,"score_gpt":0.2376320665976636,"score_spread":0.21246255284484347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143871025","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.0008203975,0.000036613776,0.9982887,0.000108446315,0.000011303824,0.000050287897,0.000026730811,0.00023052907,0.0004269354],"genre_scores_gemma":[0.08939059,0.00023423141,0.90792,0.0001581667,0.000093942326,0.000505062,0.00018668076,0.0001583336,0.0013529134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992644,0.0026628596,0.0007065754,0.0009943468,0.0024419688,0.0005502697],"domain_scores_gemma":[0.9809656,0.012734949,0.0013049239,0.0027647507,0.0018446725,0.00038507977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008665362,0.0013833487,0.0010289081,0.0028684048,0.0017186401,0.0040071234,0.004454415,0.0019588917,0.0037770437],"category_scores_gemma":[0.021948954,0.0012159188,0.0026369246,0.0022696662,0.008567495,0.0069828616,0.0033585746,0.0048007523,0.00057824055],"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.000032148084,0.00012478298,0.0006502703,0.00015403291,0.000038217448,0.0003736208,0.0006025088,0.06016042,0.0033474118,0.91186947,0.00062022544,0.02202689],"study_design_scores_gemma":[0.00004912179,0.00009526277,0.00018703092,0.00015931192,0.000051241877,0.00035244488,0.00016626598,0.35981658,0.0063949144,0.61710864,0.015561826,0.00005729036],"about_ca_topic_score_codex":0.0045657344,"about_ca_topic_score_gemma":0.0038988595,"teacher_disagreement_score":0.008665362,"about_ca_system_score_codex":0.0027732342,"about_ca_system_score_gemma":0.004768277,"threshold_uncertainty_score":0.04582739},"labels":[],"label_agreement":null},{"id":"W4245689528","doi":"10.1007/s00165-011-0201-8","title":"Editorial","year":2011,"lang":"es","type":"editorial","venue":"Formal Aspects of Computing","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Citation; Library science; Computer science; Service (business); World Wide Web; Business","score_opus":0.014092320756301456,"score_gpt":0.24407012863423289,"score_spread":0.22997780787793143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245689528","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.000045185236,0.0027261544,0.00014351323,0.019645752,0.9714446,0.000019618654,0.00008681769,0.000077944685,0.0058103465],"genre_scores_gemma":[0.00067759806,0.0037846132,0.00014262149,0.01337199,0.9446965,0.000025390194,0.0001179612,0.00007900282,0.03710439],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972128,0.0002796712,0.00033048427,0.00046887438,0.0014967158,0.00021144783],"domain_scores_gemma":[0.98656505,0.0033091465,0.0007253521,0.0005849949,0.007010005,0.0018053883],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027671733,0.001936045,0.001861737,0.0023376467,0.0023257502,0.005575067,0.0020269656,0.006321861,0.045660544],"category_scores_gemma":[0.015740449,0.0006224675,0.0013599622,0.001106848,0.0013482589,0.0035448472,0.0010934825,0.008636209,0.03959663],"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.000013402526,0.0000049745895,0.000010554402,0.000072217445,0.0000038683474,0.00004997269,0.0000054558536,0.000011019414,0.000037248912,0.00023274646,0.9948356,0.00472286],"study_design_scores_gemma":[0.000012706899,0.000007745719,0.00009498146,0.0001435499,0.00000909206,0.0001528206,0.000015186353,0.000039929633,0.00008159477,0.00046582188,0.9989711,0.000005395731],"about_ca_topic_score_codex":0.00083248276,"about_ca_topic_score_gemma":0.0017132742,"teacher_disagreement_score":0.95433944,"about_ca_system_score_codex":0.0016527065,"about_ca_system_score_gemma":0.0017660613,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4399262243","doi":"10.1145/3670419","title":"On Formal Methods Thinking in Computer Science Education","year":2024,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Theory of computation; Curriculum; Computational thinking; Formal methods; Quality (philosophy); Formal semantics (linguistics); Mathematics education; Semantics (computer science); Simple (philosophy); Logical reasoning; Formal education; Philosophy of science; Programming language; Artificial intelligence; Epistemology; Pedagogy; Sociology; Psychology","score_opus":0.018694913544956324,"score_gpt":0.3182641761029621,"score_spread":0.29956926255800576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399262243","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.0053160777,0.11658355,0.32394552,0.23056372,0.0064106975,0.00013707149,0.000105887906,0.000528064,0.3164094],"genre_scores_gemma":[0.37138146,0.19640957,0.25561625,0.060660858,0.0133309495,0.0012019185,0.0003094836,0.000792524,0.100297004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932335,0.0039991513,0.00032315616,0.0005077424,0.0015778728,0.00035864813],"domain_scores_gemma":[0.97721046,0.019412197,0.00061809696,0.00090912665,0.0012759995,0.00057416776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012752685,0.0007112625,0.00058185786,0.0027674353,0.0026819066,0.0061769546,0.0012190812,0.0033612251,0.0075679454],"category_scores_gemma":[0.01459343,0.00043282183,0.000646621,0.0027917908,0.02415385,0.0112818815,0.0034067172,0.007860179,0.001836353],"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.0000043914015,0.00001759352,0.00008811042,0.00012630169,0.0000027882477,0.000017763125,0.0012610316,0.00031197368,0.000068611036,0.96808505,0.007201331,0.02281512],"study_design_scores_gemma":[0.0000073934657,0.000016463035,0.00011577807,0.00064795377,0.0000028396119,0.000053479285,0.00047106223,0.00045026062,0.00009891914,0.86772525,0.13039912,0.00001148814],"about_ca_topic_score_codex":0.0030319788,"about_ca_topic_score_gemma":0.002517926,"teacher_disagreement_score":0.012752685,"about_ca_system_score_codex":0.0057962416,"about_ca_system_score_gemma":0.005157563,"threshold_uncertainty_score":0.06744343},"labels":[],"label_agreement":null},{"id":"W4407039025","doi":"10.1145/3709600","title":"Introduction to the Special Collection from FM 2023","year":2025,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Formal methods; Computer science; Software engineering; Software; Software development; Theory of computation; Library science; Engineering management; Programming language; Engineering","score_opus":0.0054782864139669325,"score_gpt":0.22166192698026108,"score_spread":0.21618364056629413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407039025","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.0013393024,0.036698278,0.020368315,0.062322125,0.52875865,0.00064764434,0.00871556,0.0040234677,0.33712667],"genre_scores_gemma":[0.006179887,0.02274521,0.010286673,0.029470464,0.24870938,0.000817757,0.017443895,0.0048568817,0.65948987],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996563,0.0006013191,0.00037074325,0.0005112667,0.0016380706,0.00031555022],"domain_scores_gemma":[0.9925015,0.0017389206,0.00047858094,0.00071631215,0.0033115433,0.0012531176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003321605,0.0020505064,0.0015568134,0.006285451,0.0024027354,0.006449884,0.002141875,0.0027225579,0.19199625],"category_scores_gemma":[0.012890927,0.0006450797,0.0013969012,0.0048636566,0.001091828,0.0056713736,0.0042324457,0.00400093,0.13478518],"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.000020860314,0.000009044147,0.000032314816,0.000106784995,0.0000020175123,0.000025116022,0.000022282013,0.000024514422,0.00016057852,0.0016868091,0.969533,0.028376615],"study_design_scores_gemma":[0.000002403029,0.000011131157,0.00012651076,0.00008138773,0.0000014206797,0.000062994804,0.00001269292,0.000025549163,0.00005076345,0.0006505788,0.99897003,0.000004584436],"about_ca_topic_score_codex":0.0034370893,"about_ca_topic_score_gemma":0.0058655194,"teacher_disagreement_score":0.19199625,"about_ca_system_score_codex":0.0027052553,"about_ca_system_score_gemma":0.0026543192,"threshold_uncertainty_score":0.6422914},"labels":[],"label_agreement":null},{"id":"W4408218751","doi":"10.1145/3721143","title":"Memory Consistency and Program Transformations","year":2025,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Sequential consistency; Consistency (knowledge bases); Computer science; Consistency model; Programming language; Causal consistency; Parallel computing; Artificial intelligence","score_opus":0.009103749864728304,"score_gpt":0.2683146532359275,"score_spread":0.25921090337119923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408218751","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.028512556,0.00042907038,0.9472561,0.0011496056,0.00009117841,0.00015805352,0.00018016949,0.0017751659,0.020448118],"genre_scores_gemma":[0.6004562,0.0007524023,0.38259408,0.00087967626,0.00024352982,0.0006069003,0.00046708898,0.0011628323,0.0128373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625766,0.0011126341,0.0003146522,0.0007137107,0.0011402486,0.00046113555],"domain_scores_gemma":[0.99521554,0.0020157436,0.00048071917,0.0017235504,0.00047750477,0.00008692293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002758934,0.0005089966,0.0005300935,0.0007485043,0.0009215316,0.0023429238,0.0014570972,0.0010643901,0.0033188472],"category_scores_gemma":[0.009239999,0.000503732,0.0013662812,0.0007727403,0.004257895,0.0044993046,0.0030315164,0.002743974,0.00066023535],"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.00006616626,0.000058279762,0.0006797728,0.00015516729,0.000029343077,0.00015430491,0.0005213863,0.021175396,0.0054596076,0.9371518,0.0012358568,0.03331289],"study_design_scores_gemma":[0.000030389112,0.000056541674,0.00024748634,0.000057159632,0.00004014325,0.00015409614,0.00012444655,0.036547784,0.010664018,0.9342012,0.017854935,0.000021862961],"about_ca_topic_score_codex":0.0024752931,"about_ca_topic_score_gemma":0.0017242285,"teacher_disagreement_score":0.0033188472,"about_ca_system_score_codex":0.0014156894,"about_ca_system_score_gemma":0.0024395115,"threshold_uncertainty_score":0.0145908},"labels":[],"label_agreement":null}]}