{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":28,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":28,"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":"b4452ab816ee","filters":{"venue":"Formal Methods in System Design"}},"results":[{"id":"W2117013774","doi":"10.1007/s10703-008-0049-6","title":"Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning","year":2008,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":129,"is_retracted":false,"has_abstract":false,"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":"Divide and conquer algorithms; Computer science; Component (thermodynamics); Counterexample; Property (philosophy); Process (computing); Scalability; Alphabet; Model checking; Theoretical computer science; Process calculus; Algorithm; Artificial intelligence; Programming language; Mathematics","authors":[{"name":"Corina S. Păsăreanu","is_ca":false},{"name":"Dimitra Giannakopoulou","is_ca":false},{"name":"Mihaela Gheorghiu Bobaru","is_ca":true},{"name":"Jamieson M. Cobleigh","is_ca":false},{"name":"Howard Barringer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05480365477555006,"gpt":0.3464262572074728,"spread":0.2916226024319228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006435745,0.001063703,0.001464033,0.001300423,0.001502773,0.002566836,0.003995461,0.002066488,0.007030066],"category_scores_gemma":[0.03130167,0.001168358,0.001711029,0.0009014077,0.003552292,0.00569971,0.005287134,0.004101628,0.001433505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001771535,"about_ca_system_score_gemma":0.005295394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006401555,"about_ca_topic_score_gemma":0.009609075,"domain_scores_codex":[0.994132,0.002642466,0.0003270787,0.001021763,0.001329502,0.0005471163],"domain_scores_gemma":[0.9792108,0.01456502,0.001012753,0.00335794,0.001472334,0.0003811894],"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.001007666,0.0004054194,0.002667548,0.0003412669,0.0001532834,0.0002164824,0.0006741969,0.184724,0.007167767,0.1319235,0.00802456,0.6626943],"study_design_scores_gemma":[0.00008390859,0.00004901034,0.0001031986,0.00002787951,0.00002396852,0.00003938561,0.00006592118,0.8524445,0.005525797,0.1401993,0.00142132,0.00001579053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008049882,0.00005072123,0.9884778,0.0003709286,0.00001729242,0.00005638404,0.00003241064,0.001789348,0.001155217],"genre_scores_gemma":[0.2195965,0.00005818302,0.7777379,0.0002825695,0.00003660113,0.0001425761,0.0001489328,0.0004054528,0.001591474],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007030066,"threshold_uncertainty_score":0.03403592,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065086898","doi":"10.1007/s10703-011-0132-2","title":"Explaining counterexamples using causality","year":2011,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Novo Nordisk Fonden; Azrieli Foundation","keywords":"Counterexample; TRACE (psycholinguistics); Computer science; Causality (physics); Set (abstract data type); Theoretical computer science; Algorithm; Feature (linguistics); Programming language; Discrete mathematics; Mathematics","authors":[{"name":"Ilan Beer","is_ca":false},{"name":"Shoham Ben-David","is_ca":false},{"name":"Hana Chockler","is_ca":false},{"name":"Avigail Orni","is_ca":false},{"name":"Richard Trefler","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3656074904811601,"gpt":0.4137656834194675,"spread":0.04815819293830742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006216609,0.00145224,0.0009317704,0.0029402,0.001556867,0.002664884,0.0016401,0.003020688,0.01190498],"category_scores_gemma":[0.05777351,0.001118632,0.001893097,0.001317873,0.004856687,0.009423453,0.003459459,0.004191761,0.0006395034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001152938,"about_ca_system_score_gemma":0.001675438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002231878,"about_ca_topic_score_gemma":0.002216048,"domain_scores_codex":[0.993489,0.003188075,0.0004020366,0.0007612641,0.001569889,0.0005897771],"domain_scores_gemma":[0.9278431,0.0624136,0.001825269,0.005636012,0.001904937,0.0003772281],"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.0003112839,0.0001463931,0.002415688,0.000363968,0.00006177228,0.001102483,0.001277577,0.03578976,0.00315903,0.9236122,0.002191701,0.02956822],"study_design_scores_gemma":[0.0001219319,0.00007086445,0.0003158713,0.000165934,0.00009636149,0.0004191664,0.0003092258,0.1951784,0.01158443,0.7815413,0.01013728,0.00005912449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04665187,0.0002321381,0.9386559,0.001773067,0.0002986867,0.0001363497,0.0001177814,0.002383058,0.009751115],"genre_scores_gemma":[0.7854453,0.0003081057,0.2087484,0.0005155609,0.00007899291,0.000224724,0.0001838002,0.0006769624,0.003818072],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01190498,"threshold_uncertainty_score":0.03982615,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973223152","doi":"10.1007/s10703-014-0215-y","title":"Runtime enforcement of timed properties revisited","year":2014,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Enforcement; Computer science; Soundness; Correctness; Context (archaeology); Sequence (biology); Property (philosophy); Programming language","authors":[{"name":"Srinivas Pinisetty","is_ca":false},{"name":"Ylìès Falcone","is_ca":false},{"name":"Thierry Jéron","is_ca":false},{"name":"Hervé Marchand","is_ca":false},{"name":"Antoine Rollet","is_ca":false},{"name":"Omer Nguena Timo","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07481876807600887,"gpt":0.337618955834488,"spread":0.2628001877584791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01274101,0.0007665543,0.00144553,0.001074691,0.001318302,0.004283031,0.003319006,0.001910729,0.004706726],"category_scores_gemma":[0.03683512,0.001135893,0.001644554,0.0008764538,0.005267492,0.00625377,0.003690955,0.006894028,0.000714321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001569836,"about_ca_system_score_gemma":0.002909503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002179763,"about_ca_topic_score_gemma":0.002560331,"domain_scores_codex":[0.9870798,0.005284623,0.000846568,0.001369251,0.004022851,0.001396912],"domain_scores_gemma":[0.9557035,0.02585607,0.001806135,0.01337143,0.002635956,0.0006269464],"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.000471272,0.0001874519,0.0008403671,0.0003832978,0.0001033397,0.0005573303,0.001131928,0.03528006,0.01343526,0.8632386,0.00260849,0.08176249],"study_design_scores_gemma":[0.0003477199,0.0002311336,0.0004447695,0.0003042384,0.0002473429,0.0003520507,0.000347134,0.3333853,0.04084322,0.5953755,0.02801935,0.0001022692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02834542,0.0007269809,0.9541383,0.001338848,0.0004788481,0.00007230194,0.00004571818,0.003054909,0.01179862],"genre_scores_gemma":[0.74888,0.0007231854,0.2411907,0.0004933048,0.0003212838,0.0001687907,0.0001058393,0.001321492,0.006795369],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01274101,"threshold_uncertainty_score":0.06738174,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2565985959","doi":"10.1007/s10703-016-0263-6","title":"Z3str2: an efficient solver for strings, regular expressions, and length constraints","year":2016,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Web Application Security Vulnerabilities","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular expression; Computer science; String (physics); Satisfiability modulo theories; Solver; Theoretical computer science; Predicate (mathematical logic); Algorithm; Mathematics; Programming language","authors":[{"name":"Yunhui Zheng","is_ca":false},{"name":"Vijay Ganesh","is_ca":true},{"name":"Sanu Subramanian","is_ca":true},{"name":"Omer Tripp","is_ca":false},{"name":"Murphy Berzish","is_ca":true},{"name":"Julian Dolby","is_ca":false},{"name":"Xiangyu Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06174490093142226,"gpt":0.3572660233340219,"spread":0.2955211224025996,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001777287,0.002839719,0.001322983,0.002093888,0.001044367,0.003314736,0.00448277,0.002190013,0.04934187],"category_scores_gemma":[0.009017603,0.001998155,0.002677505,0.002564949,0.001128694,0.004300178,0.003945227,0.00285081,0.01148269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001696426,"about_ca_system_score_gemma":0.004580345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01021206,"about_ca_topic_score_gemma":0.02254399,"domain_scores_codex":[0.9977067,0.00051845,0.0002210169,0.0003967694,0.0008807026,0.0002763787],"domain_scores_gemma":[0.99626,0.002736286,0.0001695529,0.0003617584,0.000396752,0.00007549697],"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.0007103584,0.0002808994,0.002188087,0.00274518,0.0003498289,0.0008795093,0.0005868967,0.1124083,0.01190406,0.174006,0.1625223,0.5314186],"study_design_scores_gemma":[0.0005664125,0.00006278656,0.0002444228,0.0002025195,0.0001348113,0.000344964,0.0002723347,0.7067233,0.02167835,0.1644721,0.1052018,0.00009630693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003578879,0.0002188717,0.9490981,0.0004368822,0.0001210181,0.0002030531,0.003679975,0.03382483,0.00883844],"genre_scores_gemma":[0.05627024,0.00035323,0.9103714,0.0005314371,0.00007544918,0.0005163832,0.006929396,0.01220067,0.01275175],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04934187,"threshold_uncertainty_score":0.165065,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059949763","doi":"10.1007/s10703-006-0016-z","title":"Data structures for symbolic multi-valued model-checking","year":2006,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Theoretical computer science; Computer science; Binary decision diagram; Negation; Boolean function; Model checking; Mathematics; Algebra over a field; Algorithm; Programming language; Pure mathematics","authors":[{"name":"Marsha Chećhik","is_ca":true},{"name":"Arie Gurfinkel","is_ca":true},{"name":"Benet Devereux","is_ca":true},{"name":"Albert Lai","is_ca":true},{"name":"Steve Easterbrook","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.258464842643244,"gpt":0.4376819177729501,"spread":0.179217075129706,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003819337,0.001758349,0.001893789,0.002292193,0.001212442,0.004686311,0.004339509,0.002200566,0.00983526],"category_scores_gemma":[0.02107059,0.001855848,0.002491616,0.002758058,0.003516628,0.01040671,0.005396983,0.004814457,0.002831442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002004317,"about_ca_system_score_gemma":0.002025563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001663182,"about_ca_topic_score_gemma":0.001871484,"domain_scores_codex":[0.9946855,0.001566821,0.0008304961,0.0008050987,0.001741988,0.0003699756],"domain_scores_gemma":[0.9847689,0.009053403,0.0007863328,0.004113663,0.001093268,0.0001844722],"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.0004308202,0.0001220729,0.0007421097,0.0006327057,0.0001091711,0.0002030595,0.0005186319,0.05878425,0.004627082,0.8175287,0.004034247,0.1122671],"study_design_scores_gemma":[0.00009627598,0.00004474854,0.00006393571,0.0001608512,0.00007115395,0.00005373728,0.00006222432,0.1437137,0.01291982,0.8321583,0.01061124,0.00004408164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003452959,0.0001470278,0.9915489,0.0001569242,0.0000535129,0.00007232117,0.0004546187,0.002736407,0.001377297],"genre_scores_gemma":[0.2869191,0.0004434942,0.703238,0.0003573996,0.00008894093,0.001150416,0.002306363,0.001901396,0.003594848],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00983526,"threshold_uncertainty_score":0.03290224,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1000312060","doi":"10.1007/s10703-015-0226-3","title":"Runtime verification with minimal intrusion through parallelism","year":2015,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Computer science; Scalability; Overhead (engineering); Runtime verification; Exploit; Set (abstract data type); Multi-core processor; Parallelism (grammar); Parametric statistics; Parallel computing; Embedded system; Formal verification; Operating system; Programming language","authors":[{"name":"Shay Berkovich","is_ca":false},{"name":"Borzoo Bonakdarpour","is_ca":true},{"name":"Sebastian Fischmeister","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.122386090137632,"gpt":0.3704939878079849,"spread":0.2481078976703528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004257911,0.0009770031,0.001206719,0.0007901328,0.001103651,0.00177288,0.002395671,0.001034757,0.00382957],"category_scores_gemma":[0.01698572,0.001228537,0.002359294,0.0005209082,0.003461459,0.005025073,0.006114552,0.003570338,0.0008448401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001225444,"about_ca_system_score_gemma":0.002529198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009996783,"about_ca_topic_score_gemma":0.001472247,"domain_scores_codex":[0.9915283,0.002594459,0.0004730674,0.001366262,0.003225192,0.0008128176],"domain_scores_gemma":[0.9868646,0.006017901,0.0006686929,0.005429018,0.0007848323,0.0002349928],"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.001491391,0.0004458369,0.003280914,0.0007421501,0.000278394,0.0007757029,0.001002759,0.2394558,0.05329493,0.5343624,0.003712478,0.1611572],"study_design_scores_gemma":[0.0001586971,0.0001459497,0.0002851722,0.00007086019,0.0001149514,0.0001663157,0.00006255238,0.5057625,0.05388666,0.4348381,0.004463774,0.00004460495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03132165,0.00006213598,0.9599859,0.0002902316,0.00005359108,0.0001018333,0.000073492,0.003894139,0.004217105],"genre_scores_gemma":[0.7075368,0.00006665939,0.2881055,0.0001692574,0.00004147131,0.0002098748,0.0001708019,0.0009324333,0.002767182],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004257911,"threshold_uncertainty_score":0.02251828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2913086526","doi":"10.1023/a:1026218512171","title":"Hazard Algebras","year":2003,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Hazard; SIGNAL (programming language); Ternary operation; Computer science; Energy (signal processing); Algorithm; Computer engineering; Electronic engineering; Arithmetic; Mathematics; Engineering; Programming language; Statistics","authors":[{"name":"Janusz Brzozowski","is_ca":true},{"name":"Zoltán Ésik","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06146538210206001,"gpt":0.3461092963738174,"spread":0.2846439142717574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001289329,0.0006547247,0.0005858207,0.001160736,0.001366483,0.002119409,0.0009458294,0.0008241683,0.03440813],"category_scores_gemma":[0.003558156,0.0004002652,0.0008605476,0.0007761939,0.001876183,0.003561656,0.001736057,0.002274972,0.005632033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001087357,"about_ca_system_score_gemma":0.001105572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007836176,"about_ca_topic_score_gemma":0.0005405322,"domain_scores_codex":[0.9990421,0.0002070511,0.00005081492,0.0001870034,0.0003894423,0.0001235671],"domain_scores_gemma":[0.9985586,0.0005001893,0.0001374728,0.0003700839,0.0003091197,0.0001245555],"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.00001191863,0.000009446447,0.00004395812,0.00001905015,0.000004670243,0.00001377565,0.00004663204,0.0007424688,0.000255606,0.989572,0.001593972,0.007686484],"study_design_scores_gemma":[0.00001224831,0.00001330148,0.00004979254,0.000009761294,0.000008037772,0.0000423641,0.00003523776,0.004845128,0.0007595248,0.9739096,0.02030636,0.000008457208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01352382,0.000867627,0.7817199,0.001639544,0.0004814656,0.0002131633,0.0005951651,0.0009119357,0.2000474],"genre_scores_gemma":[0.6235626,0.001693623,0.09952934,0.001098665,0.0008192022,0.0003949892,0.001032321,0.0004131807,0.2714561],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03440813,"threshold_uncertainty_score":0.1151066,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971059059","doi":"10.1007/s10703-012-0182-0","title":"Time-triggered runtime verification","year":2013,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Runtime verification; Computer science; Overhead (engineering); Benchmark (surveying); Disjoint sets; Set (abstract data type); Formal verification; Event (particle physics); Model checking; Bounded function; Distributed computing; Real-time computing; Embedded system; Programming language","authors":[{"name":"Borzoo Bonakdarpour","is_ca":true},{"name":"Samaneh Navabpour","is_ca":true},{"name":"Sebastian Fischmeister","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04806893277459231,"gpt":0.3334275702699164,"spread":0.2853586374953241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003461887,0.001202075,0.0008792388,0.001042859,0.000675594,0.002075345,0.00212289,0.001357626,0.009938914],"category_scores_gemma":[0.01069591,0.0007385694,0.001718699,0.0005353255,0.001754846,0.003262668,0.002458294,0.002605706,0.002515227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001025983,"about_ca_system_score_gemma":0.001522459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006354786,"about_ca_topic_score_gemma":0.0007532897,"domain_scores_codex":[0.993374,0.001779295,0.0003711862,0.001132746,0.002666489,0.0006762425],"domain_scores_gemma":[0.9916435,0.003799257,0.0004680096,0.00287278,0.000975949,0.000240419],"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.001452836,0.0002320814,0.0009667373,0.0007418094,0.0001789798,0.001035832,0.0006600553,0.06765895,0.09817053,0.6698186,0.007762469,0.1513211],"study_design_scores_gemma":[0.0002726445,0.0002642176,0.0004412809,0.0001485446,0.0001997527,0.0004988693,0.00008631052,0.4821746,0.159317,0.3224237,0.0340641,0.0001089515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00993693,0.0001455797,0.974874,0.0001598952,0.0001947949,0.0001014498,0.0001118871,0.005419352,0.009056124],"genre_scores_gemma":[0.6763523,0.000254724,0.3068484,0.0003240165,0.0001400146,0.0003073587,0.000392756,0.00194057,0.01343984],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009938914,"threshold_uncertainty_score":0.03324902,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967747780","doi":"10.1007/s10703-005-2256-8","title":"Formalization of Fixed-Point Arithmetic in HOL","year":2005,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Saturation arithmetic; Arithmetic; Correctness; Fixed-point arithmetic; Fixed point; HOL; Quantization (signal processing); Subtraction; Multiplication (music); Computer science; Division (mathematics); Mathematics; Arbitrary-precision arithmetic; Algorithm; Floating point; Programming language","authors":[{"name":"Behzad Akbarpour","is_ca":true},{"name":"Sofiène Tahar","is_ca":true},{"name":"Abdelkader Dekdouk","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04486791107813676,"gpt":0.3591851560632732,"spread":0.3143172449851365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002418226,0.0006995592,0.0007135315,0.001385501,0.001010145,0.003546123,0.002096567,0.0008596493,0.007696569],"category_scores_gemma":[0.00377407,0.0005227507,0.001439501,0.0009910922,0.004543575,0.004704881,0.00246706,0.003383748,0.001344549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001498848,"about_ca_system_score_gemma":0.00139108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001233792,"about_ca_topic_score_gemma":0.0010917,"domain_scores_codex":[0.9982497,0.0004247116,0.0001473301,0.0002547331,0.0007064153,0.0002171299],"domain_scores_gemma":[0.9981627,0.0008174743,0.0001062174,0.0004399532,0.0004103459,0.00006327944],"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.00001624674,0.00001087211,0.00005100901,0.00005554715,0.000007210103,0.00002867687,0.0001338095,0.002292338,0.0004945741,0.9878281,0.0005725943,0.00850899],"study_design_scores_gemma":[0.00002582126,0.00002162012,0.00006680589,0.0000418915,0.00001882066,0.00005412392,0.00005568172,0.01215705,0.001882666,0.9742522,0.01140779,0.00001553501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01013545,0.0003729641,0.9624166,0.0005435675,0.0001691176,0.00006117596,0.0001464015,0.0008427509,0.02531201],"genre_scores_gemma":[0.5860705,0.001120536,0.3916471,0.0008048541,0.0004882488,0.0003080175,0.0005842698,0.0007875116,0.0181891],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007696569,"threshold_uncertainty_score":0.0257476,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087115620","doi":"10.1007/s10703-006-0023-0","title":"Designing communicating transaction processes by supervisory control theory","year":2006,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Supervisory control; Supervisory control theory; Computer science; Database transaction; Bridging (networking); Control (management); Set (abstract data type); Process (computing); Distributed computing; Control logic; Event (particle physics); Theoretical computer science; Programming language; Artificial intelligence; Computer network","authors":[{"name":"Lei Feng","is_ca":true},{"name":"W.M. Wonham","is_ca":true},{"name":"P. S. Thiagarajan","is_ca":false}],"retraction":null,"screen_n_in":0,"score":{"opus":0.06565192373603344,"gpt":0.3183433128496665,"spread":0.252691389113633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003658784,0.0007466311,0.0008224498,0.00060299,0.0009630352,0.001999736,0.001970478,0.001478376,0.003346267],"category_scores_gemma":[0.007126535,0.001137715,0.00124933,0.0006212998,0.003302014,0.002996955,0.001695907,0.002128626,0.0006516224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006891782,"about_ca_system_score_gemma":0.001854306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001071452,"about_ca_topic_score_gemma":0.001119859,"domain_scores_codex":[0.9970081,0.001076,0.0002220993,0.0004033103,0.001037243,0.0002532338],"domain_scores_gemma":[0.9963754,0.002390376,0.000257744,0.0005264213,0.0003571633,0.00009287167],"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.0002311369,0.0001661701,0.000758487,0.0005435202,0.0001074874,0.0003341747,0.001478334,0.3264946,0.01788713,0.564123,0.00119162,0.08668425],"study_design_scores_gemma":[0.0001561536,0.0001608272,0.0001153322,0.0000891805,0.00008441821,0.00009996937,0.0001511937,0.7106003,0.01648505,0.2648726,0.007147641,0.00003751033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004813843,0.00005633338,0.993795,0.00005413412,0.00001797313,0.00006146514,0.000005750159,0.0002103545,0.0009850219],"genre_scores_gemma":[0.3597785,0.0003310712,0.6361426,0.0001210019,0.00005177467,0.0006072768,0.00006635192,0.0001878638,0.002713633],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003658784,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1666486534","doi":"10.1023/a:1021736013555","title":"Mexitl: Multimedia in Executable Interval Temporal Logic","year":2003,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Interval temporal logic; Notation; Computer science; Formalism (music); Temporal logic; Theoretical computer science; Programming language; Algorithm; Mathematics; Arithmetic","authors":[{"name":"Howard Bowman","is_ca":false},{"name":"Helen Cameron","is_ca":true},{"name":"Peter R. King","is_ca":true},{"name":"Simon Thompson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1502935729165406,"gpt":0.4425998256417204,"spread":0.2923062527251798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001069827,0.0007428533,0.0004416519,0.0007364201,0.0004075071,0.001919843,0.001547135,0.0006798008,0.01492691],"category_scores_gemma":[0.003688019,0.0006785202,0.0009079514,0.0004673318,0.0007509631,0.002530595,0.00128646,0.001749835,0.002513959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006384602,"about_ca_system_score_gemma":0.000595308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001003889,"about_ca_topic_score_gemma":0.001275912,"domain_scores_codex":[0.9991634,0.0002330149,0.00006677159,0.0001189298,0.0003357793,0.00008213524],"domain_scores_gemma":[0.9991344,0.00053965,0.00008932101,0.0001097914,0.00009571994,0.00003113537],"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.0006297497,0.0001370188,0.001094316,0.001072986,0.00007849764,0.0007487951,0.0008672323,0.04195078,0.01984998,0.6263806,0.02461916,0.2825709],"study_design_scores_gemma":[0.0002516132,0.0001899072,0.0003807887,0.0003329201,0.0001531686,0.0005698029,0.0001601733,0.4567913,0.05264789,0.2967133,0.1917325,0.00007664578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003616381,0.00009092308,0.9799661,0.0001110066,0.00005049761,0.00005637935,0.0004247366,0.01158659,0.004097369],"genre_scores_gemma":[0.2348923,0.0003667768,0.743644,0.0004069349,0.0001449478,0.0005402937,0.002014427,0.006712601,0.01127764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01492691,"threshold_uncertainty_score":0.04993552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2791546773","doi":"10.1007/s10703-018-0317-z","title":"Inferring event stream abstractions","year":2018,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research","keywords":"Computer science; Programming language; Scala; Event (particle physics); Specification language; Notation; Theoretical computer science; Java","authors":[{"name":"Sean Kauffman","is_ca":true},{"name":"Klaus Havelund","is_ca":false},{"name":"Rajeev Joshi","is_ca":false},{"name":"Sebastian Fischmeister","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06975814659087953,"gpt":0.3957318738214263,"spread":0.3259737272305468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003764231,0.001166779,0.0008603725,0.00312678,0.0009020357,0.00324207,0.001698623,0.001468567,0.004587329],"category_scores_gemma":[0.02323595,0.001133599,0.002441822,0.001742786,0.001156166,0.004607612,0.003133629,0.002538381,0.001191041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001344961,"about_ca_system_score_gemma":0.002430482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00436613,"about_ca_topic_score_gemma":0.005088728,"domain_scores_codex":[0.9957445,0.001024746,0.0002996793,0.0008816755,0.001679761,0.0003696089],"domain_scores_gemma":[0.9902749,0.005704624,0.000618609,0.002055868,0.001113956,0.0002321182],"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.001007479,0.0005012226,0.0329391,0.0007723569,0.0004833917,0.001642588,0.001640606,0.1906118,0.02636193,0.4178826,0.01173919,0.3144177],"study_design_scores_gemma":[0.00005501276,0.00006239318,0.001928612,0.00007948748,0.0001590852,0.0001855235,0.0002303979,0.7530177,0.01872554,0.2110302,0.01448928,0.00003677159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02735193,0.0001215443,0.9654915,0.0003215436,0.0000846027,0.0001340648,0.0008037666,0.003212696,0.0024784],"genre_scores_gemma":[0.4322628,0.0003874589,0.5593423,0.0001872182,0.0001255409,0.0001599003,0.003135657,0.0005913973,0.003807746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004587329,"threshold_uncertainty_score":0.01990736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053340187","doi":"10.1023/a:1008795229459","title":"Delay-Insensitivity and Semi-Modularity","year":2000,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Correctness; Asynchronous communication; Equivalence (formal languages); Inertial frame of reference; Computer science; Modularity (biology); Modular design; Electronic circuit; Bisimulation; Component (thermodynamics); Theoretical computer science; Topology (electrical circuits); Algorithm; Mathematics; Discrete mathematics; Programming language; Physics; Engineering; Electrical engineering; Telecommunications","authors":[{"name":"Janusz Brzozowski","is_ca":true},{"name":"Hao Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05309760259252033,"gpt":0.3447944458955521,"spread":0.2916968433030317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004084856,0.0008248,0.0009165979,0.001036579,0.0007397643,0.001461325,0.001471001,0.0009803398,0.003244014],"category_scores_gemma":[0.01485324,0.001250492,0.001475828,0.0006215723,0.004425826,0.005143018,0.003259378,0.002439141,0.000662639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008466072,"about_ca_system_score_gemma":0.001016939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003651489,"about_ca_topic_score_gemma":0.0002930513,"domain_scores_codex":[0.996769,0.0008803348,0.0002231631,0.0006950993,0.001107077,0.0003253938],"domain_scores_gemma":[0.9808772,0.01298044,0.001408704,0.00278364,0.001553737,0.0003963396],"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.0001417556,0.00005930881,0.0005236903,0.0003074084,0.00007533308,0.0002261718,0.0006339935,0.03873502,0.01052122,0.9198624,0.0004856854,0.02842793],"study_design_scores_gemma":[0.00006685364,0.0001050021,0.0002303967,0.00005126702,0.00009399676,0.0003575963,0.00006397595,0.06633638,0.01550622,0.9125184,0.004631905,0.00003796545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01616678,0.0001802798,0.9790715,0.000147685,0.00003563134,0.00003954908,0.00002728404,0.0002840791,0.004047215],"genre_scores_gemma":[0.7912922,0.0005595356,0.2011313,0.0002390414,0.0001016522,0.0003166107,0.00007175653,0.0003299922,0.005957776],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004084856,"threshold_uncertainty_score":0.02160305,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2754637624","doi":"10.1007/s10703-017-0298-3","title":"Non-intrusive runtime monitoring through power consumption to enforce safety and security properties in embedded systems","year":2017,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tracing; Correctness; Control flow graph; Power consumption; Usability; Runtime verification; Real-time computing; Embedded system; Formal verification; Power (physics); Programming language; Operating system","authors":[{"name":"Carlos Moreno","is_ca":true},{"name":"Sebastian Fischmeister","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06240086683733612,"gpt":0.3729549848982103,"spread":0.3105541180608742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002917527,0.0009249728,0.0005007352,0.0009963361,0.0004458954,0.001328586,0.001245786,0.0006843872,0.001276571],"category_scores_gemma":[0.01142697,0.0007664063,0.0005802407,0.0003406306,0.001671925,0.002536028,0.001134805,0.001775764,0.0002745528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007923885,"about_ca_system_score_gemma":0.001317879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008256103,"about_ca_topic_score_gemma":0.00141964,"domain_scores_codex":[0.9969935,0.001106686,0.0001919379,0.0003603772,0.001044826,0.0003026553],"domain_scores_gemma":[0.9878105,0.006714644,0.001363193,0.003054493,0.000906323,0.0001508235],"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.0007158069,0.0007226795,0.009806757,0.000584564,0.0001561681,0.0003670591,0.00096785,0.4584554,0.1253253,0.1573768,0.002894998,0.2426265],"study_design_scores_gemma":[0.00003143114,0.0001120814,0.000694576,0.00004617964,0.00004980559,0.00007550869,0.00003510492,0.9174658,0.04757284,0.03249208,0.001403122,0.00002153151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08635803,0.0002722828,0.9072361,0.0002515835,0.00006396761,0.00006883166,0.00003807275,0.002980971,0.002730172],"genre_scores_gemma":[0.9052925,0.0001109053,0.09256606,0.0001101721,0.00003202002,0.00007814601,0.00003523584,0.0004137306,0.001361157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002917527,"threshold_uncertainty_score":0.01542956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030659368","doi":"10.1007/s10703-013-0197-1","title":"Model checking approach to automated planning","year":2013,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Model checking; Process (computing); Domain (mathematical analysis); Field (mathematics); Automated planning and scheduling; State (computer science); State space; Software engineering; Artificial intelligence; Theoretical computer science; Programming language","authors":[{"name":"Yi Li","is_ca":true},{"name":"Jin Song Dong","is_ca":false},{"name":"Jing Sun","is_ca":false},{"name":"Yang Liu","is_ca":false},{"name":"Jun Sun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1266746391251695,"gpt":0.3628655870095945,"spread":0.236190947884425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004587242,0.001428208,0.001428159,0.002688194,0.00128867,0.003166432,0.004156062,0.001637583,0.006982084],"category_scores_gemma":[0.01818573,0.001432769,0.002802615,0.001618776,0.004385375,0.004249447,0.002321747,0.00566764,0.0008925969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003063006,"about_ca_system_score_gemma":0.004932801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0143695,"about_ca_topic_score_gemma":0.01123477,"domain_scores_codex":[0.9944413,0.002660557,0.0002462557,0.0004633386,0.001821846,0.0003666565],"domain_scores_gemma":[0.980931,0.0147317,0.0004329002,0.00246547,0.001257878,0.0001810432],"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.0001686963,0.0001560205,0.0003089224,0.0003151444,0.0001521728,0.0001239949,0.0002847365,0.1777987,0.001970015,0.7540193,0.003626267,0.06107605],"study_design_scores_gemma":[0.00006873999,0.00003313592,0.00007407911,0.00007679734,0.00007468625,0.00003174396,0.00003447621,0.4843375,0.003066169,0.5068058,0.005372671,0.00002424252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001833713,0.0002355929,0.9921213,0.0004913298,0.00005711564,0.00005185684,0.00007475117,0.000822166,0.004312232],"genre_scores_gemma":[0.261266,0.0006595237,0.7302147,0.000437704,0.0001385257,0.0003673296,0.000356118,0.0003597061,0.006200357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0143695,"threshold_uncertainty_score":0.02857172,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W840673086","doi":"10.1007/s10703-015-0232-5","title":"Evaluation of anonymity and confidentiality protocols using theorem proving","year":2015,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Anonymity; Information leakage; Computer science; Computer security; Confidentiality; Encryption; Cryptography; Universal composability; Gas meter prover; Theoretical computer science; Cryptographic protocol; Mathematics","authors":[{"name":"Tarek Mhamdi","is_ca":true},{"name":"Osman Hasan","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3901938964731558,"gpt":0.4831668037191479,"spread":0.09297290724599205,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03542732,0.001229975,0.00143243,0.001710623,0.002235928,0.007853537,0.003690433,0.00228288,0.006052996],"category_scores_gemma":[0.1083264,0.001014171,0.002926891,0.001131458,0.006740522,0.01126267,0.004654344,0.003629456,0.0007862126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004895014,"about_ca_system_score_gemma":0.007754631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002187772,"about_ca_topic_score_gemma":0.001575327,"domain_scores_codex":[0.9331459,0.0399753,0.002518074,0.003223319,0.01710854,0.004028857],"domain_scores_gemma":[0.8156714,0.1547264,0.004657587,0.01407344,0.009600559,0.001270671],"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.001685124,0.0008847028,0.003307963,0.001006468,0.0003690898,0.0004108261,0.0007985238,0.1703809,0.01211972,0.7154592,0.004209294,0.08936825],"study_design_scores_gemma":[0.0004071488,0.0004276016,0.0003521294,0.0001472785,0.0002353502,0.0001547253,0.0002663663,0.5959326,0.05758189,0.3390116,0.005412827,0.00007039676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04307976,0.0002086625,0.9461004,0.001049434,0.0001503946,0.0004547506,0.0001703466,0.001833793,0.006952567],"genre_scores_gemma":[0.648267,0.0003061044,0.3474145,0.0002858076,0.0001215626,0.00036617,0.0003209525,0.0004794672,0.0024383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03542732,"threshold_uncertainty_score":0.1873598,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3029555746","doi":"10.1007/s10703-023-00412-3","title":"Global guidance for local generalization in model checking","year":2023,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"European Research Council; Israel Science Foundation; United States-Israel Binational Science Foundation; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Generalization; Computer science; Model checking; Mathematics; Theoretical computer science; Mathematical analysis","authors":[{"name":"Hari Govind V K","is_ca":true},{"name":"YuTing Chen","is_ca":false},{"name":"Sharon Shoham","is_ca":false},{"name":"Arie Gurfinkel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1346089457146592,"gpt":0.416910301727239,"spread":0.2823013560125798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01324491,0.001493637,0.001484879,0.001461341,0.0007647703,0.002414304,0.003287674,0.001291189,0.002800048],"category_scores_gemma":[0.03758876,0.001016723,0.002413332,0.001376054,0.00417519,0.006035004,0.005926193,0.004205026,0.000852606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00146682,"about_ca_system_score_gemma":0.003329862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002578151,"about_ca_topic_score_gemma":0.003774095,"domain_scores_codex":[0.9796771,0.01102977,0.001344402,0.002565162,0.004131275,0.001252159],"domain_scores_gemma":[0.9416278,0.0302861,0.003661623,0.02123925,0.002668897,0.0005163824],"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.002244601,0.0006486395,0.02517605,0.001485053,0.0004630039,0.000533394,0.001851676,0.3686361,0.06074195,0.1844232,0.007127726,0.3466685],"study_design_scores_gemma":[0.0001581743,0.0003849999,0.0009760445,0.0001785861,0.0001636765,0.0001766761,0.0001545068,0.8527278,0.06078244,0.07847901,0.005741239,0.00007675708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07951967,0.0002730686,0.9017947,0.0003824691,0.00003273255,0.0001466048,0.0001400472,0.01451317,0.003197511],"genre_scores_gemma":[0.6813076,0.0001202336,0.3155828,0.0003125826,0.0000317806,0.0001362132,0.0002774194,0.001419106,0.0008124093],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01324491,"threshold_uncertainty_score":0.0700466,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W141148094","doi":"10.1023/a:1022902408130","title":"True Concurrency in Models of Asynchronous Circuit Behavior","year":2003,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Concurrency; Interleaving; Asynchronous communication; Modularity (biology); Algorithm; SIGNAL (programming language); Context (archaeology); Theoretical computer science; Distributed computing; Programming language","authors":[{"name":"S. Silver","is_ca":true},{"name":"Janusz Brzozowski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1230146835092877,"gpt":0.3472516628794267,"spread":0.2242369793701391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005241486,0.001021716,0.001212807,0.001023141,0.001625198,0.00455452,0.002665471,0.001899671,0.003018691],"category_scores_gemma":[0.02110834,0.001587472,0.002102474,0.0007401694,0.00669345,0.009213609,0.003482808,0.005386297,0.0004303878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001795528,"about_ca_system_score_gemma":0.001704055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003191316,"about_ca_topic_score_gemma":0.003199526,"domain_scores_codex":[0.9934832,0.002562312,0.0003858577,0.0008367794,0.002177358,0.0005543873],"domain_scores_gemma":[0.9843023,0.0113692,0.0007768399,0.002240165,0.0008785857,0.0004328388],"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.00004977523,0.00002552259,0.0003451519,0.00004687053,0.00002001322,0.0001336863,0.0005947412,0.03101978,0.0009630981,0.9631529,0.0002616129,0.003386927],"study_design_scores_gemma":[0.00003171322,0.000012472,0.00003632594,0.000009213296,0.00001805146,0.00004338492,0.00004085668,0.103115,0.0006353117,0.8953025,0.0007440985,0.00001117066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04398273,0.0003350539,0.9472394,0.0006700627,0.00008217679,0.00004501225,0.0000850531,0.0003812963,0.00717933],"genre_scores_gemma":[0.9017876,0.0002933109,0.09159814,0.000217789,0.0001379067,0.0001965875,0.0001116056,0.0002137041,0.005443388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005241486,"threshold_uncertainty_score":0.02771997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011639059","doi":"10.1007/s10703-006-0017-y","title":"Providing a formal linkage between MDG and HOL","year":2006,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Correctness; Linkage (software); Enumeration; Automated theorem proving; Computer science; State (computer science); Programming language; Theoretical computer science; Semantics (computer science); Proof assistant; Mathematics; Discrete mathematics; Mathematical proof","authors":[{"name":"Haiyan Xiong","is_ca":false},{"name":"Paul Curzon","is_ca":false},{"name":"Sofiène Tahar","is_ca":true},{"name":"Ann Blandford","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07185687179739442,"gpt":0.3558864629149366,"spread":0.2840295911175422,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00693364,0.001039962,0.001034812,0.0020601,0.001241573,0.004850825,0.002753246,0.002013295,0.008282335],"category_scores_gemma":[0.02165601,0.001300819,0.002341423,0.001413401,0.004286012,0.008060901,0.007105704,0.006063884,0.002076626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001424543,"about_ca_system_score_gemma":0.003115156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009972721,"about_ca_topic_score_gemma":0.001495751,"domain_scores_codex":[0.9940569,0.002079384,0.0007483613,0.0007590032,0.001867359,0.0004889723],"domain_scores_gemma":[0.9865643,0.007494612,0.0006589342,0.00369679,0.001249553,0.0003358416],"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.00005711089,0.00008805999,0.0003710014,0.0002648766,0.00004050394,0.0001468101,0.0002553959,0.00879965,0.002058505,0.9369203,0.001867461,0.04913042],"study_design_scores_gemma":[0.00006464029,0.00006848307,0.0001262401,0.0001945027,0.00007834585,0.0002427788,0.00007903038,0.07370924,0.01080799,0.8779527,0.03662148,0.00005458307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008478943,0.00005906124,0.9963151,0.0003117966,0.00007316461,0.00004592654,0.0000435757,0.0006166468,0.00168685],"genre_scores_gemma":[0.1088746,0.0003677162,0.8844435,0.0006818086,0.0001661155,0.0003118398,0.0002891461,0.0007236517,0.004141675],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008282335,"threshold_uncertainty_score":0.03666908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4380609821","doi":"10.1007/s10703-023-00430-1","title":"Machine learning and logic: a new frontier in artificial intelligence","year":2022,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Abductive reasoning; Generalizability theory; Machine learning","authors":[{"name":"Vijay Ganesh","is_ca":true},{"name":"Sanjit A. Seshia","is_ca":false},{"name":"Somesh Jha","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1074469343494178,"gpt":0.3535315076449354,"spread":0.2460845732955176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008209798,0.001087184,0.002167034,0.002716688,0.001443411,0.009637261,0.001866935,0.003350603,0.004700531],"category_scores_gemma":[0.01607455,0.0006743569,0.001081767,0.002695653,0.01701905,0.0213759,0.002455885,0.007500919,0.001008032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002564217,"about_ca_system_score_gemma":0.003227053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002327368,"about_ca_topic_score_gemma":0.001552377,"domain_scores_codex":[0.9950148,0.002852965,0.0002583568,0.000490004,0.001238775,0.0001449662],"domain_scores_gemma":[0.9680362,0.02867513,0.0005516385,0.001361529,0.0009626504,0.0004128144],"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.00002798719,0.00003209794,0.0002519582,0.0002965571,0.00002006662,0.00002204841,0.0002206673,0.001131733,0.0001183634,0.9618201,0.004617412,0.03144106],"study_design_scores_gemma":[0.00001323072,0.00001090369,0.00005985049,0.00009968419,0.000005521512,0.00001953277,0.00008777858,0.003375769,0.00006597758,0.9802501,0.01599965,0.00001208687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.005802157,0.1396766,0.7416788,0.08234623,0.002789111,0.00004862967,0.000203814,0.0004433146,0.02701123],"genre_scores_gemma":[0.293696,0.1112322,0.5500755,0.01353361,0.01660386,0.0003566522,0.0003473546,0.0004903832,0.01366434],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.009637261,"threshold_uncertainty_score":0.04341805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050180686","doi":"10.1007/s10703-013-0204-6","title":"Verifying global start-up for a Möbius ring-oscillator","year":2013,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Soundness; Generalization; Ring (chemistry); Computer science; Lock (firearm); Differential (mechanical device); Set (abstract data type); Ring oscillator; Theoretical computer science; Algorithm; Mathematics; Electronic engineering; Programming language; Engineering; Mathematical analysis","authors":[{"name":"Chao Yan","is_ca":false},{"name":"Mark R. Greenstreet","is_ca":true},{"name":"Suwen Yang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1033211246887338,"gpt":0.382787888189207,"spread":0.2794667635004732,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001690197,0.0008082384,0.0009027339,0.0004191765,0.0007561708,0.001183337,0.001114763,0.001076985,0.00579526],"category_scores_gemma":[0.004651605,0.0004042219,0.0009224776,0.0001403751,0.001985048,0.001481841,0.001918123,0.001097941,0.0008461577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005917631,"about_ca_system_score_gemma":0.0007928273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006304826,"about_ca_topic_score_gemma":0.0006301954,"domain_scores_codex":[0.9988066,0.0002240928,0.00006334949,0.0003390402,0.000385494,0.0001813508],"domain_scores_gemma":[0.9977894,0.001185764,0.0002705251,0.0004068335,0.0002364258,0.0001110362],"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.001851475,0.0002169936,0.006215163,0.0007042799,0.0002460969,0.002130279,0.001409138,0.2791293,0.2334465,0.4172226,0.001324871,0.05610337],"study_design_scores_gemma":[0.0003171738,0.0009361964,0.0009738525,0.00006550078,0.0001507796,0.0003472689,0.0002015158,0.8025983,0.1006262,0.0899585,0.003733817,0.00009095149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1528631,0.00006238007,0.8408115,0.00008552584,0.00007443253,0.00008425435,0.00007200632,0.001367592,0.004579317],"genre_scores_gemma":[0.9585278,0.00002500702,0.03871572,0.00002993451,0.000009758769,0.00005746042,0.00004017969,0.0001915718,0.002402605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00579526,"threshold_uncertainty_score":0.01938713,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4396938619","doi":"10.1007/s10703-024-00448-z","title":"Dynamic dependability analysis of shuffle-exchange networks","year":2024,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Dependability; Soundness; Computer science; Reliability block diagram; Reliability (semiconductor); Distributed computing; HOL; Multiprocessing; Interconnection; Theoretical computer science; Fault tree analysis; Reliability engineering; Parallel computing; Programming language; Computer network","authors":[{"name":"Yassmeen Elderhalli","is_ca":true},{"name":"Osman Hasan","is_ca":true},{"name":"Sofiène Tahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01669935114813512,"gpt":0.3264332798356983,"spread":0.3097339286875632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002197842,0.0005585329,0.0005396202,0.001248581,0.0005296241,0.001095053,0.001309326,0.000565492,0.003666235],"category_scores_gemma":[0.009258303,0.0003744394,0.0007467666,0.000601191,0.001419802,0.002888843,0.001150007,0.001369252,0.0002458156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001377289,"about_ca_system_score_gemma":0.0008287457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002241189,"about_ca_topic_score_gemma":0.001405054,"domain_scores_codex":[0.9987934,0.0003122728,0.00005575155,0.0002154675,0.0004312452,0.0001919211],"domain_scores_gemma":[0.9906988,0.006598594,0.0006456753,0.0009270128,0.0009131893,0.0002168251],"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.0001918777,0.00008780347,0.001519549,0.0001071178,0.00006398014,0.0002038024,0.0002112125,0.6167516,0.006776119,0.3483646,0.0007359257,0.02498623],"study_design_scores_gemma":[0.00001075861,0.0000291581,0.0002780974,0.00001172538,0.00001578542,0.00002868712,0.00002339858,0.8896416,0.002318197,0.1070334,0.0006011512,0.000007950921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1072778,0.0001772301,0.8868215,0.0002553603,0.00002582121,0.00005552948,0.0001533351,0.0002920913,0.004941377],"genre_scores_gemma":[0.9688456,0.0002107211,0.02665307,0.00005815543,0.00003008588,0.0001087749,0.000221115,0.0001082546,0.003764393],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003666235,"threshold_uncertainty_score":0.01226473,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3155827701","doi":"10.1007/s10703-021-00367-3","title":"Towards efficient verification of population protocols","year":2021,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Distributed systems and fault tolerance","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":"Fonds de recherche du Québec – Nature et technologies","keywords":"Correctness; Computer science; Decidability; Reachability; Protocol (science); Theoretical computer science; Petri net; Population; Reachability problem; Formal verification; Model checking; Computational complexity theory; Distributed computing; Algorithm","authors":[{"name":"Michael Blondin","is_ca":true},{"name":"Javier Esparza","is_ca":false},{"name":"Stefan Jaax","is_ca":false},{"name":"Philipp J. Meyer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07312539246779999,"gpt":0.3896241254999382,"spread":0.3164987330321382,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008989824,0.0009750449,0.00125334,0.001475201,0.001504032,0.003967596,0.003181112,0.002379691,0.004689917],"category_scores_gemma":[0.03406681,0.0011777,0.00252138,0.001158835,0.005005767,0.007508875,0.007984583,0.00545465,0.001226575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002481035,"about_ca_system_score_gemma":0.003700394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001990274,"about_ca_topic_score_gemma":0.001380033,"domain_scores_codex":[0.9847342,0.006823542,0.00102202,0.001791045,0.004289154,0.001339986],"domain_scores_gemma":[0.9642609,0.0236998,0.001706766,0.006230077,0.003550304,0.0005521311],"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.0003621167,0.0002179435,0.001963058,0.0004550168,0.0001171821,0.0005729622,0.001161235,0.1467081,0.02277534,0.7686957,0.004285937,0.05268547],"study_design_scores_gemma":[0.00009198662,0.00005960688,0.0001472338,0.00006407032,0.00003849423,0.00008524817,0.000121243,0.4986834,0.01725841,0.4773624,0.006055557,0.00003238181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02531701,0.0001005442,0.9684304,0.0006922878,0.00005806878,0.0001810481,0.0001437706,0.002483279,0.002593655],"genre_scores_gemma":[0.5303394,0.0003183572,0.4629364,0.0005478864,0.0001047903,0.0006905398,0.0007796707,0.000610068,0.00367276],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008989824,"threshold_uncertainty_score":0.04754329,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412347816","doi":"10.1007/s10703-025-00481-6","title":"Rounding meets approximate model counting","year":2025,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Machine Learning and Algorithms","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":"National Supercomputing Centre Singapore; Ministry of Education, India; Ministry of Education - Singapore; National Research Foundation Singapore; National Research Foundation","keywords":"Rounding; Mathematics; Computer science; Operating system","authors":[{"name":"Jiong Yang","is_ca":false},{"name":"Kuldeep S. Meel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04829558355008434,"gpt":0.373903787122479,"spread":0.3256082035723946,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004306962,0.002112287,0.003202976,0.002184783,0.002002463,0.006272624,0.003582867,0.003018724,0.01452372],"category_scores_gemma":[0.03452871,0.001062834,0.003256968,0.003460985,0.0028119,0.009563016,0.005330916,0.006715537,0.003074814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003416825,"about_ca_system_score_gemma":0.003130613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003361415,"about_ca_topic_score_gemma":0.004169535,"domain_scores_codex":[0.9894904,0.003489228,0.0005606908,0.001933563,0.003320027,0.001206168],"domain_scores_gemma":[0.9701768,0.01827155,0.001330447,0.00772173,0.001812925,0.0006866289],"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.001178101,0.0003806822,0.002234651,0.0009273858,0.0002021665,0.0003877421,0.0003249717,0.2990863,0.003578793,0.4575689,0.04502492,0.1891055],"study_design_scores_gemma":[0.00007916793,0.0000787573,0.0001778052,0.00006129712,0.00005006199,0.0001860004,0.00008301904,0.5071805,0.002022523,0.4843812,0.005673836,0.00002576012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05054119,0.00193735,0.8964686,0.005588735,0.0009323908,0.0003444916,0.001849633,0.004420024,0.03791755],"genre_scores_gemma":[0.5516862,0.001261718,0.4216252,0.002126041,0.00106675,0.0006642212,0.003593586,0.001254712,0.01672158],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01452372,"threshold_uncertainty_score":0.04858667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4376644468","doi":"10.1007/s10703-023-00417-y","title":"Partial bounding for recursive function synthesis","year":2023,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"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":"Recursion (computer science); Bounding overwatch; μ operator; Primitive recursive function; Function (biology); Set (abstract data type); Computer science; Recursive functions; Counterexample; Context (archaeology); Algorithm; Mathematics; Theoretical computer science; Discrete mathematics","authors":[{"name":"Azadeh Farzan","is_ca":true},{"name":"Victor Nicolet","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1374199751511336,"gpt":0.3972174777857111,"spread":0.2597975026345775,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002993818,0.001300347,0.001660313,0.001326339,0.001026134,0.002355344,0.00155126,0.001242179,0.008259824],"category_scores_gemma":[0.01272872,0.001111557,0.001719416,0.0009008122,0.003197575,0.003764163,0.003190593,0.003232617,0.001626446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001897883,"about_ca_system_score_gemma":0.001566163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002363737,"about_ca_topic_score_gemma":0.002660209,"domain_scores_codex":[0.9966052,0.001171505,0.0001750396,0.0004554712,0.001237255,0.0003556812],"domain_scores_gemma":[0.9914327,0.005884286,0.000256907,0.001795275,0.0005002011,0.0001306618],"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.0001352547,0.00003937787,0.0002406021,0.0002510139,0.00004353324,0.00008865548,0.0002065609,0.1197363,0.006984479,0.7676315,0.001890788,0.1027521],"study_design_scores_gemma":[0.00002774164,0.00004919001,0.0001094239,0.00009796353,0.00005819378,0.00006441532,0.0000233322,0.413427,0.01053214,0.5659993,0.00957953,0.00003175949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00481299,0.0003122502,0.9870423,0.00009722725,0.00003840005,0.00002438875,0.00003435101,0.001059548,0.006578527],"genre_scores_gemma":[0.5456899,0.0008265512,0.4394214,0.0002386093,0.0001482597,0.0003147012,0.0002783433,0.00113815,0.01194412],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008259824,"threshold_uncertainty_score":0.02763188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4416533042","doi":"10.1007/s10703-025-00483-4","title":"Bounded satisfiability checking of $$\\hbox {FOL}^*$$ formulas with aggregations","year":2025,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; University of Toronto","funders":"","keywords":"Satisfiability; Bounded function; Boolean satisfiability problem; Model checking; Constraint (computer-aided design); Automated reasoning; Satisfiability modulo theories; Constraint satisfaction problem","authors":[{"name":"Nick Feng","is_ca":true},{"name":"Lina Marsso","is_ca":true},{"name":"Yuliia Kholodetska","is_ca":true},{"name":"Marsha Chećhik","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05068885233567185,"gpt":0.3710179682865734,"spread":0.3203291159509015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005382545,0.001171099,0.00131107,0.002071949,0.001503069,0.004214817,0.003945204,0.001255133,0.00751019],"category_scores_gemma":[0.02511502,0.001369367,0.003947265,0.001756541,0.002692709,0.006836609,0.004008772,0.002866878,0.0006787252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003353329,"about_ca_system_score_gemma":0.005306952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02268356,"about_ca_topic_score_gemma":0.03448112,"domain_scores_codex":[0.9933059,0.002070297,0.0004271322,0.001161853,0.001742,0.0012929],"domain_scores_gemma":[0.9752032,0.01817251,0.001101604,0.002419787,0.002661013,0.000441841],"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.003187446,0.0009106922,0.01418807,0.001260525,0.0009671496,0.001511586,0.001185989,0.4279707,0.03391341,0.326575,0.01410073,0.1742286],"study_design_scores_gemma":[0.0001529491,0.0000783427,0.0007943498,0.0001014568,0.0002242165,0.0000866658,0.0002041042,0.8030121,0.01844119,0.1751471,0.001712523,0.00004496051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.254918,0.0004320137,0.7263009,0.001380703,0.000218237,0.0002800306,0.001413376,0.006617618,0.008439168],"genre_scores_gemma":[0.7851562,0.0001354315,0.2081471,0.0004234427,0.00008405079,0.0001247515,0.001876659,0.0007402662,0.00331198],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02268356,"threshold_uncertainty_score":0.04510307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406403030","doi":"10.1007/s10703-024-00467-w","title":"A scalable entropy estimator","year":2025,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Ministry of Education - Singapore; National Research Foundation Singapore; National Science Foundation","keywords":"Estimator; Statistics; Computer science; Econometrics; Mathematics","authors":[{"name":"Priyanka Golia","is_ca":false},{"name":"Brendan Juba","is_ca":false},{"name":"Kuldeep S. Meel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03761707096719169,"gpt":0.3607803377685572,"spread":0.3231632668013655,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002053076,0.0009620205,0.001512269,0.00132689,0.0005634167,0.001592837,0.001334302,0.0009287121,0.00750652],"category_scores_gemma":[0.008686897,0.0005680299,0.0007870049,0.0009405433,0.0006628316,0.002873781,0.002713902,0.001554207,0.002397928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006153625,"about_ca_system_score_gemma":0.001170189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009325867,"about_ca_topic_score_gemma":0.00141004,"domain_scores_codex":[0.998235,0.0004937044,0.00008668101,0.0003787436,0.0006913634,0.0001145871],"domain_scores_gemma":[0.9972522,0.001301797,0.0001831678,0.0006743364,0.0004736409,0.0001148303],"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.0005000251,0.0001875467,0.002631643,0.0002678464,0.000272946,0.000186732,0.00009563076,0.1811686,0.04016371,0.1374536,0.01248001,0.6245918],"study_design_scores_gemma":[0.00002349576,0.00004523048,0.0005085964,0.00001527896,0.00002856413,0.00008215418,0.000009528311,0.9453744,0.006648862,0.04398721,0.003257934,0.00001866352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003361192,0.000161989,0.9941553,0.0001091037,0.00006156594,0.00004457868,0.000156947,0.0007048049,0.001244468],"genre_scores_gemma":[0.2612627,0.0004016782,0.7266125,0.0002362474,0.0004854849,0.0003166741,0.001218359,0.0004836198,0.008982723],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00750652,"threshold_uncertainty_score":0.02511179,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3212362464","doi":"10.1007/s10703-021-00382-4","title":"Preface of the special issue on the conference on formal methods in computer aided design 2018","year":2021,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Management science; Software engineering; Engineering","authors":[{"name":"Nikolaj Bjørner","is_ca":false},{"name":"Arie Gurfinkel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1077431145994936,"gpt":0.362366771002201,"spread":0.2546236564027074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00468874,0.002427717,0.00300533,0.005627999,0.002235458,0.007907101,0.002280452,0.00407932,0.1670171],"category_scores_gemma":[0.01452838,0.0006349319,0.001527887,0.002448631,0.001008984,0.004867782,0.0031424,0.006578544,0.08792822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002713731,"about_ca_system_score_gemma":0.003416018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001663339,"about_ca_topic_score_gemma":0.00250073,"domain_scores_codex":[0.9968155,0.0004724863,0.0002707388,0.0004225411,0.001745868,0.0002729236],"domain_scores_gemma":[0.9806291,0.003260799,0.0007599398,0.0008575073,0.01108111,0.00341158],"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.00004160662,0.00003274888,0.00005883168,0.0001662212,0.000007062586,0.00002498547,0.00001675293,0.0000703417,0.0001749443,0.0008334973,0.9761137,0.02245916],"study_design_scores_gemma":[0.0000265739,0.00007267587,0.000562354,0.0003750036,0.00001637452,0.0000944753,0.00003982017,0.0004597757,0.0002522015,0.002569869,0.9955096,0.00002112658],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0003651361,0.01607008,0.003877587,0.02816833,0.9217626,0.0001704758,0.0006226309,0.0003118689,0.02865141],"genre_scores_gemma":[0.004114672,0.02022525,0.002529495,0.009249703,0.6607837,0.0003198696,0.002689638,0.001323531,0.2987641],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.1670171,"threshold_uncertainty_score":0.558728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}