{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009008898,0.00005084814,0.97817814,0.0001831186,0.00058030355,0.0003020297,5.5696097e-7,0.000085343876,0.011610772],"genre_scores_gemma":[0.9616016,3.4850532e-7,0.03815916,0.000016752407,0.00016994729,0.0000071626428,0.000008340325,0.000005251534,0.000031392836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897945,0.000027187614,0.00033777984,0.0001939041,0.0001808803,0.00028080124],"domain_scores_gemma":[0.9992213,0.000092100745,0.0001587563,0.00026158825,0.00018504712,0.000081179525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042099916,0.00008804663,0.0001671053,0.00012308419,0.00009517618,0.00008384932,0.00048994436,0.000044595374,0.0000014859589],"category_scores_gemma":[0.00010094179,0.00007880779,0.000054310512,0.0003845055,0.000029600433,0.00037262758,0.00013619523,0.00007943918,0.00001032495],"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.0000028211366,0.000035182977,0.0005503171,0.000012736012,0.0000050841404,0.0000013321513,0.0013344204,0.00074021955,0.000026860593,0.9867799,0.000113940194,0.010397162],"study_design_scores_gemma":[0.0013734483,0.0003182884,0.012165274,0.0000067573633,0.0000070189935,0.000041951218,0.0005178422,0.26821727,0.0010359377,0.7048899,0.011129452,0.00029688605],"about_ca_topic_score_codex":0.00006973843,"about_ca_topic_score_gemma":0.00006140007,"teacher_disagreement_score":0.95259273,"about_ca_system_score_codex":0.0000648757,"about_ca_system_score_gemma":0.00013295078,"threshold_uncertainty_score":0.3213688},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13012876,0.000013648842,0.8635404,0.00014446999,0.00039854617,0.00035599418,0.0000015270776,0.00011027303,0.0053063617],"genre_scores_gemma":[0.54551744,5.7055337e-7,0.45431614,0.00006435625,0.0000652367,0.000012118314,0.0000018921058,0.000004993678,0.000017248274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875104,0.000031226773,0.00039866735,0.00022164639,0.00022784474,0.00036956408],"domain_scores_gemma":[0.99895746,0.00009814779,0.000254986,0.0004225094,0.0002052861,0.00006160552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005498059,0.00011746614,0.00016987229,0.0000963797,0.00012353044,0.000082098384,0.0007536439,0.000041512543,0.000019493951],"category_scores_gemma":[0.00008113686,0.00010828707,0.00008005896,0.00017721622,0.000021016765,0.00085227424,0.0003329759,0.00008133139,0.00002788787],"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.0000037179698,0.000057343837,0.00042893915,0.00011274434,0.000016467333,3.7694514e-7,0.0006099318,0.00055838586,0.0013712146,0.71103734,0.0002400951,0.28556344],"study_design_scores_gemma":[0.00054945616,0.00052867405,0.038895793,0.00008715042,0.0000058438645,0.000011016556,0.000092832146,0.89347106,0.048859116,0.016134908,0.0010984498,0.0002656692],"about_ca_topic_score_codex":0.000041606534,"about_ca_topic_score_gemma":0.0000014672343,"teacher_disagreement_score":0.8929127,"about_ca_system_score_codex":0.000034797722,"about_ca_system_score_gemma":0.000030197478,"threshold_uncertainty_score":0.44158188},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44285926,0.00006278868,0.5491812,0.000022353259,0.00031391034,0.000115912626,8.6532395e-7,0.000055786055,0.007387913],"genre_scores_gemma":[0.5753933,9.0283896e-7,0.4245175,0.000009531968,0.00007029876,6.6038416e-7,0.0000010478425,0.000003052473,0.0000036735585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880546,0.000071094044,0.00041917805,0.00012003791,0.00028784902,0.00029637862],"domain_scores_gemma":[0.99891806,0.00010866268,0.00048621357,0.00029130408,0.00014436101,0.0000513999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012315735,0.00009557908,0.00018005713,0.00012602273,0.00009587091,0.000025362755,0.000569863,0.00004512969,0.000002461715],"category_scores_gemma":[0.00014649237,0.00008858722,0.000050754137,0.00030541726,0.00006962468,0.0017290871,0.00028188483,0.00010222446,0.000003922224],"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.000010239832,0.0001961784,0.008819379,0.0003312186,0.000021282673,0.0000010107043,0.006419623,0.0008620476,0.012755602,0.7150545,0.000011853027,0.25551707],"study_design_scores_gemma":[0.00024378557,0.00020422842,0.049471606,0.00014075692,0.0000083962495,0.000032979708,0.00016200489,0.6213952,0.32591784,0.002046509,0.00018530538,0.00019140195],"about_ca_topic_score_codex":0.00001896744,"about_ca_topic_score_gemma":8.212504e-7,"teacher_disagreement_score":0.713008,"about_ca_system_score_codex":0.000028775965,"about_ca_system_score_gemma":0.000043354707,"threshold_uncertainty_score":0.3612482},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27827957,0.00001602861,0.720951,0.000030816576,0.00039834736,0.00011751395,0.000002345055,0.00017791339,0.00002646598],"genre_scores_gemma":[0.49922955,7.346599e-7,0.50069594,0.0000130275885,0.000050326646,0.0000012584803,4.30869e-7,0.000006196575,0.0000025418994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990871,0.000019179068,0.0002302762,0.00022482556,0.000108001324,0.0003305983],"domain_scores_gemma":[0.99838525,0.0009883255,0.000111891604,0.00030193359,0.00014800248,0.00006462205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044347573,0.00012729615,0.00019791894,0.00006888123,0.00013707258,0.00007617267,0.0002652365,0.00006262124,3.072624e-7],"category_scores_gemma":[0.0005861986,0.00012056138,0.00003916203,0.00015035187,0.00005521491,0.0010350953,0.00037577495,0.00018088179,3.6336317e-7],"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.000011827447,0.000031786498,0.00008931391,0.00011404972,0.000024756748,0.00011578794,0.0015100065,0.43218535,0.0022004794,0.5123795,0.000017685594,0.05131943],"study_design_scores_gemma":[0.00027210222,0.00008129173,0.00009149045,0.000014433344,0.0000061564424,0.000503287,0.000020713376,0.959603,0.0046748393,0.034472447,0.00010424197,0.00015595942],"about_ca_topic_score_codex":0.00001141481,"about_ca_topic_score_gemma":0.0000071046347,"teacher_disagreement_score":0.52741766,"about_ca_system_score_codex":0.00000605699,"about_ca_system_score_gemma":0.00002934906,"threshold_uncertainty_score":0.49163502},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32372683,0.000071451774,0.6663898,0.0000724856,0.00052585284,0.0002177211,2.962933e-7,0.00017825348,0.008817283],"genre_scores_gemma":[0.54836136,0.0000014233774,0.45156875,0.000006468181,0.000049801063,0.0000029759842,0.00000100364,0.0000038407843,0.0000044025487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99869674,0.00010186817,0.0005287052,0.00014864781,0.00023676227,0.00028725027],"domain_scores_gemma":[0.9989567,0.000045723085,0.00044254356,0.00038103305,0.0001377131,0.000036317066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012223747,0.00010401404,0.00019751402,0.00023121446,0.00004902623,0.000015256932,0.0004364057,0.000074783806,0.000013986103],"category_scores_gemma":[0.000089253794,0.0001004772,0.00003838892,0.00077248557,0.00005861381,0.0013328727,0.00015329885,0.00012174706,0.000006076393],"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.00000526655,0.00015845268,0.0006896038,0.00013012404,0.0000065906984,2.6245147e-7,0.0015138461,0.00022344972,0.015628105,0.8469974,0.000010185667,0.13463676],"study_design_scores_gemma":[0.00033330717,0.0002460005,0.20226881,0.00026200697,0.000010985653,0.000058310558,0.00016899977,0.30103505,0.4781452,0.016953956,0.00017001819,0.00034733233],"about_ca_topic_score_codex":0.000020235162,"about_ca_topic_score_gemma":2.0763122e-7,"teacher_disagreement_score":0.8300434,"about_ca_system_score_codex":0.00006677355,"about_ca_system_score_gemma":0.000033465763,"threshold_uncertainty_score":0.40973413},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022094138,0.00024190357,0.9945876,0.00024439962,0.00008332812,0.0003598894,0.0000071017594,0.0004268461,0.0018395088],"genre_scores_gemma":[0.51222765,0.0000052552386,0.4876378,0.000045319972,0.00003551678,0.000009108047,0.0000099914205,0.000006145653,0.000023188442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986163,0.00002466044,0.00040371108,0.00031563014,0.00019163705,0.0004480541],"domain_scores_gemma":[0.9991227,0.00011112044,0.00023638392,0.00027253863,0.00016791321,0.00008933804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037019225,0.0001604783,0.00024848554,0.00009384277,0.00027384033,0.0001456451,0.00045324475,0.000058441285,0.000008397307],"category_scores_gemma":[0.000083624065,0.00015437318,0.00006251102,0.00033005228,0.000036595273,0.0003686034,0.00040113597,0.000095872565,0.0000019830609],"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.000022018745,0.00032754868,0.0004243309,0.00032615868,0.00008291712,0.000008513386,0.0016587191,0.07952551,0.000118655946,0.7185144,0.0035381697,0.19545309],"study_design_scores_gemma":[0.0005650658,0.00024797983,0.0003199154,0.00008952576,0.000007149067,0.000017431174,0.000016730488,0.9912839,0.00026227647,0.0026406678,0.004358026,0.00019132205],"about_ca_topic_score_codex":0.000015486505,"about_ca_topic_score_gemma":8.9899027e-7,"teacher_disagreement_score":0.9117584,"about_ca_system_score_codex":0.00003069422,"about_ca_system_score_gemma":0.000020006402,"threshold_uncertainty_score":0.6295155},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.221822,0.000026004287,0.77697253,0.00010808576,0.000020386931,0.00008452662,0.0000012662164,0.0003339658,0.00063121866],"genre_scores_gemma":[0.77513766,3.491597e-7,0.22479008,0.00005066412,0.000013429818,7.131783e-7,0.0000034496604,0.0000030248616,6.3671155e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891984,0.00003173051,0.00040840422,0.00012341396,0.00030543603,0.00021115017],"domain_scores_gemma":[0.99920917,0.00013707714,0.00022886858,0.0002955188,0.000100723715,0.000028651151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046589397,0.000109597815,0.00025604514,0.00030235556,0.00008463622,0.000033857665,0.000624201,0.000036589376,0.000002793108],"category_scores_gemma":[0.000012174967,0.00008461025,0.00016379745,0.0010520212,0.000024158157,0.00033280763,0.000053775562,0.00010377943,5.297919e-7],"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.0000029876217,0.000068736874,0.0004619732,0.00004699367,0.0001214234,0.000001977721,0.0032478597,0.33897635,0.0010834605,0.40983593,0.000006233202,0.24614604],"study_design_scores_gemma":[0.00009254009,0.000115412025,0.02789969,0.000047629706,0.000044354558,0.0000012708086,0.000014244518,0.95242375,0.019000575,0.00025620707,0.000017394852,0.00008690147],"about_ca_topic_score_codex":0.000020527334,"about_ca_topic_score_gemma":0.0000025376248,"teacher_disagreement_score":0.6134474,"about_ca_system_score_codex":0.000020616537,"about_ca_system_score_gemma":0.000035324385,"threshold_uncertainty_score":0.34503058},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018192783,0.000020354668,0.9651887,0.00016409064,0.000027706139,0.015931716,0.0000018347415,0.000080601625,0.0003922223],"genre_scores_gemma":[0.6795712,0.000001276787,0.31956735,0.00002244284,0.000027135697,0.00080386805,0.00000170318,0.0000043816144,6.161964e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987437,0.00003590139,0.0005002207,0.00027964177,0.00021618005,0.00022432291],"domain_scores_gemma":[0.9984381,0.0001848504,0.0005934433,0.00047914562,0.00025195215,0.000052490366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044877705,0.000119117,0.00021603052,0.00013856318,0.00008601939,0.000043515665,0.0004892621,0.00006442526,0.0000018002899],"category_scores_gemma":[0.00015600547,0.00011948513,0.0000664938,0.0004155686,0.0001003805,0.0004860443,0.00007435123,0.000103242404,9.455222e-7],"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.000023327826,0.00009438461,0.000110236164,0.0001338242,0.0000041165595,9.135848e-8,0.00095934665,0.000086814194,0.0019309834,0.9587858,5.2426407e-7,0.03787059],"study_design_scores_gemma":[0.00036505822,0.00040503065,0.016055461,0.00024053945,0.000004096736,0.0000033437743,0.000028914192,0.061481576,0.032849118,0.88839567,0.00005798279,0.00011320898],"about_ca_topic_score_codex":4.85785e-7,"about_ca_topic_score_gemma":9.887073e-8,"teacher_disagreement_score":0.66137844,"about_ca_system_score_codex":0.000015258744,"about_ca_system_score_gemma":0.00003572871,"threshold_uncertainty_score":0.48724622},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01829912,0.0000098719875,0.9773069,0.00049983925,0.00024808449,0.001885636,0.0000029283847,0.00021482691,0.0015327937],"genre_scores_gemma":[0.6152011,4.583584e-8,0.38450262,0.00007125501,0.000047317684,0.00015735033,0.0000121589355,0.0000066271855,0.0000014831189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983582,0.00012656528,0.00059640006,0.0002530505,0.0003482722,0.000317542],"domain_scores_gemma":[0.9982863,0.000095947755,0.0005172788,0.00078419084,0.0002576677,0.000058588925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024441127,0.00015886297,0.00019029979,0.00016269747,0.00036050088,0.00014683607,0.001079903,0.000068486115,1.4913218e-7],"category_scores_gemma":[0.00018366461,0.00011867614,0.00007426484,0.0005117594,0.000041616062,0.001098193,0.00014336371,0.000099630306,0.000019536385],"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.00003557759,0.00002604564,0.00001054246,0.0004444403,0.000007837957,1.180081e-8,0.0021952656,0.09225628,0.00055807346,0.6896072,0.000012631478,0.21484607],"study_design_scores_gemma":[0.00028272864,0.00018955498,0.0010663053,0.000084622676,0.000006050285,0.0000033779438,0.0003072165,0.98024493,0.014888313,0.0009854041,0.0017912734,0.00015023336],"about_ca_topic_score_codex":0.000007992255,"about_ca_topic_score_gemma":0.0000022137529,"teacher_disagreement_score":0.8879886,"about_ca_system_score_codex":0.00014960777,"about_ca_system_score_gemma":0.0000762896,"threshold_uncertainty_score":0.48394725},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19559027,0.000063999105,0.8030466,0.000023829374,0.00010158009,0.00007211796,1.6987003e-7,0.00026405542,0.00083737954],"genre_scores_gemma":[0.58654326,0.0000086783475,0.4134196,0.000007527778,0.000011380746,0.0000030862564,3.559698e-7,0.000004306928,0.0000018280485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920243,0.00001913561,0.00021556768,0.0001890004,0.00016791183,0.00020598069],"domain_scores_gemma":[0.9994834,0.000024630883,0.00008878246,0.00030270123,0.00005510689,0.00004539903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034566535,0.00009564967,0.00012284593,0.000091129514,0.000072944444,0.000034833112,0.0002445225,0.00002162696,0.0000013766996],"category_scores_gemma":[0.00001274477,0.0000997241,0.000024936155,0.00017567755,0.000015525533,0.00059195166,0.00014822207,0.0000812716,0.0000016852974],"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":[6.3504376e-7,0.000013876876,0.00017650568,0.00002959716,0.0000055016394,0.0000019546123,0.00054393406,0.0017812831,0.00078419945,0.94216144,0.000007390617,0.054493677],"study_design_scores_gemma":[0.0007678638,0.00046120008,0.019243918,0.00036671516,0.0000147022765,0.00006216784,0.000047727284,0.641306,0.2844985,0.0112323845,0.041199513,0.000799301],"about_ca_topic_score_codex":0.0000070123324,"about_ca_topic_score_gemma":2.809626e-7,"teacher_disagreement_score":0.93092906,"about_ca_system_score_codex":0.000026049238,"about_ca_system_score_gemma":0.000017673006,"threshold_uncertainty_score":0.4066631},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44945005,0.000009502976,0.5406587,0.000030270028,0.000033545577,0.008612584,7.144461e-7,0.000034605604,0.0011700288],"genre_scores_gemma":[0.9836528,2.4363447e-7,0.015461665,0.000008501719,0.000013602863,0.0008537366,6.3675594e-7,0.0000044944736,0.0000043514265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983525,0.00013049305,0.00062856916,0.00027597466,0.0003632932,0.00024915728],"domain_scores_gemma":[0.99837095,0.00013425777,0.00054888806,0.000687046,0.00022253474,0.00003635106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003993771,0.00011130745,0.00029413425,0.00035834574,0.00014152665,0.000013849333,0.0009064107,0.000038122147,0.0000037534599],"category_scores_gemma":[0.0000849742,0.000088648354,0.0002099244,0.0040477673,0.00013979894,0.00020207033,0.0005173253,0.00014045155,0.0000026009416],"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.000028631379,0.0008638103,0.13626352,0.00017231904,0.00010673126,0.0000040251525,0.010995303,0.22840564,0.0013065891,0.6177188,0.000004435062,0.0041301735],"study_design_scores_gemma":[0.00044734546,0.00006073867,0.38134208,0.000092507325,0.00001158055,0.00000405174,0.00004890099,0.5943174,0.015657216,0.0079077445,0.000009783633,0.0001006784],"about_ca_topic_score_codex":0.000018565155,"about_ca_topic_score_gemma":0.000018944296,"teacher_disagreement_score":0.60981107,"about_ca_system_score_codex":0.00003380966,"about_ca_system_score_gemma":0.00008678314,"threshold_uncertainty_score":0.3614975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.442781,0.000057493624,0.55691016,0.00011201505,0.00001797129,0.000075175645,6.6189784e-7,0.000022793392,0.000022743223],"genre_scores_gemma":[0.9000921,0.0000029622302,0.099847645,0.0000129205855,0.000040062405,5.5813024e-7,4.197346e-7,0.0000021754329,0.0000011609726],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992524,0.00004155928,0.00018183597,0.00016951337,0.00020724762,0.0001474565],"domain_scores_gemma":[0.99907297,0.0004908627,0.00007790373,0.0002468188,0.00006448165,0.000046991576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055646646,0.00006435577,0.0001385268,0.00018466645,0.00006850474,0.000050928837,0.00027089202,0.000022982373,7.0061714e-7],"category_scores_gemma":[0.000108350454,0.000051706884,0.000027805281,0.00073565094,0.000020318508,0.0001582954,0.00011827289,0.00007120992,9.5231024e-7],"study_design_candidate":"design_other","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.00009345154,0.00011507402,0.005814006,0.000043509543,0.00040467706,0.000008167652,0.019826028,0.16457716,0.11417582,0.018843492,0.000048644568,0.67604995],"study_design_scores_gemma":[0.0001634341,0.00022237725,0.5070409,0.000020211388,0.000021357584,0.0000037321338,0.000074179894,0.43316314,0.055409126,0.0037705665,0.00002474008,0.00008625357],"about_ca_topic_score_codex":0.00004373968,"about_ca_topic_score_gemma":0.0000068046734,"teacher_disagreement_score":0.6759637,"about_ca_system_score_codex":0.000016210806,"about_ca_system_score_gemma":0.0000114497525,"threshold_uncertainty_score":0.21085455},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15378232,0.000017369632,0.77136177,0.000031621632,0.0004519252,0.00008191121,2.0707772e-7,0.00011547018,0.07415741],"genre_scores_gemma":[0.66618234,6.2215804e-7,0.33369496,0.00008309273,0.000022825805,5.982511e-7,2.5781645e-7,0.0000055600453,0.000009768748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987739,0.00009025658,0.00029712298,0.00022563514,0.00028130508,0.00033180488],"domain_scores_gemma":[0.9991338,0.00012251438,0.00018851562,0.0004387775,0.00006219462,0.000054195723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007846151,0.00012235907,0.00015774246,0.000118323405,0.00014805533,0.000054288314,0.0005499734,0.000047988644,0.0000073242763],"category_scores_gemma":[0.00018824135,0.00011840625,0.00006715735,0.0003419112,0.00003513158,0.00053515995,0.00013603907,0.00015748083,0.00002828456],"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.0000027956096,0.000028025654,0.00009469748,0.000020430012,0.000006949897,0.0000023412579,0.00035478838,0.002599328,0.00034112835,0.98927534,0.000019457677,0.0072546927],"study_design_scores_gemma":[0.0014661427,0.0012136837,0.016561171,0.00031696525,0.000013440728,0.00014681637,0.00029572335,0.4257947,0.24764556,0.30380502,0.0018425063,0.0008982865],"about_ca_topic_score_codex":0.0000029810883,"about_ca_topic_score_gemma":4.312243e-7,"teacher_disagreement_score":0.68547034,"about_ca_system_score_codex":0.000045332104,"about_ca_system_score_gemma":0.000041799085,"threshold_uncertainty_score":0.48284668},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3094477,0.00004760323,0.6499107,0.0000885673,0.0004330731,0.00015524848,7.380821e-7,0.00030365237,0.039612696],"genre_scores_gemma":[0.8725232,9.032761e-7,0.12701212,0.000068520436,0.00031509728,0.000001599088,0.0000019520278,0.000021170434,0.000055460674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736047,0.00016512889,0.0007580929,0.0004768989,0.0005319547,0.00070747605],"domain_scores_gemma":[0.997763,0.0005907481,0.00055329705,0.0007695894,0.00016697399,0.00015643603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017668742,0.00025916382,0.00050801225,0.0002303177,0.0003042338,0.00033033537,0.0012458133,0.00010056993,0.000013716855],"category_scores_gemma":[0.00035719655,0.0002525215,0.00019221182,0.00044024468,0.000054248165,0.0016658057,0.00061096775,0.00021928601,0.00023316915],"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.000053014715,0.00037164983,0.0001965974,0.0004088313,0.00018422175,0.00005035753,0.0025389292,0.02354966,0.03876322,0.4116099,0.0003197566,0.5219539],"study_design_scores_gemma":[0.00075368537,0.00037925324,0.00027673424,0.00034116395,0.000011547194,0.000103657614,0.000046135472,0.9631885,0.026319942,0.007611281,0.00059020094,0.00037784866],"about_ca_topic_score_codex":0.000055266595,"about_ca_topic_score_gemma":0.0000019939237,"teacher_disagreement_score":0.9396389,"about_ca_system_score_codex":0.00007385118,"about_ca_system_score_gemma":0.00009883136,"threshold_uncertainty_score":0.9999927},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53676516,0.00010081761,0.427908,0.00026156873,0.00034633288,0.00012198124,7.4991846e-7,0.0034121813,0.031083174],"genre_scores_gemma":[0.87147814,0.0000013609946,0.1282906,0.00015324607,0.00006526981,3.0974556e-7,4.503586e-7,0.0000046236737,0.0000060076027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987211,0.000026005175,0.00036647762,0.00022741365,0.0003427554,0.0003162166],"domain_scores_gemma":[0.9988706,0.00025518014,0.00031350972,0.000389501,0.00012452266,0.000046682388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005171874,0.00013776025,0.0002455193,0.0001594608,0.00011811194,0.000052708132,0.0007533006,0.000052075582,0.0000019690247],"category_scores_gemma":[0.00022372171,0.0001240387,0.00008944876,0.00036777186,0.00005475712,0.00035637652,0.00015431487,0.00015089818,0.0000029211135],"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.000029407294,0.00035297766,0.0022435235,0.00009320941,0.000028360542,0.00004509968,0.002394162,0.0026019798,0.0019418902,0.5231649,0.0009593487,0.4661451],"study_design_scores_gemma":[0.00075342157,0.004955353,0.04280179,0.0019308816,0.000016911787,0.00011940702,0.00003473968,0.33312485,0.14750856,0.4676234,0.00028283463,0.00084785966],"about_ca_topic_score_codex":0.000027759208,"about_ca_topic_score_gemma":5.068068e-7,"teacher_disagreement_score":0.46529725,"about_ca_system_score_codex":0.000026599986,"about_ca_system_score_gemma":0.00006354132,"threshold_uncertainty_score":0.5058152},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4956946,0.000029534382,0.4728661,0.00047775696,0.00094937754,0.00034881177,0.0000016234378,0.0003878729,0.029244324],"genre_scores_gemma":[0.7726162,2.493437e-7,0.22710672,0.000047081616,0.00020979105,0.000002542048,5.648954e-7,0.000008510889,0.000008318261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976735,0.00007360897,0.0005077005,0.00063724816,0.00048691925,0.000620984],"domain_scores_gemma":[0.99766314,0.00031146858,0.00026878438,0.0010044118,0.00059443107,0.00015774672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011003494,0.00024122394,0.0003690844,0.00014422514,0.00022518542,0.00012518292,0.0015808297,0.00010343772,0.00002642479],"category_scores_gemma":[0.00041120034,0.00022291747,0.00018974554,0.0006415297,0.00020504658,0.00082972867,0.0014288233,0.000575479,0.000027891681],"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.0000071483837,0.00027723052,0.0014973751,0.00004058925,0.000020833326,0.000009226801,0.0027753843,0.00065262005,0.0014202982,0.95674914,0.000021075872,0.03652905],"study_design_scores_gemma":[0.0005914558,0.00038990597,0.055427387,0.000026057718,0.000008535003,0.000118880605,0.00018548651,0.43137687,0.00884669,0.502273,0.00029604312,0.0004596507],"about_ca_topic_score_codex":0.00011539631,"about_ca_topic_score_gemma":0.00007016567,"teacher_disagreement_score":0.45447612,"about_ca_system_score_codex":0.000096529126,"about_ca_system_score_gemma":0.0002150795,"threshold_uncertainty_score":0.9090311},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5151939,0.000019132987,0.48374352,0.000008513372,0.00013923082,0.00009721376,2.2687959e-7,0.00006325656,0.000735058],"genre_scores_gemma":[0.99338084,0.0000025090035,0.0064870855,0.00002018895,0.00008433035,0.0000030993585,0.0000029438752,0.0000131398365,0.000005844432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976288,0.00015141106,0.00080795406,0.00037015608,0.0004013545,0.0006403319],"domain_scores_gemma":[0.9984659,0.0002345985,0.0005135255,0.0005018021,0.00021370455,0.000070455484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091234467,0.00021401128,0.00060420245,0.0005977702,0.000124273,0.000050399965,0.0006642745,0.00011470061,0.000001503728],"category_scores_gemma":[0.00007826308,0.00019281071,0.0001924185,0.0022168956,0.000104544226,0.0005527408,0.00040755735,0.00024101837,8.838535e-7],"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.00001973656,0.000091986316,0.0015985878,0.000056777702,0.00007952007,0.0000017974236,0.00043058526,0.93963045,0.00074772525,0.026368419,3.3701377e-7,0.030974103],"study_design_scores_gemma":[0.0003136718,0.00017892357,0.020212475,0.0001225233,0.000059858045,0.0000052170726,0.00004033457,0.9712422,0.0075320276,0.00008856752,0.0000038705416,0.0002003225],"about_ca_topic_score_codex":0.00011426657,"about_ca_topic_score_gemma":0.00024867375,"teacher_disagreement_score":0.478187,"about_ca_system_score_codex":0.00006211682,"about_ca_system_score_gemma":0.00002938924,"threshold_uncertainty_score":0.78625923},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5483851,0.00020804934,0.44842198,0.00004347475,0.0005279884,0.00022484982,0.0000015197912,0.00010707895,0.0020799895],"genre_scores_gemma":[0.9275795,0.000002895022,0.07223118,0.000013771098,0.00011725703,9.960407e-7,9.943076e-7,0.000015792471,0.000037605383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972014,0.00009377253,0.0009986416,0.0003684209,0.00070347165,0.00063428265],"domain_scores_gemma":[0.9978719,0.00020576674,0.00078595907,0.0004543883,0.0005702396,0.00011177978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018945991,0.000221555,0.00045078387,0.00036382955,0.00016363108,0.00006492186,0.0010182998,0.000083216095,0.0000036532374],"category_scores_gemma":[0.00019535646,0.00020345984,0.00012005155,0.0007782363,0.00010413998,0.00048870855,0.0010206981,0.0002567806,0.000007924823],"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.00029226186,0.0002600111,0.001195034,0.0012410632,0.00016382681,0.00004267048,0.012704466,0.88181865,0.037946843,0.03411069,0.00005421922,0.030170262],"study_design_scores_gemma":[0.00052563596,0.00020920264,0.0007657359,0.0005460679,0.000007060115,0.000056260364,0.00027290804,0.86070824,0.13657169,0.00009882247,0.000057917132,0.00018043461],"about_ca_topic_score_codex":0.000035226123,"about_ca_topic_score_gemma":0.000009829529,"teacher_disagreement_score":0.37919444,"about_ca_system_score_codex":0.000115912815,"about_ca_system_score_gemma":0.00014464681,"threshold_uncertainty_score":0.82968515},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03934171,0.00025458858,0.939253,0.00005167713,0.0008569217,0.00032326888,6.996959e-7,0.0001750594,0.019743087],"genre_scores_gemma":[0.98505014,0.0000028961201,0.014597621,0.000052753952,0.00023049362,0.000004073397,0.0000025483566,0.0000066946473,0.000052778913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987771,0.000021752374,0.00035460133,0.00021846818,0.0002084383,0.00041963346],"domain_scores_gemma":[0.99907213,0.0001608329,0.00025574677,0.00025000938,0.00018220325,0.00007905939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003374023,0.00012271892,0.00025369946,0.0000654476,0.00024134923,0.000039863222,0.0005592637,0.00005192012,0.000002392976],"category_scores_gemma":[0.00007464132,0.00010631098,0.00011482663,0.00016970164,0.000056484158,0.00044324357,0.0001574182,0.00008497459,0.000016350827],"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.000004552159,0.00005343483,0.0006032654,0.000045374287,0.00001668822,0.000011508786,0.0011782529,0.00007594046,0.00013132535,0.96830964,0.00024045314,0.02932956],"study_design_scores_gemma":[0.009245312,0.004058338,0.035579782,0.00012477319,0.00005090126,0.001340394,0.00036793968,0.5775374,0.05123758,0.23281594,0.08547432,0.0021673394],"about_ca_topic_score_codex":0.000025910043,"about_ca_topic_score_gemma":0.000002603832,"teacher_disagreement_score":0.94570845,"about_ca_system_score_codex":0.000017366818,"about_ca_system_score_gemma":0.0000912691,"threshold_uncertainty_score":0.4335236},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042889144,0.00032496304,0.9203636,0.00006172267,0.0010599451,0.00037094209,0.000001059901,0.00018125385,0.034747377],"genre_scores_gemma":[0.9840688,0.0000030547692,0.015514847,0.00006981792,0.00026639542,0.0000045067927,0.000003545125,0.00000768241,0.00006135054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865717,0.000023579005,0.0003870894,0.00024215762,0.00023302295,0.00045700572],"domain_scores_gemma":[0.9989868,0.00017580541,0.00028107362,0.0002695565,0.0001977673,0.000089044326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036724337,0.00013732484,0.00027887255,0.00007392976,0.0002699075,0.000046215508,0.00059573783,0.000058864738,0.0000028435252],"category_scores_gemma":[0.00007267529,0.00011988703,0.00012371124,0.0001862365,0.000065514614,0.0004932605,0.00017630398,0.000096081276,0.000016857814],"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.0000047462972,0.000055338194,0.0005490663,0.00004519763,0.000018062645,0.000012291519,0.0012567078,0.000070025555,0.00013827033,0.9693675,0.00028966335,0.028193146],"study_design_scores_gemma":[0.008776738,0.0038687752,0.026588725,0.00009953444,0.000054446682,0.0012449163,0.00036314255,0.41250056,0.046823535,0.44337496,0.05421786,0.0020868026],"about_ca_topic_score_codex":0.000024541123,"about_ca_topic_score_gemma":0.0000032835167,"teacher_disagreement_score":0.94117963,"about_ca_system_score_codex":0.000019301104,"about_ca_system_score_gemma":0.000099718825,"threshold_uncertainty_score":0.4888851},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37359053,0.00004792099,0.6116895,0.00002041497,0.00017968878,0.00008820514,0.0000011362945,0.00008041255,0.014302199],"genre_scores_gemma":[0.74418515,0.0000034577547,0.25570855,0.000030017041,0.00004847392,8.547021e-7,0.0000048027214,0.0000048718325,0.000013844465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876106,0.0000723214,0.00045138877,0.00018790929,0.0002876168,0.00023973278],"domain_scores_gemma":[0.9991509,0.00006751777,0.00027230944,0.0003475163,0.00012077985,0.00004099363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005487703,0.0001073801,0.00019937905,0.000120276105,0.00011173336,0.000028754026,0.0004775411,0.00005245993,0.000065073844],"category_scores_gemma":[0.000017801645,0.00010794006,0.000071854614,0.00044473732,0.000057987523,0.0009993816,0.000105302955,0.000100138444,0.000022085056],"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.00003600719,0.00009503494,0.000147377,0.00008184825,0.000019701074,8.222603e-7,0.00059127586,0.0070874183,0.009155689,0.66510725,0.00003122641,0.31764638],"study_design_scores_gemma":[0.00059770944,0.0006436624,0.03984799,0.00017888875,0.000019219735,0.000039113253,0.000050768886,0.74586123,0.18709117,0.024854353,0.0005376747,0.00027824097],"about_ca_topic_score_codex":0.000024663059,"about_ca_topic_score_gemma":7.4424804e-7,"teacher_disagreement_score":0.73877376,"about_ca_system_score_codex":0.000025123274,"about_ca_system_score_gemma":0.000032863958,"threshold_uncertainty_score":0.4401668},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18062712,0.00007924452,0.8112173,0.000076949116,0.00028880374,0.00039669045,3.2004957e-7,0.000094984,0.0072185774],"genre_scores_gemma":[0.9822018,4.234851e-7,0.017593035,0.000044225286,0.00013278393,0.000005305044,0.000001728193,0.0000068085947,0.0000138865125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985861,0.00005701025,0.0005026231,0.00019073623,0.00033048133,0.00033305402],"domain_scores_gemma":[0.99856704,0.0002928053,0.000593689,0.00030775572,0.00019215382,0.000046551893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008003489,0.000121544785,0.00022150204,0.0000950553,0.00035354737,0.00009740873,0.0006413506,0.000050903982,0.0000055735863],"category_scores_gemma":[0.000067137546,0.00008335702,0.00010025908,0.0003783786,0.00009008704,0.0004093444,0.0002791458,0.00016429022,0.0000129246555],"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.000008934545,0.00008396342,0.0060039763,0.00007592382,0.000029704403,0.000006830445,0.0051299687,0.0008865952,0.00023890268,0.9788788,0.000017633529,0.0086388],"study_design_scores_gemma":[0.0030744413,0.0013064061,0.5353717,0.00044571044,0.000084638785,0.00032072907,0.030713752,0.124545254,0.030903485,0.26422817,0.0073228376,0.0016828374],"about_ca_topic_score_codex":0.00004583918,"about_ca_topic_score_gemma":0.000031541284,"teacher_disagreement_score":0.8015747,"about_ca_system_score_codex":0.000024906025,"about_ca_system_score_gemma":0.0000354198,"threshold_uncertainty_score":0.33992007},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11475725,0.000039856488,0.87655646,0.000066219895,0.00018936323,0.00017543494,0.0000072837297,0.0045008077,0.0037073207],"genre_scores_gemma":[0.5444501,5.208078e-8,0.45540604,0.00001371165,0.00011344088,0.0000025994198,0.000005634817,0.00000677139,0.0000016604006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839467,0.000024857676,0.00051076064,0.00031591102,0.00023366055,0.00052015967],"domain_scores_gemma":[0.99766564,0.0012363567,0.00046015842,0.00027818984,0.00031512527,0.000044516557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069038355,0.00017511634,0.0002726592,0.000121321,0.00033674735,0.00014811044,0.0006605496,0.00005937865,5.695072e-7],"category_scores_gemma":[0.00087281567,0.00017216407,0.0000882836,0.000554109,0.00008424164,0.00048408422,0.0003118834,0.00012930202,8.933936e-7],"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.0000090909025,0.00009167643,0.06891271,0.0003108633,0.00003107548,0.000023731815,0.00035893515,0.00614594,0.0015837932,0.67571187,0.00081020006,0.24601012],"study_design_scores_gemma":[0.00032951726,0.00016271832,0.004518934,0.00035341884,0.000009062227,0.00013665449,0.000037495378,0.78234357,0.018319618,0.19343984,0.000038273072,0.0003108952],"about_ca_topic_score_codex":0.00022415727,"about_ca_topic_score_gemma":0.000005875989,"teacher_disagreement_score":0.7761976,"about_ca_system_score_codex":0.000062826686,"about_ca_system_score_gemma":0.000094664145,"threshold_uncertainty_score":0.70206475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1594275,0.000022595303,0.836506,0.00014006613,0.00061269954,0.00034741132,0.0000029483524,0.00020000308,0.002740792],"genre_scores_gemma":[0.5208268,5.4418166e-7,0.47899917,0.00006409017,0.00008264427,0.0000063377156,0.000005624893,0.000007908259,0.0000068519216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819595,0.00004542936,0.0005173791,0.00037111717,0.00036106282,0.000509053],"domain_scores_gemma":[0.99865615,0.00006221133,0.00031361647,0.00060344086,0.00024986063,0.000114726645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095927465,0.00017777612,0.00024609268,0.00014807492,0.00025384172,0.000061978535,0.0008338816,0.000071359245,0.0000025154013],"category_scores_gemma":[0.00015001584,0.00017182485,0.00010444149,0.00041814212,0.000052204567,0.0010013047,0.00030392874,0.00013437084,0.00000656918],"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.000020212103,0.00012592303,0.000021504806,0.000051681593,0.00001354147,0.0000018478496,0.0013084131,0.005877192,0.001920966,0.9551236,0.000011846451,0.035523247],"study_design_scores_gemma":[0.0026940813,0.0020165627,0.00885865,0.00013737127,0.000021159856,0.00004972591,0.00025914065,0.7708962,0.18421197,0.028232014,0.0020498908,0.0005732165],"about_ca_topic_score_codex":0.00004621002,"about_ca_topic_score_gemma":0.000009702552,"teacher_disagreement_score":0.9268916,"about_ca_system_score_codex":0.0001297209,"about_ca_system_score_gemma":0.00012176555,"threshold_uncertainty_score":0.7006814},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26162994,0.00006705917,0.7049472,0.00011517058,0.00015756254,0.00046356977,0.000022473936,0.00016880232,0.03242825],"genre_scores_gemma":[0.94197524,1.4407404e-7,0.05781081,0.000044365835,0.00009686445,0.00001087442,0.000022030279,0.000010063649,0.000029586803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974482,0.000053292202,0.00083621155,0.0004302798,0.0004217841,0.00081024267],"domain_scores_gemma":[0.9989037,0.00009934792,0.00029424104,0.00036088986,0.00023228163,0.00010954323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073095446,0.00023596534,0.00043121132,0.00015018735,0.00018547532,0.0001770495,0.0007883508,0.00007203308,6.1448367e-7],"category_scores_gemma":[0.00009062229,0.00017846595,0.00008237796,0.0011076537,0.00004238042,0.00087862724,0.00043588798,0.00019756317,0.000007300355],"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.000080976155,0.0018024748,0.022932025,0.0008032296,0.00006361063,0.00015275809,0.0028683052,0.39173892,0.0038627055,0.4872485,0.0011482708,0.08729822],"study_design_scores_gemma":[0.0009919007,0.00024841962,0.09706724,0.00034496188,0.000005741801,0.00012947412,0.00018072732,0.8977798,0.0012195329,0.0006512326,0.0009291566,0.00045177757],"about_ca_topic_score_codex":0.0006670601,"about_ca_topic_score_gemma":0.00006813064,"teacher_disagreement_score":0.68034536,"about_ca_system_score_codex":0.000087751796,"about_ca_system_score_gemma":0.00012331612,"threshold_uncertainty_score":0.727763},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07494391,0.00075018813,0.8975486,0.0004122005,0.0015567659,0.00030203015,0.000005653553,0.00026890874,0.02421175],"genre_scores_gemma":[0.98968697,0.0000016786997,0.009812753,0.000059012746,0.00031953506,0.00000448729,0.0000033111999,0.000009478269,0.00010279362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817044,0.000087710316,0.00052084395,0.00025785208,0.00047333463,0.0004898012],"domain_scores_gemma":[0.9985336,0.00021152855,0.00036480676,0.0006696848,0.00017660295,0.000043760643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062609743,0.00017198201,0.00022899896,0.000028233322,0.0011069995,0.00039956166,0.0014292279,0.000054691627,8.556625e-7],"category_scores_gemma":[0.000034247947,0.00010171537,0.00013300368,0.00035457918,0.000110605884,0.00037321585,0.00045180783,0.00022614891,0.000008485493],"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.000044550026,0.00013693834,0.0016154302,0.00012942,0.00009910777,0.000061300285,0.0014267894,0.014065928,0.00059625815,0.81404364,0.007913179,0.15986747],"study_design_scores_gemma":[0.0016123353,0.00031283338,0.120192066,0.0004454539,0.000028430675,0.00029500047,0.0005647014,0.7607975,0.008436101,0.005461129,0.101033084,0.0008213483],"about_ca_topic_score_codex":0.00029203523,"about_ca_topic_score_gemma":0.00001713734,"teacher_disagreement_score":0.91474307,"about_ca_system_score_codex":0.00004329126,"about_ca_system_score_gemma":0.00009330008,"threshold_uncertainty_score":0.8514257},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34139183,0.000034483226,0.6543661,0.00013196442,0.00012924244,0.00011511392,0.000009280435,0.0000247573,0.0037972473],"genre_scores_gemma":[0.99423647,0.0000016892266,0.0056819664,0.000021744376,0.000037338745,0.0000027266894,0.000001453977,0.000004623487,0.000012010365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984738,0.000058982438,0.0005463191,0.00020693325,0.00034016493,0.00037378355],"domain_scores_gemma":[0.99854076,0.00051379716,0.00029963057,0.0005242786,0.00007211023,0.00004941199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075427385,0.00012325357,0.00037764217,0.000281959,0.000084103194,0.000019838148,0.0004876646,0.00003691611,0.0000043100727],"category_scores_gemma":[0.000106173735,0.00006410829,0.0001192648,0.00082238443,0.00007927453,0.0007515338,0.00035749172,0.000087404114,0.0000053442313],"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.000010195294,0.00002844362,0.00053356873,0.00002485041,0.000064825326,0.000005714813,0.00029172515,0.0048359246,0.00049869675,0.98784965,0.000008740232,0.0058476855],"study_design_scores_gemma":[0.0013176041,0.0008226029,0.074622974,0.0015545152,0.000107415384,0.000035462315,0.0008616477,0.8960377,0.019265885,0.003973454,0.0007557626,0.00064498186],"about_ca_topic_score_codex":0.00008523373,"about_ca_topic_score_gemma":0.000036709454,"teacher_disagreement_score":0.98387617,"about_ca_system_score_codex":0.000033049273,"about_ca_system_score_gemma":0.000037280417,"threshold_uncertainty_score":0.261426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22220641,0.00006474549,0.77559185,0.00008282242,0.00044572324,0.00030489854,0.0000018287672,0.00009818135,0.0012035414],"genre_scores_gemma":[0.55236864,0.0000033777403,0.4475499,0.000017866461,0.0000434181,0.0000029953014,4.3845304e-7,0.0000068707313,0.0000064834458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875253,0.00003894165,0.0003395639,0.00029890155,0.00017641202,0.00039361688],"domain_scores_gemma":[0.99854046,0.00021581218,0.0005178797,0.0005570712,0.00009152568,0.000077264776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018094,0.00015331499,0.00029115667,0.000097933545,0.00080925884,0.00025084577,0.0009532144,0.00006681228,7.971165e-7],"category_scores_gemma":[0.00049218617,0.00015151667,0.000082049846,0.000051980507,0.00011869219,0.0011238991,0.00032971354,0.00011860692,0.000002000569],"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.00009420901,0.000080925034,0.00045527122,0.00037380544,0.00008111532,0.000009382547,0.002627378,0.004825151,0.003077092,0.35368732,0.000020066595,0.6346683],"study_design_scores_gemma":[0.0011998803,0.00013202772,0.010454598,0.00010193553,0.000011862984,0.000019640818,0.0001178869,0.98051125,0.006716677,0.00042235636,0.00012634345,0.00018557227],"about_ca_topic_score_codex":0.000012124459,"about_ca_topic_score_gemma":0.000003660617,"teacher_disagreement_score":0.9756861,"about_ca_system_score_codex":0.000032217562,"about_ca_system_score_gemma":0.000035688907,"threshold_uncertainty_score":0.62242466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06653894,0.000016950977,0.92294,0.00011807086,0.0005491838,0.0002603243,0.0000021548344,0.00010267743,0.009471688],"genre_scores_gemma":[0.56135553,2.7701216e-7,0.43851256,0.000014928538,0.00008257635,0.000002682714,0.0000013551968,0.000004541141,0.000025560617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895924,0.00002595341,0.00034654757,0.00021586702,0.00019528304,0.0002571072],"domain_scores_gemma":[0.9980738,0.00026400454,0.0005974659,0.0007757536,0.00024608217,0.00004286338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006832249,0.000099635734,0.0001578255,0.000072302806,0.000852858,0.00016752657,0.0010502246,0.000057610127,0.0000020801122],"category_scores_gemma":[0.00079851516,0.00010245018,0.00008123711,0.0000870937,0.000059081332,0.0019249377,0.0002621223,0.00009325559,0.000011272727],"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.0000069640687,0.000019392795,0.00022952154,0.000026201498,0.000006140987,2.661663e-7,0.0004533065,0.342248,0.00019437597,0.61047965,0.000010946362,0.04632522],"study_design_scores_gemma":[0.0003082851,0.00007184223,0.021387441,0.00004336551,0.0000039716015,0.0000014798796,0.000010606541,0.9557745,0.0044595487,0.017286263,0.0005405072,0.00011217742],"about_ca_topic_score_codex":0.000008978392,"about_ca_topic_score_gemma":0.000001823115,"teacher_disagreement_score":0.6135265,"about_ca_system_score_codex":0.000031611355,"about_ca_system_score_gemma":0.000042810752,"threshold_uncertainty_score":0.65595806},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027197272,0.0000035738885,0.9698424,0.0001970123,0.000060948703,0.00027130515,0.0000014772031,0.00036082562,0.0020652232],"genre_scores_gemma":[0.5723182,6.175203e-7,0.42762944,0.000016692584,0.000019729578,0.0000059664367,0.0000038095075,0.0000046314312,9.28448e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989601,0.000016048964,0.000323914,0.00021922549,0.00022759345,0.000253114],"domain_scores_gemma":[0.99883634,0.00004295693,0.00026556768,0.00066714437,0.00013111325,0.000056881094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077231997,0.00012984281,0.00016765555,0.000086670996,0.0004590101,0.0001761539,0.0007011268,0.00006461641,7.1424597e-7],"category_scores_gemma":[0.000015314932,0.00013482597,0.000047822654,0.00006603066,0.00006050172,0.0025117763,0.00023156678,0.000118241616,0.0000017592535],"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.000003851417,0.000018171106,0.00016888893,0.000075660035,0.000003848041,2.0030711e-7,0.0003693153,0.07174303,0.00017634236,0.76379097,0.0000015120611,0.16364822],"study_design_scores_gemma":[0.0002664362,0.00005350911,0.002855809,0.000037540587,0.000004513179,0.0000044897633,0.0000011620152,0.9716667,0.0034646462,0.021271093,0.00023833345,0.0001357935],"about_ca_topic_score_codex":0.000015192414,"about_ca_topic_score_gemma":0.000003279269,"teacher_disagreement_score":0.8999236,"about_ca_system_score_codex":0.000039614548,"about_ca_system_score_gemma":0.00006177523,"threshold_uncertainty_score":0.54980433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19377702,0.000015765112,0.79894847,0.000011961291,0.0009950915,0.00023370447,0.0000018336293,0.00009889243,0.0059172697],"genre_scores_gemma":[0.61535466,0.0000010889146,0.3845432,0.000011361563,0.00007798722,0.0000028240245,0.000003745498,0.0000031697623,0.000001980711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983917,0.00007373076,0.0007802954,0.00015159512,0.00035606942,0.00024665124],"domain_scores_gemma":[0.9979439,0.00006304473,0.0008701663,0.000577897,0.0004973267,0.000047684607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010402036,0.000118448705,0.00024914756,0.00021285706,0.00010726907,0.00006923564,0.00072356605,0.00007061466,0.0000022734243],"category_scores_gemma":[0.00015777838,0.00011601904,0.00005890666,0.0005312075,0.00011581009,0.002367994,0.00020959055,0.00008631153,0.000029537608],"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.00003860291,0.00004474397,0.00010140819,0.00017229428,0.000022028576,1.916383e-7,0.002552241,0.0020408104,0.006035963,0.94382566,0.000025487536,0.045140583],"study_design_scores_gemma":[0.000331251,0.00033751322,0.006070878,0.000079111756,0.000005677436,0.000010882732,0.00009125919,0.9060941,0.08487299,0.0014908394,0.00048628962,0.00012922971],"about_ca_topic_score_codex":0.00004598017,"about_ca_topic_score_gemma":2.684553e-7,"teacher_disagreement_score":0.94233483,"about_ca_system_score_codex":0.000039005234,"about_ca_system_score_gemma":0.00005929561,"threshold_uncertainty_score":0.4731119},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46135497,0.000059789007,0.5378251,0.00011194079,0.00022378302,0.00015235203,6.9046206e-7,0.000074441836,0.00019691986],"genre_scores_gemma":[0.76576567,0.0000015604951,0.2340544,0.00005096197,0.000112984526,0.0000014230782,0.0000014764709,0.000009678789,0.0000018380399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867344,0.000016753747,0.00032834924,0.0003696882,0.00021591542,0.00039584495],"domain_scores_gemma":[0.9990531,0.00029074927,0.00012340362,0.00034347817,0.00010853655,0.000080736885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042301507,0.00014816616,0.00025145581,0.00009868795,0.00015704519,0.000103770755,0.0004638113,0.0000826327,0.0000010657192],"category_scores_gemma":[0.00008703376,0.0001385578,0.00007897369,0.00020638567,0.000026670456,0.00027434656,0.00028884318,0.00020709664,0.0000049100076],"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.000004683191,0.000024926105,0.0000716068,0.00008904263,0.000011580463,7.602274e-7,0.0008214639,0.0988858,0.00046819285,0.8389285,0.0000012729919,0.06069213],"study_design_scores_gemma":[0.00026789738,0.00020895814,0.0006187559,0.0001469203,0.0000042314123,0.000020991994,0.00003891065,0.91395026,0.0007238181,0.083842084,0.00001803952,0.00015911639],"about_ca_topic_score_codex":0.0000059336026,"about_ca_topic_score_gemma":2.52754e-7,"teacher_disagreement_score":0.8150645,"about_ca_system_score_codex":0.000014216734,"about_ca_system_score_gemma":0.00004876524,"threshold_uncertainty_score":0.56502235},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0264938,0.000034698525,0.9707218,0.000053692445,0.00043615428,0.00083142763,0.0000036282486,0.000061750114,0.0013630685],"genre_scores_gemma":[0.5004357,8.992409e-7,0.4994953,0.000023572029,0.000026303993,0.00000628549,0.0000012720412,0.000005319348,0.0000053107033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858475,0.00010556228,0.0005176953,0.0002616792,0.0002485864,0.00028171844],"domain_scores_gemma":[0.99768573,0.0008121025,0.0006202658,0.0005073136,0.0003304612,0.000044099685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085087493,0.00013320452,0.00033569956,0.00013228547,0.00008221012,0.00003895891,0.00078203477,0.00008292205,0.000006554261],"category_scores_gemma":[0.00033520182,0.00012784984,0.00010776335,0.0003399956,0.00005293759,0.0006657722,0.00013303316,0.000121428195,0.00001086266],"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.00006358732,0.000041827556,0.00013633133,0.00007758316,0.000033160137,1.5879111e-7,0.00198559,0.03386717,0.003973335,0.95186275,0.0000098722385,0.00794861],"study_design_scores_gemma":[0.0006331481,0.0004926686,0.0017817864,0.00012729694,0.000007325602,0.0000025401912,0.000105633066,0.921168,0.041577972,0.033912938,0.000051084866,0.00013959019],"about_ca_topic_score_codex":0.0000029894225,"about_ca_topic_score_gemma":8.888921e-8,"teacher_disagreement_score":0.91794986,"about_ca_system_score_codex":0.00003738748,"about_ca_system_score_gemma":0.00009489148,"threshold_uncertainty_score":0.52135646},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2794679,0.000023683158,0.71936965,0.000024072158,0.000043576605,0.0003002347,0.000002713465,0.0005179154,0.00025026905],"genre_scores_gemma":[0.54829794,0.0000014812803,0.45162746,0.000023245557,0.000015455169,0.0000032867945,0.0000060875927,0.000015802203,0.00000922845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846864,0.000018956553,0.00028719325,0.00038667963,0.00042979105,0.00040871653],"domain_scores_gemma":[0.9988956,0.00006456283,0.00021179256,0.00055187073,0.00020045458,0.000075762786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018772195,0.0002370458,0.00028082338,0.00014869997,0.000090586465,0.000066710076,0.000586222,0.000057153542,0.000001987647],"category_scores_gemma":[0.000004363745,0.00019036938,0.00004063258,0.00029252216,0.000036882953,0.0009049962,0.00035606002,0.00016298014,0.000004975463],"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.000028854709,0.00007295509,0.0047146836,0.00010878997,0.00003403692,0.000009137015,0.00078352465,0.92346513,0.00047851223,0.049561154,0.000018929419,0.020724287],"study_design_scores_gemma":[0.0006821721,0.00051562756,0.0008949516,0.00026989757,0.0000075988232,0.00003402351,0.000008014464,0.9851328,0.011919926,0.00018996451,0.00006937961,0.000275656],"about_ca_topic_score_codex":0.00003793117,"about_ca_topic_score_gemma":0.000009738407,"teacher_disagreement_score":0.26883003,"about_ca_system_score_codex":0.00008442515,"about_ca_system_score_gemma":0.00010566049,"threshold_uncertainty_score":0.7763038},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25619715,0.000041907206,0.7420295,0.000037324276,0.0001880139,0.00016446572,0.0000047604217,0.00018766346,0.0011492068],"genre_scores_gemma":[0.9773356,0.000006880034,0.022384396,0.000112355905,0.00010448223,0.00000268376,0.000013629899,0.000029872399,0.000010148114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991005,0.000007771814,0.00025013607,0.00017633456,0.00019566478,0.0002695904],"domain_scores_gemma":[0.99957824,0.0000405673,0.000053399974,0.00011769703,0.00008885334,0.00012126864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006031437,0.00015784432,0.00018824846,0.00005254756,0.000090062975,0.00002861198,0.00013257435,0.00002932432,0.000009261759],"category_scores_gemma":[0.00003679103,0.00013999901,0.00003299839,0.00020833574,0.000017066599,0.00019355054,0.00006773817,0.00012853477,0.0000101810465],"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.000023967728,0.000016685508,0.00056085514,0.00007123251,0.000025383924,0.000003680487,0.0013647149,0.98314136,0.0014120328,0.00024698972,0.0003595809,0.012773487],"study_design_scores_gemma":[0.00021435297,0.00020949879,0.00037717595,0.00010693633,0.000009859057,0.000007665707,0.0001277836,0.9530507,0.045650084,0.0000126918685,0.0000574137,0.00017585313],"about_ca_topic_score_codex":0.000038635688,"about_ca_topic_score_gemma":0.000033128166,"teacher_disagreement_score":0.72113836,"about_ca_system_score_codex":0.000044363063,"about_ca_system_score_gemma":0.000025876205,"threshold_uncertainty_score":0.5708994},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4115673,0.00004267595,0.587757,0.00020596714,0.000028264012,0.00012899323,0.0000021138133,0.000035309073,0.00023236722],"genre_scores_gemma":[0.69523585,0.000003888369,0.3046519,0.00007099281,0.000012273357,0.0000019328338,0.000018977707,0.0000039995516,1.7389758e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983007,0.00026845117,0.0006725523,0.0002528225,0.00025448177,0.00025103014],"domain_scores_gemma":[0.9984432,0.00031764607,0.00051818654,0.00047956852,0.00017510906,0.000066319495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017570779,0.00012341762,0.00035598394,0.00022974335,0.00007957244,0.000037101603,0.0005948538,0.00008145561,0.0000035467374],"category_scores_gemma":[0.0002401024,0.00012608731,0.00008866713,0.0017869105,0.00008603316,0.0010088388,0.00030562122,0.00022812163,4.5202395e-7],"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.000093198854,0.0001020108,0.041651838,0.00018222003,0.00008784267,9.812705e-7,0.006742571,0.824014,0.00032997932,0.096401535,0.0000126092145,0.030381216],"study_design_scores_gemma":[0.0003003282,0.00010714839,0.1666412,0.00003193227,0.000033801807,5.2781473e-7,0.00010517705,0.83093435,0.0013856356,0.00034917644,0.000017553612,0.00009314569],"about_ca_topic_score_codex":0.00011431408,"about_ca_topic_score_gemma":0.00007915108,"teacher_disagreement_score":0.28366858,"about_ca_system_score_codex":0.00003698719,"about_ca_system_score_gemma":0.000043864944,"threshold_uncertainty_score":0.5141691},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19102545,0.000036559817,0.79145706,0.000106990396,0.000078785306,0.0003538027,0.0000037392465,0.002861337,0.01407629],"genre_scores_gemma":[0.6329649,7.3478965e-8,0.36691347,0.00004602492,0.000046859488,0.000007129185,0.000005398577,0.000008471523,0.000007645207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785686,0.000050563303,0.0006298592,0.0003966742,0.00035687131,0.0007091478],"domain_scores_gemma":[0.9987735,0.0003211389,0.00023884953,0.0003739231,0.00020558317,0.00008701509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008574694,0.00021910957,0.00034031173,0.00023337085,0.00018254624,0.00013756799,0.0007665604,0.000066745204,3.5488546e-7],"category_scores_gemma":[0.0004353143,0.00016873458,0.00006590178,0.0010208457,0.000048585865,0.0006072557,0.00061006186,0.00021098966,0.0000031595812],"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.00011850707,0.0030836733,0.16590106,0.0011102728,0.0000779394,0.0002664288,0.0057505257,0.18875061,0.0030038105,0.28051013,0.0064336136,0.3449934],"study_design_scores_gemma":[0.00056057173,0.00041333435,0.09690414,0.00041655469,0.0000070499955,0.00018844158,0.000033315682,0.8861846,0.0025714447,0.012121594,0.00011515354,0.00048382833],"about_ca_topic_score_codex":0.0008261823,"about_ca_topic_score_gemma":0.00002539712,"teacher_disagreement_score":0.69743395,"about_ca_system_score_codex":0.00008140303,"about_ca_system_score_gemma":0.00012001086,"threshold_uncertainty_score":0.68807966},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012069351,0.0003109612,0.11647982,0.000010076527,0.8333567,0.00047245892,0.000008357761,0.00028848226,0.04895244],"genre_scores_gemma":[0.31172517,0.000023646535,0.0016100402,0.0000069047865,0.6863915,0.0000041554845,0.00003428422,0.00004788281,0.00015642743],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99333006,0.00022962656,0.0016309053,0.0010842613,0.0022006778,0.0015244683],"domain_scores_gemma":[0.9944376,0.000666077,0.0021108198,0.0011972773,0.0012692198,0.00031904443],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002047269,0.0008467842,0.0014401709,0.00036087044,0.0005246531,0.000564465,0.0033466897,0.001372117,0.00003825485],"category_scores_gemma":[0.00055790285,0.0007760436,0.0006102354,0.0006041022,0.00025647358,0.0010394702,0.0020912143,0.0014997243,0.00035225897],"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.000056741465,0.00019837084,0.00005813085,0.0006498529,0.0001750204,0.000025685726,0.0023156754,0.00003068155,0.00001661176,0.38407734,0.59676886,0.015627034],"study_design_scores_gemma":[0.0012493822,0.0014203714,0.000085518855,0.00020732808,0.0000905851,0.000017709128,0.000072048286,0.002837003,0.0004563059,0.020047532,0.97251236,0.0010038299],"about_ca_topic_score_codex":0.00091132853,"about_ca_topic_score_gemma":0.000022147558,"teacher_disagreement_score":0.37574354,"about_ca_system_score_codex":0.000150879,"about_ca_system_score_gemma":0.0010092849,"threshold_uncertainty_score":0.9999243},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032628004,0.00024733777,0.94686484,0.000095494586,0.0029120245,0.00020036411,9.699076e-8,0.00023700947,0.016814811],"genre_scores_gemma":[0.8106512,0.000001033824,0.18898922,0.00010411464,0.00023000625,0.0000021327417,8.5810194e-7,0.0000073330343,0.000014112232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979997,0.00007884933,0.00043015243,0.00043744812,0.00047378454,0.0005800595],"domain_scores_gemma":[0.99908656,0.0002300778,0.00013151146,0.0003599155,0.00011263051,0.00007927769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030979917,0.00015997495,0.00022045491,0.00055286614,0.00027974418,0.0004995361,0.0010630521,0.00005492172,0.0000030189158],"category_scores_gemma":[0.00005413819,0.00013366411,0.00008129614,0.0012883401,0.00009653255,0.0017765784,0.0006247056,0.00025632427,0.000027243843],"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.0000013014807,0.000035495195,0.000052137475,0.000059542046,0.0000034322347,0.000004641832,0.0018613118,0.0009985688,0.000074659714,0.61806035,0.000012308508,0.3788362],"study_design_scores_gemma":[0.00014307951,0.0002661084,0.0017815757,0.00015445941,0.0000030651245,0.00005669077,0.000063046515,0.77287406,0.0035521865,0.22037143,0.000529967,0.00020431135],"about_ca_topic_score_codex":0.000067580455,"about_ca_topic_score_gemma":0.0000065951845,"teacher_disagreement_score":0.7780232,"about_ca_system_score_codex":0.00012500845,"about_ca_system_score_gemma":0.00058862974,"threshold_uncertainty_score":0.5450664},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016746411,0.000020183666,0.9752646,0.0026748048,0.0021019692,0.00020962184,0.0000015106705,0.00035960035,0.0026213094],"genre_scores_gemma":[0.6367009,0.0000015239547,0.35971838,0.00011576045,0.0032923794,0.0000040755326,0.0000028887484,0.000006223099,0.00015782155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903744,0.000030159359,0.00025471373,0.00025700137,0.00020258156,0.00021811327],"domain_scores_gemma":[0.9992808,0.00006719723,0.000080365484,0.0004319377,0.00010889199,0.000030815874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003134706,0.00010723617,0.00014883076,0.0001733906,0.00018019287,0.000076003336,0.000671244,0.00004411493,0.000011570808],"category_scores_gemma":[0.000029839659,0.000092198265,0.000054983284,0.000855538,0.000016501419,0.00027181793,0.00049632066,0.000156533,0.00001982347],"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.000015499643,0.000036704958,0.000117654556,0.000017119883,0.000036694855,0.0000019260801,0.0011324233,0.03991154,0.0006424236,0.7096716,0.051255874,0.19716053],"study_design_scores_gemma":[0.0002811462,0.00019218707,0.012726389,0.00011567615,0.000014106823,0.0000073093893,0.00002178464,0.720576,0.04047884,0.016325423,0.20897728,0.0002838977],"about_ca_topic_score_codex":0.00010766699,"about_ca_topic_score_gemma":0.0000295716,"teacher_disagreement_score":0.6933462,"about_ca_system_score_codex":0.000089627996,"about_ca_system_score_gemma":0.000046438872,"threshold_uncertainty_score":0.3759736},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014296993,0.00027072243,0.8837326,0.000345514,0.00010919572,0.00023459423,5.002083e-7,0.0006165647,0.10039329],"genre_scores_gemma":[0.76366264,0.0000137627285,0.23617506,0.00009578556,0.000010208247,0.000003196202,0.000001257694,0.000002376822,0.00003573764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991205,0.000031323165,0.0003388976,0.00016870577,0.00012051045,0.00022010972],"domain_scores_gemma":[0.9994224,0.00008927104,0.00010756376,0.00021748674,0.00012302639,0.000040262235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028842414,0.00010249244,0.00017446693,0.00019317427,0.00023905929,0.000086754924,0.0003668689,0.000043900436,0.0000014766231],"category_scores_gemma":[0.000031434316,0.000099182944,0.000051080086,0.0004349871,0.00006790745,0.000424667,0.00020923717,0.00010396309,0.0000015873302],"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.0000027000588,0.00007751314,0.00010467551,0.000097110984,0.000021705937,0.0000015200511,0.00082140695,0.0030380134,0.00003568211,0.5818114,0.00024328905,0.41374493],"study_design_scores_gemma":[0.0004249476,0.00015361885,0.0030658422,0.0002105961,0.000010060498,0.000018649534,0.00007100995,0.96816736,0.006674735,0.020417785,0.000610488,0.0001749072],"about_ca_topic_score_codex":0.000007405192,"about_ca_topic_score_gemma":0.0000012123062,"teacher_disagreement_score":0.9651294,"about_ca_system_score_codex":0.000013109398,"about_ca_system_score_gemma":0.00008460761,"threshold_uncertainty_score":0.40445632},"labels":[],"label_agreement":null}]}