{"meta":{"query_hash":"b4452ab816ee","filters":{"venue":"Formal Methods in System Design"},"cohort_total":28,"direct_labels_cover":0,"predictions_cover":28,"exported":28,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/b4452ab816ee","api":"https://metacan.xera.ac/api/v1/cohort?venue=Formal+Methods+in+System+Design"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12238609013763205,"score_gpt":0.37049398780798487,"score_spread":0.24810789767035282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1000312060","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015986493,0.00020489974,0.988652,0.00007796241,0.00095585047,0.00088036887,0.000001110189,0.0003920162,0.007237133],"genre_scores_gemma":[0.060303826,0.000006509505,0.9391569,0.00006676905,0.00010142444,0.00024948778,0.0000032792555,0.000027433101,0.000084401225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945174,0.002810978,0.0008030216,0.0006456363,0.00061525876,0.0006077424],"domain_scores_gemma":[0.9976325,0.00032031524,0.0004235651,0.0011928047,0.0002592775,0.0001715525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.010167378,0.00031096084,0.00045484462,0.00023893222,0.00014614318,0.00018472258,0.0013174743,0.00021978855,0.0000039832903],"category_scores_gemma":[0.0003924253,0.00025350647,0.000058755857,0.0011474229,0.00008940023,0.0030177773,0.00024601718,0.0002877402,0.000106543994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086393213,0.00021531421,0.0004940696,0.00028103197,0.000052001255,0.000059683425,0.015827456,0.008386892,0.004799584,0.7909116,0.00069289916,0.17741553],"study_design_scores_gemma":[0.002903902,0.0016444547,0.002930291,0.0004395103,0.000036074267,0.0005308101,0.0023200158,0.9088181,0.06215097,0.0073898747,0.009686248,0.001149746],"about_ca_topic_score_codex":0.000061017217,"about_ca_topic_score_gemma":0.0000012434411,"teacher_disagreement_score":0.9004312,"about_ca_system_score_codex":0.00041397486,"about_ca_system_score_gemma":0.0002298456,"threshold_uncertainty_score":0.9999917},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12301468350928765,"score_gpt":0.3472516628794267,"score_spread":0.22423697937013906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141148094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006317585,0.00047916922,0.9832161,0.0000014729549,0.00043211077,0.00047649164,0.0000015630684,0.000083976425,0.008991501],"genre_scores_gemma":[0.65744793,0.0000021292653,0.3424366,0.0000063881876,0.000010485485,0.00008020961,2.4232634e-7,0.000008611052,0.00000739538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624574,0.0017294837,0.00086209696,0.000382518,0.00024581578,0.00053431536],"domain_scores_gemma":[0.99849755,0.0005975791,0.00025564045,0.0004912396,0.000073219686,0.000084781954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005943742,0.00019302925,0.0004978857,0.00034546814,0.000056758625,0.00004490136,0.0007154212,0.00012967525,0.000004499041],"category_scores_gemma":[0.00025131667,0.00018961987,0.00008259762,0.0008646476,0.000036457062,0.0008602732,0.00006385589,0.00022246141,0.0000056378035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001135429,0.00019586123,0.008562305,0.00033731534,0.000010226127,0.00012664453,0.0031028586,0.010435228,0.0053427857,0.47107244,0.0000046298865,0.50080854],"study_design_scores_gemma":[0.0025929243,0.00057582505,0.0054522404,0.0014156665,0.000036936763,0.0005438378,0.0010769152,0.92397964,0.03864337,0.02454274,0.00003307414,0.0011068218],"about_ca_topic_score_codex":0.00006881919,"about_ca_topic_score_gemma":0.0000034550394,"teacher_disagreement_score":0.9135444,"about_ca_system_score_codex":0.00017936273,"about_ca_system_score_gemma":0.00021253509,"threshold_uncertainty_score":0.77324736},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1502935729165406,"score_gpt":0.4425998256417204,"score_spread":0.2923062527251798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1666486534","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002751321,0.0006583762,0.86386967,0.0002951395,0.0010979397,0.001297954,0.0000018751836,0.0003547661,0.12967294],"genre_scores_gemma":[0.4431042,0.000023067354,0.5563883,0.000035787245,0.000017888282,0.00012673816,0.0000010028473,0.000009409541,0.00029358265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99186164,0.0064667594,0.00060609577,0.0002472629,0.00022347305,0.0005947383],"domain_scores_gemma":[0.99810463,0.0011395095,0.00017164157,0.00042424927,0.000057135123,0.00010280376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0135153085,0.00014961661,0.0003881682,0.00037856796,0.00016872604,0.000037446458,0.0006411912,0.00033367594,0.00017684125],"category_scores_gemma":[0.002114304,0.00014238317,0.00006208396,0.0007971531,0.00022214062,0.0003215643,0.00008107757,0.00037458164,0.00007948852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014254301,0.00044453167,0.04373021,0.00016027426,0.00003668651,0.00007836077,0.04199219,0.00025403328,0.0013821956,0.76400447,0.0005756135,0.14719887],"study_design_scores_gemma":[0.012416118,0.0009167908,0.008183549,0.0016994645,0.00007560577,0.00014700834,0.27362922,0.17285769,0.028917478,0.069521524,0.42803752,0.0035980572],"about_ca_topic_score_codex":0.0018016599,"about_ca_topic_score_gemma":0.0009226938,"teacher_disagreement_score":0.694483,"about_ca_system_score_codex":0.0003711861,"about_ca_system_score_gemma":0.00019168205,"threshold_uncertainty_score":0.5806217},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04486791107813676,"score_gpt":0.3591851560632732,"score_spread":0.31431724498513647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967747780","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004891176,0.00021618103,0.99696857,0.00006305328,0.00036239962,0.0004866935,0.0000010903747,0.00008096074,0.0013319183],"genre_scores_gemma":[0.09722657,0.000008041798,0.90254486,0.00005046898,0.000054996373,0.00007361765,4.1088634e-7,0.00001206827,0.000028958337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592274,0.0019628587,0.0009749354,0.0003522462,0.00029455163,0.00049268326],"domain_scores_gemma":[0.99835056,0.0007214469,0.00027606817,0.0004890119,0.000073833784,0.000089105095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008426699,0.00018881621,0.00050277176,0.00042635933,0.00004430897,0.00005159161,0.00071520876,0.000122604,0.0000065167865],"category_scores_gemma":[0.00027813122,0.00016288843,0.00008570903,0.0012843568,0.000036444628,0.0011758675,0.00019013374,0.00019253665,0.000011109047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002805687,0.000109673536,0.00031998684,0.00018038705,0.000007650705,0.000012906472,0.0012335487,0.010695229,0.0019274551,0.052908942,0.000015124748,0.93256104],"study_design_scores_gemma":[0.00057033304,0.0002505799,0.0008966511,0.00024295824,0.000004575538,0.00004609393,0.00019120862,0.9498758,0.043792166,0.003464214,0.0004225606,0.00024291208],"about_ca_topic_score_codex":0.000048071044,"about_ca_topic_score_gemma":0.0000024967414,"teacher_disagreement_score":0.9391805,"about_ca_system_score_codex":0.00017450235,"about_ca_system_score_gemma":0.00005957887,"threshold_uncertainty_score":0.66423976},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04806893277459231,"score_gpt":0.3334275702699164,"score_spread":0.2853586374953241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971059059","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094164914,0.00013059468,0.98842746,0.00005472233,0.00083602587,0.0014094521,0.0000010112824,0.0005479026,0.007651155],"genre_scores_gemma":[0.025641503,0.000004784709,0.973137,0.000055247692,0.00007464696,0.00061517203,0.0000026911014,0.000027345635,0.0004415677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942063,0.0031632304,0.0009493298,0.0005999354,0.0004103093,0.0006708671],"domain_scores_gemma":[0.99730283,0.0005801509,0.0003903531,0.0013638367,0.0002120863,0.00015077053],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009124977,0.00028476462,0.00044454867,0.00042694446,0.00017220074,0.000269164,0.0016119676,0.00023338653,0.00007075097],"category_scores_gemma":[0.00047305334,0.00026432276,0.0001001759,0.0012217741,0.00007486423,0.0031590788,0.00022147935,0.00026148604,0.002190606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005542918,0.00016704315,0.00012438947,0.00031140234,0.0000487431,0.000009850855,0.002534404,0.0020483371,0.08695273,0.2388682,0.0015655855,0.6673139],"study_design_scores_gemma":[0.0004359856,0.00014271846,0.0029392818,0.00010437699,0.000007994778,0.000061973406,0.00015787248,0.9402951,0.052094694,0.0021100403,0.0012337458,0.00041622942],"about_ca_topic_score_codex":0.000051843017,"about_ca_topic_score_gemma":1.3955894e-7,"teacher_disagreement_score":0.9382467,"about_ca_system_score_codex":0.00033543474,"about_ca_system_score_gemma":0.000096199146,"threshold_uncertainty_score":0.9999809},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Enforcement; Computer science; Soundness; Correctness; Context (archaeology); Sequence (biology); Property (philosophy); Programming language","score_opus":0.07481876807600887,"score_gpt":0.337618955834488,"score_spread":0.26280018775847913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973223152","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000352606,0.0001630056,0.9869757,0.0000102810045,0.00044921009,0.0008139982,8.0913344e-7,0.00018767043,0.011046686],"genre_scores_gemma":[0.23547173,0.0000034901811,0.76424146,0.000028727229,0.000036391637,0.00011007113,8.5573726e-7,0.000013152781,0.000094119074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99405557,0.0035971284,0.0010661271,0.00039097597,0.00042783,0.00046234694],"domain_scores_gemma":[0.9978371,0.00037936255,0.00047594836,0.0010502081,0.00017419335,0.000083161955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016571114,0.00022320412,0.0005363184,0.00034902114,0.000089304354,0.00006899181,0.0012274124,0.00013306939,0.000014151375],"category_scores_gemma":[0.0007465466,0.00018196556,0.000092543836,0.00079898885,0.00006764214,0.0009919717,0.0002687887,0.00016334507,0.000038707592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001014555,0.00006382878,0.00010186717,0.00094538816,0.00003305447,0.0000017758954,0.0020393564,0.0026332897,0.0361931,0.74292564,0.00007739409,0.21488386],"study_design_scores_gemma":[0.00041018054,0.00029871237,0.0003040234,0.00041961577,0.00001048696,0.000020208674,0.000100027144,0.7609233,0.23510718,0.00083744375,0.0013333355,0.00023544957],"about_ca_topic_score_codex":0.000033025848,"about_ca_topic_score_gemma":1.788716e-7,"teacher_disagreement_score":0.75829005,"about_ca_system_score_codex":0.00015588904,"about_ca_system_score_gemma":0.000060936563,"threshold_uncertainty_score":0.742034},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07185687179739442,"score_gpt":0.35588646291493664,"score_spread":0.2840295911175422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011639059","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069977823,0.00027813713,0.9868389,0.00002875985,0.00051185675,0.0010283141,0.0000032841401,0.0003979643,0.0039150263],"genre_scores_gemma":[0.23791768,0.0000030922172,0.76161736,0.000019613737,0.00018529966,0.00015732096,0.0000019308327,0.000022095439,0.00007558476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99476886,0.0022835222,0.0010249503,0.00061241374,0.00040241308,0.00090785057],"domain_scores_gemma":[0.9977891,0.00084545545,0.00038849405,0.00075571705,0.0000898821,0.00013137802],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.014271687,0.00032401027,0.0005362517,0.00044248777,0.0002965192,0.00030429853,0.0010117211,0.00026652185,0.000001583478],"category_scores_gemma":[0.0002564062,0.0003004239,0.00008503239,0.00087260426,0.00007914396,0.0033502874,0.0004473959,0.00037038448,0.000018547247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006412189,0.00006106764,0.0064111534,0.0008161432,0.000029120822,0.000037755133,0.0016199625,0.00078867294,0.0051617464,0.5791744,0.000079356505,0.4057565],"study_design_scores_gemma":[0.0021845805,0.0008870698,0.036358513,0.00073679164,0.0000572881,0.00039620858,0.0005550501,0.82980627,0.11046412,0.014467464,0.0025998028,0.0014868546],"about_ca_topic_score_codex":0.00008138182,"about_ca_topic_score_gemma":0.0000015379644,"teacher_disagreement_score":0.8290176,"about_ca_system_score_codex":0.00023824422,"about_ca_system_score_gemma":0.000086161905,"threshold_uncertainty_score":0.9999448},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12667463912516952,"score_gpt":0.3628655870095945,"score_spread":0.23619094788442496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030659368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010355402,0.0001178469,0.98533994,0.000031824744,0.00025216452,0.0007269286,7.4768695e-7,0.0014227135,0.011072315],"genre_scores_gemma":[0.29764837,1.2711516e-7,0.70191085,0.000099205026,0.0000274575,0.00021625205,0.000001129028,0.000016528467,0.00008006173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969479,0.00095501204,0.0005659945,0.00049709715,0.00028443208,0.0007495879],"domain_scores_gemma":[0.9985559,0.00045553036,0.0001600553,0.0005550189,0.00008099711,0.00019250764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055917967,0.00024859965,0.00038405383,0.00035522002,0.00021102866,0.00032246273,0.0010538375,0.00016013462,0.0000016501587],"category_scores_gemma":[0.00012614447,0.00022299372,0.000058555765,0.00077719847,0.000012941074,0.0011045691,0.00026182944,0.0002712128,0.0000721289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008754332,0.000022366872,0.00029638692,0.00016567191,0.000012690124,0.0000073680762,0.00580167,0.9665663,0.0019407164,0.008365926,0.0010843043,0.015727816],"study_design_scores_gemma":[0.00019911547,0.000056622874,0.00025095648,0.00034948598,0.000003488089,0.000043486267,0.00026737642,0.99652845,0.0015290453,0.0004415397,0.000038724,0.00029169314],"about_ca_topic_score_codex":0.000073010204,"about_ca_topic_score_gemma":8.205904e-8,"teacher_disagreement_score":0.29661283,"about_ca_system_score_codex":0.0001556258,"about_ca_system_score_gemma":0.0000959057,"threshold_uncertainty_score":0.909342},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10332112468873382,"score_gpt":0.382787888189207,"score_spread":0.27946676350047317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050180686","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015910439,0.0002142883,0.9896699,0.000039011153,0.003364574,0.0023467303,0.0000072495504,0.0004750843,0.0022921094],"genre_scores_gemma":[0.053607646,0.000003271026,0.9448812,0.000080784914,0.00013176756,0.001185941,0.0000013268144,0.000026308446,0.00008177826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99513066,0.0017557286,0.0009905886,0.000704055,0.00042045003,0.000998495],"domain_scores_gemma":[0.99727446,0.0007566212,0.000388819,0.0010964458,0.00026520048,0.00021844247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008859158,0.00035169313,0.0005524725,0.00021538867,0.00026744933,0.00038016008,0.0015584037,0.00025321878,0.000010549113],"category_scores_gemma":[0.00081049296,0.00032844246,0.00016260131,0.00097377854,0.000060661696,0.0025646857,0.0003331872,0.00021168709,0.00011320126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011321991,0.00006284169,0.0005813104,0.0007457272,0.000051897285,0.0000062476106,0.0015273314,0.0016835982,0.0044448283,0.5341447,0.0006651102,0.45597318],"study_design_scores_gemma":[0.0012295517,0.00041376555,0.0023086374,0.00022953321,0.000015755591,0.00010603299,0.000474254,0.96680295,0.016050484,0.008514093,0.0032274518,0.0006274759],"about_ca_topic_score_codex":0.00009857525,"about_ca_topic_score_gemma":0.0000018799794,"teacher_disagreement_score":0.96511936,"about_ca_system_score_codex":0.0007088752,"about_ca_system_score_gemma":0.00016310286,"threshold_uncertainty_score":0.9999168},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05309760259252033,"score_gpt":0.3447944458955521,"score_spread":0.29169684330303175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053340187","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01598434,0.00019469902,0.9768811,0.000030043955,0.0004024788,0.0005285245,0.0000019878455,0.00030777394,0.005669091],"genre_scores_gemma":[0.19932525,0.000016849737,0.8003895,0.000063605854,0.000043890304,0.000053880456,5.6173093e-7,0.000013311675,0.000093125156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99388,0.004063933,0.0006142695,0.0005765834,0.00030198207,0.00056326756],"domain_scores_gemma":[0.9981549,0.00062759605,0.00014500692,0.0008551299,0.000068704336,0.00014871363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013010372,0.00024709446,0.00041805152,0.00019559877,0.00019671801,0.00016066825,0.00062591117,0.00021068384,0.000012509936],"category_scores_gemma":[0.00024151745,0.00023638766,0.00006360586,0.00068064086,0.00008365674,0.001605695,0.00016684229,0.0003118271,0.000044422275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071541916,0.00005135321,0.000328521,0.00016186236,0.000016044449,0.00006825689,0.0012046432,0.001194598,0.0024284776,0.091901004,0.000036669626,0.90253705],"study_design_scores_gemma":[0.0005048003,0.00016812059,0.0074107377,0.00013248457,0.000010413661,0.0008410902,0.00008626013,0.96548945,0.020793224,0.002886508,0.0012493546,0.00042754575],"about_ca_topic_score_codex":0.00007517284,"about_ca_topic_score_gemma":0.000002285125,"teacher_disagreement_score":0.96429485,"about_ca_system_score_codex":0.00017486182,"about_ca_system_score_gemma":0.000059194695,"threshold_uncertainty_score":0.9639609},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.25846484264324404,"score_gpt":0.43768191777295007,"score_spread":0.17921707512970603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059949763","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025452676,0.00027781946,0.9959814,0.000011568224,0.0009938416,0.0014663221,0.000040140396,0.00039597778,0.0005783809],"genre_scores_gemma":[0.03376109,0.0000025963257,0.9656321,0.000038620936,0.00015459555,0.00028248786,0.000024181541,0.000040725234,0.00006359691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951925,0.001667919,0.001056118,0.0009008569,0.00038321826,0.0007993842],"domain_scores_gemma":[0.9965386,0.00047254335,0.00043451847,0.002319014,0.000146111,0.00008924366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01304054,0.00033740103,0.0005337929,0.00036009005,0.00025897712,0.00024674184,0.003326324,0.0002454602,0.0000011153348],"category_scores_gemma":[0.0005867801,0.00031039474,0.00009584188,0.000645824,0.000058293732,0.0022555892,0.0006707148,0.0002451426,0.0000056866534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052564785,0.00005143213,0.000071640774,0.0003212465,0.000018531284,0.000003769709,0.0004435273,0.08710343,0.0049879174,0.86159235,0.00018638716,0.045167223],"study_design_scores_gemma":[0.00071570324,0.000054362088,0.00051800726,0.00008275392,0.000016601294,0.00003914799,0.00007511045,0.9669991,0.01893772,0.011966374,0.00024258369,0.00035250233],"about_ca_topic_score_codex":0.000068154426,"about_ca_topic_score_gemma":0.000005925672,"teacher_disagreement_score":0.8798957,"about_ca_system_score_codex":0.00024566049,"about_ca_system_score_gemma":0.00014762433,"threshold_uncertainty_score":0.9999348},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.3656074904811601,"score_gpt":0.4137656834194675,"score_spread":0.04815819293830742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065086898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036563738,0.00010531483,0.9886725,0.00000205651,0.001324618,0.0004901151,0.0000016235135,0.0003357973,0.0054116156],"genre_scores_gemma":[0.1806331,0.000002129358,0.81919,0.000028423014,0.00004740799,0.00006816191,4.2735508e-7,0.0000193213,0.000010977208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937977,0.0037596792,0.0009008164,0.0005370963,0.00033288237,0.00067181664],"domain_scores_gemma":[0.9978646,0.00047976096,0.00039330128,0.001029366,0.00012159251,0.00011136102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01659085,0.00026445038,0.00043340714,0.0003235867,0.00019766534,0.00011139005,0.0013134633,0.00017732942,0.000011011232],"category_scores_gemma":[0.00039779212,0.000250962,0.000081790895,0.0007688842,0.000071409064,0.002223442,0.0003192349,0.0002532228,0.00002345166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001287259,0.000108456275,0.0025269857,0.00039271402,0.000046961686,0.000065341184,0.018041864,0.0008135072,0.011556385,0.87298083,0.000022732625,0.0933155],"study_design_scores_gemma":[0.0004563596,0.00018912595,0.004041265,0.000315186,0.000015793175,0.0002861751,0.0017272069,0.9004336,0.08848288,0.0033276195,0.00017435022,0.000550441],"about_ca_topic_score_codex":0.0002515181,"about_ca_topic_score_gemma":0.0000024371627,"teacher_disagreement_score":0.8996201,"about_ca_system_score_codex":0.00036396337,"about_ca_system_score_gemma":0.00011599762,"threshold_uncertainty_score":0.9999943},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06565192373603344,"score_gpt":0.3183433128496665,"score_spread":0.25269138911363304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087115620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009299667,0.003056257,0.9915491,0.000021843136,0.00036023193,0.0008029493,0.000003302759,0.00056705996,0.002709301],"genre_scores_gemma":[0.48789385,0.000007000866,0.51180065,0.000026695272,0.00003659722,0.00017425625,0.0000011944516,0.00002196067,0.000037793172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99029833,0.006770236,0.0011779335,0.00055274594,0.0004452519,0.0007555043],"domain_scores_gemma":[0.9943271,0.0040761833,0.0003738077,0.0009558798,0.00018553007,0.00008146737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.017836535,0.00033697163,0.0005969211,0.0003177833,0.00037574352,0.00024824176,0.0018158164,0.00021790632,0.00000260375],"category_scores_gemma":[0.00024053546,0.00031937886,0.000087740846,0.0010958834,0.00005622363,0.001744781,0.00010144662,0.0003692583,0.000011712482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004745484,0.00048068853,0.0022956908,0.004950551,0.0001805606,0.000056919813,0.009464828,0.26256508,0.22936182,0.047619212,0.00039419087,0.4421559],"study_design_scores_gemma":[0.0018345667,0.00019405506,0.00009001744,0.0012349448,0.00003526797,0.00021853688,0.0012453129,0.87990165,0.112107486,0.002080431,0.0002938449,0.0007639142],"about_ca_topic_score_codex":0.00011609538,"about_ca_topic_score_gemma":0.0000041563835,"teacher_disagreement_score":0.6173365,"about_ca_system_score_codex":0.0003226387,"about_ca_system_score_gemma":0.0001653107,"threshold_uncertainty_score":0.99992585},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"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","score_opus":0.05480365477555006,"score_gpt":0.34642625720747283,"score_spread":0.2916226024319228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117013774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034794598,0.00018876747,0.9924743,0.000079613965,0.00072722556,0.0018820084,0.0000012632577,0.00048194826,0.00068539544],"genre_scores_gemma":[0.051844586,0.00001426044,0.9466135,0.00017605742,0.00011470426,0.0010959265,4.808347e-7,0.000030717994,0.00010975062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99343836,0.0038769096,0.00075755577,0.0006502997,0.0004940941,0.00078275293],"domain_scores_gemma":[0.9974024,0.0012606067,0.00025104964,0.00077953463,0.0001245815,0.0001818091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015976403,0.00030801192,0.0004860779,0.00036601277,0.0007644472,0.00023333443,0.0012051455,0.00013498019,0.000001366455],"category_scores_gemma":[0.0012562228,0.0002443583,0.00006401383,0.0012476424,0.000070810245,0.0010339023,0.00062487787,0.0004363826,0.000054169184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031057865,0.000013663242,0.00039614656,0.000068543566,0.000020389532,0.000039318405,0.010813122,0.010669022,0.0018735481,0.018258493,0.00006752014,0.9577492],"study_design_scores_gemma":[0.00032027627,0.00031687503,0.0032158787,0.0003300456,0.000010009054,0.00070238113,0.0009827868,0.9779471,0.010907175,0.0002611547,0.004578099,0.00042820678],"about_ca_topic_score_codex":0.00008681829,"about_ca_topic_score_gemma":0.0000011185441,"teacher_disagreement_score":0.96727806,"about_ca_system_score_codex":0.0002235905,"about_ca_system_score_gemma":0.00008081951,"threshold_uncertainty_score":0.9964642},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06174490093142226,"score_gpt":0.35726602333402185,"score_spread":0.2955211224025996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565985959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010373514,0.00011420095,0.9876391,0.000098590426,0.00022127628,0.0010942473,0.000013839096,0.00019175775,0.0002534682],"genre_scores_gemma":[0.3939109,0.0000020644643,0.60570043,0.000017865648,0.00003277419,0.0002941318,3.379983e-7,0.000009357775,0.000032093838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99707776,0.0010933736,0.0005256706,0.00055644405,0.0002972089,0.00044956757],"domain_scores_gemma":[0.99699026,0.0017633488,0.00017912954,0.0007503264,0.00015524784,0.00016170123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0083158985,0.00018892204,0.00031157467,0.00016157901,0.00017541302,0.000114318835,0.0006605126,0.0001288446,0.000006071574],"category_scores_gemma":[0.00036562787,0.0001334335,0.00005042682,0.00017195506,0.00016791516,0.0006610977,0.00020332402,0.00008678102,0.000005071193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005860302,0.00008582656,0.00010930913,0.00022043077,0.000015691283,0.000003078273,0.002587194,0.00024294104,0.035926722,0.6508401,0.00016772386,0.30974236],"study_design_scores_gemma":[0.0065781544,0.0010347728,0.0015789212,0.0017622167,0.00003626742,0.00026912286,0.0055380464,0.44997337,0.49123973,0.028465185,0.011770968,0.001753248],"about_ca_topic_score_codex":0.0000062717886,"about_ca_topic_score_gemma":5.850794e-7,"teacher_disagreement_score":0.62237495,"about_ca_system_score_codex":0.00015730929,"about_ca_system_score_gemma":0.00011146012,"threshold_uncertainty_score":0.544126},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06240086683733612,"score_gpt":0.37295498489821033,"score_spread":0.3105541180608742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754637624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011979959,0.00023199583,0.98374814,0.00001563011,0.0011720645,0.001673531,0.000001940189,0.00030036343,0.0008763929],"genre_scores_gemma":[0.5466647,0.000018278024,0.4530268,0.000006754153,0.000032758962,0.00020725778,8.215149e-8,0.000011700103,0.000031631003],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99731284,0.00072210195,0.00068498275,0.0005290645,0.0002649458,0.0004860398],"domain_scores_gemma":[0.99821395,0.00023797406,0.00037580132,0.0009472999,0.00013212328,0.00009285649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042664004,0.00026367372,0.00052412995,0.00023480676,0.0003848086,0.00040045293,0.00085918134,0.00017720954,9.4965685e-7],"category_scores_gemma":[0.00038409722,0.00023918445,0.000041342606,0.00019077535,0.00007119112,0.0027881628,0.0005830595,0.0002715063,0.000011482759],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004370295,0.00050662016,0.04119931,0.010324263,0.00032758733,0.00082267297,0.22058715,0.043914087,0.19094452,0.1787457,0.00015668957,0.3081011],"study_design_scores_gemma":[0.002149039,0.00088898547,0.01365762,0.005841471,0.000018726063,0.00042656183,0.004136424,0.30674526,0.66137767,0.0023033188,0.00083901046,0.0016159256],"about_ca_topic_score_codex":0.00024252411,"about_ca_topic_score_gemma":0.00000474676,"teacher_disagreement_score":0.5346848,"about_ca_system_score_codex":0.00039352203,"about_ca_system_score_gemma":0.000046122248,"threshold_uncertainty_score":0.9753659},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06975814659087953,"score_gpt":0.3957318738214263,"score_spread":0.3259737272305468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791546773","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004160148,0.00007872287,0.99249864,0.000015660571,0.0013913864,0.00033221944,0.000004282266,0.00024414336,0.0050189476],"genre_scores_gemma":[0.21896648,0.0000018491513,0.78066,0.000015772679,0.00016915188,0.000078011275,8.299863e-7,0.0000092979835,0.000098619836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792045,0.000582829,0.0005367983,0.000333469,0.00019999764,0.0004264432],"domain_scores_gemma":[0.9986318,0.00032908737,0.00018537848,0.00066481304,0.00009295193,0.00009596576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002859514,0.00016421659,0.00025879726,0.00018549315,0.0002229401,0.000058499994,0.00039651856,0.0000741281,0.000009946866],"category_scores_gemma":[0.00011079342,0.00014273147,0.000056410387,0.0003696112,0.00004900269,0.0016967396,0.0002111028,0.00014464441,0.00012600582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021979291,0.00004992861,0.0002706015,0.00015167931,0.000023474391,0.00003403032,0.001403605,0.0019943865,0.0035770265,0.8346895,0.00014592224,0.1576379],"study_design_scores_gemma":[0.002028039,0.0013764485,0.008202413,0.001979581,0.00003267831,0.0011497337,0.0045226184,0.6717769,0.1742112,0.0081063565,0.12460177,0.0020122638],"about_ca_topic_score_codex":0.00010846616,"about_ca_topic_score_gemma":0.000021877537,"teacher_disagreement_score":0.82658315,"about_ca_system_score_codex":0.00015700415,"about_ca_system_score_gemma":0.00007738606,"threshold_uncertainty_score":0.58204204},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.061465382102060005,"score_gpt":0.34610929637381743,"score_spread":0.28464391427175745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913086526","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003710575,0.00038527968,0.9818558,0.000018298811,0.00087890035,0.00032799362,2.7034866e-7,0.0002515458,0.015910834],"genre_scores_gemma":[0.16844314,0.0000030177314,0.8312141,0.000092051705,0.000026885471,0.00006281566,1.428893e-7,0.000010421836,0.00014742026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965067,0.0019042048,0.00043369364,0.00038821145,0.00020947009,0.0005577064],"domain_scores_gemma":[0.99860597,0.0005241366,0.00012497406,0.0005932113,0.000042555534,0.00010918135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004438117,0.00018845456,0.00031567595,0.00016959463,0.00011879148,0.000081590595,0.0007155038,0.00010647348,0.000011951169],"category_scores_gemma":[0.00026373228,0.00015774512,0.000075093,0.0006679855,0.000028732604,0.0008925032,0.00009801015,0.00017840507,0.000098133685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058566825,0.00002051716,0.00018259775,0.000040602,0.0000065539375,0.000042693846,0.00032421175,0.000953078,0.0007628666,0.9512054,0.000060709368,0.046394955],"study_design_scores_gemma":[0.0039820783,0.0012523853,0.0032075464,0.00058548583,0.000035708454,0.0018267807,0.0017851151,0.25887597,0.23269817,0.45994493,0.03296933,0.002836499],"about_ca_topic_score_codex":0.0000023377352,"about_ca_topic_score_gemma":6.3252725e-7,"teacher_disagreement_score":0.4912604,"about_ca_system_score_codex":0.00011528169,"about_ca_system_score_gemma":0.00007572812,"threshold_uncertainty_score":0.6432659},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.1346089457146592,"score_gpt":0.41691030172723903,"score_spread":0.28230135601257983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029555746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042164882,0.00010276997,0.99647355,0.000031244246,0.0008632433,0.0010120539,0.0000055739524,0.0004215606,0.00066833023],"genre_scores_gemma":[0.0711202,0.0000059288154,0.9280984,0.000050652427,0.000051736784,0.0006044579,0.000004466514,0.000018806608,0.0000453871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619126,0.0013708781,0.0008848433,0.0005447008,0.0003115782,0.000696723],"domain_scores_gemma":[0.9986344,0.00031446884,0.0002436327,0.0006171761,0.00011630173,0.00007402637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01413892,0.00021647042,0.0003626158,0.000360784,0.00011406369,0.00010242848,0.001022232,0.00020074568,4.699386e-7],"category_scores_gemma":[0.00052339386,0.00022265901,0.00008030099,0.002549387,0.00003872128,0.0012828762,0.00021937721,0.00010753424,0.000013112803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029351331,0.000012148702,0.0002723727,0.0001643885,0.0000032593373,0.0000034143864,0.00041222657,0.65039647,0.00042387127,0.27584323,0.00007765851,0.07236159],"study_design_scores_gemma":[0.0004936926,0.0000588329,0.0011868216,0.00016934377,0.0000031080108,0.000014045827,0.00012613439,0.9819248,0.0045199557,0.011181719,0.00008554207,0.00023605411],"about_ca_topic_score_codex":0.00003277656,"about_ca_topic_score_gemma":0.000008472125,"teacher_disagreement_score":0.33152828,"about_ca_system_score_codex":0.0007371353,"about_ca_system_score_gemma":0.00014528215,"threshold_uncertainty_score":0.90797716},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07312539246779999,"score_gpt":0.3896241254999382,"score_spread":0.3164987330321382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155827701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009854045,0.000082193474,0.9935697,0.000018566729,0.00035277245,0.00349953,0.0000052319397,0.00007737333,0.0014092608],"genre_scores_gemma":[0.39158556,2.980345e-7,0.6068929,0.000005015437,0.000019448004,0.0014677192,0.000004296327,0.0000047874446,0.00001996715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971805,0.0012389949,0.0007129444,0.0003118051,0.00031135994,0.00024435992],"domain_scores_gemma":[0.99871534,0.00011592316,0.00029613177,0.0006164607,0.00020656452,0.00004957796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038690418,0.00011703379,0.0003314426,0.00009573185,0.000055494722,0.00007210909,0.00042173424,0.00009613262,0.000002520691],"category_scores_gemma":[0.0001600022,0.00010744442,0.00006847297,0.0008102437,0.000012126176,0.00030482488,0.00008582392,0.0000836631,0.0000063117845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007650846,0.00032321515,0.0013109738,0.001795425,0.00003176597,0.000044237688,0.0020203853,0.06326457,0.030210247,0.50495625,0.00009770655,0.39586872],"study_design_scores_gemma":[0.00069654465,0.00010915392,0.018135414,0.00085687626,0.000005149831,0.00006792344,0.00024771973,0.8888981,0.08916956,0.00042399426,0.0011388792,0.00025070368],"about_ca_topic_score_codex":0.00005220045,"about_ca_topic_score_gemma":8.95826e-7,"teacher_disagreement_score":0.8256335,"about_ca_system_score_codex":0.00014086712,"about_ca_system_score_gemma":0.00010760447,"threshold_uncertainty_score":0.43814564},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Management science; Software engineering; Engineering","score_opus":0.10774311459949364,"score_gpt":0.36236677100220105,"score_spread":0.2546236564027074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212362464","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014021926,0.000041017887,0.99562615,0.00019821998,0.0015009609,0.0012555557,0.0000034681404,0.00021888016,0.0010155453],"genre_scores_gemma":[0.00903217,0.0000069323223,0.9901278,0.00014945802,0.00036670975,0.0001949421,4.5819988e-7,0.000028903327,0.000092597686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9892043,0.008067126,0.0009320991,0.00058978633,0.00054184924,0.00066487346],"domain_scores_gemma":[0.99501324,0.0027915644,0.00033432886,0.0016184879,0.00016538746,0.000077003955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01252925,0.00037937894,0.0006585517,0.0002265595,0.00013586487,0.0001281841,0.0021597773,0.00024316556,0.000023329307],"category_scores_gemma":[0.00019561421,0.00024850928,0.00016341575,0.001006191,0.000090877984,0.00055578706,0.00072900474,0.00064108963,0.000012819765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013910964,0.00015941345,0.000053453503,0.00024218946,0.000047532034,0.00004372659,0.0040656277,0.116920866,0.004301871,0.46591794,0.0017053282,0.40640292],"study_design_scores_gemma":[0.00040448178,0.00039420443,0.00050384685,0.0009159581,0.000009053773,0.00004909327,0.00004605397,0.740484,0.25127614,0.0027709147,0.0028145215,0.0003317567],"about_ca_topic_score_codex":0.000023769795,"about_ca_topic_score_gemma":0.000002895094,"teacher_disagreement_score":0.6235631,"about_ca_system_score_codex":0.00029865594,"about_ca_system_score_gemma":0.00024072679,"threshold_uncertainty_score":0.9999967},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.13741997515113363,"score_gpt":0.3972174777857111,"score_spread":0.25979750263457746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376644468","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034699857,0.00005181992,0.9927778,0.000056507673,0.0039127567,0.0012038898,0.000004422997,0.0007537521,0.00089204643],"genre_scores_gemma":[0.026494917,0.000006030863,0.97139806,0.000027998485,0.00020303957,0.0017461563,0.0000026044816,0.000029597377,0.000091572016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951658,0.002433728,0.00073427346,0.0005702469,0.00032566796,0.00077027426],"domain_scores_gemma":[0.9958564,0.0028815547,0.0003146119,0.00071247626,0.00012956362,0.00010539557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019490689,0.00022925736,0.0004004521,0.00057506695,0.0003301869,0.00019072951,0.000871254,0.00020075528,0.0000037319112],"category_scores_gemma":[0.0023641926,0.00022313067,0.0001403874,0.0016728938,0.000042567495,0.0015032361,0.00016892723,0.00016768085,0.000101105376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023069113,0.000027624867,0.0000717989,0.00037956913,0.00003834681,0.0000078186495,0.0013715818,0.002985806,0.004803536,0.62683386,0.00054998184,0.3626994],"study_design_scores_gemma":[0.0004375074,0.00032874948,0.0006928327,0.00027398978,0.00003286666,0.000032687225,0.0007852188,0.8919032,0.089047156,0.011594562,0.0044550034,0.0004162259],"about_ca_topic_score_codex":0.00000934999,"about_ca_topic_score_gemma":5.3993426e-7,"teacher_disagreement_score":0.8889174,"about_ca_system_score_codex":0.00033461675,"about_ca_system_score_gemma":0.000096145355,"threshold_uncertainty_score":0.9099005},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Abductive reasoning; Generalizability theory; Machine learning","score_opus":0.1074469343494178,"score_gpt":0.3535315076449354,"score_spread":0.2460845732955176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380609821","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009119959,0.0015849253,0.99506164,0.000045771696,0.0008758398,0.00050863356,3.0506772e-7,0.0001291695,0.0017025064],"genre_scores_gemma":[0.44089505,0.0000065646655,0.55865884,0.000024312987,0.00004971789,0.00009309482,7.3213175e-7,0.000009040761,0.00026268035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995379,0.002835688,0.0005969656,0.00044523264,0.00027501836,0.0004680983],"domain_scores_gemma":[0.9990841,0.00035600556,0.00018760061,0.00025696124,0.00002082694,0.00009450887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008221921,0.00017370848,0.0003689967,0.00030423456,0.00021787407,0.00014819404,0.000612094,0.00007293519,0.000023504148],"category_scores_gemma":[0.00015891931,0.00015506134,0.000049155722,0.00075677986,0.000026905665,0.00036038298,0.00052786,0.00044464652,0.000014145612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042878786,0.00003870551,0.0019706027,0.00006493955,0.000008224538,0.00008784611,0.003758895,0.004143078,0.00013418461,0.45188543,0.000023036106,0.53784215],"study_design_scores_gemma":[0.00032752674,0.00067320385,0.00021883973,0.000026496304,0.000007242985,0.0003271334,0.0032172948,0.8830825,0.00092509005,0.099039875,0.011673264,0.00048152034],"about_ca_topic_score_codex":0.00052435574,"about_ca_topic_score_gemma":0.00002494131,"teacher_disagreement_score":0.87893945,"about_ca_system_score_codex":0.00018120027,"about_ca_system_score_gemma":0.00008850484,"threshold_uncertainty_score":0.6323218},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01669935114813512,"score_gpt":0.3264332798356983,"score_spread":0.30973392868756316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396938619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008730377,0.0061339606,0.9823755,0.0000023420814,0.0009121295,0.00041363516,0.000010497281,0.00044450164,0.0009770268],"genre_scores_gemma":[0.8018412,0.000038173144,0.19794294,0.000002239368,0.000025653275,0.000090205205,0.0000070641604,0.000035033572,0.000017500668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768263,0.0008820172,0.00059667416,0.00023532505,0.00017410096,0.00042924713],"domain_scores_gemma":[0.9981408,0.0013467423,0.000052165713,0.0003781378,0.000027861664,0.00005428554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057482626,0.00019002479,0.00053763593,0.0007206667,0.000025495205,0.00003400691,0.00021693065,0.00018819937,0.000032007913],"category_scores_gemma":[0.00008542492,0.00018301005,0.00019680505,0.0024134563,0.000024120043,0.00025036538,0.00002550725,0.0002935538,0.00000573046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009397349,0.0000063891935,0.00007599869,0.00080776314,0.00047430166,0.0000056033855,0.00026303236,0.93972266,0.0003442867,0.00087533286,0.000019556575,0.057395697],"study_design_scores_gemma":[0.00007992136,0.00004716866,0.0011156731,0.000097966506,0.00033406765,0.000005907256,0.0000477438,0.99704576,0.00086108525,0.00006453852,0.00013992966,0.00016022594],"about_ca_topic_score_codex":0.000021772734,"about_ca_topic_score_gemma":0.000036671787,"teacher_disagreement_score":0.7931108,"about_ca_system_score_codex":0.00072385615,"about_ca_system_score_gemma":0.000033297627,"threshold_uncertainty_score":0.74629337},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03761707096719169,"score_gpt":0.3607803377685572,"score_spread":0.32316326680136553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406403030","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022585464,0.00021988965,0.9872928,0.00007601955,0.00048351375,0.00034075842,2.6042215e-7,0.00080496114,0.010759214],"genre_scores_gemma":[0.02489937,0.000003821946,0.9744651,0.000088569206,0.000015591559,0.00007815611,3.0465267e-7,0.000006020766,0.00044310623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779034,0.0009879716,0.00042501025,0.0003065833,0.00013632308,0.0003537536],"domain_scores_gemma":[0.9988425,0.000442044,0.000103370876,0.00048976246,0.00007151381,0.000050829447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036573748,0.00013812596,0.00027251037,0.00033064059,0.00014194273,0.0001502787,0.0008415812,0.000095492636,0.0000023751],"category_scores_gemma":[0.00017822212,0.00012591011,0.000053241616,0.00091661385,0.000020819452,0.00041674357,0.00024677924,0.00012939106,0.000016585307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027348564,0.000059802045,0.00044499728,0.00021662959,0.000022149496,0.000019709032,0.00028046293,0.04735812,0.00071804447,0.8561396,0.0033405945,0.091372535],"study_design_scores_gemma":[0.00024509177,0.0000430465,0.0001095156,0.00022704297,0.000003231046,0.000013890531,0.000021738568,0.9778718,0.015972193,0.0042209867,0.0011425181,0.00012898112],"about_ca_topic_score_codex":0.000016060647,"about_ca_topic_score_gemma":1.4910678e-7,"teacher_disagreement_score":0.9305136,"about_ca_system_score_codex":0.00014141851,"about_ca_system_score_gemma":0.00011964922,"threshold_uncertainty_score":0.51344657},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.048295583550084335,"score_gpt":0.37390378712247896,"score_spread":0.3256082035723946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412347816","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000204509,0.00017434066,0.9839912,0.000085364474,0.0011461267,0.0002966884,4.1708202e-7,0.00038218973,0.013719158],"genre_scores_gemma":[0.10681576,0.0000016795851,0.8920807,0.00006511694,0.00003863762,0.00006178487,3.643108e-7,0.000010039596,0.00092588237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997219,0.0011116349,0.00049818034,0.00042149873,0.00022809643,0.0005215375],"domain_scores_gemma":[0.99871236,0.00051705533,0.00015791896,0.00050624285,0.00005365204,0.0000527497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009831081,0.00018639615,0.00034239225,0.00033616,0.00024423574,0.00027253805,0.0009085201,0.00010038198,9.826766e-7],"category_scores_gemma":[0.00022669116,0.00016709675,0.000068166664,0.00078173156,0.000017869348,0.00072323915,0.00031514242,0.00029195275,0.000008140378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014242804,0.000029494782,0.00030596583,0.0005070849,0.000025193012,0.000019129835,0.0011100229,0.23369868,0.0014373626,0.5591782,0.00012142836,0.20355321],"study_design_scores_gemma":[0.00026564518,0.000020236517,0.000040629773,0.0003061996,0.0000054988895,0.000018040852,0.00010398819,0.993738,0.001878224,0.0031155243,0.00034172207,0.00016629984],"about_ca_topic_score_codex":0.00003816184,"about_ca_topic_score_gemma":4.895547e-7,"teacher_disagreement_score":0.7600393,"about_ca_system_score_codex":0.00016922696,"about_ca_system_score_gemma":0.00010249004,"threshold_uncertainty_score":0.6814008},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05068885233567185,"score_gpt":0.37101796828657335,"score_spread":0.3203291159509015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416533042","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021367853,0.00020723513,0.9953996,0.000024676703,0.00048553935,0.0006301613,0.0000012711636,0.00035909368,0.0007556437],"genre_scores_gemma":[0.1763129,0.0000025445788,0.8234954,0.000010532497,0.0000100094785,0.00012008726,3.3085726e-7,0.000010264635,0.00003796042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678093,0.0014649613,0.0006807207,0.00040422782,0.00023667522,0.00043249113],"domain_scores_gemma":[0.99427295,0.0043862173,0.00025573347,0.00088252657,0.00015487724,0.00004772482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071247495,0.00021936285,0.00053615577,0.00036597747,0.00011429982,0.00005531371,0.0008270943,0.00012562655,0.0000011074413],"category_scores_gemma":[0.0020374176,0.0001849568,0.00007366515,0.0013928238,0.00008948628,0.0006821118,0.00024272836,0.00022650132,0.0000011063885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108573906,0.00006928593,0.0022182104,0.0015000021,0.00010127568,0.000016261567,0.0027460859,0.28158623,0.0057271975,0.4050313,0.00001319841,0.3008824],"study_design_scores_gemma":[0.0028297545,0.00069383456,0.024198351,0.0036269345,0.00008241,0.000112520436,0.0015639984,0.39430198,0.3886218,0.18223509,0.0004256741,0.0013076398],"about_ca_topic_score_codex":0.00002828224,"about_ca_topic_score_gemma":0.000004819642,"teacher_disagreement_score":0.3828946,"about_ca_system_score_codex":0.00029872629,"about_ca_system_score_gemma":0.00019941357,"threshold_uncertainty_score":0.7542319},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.39019389647315583,"score_gpt":0.4831668037191479,"score_spread":0.09297290724599205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W840673086","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013925485,0.000071327195,0.97902423,0.000004521162,0.00020479955,0.0060615274,4.4252903e-7,0.000054482585,0.0006531739],"genre_scores_gemma":[0.45419157,7.1038585e-8,0.54540175,0.0000034309762,0.000021280308,0.00037840445,1.0020189e-7,0.0000028070306,6.0820724e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99247813,0.0058734426,0.000556318,0.00027294652,0.0006252807,0.00019388864],"domain_scores_gemma":[0.9982587,0.00035065567,0.0003639928,0.0003840536,0.0005779286,0.00006465305],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.057518326,0.00009793654,0.00023262909,0.00012119773,0.00008020803,0.00011067854,0.00038452641,0.00007778753,0.0000011069554],"category_scores_gemma":[0.0007928067,0.000092016715,0.000027107277,0.00034785128,0.000048524304,0.0007481566,0.00016880779,0.000094487244,6.8942586e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015436373,0.00020441932,0.004323073,0.0013807138,0.00006866829,0.0000033511344,0.028376693,0.028138371,0.01890471,0.39673647,0.000020948048,0.5216882],"study_design_scores_gemma":[0.0005868978,0.000060506678,0.00048448268,0.00022359412,0.000013847773,0.000028867309,0.0006876397,0.9631548,0.027471127,0.007175801,0.000012147597,0.00010027258],"about_ca_topic_score_codex":0.00010303994,"about_ca_topic_score_gemma":0.0000014035376,"teacher_disagreement_score":0.93501645,"about_ca_system_score_codex":0.00019909798,"about_ca_system_score_gemma":0.0003895486,"threshold_uncertainty_score":0.97048324},"labels":[],"label_agreement":null}]}