{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0159764,0.0003080119,0.0004860779,0.0003660128,0.0007644472,0.0002333344,0.001205145,0.0001349802,0.000001366455],"category_scores_gemma":[0.001256223,0.0002443583,0.00006401383,0.001247642,0.00007081025,0.001033902,0.0006248779,0.0004363826,0.00005416918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002235905,"about_ca_system_score_gemma":0.00008081951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008681829,"about_ca_topic_score_gemma":0.000001118544,"domain_scores_codex":[0.9934384,0.00387691,0.0007575558,0.0006502997,0.0004940941,0.0007827529],"domain_scores_gemma":[0.9974024,0.001260607,0.0002510496,0.0007795346,0.0001245815,0.0001818091],"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.00003105787,0.00001366324,0.0003961466,0.00006854357,0.00002038953,0.00003931841,0.01081312,0.01066902,0.001873548,0.01825849,0.00006752014,0.9577492],"study_design_scores_gemma":[0.0003202763,0.000316875,0.003215879,0.0003300456,0.00001000905,0.0007023811,0.0009827868,0.9779471,0.01090718,0.0002611547,0.004578099,0.0004282068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00347946,0.0001887675,0.9924743,0.00007961396,0.0007272256,0.001882008,0.000001263258,0.0004819483,0.0006853954],"genre_scores_gemma":[0.05184459,0.00001426044,0.9466135,0.0001760574,0.0001147043,0.001095927,4.808347e-7,0.00003071799,0.0001097506],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9672781,"threshold_uncertainty_score":0.9964642,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01659085,0.0002644504,0.0004334071,0.0003235867,0.0001976653,0.0001113901,0.001313463,0.0001773294,0.00001101123],"category_scores_gemma":[0.0003977921,0.000250962,0.00008179089,0.0007688842,0.00007140906,0.002223442,0.0003192349,0.0002532228,0.00002345166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003639634,"about_ca_system_score_gemma":0.0001159976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002515181,"about_ca_topic_score_gemma":0.000002437163,"domain_scores_codex":[0.9937977,0.003759679,0.0009008164,0.0005370963,0.0003328824,0.0006718166],"domain_scores_gemma":[0.9978646,0.000479761,0.0003933013,0.001029366,0.0001215925,0.000111361],"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.0001287259,0.0001084563,0.002526986,0.000392714,0.00004696169,0.00006534118,0.01804186,0.0008135072,0.01155639,0.8729808,0.00002273263,0.0933155],"study_design_scores_gemma":[0.0004563596,0.0001891259,0.004041265,0.000315186,0.00001579318,0.0002861751,0.001727207,0.9004336,0.08848288,0.00332762,0.0001743502,0.000550441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003656374,0.0001053148,0.9886725,0.00000205651,0.001324618,0.0004901151,0.000001623514,0.0003357973,0.005411616],"genre_scores_gemma":[0.1806331,0.000002129358,0.81919,0.00002842301,0.00004740799,0.00006816191,4.273551e-7,0.0000193213,0.00001097721],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8996201,"threshold_uncertainty_score":0.9999943,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01657111,0.0002232041,0.0005363184,0.0003490211,0.00008930435,0.00006899181,0.001227412,0.0001330694,0.00001415137],"category_scores_gemma":[0.0007465466,0.0001819656,0.00009254384,0.0007989889,0.00006764214,0.0009919717,0.0002687887,0.0001633451,0.00003870759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000155889,"about_ca_system_score_gemma":0.00006093656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003302585,"about_ca_topic_score_gemma":1.788716e-7,"domain_scores_codex":[0.9940556,0.003597128,0.001066127,0.000390976,0.00042783,0.0004623469],"domain_scores_gemma":[0.9978371,0.0003793626,0.0004759484,0.001050208,0.0001741934,0.00008316195],"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.0001014555,0.00006382878,0.0001018672,0.0009453882,0.00003305447,0.000001775895,0.002039356,0.00263329,0.0361931,0.7429256,0.00007739409,0.2148839],"study_design_scores_gemma":[0.0004101805,0.0002987124,0.0003040234,0.0004196158,0.00001048696,0.00002020867,0.0001000271,0.7609233,0.2351072,0.0008374437,0.001333336,0.0002354496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000352606,0.0001630056,0.9869757,0.000010281,0.0004492101,0.0008139982,8.091334e-7,0.0001876704,0.01104669],"genre_scores_gemma":[0.2354717,0.000003490181,0.7642415,0.00002872723,0.00003639164,0.0001100711,8.557373e-7,0.00001315278,0.00009411907],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7582901,"threshold_uncertainty_score":0.742034,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008315898,0.000188922,0.0003115747,0.000161579,0.000175413,0.0001143188,0.0006605126,0.0001288446,0.000006071574],"category_scores_gemma":[0.0003656279,0.0001334335,0.00005042682,0.0001719551,0.0001679152,0.0006610977,0.000203324,0.00008678102,0.000005071193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001573093,"about_ca_system_score_gemma":0.0001114601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006271789,"about_ca_topic_score_gemma":5.850794e-7,"domain_scores_codex":[0.9970778,0.001093374,0.0005256706,0.0005564441,0.0002972089,0.0004495676],"domain_scores_gemma":[0.9969903,0.001763349,0.0001791295,0.0007503264,0.0001552478,0.0001617012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005860302,0.00008582656,0.0001093091,0.0002204308,0.00001569128,0.000003078273,0.002587194,0.000242941,0.03592672,0.6508401,0.0001677239,0.3097424],"study_design_scores_gemma":[0.006578154,0.001034773,0.001578921,0.001762217,0.00003626742,0.0002691229,0.005538046,0.4499734,0.4912397,0.02846519,0.01177097,0.001753248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01037351,0.0001142009,0.9876391,0.00009859043,0.0002212763,0.001094247,0.0000138391,0.0001917577,0.0002534682],"genre_scores_gemma":[0.3939109,0.000002064464,0.6057004,0.00001786565,0.00003277419,0.0002941318,3.379983e-7,0.000009357775,0.00003209384],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.622375,"threshold_uncertainty_score":0.544126,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01304054,0.000337401,0.0005337929,0.0003600901,0.0002589771,0.0002467418,0.003326324,0.0002454602,0.000001115335],"category_scores_gemma":[0.0005867801,0.0003103947,0.00009584188,0.000645824,0.00005829373,0.002255589,0.0006707148,0.0002451426,0.000005686653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002456605,"about_ca_system_score_gemma":0.0001476243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006815443,"about_ca_topic_score_gemma":0.000005925672,"domain_scores_codex":[0.9951925,0.001667919,0.001056118,0.0009008569,0.0003832183,0.0007993842],"domain_scores_gemma":[0.9965386,0.0004725434,0.0004345185,0.002319014,0.000146111,0.00008924366],"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.00005256478,0.00005143213,0.00007164077,0.0003212465,0.00001853128,0.000003769709,0.0004435273,0.08710343,0.004987917,0.8615924,0.0001863872,0.04516722],"study_design_scores_gemma":[0.0007157032,0.00005436209,0.0005180073,0.00008275392,0.00001660129,0.00003914799,0.00007511045,0.9669991,0.01893772,0.01196637,0.0002425837,0.0003525023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002545268,0.0002778195,0.9959814,0.00001156822,0.0009938416,0.001466322,0.0000401404,0.0003959778,0.0005783809],"genre_scores_gemma":[0.03376109,0.000002596326,0.9656321,0.00003862094,0.0001545955,0.0002824879,0.00002418154,0.00004072523,0.00006359691],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8798957,"threshold_uncertainty_score":0.9999348,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01016738,0.0003109608,0.0004548446,0.0002389322,0.0001461432,0.0001847226,0.001317474,0.0002197885,0.00000398329],"category_scores_gemma":[0.0003924253,0.0002535065,0.00005875586,0.001147423,0.00008940023,0.003017777,0.0002460172,0.0002877402,0.000106544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004139749,"about_ca_system_score_gemma":0.0002298456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006101722,"about_ca_topic_score_gemma":0.000001243441,"domain_scores_codex":[0.9945174,0.002810978,0.0008030216,0.0006456363,0.0006152588,0.0006077424],"domain_scores_gemma":[0.9976325,0.0003203152,0.0004235651,0.001192805,0.0002592775,0.0001715525],"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.0008639321,0.0002153142,0.0004940696,0.000281032,0.00005200125,0.00005968343,0.01582746,0.008386892,0.004799584,0.7909116,0.0006928992,0.1774155],"study_design_scores_gemma":[0.002903902,0.001644455,0.002930291,0.0004395103,0.00003607427,0.0005308101,0.002320016,0.9088181,0.06215097,0.007389875,0.009686248,0.001149746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001598649,0.0002048997,0.988652,0.00007796241,0.0009558505,0.0008803689,0.000001110189,0.0003920162,0.007237133],"genre_scores_gemma":[0.06030383,0.000006509505,0.9391569,0.00006676905,0.0001014244,0.0002494878,0.000003279255,0.0000274331,0.00008440122],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9004312,"threshold_uncertainty_score":0.9999917,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004438117,0.0001884546,0.0003156759,0.0001695946,0.0001187915,0.0000815906,0.0007155038,0.0001064735,0.00001195117],"category_scores_gemma":[0.0002637323,0.0001577451,0.000075093,0.0006679855,0.0000287326,0.0008925032,0.00009801015,0.0001784051,0.00009813369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001152817,"about_ca_system_score_gemma":0.00007572812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002337735,"about_ca_topic_score_gemma":6.325272e-7,"domain_scores_codex":[0.9965067,0.001904205,0.0004336936,0.0003882115,0.0002094701,0.0005577064],"domain_scores_gemma":[0.998606,0.0005241366,0.0001249741,0.0005932113,0.00004255553,0.0001091813],"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.000005856682,0.00002051716,0.0001825978,0.000040602,0.000006553938,0.00004269385,0.0003242118,0.000953078,0.0007628666,0.9512054,0.00006070937,0.04639496],"study_design_scores_gemma":[0.003982078,0.001252385,0.003207546,0.0005854858,0.00003570845,0.001826781,0.001785115,0.258876,0.2326982,0.4599449,0.03296933,0.002836499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003710575,0.0003852797,0.9818558,0.00001829881,0.0008789003,0.0003279936,2.703487e-7,0.0002515458,0.01591083],"genre_scores_gemma":[0.1684431,0.000003017731,0.8312141,0.0000920517,0.00002688547,0.00006281566,1.428893e-7,0.00001042184,0.0001474203],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4912604,"threshold_uncertainty_score":0.6432659,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009124977,0.0002847646,0.0004445487,0.0004269445,0.0001722007,0.000269164,0.001611968,0.0002333865,0.00007075097],"category_scores_gemma":[0.0004730533,0.0002643228,0.0001001759,0.001221774,0.00007486423,0.003159079,0.0002214793,0.000261486,0.002190606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003354347,"about_ca_system_score_gemma":0.00009619915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005184302,"about_ca_topic_score_gemma":1.395589e-7,"domain_scores_codex":[0.9942063,0.00316323,0.0009493298,0.0005999354,0.0004103093,0.0006708671],"domain_scores_gemma":[0.9973028,0.0005801509,0.0003903531,0.001363837,0.0002120863,0.0001507705],"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.00005542918,0.0001670432,0.0001243895,0.0003114023,0.0000487431,0.000009850855,0.002534404,0.002048337,0.08695273,0.2388682,0.001565585,0.6673139],"study_design_scores_gemma":[0.0004359856,0.0001427185,0.002939282,0.000104377,0.000007994778,0.00006197341,0.0001578725,0.9402951,0.05209469,0.00211004,0.001233746,0.0004162294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009416491,0.0001305947,0.9884275,0.00005472233,0.0008360259,0.001409452,0.000001011282,0.0005479026,0.007651155],"genre_scores_gemma":[0.0256415,0.000004784709,0.973137,0.00005524769,0.00007464696,0.000615172,0.000002691101,0.00002734564,0.0004415677],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9382467,"threshold_uncertainty_score":0.9999809,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008426699,0.0001888162,0.0005027718,0.0004263593,0.00004430897,0.00005159161,0.0007152088,0.000122604,0.000006516786],"category_scores_gemma":[0.0002781312,0.0001628884,0.00008570903,0.001284357,0.00003644463,0.001175868,0.0001901337,0.0001925367,0.00001110905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001745023,"about_ca_system_score_gemma":0.00005957887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004807104,"about_ca_topic_score_gemma":0.000002496741,"domain_scores_codex":[0.9959227,0.001962859,0.0009749354,0.0003522462,0.0002945516,0.0004926833],"domain_scores_gemma":[0.9983506,0.0007214469,0.0002760682,0.0004890119,0.00007383378,0.00008910509],"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.00002805687,0.0001096735,0.0003199868,0.0001803871,0.000007650705,0.00001290647,0.001233549,0.01069523,0.001927455,0.05290894,0.00001512475,0.932561],"study_design_scores_gemma":[0.000570333,0.0002505799,0.0008966511,0.0002429582,0.000004575538,0.00004609393,0.0001912086,0.9498758,0.04379217,0.003464214,0.0004225606,0.0002429121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004891176,0.000216181,0.9969686,0.00006305328,0.0003623996,0.0004866935,0.000001090375,0.00008096074,0.001331918],"genre_scores_gemma":[0.09722657,0.000008041798,0.9025449,0.00005046898,0.00005499637,0.00007361765,4.108863e-7,0.00001206827,0.00002895834],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9391805,"threshold_uncertainty_score":0.6642398,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01783654,0.0003369716,0.0005969211,0.0003177833,0.0003757435,0.0002482418,0.001815816,0.0002179063,0.00000260375],"category_scores_gemma":[0.0002405355,0.0003193789,0.00008774085,0.001095883,0.00005622363,0.001744781,0.0001014466,0.0003692583,0.00001171248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003226387,"about_ca_system_score_gemma":0.0001653107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001160954,"about_ca_topic_score_gemma":0.000004156384,"domain_scores_codex":[0.9902983,0.006770236,0.001177934,0.0005527459,0.0004452519,0.0007555043],"domain_scores_gemma":[0.9943271,0.004076183,0.0003738077,0.0009558798,0.0001855301,0.00008146737],"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.0004745484,0.0004806885,0.002295691,0.004950551,0.0001805606,0.00005691981,0.009464828,0.2625651,0.2293618,0.04761921,0.0003941909,0.4421559],"study_design_scores_gemma":[0.001834567,0.0001940551,0.00009001744,0.001234945,0.00003526797,0.0002185369,0.001245313,0.8799016,0.1121075,0.002080431,0.0002938449,0.0007639142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009299667,0.003056257,0.9915491,0.00002184314,0.0003602319,0.0008029493,0.000003302759,0.00056706,0.002709301],"genre_scores_gemma":[0.4878938,0.000007000866,0.5118006,0.00002669527,0.00003659722,0.0001742562,0.000001194452,0.00002196067,0.00003779317],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6173365,"threshold_uncertainty_score":0.9999259,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01351531,0.0001496166,0.0003881682,0.000378568,0.000168726,0.00003744646,0.0006411912,0.0003336759,0.0001768412],"category_scores_gemma":[0.002114304,0.0001423832,0.00006208396,0.0007971531,0.0002221406,0.0003215643,0.00008107757,0.0003745816,0.00007948852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003711861,"about_ca_system_score_gemma":0.000191682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00180166,"about_ca_topic_score_gemma":0.0009226938,"domain_scores_codex":[0.9918616,0.006466759,0.0006060958,0.0002472629,0.000223473,0.0005947383],"domain_scores_gemma":[0.9981046,0.001139509,0.0001716416,0.0004242493,0.00005713512,0.0001028038],"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.000142543,0.0004445317,0.04373021,0.0001602743,0.00003668651,0.00007836077,0.04199219,0.0002540333,0.001382196,0.7640045,0.0005756135,0.1471989],"study_design_scores_gemma":[0.01241612,0.0009167908,0.008183549,0.001699465,0.00007560577,0.0001470083,0.2736292,0.1728577,0.02891748,0.06952152,0.4280375,0.003598057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002751321,0.0006583762,0.8638697,0.0002951395,0.00109794,0.001297954,0.000001875184,0.0003547661,0.1296729],"genre_scores_gemma":[0.4431042,0.00002306735,0.5563883,0.00003578724,0.00001788828,0.0001267382,0.000001002847,0.000009409541,0.0002935826],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.694483,"threshold_uncertainty_score":0.5806217,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002859514,0.0001642166,0.0002587973,0.0001854931,0.0002229401,0.00005849999,0.0003965186,0.0000741281,0.000009946866],"category_scores_gemma":[0.0001107934,0.0001427315,0.00005641039,0.0003696112,0.00004900269,0.00169674,0.0002111028,0.0001446444,0.0001260058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001570041,"about_ca_system_score_gemma":0.00007738606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001084662,"about_ca_topic_score_gemma":0.00002187754,"domain_scores_codex":[0.9979205,0.000582829,0.0005367983,0.000333469,0.0001999976,0.0004264432],"domain_scores_gemma":[0.9986318,0.0003290874,0.0001853785,0.000664813,0.00009295193,0.00009596576],"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.00002197929,0.00004992861,0.0002706015,0.0001516793,0.00002347439,0.00003403032,0.001403605,0.001994387,0.003577027,0.8346895,0.0001459222,0.1576379],"study_design_scores_gemma":[0.002028039,0.001376449,0.008202413,0.001979581,0.00003267831,0.001149734,0.004522618,0.6717769,0.1742112,0.008106356,0.1246018,0.002012264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004160148,0.00007872287,0.9924986,0.00001566057,0.001391386,0.0003322194,0.000004282266,0.0002441434,0.005018948],"genre_scores_gemma":[0.2189665,0.000001849151,0.78066,0.00001577268,0.0001691519,0.00007801128,8.299863e-7,0.000009297984,0.00009861984],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8265831,"threshold_uncertainty_score":0.582042,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01301037,0.0002470945,0.0004180515,0.0001955988,0.000196718,0.0001606682,0.0006259112,0.0002106838,0.00001250994],"category_scores_gemma":[0.0002415175,0.0002363877,0.00006360586,0.0006806409,0.00008365674,0.001605695,0.0001668423,0.0003118271,0.00004442228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001748618,"about_ca_system_score_gemma":0.0000591947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007517284,"about_ca_topic_score_gemma":0.000002285125,"domain_scores_codex":[0.99388,0.004063933,0.0006142695,0.0005765834,0.0003019821,0.0005632676],"domain_scores_gemma":[0.9981549,0.000627596,0.0001450069,0.0008551299,0.00006870434,0.0001487136],"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.00007154192,0.00005135321,0.000328521,0.0001618624,0.00001604445,0.00006825689,0.001204643,0.001194598,0.002428478,0.091901,0.00003666963,0.902537],"study_design_scores_gemma":[0.0005048003,0.0001681206,0.007410738,0.0001324846,0.00001041366,0.0008410902,0.00008626013,0.9654894,0.02079322,0.002886508,0.001249355,0.0004275457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01598434,0.000194699,0.9768811,0.00003004396,0.0004024788,0.0005285245,0.000001987846,0.0003077739,0.005669091],"genre_scores_gemma":[0.1993252,0.00001684974,0.8003895,0.00006360585,0.0000438903,0.00005388046,5.617309e-7,0.00001331167,0.00009312516],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9642949,"threshold_uncertainty_score":0.9639609,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042664,0.0002636737,0.00052413,0.0002348068,0.0003848086,0.0004004529,0.0008591813,0.0001772095,9.496569e-7],"category_scores_gemma":[0.0003840972,0.0002391844,0.00004134261,0.0001907753,0.00007119112,0.002788163,0.0005830595,0.0002715063,0.00001148276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000393522,"about_ca_system_score_gemma":0.00004612225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002425241,"about_ca_topic_score_gemma":0.00000474676,"domain_scores_codex":[0.9973128,0.0007221019,0.0006849827,0.0005290645,0.0002649458,0.0004860398],"domain_scores_gemma":[0.9982139,0.0002379741,0.0003758013,0.0009472999,0.0001321233,0.00009285649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.004370295,0.0005066202,0.04119931,0.01032426,0.0003275873,0.000822673,0.2205871,0.04391409,0.1909445,0.1787457,0.0001566896,0.3081011],"study_design_scores_gemma":[0.002149039,0.0008889855,0.01365762,0.005841471,0.00001872606,0.0004265618,0.004136424,0.3067453,0.6613777,0.002303319,0.0008390105,0.001615926],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01197996,0.0002319958,0.9837481,0.00001563011,0.001172064,0.001673531,0.000001940189,0.0003003634,0.0008763929],"genre_scores_gemma":[0.5466647,0.00001827802,0.4530268,0.000006754153,0.00003275896,0.0002072578,8.215149e-8,0.0000117001,0.000031631],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5346848,"threshold_uncertainty_score":0.9753659,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005591797,0.0002485997,0.0003840538,0.00035522,0.0002110287,0.0003224627,0.001053837,0.0001601346,0.000001650159],"category_scores_gemma":[0.0001261445,0.0002229937,0.00005855576,0.0007771985,0.00001294107,0.001104569,0.0002618294,0.0002712128,0.0000721289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001556258,"about_ca_system_score_gemma":0.0000959057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000730102,"about_ca_topic_score_gemma":8.205904e-8,"domain_scores_codex":[0.9969479,0.000955012,0.0005659945,0.0004970971,0.0002844321,0.0007495879],"domain_scores_gemma":[0.9985559,0.0004555304,0.0001600553,0.0005550189,0.00008099711,0.0001925076],"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.000008754332,0.00002236687,0.0002963869,0.0001656719,0.00001269012,0.000007368076,0.00580167,0.9665663,0.001940716,0.008365926,0.001084304,0.01572782],"study_design_scores_gemma":[0.0001991155,0.00005662287,0.0002509565,0.000349486,0.000003488089,0.00004348627,0.0002673764,0.9965284,0.001529045,0.0004415397,0.000038724,0.0002916931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00103554,0.0001178469,0.9853399,0.00003182474,0.0002521645,0.0007269286,7.47687e-7,0.001422714,0.01107232],"genre_scores_gemma":[0.2976484,1.271152e-7,0.7019109,0.00009920503,0.0000274575,0.0002162521,0.000001129028,0.00001652847,0.00008006173],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2966128,"threshold_uncertainty_score":0.909342,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.05751833,0.00009793654,0.0002326291,0.0001211977,0.00008020803,0.0001106785,0.0003845264,0.00007778753,0.000001106955],"category_scores_gemma":[0.0007928067,0.00009201671,0.00002710728,0.0003478513,0.0000485243,0.0007481566,0.0001688078,0.00009448724,6.894259e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000199098,"about_ca_system_score_gemma":0.0003895486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001030399,"about_ca_topic_score_gemma":0.000001403538,"domain_scores_codex":[0.9924781,0.005873443,0.000556318,0.0002729465,0.0006252807,0.0001938886],"domain_scores_gemma":[0.9982587,0.0003506557,0.0003639928,0.0003840536,0.0005779286,0.00006465305],"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.0001543637,0.0002044193,0.004323073,0.001380714,0.00006866829,0.000003351134,0.02837669,0.02813837,0.01890471,0.3967365,0.00002094805,0.5216882],"study_design_scores_gemma":[0.0005868978,0.00006050668,0.0004844827,0.0002235941,0.00001384777,0.00002886731,0.0006876397,0.9631548,0.02747113,0.007175801,0.0000121476,0.0001002726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01392549,0.00007132719,0.9790242,0.000004521162,0.0002047996,0.006061527,4.42529e-7,0.00005448259,0.0006531739],"genre_scores_gemma":[0.4541916,7.103858e-8,0.5454018,0.000003430976,0.00002128031,0.0003784045,1.002019e-7,0.000002807031,6.082072e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9350165,"threshold_uncertainty_score":0.9704832,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01413892,0.0002164704,0.0003626158,0.000360784,0.0001140637,0.0001024285,0.001022232,0.0002007457,4.699386e-7],"category_scores_gemma":[0.0005233939,0.000222659,0.00008030099,0.002549387,0.00003872128,0.001282876,0.0002193772,0.0001075342,0.0000131128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007371353,"about_ca_system_score_gemma":0.0001452821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003277656,"about_ca_topic_score_gemma":0.000008472125,"domain_scores_codex":[0.9961913,0.001370878,0.0008848433,0.0005447008,0.0003115782,0.000696723],"domain_scores_gemma":[0.9986344,0.0003144688,0.0002436327,0.0006171761,0.0001163017,0.00007402637],"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.00002935133,0.0000121487,0.0002723727,0.0001643885,0.000003259337,0.000003414386,0.0004122266,0.6503965,0.0004238713,0.2758432,0.00007765851,0.07236159],"study_design_scores_gemma":[0.0004936926,0.0000588329,0.001186822,0.0001693438,0.000003108011,0.00001404583,0.0001261344,0.9819248,0.004519956,0.01118172,0.00008554207,0.0002360541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004216488,0.00010277,0.9964736,0.00003124425,0.0008632433,0.001012054,0.000005573952,0.0004215606,0.0006683302],"genre_scores_gemma":[0.0711202,0.000005928815,0.9280984,0.00005065243,0.00005173678,0.0006044579,0.000004466514,0.00001880661,0.0000453871],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3315283,"threshold_uncertainty_score":0.9079772,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005943742,0.0001930292,0.0004978857,0.0003454681,0.00005675862,0.00004490136,0.0007154212,0.0001296752,0.000004499041],"category_scores_gemma":[0.0002513167,0.0001896199,0.00008259762,0.0008646476,0.00003645706,0.0008602732,0.00006385589,0.0002224614,0.000005637803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001793627,"about_ca_system_score_gemma":0.0002125351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006881919,"about_ca_topic_score_gemma":0.000003455039,"domain_scores_codex":[0.9962457,0.001729484,0.000862097,0.000382518,0.0002458158,0.0005343154],"domain_scores_gemma":[0.9984975,0.0005975791,0.0002556405,0.0004912396,0.00007321969,0.00008478195],"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.000001135429,0.0001958612,0.008562305,0.0003373153,0.00001022613,0.0001266445,0.003102859,0.01043523,0.005342786,0.4710724,0.000004629886,0.5008085],"study_design_scores_gemma":[0.002592924,0.000575825,0.00545224,0.001415667,0.00003693676,0.0005438378,0.001076915,0.9239796,0.03864337,0.02454274,0.00003307414,0.001106822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006317585,0.0004791692,0.9832161,0.000001472955,0.0004321108,0.0004764916,0.000001563068,0.00008397643,0.008991501],"genre_scores_gemma":[0.6574479,0.000002129265,0.3424366,0.000006388188,0.00001048549,0.00008020961,2.423263e-7,0.000008611052,0.00000739538],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9135444,"threshold_uncertainty_score":0.7732474,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01427169,0.0003240103,0.0005362517,0.0004424878,0.0002965192,0.0003042985,0.001011721,0.0002665218,0.000001583478],"category_scores_gemma":[0.0002564062,0.0003004239,0.00008503239,0.0008726043,0.00007914396,0.003350287,0.0004473959,0.0003703845,0.00001854725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002382442,"about_ca_system_score_gemma":0.0000861619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008138182,"about_ca_topic_score_gemma":0.000001537964,"domain_scores_codex":[0.9947689,0.002283522,0.00102495,0.0006124137,0.0004024131,0.0009078506],"domain_scores_gemma":[0.9977891,0.0008454554,0.0003884941,0.000755717,0.0000898821,0.000131378],"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.00006412189,0.00006106764,0.006411153,0.0008161432,0.00002912082,0.00003775513,0.001619963,0.0007886729,0.005161746,0.5791744,0.00007935651,0.4057565],"study_design_scores_gemma":[0.002184581,0.0008870698,0.03635851,0.0007367916,0.0000572881,0.0003962086,0.0005550501,0.8298063,0.1104641,0.01446746,0.002599803,0.001486855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006997782,0.0002781371,0.9868389,0.00002875985,0.0005118567,0.001028314,0.00000328414,0.0003979643,0.003915026],"genre_scores_gemma":[0.2379177,0.000003092217,0.7616174,0.00001961374,0.0001852997,0.000157321,0.000001930833,0.00002209544,0.00007558476],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8290176,"threshold_uncertainty_score":0.9999448,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008221921,0.0001737085,0.0003689967,0.0003042346,0.0002178741,0.000148194,0.000612094,0.00007293519,0.00002350415],"category_scores_gemma":[0.0001589193,0.0001550613,0.00004915572,0.0007567799,0.00002690567,0.000360383,0.00052786,0.0004446465,0.00001414561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001812003,"about_ca_system_score_gemma":0.00008850484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005243557,"about_ca_topic_score_gemma":0.00002494131,"domain_scores_codex":[0.995379,0.002835688,0.0005969656,0.0004452326,0.0002750184,0.0004680983],"domain_scores_gemma":[0.9990841,0.0003560056,0.0001876006,0.0002569612,0.00002082694,0.00009450887],"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.00004287879,0.00003870551,0.001970603,0.00006493955,0.000008224538,0.00008784611,0.003758895,0.004143078,0.0001341846,0.4518854,0.00002303611,0.5378422],"study_design_scores_gemma":[0.0003275267,0.0006732038,0.0002188397,0.0000264963,0.000007242985,0.0003271334,0.003217295,0.8830825,0.00092509,0.09903987,0.01167326,0.0004815203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009119959,0.001584925,0.9950616,0.0000457717,0.0008758398,0.0005086336,3.050677e-7,0.0001291695,0.001702506],"genre_scores_gemma":[0.4408951,0.000006564665,0.5586588,0.00002431299,0.00004971789,0.00009309482,7.321318e-7,0.000009040761,0.0002626803],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8789394,"threshold_uncertainty_score":0.6323218,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008859158,0.0003516931,0.0005524725,0.0002153887,0.0002674493,0.0003801601,0.001558404,0.0002532188,0.00001054911],"category_scores_gemma":[0.000810493,0.0003284425,0.0001626013,0.0009737785,0.0000606617,0.002564686,0.0003331872,0.0002116871,0.0001132013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007088752,"about_ca_system_score_gemma":0.0001631029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009857525,"about_ca_topic_score_gemma":0.000001879979,"domain_scores_codex":[0.9951307,0.001755729,0.0009905886,0.000704055,0.00042045,0.000998495],"domain_scores_gemma":[0.9972745,0.0007566212,0.000388819,0.001096446,0.0002652005,0.0002184425],"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.0001132199,0.00006284169,0.0005813104,0.0007457272,0.00005189728,0.000006247611,0.001527331,0.001683598,0.004444828,0.5341447,0.0006651102,0.4559732],"study_design_scores_gemma":[0.001229552,0.0004137655,0.002308637,0.0002295332,0.00001575559,0.000106033,0.000474254,0.966803,0.01605048,0.008514093,0.003227452,0.0006274759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001591044,0.0002142883,0.9896699,0.00003901115,0.003364574,0.00234673,0.00000724955,0.0004750843,0.002292109],"genre_scores_gemma":[0.05360765,0.000003271026,0.9448812,0.00008078491,0.0001317676,0.001185941,0.000001326814,0.00002630845,0.00008177826],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9651194,"threshold_uncertainty_score":0.9999168,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005748263,0.0001900248,0.0005376359,0.0007206667,0.0000254952,0.00003400691,0.0002169307,0.0001881994,0.00003200791],"category_scores_gemma":[0.00008542492,0.0001830101,0.000196805,0.002413456,0.00002412004,0.0002503654,0.00002550725,0.0002935538,0.00000573046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007238562,"about_ca_system_score_gemma":0.00003329763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002177273,"about_ca_topic_score_gemma":0.00003667179,"domain_scores_codex":[0.9976826,0.0008820172,0.0005966742,0.000235325,0.000174101,0.0004292471],"domain_scores_gemma":[0.9981408,0.001346742,0.00005216571,0.0003781378,0.00002786166,0.00005428554],"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.000009397349,0.000006389193,0.00007599869,0.0008077631,0.0004743017,0.000005603385,0.0002630324,0.9397227,0.0003442867,0.0008753329,0.00001955658,0.0573957],"study_design_scores_gemma":[0.00007992136,0.00004716866,0.001115673,0.00009796651,0.0003340676,0.000005907256,0.0000477438,0.9970458,0.0008610853,0.00006453852,0.0001399297,0.0001602259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008730377,0.006133961,0.9823755,0.000002342081,0.0009121295,0.0004136352,0.00001049728,0.0004445016,0.0009770268],"genre_scores_gemma":[0.8018412,0.00003817314,0.1979429,0.000002239368,0.00002565327,0.00009020521,0.00000706416,0.00003503357,0.00001750067],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7931108,"threshold_uncertainty_score":0.7462934,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003869042,0.0001170338,0.0003314426,0.00009573185,0.00005549472,0.00007210909,0.0004217342,0.00009613262,0.000002520691],"category_scores_gemma":[0.0001600022,0.0001074444,0.00006847297,0.0008102437,0.00001212618,0.0003048249,0.00008582392,0.0000836631,0.000006311785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001408671,"about_ca_system_score_gemma":0.0001076045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005220045,"about_ca_topic_score_gemma":8.95826e-7,"domain_scores_codex":[0.9971805,0.001238995,0.0007129444,0.0003118051,0.0003113599,0.0002443599],"domain_scores_gemma":[0.9987153,0.0001159232,0.0002961318,0.0006164607,0.0002065645,0.00004957796],"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.00007650846,0.0003232152,0.001310974,0.001795425,0.00003176597,0.00004423769,0.002020385,0.06326457,0.03021025,0.5049562,0.00009770655,0.3958687],"study_design_scores_gemma":[0.0006965447,0.0001091539,0.01813541,0.0008568763,0.000005149831,0.00006792344,0.0002477197,0.8888981,0.08916956,0.0004239943,0.001138879,0.0002507037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009854045,0.00008219347,0.9935697,0.00001856673,0.0003527724,0.00349953,0.00000523194,0.00007737333,0.001409261],"genre_scores_gemma":[0.3915856,2.980345e-7,0.6068929,0.000005015437,0.000019448,0.001467719,0.000004296327,0.000004787445,0.00001996715],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8256335,"threshold_uncertainty_score":0.4381456,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009831081,0.0001863962,0.0003423922,0.00033616,0.0002442357,0.000272538,0.0009085201,0.000100382,9.826766e-7],"category_scores_gemma":[0.0002266912,0.0001670967,0.00006816666,0.0007817316,0.00001786935,0.0007232392,0.0003151424,0.0002919527,0.000008140378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000169227,"about_ca_system_score_gemma":0.00010249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003816184,"about_ca_topic_score_gemma":4.895547e-7,"domain_scores_codex":[0.997219,0.001111635,0.0004981803,0.0004214987,0.0002280964,0.0005215375],"domain_scores_gemma":[0.9987124,0.0005170553,0.000157919,0.0005062429,0.00005365204,0.0000527497],"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.0000142428,0.00002949478,0.0003059658,0.0005070849,0.00002519301,0.00001912983,0.001110023,0.2336987,0.001437363,0.5591782,0.0001214284,0.2035532],"study_design_scores_gemma":[0.0002656452,0.00002023652,0.00004062977,0.0003061996,0.00000549889,0.00001804085,0.0001039882,0.993738,0.001878224,0.003115524,0.0003417221,0.0001662998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000204509,0.0001743407,0.9839912,0.00008536447,0.001146127,0.0002966884,4.17082e-7,0.0003821897,0.01371916],"genre_scores_gemma":[0.1068158,0.000001679585,0.8920807,0.00006511694,0.00003863762,0.00006178487,3.643108e-7,0.0000100396,0.0009258824],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7600393,"threshold_uncertainty_score":0.6814008,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01949069,0.0002292574,0.0004004521,0.000575067,0.0003301869,0.0001907295,0.000871254,0.0002007553,0.000003731911],"category_scores_gemma":[0.002364193,0.0002231307,0.0001403874,0.001672894,0.0000425675,0.001503236,0.0001689272,0.0001676808,0.0001011054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003346168,"about_ca_system_score_gemma":0.00009614536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000934999,"about_ca_topic_score_gemma":5.399343e-7,"domain_scores_codex":[0.9951658,0.002433728,0.0007342735,0.0005702469,0.000325668,0.0007702743],"domain_scores_gemma":[0.9958564,0.002881555,0.0003146119,0.0007124763,0.0001295636,0.0001053956],"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.0002306911,0.00002762487,0.0000717989,0.0003795691,0.00003834681,0.000007818649,0.001371582,0.002985806,0.004803536,0.6268339,0.0005499818,0.3626994],"study_design_scores_gemma":[0.0004375074,0.0003287495,0.0006928327,0.0002739898,0.00003286666,0.00003268723,0.0007852188,0.8919032,0.08904716,0.01159456,0.004455003,0.0004162259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003469986,0.00005181992,0.9927778,0.00005650767,0.003912757,0.00120389,0.000004422997,0.0007537521,0.0008920464],"genre_scores_gemma":[0.02649492,0.000006030863,0.9713981,0.00002799849,0.0002030396,0.001746156,0.000002604482,0.00002959738,0.00009157202],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8889174,"threshold_uncertainty_score":0.9099005,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007124749,0.0002193628,0.0005361558,0.0003659775,0.0001142998,0.00005531371,0.0008270943,0.0001256266,0.000001107441],"category_scores_gemma":[0.002037418,0.0001849568,0.00007366515,0.001392824,0.00008948628,0.0006821118,0.0002427284,0.0002265013,0.000001106388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002987263,"about_ca_system_score_gemma":0.0001994136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002828224,"about_ca_topic_score_gemma":0.000004819642,"domain_scores_codex":[0.9967809,0.001464961,0.0006807207,0.0004042278,0.0002366752,0.0004324911],"domain_scores_gemma":[0.9942729,0.004386217,0.0002557335,0.0008825266,0.0001548772,0.00004772482],"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.0001085739,0.00006928593,0.00221821,0.001500002,0.0001012757,0.00001626157,0.002746086,0.2815862,0.005727198,0.4050313,0.00001319841,0.3008824],"study_design_scores_gemma":[0.002829754,0.0006938346,0.02419835,0.003626934,0.00008241,0.0001125204,0.001563998,0.394302,0.3886218,0.1822351,0.0004256741,0.00130764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002136785,0.0002072351,0.9953996,0.0000246767,0.0004855393,0.0006301613,0.000001271164,0.0003590937,0.0007556437],"genre_scores_gemma":[0.1763129,0.000002544579,0.8234954,0.0000105325,0.00001000948,0.0001200873,3.308573e-7,0.00001026464,0.00003796042],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3828946,"threshold_uncertainty_score":0.7542319,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003657375,0.000138126,0.0002725104,0.0003306406,0.0001419427,0.0001502787,0.0008415812,0.00009549264,0.0000023751],"category_scores_gemma":[0.0001782221,0.0001259101,0.00005324162,0.0009166138,0.00002081945,0.0004167436,0.0002467792,0.0001293911,0.00001658531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001414185,"about_ca_system_score_gemma":0.0001196492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001606065,"about_ca_topic_score_gemma":1.491068e-7,"domain_scores_codex":[0.9977903,0.0009879716,0.0004250103,0.0003065833,0.0001363231,0.0003537536],"domain_scores_gemma":[0.9988425,0.000442044,0.0001033709,0.0004897625,0.00007151381,0.00005082945],"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.00002734856,0.00005980205,0.0004449973,0.0002166296,0.0000221495,0.00001970903,0.0002804629,0.04735812,0.0007180445,0.8561396,0.003340594,0.09137253],"study_design_scores_gemma":[0.0002450918,0.0000430465,0.0001095156,0.000227043,0.000003231046,0.00001389053,0.00002173857,0.9778718,0.01597219,0.004220987,0.001142518,0.0001289811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002258546,0.0002198897,0.9872928,0.00007601955,0.0004835138,0.0003407584,2.604222e-7,0.0008049611,0.01075921],"genre_scores_gemma":[0.02489937,0.000003821946,0.9744651,0.00008856921,0.00001559156,0.00007815611,3.046527e-7,0.000006020766,0.0004431062],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9305136,"threshold_uncertainty_score":0.5134466,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01252925,0.0003793789,0.0006585517,0.0002265595,0.0001358649,0.0001281841,0.002159777,0.0002431656,0.00002332931],"category_scores_gemma":[0.0001956142,0.0002485093,0.0001634158,0.001006191,0.00009087798,0.0005557871,0.0007290047,0.0006410896,0.00001281977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002986559,"about_ca_system_score_gemma":0.0002407268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000237698,"about_ca_topic_score_gemma":0.000002895094,"domain_scores_codex":[0.9892043,0.008067126,0.0009320991,0.0005897863,0.0005418492,0.0006648735],"domain_scores_gemma":[0.9950132,0.002791564,0.0003343289,0.001618488,0.0001653875,0.00007700396],"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.0001391096,0.0001594135,0.0000534535,0.0002421895,0.00004753203,0.00004372659,0.004065628,0.1169209,0.004301871,0.4659179,0.001705328,0.4064029],"study_design_scores_gemma":[0.0004044818,0.0003942044,0.0005038469,0.0009159581,0.000009053773,0.00004909327,0.00004605397,0.740484,0.2512761,0.002770915,0.002814522,0.0003317567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001402193,0.00004101789,0.9956262,0.00019822,0.001500961,0.001255556,0.00000346814,0.0002188802,0.001015545],"genre_scores_gemma":[0.00903217,0.000006932322,0.9901278,0.000149458,0.0003667097,0.0001949421,4.581999e-7,0.00002890333,0.00009259769],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6235631,"threshold_uncertainty_score":0.9999967,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}