{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Naouel Moha","is_ca":true},{"name":"Yann‐Gaël Guéhéneuc","is_ca":true},{"name":"Anne-Françoise Le Meur","is_ca":false},{"name":"Laurence Duchien","is_ca":false},{"name":"Alban Tiberghien","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004053833,0.0009435167,0.0008888854,0.003097056,0.0004285831,0.001934662,0.000987153,0.001151822,0.0008784797],"category_scores_gemma":[0.02116224,0.000746831,0.001249469,0.001011565,0.0009688322,0.001673445,0.001702382,0.001385867,0.0005566704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007683745,"about_ca_system_score_gemma":0.001316212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009787827,"about_ca_topic_score_gemma":0.0009023357,"domain_scores_codex":[0.9939238,0.002887362,0.0005213122,0.0008422536,0.001586262,0.0002388958],"domain_scores_gemma":[0.9646791,0.02153185,0.003645501,0.006484644,0.003297214,0.0003617437],"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.0006787065,0.0007070034,0.04320674,0.0013585,0.0003148684,0.00150261,0.002290097,0.1076518,0.1635964,0.01629028,0.004517309,0.6578856],"study_design_scores_gemma":[0.00009296991,0.0003268146,0.009137727,0.0002087367,0.0001357236,0.001040694,0.0005128435,0.7877368,0.1790599,0.0131364,0.008511772,0.00009958038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1590098,0.0003513659,0.8298387,0.0002946749,0.00001927697,0.0001393224,0.000195954,0.008914248,0.001236495],"genre_scores_gemma":[0.5064663,0.0002589455,0.4906851,0.0001523476,0.00001599025,0.0001198167,0.0007397895,0.0007221814,0.0008395178],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004053833,"threshold_uncertainty_score":0.02143896,"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","authors":[{"name":"Juan Bicarregui","is_ca":false},{"name":"C. A. R. Hoare","is_ca":false},{"name":"Jim Woodcock","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04252172,0.001114549,0.001916526,0.004028948,0.001893965,0.009123042,0.007580749,0.004160102,0.008851981],"category_scores_gemma":[0.0779206,0.002248044,0.002384811,0.002458439,0.004360734,0.02316081,0.008308786,0.01160923,0.009292349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001976053,"about_ca_system_score_gemma":0.01173706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0021679,"about_ca_topic_score_gemma":0.001155359,"domain_scores_codex":[0.9653279,0.01351158,0.004032985,0.002458944,0.01321811,0.001450475],"domain_scores_gemma":[0.8961848,0.02997657,0.004476908,0.04033286,0.02597814,0.003050754],"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.0005048435,0.0006078241,0.002304659,0.0008938917,0.0001092312,0.001249369,0.001403284,0.02411198,0.01191269,0.4913593,0.07709616,0.3884468],"study_design_scores_gemma":[0.0004364563,0.000680329,0.000649972,0.001507029,0.0001682651,0.00149942,0.0005044893,0.188212,0.044359,0.2509538,0.5106876,0.0003416051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002866467,0.000391352,0.9709451,0.00295938,0.0008071585,0.0002611159,0.0002191571,0.01868076,0.002869571],"genre_scores_gemma":[0.02358875,0.000452554,0.9642041,0.0008914916,0.0002644045,0.0001995765,0.001062293,0.00580808,0.003528705],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04252172,"threshold_uncertainty_score":0.224879,"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","authors":[{"name":"Daniel Strüber","is_ca":false},{"name":"Julia Rubin","is_ca":true},{"name":"Thorsten Arendt","is_ca":false},{"name":"Marsha Chećhik","is_ca":true},{"name":"Gabriele Taentzer","is_ca":false},{"name":"Jennifer Plöger","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003642238,0.0004045881,0.0004171714,0.001279132,0.0006452562,0.002303942,0.001670684,0.001047537,0.00253373],"category_scores_gemma":[0.00953244,0.0004865338,0.001254615,0.001686581,0.004278257,0.002242199,0.002523089,0.002781878,0.000530354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00117271,"about_ca_system_score_gemma":0.001315668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001578387,"about_ca_topic_score_gemma":0.001060184,"domain_scores_codex":[0.9974491,0.0007463814,0.0002482902,0.0003541118,0.001067672,0.0001344354],"domain_scores_gemma":[0.9927096,0.004323787,0.0005198926,0.001406974,0.0009189374,0.0001208393],"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.00002294396,0.00006645366,0.0004266741,0.00009274272,0.00001988214,0.0002176323,0.000292367,0.08317798,0.004477166,0.8682547,0.000913395,0.04203805],"study_design_scores_gemma":[0.00002229241,0.00003319546,0.0001350252,0.00008223426,0.00001773715,0.0001937289,0.00005089827,0.48691,0.006390653,0.4924441,0.01369163,0.00002847694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002648606,0.00006199529,0.9956329,0.0001466524,0.00001644366,0.00003521138,0.00001776991,0.0002867136,0.00115365],"genre_scores_gemma":[0.200182,0.0003280329,0.7975861,0.0001134159,0.00006853951,0.0001958325,0.0001318799,0.0002130552,0.001181119],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003642238,"threshold_uncertainty_score":0.01926219,"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","authors":[{"name":"Juan de Lara","is_ca":false},{"name":"Hans Vangheluwe","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001247947,0.0006741532,0.0004278398,0.001247044,0.0003855437,0.00149841,0.0008012811,0.0006326718,0.002739619],"category_scores_gemma":[0.004721546,0.0004076215,0.001212235,0.0004908712,0.001086281,0.001013884,0.001083686,0.0009447267,0.000855061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007121446,"about_ca_system_score_gemma":0.0009488984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001842835,"about_ca_topic_score_gemma":0.001339939,"domain_scores_codex":[0.9986128,0.0004163061,0.0000919423,0.0002363271,0.0005261526,0.0001164972],"domain_scores_gemma":[0.9973616,0.001440006,0.0001754301,0.000439148,0.000546417,0.00003725737],"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.0003538168,0.0002805725,0.002791219,0.0008756953,0.0001588295,0.001336222,0.001573758,0.2590591,0.163088,0.198374,0.005617142,0.3664915],"study_design_scores_gemma":[0.00005678155,0.00008664579,0.0004934501,0.00007733492,0.00006434401,0.0002780511,0.0002218642,0.7075251,0.1573956,0.1101469,0.02360366,0.00005024573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01584704,0.00003729597,0.9773529,0.00006823919,0.00002311903,0.000131055,0.0001444071,0.004538862,0.001857059],"genre_scores_gemma":[0.3831,0.0001432453,0.6116881,0.00009400228,0.00001717128,0.0002335406,0.0009310675,0.001650895,0.002141946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002739619,"threshold_uncertainty_score":0.009164929,"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","authors":[{"name":"Piotr Nienaltowski","is_ca":false},{"name":"Bertrand Meyer","is_ca":false},{"name":"Jonathan S. Ostroff","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01035295,0.0007641682,0.0008061389,0.001630193,0.002788604,0.005264163,0.00191466,0.002496468,0.007147644],"category_scores_gemma":[0.01299433,0.000933164,0.002090622,0.001625783,0.01080803,0.01207114,0.005187107,0.005204272,0.001232681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002789367,"about_ca_system_score_gemma":0.003596257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003232574,"about_ca_topic_score_gemma":0.001554208,"domain_scores_codex":[0.9907677,0.003602032,0.0008272482,0.001169407,0.002847547,0.0007860675],"domain_scores_gemma":[0.9870244,0.006692934,0.0009935928,0.002847341,0.001770745,0.0006710113],"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.00000989491,0.000008222397,0.00006266814,0.00002979843,0.000004910421,0.00005874117,0.0001716365,0.001182431,0.0001646631,0.9942108,0.0007482745,0.00334791],"study_design_scores_gemma":[0.00002617882,0.00001331973,0.00003293884,0.00004650374,0.000008494811,0.0001260414,0.00006462355,0.00716729,0.0004516309,0.9625358,0.02951353,0.00001380107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006551482,0.0009481582,0.9563237,0.004182598,0.0003124267,0.0001770564,0.0001671917,0.0007358562,0.03060142],"genre_scores_gemma":[0.4564339,0.002192058,0.5113173,0.002688872,0.001012658,0.001099407,0.0004576929,0.0006241692,0.02417382],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01035295,"threshold_uncertainty_score":0.05475229,"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)","authors":[{"name":"Jürgen Dingel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00505053,0.0005563924,0.0007389798,0.0009006346,0.001654015,0.002135544,0.001818173,0.0007580763,0.004361641],"category_scores_gemma":[0.005260962,0.0006428512,0.001784137,0.00139588,0.003871386,0.003194206,0.002377537,0.002992808,0.0007382038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002660942,"about_ca_system_score_gemma":0.003645741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008267726,"about_ca_topic_score_gemma":0.006170162,"domain_scores_codex":[0.9970481,0.0008192647,0.000180355,0.0002941404,0.001375666,0.000282583],"domain_scores_gemma":[0.9969804,0.001663505,0.0001612266,0.0004092088,0.0006450855,0.0001405152],"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.00001504529,0.00001635501,0.00009219845,0.00003858343,0.000009904217,0.0000791476,0.0001893611,0.01006834,0.0007686389,0.9800643,0.0008094359,0.007848638],"study_design_scores_gemma":[0.00005570363,0.00002499273,0.00007449933,0.00003413412,0.00003351041,0.00007826966,0.00004679055,0.1189885,0.001719895,0.8535432,0.02537668,0.00002388675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00417438,0.000249858,0.9876987,0.0002960707,0.00007888464,0.00009420856,0.00006332734,0.0003462299,0.006998316],"genre_scores_gemma":[0.1961686,0.0007067976,0.7901313,0.0002860894,0.0002030739,0.0004724223,0.0002619395,0.0002893343,0.01148044],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008267726,"threshold_uncertainty_score":0.02671003,"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","authors":[{"name":"Eric C. R. Hehner","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005054845,0.0008495994,0.0008004858,0.002876635,0.002758927,0.008035411,0.00192812,0.003296694,0.01372563],"category_scores_gemma":[0.01060005,0.0005341603,0.001081405,0.001796695,0.01581323,0.01908005,0.00371933,0.005887819,0.001966115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004652448,"about_ca_system_score_gemma":0.002232725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002703108,"about_ca_topic_score_gemma":0.001294592,"domain_scores_codex":[0.9939838,0.002944467,0.0002419065,0.001057285,0.001426248,0.0003462244],"domain_scores_gemma":[0.9890361,0.007688089,0.0004659866,0.001058487,0.001201862,0.0005493916],"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.000001490726,0.000001674484,0.00001772245,0.000009416426,0.000001196442,0.000007448779,0.00005735403,0.0001950399,0.00001566533,0.9981377,0.0005705662,0.0009847149],"study_design_scores_gemma":[0.000002710307,0.000003036167,0.00002522272,0.00001755834,0.000001942029,0.00002234492,0.00004557702,0.001083798,0.00003386887,0.9841025,0.01465844,0.00000308528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008687112,0.009985128,0.580662,0.06597537,0.001612134,0.00007349107,0.0003164676,0.0002751373,0.3324131],"genre_scores_gemma":[0.7903568,0.01190255,0.1354458,0.01193638,0.00675907,0.0002689084,0.0003647259,0.0003272232,0.04263847],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01372563,"threshold_uncertainty_score":0.04591686,"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","authors":[{"name":"Jonathan S. Ostroff","is_ca":true},{"name":"Faraz Torshizi","is_ca":true},{"name":"Hai Feng Huang","is_ca":true},{"name":"Bernd Schoeller","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007155055,0.0004512383,0.0005464517,0.0007959741,0.002026089,0.003541265,0.001339376,0.001253463,0.004172211],"category_scores_gemma":[0.01255642,0.0005840479,0.001497116,0.0007772286,0.009500756,0.009334158,0.003895294,0.003995803,0.0004956592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001798806,"about_ca_system_score_gemma":0.002773518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003291534,"about_ca_topic_score_gemma":0.001448411,"domain_scores_codex":[0.9943449,0.002325301,0.0004129486,0.0007311802,0.001545582,0.0006400694],"domain_scores_gemma":[0.9873733,0.006881019,0.0007971429,0.003024259,0.001425151,0.0004991312],"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.00002253018,0.0000104798,0.0001918841,0.00004262243,0.000008018268,0.00009152815,0.0002609481,0.004031614,0.0006327868,0.9868347,0.0006237173,0.007249186],"study_design_scores_gemma":[0.00001854395,0.00002141822,0.0000546113,0.00003726103,0.00001136008,0.00007427774,0.00006729385,0.02244464,0.001717599,0.963544,0.01199469,0.00001430621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0182338,0.0006530018,0.965476,0.002838853,0.000193999,0.0000926331,0.00006252943,0.0005913647,0.01185787],"genre_scores_gemma":[0.6884571,0.001038023,0.2995797,0.001109569,0.0003316154,0.0003178879,0.0000977657,0.0003521417,0.008716139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007155055,"threshold_uncertainty_score":0.03784001,"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","authors":[{"name":"Hasan Ural","is_ca":true},{"name":"Craig Williams","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003599677,0.0007576636,0.0006451504,0.00143991,0.0008472105,0.0009056743,0.001210687,0.0009583494,0.00291212],"category_scores_gemma":[0.01391387,0.0005905373,0.0007427484,0.000706617,0.001913981,0.001638016,0.001612316,0.001579953,0.0006572129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007721831,"about_ca_system_score_gemma":0.001630411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009892602,"about_ca_topic_score_gemma":0.0009374146,"domain_scores_codex":[0.9962251,0.001431,0.0003488699,0.0006544677,0.001092928,0.0002476063],"domain_scores_gemma":[0.9810404,0.01187545,0.001370974,0.003074341,0.002189983,0.0004487901],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001125324,0.00059626,0.006710618,0.0006416083,0.00007510799,0.00152983,0.001712985,0.1756064,0.06326568,0.2819869,0.002930149,0.4638192],"study_design_scores_gemma":[0.0001940908,0.0007205314,0.0009064078,0.0002223749,0.00007876491,0.0006147409,0.0002137618,0.6400704,0.1165238,0.2251825,0.0151983,0.0000744734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04136954,0.00004627491,0.9549347,0.00007291621,0.00003193564,0.0001822007,0.00005735738,0.001999913,0.001305027],"genre_scores_gemma":[0.3429168,0.00005191545,0.6547126,0.00005783981,0.00002617325,0.0003027858,0.0003502646,0.0002353552,0.001346276],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003599677,"threshold_uncertainty_score":0.01903713,"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","authors":[{"name":"Richard F. Paige","is_ca":true},{"name":"Jonathan S. Ostroff","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008207604,0.0006190107,0.0009896891,0.002263114,0.001352574,0.002654373,0.001865368,0.00168251,0.003929259],"category_scores_gemma":[0.009115773,0.0009253218,0.002193574,0.001584764,0.002856496,0.003158734,0.001923956,0.002379189,0.001551151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001901212,"about_ca_system_score_gemma":0.001685982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004482484,"about_ca_topic_score_gemma":0.003391464,"domain_scores_codex":[0.995961,0.0009365225,0.0003993752,0.0003625542,0.001984316,0.0003562325],"domain_scores_gemma":[0.9958104,0.002104269,0.000333733,0.0006564931,0.0009318385,0.0001633576],"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.00006031512,0.0000509756,0.0001973834,0.0001885724,0.00003155981,0.0004440478,0.0003815645,0.02462887,0.004203432,0.9293912,0.003674231,0.03674779],"study_design_scores_gemma":[0.0001826582,0.00007406774,0.0002315864,0.0001849429,0.00008973735,0.000481659,0.0001180598,0.1903153,0.01225162,0.6569353,0.1390212,0.0001138708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00283338,0.0001762376,0.9887695,0.0001929029,0.0001469619,0.0001156137,0.0001158222,0.001665783,0.00598373],"genre_scores_gemma":[0.08278589,0.0004471916,0.9085692,0.000325798,0.0001648243,0.0003232861,0.0004364568,0.0005104576,0.006436775],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008207604,"threshold_uncertainty_score":0.04340649,"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","authors":[{"name":"Brijesh Dongol","is_ca":false},{"name":"Catherine Dubois","is_ca":false},{"name":"Stefan Hallerstede","is_ca":false},{"name":"Eric C. R. Hehner","is_ca":true},{"name":"Carroll Morgan","is_ca":false},{"name":"Péter Müller","is_ca":false},{"name":"Leila Ribeiro","is_ca":false},{"name":"Alexandra Silva","is_ca":false},{"name":"Graeme Smith","is_ca":false},{"name":"E.P. de Vink","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01275268,0.0007112625,0.0005818579,0.002767435,0.002681907,0.006176955,0.001219081,0.003361225,0.007567945],"category_scores_gemma":[0.01459343,0.0004328218,0.000646621,0.002791791,0.02415385,0.01128188,0.003406717,0.007860179,0.001836353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005796242,"about_ca_system_score_gemma":0.005157563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003031979,"about_ca_topic_score_gemma":0.002517926,"domain_scores_codex":[0.9932335,0.003999151,0.0003231562,0.0005077424,0.001577873,0.0003586481],"domain_scores_gemma":[0.9772105,0.0194122,0.000618097,0.0009091267,0.001275999,0.0005741678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004391401,0.00001759352,0.00008811042,0.0001263017,0.000002788248,0.00001776312,0.001261032,0.0003119737,0.00006861104,0.9680851,0.007201331,0.02281512],"study_design_scores_gemma":[0.000007393466,0.00001646303,0.0001157781,0.0006479538,0.000002839612,0.00005347929,0.0004710622,0.0004502606,0.00009891914,0.8677253,0.1303991,0.00001148814],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005316078,0.1165835,0.3239455,0.2305637,0.006410697,0.0001370715,0.0001058879,0.000528064,0.3164094],"genre_scores_gemma":[0.3713815,0.1964096,0.2556162,0.06066086,0.01333095,0.001201918,0.0003094836,0.000792524,0.100297],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01275268,"threshold_uncertainty_score":0.06744343,"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","authors":[{"name":"Hesham H. Hallal","is_ca":true},{"name":"Sergiy Boroday","is_ca":true},{"name":"Alexandre Petrenko","is_ca":true},{"name":"Andreas Ulrich","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009056193,0.0009722299,0.0008222097,0.00239902,0.001161693,0.003433842,0.003460031,0.001533259,0.002796126],"category_scores_gemma":[0.02396475,0.001025356,0.001792614,0.001546953,0.007478043,0.005410927,0.002918166,0.003080041,0.0003068343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002390568,"about_ca_system_score_gemma":0.003603893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004564278,"about_ca_topic_score_gemma":0.003557869,"domain_scores_codex":[0.9918521,0.00319804,0.0006976037,0.0009265151,0.002716832,0.0006088904],"domain_scores_gemma":[0.9756335,0.01639906,0.00151596,0.003534598,0.002542133,0.0003747263],"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.00007163372,0.0001650393,0.001192509,0.0001496619,0.00005208856,0.0005570883,0.0007520736,0.1362569,0.004845046,0.8306402,0.0005704399,0.02474718],"study_design_scores_gemma":[0.00005382565,0.00006022739,0.0001449443,0.00008937421,0.00003343341,0.0001559847,0.0001065815,0.6078041,0.007305249,0.3775786,0.006632859,0.00003481123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003390444,0.0000309959,0.9954092,0.0001304476,0.00001164362,0.00005780644,0.00003715714,0.0004495361,0.0004827609],"genre_scores_gemma":[0.2572143,0.0001394321,0.7404323,0.0001636385,0.00007630121,0.000422403,0.000209566,0.000198603,0.001143486],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009056193,"threshold_uncertainty_score":0.0478943,"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","authors":[{"name":"Gregor von Bochmann","is_ca":true},{"name":"Martin Hilscher","is_ca":false},{"name":"Sven Linker","is_ca":false},{"name":"Ernst-Rüdiger Olderog","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002783305,0.0006084179,0.000557749,0.0005020131,0.0006801886,0.001279781,0.001350236,0.001056505,0.00195584],"category_scores_gemma":[0.007439815,0.000608291,0.001116338,0.000263008,0.002081001,0.001379026,0.001724209,0.001101637,0.0002635673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009463816,"about_ca_system_score_gemma":0.002459845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003273155,"about_ca_topic_score_gemma":0.00376387,"domain_scores_codex":[0.9976981,0.000606593,0.0001966035,0.000433287,0.0008179339,0.0002475199],"domain_scores_gemma":[0.9946409,0.003344482,0.000501823,0.0008749588,0.0005476549,0.00009011335],"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.0002389686,0.0002569427,0.002942548,0.0004353246,0.0001006729,0.0006920247,0.0007399199,0.7781947,0.05811049,0.1087401,0.0005450003,0.04900323],"study_design_scores_gemma":[0.00005124689,0.00007686939,0.0001645043,0.0000215723,0.00003184997,0.00004205805,0.00005774115,0.9398667,0.03529198,0.02323893,0.001143822,0.00001286428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07288396,0.00004198988,0.9236758,0.00009708077,0.00002824859,0.0001448606,0.00005215359,0.001702787,0.001373179],"genre_scores_gemma":[0.8465016,0.00004749376,0.1523534,0.00004775664,0.000008752662,0.0001324148,0.00009315566,0.0001318394,0.0006836095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003273155,"threshold_uncertainty_score":0.01471967,"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","authors":[{"name":"Guy-Vincent Jourdan","is_ca":true},{"name":"Hasan Ural","is_ca":true},{"name":"Hüsnü Yenigün","is_ca":false},{"name":"Ji Chao Zhang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01910193,0.001916132,0.001859848,0.00533325,0.001933331,0.00568818,0.004451373,0.003020179,0.007531835],"category_scores_gemma":[0.1725464,0.002075762,0.002009767,0.003345575,0.0046773,0.01233037,0.005366741,0.009205994,0.002178696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003586403,"about_ca_system_score_gemma":0.004091706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001027009,"about_ca_topic_score_gemma":0.001290009,"domain_scores_codex":[0.9493449,0.01228689,0.004750672,0.00660126,0.0231771,0.003839195],"domain_scores_gemma":[0.5551005,0.3574417,0.01768842,0.04207852,0.02149656,0.006194373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004626485,0.0008085728,0.02404927,0.001559461,0.0003523867,0.0006152747,0.001676347,0.3538178,0.04880992,0.2818863,0.007241677,0.2745565],"study_design_scores_gemma":[0.0002036313,0.0007502641,0.003208052,0.0003838364,0.0001722449,0.0006002914,0.0002627476,0.6912856,0.05642772,0.2383526,0.008213779,0.0001393253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1322946,0.002201261,0.8472255,0.001597213,0.0002558284,0.0002810074,0.001142472,0.004730681,0.01027136],"genre_scores_gemma":[0.7010119,0.0009200721,0.2886414,0.0005513487,0.000451552,0.0007210064,0.00247732,0.001892043,0.003333337],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01910193,"threshold_uncertainty_score":0.1010219,"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","authors":[{"name":"Dimitrie O. Păun","is_ca":true},{"name":"Marsha Chećhik","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007388001,0.0006617404,0.001185582,0.002424105,0.003746673,0.004065557,0.001784407,0.002294434,0.008883892],"category_scores_gemma":[0.03431058,0.0007232233,0.001964664,0.001491535,0.0089584,0.0186036,0.009854094,0.005265416,0.001092139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002708057,"about_ca_system_score_gemma":0.001296502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002080748,"about_ca_topic_score_gemma":0.001281824,"domain_scores_codex":[0.9918106,0.002632222,0.0007980863,0.00204491,0.001814918,0.000899361],"domain_scores_gemma":[0.9737183,0.01656689,0.001632111,0.004313347,0.002906449,0.000862845],"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.00006284974,0.00002736664,0.0003960175,0.00008916925,0.00001289151,0.0002537428,0.0009441812,0.0009072792,0.0005470675,0.9802664,0.003987649,0.01250539],"study_design_scores_gemma":[0.000018141,0.0000192631,0.000127695,0.00005645257,0.00001179418,0.0001826598,0.000232095,0.004006461,0.0006832886,0.9767097,0.01793864,0.00001383468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1034786,0.008036594,0.6809962,0.02600135,0.002659753,0.0002538575,0.0007777594,0.001489879,0.176306],"genre_scores_gemma":[0.874487,0.00315807,0.08437799,0.004466825,0.002269042,0.0004167012,0.001187933,0.0009236945,0.02871289],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008883892,"threshold_uncertainty_score":0.03907192,"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","authors":[{"name":"Domagoj Babić","is_ca":false},{"name":"Byron Cook","is_ca":false},{"name":"Alan J. Hu","is_ca":true},{"name":"Zvonimir Rakamarić","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003008884,0.0008083038,0.0007034034,0.0007460396,0.00105321,0.001297184,0.001529122,0.0007583209,0.003651333],"category_scores_gemma":[0.01610241,0.0003395333,0.0008752471,0.0003807853,0.004880088,0.002219885,0.002487639,0.001778051,0.0008016499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554532,"about_ca_system_score_gemma":0.001934592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003310635,"about_ca_topic_score_gemma":0.001974845,"domain_scores_codex":[0.9955536,0.001122832,0.0002193582,0.0004969435,0.002094917,0.0005124597],"domain_scores_gemma":[0.9862163,0.009127734,0.0007756332,0.001388721,0.002170648,0.0003209872],"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.001251393,0.0004349089,0.01027731,0.000619721,0.0001160733,0.001718109,0.002132097,0.1904949,0.1357505,0.4930985,0.004117025,0.1599894],"study_design_scores_gemma":[0.0001018815,0.0001826299,0.0005888321,0.00005325086,0.00002934007,0.0001997413,0.0001337083,0.7202342,0.09681395,0.1774649,0.00415858,0.00003906378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09045764,0.00003857705,0.9015779,0.0001769026,0.00003122557,0.0001141606,0.00008087272,0.002426678,0.005096084],"genre_scores_gemma":[0.8089403,0.00005477861,0.1864463,0.0001563041,0.00003005438,0.0001346309,0.0002060599,0.0003835926,0.003648007],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003651333,"threshold_uncertainty_score":0.01591271,"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","authors":[{"name":"Claudio Menghi","is_ca":false},{"name":"Paola Spoletini","is_ca":false},{"name":"Marsha Chećhik","is_ca":true},{"name":"Carlo Ghezzi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01484172,0.001485737,0.0008599135,0.001829525,0.00107306,0.002333061,0.003804823,0.002093116,0.003935087],"category_scores_gemma":[0.01950228,0.001577111,0.002497979,0.0005382423,0.00342445,0.002266514,0.00372359,0.002926864,0.0007800946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002245982,"about_ca_system_score_gemma":0.005013297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005976043,"about_ca_topic_score_gemma":0.005235401,"domain_scores_codex":[0.9890882,0.005002924,0.0007769395,0.0008791491,0.003538468,0.0007143955],"domain_scores_gemma":[0.9846845,0.008881564,0.0009971128,0.002613762,0.002464597,0.0003585735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002073013,0.0002477331,0.001813531,0.0007381056,0.0001407048,0.0007155841,0.001041514,0.6442114,0.02349137,0.2039685,0.001734558,0.1216897],"study_design_scores_gemma":[0.00009393942,0.0001790786,0.0001640389,0.0002066176,0.0000495254,0.0001744472,0.00005666485,0.9261553,0.01487581,0.04326058,0.01472462,0.00005937231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004022749,0.00009319541,0.9935799,0.00007095534,0.00001317831,0.0001629092,0.00003126162,0.001161285,0.0008645894],"genre_scores_gemma":[0.1088924,0.0001137338,0.8892879,0.00007286944,0.00001364238,0.0002997373,0.0001687747,0.0002993872,0.000851543],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01484172,"threshold_uncertainty_score":0.07849145,"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","authors":[{"name":"Amel Mammar","is_ca":false},{"name":"Marc Frappier","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005310749,0.0005273819,0.0005326485,0.001512809,0.001066652,0.001982438,0.001463602,0.00115552,0.005394933],"category_scores_gemma":[0.01082112,0.0007611731,0.001051403,0.0006711528,0.002862964,0.003638131,0.002585982,0.002107939,0.0009632211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009285299,"about_ca_system_score_gemma":0.001689542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001996854,"about_ca_topic_score_gemma":0.00164476,"domain_scores_codex":[0.9973411,0.00138054,0.0001986749,0.0002475663,0.0006941757,0.0001379067],"domain_scores_gemma":[0.9868755,0.01098163,0.0004350567,0.0008449206,0.0006791799,0.0001836228],"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.0002119989,0.000333091,0.0008094046,0.0009368462,0.00008192882,0.001372441,0.001119364,0.08114396,0.03824775,0.6754022,0.0037317,0.1966093],"study_design_scores_gemma":[0.0002903773,0.0001393958,0.0002074006,0.0003762376,0.00004900468,0.0006873529,0.0001940697,0.6250395,0.05051119,0.288278,0.03414952,0.00007789773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003277098,0.00008309486,0.9939969,0.0001697319,0.00001794901,0.0001242531,0.00002886497,0.0006555153,0.001646662],"genre_scores_gemma":[0.1170217,0.0002486824,0.8807009,0.0001213641,0.00001784069,0.0002185114,0.00006096702,0.0002522431,0.001357815],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005394933,"threshold_uncertainty_score":0.02808625,"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","authors":[{"name":"M. Elleuch","is_ca":true},{"name":"Osman Hasan","is_ca":true},{"name":"Sofiène Tahar","is_ca":true},{"name":"Mohamed Abid","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009229672,0.0009303418,0.0006105519,0.00193496,0.0007518328,0.002855476,0.002412548,0.0009901102,0.002084777],"category_scores_gemma":[0.02659732,0.0008171728,0.001827375,0.001236658,0.004601414,0.004465505,0.002151797,0.002317235,0.0002568205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002273283,"about_ca_system_score_gemma":0.00185846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001535713,"about_ca_topic_score_gemma":0.001170459,"domain_scores_codex":[0.9901857,0.003211778,0.0006035061,0.001056151,0.004196964,0.0007458435],"domain_scores_gemma":[0.9568796,0.03426282,0.003611351,0.002161157,0.002743445,0.0003416474],"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.00006755629,0.0001234813,0.001760696,0.0002073094,0.00007862613,0.0003247815,0.000272626,0.2438709,0.005967075,0.7355833,0.0005035274,0.01124019],"study_design_scores_gemma":[0.00002561461,0.0000481201,0.000237218,0.00003389174,0.00003417033,0.00009670496,0.00003359241,0.7821041,0.004674298,0.2110141,0.001676829,0.00002131358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01518989,0.0001154077,0.9821839,0.0002619706,0.00002959305,0.00005311187,0.00005241851,0.0002831897,0.001830557],"genre_scores_gemma":[0.7830647,0.0003532481,0.2142106,0.0002187217,0.0001718137,0.0002889585,0.0001461747,0.0001819302,0.001363838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009229672,"threshold_uncertainty_score":0.04881179,"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","authors":[{"name":"Waqar Ahmad","is_ca":true},{"name":"Osman Hasan","is_ca":false},{"name":"Sofiène Tahar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001595347,0.0003752727,0.0003023207,0.0009033766,0.0003168064,0.0006595121,0.0006240158,0.0003692039,0.001392777],"category_scores_gemma":[0.004997001,0.0002052068,0.0006520437,0.0003637688,0.001703223,0.001103174,0.0007101027,0.0006815893,0.0001071878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001277921,"about_ca_system_score_gemma":0.000710211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00398826,"about_ca_topic_score_gemma":0.001924005,"domain_scores_codex":[0.998978,0.0004414937,0.00004517744,0.00009947681,0.0003361024,0.00009979295],"domain_scores_gemma":[0.996868,0.002295931,0.000314307,0.0002013586,0.0002756601,0.00004477404],"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.00005742194,0.00004839634,0.001524557,0.00006680853,0.00002678834,0.0002616279,0.0002589334,0.6663433,0.005504701,0.3141467,0.000302402,0.01145842],"study_design_scores_gemma":[0.000007496921,0.00001437237,0.0001663711,0.000006852911,0.000006477114,0.00001950906,0.00001923545,0.943435,0.001605036,0.05430808,0.0004067385,0.000004845572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09550147,0.00009112353,0.9011768,0.0001353761,0.00001229608,0.00003722164,0.00005706929,0.0002844319,0.002704232],"genre_scores_gemma":[0.9567487,0.00007696346,0.04194104,0.00002545685,0.00001516379,0.00005230793,0.00005522259,0.00003588488,0.001049248],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00398826,"threshold_uncertainty_score":0.009272039,"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","authors":[{"name":"Patrice Chalin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.06412879,0.0003867803,0.0007804619,0.002114051,0.001337186,0.007533325,0.003175021,0.003012041,0.003697124],"category_scores_gemma":[0.2517447,0.0008745768,0.0008049491,0.001399282,0.006270586,0.01514497,0.002831579,0.002132947,0.0009584644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00207259,"about_ca_system_score_gemma":0.002739209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001127979,"about_ca_topic_score_gemma":0.0009348214,"domain_scores_codex":[0.9202753,0.05096139,0.004945879,0.003555183,0.01864443,0.001617814],"domain_scores_gemma":[0.6859086,0.2207613,0.01254535,0.04228623,0.03647599,0.002022489],"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.0009139372,0.0007278834,0.03322729,0.0008702987,0.000111599,0.0007902274,0.01558633,0.01942637,0.01822291,0.7312144,0.006481781,0.172427],"study_design_scores_gemma":[0.0002255902,0.0008382688,0.004885596,0.0007922866,0.0001194234,0.001183882,0.0110711,0.1882273,0.04219211,0.7124997,0.03779286,0.0001719842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1821532,0.0006196061,0.7921838,0.00687728,0.00008573957,0.0002798581,0.0001950632,0.00313444,0.01447087],"genre_scores_gemma":[0.7891669,0.000201282,0.2081133,0.0007978553,0.00004312161,0.0002560868,0.000269982,0.0003853723,0.0007662077],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06412879,"threshold_uncertainty_score":0.3391495,"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","authors":[{"name":"Marc Frappier","is_ca":true},{"name":"Frédéric Gervais","is_ca":false},{"name":"Régine Laleau","is_ca":false},{"name":"Jérémy Milhau","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069895,0.0008241027,0.0005817572,0.001529544,0.0009874898,0.002017396,0.001426568,0.001542614,0.00605672],"category_scores_gemma":[0.02157836,0.0009491552,0.001881076,0.001220677,0.003514309,0.004519557,0.002900978,0.002687032,0.001647182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001131284,"about_ca_system_score_gemma":0.001831279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002566311,"about_ca_topic_score_gemma":0.002643082,"domain_scores_codex":[0.9887962,0.003743327,0.002268982,0.001216753,0.003423284,0.0005515004],"domain_scores_gemma":[0.9781075,0.01061988,0.001498888,0.005242588,0.004129627,0.0004015448],"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.0001710569,0.00007191279,0.002091859,0.0004081081,0.00004434967,0.0007223896,0.001700748,0.01562069,0.01071469,0.8810059,0.003253192,0.08419508],"study_design_scores_gemma":[0.0001608415,0.0002154143,0.0005865741,0.0002870643,0.0001047488,0.001078799,0.0005381387,0.1072428,0.0294326,0.7260643,0.1341992,0.00008953032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006569308,0.00005949581,0.9870301,0.0002137867,0.00005584207,0.0002580634,0.0001828107,0.001686303,0.003944242],"genre_scores_gemma":[0.1643633,0.0002190012,0.829028,0.0002155893,0.00005176196,0.0006489095,0.0007936754,0.0006955174,0.003984342],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0069895,"threshold_uncertainty_score":0.03696442,"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","authors":[{"name":"Zinovy Diskin","is_ca":true},{"name":"Harald König","is_ca":false},{"name":"Mark Lawford","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004488098,0.0006600605,0.0009980191,0.001206794,0.001484018,0.004471584,0.001877557,0.001612047,0.007656869],"category_scores_gemma":[0.01241513,0.0007336141,0.001350233,0.001042269,0.004044808,0.007524356,0.007256678,0.002975772,0.0009114111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002095332,"about_ca_system_score_gemma":0.001868701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001834689,"about_ca_topic_score_gemma":0.001530948,"domain_scores_codex":[0.9950192,0.001261719,0.0004255035,0.0009619241,0.001731838,0.0005998415],"domain_scores_gemma":[0.9922321,0.002264288,0.0008871584,0.002925506,0.001214532,0.0004764975],"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.0002361972,0.00009172578,0.001788418,0.000101851,0.00004759828,0.000608311,0.0007919623,0.03507774,0.008302283,0.9227574,0.0008677266,0.02932874],"study_design_scores_gemma":[0.00009089931,0.0001582142,0.0004422263,0.00008057134,0.00007307281,0.0004933669,0.0003982064,0.3836414,0.03444887,0.5634452,0.01664747,0.00008054476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04505748,0.0001263196,0.9440244,0.0005346189,0.0001286033,0.0001075414,0.0000592657,0.001223632,0.008738045],"genre_scores_gemma":[0.7688849,0.0001278436,0.2208415,0.000271501,0.0001035097,0.0001607902,0.00009811851,0.000378108,0.009133794],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007656869,"threshold_uncertainty_score":0.0256148,"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","authors":[{"name":"Hanifa Boucheneb","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009874683,0.0004157876,0.0005392308,0.0005859145,0.0003724702,0.0007627266,0.001021085,0.0003494324,0.00161669],"category_scores_gemma":[0.002571489,0.0003011666,0.0007150246,0.0006058412,0.001225943,0.001173325,0.001340044,0.0008731988,0.0003068051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006510849,"about_ca_system_score_gemma":0.001214816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001801815,"about_ca_topic_score_gemma":0.001110959,"domain_scores_codex":[0.9993256,0.0002027667,0.00003577342,0.0001249819,0.0002238175,0.00008707348],"domain_scores_gemma":[0.998582,0.000721625,0.0001237882,0.0003104511,0.000176551,0.00008558976],"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.0003057856,0.0001533508,0.001594231,0.0002182925,0.00003792384,0.0003921863,0.0004606568,0.5498924,0.0434216,0.281775,0.001217946,0.1205307],"study_design_scores_gemma":[0.00002513823,0.00007635741,0.0001524976,0.00001414551,0.00001648094,0.00006828679,0.00003192301,0.9215928,0.01432634,0.06083409,0.002847988,0.00001396089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02468775,0.00002217273,0.9735935,0.00002460625,0.000009067096,0.00003410504,0.00004247137,0.0004499895,0.00113633],"genre_scores_gemma":[0.5006733,0.0001099154,0.4967704,0.00004590668,0.00001376246,0.0002265241,0.0003869781,0.0002400393,0.001533138],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001801815,"threshold_uncertainty_score":0.005408347,"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","authors":[{"name":"Daniel Sinnig","is_ca":false},{"name":"Ferhat Khendek","is_ca":true},{"name":"Patrice Chalin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007296658,0.001122291,0.0006540692,0.003204915,0.00194182,0.004182037,0.002136514,0.001986407,0.003525467],"category_scores_gemma":[0.008829835,0.0009377112,0.002756465,0.002640825,0.004650726,0.009675004,0.003648296,0.003232743,0.0008668313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002804267,"about_ca_system_score_gemma":0.002412664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00634256,"about_ca_topic_score_gemma":0.006567973,"domain_scores_codex":[0.9911098,0.003335299,0.001316356,0.0008860736,0.002750534,0.0006019648],"domain_scores_gemma":[0.9911711,0.004051315,0.0007352527,0.001799321,0.001865316,0.0003776673],"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.000012839,0.00002033851,0.0001005676,0.00005076194,0.000008506375,0.000125231,0.0005097477,0.006148235,0.0005230485,0.9872487,0.0005371077,0.004714922],"study_design_scores_gemma":[0.00003787264,0.00004870917,0.0001258573,0.000083454,0.00003239434,0.000235132,0.0003477955,0.07192441,0.002658025,0.8869844,0.0374859,0.00003599201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008113919,0.000137766,0.9818228,0.0004841544,0.00005935257,0.000204644,0.0002798081,0.0005476454,0.008349803],"genre_scores_gemma":[0.3241233,0.0005173339,0.6656604,0.000326494,0.0001598613,0.001130254,0.001504306,0.0003480208,0.006230064],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007296658,"threshold_uncertainty_score":0.03858882,"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","authors":[{"name":"Pablo F. Castro","is_ca":false},{"name":"Nazareno Aguirre","is_ca":false},{"name":"Carlos G. López Pombo","is_ca":false},{"name":"T. S. E. Maibaum","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004105628,0.0003444765,0.000435146,0.001934115,0.001570357,0.005606949,0.001065288,0.001396652,0.006048407],"category_scores_gemma":[0.004825593,0.0005611845,0.001119702,0.001376548,0.007293077,0.007658069,0.0046841,0.002752843,0.0009886577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003187264,"about_ca_system_score_gemma":0.001816547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004131464,"about_ca_topic_score_gemma":0.00280105,"domain_scores_codex":[0.9958568,0.00164724,0.0003100012,0.0005641414,0.001195042,0.0004268851],"domain_scores_gemma":[0.9957463,0.001955574,0.0003901224,0.0006316832,0.000937593,0.0003386016],"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.000004659493,0.000004090048,0.00008215253,0.00001070539,0.000001937417,0.00002183974,0.0003026779,0.0003202329,0.0001965511,0.9973865,0.0001504889,0.001518201],"study_design_scores_gemma":[0.00002338686,0.00002154177,0.0001799664,0.00003020994,0.000008056501,0.00004613803,0.0003809616,0.003748365,0.0005909205,0.9763576,0.01859741,0.00001545321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0787226,0.001084885,0.8262917,0.004157029,0.0002210364,0.0001302841,0.0003997554,0.001454705,0.08753798],"genre_scores_gemma":[0.8556992,0.0007012139,0.1281346,0.0007818929,0.0001764827,0.0002723405,0.000473249,0.0002018227,0.01355924],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006048407,"threshold_uncertainty_score":0.02312535,"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","authors":[{"name":"Emil Sekerinski","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01198389,0.0005268907,0.0007652284,0.001257519,0.001331221,0.00405319,0.001871064,0.001244642,0.004946378],"category_scores_gemma":[0.03187529,0.0007720587,0.001525048,0.002045542,0.005603499,0.008970711,0.004261252,0.002215802,0.0007108319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001707108,"about_ca_system_score_gemma":0.00241271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004303803,"about_ca_topic_score_gemma":0.00335577,"domain_scores_codex":[0.9901766,0.005585759,0.0005871647,0.0009647328,0.001974009,0.0007117596],"domain_scores_gemma":[0.9707848,0.01870673,0.001663477,0.00592461,0.00263868,0.0002817225],"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.0001689623,0.0000491116,0.001032123,0.0002095701,0.00003073469,0.0001672407,0.001397464,0.02810218,0.003546413,0.9084868,0.001473528,0.05533586],"study_design_scores_gemma":[0.00007021616,0.0001125654,0.0001926733,0.0002258913,0.00006130416,0.0001458626,0.0005225283,0.251694,0.01537924,0.7060484,0.02549477,0.00005264578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01862898,0.0002558676,0.9748423,0.0006907433,0.00005304276,0.00008310686,0.0001085848,0.001330421,0.004007113],"genre_scores_gemma":[0.4148081,0.0004919177,0.5805914,0.000497431,0.00004404925,0.0001961489,0.0003483206,0.0004686075,0.00255399],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01198389,"threshold_uncertainty_score":0.06337762,"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","authors":[{"name":"Martin v. Mohrenschildt","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001402526,0.0004386728,0.0006599517,0.001494618,0.001188937,0.003177046,0.0009466178,0.0004645703,0.008604717],"category_scores_gemma":[0.003490844,0.0004657147,0.00111041,0.001416155,0.001596783,0.005296963,0.001814894,0.00074887,0.001816974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000976134,"about_ca_system_score_gemma":0.001230281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001678994,"about_ca_topic_score_gemma":0.001480003,"domain_scores_codex":[0.9977828,0.0004496456,0.0002091578,0.0004634683,0.0008873612,0.0002076553],"domain_scores_gemma":[0.9984031,0.0006646153,0.0001308117,0.0002786698,0.0004422849,0.00008048554],"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.000239984,0.00008936063,0.001401444,0.000305473,0.00007178712,0.0004040786,0.0005095118,0.02882071,0.01223629,0.8212466,0.003262617,0.1314123],"study_design_scores_gemma":[0.00007361308,0.0001543586,0.0005416297,0.00009575744,0.0001507193,0.0005759288,0.0002369037,0.1673987,0.03702199,0.7158284,0.0778515,0.00007040519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03361447,0.000264784,0.9513864,0.0001466607,0.00009875318,0.0001079058,0.0002201527,0.001884907,0.01227598],"genre_scores_gemma":[0.506736,0.0007105907,0.4735295,0.0002405866,0.0001690278,0.0001901238,0.001406971,0.0006809847,0.01633627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008604717,"threshold_uncertainty_score":0.02878559,"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","authors":[{"name":"Hallal","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008665362,0.001383349,0.001028908,0.002868405,0.00171864,0.004007123,0.004454415,0.001958892,0.003777044],"category_scores_gemma":[0.02194895,0.001215919,0.002636925,0.002269666,0.008567495,0.006982862,0.003358575,0.004800752,0.0005782405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002773234,"about_ca_system_score_gemma":0.004768277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004565734,"about_ca_topic_score_gemma":0.003898859,"domain_scores_codex":[0.992644,0.00266286,0.0007065754,0.0009943468,0.002441969,0.0005502697],"domain_scores_gemma":[0.9809656,0.01273495,0.001304924,0.002764751,0.001844672,0.0003850798],"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.00003214808,0.000124783,0.0006502703,0.0001540329,0.00003821745,0.0003736208,0.0006025088,0.06016042,0.003347412,0.9118695,0.0006202254,0.02202689],"study_design_scores_gemma":[0.00004912179,0.00009526277,0.0001870309,0.0001593119,0.00005124188,0.0003524449,0.000166266,0.3598166,0.006394914,0.6171086,0.01556183,0.00005729036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008203975,0.00003661378,0.9982887,0.0001084463,0.00001130382,0.0000502879,0.00002673081,0.0002305291,0.0004269354],"genre_scores_gemma":[0.08939059,0.0002342314,0.90792,0.0001581667,0.00009394233,0.000505062,0.0001866808,0.0001583336,0.001352913],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008665362,"threshold_uncertainty_score":0.04582739,"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","authors":[{"name":"Sidi Mohamed Beillahi","is_ca":true},{"name":"Mohamed Yousri Mahmoud","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004271494,0.001090792,0.0006936378,0.001554078,0.001335293,0.003015514,0.002726262,0.001509303,0.003524619],"category_scores_gemma":[0.00615261,0.000881455,0.002975215,0.001077631,0.004599233,0.004889464,0.002655646,0.003045015,0.0005772774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00311913,"about_ca_system_score_gemma":0.003578903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007873957,"about_ca_topic_score_gemma":0.006222265,"domain_scores_codex":[0.9967411,0.001238403,0.0001909578,0.0004348758,0.001012404,0.0003823395],"domain_scores_gemma":[0.9966568,0.001939388,0.0002828659,0.0005515991,0.0004425232,0.0001267351],"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.00001581673,0.00003813006,0.0001346154,0.00006286823,0.0000172697,0.0001169959,0.0001639474,0.05551037,0.001326959,0.935173,0.0005334037,0.006906664],"study_design_scores_gemma":[0.0000302814,0.00003281724,0.00007096012,0.00005512073,0.00002990096,0.00009480049,0.00006695496,0.3807067,0.002513669,0.6040242,0.0123508,0.00002371685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003814261,0.0001348089,0.9928707,0.0003480474,0.00002544883,0.00009008329,0.00007799063,0.0003308745,0.002307752],"genre_scores_gemma":[0.3169477,0.000547428,0.6769676,0.0003372046,0.0001518657,0.0004921996,0.0003183924,0.000196583,0.004041017],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007873957,"threshold_uncertainty_score":0.02263093,"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","authors":[{"name":"Ramiro Demasi","is_ca":false},{"name":"Pablo F. Castro","is_ca":false},{"name":"T. S. E. Maibaum","is_ca":true},{"name":"Nazareno Aguirre","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002965776,0.0007705765,0.0004152556,0.001025226,0.0007295538,0.001543932,0.001108052,0.0008652061,0.0033435],"category_scores_gemma":[0.006125297,0.0003609565,0.001179107,0.0006478226,0.004549775,0.0031916,0.001613646,0.001966405,0.000554301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001427512,"about_ca_system_score_gemma":0.0009177375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001410264,"about_ca_topic_score_gemma":0.0009767578,"domain_scores_codex":[0.9963626,0.001419909,0.0003680224,0.0005992316,0.0009261642,0.0003241155],"domain_scores_gemma":[0.993686,0.003663546,0.0006287557,0.001168005,0.0006879304,0.000165774],"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.00004815205,0.00002501256,0.0003818432,0.00005754939,0.00001801745,0.0000959685,0.0003499051,0.04262083,0.004948865,0.9453267,0.0003005411,0.00582646],"study_design_scores_gemma":[0.00003832746,0.0001112267,0.0002610235,0.00006013413,0.00004244345,0.0002059732,0.0001403493,0.2096963,0.01532766,0.7534516,0.02062932,0.00003566324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02442018,0.0002243957,0.9687584,0.000222489,0.00004783979,0.00007342949,0.00006606187,0.0005655013,0.005621737],"genre_scores_gemma":[0.7683449,0.0003503157,0.2267557,0.0001956499,0.00008822232,0.0003254331,0.0002020758,0.0002735964,0.003464016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0033435,"threshold_uncertainty_score":0.01568472,"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","authors":[{"name":"Umair Siddique","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00751276,0.000586341,0.0006153196,0.002070252,0.001563279,0.005064283,0.001954456,0.0008690564,0.003044587],"category_scores_gemma":[0.0110499,0.000575645,0.001803878,0.002419106,0.005290889,0.008076491,0.003507303,0.002106917,0.0003956031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003161323,"about_ca_system_score_gemma":0.002098778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00591773,"about_ca_topic_score_gemma":0.004065986,"domain_scores_codex":[0.9953294,0.00152573,0.0004441082,0.0004975937,0.001608092,0.0005950786],"domain_scores_gemma":[0.9847782,0.01097517,0.0009570468,0.001597408,0.001379049,0.0003131774],"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.00003040862,0.0000418371,0.0005658855,0.00007520022,0.00001500215,0.0001678226,0.0005713549,0.01105331,0.0007684362,0.9784958,0.0004339523,0.007780948],"study_design_scores_gemma":[0.00003723684,0.00003701333,0.0003810566,0.0000542821,0.00003513966,0.0001248194,0.0002607619,0.1143846,0.002437728,0.8743015,0.007917739,0.00002816325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05151657,0.0004553941,0.9375534,0.001160752,0.0000427354,0.0001291677,0.0002963976,0.0008226709,0.008022893],"genre_scores_gemma":[0.7575951,0.0006406259,0.2361108,0.000528682,0.0001793965,0.0002248345,0.0005448855,0.0002451061,0.003930568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00751276,"threshold_uncertainty_score":0.03973174,"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","authors":[{"name":"Borzoo Bonakdarpour","is_ca":true},{"name":"Sandeep S. Kulkarni","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009056756,0.0004164957,0.0002899065,0.0003192846,0.0002118106,0.0004325863,0.0006513278,0.0004166303,0.001944114],"category_scores_gemma":[0.00308757,0.0002118466,0.0004974778,0.0002481553,0.0007417667,0.0006248891,0.0007200791,0.000682714,0.0002486567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004854864,"about_ca_system_score_gemma":0.001004526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001012723,"about_ca_topic_score_gemma":0.001373469,"domain_scores_codex":[0.9993063,0.0001952043,0.00005195587,0.00009917498,0.000238989,0.0001084323],"domain_scores_gemma":[0.9981572,0.001009909,0.0002632461,0.0003260957,0.000200349,0.00004321445],"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.000369251,0.0001962282,0.001033549,0.0003410467,0.00004039828,0.0002650098,0.0003584382,0.7080303,0.1078734,0.0982095,0.000857287,0.08242562],"study_design_scores_gemma":[0.0000593762,0.0001693958,0.0002016012,0.00002112405,0.00002153283,0.00005962537,0.00003485301,0.9153634,0.05755249,0.02321947,0.003281025,0.0000160457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07885265,0.00006824868,0.9166348,0.0001362427,0.00002872608,0.0001021532,0.00005483256,0.001210983,0.002911284],"genre_scores_gemma":[0.7407492,0.0000877682,0.2569322,0.0001064782,0.00001170911,0.0001356795,0.0001091293,0.0001382527,0.00172965],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001944114,"threshold_uncertainty_score":0.006503761,"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","authors":[{"name":"Ivan Cibrario Bertolotti","is_ca":false},{"name":"Luca Durante","is_ca":false},{"name":"Riccardo Sisto","is_ca":false},{"name":"Adriano Valenzano","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004810766,0.0005896139,0.0009207351,0.002102307,0.0008862523,0.004719957,0.002680126,0.001375321,0.002621538],"category_scores_gemma":[0.01645532,0.000578889,0.001513746,0.002367801,0.002945421,0.011061,0.004724592,0.002962342,0.0006936309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002020054,"about_ca_system_score_gemma":0.001946292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001710568,"about_ca_topic_score_gemma":0.001463295,"domain_scores_codex":[0.9934077,0.002991419,0.0004240362,0.0006636231,0.002026008,0.0004871988],"domain_scores_gemma":[0.9884729,0.006675389,0.0006868287,0.003040359,0.0009411051,0.000183315],"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.0002973163,0.0001215268,0.000654151,0.0002007806,0.00008061706,0.0002663128,0.00060659,0.1460152,0.006756649,0.7292056,0.001398652,0.1143965],"study_design_scores_gemma":[0.00002958401,0.00005010156,0.000101291,0.00004251452,0.0000547956,0.0001076834,0.0001160612,0.5138076,0.008823718,0.4737818,0.003056935,0.00002782972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01918265,0.00008977097,0.9781232,0.0004292838,0.0000186252,0.00006031716,0.00007490052,0.0004140672,0.001607219],"genre_scores_gemma":[0.5568798,0.000347112,0.4385991,0.0001782372,0.00007244913,0.0001803077,0.0003778893,0.0001533927,0.00321183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004810766,"threshold_uncertainty_score":0.02544206,"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","authors":[{"name":"Akshay Gopalakrishnan","is_ca":true},{"name":"Clark Verbrugge","is_ca":true},{"name":"Mark Batty","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002758934,0.0005089966,0.0005300935,0.0007485043,0.0009215316,0.002342924,0.001457097,0.00106439,0.003318847],"category_scores_gemma":[0.009239999,0.000503732,0.001366281,0.0007727403,0.004257895,0.004499305,0.003031516,0.002743974,0.0006602354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001415689,"about_ca_system_score_gemma":0.002439511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002475293,"about_ca_topic_score_gemma":0.001724228,"domain_scores_codex":[0.9962577,0.001112634,0.0003146522,0.0007137107,0.001140249,0.0004611356],"domain_scores_gemma":[0.9952155,0.002015744,0.0004807192,0.00172355,0.0004775048,0.00008692293],"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.00006616626,0.00005827976,0.0006797728,0.0001551673,0.00002934308,0.0001543049,0.0005213863,0.0211754,0.005459608,0.9371518,0.001235857,0.03331289],"study_design_scores_gemma":[0.00003038911,0.00005654167,0.0002474863,0.00005715963,0.00004014325,0.0001540961,0.0001244466,0.03654778,0.01066402,0.9342012,0.01785493,0.00002186296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02851256,0.0004290704,0.9472561,0.001149606,0.00009117841,0.0001580535,0.0001801695,0.001775166,0.02044812],"genre_scores_gemma":[0.6004562,0.0007524023,0.3825941,0.0008796763,0.0002435298,0.0006069003,0.000467089,0.001162832,0.0128373],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003318847,"threshold_uncertainty_score":0.0145908,"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","authors":[{"name":"Mohamed Saleh","is_ca":true},{"name":"Mourad Debbabi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007049358,0.001925346,0.001486588,0.0023582,0.001909629,0.006104163,0.004176798,0.002228828,0.003607874],"category_scores_gemma":[0.00714142,0.001526051,0.003109006,0.002458924,0.006464764,0.006605047,0.003121336,0.004729817,0.0009354945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003813997,"about_ca_system_score_gemma":0.0056412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01087095,"about_ca_topic_score_gemma":0.009804955,"domain_scores_codex":[0.9931548,0.003409747,0.0006769507,0.000599762,0.001642918,0.000515869],"domain_scores_gemma":[0.996303,0.002111539,0.0003023536,0.0005046378,0.0005609377,0.0002174839],"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.00001758017,0.00003211808,0.00007378861,0.00009653309,0.00002504636,0.0001351853,0.0001772688,0.03216895,0.0007357516,0.961974,0.0005289406,0.004034851],"study_design_scores_gemma":[0.00006809503,0.00006001147,0.00006695792,0.0001229564,0.00006681707,0.0001203821,0.0001124993,0.229191,0.001659863,0.7473146,0.02117188,0.0000449849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002076867,0.0003298004,0.9937683,0.0003651491,0.0000612955,0.0001437992,0.00009787084,0.0002418513,0.002915056],"genre_scores_gemma":[0.1577456,0.001183312,0.8353378,0.0003808532,0.0001857882,0.0008940194,0.00037159,0.0001596588,0.003741388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01087095,"threshold_uncertainty_score":0.03728098,"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","authors":[{"name":"Sa’ed Abed","is_ca":false},{"name":"Otmane Aı̈t Mohamed","is_ca":true},{"name":"Ghiath Al Sammane","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003860137,0.0009190115,0.0007998633,0.001473497,0.0007250082,0.001321143,0.001788163,0.0007799898,0.003794778],"category_scores_gemma":[0.008839778,0.000678395,0.002624219,0.0005562646,0.002732083,0.002023429,0.002437723,0.002361912,0.0006499475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001223691,"about_ca_system_score_gemma":0.001668275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002793229,"about_ca_topic_score_gemma":0.00292931,"domain_scores_codex":[0.9926646,0.002557053,0.0003351374,0.0006286925,0.003238334,0.0005760789],"domain_scores_gemma":[0.9899501,0.006687922,0.0004663222,0.002087608,0.0007152698,0.00009276971],"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.0007388724,0.0007823863,0.003597333,0.0009719198,0.0004607894,0.0009972629,0.00104512,0.3498415,0.1431529,0.3515607,0.002399083,0.1444521],"study_design_scores_gemma":[0.0001913567,0.0002361609,0.0006283405,0.00005973486,0.000135401,0.0001663067,0.00007154326,0.7567026,0.1008492,0.134839,0.006062213,0.00005808233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03804207,0.00006318543,0.9554949,0.0001077491,0.00003200476,0.0001409877,0.00006985098,0.004264372,0.001784859],"genre_scores_gemma":[0.5794194,0.000114651,0.4171499,0.0001539196,0.00003149362,0.0002668152,0.0003171441,0.0006716425,0.001874994],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003860137,"threshold_uncertainty_score":0.02041459,"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","authors":[{"name":"Raphaël Chane-Yack-Fa","is_ca":true},{"name":"Marc Frappier","is_ca":true},{"name":"Amel Mammar","is_ca":false},{"name":"Alain Finkel","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005935459,0.0006072677,0.0008856459,0.0009210211,0.0007208037,0.002150404,0.001839631,0.0009521922,0.002774981],"category_scores_gemma":[0.02515253,0.0006430252,0.001761595,0.0009007282,0.002454738,0.00599791,0.002850555,0.001890847,0.0002487905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001968731,"about_ca_system_score_gemma":0.002453722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002052786,"about_ca_topic_score_gemma":0.001392673,"domain_scores_codex":[0.9909024,0.003888488,0.0006691425,0.001288568,0.002566742,0.0006846079],"domain_scores_gemma":[0.9724777,0.01911307,0.001765176,0.00395645,0.002293867,0.0003937864],"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.0004546952,0.0001640111,0.002467871,0.0003588812,0.0001580659,0.0007657254,0.0004373874,0.3125189,0.02819072,0.6111776,0.0009081727,0.04239793],"study_design_scores_gemma":[0.00005657848,0.00008483195,0.0003007165,0.00004275494,0.00003452107,0.000106733,0.00006100207,0.7618799,0.01620439,0.2192586,0.001944735,0.0000252982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08774035,0.0001352021,0.9078196,0.0003560664,0.00002824254,0.0001218749,0.0002113116,0.0009948496,0.002592521],"genre_scores_gemma":[0.8695616,0.0001354365,0.128876,0.0000712652,0.00003123887,0.0001695076,0.0002950598,0.0001110072,0.0007490821],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005935459,"threshold_uncertainty_score":0.03139007,"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","authors":[{"name":"Marsha Chećhik","is_ca":true},{"name":"Joost-Pieter Katoen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003321605,0.002050506,0.001556813,0.006285451,0.002402735,0.006449884,0.002141875,0.002722558,0.1919962],"category_scores_gemma":[0.01289093,0.0006450797,0.001396901,0.004863657,0.001091828,0.005671374,0.004232446,0.00400093,0.1347852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002705255,"about_ca_system_score_gemma":0.002654319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003437089,"about_ca_topic_score_gemma":0.005865519,"domain_scores_codex":[0.996563,0.0006013191,0.0003707432,0.0005112667,0.001638071,0.0003155502],"domain_scores_gemma":[0.9925015,0.001738921,0.0004785809,0.0007163121,0.003311543,0.001253118],"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.00002086031,0.000009044147,0.00003231482,0.000106785,0.000002017512,0.00002511602,0.00002228201,0.00002451442,0.0001605785,0.001686809,0.969533,0.02837661],"study_design_scores_gemma":[0.000002403029,0.00001113116,0.0001265108,0.00008138773,0.00000142068,0.0000629948,0.00001269292,0.00002554916,0.00005076345,0.0006505788,0.99897,0.000004584436],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.001339302,0.03669828,0.02036832,0.06232212,0.5287586,0.0006476443,0.00871556,0.004023468,0.3371267],"genre_scores_gemma":[0.006179887,0.02274521,0.01028667,0.02947046,0.2487094,0.000817757,0.0174439,0.004856882,0.6594899],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.1919962,"threshold_uncertainty_score":0.6422914,"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","authors":[{"name":"Zinovy Diskin","is_ca":true},{"name":"Harald König","is_ca":false},{"name":"Mark Lawford","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002831037,0.003966015,0.003799401,0.004903309,0.005846601,0.005216915,0.00505633,0.01037557,0.195614],"category_scores_gemma":[0.0613882,0.002018857,0.002692416,0.005180246,0.003112242,0.005662781,0.004335065,0.01074554,0.09191235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005615162,"about_ca_system_score_gemma":0.004623233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02068557,"about_ca_topic_score_gemma":0.02740707,"domain_scores_codex":[0.9946824,0.0006870294,0.0009265893,0.001009863,0.002025253,0.0006689326],"domain_scores_gemma":[0.9638075,0.006672881,0.001981968,0.004264337,0.02166435,0.001609024],"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.0001393937,0.00001613226,0.0001337726,0.000245579,0.00003229353,0.0004172812,0.0001031119,0.0002417866,0.0003497775,0.003655888,0.983794,0.01087098],"study_design_scores_gemma":[0.000101894,0.00005811071,0.001425865,0.0002435244,0.00004366018,0.000908416,0.0002398305,0.003054869,0.002287976,0.004703441,0.9868107,0.000121703],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.0003229826,0.0006352797,0.00502264,0.02109505,0.966543,0.00003773654,0.001350159,0.002387467,0.002605865],"genre_scores_gemma":[0.09224728,0.005985615,0.05125946,0.05238375,0.3212369,0.0004976848,0.009348364,0.01067262,0.4563683],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.195614,"threshold_uncertainty_score":0.6543939,"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","authors":[{"name":"Daniel Kroening","is_ca":false},{"name":"Tiziana Margaria","is_ca":false},{"name":"Jim Woodcock","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002767173,0.001936045,0.001861737,0.002337647,0.00232575,0.005575067,0.002026966,0.006321861,0.04566054],"category_scores_gemma":[0.01574045,0.0006224675,0.001359962,0.001106848,0.001348259,0.003544847,0.001093482,0.008636209,0.03959663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001652707,"about_ca_system_score_gemma":0.001766061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008324828,"about_ca_topic_score_gemma":0.001713274,"domain_scores_codex":[0.9972128,0.0002796712,0.0003304843,0.0004688744,0.001496716,0.0002114478],"domain_scores_gemma":[0.9865651,0.003309147,0.0007253521,0.0005849949,0.007010005,0.001805388],"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.00001340253,0.00000497459,0.0000105544,0.00007221744,0.000003868347,0.00004997269,0.000005455854,0.00001101941,0.00003724891,0.0002327465,0.9948356,0.00472286],"study_design_scores_gemma":[0.0000127069,0.000007745719,0.00009498146,0.0001435499,0.00000909206,0.0001528206,0.00001518635,0.00003992963,0.00008159477,0.0004658219,0.9989711,0.000005395731],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.00004518524,0.002726154,0.0001435132,0.01964575,0.9714446,0.00001961865,0.00008681769,0.00007794469,0.005810346],"genre_scores_gemma":[0.0006775981,0.003784613,0.0001426215,0.01337199,0.9446965,0.00002539019,0.0001179612,0.00007900282,0.03710439],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.9543394,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}