{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03132165,0.00006213598,0.95998585,0.00029023163,0.00005359108,0.00010183329,0.000073492,0.003894139,0.004217105],"genre_scores_gemma":[0.7075368,0.00006665939,0.28810552,0.00016925739,0.000041471307,0.00020987482,0.0001708019,0.0009324333,0.002767182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915283,0.0025944589,0.00047306743,0.0013662621,0.0032251924,0.0008128176],"domain_scores_gemma":[0.9868646,0.0060179005,0.00066869287,0.005429018,0.00078483234,0.00023499275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042579114,0.0009770031,0.001206719,0.00079013285,0.001103651,0.0017728801,0.0023956709,0.001034757,0.00382957],"category_scores_gemma":[0.016985724,0.0012285373,0.0023592936,0.00052090816,0.0034614592,0.005025073,0.006114552,0.0035703378,0.0008448401],"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.0014913913,0.00044583692,0.0032809137,0.0007421501,0.00027839403,0.0007757029,0.0010027592,0.23945582,0.05329493,0.53436244,0.003712478,0.1611572],"study_design_scores_gemma":[0.00015869712,0.0001459497,0.00028517222,0.00007086019,0.00011495143,0.00016631569,0.00006255238,0.5057625,0.053886663,0.43483806,0.004463774,0.00004460495],"about_ca_topic_score_codex":0.0009996783,"about_ca_topic_score_gemma":0.001472247,"teacher_disagreement_score":0.0042579114,"about_ca_system_score_codex":0.0012254437,"about_ca_system_score_gemma":0.0025291978,"threshold_uncertainty_score":0.022518277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043982733,0.00033505386,0.9472394,0.00067006267,0.00008217679,0.000045012246,0.0000850531,0.00038129627,0.00717933],"genre_scores_gemma":[0.90178764,0.00029331094,0.09159814,0.000217789,0.00013790671,0.00019658753,0.00011160562,0.00021370413,0.005443388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99348325,0.002562312,0.0003858577,0.00083677936,0.0021773577,0.0005543873],"domain_scores_gemma":[0.9843023,0.011369198,0.00077683985,0.0022401651,0.00087858574,0.0004328388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052414862,0.0010217164,0.0012128067,0.0010231414,0.0016251984,0.00455452,0.002665471,0.001899671,0.003018691],"category_scores_gemma":[0.021108342,0.0015874722,0.0021024742,0.00074016943,0.0066934503,0.009213609,0.0034828084,0.0053862967,0.00043038782],"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.000049775226,0.000025522588,0.00034515187,0.000046870526,0.00002001322,0.00013368634,0.0005947412,0.031019785,0.0009630981,0.9631529,0.00026161288,0.0033869268],"study_design_scores_gemma":[0.000031713218,0.000012471998,0.00003632594,0.000009213296,0.000018051458,0.000043384916,0.000040856685,0.10311503,0.0006353117,0.8953025,0.0007440985,0.00001117066],"about_ca_topic_score_codex":0.003191316,"about_ca_topic_score_gemma":0.0031995256,"teacher_disagreement_score":0.0052414862,"about_ca_system_score_codex":0.0017955285,"about_ca_system_score_gemma":0.0017040547,"threshold_uncertainty_score":0.027719975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003616381,0.00009092308,0.9799661,0.00011100657,0.000050497605,0.00005637935,0.0004247366,0.011586587,0.0040973686],"genre_scores_gemma":[0.23489234,0.00036677683,0.743644,0.00040693488,0.0001449478,0.0005402937,0.0020144265,0.006712601,0.011277636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991634,0.00023301487,0.000066771594,0.00011892976,0.00033577927,0.000082135244],"domain_scores_gemma":[0.99913436,0.00053965003,0.00008932101,0.000109791414,0.000095719945,0.000031135372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010698268,0.00074285327,0.00044165188,0.0007364201,0.0004075071,0.001919843,0.0015471353,0.0006798008,0.014926907],"category_scores_gemma":[0.0036880192,0.0006785202,0.00090795144,0.00046733185,0.0007509631,0.002530595,0.0012864603,0.0017498353,0.002513959],"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.00062974973,0.00013701881,0.0010943165,0.0010729856,0.00007849764,0.0007487951,0.00086723233,0.041950785,0.01984998,0.6263806,0.02461916,0.2825709],"study_design_scores_gemma":[0.00025161318,0.0001899072,0.00038078873,0.0003329201,0.00015316858,0.0005698029,0.00016017332,0.45679125,0.052647892,0.2967133,0.19173251,0.00007664578],"about_ca_topic_score_codex":0.0010038893,"about_ca_topic_score_gemma":0.0012759124,"teacher_disagreement_score":0.014926907,"about_ca_system_score_codex":0.0006384602,"about_ca_system_score_gemma":0.000595308,"threshold_uncertainty_score":0.04993552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010135454,0.00037296407,0.9624166,0.0005435675,0.00016911759,0.00006117596,0.00014640151,0.00084275095,0.02531201],"genre_scores_gemma":[0.5860705,0.0011205357,0.3916471,0.00080485415,0.0004882488,0.00030801745,0.00058426976,0.00078751164,0.0181891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982497,0.00042471164,0.00014733008,0.00025473308,0.00070641533,0.0002171299],"domain_scores_gemma":[0.9981627,0.0008174743,0.00010621737,0.0004399532,0.00041034594,0.00006327944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024182263,0.00069955917,0.0007135315,0.001385501,0.001010145,0.0035461227,0.002096567,0.0008596493,0.007696569],"category_scores_gemma":[0.0037740704,0.0005227507,0.0014395007,0.0009910922,0.004543575,0.0047048815,0.0024670605,0.0033837478,0.0013445485],"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.000016246744,0.000010872113,0.00005100901,0.000055547152,0.000007210103,0.000028676868,0.00013380947,0.0022923376,0.00049457414,0.98782814,0.00057259435,0.00850899],"study_design_scores_gemma":[0.000025821264,0.000021620117,0.00006680589,0.000041891504,0.000018820658,0.000054123924,0.00005568172,0.012157055,0.0018826656,0.9742522,0.011407788,0.000015535006],"about_ca_topic_score_codex":0.001233792,"about_ca_topic_score_gemma":0.0010917,"teacher_disagreement_score":0.007696569,"about_ca_system_score_codex":0.0014988483,"about_ca_system_score_gemma":0.0013910804,"threshold_uncertainty_score":0.025747597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00993693,0.00014557972,0.97487396,0.00015989522,0.00019479493,0.00010144985,0.00011188714,0.005419352,0.009056124],"genre_scores_gemma":[0.67635226,0.00025472397,0.30684838,0.00032401647,0.00014001464,0.00030735874,0.00039275602,0.0019405702,0.013439842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99337405,0.0017792947,0.00037118624,0.0011327459,0.0026664895,0.0006762425],"domain_scores_gemma":[0.9916435,0.003799257,0.00046800965,0.00287278,0.000975949,0.00024041899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034618867,0.001202075,0.0008792388,0.0010428593,0.00067559397,0.0020753448,0.0021228895,0.0013576263,0.009938914],"category_scores_gemma":[0.010695907,0.00073856936,0.0017186988,0.0005353255,0.0017548457,0.0032626681,0.0024582937,0.0026057062,0.0025152268],"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.0014528363,0.00023208135,0.0009667373,0.00074180943,0.00017897975,0.0010358316,0.00066005526,0.06765895,0.09817053,0.66981864,0.007762469,0.15132105],"study_design_scores_gemma":[0.00027264445,0.0002642176,0.0004412809,0.00014854457,0.00019975269,0.0004988693,0.00008631052,0.48217458,0.15931705,0.32242373,0.034064095,0.000108951484],"about_ca_topic_score_codex":0.0006354786,"about_ca_topic_score_gemma":0.00075328967,"teacher_disagreement_score":0.009938914,"about_ca_system_score_codex":0.0010259828,"about_ca_system_score_gemma":0.0015224585,"threshold_uncertainty_score":0.03324902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028345421,0.00072698086,0.95413834,0.0013388484,0.00047884815,0.00007230194,0.00004571818,0.0030549094,0.011798619],"genre_scores_gemma":[0.74888,0.00072318537,0.2411907,0.0004933048,0.00032128376,0.00016879068,0.00010583927,0.0013214924,0.006795369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9870798,0.0052846232,0.00084656803,0.0013692512,0.0040228507,0.0013969118],"domain_scores_gemma":[0.9557035,0.025856066,0.001806135,0.013371431,0.0026359556,0.0006269464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012741007,0.00076655427,0.0014455299,0.0010746906,0.0013183018,0.0042830314,0.0033190064,0.0019107288,0.004706726],"category_scores_gemma":[0.036835115,0.0011358929,0.0016445537,0.0008764538,0.0052674916,0.00625377,0.0036909555,0.006894028,0.00071432104],"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.00047127198,0.0001874519,0.0008403671,0.0003832978,0.00010333967,0.0005573303,0.0011319284,0.035280056,0.01343526,0.86323863,0.0026084902,0.081762485],"study_design_scores_gemma":[0.00034771994,0.00023113361,0.00044476945,0.00030423838,0.0002473429,0.00035205073,0.00034713402,0.3333853,0.040843222,0.5953755,0.02801935,0.000102269165],"about_ca_topic_score_codex":0.0021797628,"about_ca_topic_score_gemma":0.0025603315,"teacher_disagreement_score":0.012741007,"about_ca_system_score_codex":0.001569836,"about_ca_system_score_gemma":0.0029095032,"threshold_uncertainty_score":0.06738174},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084789435,0.000059061236,0.99631506,0.0003117966,0.000073164614,0.000045926543,0.000043575696,0.00061664684,0.0016868504],"genre_scores_gemma":[0.108874574,0.00036771625,0.8844435,0.00068180857,0.0001661155,0.00031183977,0.00028914612,0.00072365167,0.004141675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99405694,0.0020793842,0.00074836134,0.0007590032,0.0018673588,0.0004889723],"domain_scores_gemma":[0.9865643,0.007494612,0.00065893424,0.0036967904,0.0012495529,0.00033584164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069336398,0.0010399618,0.0010348122,0.0020601,0.0012415727,0.0048508253,0.002753246,0.0020132947,0.008282335],"category_scores_gemma":[0.02165601,0.0013008186,0.002341423,0.0014134006,0.0042860117,0.008060901,0.007105704,0.006063884,0.002076626],"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.000057110894,0.00008805999,0.00037100143,0.00026487664,0.000040503943,0.00014681013,0.00025539586,0.00879965,0.0020585046,0.9369203,0.0018674608,0.049130425],"study_design_scores_gemma":[0.00006464029,0.000068483074,0.0001262401,0.00019450273,0.00007834585,0.00024277878,0.00007903038,0.07370924,0.010807995,0.8779527,0.036621485,0.000054583074],"about_ca_topic_score_codex":0.0009972721,"about_ca_topic_score_gemma":0.0014957507,"teacher_disagreement_score":0.008282335,"about_ca_system_score_codex":0.0014245429,"about_ca_system_score_gemma":0.0031151564,"threshold_uncertainty_score":0.036669075},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018337133,0.00023559292,0.99212134,0.00049132976,0.000057115638,0.00005185684,0.000074751166,0.000822166,0.0043122317],"genre_scores_gemma":[0.26126602,0.0006595237,0.7302147,0.00043770403,0.00013852572,0.00036732957,0.00035611802,0.0003597061,0.0062003573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99444133,0.0026605572,0.0002462557,0.00046333857,0.0018218465,0.0003666565],"domain_scores_gemma":[0.980931,0.014731696,0.00043290024,0.0024654695,0.0012578776,0.00018104319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004587242,0.0014282084,0.0014281594,0.002688194,0.0012886702,0.003166432,0.0041560624,0.0016375827,0.0069820844],"category_scores_gemma":[0.01818573,0.0014327692,0.0028026148,0.0016187755,0.0043853754,0.004249447,0.0023217471,0.00566764,0.0008925969],"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.0001686963,0.0001560205,0.00030892238,0.00031514437,0.00015217275,0.00012399492,0.0002847365,0.17779867,0.001970015,0.7540193,0.0036262674,0.061076052],"study_design_scores_gemma":[0.00006873999,0.000033135915,0.00007407911,0.00007679734,0.00007468625,0.000031743955,0.000034476212,0.48433754,0.0030661689,0.5068058,0.005372671,0.00002424252],"about_ca_topic_score_codex":0.014369499,"about_ca_topic_score_gemma":0.011234773,"teacher_disagreement_score":0.014369499,"about_ca_system_score_codex":0.003063006,"about_ca_system_score_gemma":0.004932801,"threshold_uncertainty_score":0.028571725},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15286313,0.00006238007,0.8408115,0.00008552584,0.00007443253,0.00008425435,0.00007200632,0.0013675916,0.004579317],"genre_scores_gemma":[0.9585278,0.000025007024,0.03871572,0.00002993451,0.000009758769,0.00005746042,0.000040179693,0.00019157183,0.0024026053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988066,0.00022409282,0.00006334949,0.00033904015,0.00038549397,0.00018135083],"domain_scores_gemma":[0.9977894,0.0011857643,0.00027052508,0.00040683345,0.00023642581,0.00011103619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016901973,0.0008082384,0.00090273394,0.0004191765,0.00075617083,0.0011833366,0.0011147626,0.0010769848,0.0057952604],"category_scores_gemma":[0.0046516047,0.00040422188,0.00092247763,0.00014037512,0.001985048,0.001481841,0.0019181225,0.0010979406,0.00084615767],"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.0018514754,0.0002169936,0.006215163,0.0007042799,0.00024609687,0.0021302793,0.0014091383,0.2791293,0.23344648,0.4172226,0.0013248705,0.056103375],"study_design_scores_gemma":[0.00031717378,0.00093619636,0.00097385247,0.000065500775,0.00015077964,0.00034726888,0.00020151584,0.8025983,0.100626156,0.0899585,0.0037338166,0.000090951486],"about_ca_topic_score_codex":0.00063048257,"about_ca_topic_score_gemma":0.00063019537,"teacher_disagreement_score":0.0057952604,"about_ca_system_score_codex":0.00059176306,"about_ca_system_score_gemma":0.00079282734,"threshold_uncertainty_score":0.019387126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016166776,0.00018027982,0.9790715,0.000147685,0.000035631343,0.000039549075,0.000027284035,0.00028407908,0.0040472155],"genre_scores_gemma":[0.7912922,0.0005595356,0.20113134,0.00023904136,0.00010165217,0.0003166107,0.000071756534,0.0003299922,0.005957776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676895,0.00088033476,0.0002231631,0.0006950993,0.0011070773,0.00032539383],"domain_scores_gemma":[0.9808772,0.012980439,0.0014087036,0.0027836396,0.0015537366,0.00039633963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004084856,0.0008248,0.0009165979,0.0010365789,0.0007397643,0.001461325,0.0014710011,0.0009803398,0.003244014],"category_scores_gemma":[0.014853242,0.0012504923,0.0014758285,0.00062157225,0.0044258265,0.0051430184,0.0032593776,0.0024391413,0.00066263904],"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.00014175558,0.000059308808,0.00052369025,0.00030740837,0.00007533308,0.00022617185,0.0006339935,0.038735017,0.010521218,0.9198624,0.00048568536,0.028427929],"study_design_scores_gemma":[0.000066853645,0.000105002066,0.00023039675,0.000051267023,0.00009399676,0.00035759632,0.000063975946,0.06633638,0.015506221,0.91251844,0.0046319054,0.00003796545],"about_ca_topic_score_codex":0.00036514885,"about_ca_topic_score_gemma":0.00029305133,"teacher_disagreement_score":0.004084856,"about_ca_system_score_codex":0.0008466072,"about_ca_system_score_gemma":0.001016939,"threshold_uncertainty_score":0.021603048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034529592,0.00014702784,0.9915489,0.00015692417,0.0000535129,0.00007232117,0.00045461874,0.0027364069,0.0013772968],"genre_scores_gemma":[0.28691906,0.0004434942,0.703238,0.00035739958,0.000088940935,0.0011504155,0.0023063626,0.0019013962,0.003594848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99468553,0.0015668212,0.00083049614,0.0008050987,0.0017419878,0.0003699756],"domain_scores_gemma":[0.98476887,0.009053403,0.0007863328,0.0041136625,0.001093268,0.00018447217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038193369,0.0017583494,0.001893789,0.0022921928,0.0012124417,0.004686311,0.004339509,0.0022005665,0.00983526],"category_scores_gemma":[0.02107059,0.0018558485,0.0024916157,0.0027580578,0.0035166277,0.010406713,0.0053969827,0.0048144567,0.0028314416],"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.00043082022,0.00012207295,0.00074210967,0.0006327057,0.00010917113,0.00020305955,0.0005186319,0.058784254,0.0046270825,0.8175287,0.0040342472,0.11226706],"study_design_scores_gemma":[0.00009627598,0.00004474854,0.00006393571,0.0001608512,0.000071153954,0.000053737283,0.000062224324,0.14371367,0.012919822,0.83215827,0.010611235,0.000044081637],"about_ca_topic_score_codex":0.0016631823,"about_ca_topic_score_gemma":0.0018714837,"teacher_disagreement_score":0.00983526,"about_ca_system_score_codex":0.0020043175,"about_ca_system_score_gemma":0.0020255628,"threshold_uncertainty_score":0.03290224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046651874,0.0002321381,0.93865585,0.0017730669,0.00029868673,0.00013634974,0.00011778142,0.0023830582,0.009751115],"genre_scores_gemma":[0.78544533,0.00030810572,0.20874843,0.0005155609,0.00007899291,0.00022472402,0.00018380016,0.00067696243,0.0038180721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993489,0.003188075,0.0004020366,0.0007612641,0.0015698888,0.00058977713],"domain_scores_gemma":[0.9278431,0.062413596,0.0018252686,0.005636012,0.0019049371,0.00037722808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062166094,0.0014522397,0.0009317704,0.0029402003,0.0015568666,0.0026648843,0.0016401003,0.003020688,0.011904977],"category_scores_gemma":[0.057773508,0.001118632,0.0018930968,0.0013178731,0.0048566866,0.009423453,0.0034594594,0.0041917614,0.0006395034],"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.00031128386,0.0001463931,0.0024156878,0.00036396796,0.00006177228,0.0011024831,0.0012775765,0.035789758,0.0031590299,0.9236122,0.0021917014,0.029568216],"study_design_scores_gemma":[0.000121931946,0.00007086445,0.00031587132,0.00016593405,0.00009636149,0.00041916643,0.0003092258,0.19517845,0.011584434,0.7815413,0.010137282,0.000059124486],"about_ca_topic_score_codex":0.0022318785,"about_ca_topic_score_gemma":0.002216048,"teacher_disagreement_score":0.011904977,"about_ca_system_score_codex":0.0011529383,"about_ca_system_score_gemma":0.0016754383,"threshold_uncertainty_score":0.039826155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004813843,0.000056333378,0.99379504,0.00005413412,0.000017973132,0.00006146514,0.0000057501593,0.00021035447,0.0009850219],"genre_scores_gemma":[0.35977846,0.0003310712,0.63614255,0.00012100194,0.000051774667,0.0006072768,0.00006635192,0.00018786383,0.0027136332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700814,0.0010760003,0.00022209932,0.00040331026,0.0010372434,0.00025323377],"domain_scores_gemma":[0.9963754,0.0023903758,0.000257744,0.0005264213,0.00035716328,0.00009287167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003658784,0.00074663106,0.0008224498,0.00060299,0.00096303516,0.0019997358,0.001970478,0.0014783759,0.0033462672],"category_scores_gemma":[0.007126535,0.001137715,0.0012493304,0.00062129984,0.0033020142,0.002996955,0.0016959065,0.0021286265,0.0006516224],"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.0002311369,0.00016617014,0.000758487,0.0005435202,0.00010748741,0.00033417472,0.0014783341,0.32649463,0.017887129,0.56412303,0.0011916197,0.08668425],"study_design_scores_gemma":[0.00015615359,0.00016082721,0.00011533221,0.000089180496,0.00008441821,0.000099969366,0.00015119373,0.71060026,0.016485048,0.26487255,0.007147641,0.00003751033],"about_ca_topic_score_codex":0.0010714522,"about_ca_topic_score_gemma":0.0011198587,"teacher_disagreement_score":0.003658784,"about_ca_system_score_codex":0.00068917824,"about_ca_system_score_gemma":0.001854306,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008049882,0.000050721228,0.98847777,0.00037092858,0.000017292416,0.000056384037,0.000032410637,0.0017893479,0.0011552171],"genre_scores_gemma":[0.21959649,0.000058183017,0.77773786,0.00028256947,0.00003660113,0.00014257607,0.00014893276,0.00040545283,0.0015914736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994132,0.0026424665,0.00032707865,0.0010217627,0.0013295021,0.0005471163],"domain_scores_gemma":[0.9792108,0.014565019,0.0010127535,0.0033579397,0.001472334,0.00038118937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006435745,0.0010637029,0.0014640327,0.0013004229,0.0015027728,0.0025668363,0.003995461,0.0020664877,0.007030066],"category_scores_gemma":[0.03130167,0.0011683578,0.0017110289,0.0009014077,0.0035522915,0.00569971,0.0052871336,0.0041016275,0.0014335049],"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.001007666,0.00040541936,0.0026675484,0.00034126695,0.00015328343,0.00021648238,0.0006741969,0.18472403,0.007167767,0.13192347,0.00802456,0.66269433],"study_design_scores_gemma":[0.00008390859,0.000049010338,0.0001031986,0.000027879505,0.000023968516,0.000039385606,0.00006592118,0.8524445,0.005525797,0.14019935,0.00142132,0.00001579053],"about_ca_topic_score_codex":0.0064015547,"about_ca_topic_score_gemma":0.009609075,"teacher_disagreement_score":0.007030066,"about_ca_system_score_codex":0.0017715346,"about_ca_system_score_gemma":0.0052953935,"threshold_uncertainty_score":0.03403592},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003578879,0.0002188717,0.94909805,0.00043688217,0.00012101811,0.00020305315,0.003679975,0.033824835,0.00883844],"genre_scores_gemma":[0.05627024,0.00035323002,0.91037136,0.0005314371,0.00007544918,0.0005163832,0.0069293957,0.012200669,0.012751748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770665,0.00051845,0.00022101693,0.00039676938,0.0008807026,0.0002763787],"domain_scores_gemma":[0.99626005,0.0027362863,0.00016955292,0.0003617584,0.00039675197,0.00007549697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017772872,0.0028397187,0.0013229828,0.0020938881,0.0010443671,0.003314736,0.00448277,0.0021900127,0.049341872],"category_scores_gemma":[0.009017603,0.0019981547,0.002677505,0.0025649494,0.0011286938,0.004300178,0.003945227,0.0028508096,0.011482688],"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.00071035844,0.0002808994,0.0021880872,0.0027451804,0.00034982892,0.00087950926,0.0005868967,0.1124083,0.01190406,0.17400597,0.16252227,0.5314186],"study_design_scores_gemma":[0.0005664125,0.00006278656,0.00024442282,0.00020251946,0.00013481134,0.00034496404,0.00027233473,0.7067233,0.021678353,0.16447206,0.10520179,0.000096306925],"about_ca_topic_score_codex":0.010212061,"about_ca_topic_score_gemma":0.022543991,"teacher_disagreement_score":0.049341872,"about_ca_system_score_codex":0.0016964257,"about_ca_system_score_gemma":0.004580345,"threshold_uncertainty_score":0.16506499},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08635803,0.0002722828,0.9072361,0.0002515835,0.00006396761,0.000068831665,0.000038072754,0.002980971,0.0027301724],"genre_scores_gemma":[0.9052925,0.000110905305,0.09256606,0.00011017212,0.000032020023,0.00007814601,0.000035235837,0.0004137306,0.0013611572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699354,0.0011066864,0.00019193794,0.00036037716,0.0010448257,0.00030265527],"domain_scores_gemma":[0.9878105,0.006714644,0.0013631926,0.0030544926,0.000906323,0.00015082346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029175265,0.00092497276,0.0005007352,0.0009963361,0.00044589545,0.001328586,0.0012457863,0.0006843872,0.0012765707],"category_scores_gemma":[0.01142697,0.0007664063,0.00058024074,0.00034063062,0.0016719246,0.0025360277,0.001134805,0.0017757643,0.0002745528],"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.0007158069,0.0007226795,0.009806757,0.000584564,0.00015616808,0.00036705908,0.00096785004,0.45845544,0.12532532,0.15737678,0.0028949983,0.24262652],"study_design_scores_gemma":[0.00003143114,0.00011208138,0.00069457595,0.000046179637,0.00004980559,0.000075508695,0.000035104924,0.9174658,0.04757284,0.03249208,0.0014031221,0.00002153151],"about_ca_topic_score_codex":0.0008256103,"about_ca_topic_score_gemma":0.0014196398,"teacher_disagreement_score":0.0029175265,"about_ca_system_score_codex":0.00079238846,"about_ca_system_score_gemma":0.0013178794,"threshold_uncertainty_score":0.015429556},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027351934,0.00012154426,0.9654915,0.00032154357,0.000084602696,0.00013406476,0.0008037666,0.0032126957,0.0024784],"genre_scores_gemma":[0.4322628,0.0003874589,0.5593423,0.00018721819,0.00012554093,0.00015990029,0.0031356574,0.0005913973,0.003807746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957445,0.0010247463,0.00029967935,0.0008816755,0.0016797611,0.00036960893],"domain_scores_gemma":[0.9902749,0.005704624,0.00061860896,0.002055868,0.0011139561,0.00023211821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037642315,0.0011667791,0.0008603725,0.0031267798,0.00090203574,0.0032420703,0.001698623,0.0014685666,0.004587329],"category_scores_gemma":[0.02323595,0.0011335986,0.0024418219,0.0017427863,0.0011561656,0.0046076123,0.003133629,0.0025383811,0.0011910411],"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.0010074791,0.00050122256,0.032939103,0.00077235687,0.0004833917,0.0016425884,0.0016406055,0.19061181,0.026361926,0.4178826,0.011739188,0.3144177],"study_design_scores_gemma":[0.000055012762,0.00006239318,0.001928612,0.00007948748,0.00015908516,0.00018552349,0.00023039787,0.75301766,0.018725544,0.2110302,0.014489277,0.00003677159],"about_ca_topic_score_codex":0.00436613,"about_ca_topic_score_gemma":0.005088728,"teacher_disagreement_score":0.004587329,"about_ca_system_score_codex":0.0013449609,"about_ca_system_score_gemma":0.0024304816,"threshold_uncertainty_score":0.019907355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013523816,0.00086762704,0.78171986,0.0016395444,0.00048146557,0.00021316325,0.0005951651,0.0009119357,0.20004737],"genre_scores_gemma":[0.6235626,0.0016936233,0.09952934,0.0010986648,0.00081920216,0.00039498918,0.0010323215,0.00041318068,0.27145612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990421,0.0002070511,0.00005081492,0.00018700336,0.0003894423,0.00012356714],"domain_scores_gemma":[0.9985586,0.00050018926,0.00013747277,0.0003700839,0.00030911967,0.00012455546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012893289,0.00065472466,0.0005858207,0.0011607357,0.0013664829,0.0021194092,0.00094582944,0.0008241683,0.034408133],"category_scores_gemma":[0.0035581563,0.0004002652,0.0008605476,0.0007761939,0.001876183,0.0035616562,0.0017360565,0.0022749722,0.0056320326],"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.000011918627,0.000009446447,0.000043958116,0.000019050145,0.0000046702426,0.000013775652,0.000046632038,0.0007424688,0.000255606,0.98957205,0.0015939719,0.0076864837],"study_design_scores_gemma":[0.000012248311,0.000013301478,0.000049792543,0.000009761294,0.000008037772,0.0000423641,0.00003523776,0.0048451284,0.0007595248,0.9739096,0.020306356,0.0000084572075],"about_ca_topic_score_codex":0.00078361755,"about_ca_topic_score_gemma":0.0005405322,"teacher_disagreement_score":0.034408133,"about_ca_system_score_codex":0.0010873569,"about_ca_system_score_gemma":0.001105572,"threshold_uncertainty_score":0.11510664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079519674,0.00027306864,0.90179473,0.00038246906,0.00003273255,0.00014660481,0.00014004721,0.014513173,0.0031975114],"genre_scores_gemma":[0.68130755,0.00012023364,0.31558275,0.00031258265,0.000031780604,0.00013621322,0.00027741937,0.0014191063,0.0008124093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97967714,0.011029773,0.0013444024,0.0025651618,0.0041312748,0.0012521592],"domain_scores_gemma":[0.9416278,0.030286096,0.0036616225,0.02123925,0.0026688967,0.0005163824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013244908,0.0014936371,0.0014848787,0.0014613409,0.0007647703,0.0024143036,0.0032876737,0.0012911895,0.002800048],"category_scores_gemma":[0.037588757,0.0010167229,0.0024133322,0.001376054,0.00417519,0.006035004,0.005926193,0.004205026,0.000852606],"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.0022446008,0.00064863946,0.025176052,0.001485053,0.00046300393,0.00053339405,0.0018516757,0.3686361,0.060741954,0.18442324,0.0071277265,0.3466685],"study_design_scores_gemma":[0.00015817433,0.00038499993,0.0009760445,0.00017858612,0.00016367648,0.00017667611,0.00015450682,0.8527278,0.060782444,0.078479014,0.0057412386,0.00007675708],"about_ca_topic_score_codex":0.002578151,"about_ca_topic_score_gemma":0.003774095,"teacher_disagreement_score":0.013244908,"about_ca_system_score_codex":0.0014668196,"about_ca_system_score_gemma":0.003329862,"threshold_uncertainty_score":0.0700466},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025317013,0.000100544195,0.9684304,0.00069228775,0.00005806878,0.00018104809,0.00014377055,0.0024832785,0.0025936551],"genre_scores_gemma":[0.5303394,0.0003183572,0.4629364,0.00054788636,0.000104790306,0.0006905398,0.00077967066,0.000610068,0.00367276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9847342,0.006823542,0.0010220204,0.0017910453,0.004289154,0.0013399861],"domain_scores_gemma":[0.9642609,0.023699801,0.001706766,0.0062300772,0.0035503039,0.0005521311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008989824,0.00097504485,0.0012533398,0.0014752005,0.0015040324,0.0039675958,0.0031811118,0.002379691,0.0046899174],"category_scores_gemma":[0.034066815,0.0011776995,0.0025213799,0.001158835,0.005005767,0.0075088753,0.007984583,0.00545465,0.0012265752],"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.00036211673,0.00021794345,0.0019630583,0.0004550168,0.00011718212,0.0005729622,0.0011612354,0.14670806,0.02277534,0.7686957,0.004285937,0.052685466],"study_design_scores_gemma":[0.00009198662,0.00005960688,0.00014723383,0.00006407032,0.00003849423,0.00008524817,0.000121243,0.49868342,0.017258406,0.4773624,0.006055557,0.000032381806],"about_ca_topic_score_codex":0.001990274,"about_ca_topic_score_gemma":0.0013800333,"teacher_disagreement_score":0.008989824,"about_ca_system_score_codex":0.002481035,"about_ca_system_score_gemma":0.0037003942,"threshold_uncertainty_score":0.047543287},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036513613,0.016070083,0.0038775872,0.02816833,0.9217626,0.0001704758,0.00062263093,0.00031186893,0.028651407],"genre_scores_gemma":[0.0041146716,0.020225251,0.002529495,0.009249703,0.6607837,0.0003198696,0.0026896382,0.0013235309,0.29876408],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968155,0.00047248628,0.0002707388,0.0004225411,0.0017458678,0.00027292364],"domain_scores_gemma":[0.9806291,0.0032607988,0.00075993984,0.00085750734,0.011081113,0.0034115796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00468874,0.0024277165,0.00300533,0.005627999,0.0022354575,0.007907101,0.002280452,0.0040793195,0.16701713],"category_scores_gemma":[0.014528383,0.0006349319,0.0015278872,0.0024486305,0.001008984,0.0048677824,0.0031424,0.0065785437,0.08792822],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000041606618,0.00003274888,0.00005883168,0.00016622122,0.0000070625856,0.000024985466,0.000016752929,0.000070341695,0.00017494435,0.00083349727,0.97611374,0.02245916],"study_design_scores_gemma":[0.000026573904,0.00007267587,0.000562354,0.00037500364,0.000016374517,0.000094475305,0.000039820166,0.00045977574,0.00025220148,0.0025698692,0.9955096,0.00002112658],"about_ca_topic_score_codex":0.0016633391,"about_ca_topic_score_gemma":0.0025007296,"teacher_disagreement_score":0.16701713,"about_ca_system_score_codex":0.0027137308,"about_ca_system_score_gemma":0.0034160179,"threshold_uncertainty_score":0.558728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00481299,0.00031225017,0.9870423,0.00009722725,0.00003840005,0.000024388753,0.00003435101,0.0010595478,0.0065785274],"genre_scores_gemma":[0.5456899,0.0008265512,0.43942142,0.00023860928,0.00014825974,0.00031470123,0.00027834327,0.00113815,0.011944123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660516,0.0011715053,0.0001750396,0.0004554712,0.0012372546,0.0003556812],"domain_scores_gemma":[0.99143267,0.0058842865,0.00025690696,0.0017952755,0.0005002011,0.00013066182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029938181,0.0013003468,0.001660313,0.0013263393,0.0010261344,0.0023553441,0.0015512599,0.001242179,0.0082598245],"category_scores_gemma":[0.012728723,0.0011115575,0.0017194165,0.0009008122,0.003197575,0.0037641635,0.0031905926,0.0032326167,0.0016264459],"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.00013525467,0.000039377872,0.00024060206,0.00025101393,0.00004353324,0.000088655484,0.00020656094,0.11973627,0.0069844793,0.76763153,0.0018907879,0.10275206],"study_design_scores_gemma":[0.000027741644,0.00004919001,0.000109423876,0.00009796353,0.00005819378,0.00006441532,0.000023332197,0.41342703,0.01053214,0.56599927,0.00957953,0.000031759486],"about_ca_topic_score_codex":0.0023637367,"about_ca_topic_score_gemma":0.0026602093,"teacher_disagreement_score":0.0082598245,"about_ca_system_score_codex":0.0018978827,"about_ca_system_score_gemma":0.0015661633,"threshold_uncertainty_score":0.027631879},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005802157,0.13967665,0.74167883,0.08234623,0.0027891109,0.000048629667,0.00020381396,0.00044331458,0.027011229],"genre_scores_gemma":[0.29369605,0.1112322,0.55007553,0.01353361,0.01660386,0.00035665222,0.00034735462,0.00049038325,0.013664336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99501485,0.0028529651,0.00025835683,0.000490004,0.0012387746,0.00014496624],"domain_scores_gemma":[0.96803623,0.028675126,0.0005516385,0.0013615293,0.0009626504,0.00041281444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0082097985,0.0010871844,0.002167034,0.0027166877,0.0014434109,0.009637261,0.001866935,0.0033506034,0.0047005313],"category_scores_gemma":[0.016074553,0.00067435694,0.0010817674,0.0026956534,0.017019052,0.021375898,0.0024558848,0.0075009186,0.0010080324],"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.000027987191,0.00003209794,0.0002519582,0.00029655706,0.000020066618,0.000022048413,0.00022066725,0.0011317326,0.000118363416,0.96182007,0.0046174116,0.03144106],"study_design_scores_gemma":[0.000013230723,0.000010903689,0.00005985049,0.00009968419,0.0000055215123,0.000019532774,0.00008777858,0.0033757691,0.00006597758,0.9802501,0.015999649,0.0000120868735],"about_ca_topic_score_codex":0.0023273684,"about_ca_topic_score_gemma":0.0015523769,"teacher_disagreement_score":0.009637261,"about_ca_system_score_codex":0.0025642174,"about_ca_system_score_gemma":0.0032270534,"threshold_uncertainty_score":0.04341805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107277825,0.0001772301,0.8868215,0.00025536033,0.000025821215,0.000055529476,0.00015333512,0.00029209128,0.0049413773],"genre_scores_gemma":[0.9688456,0.00021072113,0.026653074,0.000058155427,0.000030085877,0.00010877492,0.00022111498,0.00010825458,0.003764393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879336,0.0003122728,0.00005575155,0.00021546749,0.0004312452,0.00019192115],"domain_scores_gemma":[0.99069875,0.006598594,0.00064567535,0.0009270128,0.00091318926,0.00021682514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021978416,0.0005585329,0.00053962023,0.0012485809,0.0005296241,0.0010950534,0.0013093264,0.000565492,0.003666235],"category_scores_gemma":[0.009258303,0.0003744394,0.0007467666,0.00060119096,0.0014198018,0.0028888434,0.0011500075,0.0013692518,0.00024581555],"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.00019187773,0.00008780347,0.0015195486,0.00010711776,0.000063980144,0.00020380235,0.00021121251,0.6167516,0.006776119,0.34836462,0.0007359257,0.024986226],"study_design_scores_gemma":[0.000010758611,0.000029158104,0.00027809743,0.0000117253785,0.000015785416,0.000028687116,0.000023398583,0.88964164,0.0023181972,0.10703345,0.0006011512,0.000007950921],"about_ca_topic_score_codex":0.0022411891,"about_ca_topic_score_gemma":0.0014050538,"teacher_disagreement_score":0.003666235,"about_ca_system_score_codex":0.0013772892,"about_ca_system_score_gemma":0.0008287457,"threshold_uncertainty_score":0.012264729},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003361192,0.00016198897,0.9941553,0.00010910372,0.00006156594,0.00004457868,0.000156947,0.0007048049,0.001244468],"genre_scores_gemma":[0.26126266,0.00040167817,0.7266125,0.00023624738,0.0004854849,0.00031667406,0.0012183592,0.00048361983,0.008982723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998235,0.0004937044,0.00008668101,0.00037874357,0.0006913634,0.0001145871],"domain_scores_gemma":[0.99725217,0.0013017966,0.00018316782,0.0006743364,0.00047364092,0.0001148303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020530762,0.0009620205,0.0015122694,0.0013268902,0.0005634167,0.0015928366,0.0013343018,0.00092871214,0.0075065196],"category_scores_gemma":[0.008686897,0.0005680299,0.00078700494,0.00094054325,0.00066283165,0.0028737807,0.0027139024,0.0015542072,0.0023979284],"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.0005000251,0.0001875467,0.0026316433,0.0002678464,0.000272946,0.000186732,0.000095630756,0.18116857,0.040163707,0.13745356,0.012480011,0.62459177],"study_design_scores_gemma":[0.000023495764,0.000045230478,0.0005085964,0.000015278956,0.000028564127,0.00008215418,0.000009528311,0.9453744,0.0066488623,0.043987215,0.0032579338,0.000018663517],"about_ca_topic_score_codex":0.00093258667,"about_ca_topic_score_gemma":0.0014100402,"teacher_disagreement_score":0.0075065196,"about_ca_system_score_codex":0.0006153625,"about_ca_system_score_gemma":0.0011701895,"threshold_uncertainty_score":0.025111794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050541192,0.0019373499,0.8964686,0.005588735,0.0009323908,0.00034449162,0.001849633,0.0044200243,0.037917547],"genre_scores_gemma":[0.55168617,0.0012617175,0.42162523,0.002126041,0.0010667496,0.0006642212,0.003593586,0.0012547125,0.016721578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98949045,0.003489228,0.00056069077,0.0019335634,0.0033200274,0.0012061681],"domain_scores_gemma":[0.97017676,0.018271547,0.0013304475,0.0077217296,0.0018129252,0.0006866289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004306962,0.0021122873,0.0032029764,0.0021847829,0.0020024632,0.0062726242,0.003582867,0.003018724,0.0145237185],"category_scores_gemma":[0.034528706,0.0010628337,0.003256968,0.0034609854,0.0028119,0.009563016,0.0053309156,0.0067155366,0.0030748143],"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.0011781007,0.00038068224,0.0022346515,0.0009273858,0.00020216645,0.0003877421,0.00032497165,0.29908627,0.0035787935,0.4575689,0.045024924,0.18910553],"study_design_scores_gemma":[0.000079167934,0.0000787573,0.00017780521,0.00006129712,0.000050061994,0.0001860004,0.00008301904,0.5071805,0.0020225225,0.4843812,0.005673836,0.000025760122],"about_ca_topic_score_codex":0.0033614151,"about_ca_topic_score_gemma":0.0041695354,"teacher_disagreement_score":0.0145237185,"about_ca_system_score_codex":0.0034168246,"about_ca_system_score_gemma":0.0031306127,"threshold_uncertainty_score":0.048586667},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.254918,0.00043201365,0.7263009,0.0013807033,0.00021823701,0.0002800306,0.0014133762,0.006617618,0.008439168],"genre_scores_gemma":[0.78515625,0.00013543155,0.20814712,0.00042344266,0.00008405079,0.00012475146,0.0018766595,0.00074026623,0.0033119796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99330586,0.002070297,0.00042713215,0.0011618531,0.0017420003,0.0012929001],"domain_scores_gemma":[0.97520316,0.01817251,0.0011016042,0.0024197872,0.0026610133,0.00044184097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053825453,0.0011710994,0.0013110702,0.0020719494,0.001503069,0.004214817,0.0039452044,0.0012551334,0.0075101904],"category_scores_gemma":[0.025115022,0.0013693665,0.0039472645,0.0017565407,0.0026927092,0.006836609,0.004008772,0.0028668777,0.0006787252],"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.0031874464,0.0009106922,0.014188071,0.0012605254,0.00096714956,0.0015115865,0.0011859889,0.42797074,0.033913415,0.32657504,0.014100727,0.17422858],"study_design_scores_gemma":[0.00015294905,0.0000783427,0.0007943498,0.00010145679,0.00022421654,0.0000866658,0.00020410417,0.8030121,0.018441185,0.17514706,0.0017125227,0.00004496051],"about_ca_topic_score_codex":0.022683563,"about_ca_topic_score_gemma":0.034481123,"teacher_disagreement_score":0.022683563,"about_ca_system_score_codex":0.003353329,"about_ca_system_score_gemma":0.0053069517,"threshold_uncertainty_score":0.045103073},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043079756,0.00020866246,0.94610035,0.0010494344,0.00015039458,0.00045475064,0.0001703466,0.0018337929,0.006952567],"genre_scores_gemma":[0.64826703,0.00030610443,0.3474145,0.00028580765,0.00012156257,0.00036617005,0.00032095253,0.00047946715,0.0024382998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.93314594,0.039975297,0.002518074,0.003223319,0.01710854,0.0040288568],"domain_scores_gemma":[0.81567144,0.15472637,0.004657587,0.014073444,0.009600559,0.0012706708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.035427317,0.0012299751,0.0014324295,0.0017106232,0.0022359276,0.007853537,0.0036904325,0.0022828802,0.006052996],"category_scores_gemma":[0.10832645,0.0010141714,0.0029268905,0.0011314583,0.006740522,0.011262675,0.0046543437,0.0036294558,0.0007862126],"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.0016851238,0.00088470284,0.0033079633,0.0010064675,0.00036908983,0.00041082612,0.00079852383,0.17038086,0.01211972,0.71545917,0.0042092935,0.089368254],"study_design_scores_gemma":[0.00040714882,0.00042760163,0.00035212937,0.00014727851,0.00023535018,0.00015472533,0.00026636632,0.5959326,0.057581894,0.33901164,0.005412827,0.00007039676],"about_ca_topic_score_codex":0.0021877717,"about_ca_topic_score_gemma":0.0015753275,"teacher_disagreement_score":0.035427317,"about_ca_system_score_codex":0.004895014,"about_ca_system_score_gemma":0.007754631,"threshold_uncertainty_score":0.18735981},"labels":[],"label_agreement":null}]}