{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":41,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":41,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"1c8c82494ccb","filters":{"venue":"Formal Aspects of Computing"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0151970729923556,"gpt":0.248878662423115,"spread":0.2336815894307594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005564665,0.00006435577,0.0001385268,0.0001846665,0.00006850474,0.00005092884,0.000270892,0.00002298237,7.006171e-7],"category_scores_gemma":[0.0001083505,0.00005170688,0.00002780528,0.0007356509,0.00002031851,0.0001582954,0.0001182729,0.00007120992,9.523102e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001621081,"about_ca_system_score_gemma":0.00001144975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004373968,"about_ca_topic_score_gemma":0.000006804673,"domain_scores_codex":[0.9992524,0.00004155928,0.000181836,0.0001695134,0.0002072476,0.0001474565],"domain_scores_gemma":[0.999073,0.0004908627,0.00007790373,0.0002468188,0.00006448165,0.00004699158],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00009345154,0.000115074,0.005814006,0.00004350954,0.0004046771,0.000008167652,0.01982603,0.1645772,0.1141758,0.01884349,0.00004864457,0.6760499],"study_design_scores_gemma":[0.0001634341,0.0002223772,0.5070409,0.00002021139,0.00002135758,0.000003732134,0.00007417989,0.4331631,0.05540913,0.003770567,0.00002474008,0.00008625357],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.442781,0.00005749362,0.5569102,0.000112015,0.00001797129,0.00007517565,6.618978e-7,0.00002279339,0.00002274322],"genre_scores_gemma":[0.9000921,0.00000296223,0.09984764,0.00001292059,0.0000400624,5.581302e-7,4.197346e-7,0.000002175433,0.000001160973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6759637,"threshold_uncertainty_score":0.2108545,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01024457776859512,"gpt":0.2170143631757717,"spread":0.2067697854071766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006260974,0.000171982,0.000228999,0.00002823332,0.001106999,0.0003995617,0.001429228,0.00005469163,8.556625e-7],"category_scores_gemma":[0.00003424795,0.0001017154,0.0001330037,0.0003545792,0.0001106059,0.0003732159,0.0004518078,0.0002261489,0.000008485493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004329126,"about_ca_system_score_gemma":0.00009330008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002920352,"about_ca_topic_score_gemma":0.00001713734,"domain_scores_codex":[0.9981704,0.00008771032,0.000520844,0.0002578521,0.0004733346,0.0004898012],"domain_scores_gemma":[0.9985336,0.0002115285,0.0003648068,0.0006696848,0.0001766029,0.00004376064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004455003,0.0001369383,0.00161543,0.00012942,0.00009910777,0.00006130028,0.001426789,0.01406593,0.0005962581,0.8140436,0.007913179,0.1598675],"study_design_scores_gemma":[0.001612335,0.0003128334,0.1201921,0.0004454539,0.00002843068,0.0002950005,0.0005647014,0.7607975,0.008436101,0.005461129,0.1010331,0.0008213483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07494391,0.0007501881,0.8975486,0.0004122005,0.001556766,0.0003020302,0.000005653553,0.0002689087,0.02421175],"genre_scores_gemma":[0.989687,0.0000016787,0.009812753,0.00005901275,0.0003195351,0.00000448729,0.0000033112,0.000009478269,0.0001027936],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9147431,"threshold_uncertainty_score":0.8514257,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01139490546169341,"gpt":0.2523440443564946,"spread":0.2409491388948012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077232,0.0001298428,0.0001676556,0.000086671,0.0004590101,0.0001761539,0.0007011268,0.00006461641,7.14246e-7],"category_scores_gemma":[0.00001531493,0.000134826,0.00004782265,0.00006603066,0.00006050172,0.002511776,0.0002315668,0.0001182416,0.000001759253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003961455,"about_ca_system_score_gemma":0.00006177523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001519241,"about_ca_topic_score_gemma":0.000003279269,"domain_scores_codex":[0.9989601,0.00001604896,0.000323914,0.0002192255,0.0002275935,0.000253114],"domain_scores_gemma":[0.9988363,0.00004295693,0.0002655677,0.0006671444,0.0001311133,0.00005688109],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003851417,0.00001817111,0.0001688889,0.00007566003,0.000003848041,2.003071e-7,0.0003693153,0.07174303,0.0001763424,0.763791,0.000001512061,0.1636482],"study_design_scores_gemma":[0.0002664362,0.00005350911,0.002855809,0.00003754059,0.000004513179,0.000004489763,0.000001162015,0.9716667,0.003464646,0.02127109,0.0002383335,0.0001357935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02719727,0.000003573889,0.9698424,0.0001970123,0.0000609487,0.0002713052,0.000001477203,0.0003608256,0.002065223],"genre_scores_gemma":[0.5723182,6.175203e-7,0.4276294,0.00001669258,0.00001972958,0.000005966437,0.000003809507,0.000004631431,9.28448e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8999236,"threshold_uncertainty_score":0.5498043,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00614976838597775,"gpt":0.262775836309977,"spread":0.2566260679239992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000465894,0.0001095978,0.0002560451,0.0003023556,0.00008463622,0.00003385766,0.000624201,0.00003658938,0.000002793108],"category_scores_gemma":[0.00001217497,0.00008461025,0.0001637974,0.001052021,0.00002415816,0.0003328076,0.00005377556,0.0001037794,5.297919e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002061654,"about_ca_system_score_gemma":0.00003532438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002052733,"about_ca_topic_score_gemma":0.000002537625,"domain_scores_codex":[0.9989198,0.00003173051,0.0004084042,0.000123414,0.000305436,0.0002111502],"domain_scores_gemma":[0.9992092,0.0001370771,0.0002288686,0.0002955188,0.0001007237,0.00002865115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002987622,0.00006873687,0.0004619732,0.00004699367,0.0001214234,0.000001977721,0.00324786,0.3389764,0.001083461,0.4098359,0.000006233202,0.246146],"study_design_scores_gemma":[0.00009254009,0.000115412,0.02789969,0.00004762971,0.00004435456,0.000001270809,0.00001424452,0.9524238,0.01900057,0.0002562071,0.00001739485,0.00008690147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.221822,0.00002600429,0.7769725,0.0001080858,0.00002038693,0.00008452662,0.000001266216,0.0003339658,0.0006312187],"genre_scores_gemma":[0.7751377,3.491597e-7,0.2247901,0.00005066412,0.00001342982,7.131783e-7,0.00000344966,0.000003024862,6.367115e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6134474,"threshold_uncertainty_score":0.3450306,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02705976218872761,"gpt":0.2562345600830728,"spread":0.2291747978943452,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003374023,0.0001227189,0.0002536995,0.0000654476,0.0002413492,0.00003986322,0.0005592637,0.00005192012,0.000002392976],"category_scores_gemma":[0.00007464132,0.000106311,0.0001148266,0.0001697016,0.00005648416,0.0004432436,0.0001574182,0.00008497459,0.00001635083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001736682,"about_ca_system_score_gemma":0.0000912691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002591004,"about_ca_topic_score_gemma":0.000002603832,"domain_scores_codex":[0.9987771,0.00002175237,0.0003546013,0.0002184682,0.0002084383,0.0004196335],"domain_scores_gemma":[0.9990721,0.0001608329,0.0002557468,0.0002500094,0.0001822033,0.00007905939],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004552159,0.00005343483,0.0006032654,0.00004537429,0.00001668822,0.00001150879,0.001178253,0.00007594046,0.0001313253,0.9683096,0.0002404531,0.02932956],"study_design_scores_gemma":[0.009245312,0.004058338,0.03557978,0.0001247732,0.00005090126,0.001340394,0.0003679397,0.5775374,0.05123758,0.2328159,0.08547432,0.002167339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03934171,0.0002545886,0.939253,0.00005167713,0.0008569217,0.0003232689,6.996959e-7,0.0001750594,0.01974309],"genre_scores_gemma":[0.9850501,0.00000289612,0.01459762,0.00005275395,0.0002304936,0.000004073397,0.000002548357,0.000006694647,0.00005277891],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9457085,"threshold_uncertainty_score":0.4335236,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01856906399011817,"gpt":0.246454601335523,"spread":0.2278855373454049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003701923,0.0001604783,0.0002484855,0.00009384277,0.0002738403,0.0001456451,0.0004532447,0.00005844128,0.000008397307],"category_scores_gemma":[0.00008362407,0.0001543732,0.00006251102,0.0003300523,0.00003659527,0.0003686034,0.000401136,0.00009587256,0.000001983061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003069422,"about_ca_system_score_gemma":0.0000200064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000154865,"about_ca_topic_score_gemma":8.989903e-7,"domain_scores_codex":[0.9986163,0.00002466044,0.0004037111,0.0003156301,0.0001916371,0.0004480541],"domain_scores_gemma":[0.9991227,0.0001111204,0.0002363839,0.0002725386,0.0001679132,0.00008933804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002201874,0.0003275487,0.0004243309,0.0003261587,0.00008291712,0.000008513386,0.001658719,0.07952551,0.0001186559,0.7185144,0.00353817,0.1954531],"study_design_scores_gemma":[0.0005650658,0.0002479798,0.0003199154,0.00008952576,0.000007149067,0.00001743117,0.00001673049,0.9912839,0.0002622765,0.002640668,0.004358026,0.000191322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002209414,0.0002419036,0.9945876,0.0002443996,0.00008332812,0.0003598894,0.000007101759,0.0004268461,0.001839509],"genre_scores_gemma":[0.5122277,0.000005255239,0.4876378,0.00004531997,0.00003551678,0.000009108047,0.00000999142,0.000006145653,0.00002318844],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9117584,"threshold_uncertainty_score":0.6295155,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01604545832130057,"gpt":0.2513728175692331,"spread":0.2353273592479325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100349,0.0002412239,0.0003690844,0.0001442251,0.0002251854,0.0001251829,0.00158083,0.0001034377,0.00002642479],"category_scores_gemma":[0.0004112003,0.0002229175,0.0001897455,0.0006415297,0.0002050466,0.0008297287,0.001428823,0.000575479,0.00002789168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009652913,"about_ca_system_score_gemma":0.0002150795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001153963,"about_ca_topic_score_gemma":0.00007016567,"domain_scores_codex":[0.9976735,0.00007360897,0.0005077005,0.0006372482,0.0004869192,0.000620984],"domain_scores_gemma":[0.9976631,0.0003114686,0.0002687844,0.001004412,0.0005944311,0.0001577467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007148384,0.0002772305,0.001497375,0.00004058925,0.00002083333,0.000009226801,0.002775384,0.00065262,0.001420298,0.9567491,0.00002107587,0.03652905],"study_design_scores_gemma":[0.0005914558,0.000389906,0.05542739,0.00002605772,0.000008535003,0.0001188806,0.0001854865,0.4313769,0.00884669,0.502273,0.0002960431,0.0004596507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4956946,0.00002953438,0.4728661,0.000477757,0.0009493775,0.0003488118,0.000001623438,0.0003878729,0.02924432],"genre_scores_gemma":[0.7726162,2.493437e-7,0.2271067,0.00004708162,0.000209791,0.000002542048,5.648954e-7,0.000008510889,0.000008318261],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4544761,"threshold_uncertainty_score":0.9090311,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02221888783917067,"gpt":0.2520112055078466,"spread":0.2297923176686759,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003672434,0.0001373248,0.0002788726,0.00007392976,0.0002699075,0.00004621551,0.0005957378,0.00005886474,0.000002843525],"category_scores_gemma":[0.00007267529,0.000119887,0.0001237112,0.0001862365,0.00006551461,0.0004932605,0.000176304,0.00009608128,0.00001685781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000193011,"about_ca_system_score_gemma":0.00009971883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002454112,"about_ca_topic_score_gemma":0.000003283517,"domain_scores_codex":[0.9986572,0.000023579,0.0003870894,0.0002421576,0.0002330229,0.0004570057],"domain_scores_gemma":[0.9989868,0.0001758054,0.0002810736,0.0002695565,0.0001977673,0.00008904433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004746297,0.00005533819,0.0005490663,0.00004519763,0.00001806264,0.00001229152,0.001256708,0.00007002556,0.0001382703,0.9693675,0.0002896634,0.02819315],"study_design_scores_gemma":[0.008776738,0.003868775,0.02658872,0.00009953444,0.00005444668,0.001244916,0.0003631425,0.4125006,0.04682354,0.443375,0.05421786,0.002086803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04288914,0.000324963,0.9203636,0.00006172267,0.001059945,0.0003709421,0.000001059901,0.0001812539,0.03474738],"genre_scores_gemma":[0.9840688,0.000003054769,0.01551485,0.00006981792,0.0002663954,0.000004506793,0.000003545125,0.00000768241,0.00006135054],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9411796,"threshold_uncertainty_score":0.4888851,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02342987711558184,"gpt":0.2589538458296592,"spread":0.2355239687140774,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006903835,0.0001751163,0.0002726592,0.000121321,0.0003367474,0.0001481104,0.0006605496,0.00005937865,5.695072e-7],"category_scores_gemma":[0.0008728157,0.0001721641,0.0000882836,0.000554109,0.00008424164,0.0004840842,0.0003118834,0.000129302,8.933936e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006282669,"about_ca_system_score_gemma":0.00009466414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002241573,"about_ca_topic_score_gemma":0.000005875989,"domain_scores_codex":[0.9983947,0.00002485768,0.0005107606,0.000315911,0.0002336606,0.0005201597],"domain_scores_gemma":[0.9976656,0.001236357,0.0004601584,0.0002781898,0.0003151253,0.00004451656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009090902,0.00009167643,0.06891271,0.0003108633,0.00003107548,0.00002373181,0.0003589352,0.00614594,0.001583793,0.6757119,0.0008102001,0.2460101],"study_design_scores_gemma":[0.0003295173,0.0001627183,0.004518934,0.0003534188,0.000009062227,0.0001366545,0.00003749538,0.7823436,0.01831962,0.1934398,0.00003827307,0.0003108952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1147572,0.00003985649,0.8765565,0.00006621989,0.0001893632,0.0001754349,0.00000728373,0.004500808,0.003707321],"genre_scores_gemma":[0.5444501,5.208078e-8,0.455406,0.00001371165,0.0001134409,0.00000259942,0.000005634817,0.00000677139,0.000001660401],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7761976,"threshold_uncertainty_score":0.7020648,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02304390770913123,"gpt":0.3050553951612518,"spread":0.2820114874521206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009592747,0.0001777761,0.0002460927,0.0001480749,0.0002538417,0.00006197854,0.0008338816,0.00007135925,0.000002515401],"category_scores_gemma":[0.0001500158,0.0001718249,0.0001044415,0.0004181421,0.00005220457,0.001001305,0.0003039287,0.0001343708,0.00000656918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001297209,"about_ca_system_score_gemma":0.0001217656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004621002,"about_ca_topic_score_gemma":0.000009702552,"domain_scores_codex":[0.9981959,0.00004542936,0.0005173791,0.0003711172,0.0003610628,0.000509053],"domain_scores_gemma":[0.9986562,0.00006221133,0.0003136165,0.0006034409,0.0002498606,0.0001147266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000202121,0.000125923,0.00002150481,0.00005168159,0.00001354147,0.00000184785,0.001308413,0.005877192,0.001920966,0.9551236,0.00001184645,0.03552325],"study_design_scores_gemma":[0.002694081,0.002016563,0.00885865,0.0001373713,0.00002115986,0.00004972591,0.0002591407,0.7708962,0.184212,0.02823201,0.002049891,0.0005732165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1594275,0.0000225953,0.836506,0.0001400661,0.0006126995,0.0003474113,0.000002948352,0.0002000031,0.002740792],"genre_scores_gemma":[0.5208268,5.441817e-7,0.4789992,0.00006409017,0.00008264427,0.000006337716,0.000005624893,0.000007908259,0.000006851922],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9268916,"threshold_uncertainty_score":0.7006814,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01869491354495632,"gpt":0.3182641761029621,"spread":0.2995692625580058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003097992,0.000159975,0.0002204549,0.0005528661,0.0002797442,0.0004995361,0.001063052,0.00005492172,0.000003018916],"category_scores_gemma":[0.00005413819,0.0001336641,0.00008129614,0.00128834,0.00009653255,0.001776578,0.0006247056,0.0002563243,0.00002724384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001250084,"about_ca_system_score_gemma":0.0005886297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006758045,"about_ca_topic_score_gemma":0.000006595184,"domain_scores_codex":[0.9979997,0.00007884933,0.0004301524,0.0004374481,0.0004737845,0.0005800595],"domain_scores_gemma":[0.9990866,0.0002300778,0.0001315115,0.0003599155,0.0001126305,0.00007927769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001301481,0.0000354952,0.00005213747,0.00005954205,0.000003432235,0.000004641832,0.001861312,0.0009985688,0.00007465971,0.6180604,0.00001230851,0.3788362],"study_design_scores_gemma":[0.0001430795,0.0002661084,0.001781576,0.0001544594,0.000003065124,0.00005669077,0.00006304651,0.7728741,0.003552187,0.2203714,0.000529967,0.0002043113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.032628,0.0002473378,0.9468648,0.00009549459,0.002912025,0.0002003641,9.699076e-8,0.0002370095,0.01681481],"genre_scores_gemma":[0.8106512,0.000001033824,0.1889892,0.0001041146,0.0002300062,0.000002132742,8.581019e-7,0.000007333034,0.00001411223],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7780232,"threshold_uncertainty_score":0.5450664,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01893584562270784,"gpt":0.2239879715953384,"spread":0.2050521259726305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007309545,0.0002359653,0.0004312113,0.0001501873,0.0001854753,0.0001770495,0.0007883508,0.00007203308,6.144837e-7],"category_scores_gemma":[0.00009062229,0.000178466,0.00008237796,0.001107654,0.00004238042,0.0008786272,0.000435888,0.0001975632,0.000007300355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000877518,"about_ca_system_score_gemma":0.0001233161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006670601,"about_ca_topic_score_gemma":0.00006813064,"domain_scores_codex":[0.9974482,0.0000532922,0.0008362115,0.0004302798,0.0004217841,0.0008102427],"domain_scores_gemma":[0.9989037,0.00009934792,0.000294241,0.0003608899,0.0002322816,0.0001095432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008097616,0.001802475,0.02293202,0.0008032296,0.00006361063,0.0001527581,0.002868305,0.3917389,0.003862706,0.4872485,0.001148271,0.08729822],"study_design_scores_gemma":[0.0009919007,0.0002484196,0.09706724,0.0003449619,0.000005741801,0.0001294741,0.0001807273,0.8977798,0.001219533,0.0006512326,0.0009291566,0.0004517776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2616299,0.00006705917,0.7049472,0.0001151706,0.0001575625,0.0004635698,0.00002247394,0.0001688023,0.03242825],"genre_scores_gemma":[0.9419752,1.44074e-7,0.05781081,0.00004436584,0.00009686445,0.00001087442,0.00002203028,0.00001006365,0.0000295868],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6803454,"threshold_uncertainty_score":0.727763,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0643636300957055,"gpt":0.3309971874528164,"spread":0.2666335573571109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018094,0.000153315,0.0002911567,0.00009793355,0.0008092588,0.0002508458,0.0009532144,0.00006681228,7.971165e-7],"category_scores_gemma":[0.0004921862,0.0001515167,0.00008204985,0.00005198051,0.0001186922,0.001123899,0.0003297135,0.0001186069,0.000002000569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003221756,"about_ca_system_score_gemma":0.00003568891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001212446,"about_ca_topic_score_gemma":0.000003660617,"domain_scores_codex":[0.9987525,0.00003894165,0.0003395639,0.0002989015,0.000176412,0.0003936169],"domain_scores_gemma":[0.9985405,0.0002158122,0.0005178797,0.0005570712,0.00009152568,0.00007726478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009420901,0.00008092503,0.0004552712,0.0003738054,0.00008111532,0.000009382547,0.002627378,0.004825151,0.003077092,0.3536873,0.00002006659,0.6346683],"study_design_scores_gemma":[0.00119988,0.0001320277,0.0104546,0.0001019355,0.00001186298,0.00001964082,0.0001178869,0.9805112,0.006716677,0.0004223564,0.0001263435,0.0001855723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2222064,0.00006474549,0.7755919,0.00008282242,0.0004457232,0.0003048985,0.000001828767,0.00009818135,0.001203541],"genre_scores_gemma":[0.5523686,0.00000337774,0.4475499,0.00001786646,0.0000434181,0.000002995301,4.38453e-7,0.000006870731,0.000006483446],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9756861,"threshold_uncertainty_score":0.6224247,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01604354604530554,"gpt":0.2687929526499507,"spread":0.2527494066046451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005171874,0.0001377602,0.0002455193,0.0001594608,0.0001181119,0.00005270813,0.0007533006,0.00005207558,0.000001969025],"category_scores_gemma":[0.0002237217,0.0001240387,0.00008944876,0.0003677719,0.00005475712,0.0003563765,0.0001543149,0.0001508982,0.000002921113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002659999,"about_ca_system_score_gemma":0.00006354132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002775921,"about_ca_topic_score_gemma":5.068068e-7,"domain_scores_codex":[0.9987211,0.00002600517,0.0003664776,0.0002274136,0.0003427554,0.0003162166],"domain_scores_gemma":[0.9988706,0.0002551801,0.0003135097,0.000389501,0.0001245227,0.00004668239],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002940729,0.0003529777,0.002243523,0.00009320941,0.00002836054,0.00004509968,0.002394162,0.00260198,0.00194189,0.5231649,0.0009593487,0.4661451],"study_design_scores_gemma":[0.0007534216,0.004955353,0.04280179,0.001930882,0.00001691179,0.000119407,0.00003473968,0.3331248,0.1475086,0.4676234,0.0002828346,0.0008478597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5367652,0.0001008176,0.427908,0.0002615687,0.0003463329,0.0001219812,7.499185e-7,0.003412181,0.03108317],"genre_scores_gemma":[0.8714781,0.000001360995,0.1282906,0.0001532461,0.00006526981,3.097456e-7,4.503586e-7,0.000004623674,0.000006007603],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4652973,"threshold_uncertainty_score":0.5058152,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","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","retraction":null,"screen_n_in":null,"score":{"opus":0.02284723700528076,"gpt":0.2745191433185214,"spread":0.2516719063132407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007846151,0.0001223591,0.0001577425,0.0001183234,0.0001480553,0.00005428831,0.0005499734,0.00004798864,0.000007324276],"category_scores_gemma":[0.0001882413,0.0001184062,0.00006715735,0.0003419112,0.00003513158,0.00053516,0.0001360391,0.0001574808,0.00002828456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000453321,"about_ca_system_score_gemma":0.00004179909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002981088,"about_ca_topic_score_gemma":4.312243e-7,"domain_scores_codex":[0.9987739,0.00009025658,0.000297123,0.0002256351,0.0002813051,0.0003318049],"domain_scores_gemma":[0.9991338,0.0001225144,0.0001885156,0.0004387775,0.00006219462,0.00005419572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000279561,0.00002802565,0.00009469748,0.00002043001,0.000006949897,0.000002341258,0.0003547884,0.002599328,0.0003411284,0.9892753,0.00001945768,0.007254693],"study_design_scores_gemma":[0.001466143,0.001213684,0.01656117,0.0003169652,0.00001344073,0.0001468164,0.0002957234,0.4257947,0.2476456,0.303805,0.001842506,0.0008982865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1537823,0.00001736963,0.7713618,0.00003162163,0.0004519252,0.00008191121,2.070777e-7,0.0001154702,0.07415741],"genre_scores_gemma":[0.6661823,6.22158e-7,0.333695,0.00008309273,0.0000228258,5.982511e-7,2.578165e-7,0.000005560045,0.000009768748],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6854703,"threshold_uncertainty_score":0.4828467,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02360080994626788,"gpt":0.297527706928594,"spread":0.2739268969823261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001231574,0.00009557908,0.0001800571,0.0001260227,0.00009587091,0.00002536275,0.000569863,0.00004512969,0.000002461715],"category_scores_gemma":[0.0001464924,0.00008858722,0.00005075414,0.0003054173,0.00006962468,0.001729087,0.0002818848,0.0001022245,0.000003922224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002877596,"about_ca_system_score_gemma":0.00004335471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001896744,"about_ca_topic_score_gemma":8.212504e-7,"domain_scores_codex":[0.9988055,0.00007109404,0.000419178,0.0001200379,0.000287849,0.0002963786],"domain_scores_gemma":[0.9989181,0.0001086627,0.0004862136,0.0002913041,0.000144361,0.0000513999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001023983,0.0001961784,0.008819379,0.0003312186,0.00002128267,0.000001010704,0.006419623,0.0008620476,0.0127556,0.7150545,0.00001185303,0.2555171],"study_design_scores_gemma":[0.0002437856,0.0002042284,0.04947161,0.0001407569,0.00000839625,0.00003297971,0.0001620049,0.6213952,0.3259178,0.002046509,0.0001853054,0.000191402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4428593,0.00006278868,0.5491812,0.00002235326,0.0003139103,0.0001159126,8.65324e-7,0.00005578605,0.007387913],"genre_scores_gemma":[0.5753933,9.02839e-7,0.4245175,0.000009531968,0.00007029876,6.603842e-7,0.000001047842,0.000003052473,0.000003673558],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.713008,"threshold_uncertainty_score":0.3612482,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02827675583007012,"gpt":0.2995027640333482,"spread":0.2712260082032781,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008508749,0.0001332045,0.0003356996,0.0001322855,0.00008221012,0.00003895891,0.0007820348,0.00008292205,0.000006554261],"category_scores_gemma":[0.0003352018,0.0001278498,0.0001077633,0.0003399956,0.00005293759,0.0006657722,0.0001330332,0.0001214282,0.00001086266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003738748,"about_ca_system_score_gemma":0.00009489148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002989422,"about_ca_topic_score_gemma":8.888921e-8,"domain_scores_codex":[0.9985847,0.0001055623,0.0005176953,0.0002616792,0.0002485864,0.0002817184],"domain_scores_gemma":[0.9976857,0.0008121025,0.0006202658,0.0005073136,0.0003304612,0.00004409968],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006358732,0.00004182756,0.0001363313,0.00007758316,0.00003316014,1.587911e-7,0.00198559,0.03386717,0.003973335,0.9518628,0.000009872238,0.00794861],"study_design_scores_gemma":[0.0006331481,0.0004926686,0.001781786,0.0001272969,0.000007325602,0.000002540191,0.0001056331,0.921168,0.04157797,0.03391294,0.00005108487,0.0001395902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0264938,0.00003469853,0.9707218,0.00005369245,0.0004361543,0.0008314276,0.000003628249,0.00006175011,0.001363068],"genre_scores_gemma":[0.5004357,8.992409e-7,0.4994953,0.00002357203,0.00002630399,0.00000628549,0.000001272041,0.000005319348,0.000005310703],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9179499,"threshold_uncertainty_score":0.5213565,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02273141283079378,"gpt":0.2393801785401524,"spread":0.2166487657093586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002444113,0.000158863,0.0001902998,0.0001626975,0.0003605009,0.0001468361,0.001079903,0.00006848612,1.491322e-7],"category_scores_gemma":[0.0001836646,0.0001186761,0.00007426484,0.0005117594,0.00004161606,0.001098193,0.0001433637,0.00009963031,0.00001953638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001496078,"about_ca_system_score_gemma":0.0000762896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007992255,"about_ca_topic_score_gemma":0.000002213753,"domain_scores_codex":[0.9983582,0.0001265653,0.0005964001,0.0002530505,0.0003482722,0.000317542],"domain_scores_gemma":[0.9982863,0.00009594775,0.0005172788,0.0007841908,0.0002576677,0.00005858892],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003557759,0.00002604564,0.00001054246,0.0004444403,0.000007837957,1.180081e-8,0.002195266,0.09225628,0.0005580735,0.6896072,0.00001263148,0.2148461],"study_design_scores_gemma":[0.0002827286,0.000189555,0.001066305,0.00008462268,0.000006050285,0.000003377944,0.0003072165,0.9802449,0.01488831,0.0009854041,0.001791273,0.0001502334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01829912,0.000009871987,0.9773069,0.0004998393,0.0002480845,0.001885636,0.000002928385,0.0002148269,0.001532794],"genre_scores_gemma":[0.6152011,4.583584e-8,0.3845026,0.00007125501,0.00004731768,0.0001573503,0.00001215894,0.000006627185,0.000001483119],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8879886,"threshold_uncertainty_score":0.4839472,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008872300102288134,"gpt":0.2016832755191182,"spread":0.1928109754168301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009123447,0.0002140113,0.0006042024,0.0005977702,0.000124273,0.00005039997,0.0006642745,0.0001147006,0.000001503728],"category_scores_gemma":[0.00007826308,0.0001928107,0.0001924185,0.002216896,0.0001045442,0.0005527408,0.0004075574,0.0002410184,8.838535e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006211682,"about_ca_system_score_gemma":0.00002938924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001142666,"about_ca_topic_score_gemma":0.0002486738,"domain_scores_codex":[0.9976288,0.0001514111,0.0008079541,0.0003701561,0.0004013545,0.0006403319],"domain_scores_gemma":[0.9984659,0.0002345985,0.0005135255,0.0005018021,0.0002137046,0.00007045548],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001973656,0.00009198632,0.001598588,0.0000567777,0.00007952007,0.000001797424,0.0004305853,0.9396304,0.0007477253,0.02636842,3.370138e-7,0.0309741],"study_design_scores_gemma":[0.0003136718,0.0001789236,0.02021248,0.0001225233,0.00005985804,0.000005217073,0.00004033457,0.9712422,0.007532028,0.00008856752,0.000003870542,0.0002003225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5151939,0.00001913299,0.4837435,0.000008513372,0.0001392308,0.00009721376,2.268796e-7,0.00006325656,0.000735058],"genre_scores_gemma":[0.9933808,0.000002509003,0.006487085,0.00002018895,0.00008433035,0.000003099359,0.000002943875,0.00001313984,0.000005844432],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.478187,"threshold_uncertainty_score":0.7862592,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01851341709190154,"gpt":0.2654473833222464,"spread":0.2469339662303449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001757078,0.0001234176,0.0003559839,0.0002297434,0.00007957244,0.0000371016,0.0005948538,0.00008145561,0.000003546737],"category_scores_gemma":[0.0002401024,0.0001260873,0.00008866713,0.00178691,0.00008603316,0.001008839,0.0003056212,0.0002281216,4.52024e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003698719,"about_ca_system_score_gemma":0.00004386494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001143141,"about_ca_topic_score_gemma":0.00007915108,"domain_scores_codex":[0.9983007,0.0002684512,0.0006725523,0.0002528225,0.0002544818,0.0002510301],"domain_scores_gemma":[0.9984432,0.0003176461,0.0005181865,0.0004795685,0.0001751091,0.0000663195],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009319885,0.0001020108,0.04165184,0.00018222,0.00008784267,9.812705e-7,0.006742571,0.824014,0.0003299793,0.09640153,0.00001260921,0.03038122],"study_design_scores_gemma":[0.0003003282,0.0001071484,0.1666412,0.00003193227,0.00003380181,5.278147e-7,0.0001051771,0.8309343,0.001385636,0.0003491764,0.00001755361,0.00009314569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4115673,0.00004267595,0.587757,0.0002059671,0.00002826401,0.0001289932,0.000002113813,0.00003530907,0.0002323672],"genre_scores_gemma":[0.6952358,0.000003888369,0.3046519,0.00007099281,0.00001227336,0.000001932834,0.00001897771,0.000003999552,1.738976e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2836686,"threshold_uncertainty_score":0.5141691,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03545459313810563,"gpt":0.2909245448275454,"spread":0.2554699516894398,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008003489,0.0001215448,0.000221502,0.0000950553,0.0003535474,0.00009740873,0.0006413506,0.00005090398,0.000005573586],"category_scores_gemma":[0.00006713755,0.00008335702,0.0001002591,0.0003783786,0.00009008704,0.0004093444,0.0002791458,0.0001642902,0.00001292466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002490602,"about_ca_system_score_gemma":0.0000354198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004583918,"about_ca_topic_score_gemma":0.00003154128,"domain_scores_codex":[0.9985861,0.00005701025,0.0005026231,0.0001907362,0.0003304813,0.000333054],"domain_scores_gemma":[0.998567,0.0002928053,0.000593689,0.0003077557,0.0001921538,0.00004655189],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000008934545,0.00008396342,0.006003976,0.00007592382,0.0000297044,0.000006830445,0.005129969,0.0008865952,0.0002389027,0.9788788,0.00001763353,0.0086388],"study_design_scores_gemma":[0.003074441,0.001306406,0.5353717,0.0004457104,0.00008463878,0.0003207291,0.03071375,0.1245453,0.03090348,0.2642282,0.007322838,0.001682837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1806271,0.00007924452,0.8112173,0.00007694912,0.0002888037,0.0003966904,3.200496e-7,0.000094984,0.007218577],"genre_scores_gemma":[0.9822018,4.234851e-7,0.01759304,0.00004422529,0.0001327839,0.000005305044,0.000001728193,0.000006808595,0.00001388651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8015747,"threshold_uncertainty_score":0.3399201,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0216745873475067,"gpt":0.2812715598116536,"spread":0.2595969724641469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005498059,0.0001174661,0.0001698723,0.0000963797,0.0001235304,0.00008209838,0.0007536439,0.00004151254,0.00001949395],"category_scores_gemma":[0.00008113686,0.0001082871,0.00008005896,0.0001772162,0.00002101677,0.0008522742,0.0003329759,0.00008133139,0.00002788787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003479772,"about_ca_system_score_gemma":0.00003019748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004160653,"about_ca_topic_score_gemma":0.000001467234,"domain_scores_codex":[0.998751,0.00003122677,0.0003986674,0.0002216464,0.0002278447,0.0003695641],"domain_scores_gemma":[0.9989575,0.00009814779,0.000254986,0.0004225094,0.0002052861,0.00006160552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000371797,0.00005734384,0.0004289392,0.0001127443,0.00001646733,3.769451e-7,0.0006099318,0.0005583859,0.001371215,0.7110373,0.0002400951,0.2855634],"study_design_scores_gemma":[0.0005494562,0.000528674,0.03889579,0.00008715042,0.000005843865,0.00001101656,0.00009283215,0.8934711,0.04885912,0.01613491,0.00109845,0.0002656692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1301288,0.00001364884,0.8635404,0.00014447,0.0003985462,0.0003559942,0.000001527078,0.000110273,0.005306362],"genre_scores_gemma":[0.5455174,5.705534e-7,0.4543161,0.00006435625,0.0000652367,0.00001211831,0.000001892106,0.000004993678,0.00001724827],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8929127,"threshold_uncertainty_score":0.4415819,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006390746909799914,"gpt":0.1971267877601951,"spread":0.1907360408503952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001877219,0.0002370458,0.0002808234,0.0001487,0.00009058647,0.00006671008,0.000586222,0.00005715354,0.000001987647],"category_scores_gemma":[0.000004363745,0.0001903694,0.00004063258,0.0002925222,0.00003688295,0.0009049962,0.00035606,0.0001629801,0.000004975463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008442515,"about_ca_system_score_gemma":0.0001056605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003793117,"about_ca_topic_score_gemma":0.000009738407,"domain_scores_codex":[0.9984686,0.00001895655,0.0002871933,0.0003866796,0.000429791,0.0004087165],"domain_scores_gemma":[0.9988956,0.00006456283,0.0002117926,0.0005518707,0.0002004546,0.00007576279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002885471,0.00007295509,0.004714684,0.00010879,0.00003403692,0.000009137015,0.0007835247,0.9234651,0.0004785122,0.04956115,0.00001892942,0.02072429],"study_design_scores_gemma":[0.0006821721,0.0005156276,0.0008949516,0.0002698976,0.000007598823,0.00003402351,0.000008014464,0.9851328,0.01191993,0.0001899645,0.00006937961,0.000275656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2794679,0.00002368316,0.7193696,0.00002407216,0.00004357661,0.0003002347,0.000002713465,0.0005179154,0.000250269],"genre_scores_gemma":[0.5482979,0.00000148128,0.4516275,0.00002324556,0.00001545517,0.000003286794,0.000006087593,0.0000158022,0.00000922845],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.26883,"threshold_uncertainty_score":0.7763038,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01924687358716634,"gpt":0.245146874499248,"spread":0.2259000009120817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001894599,0.000221555,0.0004507839,0.0003638295,0.0001636311,0.00006492186,0.0010183,0.00008321609,0.000003653237],"category_scores_gemma":[0.0001953565,0.0002034598,0.0001200515,0.0007782363,0.00010414,0.0004887086,0.001020698,0.0002567806,0.000007924823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001159128,"about_ca_system_score_gemma":0.0001446468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003522612,"about_ca_topic_score_gemma":0.000009829529,"domain_scores_codex":[0.9972014,0.00009377253,0.0009986416,0.0003684209,0.0007034717,0.0006342827],"domain_scores_gemma":[0.9978719,0.0002057667,0.0007859591,0.0004543883,0.0005702396,0.0001117798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002922619,0.0002600111,0.001195034,0.001241063,0.0001638268,0.00004267048,0.01270447,0.8818187,0.03794684,0.03411069,0.00005421922,0.03017026],"study_design_scores_gemma":[0.000525636,0.0002092026,0.0007657359,0.0005460679,0.000007060115,0.00005626036,0.000272908,0.8607082,0.1365717,0.00009882247,0.00005791713,0.0001804346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5483851,0.0002080493,0.448422,0.00004347475,0.0005279884,0.0002248498,0.000001519791,0.000107079,0.00207999],"genre_scores_gemma":[0.9275795,0.000002895022,0.07223118,0.0000137711,0.000117257,9.960407e-7,9.943076e-7,0.00001579247,0.00003760538],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3791944,"threshold_uncertainty_score":0.8296852,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03965073029926559,"gpt":0.2887629582571282,"spread":0.2491122279578626,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004434757,0.0001272962,0.0001979189,0.00006888123,0.0001370726,0.00007617267,0.0002652365,0.00006262124,3.072624e-7],"category_scores_gemma":[0.0005861986,0.0001205614,0.00003916203,0.0001503519,0.00005521491,0.001035095,0.000375775,0.0001808818,3.633632e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000605699,"about_ca_system_score_gemma":0.00002934906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001141481,"about_ca_topic_score_gemma":0.000007104635,"domain_scores_codex":[0.9990871,0.00001917907,0.0002302762,0.0002248256,0.0001080013,0.0003305983],"domain_scores_gemma":[0.9983853,0.0009883255,0.0001118916,0.0003019336,0.0001480025,0.00006462205],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001182745,0.0000317865,0.00008931391,0.0001140497,0.00002475675,0.0001157879,0.001510006,0.4321854,0.002200479,0.5123795,0.00001768559,0.05131943],"study_design_scores_gemma":[0.0002721022,0.00008129173,0.00009149045,0.00001443334,0.000006156442,0.000503287,0.00002071338,0.959603,0.004674839,0.03447245,0.000104242,0.0001559594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2782796,0.00001602861,0.720951,0.00003081658,0.0003983474,0.0001175139,0.000002345055,0.0001779134,0.00002646598],"genre_scores_gemma":[0.4992296,7.346599e-7,0.5006959,0.00001302759,0.00005032665,0.00000125848,4.30869e-7,0.000006196575,0.000002541899],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5274177,"threshold_uncertainty_score":0.491635,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07029911596565051,"gpt":0.290714074281569,"spread":0.2204149583159185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004209992,0.00008804663,0.0001671053,0.0001230842,0.00009517618,0.00008384932,0.0004899444,0.00004459537,0.000001485959],"category_scores_gemma":[0.0001009418,0.00007880779,0.00005431051,0.0003845055,0.00002960043,0.0003726276,0.0001361952,0.00007943918,0.00001032495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000648757,"about_ca_system_score_gemma":0.0001329508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006973843,"about_ca_topic_score_gemma":0.00006140007,"domain_scores_codex":[0.9989794,0.00002718761,0.0003377798,0.0001939041,0.0001808803,0.0002808012],"domain_scores_gemma":[0.9992213,0.00009210074,0.0001587563,0.0002615883,0.0001850471,0.00008117953],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002821137,0.00003518298,0.0005503171,0.00001273601,0.00000508414,0.000001332151,0.00133442,0.0007402195,0.00002686059,0.9867799,0.0001139402,0.01039716],"study_design_scores_gemma":[0.001373448,0.0003182884,0.01216527,0.000006757363,0.000007018994,0.00004195122,0.0005178422,0.2682173,0.001035938,0.7048899,0.01112945,0.000296886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009008898,0.00005084814,0.9781781,0.0001831186,0.0005803035,0.0003020297,5.56961e-7,0.00008534388,0.01161077],"genre_scores_gemma":[0.9616016,3.485053e-7,0.03815916,0.00001675241,0.0001699473,0.000007162643,0.000008340325,0.000005251534,0.00003139284],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9525927,"threshold_uncertainty_score":0.3213688,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Structuring; Programming language; Theory of computation; Refinement calculus; Theoretical computer science; Formal methods","retraction":null,"screen_n_in":null,"score":{"opus":0.0423949639495817,"gpt":0.2282793509794044,"spread":0.1858843870298227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003456654,0.00009564967,0.0001228459,0.00009112951,0.00007294444,0.00003483311,0.0002445225,0.00002162696,0.0000013767],"category_scores_gemma":[0.00001274477,0.0000997241,0.00002493615,0.0001756775,0.00001552553,0.0005919517,0.0001482221,0.0000812716,0.000001685297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002604924,"about_ca_system_score_gemma":0.00001767301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007012332,"about_ca_topic_score_gemma":2.809626e-7,"domain_scores_codex":[0.9992024,0.00001913561,0.0002155677,0.0001890004,0.0001679118,0.0002059807],"domain_scores_gemma":[0.9994834,0.00002463088,0.00008878246,0.0003027012,0.00005510689,0.00004539903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[6.350438e-7,0.00001387688,0.0001765057,0.00002959716,0.000005501639,0.000001954612,0.0005439341,0.001781283,0.0007841995,0.9421614,0.000007390617,0.05449368],"study_design_scores_gemma":[0.0007678638,0.0004612001,0.01924392,0.0003667152,0.00001470228,0.00006216784,0.00004772728,0.641306,0.2844985,0.01123238,0.04119951,0.000799301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1955903,0.0000639991,0.8030466,0.00002382937,0.0001015801,0.00007211796,1.6987e-7,0.0002640554,0.0008373795],"genre_scores_gemma":[0.5865433,0.000008678348,0.4134196,0.000007527778,0.00001138075,0.000003086256,3.559698e-7,0.000004306928,0.000001828049],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9309291,"threshold_uncertainty_score":0.4066631,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01268998958396425,"gpt":0.2507308861064802,"spread":0.2380408965225159,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005487703,0.0001073801,0.0001993791,0.0001202761,0.0001117334,0.00002875403,0.0004775411,0.00005245993,0.00006507384],"category_scores_gemma":[0.00001780165,0.0001079401,0.00007185461,0.0004447373,0.00005798752,0.0009993816,0.000105303,0.0001001384,0.00002208506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002512327,"about_ca_system_score_gemma":0.00003286396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002466306,"about_ca_topic_score_gemma":7.44248e-7,"domain_scores_codex":[0.9987611,0.0000723214,0.0004513888,0.0001879093,0.0002876168,0.0002397328],"domain_scores_gemma":[0.9991509,0.00006751777,0.0002723094,0.0003475163,0.0001207798,0.00004099363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003600719,0.00009503494,0.000147377,0.00008184825,0.00001970107,8.222603e-7,0.0005912759,0.007087418,0.009155689,0.6651073,0.00003122641,0.3176464],"study_design_scores_gemma":[0.0005977094,0.0006436624,0.03984799,0.0001788887,0.00001921973,0.00003911325,0.00005076889,0.7458612,0.1870912,0.02485435,0.0005376747,0.000278241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3735905,0.00004792099,0.6116895,0.00002041497,0.0001796888,0.00008820514,0.000001136294,0.00008041255,0.0143022],"genre_scores_gemma":[0.7441851,0.000003457755,0.2557085,0.00003001704,0.00004847392,8.547021e-7,0.000004802721,0.000004871833,0.00001384446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7387738,"threshold_uncertainty_score":0.4401668,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02516951375282012,"gpt":0.2376320665976636,"spread":0.2124625528448435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008574694,0.0002191096,0.0003403117,0.0002333709,0.0001825462,0.000137568,0.0007665604,0.0000667452,3.548855e-7],"category_scores_gemma":[0.0004353143,0.0001687346,0.00006590178,0.001020846,0.00004858587,0.0006072557,0.0006100619,0.0002109897,0.000003159581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008140303,"about_ca_system_score_gemma":0.0001200109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008261823,"about_ca_topic_score_gemma":0.00002539712,"domain_scores_codex":[0.9978569,0.0000505633,0.0006298592,0.0003966742,0.0003568713,0.0007091478],"domain_scores_gemma":[0.9987735,0.0003211389,0.0002388495,0.0003739231,0.0002055832,0.00008701509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001185071,0.003083673,0.1659011,0.001110273,0.0000779394,0.0002664288,0.005750526,0.1887506,0.003003811,0.2805101,0.006433614,0.3449934],"study_design_scores_gemma":[0.0005605717,0.0004133343,0.09690414,0.0004165547,0.000007049995,0.0001884416,0.00003331568,0.8861846,0.002571445,0.01212159,0.0001151535,0.0004838283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1910255,0.00003655982,0.7914571,0.0001069904,0.00007878531,0.0003538027,0.000003739246,0.002861337,0.01407629],"genre_scores_gemma":[0.6329649,7.347897e-8,0.3669135,0.00004602492,0.00004685949,0.000007129185,0.000005398577,0.000008471523,0.000007645207],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6974339,"threshold_uncertainty_score":0.6880797,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01293004455958697,"gpt":0.2479460447498568,"spread":0.2350160001902699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004230151,0.0001481662,0.0002514558,0.00009868795,0.0001570452,0.0001037708,0.0004638113,0.0000826327,0.000001065719],"category_scores_gemma":[0.00008703376,0.0001385578,0.00007897369,0.0002063857,0.00002667046,0.0002743466,0.0002888432,0.0002070966,0.000004910008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001421673,"about_ca_system_score_gemma":0.00004876524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005933603,"about_ca_topic_score_gemma":2.52754e-7,"domain_scores_codex":[0.9986734,0.00001675375,0.0003283492,0.0003696882,0.0002159154,0.000395845],"domain_scores_gemma":[0.9990531,0.0002907493,0.0001234036,0.0003434782,0.0001085366,0.00008073689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004683191,0.0000249261,0.0000716068,0.00008904263,0.00001158046,7.602274e-7,0.0008214639,0.0988858,0.0004681929,0.8389285,0.000001272992,0.06069213],"study_design_scores_gemma":[0.0002678974,0.0002089581,0.0006187559,0.0001469203,0.000004231412,0.00002099199,0.00003891065,0.9139503,0.0007238181,0.08384208,0.00001803952,0.0001591164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.461355,0.00005978901,0.5378251,0.0001119408,0.000223783,0.000152352,6.904621e-7,0.00007444184,0.0001969199],"genre_scores_gemma":[0.7657657,0.000001560495,0.2340544,0.00005096197,0.0001129845,0.000001423078,0.000001476471,0.000009678789,0.00000183804],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8150645,"threshold_uncertainty_score":0.5650223,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04085635996822392,"gpt":0.345178802840271,"spread":0.3043224428720471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006832249,0.00009963573,0.0001578255,0.00007230281,0.000852858,0.0001675266,0.001050225,0.00005761013,0.000002080112],"category_scores_gemma":[0.0007985152,0.0001024502,0.00008123711,0.0000870937,0.00005908133,0.001924938,0.0002621223,0.00009325559,0.00001127273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003161135,"about_ca_system_score_gemma":0.00004281075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008978392,"about_ca_topic_score_gemma":0.000001823115,"domain_scores_codex":[0.9989592,0.00002595341,0.0003465476,0.000215867,0.000195283,0.0002571072],"domain_scores_gemma":[0.9980738,0.0002640045,0.0005974659,0.0007757536,0.0002460822,0.00004286338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006964069,0.0000193928,0.0002295215,0.0000262015,0.000006140987,2.661663e-7,0.0004533065,0.342248,0.000194376,0.6104797,0.00001094636,0.04632522],"study_design_scores_gemma":[0.0003082851,0.00007184223,0.02138744,0.00004336551,0.000003971601,0.00000147988,0.00001060654,0.9557745,0.004459549,0.01728626,0.0005405072,0.0001121774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06653894,0.00001695098,0.92294,0.0001180709,0.0005491838,0.0002603243,0.000002154834,0.0001026774,0.009471688],"genre_scores_gemma":[0.5613555,2.770122e-7,0.4385126,0.00001492854,0.00008257635,0.000002682714,0.000001355197,0.000004541141,0.00002556062],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6135265,"threshold_uncertainty_score":0.6559581,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01253869386341569,"gpt":0.2439070737610422,"spread":0.2313683798976265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007542738,0.0001232536,0.0003776422,0.000281959,0.00008410319,0.00001983815,0.0004876646,0.00003691611,0.000004310073],"category_scores_gemma":[0.0001061737,0.00006410829,0.0001192648,0.0008223844,0.00007927453,0.0007515338,0.0003574917,0.00008740411,0.000005344231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003304927,"about_ca_system_score_gemma":0.00003728042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008523373,"about_ca_topic_score_gemma":0.00003670945,"domain_scores_codex":[0.9984738,0.00005898244,0.0005463191,0.0002069333,0.0003401649,0.0003737836],"domain_scores_gemma":[0.9985408,0.0005137972,0.0002996306,0.0005242786,0.00007211023,0.00004941199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001019529,0.00002844362,0.0005335687,0.00002485041,0.00006482533,0.000005714813,0.0002917252,0.004835925,0.0004986968,0.9878497,0.000008740232,0.005847686],"study_design_scores_gemma":[0.001317604,0.0008226029,0.07462297,0.001554515,0.0001074154,0.00003546232,0.0008616477,0.8960377,0.01926588,0.003973454,0.0007557626,0.0006449819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3413918,0.00003448323,0.6543661,0.0001319644,0.0001292424,0.0001151139,0.000009280435,0.0000247573,0.003797247],"genre_scores_gemma":[0.9942365,0.000001689227,0.005681966,0.00002174438,0.00003733874,0.000002726689,0.000001453977,0.000004623487,0.00001201037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9838762,"threshold_uncertainty_score":0.261426,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008436181392611425,"gpt":0.2414659828690756,"spread":0.2330298014764641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001766874,0.0002591638,0.0005080123,0.0002303177,0.0003042338,0.0003303354,0.001245813,0.0001005699,0.00001371686],"category_scores_gemma":[0.0003571965,0.0002525215,0.0001922118,0.0004402447,0.00005424816,0.001665806,0.0006109677,0.000219286,0.0002331692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007385118,"about_ca_system_score_gemma":0.00009883136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000552666,"about_ca_topic_score_gemma":0.000001993924,"domain_scores_codex":[0.9973605,0.0001651289,0.0007580929,0.0004768989,0.0005319547,0.0007074761],"domain_scores_gemma":[0.997763,0.0005907481,0.0005532971,0.0007695894,0.000166974,0.000156436],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005301472,0.0003716498,0.0001965974,0.0004088313,0.0001842217,0.00005035753,0.002538929,0.02354966,0.03876322,0.4116099,0.0003197566,0.5219539],"study_design_scores_gemma":[0.0007536854,0.0003792532,0.0002767342,0.0003411639,0.00001154719,0.0001036576,0.00004613547,0.9631885,0.02631994,0.007611281,0.0005902009,0.0003778487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3094477,0.00004760323,0.6499107,0.0000885673,0.0004330731,0.0001552485,7.380821e-7,0.0003036524,0.0396127],"genre_scores_gemma":[0.8725232,9.032761e-7,0.1270121,0.00006852044,0.0003150973,0.000001599088,0.000001952028,0.00002117043,0.00005546067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9396389,"threshold_uncertainty_score":0.9999927,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03077561121870647,"gpt":0.3300581245652502,"spread":0.2992825133465437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003993771,0.0001113074,0.0002941343,0.0003583457,0.0001415266,0.00001384933,0.0009064107,0.00003812215,0.00000375346],"category_scores_gemma":[0.0000849742,0.00008864835,0.0002099244,0.004047767,0.0001397989,0.0002020703,0.0005173253,0.0001404515,0.000002600942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003380966,"about_ca_system_score_gemma":0.00008678314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001856516,"about_ca_topic_score_gemma":0.0000189443,"domain_scores_codex":[0.9983525,0.000130493,0.0006285692,0.0002759747,0.0003632932,0.0002491573],"domain_scores_gemma":[0.9983709,0.0001342578,0.0005488881,0.000687046,0.0002225347,0.00003635106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002863138,0.0008638103,0.1362635,0.000172319,0.0001067313,0.000004025153,0.0109953,0.2284056,0.001306589,0.6177188,0.000004435062,0.004130173],"study_design_scores_gemma":[0.0004473455,0.00006073867,0.3813421,0.00009250733,0.00001158055,0.00000405174,0.00004890099,0.5943174,0.01565722,0.007907744,0.000009783633,0.0001006784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.44945,0.000009502976,0.5406587,0.00003027003,0.00003354558,0.008612584,7.144461e-7,0.0000346056,0.001170029],"genre_scores_gemma":[0.9836528,2.436345e-7,0.01546166,0.000008501719,0.00001360286,0.0008537366,6.367559e-7,0.000004494474,0.000004351426],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6098111,"threshold_uncertainty_score":0.3614975,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009103749864728304,"gpt":0.2683146532359275,"spread":0.2592109033711992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002884241,0.0001024924,0.0001744669,0.0001931743,0.0002390593,0.00008675492,0.0003668689,0.00004390044,0.000001476623],"category_scores_gemma":[0.00003143432,0.00009918294,0.00005108009,0.0004349871,0.00006790745,0.000424667,0.0002092372,0.0001039631,0.00000158733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000131094,"about_ca_system_score_gemma":0.00008460761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007405192,"about_ca_topic_score_gemma":0.000001212306,"domain_scores_codex":[0.9991205,0.00003132316,0.0003388976,0.0001687058,0.0001205104,0.0002201097],"domain_scores_gemma":[0.9994224,0.00008927104,0.0001075638,0.0002174867,0.0001230264,0.00004026224],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002700059,0.00007751314,0.0001046755,0.00009711098,0.00002170594,0.000001520051,0.000821407,0.003038013,0.00003568211,0.5818114,0.000243289,0.4137449],"study_design_scores_gemma":[0.0004249476,0.0001536189,0.003065842,0.0002105961,0.0000100605,0.00001864953,0.00007100995,0.9681674,0.006674735,0.02041779,0.000610488,0.0001749072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01429699,0.0002707224,0.8837326,0.000345514,0.0001091957,0.0002345942,5.002083e-7,0.0006165647,0.1003933],"genre_scores_gemma":[0.7636626,0.00001376273,0.2361751,0.00009578556,0.00001020825,0.000003196202,0.000001257694,0.000002376822,0.00003573764],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9651294,"threshold_uncertainty_score":0.4044563,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01879349831763574,"gpt":0.3143478726894184,"spread":0.2955543743717827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000448777,0.000119117,0.0002160305,0.0001385632,0.00008601939,0.00004351567,0.0004892621,0.00006442526,0.00000180029],"category_scores_gemma":[0.0001560055,0.0001194851,0.0000664938,0.0004155686,0.0001003805,0.0004860443,0.00007435123,0.0001032424,9.455222e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001525874,"about_ca_system_score_gemma":0.00003572871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.85785e-7,"about_ca_topic_score_gemma":9.887073e-8,"domain_scores_codex":[0.9987437,0.00003590139,0.0005002207,0.0002796418,0.0002161801,0.0002243229],"domain_scores_gemma":[0.9984381,0.0001848504,0.0005934433,0.0004791456,0.0002519522,0.00005249037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002332783,0.00009438461,0.0001102362,0.0001338242,0.000004116559,9.135848e-8,0.0009593467,0.00008681419,0.001930983,0.9587858,5.242641e-7,0.03787059],"study_design_scores_gemma":[0.0003650582,0.0004050306,0.01605546,0.0002405394,0.000004096736,0.000003343774,0.00002891419,0.06148158,0.03284912,0.8883957,0.00005798279,0.000113209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01819278,0.00002035467,0.9651887,0.0001640906,0.00002770614,0.01593172,0.000001834742,0.00008060163,0.0003922223],"genre_scores_gemma":[0.6795712,0.000001276787,0.3195674,0.00002244284,0.0000271357,0.0008038681,0.00000170318,0.000004381614,6.161964e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6613784,"threshold_uncertainty_score":0.4872462,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04194995695396473,"gpt":0.3097887354940638,"spread":0.2678387785400991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001222375,0.000104014,0.000197514,0.0002312145,0.00004902623,0.00001525693,0.0004364057,0.00007478381,0.0000139861],"category_scores_gemma":[0.00008925379,0.0001004772,0.00003838892,0.0007724856,0.00005861381,0.001332873,0.0001532989,0.0001217471,0.000006076393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006677355,"about_ca_system_score_gemma":0.00003346576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002023516,"about_ca_topic_score_gemma":2.076312e-7,"domain_scores_codex":[0.9986967,0.0001018682,0.0005287052,0.0001486478,0.0002367623,0.0002872503],"domain_scores_gemma":[0.9989567,0.00004572309,0.0004425436,0.0003810331,0.0001377131,0.00003631707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00000526655,0.0001584527,0.0006896038,0.000130124,0.000006590698,2.624515e-7,0.001513846,0.0002234497,0.01562811,0.8469974,0.00001018567,0.1346368],"study_design_scores_gemma":[0.0003333072,0.0002460005,0.2022688,0.000262007,0.00001098565,0.00005831056,0.0001689998,0.301035,0.4781452,0.01695396,0.0001700182,0.0003473323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3237268,0.00007145177,0.6663898,0.0000724856,0.0005258528,0.0002177211,2.962933e-7,0.0001782535,0.008817283],"genre_scores_gemma":[0.5483614,0.000001423377,0.4515688,0.000006468181,0.00004980106,0.000002975984,0.00000100364,0.000003840784,0.000004402549],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8300434,"threshold_uncertainty_score":0.4097341,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01889603589797445,"gpt":0.2746004658031187,"spread":0.2557044299051442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001040204,0.0001184487,0.0002491476,0.0002128571,0.0001072691,0.00006923564,0.000723566,0.00007061466,0.000002273424],"category_scores_gemma":[0.0001577784,0.000116019,0.00005890666,0.0005312075,0.0001158101,0.002367994,0.0002095906,0.00008631153,0.00002953761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003900523,"about_ca_system_score_gemma":0.00005929561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004598017,"about_ca_topic_score_gemma":2.684553e-7,"domain_scores_codex":[0.9983917,0.00007373076,0.0007802954,0.0001515951,0.0003560694,0.0002466512],"domain_scores_gemma":[0.9979439,0.00006304473,0.0008701663,0.000577897,0.0004973267,0.00004768461],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003860291,0.00004474397,0.0001014082,0.0001722943,0.00002202858,1.916383e-7,0.002552241,0.00204081,0.006035963,0.9438257,0.00002548754,0.04514058],"study_design_scores_gemma":[0.000331251,0.0003375132,0.006070878,0.00007911176,0.000005677436,0.00001088273,0.00009125919,0.9060941,0.08487299,0.001490839,0.0004862896,0.0001292297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.193777,0.00001576511,0.7989485,0.00001196129,0.0009950915,0.0002337045,0.000001833629,0.00009889243,0.00591727],"genre_scores_gemma":[0.6153547,0.000001088915,0.3845432,0.00001136156,0.00007798722,0.000002824024,0.000003745498,0.000003169762,0.000001980711],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9423348,"threshold_uncertainty_score":0.4731119,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005478286413966933,"gpt":0.2216619269802611,"spread":0.2161836405662941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003134706,0.0001072362,0.0001488308,0.0001733906,0.0001801929,0.00007600334,0.000671244,0.00004411493,0.00001157081],"category_scores_gemma":[0.00002983966,0.00009219826,0.00005498328,0.000855538,0.00001650142,0.0002718179,0.0004963207,0.000156533,0.00001982347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000089628,"about_ca_system_score_gemma":0.00004643887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000107667,"about_ca_topic_score_gemma":0.0000295716,"domain_scores_codex":[0.9990374,0.00003015936,0.0002547137,0.0002570014,0.0002025816,0.0002181133],"domain_scores_gemma":[0.9992808,0.00006719723,0.00008036548,0.0004319377,0.000108892,0.00003081587],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001549964,0.00003670496,0.0001176546,0.00001711988,0.00003669486,0.00000192608,0.001132423,0.03991154,0.0006424236,0.7096716,0.05125587,0.1971605],"study_design_scores_gemma":[0.0002811462,0.0001921871,0.01272639,0.0001156762,0.00001410682,0.000007309389,0.00002178464,0.720576,0.04047884,0.01632542,0.2089773,0.0002838977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01674641,0.00002018367,0.9752646,0.002674805,0.002101969,0.0002096218,0.00000151067,0.0003596004,0.002621309],"genre_scores_gemma":[0.6367009,0.000001523955,0.3597184,0.0001157604,0.003292379,0.000004075533,0.000002888748,0.000006223099,0.0001578215],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6933462,"threshold_uncertainty_score":0.3759736,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Theory of computation; Amendment; Delta; Computer science; Mathematics; Political science; Law; Algorithm; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.013551040505383,"gpt":0.2039885824714296,"spread":0.1904375419660466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006031437,0.0001578443,0.0001882485,0.00005254756,0.00009006297,0.00002861198,0.0001325744,0.00002932432,0.000009261759],"category_scores_gemma":[0.00003679103,0.000139999,0.00003299839,0.0002083357,0.0000170666,0.0001935505,0.00006773817,0.0001285348,0.00001018105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004436306,"about_ca_system_score_gemma":0.0000258762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003863569,"about_ca_topic_score_gemma":0.00003312817,"domain_scores_codex":[0.9991005,0.000007771814,0.0002501361,0.0001763346,0.0001956648,0.0002695904],"domain_scores_gemma":[0.9995782,0.0000405673,0.00005339997,0.000117697,0.00008885334,0.0001212686],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002396773,0.00001668551,0.0005608551,0.00007123251,0.00002538392,0.000003680487,0.001364715,0.9831414,0.001412033,0.0002469897,0.0003595809,0.01277349],"study_design_scores_gemma":[0.000214353,0.0002094988,0.000377176,0.0001069363,0.000009859057,0.000007665707,0.0001277836,0.9530507,0.04565008,0.00001269187,0.0000574137,0.0001758531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2561972,0.00004190721,0.7420295,0.00003732428,0.0001880139,0.0001644657,0.000004760422,0.0001876635,0.001149207],"genre_scores_gemma":[0.9773356,0.000006880034,0.0223844,0.0001123559,0.0001044822,0.00000268376,0.0000136299,0.0000298724,0.00001014811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7211384,"threshold_uncertainty_score":0.5708994,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Citation; Library science; Computer science; Service (business); World Wide Web; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.01409232075630146,"gpt":0.2440701286342329,"spread":0.2299778078779314,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002047269,0.0008467842,0.001440171,0.0003608704,0.0005246531,0.000564465,0.00334669,0.001372117,0.00003825485],"category_scores_gemma":[0.0005579029,0.0007760436,0.0006102354,0.0006041022,0.0002564736,0.00103947,0.002091214,0.001499724,0.000352259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000150879,"about_ca_system_score_gemma":0.001009285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009113285,"about_ca_topic_score_gemma":0.00002214756,"domain_scores_codex":[0.9933301,0.0002296266,0.001630905,0.001084261,0.002200678,0.001524468],"domain_scores_gemma":[0.9944376,0.000666077,0.00211082,0.001197277,0.00126922,0.0003190444],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005674146,0.0001983708,0.00005813085,0.0006498529,0.0001750204,0.00002568573,0.002315675,0.00003068155,0.00001661176,0.3840773,0.5967689,0.01562703],"study_design_scores_gemma":[0.001249382,0.001420371,0.00008551886,0.0002073281,0.0000905851,0.00001770913,0.00007204829,0.002837003,0.0004563059,0.02004753,0.9725124,0.00100383],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0001206935,0.0003109612,0.1164798,0.00001007653,0.8333567,0.0004724589,0.000008357761,0.0002884823,0.04895244],"genre_scores_gemma":[0.3117252,0.00002364653,0.00161004,0.000006904786,0.6863915,0.000004155484,0.00003428422,0.00004788281,0.0001564274],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.3757435,"threshold_uncertainty_score":0.9999243,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}