{"meta":{"query_hash":"79eed8a55750","filters":{"topic":"Formal Methods in Verification"},"cohort_total":1244,"direct_labels_cover":3,"predictions_cover":1244,"exported":1244,"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/79eed8a55750","api":"https://metacan.xera.ac/api/v1/cohort?topic=Formal+Methods+in+Verification"},"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":"W101497066","doi":"10.1007/978-3-540-73368-3_41","title":"Structural Abstraction of Software Verification Conditions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":63,"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":"Computer science; Abstraction; Software verification; Software; Programming language; Context (archaeology); Statement (logic); Verification and validation; Software framework; Theoretical computer science; Software construction; Software system; Mathematics","score_opus":0.043871529287082996,"score_gpt":0.3166956051957158,"score_spread":0.27282407590863283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101497066","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.00048216153,0.00011883178,0.99469066,0.00006373908,0.0025351117,0.00033133305,0.000011579899,0.00015265378,0.0016139185],"genre_scores_gemma":[0.104952715,0.000016304579,0.89451164,0.00019178694,0.00018482741,0.000005604853,0.000020794043,0.000019902758,0.00009641048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702543,0.00003328601,0.000684891,0.0009529379,0.00091070344,0.00039277298],"domain_scores_gemma":[0.99708015,0.00033636714,0.00064570026,0.0013782727,0.00045357912,0.00010591148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011015385,0.00033693822,0.0003550423,0.0009463028,0.00020854233,0.00015786436,0.0020413916,0.0003524063,0.000031667525],"category_scores_gemma":[0.00018555715,0.00033894295,0.00010837665,0.00063956087,0.0007391176,0.0010112572,0.00033952424,0.0006304127,0.00002868574],"study_design_candidate":"design_other","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.000009428635,0.000020365247,0.00008764757,0.00007468073,0.000011404706,0.000011028993,0.00054731185,0.02662464,0.0011489938,0.114564285,0.000011014296,0.8568892],"study_design_scores_gemma":[0.0004126859,0.00031300954,0.012534112,0.00048596898,0.000024034844,0.00017958756,6.7354904e-7,0.6239231,0.025682552,0.33398587,0.0012647599,0.0011936501],"about_ca_topic_score_codex":0.00002169166,"about_ca_topic_score_gemma":0.000020906247,"teacher_disagreement_score":0.85569555,"about_ca_system_score_codex":0.00033648082,"about_ca_system_score_gemma":0.00034522763,"threshold_uncertainty_score":0.99990624},"labels":[],"label_agreement":null},{"id":"W103353880","doi":"","title":"Automatic Enforcement of Security in Computer Networks","year":2007,"lang":"en","type":"article","venue":"New Trends in Software Methodologies, Tools and Techniques","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Process calculus; Security policy; Equivalence (formal languages); Network security policy; Enforcement; Network security; Computer security model; Process (computing); Computer security; Network Access Control; Operator (biology); Theoretical computer science; Security service; Information security; Programming language; Cloud computing security; Mathematics; Discrete mathematics; Operating system","score_opus":0.10198448663208472,"score_gpt":0.37790520556183893,"score_spread":0.2759207189297542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W103353880","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.005270186,0.00035137238,0.9928381,0.0000470931,0.0002013875,0.00019966818,0.0000023560376,0.0005706842,0.00051919295],"genre_scores_gemma":[0.04497424,0.00012428437,0.9546948,0.00011105137,0.000046032394,0.00002106031,0.0000064732885,0.000009368328,0.000012701519],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997753,0.00047731903,0.0007458752,0.00042187897,0.00021245543,0.00038945387],"domain_scores_gemma":[0.99756163,0.0014888985,0.00025360766,0.0005873268,0.000041720687,0.0000667957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061044837,0.00020525338,0.000450706,0.00056107575,0.000031590967,0.000058015677,0.0006808779,0.00024443958,0.00002130414],"category_scores_gemma":[0.00061542686,0.0001868203,0.000060814546,0.0010203153,0.00010598271,0.0004872913,0.00045014292,0.00032860023,2.1065354e-7],"study_design_candidate":"design_other","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.000013243189,0.00003033427,0.0040858765,0.000028058177,0.0000047501185,0.000007668688,0.00054485904,0.00007468374,0.0000237329,0.029363487,0.00013431949,0.965689],"study_design_scores_gemma":[0.0019857686,0.0021329406,0.29527682,0.00081336725,0.000029791896,0.00009633215,0.00015331233,0.19348408,0.082841225,0.4148594,0.0066852192,0.0016417438],"about_ca_topic_score_codex":0.00025414894,"about_ca_topic_score_gemma":0.00007415906,"teacher_disagreement_score":0.96404725,"about_ca_system_score_codex":0.00010435884,"about_ca_system_score_gemma":0.000032465217,"threshold_uncertainty_score":0.76183105},"labels":[],"label_agreement":null},{"id":"W1035674905","doi":"10.1007/978-1-4471-5260-6_3","title":"The Modelling Framework: Event-B","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Event (particle physics); Computer science; Programming language; Notation; Consistency (knowledge bases); Abstraction; Simple (philosophy); Theoretical computer science; Mathematics; Artificial intelligence; Arithmetic","score_opus":0.05564486391826194,"score_gpt":0.28687756782183876,"score_spread":0.2312327039035768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1035674905","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":[1.0644147e-7,0.00024322196,0.5551699,0.00021058906,0.00054732175,0.00012204985,2.611383e-7,0.00009720293,0.4436094],"genre_scores_gemma":[0.000036999663,0.00023098488,0.5578912,0.00014001512,0.00009286217,0.000010822402,5.5800524e-7,0.000013107185,0.44158345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987987,0.000024871537,0.0002922612,0.0003361838,0.00033129955,0.0002166373],"domain_scores_gemma":[0.9980581,0.00022840573,0.00018342788,0.0013545646,0.000116665906,0.00005883577],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004906914,0.00019131867,0.00013831264,0.000045347388,0.00022386423,0.00031583774,0.0016418342,0.00029601785,0.000188538],"category_scores_gemma":[0.000032075655,0.00012333375,0.000101220896,0.000028187964,0.00006322101,0.00028593352,0.00030360988,0.00049661077,0.0018824075],"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":[3.8085687e-7,0.0000011568425,3.0285104e-8,0.0000028974423,0.000008529738,3.322894e-7,0.000034178127,0.0006659459,3.6466096e-7,0.9165957,0.0012701195,0.081420355],"study_design_scores_gemma":[0.000007787805,0.000007794322,2.0586641e-7,0.000024773959,0.0000021454136,0.0000018276261,9.7103e-7,0.3559282,0.0000204721,0.44700626,0.19689998,0.00009957482],"about_ca_topic_score_codex":0.000006532771,"about_ca_topic_score_gemma":5.2871377e-7,"teacher_disagreement_score":0.46958947,"about_ca_system_score_codex":0.000046553712,"about_ca_system_score_gemma":0.000046547888,"threshold_uncertainty_score":0.99889475},"labels":[],"label_agreement":null},{"id":"W108436809","doi":"","title":"Lexicographically Optimum Traffic Trees with Maximum Degree Constraints.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lexicographical order; Mathematics; Degree (music); Statistics; Combinatorics","score_opus":0.02972746397389642,"score_gpt":0.26469563646203764,"score_spread":0.23496817248814122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108436809","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7374475,0.0001281808,0.23846593,0.0009723602,0.0020438207,0.00046232354,0.0000021740973,0.0008498287,0.019627875],"genre_scores_gemma":[0.7625278,0.000029730956,0.23718357,0.00013865926,0.00000839479,0.000028345668,0.000002551915,0.000016615893,0.00006432867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809504,0.00016139817,0.00030770616,0.00052250974,0.00044917766,0.00046414512],"domain_scores_gemma":[0.998455,0.00011594359,0.00014363721,0.00094116287,0.00015870831,0.00018556361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061179936,0.00023753395,0.00023919276,0.00018881871,0.00017901052,0.00016764464,0.0012525272,0.0001268093,0.000033886117],"category_scores_gemma":[0.00007853465,0.00020685834,0.00008160315,0.0011083853,0.00040422185,0.0006619864,0.00012286041,0.00027610725,0.00006722767],"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.000027895261,0.00017459654,0.0012769755,0.000005815927,0.000029535098,0.000055838744,0.00020310002,0.0001502525,0.00016584364,0.87718314,0.00017278621,0.12055424],"study_design_scores_gemma":[0.0077939834,0.0033716182,0.07938302,0.00021837417,0.00009458265,0.0013841129,0.0003534413,0.084469,0.0038917707,0.8004235,0.01607577,0.0025408044],"about_ca_topic_score_codex":0.0000066445486,"about_ca_topic_score_gemma":0.000007658326,"teacher_disagreement_score":0.118013434,"about_ca_system_score_codex":0.00004770585,"about_ca_system_score_gemma":0.00009631645,"threshold_uncertainty_score":0.8435439},"labels":[],"label_agreement":null},{"id":"W109784087","doi":"10.1007/978-3-540-74970-7_50","title":"SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":108,"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":"Solver; Leverage (statistics); Portfolio; Computer science; Class (philosophy); Set (abstract data type); Algorithm; Theoretical computer science; Machine learning; Artificial intelligence; Programming language","score_opus":0.04707438216720248,"score_gpt":0.3155200354914582,"score_spread":0.2684456533242557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109784087","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.00005328301,0.0003517749,0.9978326,0.000084245185,0.0006588779,0.0006566851,0.000010573755,0.00005875624,0.00029319618],"genre_scores_gemma":[0.0027247793,0.000036109886,0.99649817,0.0005130302,0.00013894928,0.000011288797,0.000008110941,0.000018127692,0.00005142063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693114,0.00008901036,0.0006065155,0.0011289789,0.00078450167,0.00045983845],"domain_scores_gemma":[0.9962464,0.0011699218,0.0004848117,0.0015997869,0.0003709425,0.00012814638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048129517,0.00036156437,0.0005823124,0.0013703104,0.0002443241,0.00027268435,0.002761588,0.00026673762,0.00000706478],"category_scores_gemma":[0.00015684578,0.0002673914,0.000161433,0.001462062,0.0009102796,0.0005309247,0.00053764763,0.00035241086,0.0000020027414],"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.000007070229,0.000012900616,0.000013154337,0.000012003617,0.000054310043,0.000004641297,0.0004921872,0.023323491,0.0000435738,0.019547313,0.0000028337422,0.9564865],"study_design_scores_gemma":[0.00011482105,0.00023152727,0.0006317621,0.000036881444,0.00009742341,0.000022455313,2.938281e-7,0.9380919,0.001773199,0.058269124,0.00043162925,0.00029901674],"about_ca_topic_score_codex":0.000017496051,"about_ca_topic_score_gemma":0.00001767722,"teacher_disagreement_score":0.9561875,"about_ca_system_score_codex":0.00012391353,"about_ca_system_score_gemma":0.00024924419,"threshold_uncertainty_score":0.9999778},"labels":[],"label_agreement":null},{"id":"W113712403","doi":"10.1007/978-3-319-11164-3_2","title":"Multiple Ways to Fail: Generalizing a Monitor’s Verdict for the Classification of Execution Traces","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université du Québec à Chicoutimi","funders":"","keywords":"TRACE (psycholinguistics); Equivalence (formal languages); Computer science; Event (particle physics); Completeness (order theory); Logical equivalence; Theoretical computer science; Mathematics; Discrete mathematics; Linguistics","score_opus":0.060203100558849906,"score_gpt":0.2988143434886405,"score_spread":0.23861124292979058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113712403","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.00022799252,0.00021173464,0.995638,0.0005108398,0.0021188015,0.0009850466,0.000007656715,0.000094654155,0.00020523492],"genre_scores_gemma":[0.23877698,0.000019163122,0.76043063,0.00027469703,0.00037366658,0.00006574367,0.0000037975544,0.000020505311,0.00003480469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716514,0.0000489631,0.0005980297,0.0010033475,0.00076576264,0.0004187335],"domain_scores_gemma":[0.9963619,0.0011515014,0.00047637487,0.0015121158,0.00039969466,0.00009839662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002068183,0.00033813107,0.00037591686,0.0005033085,0.00033992526,0.00027407112,0.003175123,0.00024131197,0.0000017833536],"category_scores_gemma":[0.0004053865,0.00026277706,0.00014083185,0.0005131443,0.00039938837,0.0004045334,0.00047155743,0.0003316921,0.000008740793],"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.000014657123,0.000009100514,0.000021654369,0.000047981808,0.000008761433,4.5989606e-7,0.001302,0.047177162,0.0058493256,0.12307504,0.000032255957,0.8224616],"study_design_scores_gemma":[0.00017377861,0.00018546572,0.0006126846,0.0001619424,0.0000116776,0.000006906046,8.970045e-7,0.95492375,0.016015809,0.024138372,0.003457165,0.00031152714],"about_ca_topic_score_codex":0.000029149754,"about_ca_topic_score_gemma":0.00003263198,"teacher_disagreement_score":0.9077466,"about_ca_system_score_codex":0.00024207293,"about_ca_system_score_gemma":0.00017026246,"threshold_uncertainty_score":0.9999824},"labels":[],"label_agreement":null},{"id":"W116541839","doi":"10.1007/978-3-642-39071-5_13","title":"Exploiting the Power of mip Solvers in maxsat","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":92,"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":"Maximum satisfiability problem; Solver; Boolean satisfiability problem; Computer science; Satisfiability; Range (aeronautics); Mathematical optimization; Algorithm; Mathematics; Boolean function","score_opus":0.03041052690250826,"score_gpt":0.2665463862713043,"score_spread":0.23613585936879603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116541839","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.0008010339,0.00022090065,0.99014497,0.0004737887,0.0014958691,0.0004401231,0.0000012899741,0.000058858812,0.006363158],"genre_scores_gemma":[0.17270322,0.000025511463,0.8263095,0.0006835904,0.00010212053,0.000015111361,7.907879e-7,0.000021555965,0.00013861884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682873,0.000083217965,0.0006680695,0.0009671096,0.0009080599,0.0005448365],"domain_scores_gemma":[0.99695426,0.00062402437,0.0004507588,0.0016829801,0.0002105996,0.000077375626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020095145,0.0003619892,0.00041761273,0.00067094766,0.00013401003,0.00025363723,0.004426727,0.00024517742,0.000038667768],"category_scores_gemma":[0.0002571088,0.00027225824,0.00010897009,0.0007612065,0.00088039733,0.00084858434,0.0012318433,0.0007965079,0.000046120833],"study_design_candidate":"design_other","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.0000058579394,0.000034371933,0.00017387018,0.000057499223,0.000009378719,0.000021677033,0.00638097,0.018297851,0.00069625175,0.17077054,0.000037141966,0.8035146],"study_design_scores_gemma":[0.00035243522,0.00022717472,0.0015165566,0.00081719185,0.0000062334852,0.000059814683,0.0000046249033,0.7493103,0.009798853,0.23551561,0.0015131655,0.00087804114],"about_ca_topic_score_codex":0.000058244743,"about_ca_topic_score_gemma":0.000025314666,"teacher_disagreement_score":0.80263656,"about_ca_system_score_codex":0.00023728501,"about_ca_system_score_gemma":0.0002814939,"threshold_uncertainty_score":0.99997294},"labels":[],"label_agreement":null},{"id":"W119782953","doi":"10.5591/978-1-57735-516-8/ijcai11-099","title":"A uniform approach for generating proofs and strategies for both true and false QBF formulas","year":2011,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":60,"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":"","keywords":"Correctness; Mathematical proof; Computer science; Conjunctive normal form; Falsity; True quantified Boolean formula; Simple (philosophy); Solver; Algorithm; Representation (politics); Computation; Theoretical computer science; Mathematics; Programming language","score_opus":0.266406923665083,"score_gpt":0.3559615866280027,"score_spread":0.0895546629629197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119782953","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.008031922,0.000021510004,0.98623,0.00022702865,0.00040649215,0.0008226845,0.000024643503,0.000087435976,0.004148242],"genre_scores_gemma":[0.47576168,0.000016269107,0.52373797,0.00010669328,0.00007157677,0.00024125278,0.000007869084,0.000008625979,0.000048076512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983508,0.000041443916,0.0005202749,0.00056953303,0.00023707472,0.000280886],"domain_scores_gemma":[0.99887294,0.00011579377,0.00023165374,0.00028408284,0.00039905903,0.000096478885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007351393,0.00021324714,0.00020127394,0.00017677966,0.0002004768,0.000513707,0.0005743617,0.0000942914,0.000012703755],"category_scores_gemma":[0.0002827257,0.00019569528,0.000061331506,0.000104307255,0.00015799934,0.0009459741,0.00013925589,0.00013036099,0.0000040062773],"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.00006523313,0.00006897729,0.00000916365,0.000027605716,0.000015673157,4.5991976e-7,0.0015087572,0.00015633233,0.0029332517,0.7947174,0.0000068426707,0.20049031],"study_design_scores_gemma":[0.000058103,0.00029663704,0.00006370813,0.000029077362,0.000005311598,0.00001096795,0.0007099372,0.6981547,0.034289964,0.2660585,0.00013647994,0.00018664011],"about_ca_topic_score_codex":0.000044544373,"about_ca_topic_score_gemma":0.000029097278,"teacher_disagreement_score":0.69799834,"about_ca_system_score_codex":0.000046799054,"about_ca_system_score_gemma":0.0001229337,"threshold_uncertainty_score":0.7980222},"labels":[],"label_agreement":null},{"id":"W1201887517","doi":"10.1007/978-3-319-21912-7_4","title":"A Customizable Execution Engine for Models of Embedded Systems","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Queen's University","funders":"","keywords":"Computer science; Operating system; Embedded system","score_opus":0.058477520604141305,"score_gpt":0.29561385362482534,"score_spread":0.23713633302068404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1201887517","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.000008917837,0.0008760776,0.9927938,0.000058156747,0.0026087943,0.0009324501,0.00001485994,0.00012982794,0.0025771365],"genre_scores_gemma":[0.029944735,0.000020949014,0.96925604,0.000067337474,0.00025469452,0.00004467641,0.00000801348,0.00002923299,0.00037429566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675834,0.0000615607,0.0007011352,0.0010468386,0.00093671295,0.00049540616],"domain_scores_gemma":[0.99657553,0.00036287733,0.0005380374,0.0014913691,0.0008880333,0.00014415864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032991804,0.00038755947,0.00062608323,0.0007778417,0.00010939466,0.00021605028,0.0027134058,0.0003514958,0.0000019539755],"category_scores_gemma":[0.00024219058,0.00036238274,0.00011945883,0.00054652785,0.0003695396,0.0010289118,0.00057212735,0.00035811303,0.0000066766424],"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.000011468396,0.000016666354,4.8897573e-7,0.00011089529,0.000007006191,0.0000020335303,0.00047861302,0.64354753,0.000114772985,0.22915961,0.00005095365,0.12649998],"study_design_scores_gemma":[0.00024844092,0.00015062759,6.11883e-7,0.00025480648,0.000007673364,0.000022175063,2.5303797e-7,0.80942917,0.0015933005,0.18721436,0.0007792385,0.00029936142],"about_ca_topic_score_codex":0.000021587135,"about_ca_topic_score_gemma":0.0000034173927,"teacher_disagreement_score":0.16588165,"about_ca_system_score_codex":0.0004101887,"about_ca_system_score_gemma":0.00066205795,"threshold_uncertainty_score":0.9998828},"labels":[],"label_agreement":null},{"id":"W124024561","doi":"","title":"Composite path algebras for solving path problems in graphs","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Path (computing); Mathematics; Mathematical proof; Longest path problem; Algebraic structure; Algebraic number; Mathematical optimization; Composite number; Algebra over a field; Computer science; Shortest path problem; Algorithm; Discrete mathematics; Graph; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.015062549883796862,"score_gpt":0.2523109143564071,"score_spread":0.23724836447261027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124024561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7311738,0.0003283763,0.26203096,0.00019006715,0.0030384483,0.0010345858,0.0000046558457,0.00034645776,0.0018526483],"genre_scores_gemma":[0.7720744,0.000006140743,0.22767803,0.00006244351,0.0000074270924,0.000115459814,0.000008470522,0.000014349658,0.00003327099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984918,0.00008606539,0.00038288045,0.00041078814,0.00023813281,0.0003903055],"domain_scores_gemma":[0.9990022,0.00013624737,0.00015781556,0.0005510548,0.0001002454,0.000052432526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084654876,0.00016253725,0.00020006513,0.00015846356,0.00013345649,0.00013974134,0.0007712828,0.000090513786,0.0000014779278],"category_scores_gemma":[0.000056114935,0.00016890667,0.00007365926,0.0005955521,0.00004201175,0.0005962272,0.00013935287,0.00014788238,0.000012623873],"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.0000034288835,0.00013313153,0.008757072,0.000032268726,0.000003660371,0.0000022137485,0.0002182895,0.00010332474,0.0030230554,0.98526907,0.00042116235,0.0020333324],"study_design_scores_gemma":[0.000802028,0.00011095218,0.031679012,0.00005428498,0.00000359871,0.000004400784,0.000007665374,0.04619283,0.004090256,0.9161851,0.0006396074,0.00023025584],"about_ca_topic_score_codex":0.00011508037,"about_ca_topic_score_gemma":0.000008646324,"teacher_disagreement_score":0.06908395,"about_ca_system_score_codex":0.00008717447,"about_ca_system_score_gemma":0.000041731615,"threshold_uncertainty_score":0.6887814},"labels":[],"label_agreement":null},{"id":"W129361833","doi":"","title":"Isomorph-free branch and bound search for finite state controllers","year":2013,"lang":"en","type":"article","venue":"Kent Academic Repository (University of Kent)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"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":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Toronto Rehabilitation Institute; Alzheimer's Association","keywords":"Benchmark (surveying); Computer science; Local search (optimization); Controller (irrigation); Partially observable Markov decision process; Local optimum; State (computer science); Upper and lower bounds; Markov decision process; Mathematical optimization; Mobile robot; Markov chain; Markov process; Artificial intelligence; Markov model; Algorithm; Machine learning; Robot; Mathematics","score_opus":0.020478954085407515,"score_gpt":0.2350840156346965,"score_spread":0.214605061549289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129361833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5956642,0.00027755095,0.40142852,0.0007218993,0.00031450597,0.0006671906,0.000007271176,0.00007082991,0.0008480218],"genre_scores_gemma":[0.884777,0.00028356406,0.11036603,0.00013774249,0.000057115198,0.000005303519,0.0000039833944,0.00001268435,0.004356564],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866635,0.00014815136,0.00021706554,0.00037594282,0.000308902,0.00028357658],"domain_scores_gemma":[0.99864906,0.0002556061,0.00021921922,0.0005319072,0.00019441861,0.00014981182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052069296,0.00012539659,0.00022279036,0.00012499165,0.00032531988,0.0000616598,0.00121809,0.00013917763,0.000011040044],"category_scores_gemma":[0.000059728223,0.0001467498,0.00008237489,0.00018416523,0.0002522649,0.0011296587,0.0003268452,0.00027494077,0.000014303453],"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.0013415406,0.0004995802,0.081048556,0.0015538551,0.0009937492,0.000095586445,0.051091492,0.0033395372,0.44742313,0.08738149,0.093492515,0.23173897],"study_design_scores_gemma":[0.011814909,0.0010517164,0.14731306,0.00030191196,0.00014231139,0.00014782834,0.002394047,0.7328804,0.059207764,0.024032468,0.019392602,0.0013209461],"about_ca_topic_score_codex":0.00020258193,"about_ca_topic_score_gemma":0.0000020635143,"teacher_disagreement_score":0.7295409,"about_ca_system_score_codex":0.000095601725,"about_ca_system_score_gemma":0.00008348414,"threshold_uncertainty_score":0.5984283},"labels":[],"label_agreement":null},{"id":"W129935311","doi":"10.1609/aaai.v24i1.7548","title":"Exploiting QBF Duality on a Circuit Representation","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":33,"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":"","keywords":"Unit cube; Representation (politics); Cube (algebra); Duality (order theory); Dual (grammatical number); Solver; Computer science; Unit (ring theory); Value (mathematics); Truth value; Conjunctive normal form; Algorithm; Theoretical computer science; Mathematics; Discrete mathematics; Combinatorics; Programming language; Machine learning; Law; Linguistics","score_opus":0.1997012440612117,"score_gpt":0.3678475354696475,"score_spread":0.1681462914084358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129935311","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67763853,0.0000033180193,0.2553908,0.0030705975,0.0021038146,0.00075114483,0.0000051432385,0.00028436963,0.06075228],"genre_scores_gemma":[0.9679349,0.000005764371,0.031514317,0.00021523003,0.00011487593,0.00004512757,3.681725e-7,0.000011057712,0.00015836892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978263,0.000040586452,0.0005974455,0.00057973946,0.00064678886,0.0003091534],"domain_scores_gemma":[0.997929,0.00016524707,0.00055782514,0.000600131,0.0006610538,0.00008677607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013430674,0.00019472722,0.00020741999,0.0001351711,0.00025100828,0.00029983494,0.002142686,0.000114095776,0.00006422895],"category_scores_gemma":[0.0023345484,0.00015576463,0.000108963395,0.0007366488,0.0002561076,0.00088601134,0.0002884179,0.0005780905,0.00012944963],"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.000019097479,0.00007643685,0.00014352343,0.000015053549,0.0000039005035,1.3951261e-7,0.0010246589,0.000013805398,0.15071243,0.75861007,0.000024800685,0.08935607],"study_design_scores_gemma":[0.000015117498,0.00009259407,0.00064092124,0.00006305756,0.0000036808024,0.0000037457644,0.00030041672,0.031966925,0.68345875,0.28323632,0.000078222845,0.00014021034],"about_ca_topic_score_codex":0.000039705403,"about_ca_topic_score_gemma":0.0000060077896,"teacher_disagreement_score":0.5327463,"about_ca_system_score_codex":0.000035815185,"about_ca_system_score_gemma":0.00006854283,"threshold_uncertainty_score":0.6351897},"labels":[],"label_agreement":null},{"id":"W131394547","doi":"","title":"Some succinctness properties of Ω-DTAFA","year":2006,"lang":"en","type":"article","venue":"International Conference on Software Engineering","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Lethbridge","funders":"","keywords":"Timed automaton; Succinctness; Automaton; Computer science; Finite-state machine; Theoretical computer science; ω-automaton; Deterministic automaton; Deterministic finite automaton; Expressive power; Two-way deterministic finite automaton; Nondeterministic finite automaton; DFA minimization; Determinism; Büchi automaton; Quantum finite automata; Automata theory; Algorithm","score_opus":0.03811146635833607,"score_gpt":0.2589624798440075,"score_spread":0.22085101348567143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131394547","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.10624089,0.000068675516,0.8915703,0.00012897985,0.0011072743,0.0000794899,0.0000035219775,0.00025859394,0.0005422381],"genre_scores_gemma":[0.78352296,0.0000066633024,0.2161771,0.000020109948,0.0001186015,0.000017197002,0.00000306475,0.000007664305,0.0001266515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905664,0.00001599551,0.0002489484,0.0002048477,0.00033763846,0.00013592615],"domain_scores_gemma":[0.999373,0.000029210063,0.00008879855,0.00027022054,0.00021266038,0.000026117856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001666245,0.00011438462,0.00011544142,0.00016724593,0.000023740642,0.00007008939,0.00078190624,0.000045565695,0.0000138918485],"category_scores_gemma":[0.00019798579,0.00010781917,0.000042042466,0.00012179005,0.000022850698,0.00054804515,0.000099757584,0.00010678681,0.000019876032],"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.0000064163914,0.00003725944,0.00042144663,0.00002459801,0.00001111897,0.0000022993215,0.00009122824,0.007691703,0.014739811,0.9743925,0.000028092205,0.0025535268],"study_design_scores_gemma":[0.00037888307,0.000086161475,0.013482533,0.00034245325,0.0000044643243,0.000018166163,0.000022838922,0.6631856,0.31415647,0.00650906,0.001390785,0.000422598],"about_ca_topic_score_codex":0.00003590441,"about_ca_topic_score_gemma":7.474695e-7,"teacher_disagreement_score":0.96788347,"about_ca_system_score_codex":0.00005966495,"about_ca_system_score_gemma":0.000039681592,"threshold_uncertainty_score":0.43967384},"labels":[],"label_agreement":null},{"id":"W132560685","doi":"10.14236/ewic/vecos2007.9","title":"High Level Reduction Technique for Multiway Decision Graphs Based Model Checking","year":2007,"lang":"en","type":"article","venue":"Electronic workshops in computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Model checking; Reduction (mathematics); Computer science; Benchmark (surveying); Symbolic trajectory evaluation; VHDL; Construct (python library); Theoretical computer science; Binary decision diagram; Algorithm; Partial order reduction; Programming language; Field-programmable gate array; Mathematics; Embedded system","score_opus":0.040684103858430215,"score_gpt":0.33104853166191733,"score_spread":0.29036442780348715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132560685","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.029340297,0.00011420577,0.9687421,0.00009330411,0.00055017305,0.00081595086,6.052609e-7,0.00026780547,0.000075609816],"genre_scores_gemma":[0.49454045,0.0000030213412,0.5052981,0.000041997293,0.00005954736,0.000028707796,0.0000030933197,0.00001646552,0.000008626044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971499,0.00009630076,0.00068131305,0.0007116881,0.00034231183,0.0010185159],"domain_scores_gemma":[0.9982155,0.00060847163,0.0002833153,0.00067200774,0.00015173199,0.00006895411],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0064773583,0.00024335361,0.00025802446,0.000537537,0.00028985064,0.00010181689,0.0009728465,0.00023267778,0.0000011229765],"category_scores_gemma":[0.0004066112,0.00026716222,0.000114403876,0.001417945,0.000045045763,0.00042155106,0.00016263637,0.00064023136,0.0000016536077],"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.000075875236,0.00008961175,0.000051683564,0.000020762342,0.000006816855,0.0000014067625,0.00026292837,0.35209113,0.016749166,0.16934086,0.000039966602,0.46126977],"study_design_scores_gemma":[0.0005228363,0.00006637185,0.0004702964,0.00015093834,0.0000034882341,0.000014812074,0.00001726887,0.8627788,0.08867009,0.046988904,0.000055027776,0.00026119442],"about_ca_topic_score_codex":0.000016315882,"about_ca_topic_score_gemma":0.000031497028,"teacher_disagreement_score":0.51068765,"about_ca_system_score_codex":0.00070138276,"about_ca_system_score_gemma":0.0002197212,"threshold_uncertainty_score":0.99997807},"labels":[],"label_agreement":null},{"id":"W136426073","doi":"10.1007/978-3-642-35926-2_5","title":"Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Benbria (Canada); Université du Québec en Outaouais","funders":"","keywords":"Computer science; Digraph; Disjoint sets; Correctness; Representation (politics); Tree (set theory); Theoretical computer science; Set (abstract data type); Simple (philosophy); Algorithm; Discrete mathematics; Mathematics; Combinatorics; Programming language","score_opus":0.041692570855373,"score_gpt":0.31037064546756715,"score_spread":0.2686780746121942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136426073","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.0010140494,0.00017695989,0.9929288,0.00015699078,0.0036610533,0.0011208369,0.000016406408,0.00019348068,0.0007314184],"genre_scores_gemma":[0.10959661,0.000016743912,0.88954586,0.00017206781,0.0005053684,0.000064880536,0.000029324514,0.000033042314,0.000036109468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961462,0.00008779414,0.0006747828,0.0015151793,0.0008834104,0.00069261395],"domain_scores_gemma":[0.9965821,0.00045039048,0.0005597267,0.0017941111,0.0003699622,0.00024374666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017982064,0.00048318066,0.00047237167,0.0008907237,0.00036348077,0.0004911877,0.002211155,0.00034050734,0.0000060048046],"category_scores_gemma":[0.00024466822,0.0004511355,0.00018168414,0.0006395966,0.00087816187,0.0012111187,0.00053593284,0.0004550929,0.000014143038],"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.000021895863,0.000039801565,0.0001577343,0.000043203898,0.000007887309,0.0000022730123,0.0010149734,0.026979363,0.00024089168,0.17857882,0.0000083911855,0.79290473],"study_design_scores_gemma":[0.00039239816,0.00029552478,0.0010801646,0.00013323901,0.000018360295,0.00008203325,0.0000012505045,0.8549647,0.00496617,0.13682626,0.0006311835,0.00060873985],"about_ca_topic_score_codex":0.000020578394,"about_ca_topic_score_gemma":0.00006536188,"teacher_disagreement_score":0.8279853,"about_ca_system_score_codex":0.0003515579,"about_ca_system_score_gemma":0.00024717173,"threshold_uncertainty_score":0.99979407},"labels":[],"label_agreement":null},{"id":"W13883159","doi":"10.1142/9789812389701_0016","title":"HOW MANY TESTS ARE ENOUGH?","year":2002,"lang":"en","type":"book-chapter","venue":"World Scientific Publishing Company eBooks","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 British Columbia","funders":"","keywords":"Computer science","score_opus":0.06748939186671869,"score_gpt":0.25489813828528457,"score_spread":0.18740874641856586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13883159","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016119182,0.0004898989,0.06570416,0.0025659269,0.011208067,0.0007344064,0.00006359017,0.001288668,0.9179292],"genre_scores_gemma":[0.006902271,0.000002455004,0.12388827,0.00035106365,0.0006037232,0.00003929071,0.0000481227,0.00010373688,0.86806107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9926491,0.00018626661,0.000928722,0.0025283976,0.0025369213,0.001170621],"domain_scores_gemma":[0.9919494,0.00028937665,0.0015537167,0.0047165425,0.00093770656,0.00055325817],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0032201523,0.0009149954,0.0009445336,0.0023312322,0.001264271,0.039553273,0.008068574,0.0004975409,0.00014370256],"category_scores_gemma":[0.0004980601,0.00094566384,0.00043957366,0.00052991847,0.00083740376,0.0052786698,0.0019143503,0.0020389392,0.0004627309],"study_design_candidate":"not_applicable","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.000002416281,0.000026258336,0.000009480501,0.00006540447,0.000038851045,0.000048164762,0.00042758597,0.00000661445,0.000076570584,0.807387,0.15412922,0.037782427],"study_design_scores_gemma":[0.0002275883,0.000022427756,0.00013121303,0.0004749436,0.000031804797,0.000044663506,0.000013804323,0.011118074,0.00023671346,0.045517147,0.9411874,0.0009942469],"about_ca_topic_score_codex":0.000009246111,"about_ca_topic_score_gemma":0.00014001719,"teacher_disagreement_score":0.7870582,"about_ca_system_score_codex":0.0005353147,"about_ca_system_score_gemma":0.0002582818,"threshold_uncertainty_score":0.9992994},"labels":[],"label_agreement":null},{"id":"W1409963766","doi":"10.1007/978-3-319-05416-2_8","title":"TTM/PAT: Specifying and Verifying Timed Transition Models","year":2014,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Formal Methods in Verification","field":"Computer Science","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":"York University","funders":"","keywords":"Computer science; Transition (genetics); Chemistry","score_opus":0.08261568473586745,"score_gpt":0.30593492464808036,"score_spread":0.22331923991221292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1409963766","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.000044865257,0.00029862972,0.885579,0.0005318655,0.00023198742,0.0003153988,0.0000048661354,0.000109271445,0.11288412],"genre_scores_gemma":[0.040935762,0.0031595188,0.95449847,0.0009556219,0.00004823588,0.000029340714,0.000034922243,0.000012698627,0.00032545446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980728,0.00007079619,0.0007457777,0.00037387814,0.00047969885,0.0002570341],"domain_scores_gemma":[0.9969829,0.00016189687,0.00036958273,0.0020543917,0.00030541382,0.00012586753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020951538,0.00025206245,0.00028760472,0.0009811458,0.00059774076,0.0007743425,0.0024050283,0.00017152203,0.0000034658365],"category_scores_gemma":[0.000042738673,0.00026911317,0.00003993764,0.00037822296,0.0007134216,0.009662795,0.0014337759,0.0004892106,0.00003113015],"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.0000016202093,0.000003952539,0.0000015359207,0.000032311073,0.0000022480515,1.0778067e-7,0.0022559008,0.00064891804,0.000005438367,0.70484835,0.0000294032,0.2921702],"study_design_scores_gemma":[0.00021839321,0.00004051245,0.0001874609,0.00020769006,0.000005098397,0.00003108145,0.000019752018,0.94547427,0.000021386128,0.02778654,0.025711806,0.0002960165],"about_ca_topic_score_codex":0.000008814096,"about_ca_topic_score_gemma":0.000002554182,"teacher_disagreement_score":0.94482535,"about_ca_system_score_codex":0.00014283108,"about_ca_system_score_gemma":0.00014005676,"threshold_uncertainty_score":0.9999761},"labels":[],"label_agreement":null},{"id":"W146083093","doi":"10.1007/978-3-540-69209-6_18","title":"Modeling and Validation of Aviation Security","year":2008,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Formal Methods in Verification","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":"Simon Fraser University","funders":"","keywords":"Probabilistic logic; Airport security; Computer science; Civil aviation; Aviation; Consistency (knowledge bases); Security analysis; Model checking; Automaton; Computer security; Engineering; Artificial intelligence; Theoretical computer science","score_opus":0.15817291691473398,"score_gpt":0.38176726724057963,"score_spread":0.22359435032584565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W146083093","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.00042640427,0.0032784252,0.9847603,0.00006659709,0.00042467564,0.00024072193,0.000007254362,0.000043140168,0.010752509],"genre_scores_gemma":[0.4382857,0.006436719,0.55401367,0.000054417585,0.00007983596,0.000020836194,0.000026951811,0.000021340275,0.0010604968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982271,0.0000529255,0.00070639915,0.00044389587,0.00044466453,0.00012497997],"domain_scores_gemma":[0.99846196,0.00034964393,0.00031029672,0.00026262878,0.0005871238,0.000028347158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052569393,0.00021399559,0.00034608916,0.0002998941,0.00008988412,0.000018794959,0.00038048872,0.00013256591,0.0000042750353],"category_scores_gemma":[0.00022507322,0.00023216601,0.000054397926,0.00012285454,0.00025426192,0.00035090777,0.00031737736,0.00024557917,0.000009720899],"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.000004339463,0.0000123069485,0.000015036753,0.00010306089,0.000034916622,0.0000030201695,0.0033055844,0.28251338,8.85858e-7,0.7034617,0.000031303854,0.010514474],"study_design_scores_gemma":[0.00002687296,0.000027006825,0.000011313069,0.00016463218,0.0000048448433,0.000012793533,0.0000379648,0.5589346,0.00013941943,0.44043785,0.000069316084,0.00013338466],"about_ca_topic_score_codex":0.00000928816,"about_ca_topic_score_gemma":0.0000033843241,"teacher_disagreement_score":0.4378593,"about_ca_system_score_codex":0.00013807761,"about_ca_system_score_gemma":0.00007584678,"threshold_uncertainty_score":0.9467455},"labels":[],"label_agreement":null},{"id":"W1470776573","doi":"10.1007/978-3-642-35632-2_20","title":"MapReduce for Parallel Trace Validation of LTL Properties","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Cloud computing; Process (computing); Linear temporal logic; Algorithm; Temporal logic; Event (particle physics); Parallel computing; Theoretical computer science; Programming language; Operating system","score_opus":0.05237449054811347,"score_gpt":0.2795174679480441,"score_spread":0.22714297739993064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1470776573","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.00031836863,0.0003910005,0.9951861,0.00040020933,0.0013921906,0.0011021163,0.000003798263,0.00010172234,0.0011045284],"genre_scores_gemma":[0.036010083,0.00002457554,0.9629376,0.0001587284,0.00018349964,0.00006977912,0.000003639391,0.000025648998,0.00058647216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970793,0.00004928157,0.0006531638,0.0010515215,0.0007219386,0.0004447671],"domain_scores_gemma":[0.9972777,0.00026985465,0.0005236853,0.0013054619,0.00053206057,0.00009125154],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012051229,0.00037556989,0.00046085552,0.00051809615,0.00015110223,0.00028961894,0.0029444362,0.0002844462,0.000013111236],"category_scores_gemma":[0.000253959,0.00032362185,0.00012919189,0.00035973726,0.00058857247,0.0010954804,0.0005065125,0.00034646218,0.000025633846],"study_design_candidate":"design_other","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.000016436137,0.000044632154,0.0000082052065,0.00023376009,0.000013419704,0.0000014460318,0.0015143151,0.042414043,0.004524298,0.10950739,0.000051193387,0.8416709],"study_design_scores_gemma":[0.00024228088,0.00026461922,0.000060070288,0.00035957296,0.000009573624,0.000018609273,2.9354956e-7,0.741998,0.10868876,0.1465869,0.0012628912,0.00050842774],"about_ca_topic_score_codex":0.000015602873,"about_ca_topic_score_gemma":0.0000023885639,"teacher_disagreement_score":0.84116244,"about_ca_system_score_codex":0.00017218091,"about_ca_system_score_gemma":0.00037845818,"threshold_uncertainty_score":0.99992156},"labels":[],"label_agreement":null},{"id":"W1480305897","doi":"10.1007/3-540-45719-4_13","title":"Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations*","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Causality (physics); Axiom; Commutative property; Computer science; Set (abstract data type); Relation (database); Event (particle physics); Theoretical computer science; Algebra over a field; Discrete mathematics; Mathematics; Pure mathematics; Data mining; Programming language; Physics; Quantum mechanics","score_opus":0.05062367435628427,"score_gpt":0.2947156633790935,"score_spread":0.2440919890228092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480305897","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.00030832607,0.0009224248,0.9948042,0.00038440718,0.0010869774,0.0003849684,0.000022643704,0.00015313811,0.0019328839],"genre_scores_gemma":[0.11706864,0.00010877985,0.8821376,0.00022096331,0.000089161396,0.000011540604,0.0000130137505,0.000027250691,0.000323044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966732,0.00012854702,0.00056177104,0.0013025292,0.0008398585,0.0004940431],"domain_scores_gemma":[0.99750876,0.00050962594,0.00038259805,0.0012055325,0.00020609368,0.00018740448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015519296,0.00045284885,0.00045147992,0.0003946637,0.00039837707,0.0004704265,0.0018159248,0.00032474846,0.000016059159],"category_scores_gemma":[0.000085682965,0.0004551885,0.00007318006,0.00041807338,0.0010152989,0.0009748263,0.0009180162,0.0010721964,0.000018707093],"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.0000026223568,0.00007293854,0.00034248378,0.000037901984,0.000011139983,0.000012076351,0.0014469334,0.13346574,0.000036123514,0.14320761,0.00011446309,0.72125],"study_design_scores_gemma":[0.00014705445,0.00007945215,0.00010080312,0.0001422111,0.000009849815,0.0000341066,1.3176437e-7,0.9446638,0.0003133769,0.05313411,0.00090313324,0.00047193177],"about_ca_topic_score_codex":0.00007697092,"about_ca_topic_score_gemma":0.0000137178595,"teacher_disagreement_score":0.8111981,"about_ca_system_score_codex":0.00034568232,"about_ca_system_score_gemma":0.00015053707,"threshold_uncertainty_score":0.99979},"labels":[],"label_agreement":null},{"id":"W1480815731","doi":"10.1007/978-3-540-30494-4_8","title":"Combining Equivalence Verification and Completion Functions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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; Modular design; Sobel operator; Formal equivalence checking; Computer engineering; Equivalence (formal languages); Functional verification; Implementation; Formal verification; Algorithm; Programming language; Theoretical computer science; Artificial intelligence; Edge detection","score_opus":0.03864510337095927,"score_gpt":0.28010561299832787,"score_spread":0.2414605096273686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480815731","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.00019876599,0.00031183954,0.9925509,0.00043534252,0.0017601694,0.00038861838,0.0000039364777,0.00023220679,0.004118187],"genre_scores_gemma":[0.16439605,0.00008160302,0.83468807,0.0004298048,0.00018338163,0.000016541659,0.000011180472,0.000025616002,0.00016777286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967036,0.000054975546,0.0005285099,0.0014156622,0.00081991445,0.00047731661],"domain_scores_gemma":[0.99760556,0.0002479499,0.00036351275,0.0013637219,0.00026688326,0.00015237738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013270901,0.00040766504,0.00038142884,0.00061028585,0.0007604157,0.0009664571,0.0018121437,0.00027960644,0.000013688024],"category_scores_gemma":[0.00016414342,0.00042261527,0.00006740826,0.0006248414,0.0009169339,0.0010763115,0.0008009828,0.00070633425,0.00005510582],"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.000005928512,0.000027690254,0.00005047861,0.00006116035,0.0000066900216,0.000009801355,0.0006466402,0.015387876,0.00089972606,0.4132496,0.000005948663,0.56964844],"study_design_scores_gemma":[0.00042988377,0.0003041335,0.0018133813,0.0006672796,0.00001454036,0.0001321754,5.7540103e-7,0.6137981,0.0019941719,0.37882963,0.0011479064,0.0008682465],"about_ca_topic_score_codex":0.000031845648,"about_ca_topic_score_gemma":0.000014638858,"teacher_disagreement_score":0.5984102,"about_ca_system_score_codex":0.00048914616,"about_ca_system_score_gemma":0.000408123,"threshold_uncertainty_score":0.99982256},"labels":[],"label_agreement":null},{"id":"W1481163164","doi":"10.1109/ceit.2015.7233175","title":"A combination of reliability calculus and importance measures for probability risk analysis","year":2015,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Reliability (semiconductor); Computer science; Reliability engineering; Risk analysis (engineering); Plan (archaeology); Risk management; Estimation; Action (physics); Engineering; Power (physics)","score_opus":0.05798868007358102,"score_gpt":0.3153347721008508,"score_spread":0.25734609202726977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481163164","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.2625511,0.00003104172,0.73665017,0.00009751618,0.00004345726,0.00027788206,0.0000034343104,0.000040461407,0.00030495474],"genre_scores_gemma":[0.52687716,0.0000020481436,0.47307393,0.0000074345035,0.0000023794678,0.000023577226,0.000001095809,0.0000010740372,0.000011294073],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890405,0.00018806492,0.0002952997,0.00029251864,0.00022328754,0.0000967991],"domain_scores_gemma":[0.998454,0.00012189793,0.00020319111,0.0006011448,0.0005518886,0.000067877445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040820553,0.000063365,0.00017475321,0.00007184905,0.00004271408,0.000024900064,0.0002530819,0.000043400316,0.0000010264101],"category_scores_gemma":[0.0023792225,0.00005188057,0.00006197532,0.00060962513,0.00008585566,0.00035145474,0.00006468777,0.000042312415,3.5664394e-7],"study_design_candidate":"observational","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.00006225492,0.00027992175,0.5223302,0.00007521946,0.000105910614,8.597445e-8,0.0013094463,0.0013231009,0.00014593896,0.42801,0.0001423543,0.04621551],"study_design_scores_gemma":[0.000338192,0.00014925281,0.19661094,0.0000015017955,0.000076511824,4.0822505e-7,0.000028121169,0.6691564,0.0039002593,0.1295169,0.00013480251,0.00008676968],"about_ca_topic_score_codex":0.0001595993,"about_ca_topic_score_gemma":0.00007073175,"teacher_disagreement_score":0.66783327,"about_ca_system_score_codex":0.000058710433,"about_ca_system_score_gemma":0.000053159485,"threshold_uncertainty_score":0.28483236},"labels":[],"label_agreement":null},{"id":"W1483036827","doi":"","title":"From multicore simulation to hardware synthesis using transactions","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"SystemC; Computer science; Concurrency; Interfacing; High-level synthesis; Abstraction; Embedded system; Computer architecture; Distributed computing; Computer hardware; Field-programmable gate array","score_opus":0.07248711281026336,"score_gpt":0.3306964727284196,"score_spread":0.25820935991815624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483036827","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.07123283,0.0000025671577,0.9275928,0.00024057414,0.00023924894,0.00021037654,0.0000025569043,0.00017376871,0.00030525366],"genre_scores_gemma":[0.46172473,1.6031012e-7,0.53808224,0.00009264588,0.000021383323,0.000020168955,3.0028596e-7,0.000003613058,0.00005474202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992814,0.00005950449,0.00015357617,0.00023071989,0.00014409756,0.00013071888],"domain_scores_gemma":[0.9992109,0.00015477362,0.000033610093,0.00042452262,0.00009488398,0.00008133701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096363874,0.00007474449,0.00007852913,0.00007673043,0.00009988124,0.00013945949,0.00033650335,0.000044547232,0.00042827905],"category_scores_gemma":[0.000120197954,0.000068902045,0.00003455653,0.0002452847,0.000009793591,0.0009453423,0.000022282555,0.000047839156,0.0003964764],"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.000002606637,0.00004575424,0.00007498806,0.000005015372,0.000013945201,3.9843437e-7,0.0016505304,0.37196073,0.020845467,0.001209978,0.00005209349,0.6041385],"study_design_scores_gemma":[0.000032614127,0.000006590741,0.0036130266,0.000009260302,0.000004702737,4.191121e-7,0.00006357852,0.9695286,0.025889372,0.00052852265,0.00022885654,0.000094413816],"about_ca_topic_score_codex":0.0012060689,"about_ca_topic_score_gemma":0.0000061318924,"teacher_disagreement_score":0.6040441,"about_ca_system_score_codex":0.000053404627,"about_ca_system_score_gemma":0.000014413352,"threshold_uncertainty_score":0.50960344},"labels":[],"label_agreement":null},{"id":"W1483694396","doi":"10.1109/ictta.2006.1684961","title":"Two architectures for testing distributed real-time systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Automaton; Common Object Request Broker Architecture; Formal specification; Factor (programming language); Distributed computing; Conformance testing; Timed automaton; Java; Process (computing); Software architecture; Real-time operating system; Real-time computing; Embedded system; Software; Software engineering; Programming language; Operating system; Theoretical computer science","score_opus":0.030910311685906848,"score_gpt":0.2954200830107124,"score_spread":0.2645097713248055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483694396","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.014396161,0.00001528136,0.9718071,0.0000676136,0.00019342723,0.00029619713,0.0000111104,0.00047521698,0.0127378935],"genre_scores_gemma":[0.15878291,8.902929e-8,0.840542,0.000013589386,0.00012516144,0.00005035168,0.000010957045,0.0000060950974,0.0004687997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913156,0.00006371908,0.0002163053,0.00023541145,0.00013343162,0.00021957462],"domain_scores_gemma":[0.99904567,0.00034075277,0.00009164137,0.00038425252,0.00010431852,0.00003336746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004779259,0.00008724463,0.00010538097,0.000049313152,0.0001072394,0.00013718543,0.00045786262,0.000028819477,0.0000017081551],"category_scores_gemma":[0.00022481124,0.00007219376,0.0000307549,0.00029095818,0.000022378917,0.00007299528,0.000066158005,0.000041816136,0.00001975769],"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.000008872919,0.000055833825,0.000902326,0.00006384537,0.000009093901,0.0000021324806,0.0000479139,0.043687016,0.039575886,0.89157146,0.0028851423,0.021190448],"study_design_scores_gemma":[0.00017886276,0.000047073325,0.0036301096,0.000013025628,0.0000028787365,0.000017437376,0.0000035228952,0.9787398,0.0066468325,0.009825261,0.00076901756,0.00012618156],"about_ca_topic_score_codex":0.0005563926,"about_ca_topic_score_gemma":0.0000036547497,"teacher_disagreement_score":0.93505275,"about_ca_system_score_codex":0.000035335677,"about_ca_system_score_gemma":0.000024843119,"threshold_uncertainty_score":0.2943976},"labels":[],"label_agreement":null},{"id":"W1484641899","doi":"10.1007/11766247_32","title":"Trace Equivalence Characterization Through Reinforcement Learning","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Markov decision process; Reinforcement learning; Computer science; TRACE (psycholinguistics); Equivalence (formal languages); Divergence (linguistics); Probabilistic logic; Markov process; Markov chain; Context (archaeology); Artificial intelligence; Machine learning; Theoretical computer science; Mathematics; Discrete mathematics; Statistics","score_opus":0.029688212892966487,"score_gpt":0.2788552782419944,"score_spread":0.2491670653490279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484641899","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.00007622217,0.00015518208,0.98738873,0.00026814974,0.0018107377,0.00047449287,0.0000017285886,0.00030503742,0.009519719],"genre_scores_gemma":[0.055496275,0.000110909925,0.9407348,0.00062677584,0.0005192076,0.000021655052,0.000033586137,0.000046720237,0.002410073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955871,0.000078472214,0.0007791297,0.0015329183,0.001299663,0.0007227092],"domain_scores_gemma":[0.9973385,0.00020979407,0.0006605192,0.0014027278,0.00028817542,0.00010029033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013225428,0.00055133173,0.00046813153,0.0005267128,0.00039128566,0.00060985785,0.0031778465,0.00035821617,0.00002767876],"category_scores_gemma":[0.0001524158,0.0005509667,0.00012009486,0.0007679564,0.0005386839,0.0020167383,0.0010391045,0.001022891,0.000077089666],"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.000006906886,0.000023481487,0.00003864363,0.000076185905,0.000007085504,0.00002796322,0.0010327807,0.30433562,0.0027494913,0.097552024,0.000011453163,0.5941384],"study_design_scores_gemma":[0.00019284373,0.00021524259,0.0003230903,0.00038630486,0.0000076251786,0.00004500751,1.2452541e-7,0.94829255,0.007811198,0.03331724,0.0086400015,0.00076879753],"about_ca_topic_score_codex":0.000023010753,"about_ca_topic_score_gemma":0.0000043200207,"teacher_disagreement_score":0.6439569,"about_ca_system_score_codex":0.0004989593,"about_ca_system_score_gemma":0.00034674484,"threshold_uncertainty_score":0.99969417},"labels":[],"label_agreement":null},{"id":"W1486309898","doi":"10.1007/3-540-47884-1_12","title":"Formally Linking MDG and HOL Based on a Verified MDG System","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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; Computer science; Programming language; Automated theorem proving; Formal verification; Theoretical computer science; Semantics (computer science); Algorithm","score_opus":0.02742242845472755,"score_gpt":0.2499317911700515,"score_spread":0.22250936271532393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486309898","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.000082422295,0.00017851377,0.98655874,0.00020896106,0.0019379959,0.0005538618,0.0000043473556,0.00033704535,0.010138141],"genre_scores_gemma":[0.116347075,0.000019420137,0.8818876,0.001245677,0.0003127205,0.000019151006,0.0000033472022,0.00003963,0.0001253768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562174,0.000091126036,0.0006441389,0.0016692909,0.0012567088,0.0007170171],"domain_scores_gemma":[0.9967503,0.0005017619,0.00043600742,0.0018855359,0.00021706741,0.0002093447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017685272,0.00061254174,0.00057446293,0.0010440507,0.00039884675,0.0008128187,0.0030055074,0.0004600582,0.0000075022895],"category_scores_gemma":[0.00012360756,0.00056632,0.000118419375,0.0006410715,0.00052686105,0.00079249975,0.00080181257,0.0010002134,0.00004786874],"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.00001999389,0.000035127647,0.00003670318,0.0003000305,0.000009863497,0.000103308696,0.00080437865,0.040186927,0.00012749895,0.14276218,0.000010781028,0.8156032],"study_design_scores_gemma":[0.00033187278,0.00031719953,0.00014344853,0.0011783796,0.0000079833135,0.00008071348,2.0293047e-7,0.9885694,0.0011423228,0.006664136,0.00094286626,0.0006215006],"about_ca_topic_score_codex":0.000007828168,"about_ca_topic_score_gemma":0.0000046250525,"teacher_disagreement_score":0.94838244,"about_ca_system_score_codex":0.00047138816,"about_ca_system_score_gemma":0.00026304455,"threshold_uncertainty_score":0.99967885},"labels":[],"label_agreement":null},{"id":"W1487460562","doi":"10.1007/978-3-642-15396-9_10","title":"Checking-Up on Branch-and-Check","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":45,"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":"Benders' decomposition; Computer science; Key (lock); Extension (predicate logic); Decomposition; Variation (astronomy); Generalization; Mathematical optimization; Algorithm; Mathematics; Programming language","score_opus":0.027137863253000407,"score_gpt":0.2808368903337209,"score_spread":0.2536990270807205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487460562","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.00019936451,0.00015373374,0.98461103,0.0007346499,0.004800555,0.00033794204,0.0000024104506,0.00020583457,0.008954472],"genre_scores_gemma":[0.06355159,0.00005381344,0.9332601,0.001955993,0.0005447671,0.000011099875,0.0000021869305,0.00003899642,0.000581468],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962291,0.000043959386,0.0004792357,0.0016531311,0.0009923292,0.0006022452],"domain_scores_gemma":[0.99698704,0.00038783558,0.00031724456,0.0019233443,0.00018733322,0.00019718081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015652205,0.0005282874,0.0004680601,0.0007507626,0.00030642463,0.00057102065,0.0032939496,0.0005505402,0.00001912247],"category_scores_gemma":[0.00028622305,0.00048079927,0.0001009782,0.00047087125,0.0009898307,0.0006340425,0.0011417995,0.0016364371,0.000089975925],"study_design_candidate":"design_other","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.0000055683413,0.000013444866,0.000014579428,0.00002632392,0.0000043467785,0.000011414244,0.0005894689,0.00066856644,0.00084779446,0.16144471,0.0000051697107,0.8363686],"study_design_scores_gemma":[0.0005754517,0.00051083515,0.000955079,0.0006495688,0.00001339592,0.00021497063,1.4899877e-7,0.3965845,0.045021374,0.5367257,0.017030243,0.0017187094],"about_ca_topic_score_codex":0.000010674574,"about_ca_topic_score_gemma":0.000019215864,"teacher_disagreement_score":0.8346499,"about_ca_system_score_codex":0.00017005131,"about_ca_system_score_gemma":0.0003022019,"threshold_uncertainty_score":0.9997644},"labels":[],"label_agreement":null},{"id":"W1487846941","doi":"10.1007/11560548_37","title":"FPGA Based Accelerator for 3-SAT Conflict Analysis in SAT Solvers","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Victoria","funders":"","keywords":"Computer science; Field-programmable gate array; Equivalence (formal languages); Binary decision diagram; Binary number; Programming language; Parallel computing; Theoretical computer science; Arithmetic; Embedded system; Discrete mathematics; Mathematics","score_opus":0.044088136335701904,"score_gpt":0.3049015647059294,"score_spread":0.2608134283702275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487846941","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.00019267492,0.0002152302,0.9960372,0.0006121316,0.0011666034,0.0007882222,0.000017960652,0.00014917321,0.00082084053],"genre_scores_gemma":[0.061547905,0.00001726022,0.93570155,0.002161354,0.00031434276,0.000045396966,0.000026561725,0.000033421293,0.00015223144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99526834,0.00007948176,0.00084229105,0.0019549278,0.0009979112,0.0008570579],"domain_scores_gemma":[0.9962326,0.0008252151,0.00046305486,0.0019528192,0.00032752843,0.00019874812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022349586,0.00061247766,0.0008549228,0.0026590652,0.00022151702,0.0004779306,0.004214172,0.00047360762,0.00003524843],"category_scores_gemma":[0.00023237866,0.0005987665,0.00035454007,0.002279482,0.0005469929,0.00094489043,0.0006037033,0.0007186453,0.000031241223],"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.000037274254,0.00007943947,0.0005420741,0.000080812664,0.00007800834,0.000027294582,0.0011282684,0.33138067,0.00032494203,0.02166606,0.0000332316,0.6446219],"study_design_scores_gemma":[0.00048186778,0.00013548748,0.0008311417,0.00011340522,0.000045966797,0.0000049498717,1.8584512e-7,0.9806693,0.0037795857,0.008944911,0.004284115,0.0007090591],"about_ca_topic_score_codex":0.000027425549,"about_ca_topic_score_gemma":0.0002507826,"teacher_disagreement_score":0.64928865,"about_ca_system_score_codex":0.00074545,"about_ca_system_score_gemma":0.00070203707,"threshold_uncertainty_score":0.99964637},"labels":[],"label_agreement":null},{"id":"W1488842140","doi":"10.3233/sat190055","title":"QBF-Based Formal Verification: Experience and Perspectives","year":2008,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":75,"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":"Strong","keywords":"Formal methods; Formal verification; Computer science; Programming language","score_opus":0.08181267425518404,"score_gpt":0.3148733832200596,"score_spread":0.23306070896487555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488842140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45153457,0.00008968512,0.54781413,0.00026663922,0.00008484986,0.0000904674,4.4205674e-7,0.00004955151,0.00006967276],"genre_scores_gemma":[0.69487196,0.00006282615,0.30488446,0.00011247934,0.000047827005,0.00001006398,8.253608e-7,0.000005398438,0.0000041293356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984233,0.00021441016,0.0003973008,0.00038912438,0.00037125018,0.00020464168],"domain_scores_gemma":[0.9990609,0.000104702085,0.00017787266,0.00025917802,0.0002535041,0.00014383333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008877631,0.00015086195,0.00016677065,0.00014033252,0.00071759935,0.00019449112,0.00020545932,0.00006314079,0.000002297846],"category_scores_gemma":[0.00017358588,0.00014082479,0.000046219517,0.00018032794,0.00014061276,0.0011705041,0.000049588823,0.00027500954,0.0000027685426],"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.00015343532,0.00023315648,0.0049236096,0.000048497786,0.00001993852,0.000013084871,0.024994573,0.5683134,0.0003528818,0.05531229,0.000028472545,0.34560665],"study_design_scores_gemma":[0.00037442462,0.00021408795,0.017432125,0.000024982062,0.0000036282484,0.0001670556,0.0004571716,0.9750964,0.00013181924,0.005910355,0.000031500767,0.00015643012],"about_ca_topic_score_codex":0.000008896621,"about_ca_topic_score_gemma":4.028245e-7,"teacher_disagreement_score":0.406783,"about_ca_system_score_codex":0.00009449816,"about_ca_system_score_gemma":0.00008903855,"threshold_uncertainty_score":0.5742668},"labels":[],"label_agreement":null},{"id":"W1489227721","doi":"10.1109/ccc.2000.856741","title":"An application of matroid theory to the SAT problem","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"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":"","keywords":"Matroid; Combinatorics; Decidability; Mathematics; Conjunctive normal form; Discrete mathematics; Constant (computer programming); Matching (statistics); Resolution (logic); Time complexity; Computer science","score_opus":0.02140411412129907,"score_gpt":0.2820081663074063,"score_spread":0.26060405218610727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489227721","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.0022825836,0.000019069757,0.98629767,0.000773697,0.00004218152,0.00026671943,4.004076e-7,0.000085117485,0.010232541],"genre_scores_gemma":[0.34427053,0.0000014900215,0.6552042,0.0002670725,0.00001663697,0.000036978785,2.990122e-7,0.000002380057,0.0002004156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938047,0.00011586171,0.00013073132,0.00015291062,0.0001320883,0.000087957684],"domain_scores_gemma":[0.9990323,0.00003692727,0.000052112064,0.00079949305,0.000046473495,0.00003268734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073871866,0.000044343586,0.00004677587,0.000033622775,0.00004781715,0.00003115403,0.0008704184,0.000020025605,0.000027117432],"category_scores_gemma":[0.000019309693,0.000028180428,0.000016186495,0.00028152968,0.00002119386,0.00025760746,0.0000635765,0.00003693024,0.00021043989],"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.0000011230273,0.000023377195,0.000052345866,0.0000028324425,0.0000010539032,1.6627293e-8,0.00056192407,0.00017623749,0.0044291844,0.723497,0.000225263,0.27102968],"study_design_scores_gemma":[0.00011936587,0.00025013677,0.006534018,0.000006085728,0.0000050153735,0.000009350639,0.00013482657,0.8505267,0.048626,0.06588067,0.027718153,0.00018971787],"about_ca_topic_score_codex":0.0000068013214,"about_ca_topic_score_gemma":0.0000025811605,"teacher_disagreement_score":0.85035044,"about_ca_system_score_codex":0.000012035837,"about_ca_system_score_gemma":0.000003382184,"threshold_uncertainty_score":0.27048492},"labels":[],"label_agreement":null},{"id":"W1490038383","doi":"10.48550/arxiv.1301.0606","title":"Anytime State-Based Solution Methods for Decision Processes with non-Markovian Rewards","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Markov decision process; Computer science; Representation (politics); Embedding; Markov process; Exploit; State space; Partially observable Markov decision process; Mathematical optimization; Computation; State (computer science); Theoretical computer science; Translation (biology); Artificial intelligence; Algorithm; Mathematics","score_opus":0.07334018311488119,"score_gpt":0.2621029346985852,"score_spread":0.188762751583704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490038383","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.035632167,0.000035942627,0.9630915,0.000028269515,0.00023452805,0.00037093612,0.0000037788475,0.00016014677,0.00044271364],"genre_scores_gemma":[0.47038326,0.0000063421185,0.5294296,0.00004246699,0.00001980367,0.000002706035,0.0000021436842,0.000008856954,0.000104807026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986599,0.0001647308,0.00017629802,0.00047240334,0.00008945306,0.0004372087],"domain_scores_gemma":[0.99802774,0.00061720517,0.0001905263,0.0006571563,0.0003236171,0.0001837799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013921848,0.00017560557,0.00017650657,0.00020658929,0.00023495869,0.000060338185,0.00074234064,0.000085117885,0.000007633269],"category_scores_gemma":[0.0005166144,0.00016528927,0.000060806316,0.0012040561,0.00008737517,0.0016722868,0.000113066984,0.00010582151,0.000021085381],"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.0039861016,0.0021400594,0.06936919,0.0016074732,0.00027357988,0.00004744107,0.004002841,0.15818046,0.010763863,0.22022134,0.0015656967,0.5278419],"study_design_scores_gemma":[0.0010126377,0.00041925863,0.0042724167,0.000089597335,0.000050975057,0.000006103791,0.000057509373,0.9592529,0.026216099,0.0051645655,0.0029945213,0.00046339654],"about_ca_topic_score_codex":0.000018749288,"about_ca_topic_score_gemma":0.000010922547,"teacher_disagreement_score":0.8010725,"about_ca_system_score_codex":0.00017019027,"about_ca_system_score_gemma":0.00022791128,"threshold_uncertainty_score":0.6740301},"labels":[],"label_agreement":null},{"id":"W14909433","doi":"","title":"Reasoning About Compositions of Concerns","year":2001,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"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":"","keywords":"Composition (language); Computer science; Set (abstract data type); Automated reasoning; Programming language; Theoretical computer science; Artificial intelligence; Epistemology; Philosophy; Linguistics","score_opus":0.04172386871488607,"score_gpt":0.33700642906098915,"score_spread":0.29528256034610306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14909433","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.013671053,0.000028970115,0.90045214,0.00012721158,0.000115124276,0.00004194185,4.6379606e-7,0.000086340646,0.08547674],"genre_scores_gemma":[0.38031,0.000010241784,0.61932856,0.0000679409,0.00001399945,0.0000026041491,5.4790183e-7,0.000001402968,0.00026470225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954426,0.00003797901,0.00012617712,0.00010290922,0.000101293415,0.00008740097],"domain_scores_gemma":[0.9995132,0.000033565262,0.00005509925,0.00030845546,0.00006074854,0.00002893568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017956053,0.000036845508,0.000060652,0.000036039288,0.000046526722,0.000021892532,0.00035157026,0.000020183068,0.00004557787],"category_scores_gemma":[0.00003040265,0.000034068496,0.000022799095,0.00023086157,0.00003563162,0.00027506845,0.000060476985,0.000038246035,0.000026512822],"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.0000012972683,0.000017971122,0.0010461877,0.0000021958501,0.000002870383,8.783831e-7,0.00019529425,0.00008165002,0.00272263,0.9814934,0.00020253754,0.014233048],"study_design_scores_gemma":[0.00053183077,0.00019513129,0.079450965,0.00009220006,0.000010196126,0.00011045786,0.00013130275,0.77853084,0.10250244,0.012873352,0.025217986,0.00035332917],"about_ca_topic_score_codex":0.00003652943,"about_ca_topic_score_gemma":0.0000022051645,"teacher_disagreement_score":0.96862006,"about_ca_system_score_codex":0.000013980081,"about_ca_system_score_gemma":0.000016057165,"threshold_uncertainty_score":0.1389273},"labels":[],"label_agreement":null},{"id":"W1491774527","doi":"10.1007/978-3-540-70545-1_29","title":"CSIsat: Interpolation for LA+EUF","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Programming language; Satisfiability modulo theories; Software; Solver; Interpolation (computer graphics); Quantifier (linguistics); Quantifier elimination; Theoretical computer science; Arithmetic; Algorithm; Mathematics; Computer graphics (images); Artificial intelligence","score_opus":0.03414785980137259,"score_gpt":0.2935137204647448,"score_spread":0.2593658606633722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491774527","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.000015850232,0.00024403475,0.9900646,0.0003104835,0.002189706,0.0005734449,0.0000054799107,0.00019573905,0.0064006615],"genre_scores_gemma":[0.012254354,0.00006390072,0.9862687,0.00064218766,0.00039804998,0.000028672117,0.0000065045856,0.000032264332,0.00030538882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691206,0.00005637028,0.000542134,0.0012835119,0.0007001813,0.0005057571],"domain_scores_gemma":[0.99712247,0.0007534555,0.00035598897,0.0013554518,0.00029256768,0.00012008688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013753372,0.00041975433,0.00040926112,0.0007814358,0.00027348005,0.00036512874,0.003036172,0.00038520803,0.000008303948],"category_scores_gemma":[0.00030878556,0.0004053532,0.00015826285,0.0004632004,0.0006518997,0.00091313187,0.00073277665,0.00056611915,0.000031973414],"study_design_candidate":"design_other","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.000009579374,0.000020195543,0.00001559804,0.00004015558,0.000007770276,0.000011075672,0.0011667663,0.0039112717,0.00018161768,0.09531643,0.00010561811,0.8992139],"study_design_scores_gemma":[0.00022941155,0.00016914848,0.00012735659,0.00020397779,0.0000054560905,0.000108616056,9.454464e-8,0.87295616,0.0019485716,0.10773594,0.015977766,0.0005374832],"about_ca_topic_score_codex":0.000007173167,"about_ca_topic_score_gemma":0.000009929507,"teacher_disagreement_score":0.89867646,"about_ca_system_score_codex":0.00026953133,"about_ca_system_score_gemma":0.00043064932,"threshold_uncertainty_score":0.99983984},"labels":[],"label_agreement":null},{"id":"W14931976","doi":"","title":"Partial-order verification in SPIN can be more efficient","year":2002,"lang":"en","type":"article","venue":"Zahnarztliche Welt","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Ottawa","funders":"","keywords":"Partial order reduction; Model checking; Computer science; Reduction (mathematics); Concurrency; Set (abstract data type); Programming language; Formal verification; Linear temporal logic; Temporal logic; High-level verification; Algorithm; Theoretical computer science; Mathematics; Software","score_opus":0.04558110259136665,"score_gpt":0.30317534127052015,"score_spread":0.2575942386791535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14931976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46482503,0.0003820551,0.50804675,0.017489795,0.0011597553,0.0008509126,0.000007497654,0.000675869,0.006562342],"genre_scores_gemma":[0.8210975,0.000028536666,0.17723735,0.0010635374,0.00007145097,0.00009807137,0.0000063666157,0.000019512823,0.000377706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980993,0.00017235402,0.0003929296,0.0005318265,0.00039016645,0.0004133823],"domain_scores_gemma":[0.9985185,0.000048263013,0.00014068281,0.0010932402,0.00008909224,0.00011021089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063340046,0.00018144153,0.00017720214,0.00019557573,0.00010666354,0.00010309733,0.0008884546,0.000121798235,0.00008550598],"category_scores_gemma":[0.00026676248,0.00018428259,0.00004919784,0.0011868675,0.00008040979,0.00023673479,0.00013748049,0.00022368925,0.00019081852],"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.00007027237,0.0024769127,0.007899798,0.00019390638,0.00006500463,0.00008985132,0.058088336,0.058175523,0.03654915,0.55424994,0.015065617,0.26707572],"study_design_scores_gemma":[0.00041942377,0.00006180466,0.015385006,0.000021418135,0.000004615452,0.000012340053,0.00013091163,0.94741803,0.016769115,0.00013111309,0.019345844,0.0003003834],"about_ca_topic_score_codex":0.00014933788,"about_ca_topic_score_gemma":0.000021117192,"teacher_disagreement_score":0.88924253,"about_ca_system_score_codex":0.00015353913,"about_ca_system_score_gemma":0.000032048294,"threshold_uncertainty_score":0.7514826},"labels":[],"label_agreement":null},{"id":"W1495279197","doi":"10.1007/978-3-540-39893-6_32","title":"Compositional Verification of a Switch Fabric from Nortel Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; Model checking; Formal verification; Functional verification; Reduction (mathematics); Verilog; State (computer science); Intelligent verification; Programming language; Finite-state machine; Runtime verification; High-level verification; Embedded system; Theoretical computer science; Field-programmable gate array; Software development; Software","score_opus":0.019911845125787867,"score_gpt":0.2546541314687369,"score_spread":0.23474228634294902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495279197","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.00017630278,0.0004995681,0.99513197,0.00019209221,0.0020133427,0.00035729868,0.000012607377,0.0000906175,0.0015261784],"genre_scores_gemma":[0.09433044,0.000052841075,0.90451854,0.00073982036,0.00025264,0.000011654445,0.000031812753,0.000025784604,0.000036457066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963323,0.00009282709,0.0007709495,0.0013194511,0.0010360802,0.00044838767],"domain_scores_gemma":[0.99669677,0.00045041717,0.00063461676,0.0016930442,0.00039548014,0.00012969167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010268878,0.0004315368,0.00052440405,0.0005843608,0.00017879327,0.00021744148,0.0029161016,0.00038528373,0.000026611426],"category_scores_gemma":[0.000086991626,0.00043799594,0.00013541256,0.00080658734,0.00062442024,0.00063590216,0.0004989714,0.0007020676,0.000021504837],"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.000019161245,0.00009834329,0.00015824215,0.000035441866,0.000031679414,0.000018194392,0.00059002737,0.16877066,0.0018463802,0.20441599,0.000048455513,0.62396747],"study_design_scores_gemma":[0.00021417113,0.00010878022,0.0010604223,0.00024162004,0.000011843454,0.000027615743,1.07876005e-7,0.8620374,0.0037707435,0.13151632,0.000509631,0.0005013223],"about_ca_topic_score_codex":0.00004078404,"about_ca_topic_score_gemma":0.000013023609,"teacher_disagreement_score":0.69326675,"about_ca_system_score_codex":0.0003046733,"about_ca_system_score_gemma":0.00031624845,"threshold_uncertainty_score":0.9998072},"labels":[],"label_agreement":null},{"id":"W1496739046","doi":"10.1007/978-3-540-24677-0_56","title":"Systematic versus Non-systematic Methods for Solving Incremental Satisfiability","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Regina","funders":"","keywords":"Satisfiability; Computer science; Propositional calculus; Boolean satisfiability problem; Conjunctive normal form; Propositional formula; Completeness (order theory); Set (abstract data type); Approximation algorithm; Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Propositional variable","score_opus":0.03358788017929245,"score_gpt":0.3477794127939009,"score_spread":0.31419153261460847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496739046","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.00001741453,0.000684251,0.98663586,0.0000766718,0.0065930146,0.0053135795,0.0000051669176,0.00023170457,0.0004423465],"genre_scores_gemma":[0.0048870486,0.000005927953,0.99393356,0.00024008837,0.00028107385,0.0004950996,0.000006921493,0.000046677353,0.000103613624],"study_design_codex":"systematic_review","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993286,0.00059081346,0.0018060252,0.0020526843,0.0012492897,0.0010151867],"domain_scores_gemma":[0.9894066,0.0055742,0.0012102441,0.0031057354,0.00048654937,0.000216684],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.013786517,0.0007702424,0.0017119865,0.000915199,0.00047669,0.0009548182,0.0059629316,0.00047075425,0.000003508737],"category_scores_gemma":[0.0044126105,0.00067505194,0.00034340416,0.0014966402,0.00064988685,0.0012333685,0.0015060934,0.00074890093,0.000019546613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009790737,0.0003220122,0.00001815134,0.7056432,0.00031935817,0.00003256004,0.014793965,0.07102211,0.0018851297,0.05346028,0.00004119343,0.15236418],"study_design_scores_gemma":[0.00076777965,0.00037689914,0.00001720565,0.03339946,0.00007552916,0.000039827377,0.0000014903808,0.8972959,0.004733522,0.06249325,0.000008098675,0.0007910682],"about_ca_topic_score_codex":0.000024098095,"about_ca_topic_score_gemma":0.000028141858,"teacher_disagreement_score":0.82627374,"about_ca_system_score_codex":0.004933062,"about_ca_system_score_gemma":0.0032726277,"threshold_uncertainty_score":0.9995701},"labels":[],"label_agreement":null},{"id":"W1497375868","doi":"10.1007/3-540-45526-4_3","title":"Analysis of Reactive Systems with n Timers","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Automaton; Representation (politics); Simple (philosophy); ENCODE; Theoretical computer science; Parametric statistics; Process (computing); Algorithm; Cellular automaton; Programming language; Mathematics","score_opus":0.022080915954793487,"score_gpt":0.26910444129056793,"score_spread":0.24702352533577443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497375868","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.00012015627,0.00021038637,0.98601794,0.00005278901,0.00065562065,0.00031682677,0.0000056516974,0.00008165186,0.012539002],"genre_scores_gemma":[0.10902301,0.000033961824,0.8903324,0.00014326288,0.00011112267,0.000011037779,0.0000072974212,0.000025205003,0.0003126801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663085,0.0000651374,0.0005431895,0.0012083795,0.0011330324,0.00041941347],"domain_scores_gemma":[0.99662894,0.0003676562,0.0006693392,0.0017809782,0.00043898434,0.00011407826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012314222,0.0003854344,0.0007707517,0.0021416666,0.000106144784,0.00021372302,0.002734714,0.00023843278,0.000010062085],"category_scores_gemma":[0.00006992274,0.00031504437,0.00014184449,0.0030568417,0.0007455069,0.0006392017,0.0004568272,0.00048718305,0.000011146886],"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.000027332717,0.000049214395,0.0003980326,0.000061256964,0.0004196439,0.00006553486,0.001467061,0.5650033,0.00016778165,0.09534926,0.000005479247,0.33698615],"study_design_scores_gemma":[0.00011903397,0.00021347975,0.0005528803,0.00021880872,0.0001420075,0.00003815849,4.4947132e-7,0.9925888,0.0007746849,0.0044330917,0.0004819739,0.00043661485],"about_ca_topic_score_codex":0.000093385075,"about_ca_topic_score_gemma":0.000034561803,"teacher_disagreement_score":0.42758557,"about_ca_system_score_codex":0.0003157552,"about_ca_system_score_gemma":0.0003584027,"threshold_uncertainty_score":0.99993014},"labels":[],"label_agreement":null},{"id":"W1497599822","doi":"10.1007/11560548_22","title":"Identification and Counter Abstraction for Full Virtual Symmetry","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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","funders":"","keywords":"Abstraction; Reduction (mathematics); Symmetry (geometry); Class (philosophy); Abstraction model checking; Point (geometry); Computer science; Identification (biology); Exponential function; State (computer science); Model checking; Theoretical computer science; Theoretical physics; Algebra over a field; Mathematics; Pure mathematics; Algorithm; Artificial intelligence; Physics; Geometry; Mathematical analysis","score_opus":0.020831365677488632,"score_gpt":0.2859631250300992,"score_spread":0.2651317593526106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497599822","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.00020562099,0.00022114009,0.99533427,0.00047440096,0.0023746917,0.00056379224,0.000007160509,0.00012580564,0.0006931236],"genre_scores_gemma":[0.08936971,0.00007339222,0.9084319,0.0006329311,0.0007535144,0.00003472184,0.000009599419,0.000032791162,0.0006614588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704266,0.000028086182,0.00058509083,0.0012860256,0.00065126334,0.00040688025],"domain_scores_gemma":[0.9977293,0.0004020594,0.0004365362,0.0010162125,0.00030677443,0.000109124056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016682042,0.00035935285,0.00031699205,0.0006845711,0.00025834926,0.00064814935,0.0015550064,0.00033815406,0.000008854775],"category_scores_gemma":[0.00017931324,0.00035953717,0.00008100502,0.00030400607,0.00045346573,0.001370002,0.00039267953,0.00047376697,0.000040616374],"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.00001288202,0.000018447294,0.0000057408074,0.000036892485,0.000006753629,0.0000020414361,0.00025950655,0.0048072413,0.0014345647,0.09796856,0.000027477383,0.8954199],"study_design_scores_gemma":[0.00026992842,0.0002400564,0.00034979786,0.00014935569,0.000012497093,0.00008572182,3.2578635e-7,0.90204525,0.005624434,0.0855026,0.0051562637,0.00056374574],"about_ca_topic_score_codex":0.0000041762232,"about_ca_topic_score_gemma":0.000018686078,"teacher_disagreement_score":0.897238,"about_ca_system_score_codex":0.00033046288,"about_ca_system_score_gemma":0.00018942085,"threshold_uncertainty_score":0.9998857},"labels":[],"label_agreement":null},{"id":"W1497747243","doi":"10.1007/3-540-45397-0_6","title":"Object Orientation in Hierarchical Predicate Transition Nets","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Great Plains College","funders":"","keywords":"Computer science; Object-orientation; Encapsulation (networking); Predicate (mathematical logic); Object-oriented programming; Programming language; Object model; Theoretical computer science; Artificial intelligence; Computer security","score_opus":0.02199916380918082,"score_gpt":0.28025992642407915,"score_spread":0.25826076261489833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497747243","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.00038001745,0.00012099369,0.9916869,0.0008915088,0.0016126675,0.00052653585,0.000003554693,0.00017010403,0.004607752],"genre_scores_gemma":[0.09974505,0.000098128025,0.89835775,0.00127899,0.00033251126,0.000028631624,0.000018814577,0.000032996348,0.00010711292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958567,0.00012973436,0.0007065826,0.0015401387,0.0011242549,0.00064261357],"domain_scores_gemma":[0.99796927,0.00029047744,0.00026865708,0.0011648989,0.00014945486,0.00015726271],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017679342,0.00043192197,0.00042861272,0.0012965505,0.00016088807,0.0003247863,0.0023683333,0.00040450838,0.000020999114],"category_scores_gemma":[0.00013381953,0.0004307458,0.00009867056,0.0012627443,0.00060116313,0.0011372674,0.00039174437,0.0010850849,0.00003770536],"study_design_candidate":"design_other","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.000019497737,0.000049101807,0.000055602177,0.000034341516,0.000004379751,0.0000879242,0.0027979827,0.041321374,0.00016287278,0.046047796,0.00000942499,0.9094097],"study_design_scores_gemma":[0.00037240025,0.00020687853,0.0010325718,0.00031722584,0.0000047186936,0.00010350524,2.5814566e-7,0.78811336,0.0013497511,0.20689787,0.0010825245,0.000518938],"about_ca_topic_score_codex":0.000033773205,"about_ca_topic_score_gemma":0.000066331806,"teacher_disagreement_score":0.9088908,"about_ca_system_score_codex":0.0005038097,"about_ca_system_score_gemma":0.00044896323,"threshold_uncertainty_score":0.99981445},"labels":[],"label_agreement":null},{"id":"W1499937701","doi":"10.1007/11817963_18","title":"Yasm: A Software Model-Checker for Verification and Refutation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":57,"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; Programming language; Spurious relationship; Abstraction; Property (philosophy); Software; Counterexample; Software verification; Witness; Formal verification; Theoretical computer science; Software engineering; Software development; Software construction; Machine learning; Discrete mathematics","score_opus":0.03178816741151441,"score_gpt":0.28496566486327407,"score_spread":0.25317749745175966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499937701","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.000060764232,0.00024662653,0.99736655,0.0001993228,0.0007108225,0.0007072233,0.000011405685,0.00019244132,0.00050487515],"genre_scores_gemma":[0.005285141,0.000022711554,0.9935928,0.0004224882,0.00018314918,0.000053462292,0.000024021692,0.00003208222,0.0003841444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970725,0.00002918926,0.00050651736,0.0013645395,0.0005992412,0.00042797276],"domain_scores_gemma":[0.99790853,0.00017642621,0.0003645483,0.001100709,0.00035406553,0.00009569578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011683399,0.0003838617,0.00034412259,0.0005744522,0.00027365726,0.0004187959,0.0014024599,0.00035080168,0.0000014883597],"category_scores_gemma":[0.000216842,0.00038113934,0.000079039186,0.00035411524,0.00043031978,0.00091554737,0.0003860369,0.00037603918,0.0000070038855],"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.000011989078,0.00001981868,0.000015717182,0.00009435578,0.0000055470136,0.0000027170065,0.0005042741,0.14336646,0.00019306976,0.20486577,0.00007076549,0.6508495],"study_design_scores_gemma":[0.00016526804,0.000075316224,0.00009764512,0.00009109218,0.000006895331,0.00001529017,5.0773792e-8,0.78231806,0.0011757361,0.21505594,0.000661525,0.00033715848],"about_ca_topic_score_codex":0.000009396135,"about_ca_topic_score_gemma":0.000011723379,"teacher_disagreement_score":0.65051234,"about_ca_system_score_codex":0.00028454888,"about_ca_system_score_gemma":0.0003197679,"threshold_uncertainty_score":0.99986404},"labels":[],"label_agreement":null},{"id":"W1499948104","doi":"10.1007/978-3-642-55146-8_24","title":"Optimal Multi-Robot Path Planning with LTL Constraints: Guaranteeing Correctness through Synchronization","year":2014,"lang":"en","type":"book-chapter","venue":"Springer tracts in advanced robotics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":32,"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":"Correctness; Linear temporal logic; Software deployment; Robot; Set (abstract data type); Task (project management); Synchronization (alternating current); Computer science; Supervisor; Proposition; Real-time computing; Temporal logic; Interval (graph theory); Path (computing); Distributed computing; Motion planning; Mathematical optimization; Mathematics; Artificial intelligence; Theoretical computer science; Engineering; Algorithm; Programming language","score_opus":0.032828748290608466,"score_gpt":0.2888773550286061,"score_spread":0.2560486067379977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499948104","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.000060334423,0.00043751425,0.9804594,0.00004028351,0.0016280963,0.00066619413,0.0000054353964,0.00035226578,0.016350472],"genre_scores_gemma":[0.024676763,0.00014965101,0.97082216,0.00013241173,0.00014167675,0.000024340976,0.000030259054,0.00013830482,0.0038844298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965324,0.000086578664,0.00091064104,0.0011534354,0.00062951713,0.0006874456],"domain_scores_gemma":[0.9971762,0.00027133676,0.00093251927,0.001216945,0.00028722163,0.0001158273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005809896,0.00073510763,0.0007950625,0.0002914911,0.00019780162,0.00019373842,0.0011754427,0.0005084936,0.0000135832925],"category_scores_gemma":[0.00023698306,0.000735426,0.00010137171,0.00022147081,0.0003698325,0.0010303886,0.00024705043,0.0012628365,0.000036063848],"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.000029933786,0.000044042925,0.000060942457,0.00014297296,0.000030440195,0.00010390982,0.0006676952,0.77709836,0.000069287955,0.1737556,0.0000031142156,0.04799373],"study_design_scores_gemma":[0.00253359,0.00046518637,0.0007971817,0.006494337,0.00009346058,0.00026370122,0.000115349554,0.97754854,0.00090922473,0.0026383675,0.0057312837,0.0024097783],"about_ca_topic_score_codex":0.00000425,"about_ca_topic_score_gemma":0.0000066103275,"teacher_disagreement_score":0.20045021,"about_ca_system_score_codex":0.00042248372,"about_ca_system_score_gemma":0.0002261464,"threshold_uncertainty_score":0.9995097},"labels":[],"label_agreement":null},{"id":"W1500724058","doi":"10.1007/11609773_17","title":"Piecewise FIFO Channels Are Analyzable","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"FIFO (computing and electronics); Piecewise; Computer science; Mathematics; Programming language; Mathematical analysis","score_opus":0.029488643427163966,"score_gpt":0.2767743904493601,"score_spread":0.24728574702219613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500724058","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.000032555177,0.00070681825,0.98770624,0.0008754377,0.0031199262,0.00040486507,0.000005486344,0.00028156434,0.0068671117],"genre_scores_gemma":[0.015387858,0.00008905867,0.98015094,0.0016373862,0.0010863213,0.000017092834,0.0000043773152,0.000042979886,0.0015839889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952218,0.00006453575,0.0006803529,0.0018960494,0.0012489574,0.00088833884],"domain_scores_gemma":[0.9961217,0.00027756137,0.00057512027,0.0024267258,0.0003491765,0.00024971392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001667206,0.00062967127,0.00065172365,0.0011769087,0.000321386,0.0007735126,0.0052886275,0.00044629374,0.00006209697],"category_scores_gemma":[0.00020726328,0.0006014593,0.00017562193,0.0010891501,0.00064708845,0.0013524271,0.0014946774,0.0009951968,0.00021362578],"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.000006074768,0.00003836935,0.000032484302,0.000042344138,0.000012479028,0.000053988486,0.0004938351,0.072501145,0.000074153686,0.05174486,0.000089804285,0.8749105],"study_design_scores_gemma":[0.00021252845,0.000149186,0.00014714699,0.00038975602,0.00000997876,0.00008072178,1.6141134e-7,0.8801417,0.002685278,0.10009286,0.015181577,0.0009091381],"about_ca_topic_score_codex":0.000015081578,"about_ca_topic_score_gemma":0.000031898457,"teacher_disagreement_score":0.8740013,"about_ca_system_score_codex":0.0004989719,"about_ca_system_score_gemma":0.0004181102,"threshold_uncertainty_score":0.9996437},"labels":[],"label_agreement":null},{"id":"W1501230691","doi":"10.1007/978-3-540-24730-2_34","title":"How Vacuous Is Vacuous?","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Computer science; Property (philosophy); Popularity; Model checking; Theoretical computer science; Variety (cybernetics); Computation; Computer security; Algorithm; Artificial intelligence; Law; Epistemology","score_opus":0.026391721533618972,"score_gpt":0.26721220012821745,"score_spread":0.24082047859459849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501230691","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.000027596461,0.0004703207,0.9880939,0.0026726488,0.003122523,0.00049158174,0.0000071245854,0.00033719235,0.0047771265],"genre_scores_gemma":[0.023212602,0.00006937249,0.9721937,0.0028397115,0.0005371621,0.000014272706,0.0000035631845,0.000051534964,0.0010780811],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947734,0.000051705374,0.00054897915,0.0021656842,0.0015350664,0.0009251551],"domain_scores_gemma":[0.99590635,0.00022320221,0.0004692518,0.0027874848,0.00036408764,0.00024959672],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012078267,0.0007299869,0.00064172305,0.0010165183,0.0003389791,0.0014736754,0.0061236843,0.00055016193,0.00003415115],"category_scores_gemma":[0.00017893121,0.00068227714,0.00020828561,0.000966028,0.0008118451,0.0015132502,0.0016810454,0.0011674823,0.000119930744],"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.000004086778,0.00003003802,0.000012545608,0.000054885215,0.000012317586,0.00008149921,0.0011464009,0.004299084,0.00018224998,0.20040376,0.000044779255,0.79372835],"study_design_scores_gemma":[0.0004066879,0.00032197984,0.00013369208,0.00044565625,0.000013952675,0.00020094632,2.4326832e-7,0.25183004,0.011075247,0.7267624,0.0074616442,0.0013475085],"about_ca_topic_score_codex":0.000021026122,"about_ca_topic_score_gemma":0.000011603584,"teacher_disagreement_score":0.7923808,"about_ca_system_score_codex":0.000785465,"about_ca_system_score_gemma":0.0008951951,"threshold_uncertainty_score":0.9995629},"labels":[],"label_agreement":null},{"id":"W1502337223","doi":"10.1007/978-3-540-24732-6_17","title":"Translation from Adapted UML to Promela for CORBA-Based Applications","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Windsor","funders":"","keywords":"Promela; Computer science; Common Object Request Broker Architecture; Correctness; Unified Modeling Language; Middleware (distributed applications); Distributed object; Programming language; UML tool; Distributed computing; Applications of UML; Interoperable Object Reference; Model checking; Software design pattern; Software","score_opus":0.04304845649919971,"score_gpt":0.2961245316517238,"score_spread":0.2530760751525241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502337223","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.000010824423,0.00016166567,0.9941863,0.0011147575,0.00084414764,0.0025313662,0.000050925875,0.00025932144,0.0008407389],"genre_scores_gemma":[0.01976529,0.0000039204615,0.9782354,0.0012320308,0.0003173886,0.00032053626,0.000046020894,0.000037567963,0.00004180934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648625,0.000033177046,0.0005865822,0.0016066595,0.00078359403,0.0005037301],"domain_scores_gemma":[0.99703246,0.00050461234,0.0002934627,0.0016107367,0.00035877145,0.00019997831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082345173,0.00044399445,0.00042881927,0.0007553646,0.00027619067,0.00035556772,0.002946868,0.00034117585,0.00001565916],"category_scores_gemma":[0.00009486535,0.00045069715,0.00013707762,0.0008707984,0.00027960475,0.00048859866,0.00022682307,0.00042563942,0.000048832007],"study_design_candidate":"design_other","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.0000142639465,0.00003070948,0.0000033656645,0.00003123989,0.0000058224023,0.0000017395004,0.00039168214,0.07734298,0.000542779,0.06488167,0.0000046626387,0.8567491],"study_design_scores_gemma":[0.00042576704,0.00022187304,0.00008249912,0.00024784074,0.000012449665,0.000003015439,8.2753104e-8,0.7287193,0.0074065374,0.25646415,0.0058402442,0.00057625887],"about_ca_topic_score_codex":0.00002896289,"about_ca_topic_score_gemma":0.000050722334,"teacher_disagreement_score":0.85617286,"about_ca_system_score_codex":0.0004893048,"about_ca_system_score_gemma":0.00084558345,"threshold_uncertainty_score":0.9997945},"labels":[],"label_agreement":null},{"id":"W1503117290","doi":"10.1109/ictma.1988.669593","title":"Towards Ultra Reliable Medical Systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","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":"Hamilton Health Sciences","funders":"","keywords":"Computer science","score_opus":0.02651539831031223,"score_gpt":0.3042101407995164,"score_spread":0.27769474248920417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503117290","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.0005266301,0.00009803897,0.8507992,0.0016502623,0.00062954373,0.000066557346,1.5206172e-7,0.00027373817,0.14595585],"genre_scores_gemma":[0.14718807,0.000029025394,0.8493674,0.00061389484,0.00020550014,0.000015392665,5.02628e-7,0.000004588136,0.0025756254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988487,0.0000524716,0.0002054148,0.00020278581,0.00050565763,0.00018500467],"domain_scores_gemma":[0.99926454,0.000029030738,0.000038431295,0.0004902018,0.000052945,0.00012484279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010422023,0.00006424579,0.00008735245,0.000042650594,0.000049519098,0.000094962124,0.00089508056,0.00007942309,0.00013305843],"category_scores_gemma":[0.00018008747,0.000050614966,0.000024387495,0.00021900695,0.000026056267,0.0005264348,0.000067358065,0.000104025785,0.0005293649],"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":[8.460421e-7,0.000026301535,0.000038341754,0.000008745179,0.000003054048,0.0000017512255,0.00010641267,0.00020744075,0.00015580554,0.8985169,0.007093144,0.09384125],"study_design_scores_gemma":[0.00014026549,0.000034498833,0.0003452557,0.00001828589,0.0000012876557,0.000066035216,0.000018384095,0.72923183,0.009997043,0.0005176544,0.25949773,0.000131742],"about_ca_topic_score_codex":0.000076793505,"about_ca_topic_score_gemma":0.0000021387589,"teacher_disagreement_score":0.8979993,"about_ca_system_score_codex":0.000048099017,"about_ca_system_score_gemma":0.00008961699,"threshold_uncertainty_score":0.6804092},"labels":[],"label_agreement":null},{"id":"W1503780205","doi":"10.1007/978-3-540-45069-6_21","title":"TLQSolver: A Temporal Logic Query Checker","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":29,"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":"Temporal logic; Computer science; Model checking; A priori and a posteriori; Query optimization; Theoretical computer science; Symbol (formal); Mathematics; Programming language; Algorithm; Information retrieval; Philosophy; Epistemology","score_opus":0.03690787378251955,"score_gpt":0.28391339258666953,"score_spread":0.24700551880414998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503780205","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.000021759872,0.00052060676,0.98272413,0.0005881402,0.0033617986,0.0004621158,0.0000032390726,0.000257396,0.0120607875],"genre_scores_gemma":[0.0050175106,0.000047121408,0.989687,0.004099805,0.00030797438,0.000015716165,0.000004847574,0.000039777082,0.00078023877],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99513537,0.00010447073,0.000728931,0.0019391654,0.0012313325,0.0008607398],"domain_scores_gemma":[0.99644274,0.00020989736,0.00046280396,0.0023629288,0.0002958957,0.00022572625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002153133,0.0006671693,0.0006253303,0.00089606125,0.00028253926,0.0005828478,0.00435538,0.00053958787,0.000046390986],"category_scores_gemma":[0.0002426708,0.00061027356,0.00019246087,0.0009245564,0.00092847855,0.0010636204,0.0011330553,0.0011434223,0.00014837492],"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.000009108877,0.00006569499,0.00014710144,0.00007335678,0.000017598946,0.00013696478,0.0006872838,0.0065075615,0.00017124842,0.4599443,0.00021351781,0.53202623],"study_design_scores_gemma":[0.00037071662,0.00030003328,0.00019344094,0.0003448815,0.000012139303,0.00025993618,2.071846e-7,0.46255574,0.0033637786,0.5099224,0.021169731,0.001506999],"about_ca_topic_score_codex":0.000021045465,"about_ca_topic_score_gemma":0.000022541746,"teacher_disagreement_score":0.53051925,"about_ca_system_score_codex":0.0005031488,"about_ca_system_score_gemma":0.0005838764,"threshold_uncertainty_score":0.99963486},"labels":[],"label_agreement":null},{"id":"W1504176635","doi":"10.1007/3-540-45241-9_23","title":"State Generation in the PARMC Model Checker","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 New Brunswick","funders":"","keywords":"Computer science; Generality; Compiler; Programming language; Relation (database); State (computer science); Representation (politics); Model checking; Code generation; Code (set theory); Transition system; Abstract state machines; Parallel computing; Theoretical computer science; Finite-state machine; Operating system; Database","score_opus":0.05977082222996047,"score_gpt":0.2969365977878846,"score_spread":0.23716577555792415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504176635","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.00023635414,0.00018713027,0.99342394,0.00052999856,0.0008290925,0.00046318877,0.0000024210772,0.00007230466,0.0042555677],"genre_scores_gemma":[0.028186953,0.000099093006,0.9686414,0.0024271123,0.00030469726,0.000026312775,0.000006622306,0.00002204209,0.0002857739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965091,0.00010972323,0.00056360295,0.0011875667,0.001063841,0.0005661689],"domain_scores_gemma":[0.9976841,0.00012970601,0.0002653,0.0016861439,0.00016123673,0.00007348751],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027437205,0.00039823868,0.0003196606,0.00060675107,0.00020351833,0.00058767176,0.0039878734,0.00022835196,0.000006734384],"category_scores_gemma":[0.00010479747,0.0003037478,0.00008041915,0.00083838654,0.00041312934,0.000911232,0.0005804412,0.00086777395,0.000032380518],"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.0000026759826,0.000023405895,0.000016145023,0.000010012234,0.0000022979466,0.000027259803,0.0021693523,0.5126447,0.00011465489,0.09739583,0.000038467013,0.3875552],"study_design_scores_gemma":[0.000107805405,0.000045720648,0.00006519592,0.0000451715,0.000002075852,0.000037198897,1.2052179e-7,0.85212,0.00070077216,0.14579885,0.0007689371,0.00030816378],"about_ca_topic_score_codex":0.00002237083,"about_ca_topic_score_gemma":0.000116605624,"teacher_disagreement_score":0.38724703,"about_ca_system_score_codex":0.00030539167,"about_ca_system_score_gemma":0.00038232238,"threshold_uncertainty_score":0.99994147},"labels":[],"label_agreement":null},{"id":"W1504183634","doi":"10.1007/978-3-540-73595-3_8","title":"An Incremental Technique for Automata-Based Decision Procedures","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","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":"University of Waterloo","funders":"","keywords":"Computer science; Heuristics; Automaton; Satisfiability; Boolean satisfiability problem; Simple (philosophy); Theoretical computer science; Computation; Decision problem; Algorithm","score_opus":0.03574229404385039,"score_gpt":0.33916311075414746,"score_spread":0.3034208167102971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504183634","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.00003735739,0.000073783835,0.99589926,0.000091830516,0.001174192,0.0016352825,0.000009887486,0.00037464913,0.0007037367],"genre_scores_gemma":[0.022484284,0.0000050022486,0.97599155,0.0010799675,0.00026888854,0.00009505303,0.000013588304,0.000042307038,0.000019347555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957583,0.00004077896,0.00067860464,0.0016690673,0.0011727227,0.0006805492],"domain_scores_gemma":[0.99647164,0.0006284422,0.00039115074,0.0019249871,0.00038372132,0.00020003221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035206734,0.00052213814,0.00043515887,0.001323295,0.00033661362,0.00050137745,0.004610998,0.0004861847,0.0000080268555],"category_scores_gemma":[0.0003723118,0.00048458943,0.00013085146,0.0006645927,0.00054165977,0.001024939,0.00053634285,0.0005523971,0.000011328228],"study_design_candidate":"design_other","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.000047176436,0.00008111229,0.00001708359,0.0001022002,0.0000044342023,0.00001555013,0.00016792887,0.01246605,0.0038348134,0.042278185,0.00001997658,0.9409655],"study_design_scores_gemma":[0.00036020338,0.00060207536,0.00008575191,0.00043671584,0.000005813487,0.00004699736,9.135884e-8,0.7824644,0.08774081,0.12682201,0.000806172,0.00062897784],"about_ca_topic_score_codex":0.00000961913,"about_ca_topic_score_gemma":0.00004935508,"teacher_disagreement_score":0.9403365,"about_ca_system_score_codex":0.000523015,"about_ca_system_score_gemma":0.00093995954,"threshold_uncertainty_score":0.99976057},"labels":[],"label_agreement":null},{"id":"W1506362155","doi":"10.1007/978-3-540-77966-7_1","title":"Simulation vs. Formal: Absorb What Is Useful; Reject What Is Useless","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"Emulation; Complement (music); Computer science; Formal verification; Formal methods; Software engineering; Programming language; Psychology; Social psychology","score_opus":0.04014947275697075,"score_gpt":0.29640254783774705,"score_spread":0.2562530750807763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506362155","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.00034451624,0.0026888063,0.98948187,0.0009753085,0.005015531,0.000746757,0.0000051597913,0.00032510006,0.00041697992],"genre_scores_gemma":[0.06624943,0.004926159,0.9166135,0.010882601,0.0007341948,0.000025797246,0.00001358958,0.00010357419,0.00045114494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99356854,0.00010618262,0.0010292028,0.0021166333,0.002028492,0.0011509421],"domain_scores_gemma":[0.99439555,0.0008855723,0.00074608036,0.0030479156,0.0006611109,0.00026379144],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0017261982,0.0008789601,0.00082958216,0.0012211015,0.0006309214,0.0033245392,0.0050634183,0.0007278999,0.000051412422],"category_scores_gemma":[0.00012581877,0.00085192546,0.00027663054,0.0012384116,0.0008773951,0.015543577,0.0017063288,0.0011730093,0.00018775479],"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.000016275335,0.000029666619,0.000026961594,0.000056389406,0.000015207804,0.000028228515,0.0074536363,0.09506485,0.000027431017,0.0021850856,0.000053226162,0.895043],"study_design_scores_gemma":[0.00030973917,0.00023098488,0.00016296052,0.0009702019,0.000012145779,0.000086408385,0.0000024566177,0.9602606,0.005930507,0.019595372,0.011369321,0.0010692956],"about_ca_topic_score_codex":0.000022359794,"about_ca_topic_score_gemma":0.000011081878,"teacher_disagreement_score":0.89397377,"about_ca_system_score_codex":0.000596693,"about_ca_system_score_gemma":0.0005509835,"threshold_uncertainty_score":0.99939317},"labels":[],"label_agreement":null},{"id":"W1507699160","doi":"10.1109/sew.2003.1270726","title":"On the run-time verification of autonomy software","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Dependability; Computer science; Model checking; Formal verification; Formal methods; Software verification; Autonomy; Software engineering; Runtime verification; Scheduling (production processes); Verification and validation; Software; Survivability; Redundancy (engineering); Software system; Systems engineering; Programming language; Software construction; Engineering; Operating system","score_opus":0.02057377325175415,"score_gpt":0.2534639773207327,"score_spread":0.2328902040689786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507699160","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.014855604,0.0000063747143,0.97534025,0.0011918733,0.000106835316,0.0001380474,5.571906e-7,0.00013699339,0.008223475],"genre_scores_gemma":[0.20309538,0.0000010078539,0.79617167,0.0003921888,0.000011179799,0.000015283083,9.143788e-7,0.0000035860776,0.00030877267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993893,0.0000487713,0.00015277693,0.00015553871,0.00016092652,0.000092666196],"domain_scores_gemma":[0.99902624,0.000104028164,0.00008663817,0.0007045028,0.000057388716,0.00002122719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004225338,0.00005874933,0.000061826264,0.000040025174,0.00006391121,0.00002992622,0.00068937265,0.000031654836,0.00004159964],"category_scores_gemma":[0.00018857005,0.00003874468,0.000031838394,0.00024418748,0.000045358684,0.00023283051,0.0000545064,0.00006065583,0.00031073167],"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.0000017550923,0.000031963227,0.000007883358,0.000002422595,0.0000026707216,9.2333536e-8,0.00025868788,0.00039279353,0.002129213,0.98259115,0.00013078208,0.014450602],"study_design_scores_gemma":[0.000564119,0.0003773954,0.017037006,0.000057228524,0.00000836998,0.0000064139394,0.000047978905,0.052443717,0.47718868,0.4465984,0.005298328,0.00037236293],"about_ca_topic_score_codex":0.000013497485,"about_ca_topic_score_gemma":2.3438521e-7,"teacher_disagreement_score":0.53599274,"about_ca_system_score_codex":0.00006491889,"about_ca_system_score_gemma":0.000092024995,"threshold_uncertainty_score":0.39939305},"labels":[],"label_agreement":null},{"id":"W1509407365","doi":"10.1007/978-3-642-11503-5_15","title":"Lazy Combinators for Executable Specifications of General Attribute Grammars","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"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 Windsor","funders":"","keywords":"Computer science; Programming language; Executable; Combinatory logic; L-attributed grammar; Rule-based machine translation; Parsing; Context-free grammar; Parsing expression grammar; S-attributed grammar; Definite clause grammar; Theoretical computer science; Natural language processing","score_opus":0.045408896168309364,"score_gpt":0.28497265485952317,"score_spread":0.2395637586912138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509407365","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.00015155166,0.00014414306,0.9939991,0.00036700044,0.0032282926,0.00082408875,0.00003335845,0.0001174424,0.0011350141],"genre_scores_gemma":[0.009914829,0.00003257177,0.98890597,0.00021813247,0.00025881667,0.00004039295,0.000019695899,0.000034255532,0.000575361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654996,0.000040317802,0.000756491,0.0012514973,0.00077925366,0.0006224512],"domain_scores_gemma":[0.99606043,0.00047918755,0.00060412503,0.0020625559,0.00063170365,0.00016197714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016628967,0.00043241243,0.0005797139,0.0007946661,0.00029712566,0.0002426013,0.004110395,0.0004521914,0.0000133817575],"category_scores_gemma":[0.0002690687,0.00042675872,0.00019285611,0.0007461116,0.0009940091,0.0006403022,0.00075327285,0.0007647826,0.000013521135],"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.000007230705,0.00005944773,0.000060406535,0.00006858388,0.000012691746,0.000003680739,0.000330037,0.0045806165,0.0041849,0.7855581,0.00003961955,0.20509467],"study_design_scores_gemma":[0.00043354018,0.00027050672,0.00028907688,0.00015413517,0.000016965674,0.000035920475,2.054583e-7,0.33436203,0.06998967,0.58131135,0.012365034,0.0007715785],"about_ca_topic_score_codex":0.000023841867,"about_ca_topic_score_gemma":0.000021573442,"teacher_disagreement_score":0.3297814,"about_ca_system_score_codex":0.00021041668,"about_ca_system_score_gemma":0.0005691323,"threshold_uncertainty_score":0.99981844},"labels":[],"label_agreement":null},{"id":"W1511351994","doi":"10.1007/978-3-642-32355-3_10","title":"An Event-B Approach to Timing Issues Applied to the Generic Insulin Infusion Pump","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"McMaster University","funders":"","keywords":"Computer science; Event (particle physics); Insulin pump; Programming language; Real-time computing; Medicine; Endocrinology; Diabetes mellitus; Physics","score_opus":0.04612411775244778,"score_gpt":0.3004595466442302,"score_spread":0.2543354288917824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511351994","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.00023884767,0.00033109312,0.9932552,0.00074763544,0.0016774227,0.0011126221,0.0000028163818,0.00019630934,0.0024380346],"genre_scores_gemma":[0.081791535,0.000023062179,0.913017,0.0039606523,0.0009914489,0.0000691244,0.000006291091,0.000039266717,0.00010163496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955842,0.000107015956,0.00058913085,0.0016251458,0.001260632,0.00083389465],"domain_scores_gemma":[0.9960986,0.0001532527,0.0002630073,0.0027940643,0.0002272058,0.00046390004],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0028357098,0.0005552584,0.00045926287,0.0008127156,0.00047680314,0.00077222567,0.0066797826,0.00030110552,0.0000113073265],"category_scores_gemma":[0.00016140922,0.00042182262,0.00008234743,0.0014191428,0.00025570692,0.00081097265,0.0022098764,0.00071652094,0.00019133397],"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.0000066830926,0.000042792366,0.0000052713654,0.0000165376,0.0000036691654,0.0000013191442,0.004300372,0.16571856,0.0011497062,0.029086038,0.000024971265,0.79964405],"study_design_scores_gemma":[0.00014889226,0.00027153932,0.0006082409,0.00013372759,0.000011277151,0.000042634158,0.0000017720604,0.95379645,0.00890845,0.0139361145,0.021046516,0.0010944135],"about_ca_topic_score_codex":0.00002641015,"about_ca_topic_score_gemma":0.000013258762,"teacher_disagreement_score":0.79854965,"about_ca_system_score_codex":0.0003183477,"about_ca_system_score_gemma":0.00026589466,"threshold_uncertainty_score":0.99982333},"labels":[],"label_agreement":null},{"id":"W1513403094","doi":"10.1007/978-3-540-30476-0_24","title":"Providing Automated Verification in HOL Using MDGs","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Concordia University","funders":"","keywords":"HOL; Automated theorem proving; Reachability; Computer science; Model checking; Formal verification; Theoretical computer science; Programming language; Automated proof checking; State space; Automation; State (computer science); Formal methods; Equivalence (formal languages); Set (abstract data type); Proof assistant; Algorithm; Mathematical proof; Mathematics; Discrete mathematics","score_opus":0.04216792123757171,"score_gpt":0.3063406616379988,"score_spread":0.26417274040042704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513403094","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.00087279145,0.00017754383,0.99463034,0.00016238049,0.002086273,0.0006580043,0.000001966929,0.00054795225,0.0008627507],"genre_scores_gemma":[0.14596006,0.000015495922,0.85349005,0.0002801619,0.0001802897,0.000012255614,0.000003841251,0.00003210307,0.000025758232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592406,0.00008065916,0.00077935745,0.0016050187,0.0009326046,0.0006783119],"domain_scores_gemma":[0.9973481,0.00017561267,0.0004851081,0.0015698002,0.00029936054,0.000121990066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018821743,0.0004867499,0.0004685231,0.0014421159,0.0002221314,0.00053485966,0.0031242557,0.0004214627,0.000007350939],"category_scores_gemma":[0.00033921222,0.0005018854,0.0000850575,0.0014087302,0.00048427525,0.0014319165,0.00077189144,0.0008327821,0.000030280673],"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.000010386228,0.00006370273,0.00011215963,0.00012886176,0.000007649323,0.0000731507,0.0021435907,0.39002126,0.0050069443,0.120966345,0.0000033812341,0.48146254],"study_design_scores_gemma":[0.00020442625,0.00006733676,0.00035793294,0.00059375854,0.000003881416,0.000041460902,1.8181713e-7,0.9221352,0.008000014,0.06797308,0.000099858225,0.0005229153],"about_ca_topic_score_codex":0.00008430456,"about_ca_topic_score_gemma":0.000025255196,"teacher_disagreement_score":0.5321139,"about_ca_system_score_codex":0.0015975651,"about_ca_system_score_gemma":0.0011024568,"threshold_uncertainty_score":0.9997433},"labels":[],"label_agreement":null},{"id":"W1514570516","doi":"10.1109/sefm.2004.51","title":"Verification of the WAP transaction layer","year":2004,"lang":"en","type":"article","venue":"Software Engineering and Formal Methods","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Protocol (science); Model checking; Wireless Application Protocol; Database transaction; Deadlock; Layer (electronics); Distributed transaction; Distributed computing; Computer network; Set (abstract data type); Transaction processing; Application layer; Wireless; Database; Operating system; Programming language; Wireless network; Software","score_opus":0.02037612255444688,"score_gpt":0.28895421164344676,"score_spread":0.2685780890889999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514570516","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.023114791,0.00017263112,0.97573024,0.00005360068,0.0006321858,0.00010299113,0.000001073662,0.00015607022,0.000036412304],"genre_scores_gemma":[0.20910294,0.000017650142,0.790815,0.000016343552,0.000018948494,0.0000122841175,3.7458736e-7,0.0000066600255,0.000009791062],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928725,0.0000620201,0.00020116376,0.00015573467,0.00012986062,0.00016396909],"domain_scores_gemma":[0.99939257,0.00007123865,0.00007379272,0.00037714545,0.00004474319,0.00004048235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090905896,0.000096811746,0.00010882545,0.00006336529,0.00008450978,0.000025423953,0.00032040072,0.000071577655,0.0000011233508],"category_scores_gemma":[0.00029820835,0.00007458362,0.000055681136,0.0003273524,0.000030576783,0.0005771246,0.000049395603,0.00014869178,0.000001018712],"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.000011959729,0.000042584885,0.00026305194,0.00018616859,0.000028443625,2.9566985e-7,0.0023097533,0.047199413,0.045999862,0.20580822,0.0000029248915,0.6981473],"study_design_scores_gemma":[0.0007716979,0.00017435705,0.08702419,0.0001351215,0.000034874356,0.00008088558,0.000054134052,0.13953406,0.7606743,0.006002018,0.0050636153,0.00045078556],"about_ca_topic_score_codex":0.000009229723,"about_ca_topic_score_gemma":1.869795e-7,"teacher_disagreement_score":0.7146744,"about_ca_system_score_codex":0.000034846424,"about_ca_system_score_gemma":0.000024221943,"threshold_uncertainty_score":0.3041432},"labels":[],"label_agreement":null},{"id":"W1514731943","doi":"10.1007/978-3-540-74407-8_33","title":"Temporal Antecedent Failure: Refining Vacuity","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"University of Waterloo","funders":"","keywords":"Antecedent (behavioral psychology); Computer science; Temporal logic; Model checking; Extension (predicate logic); Linear temporal logic; Theoretical computer science; Programming language; Algorithm","score_opus":0.050014291363107866,"score_gpt":0.3104683291280238,"score_spread":0.26045403776491594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514731943","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.000058831905,0.00023292635,0.98774177,0.00037800643,0.0027700933,0.000252821,0.0000031971852,0.00032513577,0.008237234],"genre_scores_gemma":[0.02339561,0.00001739681,0.97469544,0.0009996662,0.0004594766,0.000006787907,0.000005103628,0.00003707494,0.00038345665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99480796,0.00006607265,0.0008224377,0.0018574358,0.0015319999,0.0009140831],"domain_scores_gemma":[0.99633676,0.00036580535,0.0005345657,0.002197948,0.0003249172,0.00024001657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036523242,0.0006140123,0.00058139727,0.0011884139,0.00034704842,0.00062613137,0.004965726,0.0005162034,0.000024734492],"category_scores_gemma":[0.00025729966,0.0005814588,0.00016156244,0.00103261,0.0007521412,0.0010526619,0.0018265329,0.001353607,0.000098262804],"study_design_candidate":"design_other","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.0000064520927,0.000023904831,0.00016379898,0.00003528537,0.000007900048,0.000089129346,0.0005016374,0.0025623606,0.00017950125,0.10149857,0.00002631478,0.89490515],"study_design_scores_gemma":[0.0006607979,0.00050433486,0.0011287683,0.0010525119,0.000019379924,0.00047736967,6.667613e-7,0.7374093,0.009817364,0.21555312,0.030747326,0.0026290596],"about_ca_topic_score_codex":0.000037369147,"about_ca_topic_score_gemma":0.00013855149,"teacher_disagreement_score":0.8922761,"about_ca_system_score_codex":0.0006080968,"about_ca_system_score_gemma":0.00052116846,"threshold_uncertainty_score":0.9996637},"labels":[],"label_agreement":null},{"id":"W1515040974","doi":"10.1007/s10009-009-0109-2","title":"Encoding a process algebra using the Event B method","year":2009,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Computer science; Process calculus; Event (particle physics); Asynchronous communication; Theory of computation; Semantics (computer science); ENCODE; Theoretical computer science; Process (computing); Operator (biology); Programming language; Algorithm; Algebra over a field; Mathematics","score_opus":0.04812510076258449,"score_gpt":0.38269175519297816,"score_spread":0.3345666544303937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515040974","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.022675756,0.00006529985,0.9690325,0.006634785,0.0009973836,0.0002509039,0.00000663313,0.00027254256,0.000064153755],"genre_scores_gemma":[0.38922447,0.000018472998,0.60929286,0.0012778185,0.0001338199,0.000027184586,0.0000012984514,0.000010140779,0.00001391121],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983735,0.000080760714,0.00044204685,0.00029816228,0.00051387376,0.0002916687],"domain_scores_gemma":[0.99875784,0.0002393104,0.000115861294,0.00032944628,0.0005067188,0.00005083651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010483115,0.00016994547,0.00016698228,0.00042295517,0.00029207347,0.00034337337,0.0024509158,0.00017534959,0.000013066837],"category_scores_gemma":[0.00069846393,0.00012496018,0.00017376806,0.00040089144,0.000061945175,0.0009694044,0.000034554032,0.0005443888,0.000005518433],"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.00007493455,0.00010693394,0.000074334865,0.000004078571,0.00008752739,0.000022037482,0.000342046,0.0024486994,0.0030319262,0.4128574,0.00004747475,0.5809026],"study_design_scores_gemma":[0.0022921835,0.0013672538,0.0009906507,0.00034845716,0.000075237986,0.00381935,0.00026350663,0.083721794,0.2410595,0.650894,0.014416517,0.00075155834],"about_ca_topic_score_codex":4.9162867e-7,"about_ca_topic_score_gemma":2.9814396e-7,"teacher_disagreement_score":0.580151,"about_ca_system_score_codex":0.0001649586,"about_ca_system_score_gemma":0.000109622946,"threshold_uncertainty_score":0.5095728},"labels":[],"label_agreement":null},{"id":"W1516468647","doi":"","title":"Effectively Polynomial Simulations","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":16,"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":"","keywords":"Proof complexity; Structural proof theory; Computer science; Propositional calculus; Expressive power; Propositional formula; Theoretical computer science; Computational complexity theory; Propositional variable; Mathematics; Proof theory; Discrete mathematics; Algorithm; Mathematical proof","score_opus":0.015449922455768478,"score_gpt":0.2995620371557112,"score_spread":0.28411211469994274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516468647","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.10510833,8.2750796e-7,0.8768035,0.00014751616,0.00077553646,0.00007561918,4.5422354e-7,0.0001682258,0.016919995],"genre_scores_gemma":[0.52275646,4.231198e-8,0.47699565,0.00005906658,0.000040094274,0.0000023216921,2.1455318e-7,0.0000014160668,0.00014473095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995897,0.000031141564,0.00007288788,0.00013408999,0.00008050395,0.00009170065],"domain_scores_gemma":[0.9994658,0.000091598624,0.000023779307,0.00034507393,0.000036308844,0.00003739131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019480858,0.000042003438,0.000039057748,0.000046103025,0.00007156672,0.000058630092,0.00036300486,0.000037345217,0.0000524235],"category_scores_gemma":[0.0001555633,0.000036552996,0.000019143838,0.00016609921,0.000023017628,0.00040662024,0.000069071815,0.00011045885,0.00012626918],"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.0000020118675,0.00003060004,0.0009981403,0.0000016598206,0.0000032831254,3.6832634e-7,0.0001456004,0.00012157427,0.117311224,0.797664,0.0005579881,0.083163574],"study_design_scores_gemma":[0.00024315996,0.000051250605,0.0872008,0.0000012312331,0.0000021331105,0.00000945977,0.0000027457716,0.7563834,0.13124692,0.0053740824,0.01931055,0.00017422675],"about_ca_topic_score_codex":0.00001393758,"about_ca_topic_score_gemma":0.000010760307,"teacher_disagreement_score":0.7922899,"about_ca_system_score_codex":0.0000074976883,"about_ca_system_score_gemma":0.000019994226,"threshold_uncertainty_score":0.1622977},"labels":[],"label_agreement":null},{"id":"W1518764426","doi":"10.1007/bfb0023728","title":"Using partial-order semantics to avoid the state explosion problem in asynchronous systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":38,"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":"Nondeterministic algorithm; Liveness; Concurrency; Computer science; Automaton; Model checking; Finite-state machine; Petri net; Asynchronous communication; Theoretical computer science; Branching (polymer chemistry); State (computer science); Partial order reduction; Algorithm; Programming language","score_opus":0.04425788797565207,"score_gpt":0.29586458397730303,"score_spread":0.251606696001651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518764426","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.000539489,0.00041474725,0.9945178,0.0006465267,0.0020512904,0.0012377443,0.0000029941893,0.000121575154,0.0004678505],"genre_scores_gemma":[0.03816442,0.000047442158,0.96047455,0.0007414693,0.0003915124,0.000032823104,0.0000013755202,0.000040933483,0.000105454084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553776,0.00018396735,0.0008631128,0.0014150817,0.0011566409,0.00084341096],"domain_scores_gemma":[0.9969766,0.00034492786,0.00040556092,0.0018072767,0.0003051114,0.000160481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002833541,0.0005209413,0.0005169027,0.0008188274,0.00031249985,0.00083278026,0.0036527263,0.0002502596,0.000004089872],"category_scores_gemma":[0.00014497101,0.0004047373,0.00007160346,0.0013444368,0.00038695775,0.0008525591,0.0014832693,0.0009111688,0.000049230202],"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.000005059423,0.000024749663,0.000026989146,0.00005988522,0.0000041144003,0.000020675616,0.0024550804,0.7860008,0.00034381697,0.012657025,0.000004074368,0.19839773],"study_design_scores_gemma":[0.00013670209,0.00011130538,0.00004194594,0.0007992864,0.000005012581,0.00006652527,7.349398e-7,0.980942,0.0017611638,0.014348993,0.001261449,0.00052486995],"about_ca_topic_score_codex":0.000106553685,"about_ca_topic_score_gemma":0.00009643481,"teacher_disagreement_score":0.19787285,"about_ca_system_score_codex":0.00076548336,"about_ca_system_score_gemma":0.00058901205,"threshold_uncertainty_score":0.99984044},"labels":[],"label_agreement":null},{"id":"W1520747543","doi":"10.1007/bfb0023724","title":"Issues arising in the analysis of L.0","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Executable; Computer science; Asynchronous communication; Programming language; Simple (philosophy); Operator (biology); Theoretical computer science; Telecommunications","score_opus":0.03234883769730573,"score_gpt":0.31551538026367226,"score_spread":0.28316654256636653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520747543","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.0002960486,0.0006177492,0.99508893,0.00070046453,0.00044644374,0.0002179818,0.0000020267876,0.000037747403,0.0025926079],"genre_scores_gemma":[0.09775017,0.00006241296,0.9012313,0.00070424646,0.00016085741,0.000004551332,0.0000024766161,0.000010017955,0.00007394952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694866,0.00011215685,0.0006380923,0.0008935058,0.0010262865,0.00038127092],"domain_scores_gemma":[0.9971024,0.00054531737,0.00038497327,0.0017695616,0.00015465432,0.000043120563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029950489,0.00029479375,0.0005483171,0.0020147236,0.00010192572,0.000268805,0.0046055615,0.0002096512,0.000012703178],"category_scores_gemma":[0.00016960358,0.00022173696,0.00016525455,0.0029933217,0.0005531174,0.00055914995,0.0005768781,0.0006111499,0.0000074280465],"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.0000025234258,0.000028615568,0.00020555087,0.000014823856,0.000030729934,0.00001180401,0.0037999111,0.1121374,0.00006826761,0.07649485,0.000004327183,0.8072012],"study_design_scores_gemma":[0.000078559126,0.000055550245,0.003926525,0.00012331488,0.000046010537,0.000010560463,6.4088727e-7,0.9441536,0.0009809237,0.04924674,0.0010624194,0.0003151356],"about_ca_topic_score_codex":0.00007027825,"about_ca_topic_score_gemma":0.00018851548,"teacher_disagreement_score":0.8320162,"about_ca_system_score_codex":0.0001747968,"about_ca_system_score_gemma":0.00017354508,"threshold_uncertainty_score":0.90421706},"labels":[],"label_agreement":null},{"id":"W1520816873","doi":"10.1007/978-3-540-31984-9_17","title":"A Framework for Counterexample Generation and Exploration","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"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":"Counterexample; Debugging; Computer science; Property (philosophy); Structuring; Artifact (error); Programming language; Model checking; Theoretical computer science; Exploit; Loop (graph theory); Algorithm; Mathematics; Artificial intelligence; Discrete mathematics; Computer security","score_opus":0.08353658458701141,"score_gpt":0.32159458126603047,"score_spread":0.23805799667901906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520816873","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.000036330577,0.0002754663,0.9961947,0.0010180024,0.0014839349,0.00061351515,0.000005582054,0.00010949512,0.00026297296],"genre_scores_gemma":[0.006524868,0.00008049334,0.9909511,0.0012352255,0.0010457883,0.000045061646,0.000010856814,0.000022981634,0.000083618695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975867,0.00003087883,0.0004134456,0.00110867,0.00050307147,0.0003572043],"domain_scores_gemma":[0.99810284,0.0003706885,0.00027281494,0.0009107246,0.00025064085,0.00009229747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011505131,0.00031914274,0.0002930713,0.00043666566,0.00026149463,0.0006320858,0.0011963707,0.0003235444,0.0000061405135],"category_scores_gemma":[0.0002574862,0.00031351586,0.000055819484,0.00026986873,0.00030024708,0.0014589056,0.00037632597,0.00038128436,0.000009430338],"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.0000029300684,0.0000072136245,0.0000023804525,0.00001716449,0.0000026700645,9.1774825e-7,0.0005935005,0.0051801633,0.00017680982,0.3869823,0.0000139861195,0.60701996],"study_design_scores_gemma":[0.00009280692,0.00010469325,0.000015131346,0.0000901571,0.0000035076287,0.0000121844805,9.0888484e-8,0.6540137,0.0014941198,0.34133974,0.0025773556,0.0002565478],"about_ca_topic_score_codex":0.000004551025,"about_ca_topic_score_gemma":0.000030277311,"teacher_disagreement_score":0.6488335,"about_ca_system_score_codex":0.00022742507,"about_ca_system_score_gemma":0.00020364842,"threshold_uncertainty_score":0.9999317},"labels":[],"label_agreement":null},{"id":"W1522811422","doi":"10.1007/978-3-642-15784-4_7","title":"Continuous Time and/or Continuous Distributions","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université Laval","funders":"","keywords":"Computer science","score_opus":0.015675202743410943,"score_gpt":0.2635779007240898,"score_spread":0.24790269798067888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522811422","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.00020013656,0.00019298264,0.9937898,0.0005342375,0.0017822774,0.00048346634,0.000028049333,0.00027067855,0.0027183788],"genre_scores_gemma":[0.009295162,0.00003610111,0.988339,0.0005541957,0.00035493687,0.000014446358,0.00001330225,0.000030501385,0.001362333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654084,0.0000565094,0.000572801,0.001448787,0.0007144315,0.0006666342],"domain_scores_gemma":[0.9968775,0.00055107515,0.00036574758,0.0016498866,0.00032158263,0.00023421228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001375936,0.00050954777,0.00061882765,0.00049644837,0.0003983585,0.0007081883,0.002933555,0.0005215633,0.00005110064],"category_scores_gemma":[0.00048079868,0.00042915778,0.00009735891,0.00048026984,0.0014519637,0.00072106253,0.0013899021,0.0012433955,0.00011691337],"study_design_candidate":"design_other","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.000012828693,0.0000484861,0.000034885834,0.000025104613,0.000011430107,0.0000770937,0.00039479625,0.00016874514,0.0017866052,0.084453896,0.000024707644,0.9129614],"study_design_scores_gemma":[0.0010683367,0.00088600925,0.000960967,0.00062744285,0.000041207408,0.0011245243,3.076669e-7,0.67059296,0.017147342,0.2726406,0.032470908,0.0024393925],"about_ca_topic_score_codex":0.00001937675,"about_ca_topic_score_gemma":0.00003405791,"teacher_disagreement_score":0.91052204,"about_ca_system_score_codex":0.00016718554,"about_ca_system_score_gemma":0.00043549004,"threshold_uncertainty_score":0.999816},"labels":[],"label_agreement":null},{"id":"W1523592965","doi":"","title":"Fixpoint Extensions of Temporal Description Logics.","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"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 Waterloo","funders":"","keywords":"Decidability; Computer science; Extension (predicate logic); Description logic; Temporal logic; Modal μ-calculus; Fixed point; Algorithm; Theoretical computer science; Programming language; Mathematics; Multimodal logic; Zeroth-order logic","score_opus":0.07150211411768126,"score_gpt":0.29402734259800223,"score_spread":0.22252522848032097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523592965","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.013266613,0.00003038343,0.9614114,0.000079717414,0.00029482943,0.00007090805,2.1607377e-7,0.00007351395,0.0247724],"genre_scores_gemma":[0.4068741,0.0000026194273,0.5927229,0.000060803693,0.0000032757657,0.000002434856,2.3378206e-7,0.000001434185,0.0003322451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933916,0.00010450969,0.00018195352,0.00014644489,0.00012686323,0.00010107161],"domain_scores_gemma":[0.99936706,0.00002546601,0.000071725255,0.00040874432,0.00009174974,0.00003522706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052847154,0.000051210238,0.00007529497,0.000055335542,0.00003827597,0.000021013635,0.00023599302,0.000035102883,0.000044909382],"category_scores_gemma":[0.0002214747,0.000041761625,0.00003267606,0.0002372694,0.000032866545,0.00035280103,0.000041223753,0.000048248825,0.000033259956],"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":[8.303194e-7,0.000033658653,0.0004293635,0.0000034194773,0.000001464946,5.5589743e-7,0.00007008867,0.000032407126,0.0072162943,0.98698914,0.00047351443,0.0047492394],"study_design_scores_gemma":[0.0006334916,0.00046135345,0.037988674,0.00004002669,0.000011341901,0.000097686956,0.00024691602,0.15784657,0.5470614,0.2179962,0.0370814,0.0005349558],"about_ca_topic_score_codex":0.000013111058,"about_ca_topic_score_gemma":0.00000247394,"teacher_disagreement_score":0.76899296,"about_ca_system_score_codex":0.000017214174,"about_ca_system_score_gemma":0.000027884309,"threshold_uncertainty_score":0.17029896},"labels":[],"label_agreement":null},{"id":"W1525100661","doi":"","title":"The verification of MDG algorithms in the HOL theorem prover","year":2008,"lang":"en","type":"book","venue":"Spectrum Research Repository (Concordia University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Automated theorem proving; Correctness; Computer science; Theoretical computer science; Programming language; Formal verification; Algorithm","score_opus":0.0462385237816129,"score_gpt":0.29443332075537687,"score_spread":0.24819479697376395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525100661","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003229808,0.00047911014,0.018587237,0.0009191105,0.0010354028,0.001954127,0.0000095511305,0.00010909,0.97367656],"genre_scores_gemma":[0.13170975,0.0023156349,0.007063001,0.00004216854,0.00093865715,0.00004686988,0.000024649029,0.00009075734,0.85776854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943779,0.00222784,0.00050342025,0.00073099695,0.0015192721,0.0006405772],"domain_scores_gemma":[0.9953232,0.001227799,0.00045646902,0.002515354,0.00037450303,0.00010270009],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0038220936,0.00026978634,0.0003250928,0.00078128633,0.00097469403,0.00022015737,0.0056709237,0.00033099458,0.0000026557038],"category_scores_gemma":[0.00025986557,0.00019768225,0.00020623546,0.0015081255,0.0014013866,0.0005917649,0.00062673923,0.0017195515,0.00003045984],"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.000116313284,0.00009581115,0.00067928224,0.00006862961,0.000058045152,0.00032100774,0.0013920547,0.000014883642,0.00031029424,0.9794836,0.005564028,0.011896063],"study_design_scores_gemma":[0.0007969391,0.0008129677,0.020416848,0.00017913447,0.000034894067,0.00019147145,0.0008146424,0.007657583,0.008076219,0.025442347,0.93488103,0.00069593627],"about_ca_topic_score_codex":0.0009183441,"about_ca_topic_score_gemma":0.0003113792,"teacher_disagreement_score":0.95404124,"about_ca_system_score_codex":0.0010812216,"about_ca_system_score_gemma":0.0018506137,"threshold_uncertainty_score":0.9997089},"labels":[],"label_agreement":null},{"id":"W1525867457","doi":"10.1109/ccece.1993.332461","title":"Testing the consequences of specifications in modal μ","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Calgary","funders":"","keywords":"Liveness; Computer science; Programming language; Notation; Deadlock; Modal; Process (computing); Modal logic; Operator (biology); Process calculus; Software engineering; Theoretical computer science; Arithmetic; Mathematics","score_opus":0.27583538668848645,"score_gpt":0.31485574967360225,"score_spread":0.0390203629851158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525867457","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.03632174,0.000086877946,0.8322261,0.002459245,0.00012955243,0.00014782096,4.7711876e-7,0.00006941378,0.1285588],"genre_scores_gemma":[0.53783804,0.0000025293782,0.46204627,0.000032697015,0.0000052611026,0.0000048222237,2.6940542e-8,6.513752e-7,0.00006968518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995119,0.00006484445,0.00015714004,0.00009634198,0.00009586477,0.00007388229],"domain_scores_gemma":[0.9993392,0.000217204,0.00005739127,0.00033196202,0.000043313226,0.0000108865015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035651436,0.00003061548,0.000042016432,0.000041465224,0.000037897727,0.000022113783,0.00054188,0.000013743355,0.000031409505],"category_scores_gemma":[0.0002992109,0.00002025007,0.000010072688,0.00053275505,0.00011171533,0.00019195692,0.000041161187,0.00004926669,0.00002449133],"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":[1.8619315e-7,0.000024776886,0.002269844,0.0000021536348,8.5228544e-7,3.468572e-7,0.0005916279,0.00021776653,0.012701672,0.94030505,0.00009712441,0.04378859],"study_design_scores_gemma":[0.00009215298,0.000035061115,0.09940664,0.000013631909,0.000001140009,0.000017201493,0.00016986718,0.8351229,0.03744213,0.026871448,0.00073227624,0.00009554983],"about_ca_topic_score_codex":0.000049947543,"about_ca_topic_score_gemma":0.0000034991342,"teacher_disagreement_score":0.9134336,"about_ca_system_score_codex":0.000010893385,"about_ca_system_score_gemma":0.000009592384,"threshold_uncertainty_score":0.10069569},"labels":[],"label_agreement":null},{"id":"W1526447489","doi":"10.1007/978-3-540-31980-1_6","title":"Empirically Efficient Verification for a Class of Infinite-State Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"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":"Petri net; Computer science; Parameterized complexity; Reachability; Decidability; Theoretical computer science; Model checking; Stochastic Petri net; Reduction (mathematics); Class (philosophy); Algorithm; Mathematics; Artificial intelligence","score_opus":0.034895877075869025,"score_gpt":0.29580465922407373,"score_spread":0.2609087821482047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526447489","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.00017309605,0.00037851982,0.99446326,0.00025531568,0.002110573,0.0011047331,0.000023527531,0.00012487477,0.001366104],"genre_scores_gemma":[0.064723514,0.0000318898,0.93434924,0.00029133196,0.0002823752,0.00005734883,0.000009981253,0.000035296005,0.00021899963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995971,0.00007043902,0.0010362242,0.0013226216,0.0010344776,0.00056523585],"domain_scores_gemma":[0.9957557,0.0007378,0.00085208693,0.001790925,0.0007234411,0.0001400544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022632945,0.00044468773,0.00060686376,0.000943384,0.00016619169,0.0003087383,0.0032059245,0.00031770932,0.0000035617247],"category_scores_gemma":[0.0003520625,0.00041951006,0.00016143463,0.00075869943,0.00060528057,0.00038284183,0.0005402089,0.00046398735,0.000019198447],"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.000017858478,0.00004768204,0.000010369365,0.00014198555,0.000010124603,0.0000024522349,0.00077349704,0.47365564,0.00051921094,0.09845073,0.000013586852,0.42635685],"study_design_scores_gemma":[0.00025681686,0.00023420856,0.00009766679,0.00029295092,0.000008382479,0.000016911938,1.8826907e-7,0.9764835,0.0028856108,0.013246891,0.006038455,0.00043839967],"about_ca_topic_score_codex":0.0000123366335,"about_ca_topic_score_gemma":0.000007774302,"teacher_disagreement_score":0.5028279,"about_ca_system_score_codex":0.00042968598,"about_ca_system_score_gemma":0.00061519555,"threshold_uncertainty_score":0.99982566},"labels":[],"label_agreement":null},{"id":"W1528299167","doi":"10.1007/11495628_13","title":"From MSC to SDL: Overview and an Application to the Autonomous Shuttle Transport System","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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":"Computer science; Systems engineering; Software engineering; Architecture; Programming language; Engineering","score_opus":0.025273967804745532,"score_gpt":0.2879351611787726,"score_spread":0.26266119337402705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528299167","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.00034211492,0.0004512247,0.9946006,0.0015413968,0.001017742,0.0010287397,0.000018389177,0.00022834797,0.0007714697],"genre_scores_gemma":[0.08506737,0.000019298279,0.91140544,0.002429893,0.00089537876,0.00006756687,0.000008201224,0.000029884524,0.00007694637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996643,0.00006384341,0.00051718915,0.0016089706,0.0007323128,0.00043469603],"domain_scores_gemma":[0.997008,0.00018006546,0.00019581537,0.0021863962,0.00015179651,0.0002779139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013853885,0.0004059139,0.00040786449,0.0003694616,0.00026506258,0.00037807538,0.003675182,0.00022127372,0.0000056604704],"category_scores_gemma":[0.00003118961,0.00032274096,0.00006208945,0.0006216414,0.00019503586,0.00060404657,0.00058440224,0.00042105123,0.0000947434],"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.000004431754,0.000011520314,0.000012755118,0.000027675442,0.0000042780334,0.000004287071,0.0022719838,0.026131893,0.0001523177,0.051758427,0.0000076946835,0.91961277],"study_design_scores_gemma":[0.00014178756,0.00022637985,0.0014726885,0.00040528557,0.0000175557,0.000047302983,0.0000014943658,0.94755894,0.0013873479,0.017177397,0.030783704,0.000780115],"about_ca_topic_score_codex":0.00016779486,"about_ca_topic_score_gemma":0.00027830954,"teacher_disagreement_score":0.9214271,"about_ca_system_score_codex":0.00038831262,"about_ca_system_score_gemma":0.00022188741,"threshold_uncertainty_score":0.99992245},"labels":[],"label_agreement":null},{"id":"W1529376368","doi":"10.1007/978-3-642-00867-2_2","title":"Reasoning about System-Degradation and Fault-Recovery with Deontic Logic","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Deontic logic; Computer science; Formalism (music); Obligation; Fault tolerance; Duty; Artificial intelligence; Theoretical computer science; Epistemology; Distributed computing; Philosophy; Law; Political science","score_opus":0.016032991446587878,"score_gpt":0.25047559151703247,"score_spread":0.2344426000704446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529376368","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.0002402041,0.0007143015,0.993204,0.00017300421,0.0008273952,0.0004354923,0.000001891503,0.0002454654,0.0041582594],"genre_scores_gemma":[0.032400858,0.000056326146,0.9665911,0.0004889082,0.00018088183,0.000009056394,0.000004318526,0.000022786046,0.0002457738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966384,0.0000735058,0.00047153205,0.001420594,0.0008682748,0.00052768725],"domain_scores_gemma":[0.9976903,0.00025217087,0.00044211058,0.0012194891,0.00024759345,0.00014830212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013214325,0.0004798538,0.00048460235,0.00067697605,0.00030852453,0.00075951475,0.0018100914,0.00029190094,0.0000020662642],"category_scores_gemma":[0.00013329132,0.0003945917,0.00005691699,0.0005975092,0.0004609602,0.001163902,0.0004163818,0.0006104058,0.000013448901],"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.000010096642,0.000009350486,0.00003038817,0.000073949035,0.000006923282,0.000052689003,0.00022639381,0.01220723,0.000049004753,0.12995382,0.0000029220855,0.85737723],"study_design_scores_gemma":[0.00031800204,0.00056841184,0.0011624618,0.0018494551,0.0000207298,0.00068290264,6.6874196e-7,0.94445753,0.00074481743,0.04892191,0.00039208969,0.00088101206],"about_ca_topic_score_codex":0.000027108581,"about_ca_topic_score_gemma":0.00004165432,"teacher_disagreement_score":0.9322503,"about_ca_system_score_codex":0.0004477688,"about_ca_system_score_gemma":0.0003268207,"threshold_uncertainty_score":0.9998506},"labels":[],"label_agreement":null},{"id":"W1529722424","doi":"10.1007/11944836_23","title":"Testing Probabilistic Equivalence Through Reinforcement Learning","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Equivalence (formal languages); Markov decision process; Probabilistic logic; Computer science; Reinforcement learning; Bisimulation; TRACE (psycholinguistics); Markov process; Witness; Theoretical computer science; Algorithm; Artificial intelligence; Discrete mathematics; Mathematics; Programming language; Statistics","score_opus":0.05150164505242391,"score_gpt":0.29251151544253967,"score_spread":0.24100987039011576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529722424","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.000033087435,0.00021027889,0.966844,0.00012588488,0.0013679108,0.000568516,7.57482e-7,0.00037898042,0.030470552],"genre_scores_gemma":[0.051775273,0.000011130336,0.9466326,0.00038110945,0.0003707898,0.000022720105,0.000004976609,0.00003723176,0.00076414726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99497885,0.000081266146,0.0008589076,0.0017787387,0.0014062001,0.00089605636],"domain_scores_gemma":[0.99636334,0.00080792693,0.00063818,0.0016246648,0.00045079985,0.00011506842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018480555,0.0006046484,0.0005121117,0.00047774913,0.00047811083,0.0006329402,0.0038808193,0.00031177443,0.0000139664235],"category_scores_gemma":[0.0010296719,0.00058249384,0.00010780587,0.0010639419,0.000864517,0.0012846487,0.0017817039,0.0012393901,0.00006506101],"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.0000022342376,0.000012510045,0.00004352254,0.000079437705,0.0000035065007,0.00002622502,0.0003437227,0.652309,0.00018760403,0.06937807,0.000010892572,0.2776033],"study_design_scores_gemma":[0.00012918672,0.00024040914,0.000130126,0.0005427476,0.0000069110047,0.000059856608,9.755498e-8,0.84136385,0.00097608496,0.1546771,0.001246929,0.0006267423],"about_ca_topic_score_codex":0.00006424536,"about_ca_topic_score_gemma":0.0000075911826,"teacher_disagreement_score":0.27697656,"about_ca_system_score_codex":0.0006712433,"about_ca_system_score_gemma":0.000581486,"threshold_uncertainty_score":0.99966264},"labels":[],"label_agreement":null},{"id":"W153160029","doi":"10.1007/978-3-319-06880-0_17","title":"Bisimulation for Markov Decision Processes through Families of Functional Expressions","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Equivalence (formal languages); Markov process; Markov kernel; Markov chain; Markov decision process; Discrete mathematics; Bisimulation; Metric space; State space; Markov renewal process; Bounded function; Markov model; Markov property; Variable-order Markov model; Statistics","score_opus":0.041209375807544364,"score_gpt":0.306091537224758,"score_spread":0.26488216141721366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153160029","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.00010841062,0.00022895525,0.99601704,0.000112226066,0.0018391458,0.00056989293,0.000010223989,0.00009648525,0.0010176225],"genre_scores_gemma":[0.052640717,0.00005088896,0.9466215,0.00025238024,0.00027263255,0.0000297715,0.000011013021,0.000022684333,0.000098441626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687153,0.000037458278,0.00067165744,0.0010934914,0.00096721377,0.00035863993],"domain_scores_gemma":[0.99529177,0.002115012,0.00053295365,0.0011377902,0.00085421663,0.000068257934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011238146,0.00035908862,0.00044379995,0.00059777644,0.0002640231,0.00017320011,0.0019457357,0.0003015451,0.000011001707],"category_scores_gemma":[0.0011318775,0.00030907808,0.00011596781,0.0006682525,0.0005069786,0.00084178196,0.00062079163,0.00029714475,0.0000065313857],"study_design_candidate":"design_other","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.00003772157,0.000027697017,0.00003295041,0.00021063909,0.00000719386,7.717717e-7,0.0005811911,0.1347706,0.00057168707,0.071546465,0.00004047376,0.7921726],"study_design_scores_gemma":[0.00030140873,0.000202613,0.0002737833,0.0006842541,0.000008580082,0.000009705685,2.5310086e-7,0.6441487,0.007673176,0.34259206,0.0037149428,0.00039050195],"about_ca_topic_score_codex":0.0000065477075,"about_ca_topic_score_gemma":0.0000131701145,"teacher_disagreement_score":0.7917821,"about_ca_system_score_codex":0.00013157944,"about_ca_system_score_gemma":0.000513587,"threshold_uncertainty_score":0.9999361},"labels":[],"label_agreement":null},{"id":"W1534650838","doi":"10.1007/978-3-540-39979-7_24","title":"Progressive Solutions to a Parallel Automata Equation","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Ottawa","funders":"","keywords":"Computer science; Automaton; Component (thermodynamics); Block (permutation group theory); Cellular automaton; Relation (database); Theoretical computer science; Action (physics); Algorithm; Parallel computing; Mathematics; Data mining; Combinatorics","score_opus":0.05603601345491594,"score_gpt":0.3063964163933527,"score_spread":0.25036040293843675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534650838","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.000009919175,0.0002597545,0.9910509,0.0015740566,0.0019891926,0.0008919068,0.000004507999,0.0002898015,0.0039299675],"genre_scores_gemma":[0.003038426,0.000011525994,0.99453574,0.0018456473,0.0001905485,0.00006482173,0.000005434208,0.000028239765,0.00027962608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580693,0.00009500014,0.000585,0.0015663442,0.0011433115,0.00080338883],"domain_scores_gemma":[0.9967643,0.0002490848,0.00035782126,0.0020089343,0.00037606174,0.00024380104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017754593,0.00046933434,0.00040855625,0.0009623906,0.0004041225,0.00059338275,0.0034481266,0.00031519058,0.000017889084],"category_scores_gemma":[0.00044191635,0.00045532253,0.00010495418,0.0010779742,0.0004471003,0.0009322529,0.0012104538,0.0006087795,0.00017220221],"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.000004951591,0.000040495073,0.0000054236466,0.000024757135,0.000008140202,0.000033841676,0.0007944401,0.051733825,0.00007526775,0.3206037,0.0001114266,0.6265637],"study_design_scores_gemma":[0.00019461832,0.0002224514,0.00009781416,0.0002611062,0.0000068791346,0.00009668147,1.3139513e-7,0.78635806,0.0005614111,0.20799175,0.003572622,0.0006364689],"about_ca_topic_score_codex":0.00000778077,"about_ca_topic_score_gemma":0.000009942813,"teacher_disagreement_score":0.73462427,"about_ca_system_score_codex":0.00053886656,"about_ca_system_score_gemma":0.0005429856,"threshold_uncertainty_score":0.99978983},"labels":[],"label_agreement":null},{"id":"W1534974138","doi":"10.1007/3-540-36135-9_2","title":"Submodule Construction for Specifications with Input Assumptions and Output Guarantees","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interleaving; Rotation formalisms in three dimensions; Automaton; Generalization; Computer science; Context (archaeology); Semantics (computer science); Theoretical computer science; Finite-state machine; State (computer science); Algorithm; Programming language; Mathematics","score_opus":0.052883206613385574,"score_gpt":0.26480055956822535,"score_spread":0.21191735295483977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534974138","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.00009356815,0.0002435971,0.99494326,0.00069635676,0.0009472875,0.0007476908,0.000016312073,0.0001675165,0.0021444373],"genre_scores_gemma":[0.015736857,0.000111018664,0.98319083,0.00021571154,0.00026446246,0.000048623893,0.0000073240026,0.000027402753,0.00039777145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972454,0.000033844757,0.00044459203,0.0012837263,0.0005535914,0.00043885643],"domain_scores_gemma":[0.99761313,0.0003523127,0.00033100782,0.0012185884,0.00036569402,0.0001192672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006879442,0.00039044218,0.00037614774,0.0007411894,0.00043573836,0.00051084836,0.0014179455,0.0002434228,0.000008446285],"category_scores_gemma":[0.00010885129,0.00034841138,0.00006818209,0.00048414065,0.0012111292,0.0008410668,0.0003060526,0.00044613748,0.00001566631],"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.000008461741,0.000027922673,0.00010030185,0.00004987637,0.00001374971,0.000004186037,0.000578278,0.00497396,0.00005688943,0.35973662,0.000024934803,0.6344248],"study_design_scores_gemma":[0.00047398225,0.00033793383,0.0010342303,0.0002952816,0.000023678775,0.0002855426,7.176513e-7,0.8188652,0.001317831,0.1704902,0.0060821823,0.0007932169],"about_ca_topic_score_codex":0.0000050795875,"about_ca_topic_score_gemma":0.000027875,"teacher_disagreement_score":0.81389123,"about_ca_system_score_codex":0.00020170871,"about_ca_system_score_gemma":0.00017746845,"threshold_uncertainty_score":0.99989676},"labels":[],"label_agreement":null},{"id":"W1536697195","doi":"10.1109/hicss.2000.926972","title":"On verifying distributed multithreaded Java programs","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"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 Windsor","funders":"","keywords":"Computer science; Concurrency; Programming language; Java; Java concurrency; Java Modeling Language; Thread (computing); Distributed computing; Real time Java; Software engineering; strictfp","score_opus":0.047797607871583304,"score_gpt":0.30742584456506045,"score_spread":0.2596282366934771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536697195","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.012730099,0.000011475723,0.9797531,0.0005369616,0.00020073364,0.00017544723,8.383748e-7,0.0004885196,0.0061028395],"genre_scores_gemma":[0.3509857,0.0000013936918,0.64857835,0.00020196765,0.000036888694,0.000018535073,0.0000057738775,0.00000408054,0.00016731139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990961,0.000049323284,0.00016307076,0.00026316856,0.00020654369,0.00022181308],"domain_scores_gemma":[0.9992739,0.000038634123,0.000052095216,0.0005231101,0.00004506631,0.00006718676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002748175,0.00009471556,0.00008100174,0.00004383226,0.00008208156,0.00011748691,0.00056880986,0.000050625218,0.000022802184],"category_scores_gemma":[0.00008923611,0.00007905696,0.00003519359,0.0002921026,0.00002814882,0.00047345724,0.00008704495,0.00010606129,0.00036619362],"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.0000054788325,0.00011248951,0.00010620607,0.000003929696,0.000004405507,0.0000010460674,0.0001724419,0.0002678402,0.0004456083,0.39529213,0.00041065845,0.6031778],"study_design_scores_gemma":[0.0006112574,0.0002354112,0.0044135833,0.000029840881,0.0000036927772,0.000012260938,0.000031282412,0.89444983,0.05156229,0.003163972,0.04512346,0.00036311318],"about_ca_topic_score_codex":0.000010247126,"about_ca_topic_score_gemma":0.000004282449,"teacher_disagreement_score":0.89418197,"about_ca_system_score_codex":0.00007016773,"about_ca_system_score_gemma":0.00001589936,"threshold_uncertainty_score":0.47068003},"labels":[],"label_agreement":null},{"id":"W1537351342","doi":"10.1007/3-540-47884-1_6","title":"Assume-Guarantee Algorithms for Automatic Detection of Software Failures","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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; Formalism (music); Finite-state machine; Software; Key (lock); State (computer science); Algorithm; Detector; Programming language; Operating system","score_opus":0.03209195549356824,"score_gpt":0.2801008445614702,"score_spread":0.24800888906790197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537351342","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.00004677924,0.0003360974,0.996134,0.00012552833,0.0021116023,0.0007799856,0.000010780319,0.00025408814,0.00020117137],"genre_scores_gemma":[0.017138086,0.000027787592,0.9822213,0.00016206459,0.00022915035,0.00003856638,0.0000029182643,0.000034718636,0.00014540828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964911,0.000054308333,0.0007662128,0.0012041198,0.00094236265,0.0005419405],"domain_scores_gemma":[0.9966561,0.0007170127,0.00063235406,0.0014714628,0.00044214164,0.000080929654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013304612,0.0004648411,0.0006014429,0.00094003265,0.00022436414,0.00025119272,0.002935631,0.00039285305,0.000011458692],"category_scores_gemma":[0.0005043297,0.0004400312,0.00020478545,0.0006497136,0.0005669896,0.0007833064,0.0005260183,0.00049985066,0.000016902864],"study_design_candidate":"design_other","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.000003007594,0.000022129603,0.0000039293063,0.0001288143,0.000010859142,0.0000038097107,0.00039073307,0.005839976,0.00035385444,0.008164967,0.000005759038,0.98507214],"study_design_scores_gemma":[0.00022443087,0.00030156746,0.00006898523,0.00029840268,0.000012568837,0.0000431455,1.2621439e-7,0.88666844,0.01652604,0.09453348,0.000888212,0.000434594],"about_ca_topic_score_codex":0.000015687103,"about_ca_topic_score_gemma":0.00001677036,"teacher_disagreement_score":0.98463756,"about_ca_system_score_codex":0.00027353395,"about_ca_system_score_gemma":0.00019954739,"threshold_uncertainty_score":0.99980515},"labels":[],"label_agreement":null},{"id":"W1537678260","doi":"10.1007/978-3-540-73368-3_2","title":"A Mathematical Approach to RTL Verification","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Verilog; Programming language; Formal verification; Floating point; High-level verification; Simple (philosophy); Functional verification; Microprocessor; Embedded system; Field-programmable gate array; Software; Software development","score_opus":0.05664458941576381,"score_gpt":0.3078611762955581,"score_spread":0.2512165868797943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537678260","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.000014792566,0.000073357005,0.94772506,0.00021543563,0.00095600466,0.0006722034,0.0000018873596,0.00022929022,0.05011196],"genre_scores_gemma":[0.006291158,0.0000066811817,0.9918221,0.001163322,0.00030819094,0.000025022344,0.0000040715404,0.000033989178,0.00034546445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551743,0.000047924248,0.00069936813,0.0016956781,0.0013343719,0.00070525083],"domain_scores_gemma":[0.9965249,0.0002963763,0.00027447048,0.0023321086,0.00028581696,0.00028634805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029292034,0.00048306974,0.00048437135,0.0011822477,0.00020251868,0.00048094863,0.004309794,0.00040250155,0.0000135623495],"category_scores_gemma":[0.00032770375,0.00045363302,0.00011177573,0.0011486553,0.00046765502,0.00062185415,0.0010421509,0.00075908937,0.0002893563],"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.0000046628143,0.000045735345,0.0000022839238,0.00004495699,0.0000040085115,0.0000064003248,0.0008598562,0.005784736,0.00012822874,0.4760549,0.000013822247,0.5170504],"study_design_scores_gemma":[0.00013194766,0.00013347913,0.00011767712,0.00019990992,0.0000064004303,0.00009928407,2.5921003e-7,0.7550907,0.0025509892,0.23795338,0.0030100183,0.00070595444],"about_ca_topic_score_codex":0.0000042792417,"about_ca_topic_score_gemma":0.000002533661,"teacher_disagreement_score":0.74930596,"about_ca_system_score_codex":0.00047450475,"about_ca_system_score_gemma":0.0003158825,"threshold_uncertainty_score":0.99979156},"labels":[],"label_agreement":null},{"id":"W1539057350","doi":"10.1007/11734673_5","title":"Static Analysis of Programs Using Omega Algebra with Tests","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Omega; Computer science; Algebra over a field; Programming language; Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.031593445004416645,"score_gpt":0.2886487115809467,"score_spread":0.25705526657653005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539057350","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.0019437914,0.00009833863,0.9962096,0.000055279583,0.00033526972,0.00042037034,0.0000046484406,0.00010698139,0.0008257155],"genre_scores_gemma":[0.12696967,0.0000034707832,0.87273586,0.00014466477,0.0000588041,0.0000062630224,0.0000095843525,0.000022390295,0.00004929079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614006,0.0000615911,0.0006899049,0.0012696708,0.001287537,0.0005512118],"domain_scores_gemma":[0.99674124,0.00029161444,0.0007178318,0.0017067603,0.00043181368,0.0001107243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011176874,0.00045677775,0.00077480875,0.002074403,0.00014090742,0.0003427693,0.0026909425,0.000212937,0.000004605326],"category_scores_gemma":[0.00006412393,0.00037853347,0.00015743088,0.0038769299,0.0009807544,0.0006946862,0.0005722538,0.0004562212,0.000002933283],"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.000008600041,0.00007730455,0.001119909,0.00008354368,0.00014385628,0.00003705404,0.0006161038,0.42778873,0.00021478605,0.024648398,0.0000023065907,0.5452594],"study_design_scores_gemma":[0.00013558728,0.0002445049,0.0013474852,0.00026109838,0.00014747797,0.0000238514,1.3799503e-7,0.9767974,0.001017578,0.01946774,0.00008689584,0.00047024092],"about_ca_topic_score_codex":0.00010413342,"about_ca_topic_score_gemma":0.000116372146,"teacher_disagreement_score":0.54900867,"about_ca_system_score_codex":0.00029765686,"about_ca_system_score_gemma":0.00049580995,"threshold_uncertainty_score":0.99986666},"labels":[],"label_agreement":null},{"id":"W1540519426","doi":"10.1142/p595","title":"Labelled Markov Processes","year":2009,"lang":"en","type":"book","venue":"IMPERIAL COLLEGE PRESS eBooks","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":219,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Markov chain; Computer science; Machine learning","score_opus":0.032026702392919555,"score_gpt":0.2804898023067568,"score_spread":0.24846309991383725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540519426","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010829216,0.0008070538,0.021871172,0.000030380646,0.0018394794,0.0013605945,0.00008942215,0.0006336717,0.9733574],"genre_scores_gemma":[0.00007384783,0.0000762039,0.1897082,0.00021858551,0.0010324903,0.00019321234,0.000019848152,0.000062253195,0.8086154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968214,0.00023852434,0.00070540607,0.0009596075,0.00072001386,0.0005550541],"domain_scores_gemma":[0.9970579,0.0001998913,0.0005148534,0.0015873889,0.0004456813,0.00019426241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006001206,0.00058961444,0.0006904303,0.0001974383,0.00025636895,0.00038262832,0.0027972388,0.0006512194,0.000022239945],"category_scores_gemma":[0.00033266863,0.0005830807,0.00015663532,0.00007450342,0.00014291379,0.00035989715,0.00061125436,0.00052620034,0.000041716885],"study_design_candidate":"not_applicable","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.00020010494,0.000057579553,8.638487e-8,0.0005413222,0.000091864444,0.00007790905,0.0008766385,0.0000053064127,0.0004474083,0.7969109,0.15708749,0.043703403],"study_design_scores_gemma":[0.00075299817,0.00025209264,0.0000013158171,0.00021370822,0.00004672477,0.000046125188,0.0000019364563,0.00090480444,0.008014912,0.025373114,0.963615,0.0007772888],"about_ca_topic_score_codex":0.000015098679,"about_ca_topic_score_gemma":0.0000076135675,"teacher_disagreement_score":0.8065275,"about_ca_system_score_codex":0.00023797479,"about_ca_system_score_gemma":0.0017626897,"threshold_uncertainty_score":0.99966204},"labels":[],"label_agreement":null},{"id":"W1540904030","doi":"","title":"Automated Paraconsistent Reasoning via Model Checking","year":2001,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"","keywords":"Automated reasoning; Computer science; Non-monotonic logic; Model checking; Model-based reasoning; Theoretical computer science; Paraconsistent logic; Programming language; Reasoning system; Classical logic; Artificial intelligence; Set (abstract data type); Description logic; Knowledge representation and reasoning; Higher-order logic","score_opus":0.04547087629871166,"score_gpt":0.3166182140818012,"score_spread":0.2711473377830895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540904030","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.0111686345,0.000017400102,0.9563894,0.00015990707,0.00014828208,0.00007482207,8.204119e-8,0.0015501931,0.030491268],"genre_scores_gemma":[0.33503595,0.0000067323444,0.66434973,0.00020155752,0.00001123321,0.000007828668,4.918177e-7,0.0000042732804,0.0003821748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991099,0.000049600505,0.00018918731,0.000250937,0.00018056172,0.00021981251],"domain_scores_gemma":[0.9992801,0.000021847904,0.00007127331,0.00050285435,0.00006129949,0.00006260273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038630725,0.00008613956,0.00008971373,0.00006184509,0.00010129908,0.00009318365,0.00047823388,0.00004665715,0.000009578158],"category_scores_gemma":[0.00006740292,0.000078228135,0.000036720918,0.00032015497,0.000019525396,0.00057134934,0.00012879066,0.000075179596,0.00007828348],"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.000009881332,0.00009856678,0.001374566,0.0000133470485,0.000024118935,0.000021429722,0.0008274953,0.08683763,0.010735663,0.6835432,0.0007862867,0.21572784],"study_design_scores_gemma":[0.000076718316,0.000011200127,0.0009419466,0.000009365851,0.0000021724586,0.000050808198,0.000009530295,0.9930666,0.0034638427,0.0019266241,0.00033232893,0.00010887231],"about_ca_topic_score_codex":0.000022307271,"about_ca_topic_score_gemma":0.0000020924342,"teacher_disagreement_score":0.90622896,"about_ca_system_score_codex":0.000051182236,"about_ca_system_score_gemma":0.000029721354,"threshold_uncertainty_score":0.31900507},"labels":[],"label_agreement":null},{"id":"W1542164216","doi":"10.1007/978-3-540-88479-8_57","title":"High Level Analysis, Design and Validation of Distributed Mobile Systems with CoreASM","year":2008,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Scope (computer science); Computer science; Formalism (music); Key (lock); Systems engineering; Engineering design process; Distributed computing; Systems design; Process (computing); Complex system; Software engineering; Artificial intelligence; Computer security; Engineering; Programming language","score_opus":0.08772538851800345,"score_gpt":0.3042700937711864,"score_spread":0.21654470525318298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542164216","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.00035249811,0.00033667262,0.9961605,0.000041579475,0.00009840302,0.00061255833,0.000048641385,0.000051104038,0.002298011],"genre_scores_gemma":[0.15353695,0.002546596,0.8435422,0.000036919893,0.000008722654,0.00006166892,0.00017028766,0.0000059634112,0.00009067717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981042,0.00010043972,0.00080278865,0.00029127134,0.0005322075,0.00016905088],"domain_scores_gemma":[0.9961616,0.00027713404,0.0007621872,0.001987062,0.00072489295,0.00008714182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00153394,0.00021100718,0.00039287462,0.0012866379,0.00033311875,0.00032823253,0.0019647332,0.00012117288,0.0000012810116],"category_scores_gemma":[0.00003940573,0.0001905504,0.000033875353,0.001215801,0.0011058437,0.005013041,0.00090197753,0.00024449435,0.0000037521409],"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.000016171405,0.00004355555,0.0002344527,0.00009249654,0.000092049995,5.722721e-7,0.0028732298,0.10043542,0.000009511605,0.82782835,0.00010752283,0.06826664],"study_design_scores_gemma":[0.00028287029,0.00015104855,0.0039866543,0.00013589746,0.000042612257,0.000044246037,0.000020146159,0.9900772,0.00014741196,0.000718377,0.0041047563,0.00028876442],"about_ca_topic_score_codex":0.00004635036,"about_ca_topic_score_gemma":0.0000016396086,"teacher_disagreement_score":0.8896418,"about_ca_system_score_codex":0.0001149605,"about_ca_system_score_gemma":0.0002446362,"threshold_uncertainty_score":0.77704203},"labels":[],"label_agreement":null},{"id":"W1544975162","doi":"10.1007/978-3-540-74984-4_14","title":"Formal Verification of Use Case Maps with Real Time Extensions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"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":"Computer science; Programming language; Formal verification; Real-time computing","score_opus":0.042013842973843696,"score_gpt":0.2870835550058629,"score_spread":0.24506971203201922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544975162","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.0009457113,0.000047534966,0.9948824,0.00006694655,0.0005589633,0.00045890233,0.000012170418,0.00014354089,0.0028838126],"genre_scores_gemma":[0.023160385,0.000030836858,0.9761931,0.00020183783,0.00012533645,0.0000062385957,0.000010830878,0.000030291252,0.00024117547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653107,0.00005562473,0.0006811197,0.001146924,0.0009755273,0.0006097269],"domain_scores_gemma":[0.99610114,0.00051520026,0.00058052613,0.0020290108,0.0006025949,0.00017151222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018341896,0.00042913822,0.00046990984,0.0009660979,0.00025765333,0.00024350882,0.0018420127,0.00033396768,0.000011396517],"category_scores_gemma":[0.0001507273,0.00036678585,0.00009068465,0.00087384053,0.0009194057,0.0018681684,0.0006676246,0.00058877235,0.000032049447],"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.000053606294,0.00006659403,0.000041890908,0.00006262424,0.0000177951,0.00085003494,0.0010554165,0.013342549,0.0014657199,0.13408434,0.000017265158,0.84894216],"study_design_scores_gemma":[0.0005669052,0.00084810215,0.000911525,0.0006181275,0.000035435496,0.005010908,7.668932e-7,0.9546574,0.010697578,0.023879787,0.0015308224,0.0012426577],"about_ca_topic_score_codex":0.00007326341,"about_ca_topic_score_gemma":0.00004825002,"teacher_disagreement_score":0.9413148,"about_ca_system_score_codex":0.00024760966,"about_ca_system_score_gemma":0.00042875126,"threshold_uncertainty_score":0.9998784},"labels":[],"label_agreement":null},{"id":"W1545603837","doi":"10.1007/978-3-540-73210-5_15","title":"Finding State Solutions to Temporal Logic Queries","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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; Generality; State (computer science); Temporal logic; Linear temporal logic; Theoretical computer science; State space; Black box; Algorithm; Artificial intelligence; Mathematics","score_opus":0.08577738197006582,"score_gpt":0.3293216682192162,"score_spread":0.2435442862491504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545603837","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.000049973183,0.00017584996,0.9911056,0.0006487229,0.0026455414,0.00047988724,0.0000069773387,0.0002759111,0.0046115317],"genre_scores_gemma":[0.01237732,0.000015726368,0.98491323,0.0018564485,0.00025387714,0.000011753262,0.0000038672897,0.000027904012,0.00053989387],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957645,0.000057640984,0.0006546634,0.001474013,0.0010454403,0.0010037737],"domain_scores_gemma":[0.99720025,0.00035712204,0.00031084416,0.0015684877,0.00029424726,0.0002690758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028391404,0.00049630756,0.00045014045,0.0014464053,0.00048771582,0.00058603584,0.0035901135,0.00027495078,0.000017950106],"category_scores_gemma":[0.0003038535,0.00047420067,0.000112487396,0.0012144279,0.0006782108,0.0009053511,0.0018640782,0.000808934,0.00014246357],"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.000007820202,0.000021285057,0.000060265054,0.000028342314,0.000007008121,0.000057860045,0.0014775452,0.030691486,0.00016780905,0.25154924,0.000037409915,0.7158939],"study_design_scores_gemma":[0.00022034722,0.0004563081,0.000673464,0.00047891066,0.000007875078,0.00013006642,6.0702683e-7,0.41704404,0.00373978,0.5642015,0.011529343,0.0015177793],"about_ca_topic_score_codex":0.000046464724,"about_ca_topic_score_gemma":0.00017008136,"teacher_disagreement_score":0.71437615,"about_ca_system_score_codex":0.00059614395,"about_ca_system_score_gemma":0.000511613,"threshold_uncertainty_score":0.99977094},"labels":[],"label_agreement":null},{"id":"W1546033115","doi":"10.1007/978-3-540-74984-4_13","title":"Consistency of UML/SPT Models","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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":"Consistency (knowledge bases); Unified Modeling Language; Computer science; Applications of UML; Programming language; Software engineering; Artificial intelligence","score_opus":0.06231878821109783,"score_gpt":0.3036934811703212,"score_spread":0.24137469295922337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546033115","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.000026230899,0.0005007665,0.9633842,0.00012921421,0.0017550368,0.0003406121,0.0000042073057,0.00012358665,0.033736125],"genre_scores_gemma":[0.041619584,0.000039132086,0.9573766,0.0005403332,0.00017754249,0.0000041950125,0.0000019941463,0.00002522594,0.00021536596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593824,0.000046549907,0.00087012333,0.0012839058,0.0012562532,0.0006049003],"domain_scores_gemma":[0.9962929,0.0004117472,0.00056994095,0.002068362,0.0004999427,0.00015711144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002336385,0.00045251567,0.000605159,0.0011384751,0.00014957364,0.00016563635,0.0040222816,0.00040910134,0.000015530792],"category_scores_gemma":[0.00016418446,0.00043034364,0.00016057972,0.00083236716,0.0012433374,0.0009326343,0.001145073,0.00072060345,0.0000237907],"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.0000041376375,0.00001866695,0.000008873767,0.000040961288,0.0000057961947,0.000016651002,0.00044236454,0.01858465,0.00012260015,0.44318566,0.0000042902307,0.53756535],"study_design_scores_gemma":[0.00012361408,0.000118901524,0.00004327932,0.00023174591,0.0000055248697,0.000048155507,1.1122436e-7,0.66165423,0.00491243,0.33211425,0.0003597364,0.00038803683],"about_ca_topic_score_codex":0.00002097348,"about_ca_topic_score_gemma":0.000018651506,"teacher_disagreement_score":0.64306957,"about_ca_system_score_codex":0.00024650522,"about_ca_system_score_gemma":0.00059963914,"threshold_uncertainty_score":0.9998148},"labels":[],"label_agreement":null},{"id":"W1546692412","doi":"10.1007/978-3-642-16901-4_38","title":"Comparison of Model Checking Tools for Information Systems","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Model checking; Computer science; Temporal logic; Programming language; Information system; Formal verification; Theoretical computer science","score_opus":0.07874912144205573,"score_gpt":0.340206260501616,"score_spread":0.26145713905956025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546692412","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.00006495388,0.000116833464,0.9939089,0.00005842419,0.0025443481,0.0008692523,0.000014079925,0.00010570068,0.0023175532],"genre_scores_gemma":[0.12608203,0.0000059985687,0.873558,0.00012693596,0.00014039486,0.00002990735,0.000011466811,0.000014547795,0.00003074915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970353,0.000023179515,0.0010013852,0.0006317803,0.0008807342,0.00042760858],"domain_scores_gemma":[0.99646705,0.0005267748,0.00094398536,0.0013154821,0.0006539691,0.000092720715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018793824,0.00035155367,0.00061049295,0.0007721474,0.00019649109,0.00075173395,0.0030296291,0.0004649386,0.0000010584263],"category_scores_gemma":[0.00046133343,0.00033549144,0.00012022828,0.00038222226,0.00041311278,0.0030145126,0.00060400105,0.0006975587,0.000007670878],"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.000005896978,0.000013204702,0.000011055621,0.00015842999,0.0000045228417,2.2967293e-7,0.0012159387,0.29995576,0.00076511083,0.24280801,0.0000036701415,0.45505816],"study_design_scores_gemma":[0.0001549301,0.000104921986,0.000018344968,0.00023446453,0.0000061321534,0.000007632231,4.3212748e-7,0.9538301,0.012178429,0.03182851,0.0013028376,0.00033325425],"about_ca_topic_score_codex":0.000008026829,"about_ca_topic_score_gemma":0.000005620807,"teacher_disagreement_score":0.65387434,"about_ca_system_score_codex":0.00018810046,"about_ca_system_score_gemma":0.00046841998,"threshold_uncertainty_score":0.9999097},"labels":[],"label_agreement":null},{"id":"W1549035077","doi":"10.1007/11609773_25","title":"Systematic Construction of Abstractions for Model-Checking","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":21,"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; Constructive; Model checking; Interpretation (philosophy); Abstract interpretation; Programming language; Theoretical computer science; Process (computing)","score_opus":0.037041112368106886,"score_gpt":0.2962497621532289,"score_spread":0.25920864978512204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549035077","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.000026776825,0.00018999017,0.99577063,0.000120444645,0.0013551458,0.0008618543,0.0000068625786,0.000101317426,0.0015669537],"genre_scores_gemma":[0.018730273,0.000020505222,0.98079085,0.00010640215,0.0001789222,0.000036037003,0.0000021771696,0.000019948246,0.00011486546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972896,0.000028770313,0.0008653519,0.00082568364,0.00064087374,0.00034973302],"domain_scores_gemma":[0.9970492,0.00049068517,0.00080158695,0.001167691,0.00041472327,0.00007612384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014875643,0.00031321478,0.0005609283,0.00073404936,0.0001839023,0.00017921746,0.0018008844,0.00027355956,0.0000037614961],"category_scores_gemma":[0.00023991098,0.0002977533,0.00015812123,0.0003072712,0.0004914708,0.00078733586,0.0002966488,0.00038582072,0.0000074754266],"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.000004414888,0.000020597396,0.0000023009716,0.0021041024,0.000017014396,0.0000012100268,0.00052669423,0.3584142,0.00039706373,0.44037116,0.0000022888191,0.19813895],"study_design_scores_gemma":[0.000101574435,0.000050748855,0.0000052535274,0.0016418954,0.00001576584,0.0000477881,2.3834431e-7,0.8515239,0.0035142598,0.14282456,0.000028686316,0.00024538173],"about_ca_topic_score_codex":0.0000036661258,"about_ca_topic_score_gemma":0.000008651887,"teacher_disagreement_score":0.49310964,"about_ca_system_score_codex":0.00031387934,"about_ca_system_score_gemma":0.0003904357,"threshold_uncertainty_score":0.9999475},"labels":[],"label_agreement":null},{"id":"W1549312786","doi":"10.1007/3-540-36577-x_12","title":"Proof-Like Counter-Examples","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":43,"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":"Counterexample; Computer science; Property (philosophy); Debugging; Counter-Reformation; Temporal logic; Over-the-counter; Theoretical computer science; Algorithm; Programming language; Discrete mathematics; Mathematics","score_opus":0.03468008443113473,"score_gpt":0.2801073801658396,"score_spread":0.24542729573470484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549312786","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.000017197604,0.0005094583,0.98441416,0.00038373182,0.0041196207,0.00054224394,0.000004635025,0.00020068372,0.009808248],"genre_scores_gemma":[0.003598747,0.0000410135,0.9921795,0.0030481112,0.0002742813,0.00002104725,0.0000044276144,0.00004387113,0.0007890153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524426,0.00008777241,0.000672637,0.0018776752,0.0013054183,0.0008122291],"domain_scores_gemma":[0.996326,0.00032644364,0.00041585002,0.0023900878,0.00034630168,0.00019528801],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019537546,0.000622742,0.0005555077,0.00083098,0.00029591756,0.00070134515,0.004685933,0.00041466753,0.000034498393],"category_scores_gemma":[0.00018752376,0.0005811061,0.00014025882,0.00077377167,0.00088842085,0.0010450336,0.0010343235,0.00093033334,0.0000886125],"study_design_candidate":"design_other","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.0000053197527,0.00004218556,0.00003562556,0.00006811729,0.00001276127,0.000050194605,0.00068080303,0.0067197983,0.00016661391,0.176301,0.0001541668,0.8157634],"study_design_scores_gemma":[0.00039622825,0.00036693667,0.0001244826,0.00053476146,0.000014461891,0.00027080663,2.1495829e-7,0.5160299,0.0074882256,0.38735133,0.08574469,0.0016779782],"about_ca_topic_score_codex":0.0000128748625,"about_ca_topic_score_gemma":0.000027382594,"teacher_disagreement_score":0.8140854,"about_ca_system_score_codex":0.0004787482,"about_ca_system_score_gemma":0.0005404262,"threshold_uncertainty_score":0.999664},"labels":[],"label_agreement":null},{"id":"W1549895339","doi":"10.1007/11734673_15","title":"Verification of Pushdown Systems Using Omega Algebra with Domain","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Computer science; Extension (predicate logic); Kleene algebra; Omega; Programming language; Domain (mathematical analysis); Algebra over a field; Theoretical computer science; Discrete mathematics; Mathematics; Pure mathematics","score_opus":0.02279339813481427,"score_gpt":0.2566405629820762,"score_spread":0.23384716484726195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549895339","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.00095694733,0.00038052755,0.9939773,0.000058670026,0.0013157603,0.00057956896,0.0000061305745,0.00011784869,0.0026072364],"genre_scores_gemma":[0.11734875,0.000008333119,0.8822313,0.000071207694,0.00020796248,0.000010077752,0.0000059930017,0.000031894193,0.000084453975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961003,0.00008990945,0.00076797395,0.0012811351,0.0012495595,0.00051108596],"domain_scores_gemma":[0.99649346,0.00021042701,0.0008387605,0.0019249513,0.00042969274,0.00010270407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015570376,0.00046781797,0.0005857625,0.0009406148,0.00019153467,0.0003745815,0.0028386784,0.00032133007,0.0000026353812],"category_scores_gemma":[0.000047673035,0.00040471545,0.000083712766,0.0010409128,0.0008880119,0.0008883583,0.0004678768,0.0005094894,0.000008094169],"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.000028970724,0.000078906356,0.00017685223,0.00030479362,0.00002917994,0.000043316668,0.0009261157,0.43408814,0.004398565,0.3837544,0.000018865876,0.17615189],"study_design_scores_gemma":[0.0003025166,0.00024068997,0.00029797675,0.00074185623,0.00001440305,0.00015594093,4.6630248e-7,0.9505572,0.005575914,0.040536065,0.0008713356,0.000705639],"about_ca_topic_score_codex":0.000105864565,"about_ca_topic_score_gemma":0.000012836198,"teacher_disagreement_score":0.51646906,"about_ca_system_score_codex":0.00044352704,"about_ca_system_score_gemma":0.0005640184,"threshold_uncertainty_score":0.9998405},"labels":[],"label_agreement":null},{"id":"W1551380792","doi":"10.1007/978-3-642-14186-7_23","title":"Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"Benchmark (surveying); Computer science; Variable (mathematics); Generalization; Satisfiability; Weighting; Selection (genetic algorithm); Algorithm; Software; Theoretical computer science; Artificial intelligence; Mathematics; Programming language","score_opus":0.03028256369701329,"score_gpt":0.3246639566711262,"score_spread":0.2943813929741129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551380792","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.000010969582,0.00030906583,0.9927316,0.00023853428,0.004374561,0.0008728267,0.0000050237145,0.0002878655,0.0011695814],"genre_scores_gemma":[0.00040490305,0.000015915957,0.99747723,0.00039156273,0.00033516414,0.000059407397,0.000007714227,0.000055819884,0.0012523016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960976,0.0000625641,0.0005875425,0.0018099104,0.00063504407,0.0008073376],"domain_scores_gemma":[0.9952693,0.0014140304,0.0004676472,0.0021929494,0.0003814409,0.00027461982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025894546,0.0005763964,0.0005579547,0.0008500285,0.0007108821,0.0007728697,0.0034461292,0.00047818874,0.000024977846],"category_scores_gemma":[0.00062811736,0.00048665705,0.000120656514,0.00085191237,0.0004991295,0.001377294,0.0010874104,0.0012850655,0.000016303922],"study_design_candidate":"design_other","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.000014267048,0.0000186658,0.0000074314307,0.00005842715,0.000015038328,0.0000034453938,0.0005111364,0.022562545,0.013939969,0.034176532,0.0000097704315,0.92868274],"study_design_scores_gemma":[0.00030746448,0.0002727778,0.000033703793,0.0007005532,0.000022329341,0.00008197485,3.7507624e-7,0.77708733,0.0079070255,0.20655939,0.006315076,0.00071203045],"about_ca_topic_score_codex":0.000027197624,"about_ca_topic_score_gemma":0.000040110426,"teacher_disagreement_score":0.92797077,"about_ca_system_score_codex":0.0003335769,"about_ca_system_score_gemma":0.0012773109,"threshold_uncertainty_score":0.9997585},"labels":[],"label_agreement":null},{"id":"W1554047564","doi":"10.1016/s0167-6423(01)00026-0","title":"Formal methods: the very idea","year":2002,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":53,"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; Work (physics); Domain (mathematical analysis); Formal methods; Silver bullet; Software engineering","score_opus":0.04903776775227458,"score_gpt":0.33726629061346813,"score_spread":0.28822852286119355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554047564","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.0047408645,0.00016660542,0.99205095,0.00037316445,0.0011154591,0.00025554895,1.5562306e-7,0.0001563963,0.001140876],"genre_scores_gemma":[0.13223533,0.000006187694,0.86750615,0.00012361833,0.00008147656,0.00001860371,1.02874424e-7,0.000004945498,0.000023611039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976993,0.00019058738,0.00039167763,0.00043468596,0.0006833885,0.0006003631],"domain_scores_gemma":[0.99820197,0.00017803625,0.0002411092,0.0010473733,0.00023028262,0.00010125995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052181743,0.00013861411,0.00016654232,0.00021035303,0.000508361,0.00044020996,0.0035451653,0.00003881191,0.0000070547917],"category_scores_gemma":[0.00016384853,0.00009667215,0.00008870337,0.0021029185,0.0008546202,0.0026883595,0.000924788,0.00017813759,0.000024695466],"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":[6.5128535e-7,0.00002911246,0.00003249475,0.000008398109,0.0000029270684,5.900092e-7,0.0010317555,0.00013013865,0.0007595905,0.114920504,0.000045511788,0.88303834],"study_design_scores_gemma":[0.00012678397,0.00017285635,0.0013521033,0.000025794807,0.0000044621474,0.000043411856,0.000047913105,0.96507776,0.019040085,0.003208296,0.010717633,0.00018292405],"about_ca_topic_score_codex":0.000007909607,"about_ca_topic_score_gemma":2.897848e-7,"teacher_disagreement_score":0.9649476,"about_ca_system_score_codex":0.00004587047,"about_ca_system_score_gemma":0.00005698671,"threshold_uncertainty_score":0.6587858},"labels":[],"label_agreement":null},{"id":"W1554770696","doi":"10.1109/iscas.1999.777866","title":"An algorithm for the verification of timing diagrams realizability","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Realizability; Consistency (knowledge bases); Computer science; Algorithm; Diagram; Static timing analysis; Embedded system","score_opus":0.06383251526009134,"score_gpt":0.3481017962623584,"score_spread":0.284269281002267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554770696","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.0010980108,0.00002522019,0.99719477,0.00006690801,0.00022118488,0.00029796056,0.0000014418965,0.000058126836,0.0010363999],"genre_scores_gemma":[0.13804542,0.000006271093,0.86181134,0.000041106574,0.000012616221,0.00005211388,0.0000016893384,0.0000031345696,0.000026336267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992516,0.00014391249,0.00018597105,0.00019241417,0.00011958573,0.00010651339],"domain_scores_gemma":[0.99869025,0.0002036428,0.00008764123,0.00086818496,0.0001227027,0.0000275758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016719435,0.00005274757,0.00006648777,0.000020365822,0.00009381194,0.000036587233,0.00051646726,0.00003337526,0.0000066464586],"category_scores_gemma":[0.00024098052,0.00003591806,0.000034579734,0.00020779711,0.000050397397,0.00034423725,0.000015210295,0.00003384985,0.0000019827496],"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":[8.323929e-7,0.000042964944,0.00009141184,0.0000049791915,0.000002576418,1.1590683e-8,0.0002257151,0.00006521876,0.0007647619,0.45122662,0.000026119937,0.5475488],"study_design_scores_gemma":[0.0000898982,0.000084134226,0.0044543277,0.000001812978,0.0000043943173,0.0000014424807,0.00007503002,0.9115591,0.06949878,0.011353425,0.0028123157,0.00006532333],"about_ca_topic_score_codex":0.00003533872,"about_ca_topic_score_gemma":0.0000021620658,"teacher_disagreement_score":0.9114939,"about_ca_system_score_codex":0.00002045332,"about_ca_system_score_gemma":0.000028490362,"threshold_uncertainty_score":0.1464696},"labels":[],"label_agreement":null},{"id":"W1554979559","doi":"10.1007/978-3-540-77966-7_15","title":"Exploiting Shared Structure in Software Verification Conditions","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"Computer science; Dataflow; Exploit; Granularity; Software verification; Data-flow analysis; Context (archaeology); Software; Data structure; Distributed computing; Code (set theory); Parallel computing; Data flow diagram; Programming language; Software system; Software construction; Database","score_opus":0.03528894889525886,"score_gpt":0.281387366251264,"score_spread":0.24609841735600513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554979559","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.00058912724,0.00028674293,0.99592096,0.00020680092,0.0014624436,0.00051247043,0.00003276073,0.00026004485,0.00072865415],"genre_scores_gemma":[0.08528615,0.00007483145,0.91364825,0.00054299354,0.00025610786,0.00002550892,0.000051100564,0.000037860627,0.00007719583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959238,0.00008046496,0.0007561753,0.0016300535,0.00095822697,0.00065127085],"domain_scores_gemma":[0.99700034,0.0003792527,0.00045754673,0.0017291238,0.00029145443,0.00014226217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006811395,0.0005104422,0.0004907923,0.001286116,0.00035080285,0.00038247154,0.0032804173,0.00045303674,0.00004155969],"category_scores_gemma":[0.00045927355,0.00053529703,0.0001013859,0.0011309799,0.00062769535,0.0015683993,0.00072187075,0.0011053128,0.000039485993],"study_design_candidate":"design_other","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.000011304484,0.0000614491,0.00047827832,0.00011363765,0.000013405934,0.00015513378,0.005270863,0.07376811,0.0014599555,0.04682516,0.000100597426,0.8717421],"study_design_scores_gemma":[0.0007056426,0.00019797469,0.008026625,0.0011233424,0.000010213291,0.00038377687,0.000001334564,0.7664926,0.007486303,0.21092927,0.0027437294,0.0018991492],"about_ca_topic_score_codex":0.000022053002,"about_ca_topic_score_gemma":0.0000562961,"teacher_disagreement_score":0.86984295,"about_ca_system_score_codex":0.0006297886,"about_ca_system_score_gemma":0.0005723157,"threshold_uncertainty_score":0.99970984},"labels":[],"label_agreement":null},{"id":"W1556588790","doi":"10.1007/978-3-642-15396-9_17","title":"Using Learnt Clauses in maxsat","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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":"Maximum satisfiability problem; Soundness; Computer science; Set (abstract data type); Solver; Boolean satisfiability problem; Exploit; Connection (principal bundle); Theoretical computer science; Algorithm; Mathematics; Programming language; Boolean function","score_opus":0.05979020646472324,"score_gpt":0.31854603444125307,"score_spread":0.25875582797652985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556588790","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.00064487,0.0001990957,0.99285346,0.0002119656,0.0031171264,0.0003555742,0.0000015883094,0.00013463141,0.0024816631],"genre_scores_gemma":[0.025913432,0.000026167829,0.9729525,0.00064022985,0.0003129195,0.000005428623,0.0000013068145,0.00003252299,0.0001154982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614525,0.00007206538,0.0006276926,0.0015087989,0.0009366092,0.00070957135],"domain_scores_gemma":[0.9972342,0.00030856475,0.00033538637,0.0017989785,0.00018091503,0.00014195002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018572106,0.00048296372,0.00049707515,0.0012918022,0.0002046921,0.0005019989,0.0039504417,0.00055962475,0.000023805933],"category_scores_gemma":[0.0002545578,0.00046594796,0.00009856421,0.0008843023,0.00082986424,0.0010018782,0.0014197992,0.0017981997,0.00004694887],"study_design_candidate":"design_other","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.000008377938,0.00004507357,0.0002956893,0.000058283305,0.000005730659,0.00011256312,0.0012492636,0.036962446,0.0055912267,0.10041666,0.0000026157334,0.8552521],"study_design_scores_gemma":[0.00021306206,0.00009179922,0.0004819189,0.0003537943,0.0000043391906,0.00012955054,1.6300795e-7,0.79812425,0.010415359,0.18732396,0.0021020107,0.0007597708],"about_ca_topic_score_codex":0.00006484451,"about_ca_topic_score_gemma":0.00016166101,"teacher_disagreement_score":0.8544923,"about_ca_system_score_codex":0.0004359362,"about_ca_system_score_gemma":0.0005980009,"threshold_uncertainty_score":0.9997792},"labels":[],"label_agreement":null},{"id":"W1559445291","doi":"10.1007/11691372_14","title":"Why Waste a Perfectly Good Abstraction?","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":40,"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; Abstraction; Model checking; Programming language; Construct (python library); Negation; Theoretical computer science; Software; Overhead (engineering)","score_opus":0.01894644267695774,"score_gpt":0.2649961078419883,"score_spread":0.24604966516503055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559445291","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.00006213467,0.00023968355,0.97140026,0.0006317373,0.003175005,0.00040128923,0.0000044354842,0.0002780393,0.02380744],"genre_scores_gemma":[0.021047467,0.000020982287,0.97519624,0.0019627323,0.00083939335,0.000017281562,0.00000672136,0.00004596033,0.00086319324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556315,0.000063124025,0.00067076174,0.0017224866,0.0012529704,0.0007275324],"domain_scores_gemma":[0.99675125,0.00034732977,0.00046010988,0.0019841306,0.00029659987,0.00016058244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013738804,0.00058286666,0.00049194094,0.00095698977,0.00033528614,0.0007374845,0.0037452271,0.00043111568,0.000027911594],"category_scores_gemma":[0.00010388175,0.0005612087,0.00017098365,0.00077252754,0.0006120944,0.0012712775,0.00091288023,0.0011079395,0.00010689198],"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.0000086704,0.00007931449,0.00004517316,0.00008366382,0.000016324253,0.00009054204,0.00044293335,0.10308717,0.0007791246,0.092551745,0.0006238903,0.80219144],"study_design_scores_gemma":[0.00032493478,0.00028525235,0.0003117411,0.0003547583,0.000014632915,0.00022122194,2.0554673e-7,0.8343799,0.0085357465,0.1325033,0.021833934,0.0012343677],"about_ca_topic_score_codex":0.00008042372,"about_ca_topic_score_gemma":0.00006470522,"teacher_disagreement_score":0.8009571,"about_ca_system_score_codex":0.0004786568,"about_ca_system_score_gemma":0.0004130958,"threshold_uncertainty_score":0.9996839},"labels":[],"label_agreement":null},{"id":"W1559507803","doi":"10.1109/mwscas.1992.271308","title":"Implementation considerations in the Polynomial Ring Engine","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Prime (order theory); Polynomial; Ring (chemistry); Moduli; Polynomial ring; Product (mathematics); Computer science; Range (aeronautics); Windsor; Coprime integers; Algebra over a field; Mathematics; Algorithm; Applied mathematics; Pure mathematics; Engineering; Combinatorics; Mathematical analysis; Geometry","score_opus":0.04390663681498485,"score_gpt":0.3433987217752375,"score_spread":0.29949208496025265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559507803","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.02721645,0.000013006621,0.9544809,0.0006117793,0.00018140308,0.00014833099,1.8436792e-7,0.000038328995,0.017309617],"genre_scores_gemma":[0.57548106,7.1671417e-7,0.42417395,0.00030884836,0.000008213205,0.00001339429,2.931017e-7,8.960642e-7,0.000012616182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994396,0.0001572645,0.00012869564,0.000094305564,0.00008660245,0.00009353377],"domain_scores_gemma":[0.9996445,0.000096172174,0.00002414679,0.00021336846,0.000010938358,0.000010842005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007397584,0.000036024787,0.000031111736,0.000049180195,0.000068153415,0.000087994624,0.00014267646,0.000012663175,0.000046359008],"category_scores_gemma":[0.00009269834,0.000026606831,0.0000108976565,0.00017839165,0.000008946868,0.00033412044,0.000012968856,0.00004987974,0.000014995374],"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":[1.5396809e-7,0.000010594215,0.0010004365,6.331226e-7,9.672377e-7,7.212616e-7,0.0012530577,0.00008095335,0.0004039159,0.99038047,0.00034492416,0.006523182],"study_design_scores_gemma":[0.003512525,0.00028847522,0.23576096,0.00001537676,0.000016130278,0.00033208422,0.0079323435,0.23611082,0.35651007,0.11750472,0.041019004,0.0009974962],"about_ca_topic_score_codex":0.00004850777,"about_ca_topic_score_gemma":0.00007211899,"teacher_disagreement_score":0.87287575,"about_ca_system_score_codex":0.00002107216,"about_ca_system_score_gemma":0.000030419387,"threshold_uncertainty_score":0.10849951},"labels":[],"label_agreement":null},{"id":"W1559772379","doi":"","title":"2/23 Enhancing the Compilation of Synchronous Dataflow Programs with a Combined Numerical-Boolean Abstraction","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Emera (Canada)","funders":"","keywords":"Dataflow; Abstraction; Computer science; Programming language; Parallel computing; Theoretical computer science","score_opus":0.030530663072447773,"score_gpt":0.2805653621723376,"score_spread":0.2500346990998898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559772379","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.021492634,0.000025492242,0.97375053,0.00025186874,0.0005678626,0.0013059136,0.00000400343,0.00028630404,0.0023154097],"genre_scores_gemma":[0.49180502,0.000006831976,0.5077882,0.000031676824,0.00004253487,0.0001324495,0.00008512933,0.000013481387,0.00009473504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775857,0.00022048655,0.0006320803,0.000592704,0.0005313912,0.0002647673],"domain_scores_gemma":[0.9967682,0.00014013125,0.0008535295,0.0018655034,0.00030515026,0.000067519395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089663157,0.00027582294,0.00034855225,0.000099755154,0.00013139723,0.00031082003,0.0015346765,0.00017838764,0.000029619669],"category_scores_gemma":[0.000054246426,0.00017786714,0.00007821858,0.000285084,0.00012621733,0.00062872487,0.0007133797,0.00057956926,0.0000879596],"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.00019161262,0.0012356073,0.0011744455,0.0011904865,0.00040857412,0.0000052791984,0.0055065113,0.032580856,0.004234709,0.1844942,0.00066516356,0.7683126],"study_design_scores_gemma":[0.0003510917,0.0006276323,0.013628429,0.00030287207,0.000054146945,0.000023773586,0.00020412733,0.96293193,0.016437337,0.004469206,0.00047236832,0.00049705704],"about_ca_topic_score_codex":0.00033956984,"about_ca_topic_score_gemma":0.00003535932,"teacher_disagreement_score":0.9303511,"about_ca_system_score_codex":0.00012391983,"about_ca_system_score_gemma":0.00017145603,"threshold_uncertainty_score":0.7253212},"labels":[],"label_agreement":null},{"id":"W1559982914","doi":"10.1109/iccd.2004.1347955","title":"Generating monitor circuits for simulation-friendly GSTE assertion graphs","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"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 British Columbia","funders":"","keywords":"Computer science; Formal verification; Symbolic execution; Runtime verification; Symbolic trajectory evaluation; Emulation; Formal methods; Functional verification; Assertion; Exploit; Formal specification; Programming language; High-level verification; Semantics (computer science); Intelligent verification; Embedded system; Model checking; Software","score_opus":0.04318022878942198,"score_gpt":0.332898389220714,"score_spread":0.28971816043129206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559982914","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.062342167,0.00001819947,0.9357818,0.00012489641,0.0006125619,0.00029758998,9.581265e-7,0.00023827539,0.00058357377],"genre_scores_gemma":[0.4889295,6.714095e-7,0.5108434,0.00008565714,0.000054666772,0.000033980887,0.0000022027177,0.000005021209,0.000044924007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902403,0.00003749042,0.0002492562,0.00029123647,0.00019552557,0.0002024628],"domain_scores_gemma":[0.99918973,0.00009439628,0.000101081554,0.0003817245,0.00017704189,0.00005604819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043192293,0.00009736387,0.00008661793,0.00009106173,0.00021902977,0.00015381289,0.0003748179,0.000062018604,0.0000030883762],"category_scores_gemma":[0.00020656879,0.00009325198,0.00005877674,0.00032410276,0.000015316373,0.0009464663,0.000040513478,0.000055944787,0.00001858841],"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.0000024630522,0.000042454525,0.00010511082,0.000016035106,0.000008316376,4.070036e-7,0.00035501286,0.39454478,0.021308927,0.4813021,0.000024257126,0.10229012],"study_design_scores_gemma":[0.00035897052,0.00010394083,0.001079394,0.000009253936,0.0000036627403,0.0000021476874,0.000021763966,0.9207419,0.057154357,0.020026926,0.0003448953,0.00015278788],"about_ca_topic_score_codex":0.000013566301,"about_ca_topic_score_gemma":0.0000032086257,"teacher_disagreement_score":0.52619714,"about_ca_system_score_codex":0.00006741285,"about_ca_system_score_gemma":0.000041459538,"threshold_uncertainty_score":0.38027057},"labels":[],"label_agreement":null},{"id":"W1562265786","doi":"10.1109/pacrim.2003.1235814","title":"A traffic engineered routing algorithm based on fuzzy logic","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"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 British Columbia","funders":"","keywords":"Computer science; Static routing; Multipath routing; Link-state routing protocol; Routing (electronic design automation); Destination-Sequenced Distance Vector routing; Dijkstra's algorithm; Equal-cost multi-path routing; Distance-vector routing protocol; Policy-based routing; Fuzzy logic; Suurballe's algorithm; Dynamic Source Routing; Algorithm; Routing algorithm; Distributed computing; Routing protocol; Theoretical computer science; Computer network; Shortest path problem; Artificial intelligence","score_opus":0.02701521044887948,"score_gpt":0.27285580466193926,"score_spread":0.2458405942130598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562265786","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.0015424328,0.000007365772,0.9897637,0.0005212439,0.00031234644,0.00011998187,5.422798e-7,0.00049722753,0.007235203],"genre_scores_gemma":[0.28519806,4.958105e-7,0.7141805,0.00052913546,0.000032404143,0.0000087518265,0.000001089902,0.00000497413,0.00004452674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990554,0.000043624306,0.00016589054,0.00028236283,0.00022506602,0.00022766754],"domain_scores_gemma":[0.999318,0.000050329763,0.000044099357,0.00048775694,0.000037099973,0.00006273577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045373783,0.00010866798,0.00009343039,0.00010258927,0.000070295,0.00007796461,0.0005224387,0.000055781817,0.000009915096],"category_scores_gemma":[0.000097469005,0.00009297714,0.000047738296,0.000416453,0.000016925089,0.00022684803,0.000037138558,0.00011654833,0.00012306355],"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.0000022662607,0.000094125535,0.0000015070253,0.000004787539,0.0000029140344,0.0000074404165,0.00018828707,0.2501188,0.00026728434,0.39557934,0.000025118718,0.35370815],"study_design_scores_gemma":[0.00035975716,0.00013050358,0.00025889504,0.000012537793,0.0000014283313,0.0000055146015,0.000010838552,0.99097854,0.005346346,0.0025943473,0.00016660446,0.0001346963],"about_ca_topic_score_codex":0.000006329191,"about_ca_topic_score_gemma":4.5643398e-7,"teacher_disagreement_score":0.74085975,"about_ca_system_score_codex":0.00009381013,"about_ca_system_score_gemma":0.0000541123,"threshold_uncertainty_score":0.3791498},"labels":[],"label_agreement":null},{"id":"W1564397736","doi":"10.1007/11814948_6","title":"Minimum Witnesses for Unsatisfiable 2CNFs","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Resolution (logic); Characterization (materials science); Time complexity; Computer science; Combinatorics; Tree (set theory); Graph; Dynamic programming; Discrete mathematics; Mathematics; Algorithm; Artificial intelligence","score_opus":0.0248006996301742,"score_gpt":0.2767819911094897,"score_spread":0.2519812914793155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564397736","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.000025122043,0.0003560678,0.9885811,0.0003696821,0.003008975,0.0007691206,0.000011657526,0.00022868643,0.0066495733],"genre_scores_gemma":[0.0067253965,0.000016889177,0.99057823,0.00066367653,0.0005784502,0.000047168403,0.00001145416,0.000043166317,0.0013355473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960481,0.000037004917,0.0006478337,0.0016344696,0.00086391834,0.000768691],"domain_scores_gemma":[0.99661887,0.0006839831,0.00041718892,0.0017523869,0.00039932257,0.0001282557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014125475,0.0005403075,0.0005507487,0.00076449587,0.0003259179,0.00059140485,0.0038473487,0.00038557503,0.000011685847],"category_scores_gemma":[0.00021655246,0.00051511824,0.00014957538,0.00067786215,0.00071009656,0.0009540071,0.00076771824,0.00048523778,0.00003109196],"study_design_candidate":"design_other","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.000011802651,0.000043673976,0.000036551395,0.0001552377,0.000011836952,0.000018413006,0.0003018041,0.0476593,0.0003486407,0.23892151,0.00052318274,0.71196806],"study_design_scores_gemma":[0.00028107973,0.0002039395,0.00007861847,0.00023264393,0.000009310493,0.00003680398,7.336827e-8,0.65586585,0.005447911,0.3263946,0.010735589,0.0007135682],"about_ca_topic_score_codex":0.000031814,"about_ca_topic_score_gemma":0.00003804904,"teacher_disagreement_score":0.7112545,"about_ca_system_score_codex":0.0003157857,"about_ca_system_score_gemma":0.00060397125,"threshold_uncertainty_score":0.99973005},"labels":[],"label_agreement":null},{"id":"W1566315049","doi":"10.14279/tuj.eceasst.66.887","title":"From System Requirements to Software Requirements in the Four-Variable Model","year":2024,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Interfacing; Software requirements specification; Software requirements; Software construction; Software; Software system; Software development; System requirements; Implementation; Software engineering; Programming language; Operating system; Computer hardware","score_opus":0.10696733901912503,"score_gpt":0.3414976210090478,"score_spread":0.23453028198992276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566315049","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.0029224064,0.000055230117,0.98565584,0.00045057706,0.00091998087,0.0003668538,0.0000067236238,0.00038835857,0.00923402],"genre_scores_gemma":[0.16421264,0.0000013209127,0.83441687,0.0006315336,0.00006708947,0.00009809968,0.0000031471498,0.0000096783615,0.0005596148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824476,0.0001599455,0.0003289295,0.0004757075,0.0005123936,0.000278276],"domain_scores_gemma":[0.99881613,0.00010392932,0.00003428181,0.0009444661,0.000044929962,0.000056288674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015514377,0.0001261007,0.00011753703,0.00012582263,0.00007708455,0.00043003884,0.0015115952,0.000056025823,0.000014139034],"category_scores_gemma":[0.00011053937,0.000088656045,0.000032846816,0.00078940636,0.000011197506,0.00095176545,0.0002992926,0.0001224986,0.00027512535],"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.000009112126,0.000050402512,0.00014709988,0.00012757626,0.000028272978,0.000028575821,0.004619483,0.009174388,0.0022225657,0.9449248,0.008611964,0.030055773],"study_design_scores_gemma":[0.000088655324,0.000028401479,0.00013524196,0.00019690006,0.0000054585475,0.0000038765615,0.00016195678,0.9816297,0.00072849495,0.0146951135,0.0021930882,0.00013310845],"about_ca_topic_score_codex":0.00025345484,"about_ca_topic_score_gemma":0.000008242907,"teacher_disagreement_score":0.9724553,"about_ca_system_score_codex":0.00022694506,"about_ca_system_score_gemma":0.000081268,"threshold_uncertainty_score":0.41468742},"labels":[],"label_agreement":null},{"id":"W1568724472","doi":"","title":"A formal verification framework for Bluespec System Verilog","year":2013,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Systems Modeling Language; Computer science; Correctness; Activity diagram; Programming language; Formal equivalence checking; Formal verification; Verilog; Unified Modeling Language; Hardware description language; Probabilistic logic; Formal methods; Theoretical computer science; Embedded system; Field-programmable gate array; Software; Artificial intelligence","score_opus":0.017895633122646432,"score_gpt":0.24775367179007013,"score_spread":0.2298580386674237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568724472","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.01345444,0.00014866744,0.9660711,0.0032921645,0.00038439062,0.00084200554,0.000008816831,0.0005945767,0.015203791],"genre_scores_gemma":[0.357024,0.000019908202,0.6417537,0.00008263464,0.00002580391,0.00033345135,0.000031128526,0.000020095596,0.0007092892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960003,0.0019606047,0.00053292105,0.0006412333,0.00037317286,0.00049180636],"domain_scores_gemma":[0.9937259,0.001306546,0.00042210176,0.0024060365,0.001953007,0.00018638937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005015735,0.00023022718,0.00024214774,0.00016065172,0.00053639547,0.000644827,0.0019475757,0.00019857376,0.00004045697],"category_scores_gemma":[0.0019201841,0.00023930405,0.00014453093,0.00063620147,0.00013179574,0.0014376336,0.00038138602,0.000241868,0.00023667364],"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.0000043877935,0.000092484,0.00009336562,0.00005492469,0.00001295608,2.4140394e-7,0.0024320772,0.000008194525,0.0019140259,0.9151442,0.00032858225,0.07991454],"study_design_scores_gemma":[0.0010628474,0.0000040969453,0.012044149,0.0010646854,0.00003241909,0.000040164952,0.0005978253,0.7174378,0.18114346,0.05895235,0.02669888,0.0009212818],"about_ca_topic_score_codex":0.00019056113,"about_ca_topic_score_gemma":0.000021981356,"teacher_disagreement_score":0.8561919,"about_ca_system_score_codex":0.00017606693,"about_ca_system_score_gemma":0.00011562043,"threshold_uncertainty_score":0.9758536},"labels":[],"label_agreement":null},{"id":"W1568918982","doi":"10.1007/11527695","title":"Theory and Applications of Satisfiability Testing: 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers","year":2005,"lang":"en","type":"book","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Boolean satisfiability problem; True quantified Boolean formula; Satisfiability; Conjunctive normal form; Maximum satisfiability problem; Mathematics; DPLL algorithm; Boolean data type; Solver; Discrete mathematics; Algorithm; Computer science; Theoretical computer science; Boolean function; Mathematical optimization","score_opus":0.018730443411511685,"score_gpt":0.2598583838044706,"score_spread":0.24112794039295893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568918982","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014232459,0.000265303,0.3413227,0.00010703213,0.00041751034,0.0008955572,0.00011433132,0.00016433548,0.656699],"genre_scores_gemma":[0.0026144949,0.00008518614,0.3732745,0.00027093428,0.0002367465,0.00015039882,0.000152885,0.000036484835,0.62317836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969793,0.00030823442,0.0008287088,0.0008435237,0.000723506,0.00031675128],"domain_scores_gemma":[0.9958791,0.0008591493,0.0007105265,0.0011321076,0.0012423781,0.0001767058],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012963444,0.00039124867,0.0004925175,0.00019966917,0.00013122105,0.00008939786,0.0014799042,0.0002771919,0.0010285212],"category_scores_gemma":[0.00092115765,0.00037698972,0.0000614898,0.00046155436,0.00028646525,0.0003093016,0.00028538718,0.00038928352,0.00001318363],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004823239,0.000106022555,0.0006857134,0.00028928468,0.00017659776,0.0000022359195,0.0001471682,0.0001961062,0.00021298327,0.375708,0.24731241,0.37511522],"study_design_scores_gemma":[0.00072694453,0.00012323559,0.005102894,0.00026032026,0.00010182849,0.000020884267,0.000051310606,0.01746703,0.0004094361,0.027466174,0.9471538,0.0011161482],"about_ca_topic_score_codex":0.011493529,"about_ca_topic_score_gemma":0.10243269,"teacher_disagreement_score":0.6998414,"about_ca_system_score_codex":0.0007635737,"about_ca_system_score_gemma":0.0043687043,"threshold_uncertainty_score":0.99988467},"labels":[],"label_agreement":null},{"id":"W1569102943","doi":"10.1109/iceccs.1996.558410","title":"Animating real-time reactive systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Debugging; Computer science; Animation; Graphical user interface; Process (computing); Programming language; Computer animation; Generator (circuit theory); Interpreter; Human–computer interaction; Software engineering; Computer graphics (images)","score_opus":0.04179526750596901,"score_gpt":0.27037424385325404,"score_spread":0.22857897634728502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569102943","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.0042082556,0.000026732316,0.63842213,0.000072888564,0.0001932325,0.00010103576,2.464226e-7,0.00034672668,0.35662875],"genre_scores_gemma":[0.07605927,0.000008105606,0.9192861,0.000032183663,0.00004574317,0.000013059135,2.6472955e-7,0.0000052475866,0.004550074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926394,0.00007750179,0.00015675102,0.00019375786,0.00016272118,0.00014533671],"domain_scores_gemma":[0.99932027,0.000074609656,0.000082341445,0.00042798737,0.00005364236,0.000041122352],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003885503,0.000062845866,0.00008312115,0.00004712012,0.00006789814,0.00011344561,0.00040476889,0.000034169603,0.000057006342],"category_scores_gemma":[0.00008551429,0.000054654014,0.000026571066,0.00023847495,0.000014237153,0.00065684965,0.0000757791,0.00005452244,0.0009346843],"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.0000011303696,0.000043976073,0.000052882802,0.000017683664,0.000012492884,0.0000043729888,0.0012634861,0.00014269959,0.029127039,0.93054354,0.0034259998,0.03536469],"study_design_scores_gemma":[0.000047345053,0.00003239694,0.00028385854,0.00001016432,0.0000013534622,0.000019318448,0.00003470711,0.9951832,0.002906062,0.0002605677,0.0011343233,0.00008666292],"about_ca_topic_score_codex":0.00006366545,"about_ca_topic_score_gemma":1.6661878e-7,"teacher_disagreement_score":0.99504054,"about_ca_system_score_codex":0.00004581215,"about_ca_system_score_gemma":0.0000042463257,"threshold_uncertainty_score":0.9998432},"labels":[],"label_agreement":null},{"id":"W1569134779","doi":"10.1109/icm.2001.997659","title":"Automating the verification of parameterized hardware using a hybrid tool","year":2001,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Parameterized complexity; Computer science; Intelligent verification; Automated theorem proving; Formal verification; Programming language; Computer architecture; Gas meter prover; Computer engineering; Algorithm; Software; Mathematical proof; Software construction; Software development; Mathematics","score_opus":0.062012721976690256,"score_gpt":0.3140011513428423,"score_spread":0.251988429366152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569134779","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.34516466,0.000011397443,0.6537381,0.000085837855,0.00012428929,0.00012325287,5.356839e-7,0.00009956563,0.00065236166],"genre_scores_gemma":[0.4536164,0.000003349118,0.54626685,0.000059980186,0.000012578775,0.000007760556,6.756008e-7,0.000003089188,0.000029280536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902433,0.00015167627,0.00029496185,0.00018310202,0.00020593597,0.00014001092],"domain_scores_gemma":[0.99887794,0.00009751368,0.00019441106,0.0007213664,0.000089876965,0.000018903598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007549587,0.00007441161,0.00010265142,0.00004787591,0.000111968155,0.00008116611,0.0006573096,0.000022422742,0.00001817665],"category_scores_gemma":[0.00025822606,0.000052547453,0.00004627897,0.00035310988,0.00004577679,0.00050350017,0.00010059986,0.00006318646,0.000012325981],"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.000025723735,0.000095323114,0.0017390632,0.000049425915,0.000032655706,0.000004141442,0.0011511777,0.0011723269,0.2833995,0.18959501,0.00012633674,0.5226093],"study_design_scores_gemma":[0.00011358691,0.000021942733,0.0069122706,0.000013177228,0.000004046853,0.000042648615,0.000028644989,0.93231034,0.059001084,0.0010414101,0.00042761271,0.00008325474],"about_ca_topic_score_codex":0.00002733824,"about_ca_topic_score_gemma":3.836097e-7,"teacher_disagreement_score":0.931138,"about_ca_system_score_codex":0.000032572938,"about_ca_system_score_gemma":0.000030889973,"threshold_uncertainty_score":0.2142823},"labels":[],"label_agreement":null},{"id":"W1570066695","doi":"10.1007/978-3-540-72788-0_18","title":"Formalizing Dangerous SAT Encodings","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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; Programming language","score_opus":0.04845076869967927,"score_gpt":0.30244246149739196,"score_spread":0.25399169279771266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570066695","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.000051639574,0.00043062537,0.976619,0.00016430338,0.0030600114,0.00037903973,0.0000022968177,0.00031314357,0.018979952],"genre_scores_gemma":[0.009635337,0.000046132605,0.9878727,0.0015644571,0.00051153544,0.000007000338,0.0000043484642,0.000039303613,0.0003191672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529713,0.000040094375,0.00074022677,0.0015742738,0.0013642616,0.0009839918],"domain_scores_gemma":[0.9967198,0.0004173981,0.0004608107,0.001881593,0.00029512035,0.00022527525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003065808,0.0005830373,0.0005215651,0.0013138411,0.00035364548,0.00063331035,0.004759584,0.00047652802,0.000017592765],"category_scores_gemma":[0.00022286708,0.00056135055,0.00015308442,0.0009393105,0.00072015455,0.0014995789,0.0016788029,0.001094898,0.00012270229],"study_design_candidate":"design_other","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.0000043959376,0.00001203571,0.000029567349,0.00003459341,0.000005147856,0.000056181067,0.00092567876,0.0020627824,0.00019224535,0.10633804,0.000011486243,0.8903279],"study_design_scores_gemma":[0.0004617247,0.00039182734,0.00027273357,0.00081515085,0.000017069677,0.00048086545,5.6701447e-7,0.7188947,0.0141644385,0.23918547,0.023300057,0.0020153841],"about_ca_topic_score_codex":0.000020703583,"about_ca_topic_score_gemma":0.00003321268,"teacher_disagreement_score":0.88831246,"about_ca_system_score_codex":0.0006043469,"about_ca_system_score_gemma":0.0003657346,"threshold_uncertainty_score":0.9996838},"labels":[],"label_agreement":null},{"id":"W1570118157","doi":"10.1007/3-540-44685-0_30","title":"Efficient Multiple-Valued Model-Checking Using Lattice Representations","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":41,"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":"Implementation; Computer science; Lattice (music); Model checking; Theoretical computer science; Reuse; Binary decision diagram; Distributive lattice; Representation (politics); Distributive property; Software implementation; Symbolic trajectory evaluation; Algorithm; Algebra over a field; Software; Mathematics; Programming language; Pure mathematics","score_opus":0.07621353515016023,"score_gpt":0.33717616008605045,"score_spread":0.26096262493589023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570118157","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.00066257064,0.000172367,0.9918573,0.00014052815,0.0016576312,0.00057009043,0.000004398403,0.00026233308,0.0046728184],"genre_scores_gemma":[0.05752608,0.000011725451,0.9415287,0.00045541878,0.00025719378,0.000010389196,0.000003301136,0.000042807264,0.00016437894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950581,0.00009362937,0.00078327605,0.0018915888,0.0013744703,0.00079893396],"domain_scores_gemma":[0.99608886,0.0004962613,0.00052020693,0.00226724,0.00042642228,0.00020102026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001810201,0.0005533975,0.00050257,0.0010696909,0.0005339057,0.0005895261,0.0033728345,0.00035588376,0.000009901015],"category_scores_gemma":[0.00051101914,0.0005587209,0.00016523188,0.0011486909,0.0006632567,0.00056466955,0.0015131672,0.00090956775,0.000028459248],"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.000003917946,0.000025171455,0.000030144662,0.000018339908,0.0000063506623,0.00002433448,0.00078426563,0.8693443,0.00035753852,0.04417194,0.0000014763434,0.085232235],"study_design_scores_gemma":[0.00021994188,0.000035218945,0.00005046266,0.00024306544,0.00001378823,0.000090300346,3.208441e-7,0.9506485,0.0012126716,0.046836603,0.00008218252,0.00056697585],"about_ca_topic_score_codex":0.000048958926,"about_ca_topic_score_gemma":0.00001910705,"teacher_disagreement_score":0.08466526,"about_ca_system_score_codex":0.00067361695,"about_ca_system_score_gemma":0.00059576327,"threshold_uncertainty_score":0.9996864},"labels":[],"label_agreement":null},{"id":"W1570839833","doi":"10.1007/978-3-540-85261-2_23","title":"Using ZBDDs in Points-to Analysis","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Alberta; University of Waterloo","funders":"","keywords":"Computer science; Binary decision diagram; Context (archaeology); Model checking; Overhead (engineering); Compiler; Algorithm; Metric (unit); Domain (mathematical analysis); Programming language; Theoretical computer science; Mathematics","score_opus":0.05614161932072937,"score_gpt":0.31930579602932746,"score_spread":0.2631641767085981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570839833","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.0005413181,0.00016104791,0.99567354,0.00027454103,0.0010724455,0.000350999,0.0000027373817,0.000104721395,0.0018186434],"genre_scores_gemma":[0.033885352,0.000028152985,0.9646317,0.0011813133,0.00016278205,0.000006325622,0.0000021041353,0.000023375842,0.00007892545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955484,0.00009197436,0.0007298145,0.0017663827,0.0011429342,0.00072047004],"domain_scores_gemma":[0.9969938,0.0002701094,0.00029663,0.00200012,0.0002304357,0.00020890894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017411229,0.00048228423,0.000713302,0.003950301,0.00019621414,0.00031849142,0.004006849,0.00032421766,0.000015956408],"category_scores_gemma":[0.00023833399,0.00048523673,0.00019560287,0.0046787197,0.00043365886,0.000768364,0.0014008193,0.00075947656,0.00004747139],"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.0000088579945,0.000042740776,0.00067602156,0.000023621815,0.000041822637,0.00015300007,0.0026025446,0.5247783,0.00023765482,0.017688055,0.000011219969,0.45373616],"study_design_scores_gemma":[0.00012266563,0.000072295334,0.0015386371,0.00014002669,0.000019689798,0.000055661283,1.1122331e-7,0.9785176,0.0010221553,0.0172757,0.0006264602,0.0006089919],"about_ca_topic_score_codex":0.00009439382,"about_ca_topic_score_gemma":0.0001470274,"teacher_disagreement_score":0.4537393,"about_ca_system_score_codex":0.00077023596,"about_ca_system_score_gemma":0.0004883351,"threshold_uncertainty_score":0.9997599},"labels":[],"label_agreement":null},{"id":"W1573750717","doi":"10.1007/978-3-540-45236-2_28","title":"Generating Counterexamples for Multi-valued Model-Checking","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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":"Counterexample; Model checking; Extension (predicate logic); Abstraction model checking; Temporal logic; Computer science; Symbolic trajectory evaluation; Theoretical computer science; Property (philosophy); Algorithm; Computation tree logic; Algebra over a field; Programming language; Mathematics; Discrete mathematics; Pure mathematics","score_opus":0.10573797888699787,"score_gpt":0.33211877481230756,"score_spread":0.22638079592530969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573750717","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.000040480812,0.00032229646,0.99618477,0.00010048421,0.0018826212,0.00077177177,0.000010021103,0.00018540933,0.0005021597],"genre_scores_gemma":[0.0019681514,0.000023922306,0.9953679,0.0020677492,0.00025479443,0.000044497792,0.0000065092618,0.000052175717,0.00021431722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958556,0.00005986137,0.0007295038,0.0017560375,0.00081434567,0.00078464707],"domain_scores_gemma":[0.997132,0.00023772322,0.0004795589,0.0015638991,0.00044083892,0.00014596987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023999028,0.0005800521,0.00055004965,0.00060954003,0.00047582915,0.00072924886,0.0031150447,0.00038261642,0.0000041126464],"category_scores_gemma":[0.00038799376,0.0005637618,0.00017156394,0.00039671818,0.00044805548,0.000857391,0.0006822063,0.0006151476,0.0000081917215],"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.0000045797315,0.000025879695,0.0000073769384,0.000073238545,0.0000111036825,0.00000598909,0.0009016282,0.49607363,0.000917239,0.22730386,0.000020390069,0.2746551],"study_design_scores_gemma":[0.00028851684,0.000076767086,0.00000367511,0.00019513063,0.000007421521,0.000027400527,1.3784481e-7,0.9354431,0.0037735766,0.059082825,0.0005071433,0.0005943206],"about_ca_topic_score_codex":0.000008047495,"about_ca_topic_score_gemma":0.00002530256,"teacher_disagreement_score":0.43936947,"about_ca_system_score_codex":0.00045193228,"about_ca_system_score_gemma":0.00047735567,"threshold_uncertainty_score":0.9996814},"labels":[],"label_agreement":null},{"id":"W1573865009","doi":"10.1007/3-540-45351-2_8","title":"Optimal Paths in Weighted Timed Automata","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":209,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Timed automaton; Reachability; Computer science; Automaton; Deterministic automaton; Reachability problem; Shortest path problem; Floyd–Warshall algorithm; Directed graph; Algorithm; Graph; Dijkstra's algorithm; Theoretical computer science","score_opus":0.021872259693656554,"score_gpt":0.27347287509335083,"score_spread":0.25160061539969425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573865009","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.00021415774,0.0002284741,0.9847003,0.00041520683,0.0022190278,0.00049620494,0.0000038233425,0.00031464733,0.011408118],"genre_scores_gemma":[0.009403779,0.00007311949,0.989088,0.00063574954,0.00026919736,0.00001846512,0.0000072664075,0.00003834569,0.00046608754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951782,0.00009984905,0.00079864456,0.0018399832,0.001193987,0.0008892932],"domain_scores_gemma":[0.99667364,0.00032586118,0.000370009,0.0022458613,0.00019638153,0.00018823313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019765412,0.00059451675,0.0006142444,0.0014602443,0.00016926262,0.0004788139,0.0052278256,0.00049353717,0.000044963588],"category_scores_gemma":[0.0001706757,0.0005707547,0.00011615259,0.0014549752,0.0006410733,0.0011154789,0.0015922472,0.0011260044,0.00013953155],"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.000010209857,0.000057328165,0.000058477344,0.000029450699,0.0000060571674,0.0002167563,0.00073208177,0.016180431,0.000103937564,0.047475185,0.000031384432,0.9350987],"study_design_scores_gemma":[0.00034977074,0.00014241479,0.00038225154,0.00029966317,0.0000036543768,0.00012118344,1.0893699e-7,0.9350987,0.0011036419,0.058140453,0.0036927196,0.00066540873],"about_ca_topic_score_codex":0.00003096274,"about_ca_topic_score_gemma":0.00003375824,"teacher_disagreement_score":0.9344333,"about_ca_system_score_codex":0.00057644385,"about_ca_system_score_gemma":0.00057320774,"threshold_uncertainty_score":0.9996744},"labels":[],"label_agreement":null},{"id":"W1574510674","doi":"10.1109/iscas.1999.777794","title":"Synthesis of checker EFSMs from timing diagram specifications","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Verilog; VHDL; Emulation; Formal verification; Embedded system; Model checking; PCI configuration space; Formal equivalence checking; Hardware description language; Protocol (science); Hardware emulation; Computer architecture; Programming language; Field-programmable gate array; PCI Express","score_opus":0.10242253994581732,"score_gpt":0.2988785508138963,"score_spread":0.19645601086807898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574510674","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.008147912,0.000034658206,0.93560463,0.00008560337,0.00019747594,0.00007770433,0.0000020474424,0.00008243634,0.055767547],"genre_scores_gemma":[0.3436786,0.000009297489,0.65608233,0.000027000833,0.00001091117,0.000015447371,5.6697064e-7,0.0000034873074,0.00017237948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916035,0.00011195678,0.00022694198,0.00021851363,0.00016063209,0.000121586585],"domain_scores_gemma":[0.99886715,0.00019352356,0.00009609367,0.00073769124,0.00006154452,0.000044001605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003842788,0.000070081696,0.000107175474,0.000060522398,0.00005072734,0.000036296842,0.0004901836,0.0000430999,0.00017608819],"category_scores_gemma":[0.00055752025,0.00006290751,0.000044604614,0.00031403897,0.00004102343,0.00029129675,0.000040025403,0.000052674648,0.000118873744],"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":[7.2713635e-7,0.000058674676,0.00062084483,0.0000033764159,0.000009693289,2.7349122e-7,0.00025132005,0.000024043353,0.0054286676,0.9366941,0.00023751459,0.056670792],"study_design_scores_gemma":[0.000072322386,0.0000138078385,0.018945264,0.0000138068735,0.000009491393,0.0000019383913,0.00007664159,0.033041198,0.9300719,0.010131121,0.0074582747,0.00016426497],"about_ca_topic_score_codex":0.000037075464,"about_ca_topic_score_gemma":0.0000020517061,"teacher_disagreement_score":0.92656296,"about_ca_system_score_codex":0.000022526445,"about_ca_system_score_gemma":0.00002681164,"threshold_uncertainty_score":0.2565294},"labels":[],"label_agreement":null},{"id":"W1577104190","doi":"10.1007/3-540-45075-0_14","title":"Refining Timed MSCs","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Computer science; Refining (metallurgy); Focus (optics); Process (computing); Programming language","score_opus":0.03271706940843839,"score_gpt":0.28072903234959096,"score_spread":0.24801196294115258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577104190","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.000016127466,0.00034533898,0.9753164,0.00039444986,0.0029721837,0.00019386252,0.0000018164828,0.00022833938,0.02053145],"genre_scores_gemma":[0.0019193201,0.000023318114,0.99435216,0.0023188724,0.0002347086,0.000009707137,0.0000027150993,0.000036410867,0.0011027906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586236,0.00008193553,0.0006090373,0.0016282956,0.0010941697,0.00072420767],"domain_scores_gemma":[0.99672633,0.0003419614,0.0003811784,0.002125051,0.00024381773,0.00018164917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020527733,0.0005166691,0.00049396907,0.00084299804,0.00027291253,0.00051910285,0.0040029315,0.00040491074,0.000031450993],"category_scores_gemma":[0.00031863098,0.0004958679,0.00012128591,0.0008460161,0.0006297739,0.00083808665,0.0009798297,0.0009925596,0.00015194411],"study_design_candidate":"design_other","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.0000028392851,0.000015519776,0.000020457835,0.000025631847,0.0000068687577,0.000040098617,0.00030929167,0.006361555,0.0001850467,0.17718479,0.000047854748,0.8158001],"study_design_scores_gemma":[0.00037646593,0.00028090144,0.00013785403,0.00052870077,0.000012778813,0.0002385673,9.070697e-8,0.6852813,0.007402657,0.2639699,0.040215,0.0015558223],"about_ca_topic_score_codex":0.000006960867,"about_ca_topic_score_gemma":0.00000920928,"teacher_disagreement_score":0.8142442,"about_ca_system_score_codex":0.0004005396,"about_ca_system_score_gemma":0.00042296163,"threshold_uncertainty_score":0.9997493},"labels":[],"label_agreement":null},{"id":"W1577995630","doi":"10.1007/11691792_14","title":"A Tableau Method for Verifying Dialogue Game Protocols for Agent Communication","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Theoretical computer science; Automaton; Tree automaton; Fragment (logic); Decidability; Set (abstract data type); Property (philosophy); Model checking; Protocol (science); Communications protocol; Temporal logic; Tree (set theory); Translation (biology); Algorithm; Programming language; Mathematics","score_opus":0.06704504113088224,"score_gpt":0.3596336718118863,"score_spread":0.2925886306810041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577995630","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.0000011450702,0.00017037729,0.9803411,0.000512849,0.0008620233,0.016993115,0.000029311654,0.00020551521,0.0008845906],"genre_scores_gemma":[0.00039025757,0.000009865532,0.9908603,0.0006933501,0.00035399504,0.0072915703,0.000045344193,0.00005421132,0.00030111359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603546,0.00013070724,0.00085413654,0.0015240111,0.00069157867,0.00076410844],"domain_scores_gemma":[0.9945292,0.0015651817,0.00071177515,0.002503268,0.00056766707,0.00012292704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0041217064,0.0005422092,0.00065672956,0.00064371695,0.00044869896,0.0007134167,0.004827849,0.0004367228,0.0000028088841],"category_scores_gemma":[0.00048239084,0.0005317312,0.00023693222,0.0005220952,0.0004051118,0.0008445714,0.0009873083,0.0005692907,0.0000073617975],"study_design_candidate":"design_other","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.00002935384,0.00005044635,0.000004325829,0.0002521063,0.00001244535,0.000002221482,0.00058632734,0.049209554,0.00043339623,0.1351824,0.00019453932,0.81404287],"study_design_scores_gemma":[0.00044033874,0.0002386528,0.000020257623,0.00037739376,0.0000104454475,0.000017039803,1.05332326e-7,0.73397833,0.0042454298,0.22410522,0.036058094,0.00050867366],"about_ca_topic_score_codex":0.000043857104,"about_ca_topic_score_gemma":0.00004658515,"teacher_disagreement_score":0.8135342,"about_ca_system_score_codex":0.00057570846,"about_ca_system_score_gemma":0.0005370365,"threshold_uncertainty_score":0.9997134},"labels":[],"label_agreement":null},{"id":"W1578414987","doi":"10.1007/3-540-36103-0_46","title":"Formal Verification of a SONET Telecom System Block","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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":"Synchronous optical networking; Computer science; Telecommunications; Block (permutation group theory); Computer network","score_opus":0.024159776704707186,"score_gpt":0.25018488207580136,"score_spread":0.2260251053710942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578414987","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.00017261776,0.00027174954,0.9903883,0.000099158155,0.0016647334,0.0004846582,0.0000066919933,0.00021001487,0.006702078],"genre_scores_gemma":[0.19277021,0.00003054362,0.8066786,0.00011397764,0.00021387637,0.000014209385,0.0000035906717,0.000027080465,0.00014792966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960442,0.00006867409,0.000896519,0.0012177236,0.0011286307,0.0006442616],"domain_scores_gemma":[0.9964301,0.00023382923,0.0007519247,0.0020704272,0.00037620464,0.00013749734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016120153,0.00046053756,0.00059255154,0.0009033837,0.00020835407,0.0002363311,0.0037937888,0.00039184385,0.000013981841],"category_scores_gemma":[0.00010454178,0.0004452678,0.00014427531,0.0008156923,0.000550158,0.0010689192,0.0008391885,0.0006338531,0.000059211874],"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.000005562157,0.000037942613,0.000024438963,0.00021665788,0.0000125720435,0.000014674831,0.00076506217,0.010326619,0.0003834669,0.1825951,0.00001857153,0.80559933],"study_design_scores_gemma":[0.00021902399,0.00021051256,0.00021321994,0.00045930396,0.000010542213,0.00013405953,3.4613754e-7,0.9822006,0.0074754404,0.0074529015,0.0011039716,0.00052005734],"about_ca_topic_score_codex":0.000015152136,"about_ca_topic_score_gemma":0.000004947465,"teacher_disagreement_score":0.971874,"about_ca_system_score_codex":0.0004520679,"about_ca_system_score_gemma":0.00027298435,"threshold_uncertainty_score":0.9997999},"labels":[],"label_agreement":null},{"id":"W1581024742","doi":"10.1007/978-3-642-03240-0_12","title":"Formal Verification of the Implementability of Timing Requirements","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Computer science; Mathematical proof; Jitter; Component (thermodynamics); Operator (biology); Property (philosophy); Static timing analysis; Software; Simple (philosophy); Formal verification; Software engineering; Theoretical computer science; Programming language; Embedded system; Mathematics","score_opus":0.05685859907238569,"score_gpt":0.3245546435799199,"score_spread":0.26769604450753426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581024742","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.00093477755,0.000070276146,0.99547136,0.00015974953,0.0008732311,0.00047418984,0.0000053828826,0.000029900428,0.0019811061],"genre_scores_gemma":[0.3531961,0.000009526317,0.6465495,0.0001473119,0.000053224234,0.000003830381,0.000001804834,0.000007892279,0.000030765645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969563,0.000071408016,0.00087204756,0.0007098373,0.0010181341,0.00037228758],"domain_scores_gemma":[0.9966364,0.00016051739,0.0008587816,0.0019856894,0.00030849353,0.00005014276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024230385,0.0002570943,0.0003546759,0.00030401078,0.00015482682,0.00006358406,0.0036465537,0.00015882573,0.000010065223],"category_scores_gemma":[0.00017936944,0.00020135455,0.00013241905,0.0005953523,0.000649143,0.00082943426,0.0010055737,0.00034550545,0.000002093438],"study_design_candidate":"design_other","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.0000061324395,0.000031214222,0.00020495127,0.00005881023,0.000005223016,3.940397e-7,0.0006506855,0.0029088338,0.002582515,0.05601461,0.000002380701,0.9375343],"study_design_scores_gemma":[0.0005067336,0.00047753204,0.016460693,0.00073066424,0.000025852809,0.000022263062,9.5158464e-7,0.47903845,0.24065472,0.26052737,0.00083727104,0.00071750727],"about_ca_topic_score_codex":0.000018196182,"about_ca_topic_score_gemma":0.000011838649,"teacher_disagreement_score":0.93681675,"about_ca_system_score_codex":0.00025907796,"about_ca_system_score_gemma":0.00036674694,"threshold_uncertainty_score":0.8211},"labels":[],"label_agreement":null},{"id":"W1581031502","doi":"10.3990/1.9789036529754","title":"Model checking nondeterministic and randomly timed systems","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ImmunoPrecise (Canada)","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Nondeterministic algorithm; Dependability; Computer science; Model checking; Markov decision process; A priori and a posteriori; Set (abstract data type); Markov process; Algorithm; Theoretical computer science; Mathematics","score_opus":0.03412737241085146,"score_gpt":0.3127440207977744,"score_spread":0.27861664838692296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581031502","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.002940642,0.00040897337,0.9315982,0.000016565959,0.0008898332,0.00044225107,0.0000014168072,0.00023055206,0.06347159],"genre_scores_gemma":[0.15446144,0.00009648262,0.803429,0.00009842283,0.00010510252,0.000094431925,0.00008595474,0.000031482647,0.041597683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860924,0.00007393276,0.00037107817,0.00044945776,0.0002917984,0.00020449037],"domain_scores_gemma":[0.99899286,0.000060974937,0.00024479613,0.00052343914,0.00010448796,0.00007341257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189595,0.00022171755,0.00032811993,0.00015932345,0.00010419433,0.00032618543,0.000581278,0.00023182252,0.0000019791903],"category_scores_gemma":[0.00010211862,0.00020171951,0.00004989249,0.00014908458,0.000013934627,0.00034980752,0.000031865246,0.00019172377,0.000019520723],"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.0002354457,0.000111707384,0.000009580972,0.0012650937,0.00008258707,0.00002541605,0.0046031885,0.0036471344,0.0048364815,0.55186355,0.0015185841,0.43180126],"study_design_scores_gemma":[0.000357221,0.00003549536,0.00022362123,0.0001125543,0.000019069339,0.0000131294455,0.000039154645,0.9961681,0.00070686545,0.0019331174,0.00014308904,0.00024863376],"about_ca_topic_score_codex":0.000016088286,"about_ca_topic_score_gemma":0.0000066638668,"teacher_disagreement_score":0.9925209,"about_ca_system_score_codex":0.000038902457,"about_ca_system_score_gemma":0.000101153215,"threshold_uncertainty_score":0.82258826},"labels":[],"label_agreement":null},{"id":"W1581209726","doi":"10.1007/3-540-44830-6_16","title":"A Guided Method for Testing Timed Input Output Automata","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"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":"Computer science; Executable; Automaton; Timed automaton; Conformance testing; Test case; State space; Model-based testing; Algorithm; Theoretical computer science; Programming language; Operating system; Mathematics","score_opus":0.07589610818888788,"score_gpt":0.33648147847699716,"score_spread":0.2605853702881093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581209726","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.0000040127247,0.00015247804,0.9885977,0.00068595755,0.0027296224,0.0011138882,0.0000090747435,0.00044567842,0.00626158],"genre_scores_gemma":[0.00022043647,0.0000063653565,0.9958199,0.0027243416,0.00033550974,0.000060713628,0.0000058794276,0.00006040176,0.00076644565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946101,0.00015014868,0.00097180967,0.0021963832,0.001095013,0.000976594],"domain_scores_gemma":[0.993945,0.0019063225,0.0006757419,0.0025345625,0.0007113928,0.00022695113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004998675,0.0007020164,0.000761396,0.0010282287,0.0004094252,0.0006925179,0.004984088,0.00049503485,0.0000066423518],"category_scores_gemma":[0.0024137339,0.0006729346,0.00018765051,0.0011618151,0.00045773495,0.000875116,0.0012108841,0.0007615394,0.000036521065],"study_design_candidate":"design_other","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.000004226493,0.000023701561,0.0000067526444,0.00007441684,0.000011750255,0.000013606676,0.00032871735,0.01459143,0.00030233726,0.04597106,0.00019320179,0.9384788],"study_design_scores_gemma":[0.0003296864,0.00018275861,0.000025920614,0.00023982972,0.000012179103,0.00013877066,6.826979e-8,0.8179978,0.003234351,0.16893224,0.008248371,0.0006580339],"about_ca_topic_score_codex":0.000016851945,"about_ca_topic_score_gemma":0.00000609826,"teacher_disagreement_score":0.9378208,"about_ca_system_score_codex":0.00049814704,"about_ca_system_score_gemma":0.00077516853,"threshold_uncertainty_score":0.99957216},"labels":[],"label_agreement":null},{"id":"W1581900214","doi":"10.1007/11814948_33","title":"Binary Clause Reasoning in QBF","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":42,"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":"DPLL algorithm; Computer science; Binary number; Binary decision diagram; Boolean satisfiability problem; Fragment (logic); True quantified Boolean formula; Resolution (logic); Context (archaeology); Inference; Binary tree; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Arithmetic","score_opus":0.02207398825870749,"score_gpt":0.2750306988911787,"score_spread":0.2529567106324712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581900214","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.00024837878,0.00046586723,0.9860066,0.00026343032,0.0019031691,0.00036308888,0.0000023105072,0.00019855636,0.010548588],"genre_scores_gemma":[0.030803565,0.000033506574,0.9677159,0.0006112432,0.00031899038,0.000013650523,0.0000055963474,0.000036097394,0.00046142534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576265,0.00008976895,0.0007067528,0.0016772136,0.0009872895,0.00077631825],"domain_scores_gemma":[0.9971628,0.00034525502,0.00035627917,0.0018508547,0.00016007206,0.0001247369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019693724,0.00051910913,0.0005158443,0.0014400994,0.00018204543,0.0004505457,0.004045402,0.00043717577,0.000011852859],"category_scores_gemma":[0.00019837782,0.0005160744,0.00010493305,0.0012087359,0.00059896504,0.0010954763,0.0013696236,0.0011669748,0.000056817382],"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.000010408341,0.00006426463,0.0004218141,0.00006106114,0.0000055089954,0.00027072916,0.0007374459,0.14312217,0.00031121838,0.1106752,0.000113036236,0.74420714],"study_design_scores_gemma":[0.00025355836,0.00013989094,0.0017527628,0.0005941114,0.0000036289125,0.00007367902,9.919585e-8,0.9039777,0.0011652982,0.08889745,0.0023870314,0.00075482164],"about_ca_topic_score_codex":0.000094966395,"about_ca_topic_score_gemma":0.00007795696,"teacher_disagreement_score":0.7608555,"about_ca_system_score_codex":0.0005908757,"about_ca_system_score_gemma":0.00046485037,"threshold_uncertainty_score":0.9997291},"labels":[],"label_agreement":null},{"id":"W1582462262","doi":"10.1007/11951148_7","title":"Timed Use Case Maps","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science","score_opus":0.03311866584520364,"score_gpt":0.27314880959548915,"score_spread":0.2400301437502855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582462262","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.00006390801,0.00018915182,0.99098337,0.00020188681,0.002270838,0.0004208262,0.000011380241,0.00028325073,0.0055754036],"genre_scores_gemma":[0.009194367,0.00001271345,0.98819846,0.00078119064,0.00038406564,0.000010767648,0.000009244767,0.00003866995,0.0013705372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959043,0.000077013545,0.000644586,0.0016716776,0.0009784234,0.00072396826],"domain_scores_gemma":[0.9962822,0.0005376081,0.0003749506,0.0023292433,0.00029532926,0.0001806504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013306687,0.0005614458,0.00048302306,0.00095470314,0.00030978757,0.0009671886,0.0031360842,0.00041852408,0.000017163833],"category_scores_gemma":[0.00021184077,0.0005345126,0.00013850561,0.00077881746,0.00076088466,0.0015366521,0.001300958,0.0008907668,0.00011870368],"study_design_candidate":"design_other","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.0000050703693,0.000036550115,0.000029098253,0.000037511458,0.000008794722,0.002313337,0.0003393113,0.025561398,0.00010130753,0.08526391,0.00027485008,0.8860289],"study_design_scores_gemma":[0.00027266,0.00015208992,0.00009761374,0.0002225422,0.000011725901,0.003527688,6.406465e-8,0.852841,0.0023057582,0.12685193,0.012630963,0.0010859248],"about_ca_topic_score_codex":0.00011580462,"about_ca_topic_score_gemma":0.00007220487,"teacher_disagreement_score":0.88494295,"about_ca_system_score_codex":0.00041744983,"about_ca_system_score_gemma":0.0003843313,"threshold_uncertainty_score":0.9997106},"labels":[],"label_agreement":null},{"id":"W1583070323","doi":"10.1007/978-3-642-45278-9_13","title":"Domino Tatami Covering Is NP-Complete","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Victoria","funders":"","keywords":"Computer science; Domino; NP-complete; Algorithm; Computational complexity theory; Biology","score_opus":0.03364847834741935,"score_gpt":0.2691571672147257,"score_spread":0.23550868886730636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583070323","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.000067556764,0.0002723111,0.98460066,0.00067832397,0.0029973204,0.0005461878,0.000010547859,0.00024384905,0.010583252],"genre_scores_gemma":[0.007308564,0.00005310956,0.9869313,0.004314806,0.00043901516,0.000022859083,0.0000044659214,0.000046551122,0.00087927777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950728,0.00006155981,0.00073966384,0.0019517564,0.001286848,0.00088741217],"domain_scores_gemma":[0.9959191,0.00041993466,0.0004786515,0.002621484,0.0003256109,0.00023520621],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012925597,0.00066608813,0.0006399141,0.0008545651,0.0003244793,0.0010066098,0.005745513,0.00038689317,0.00014111352],"category_scores_gemma":[0.00015504748,0.0006336449,0.00017183169,0.00070485874,0.00082556333,0.0015994683,0.002107949,0.0009967486,0.0006951324],"study_design_candidate":"design_other","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.0000047618555,0.0000207602,0.000018666966,0.00006690254,0.000015000437,0.000035287736,0.0011467017,0.0054269303,0.0009127565,0.11049348,0.0002478565,0.8816109],"study_design_scores_gemma":[0.00028507615,0.0001535591,0.00021039111,0.00028103124,0.000008264574,0.00009864688,1.2985934e-7,0.7381306,0.00403596,0.23723811,0.01851493,0.0010432526],"about_ca_topic_score_codex":0.000050179828,"about_ca_topic_score_gemma":0.00000830382,"teacher_disagreement_score":0.8805676,"about_ca_system_score_codex":0.00043531135,"about_ca_system_score_gemma":0.00037236762,"threshold_uncertainty_score":0.9996339},"labels":[],"label_agreement":null},{"id":"W1583532098","doi":"10.1007/3-540-36126-x_8","title":"Relating Multi-step and Single-Step Microprocessor Correctness Statements","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"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":"Correctness; Computer science; Programming language; Implementation; Microprocessor; Embedded system","score_opus":0.05686852769521183,"score_gpt":0.309988211319619,"score_spread":0.2531196836244072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583532098","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.0002070406,0.0005665089,0.99420047,0.00012817662,0.0021824425,0.00049807504,0.00000518264,0.00019901998,0.0020130728],"genre_scores_gemma":[0.012851058,0.000054716624,0.98541087,0.0004968255,0.00015542014,0.000012213894,0.0000034809482,0.00004396711,0.0009714211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574196,0.00007830978,0.000766634,0.0017844657,0.0009020057,0.0007266457],"domain_scores_gemma":[0.997258,0.0003702564,0.00060743483,0.0012514446,0.00032101013,0.00019187124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012824208,0.0005914847,0.0005347485,0.00069999875,0.000386274,0.00073049386,0.0025398978,0.00036318408,0.000016862412],"category_scores_gemma":[0.00028947266,0.0005701168,0.0000746436,0.00066223316,0.00073761353,0.0014024127,0.0014055122,0.000879196,0.00003968203],"study_design_candidate":"design_other","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.0000045527895,0.000050802548,0.00012296684,0.00010312351,0.000009923273,0.000035200315,0.0012050926,0.0026688857,0.00069223635,0.0045592417,0.000012956374,0.990535],"study_design_scores_gemma":[0.0004180085,0.00018196457,0.00014201197,0.00056638673,0.000009597335,0.000112777074,6.388306e-7,0.9878583,0.0028927547,0.005557863,0.0015145054,0.00074518763],"about_ca_topic_score_codex":0.000026996853,"about_ca_topic_score_gemma":0.000033059936,"teacher_disagreement_score":0.98978984,"about_ca_system_score_codex":0.00036946282,"about_ca_system_score_gemma":0.00014835288,"threshold_uncertainty_score":0.99967504},"labels":[],"label_agreement":null},{"id":"W1583594812","doi":"10.1109/async.1998.666501","title":"Verifying a self-timed divider","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 British Columbia","funders":"","keywords":"Correctness; Computer science; Model checking; Tautology (logic); Programming language; Formal verification; Automaton; Theoretical computer science; Static timing analysis; Graph; Algorithm; Embedded system","score_opus":0.04726623936361861,"score_gpt":0.25612401555441605,"score_spread":0.20885777619079743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583594812","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.001797985,0.000056097462,0.925081,0.00040225722,0.00026289865,0.000068741414,7.169655e-8,0.0005312968,0.07179964],"genre_scores_gemma":[0.1303879,0.000009343496,0.86814916,0.00037333136,0.000026393007,0.000009568124,8.671318e-8,0.0000036096285,0.0010406068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934936,0.000048185557,0.000110273366,0.00018261955,0.00015272545,0.00015685496],"domain_scores_gemma":[0.9994167,0.00003776155,0.000031434538,0.0004406799,0.000027157957,0.000046269117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021832905,0.000059015118,0.00005805267,0.000043063472,0.00006966046,0.00008579793,0.00049754576,0.00003175209,0.00019851861],"category_scores_gemma":[0.000054908738,0.000051395662,0.000026115846,0.0002465834,0.000010728697,0.00056820177,0.00011902247,0.000060612656,0.00067277777],"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":[9.635539e-7,0.00013193928,0.0005123532,0.000018139428,0.000019741581,0.0000061232536,0.0027019526,0.000029920471,0.0012790433,0.63299835,0.01002967,0.3522718],"study_design_scores_gemma":[0.00015408074,0.000033373934,0.0018979174,0.000004272923,0.000002540989,0.000014508043,0.000009772822,0.94985694,0.006210545,0.001822969,0.039841652,0.0001514487],"about_ca_topic_score_codex":0.000004283851,"about_ca_topic_score_gemma":3.2428625e-7,"teacher_disagreement_score":0.949827,"about_ca_system_score_codex":0.000024927098,"about_ca_system_score_gemma":0.0000041541693,"threshold_uncertainty_score":0.86474216},"labels":[],"label_agreement":null},{"id":"W1585202549","doi":"10.1007/978-3-540-69149-5_37","title":"Model-Checking Software Using Precise Abstractions","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"","keywords":"Computer science; Concurrency; Compiler; Software; Exploit; Software engineering; Software quality; Software construction; Software verification; Programming language; Software development; Software framework; Operating system; Distributed computing; Computer security","score_opus":0.08131206888019911,"score_gpt":0.31204394156780363,"score_spread":0.23073187268760453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585202549","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.00015634524,0.00030080558,0.99518484,0.000075541364,0.0019051405,0.00036752032,0.000005432179,0.0003189603,0.0016853991],"genre_scores_gemma":[0.014436846,0.00008055054,0.9846268,0.00031329753,0.00028704933,0.000008247819,0.0000028487582,0.00004221547,0.0002021003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597436,0.00003769034,0.0006481242,0.0015445838,0.0011194409,0.0006757853],"domain_scores_gemma":[0.99685925,0.00029161765,0.00046056963,0.0018655333,0.0003399674,0.00018305055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000884551,0.0005245807,0.00046395836,0.0009480171,0.00058133213,0.0004243936,0.0032445819,0.00042475158,0.0000116848905],"category_scores_gemma":[0.00021638261,0.0005343418,0.00016039879,0.0005849491,0.00066843256,0.0015429545,0.0011095244,0.0010926201,0.00004144411],"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.000002291368,0.000017619795,0.0000125285105,0.000019344967,0.0000052381606,0.00002775496,0.00061578146,0.62506104,0.00019933641,0.0040837303,0.000009973171,0.36994538],"study_design_scores_gemma":[0.00009755633,0.000036923753,0.000050580693,0.00022141937,0.000006950893,0.00021858118,6.304915e-8,0.94823956,0.0016335087,0.048517518,0.0004289026,0.00054844836],"about_ca_topic_score_codex":0.000019739538,"about_ca_topic_score_gemma":0.000015285763,"teacher_disagreement_score":0.36939692,"about_ca_system_score_codex":0.000666626,"about_ca_system_score_gemma":0.0009301241,"threshold_uncertainty_score":0.9997108},"labels":[],"label_agreement":null},{"id":"W1585743220","doi":"10.1109/icnp.1995.524814","title":"Verification and diagnosis of testing equivalence and reduction relation","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Formal specification; Conformance testing; Equivalence (formal languages); Specification language; Reduction (mathematics); Language Of Temporal Ordering Specification; System requirements specification; Graph; Programming language; Reliability engineering; Theoretical computer science; Software engineering; Engineering; Mathematics; Operating system","score_opus":0.1010984233099527,"score_gpt":0.2838532014039411,"score_spread":0.1827547780939884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585743220","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.40330893,0.0003460585,0.5916918,0.00032156476,0.00012249131,0.00013381604,3.0138975e-7,0.00008234059,0.00399271],"genre_scores_gemma":[0.55558485,0.0001286533,0.44422168,0.0000056720455,0.000008282841,0.000008165922,1.4929526e-7,0.0000014092532,0.000041133553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994486,0.00004932164,0.00015631766,0.00018288037,0.00009798707,0.00006489496],"domain_scores_gemma":[0.9995092,0.00008908102,0.000104331964,0.00020616133,0.00006551523,0.000025685047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031028388,0.000045681318,0.000053815842,0.000060201855,0.000061292056,0.000030990414,0.00009623208,0.000033417276,0.00000813378],"category_scores_gemma":[0.0003273985,0.000044946093,0.0000060109483,0.00026928043,0.000053912354,0.00072870293,0.000046096608,0.00004051373,0.0000034248048],"study_design_candidate":"design_other","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.0000017307785,0.00003541531,0.019251836,0.000047430924,0.0000031913792,1.4985973e-7,0.0011149084,0.0000478534,0.024021495,0.15908085,0.00008561723,0.79630953],"study_design_scores_gemma":[0.00015618818,0.00016153968,0.22216077,0.000049634305,0.000007605034,0.00003962057,0.000056671248,0.7254506,0.046641786,0.004983356,0.00015396769,0.000138307],"about_ca_topic_score_codex":0.000014468253,"about_ca_topic_score_gemma":1.479568e-7,"teacher_disagreement_score":0.7961712,"about_ca_system_score_codex":0.000012165688,"about_ca_system_score_gemma":0.0000026974444,"threshold_uncertainty_score":0.18328485},"labels":[],"label_agreement":null},{"id":"W1587984077","doi":"10.1007/978-3-642-02979-0_32","title":"Are Statecharts Finite Automata?","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Western University","funders":"","keywords":"Rotation formalisms in three dimensions; Computer science; Finite-state machine; Automaton; Unified Modeling Language; Expressive power; Programming language; Computation; Theoretical computer science; Mathematical proof; Mathematics; Software","score_opus":0.03141868547614888,"score_gpt":0.28195436048397315,"score_spread":0.25053567500782425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587984077","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.000023812374,0.00021723565,0.9909473,0.00070349756,0.0019624815,0.00039136087,0.000007266897,0.0005127499,0.005234262],"genre_scores_gemma":[0.009563845,0.00005547516,0.98682845,0.002575576,0.000314521,0.0000091486045,0.0000044219773,0.000032920103,0.0006156644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956129,0.00006387122,0.0006380217,0.0016853379,0.0012365456,0.0007632958],"domain_scores_gemma":[0.9959973,0.00036023516,0.0007497011,0.0024045485,0.0002862069,0.00020201303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015226718,0.00058168836,0.00056054606,0.0010274701,0.0002715665,0.000665332,0.004620691,0.00039447538,0.000018737295],"category_scores_gemma":[0.00031927356,0.00055586215,0.00013032813,0.0008042065,0.0005425402,0.0011045918,0.0010668037,0.00095338695,0.00015752176],"study_design_candidate":"design_other","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.000003634273,0.000024034896,0.000013904579,0.000025869604,0.000004344036,0.00009776066,0.00027436166,0.01630113,0.000038602102,0.035474297,0.000036193876,0.94770586],"study_design_scores_gemma":[0.00020322706,0.00016976571,0.00064358255,0.00041852635,0.0000052636774,0.00006613036,7.333775e-8,0.7258241,0.001893304,0.26232457,0.007685842,0.0007656061],"about_ca_topic_score_codex":0.0000056216827,"about_ca_topic_score_gemma":0.000015361898,"teacher_disagreement_score":0.94694024,"about_ca_system_score_codex":0.0003732075,"about_ca_system_score_gemma":0.00034471284,"threshold_uncertainty_score":0.9996893},"labels":[],"label_agreement":null},{"id":"W1588360024","doi":"10.1007/11888116_15","title":"Generalizing the Submodule Construction Techniques for Extended State Machine Models","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Ottawa","funders":"","keywords":"Computer science; Parameterized complexity; Negation; Automaton; Theoretical computer science; State (computer science); Algorithm; Finite-state machine; Simple (philosophy); Programming language","score_opus":0.02887363968412839,"score_gpt":0.2771440362517523,"score_spread":0.24827039656762392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588360024","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.00002182988,0.0003755119,0.9946711,0.00047955365,0.0014073597,0.0009702008,0.000017723527,0.0003057684,0.0017509224],"genre_scores_gemma":[0.0075333463,0.000047308895,0.9911505,0.00060000905,0.0003374009,0.0000647803,0.000010393869,0.000034740107,0.00022151193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685025,0.00006874036,0.00058838754,0.0012164188,0.0007092058,0.0005670243],"domain_scores_gemma":[0.9973509,0.0002903503,0.00043831646,0.0015050957,0.00034239516,0.00007299652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018699259,0.0004461576,0.00038488762,0.00052065926,0.00045969326,0.00054950645,0.0029524195,0.00022890983,0.0000022760653],"category_scores_gemma":[0.0000628801,0.00034123665,0.000140403,0.00045298517,0.00083941274,0.00095818366,0.0006736859,0.0005637049,0.0000029227374],"study_design_candidate":"design_other","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.000005760474,0.000010215018,0.000002543897,0.00002406475,0.000005235247,0.0000029441107,0.00019948732,0.059476648,0.00030309558,0.16571869,0.000031843167,0.77421945],"study_design_scores_gemma":[0.00007085656,0.000059479473,0.000009718655,0.000058145673,0.0000040487166,0.00004065639,5.199169e-8,0.57969844,0.009165291,0.4096212,0.0010180409,0.0002540581],"about_ca_topic_score_codex":0.00006360634,"about_ca_topic_score_gemma":0.000035941084,"teacher_disagreement_score":0.7739654,"about_ca_system_score_codex":0.00031336362,"about_ca_system_score_gemma":0.00026672613,"threshold_uncertainty_score":0.999904},"labels":[],"label_agreement":null},{"id":"W1590719333","doi":"10.1007/978-3-642-16265-7_18","title":"Systematic Translation Rules from astd to Event-B","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Translation (biology); Event (particle physics); Transfer-based machine translation; Programming language; Process calculus; Process (computing); Natural language processing; Mathematical proof; Set (abstract data type); Animation; Software engineering; Artificial intelligence; Machine translation; Example-based machine translation; Computer graphics (images); Mathematics","score_opus":0.025712222896877673,"score_gpt":0.2800246125856278,"score_spread":0.2543123896887501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590719333","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.00016516287,0.00034998677,0.99336815,0.00042537096,0.0034536032,0.0010029008,0.000012428206,0.00020195873,0.0010204539],"genre_scores_gemma":[0.013607578,0.000009352675,0.9851412,0.0006944644,0.0003815931,0.000033652574,0.000008446368,0.0000315941,0.00009212918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958683,0.000100649915,0.0008394554,0.001476272,0.0012036484,0.0005116304],"domain_scores_gemma":[0.99637777,0.00068235525,0.0004031252,0.0020841004,0.00023216564,0.00022050536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017829629,0.0004972732,0.0006545973,0.00082325295,0.00023278169,0.0006452391,0.0041130167,0.00045121223,0.000023961466],"category_scores_gemma":[0.00029074115,0.00045070268,0.00014294537,0.0005467777,0.00028678885,0.000823455,0.0005860868,0.00089604175,0.00027099266],"study_design_candidate":"design_other","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.000012131389,0.00004756546,0.000014956589,0.0011497808,0.000031770072,0.000033150765,0.004481918,0.0138555365,0.0054676044,0.06552024,0.000006446818,0.9093789],"study_design_scores_gemma":[0.00022259867,0.00017224053,0.00017711226,0.0046708654,0.000025817346,0.000037050137,2.9478912e-7,0.72738796,0.011576074,0.25388557,0.0008208923,0.0010235145],"about_ca_topic_score_codex":0.000033081997,"about_ca_topic_score_gemma":0.00008965578,"teacher_disagreement_score":0.90835536,"about_ca_system_score_codex":0.00022778778,"about_ca_system_score_gemma":0.00029824243,"threshold_uncertainty_score":0.9997945},"labels":[],"label_agreement":null},{"id":"W1592359484","doi":"10.1007/3-540-45251-6_5","title":"Model-Checking Over Multi-Valued Logics","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":69,"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":"Correctness; Computer science; Model checking; Extension (predicate logic); Semantics (computer science); Theoretical computer science; Computation tree logic; Temporal logic; CTL*; Programming language","score_opus":0.08175201863392131,"score_gpt":0.3215951428315679,"score_spread":0.2398431241976466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592359484","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.000053577733,0.0002739055,0.99002486,0.00011884208,0.0019110481,0.00043106655,0.0000034749428,0.00031702986,0.006866207],"genre_scores_gemma":[0.01229423,0.00008614958,0.9853027,0.0014782329,0.00028319328,0.000010764922,0.0000036083218,0.000044360004,0.0004967492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99517,0.000064328204,0.0007018183,0.0019106673,0.0012891021,0.0008641054],"domain_scores_gemma":[0.9966194,0.00016967305,0.0004610004,0.002251893,0.00029347753,0.00020454312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018230802,0.0006521179,0.0005770804,0.0008729713,0.00032328907,0.0006158565,0.004839069,0.0005458106,0.000021032447],"category_scores_gemma":[0.00023348692,0.00061106886,0.00017562007,0.0008316702,0.00071184407,0.0011298232,0.0018136668,0.0011616296,0.00005473681],"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.000005242888,0.0000420483,0.00004639629,0.000030702002,0.000008828387,0.000057866102,0.00073550275,0.3093268,0.00021870216,0.252717,0.000013572842,0.43679735],"study_design_scores_gemma":[0.00021895199,0.0000618938,0.000084324805,0.00016714288,0.0000059014883,0.000050129634,5.7812215e-8,0.8574085,0.00076578785,0.14007643,0.0005508122,0.0006100751],"about_ca_topic_score_codex":0.00001637934,"about_ca_topic_score_gemma":0.000026879057,"teacher_disagreement_score":0.5480817,"about_ca_system_score_codex":0.0005640966,"about_ca_system_score_gemma":0.0004981783,"threshold_uncertainty_score":0.9996341},"labels":[],"label_agreement":null},{"id":"W1592823304","doi":"10.1007/978-3-642-04766-4_20","title":"Generating In-Line Monitors for Rabin Automata","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université Laval","funders":"","keywords":"Computer science; Automaton; Line (geometry); Theoretical computer science; Mathematics","score_opus":0.036755691033083425,"score_gpt":0.30750734246625006,"score_spread":0.27075165143316665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592823304","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.00014896711,0.0002575923,0.99485344,0.00052710803,0.0023561323,0.000714627,0.0000041695953,0.00020423518,0.0009337356],"genre_scores_gemma":[0.009256322,0.000026751472,0.9889257,0.0008855001,0.0006269003,0.000026816935,0.000006406102,0.000028719836,0.00021688572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621356,0.000057935216,0.0007658374,0.001507651,0.0007502462,0.00070479495],"domain_scores_gemma":[0.9973081,0.0004501992,0.00037219527,0.0015238491,0.00022181177,0.00012387648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022296428,0.00048503446,0.00052721717,0.0009828152,0.0002252932,0.00048250717,0.003557663,0.0003664358,0.0000037554794],"category_scores_gemma":[0.00036067786,0.00047092602,0.000118545526,0.0007335798,0.00030723884,0.00082892855,0.0006537977,0.00067145756,0.000012090187],"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.000004413734,0.000022238262,0.000010959494,0.0000263022,0.0000023332534,0.000012143119,0.00029540516,0.09668557,0.00035694212,0.019376071,0.00001067568,0.88319695],"study_design_scores_gemma":[0.0002975943,0.00021550883,0.000081064834,0.0002438078,0.0000031004136,0.000025067538,1.0022951e-7,0.9049164,0.0039616516,0.08896679,0.0008111558,0.00047775797],"about_ca_topic_score_codex":0.000012676973,"about_ca_topic_score_gemma":0.000029330637,"teacher_disagreement_score":0.88271916,"about_ca_system_score_codex":0.00036323388,"about_ca_system_score_gemma":0.00042610662,"threshold_uncertainty_score":0.9997742},"labels":[],"label_agreement":null},{"id":"W1594158026","doi":"10.1007/978-3-540-73770-4_2","title":"Testable Requirements and Specifications","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"York University","funders":"","keywords":"Computer science; Eiffel; System requirements specification; Artifact (error); Formal specification; Software requirements specification; Programming language; Requirements analysis; Software engineering; Software design; Software development; Object-oriented programming; Artificial intelligence; Software","score_opus":0.10731488702487334,"score_gpt":0.3223114675278867,"score_spread":0.21499658050301335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594158026","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.00001880441,0.00040668386,0.97674406,0.00032519325,0.001198764,0.0003409263,0.0000026318744,0.0001410253,0.020821944],"genre_scores_gemma":[0.0056534614,0.000092799506,0.99276793,0.00058397086,0.0002598823,0.0000066252996,0.0000029638938,0.000021995393,0.0006103517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996805,0.000028426737,0.0005111111,0.0012811648,0.0008275823,0.0005467051],"domain_scores_gemma":[0.99745244,0.00030432368,0.00028138264,0.0015551404,0.00023699319,0.0001697221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018886811,0.0003553282,0.00031335148,0.0008476582,0.00028680352,0.00046617564,0.0023384884,0.00024584203,0.000022220507],"category_scores_gemma":[0.00017598073,0.00034866502,0.000049375805,0.00068267854,0.0007430785,0.00092936656,0.0009816458,0.00055415573,0.00005050209],"study_design_candidate":"design_other","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.0000021432047,0.000017944803,0.000055970355,0.000021260716,0.0000041772887,0.000014596339,0.0003250843,0.0007011138,0.00024451822,0.21999195,0.000019916517,0.77860135],"study_design_scores_gemma":[0.00036366598,0.00024495085,0.001699488,0.00043469944,0.00001283174,0.00015110882,3.5434292e-7,0.5082206,0.0070323176,0.45701614,0.023577277,0.0012465715],"about_ca_topic_score_codex":0.000011204935,"about_ca_topic_score_gemma":0.00001791425,"teacher_disagreement_score":0.7773548,"about_ca_system_score_codex":0.00029797672,"about_ca_system_score_gemma":0.00025707425,"threshold_uncertainty_score":0.9998965},"labels":[],"label_agreement":null},{"id":"W1595825122","doi":"10.1007/978-3-540-73210-5_18","title":"Verification of Probabilistic Properties in HOL Using the Cumulative Distribution Function","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"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; Probabilistic logic; Computer science; Random variable; Automated theorem proving; Theoretical computer science; Cumulative distribution function; Complement (music); Variable (mathematics); Probabilistic analysis of algorithms; Function (biology); Algorithm; Probability density function; Mathematics; Programming language; Artificial intelligence; Statistics","score_opus":0.08845228833344676,"score_gpt":0.3074550213640024,"score_spread":0.21900273303055562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595825122","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.0022827773,0.00019531292,0.9954074,0.00007939992,0.00093429687,0.0007461154,0.000004022412,0.000048630518,0.00030206278],"genre_scores_gemma":[0.6289464,0.000010189192,0.3707761,0.00008937554,0.00011908079,0.000012699444,0.000008049296,0.000014224609,0.000023867684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972466,0.00010595294,0.0006786842,0.00081067695,0.00080165354,0.0003564052],"domain_scores_gemma":[0.99770993,0.00024743922,0.0005240161,0.0010726103,0.00040189846,0.000044112872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025311718,0.00029110516,0.0003091717,0.00043689177,0.00017467201,0.00014754926,0.0015439718,0.00023674798,0.0000025026677],"category_scores_gemma":[0.0003780708,0.00021657794,0.0000664177,0.0010028769,0.0009153372,0.00071149756,0.0003867917,0.00055981963,0.0000033607546],"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.000047145997,0.00007176828,0.00012928997,0.0001258938,0.000008894928,0.000004103678,0.0021185994,0.34696847,0.002404491,0.13363288,0.0000011294168,0.5144873],"study_design_scores_gemma":[0.000104634324,0.0001157233,0.0016407566,0.00035693953,0.000008189871,0.000012494712,8.569331e-7,0.9400693,0.0057211784,0.05161875,0.00009794819,0.00025322378],"about_ca_topic_score_codex":0.000055316443,"about_ca_topic_score_gemma":0.000040417162,"teacher_disagreement_score":0.6266636,"about_ca_system_score_codex":0.0006342569,"about_ca_system_score_gemma":0.000357415,"threshold_uncertainty_score":0.88317925},"labels":[],"label_agreement":null},{"id":"W1597075322","doi":"10.1007/978-3-642-14186-7_29","title":"Exploiting Circuit Representations in QBF Solving","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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","funders":"","keywords":"Computer science; Solver; Set (abstract data type); Representation (politics); Simple (philosophy); Algorithm; Dual (grammatical number); Theoretical computer science; Parallel computing; Programming language","score_opus":0.04800651739617787,"score_gpt":0.3027290508360599,"score_spread":0.25472253343988205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597075322","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.00021927146,0.00010287623,0.9836098,0.00029129963,0.002498713,0.00039398417,0.0000018444271,0.0001832774,0.012698949],"genre_scores_gemma":[0.064659886,0.000027110125,0.9342379,0.00047024095,0.00039560863,0.000024590143,0.000003360621,0.00003240587,0.00014888943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591386,0.00007182051,0.0007475972,0.0016279533,0.00093481154,0.000703961],"domain_scores_gemma":[0.99661714,0.0006702406,0.00040143056,0.0019464367,0.0002226974,0.00014206045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021808746,0.00041679724,0.00043097138,0.0013030019,0.0003047872,0.0006312958,0.0038704586,0.00040650027,0.000025823321],"category_scores_gemma":[0.0006854617,0.00044010117,0.000103397695,0.0009940411,0.0006052788,0.0014237929,0.0012867029,0.001683355,0.000048565627],"study_design_candidate":"design_other","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.0000018963308,0.00002720141,0.00026285136,0.00003629041,0.0000041271414,0.000066766755,0.0027541588,0.012604753,0.002892105,0.12025382,0.000003046352,0.861093],"study_design_scores_gemma":[0.00025393412,0.00006511083,0.0010606715,0.00045287033,0.0000046461464,0.00010397416,0.0000010076285,0.59220153,0.009703342,0.3945081,0.00081221986,0.0008325861],"about_ca_topic_score_codex":0.000057032914,"about_ca_topic_score_gemma":0.00015569205,"teacher_disagreement_score":0.86026037,"about_ca_system_score_codex":0.0003217717,"about_ca_system_score_gemma":0.00046695973,"threshold_uncertainty_score":0.9998051},"labels":[],"label_agreement":null},{"id":"W1598558921","doi":"10.1007/978-3-540-71289-3_27","title":"Finding Environment Guarantees","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"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":"Correctness; Component (thermodynamics); Computer science; Property (philosophy); Model checking; Distributed computing; Theoretical computer science; Programming language","score_opus":0.04373042902772654,"score_gpt":0.2901269383810395,"score_spread":0.24639650935331295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598558921","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.00004548336,0.00041428627,0.98803455,0.00017661776,0.0018981964,0.00033165657,0.0000020831856,0.00015991593,0.0089372285],"genre_scores_gemma":[0.0097986525,0.00007840221,0.9885817,0.0007426754,0.00034483414,0.0000062742215,0.000002489521,0.00002957221,0.00041539618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958995,0.000038801572,0.00059720513,0.0014921685,0.0012395761,0.0007327282],"domain_scores_gemma":[0.99731183,0.00034979612,0.0003417028,0.0017719314,0.00007834499,0.00014638298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022912482,0.00048740974,0.0004192885,0.0010101247,0.00026283495,0.00037249117,0.0038690434,0.00036044206,0.000045248187],"category_scores_gemma":[0.000101123216,0.00046555325,0.00012327451,0.00044371648,0.0007194601,0.00071362196,0.0013364684,0.0008453762,0.00018861654],"study_design_candidate":"design_other","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.0000034197196,0.000017178432,0.000024298106,0.000020702462,0.000005668041,0.0000505452,0.00050333916,0.013627927,0.00018660071,0.09852259,0.0000063317734,0.8870314],"study_design_scores_gemma":[0.00026343437,0.00022942605,0.00038440613,0.0003861454,0.000009114165,0.00013739003,1.9357778e-7,0.7767865,0.009693058,0.20012276,0.010835909,0.0011516754],"about_ca_topic_score_codex":0.0000078558,"about_ca_topic_score_gemma":0.0000072041066,"teacher_disagreement_score":0.88587976,"about_ca_system_score_codex":0.00055193494,"about_ca_system_score_gemma":0.00020954921,"threshold_uncertainty_score":0.99977964},"labels":[],"label_agreement":null},{"id":"W1599379570","doi":"10.1007/978-3-540-30494-4_22","title":"Extending Extended Vacuity","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":42,"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","score_opus":0.03123223046150592,"score_gpt":0.29548026011345296,"score_spread":0.26424802965194705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599379570","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.000029155986,0.00035690906,0.98574096,0.00029996686,0.0032110743,0.00041231315,0.000002981956,0.0003432462,0.009603376],"genre_scores_gemma":[0.04323874,0.00005424395,0.95526147,0.0007492649,0.00039609033,0.000011601336,0.0000029027378,0.00003723262,0.0002484821],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952305,0.00005854439,0.00065763784,0.0019174422,0.0013003846,0.0008354978],"domain_scores_gemma":[0.9965358,0.00026877545,0.0004160214,0.0023045542,0.00025315298,0.00022171994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019662122,0.0005978113,0.00055040076,0.001022463,0.00035559692,0.0006307615,0.005196568,0.000415493,0.00004797392],"category_scores_gemma":[0.00024366617,0.0005730595,0.00016625386,0.0008581033,0.0007672603,0.0012415414,0.0016846276,0.0011053303,0.000114300805],"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.00000250737,0.000019847974,0.000006179298,0.000026242098,0.0000047353724,0.00004732331,0.0003134464,0.00744486,0.0001519118,0.36393967,0.0000031266409,0.62804013],"study_design_scores_gemma":[0.00024778416,0.00014920549,0.000434278,0.00039021892,0.0000069015496,0.00011671002,7.9199026e-8,0.24279599,0.0044778655,0.7497042,0.0008917479,0.0007850483],"about_ca_topic_score_codex":0.00001850332,"about_ca_topic_score_gemma":0.000012345539,"teacher_disagreement_score":0.6272551,"about_ca_system_score_codex":0.00096712366,"about_ca_system_score_gemma":0.00083710824,"threshold_uncertainty_score":0.9996721},"labels":[],"label_agreement":null},{"id":"W1599841503","doi":"10.1109/icm.2001.997660","title":"Design and verification of an ATM Knockout switch concentrator","year":2001,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Concentrator; Asynchronous Transfer Mode; Computer science; Formal equivalence checking; Verilog; Embedded system; Computer network; Formal verification; Algorithm; Telecommunications","score_opus":0.04207823581160932,"score_gpt":0.2991733183075959,"score_spread":0.2570950824959866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599841503","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.12781857,0.00004033621,0.8708177,0.00006572972,0.00008404954,0.00013617918,1.5020774e-7,0.000070282294,0.0009669615],"genre_scores_gemma":[0.40430254,0.000023438992,0.59556,0.0000443615,0.000009324767,0.000005255426,4.9642483e-7,0.0000023289638,0.00005221513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992946,0.00010267505,0.00016618705,0.00020349673,0.00012293528,0.000110108886],"domain_scores_gemma":[0.9993264,0.000044574776,0.00007719868,0.00041704506,0.00007409061,0.000060662962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004905092,0.00006033671,0.00007889747,0.00003288489,0.000041487932,0.000041864638,0.00031700663,0.000040298648,0.000014298491],"category_scores_gemma":[0.000040724397,0.000054279997,0.000009877982,0.00020932629,0.000041898937,0.0006365874,0.0000333151,0.00003679391,0.000009586198],"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.000044214492,0.00013917209,0.001195963,0.000017903421,0.000010927113,0.000002697389,0.0014644343,0.0002632352,0.14987424,0.39111593,0.000111187925,0.4557601],"study_design_scores_gemma":[0.00031416363,0.0002289343,0.01680621,0.0000075810476,0.000004694831,0.000028053453,0.00006287021,0.6442848,0.33313954,0.0031351012,0.0018316392,0.00015643216],"about_ca_topic_score_codex":0.000013826464,"about_ca_topic_score_gemma":5.669937e-7,"teacher_disagreement_score":0.6440216,"about_ca_system_score_codex":0.000015389262,"about_ca_system_score_gemma":0.000032358937,"threshold_uncertainty_score":0.2213474},"labels":[],"label_agreement":null},{"id":"W159998745","doi":"","title":"Fair cycle detection using description logic reasoning","year":2009,"lang":"en","type":"article","venue":"Research Explorer (The University of Manchester)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 Waterloo","funders":"","keywords":"Liveness; Computation tree logic; Counterexample; Model checking; Temporal logic; Path (computing); Linear temporal logic; State (computer science); Theoretical computer science; Computer science; Set (abstract data type); Mathematics; Computation; CTL*; Discrete mathematics; Algorithm; Programming language","score_opus":0.16611852623525297,"score_gpt":0.3396573054754267,"score_spread":0.17353877924017375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159998745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43772045,0.000027906117,0.5616121,0.00025329544,0.00005525778,0.00012514797,1.6090002e-7,0.000053080534,0.00015255077],"genre_scores_gemma":[0.8380668,0.000036288155,0.16182862,0.000023820225,0.00003026112,3.1469742e-7,5.005126e-7,0.000003535805,0.000009831808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982213,0.00055062614,0.00011699106,0.00028588128,0.00051298225,0.00031224295],"domain_scores_gemma":[0.9989123,0.00008469574,0.00009124458,0.0006053747,0.00023713078,0.00006929551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018723203,0.000082531405,0.00010857551,0.00023073584,0.00052187045,0.00006867349,0.0010139785,0.000070131624,0.000008544274],"category_scores_gemma":[0.00014052722,0.00007805627,0.00006218233,0.0006948369,0.00018305157,0.0012538057,0.000242097,0.00030261112,0.000044501987],"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.00033265047,0.00040582963,0.0010902799,0.000116372976,0.00006151795,0.00006418409,0.11156763,0.0062904963,0.23296475,0.1376205,0.0002406415,0.50924516],"study_design_scores_gemma":[0.00071226805,0.00067569554,0.0814844,0.00018692693,0.000018983505,0.000048454665,0.014293818,0.8142362,0.04410023,0.041977175,0.0019101924,0.00035563836],"about_ca_topic_score_codex":0.000014274987,"about_ca_topic_score_gemma":0.0000011712472,"teacher_disagreement_score":0.8079457,"about_ca_system_score_codex":0.00025431125,"about_ca_system_score_gemma":0.00004651714,"threshold_uncertainty_score":0.40138584},"labels":[],"label_agreement":null},{"id":"W1600640230","doi":"10.1007/978-3-540-73099-6_7","title":"Bounded Model Checking with Description Logic Reasoning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Model checking; Bounded function; Computer science; Abstraction model checking; Rotation formalisms in three dimensions; Representation (politics); Theoretical computer science; Consistency (knowledge bases); Solver; Non-monotonic logic; Algorithm; Knowledge representation and reasoning; Programming language; Mathematics; Artificial intelligence","score_opus":0.06949350271629555,"score_gpt":0.29908093031899025,"score_spread":0.22958742760269468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600640230","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.00010398393,0.00019394196,0.9870434,0.000098325065,0.0008891765,0.00037821356,0.0000010549151,0.00028891553,0.011003019],"genre_scores_gemma":[0.026970841,0.000026386995,0.9715217,0.00095394155,0.0002104159,0.000008289958,0.000003324047,0.00003676431,0.0002683612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957694,0.000041100615,0.0005358698,0.0015903771,0.001273483,0.00078980747],"domain_scores_gemma":[0.9972903,0.00015905978,0.00045535242,0.0015667969,0.0003604943,0.0001679548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024507304,0.00053885183,0.00045392915,0.0009547302,0.00038348782,0.00083174417,0.00294821,0.00039408958,0.0000052991845],"category_scores_gemma":[0.00014212061,0.0004659335,0.000087320725,0.0008468092,0.00073989807,0.001486518,0.0007691344,0.0010134828,0.000020668693],"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.000015043892,0.000019767087,0.00002854628,0.000041962718,0.000007709474,0.0000462396,0.0009843446,0.17853492,0.00024262397,0.3680034,0.0000026727062,0.45207277],"study_design_scores_gemma":[0.00014338197,0.00012048898,0.000050662064,0.00040480783,0.0000060193674,0.000101026475,1.5170257e-7,0.77505475,0.0012927362,0.22225152,0.00009973751,0.00047469014],"about_ca_topic_score_codex":0.000016534646,"about_ca_topic_score_gemma":0.000050224407,"teacher_disagreement_score":0.5965199,"about_ca_system_score_codex":0.00068814424,"about_ca_system_score_gemma":0.00057934795,"threshold_uncertainty_score":0.9997792},"labels":[],"label_agreement":null},{"id":"W1601200610","doi":"10.1109/pacrim.2005.1517376","title":"First thoughts on determining a method for fast autocorrelation classification","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 Lethbridge","funders":"","keywords":"Boolean function; Heuristics; Autocorrelation; Boolean expression; Computer science; Class (philosophy); Standard Boolean model; Boolean data type; Theoretical computer science; Maximum satisfiability problem; Algorithm; And-inverter graph; Mathematics; Artificial intelligence; Statistics","score_opus":0.06627732594397472,"score_gpt":0.3611006124351996,"score_spread":0.29482328649122486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601200610","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.00032778794,0.000004626879,0.9906494,0.0013763164,0.0004031248,0.0005540847,0.0000010529258,0.00033078587,0.0063528204],"genre_scores_gemma":[0.052698772,0.0000018228193,0.9453851,0.000366084,0.00034830451,0.00025420592,0.000003904252,0.000011101277,0.0009307254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879044,0.00009948733,0.0002960256,0.00040440174,0.00020074335,0.00020886937],"domain_scores_gemma":[0.99874866,0.0003708545,0.00016617392,0.0005683103,0.00008892261,0.000057096942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009392374,0.00012355276,0.00011156301,0.00013410121,0.00022727955,0.00012272969,0.0004966721,0.00009295801,0.0000068140885],"category_scores_gemma":[0.00021975968,0.00011042615,0.00006311184,0.00027003902,0.000014605574,0.0008463944,0.00004691123,0.00009324915,0.000102444974],"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.000009816846,0.000038973067,0.000036216486,0.000008386379,0.0000036574597,8.923195e-8,0.00055888447,0.0034726725,0.0005960801,0.37660462,0.00039970293,0.61827093],"study_design_scores_gemma":[0.00022776493,0.00010597782,0.004132582,0.000014829133,0.0000041703893,0.0000047754443,0.000020498375,0.9471887,0.0089815,0.0024603207,0.036721513,0.00013738313],"about_ca_topic_score_codex":0.0000019271358,"about_ca_topic_score_gemma":0.000010663704,"teacher_disagreement_score":0.943716,"about_ca_system_score_codex":0.00011868655,"about_ca_system_score_gemma":0.000029916999,"threshold_uncertainty_score":0.45030478},"labels":[],"label_agreement":null},{"id":"W1602007820","doi":"10.1007/978-3-642-04639-1_4","title":"Visibly Pushdown Kleene Algebra and Its Use in Interprocedural Analysis of (Mutually) Recursive Programs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Kleene algebra; Computer science; Decidability; Pushdown automaton; Formalism (music); Kleene's recursion theorem; Programming language; Algebra over a field; Discrete mathematics; Mathematics; Theoretical computer science; Algorithm; Finite-state machine; Pure mathematics","score_opus":0.026144226047980043,"score_gpt":0.2798615489949663,"score_spread":0.25371732294698623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602007820","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.010142258,0.00043340257,0.9878178,0.00021937577,0.00045352025,0.00057017605,0.000005241079,0.00008194078,0.00027626436],"genre_scores_gemma":[0.2991013,0.00007800862,0.70020884,0.00044737943,0.0000583993,0.000010808139,0.000009846602,0.000017613045,0.00006779375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593484,0.00009467001,0.0008867242,0.0015939397,0.0008958072,0.00059398694],"domain_scores_gemma":[0.99724567,0.00037553153,0.00059133297,0.0011721883,0.00045424263,0.000161017],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001367033,0.0005094891,0.00089722633,0.0030272307,0.00009069378,0.0004965711,0.0026621097,0.00036074404,0.00000548227],"category_scores_gemma":[0.00039552373,0.00047575615,0.00017353264,0.0034014855,0.0005375293,0.0016027809,0.0009228968,0.00071252964,0.000003593249],"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.000019632107,0.0000672938,0.0005663226,0.000047108537,0.00006826425,0.000034302073,0.0018035263,0.0086373165,0.00022462949,0.0664218,0.0000013492781,0.9221085],"study_design_scores_gemma":[0.00029187364,0.0005800614,0.007689795,0.00067992276,0.00009160521,0.000040225877,6.852447e-7,0.9322981,0.0027765236,0.05464192,0.00013012411,0.00077914144],"about_ca_topic_score_codex":0.000049454626,"about_ca_topic_score_gemma":0.00027135777,"teacher_disagreement_score":0.9236608,"about_ca_system_score_codex":0.00026818577,"about_ca_system_score_gemma":0.00029699202,"threshold_uncertainty_score":0.9997694},"labels":[],"label_agreement":null},{"id":"W1602205142","doi":"10.1007/11513988_24","title":"Improved Probabilistic Models for 802.11 Protocol Verification","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Computer science; Probabilistic logic; Reachability; Exponential backoff; Model checking; Abstraction; Protocol (science); Probabilistic CTL; Divergence-from-randomness model; Computer network; Distributed computing; Wireless; Theoretical computer science; Probabilistic analysis of algorithms; Throughput; Artificial intelligence","score_opus":0.04303138857095064,"score_gpt":0.3083600198162897,"score_spread":0.26532863124533906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602205142","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.000002960221,0.000024579289,0.9509474,0.00029357008,0.0008774123,0.046210635,0.000009172474,0.00027314096,0.0013611164],"genre_scores_gemma":[0.0015342252,0.0000026882906,0.97457784,0.00045590923,0.00054451876,0.022518601,0.0000084697685,0.000049681163,0.00030807446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955531,0.000056200188,0.0008556093,0.001993831,0.0007985293,0.0007427593],"domain_scores_gemma":[0.9959491,0.00037023512,0.0006058786,0.002292996,0.0006087365,0.00017305874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019798595,0.00059293787,0.0005177302,0.00064365054,0.00030086606,0.00058427127,0.0040873047,0.00045244815,0.000007732896],"category_scores_gemma":[0.0003109032,0.00055702735,0.00016578806,0.0005538495,0.00058399566,0.0015137816,0.0006814168,0.00054684083,0.000015487076],"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.000021251897,0.000051152256,0.0000020499203,0.00014569511,0.000005244119,0.0000016191716,0.00038150817,0.084133215,0.00031036208,0.21401611,0.000014351876,0.7009174],"study_design_scores_gemma":[0.00033230375,0.00019556153,0.000011780697,0.00015630892,0.0000058381747,0.000014887308,5.2130904e-8,0.7676379,0.0018093938,0.2260434,0.003297831,0.00049472856],"about_ca_topic_score_codex":0.000012222581,"about_ca_topic_score_gemma":0.00004405029,"teacher_disagreement_score":0.7004227,"about_ca_system_score_codex":0.0006734186,"about_ca_system_score_gemma":0.00082607014,"threshold_uncertainty_score":0.99968815},"labels":[],"label_agreement":null},{"id":"W1602213077","doi":"10.1007/978-3-642-22306-8_6","title":"Randomized Backtracking in State Space Traversal","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Tree traversal; Backtracking; Computer science; Concurrency; State space; Context (archaeology); Java; Model checking; Programming language; State (computer science); Theoretical computer science; Bounded function; Algorithm; Mathematics","score_opus":0.03326182238659969,"score_gpt":0.27367207296261903,"score_spread":0.24041025057601934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602213077","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.00012227905,0.00028404116,0.9851936,0.00019755734,0.0021984624,0.000777728,0.0000019058147,0.00014918786,0.0110752545],"genre_scores_gemma":[0.04734791,0.00011753433,0.9514849,0.00045173627,0.00015531297,0.00002009026,0.0000019577294,0.000038435526,0.0003820805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955423,0.00022975913,0.00088139187,0.0016015853,0.0009417564,0.0008032021],"domain_scores_gemma":[0.99675256,0.00083339127,0.0005085712,0.0015503031,0.00019322165,0.00016193396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048286566,0.00057806517,0.0010032102,0.0013255567,0.00013161694,0.00040477823,0.0037828477,0.000332329,0.00003335349],"category_scores_gemma":[0.00038465697,0.00052792236,0.000196288,0.00081606326,0.0011631849,0.0011081075,0.0009466249,0.0011484416,0.00007439191],"study_design_candidate":"design_other","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.0007849159,0.00004015583,0.000026673026,0.000053972748,0.00001537984,0.00011545574,0.005269443,0.01432492,0.00008823444,0.24475461,0.0000050328053,0.7345212],"study_design_scores_gemma":[0.01117978,0.000079048354,0.000099920464,0.000401255,0.000007456895,0.000045990575,1.6781215e-7,0.4958725,0.002680977,0.48856705,0.00032552853,0.00074033724],"about_ca_topic_score_codex":0.00010225668,"about_ca_topic_score_gemma":0.00010381735,"teacher_disagreement_score":0.73378086,"about_ca_system_score_codex":0.00039337893,"about_ca_system_score_gemma":0.0004891643,"threshold_uncertainty_score":0.99971724},"labels":[],"label_agreement":null},{"id":"W1603317060","doi":"10.1007/3-540-36573-7_14","title":"An Extension for MSC-2000 and Its Application","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Extension (predicate logic); Computer science; Construct (python library); Programming language; Semantics (computer science); Sequence (biology); Theoretical computer science; Software engineering","score_opus":0.02859867938223091,"score_gpt":0.2967071656373684,"score_spread":0.26810848625513745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603317060","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.00013793887,0.0005932414,0.9965512,0.00029436284,0.0009141133,0.00091622636,0.000004635213,0.00013270747,0.0004555365],"genre_scores_gemma":[0.023196122,0.000053441574,0.9750131,0.0013381857,0.00021025495,0.00004862264,0.0000068569134,0.00002947622,0.00010398794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699897,0.000048357706,0.00040694157,0.0015892729,0.0005198086,0.00043663627],"domain_scores_gemma":[0.9976214,0.00023281605,0.0002702601,0.001371831,0.00033970084,0.0001639517],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015571741,0.00036610718,0.00033829012,0.0004906729,0.00028045868,0.00031593957,0.0017915228,0.00031497405,0.0000027471185],"category_scores_gemma":[0.00013122015,0.00035073876,0.000056880574,0.00038542965,0.00026663413,0.00096167537,0.00029414476,0.000356467,0.0000112649595],"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.0000060961574,0.000022016213,0.000004696925,0.000042031534,0.0000025756713,0.0000022947058,0.00036165476,0.0040378855,0.0027968308,0.15894267,0.00000613844,0.8337751],"study_design_scores_gemma":[0.0001615495,0.00020686677,0.0000753992,0.00007556085,0.000005431892,0.00004576219,7.818637e-8,0.83782274,0.007802785,0.15006548,0.0033328058,0.00040557978],"about_ca_topic_score_codex":0.0000034134678,"about_ca_topic_score_gemma":0.00000665447,"teacher_disagreement_score":0.8337848,"about_ca_system_score_codex":0.0002212712,"about_ca_system_score_gemma":0.00025344666,"threshold_uncertainty_score":0.99989444},"labels":[],"label_agreement":null},{"id":"W1604272107","doi":"10.1007/3-540-45319-9_28","title":"Implementing a Multi-valued Symbolic Model Checker","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":31,"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":"Model checking; Computation tree logic; Computer science; Binary decision diagram; Symbolic trajectory evaluation; Temporal logic; Theoretical computer science; Linear temporal logic; Extension (predicate logic); Semantics (computer science); Truth value; Algorithm; Programming language","score_opus":0.05691785324811449,"score_gpt":0.32355564029692313,"score_spread":0.26663778704880864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604272107","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.00006751881,0.00022143575,0.9901709,0.000118345444,0.0011159105,0.000536778,0.000004681535,0.00030370808,0.007460733],"genre_scores_gemma":[0.0075727645,0.000052715084,0.9903408,0.0010567403,0.00028413482,0.000022400463,0.0000050920057,0.0000499486,0.0006153688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99469244,0.00006250937,0.00082111417,0.0019101452,0.0012068192,0.0013069848],"domain_scores_gemma":[0.9967128,0.0000869409,0.0004918167,0.002169263,0.00032285426,0.00021632604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026901416,0.0006482831,0.0005923536,0.000979383,0.00045996867,0.0006303522,0.0047037746,0.0003812819,0.000023548033],"category_scores_gemma":[0.00018274621,0.0006296472,0.00018142453,0.00087894883,0.0005326359,0.0010598947,0.0025529654,0.000982445,0.000072798706],"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.000004470248,0.000048329388,0.000049004506,0.000046445777,0.000015241505,0.00003871452,0.0015408655,0.07777192,0.00032196933,0.39785153,0.0000151020995,0.5222964],"study_design_scores_gemma":[0.00027404912,0.00005046916,0.00005873954,0.00016146728,0.000008007692,0.000061165825,1.6931212e-7,0.93070614,0.0015155517,0.06555833,0.00096477376,0.00064114184],"about_ca_topic_score_codex":0.000024839355,"about_ca_topic_score_gemma":0.0000438717,"teacher_disagreement_score":0.85293424,"about_ca_system_score_codex":0.00046130607,"about_ca_system_score_gemma":0.0005791988,"threshold_uncertainty_score":0.9996155},"labels":[],"label_agreement":null},{"id":"W1605320031","doi":"10.1023/a:1020883625495","title":"Lightweight Reasoning about Program Correctness","year":2002,"lang":"en","type":"article","venue":"Information Systems Frontiers","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"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; Scalability; Model checking; Abstraction; Programming language; Software engineering; Database","score_opus":0.016938308784256697,"score_gpt":0.24870376058516708,"score_spread":0.23176545180091038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605320031","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.0007930678,0.0005249215,0.94659144,0.00008090736,0.006422073,0.0006788875,0.0000028115078,0.0008758092,0.044030055],"genre_scores_gemma":[0.19656926,0.000068178095,0.8010082,0.00020285058,0.0001811154,0.0004681073,0.000020030824,0.000015052457,0.0014671523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826866,0.00012581146,0.00062312454,0.00017537815,0.000480128,0.0003269083],"domain_scores_gemma":[0.998554,0.000018360997,0.00042486013,0.0006471178,0.00023406261,0.00012158373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006649952,0.00016407881,0.00020784998,0.0002773626,0.00021649433,0.0007597008,0.00079826557,0.0001227858,0.0000089691985],"category_scores_gemma":[0.00012434302,0.00015219477,0.00006195517,0.0006561499,0.00004371253,0.0060650203,0.00007605334,0.00015180839,0.0005326731],"study_design_candidate":"design_other","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.000006709132,0.000055984845,0.0011042957,0.00014320665,0.000041225492,0.0000022520453,0.013044155,0.00068445544,0.000007437597,0.103004456,0.11870615,0.7631997],"study_design_scores_gemma":[0.00016710752,0.000035240177,0.0004107968,0.000044306027,0.0000029695175,0.000029743074,0.0002594846,0.6208433,0.0001214873,0.000024181416,0.37790477,0.00015660084],"about_ca_topic_score_codex":0.000022606633,"about_ca_topic_score_gemma":2.2494272e-7,"teacher_disagreement_score":0.76304305,"about_ca_system_score_codex":0.000154379,"about_ca_system_score_gemma":0.000022593465,"threshold_uncertainty_score":0.7325812},"labels":[],"label_agreement":null},{"id":"W1606052289","doi":"10.1007/978-3-642-36976-6_14","title":"The Duality of State and Observation in Probabilistic Transition Systems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"McGill University","funders":"","keywords":"Observable; Probabilistic logic; Computer science; Duality (order theory); State (computer science); Dual (grammatical number); Transition system; Theoretical computer science; Markov chain; Observer (physics); Markov decision process; Representation (politics); Markov process; Artificial intelligence; Algorithm; Mathematics; Discrete mathematics; Machine learning; Physics","score_opus":0.03755661636585351,"score_gpt":0.26722489577164094,"score_spread":0.22966827940578743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606052289","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.003358573,0.0003659916,0.9941188,0.00030490835,0.00080352346,0.0007263574,0.0000030462318,0.000027514694,0.00029126983],"genre_scores_gemma":[0.31043047,0.00013804148,0.6889663,0.00016852155,0.000087780965,0.00004821939,0.000003135151,0.000017714792,0.00013985546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769765,0.00013433455,0.00063573144,0.00066357886,0.0005801264,0.0002885738],"domain_scores_gemma":[0.9978958,0.0006039428,0.00036066255,0.00082319864,0.00026444212,0.000052005482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025872763,0.00022446152,0.0002986737,0.0002598064,0.00013152017,0.00033223414,0.0011909789,0.00014238211,0.0000012054529],"category_scores_gemma":[0.00019216703,0.00016854535,0.000032744934,0.00043282413,0.00066479703,0.00067579845,0.00024614896,0.00036449227,0.00000418398],"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.000009710032,0.00002361767,0.00007824523,0.00026461817,0.000005380191,0.0000040354325,0.0029205203,0.08770306,0.0003079288,0.22790156,0.0000033746853,0.68077797],"study_design_scores_gemma":[0.00010019434,0.00007447073,0.0023140854,0.00026255084,0.0000020712262,0.000010510625,3.961481e-7,0.8210223,0.00031581655,0.17562737,0.00009543052,0.00017484062],"about_ca_topic_score_codex":0.00011345727,"about_ca_topic_score_gemma":0.00007014416,"teacher_disagreement_score":0.7333192,"about_ca_system_score_codex":0.00018413301,"about_ca_system_score_gemma":0.0001924063,"threshold_uncertainty_score":0.687308},"labels":[],"label_agreement":null},{"id":"W1611084195","doi":"10.1007/978-3-540-31987-0_3","title":"The ASTREÉ Analyzer","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":392,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Computer science; Correctness; Programming language; Abstract interpretation; Spectrum analyzer; Software; Computation; Interpretation (philosophy); Memory safety; Algorithm","score_opus":0.021709104061219522,"score_gpt":0.27788635020231167,"score_spread":0.25617724614109216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1611084195","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.000010440079,0.0006916474,0.9840439,0.0013486698,0.0022139258,0.00027447144,0.0000016136097,0.00015680726,0.011258503],"genre_scores_gemma":[0.0065814634,0.00012375313,0.9901561,0.0009903105,0.00072709523,0.000010695365,0.0000015024004,0.00002630843,0.0013827563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963566,0.00006604697,0.00055127527,0.0012268113,0.0011123666,0.00068691536],"domain_scores_gemma":[0.9963131,0.00059356244,0.00034288512,0.0023599828,0.00024864727,0.00014183938],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021183738,0.0004294483,0.00033250422,0.00046582805,0.00056279916,0.00090855814,0.005991729,0.00026376618,0.000017259938],"category_scores_gemma":[0.00021157748,0.00030835526,0.00013612008,0.00070637657,0.0010067483,0.000735786,0.0013376643,0.00089995365,0.00013492699],"study_design_candidate":"design_other","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.0000019390825,0.0000064677793,0.000009969367,0.0000042425318,0.000005077837,0.000007422012,0.0001595332,0.0055416585,0.000019520854,0.11727751,0.000031719163,0.87693495],"study_design_scores_gemma":[0.00013067841,0.00009873121,0.00024589966,0.0001207005,0.0000067568476,0.000060946517,1.0373445e-7,0.77847874,0.0012030256,0.15666987,0.06240315,0.00058142154],"about_ca_topic_score_codex":0.0000074946765,"about_ca_topic_score_gemma":0.000054787786,"teacher_disagreement_score":0.8763535,"about_ca_system_score_codex":0.00035278822,"about_ca_system_score_gemma":0.0004357259,"threshold_uncertainty_score":0.9999369},"labels":[],"label_agreement":null},{"id":"W1612955822","doi":"10.1109/wfcs.1995.482691","title":"Architectures and time with recursive hierarchical alternating transition systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Automaton; Correctness; Formalism (music); Transition system; Theoretical computer science; Hierarchical control system; Semantics (computer science); Distributed computing; Programming language; Control (management); Artificial intelligence","score_opus":0.016564481031665926,"score_gpt":0.23198396485907702,"score_spread":0.2154194838274111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1612955822","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.058399644,0.0000837414,0.92853093,0.0004528516,0.00005914587,0.00013863007,6.720161e-7,0.00012463552,0.012209771],"genre_scores_gemma":[0.42701763,0.0000045704724,0.57261026,0.00011495529,0.000041088475,0.000010413363,4.6803868e-7,0.0000043313926,0.00019625382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927384,0.00010607369,0.000107587715,0.00021387711,0.00016980866,0.000128834],"domain_scores_gemma":[0.9996083,0.000070458096,0.000039928793,0.00019884172,0.000027803253,0.000054704222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019158999,0.000072717645,0.00008047603,0.00006245728,0.00007345404,0.00010432728,0.0001991515,0.000027950118,0.000015363239],"category_scores_gemma":[0.000021457241,0.000052847616,0.000011276719,0.00012562762,0.000049538023,0.00016095465,0.000024659015,0.00010252727,0.000016721044],"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.00002297218,0.00007904756,0.00007923054,0.00006310473,0.00003879817,0.000027326134,0.010373377,0.0057672285,0.0023642073,0.7802882,0.00027842718,0.20061807],"study_design_scores_gemma":[0.00018094642,0.00019722006,0.00026449232,0.000037597565,0.000003248142,0.00020656877,0.000022975375,0.9935743,0.0014017475,0.003734092,0.0002557066,0.00012106651],"about_ca_topic_score_codex":0.000015874253,"about_ca_topic_score_gemma":4.971495e-7,"teacher_disagreement_score":0.9878071,"about_ca_system_score_codex":0.000012953891,"about_ca_system_score_gemma":0.000003381672,"threshold_uncertainty_score":0.21550633},"labels":[],"label_agreement":null},{"id":"W1614449700","doi":"10.48550/arxiv.cs/0109024","title":"Verification of Timed Automata Using Rewrite Rules and Strategies","year":2001,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Automaton; Computer science; Programming language; Theoretical computer science","score_opus":0.12043056797819619,"score_gpt":0.3487616490608015,"score_spread":0.2283310810826053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1614449700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6435025,0.0002174148,0.35475862,0.000054475215,0.00034444308,0.00017947257,0.0000066439693,0.00014389031,0.0007925337],"genre_scores_gemma":[0.54761225,0.0001775368,0.45206684,0.00001710596,0.0000546154,0.000012725547,0.000015759304,0.000012407238,0.000030765845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983109,0.00018194839,0.00046857446,0.00057983265,0.00025200294,0.00020669153],"domain_scores_gemma":[0.99782026,0.000058669768,0.000511415,0.0013889335,0.00016173502,0.000058974972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067890214,0.00021681754,0.00029699548,0.00017035408,0.000086843946,0.0001590926,0.0009518616,0.00024207357,0.00000676229],"category_scores_gemma":[0.00011728094,0.00022669876,0.00005774643,0.0002174374,0.0001493435,0.0006787901,0.00078126794,0.0003043446,0.000018421564],"study_design_candidate":"observational","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.00013017387,0.0007005568,0.14888951,0.0034783238,0.00043814612,0.000050775365,0.009226445,0.00917184,0.20850693,0.4318761,0.00032286212,0.18720835],"study_design_scores_gemma":[0.00027812755,0.00006091831,0.5210856,0.00037656625,0.00004919193,0.000034223714,0.00012936888,0.44795606,0.016449094,0.012354235,0.00069926004,0.0005273468],"about_ca_topic_score_codex":0.00017113902,"about_ca_topic_score_gemma":0.0000023418418,"teacher_disagreement_score":0.4387842,"about_ca_system_score_codex":0.00006272776,"about_ca_system_score_gemma":0.0001848875,"threshold_uncertainty_score":0.9244507},"labels":[],"label_agreement":null},{"id":"W1616547254","doi":"10.1007/978-3-540-75560-9_31","title":"Faster Phylogenetic Inference with MXG","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cardinality (data modeling); Axiom; Computer science; Solver; Inference; Set (abstract data type); Task (project management); Theoretical computer science; Algorithm; Programming language; Discrete mathematics; Mathematics; Artificial intelligence; Data mining","score_opus":0.039651879295529914,"score_gpt":0.2954027223685919,"score_spread":0.25575084307306195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1616547254","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.0001552641,0.00022639257,0.987208,0.00013671356,0.0011360707,0.00042253864,0.0000021493809,0.00017477467,0.010538063],"genre_scores_gemma":[0.061478507,0.000024046078,0.9367174,0.001134185,0.0002725924,0.000009789542,0.000002291043,0.000035989844,0.00032522937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554926,0.000048677033,0.0005632699,0.0016894018,0.0013229985,0.0008263708],"domain_scores_gemma":[0.9964707,0.00042748413,0.0003760995,0.0021405115,0.00037271864,0.00021250888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014228054,0.00060416234,0.00049340486,0.0010215348,0.00021040995,0.0005197667,0.004246696,0.00037028512,0.00002506329],"category_scores_gemma":[0.00011655287,0.00049823144,0.000081108235,0.00093738013,0.0010653952,0.00070700556,0.0011185806,0.0009405087,0.00009800887],"study_design_candidate":"design_other","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.0000110219835,0.000022696848,0.00015605208,0.000037292357,0.0000091290085,0.00006840877,0.0005752264,0.012814085,0.00021592349,0.072745994,0.0000019505087,0.91334224],"study_design_scores_gemma":[0.00081754953,0.0013182303,0.0030913535,0.0012214216,0.000027789136,0.0004041148,4.510908e-7,0.72248274,0.014476746,0.2479926,0.0053514177,0.0028155784],"about_ca_topic_score_codex":0.000011897714,"about_ca_topic_score_gemma":0.000059672097,"teacher_disagreement_score":0.91052663,"about_ca_system_score_codex":0.0002946127,"about_ca_system_score_gemma":0.0005642788,"threshold_uncertainty_score":0.9997469},"labels":[],"label_agreement":null},{"id":"W1626593357","doi":"10.1007/978-3-642-19811-3_6","title":"Semantic Quality Attributes for Big-Step Modelling Languages","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Computer science; Quality (philosophy); Natural language processing; Artificial intelligence; Programming language; Information retrieval","score_opus":0.10638469406013269,"score_gpt":0.33125409261340855,"score_spread":0.22486939855327587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1626593357","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.00007441508,0.00061469356,0.9940205,0.00019289652,0.002483528,0.00066908327,0.000016088496,0.00025022228,0.0016785763],"genre_scores_gemma":[0.0262587,0.000038300765,0.972202,0.00047389435,0.000624677,0.000029577543,0.000008197858,0.00003809642,0.0003265503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960789,0.000079132566,0.0007464844,0.0015865575,0.0007733843,0.00073554675],"domain_scores_gemma":[0.99629766,0.00078940915,0.00048164584,0.0018617907,0.0004164229,0.00015307116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028466135,0.0005218617,0.0006245985,0.0006523857,0.00029671323,0.00037090434,0.0037414138,0.00039150566,0.000006632006],"category_scores_gemma":[0.00026284502,0.00048405118,0.0001996075,0.0004801492,0.0005249497,0.00046296653,0.0009097105,0.00058435666,0.00003097827],"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.000012318279,0.000033065524,0.00003559157,0.00017577526,0.000015998618,0.000010571698,0.0010392239,0.04180137,0.000115595656,0.21367314,0.00001556486,0.7430718],"study_design_scores_gemma":[0.00018172683,0.0001245445,0.000048677768,0.00023160114,0.0000098081355,0.000019164301,2.8430208e-7,0.7760678,0.003491457,0.21817246,0.0010483309,0.0006041298],"about_ca_topic_score_codex":0.00007564439,"about_ca_topic_score_gemma":0.000041632466,"teacher_disagreement_score":0.74246764,"about_ca_system_score_codex":0.00022893636,"about_ca_system_score_gemma":0.00034450056,"threshold_uncertainty_score":0.9997611},"labels":[],"label_agreement":null},{"id":"W1633038996","doi":"10.1109/glsv.1998.665311","title":"MDG-based verification by retiming and combinational transformations","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"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 Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Retiming; Computer science; Representation (politics); Theoretical computer science; Sequential logic; Combinational logic; Logic synthesis; Symbol (formal); Algorithm; Parallel computing; Computer engineering; Logic gate; Programming language","score_opus":0.025453149605138906,"score_gpt":0.23846216383813004,"score_spread":0.21300901423299112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1633038996","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.0022687356,0.000072275296,0.97957414,0.0025716722,0.00007951182,0.000114670576,0.0000027994752,0.00014740546,0.015168761],"genre_scores_gemma":[0.5547753,0.000016404168,0.44461688,0.00032381088,0.0000052533073,0.000021754933,0.000009902402,0.0000031695442,0.00022749869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993334,0.000053346346,0.0001671105,0.00016323784,0.00017882562,0.0001040884],"domain_scores_gemma":[0.99955624,0.000058095924,0.000046824138,0.00023403994,0.00005821614,0.000046563982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002569043,0.00006397643,0.000053455733,0.00007107669,0.0001518552,0.00009663807,0.000234383,0.00003986754,0.00008484327],"category_scores_gemma":[0.00004088909,0.00006404498,0.000016640717,0.00023153072,0.000040178296,0.000787678,0.00001259604,0.00006083162,0.000040812356],"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.0000012154973,0.00012185813,0.00011162265,0.000018774925,0.0000046974524,1.8989243e-7,0.0007811776,0.00013482757,0.0036620225,0.81311154,0.0077015143,0.17435056],"study_design_scores_gemma":[0.00023282561,0.00003000439,0.0015901555,0.00000436579,0.0000020437908,0.0000032721694,0.000011767045,0.98002785,0.008543573,0.0013120762,0.00814457,0.00009748948],"about_ca_topic_score_codex":0.0000034383816,"about_ca_topic_score_gemma":3.5251318e-7,"teacher_disagreement_score":0.979893,"about_ca_system_score_codex":0.000027340222,"about_ca_system_score_gemma":0.000007710465,"threshold_uncertainty_score":0.26116785},"labels":[],"label_agreement":null},{"id":"W1650544138","doi":"10.1145/2656209","title":"Exponential Lower Bounds for AC <sup>0</sup> -Frege Imply Superpolynomial Frege Lower Bounds","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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":"","keywords":"Mathematical proof; Mathematics; Bounded function; Cryptography; Upper and lower bounds; Exponential function; Discrete mathematics; Transformation (genetics); Proof complexity; Polynomial; Combinatorics; Mathematical analysis; Algorithm","score_opus":0.04404148439805563,"score_gpt":0.3077857384622144,"score_spread":0.2637442540641588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1650544138","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.033591982,0.00006484737,0.95973724,0.0007277196,0.003994425,0.00072575675,0.00006189972,0.0005321323,0.0005639671],"genre_scores_gemma":[0.593916,0.0000058389187,0.40431994,0.0005157461,0.0002898913,0.00020439195,0.000035490535,0.000050745828,0.0006619349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967424,0.00054082356,0.0006729093,0.0008273565,0.00062618224,0.00059027533],"domain_scores_gemma":[0.9968414,0.0007988069,0.00020503164,0.0013816205,0.00045825136,0.00031489704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001969246,0.00040129852,0.00035800677,0.00043860843,0.00062558864,0.00046603658,0.0015811957,0.00026313376,0.00007765429],"category_scores_gemma":[0.00028094166,0.00042044415,0.00032247297,0.00064847415,0.00025524406,0.0016700896,0.000051544906,0.00038816067,0.0002128482],"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.0027164365,0.002016956,0.000019686886,0.000098174096,0.00037798414,0.000019870664,0.0119199185,0.17817213,0.0014878074,0.26219258,0.0061167786,0.5348617],"study_design_scores_gemma":[0.0058089145,0.0024645596,0.00021294656,0.000076548284,0.00015894692,0.00012638849,0.00093628094,0.6723976,0.011105142,0.27610853,0.029199997,0.0014041531],"about_ca_topic_score_codex":0.000023438048,"about_ca_topic_score_gemma":0.0000042738075,"teacher_disagreement_score":0.560324,"about_ca_system_score_codex":0.00031439503,"about_ca_system_score_gemma":0.0003420886,"threshold_uncertainty_score":0.99982476},"labels":[],"label_agreement":null},{"id":"W1663771973","doi":"","title":"Formal Methods in Automated Design Debugging","year":2010,"lang":"en","type":"book","venue":"TSpace (University of Toronto)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Debugging; Computer science; Algorithmic program debugging; Abstraction; Debugger; Leverage (statistics); Bottleneck; Programming language; Embedded system; Artificial intelligence","score_opus":0.04069470551907693,"score_gpt":0.3243640705956789,"score_spread":0.28366936507660195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1663771973","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.000013815861,0.00021790939,0.7151926,0.00007327774,0.0003470211,0.00024337957,0.0000020142145,0.00043968516,0.2834703],"genre_scores_gemma":[0.00026666332,0.000086291555,0.906097,0.00001771064,0.000024309444,5.0053217e-7,0.0000060366415,0.000017187678,0.09348433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827397,0.00038959575,0.00019366381,0.00046208926,0.00029864683,0.00038202116],"domain_scores_gemma":[0.9981614,0.00021706993,0.00045812767,0.0009279569,0.00012684053,0.000108638094],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017820277,0.00025484167,0.0004698034,0.0001735078,0.00014086717,0.00003531066,0.0019226267,0.0005448201,0.0009984352],"category_scores_gemma":[0.000075330005,0.0003372562,0.00013815776,0.00011055149,0.00013762782,0.0021392577,0.00061762636,0.0004913225,0.000026909573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088733206,0.00008448803,0.000007851685,0.0002131156,0.000108640284,0.00007808601,0.012291068,0.00040641485,0.0025515098,0.1256469,0.006605529,0.8519177],"study_design_scores_gemma":[0.00086489617,0.00023766622,0.008703624,0.00024853458,0.000077626864,0.000030027659,0.00042430684,0.94194007,0.0007192082,0.001512821,0.044362176,0.0008790534],"about_ca_topic_score_codex":0.009588277,"about_ca_topic_score_gemma":0.0043912763,"teacher_disagreement_score":0.9415336,"about_ca_system_score_codex":0.0007726879,"about_ca_system_score_gemma":0.00055860094,"threshold_uncertainty_score":0.99991477},"labels":[],"label_agreement":null},{"id":"W1674524317","doi":"10.1109/iscas.2002.1010390","title":"Antisymmetries in the realization of Boolean functions","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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 Victoria","funders":"","keywords":"Realization (probability); Computer science; Boolean function; Mathematics; Algorithm","score_opus":0.030469990792287384,"score_gpt":0.2853019005445006,"score_spread":0.2548319097522132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1674524317","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.0034913786,0.000021197884,0.94730926,0.00006462594,0.00011675492,0.00006352402,2.697205e-7,0.000017473256,0.048915513],"genre_scores_gemma":[0.7337974,0.000009636935,0.26585025,0.000114859606,0.000004189714,0.000005022613,9.0103214e-7,0.0000014216921,0.00021637333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994754,0.00014877763,0.00012534462,0.00007916884,0.0001112113,0.000060062557],"domain_scores_gemma":[0.9995563,0.000055846405,0.000041473282,0.00030420782,0.000035264104,0.000006930891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077488855,0.000028835791,0.000038905473,0.00008489519,0.000033221702,0.000022905697,0.0002438687,0.000017591894,0.000008465287],"category_scores_gemma":[0.00026736056,0.000019568872,0.000012557776,0.0008578708,0.000022925393,0.00025357853,0.0000125149445,0.00003270812,0.000006928836],"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":[3.3157463e-7,0.000016330032,0.0013771871,0.0000020496716,5.831452e-7,9.2911584e-8,0.00030102886,0.00004109201,0.00010570912,0.99279106,0.00029209405,0.0050724344],"study_design_scores_gemma":[0.0010495302,0.00049294275,0.36065942,0.00005024628,0.000016789136,0.0000728936,0.0037348215,0.076661035,0.12942633,0.2680372,0.15922037,0.0005784287],"about_ca_topic_score_codex":0.000026572217,"about_ca_topic_score_gemma":0.000011341718,"teacher_disagreement_score":0.73030597,"about_ca_system_score_codex":0.000007635578,"about_ca_system_score_gemma":0.000016519723,"threshold_uncertainty_score":0.07979954},"labels":[],"label_agreement":null},{"id":"W1694286979","doi":"10.1109/pacrim.1997.620353","title":"On the relation between disjunctive decomposition and ROBDD variable ordering","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 Victoria","funders":"","keywords":"Binary decision diagram; Boolean function; Relation (database); Variable (mathematics); Decomposition; Set (abstract data type); Function (biology); Mathematics; Binary relation; Computer science; Algorithm; Discrete mathematics; Partially ordered set; Component (thermodynamics); Theoretical computer science; Combinatorics; Data mining; Programming language","score_opus":0.039548785797207886,"score_gpt":0.27415115208818047,"score_spread":0.23460236629097259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1694286979","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.024965035,0.0000130381695,0.9420438,0.00068094674,0.00008946579,0.000112011054,3.1871474e-7,0.00008435317,0.032011036],"genre_scores_gemma":[0.59060806,0.0000043105665,0.40900153,0.00014081408,0.000022733073,0.000008822145,7.3412053e-7,0.0000029405796,0.00021005824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994246,0.00009458325,0.00010171643,0.0001685912,0.00011499499,0.000095507916],"domain_scores_gemma":[0.9993719,0.00027287865,0.000045239376,0.00025886018,0.000026488258,0.000024651672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035736716,0.00005890326,0.00005142815,0.00003653539,0.00017756075,0.0000930482,0.00018548276,0.00003409984,0.00005188152],"category_scores_gemma":[0.00008748762,0.00004020371,0.000010314636,0.00021983044,0.000020794048,0.00047837294,0.00006457916,0.00008983806,0.00006420986],"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.0000010724012,0.000009935727,0.00031378705,0.0000018544656,0.0000048212523,1.0129551e-7,0.00027142512,0.00026036063,0.00027469677,0.9777248,0.00013212308,0.021005023],"study_design_scores_gemma":[0.00014222818,0.00011422847,0.052308075,0.00002062629,0.000006936412,0.0000041238186,0.000020715966,0.8656973,0.0030467082,0.07773057,0.00076910324,0.00013935569],"about_ca_topic_score_codex":0.000009854172,"about_ca_topic_score_gemma":4.2148827e-7,"teacher_disagreement_score":0.89999425,"about_ca_system_score_codex":0.000029766312,"about_ca_system_score_gemma":0.0000025278305,"threshold_uncertainty_score":0.16394597},"labels":[],"label_agreement":null},{"id":"W1704961025","doi":"10.4204/eptcs.31","title":"Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems","year":2010,"lang":"en","type":"paratext","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Computer science; Operations research; Engineering","score_opus":0.02232007085100891,"score_gpt":0.28881460646408263,"score_spread":0.26649453561307374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1704961025","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.02372735,0.00038716404,0.89465266,0.0005349265,0.00681659,0.0018229032,0.000042832653,0.0003002803,0.07171529],"genre_scores_gemma":[0.8025776,0.000098364864,0.19581605,0.00019988099,0.0007524618,0.00014663108,0.0000103478205,0.0000524749,0.00034616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914774,0.000060766324,0.0013507967,0.0021330758,0.002495878,0.0024821023],"domain_scores_gemma":[0.99615055,0.00020078944,0.00094457914,0.0007090999,0.0016106878,0.00038428672],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0069413693,0.0008003882,0.0010404448,0.0014014572,0.0005227668,0.0009541129,0.008090923,0.00073185295,0.00007702224],"category_scores_gemma":[0.0005328782,0.0007301244,0.00019627136,0.003735989,0.006245657,0.0031432996,0.0020070625,0.0035145478,0.00022012378],"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.000098109995,0.00020880361,0.00001070299,0.00020780842,0.00001343873,0.000001028612,0.0007227926,0.00008630189,0.0005705213,0.9914713,0.0019465097,0.004662677],"study_design_scores_gemma":[0.0010380814,0.0025691155,0.0005374331,0.0016534086,0.000025625171,0.00028506696,0.00012545017,0.8076882,0.009954948,0.16482262,0.009439739,0.0018603456],"about_ca_topic_score_codex":0.000008416226,"about_ca_topic_score_gemma":0.0000010463656,"teacher_disagreement_score":0.82664865,"about_ca_system_score_codex":0.0010316803,"about_ca_system_score_gemma":0.0012378144,"threshold_uncertainty_score":0.999515},"labels":[],"label_agreement":null},{"id":"W1708665","doi":"10.1007/978-3-662-43951-7_2","title":"Handling Infinitely Branching WSTS","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Montréal","funders":"","keywords":"Decidability; Branching (polymer chemistry); Petri net; Automaton; Mathematics; Finite-state machine; Antichain; Discrete mathematics; Pure mathematics; Computer science; Theoretical computer science; Algorithm; Partially ordered set","score_opus":0.028236850503169934,"score_gpt":0.2770631855992524,"score_spread":0.24882633509608248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1708665","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.00009936111,0.00026004578,0.98773575,0.0002538002,0.0033502744,0.00029687895,0.0000014592277,0.0002859264,0.007716495],"genre_scores_gemma":[0.06801794,0.000021930568,0.9296036,0.0014336344,0.0006314704,0.00000723317,0.0000026195396,0.00003730288,0.0002442865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958258,0.00008389098,0.0006757864,0.0015914462,0.0011010652,0.00072200125],"domain_scores_gemma":[0.99647504,0.0006741178,0.00044895467,0.0019657565,0.00024995062,0.00018618682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002564209,0.0005403187,0.00055992446,0.0010274262,0.00036356112,0.0008304652,0.00449728,0.00039131017,0.000014096097],"category_scores_gemma":[0.0004427712,0.00051801023,0.0001389399,0.00068694836,0.0005768504,0.00081184774,0.0013891899,0.0011099438,0.00011568817],"study_design_candidate":"design_other","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.0000029563869,0.000007408823,0.000032976586,0.000038767274,0.000005046209,0.000014245505,0.0006019458,0.02115411,0.00015934584,0.10524929,0.0000058234814,0.8727281],"study_design_scores_gemma":[0.00020565477,0.00012599524,0.00019026366,0.00050515594,0.0000056807803,0.00007331541,5.049393e-8,0.82180935,0.0028705432,0.16914992,0.004326426,0.00073762244],"about_ca_topic_score_codex":0.000014320999,"about_ca_topic_score_gemma":0.000018882733,"teacher_disagreement_score":0.87199044,"about_ca_system_score_codex":0.00027028593,"about_ca_system_score_gemma":0.0003790439,"threshold_uncertainty_score":0.99972713},"labels":[],"label_agreement":null},{"id":"W171159096","doi":"10.1007/978-1-4471-5260-6_4","title":"Critical System Development Methodology","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Correctness; Computer science; Software engineering; Code generation; Model checking; Formal methods; Formal verification; Programming language; Code (set theory); Set (abstract data type)","score_opus":0.16840159661703705,"score_gpt":0.3484222941730373,"score_spread":0.18002069755600023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171159096","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":[1.5057194e-7,0.00006577382,0.5188076,0.00007819051,0.00083998236,0.00011507188,3.1252756e-7,0.00024354612,0.4798494],"genre_scores_gemma":[0.000025121393,0.00000419819,0.7042254,0.00014850289,0.000073578034,0.000029158362,0.0000018923099,0.0000173696,0.29547474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99817705,0.00014824196,0.000509447,0.00056375907,0.00032877678,0.00027271078],"domain_scores_gemma":[0.99809754,0.00048245193,0.00013110519,0.0009047561,0.000257091,0.00012707831],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012180903,0.0002659738,0.00038213242,0.0001667606,0.000093650255,0.000119931676,0.0011711197,0.00042206756,0.00047602126],"category_scores_gemma":[0.00020839712,0.00023011497,0.000075104756,0.00002893082,0.00009198668,0.00029441333,0.00045735674,0.0003007078,0.0050805225],"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":[6.1183255e-7,0.0000025242075,9.6081074e-8,0.000081401,0.000014663966,0.0000051991724,0.00006693844,3.3570862e-7,0.000011401807,0.91940576,0.0011937027,0.07921735],"study_design_scores_gemma":[0.000099939585,0.000072665076,0.000033511245,0.00022589562,0.000022344719,0.00022214954,0.000018125846,0.009723215,0.002386695,0.092858836,0.8934985,0.0008381436],"about_ca_topic_score_codex":0.0000046994132,"about_ca_topic_score_gemma":7.2767534e-7,"teacher_disagreement_score":0.8923048,"about_ca_system_score_codex":0.00020739935,"about_ca_system_score_gemma":0.00016005155,"threshold_uncertainty_score":0.99569416},"labels":[],"label_agreement":null},{"id":"W1724428047","doi":"10.1109/ismvl.1998.679287","title":"Implementing a multiple-valued decision diagram package","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":86,"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 Victoria","funders":"","keywords":"Binary decision diagram; Computer science; Representation (politics); Influence diagram; Diagram; Binary number; Theoretical computer science; Data mining; Decision tree; Mathematics; Database; Arithmetic","score_opus":0.05466461180288122,"score_gpt":0.3211580869827185,"score_spread":0.2664934751798373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1724428047","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.015934227,0.000040165745,0.9719456,0.00009310425,0.0002818765,0.00015313896,5.858523e-7,0.0002876626,0.011263682],"genre_scores_gemma":[0.3691977,0.000007186399,0.63035244,0.00013609199,0.000026059626,0.000011779889,4.996804e-7,0.0000045261327,0.0002637086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987054,0.00008077471,0.00026008498,0.0003040563,0.00027940414,0.00037026813],"domain_scores_gemma":[0.99893135,0.0001686985,0.000078430545,0.0006954118,0.000052838786,0.00007327325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080919795,0.00009704278,0.000093670584,0.000084893756,0.00017303575,0.00016015876,0.0007013653,0.000040046947,0.00023875131],"category_scores_gemma":[0.0005215758,0.000082131424,0.000053580396,0.00036891593,0.00001792044,0.0006211589,0.00034974955,0.00008269445,0.00044049704],"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.000001174329,0.00004339182,0.0013135484,0.0000031731536,0.0000037535756,0.0000025396114,0.00037370637,0.000007090495,0.0011739767,0.09824816,0.0014704957,0.897359],"study_design_scores_gemma":[0.0003292467,0.000043201053,0.0051031588,0.000007789118,0.0000020261336,0.00000813532,0.000024545197,0.9694668,0.01078806,0.0022704988,0.0118002165,0.0001562965],"about_ca_topic_score_codex":0.000017530592,"about_ca_topic_score_gemma":0.000010313574,"teacher_disagreement_score":0.9694597,"about_ca_system_score_codex":0.000031671094,"about_ca_system_score_gemma":0.0000043651853,"threshold_uncertainty_score":0.5661845},"labels":[],"label_agreement":null},{"id":"W1735022296","doi":"10.1007/978-3-540-45187-7_18","title":"Multi-valued Model Checking via Classical Model Checking","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":67,"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":"Model checking; Abstraction model checking; Computer science; Symbolic trajectory evaluation; Reuse; Extension (predicate logic); Theoretical computer science; Context (archaeology); Algorithm; Programming language","score_opus":0.0640061665801301,"score_gpt":0.3078150874879148,"score_spread":0.24380892090778472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1735022296","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.000044405537,0.00022408387,0.9943593,0.00029139096,0.0016349973,0.0005535077,0.0000038834482,0.00033628225,0.002552122],"genre_scores_gemma":[0.014970924,0.0000305688,0.98206866,0.0021761416,0.00020980136,0.000022813905,0.000003787837,0.0000749929,0.00044234045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935486,0.000100839185,0.0009775623,0.002546287,0.001648397,0.0011783671],"domain_scores_gemma":[0.99601734,0.00016437873,0.0005831363,0.0025230949,0.0003990305,0.00031305134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024741483,0.0008840915,0.00081688334,0.000961314,0.0004869761,0.00070154737,0.0051543824,0.0007494215,0.0000061787505],"category_scores_gemma":[0.00028852155,0.0008664243,0.0002606025,0.00085077155,0.0009197972,0.0014155811,0.0016544679,0.0017700143,0.000038449572],"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.0000048073503,0.000046436584,0.0000051545094,0.000037142076,0.00000896816,0.00001688006,0.00090935075,0.7425615,0.0012829991,0.068275966,0.000009760548,0.18684104],"study_design_scores_gemma":[0.0002948041,0.000052370764,0.000010263883,0.00022353002,0.000010863861,0.000052617626,9.093679e-8,0.8702775,0.0040473845,0.124079175,0.000109529494,0.00084185076],"about_ca_topic_score_codex":0.0000066201774,"about_ca_topic_score_gemma":0.000012903624,"teacher_disagreement_score":0.18599918,"about_ca_system_score_codex":0.00082727923,"about_ca_system_score_gemma":0.00067817717,"threshold_uncertainty_score":0.9993786},"labels":[],"label_agreement":null},{"id":"W174591770","doi":"10.1007/978-3-642-28525-7_7","title":"A Logical Approach to Data-Aware Automated Sequence Generation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Sequence (biology); Satisfiability; Set (abstract data type); Domain (mathematical analysis); Sequence diagram; Variety (cybernetics); Theoretical computer science; Programming language; Artificial intelligence; Unified Modeling Language; Software","score_opus":0.17213255103046662,"score_gpt":0.3455552282790685,"score_spread":0.17342267724860186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W174591770","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.000021455462,0.0002135632,0.99304414,0.0002739452,0.0018296532,0.0006800508,0.000024472352,0.0007318346,0.0031808938],"genre_scores_gemma":[0.043598685,0.000017247008,0.9539235,0.0014632113,0.00076954847,0.000024261433,0.00009179989,0.000030441674,0.000081309336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99482304,0.00012417258,0.00065099547,0.002303023,0.0012796064,0.0008191832],"domain_scores_gemma":[0.99492013,0.000175258,0.00031137335,0.0039604083,0.00029904902,0.00033376514],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002670142,0.000555665,0.0005169182,0.0006959447,0.00029566203,0.00069787033,0.007996045,0.00044623553,0.000021304351],"category_scores_gemma":[0.00027442886,0.00049095415,0.00006866703,0.0010134241,0.00046632206,0.0018468263,0.003624112,0.0007565373,0.00015314782],"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.0000050176636,0.00008146241,0.000012979647,0.000049468264,0.000012034381,0.000017660655,0.00089096866,0.043040548,0.0014155742,0.07102634,0.00045304385,0.8829949],"study_design_scores_gemma":[0.00008637374,0.00008112257,0.000060914208,0.00007036508,0.000007826331,0.000109661276,1.335563e-7,0.9907382,0.00091017614,0.0057604094,0.0015759574,0.00059886393],"about_ca_topic_score_codex":0.000016727428,"about_ca_topic_score_gemma":0.000009241829,"teacher_disagreement_score":0.94769764,"about_ca_system_score_codex":0.00031041267,"about_ca_system_score_gemma":0.0004712591,"threshold_uncertainty_score":0.9997542},"labels":[],"label_agreement":null},{"id":"W1751330240","doi":"10.1007/3-540-45314-8_2","title":"Metamodelling and Conformance Checking with PVS","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","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":"York University","funders":"","keywords":"Computer science; Metamodeling; Programming language; Conformance checking; Model checking; Conformance testing; Software engineering; Operating system; Work in process","score_opus":0.031308364412587185,"score_gpt":0.2639908078676263,"score_spread":0.2326824434550391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1751330240","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.00015473254,0.0007559002,0.98767763,0.00023308345,0.00067402376,0.00026594868,9.369466e-7,0.00013337865,0.01010438],"genre_scores_gemma":[0.021469193,0.00017513694,0.97725743,0.0005906101,0.00017271905,0.000007057666,0.0000012494967,0.000023367145,0.00030325478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997311,0.000026559348,0.00037894593,0.0010785457,0.0006858077,0.0005191646],"domain_scores_gemma":[0.9981789,0.00020687346,0.0002792328,0.0010042947,0.00019696775,0.00013371762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011493732,0.0004015814,0.00039878333,0.00050943036,0.00023826283,0.00048103512,0.0017944685,0.00020964265,0.0000070211204],"category_scores_gemma":[0.000044097196,0.00033868483,0.000037001126,0.00054530404,0.0008168194,0.0012582565,0.0006185707,0.00064089044,0.000012901086],"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.000005537561,0.0000070764686,0.000049810358,0.00004104108,0.000007845248,0.000032395277,0.0005770029,0.0543901,0.000063712345,0.19267324,0.0000011902758,0.7521511],"study_design_scores_gemma":[0.00016080565,0.00014550329,0.000075073534,0.0003582059,0.000007639305,0.00024074443,1.3092361e-7,0.9294843,0.0016490712,0.063983604,0.0034138367,0.0004810756],"about_ca_topic_score_codex":0.000014417575,"about_ca_topic_score_gemma":0.000019212106,"teacher_disagreement_score":0.87509423,"about_ca_system_score_codex":0.00016751698,"about_ca_system_score_gemma":0.00024723442,"threshold_uncertainty_score":0.99990654},"labels":[],"label_agreement":null},{"id":"W1752871820","doi":"10.1007/978-3-540-74742-0_51","title":"On Formal MOM Modeling","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Windsor","funders":"","keywords":"Computer science; Promela; Correctness; Model checking; Concurrency; Formal verification; Nondeterministic algorithm; Message passing; Distributed computing; Formal methods; Programming language; Theoretical computer science","score_opus":0.053126787908159646,"score_gpt":0.30598788496607143,"score_spread":0.25286109705791177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1752871820","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.00008557334,0.00012984972,0.9791327,0.00013955797,0.0025203375,0.00033678388,0.0000019848649,0.00023671931,0.01741646],"genre_scores_gemma":[0.04258826,0.000019015739,0.9551476,0.0016399273,0.0003788861,0.0000060567013,0.0000028010918,0.00003454303,0.00018290314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553293,0.000033813,0.0006405436,0.0014810853,0.0013830982,0.00092852436],"domain_scores_gemma":[0.99705046,0.00036075088,0.00026811004,0.0018735869,0.00025487432,0.00019219046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026024752,0.00052957004,0.000432419,0.0012611969,0.00032538272,0.00043871897,0.0040740366,0.0004307872,0.000014821623],"category_scores_gemma":[0.00018969126,0.00049289124,0.00013781928,0.0006617774,0.00038098672,0.0012651545,0.0011874487,0.0011644512,0.0001114902],"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.000006482564,0.000012099073,0.0000012230851,0.000012388147,0.0000027965382,0.000020605832,0.00021882865,0.22021157,0.00001936021,0.27144668,0.0000027400852,0.50804526],"study_design_scores_gemma":[0.000119900156,0.00014724668,0.000006931444,0.00017485853,0.0000024905437,0.000034829896,4.9809287e-8,0.76279765,0.0007954363,0.23524755,0.00025481937,0.00041820886],"about_ca_topic_score_codex":0.000012131261,"about_ca_topic_score_gemma":0.000014357425,"teacher_disagreement_score":0.5425861,"about_ca_system_score_codex":0.00045764938,"about_ca_system_score_gemma":0.00033978984,"threshold_uncertainty_score":0.9997523},"labels":[],"label_agreement":null},{"id":"W1759023222","doi":"10.1007/978-3-642-21043-3_33","title":"Finding Small Backdoors in SAT Instances","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"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":"Backdoor; Computer science; Satisfiability; Boolean satisfiability problem; Theoretical computer science; Set (abstract data type); Algorithm; Time complexity; Programming language","score_opus":0.05988371030649545,"score_gpt":0.27856254880524095,"score_spread":0.2186788384987455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1759023222","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.0006782558,0.00042362532,0.97946197,0.00013111226,0.0026675034,0.00037458105,0.0000021997057,0.00014321541,0.01611752],"genre_scores_gemma":[0.07177765,0.00010658448,0.92701185,0.000585689,0.00020334266,0.0000133678195,0.00000267677,0.00003158695,0.00026723623],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960874,0.0000811257,0.00071092707,0.0016270559,0.0007176823,0.0007758502],"domain_scores_gemma":[0.9973933,0.00033935579,0.00040055517,0.0015772919,0.0001438934,0.00014562187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019986862,0.00052710547,0.0005394843,0.0013990677,0.00017330245,0.00036084346,0.004804711,0.00040708715,0.000025588282],"category_scores_gemma":[0.00018693645,0.0005038432,0.00010598025,0.0010772467,0.0006855143,0.0012049368,0.0012891623,0.0010483931,0.000093429124],"study_design_candidate":"design_other","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.000008019099,0.00002688041,0.00037528388,0.000047572856,0.0000047944645,0.00006543072,0.0026632946,0.0043107644,0.000070907765,0.14325331,0.00000335462,0.8491704],"study_design_scores_gemma":[0.0006841694,0.000335,0.0031578683,0.0014794997,0.000008847503,0.000111876834,0.000001019442,0.3855104,0.0059216213,0.59690404,0.003967061,0.0019185636],"about_ca_topic_score_codex":0.00004801711,"about_ca_topic_score_gemma":0.00030922308,"teacher_disagreement_score":0.84725183,"about_ca_system_score_codex":0.0004860192,"about_ca_system_score_gemma":0.0004509213,"threshold_uncertainty_score":0.9997413},"labels":[],"label_agreement":null},{"id":"W1759641679","doi":"10.1007/978-3-540-85762-4_16","title":"A New Approach for the Construction of Multiway Decision Graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Computer science; Operator (biology); First-order logic; Theoretical computer science; Representation (politics); Pruning; Product (mathematics); Programming language; Algorithm; Mathematics","score_opus":0.03805516319997952,"score_gpt":0.2848170060365708,"score_spread":0.24676184283659125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1759641679","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.000011781564,0.0004801648,0.99582213,0.000103338985,0.0018788574,0.00078195636,0.000003917827,0.00006638184,0.00085146184],"genre_scores_gemma":[0.0022854926,0.00016084235,0.9970926,0.00015629808,0.00018438192,0.000016138174,0.0000023889647,0.000017952676,0.00008390689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971598,0.00003415589,0.0005713839,0.00103687,0.0008368106,0.00036102044],"domain_scores_gemma":[0.9963062,0.0012177966,0.00046838188,0.0015935802,0.0003182028,0.00009585989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012572785,0.00033193897,0.00039719752,0.0005895897,0.00030118146,0.00015148327,0.0034327004,0.00027451263,0.0000053989893],"category_scores_gemma":[0.0003155444,0.00024066129,0.00018715682,0.0007161214,0.0009436855,0.00047200278,0.00057679694,0.00044543602,0.0000042695888],"study_design_candidate":"design_other","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.000013128208,0.000010042698,0.00000914726,0.00001921682,0.000007314535,8.8336424e-7,0.0004664367,0.02036486,0.00005807901,0.06616382,0.000052841046,0.9128342],"study_design_scores_gemma":[0.00029311658,0.00010685582,0.00010197042,0.00010660038,0.0000093212,0.00011350815,2.795643e-7,0.8631836,0.0029383986,0.13109426,0.0017598005,0.00029226972],"about_ca_topic_score_codex":0.00002330301,"about_ca_topic_score_gemma":0.0000057417656,"teacher_disagreement_score":0.912542,"about_ca_system_score_codex":0.00012394846,"about_ca_system_score_gemma":0.0005066659,"threshold_uncertainty_score":0.9813883},"labels":[],"label_agreement":null},{"id":"W1761976637","doi":"10.1007/978-3-540-88194-0_7","title":"An Approach to Testing with Embedded Context Using Model Checker","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 Windsor","funders":"","keywords":"Computer science; Test suite; Context (archaeology); Suite; Model-based testing; Programming language; Model checking; Isolation (microbiology); Conformance testing; Test (biology); Context model; TRACE (psycholinguistics); Software engineering; Test case; Artificial intelligence; Standardization; Operating system; Machine learning","score_opus":0.09441285592710441,"score_gpt":0.3025583259518951,"score_spread":0.20814547002479067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1761976637","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.0005487686,0.000071565795,0.9925374,0.000030662537,0.00039580325,0.000617893,0.0000029613884,0.000251873,0.0055430643],"genre_scores_gemma":[0.067573704,0.0000025602656,0.9309125,0.0011798858,0.00020211775,0.00001423993,0.000002524713,0.00005034877,0.00006211408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541926,0.0000608901,0.00053992524,0.0020220743,0.0011895688,0.0007682799],"domain_scores_gemma":[0.99648076,0.0001271308,0.00034422133,0.0021844928,0.00053744914,0.00032593746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009336961,0.0006139961,0.00056913716,0.00082396343,0.0004263767,0.0005178777,0.003995162,0.0003023292,0.0000013541372],"category_scores_gemma":[0.00015697925,0.000533512,0.00006512069,0.0012116376,0.0006548509,0.0013457503,0.00077911676,0.00079105713,0.000011883649],"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.000008334563,0.000040107763,0.000016534905,0.00001994698,0.000004917322,0.000015162363,0.0024115823,0.78029376,0.00044748696,0.013258182,0.0000033174995,0.20348068],"study_design_scores_gemma":[0.00017171082,0.00020045134,0.000042603027,0.00021144922,0.000006188824,0.00027708584,5.822242e-7,0.9912729,0.0014879325,0.0055625746,0.00004595371,0.0007205529],"about_ca_topic_score_codex":0.00003056843,"about_ca_topic_score_gemma":0.000008269321,"teacher_disagreement_score":0.21097916,"about_ca_system_score_codex":0.00042266556,"about_ca_system_score_gemma":0.00094590837,"threshold_uncertainty_score":0.99971163},"labels":[],"label_agreement":null},{"id":"W1763211909","doi":"10.1007/978-3-642-03741-2_11","title":"Approximating Labelled Markov Processes Again!","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bisimulation; Monad (category theory); Computer science; Probabilistic logic; State space; Construct (python library); Theoretical computer science; Markov process; Markov chain; Algebra over a field; Algorithm; Mathematics; Discrete mathematics; Pure mathematics; Artificial intelligence; Programming language; Functor; Machine learning","score_opus":0.023109099672357903,"score_gpt":0.27179974507253474,"score_spread":0.24869064540017682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763211909","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.00002525184,0.0005697751,0.9798074,0.00043271916,0.0010509245,0.00054382376,0.0000021718472,0.00035539287,0.01721258],"genre_scores_gemma":[0.005263864,0.000061825915,0.9923243,0.0013389889,0.00035933757,0.000015324546,0.000004402391,0.00003318095,0.00059880596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953529,0.00006885936,0.0007996593,0.0017583336,0.0012342489,0.00078597653],"domain_scores_gemma":[0.9964358,0.0005078618,0.00059528236,0.0017993639,0.0004890983,0.00017256619],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021708778,0.0006064938,0.0006101286,0.00083887007,0.00036158552,0.0007403721,0.0048055556,0.00038162604,0.000014074562],"category_scores_gemma":[0.0007905404,0.00056220667,0.000101140344,0.0013076507,0.0005359295,0.0011224635,0.0010914626,0.0009345356,0.000050889677],"study_design_candidate":"design_other","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.000004069753,0.000026105903,0.000007614195,0.000119354074,0.0000052262253,0.000024906845,0.0006548227,0.0045322417,0.00013398619,0.023922699,0.000012214767,0.97055674],"study_design_scores_gemma":[0.00027721337,0.00022204041,0.000048554262,0.00076134986,0.00000898206,0.000097575044,2.2229767e-7,0.7420078,0.0053208964,0.24785942,0.0023837404,0.0010122285],"about_ca_topic_score_codex":0.000005360215,"about_ca_topic_score_gemma":0.000011808914,"teacher_disagreement_score":0.96954453,"about_ca_system_score_codex":0.0003276401,"about_ca_system_score_gemma":0.00084011105,"threshold_uncertainty_score":0.99968296},"labels":[],"label_agreement":null},{"id":"W1766015196","doi":"","title":"Polynomial value iteration algorithms for deterministic MDPs","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"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 Alberta","funders":"","keywords":"Markov decision process; Power iteration; Rayleigh quotient iteration; Mathematics; Value (mathematics); Arnoldi iteration; Convergence (economics); Markov chain; Polynomial; Time complexity; Discrete mathematics; Mathematical optimization; Algorithm; Applied mathematics; Markov process; Iterative method; Computer science; Statistics","score_opus":0.07982465010121462,"score_gpt":0.31610161788818814,"score_spread":0.23627696778697352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1766015196","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.00080924726,0.00001958133,0.9921498,0.00028579464,0.0007859576,0.00022671498,0.0000019692395,0.0001517492,0.005569222],"genre_scores_gemma":[0.07816208,0.0000027028937,0.9196677,0.00034604166,0.00017169482,0.0000520617,0.0000018729779,0.000005998254,0.0015898118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923164,0.000045592365,0.00018884082,0.00023928692,0.00012300508,0.00017165132],"domain_scores_gemma":[0.99939084,0.00009150912,0.00005707524,0.0003603512,0.000051166076,0.000049047485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027015878,0.00007972813,0.00007893974,0.000060899205,0.00011329152,0.00015966406,0.00040588778,0.00004829969,0.00003457048],"category_scores_gemma":[0.00012690767,0.000073645,0.000043539538,0.00013311426,0.000020179674,0.0005179945,0.00004827717,0.000042127962,0.0000956032],"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.0000061542064,0.00008323971,0.000024029447,0.000019931562,0.000008255772,0.0000018332414,0.0008502701,0.00015111064,0.0022622412,0.15516709,0.013640123,0.82778573],"study_design_scores_gemma":[0.00019523352,0.000113162605,0.00019879617,0.0000029326168,0.000002887292,0.0000117655345,0.0000036473077,0.9760672,0.006576125,0.0006243733,0.0160979,0.000106000734],"about_ca_topic_score_codex":0.000004063972,"about_ca_topic_score_gemma":5.5010935e-7,"teacher_disagreement_score":0.9759161,"about_ca_system_score_codex":0.00003441217,"about_ca_system_score_gemma":0.000009537098,"threshold_uncertainty_score":0.3003156},"labels":[],"label_agreement":null},{"id":"W1769768582","doi":"10.1007/978-3-642-20398-5_8","title":"Towards Flight Control Verification Using Automated Theorem Proving","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"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":"Autopilot; Leverage (statistics); MATLAB; Computer science; Plot (graphics); Automated theorem proving; Controller (irrigation); Process (computing); Control engineering; Control theory (sociology); Control (management); Engineering; Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.033890827422019494,"score_gpt":0.2816612213300191,"score_spread":0.2477703939079996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1769768582","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.00008709418,0.00022544936,0.9898827,0.00013233218,0.0024311359,0.00072247494,0.000005149882,0.0008659657,0.0056477003],"genre_scores_gemma":[0.14324066,0.000014583486,0.85589945,0.0004578732,0.00026707916,0.000014168589,0.0000034963955,0.000042588497,0.00006007755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957696,0.00013750383,0.00075200165,0.0016358353,0.0009905748,0.0007144727],"domain_scores_gemma":[0.9964586,0.00019253537,0.00065106124,0.0020758447,0.00045003332,0.0001719242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023123238,0.00058506354,0.0005671037,0.0009051779,0.00035189936,0.00055283424,0.004042453,0.00046226915,0.000022132828],"category_scores_gemma":[0.00026015277,0.00053456525,0.00013674873,0.0007624196,0.0007627508,0.0012891571,0.0007196003,0.0007301093,0.000051027044],"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.00001602506,0.000036479527,0.000026297534,0.000060452017,0.000018980953,0.000027088417,0.001277469,0.013213252,0.001990802,0.3072497,0.0000058012724,0.67607766],"study_design_scores_gemma":[0.00022810578,0.00010026156,0.00024880026,0.00024227801,0.000014090039,0.000068076326,1.01142824e-7,0.88997656,0.0076587475,0.100502305,0.00038917505,0.00057149556],"about_ca_topic_score_codex":0.00004243492,"about_ca_topic_score_gemma":0.0000074367613,"teacher_disagreement_score":0.87676334,"about_ca_system_score_codex":0.0006087371,"about_ca_system_score_gemma":0.00090627314,"threshold_uncertainty_score":0.99971056},"labels":[],"label_agreement":null},{"id":"W1770557760","doi":"","title":"A More Efficient Time Petri Net State Space Abstraction Useful to Model Checking Timed Linear Properties","year":2008,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Abstraction; Petri net; Partial order reduction; Model checking; Computer science; Abstraction model checking; State space; Automaton; Time complexity; Theoretical computer science; Construct (python library); Extension (predicate logic); Reduction (mathematics); Büchi automaton; Linear temporal logic; Algorithm; State (computer science); Mathematics; Programming language; Deterministic automaton","score_opus":0.028598170035909636,"score_gpt":0.25424200336553143,"score_spread":0.2256438333296218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1770557760","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.30001685,0.00012551872,0.69601166,0.0017388096,0.00010606446,0.0007655271,0.000009270026,0.0010049108,0.00022138131],"genre_scores_gemma":[0.38705942,0.00003229827,0.6100032,0.0007489492,0.00006117802,0.00027132922,0.0000054075804,0.000047442303,0.0017708325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689806,0.0001517203,0.00059405755,0.0007606219,0.00074220245,0.00085335295],"domain_scores_gemma":[0.99754554,0.00005684237,0.00030185946,0.0014202548,0.00027393838,0.00040155358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010601465,0.0003996421,0.000376255,0.0006233513,0.00044652392,0.00020603817,0.0012072867,0.00020624508,0.000008046703],"category_scores_gemma":[0.00038191324,0.00038826387,0.00014097546,0.001131,0.00010805134,0.0008065999,0.0004558852,0.00049219164,0.00018441095],"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.00011554004,0.00025882214,0.0005544808,0.0000313662,0.000025365025,0.0000424575,0.0032370784,0.92543495,0.059474755,0.0025627625,0.0011564959,0.0071059223],"study_design_scores_gemma":[0.00021910608,0.000110556204,0.0064150942,0.000047721453,0.000007944408,0.00014584606,0.000022904986,0.894284,0.09760006,0.00014242656,0.00059541885,0.00040891027],"about_ca_topic_score_codex":0.0011835322,"about_ca_topic_score_gemma":0.0000433496,"teacher_disagreement_score":0.08704257,"about_ca_system_score_codex":0.00066027715,"about_ca_system_score_gemma":0.00036162316,"threshold_uncertainty_score":0.99985695},"labels":[],"label_agreement":null},{"id":"W1778004173","doi":"10.1007/978-3-642-39071-5_8","title":"Recovering and Utilizing Partial Duality in QBF","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":25,"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; Representation (politics); Dual (grammatical number); Solver; Context (archaeology); Duality (order theory); Theoretical computer science; Conjunctive normal form; True quantified Boolean formula; Transformation (genetics); Artificial intelligence; Programming language; Mathematics; Discrete mathematics","score_opus":0.04481505906145033,"score_gpt":0.2930764473280285,"score_spread":0.24826138826657818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1778004173","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.0012053741,0.00028757524,0.991499,0.00023014756,0.0014880258,0.00034869814,0.0000013505938,0.0001006269,0.0048392145],"genre_scores_gemma":[0.12318847,0.00006276933,0.87598175,0.0004548855,0.00019351608,0.000013749254,0.0000011114207,0.000019063265,0.00008469261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968589,0.0000814459,0.00056726765,0.0013306036,0.00059815496,0.0005636222],"domain_scores_gemma":[0.99806947,0.0003441341,0.00025000563,0.001102487,0.0001023509,0.00013158674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019376839,0.0003679194,0.00041977988,0.0005802131,0.00014472462,0.000539526,0.0017923199,0.00028459108,0.000017876817],"category_scores_gemma":[0.00024006073,0.00036036785,0.000053385225,0.00047128263,0.00049929647,0.0012174796,0.0013534268,0.00075420085,0.000030110206],"study_design_candidate":"design_other","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.0000036088572,0.00001304483,0.00021460018,0.000049848768,0.0000030109043,0.000020566533,0.0008688169,0.004202259,0.00020082438,0.09501448,0.0000038194794,0.8994051],"study_design_scores_gemma":[0.0002047128,0.00008747043,0.0015932461,0.00037744042,0.0000027512222,0.00005097475,3.979714e-7,0.84278846,0.0024000858,0.150754,0.0011519045,0.00058854296],"about_ca_topic_score_codex":0.000086163884,"about_ca_topic_score_gemma":0.000052330128,"teacher_disagreement_score":0.8988166,"about_ca_system_score_codex":0.00025564493,"about_ca_system_score_gemma":0.000206753,"threshold_uncertainty_score":0.99988484},"labels":[],"label_agreement":null},{"id":"W1779584415","doi":"10.1007/3-540-45739-9_20","title":"A Method for Testing the Conformance of Real Time Systems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Conformance testing; Computer science; Automaton; State space; Set (abstract data type); Algorithm; Transformation (genetics); Finite-state machine; Theoretical computer science; Programming language; State (computer science); Formal specification; Mathematics","score_opus":0.056270861027121304,"score_gpt":0.30365950191844865,"score_spread":0.24738864089132734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1779584415","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.0000088021325,0.00020239971,0.9896915,0.00013099183,0.0011158506,0.0009009343,0.000009122096,0.00011741654,0.0078229755],"genre_scores_gemma":[0.0012270464,0.000019990337,0.9977455,0.00017016029,0.00027635696,0.000035542464,0.0000016082176,0.000023700379,0.0005000969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969872,0.00008451683,0.00074780214,0.00089593965,0.0007821918,0.0005023291],"domain_scores_gemma":[0.9946315,0.0024197695,0.00077232637,0.0015345353,0.0005649748,0.00007689463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035615591,0.00036716464,0.0005373602,0.0004133176,0.00025511323,0.0003036034,0.003977226,0.00024284347,0.000003834755],"category_scores_gemma":[0.0004117164,0.00026951986,0.00011325866,0.00071755575,0.00056195067,0.000515235,0.0006734263,0.00043476713,0.000017726703],"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.000005951062,0.000014444343,0.000007226615,0.00015615282,0.0000130766175,0.000003371143,0.00079306314,0.056327205,0.0010379154,0.15545928,0.000034178753,0.78614813],"study_design_scores_gemma":[0.00013168102,0.00018575342,0.000034021836,0.00032339973,0.0000088072675,0.000060029848,1.3738457e-7,0.97359025,0.0014594035,0.022363614,0.0015466021,0.00029629708],"about_ca_topic_score_codex":0.00003991951,"about_ca_topic_score_gemma":0.0000017011537,"teacher_disagreement_score":0.91726303,"about_ca_system_score_codex":0.00017294336,"about_ca_system_score_gemma":0.00027637347,"threshold_uncertainty_score":0.9999757},"labels":[],"label_agreement":null},{"id":"W179453561","doi":"10.5555/2499634.2499659","title":"Hybrid systems modeling and verification with DEVS (WIP)","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Automaton; Computer science; Formalism (music); Hybrid system; Theoretical computer science; Algorithm; Modeling and simulation; Distributed computing; Simulation","score_opus":0.02401060970835597,"score_gpt":0.23736221432044144,"score_spread":0.21335160461208547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W179453561","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.10623811,0.0000620029,0.8900111,0.00010057063,0.00010302487,0.00020831317,1.4415006e-7,0.00014171201,0.0031350483],"genre_scores_gemma":[0.5646094,0.0000058487135,0.43518782,0.000035147164,0.000011970888,0.00003661354,5.807227e-7,0.0000031897118,0.00010943414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933404,0.000041731728,0.00013678856,0.00022284966,0.00014062642,0.00012394995],"domain_scores_gemma":[0.9993848,0.000017332897,0.000046282697,0.00040052866,0.00009612498,0.00005489195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023534606,0.00007005999,0.00007074168,0.000047587193,0.00007049705,0.00025912203,0.00026195214,0.000020218049,0.000004482635],"category_scores_gemma":[0.000016746959,0.000052112442,0.0000068778536,0.00009922292,0.000019662735,0.0010335319,0.000048802223,0.00004922547,0.000061248196],"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.000005157758,0.000029615021,0.00045214698,0.000058675796,0.000014340335,0.0000011027973,0.00043174086,0.015412917,0.0029067544,0.90577936,0.00029248738,0.0746157],"study_design_scores_gemma":[0.00007240984,0.000030646253,0.00038367455,0.00000973788,0.0000015270192,0.000027604086,0.00004824331,0.9971744,0.0010911027,0.0008749267,0.00019916116,0.00008658273],"about_ca_topic_score_codex":0.00021203945,"about_ca_topic_score_gemma":5.7359114e-7,"teacher_disagreement_score":0.98176146,"about_ca_system_score_codex":0.000020187537,"about_ca_system_score_gemma":0.000017727685,"threshold_uncertainty_score":0.24987197},"labels":[],"label_agreement":null},{"id":"W17977985","doi":"10.1128/jcm.01117-07","title":"Evidence from multiplex molecular assays for complex multipathogen interactions in acute respiratory infections.","year":2008,"lang":"en","type":"article","venue":"PubMed","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Children's & Women's Health Centre of British Columbia; British Columbia Centre of Excellence for Women's Health","funders":"","keywords":"Combinational logic; Electronic circuit; Fault detection and isolation; Algorithm; Computer science; Binary number; Sequential logic; Stuck-at fault; Fault (geology); Logic gate; Type (biology); Mathematics; Arithmetic; Engineering; Artificial intelligence","score_opus":0.21273683261107118,"score_gpt":0.3460487043597923,"score_spread":0.1333118717487211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17977985","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.19920841,0.00014920684,0.7983205,0.00020784659,0.00057471404,0.0011508784,0.000023432844,0.00017590538,0.00018914284],"genre_scores_gemma":[0.5931218,0.00002702648,0.4027116,0.0003075865,0.000053396394,0.003727029,0.000007408329,0.000012521523,0.000031565884],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9982977,0.00022802854,0.0003911395,0.00049029116,0.00022190157,0.00037095978],"domain_scores_gemma":[0.9983901,0.00047316664,0.0001595129,0.00071844377,0.00014318705,0.0001156193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007262144,0.00015208256,0.00018802147,0.0002525841,0.00017942542,0.00006583201,0.0006964114,0.00006189859,0.000005544982],"category_scores_gemma":[0.0011995346,0.00016472636,0.00010058541,0.0005425831,0.00007445966,0.0011871455,0.000179148,0.00019445151,0.000020922247],"study_design_candidate":"observational","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.00016726178,0.0008883463,0.12543914,0.00004686398,0.0002150927,0.00012997042,0.0035024078,0.0036600241,0.13193536,0.0072350726,0.0030246424,0.72375584],"study_design_scores_gemma":[0.0005546799,0.000027117498,0.87739754,0.000018136821,0.000011838265,0.0000144877085,0.000009309314,0.09873439,0.015349834,0.0005834097,0.007068365,0.00023091065],"about_ca_topic_score_codex":0.000162624,"about_ca_topic_score_gemma":0.00008741595,"teacher_disagreement_score":0.7519584,"about_ca_system_score_codex":0.00020884132,"about_ca_system_score_gemma":0.000051331488,"threshold_uncertainty_score":0.6717346},"labels":[],"label_agreement":null},{"id":"W1800402330","doi":"10.1007/3-540-40922-x_19","title":"Model Reductions and a Case Study","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","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":"Université de Montréal","funders":"","keywords":"Computer science; Reduction (mathematics); Property (philosophy); Dependency graph; Algorithm; Graph; Dependency (UML); Model checking; Construct (python library); Theoretical computer science; State (computer science); Set (abstract data type); State variable; Artificial intelligence; Mathematics; Programming language","score_opus":0.04993290233842406,"score_gpt":0.30895240832538107,"score_spread":0.259019505986957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1800402330","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.002228368,0.00017252794,0.99334794,0.00015896901,0.00071015354,0.00057095726,0.0000026938533,0.00015868714,0.0026497224],"genre_scores_gemma":[0.19493069,0.000029823974,0.80442435,0.00022373431,0.00013829028,0.00001611962,5.3291825e-7,0.000019170117,0.00021730413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707204,0.000054142,0.00043985713,0.0014286168,0.00059535657,0.0004100124],"domain_scores_gemma":[0.99786377,0.00014386361,0.00016769633,0.0015368956,0.00013269942,0.00015507927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010241142,0.00038125532,0.00035076137,0.00074106094,0.0003988678,0.00047747674,0.0015944748,0.00019657117,0.000008575991],"category_scores_gemma":[0.000054457054,0.00036356744,0.000054802713,0.0005247222,0.0006030349,0.00081807596,0.00079196354,0.00067596964,0.000013581603],"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.0000033381177,0.00006639933,0.000013721908,0.000011162613,0.000008193475,0.00063261617,0.0038814764,0.07920432,0.00002296681,0.02296144,0.000005177757,0.8931892],"study_design_scores_gemma":[0.0001433123,0.00016845154,0.00001574169,0.00004962139,0.000009113938,0.0031177998,0.0000012569408,0.8698247,0.00006476131,0.12613308,0.00010911922,0.0003630161],"about_ca_topic_score_codex":0.000060853446,"about_ca_topic_score_gemma":0.00007460294,"teacher_disagreement_score":0.8928262,"about_ca_system_score_codex":0.0001707386,"about_ca_system_score_gemma":0.00033617672,"threshold_uncertainty_score":0.9998816},"labels":[],"label_agreement":null},{"id":"W1807103277","doi":"10.1016/j.scico.2015.10.005","title":"Formal verification of function blocks applied to IEC 61131-3","year":2015,"lang":"en","type":"article","venue":"Science of Computer Programming","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":"McMaster University","funders":"","keywords":"Computer science; Implementation; Correctness; Programmable logic controller; Consistency (knowledge bases); Function (biology); Block (permutation group theory); Programming language; Certification; Function block diagram; Embedded system; Programmable logic device; Operating system; Artificial intelligence","score_opus":0.038608096884539804,"score_gpt":0.2954469819160373,"score_spread":0.2568388850314975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1807103277","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.07203226,0.000011756717,0.9256591,0.00007444363,0.00082025316,0.0003937054,4.2127792e-7,0.00011371597,0.00089434016],"genre_scores_gemma":[0.4835366,2.082481e-7,0.5163687,0.00002530947,0.000042227286,0.000018031415,7.85511e-7,0.0000031933466,0.000004981961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773455,0.00003785472,0.0004684039,0.0004632752,0.00088672637,0.00040916476],"domain_scores_gemma":[0.998025,0.000027393802,0.00031454707,0.0007978108,0.00061688974,0.0002183453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031145378,0.00012840511,0.00019851138,0.00040453507,0.00012910475,0.00014079062,0.0016061559,0.00004976348,0.0000011076486],"category_scores_gemma":[0.00009129071,0.00012376992,0.00004526287,0.0022721551,0.0003108886,0.0014232195,0.000519562,0.00009100204,0.0000116174415],"study_design_candidate":"design_other","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.00002556526,0.000079505924,0.00016810266,0.000021455997,0.0000041583844,1.5929076e-7,0.0016547632,0.0024458335,0.010575446,0.13979666,0.000044722532,0.8451836],"study_design_scores_gemma":[0.0012370583,0.0026701416,0.020278107,0.00012587277,0.000025863494,0.000026477204,0.0004790557,0.5978385,0.35409176,0.009039387,0.013390348,0.0007974255],"about_ca_topic_score_codex":0.000018903922,"about_ca_topic_score_gemma":9.289879e-7,"teacher_disagreement_score":0.8443862,"about_ca_system_score_codex":0.00008096627,"about_ca_system_score_gemma":0.0002688575,"threshold_uncertainty_score":0.5047191},"labels":[],"label_agreement":null},{"id":"W1807142225","doi":"10.1007/978-3-540-72788-0_22","title":"Dynamically Partitioning for Solving QBF","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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":"Solver; Computer science; True quantified Boolean formula; Boolean satisfiability problem; Propositional formula; Conjunctive normal form; Propositional calculus; Theoretical computer science; Parallel computing; Algorithm; Programming language; Propositional variable","score_opus":0.04062352991424389,"score_gpt":0.3092980261095121,"score_spread":0.26867449619526823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1807142225","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.000021762356,0.0001950631,0.99303013,0.0002493975,0.0023270461,0.0005346161,0.0000041040175,0.0002239091,0.00341397],"genre_scores_gemma":[0.008298361,0.00001422875,0.98999107,0.0009722707,0.00044594394,0.000021183869,0.000006635934,0.000032861302,0.00021742273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641985,0.000021706834,0.0006287268,0.0013581957,0.00080073794,0.0007707797],"domain_scores_gemma":[0.9971031,0.0007418873,0.00035851094,0.0012610154,0.00037669856,0.0001587955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002617202,0.0004096604,0.00040284058,0.0007493975,0.00037484607,0.00055711926,0.002998203,0.00035838288,0.00001071795],"category_scores_gemma":[0.00040062563,0.00041020705,0.00014865883,0.00050530926,0.0005333618,0.0008298622,0.0007774298,0.0006325285,0.000026857011],"study_design_candidate":"design_other","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.000006325195,0.000014007711,0.000014549521,0.000049036225,0.0000058728706,0.000011188686,0.00030255324,0.01600147,0.00021074951,0.17987497,0.000007432257,0.80350184],"study_design_scores_gemma":[0.00011615881,0.00011804913,0.00007741931,0.0002557839,0.000005188427,0.00003082776,7.537952e-8,0.7830429,0.0020572194,0.21208456,0.0017704387,0.00044139355],"about_ca_topic_score_codex":0.0000060169664,"about_ca_topic_score_gemma":0.000037642458,"teacher_disagreement_score":0.8030605,"about_ca_system_score_codex":0.00043245452,"about_ca_system_score_gemma":0.00037087259,"threshold_uncertainty_score":0.99983495},"labels":[],"label_agreement":null},{"id":"W1812469182","doi":"","title":"Verifying protocols by model checking: a case study of the wireless application protocol and the model checker SPIN","year":2004,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Model checking; Computer science; Protocol (science); Promela; Formal verification; Wireless; Wireless Application Protocol; Database transaction; Formal methods; Distributed computing; Programming language; Wireless network; Operating system","score_opus":0.20250737416275807,"score_gpt":0.489088301158166,"score_spread":0.28658092699540794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1812469182","genre_codex":"protocol","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11819541,0.000048837144,0.32254148,0.0024146512,0.00006103977,0.5564517,0.000055644035,0.00003443129,0.00019681883],"genre_scores_gemma":[0.6519744,0.000008815152,0.025090935,0.000017374214,0.0000071539907,0.32278332,2.3429733e-7,0.000011621721,0.00010618144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714494,0.0006820635,0.00051307457,0.0005096382,0.00080679887,0.00034346964],"domain_scores_gemma":[0.9948841,0.00028748543,0.0005353197,0.0011746048,0.0030730923,0.000045425862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002329959,0.0002096813,0.00038513402,0.00006146799,0.0009149165,0.000083104474,0.0014391274,0.000057343186,1.7354421e-7],"category_scores_gemma":[0.0012585737,0.00010677702,0.0000603771,0.0012721878,0.0010379831,0.00031132708,0.00090024155,0.0003578794,2.4703132e-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.0022953309,0.0017007721,0.00015031802,0.0008728384,0.00024220617,0.000001988351,0.09875686,0.1696515,0.021280732,0.689246,0.00021291332,0.015588549],"study_design_scores_gemma":[0.0060721883,0.0005148042,0.000018330735,0.00036653332,0.000013174433,0.0000029922014,0.026791755,0.8141752,0.13171782,0.020003509,0.0001549575,0.00016876704],"about_ca_topic_score_codex":0.000019992805,"about_ca_topic_score_gemma":0.000103270395,"teacher_disagreement_score":0.6692425,"about_ca_system_score_codex":0.00022368383,"about_ca_system_score_gemma":0.00055281795,"threshold_uncertainty_score":0.70368904},"labels":[],"label_agreement":null},{"id":"W1814905144","doi":"10.1007/978-3-642-02658-4_11","title":"Explaining Counterexamples Using Causality","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":72,"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":"Counterexample; TRACE (psycholinguistics); Computer science; Causality (physics); Set (abstract data type); Theoretical computer science; Algorithm; Programming language; Discrete mathematics; Mathematics","score_opus":0.07332092788385225,"score_gpt":0.32067037289480216,"score_spread":0.2473494450109499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814905144","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.00022607694,0.00027559538,0.9933297,0.00014538477,0.0018012945,0.00030846414,0.000003881997,0.000230898,0.0036787018],"genre_scores_gemma":[0.03612697,0.000024149667,0.9622974,0.0010286005,0.00039245244,0.000003297581,0.0000032428052,0.00002688014,0.00009705273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957323,0.000085981024,0.00068734394,0.001624375,0.0011332997,0.00073666597],"domain_scores_gemma":[0.99681336,0.00035136926,0.00046635824,0.0019296594,0.00028471457,0.0001545686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022701523,0.0005485179,0.00055813836,0.0007725433,0.00035620175,0.0007023368,0.0037526398,0.00036115418,0.000012814583],"category_scores_gemma":[0.0002091465,0.00053903105,0.00011914466,0.0006477861,0.0006291388,0.0012265487,0.000999096,0.0008464418,0.00002444781],"study_design_candidate":"design_other","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.0000048293814,0.000019580682,0.000039131497,0.000029900342,0.000007220538,0.000049703587,0.00088065997,0.02101876,0.0004910159,0.10260431,0.00000551085,0.8748494],"study_design_scores_gemma":[0.00014859444,0.0001214988,0.00022428508,0.00040497258,0.0000074809786,0.00013370556,2.3589799e-7,0.84314835,0.0025446552,0.15126944,0.0012839764,0.0007128261],"about_ca_topic_score_codex":0.000043176547,"about_ca_topic_score_gemma":0.000027648979,"teacher_disagreement_score":0.87413657,"about_ca_system_score_codex":0.0006487844,"about_ca_system_score_gemma":0.00059274083,"threshold_uncertainty_score":0.99970615},"labels":[],"label_agreement":null},{"id":"W1824289952","doi":"10.1109/glsv.1998.665319","title":"Practical approaches to the automatic verification of an ATM switch fabric using VIS","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Scheme for Promotion of Academic and Research Collaboration","keywords":"Netlist; Computer science; Liveness; Formal equivalence checking; Asynchronous Transfer Mode; Formal verification; Model checking; Equivalence (formal languages); Verilog; Hierarchy; Functional verification; Programming language; Embedded system; Theoretical computer science; Computer network","score_opus":0.38823094077753445,"score_gpt":0.358978774501153,"score_spread":0.02925216627638144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1824289952","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.06268242,0.000009880658,0.9334113,0.0017425407,0.00011995079,0.00025510276,2.904181e-7,0.00010727708,0.0016712507],"genre_scores_gemma":[0.43048385,7.639844e-7,0.5693689,0.00008140825,0.000019113195,0.0000107676815,2.7978868e-7,0.0000037682685,0.000031124648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987892,0.00024224438,0.0002626405,0.00025533867,0.0002939006,0.00015669645],"domain_scores_gemma":[0.9987247,0.000102015554,0.00012821758,0.0009296045,0.000050372008,0.00006508836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008834105,0.00008419362,0.00009947957,0.00006931852,0.00010283332,0.00009440047,0.000628583,0.00004527522,0.00003724789],"category_scores_gemma":[0.0002619668,0.00005895528,0.000029332656,0.00062737626,0.00003573171,0.0008204055,0.00009980463,0.00008348794,0.00007613657],"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.000004440891,0.00038744038,0.000100672136,0.000037669248,0.000018623397,0.0000011120899,0.0045537683,0.0026261874,0.0052273935,0.57571703,0.00045497523,0.4108707],"study_design_scores_gemma":[0.00004567159,0.00006397898,0.0018608043,0.0000055237,0.000006613388,0.000024182798,0.0001079453,0.9884999,0.008642624,0.00036608844,0.0002966672,0.000080027996],"about_ca_topic_score_codex":0.000027847194,"about_ca_topic_score_gemma":0.0000018849604,"teacher_disagreement_score":0.9858737,"about_ca_system_score_codex":0.000045482757,"about_ca_system_score_gemma":0.000021481308,"threshold_uncertainty_score":0.24041265},"labels":[],"label_agreement":null},{"id":"W1828993462","doi":"10.1007/978-3-540-45187-7_28","title":"Abstract Patterns of Compositional Reasoning","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":20,"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; Reasoning system; Component (thermodynamics); Deductive reasoning; Construct (python library); Process (computing); Opportunistic reasoning; Composition (language); Adaptive reasoning; Model-based reasoning; Theoretical computer science; Non-monotonic logic; State (computer science); Automated reasoning; Artificial intelligence; Programming language; Knowledge representation and reasoning","score_opus":0.023222640806348102,"score_gpt":0.2769562714368946,"score_spread":0.2537336306305465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828993462","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.00030487118,0.00017652391,0.9923792,0.00015177325,0.0013831115,0.00022660843,0.000010566465,0.00007272729,0.005294603],"genre_scores_gemma":[0.081165925,0.000025754733,0.9180214,0.00055846554,0.00013627662,0.0000048367074,0.0000066876223,0.000021148151,0.000059510414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685097,0.000043372005,0.00062690687,0.0010111461,0.0010330533,0.00043458393],"domain_scores_gemma":[0.99753237,0.00030565265,0.00051325746,0.0012431093,0.00028941178,0.00011620425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012885942,0.00037054878,0.00043799562,0.0006230397,0.0001469174,0.00019418498,0.0025667066,0.00026354354,0.000039878378],"category_scores_gemma":[0.000107204585,0.00036632523,0.00012505209,0.0003656074,0.00040934133,0.0006238501,0.000524948,0.00065509544,0.00001843344],"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.0000087282,0.00007110557,0.0004160311,0.0001494743,0.000020067115,0.00005045859,0.00060847827,0.022362491,0.001455604,0.43477947,0.000018513441,0.54005957],"study_design_scores_gemma":[0.00080906047,0.0004683236,0.012727804,0.00306194,0.000023905513,0.00037819266,4.8543586e-7,0.57826203,0.052722458,0.34669578,0.002594871,0.0022551448],"about_ca_topic_score_codex":0.000016985765,"about_ca_topic_score_gemma":0.0000073037627,"teacher_disagreement_score":0.55589956,"about_ca_system_score_codex":0.00022436559,"about_ca_system_score_gemma":0.00029024712,"threshold_uncertainty_score":0.9998789},"labels":[],"label_agreement":null},{"id":"W1835855307","doi":"10.48550/arxiv.1207.1386","title":"Metrics for Markov Decision Processes with Infinite State Spaces","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Markov decision process; Metric (unit); Markov process; Bisimulation; Computer science; State (computer science); Bellman equation; Markov chain; Task (project management); Mathematical optimization; Metric space; Similarity (geometry); Mathematics; Theoretical computer science; Artificial intelligence; Algorithm; Discrete mathematics; Machine learning; Statistics; Engineering","score_opus":0.08660674245689394,"score_gpt":0.22343723765226445,"score_spread":0.1368304951953705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1835855307","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.21421544,0.000053840264,0.78462297,0.000012027892,0.00014750777,0.00017589997,0.000003316167,0.00009536874,0.00067360286],"genre_scores_gemma":[0.64729106,0.00004902458,0.3522951,0.00003285486,0.000018719695,0.0000010933741,0.0000010967207,0.0000066659723,0.00030439466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991059,0.000049819748,0.00011835933,0.0003169006,0.00009119811,0.00031786892],"domain_scores_gemma":[0.998517,0.00050100806,0.00014883313,0.00045015768,0.0002510661,0.00013195923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005472087,0.00012489628,0.00012132293,0.0002646307,0.00014323495,0.000079599566,0.00065753097,0.000047773836,0.000004737341],"category_scores_gemma":[0.00042915437,0.0001124812,0.000033491262,0.0020186896,0.000056670953,0.0018455122,0.00014356343,0.00007688586,0.000026332362],"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.0006627069,0.00045235278,0.22696069,0.00042710738,0.00009977394,0.000027783894,0.0017589055,0.021572346,0.00013885669,0.67505324,0.00061451027,0.07223174],"study_design_scores_gemma":[0.0045927786,0.00163485,0.056875635,0.00023878054,0.00021439561,0.000052641702,0.00077765156,0.7986192,0.018724266,0.05547452,0.060494933,0.0023003297],"about_ca_topic_score_codex":0.000008975383,"about_ca_topic_score_gemma":0.00001216036,"teacher_disagreement_score":0.77704686,"about_ca_system_score_codex":0.000066140085,"about_ca_system_score_gemma":0.000080677346,"threshold_uncertainty_score":0.458685},"labels":[],"label_agreement":null},{"id":"W1838937351","doi":"","title":"Bisimulation analysis of SDL-expressed protocols: a case study","year":2000,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"","keywords":"Computer science; Bisimulation; Retransmission; Concurrency; Asynchronous communication; Model checking; Workbench; Programming language; Distributed computing; Theoretical computer science; Computer network; Data mining; Network packet","score_opus":0.07267435200537051,"score_gpt":0.40221509841376496,"score_spread":0.3295407464083945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1838937351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5029083,8.5536146e-7,0.49124113,0.00001061648,0.000010551384,0.0040371013,7.3720753e-7,0.000078971025,0.0017117799],"genre_scores_gemma":[0.7295968,1.444542e-7,0.26915464,0.00001546862,0.0000048816673,0.0010622548,5.7605985e-7,0.00000227939,0.00016294228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893147,0.00019034778,0.00030872336,0.00024382325,0.000229019,0.00009664288],"domain_scores_gemma":[0.9989327,0.000059688682,0.00009027939,0.0007946746,0.000088927394,0.000033713055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059890654,0.00006943073,0.00016600192,0.000254637,0.00005087841,0.000050776198,0.0003708621,0.000028084007,0.00025318514],"category_scores_gemma":[0.000036200756,0.000058636255,0.00006187799,0.0019373262,0.000015832655,0.0004386912,0.000041957763,0.000039685026,0.00001227217],"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.000088196,0.0027939812,0.038230292,0.000039355637,0.00088627223,0.00024785617,0.014985948,0.13851197,0.0019597367,0.015739955,0.00007184725,0.7864446],"study_design_scores_gemma":[0.0002925435,0.00017852303,0.012255133,0.0000026118598,0.00007618805,0.000010828584,0.00018177449,0.98453236,0.0020377855,0.00012436838,0.00022462671,0.00008325585],"about_ca_topic_score_codex":0.0003249372,"about_ca_topic_score_gemma":0.000034864228,"teacher_disagreement_score":0.8460204,"about_ca_system_score_codex":0.00001638505,"about_ca_system_score_gemma":0.000016914362,"threshold_uncertainty_score":0.27721998},"labels":[],"label_agreement":null},{"id":"W1839235158","doi":"10.1109/rtse.1998.766514","title":"Formal methods in the classroom: the logic of real-time software design","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Formal methods; Computer science; Software engineering; Software development; Formal science; Software development process; Software; Formal specification; Software construction; Programming language; Software design; Mathematics","score_opus":0.11903876733806498,"score_gpt":0.35850233452551367,"score_spread":0.23946356718744868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1839235158","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.00026293323,0.00005548384,0.9833226,0.0006417598,0.00007668623,0.0002760858,2.7895615e-7,0.00007777759,0.015286392],"genre_scores_gemma":[0.005631398,0.000034622757,0.99341375,0.0004307566,0.000016596841,0.000032403805,2.0254183e-7,0.000004405738,0.00043584307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750775,0.0014991426,0.00030492223,0.0001864979,0.00024831417,0.00025337265],"domain_scores_gemma":[0.99764127,0.0012725178,0.00012432139,0.00088918983,0.000051996067,0.000020688709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005267836,0.000096977754,0.00012781873,0.00006443611,0.000098654775,0.000055993663,0.001785639,0.00006211261,0.000107459986],"category_scores_gemma":[0.00044480458,0.00004759435,0.00005411923,0.0006392343,0.00008858364,0.0005219536,0.00016341581,0.00015250134,0.000064778804],"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.00000897575,0.000121957004,0.00013133495,0.0000146938955,0.000010065168,0.0000028397915,0.003998368,0.0009099253,0.003190599,0.46759787,0.00353267,0.5204807],"study_design_scores_gemma":[0.00023818029,0.00025209878,0.0048030736,0.0000111675145,0.000008375171,0.000040968003,0.00019455649,0.93198425,0.01392197,0.046710767,0.0016472596,0.00018732544],"about_ca_topic_score_codex":0.000025849246,"about_ca_topic_score_gemma":0.0000010595363,"teacher_disagreement_score":0.9310743,"about_ca_system_score_codex":0.000023699651,"about_ca_system_score_gemma":0.000015103566,"threshold_uncertainty_score":0.33181912},"labels":[],"label_agreement":null},{"id":"W1842616663","doi":"10.1109/newcas.2004.1359015","title":"SynAbs: model reduction tool for verilog verification","year":2004,"lang":"en","type":"article","venue":"The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004.","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Model checking; Reduction (mathematics); Computer science; Partial order reduction; State space; Verilog; Formal verification; State (computer science); Programming language; Functional verification; Algorithm; Theoretical computer science; Computer engineering; Embedded system; Field-programmable gate array; Mathematics","score_opus":0.05677783964006631,"score_gpt":0.30082139843976896,"score_spread":0.24404355879970266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1842616663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06802859,0.0012596596,0.92399234,0.0009670809,0.002731713,0.0018140202,0.00009494507,0.0003352983,0.00077636],"genre_scores_gemma":[0.98900115,0.00009579155,0.008197846,0.00019100404,0.0007843918,0.00035677085,0.000024733197,0.000056349643,0.0012919308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968202,0.00023295218,0.00079632446,0.00089851953,0.0005921611,0.00065985497],"domain_scores_gemma":[0.99750525,0.00014321583,0.00042256928,0.0013421915,0.0004001899,0.00018658939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017273474,0.00043192017,0.0004456685,0.00019542211,0.0007813823,0.00043089324,0.00094417884,0.0002699794,0.0000024500257],"category_scores_gemma":[0.00013312748,0.00033889254,0.00014139796,0.00059853133,0.00018446815,0.0010641487,0.000053204858,0.0003601917,0.000054451426],"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.00016934231,0.00039275113,0.00002973696,0.00023045829,0.000110217174,0.000007729786,0.008141961,0.69440603,0.0019261774,0.18630956,0.0034919889,0.104784034],"study_design_scores_gemma":[0.0056281122,0.0012728157,0.0014205333,0.001527453,0.00023093361,0.0013751454,0.0072139287,0.9386115,0.0028345261,0.021508139,0.015297654,0.0030792498],"about_ca_topic_score_codex":0.000085834145,"about_ca_topic_score_gemma":0.0000065902,"teacher_disagreement_score":0.9209726,"about_ca_system_score_codex":0.00028252747,"about_ca_system_score_gemma":0.00022411066,"threshold_uncertainty_score":0.9999063},"labels":[],"label_agreement":null},{"id":"W1857058067","doi":"10.1109/ccece.1995.526284","title":"High-level timing analysis using constraint logic programming and interval arithmetic","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Université de Montréal","funders":"","keywords":"Constraint logic programming; Interval arithmetic; Computer science; Arithmetic; Logic programming; Concurrent constraint logic programming; Interval (graph theory); Constraint (computer-aided design); Constraint programming; Constraint satisfaction; Programming language; Algorithm; Theoretical computer science; Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.17740052779896748,"score_gpt":0.33311446321238203,"score_spread":0.15571393541341455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857058067","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.03859542,0.00005366297,0.9604175,0.00013051511,0.000108879656,0.0000971826,6.5231296e-7,0.00012325398,0.000472903],"genre_scores_gemma":[0.432586,0.0000024535852,0.56727904,0.000068183675,0.000010540358,0.0000027603478,3.4593933e-7,0.0000023980945,0.000048228834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989367,0.000091763606,0.00024916706,0.00033090977,0.00016706751,0.00022439235],"domain_scores_gemma":[0.9993744,0.00006169196,0.00009492224,0.0003359928,0.000060872197,0.00007215132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050611835,0.00011013027,0.00018608534,0.00024593418,0.000111032394,0.00023519009,0.00032127486,0.000049715054,0.0000658263],"category_scores_gemma":[0.000079015364,0.000096094875,0.00006242949,0.00084014604,0.00010857343,0.00039528316,0.00017825112,0.00009965855,0.00001004412],"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.0000012511507,0.000071045666,0.0013566397,0.00002086294,0.00015939762,0.000010825085,0.0010595758,0.0010050416,0.0008258662,0.21789576,0.000008162001,0.77758557],"study_design_scores_gemma":[0.000096310425,0.000037925867,0.0019298631,0.000008845418,0.00007392572,0.000038352377,0.00009264526,0.9955725,0.00094551867,0.001012582,0.00004889266,0.00014262683],"about_ca_topic_score_codex":0.00005847378,"about_ca_topic_score_gemma":0.0000043262753,"teacher_disagreement_score":0.99456745,"about_ca_system_score_codex":0.00004385834,"about_ca_system_score_gemma":0.0000067383653,"threshold_uncertainty_score":0.39186352},"labels":[],"label_agreement":null},{"id":"W1862085023","doi":"10.1109/cmpass.1996.507877","title":"Feasibility of model checking software requirements: a case study","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":52,"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 Waterloo","funders":"","keywords":"Model checking; Computer science; Executable; Property (philosophy); Formal specification; Counterexample; Software requirements specification; Programming language; System requirements specification; State space; Formal verification; State (computer science); Specification language; Software; Symbolic trajectory evaluation; Software engineering; Software design; Software development; Mathematics; Discrete mathematics","score_opus":0.30304657777827415,"score_gpt":0.39915587548779935,"score_spread":0.0961092977095252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1862085023","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.32218125,0.000011871769,0.6764482,0.000012813246,0.00005518194,0.0002315574,4.1913316e-7,0.000098898585,0.00095978606],"genre_scores_gemma":[0.5214,4.9468673e-7,0.4784658,0.000023171415,0.000003351978,0.0000074669356,4.4714895e-8,0.0000021926526,0.000097510565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989342,0.00009947862,0.0002911779,0.00028997907,0.0002471676,0.00013798763],"domain_scores_gemma":[0.9988071,0.000031046802,0.00010227524,0.0009042001,0.00011250409,0.000042888027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007740609,0.00007814698,0.00011559549,0.000055074233,0.00006979647,0.00003197423,0.00046917194,0.000027343554,0.000031180334],"category_scores_gemma":[0.00021094378,0.000069497175,0.000034437773,0.00028426532,0.000027185983,0.00064684654,0.00020917732,0.00006289335,0.000009404745],"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.00003208449,0.010029041,0.23571937,0.00028283434,0.00013889077,0.0008464143,0.071305834,0.014872159,0.0022333881,0.08665612,0.0009295998,0.57695425],"study_design_scores_gemma":[0.00027961316,0.00010381913,0.0007748774,0.000004836068,0.000004740722,0.00008709029,0.0004100987,0.99634653,0.00083349244,0.0010613719,0.0000034381042,0.00009010847],"about_ca_topic_score_codex":0.00006735723,"about_ca_topic_score_gemma":0.000012821265,"teacher_disagreement_score":0.98147434,"about_ca_system_score_codex":0.000055418983,"about_ca_system_score_gemma":0.000011697699,"threshold_uncertainty_score":0.28340125},"labels":[],"label_agreement":null},{"id":"W1862298752","doi":"10.1007/978-3-642-14186-7_24","title":"Improved Local Search for Circuit Satisfiability","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"York University","funders":"","keywords":"Boolean satisfiability problem; Computer science; Benchmark (surveying); Satisfiability; Local search (optimization); Reduction (mathematics); Constraint (computer-aided design); Electronic circuit; Algorithm; Search algorithm; Boolean circuit; Constraint satisfaction problem; Theoretical computer science; Boolean function; Mathematics; Artificial intelligence; Probabilistic logic","score_opus":0.03585265515694759,"score_gpt":0.2973369076002441,"score_spread":0.26148425244329654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1862298752","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.00006478875,0.00007958299,0.9937754,0.00032166808,0.00307833,0.0011343884,0.000012735244,0.00019918925,0.0013338799],"genre_scores_gemma":[0.062303387,0.0000066756274,0.9364847,0.0005581602,0.0004258523,0.000042878524,0.0000055820187,0.00003591039,0.00013683464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552155,0.0000648627,0.0006492799,0.0019880673,0.00091468194,0.0008615405],"domain_scores_gemma":[0.99548054,0.0009042693,0.00026234967,0.002551825,0.00056771305,0.00023333257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00369887,0.00050658465,0.0005386068,0.00059965625,0.00037108696,0.00051884685,0.004770482,0.00065020326,0.000021163238],"category_scores_gemma":[0.00032176476,0.00048060127,0.00018463992,0.00053488836,0.0017067465,0.00074746524,0.0012280623,0.0014764783,0.000023491775],"study_design_candidate":"design_other","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.0000068119457,0.000020334817,0.00001862522,0.00006783915,0.000004972439,0.0000033339145,0.00039165103,0.0022764916,0.0020523567,0.09920121,0.0000019928252,0.8959544],"study_design_scores_gemma":[0.00023291304,0.00022768919,0.00014951179,0.00007417142,0.0000050619306,0.000029947209,1.1438522e-7,0.7387679,0.024786295,0.23402157,0.0011667288,0.00053807825],"about_ca_topic_score_codex":0.00003548067,"about_ca_topic_score_gemma":0.000070145215,"teacher_disagreement_score":0.8954163,"about_ca_system_score_codex":0.00045271488,"about_ca_system_score_gemma":0.0009771165,"threshold_uncertainty_score":0.99976456},"labels":[],"label_agreement":null},{"id":"W1863642815","doi":"10.1007/978-3-540-73595-3_2","title":"Formalization of Continuous Probability Distributions","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":30,"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":"Cumulative distribution function; Computer science; Random variable; Probability distribution; Inverse distribution; Applied mathematics; Probability integral transform; Automated theorem proving; Algorithm; Calculus (dental); Probability density function; Mathematics; Theoretical computer science; Moment-generating function; Heavy-tailed distribution; Statistics","score_opus":0.03663569453984287,"score_gpt":0.29448766659307807,"score_spread":0.2578519720532352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863642815","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.000115148,0.00012870641,0.9932669,0.00008816981,0.001120918,0.0005328335,0.000013388842,0.00012357159,0.004610393],"genre_scores_gemma":[0.052610766,0.000014489847,0.94703627,0.00012427136,0.000114126626,0.0000073316346,0.000014146751,0.000013724084,0.000064883556],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688184,0.0000467625,0.0007857241,0.00094981014,0.00085791276,0.00047792916],"domain_scores_gemma":[0.9969131,0.00028639016,0.00054534007,0.0015276247,0.00061736116,0.0001101888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025040482,0.0003252762,0.00044083968,0.00057380804,0.00016722702,0.00014914162,0.0024139816,0.00031807707,0.000011753095],"category_scores_gemma":[0.00041347323,0.0003094259,0.00011561739,0.0008833002,0.0009306515,0.0007844419,0.000763479,0.0004745921,0.000010580897],"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.000005233698,0.00003721904,0.00012642471,0.00006015099,0.0000046181012,0.000004402377,0.00030226776,0.0042991666,0.000119167744,0.45930126,0.0000038241214,0.53573626],"study_design_scores_gemma":[0.00023332097,0.00025177884,0.0011101606,0.00030039417,0.000010796628,0.000047275986,1.3232389e-7,0.46097177,0.015807813,0.5191295,0.0015511718,0.0005858782],"about_ca_topic_score_codex":0.000015772617,"about_ca_topic_score_gemma":0.000027327924,"teacher_disagreement_score":0.53515035,"about_ca_system_score_codex":0.00036367637,"about_ca_system_score_gemma":0.00040612574,"threshold_uncertainty_score":0.9999358},"labels":[],"label_agreement":null},{"id":"W1872058502","doi":"10.1007/3-540-45441-1_28","title":"iState: A Statechart Translator","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Programming language; Computer science; Notation; Pascal (unit); Java; Class (philosophy); Focus (optics); Code (set theory); Artificial intelligence; Mathematics; Arithmetic; Set (abstract data type)","score_opus":0.026493163383678214,"score_gpt":0.2792932405927002,"score_spread":0.252800077209022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872058502","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.000029766537,0.00035526496,0.98416686,0.0005399853,0.0020479537,0.00045117887,0.000007663984,0.00033150567,0.012069839],"genre_scores_gemma":[0.0066890526,0.00012802792,0.99101144,0.0010699064,0.0002897618,0.000015061487,0.0000050177473,0.00004478635,0.0007469341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562997,0.000055458895,0.00066430063,0.0016765796,0.0011711787,0.00080253347],"domain_scores_gemma":[0.99702793,0.00022602768,0.00031060464,0.0019668825,0.00024716413,0.000221374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015270746,0.00056805805,0.00052350626,0.0009102955,0.00024091339,0.00054119347,0.004283817,0.00036515106,0.00005316946],"category_scores_gemma":[0.000082504404,0.00054247794,0.00014484713,0.0009257799,0.00070630945,0.0010408927,0.00062928966,0.0009605677,0.00014410766],"study_design_candidate":"design_other","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.000007372592,0.000022859072,0.000009136323,0.000033696255,0.000007420075,0.0000877739,0.0008468958,0.0058697197,0.00018191029,0.09254782,0.000029742107,0.90035564],"study_design_scores_gemma":[0.00037579064,0.00027797217,0.000082081875,0.00032830966,0.000009950076,0.00021048471,1.7800711e-7,0.56811994,0.0040484793,0.387592,0.037771314,0.0011834906],"about_ca_topic_score_codex":0.000017736555,"about_ca_topic_score_gemma":0.000026111997,"teacher_disagreement_score":0.8991722,"about_ca_system_score_codex":0.00036260116,"about_ca_system_score_gemma":0.0005586644,"threshold_uncertainty_score":0.9997027},"labels":[],"label_agreement":null},{"id":"W1874195712","doi":"10.1007/3-540-44798-9_12","title":"Temporal Properties of Self-Timed Rings","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":35,"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":"Computer science; Abstraction; Automaton; Simple (philosophy); Key (lock); Theoretical computer science; Interval (graph theory); Event (particle physics); Algorithm; Mathematics","score_opus":0.03178153337522161,"score_gpt":0.2561397302930787,"score_spread":0.22435819691785708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1874195712","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.00044974976,0.0004207897,0.99119145,0.00020066691,0.0012191256,0.00041621295,0.0000012733632,0.00024167077,0.0058590523],"genre_scores_gemma":[0.10959609,0.000041263036,0.8896051,0.00026770344,0.00018714157,0.000009757584,0.0000010673589,0.000026032063,0.00026584108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653107,0.00005444907,0.0006837105,0.0011490344,0.0010532639,0.00052850146],"domain_scores_gemma":[0.99730843,0.0001148672,0.0005054091,0.0015948048,0.0003546123,0.00012185821],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001384192,0.00043600125,0.0005434218,0.0007793425,0.00014984694,0.00023110793,0.0038776572,0.00030084891,0.000011468908],"category_scores_gemma":[0.00013827937,0.00037542722,0.00012215803,0.00073420565,0.00073239056,0.00085876347,0.0011857146,0.0005918797,0.000028606708],"study_design_candidate":"design_other","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.000019181123,0.00010892997,0.00030496513,0.00027505652,0.000031423282,0.00004863618,0.003352557,0.0071526854,0.0024805528,0.10333892,0.000021688405,0.8828654],"study_design_scores_gemma":[0.00036935278,0.0003714046,0.00026006612,0.0009633499,0.000015383002,0.0001471146,3.239649e-7,0.8416859,0.05604604,0.09424655,0.004822412,0.0010721146],"about_ca_topic_score_codex":0.000036391964,"about_ca_topic_score_gemma":0.00001184359,"teacher_disagreement_score":0.8817933,"about_ca_system_score_codex":0.00025827583,"about_ca_system_score_gemma":0.0005178169,"threshold_uncertainty_score":0.99986976},"labels":[],"label_agreement":null},{"id":"W1876221940","doi":"10.1007/11560548_8","title":"How Thorough Is Thorough Enough?","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Toronto","funders":"","keywords":"Computer science; Counterexample; Abstraction; Model checking; Key (lock); Abstraction model checking; Theoretical computer science; Programming language; Computer security; Mathematics","score_opus":0.03237070675910247,"score_gpt":0.2823814480485241,"score_spread":0.25001074128942163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1876221940","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.000014616616,0.0010422076,0.9763146,0.005763396,0.0029597557,0.0005397646,0.000008591972,0.0003428989,0.0130141415],"genre_scores_gemma":[0.008438632,0.00017960799,0.9826998,0.0037592277,0.0013220491,0.000018614965,0.0000046651303,0.000058280137,0.0035191313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939942,0.00009332,0.00066013256,0.0024417404,0.0017406325,0.0010699916],"domain_scores_gemma":[0.99524677,0.00037658282,0.0005405839,0.0031967862,0.00039152484,0.0002477703],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016859709,0.00083747,0.00072638126,0.0008298978,0.00039808665,0.0016495717,0.0068441825,0.000645573,0.000042533913],"category_scores_gemma":[0.00022001484,0.00077782234,0.00023402231,0.0010116842,0.0009446256,0.002434728,0.0019427204,0.0013586022,0.0001419744],"study_design_candidate":"design_other","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.0000041075327,0.000024280564,0.0000069352795,0.000028469824,0.000009877086,0.000029032852,0.0012585014,0.0017223652,0.00011151819,0.12680337,0.000106094456,0.86989546],"study_design_scores_gemma":[0.0003919651,0.00034112707,0.00012860238,0.00046756686,0.000021459706,0.00025429492,6.08442e-7,0.5488135,0.015585293,0.26442254,0.16757643,0.0019966206],"about_ca_topic_score_codex":0.00001330337,"about_ca_topic_score_gemma":0.00001973156,"teacher_disagreement_score":0.8678988,"about_ca_system_score_codex":0.000594455,"about_ca_system_score_gemma":0.00056871277,"threshold_uncertainty_score":0.99946725},"labels":[],"label_agreement":null},{"id":"W1877887853","doi":"10.1007/978-0-387-35516-0_18","title":"An Approach for Testing Real Time Protocol Entities","year":2000,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":22,"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; Université de Montréal; Université de Sherbrooke","funders":"","keywords":"Computer science; Protocol (science); Transformation (genetics); Test (biology); Architecture; State (computer science); Programming language; Embedded system","score_opus":0.023922889095673437,"score_gpt":0.31322984385498176,"score_spread":0.28930695475930834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1877887853","genre_codex":"other","genre_gemma":"methods","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.0000055292403,0.00023931544,0.36354187,0.00009049464,0.00003446337,0.017844731,0.000014329797,0.0006890939,0.6175402],"genre_scores_gemma":[0.00013821448,0.0011635362,0.9634859,0.000076574666,0.000013565602,0.032937773,0.00015935299,0.000016444248,0.002008614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986056,0.00004675658,0.0007552699,0.00023970526,0.00016052257,0.00019215785],"domain_scores_gemma":[0.9976484,0.00011152877,0.0006301951,0.0013575521,0.00021722646,0.00003507853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000577036,0.00022811283,0.0002744404,0.0007579939,0.0002150087,0.00015214176,0.0016356101,0.0004399476,0.0000138331525],"category_scores_gemma":[0.00009460039,0.00024378306,0.000030623207,0.0002093992,0.00029000666,0.003965627,0.00023537065,0.00038283953,0.00002408098],"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.000010421392,0.000010883108,0.00000581433,0.000061875486,0.0000020838363,2.9783433e-8,0.00013858236,0.00010583129,0.0000054768407,0.5906908,0.000010113043,0.40895808],"study_design_scores_gemma":[0.00053844316,0.00020924573,0.000016626802,0.00013159392,0.0000052169194,0.00002119714,0.000089129586,0.14219622,0.00019139936,0.42766437,0.42854792,0.00038863326],"about_ca_topic_score_codex":0.0000049295386,"about_ca_topic_score_gemma":0.0000021466415,"teacher_disagreement_score":0.61553156,"about_ca_system_score_codex":0.00009066439,"about_ca_system_score_gemma":0.00007000635,"threshold_uncertainty_score":0.99411845},"labels":[],"label_agreement":null},{"id":"W1878023261","doi":"10.1007/0-306-47003-9_14","title":"Formal Verification of Peephole Optimizations in Asynchronous Circuits","year":2006,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Formal Methods in Verification","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Arbiter; Computer science; Asynchronous communication; Formal verification; Functional verification; Model checking; Intelligent verification; Context (archaeology); High-level verification; Formal equivalence checking; Computer architecture; Parallel computing; Computer engineering; Programming language; Software","score_opus":0.0265526655341011,"score_gpt":0.2581716346377446,"score_spread":0.23161896910364352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878023261","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042184125,0.00021567676,0.37963206,0.000083880346,0.0005897435,0.0005110742,0.000019365101,0.00016389365,0.6187421],"genre_scores_gemma":[0.054560903,0.000096762815,0.3511746,0.0007304464,0.0007733371,0.00038420598,0.00058135786,0.0003488666,0.59134954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.996308,0.0000886644,0.0013716159,0.0008562548,0.0007827244,0.00059268606],"domain_scores_gemma":[0.9970244,0.000103801736,0.0010503532,0.001341,0.00033861352,0.0001418084],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013869466,0.00047230153,0.0005804393,0.0010211634,0.00011274659,0.00024181246,0.0025532406,0.0013275174,0.000045817116],"category_scores_gemma":[0.00016246845,0.0005445453,0.00018476219,0.00018685026,0.00025811305,0.0030561055,0.00040947707,0.0016504754,0.000035084653],"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.000009145715,0.00003177395,0.000059188995,0.000120304125,0.000043781285,0.000006352851,0.00087576814,0.0020504177,0.00031192758,0.88067764,0.014397227,0.10141649],"study_design_scores_gemma":[0.0035257933,0.00042361277,0.0030343668,0.0014161236,0.00022646393,0.00017085244,0.00010862055,0.12842613,0.0055191666,0.17962073,0.6730963,0.0044318195],"about_ca_topic_score_codex":0.000049784063,"about_ca_topic_score_gemma":0.0000062451018,"teacher_disagreement_score":0.7010569,"about_ca_system_score_codex":0.00047552263,"about_ca_system_score_gemma":0.0005256165,"threshold_uncertainty_score":0.99996895},"labels":[],"label_agreement":null},{"id":"W187824920","doi":"10.5555/2346616.2346642","title":"On the verification of hybrid DEVS models","year":2012,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Correctness; DEVS; Computer science; Automaton; Formalism (music); Hybrid system; Hybrid automaton; Formal verification; Model checking; Distributed computing; Theoretical computer science; Modeling and simulation; Algorithm; Simulation","score_opus":0.07498653315555846,"score_gpt":0.2860850792114299,"score_spread":0.21109854605587142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187824920","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.035390444,0.000020093097,0.9326242,0.0002615452,0.00019518702,0.00008551411,3.6894215e-7,0.000045570498,0.031377044],"genre_scores_gemma":[0.7090624,0.0000027020633,0.2906478,0.00017357378,0.000013130778,0.00000876864,3.1443318e-7,0.000001896195,0.00008938704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944425,0.000077601624,0.00012132405,0.00008393634,0.00016078957,0.00011210728],"domain_scores_gemma":[0.9991614,0.00010699361,0.000067134926,0.0005952861,0.00004249191,0.000026693293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073421386,0.000044190925,0.000044874167,0.000029487817,0.00004216853,0.000015897924,0.00050603173,0.000011739236,0.000019233858],"category_scores_gemma":[0.00008130163,0.00002751291,0.00002189455,0.00013482291,0.00002623881,0.0005686366,0.00004926463,0.000046313482,0.00006961791],"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.0000013686787,0.000023673734,0.000013560039,0.000001584834,0.0000015324565,1.28703315e-8,0.00016683906,0.00023374445,0.00071421155,0.98987395,0.00039698163,0.008572548],"study_design_scores_gemma":[0.000052030613,0.000035018595,0.0013922494,0.000005181406,0.0000021107926,0.0000039840575,0.000024663017,0.64364994,0.28268367,0.071050055,0.0010205321,0.00008055324],"about_ca_topic_score_codex":0.0000059971435,"about_ca_topic_score_gemma":7.183374e-8,"teacher_disagreement_score":0.9188239,"about_ca_system_score_codex":0.00001585871,"about_ca_system_score_gemma":0.00001132683,"threshold_uncertainty_score":0.11219439},"labels":[],"label_agreement":null},{"id":"W1878518276","doi":"10.1016/j.artint.2016.09.006","title":"The Configurable SAT Solver Challenge (CSSC)","year":2016,"lang":"en","type":"preprint","venue":"Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Solver; Boolean satisfiability problem; Benchmark (surveying); Computer science; Competition (biology); Satisfiability; Problem solver; Series (stratigraphy); Theoretical computer science; Programming language; Software engineering","score_opus":0.11914121672198162,"score_gpt":0.34931248735861137,"score_spread":0.23017127063662973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878518276","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.0003258523,0.0008730126,0.969776,0.0050126333,0.0055456934,0.0004921553,0.000008937476,0.00029209326,0.01767363],"genre_scores_gemma":[0.8233229,0.0022385712,0.17050263,0.00046857086,0.0011962816,0.0004036368,0.000009214188,0.000066923094,0.0017912507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969116,0.0003109743,0.0007456567,0.0008866445,0.0005361286,0.00060901616],"domain_scores_gemma":[0.99611413,0.0005929897,0.0004066399,0.0024345536,0.00032374568,0.00012795762],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018438551,0.0003394797,0.00028039108,0.00009042708,0.00052224967,0.0006722731,0.0039178655,0.000317596,0.00006046448],"category_scores_gemma":[0.0005714842,0.00022341976,0.0001797625,0.00021714329,0.0003720122,0.00037428437,0.0015343423,0.000668329,0.0019284844],"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.00000791613,0.000024998511,0.0000020123036,0.0000130881,0.000014643584,0.0000028606098,0.00040920393,0.000088545676,0.00030621982,0.66272944,0.00027125806,0.3361298],"study_design_scores_gemma":[0.000009520721,0.000055541856,0.00002716256,0.000106888365,0.000008330531,0.000004110394,0.00007742041,0.06197793,0.07335153,0.8402766,0.023723315,0.00038164255],"about_ca_topic_score_codex":0.000052452222,"about_ca_topic_score_gemma":0.00005050739,"teacher_disagreement_score":0.8229971,"about_ca_system_score_codex":0.00013381874,"about_ca_system_score_gemma":0.000221185,"threshold_uncertainty_score":0.9988486},"labels":[],"label_agreement":null},{"id":"W1879823367","doi":"10.1007/978-3-642-27940-9_4","title":"Whale: An Interpolation-Based Algorithm for Inter-procedural Verification","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":61,"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; Interpolation (computer graphics); Mathematical proof; Software verification; Algorithm; State (computer science); Software; Model checking; Code (set theory); Programming language; Theoretical computer science; Software system; Artificial intelligence; Motion (physics); Software construction; Mathematics","score_opus":0.033696489773158866,"score_gpt":0.3015026433532409,"score_spread":0.26780615358008203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1879823367","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.000013958957,0.00026567737,0.99495596,0.00032914605,0.0029809892,0.00081462483,0.000015613174,0.00025041966,0.000373639],"genre_scores_gemma":[0.013954034,0.000010248592,0.9840256,0.0010803271,0.00067419454,0.000071313756,0.000048135782,0.000045640732,0.00009051585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647766,0.00006827807,0.0006719848,0.0014194838,0.0006882074,0.00067437807],"domain_scores_gemma":[0.99658275,0.00040100137,0.0005068474,0.0017521667,0.0005293102,0.00022791441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018051275,0.0005160367,0.00042550536,0.0008612399,0.00028340795,0.0005793126,0.003440332,0.00039427934,0.000022245082],"category_scores_gemma":[0.00016599834,0.00050913816,0.00014217943,0.0005170211,0.0005128375,0.002085531,0.00039109445,0.0005721219,0.0000330971],"study_design_candidate":"design_other","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.000006676427,0.000036411275,0.00001010369,0.000035710233,0.00000476069,0.000001050044,0.00047904564,0.0007979592,0.0002749952,0.019729692,0.000010078307,0.9786135],"study_design_scores_gemma":[0.00023876366,0.00026075152,0.00011855408,0.00018434583,0.000009766432,0.000018708073,3.6652773e-7,0.96383506,0.00407636,0.028990105,0.0016980072,0.0005692266],"about_ca_topic_score_codex":0.000011842704,"about_ca_topic_score_gemma":0.000014273758,"teacher_disagreement_score":0.9780443,"about_ca_system_score_codex":0.00042788778,"about_ca_system_score_gemma":0.0005435971,"threshold_uncertainty_score":0.999736},"labels":[],"label_agreement":null},{"id":"W1891967652","doi":"10.1007/978-3-642-00593-0_11","title":"Describing and Analyzing Behaviours over Tabular Specifications Using (Dyn)Alloy","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Notation; Programming language; Computation; Formalism (music); Theoretical computer science; Debugging; Class (philosophy); Artificial intelligence; Arithmetic; Mathematics","score_opus":0.08830630026189369,"score_gpt":0.29850024546882886,"score_spread":0.21019394520693518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1891967652","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.0015394267,0.00071160414,0.99553156,0.00018727718,0.00086393184,0.0003454766,0.0000039742686,0.00015232085,0.0006644302],"genre_scores_gemma":[0.03874188,0.000070324044,0.960422,0.00040852473,0.00025002073,0.0000029638438,0.0000041485505,0.000030171057,0.000069976864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635756,0.000063667576,0.00060071616,0.0015543455,0.00080044754,0.00062323693],"domain_scores_gemma":[0.99736476,0.0001946662,0.00040035706,0.0015754403,0.00022305647,0.00024171069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013819986,0.0004903686,0.00045783032,0.0010885851,0.00047951489,0.0008583616,0.0022912791,0.00031349424,0.000012712832],"category_scores_gemma":[0.0001614525,0.00050629943,0.00010418796,0.0008580579,0.00062834326,0.0012482152,0.0007857701,0.00078772154,0.0000057861785],"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.000003045281,0.000028751756,0.00035537468,0.000013754219,0.000009239676,0.000038624356,0.0006169091,0.030107915,0.0021088587,0.07138519,0.0000042495244,0.8953281],"study_design_scores_gemma":[0.00017941343,0.00009282265,0.0017751431,0.0004937486,0.000027706203,0.00010002443,3.3230523e-7,0.95231605,0.0021077667,0.041625135,0.00045123848,0.0008306499],"about_ca_topic_score_codex":0.000038002174,"about_ca_topic_score_gemma":0.000026733418,"teacher_disagreement_score":0.92220813,"about_ca_system_score_codex":0.00046144845,"about_ca_system_score_gemma":0.00036190165,"threshold_uncertainty_score":0.9997389},"labels":[],"label_agreement":null},{"id":"W1900134344","doi":"10.5555/1838206.1838478","title":"Symbolic model checking for agent interactions","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Model checking; Computer science; Symbolic trajectory evaluation; Semantics (computer science); Computation tree logic; Protocol (science); Programming language; Theoretical computer science; Formal verification; Temporal logic; Modalities; Cryptographic protocol; Symbolic execution; Computer security; Software; Cryptography","score_opus":0.1435389464135784,"score_gpt":0.3691226349973471,"score_spread":0.2255836885837687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1900134344","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.06582937,0.00007114671,0.9291603,0.000050099392,0.003045302,0.00096440647,0.00002712022,0.000120739875,0.00073151424],"genre_scores_gemma":[0.6896264,0.00002024338,0.3085379,0.0001063008,0.0001014839,0.0002497817,0.0000059988874,0.00001899,0.0013328715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838614,0.00008310314,0.00039334633,0.0005426608,0.0002341059,0.00036063432],"domain_scores_gemma":[0.9987394,0.00006698974,0.00024110016,0.00057430496,0.00019781746,0.00018034117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005853276,0.0002219401,0.0002397846,0.00014124953,0.00034447896,0.00023540483,0.00055684,0.00009677074,0.0000050104445],"category_scores_gemma":[0.00010683919,0.00020188477,0.00009025479,0.00015404323,0.00005343045,0.00072205096,0.00021309365,0.00022436294,0.00002881381],"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.00012160418,0.0017518029,0.0045778984,0.00049496366,0.0007514494,0.000023407883,0.022779644,0.017112505,0.0673995,0.76025856,0.00643498,0.1182937],"study_design_scores_gemma":[0.00054942654,0.000051388757,0.003162407,0.00004115466,0.000018688876,0.000018316165,0.00016904986,0.98490274,0.0006442966,0.00017553041,0.010037361,0.00022962417],"about_ca_topic_score_codex":0.00012624777,"about_ca_topic_score_gemma":0.000023145143,"teacher_disagreement_score":0.96779025,"about_ca_system_score_codex":0.000056143017,"about_ca_system_score_gemma":0.00004002815,"threshold_uncertainty_score":0.8232622},"labels":[],"label_agreement":null},{"id":"W1903645564","doi":"10.1007/978-3-319-03089-0_29","title":"Zone-Based Synthesis of Strict 2-Phase Fault Recovery","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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; Automaton; Timed automaton; Algorithm; Bounded function; Fault (geology); Graph; Set (abstract data type); Fault model; Representation (politics); Theoretical computer science; Mathematics; Programming language","score_opus":0.026470704724976164,"score_gpt":0.2825107681267793,"score_spread":0.25604006340180313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1903645564","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.00019272754,0.00020482649,0.9935889,0.00022048478,0.0016572066,0.0005141775,0.000015223923,0.0001437171,0.0034627267],"genre_scores_gemma":[0.0393692,0.000033346343,0.95973194,0.00045027025,0.00016871568,0.000028782842,0.0000035648336,0.000033043307,0.00018115445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576944,0.00013574465,0.0008634363,0.0014059355,0.0012277884,0.00059766043],"domain_scores_gemma":[0.99463147,0.001684435,0.0007499566,0.0022969556,0.00046267375,0.00017453067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019676255,0.0005339921,0.0007349279,0.0012852739,0.00015650898,0.00033764224,0.0044263867,0.00042398446,0.00006724736],"category_scores_gemma":[0.0007948126,0.0004912948,0.00021023625,0.0009564503,0.0007701873,0.00096555304,0.0007415021,0.0006559761,0.00008525401],"study_design_candidate":"design_other","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.0000147051705,0.000065665816,0.000005112058,0.00007078653,0.000009817034,0.000013105882,0.000094971874,0.02412468,0.00047342147,0.013090523,0.000027386128,0.96200985],"study_design_scores_gemma":[0.00035034874,0.00041931344,0.00006526306,0.0005431447,0.000015727732,0.000020172725,1.1926646e-7,0.91484,0.05152432,0.03039116,0.0011404058,0.0006900552],"about_ca_topic_score_codex":0.000045006967,"about_ca_topic_score_gemma":0.000008025371,"teacher_disagreement_score":0.96131974,"about_ca_system_score_codex":0.0003339091,"about_ca_system_score_gemma":0.00075608667,"threshold_uncertainty_score":0.9997539},"labels":[],"label_agreement":null},{"id":"W1912620169","doi":"10.1109/wpdrts.1996.557683","title":"Viewcharts: a behavioral specification language for complex systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Formalism (music); Computer science; Behavioral modeling; Specification language; Programming language; Formal specification; Software engineering; Behavioral analysis; Software requirements specification; Software; Software design; Artificial intelligence; Software development; Cognitive science; Psychology","score_opus":0.22499137986329493,"score_gpt":0.3686260712287662,"score_spread":0.14363469136547125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1912620169","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.0019187519,0.0001789667,0.9896861,0.00024495504,0.00043538993,0.0004781251,0.0000052214828,0.00026229245,0.0067902342],"genre_scores_gemma":[0.21542305,0.000011871067,0.7822129,0.00010213103,0.00010167079,0.00014191095,0.000009016051,0.000008115767,0.0019893367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991643,0.000054918433,0.00021915774,0.00024015908,0.00015139727,0.00017006259],"domain_scores_gemma":[0.9991891,0.000035150453,0.00008626859,0.0005659155,0.00007404012,0.000049558414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030390738,0.000081234066,0.00010387702,0.00006286529,0.0000820231,0.00014107082,0.0005083991,0.000038831935,0.00009463878],"category_scores_gemma":[0.00002399249,0.00007355311,0.000042699536,0.00018578513,0.000020648298,0.000405374,0.000041515465,0.00004106758,0.00020219777],"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.0000032607522,0.00020243667,0.000055436216,0.00004966985,0.000005976493,0.0000015549871,0.0024901736,0.00003185428,0.016986724,0.8274183,0.020492557,0.13226204],"study_design_scores_gemma":[0.00026086,0.00011084101,0.0007315655,0.000009730113,0.0000054559,0.000017558594,0.00025106978,0.9121973,0.0027878322,0.00017995742,0.083259314,0.00018855109],"about_ca_topic_score_codex":0.00002269379,"about_ca_topic_score_gemma":0.0000016478843,"teacher_disagreement_score":0.9121654,"about_ca_system_score_codex":0.000045003184,"about_ca_system_score_gemma":0.000003746169,"threshold_uncertainty_score":0.29994088},"labels":[],"label_agreement":null},{"id":"W1913203627","doi":"10.1109/hicss.1998.654765","title":"A specification method for cleanroom's black box description","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Programming language; Cleanroom; Readability; System requirements specification; Formal specification; Black box; Process (computing); Sequence diagram; Language Of Temporal Ordering Specification; Software engineering; Engineering drawing; Theoretical computer science; Engineering; Unified Modeling Language; Artificial intelligence","score_opus":0.11145365782447193,"score_gpt":0.32519792676482345,"score_spread":0.21374426894035153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1913203627","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.00022784206,0.000030385036,0.97773355,0.0009862824,0.00036143954,0.00037280127,0.0000010394914,0.0002790859,0.020007573],"genre_scores_gemma":[0.014871366,0.000021891166,0.9809569,0.0003369098,0.00010806482,0.000054970842,0.000002525351,0.000010039296,0.0036373402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988966,0.00011613771,0.0002500397,0.00035540352,0.00017512804,0.00020667855],"domain_scores_gemma":[0.9989743,0.000093878945,0.00010506158,0.00064477796,0.00012201218,0.000059929098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000836986,0.000099154335,0.00010236864,0.00010035816,0.00009607582,0.00015554322,0.0005587467,0.000067839814,0.000100979334],"category_scores_gemma":[0.00015790574,0.0000935429,0.00006684435,0.00033208207,0.000026987898,0.00088355027,0.00005143058,0.00006760761,0.00033840927],"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.000004487646,0.000054116008,0.00001398737,0.000011955928,0.000005003684,1.6364903e-7,0.0005398308,0.00006821336,0.006086354,0.6875296,0.011248234,0.29443803],"study_design_scores_gemma":[0.00020384569,0.000075203694,0.0006881828,0.0000041903436,0.0000045482257,0.00000579394,0.00004077971,0.9063644,0.02232758,0.013550526,0.056595493,0.00013949451],"about_ca_topic_score_codex":0.0000061210844,"about_ca_topic_score_gemma":0.0000018432007,"teacher_disagreement_score":0.90629613,"about_ca_system_score_codex":0.00007003536,"about_ca_system_score_gemma":0.0000064449177,"threshold_uncertainty_score":0.43496794},"labels":[],"label_agreement":null},{"id":"W1917119721","doi":"10.5555/2157654.2157683","title":"Parameterized verification of deadlock freedom in symmetric cache coherence protocols","year":2011,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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 British Columbia","funders":"","keywords":"Parameterized complexity; Computer science; Deadlock; Concurrency; Cache coherence; Theoretical computer science; Coherence (philosophical gambling strategy); Model checking; State (computer science); Distributed computing; Cache; Algorithm; Parallel computing; Mathematics; CPU cache; Cache algorithms","score_opus":0.13288805297046746,"score_gpt":0.32376482554104624,"score_spread":0.19087677257057878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1917119721","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.041754328,0.000011936367,0.93631685,0.000016642514,0.000115470626,0.00615929,0.0000010509222,0.00016048222,0.015463943],"genre_scores_gemma":[0.38838184,0.00000113777,0.6093377,0.000013694442,0.0000040627606,0.0022271776,5.2287675e-7,0.0000037105162,0.000030135398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99861056,0.0002090324,0.00045178743,0.00030969325,0.00022837224,0.00019057399],"domain_scores_gemma":[0.99866927,0.000079286816,0.00022959922,0.0008579323,0.00011539432,0.000048534414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092261285,0.00010525972,0.00018561292,0.00027555603,0.000022270351,0.000026854954,0.0010587539,0.00008247907,0.00002917694],"category_scores_gemma":[0.00035878576,0.000094375086,0.000037006226,0.0014272623,0.00006806163,0.00052766764,0.000110785695,0.000105266656,0.000037948277],"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.00010479445,0.0006376572,0.017470624,0.000118266995,0.000015046045,0.0000033105655,0.0023319595,0.00006057036,0.041140143,0.8390764,0.0000962688,0.09894495],"study_design_scores_gemma":[0.0013129661,0.0006067739,0.31162417,0.000093399736,0.000006315388,0.000010178166,0.00007879611,0.24450475,0.43276075,0.008123108,0.00044068656,0.00043811262],"about_ca_topic_score_codex":0.00033023534,"about_ca_topic_score_gemma":0.000009351704,"teacher_disagreement_score":0.8309533,"about_ca_system_score_codex":0.000046603633,"about_ca_system_score_gemma":0.00006262077,"threshold_uncertainty_score":0.38485044},"labels":[],"label_agreement":null},{"id":"W1917745538","doi":"10.1109/asic.2000.880762","title":"Model reductions in MDG-based model checking","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Construct (python library); Computer science; Property (philosophy); Reduction (mathematics); TRACE (psycholinguistics); State (computer science); Heuristic; Set (abstract data type); Theoretical computer science; Graph; Algorithm; Dependency (UML); Model checking; Dependency graph; Mathematics; Artificial intelligence","score_opus":0.15792802809065046,"score_gpt":0.31252253100857524,"score_spread":0.1545945029179248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1917745538","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.0037810877,0.000017656717,0.9685791,0.00073542283,0.00009341183,0.00007869238,3.399821e-7,0.0001721266,0.026542172],"genre_scores_gemma":[0.40247613,0.0000026172893,0.5964646,0.0001740851,0.0000073683104,0.000014493076,2.0797538e-7,0.0000033640322,0.00085714733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922603,0.000032075724,0.00017539923,0.00024064258,0.00014924683,0.00017659768],"domain_scores_gemma":[0.99937624,0.000014552641,0.00003750435,0.00049586495,0.000035330006,0.00004051208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002807327,0.00007100366,0.0000709813,0.00014240279,0.00006171288,0.000050422583,0.00045552355,0.000046615714,0.000020049634],"category_scores_gemma":[0.000048056914,0.0000705652,0.0000292917,0.00041247925,0.00002410928,0.0005691118,0.00005400816,0.00011116419,0.000041079966],"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":[4.819547e-7,0.000043900196,0.000014667187,0.0000023773537,5.761338e-7,2.7345504e-7,0.00026531494,0.81069416,0.0009262242,0.18026643,0.00027838006,0.0075072115],"study_design_scores_gemma":[0.0001053019,0.0000067442647,0.000034406206,0.0000054799675,7.7304827e-7,0.0000015236595,0.0000066221396,0.9874261,0.0032776915,0.00900114,0.00004473304,0.00008947191],"about_ca_topic_score_codex":0.00001103172,"about_ca_topic_score_gemma":0.000008161025,"teacher_disagreement_score":0.39869505,"about_ca_system_score_codex":0.000068333684,"about_ca_system_score_gemma":0.000026101696,"threshold_uncertainty_score":0.28775653},"labels":[],"label_agreement":null},{"id":"W1918236823","doi":"10.1145/335305.335314","title":"Circuit minimization problem","year":2000,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Science Foundation","keywords":"Circuit minimization for Boolean functions; Boolean function; Boolean circuit; Truth table; Circuit complexity; Minification; DTIME; Complexity class; Class (philosophy); Computer science; Function (biology); Discrete mathematics; Boolean expression; Mathematics; Algorithm; Combinatorics; Time complexity; Turing machine; Electronic circuit; Mathematical optimization; Physics; Quantum mechanics; Artificial intelligence; Computation","score_opus":0.028637628921962976,"score_gpt":0.2633902698296166,"score_spread":0.23475264090765363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1918236823","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.0009990915,0.000006464002,0.7596915,0.00014069866,0.00005042394,0.00006594406,8.6667335e-8,0.0001799145,0.23886593],"genre_scores_gemma":[0.03500495,0.000008278359,0.9578589,0.00028628236,0.000020785286,0.000010667444,9.741225e-7,0.0000029646335,0.0068061743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949723,0.000037191807,0.00010672713,0.0001508181,0.00010902547,0.000099012774],"domain_scores_gemma":[0.99961215,0.000011341443,0.00001968785,0.00030259124,0.00002530617,0.000028945971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015563694,0.00004150989,0.000038440023,0.000029123828,0.00004333636,0.0000618636,0.00036062795,0.000026199898,0.0006184978],"category_scores_gemma":[0.000010246144,0.000037335914,0.0000143187735,0.00024983022,0.000011341586,0.00049394014,0.000018309905,0.000030441155,0.0005032428],"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":[5.489873e-7,0.000013651107,0.000045938505,0.0000023158111,0.0000010543419,2.754424e-7,0.00018465523,0.00018557537,0.00011797044,0.44895846,0.0006439101,0.54984564],"study_design_scores_gemma":[0.00038300987,0.000117690506,0.008407869,0.000014559357,0.0000041380254,0.000036704594,0.000015254068,0.6943077,0.016353533,0.08420829,0.19574341,0.00040789242],"about_ca_topic_score_codex":0.0000055264654,"about_ca_topic_score_gemma":4.4411053e-7,"teacher_disagreement_score":0.6941221,"about_ca_system_score_codex":0.00001476105,"about_ca_system_score_gemma":0.000014829391,"threshold_uncertainty_score":0.6772117},"labels":[],"label_agreement":null},{"id":"W1920166637","doi":"10.1109/icppw.2005.32","title":"Feedback-Directed Switch-Case Statement Optimization","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Statement (logic); Computer science","score_opus":0.025958994356734124,"score_gpt":0.29544897796985276,"score_spread":0.26948998361311866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1920166637","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.0023415638,0.000021145286,0.98547566,0.0007818421,0.00020111488,0.0001530806,5.548719e-7,0.0006491446,0.010375889],"genre_scores_gemma":[0.05197278,0.000012256906,0.94682795,0.0003281471,0.000047844012,0.000016446118,0.000002563817,0.0000058922224,0.000786111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908054,0.00007845675,0.00025234369,0.00024006849,0.00017462726,0.00017397292],"domain_scores_gemma":[0.9992694,0.00002722147,0.00008076373,0.0004537729,0.00010168309,0.00006710817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044540997,0.00008576957,0.000071610346,0.00007809747,0.00009398532,0.00011041029,0.00031686845,0.000035666468,0.00019524209],"category_scores_gemma":[0.000052515355,0.00007712256,0.000022849561,0.0003588325,0.000014944266,0.0009294755,0.00009840817,0.00005656453,0.0001561174],"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.000011528816,0.00021383999,0.000059234088,0.000014310063,0.000022451544,0.00005535048,0.001285739,0.2818956,0.00069906807,0.15596202,0.0065338793,0.553247],"study_design_scores_gemma":[0.00017295941,0.000027245067,0.00007658377,0.0000027830893,0.0000021527455,0.00012035244,0.000024440373,0.9848141,0.0073573957,0.00014710931,0.0071452395,0.00010961949],"about_ca_topic_score_codex":0.00002091246,"about_ca_topic_score_gemma":0.000009132024,"teacher_disagreement_score":0.7029185,"about_ca_system_score_codex":0.00008623836,"about_ca_system_score_gemma":0.000027593898,"threshold_uncertainty_score":0.31449667},"labels":[],"label_agreement":null},{"id":"W1921908778","doi":"10.1109/icm.1998.825580","title":"Modeling and formal verification of a commercial microcontroller for embedded system applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Microcontroller; Correctness; Embedded system; Formal verification; Embedded software; Instruction set; Flowchart; Programming language; Abstraction; Assembly language; Software; Formal methods; Formal specification; Set (abstract data type); Software engineering; Computer architecture","score_opus":0.04174665769725585,"score_gpt":0.27605972148257285,"score_spread":0.234313063785317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1921908778","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.0038322804,0.00008693792,0.99279606,0.0001487644,0.00004823127,0.00073598465,0.0000037376958,0.00009379728,0.0022541808],"genre_scores_gemma":[0.5123925,0.0000060067428,0.48727798,0.00004287274,0.000013964824,0.0002331444,0.0000014014211,0.000003265954,0.00002880836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992713,0.000040395782,0.00028139685,0.00018578023,0.00008973895,0.00013142326],"domain_scores_gemma":[0.99934113,0.000054149292,0.00008919682,0.00034799823,0.00013244427,0.000035074256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000471137,0.000070710346,0.00012874349,0.00006952454,0.000107257525,0.00004209132,0.00028026418,0.00004679785,0.0000019726344],"category_scores_gemma":[0.000019550991,0.00006619356,0.000037910442,0.00013668455,0.000020645735,0.00052433764,0.000050679835,0.000039399303,0.0000044745602],"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.000010612078,0.00003954313,0.000008907261,0.000088418456,0.000008702046,1.8227833e-8,0.00079054706,0.0010614467,0.003904197,0.9221227,0.00004634507,0.071918555],"study_design_scores_gemma":[0.00044094727,0.000031260697,0.000054106382,0.000008225893,0.00000671573,0.0000043628775,0.00008120047,0.9960481,0.0022367134,0.000555262,0.00046176134,0.00007136163],"about_ca_topic_score_codex":0.000008327176,"about_ca_topic_score_gemma":0.000001703238,"teacher_disagreement_score":0.99498665,"about_ca_system_score_codex":0.000022049637,"about_ca_system_score_gemma":0.000008959067,"threshold_uncertainty_score":0.26992953},"labels":[],"label_agreement":null},{"id":"W1923175529","doi":"10.1109/newcas.2004.1359103","title":"Towards software model checking using MDGs","year":2004,"lang":"en","type":"article","venue":"The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004.","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Model checking; Programming language; Java; Software engineering; Software; Schema (genetic algorithms); Metamodeling; Theoretical computer science; Machine learning","score_opus":0.08429744369017628,"score_gpt":0.31436829529378046,"score_spread":0.2300708516036042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923175529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084429905,0.00236913,0.9085743,0.00039522166,0.002197662,0.0007504017,0.000052344763,0.00037966183,0.0008513757],"genre_scores_gemma":[0.97115684,0.00007788777,0.02642333,0.0005535729,0.0008638769,0.00005490846,0.0000068084,0.000082888444,0.0007799086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602824,0.00030819708,0.0008684666,0.0009358667,0.0009354151,0.0009237947],"domain_scores_gemma":[0.9972456,0.00012959645,0.00044365882,0.0013945531,0.0004574455,0.00032911138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017971497,0.0005617867,0.0006019944,0.00024165018,0.00089283497,0.00061086897,0.0013882805,0.00029933103,0.0000045863526],"category_scores_gemma":[0.00020158834,0.00042455562,0.00016216408,0.00086612906,0.00022256226,0.0010962756,0.00016297067,0.00062653417,0.0000501768],"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.0000275601,0.00017466072,0.00015306594,0.0001262052,0.000072662624,0.000034520817,0.006476995,0.8776554,0.00024497366,0.026748898,0.00044606786,0.08783899],"study_design_scores_gemma":[0.0024538648,0.00031559987,0.0009506414,0.0020687692,0.00012665895,0.0010336117,0.0033674052,0.97573936,0.0007452846,0.0074076406,0.0036358961,0.002155269],"about_ca_topic_score_codex":0.00041980363,"about_ca_topic_score_gemma":0.00003066791,"teacher_disagreement_score":0.8867269,"about_ca_system_score_codex":0.00033710685,"about_ca_system_score_gemma":0.00039165764,"threshold_uncertainty_score":0.99982065},"labels":[],"label_agreement":null},{"id":"W1931845768","doi":"10.1007/3-540-45654-6_33","title":"Towards a Computer-Aided Design of Reactive Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Scalability; Notation; Context (archaeology); Supervisory control; Representation (politics); State space; Theoretical computer science; State (computer science); Scale (ratio); Control (management); Programming language; Distributed computing; Artificial intelligence; Database; Mathematics","score_opus":0.050764824922186,"score_gpt":0.2882635640846574,"score_spread":0.2374987391624714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1931845768","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.000022859338,0.00043420223,0.9901737,0.00010786807,0.0036778643,0.0009348685,0.0000060253547,0.0002070464,0.00443554],"genre_scores_gemma":[0.01702868,0.000072779716,0.9819899,0.00023213592,0.0004750699,0.000022051103,0.00000333791,0.00004153651,0.00013450705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947785,0.0002196723,0.0010330888,0.001730768,0.0015076663,0.0007302965],"domain_scores_gemma":[0.9951876,0.0007076959,0.0009358959,0.0022997889,0.000671084,0.00019797044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028028905,0.00066114095,0.0009651341,0.0012193867,0.00017963615,0.0004236155,0.004902985,0.0004922417,0.00000832026],"category_scores_gemma":[0.00019139379,0.00061709335,0.00016477414,0.0011611746,0.00090264145,0.0009990495,0.0013282149,0.0008628571,0.000030758103],"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.000021171158,0.000058073616,0.000010257648,0.00010467801,0.00002935232,0.00007531752,0.001045377,0.2072906,0.0004945027,0.12255954,0.000025064146,0.6682861],"study_design_scores_gemma":[0.00025273254,0.00045688776,0.000081960316,0.0006359034,0.000012196155,0.00019632155,2.8284745e-7,0.937256,0.0032933047,0.05645072,0.0007296406,0.00063409],"about_ca_topic_score_codex":0.00009060365,"about_ca_topic_score_gemma":0.0000038235175,"teacher_disagreement_score":0.7299653,"about_ca_system_score_codex":0.0005742609,"about_ca_system_score_gemma":0.00091144367,"threshold_uncertainty_score":0.99962807},"labels":[],"label_agreement":null},{"id":"W1934202930","doi":"10.1109/iwsoc.2004.29","title":"Consistency validation of high-level requirements","year":2004,"lang":"en","type":"article","venue":"IEEE International Workshop on System-on-Chip for Real-Time Applications","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Computer science; Consistency (knowledge bases); Abstraction; Model validation; Formal verification; Software engineering; Reliability engineering; Programming language; Data mining; Artificial intelligence; Data science; Engineering","score_opus":0.07645753720916089,"score_gpt":0.3502733583454872,"score_spread":0.2738158211363263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1934202930","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.013041281,0.0000061393257,0.9560604,0.0011869068,0.0012678686,0.0020430041,0.00027145568,0.0003076093,0.025815304],"genre_scores_gemma":[0.7946277,0.000013096227,0.20182769,0.00016589536,0.00029168665,0.001981223,0.00016491498,0.00003901242,0.00088873995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99694544,0.0001046466,0.00097409147,0.0007692412,0.00090285327,0.00030375592],"domain_scores_gemma":[0.9965848,0.0006031521,0.0007685086,0.001345994,0.0005721265,0.00012545093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000848483,0.000300145,0.00034964035,0.00045445983,0.00026922172,0.00012833705,0.0015976875,0.00016177278,0.00001793015],"category_scores_gemma":[0.0001536563,0.00029786472,0.00020183892,0.0005275702,0.000098293975,0.0003735823,0.00007156953,0.00016581411,0.00060469314],"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.00008017257,0.00040129694,0.00001969584,0.00005120165,0.00009399306,7.379021e-7,0.000111897905,0.010671895,0.0058132736,0.97594815,0.0006208713,0.0061868136],"study_design_scores_gemma":[0.01233368,0.00237462,0.008294526,0.004900461,0.0002569534,0.00014311637,0.0006838375,0.036384862,0.769134,0.14332633,0.018916259,0.0032514015],"about_ca_topic_score_codex":0.000053315845,"about_ca_topic_score_gemma":0.000001935179,"teacher_disagreement_score":0.8326218,"about_ca_system_score_codex":0.00060427503,"about_ca_system_score_gemma":0.00013883472,"threshold_uncertainty_score":0.99994737},"labels":[],"label_agreement":null},{"id":"W1937018809","doi":"10.1109/ccece.2000.849696","title":"System design based on interface specifications","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; VHDL; Interface (matter); Programming language; Finite-state machine; Hardware description language; Set (abstract data type); Event (particle physics); State diagram; Computer architecture; Theoretical computer science; Embedded system; Parallel computing; Field-programmable gate array","score_opus":0.17663677143681097,"score_gpt":0.29805999677560024,"score_spread":0.12142322533878927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1937018809","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.000031496296,0.000014176578,0.90983254,0.00049722946,0.00028015775,0.00015483695,3.2782853e-7,0.00040170495,0.088787556],"genre_scores_gemma":[0.37222838,8.5740425e-7,0.626856,0.000100352416,0.000016023632,0.000017839866,1.2065429e-7,0.0000035876517,0.0007767741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912304,0.00016559233,0.00015937077,0.00024253114,0.00017802772,0.00013145902],"domain_scores_gemma":[0.9988862,0.00012723278,0.000053306783,0.00083471905,0.000047539426,0.00005099427],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039602915,0.00007605513,0.00006705814,0.00009238008,0.00008287492,0.000094393436,0.0006926042,0.000033553722,0.000111105146],"category_scores_gemma":[0.00005722827,0.00006558483,0.000026462503,0.00033235023,0.00001905323,0.00022811773,0.000031287662,0.00006953327,0.0015614777],"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.0000035263467,0.00010164408,0.000011110128,0.0000136017825,0.0000032773467,0.000001603663,0.00021128653,0.012000719,0.0010325586,0.946855,0.007925523,0.031840157],"study_design_scores_gemma":[0.0000753238,0.00006150762,0.00013552792,0.0000144194855,0.0000010502209,0.0000032119053,0.000020349791,0.9711968,0.024975477,0.00008168413,0.0033552332,0.000079473175],"about_ca_topic_score_codex":0.0000018953237,"about_ca_topic_score_gemma":1.0351799e-7,"teacher_disagreement_score":0.95919603,"about_ca_system_score_codex":0.00009192029,"about_ca_system_score_gemma":0.000007810342,"threshold_uncertainty_score":0.9992159},"labels":[],"label_agreement":null},{"id":"W1941952906","doi":"10.1109/ccece.2001.933562","title":"Model checking of the Fairisle ATM switch fabric using FormalCheck","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Asynchronous Transfer Mode; Liveness; Asynchronous communication; Set (abstract data type); Verilog; Very-large-scale integration; Model checking; Code (set theory); Embedded system; Computer network; Programming language","score_opus":0.14777235921243168,"score_gpt":0.2922092801877091,"score_spread":0.1444369209752774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1941952906","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.08154922,0.00003928562,0.9047481,0.00009429105,0.00016302343,0.00010608613,3.058654e-7,0.00006256409,0.013237126],"genre_scores_gemma":[0.50760114,0.0000025753327,0.4920355,0.00007233473,0.000008917266,0.0000018128146,3.4424424e-8,0.0000035271466,0.00027414237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999074,0.000045826673,0.00024123512,0.00017756461,0.00026183005,0.00019958806],"domain_scores_gemma":[0.9990404,0.00001752845,0.00013982873,0.00070239394,0.00007010357,0.000029692976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036525558,0.000085670035,0.00010044438,0.000046389174,0.00012066414,0.000042121734,0.00095389714,0.000049474776,0.000019552286],"category_scores_gemma":[0.000054347387,0.000059395417,0.000072905124,0.00049789355,0.000038059217,0.00069458433,0.00030594404,0.000098679346,0.0000121793655],"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.000003490742,0.00015687973,0.0022162376,0.000059910846,0.000024882778,6.833193e-7,0.005153846,0.12644681,0.057257466,0.73909396,0.0006592674,0.06892656],"study_design_scores_gemma":[0.00007410814,0.000008502968,0.00033652288,0.000011125926,0.0000034074553,0.0000072804596,0.0000231884,0.9539323,0.043908246,0.0015385879,0.000079865655,0.000076880126],"about_ca_topic_score_codex":0.000023719613,"about_ca_topic_score_gemma":0.0000013873454,"teacher_disagreement_score":0.8274855,"about_ca_system_score_codex":0.000046794634,"about_ca_system_score_gemma":0.000019020954,"threshold_uncertainty_score":0.24220748},"labels":[],"label_agreement":null},{"id":"W1944379106","doi":"10.1137/120895950","title":"Space Complexity in Polynomial Calculus","year":2015,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"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 Toronto","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Vetenskapsrådet; Kungliga Tekniska Högskolan; Akademie Věd České Republiky; Univerzita Karlova v Praze; Grantová Agentura České Republiky; European Commission","keywords":"Pigeonhole principle; Mathematics; Proof complexity; Polynomial; Space (punctuation); Mathematical proof; Calculus (dental); Upper and lower bounds; Linear space; PSPACE; Discrete mathematics; Resolution (logic); Combinatorics; Computational complexity theory; Geometry; Mathematical analysis; Algorithm; Computer science","score_opus":0.14288788910998224,"score_gpt":0.35842390220311937,"score_spread":0.21553601309313714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1944379106","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.16274403,0.00006564785,0.82738745,0.0011972312,0.0021681003,0.000083341285,2.7709004e-7,0.00008255454,0.006271358],"genre_scores_gemma":[0.588158,0.0000014165698,0.4112263,0.0002445262,0.00033945474,3.1970896e-7,2.0950255e-7,0.0000064179662,0.000023375918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981178,0.0004044222,0.0004099217,0.0002449012,0.00044357427,0.00037938802],"domain_scores_gemma":[0.9989318,0.00010523167,0.00026103007,0.00033096992,0.00012287182,0.00024808518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027130812,0.00013653401,0.0002020297,0.00022834563,0.0001580033,0.0002491691,0.00088037294,0.000060401813,0.000003530774],"category_scores_gemma":[0.0003923948,0.00012676434,0.000061919374,0.00048643255,0.000053210235,0.00041365754,0.00023767742,0.0006175648,0.0000730126],"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.00019882205,0.00054707075,0.006301741,0.00002959206,0.000040182942,0.00051773986,0.009539853,0.063834354,0.0010476253,0.551865,0.010613046,0.35546502],"study_design_scores_gemma":[0.0011878104,0.00031017722,0.013228609,0.00010180951,0.0000020851814,0.0005877717,0.0001442656,0.97228223,0.0014923085,0.0048070704,0.0055747624,0.0002810851],"about_ca_topic_score_codex":0.000027302875,"about_ca_topic_score_gemma":0.0000050318868,"teacher_disagreement_score":0.9084479,"about_ca_system_score_codex":0.0003303296,"about_ca_system_score_gemma":0.00016934458,"threshold_uncertainty_score":0.51693},"labels":[],"label_agreement":null},{"id":"W1946205157","doi":"10.3233/fun-2008-83405","title":"A Relation-Algebraic Theory of Bisimulations","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Relation (database); Algebraic theory; Mathematics; Algebraic number; Algebra over a field; Computer science; Pure mathematics","score_opus":0.0531799845477055,"score_gpt":0.28035470639325566,"score_spread":0.22717472184555015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1946205157","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.083666,0.00002428417,0.893209,0.00007872731,0.00025655597,0.00020938193,0.0000029016467,0.00012625496,0.022426926],"genre_scores_gemma":[0.5881626,0.000008611657,0.411382,0.00018138031,0.000011653672,0.000013933527,0.0000058922506,0.000003939867,0.00022998286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878865,0.000081109065,0.00054194615,0.00010484567,0.00031543596,0.0001680129],"domain_scores_gemma":[0.99874216,0.00021605495,0.00024947713,0.0006429726,0.00008747193,0.00006183553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055933493,0.00009640548,0.00013683057,0.00018834475,0.00018189554,0.000031169337,0.0005730076,0.00005158479,0.00010290686],"category_scores_gemma":[0.0002321724,0.00008881191,0.000061163075,0.00052086817,0.00013050647,0.0017428526,0.00014503983,0.00010053023,0.000238168],"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.000006574341,0.000041180872,0.0023259388,0.000025654508,0.000017172528,5.1775487e-7,0.0060278694,0.00049448735,0.00007488575,0.9816779,0.00038353333,0.008924308],"study_design_scores_gemma":[0.0015925986,0.0004132391,0.27604306,0.00011077486,0.00003071988,0.00015652369,0.0007838669,0.5689717,0.0075952834,0.12161206,0.021972748,0.00071741885],"about_ca_topic_score_codex":0.000002974393,"about_ca_topic_score_gemma":1.7993091e-7,"teacher_disagreement_score":0.8600658,"about_ca_system_score_codex":0.00004777337,"about_ca_system_score_gemma":0.00007382685,"threshold_uncertainty_score":0.36216447},"labels":[],"label_agreement":null},{"id":"W1949868634","doi":"10.1109/lics.2003.1210074","title":"Labeled Markov processes: stronger and faster approximations","year":2003,"lang":"en","type":"preprint","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Measure (data warehouse); Markov chain; Markov process; Computer science; Quotient; Simple (philosophy); State (computer science); Temporal logic; Model checking; Theoretical computer science; Algorithm; Point (geometry); Applied mathematics; Mathematics; Discrete mathematics; Pure mathematics; Data mining; Machine learning","score_opus":0.03214452298220764,"score_gpt":0.2890622018226806,"score_spread":0.25691767884047295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1949868634","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.0029200786,0.00018341152,0.96578884,0.00030407653,0.00041118267,0.00048093958,0.0000047776157,0.00019734213,0.029709358],"genre_scores_gemma":[0.009413054,0.00004841223,0.9875066,0.00019802357,0.00003070156,0.00017120602,0.000009293941,0.000012574296,0.0026100827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853045,0.00013655263,0.00029079514,0.0005946922,0.00023328327,0.00021424805],"domain_scores_gemma":[0.99857026,0.000058190166,0.00017105909,0.0009127511,0.00021158005,0.0000761294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051493564,0.00020846116,0.00020332888,0.00011712748,0.00008146961,0.00040145637,0.00076444814,0.00019179349,0.000043856973],"category_scores_gemma":[0.00019905448,0.00018485264,0.000030275649,0.0002479707,0.000054120177,0.0004534274,0.00082750444,0.00032616596,0.000027452825],"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.000013307786,0.00037580173,0.0010887795,0.003687277,0.00016842244,0.000004880018,0.004416225,0.0003512594,0.00046165372,0.8332121,0.0051013427,0.15111898],"study_design_scores_gemma":[0.0018020123,0.00026222548,0.008740402,0.0007163131,0.00015852347,0.00013014415,0.0005375559,0.76149714,0.015889313,0.17307873,0.033235326,0.003952296],"about_ca_topic_score_codex":0.0000061719256,"about_ca_topic_score_gemma":0.0000036073425,"teacher_disagreement_score":0.7611459,"about_ca_system_score_codex":0.00004047225,"about_ca_system_score_gemma":0.00019423246,"threshold_uncertainty_score":0.75380725},"labels":[],"label_agreement":null},{"id":"W1955944964","doi":"10.3233/fi-2011-609","title":"On Three Alternative Characterizations of Combined Traces","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"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":"","keywords":"Mathematics; Computer science","score_opus":0.07303667729737182,"score_gpt":0.2743309215394803,"score_spread":0.20129424424210848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1955944964","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.15903673,0.0000027766228,0.8000451,0.00005967579,0.00043296348,0.0003044536,0.00001309776,0.000096092335,0.040009137],"genre_scores_gemma":[0.67848855,0.00000459231,0.32112813,0.00027261453,0.000010186538,0.000034902037,0.000008689551,0.0000052422242,0.000047092508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896204,0.000036895013,0.00045175524,0.000113189395,0.00026925007,0.00016684475],"domain_scores_gemma":[0.9989265,0.000069263944,0.00032316893,0.0005434965,0.00007768917,0.000059850092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029411237,0.00011236997,0.00015142985,0.00015115409,0.0000768195,0.000048830938,0.00082458404,0.000037774334,0.0001573674],"category_scores_gemma":[0.00008512402,0.00009813916,0.00004545035,0.0002757613,0.00008359007,0.0014042675,0.00013142556,0.00009207169,0.00018763421],"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.000025295889,0.00014314988,0.000505289,0.000030441135,0.000026029491,4.319503e-7,0.0077852886,0.000011779538,0.0002431437,0.9764913,0.00007588109,0.014661988],"study_design_scores_gemma":[0.0026063814,0.0035213123,0.20715863,0.00030205506,0.00004295736,0.00001938024,0.0008086018,0.42752922,0.19631672,0.15823549,0.0024778794,0.0009813702],"about_ca_topic_score_codex":0.000014922186,"about_ca_topic_score_gemma":0.0000014054807,"teacher_disagreement_score":0.8182558,"about_ca_system_score_codex":0.000034833338,"about_ca_system_score_gemma":0.000027585613,"threshold_uncertainty_score":0.40019986},"labels":[],"label_agreement":null},{"id":"W1960819344","doi":"10.1007/978-3-540-76650-6_19","title":"Efficient Symbolic Execution of Large Quantifications in a Process Algebra","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Interpreter; Programmer; Process calculus; Programming language; Process (computing); Logarithm; Symbolic computation; Constant (computer programming); Theoretical computer science; Mathematics","score_opus":0.03466933902380891,"score_gpt":0.326966042265499,"score_spread":0.2922967032416901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1960819344","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.0040927352,0.0002928558,0.9913504,0.0001128269,0.0010145928,0.00059848005,0.000006142742,0.00010230145,0.0024296355],"genre_scores_gemma":[0.50028527,0.000012691524,0.49936172,0.00018495608,0.00007944631,0.000015522557,0.0000048937754,0.000019279703,0.00003625163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591887,0.000065321925,0.00093788025,0.0012933253,0.001113246,0.0006713765],"domain_scores_gemma":[0.9970282,0.00031839072,0.00055847876,0.0015553035,0.0004249605,0.00011467147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031856247,0.00038934866,0.00050067995,0.0019276128,0.00015255576,0.00014044104,0.0029798117,0.00035488754,0.00000932662],"category_scores_gemma":[0.0002854162,0.0003854346,0.00010117488,0.0019815185,0.00058130437,0.00031661525,0.00054762675,0.0007191633,0.000023454564],"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.000013702162,0.00023662315,0.00023716198,0.00018863683,0.0000075019793,0.000021016942,0.0058674617,0.08469157,0.00070456,0.62869817,0.0000025347085,0.2793311],"study_design_scores_gemma":[0.00025236572,0.00009079164,0.0022979584,0.0005198366,0.000005375543,0.000025440524,0.0000014287815,0.934211,0.0079081915,0.054066714,0.00015447068,0.0004663967],"about_ca_topic_score_codex":0.00002682403,"about_ca_topic_score_gemma":0.00007802446,"teacher_disagreement_score":0.84951943,"about_ca_system_score_codex":0.000337563,"about_ca_system_score_gemma":0.00054865325,"threshold_uncertainty_score":0.99985975},"labels":[],"label_agreement":null},{"id":"W1965163560","doi":"10.1007/11591191_31","title":"Model Checking Abstract State Machines with Answer Set Programming","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Simon Fraser University","funders":"","keywords":"Answer set programming; Computer science; Abstract state machines; Model checking; Programming language; Set (abstract data type); State (computer science); Bounded function; Theoretical computer science; Logic programming; Logic program; Property (philosophy); Stable model semantics; Finite-state machine; Semantics (computer science); Mathematics","score_opus":0.03801049610129808,"score_gpt":0.29402019239511457,"score_spread":0.2560096962938165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965163560","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.00032409845,0.00017234682,0.9952286,0.00031291414,0.0006265486,0.0005190997,0.0000060563434,0.00030702347,0.0025032999],"genre_scores_gemma":[0.043237925,0.000022691798,0.9555178,0.000503861,0.00026852966,0.00001722846,0.000005474507,0.000049133483,0.000377326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566764,0.000028293036,0.0005931187,0.0016370177,0.0012419809,0.0008319739],"domain_scores_gemma":[0.99728656,0.00014431759,0.00047734397,0.0015892513,0.00031571963,0.00018680606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014820988,0.00064204144,0.0004976565,0.0007070761,0.00029196183,0.0009263966,0.0033804087,0.00025206874,0.000011025724],"category_scores_gemma":[0.00005451601,0.0005272053,0.00009883712,0.0006287582,0.00063745026,0.0016101409,0.00079885736,0.0010651977,0.000023563998],"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.0000070101755,0.000015567066,0.000023661067,0.000031346834,0.000007009364,0.000024366967,0.0010663243,0.26267064,0.00007035245,0.005422944,0.000002753311,0.73065805],"study_design_scores_gemma":[0.00017427643,0.00011092783,0.00012610987,0.0003208639,0.000006454536,0.00007983535,1.2957966e-7,0.96390396,0.0009101603,0.032757718,0.0009266074,0.00068295834],"about_ca_topic_score_codex":0.000019279998,"about_ca_topic_score_gemma":0.00011305159,"teacher_disagreement_score":0.72997504,"about_ca_system_score_codex":0.000342307,"about_ca_system_score_gemma":0.0005458948,"threshold_uncertainty_score":0.99971795},"labels":[],"label_agreement":null},{"id":"W1966288006","doi":"10.1007/978-3-540-87531-4_7","title":"Extensional Uniformity for Boolean Circuits","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","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":"Université de Montréal; Computer Research Institute of Montréal; Université du Québec à Montréal","funders":"","keywords":"Circuit complexity; Duality (order theory); Extensional definition; Order (exchange); Connection (principal bundle); Class (philosophy); Bounded function; Property (philosophy); Coupling (piping); Boolean circuit; Discrete mathematics; Combinatorics; Computer science; Electronic circuit; Complexity class; Boolean function; Topology (electrical circuits); Mathematics; Physics; Geometry; Time complexity; Mathematical analysis; Materials science; Quantum mechanics; Artificial intelligence; Composite material","score_opus":0.04206150276281763,"score_gpt":0.2832405391224276,"score_spread":0.24117903635960997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966288006","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.000042491556,0.00031678827,0.9926068,0.0003255546,0.002672327,0.0006720504,0.000011444377,0.00020855287,0.0031439748],"genre_scores_gemma":[0.01380892,0.00007371831,0.98359174,0.0014553381,0.0005258265,0.00002359273,0.000009826035,0.000037936596,0.00047311516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591285,0.00003783528,0.0006122073,0.001626848,0.00107859,0.00073167676],"domain_scores_gemma":[0.99660015,0.0005537884,0.00037679286,0.0017479749,0.00051881874,0.00020244536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014152348,0.00051239505,0.00051679066,0.0007415849,0.0004634988,0.00026654277,0.003832005,0.00039475274,0.000009971948],"category_scores_gemma":[0.00033423174,0.00048669105,0.00019608214,0.00052547874,0.00083234615,0.00092077156,0.0009412052,0.00069402764,0.000043748823],"study_design_candidate":"design_other","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.0000053227477,0.000026558107,0.0000144360165,0.000038474784,0.0000072759276,0.000027948423,0.0003786648,0.0063642524,0.00010264336,0.09338101,0.00012629035,0.89952713],"study_design_scores_gemma":[0.00038878046,0.00028081448,0.0005229156,0.00026339793,0.000007880635,0.00033963274,8.464189e-8,0.77388656,0.002990351,0.20683344,0.013526612,0.0009595342],"about_ca_topic_score_codex":0.0000065181102,"about_ca_topic_score_gemma":0.00001112965,"teacher_disagreement_score":0.8985676,"about_ca_system_score_codex":0.00038483692,"about_ca_system_score_gemma":0.00081252644,"threshold_uncertainty_score":0.9997585},"labels":[],"label_agreement":null},{"id":"W1966863253","doi":"10.5555/2561828.2561875","title":"FPGA acceleration of enhanced boolean constraint propagation for SAT solvers","year":2013,"lang":"en","type":"article","venue":"International Conference on Computer Aided Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Field-programmable gate array; Hardware acceleration; Parallel computing; Gate array; Boolean satisfiability problem; Embedded system; Multi-core processor; Software; Computer hardware; Computer architecture; Theoretical computer science; Operating system","score_opus":0.11955683412207367,"score_gpt":0.3282179620677078,"score_spread":0.20866112794563413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966863253","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.004244561,0.0000022917234,0.9906887,0.0008266955,0.0011610878,0.0011036841,0.000006506518,0.00012272163,0.0018437854],"genre_scores_gemma":[0.5118195,0.0000031647687,0.48767382,0.00020628827,0.00008056228,0.00014071155,0.000017111259,0.0000065394192,0.0000523432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981892,0.00016018873,0.0005297954,0.0004600764,0.00044663865,0.00021408664],"domain_scores_gemma":[0.99780726,0.00025330263,0.0003740205,0.00040072406,0.0010917347,0.000072961506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054108415,0.00019121758,0.00020397635,0.00022502843,0.00007961624,0.00031657753,0.0010420942,0.00009053105,0.00010316916],"category_scores_gemma":[0.00011976336,0.00018405415,0.000087247,0.00014433498,0.00008983424,0.0011399519,0.000096906704,0.00012287986,0.000090895024],"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.000058437603,0.00011305527,0.000010187962,0.000020368729,0.00005114616,5.4196244e-7,0.0005316244,0.0036161225,0.07419118,0.6265535,0.0010538044,0.2938001],"study_design_scores_gemma":[0.0004950565,0.0003981775,0.0005430906,0.00006215112,0.0000036693655,0.0000035764326,0.000021838738,0.75746965,0.21461955,0.02613938,0.00007438508,0.00016947088],"about_ca_topic_score_codex":0.0000145529675,"about_ca_topic_score_gemma":8.954105e-7,"teacher_disagreement_score":0.75385356,"about_ca_system_score_codex":0.000114488794,"about_ca_system_score_gemma":0.00016463909,"threshold_uncertainty_score":0.75055104},"labels":[],"label_agreement":null},{"id":"W1967948656","doi":"10.1016/j.apal.2003.10.018","title":"The proof complexity of linear algebra","year":2004,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":39,"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; McMaster University","funders":"","keywords":"Mathematics; Algebra over a field; Linear algebra; Discrete mathematics; Pure mathematics","score_opus":0.13543145746453764,"score_gpt":0.3439368107145531,"score_spread":0.20850535325001548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967948656","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.149903,0.00093439966,0.83135176,0.0060109384,0.00011736523,0.00049616426,0.0000052321475,0.00006154648,0.011119571],"genre_scores_gemma":[0.820749,0.00006294469,0.17886636,0.000283313,0.000018667912,0.000007789207,7.3281e-7,0.000002039379,0.000009153697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939764,0.000024050893,0.00018983909,0.00013173844,0.00013598849,0.00012073913],"domain_scores_gemma":[0.9994164,0.000038693943,0.00014206122,0.00030706238,0.00006750844,0.000028281638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051950186,0.00006257524,0.00011771324,0.000021530504,0.00009365572,0.000015247454,0.00041047146,0.00003898121,0.0000013483207],"category_scores_gemma":[0.000030929634,0.000040062034,0.000029359664,0.00016506894,0.00024290732,0.000073071074,0.000108147346,0.00006751297,0.000002683842],"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.0000076082233,0.000032011038,0.0000064023384,0.000016452132,0.0000057559014,1.3970637e-7,0.00024067004,0.000084453044,0.0019937025,0.9762177,0.00005313356,0.02134199],"study_design_scores_gemma":[0.00012520998,0.00011008822,0.0016604904,0.000008106408,0.0000022133263,0.000002094854,0.000053487533,0.0005919159,0.22799611,0.76849306,0.000896144,0.000061079845],"about_ca_topic_score_codex":0.0000047649196,"about_ca_topic_score_gemma":0.0000022182376,"teacher_disagreement_score":0.670846,"about_ca_system_score_codex":0.0000019351303,"about_ca_system_score_gemma":0.000020269954,"threshold_uncertainty_score":0.16336824},"labels":[],"label_agreement":null},{"id":"W1969392070","doi":"10.4204/eptcs.122.7","title":"Formal Analysis of Soft Errors using Theorem Proving","year":2013,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Correctness; Computer science; Random variable; Theoretical computer science; Algorithm; Electronic circuit; Gaussian; Mathematics; Statistics","score_opus":0.010720317880594793,"score_gpt":0.2705253148929311,"score_spread":0.2598049970123363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969392070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36338666,0.000022068314,0.63515127,0.00007649293,0.00009810745,0.0002490723,1.9815306e-7,0.00007815963,0.0009379913],"genre_scores_gemma":[0.6499077,0.000001839982,0.34996697,0.00007714816,0.000021640724,0.000016570555,2.0707138e-7,0.0000065652625,0.0000013562651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963087,0.000052791882,0.0006264917,0.0008354239,0.00085393543,0.0013226934],"domain_scores_gemma":[0.9984515,0.00012620687,0.00028954624,0.0004899143,0.0004823747,0.00016050485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043161833,0.00023396742,0.00041331895,0.0012523328,0.00025365746,0.0003694981,0.0032435174,0.00009092713,0.000030117224],"category_scores_gemma":[0.00036227828,0.00020185712,0.00012897054,0.007998836,0.0017596424,0.0037407058,0.0010403934,0.00040935792,0.0000073367155],"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.0000054418233,0.000050290597,0.0009246806,0.000014138974,0.000023932334,3.1483086e-7,0.000816614,0.0009691475,0.004976147,0.9718285,0.0000011645088,0.020389587],"study_design_scores_gemma":[0.00011100068,0.00016426566,0.0036720277,0.000024005134,0.000028760105,0.000012143056,0.000029258967,0.83501565,0.012984108,0.14775386,0.000004029209,0.00020087621],"about_ca_topic_score_codex":0.000021059766,"about_ca_topic_score_gemma":0.0000011394565,"teacher_disagreement_score":0.8340465,"about_ca_system_score_codex":0.00038379003,"about_ca_system_score_gemma":0.0003546807,"threshold_uncertainty_score":0.8231495},"labels":[],"label_agreement":null},{"id":"W1969398050","doi":"10.5555/603095.603116","title":"Solution of parallel language equations for logic synthesis","year":2001,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"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":"Computer science; Context (archaeology); Square (algebra); Component (thermodynamics); Regular language; Automaton; Operator (biology); Composition (language); Theoretical computer science; Programming language; Algorithm; Mathematics","score_opus":0.08379085514172536,"score_gpt":0.3456706451729516,"score_spread":0.26187979003122624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969398050","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.0012353909,0.00003458807,0.9932019,0.0004428514,0.000082800696,0.00014607162,0.0000012892958,0.00007898016,0.004776139],"genre_scores_gemma":[0.2648995,0.0000068643603,0.73471266,0.000053268734,0.000013569017,0.000047673202,9.997449e-7,0.0000018577535,0.00026360858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995109,0.000039773106,0.00014054927,0.00011681394,0.000087819,0.00010417305],"domain_scores_gemma":[0.9993155,0.0002492815,0.00006712387,0.00029063932,0.000057783258,0.00001967797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039359962,0.000041364943,0.00006620076,0.000054132805,0.000046784156,0.0000148695435,0.000301859,0.00003065468,0.000025492436],"category_scores_gemma":[0.0004928429,0.00003568291,0.000038497627,0.00017581698,0.000019616898,0.00024146485,0.000035774297,0.00001921165,0.000017289354],"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.000004722705,0.000037793143,0.000035033976,0.000008650067,0.000004252941,1.9416733e-7,0.00025180733,0.000253135,0.005008537,0.9180568,0.00016362923,0.076175466],"study_design_scores_gemma":[0.00013923956,0.00006564664,0.001169109,0.000008464536,0.000007863975,0.0000039362135,0.00007638056,0.9549994,0.024640946,0.017737154,0.0010448084,0.0001070862],"about_ca_topic_score_codex":0.000026787447,"about_ca_topic_score_gemma":0.000006273396,"teacher_disagreement_score":0.95474625,"about_ca_system_score_codex":0.00001741004,"about_ca_system_score_gemma":0.000015676622,"threshold_uncertainty_score":0.14551069},"labels":[],"label_agreement":null},{"id":"W1969553191","doi":"10.1016/s1567-8326(02)00068-1","title":"Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes","year":2003,"lang":"en","type":"article","venue":"The Journal of Logic and Algebraic Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Bisimulation; Converse; Mathematics; Markov chain; Discrete mathematics; Bounded function; Markov process; Transition system; Calculus (dental); Algorithm","score_opus":0.0201040403771851,"score_gpt":0.2657216902340813,"score_spread":0.24561764985689621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969553191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2245869,0.0013356415,0.7732167,0.00023465749,0.00016662104,0.00026020646,5.7001165e-7,0.000032589032,0.00016607408],"genre_scores_gemma":[0.8257985,0.00006187192,0.17394984,0.00010011153,0.000038152582,0.0000032429712,4.424555e-7,0.0000064291985,0.00004140855],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984236,0.0003372275,0.0005834204,0.00013365716,0.00029126072,0.00023088735],"domain_scores_gemma":[0.99789566,0.00045161505,0.0010019182,0.0002202339,0.0003641271,0.00006644153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002505344,0.00014548647,0.00033992913,0.000110126755,0.0001291939,0.00009132849,0.0005061109,0.000054949498,0.000008008596],"category_scores_gemma":[0.0012611169,0.00008950767,0.00005729601,0.00036114253,0.00017078967,0.0005046295,0.0000661115,0.00018695234,0.0000025254428],"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.0003391576,0.00056754606,0.0017741452,0.00044260922,0.00023251862,0.000027708858,0.006136236,0.00061741547,0.028534885,0.13239448,0.000060899012,0.8288724],"study_design_scores_gemma":[0.013601861,0.020616442,0.048662797,0.0035845847,0.0015459394,0.01197898,0.0074499506,0.07452143,0.0658498,0.7367281,0.0112092,0.004250919],"about_ca_topic_score_codex":0.0000018278092,"about_ca_topic_score_gemma":1.8845043e-7,"teacher_disagreement_score":0.8246215,"about_ca_system_score_codex":0.00001735776,"about_ca_system_score_gemma":0.00008303843,"threshold_uncertainty_score":0.36500168},"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":"W1971336478","doi":"10.1016/j.laa.2014.06.028","title":"The Markov Chain Tree Theorem in commutative semirings and the State Reduction Algorithm in commutative semifields","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 Manitoba","funders":"Engineering and Physical Sciences Research Council; Russian Foundation for Basic Research; Higher Education Authority","keywords":"Commutative property; Markov chain; Mathematics; Reduction (mathematics); Tree (set theory); State (computer science); Semiring; Chain (unit); Discrete mathematics; Algorithm; Combinatorics","score_opus":0.008746823472302429,"score_gpt":0.26453862737328726,"score_spread":0.2557918039009848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971336478","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.032945983,0.0005944835,0.95755893,0.005539937,0.00006343232,0.0010794261,0.000006587846,0.000057400244,0.0021538467],"genre_scores_gemma":[0.83693504,0.0008024103,0.16047996,0.00038047638,0.0000727212,0.00091828546,0.000010206526,0.000016580068,0.00038428896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855566,0.00057446177,0.00029390442,0.00026415565,0.00012537367,0.00018645146],"domain_scores_gemma":[0.99833524,0.0009925949,0.00013639525,0.0004246447,0.00006870607,0.000042419946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020854988,0.00012082457,0.00014820808,0.00007378837,0.00034750535,0.00010946201,0.00047026176,0.000055815886,9.047045e-7],"category_scores_gemma":[0.00013745755,0.00007796253,0.00002057683,0.0004961067,0.00032545952,0.00025465997,0.00019165785,0.00033303545,0.0000048540132],"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.000017092576,0.000024065013,0.00002280176,0.000007223023,0.0000061362334,1.1239537e-7,0.009949461,0.0000380317,0.00009038907,0.53351605,0.00001677413,0.45631188],"study_design_scores_gemma":[0.0008123617,0.000045511024,0.003053186,0.000018820625,0.0000056864674,0.0000140899565,0.0013660989,0.7835606,0.0013970903,0.20757249,0.0020094921,0.00014460784],"about_ca_topic_score_codex":0.00011552323,"about_ca_topic_score_gemma":0.00006329917,"teacher_disagreement_score":0.8039891,"about_ca_system_score_codex":0.000026316917,"about_ca_system_score_gemma":0.000018900388,"threshold_uncertainty_score":0.31792197},"labels":[],"label_agreement":null},{"id":"W1971979814","doi":"10.1007/s100090200073","title":"Comparison of SPIN and VIS for protocol verification","year":2003,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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":"Computer science; Asynchronous communication; Protocol (science); Theory of computation; Software; Formal verification; Software verification; Formal methods; Promela; Model checking; Communications protocol; Embedded system; Programming language; Computer network; Software system; Software construction","score_opus":0.06635256689107977,"score_gpt":0.41037756509548057,"score_spread":0.3440249982044008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971979814","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.008677611,0.000017450186,0.981458,0.00074880355,0.00043381518,0.00847549,0.00001983335,0.000114024544,0.000054985383],"genre_scores_gemma":[0.20384778,0.00000584899,0.7842453,0.000104383165,0.000034733443,0.011724749,0.0000039015827,0.000013987583,0.000019310013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99874514,0.000043582953,0.00052784383,0.00025081675,0.0002610419,0.000171588],"domain_scores_gemma":[0.9987637,0.0002054718,0.00015733147,0.00024040966,0.0005916577,0.00004143798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005902524,0.00012871686,0.00021100846,0.00038072478,0.00010678598,0.00011191262,0.0007845837,0.00017739371,0.000007106974],"category_scores_gemma":[0.0010675219,0.00011851674,0.00009751451,0.0001772819,0.00010046622,0.00053260976,0.000017077666,0.00020849834,0.0000020549585],"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.00017243304,0.00019463069,0.0011847413,0.00003140481,0.000060541264,7.526775e-7,0.00011573317,0.0000617398,0.0040550777,0.7201539,0.00011744615,0.27385157],"study_design_scores_gemma":[0.0047615133,0.0026182237,0.0021227726,0.00017460143,0.000029555205,0.00021125094,0.00010136853,0.007430705,0.69201005,0.09211581,0.19800885,0.00041531085],"about_ca_topic_score_codex":2.6514496e-7,"about_ca_topic_score_gemma":4.0595762e-7,"teacher_disagreement_score":0.68795496,"about_ca_system_score_codex":0.00007196656,"about_ca_system_score_gemma":0.00006806659,"threshold_uncertainty_score":0.48329726},"labels":[],"label_agreement":null},{"id":"W1972387650","doi":"10.1016/j.jal.2011.01.001","title":"Reasoning about conditional probabilities in a higher-order-logic theorem prover","year":2011,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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; Conditional probability; Automated theorem proving; Probabilistic logic; Bayes' theorem; Law of total probability; Theoretical computer science; Computer science; Mathematics; Conditional mutual information; Probability theory; Discrete mathematics; Gas meter prover; Regular conditional probability; Algorithm; Posterior probability; Artificial intelligence; Bayesian probability; Mathematical proof; Programming language; Statistics","score_opus":0.06770647973216208,"score_gpt":0.2773710722070462,"score_spread":0.20966459247488411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972387650","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.07499764,0.0002508696,0.6926169,0.00057586434,0.0011249231,0.0007009855,0.0000029087796,0.00011876853,0.22961114],"genre_scores_gemma":[0.47552043,0.000008052639,0.52405345,0.00027437235,0.00007401847,0.000017298813,5.1267466e-7,0.000004865795,0.000046999878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851704,0.00010508994,0.0005598796,0.0002095281,0.0003590184,0.0002494449],"domain_scores_gemma":[0.9988264,0.0001006067,0.0005420966,0.00027821053,0.00018363571,0.000069062226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015918721,0.0001390484,0.0002464816,0.00018705713,0.000069142065,0.000061229526,0.00079109374,0.0000972094,0.0001502555],"category_scores_gemma":[0.0001351272,0.00010412239,0.00006621458,0.0003903313,0.00015266392,0.00050957233,0.00010578719,0.0003482092,0.000021702608],"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.000067811656,0.00011525291,0.0001814604,0.000016500391,0.000009740918,0.000013602189,0.0012784854,0.00017423675,0.0004945505,0.99351466,0.00006776497,0.004065924],"study_design_scores_gemma":[0.00049604423,0.00024953941,0.01958438,0.000038663435,0.000006504593,0.000079444835,0.00016512636,0.0017203444,0.0020272632,0.9747453,0.00072517205,0.00016223594],"about_ca_topic_score_codex":0.0000032060163,"about_ca_topic_score_gemma":0.000001076091,"teacher_disagreement_score":0.4005228,"about_ca_system_score_codex":0.000117377,"about_ca_system_score_gemma":0.0001313791,"threshold_uncertainty_score":0.42459878},"labels":[],"label_agreement":null},{"id":"W1972947791","doi":"10.1109/issre.2012.11","title":"An Assertions-Based Approach to Verifying the Absence Property Pattern","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Property (philosophy); Assertion; Model checking; Temporal logic; Programming language; Theoretical computer science; Formal verification; Algorithm","score_opus":0.10747452183940207,"score_gpt":0.33972820343413296,"score_spread":0.2322536815947309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972947791","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.0019426764,0.000027491807,0.9859861,0.00062744244,0.0009995193,0.0008781787,0.0000026205855,0.0003917324,0.009144215],"genre_scores_gemma":[0.40402052,0.0000012506397,0.5944698,0.0009462861,0.000107069536,0.0003185425,0.000008415228,0.000012904378,0.000115249335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997664,0.00043985053,0.0003257974,0.0007284386,0.00046315705,0.0003787637],"domain_scores_gemma":[0.9965068,0.000052080166,0.00016086828,0.0029479726,0.00015835965,0.00017388375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001802178,0.00025877307,0.0001931473,0.00009986579,0.00022858591,0.00053103414,0.0036994994,0.00018903024,0.000014404392],"category_scores_gemma":[0.000087570545,0.00013777582,0.00008156313,0.00030251566,0.0000502499,0.00051846966,0.0009831879,0.0005864741,0.00011975276],"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.000019277519,0.0011191452,0.003990581,0.0004834096,0.000051019702,0.0000015661802,0.0062317387,0.06752151,0.0036311753,0.06038718,0.0013180143,0.8552454],"study_design_scores_gemma":[0.000057273097,0.00003400632,0.011718505,0.000043687338,0.0000073652614,0.000004154023,0.00004618214,0.98090124,0.003917026,0.00036218215,0.0025235512,0.00038483238],"about_ca_topic_score_codex":0.00027542308,"about_ca_topic_score_gemma":0.0000063472567,"teacher_disagreement_score":0.9133797,"about_ca_system_score_codex":0.000108918866,"about_ca_system_score_gemma":0.00016597979,"threshold_uncertainty_score":0.6874652},"labels":[],"label_agreement":null},{"id":"W1973097078","doi":"10.1016/s1389-1286(03)00247-0","title":"The formal semantics of SDL-2000: Status and perspectives","year":2003,"lang":"en","type":"article","venue":"Computer Networks","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Programming language; Compiler; Formal semantics (linguistics); Operational semantics; Semantics (computer science); Abstract machine; Unified Modeling Language; Formalism (music); Action semantics; Abstract state machines; Denotational semantics; Finite-state machine; Software","score_opus":0.019831019594329848,"score_gpt":0.25259292670944733,"score_spread":0.2327619071151175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973097078","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.0084919715,0.0015794544,0.9882357,0.0000812654,0.0006156111,0.00011315044,2.1184347e-7,0.000046277066,0.0008363262],"genre_scores_gemma":[0.45440736,0.00029669472,0.5451287,0.00005049043,0.00007256376,0.0000035089229,2.4366196e-7,0.0000056827816,0.000034786044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896747,0.00016243108,0.00019914568,0.0002092652,0.00013711439,0.00032456312],"domain_scores_gemma":[0.99909127,0.0001796776,0.00011144671,0.00047552522,0.00007867181,0.00006339324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006019835,0.000100941295,0.00011642932,0.000028349443,0.00019977834,0.00011981288,0.00039861456,0.000052711304,0.0000021969395],"category_scores_gemma":[0.000032898388,0.00007515479,0.00003558492,0.0002482231,0.0001453461,0.00035787042,0.00024495512,0.00014299426,0.0000018777897],"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.0000054746974,0.00002666399,0.0019016351,0.00000706838,0.000019239065,0.0000010719482,0.0021925431,0.008449438,0.0000041595854,0.7606433,0.00052184105,0.22622754],"study_design_scores_gemma":[0.00017832646,0.00009378573,0.013694153,0.000011433983,0.00000456615,0.000017005084,0.000063315776,0.9737156,0.00008578575,0.0035882525,0.008431747,0.00011603218],"about_ca_topic_score_codex":0.000004295122,"about_ca_topic_score_gemma":0.0000023530242,"teacher_disagreement_score":0.96526617,"about_ca_system_score_codex":0.000029533956,"about_ca_system_score_gemma":0.00003446181,"threshold_uncertainty_score":0.30647236},"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":"W1973614029","doi":"10.1109/fmcad.2007.20","title":"Exploiting Resolution Proofs to Speed Up LTL Vacuity Detection for BMC","year":2007,"lang":"en","type":"article","venue":"Formal Methods in Computer-Aided Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":20,"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":"","keywords":"Mathematical proof; Model checking; Computer science; Bounded function; Resolution (logic); Property (philosophy); Variable (mathematics); Algorithm; Theoretical computer science; Programming language; Mathematics","score_opus":0.1730657762546369,"score_gpt":0.41963682545035175,"score_spread":0.24657104919571485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973614029","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.00519985,0.000035960376,0.9876089,0.000041123454,0.003927526,0.0024559228,0.0000021202254,0.00056023046,0.00016835805],"genre_scores_gemma":[0.019484174,0.000002438093,0.97943467,0.0002606835,0.00054130936,0.00018405102,0.0000031581556,0.0000446798,0.00004485236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940227,0.0017116161,0.0013531515,0.0010563156,0.00051955186,0.0013366375],"domain_scores_gemma":[0.9950934,0.0026701682,0.00047356632,0.0010986676,0.00036368857,0.00030048977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.027620165,0.00042560886,0.00052892294,0.0009336836,0.0004322851,0.00027033116,0.0014545219,0.00030322684,0.000003169555],"category_scores_gemma":[0.0019509218,0.00045248008,0.0001994581,0.0018487509,0.000055912747,0.0023031675,0.0005576862,0.00044724805,0.000024791141],"study_design_candidate":"design_other","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.00038541522,0.00009011936,0.00007138011,0.000091528724,0.00001296462,0.0000035827786,0.001226127,0.018008888,0.020269522,0.015870808,0.000058780137,0.9439109],"study_design_scores_gemma":[0.0007836507,0.0008085966,0.0028422435,0.00007416838,0.000008887981,0.00003349115,0.000043126587,0.71869045,0.2628374,0.012838086,0.00060653116,0.00043336154],"about_ca_topic_score_codex":0.000031459727,"about_ca_topic_score_gemma":0.000017311124,"teacher_disagreement_score":0.9434775,"about_ca_system_score_codex":0.00059291313,"about_ca_system_score_gemma":0.00013108851,"threshold_uncertainty_score":0.9997927},"labels":[],"label_agreement":null},{"id":"W1975286358","doi":"10.1145/1101815.1101819","title":"Reasoning about static and dynamic properties in alloy","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Software Engineering and Methodology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Iterated function; Computer science; Relational calculus; Formalism (music); Programming language; Calculus (dental); Theoretical computer science; Relational model; Mathematics; Relational database; Data mining","score_opus":0.06189680358928729,"score_gpt":0.3087775904416149,"score_spread":0.24688078685232762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975286358","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.114943646,0.00047009083,0.8839255,0.00020159144,0.00017050326,0.00008939804,0.0000010572152,0.0001954977,0.0000027149965],"genre_scores_gemma":[0.19050282,0.0002261357,0.80909735,0.000074328855,0.000007855736,0.000037673577,3.469855e-7,0.000010190896,0.00004329387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990553,0.00019657034,0.00018845318,0.00027768651,0.00007163907,0.0002103414],"domain_scores_gemma":[0.998982,0.0005756488,0.000030479729,0.00033376372,0.00002019169,0.000057876874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085400953,0.00012426007,0.00017763316,0.0002167612,0.00006554758,0.00003161424,0.00021815354,0.000084954765,0.00000232459],"category_scores_gemma":[0.000868871,0.000119878365,0.000019771182,0.00018544424,0.000039998773,0.00028853506,0.000015011268,0.0002454771,0.0000020481966],"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.000018938616,0.000041471383,0.00018815849,0.000093347364,0.000022848619,0.000003417425,0.002868249,0.09690782,0.0030457592,0.002933692,0.0000013601463,0.89387494],"study_design_scores_gemma":[0.00065177574,0.00021677054,0.023635097,0.00019183509,0.000021831029,0.00020188779,0.00010435876,0.9646369,0.0075510484,0.0007039562,0.0016468979,0.00043764492],"about_ca_topic_score_codex":0.000018304467,"about_ca_topic_score_gemma":0.000013104776,"teacher_disagreement_score":0.89343727,"about_ca_system_score_codex":0.000042731735,"about_ca_system_score_gemma":0.000017384233,"threshold_uncertainty_score":0.4888498},"labels":[],"label_agreement":null},{"id":"W1975740747","doi":"10.1109/ccece.2012.6334965","title":"Reliability evaluation of multivalued logic circuits via probabilistic transfer matrices","year":2012,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Calgary","funders":"National Science Council","keywords":"Probabilistic logic; Reliability (semiconductor); Computer science; Logic gate; Binary number; Notation; Electronic circuit; Algorithm; Logic synthesis; Theoretical computer science; Reliability engineering; Mathematics; Arithmetic; Engineering; Artificial intelligence; Electrical engineering","score_opus":0.10352448487512565,"score_gpt":0.35202469173343404,"score_spread":0.24850020685830837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975740747","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.13807322,0.00010395974,0.8550248,0.000038036,0.0003495818,0.0005810745,8.1830063e-7,0.00009888566,0.0057295933],"genre_scores_gemma":[0.71562284,0.0000019589838,0.28426823,0.000022825365,0.000022871358,0.000043312557,0.0000010512308,0.0000034674497,0.000013461956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783325,0.00064026826,0.00036854143,0.0002545363,0.0006736926,0.00022969882],"domain_scores_gemma":[0.9985499,0.00016206627,0.00007372264,0.0006680278,0.00047490463,0.00007141676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062392685,0.00010281964,0.00014502545,0.0000759941,0.000047652138,0.000019161496,0.00048786035,0.00007403685,0.00008729771],"category_scores_gemma":[0.0008761886,0.00008134471,0.00005558843,0.00044750792,0.00006446291,0.0010004326,0.000046908455,0.00007636582,0.00003926441],"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.00001273122,0.00088051625,0.0040463666,0.000253158,0.000021162616,9.8931075e-8,0.0034141375,0.0034430586,0.035860535,0.57716316,0.000036810867,0.37486827],"study_design_scores_gemma":[0.00045853306,0.000097041986,0.12969159,0.000013980778,0.000054261287,0.000005598946,0.000029324126,0.7811964,0.035792824,0.05238202,0.00006309994,0.00021533076],"about_ca_topic_score_codex":0.000027686452,"about_ca_topic_score_gemma":0.0000011593866,"teacher_disagreement_score":0.77775335,"about_ca_system_score_codex":0.00011054087,"about_ca_system_score_gemma":0.000058752088,"threshold_uncertainty_score":0.3317141},"labels":[],"label_agreement":null},{"id":"W1975949393","doi":"10.5555/2840819.2840853","title":"SAT Solving using FPGA-based Heterogeneous Computing","year":2015,"lang":"en","type":"article","venue":"International Conference on Computer Aided Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Field-programmable gate array; Computer science; Boolean satisfiability problem; Software; Throughput; Parallel computing; Solver; Computation; Symmetric multiprocessor system; Computer architecture; Reconfigurable computing; Gate array; Embedded system; Theoretical computer science; Algorithm; Operating system; Programming language","score_opus":0.2899101177026795,"score_gpt":0.37318514606365927,"score_spread":0.08327502836097977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975949393","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.006121895,0.000014710984,0.9889184,0.00040210126,0.0030411116,0.00025740883,0.0000028025163,0.00035344722,0.0008880962],"genre_scores_gemma":[0.4597581,6.5960904e-7,0.5393061,0.0006945726,0.0002026683,0.0000046445834,0.0000052241094,0.000012958124,0.000015032723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970862,0.00046765892,0.00051457644,0.0006849017,0.0008587157,0.0003879152],"domain_scores_gemma":[0.9978287,0.0002520241,0.00030495637,0.0006630615,0.0007255836,0.00022567683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011914324,0.0002969571,0.00025899967,0.00034587467,0.00014282162,0.00068818853,0.0019872403,0.000107783955,0.000023150435],"category_scores_gemma":[0.00014309978,0.00030399684,0.000099806246,0.00027767612,0.000072063034,0.000640138,0.0003584537,0.00026264545,0.00015856593],"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.000104119405,0.0001912519,0.00011646803,0.0000117119835,0.000073548865,0.00009709701,0.0006828969,0.80801886,0.0024650388,0.108805396,0.0005727078,0.07886088],"study_design_scores_gemma":[0.00060243753,0.0002572545,0.000079406695,0.000106149324,0.000004980808,0.00007456504,0.000009430631,0.97937644,0.012897719,0.006036582,0.00023135866,0.00032365357],"about_ca_topic_score_codex":0.00002582438,"about_ca_topic_score_gemma":8.9986656e-7,"teacher_disagreement_score":0.45363623,"about_ca_system_score_codex":0.00035946287,"about_ca_system_score_gemma":0.0004003242,"threshold_uncertainty_score":0.99994123},"labels":[],"label_agreement":null},{"id":"W1976591314","doi":"10.1145/355045.355061","title":"Composing features and resolving interactions","year":2000,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":89,"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 Waterloo","funders":"","keywords":"Computer science","score_opus":0.020598918192697033,"score_gpt":0.3042032797844661,"score_spread":0.28360436159176905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976591314","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.034787405,0.00010771253,0.80647755,0.0007914803,0.00020223214,0.000059112805,1.7677097e-7,0.00021684536,0.15735748],"genre_scores_gemma":[0.18414128,0.000013524289,0.813469,0.00022614385,0.000019805067,0.0000017917273,2.1414722e-7,0.0000018317967,0.0021264441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964607,0.00003548284,0.00006678277,0.00012084169,0.00005601722,0.000074782154],"domain_scores_gemma":[0.9997141,0.00004318556,0.000013512733,0.00018904285,0.000012922115,0.000027258502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011767922,0.0000368237,0.0000362579,0.000033062573,0.00010720491,0.00013219118,0.00016315907,0.000013122027,0.00008165587],"category_scores_gemma":[0.000015135622,0.00003238579,0.000009604211,0.000103065024,0.000018611994,0.00052926055,0.000038556303,0.00006704171,0.000026038126],"study_design_candidate":"design_other","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.0000034010038,0.000014073876,0.00013457525,0.0000034445534,0.0000034048278,0.0000011506406,0.00069102395,0.000052345862,0.0036670037,0.18711492,0.0015398388,0.8067748],"study_design_scores_gemma":[0.00038632046,0.00010591478,0.11181444,0.00008291712,0.000008480196,0.00065478985,0.00013500405,0.6589756,0.04271479,0.012163415,0.17244972,0.0005085903],"about_ca_topic_score_codex":0.000024402063,"about_ca_topic_score_gemma":0.0000045756983,"teacher_disagreement_score":0.80626625,"about_ca_system_score_codex":0.000010816183,"about_ca_system_score_gemma":0.0000043528253,"threshold_uncertainty_score":0.13206542},"labels":[],"label_agreement":null},{"id":"W1976967219","doi":"10.1016/j.entcs.2005.01.045","title":"A New Approach to Upward-Closed Set Backward Reachability Analysis","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"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 British Columbia","funders":"","keywords":"Reachability; Parameterized complexity; Petri net; Binary decision diagram; Fixed point; Model checking; Intersection (aeronautics); Computer science; Set (abstract data type); Computation; Algorithm; Theoretical computer science; Stochastic Petri net; Class (philosophy); State (computer science); Mathematics; Programming language","score_opus":0.01737028778483418,"score_gpt":0.30211673041644277,"score_spread":0.2847464426316086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976967219","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.016952023,0.000036415022,0.97820824,0.0016306969,0.00016999616,0.0003875498,9.864623e-7,0.00020458549,0.0024094984],"genre_scores_gemma":[0.49473503,0.000002020309,0.50477046,0.00038228667,0.000082178245,0.000013260227,9.965155e-7,0.0000055217097,0.000008282925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949846,0.00042600813,0.0005715623,0.0016259941,0.0010045934,0.0013872174],"domain_scores_gemma":[0.99675673,0.0004359183,0.00010167067,0.0020751918,0.00015542765,0.00047506392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00658948,0.0002912075,0.00043709972,0.00081444357,0.00022600575,0.00041008333,0.0045552123,0.00010561949,0.00005122542],"category_scores_gemma":[0.00072241534,0.00026430687,0.00016654351,0.008545229,0.00082765555,0.0009861763,0.0011101613,0.00053418666,0.00015381568],"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.0000138346195,0.00008537233,0.00018395855,0.000003301045,0.000014024092,5.328089e-7,0.00085863005,0.009446345,0.00017174338,0.7917981,0.000017376233,0.19740674],"study_design_scores_gemma":[0.00021870398,0.00017707517,0.0032643552,0.000006893232,0.000019796089,0.000011906091,0.000003363783,0.8913854,0.006050419,0.0980517,0.00047689668,0.0003335424],"about_ca_topic_score_codex":0.000035607263,"about_ca_topic_score_gemma":0.000015901935,"teacher_disagreement_score":0.881939,"about_ca_system_score_codex":0.00079263997,"about_ca_system_score_gemma":0.00059469906,"threshold_uncertainty_score":0.9999809},"labels":[],"label_agreement":null},{"id":"W1977355585","doi":"10.1109/hldvt.2004.1431224","title":"Towards an efficient assertion based verification of SystemC designs","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Assertion; SystemC; Computer science; Programming language; Dependency (UML); Static analysis; Random testing; Code (set theory); Extension (predicate logic); Relation (database); Property (philosophy); Algorithm; Parallel computing; Test case; Theoretical computer science; Computer engineering; Software engineering; Data mining; Machine learning","score_opus":0.06574687560332272,"score_gpt":0.32379203790059297,"score_spread":0.25804516229727026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977355585","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.07183408,0.00001011642,0.92535657,0.000107639695,0.00023424516,0.00021112633,6.499331e-7,0.00017611704,0.00206947],"genre_scores_gemma":[0.5225491,3.2549497e-7,0.47739145,0.00002871027,0.000007769406,0.0000123508735,0.0000021729631,0.00000302681,0.0000050925855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988466,0.00014935381,0.0002904033,0.0002637736,0.00031471648,0.00013515438],"domain_scores_gemma":[0.99885833,0.00001858294,0.00014703839,0.0007369748,0.00017659496,0.00006246673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009632722,0.000084574574,0.00010745073,0.000117176445,0.00005752448,0.00004828679,0.00055016374,0.0000604173,0.000007100582],"category_scores_gemma":[0.00008416345,0.00007576603,0.00003841652,0.00042934413,0.000029100169,0.00037015276,0.000027045166,0.000048772083,0.000023154416],"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.000011682387,0.00024177218,0.000039406434,0.00005010575,0.0000036116785,4.6127647e-7,0.00038291578,0.06946691,0.0731927,0.8450656,0.0000038671797,0.011540975],"study_design_scores_gemma":[0.00023532033,0.00016430632,0.005616929,0.000023748897,0.000003655927,0.0000022899499,0.000040507875,0.5551949,0.4377109,0.0008951729,0.000021475234,0.00009075554],"about_ca_topic_score_codex":0.00006764113,"about_ca_topic_score_gemma":0.0000023874054,"teacher_disagreement_score":0.8441704,"about_ca_system_score_codex":0.00012922761,"about_ca_system_score_gemma":0.00015425948,"threshold_uncertainty_score":0.3089649},"labels":[],"label_agreement":null},{"id":"W1977833242","doi":"10.1016/s0304-3975(01)00345-0","title":"On the non-termination of MDG-based abstract state enumeration","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Enumeration; Formalism (music); Class (philosophy); Computer science; Mathematics; Theoretical computer science; Set (abstract data type); Algorithm; Discrete mathematics; Artificial intelligence; Programming language","score_opus":0.015227341185832211,"score_gpt":0.2818545029618386,"score_spread":0.2666271617760064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977833242","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.10742956,0.0000021406163,0.8886534,0.00033446032,0.0003600766,0.00018677248,0.0000011263411,0.000044094006,0.002988406],"genre_scores_gemma":[0.72103363,4.5986596e-7,0.2786382,0.00030382434,0.000010731134,0.000006939427,3.1981995e-7,0.0000033065062,0.0000025699585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981407,0.00020918711,0.00028919603,0.0003863738,0.00069909485,0.0002754606],"domain_scores_gemma":[0.99813795,0.0005681037,0.00015015529,0.00083008537,0.00023270579,0.0000809813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038280098,0.000120970544,0.000114980685,0.00014326221,0.0002753068,0.00020773828,0.0014090863,0.000032427484,0.000036923713],"category_scores_gemma":[0.0004859678,0.000081363796,0.00004448847,0.0008909742,0.0013152342,0.00046590003,0.0000978157,0.00015394068,0.00005262068],"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.0000045539978,0.000051124694,0.000009425245,0.0000048941965,9.172171e-7,8.3185813e-7,0.00016757414,0.0015704934,0.0027588003,0.97514457,0.0000134221455,0.020273421],"study_design_scores_gemma":[0.00009365103,0.00015586909,0.0017016315,0.000019264366,0.0000012041761,0.000002925564,0.0000016052566,0.6271143,0.21315233,0.15764405,0.000025548185,0.00008761175],"about_ca_topic_score_codex":9.5543e-7,"about_ca_topic_score_gemma":1.108932e-7,"teacher_disagreement_score":0.8175005,"about_ca_system_score_codex":0.00005194407,"about_ca_system_score_gemma":0.00014650838,"threshold_uncertainty_score":0.48460352},"labels":[],"label_agreement":null},{"id":"W1979038995","doi":"10.1007/s10270-006-0042-8","title":"UML vs. classical vs. rhapsody statecharts: not all models are created equal","year":2007,"lang":"en","type":"article","venue":"Software & Systems Modeling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Rotation formalisms in three dimensions; Formalism (music); Computer science; Unified Modeling Language; Theoretical computer science; Programming language; Software; Mathematics","score_opus":0.08904423961801068,"score_gpt":0.312742786337601,"score_spread":0.22369854671959033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979038995","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.018084593,0.00027948996,0.97727907,0.00017042088,0.0016142541,0.00062735565,0.0000236902,0.0016661395,0.00025498445],"genre_scores_gemma":[0.6429417,0.000017016248,0.35627025,0.00031183218,0.00020251419,0.00005041026,0.00001772455,0.00004984014,0.00013869142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995173,0.000306826,0.0012508538,0.0010524933,0.0010813778,0.0011354728],"domain_scores_gemma":[0.99694175,0.0002548475,0.00046118698,0.0014208085,0.0005214407,0.00039995706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0038685326,0.00044674307,0.0006191982,0.00033148413,0.000299215,0.00042016956,0.0014853076,0.000371457,0.000003947801],"category_scores_gemma":[0.00040993508,0.00043335243,0.00016692873,0.0005710316,0.000065070206,0.0016687812,0.00039254766,0.00055810384,0.000087913395],"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.00019127829,0.00017746851,0.00034156037,0.00031090362,0.000093884875,0.00009334557,0.0027363661,0.8995273,0.0010367833,0.08100331,0.0007567747,0.013730995],"study_design_scores_gemma":[0.0004118725,0.00013262634,0.000024069628,0.00024844825,0.000019239356,0.000050579933,0.00018530464,0.9945763,0.000560638,0.0025145337,0.0007613517,0.0005150505],"about_ca_topic_score_codex":0.0003350588,"about_ca_topic_score_gemma":0.000016432106,"teacher_disagreement_score":0.6248571,"about_ca_system_score_codex":0.00042495748,"about_ca_system_score_gemma":0.00014787514,"threshold_uncertainty_score":0.9998118},"labels":[],"label_agreement":null},{"id":"W1982295030","doi":"10.1016/s0950-5849(03)00068-5","title":"Implicit integration of scenarios into a reduced timed automaton","year":2003,"lang":"en","type":"article","venue":"Information and Software Technology","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":"Computer Research Institute of Montréal; Université de Montréal; Concordia University; Université du Québec à Montréal","funders":"","keywords":"Automaton; Computer science; Timed automaton; Programming language; Theoretical computer science","score_opus":0.010243695053942146,"score_gpt":0.2667338875668766,"score_spread":0.2564901925129345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982295030","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.114167094,0.00003566828,0.8841599,0.00024076655,0.00012399808,0.0001729951,7.512541e-7,0.00059799646,0.0005007804],"genre_scores_gemma":[0.43539765,0.00001136325,0.5644682,0.00008581125,0.0000014495237,0.000022131848,0.0000035426845,0.0000020675855,0.000007797746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992139,0.000037563474,0.00039231929,0.00010814279,0.00012068571,0.0001274026],"domain_scores_gemma":[0.99913925,0.000031935906,0.00023320044,0.00038851346,0.00017603063,0.000031082895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003588851,0.00009041476,0.00013507076,0.00047861855,0.00008009683,0.00004164304,0.0003040374,0.00018486578,0.000006921844],"category_scores_gemma":[0.00095320557,0.00008382588,0.000021121552,0.00064651924,0.00009161813,0.0012755584,0.00007392652,0.00012637864,0.000025244488],"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.0000027925935,0.000010765142,0.0003237979,0.00002398596,0.0000046574855,1.3866136e-7,0.001194305,0.000011419866,0.002687889,0.5191372,0.00005589926,0.47654715],"study_design_scores_gemma":[0.0017661641,0.0006766297,0.010822911,0.00015109869,0.000020509058,0.0003513198,0.0011728816,0.13658635,0.5920946,0.2220354,0.03352995,0.00079220877],"about_ca_topic_score_codex":0.000011419316,"about_ca_topic_score_gemma":0.0000017122493,"teacher_disagreement_score":0.58940667,"about_ca_system_score_codex":0.00004036034,"about_ca_system_score_gemma":0.00006262353,"threshold_uncertainty_score":0.341832},"labels":[],"label_agreement":null},{"id":"W1982547276","doi":"10.1109/aspdac.2014.6742977","title":"Automated debugging of missing assumptions","year":2014,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vennsa Technologies (Canada); University of Toronto","funders":"","keywords":"Assertion; Debugging; Computer science; Function (biology); Set (abstract data type); Automation; Missing data; Programming language; Algorithm; Machine learning; Engineering","score_opus":0.030610406436840192,"score_gpt":0.31833175558647125,"score_spread":0.28772134914963104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982547276","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.0033905644,0.0000062792205,0.9779707,0.00020595295,0.00013280494,0.000029076185,8.0848466e-8,0.0007792173,0.017485304],"genre_scores_gemma":[0.3443529,2.6770047e-7,0.65554094,0.00005186294,0.0000070026613,0.0000011153785,2.1234948e-7,0.0000016143099,0.00004410383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995007,0.000076381664,0.00013526813,0.0001028754,0.00009795122,0.0000868205],"domain_scores_gemma":[0.9994818,0.00006487422,0.00006040285,0.00032104444,0.000044311255,0.000027570344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004766359,0.000037030113,0.00006225092,0.00006017518,0.000049573024,0.00003189675,0.0003119644,0.000022647406,0.000012335548],"category_scores_gemma":[0.00015331947,0.000032998516,0.000019253208,0.00019100528,0.000019755596,0.0002762572,0.000055529155,0.00003077881,0.000027626354],"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":[5.2623034e-7,0.000022400347,0.00030045252,0.000015401201,0.000004719226,1.688183e-7,0.00020409343,0.00025144996,0.018146247,0.68854004,0.00046721613,0.2920473],"study_design_scores_gemma":[0.00004132712,0.000011327544,0.008488334,0.000009000484,0.000001420647,0.000003840461,0.0000022685056,0.9598345,0.026814273,0.003808088,0.00094369886,0.000041877298],"about_ca_topic_score_codex":0.000009575859,"about_ca_topic_score_gemma":5.741559e-7,"teacher_disagreement_score":0.9595831,"about_ca_system_score_codex":0.000010513719,"about_ca_system_score_gemma":0.000014176714,"threshold_uncertainty_score":0.13456404},"labels":[],"label_agreement":null},{"id":"W1982912460","doi":"10.1016/s0304-3975(99)00300-x","title":"Algebraic characterizations of trace and decorated trace equivalences over tree-like structures","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"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 Windsor","funders":"","keywords":"Homomorphism; TRACE (psycholinguistics); Bisimulation; Mathematics; Algebraic number; Equivalence (formal languages); Bounded function; Tree (set theory); Transition system; Pure mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Algorithm","score_opus":0.018357430765140563,"score_gpt":0.29063311651850593,"score_spread":0.27227568575336536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982912460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36604816,0.00005260208,0.6328161,0.00019874792,0.00033583297,0.00011306235,0.000001790823,0.00008478615,0.00034891782],"genre_scores_gemma":[0.6456568,0.000025294814,0.354155,0.000110029505,0.000036295267,0.0000035475446,5.833331e-7,0.0000048293596,0.000007580429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775535,0.00018174088,0.00038752603,0.000641874,0.0006104896,0.00042299568],"domain_scores_gemma":[0.9984862,0.0002257895,0.00017187027,0.00070048467,0.00020476562,0.00021088611],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012140888,0.00018642185,0.00023561974,0.00023696174,0.0002941522,0.0002946302,0.0017936849,0.00007007859,0.000052986696],"category_scores_gemma":[0.00015167122,0.00015423239,0.000042435768,0.0017743473,0.0028808396,0.0013776845,0.00048247894,0.00015703417,0.0000064440155],"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.0000103610855,0.00003773414,0.00034960048,0.000009493085,0.000003334292,0.000003044732,0.00083308754,0.000059178594,0.008067123,0.9063686,0.0000052420023,0.08425317],"study_design_scores_gemma":[0.0002395883,0.00026068944,0.10621125,0.000031289124,0.000008596962,0.00009211514,0.0000126469495,0.75417316,0.013393214,0.12516877,0.0001403908,0.00026831267],"about_ca_topic_score_codex":0.0000045204347,"about_ca_topic_score_gemma":0.000001053575,"teacher_disagreement_score":0.7811999,"about_ca_system_score_codex":0.000027763437,"about_ca_system_score_gemma":0.00008750698,"threshold_uncertainty_score":0.99983275},"labels":[],"label_agreement":null},{"id":"W1984067593","doi":"10.1145/2768577.2768578","title":"The SDEval benchmarking toolkit","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"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 Waterloo","funders":"","keywords":"Executable; Benchmarking; Computer science; Focus (optics); Field (mathematics); Task (project management); Symbolic computation; Programming language; Software engineering; Software; Code (set theory); Systems engineering; Engineering; Set (abstract data type); Mathematics","score_opus":0.11450411911506599,"score_gpt":0.355765799854737,"score_spread":0.24126168073967103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984067593","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.0049637174,0.0009426719,0.98090315,0.008093212,0.0012439408,0.0003001147,8.476297e-7,0.0002477279,0.0033046142],"genre_scores_gemma":[0.12982051,0.00017947421,0.8692609,0.0004961517,0.00011803993,0.000073127405,0.000007080515,0.00001104888,0.000033668635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767214,0.0007941445,0.0005031042,0.00032926953,0.00035508577,0.0003462715],"domain_scores_gemma":[0.9900909,0.001196783,0.0001692665,0.008224669,0.00021134618,0.0001070497],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0029117088,0.00015948342,0.00015760557,0.00014348829,0.0004664883,0.00046025033,0.012194381,0.00007845067,0.000001924911],"category_scores_gemma":[0.0005332512,0.00013407817,0.000058632846,0.0009381298,0.00023372407,0.000819654,0.0061175893,0.00043957977,0.00010123961],"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.0000037899738,0.0000732648,0.0012052738,0.0000026603955,0.000012549026,0.0000014065484,0.0016587644,0.0002968569,0.00000809855,0.5270539,0.0026510758,0.46703237],"study_design_scores_gemma":[0.00038086026,0.00008501956,0.010496759,0.000034848486,0.000004482355,0.00003460432,0.00005664806,0.797322,0.000075921096,0.102700986,0.08853679,0.00027108644],"about_ca_topic_score_codex":0.00004809508,"about_ca_topic_score_gemma":0.000058356163,"teacher_disagreement_score":0.79702514,"about_ca_system_score_codex":0.00018394417,"about_ca_system_score_gemma":0.00016515602,"threshold_uncertainty_score":0.9931501},"labels":[],"label_agreement":null},{"id":"W1984147068","doi":"10.1142/s0129054103002163","title":"SIMULATION OF FEEDBACK-FREE CIRCUITS IN THE ALGEBRA OF TRANSIENTS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"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 Waterloo","funders":"","keywords":"Binary number; SIGNAL (programming language); Automaton; Computer science; Electronic circuit; Algorithm; Theoretical computer science; Algebra over a field; Mathematics; Arithmetic; Engineering; Electrical engineering; Programming language; Pure mathematics","score_opus":0.038866793631586294,"score_gpt":0.3409278260135017,"score_spread":0.3020610323819154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984147068","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.18125628,0.000024082754,0.8169434,0.00024840605,0.0010256083,0.000083732215,0.0000022705437,0.000003052574,0.00041316828],"genre_scores_gemma":[0.7174424,0.000005835723,0.2824828,0.00003902568,0.000025509175,7.6485134e-7,3.315416e-7,0.0000018599331,0.000001461864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712694,0.00018641133,0.0009495975,0.00015461161,0.0014589941,0.00012344947],"domain_scores_gemma":[0.99593556,0.00046921277,0.0010281141,0.00049442466,0.0020364758,0.00003623093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031161392,0.00008206209,0.0001806365,0.00075297663,0.00004951806,0.00008331331,0.0041278326,0.000029409912,0.000007288884],"category_scores_gemma":[0.0009786562,0.00006585504,0.00009783872,0.0012442259,0.00038432592,0.0018348353,0.00010755404,0.0001233753,9.511043e-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.000020438023,0.0006104543,0.00304044,0.000024033603,0.000049283208,0.000004412883,0.006028092,0.31730515,0.007646062,0.5633479,0.000029952937,0.10189378],"study_design_scores_gemma":[0.0019127696,0.00055715686,0.13159321,0.0003027005,0.000019359235,0.00015074023,0.00014688403,0.7522798,0.04460158,0.067661,0.0005567967,0.00021796866],"about_ca_topic_score_codex":0.00000791625,"about_ca_topic_score_gemma":0.0000021024493,"teacher_disagreement_score":0.5361861,"about_ca_system_score_codex":0.00006977743,"about_ca_system_score_gemma":0.00039067422,"threshold_uncertainty_score":0.7670608},"labels":[],"label_agreement":null},{"id":"W1984616519","doi":"10.1145/2680541","title":"Stubborn Sets for Time Petri Nets","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Petri net; Partial order reduction; Computer science; Reduction (mathematics); Process architecture; State (computer science); Set (abstract data type); Extension (predicate logic); Enumeration; Stochastic Petri net; Petri dish; Theoretical computer science; Algorithm; Model checking; Programming language; Mathematics; Discrete mathematics","score_opus":0.07358903639801978,"score_gpt":0.338857276766604,"score_spread":0.2652682403685842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984616519","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.004198696,0.00009703716,0.98956877,0.00028688496,0.0033171962,0.0007952482,0.0000124254775,0.00074262504,0.0009811206],"genre_scores_gemma":[0.41222093,0.0000015569873,0.5869424,0.0001313521,0.00012092176,0.000065843364,0.0000060367497,0.000028943856,0.00048207273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756116,0.0003258421,0.00054563524,0.00060778845,0.0004975677,0.0004619913],"domain_scores_gemma":[0.99704546,0.00053103524,0.00023573443,0.0016071554,0.0003523869,0.00022823535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017737572,0.0002518094,0.0003322692,0.00026589524,0.0003210231,0.00029844212,0.0016335787,0.00014356007,0.000002777388],"category_scores_gemma":[0.00024961232,0.0002529405,0.00013298816,0.00067518227,0.00003974774,0.00044972883,0.000030674626,0.00023610564,0.0002586558],"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.00018167307,0.00080546475,0.00003909976,0.0002808767,0.0003368053,0.000016203647,0.012990256,0.5084537,0.0013336032,0.032830037,0.010521343,0.43221092],"study_design_scores_gemma":[0.00091058994,0.0003876003,0.000035607256,0.000088648856,0.000019254165,0.00007629508,0.00027086458,0.9881291,0.0013423954,0.0010908747,0.0073136855,0.00033509196],"about_ca_topic_score_codex":0.000029715722,"about_ca_topic_score_gemma":8.1111e-7,"teacher_disagreement_score":0.47967538,"about_ca_system_score_codex":0.00021667517,"about_ca_system_score_gemma":0.00014136669,"threshold_uncertainty_score":0.9999923},"labels":[],"label_agreement":null},{"id":"W1985054922","doi":"10.1109/adprl.2014.7010633","title":"Pseudo-MDPs and factored linear action models","year":2014,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"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 Alberta","funders":"","keywords":"Bounding overwatch; Computer science; Kernel (algebra); Computation; Normalization (sociology); Mathematical optimization; Action (physics); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics","score_opus":0.08458425800970096,"score_gpt":0.3203029802822215,"score_spread":0.23571872227252053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985054922","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.038149245,0.0000048047614,0.9543971,0.00014114674,0.0002041393,0.00005266544,1.5190173e-7,0.00016308267,0.006887694],"genre_scores_gemma":[0.39697018,0.0000063479974,0.6026809,0.00009816121,0.000029148901,0.0000028346496,3.4695256e-7,0.0000023848208,0.00020964044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945015,0.00006168058,0.00009484691,0.00018275676,0.00010955845,0.000101033416],"domain_scores_gemma":[0.99953413,0.000035866306,0.000036024496,0.0003108434,0.000034914374,0.000048250677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031110828,0.000056843957,0.00006023169,0.000040734816,0.00005527106,0.000057946465,0.00021796318,0.000042394888,0.0000057480074],"category_scores_gemma":[0.00004475714,0.00004770148,0.000013727348,0.00009732938,0.000019751333,0.0007985174,0.00007461177,0.00005652797,0.000026731575],"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.000002892781,0.000013726125,0.00007058678,0.000008276295,0.0000029256005,9.5564346e-8,0.00028177738,0.0007386718,0.0035979385,0.69818115,0.00014085566,0.2969611],"study_design_scores_gemma":[0.000075452495,0.000031236217,0.0012942991,0.0000017901614,9.970695e-7,0.000003937285,0.000006061395,0.9715733,0.010348336,0.015116283,0.0014829653,0.000065348475],"about_ca_topic_score_codex":0.00001952241,"about_ca_topic_score_gemma":0.0000017833595,"teacher_disagreement_score":0.9708346,"about_ca_system_score_codex":0.00001230333,"about_ca_system_score_gemma":0.0000072035546,"threshold_uncertainty_score":0.19452098},"labels":[],"label_agreement":null},{"id":"W1985478395","doi":"10.1145/1449814.1449900","title":"Validating temporal properties of interacting objects","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Computer science; Object (grammar); Programming language; Sequence (biology); Object-oriented programming; Temporal logic; Artificial intelligence","score_opus":0.11509011197960267,"score_gpt":0.29082358943302217,"score_spread":0.1757334774534195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985478395","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.3956819,0.000018876046,0.59662634,0.000028091077,0.00019171732,0.000054495194,4.40534e-8,0.00009312729,0.007305405],"genre_scores_gemma":[0.53698754,6.076205e-7,0.46284235,0.000018553828,0.0000102019585,0.0000020743862,7.8189835e-8,0.0000017097826,0.00013688757],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993787,0.000061802944,0.00019887507,0.00012602354,0.0001374547,0.00009714174],"domain_scores_gemma":[0.999502,0.000031227424,0.00011358415,0.00026318885,0.000070061185,0.000019913252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002917805,0.00004987171,0.00007805187,0.000049445945,0.00006917697,0.00001872127,0.00035258036,0.00001832312,0.000005921232],"category_scores_gemma":[0.00027181173,0.000038811842,0.000023835106,0.00017600787,0.00003381399,0.0006827998,0.00013117302,0.000059212787,0.000012057876],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000020734611,0.00017421461,0.015439841,0.00017489093,0.00002962456,0.000012600955,0.039406914,0.00031949434,0.80627614,0.063678294,0.00036258897,0.07410464],"study_design_scores_gemma":[0.000053327112,0.000032801105,0.00054467935,0.000034950386,5.895947e-7,0.000036072677,0.0003147836,0.061587296,0.93716365,0.000100135294,0.00006677363,0.00006494601],"about_ca_topic_score_codex":0.00007917493,"about_ca_topic_score_gemma":0.0000016051998,"teacher_disagreement_score":0.14130566,"about_ca_system_score_codex":0.000015153892,"about_ca_system_score_gemma":0.00004113997,"threshold_uncertainty_score":0.1582701},"labels":[],"label_agreement":null},{"id":"W1986858569","doi":"10.4204/eptcs.61.2","title":"Specification and Verification of Context-dependent Services","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Correctness; Formal verification; Formal methods; Formal specification; Model checking; Service (business); Automaton","score_opus":0.01316253735538987,"score_gpt":0.24244807781577488,"score_spread":0.22928554046038502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986858569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22517794,0.0002277145,0.77013254,0.000088265035,0.0001555652,0.00026781464,3.019103e-7,0.00008963179,0.0038601956],"genre_scores_gemma":[0.78551465,0.000046701974,0.2143438,0.00005412105,0.000019288998,0.0000148581485,1.7398473e-7,0.000004869164,0.0000015542595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979466,0.00003152134,0.000389509,0.0006710012,0.00048197072,0.00047938808],"domain_scores_gemma":[0.9990429,0.000038557027,0.00018197743,0.00038468017,0.00025757725,0.00009425985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026930717,0.00014009821,0.00018530455,0.0002916334,0.00011446764,0.00011691897,0.001778926,0.00006264305,0.000008318293],"category_scores_gemma":[0.00006730847,0.00013003037,0.000027173985,0.0011040834,0.0011139478,0.0013688254,0.00038786404,0.00021883253,0.000006271933],"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.000015099678,0.000055767923,0.00065316755,0.000025259993,0.0000024627807,2.1771045e-7,0.0024433353,0.0000014083338,0.0029563173,0.92961067,5.091574e-7,0.0642358],"study_design_scores_gemma":[0.0003405502,0.0005160239,0.028814428,0.00006497462,0.000006328177,0.000040901145,0.00013939923,0.42057073,0.1572277,0.3919255,0.00007458643,0.00027886574],"about_ca_topic_score_codex":0.000011108527,"about_ca_topic_score_gemma":9.727144e-7,"teacher_disagreement_score":0.5603367,"about_ca_system_score_codex":0.00013365276,"about_ca_system_score_gemma":0.00009459034,"threshold_uncertainty_score":0.53024846},"labels":[],"label_agreement":null},{"id":"W1987237000","doi":"10.1109/qest.2010.28","title":"Model Checking Randomized Algorithms with Java PathFinder","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Probabilistic logic; Computer science; Java; Pathfinder; Code (set theory); State (computer science); State space; Algorithm; Bridge (graph theory); Programming language; Statistical model; Artificial intelligence; Mathematics; Statistics","score_opus":0.027553180155930633,"score_gpt":0.2812277448683242,"score_spread":0.2536745647123936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987237000","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.007054142,0.0000043920654,0.97087514,0.00020408675,0.0002847544,0.00023096059,2.0793249e-7,0.00022242063,0.021123866],"genre_scores_gemma":[0.16847044,0.0000018132799,0.8306431,0.00021959413,0.000032711985,0.000036193796,4.6393154e-7,0.0000071207223,0.0005885485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990192,0.00006829199,0.00018959586,0.00027589803,0.00025237605,0.0001946397],"domain_scores_gemma":[0.9990501,0.00008583063,0.00008439602,0.0006160683,0.0000982473,0.000065392436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013516498,0.00010773183,0.00019824122,0.00006151662,0.00007979218,0.00012016722,0.0006045884,0.00006664206,0.000022908862],"category_scores_gemma":[0.00012193508,0.000070415,0.000050004935,0.00019024599,0.00008940699,0.00058537815,0.00010069584,0.00021915621,0.00003108457],"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.00045582134,0.000041180967,0.00003188071,0.000005455396,0.000017352819,0.0000016032974,0.00079228415,0.0012411277,0.0046494324,0.9358233,0.0000745665,0.056866],"study_design_scores_gemma":[0.012623263,0.000011163326,0.000054603624,0.0000031769762,0.0000044517315,0.000010978467,0.0000066899124,0.97122043,0.007473464,0.008358546,0.00010755812,0.00012568984],"about_ca_topic_score_codex":0.000017512853,"about_ca_topic_score_gemma":0.0000061298815,"teacher_disagreement_score":0.9699793,"about_ca_system_score_codex":0.00000974693,"about_ca_system_score_gemma":0.000059982085,"threshold_uncertainty_score":0.28714404},"labels":[],"label_agreement":null},{"id":"W1987382208","doi":"10.1109/icicisys.2009.5358318","title":"On the computational complexity of the reachability problem in UML activity diagrams","year":2009,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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":"","keywords":"Reachability; Reachability problem; Activity diagram; Computer science; Unified Modeling Language; Class diagram; Model checking; Theoretical computer science; Computational complexity theory; Class (philosophy); Programming language; Algorithm; Artificial intelligence","score_opus":0.07156622867090677,"score_gpt":0.31062517885832214,"score_spread":0.23905895018741535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987382208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29915145,0.0000014823061,0.68577576,0.0069304854,0.00006449874,0.0003479997,0.0000011442021,0.000035901085,0.0076912944],"genre_scores_gemma":[0.7842492,1.973039e-7,0.21538945,0.000330806,0.0000046762148,0.0000065986515,2.6092079e-7,0.0000010575585,0.00001779088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987564,0.0004529041,0.00018193643,0.00019559354,0.0002945035,0.00011866518],"domain_scores_gemma":[0.99892545,0.00026949495,0.000110644265,0.0006206086,0.00005568896,0.000018109875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013331709,0.00007150357,0.000094761126,0.000024997467,0.00008385442,0.000027282524,0.0007984035,0.00003123242,0.000008679097],"category_scores_gemma":[0.00021008053,0.000037316582,0.0000481545,0.00042940766,0.0001849141,0.00018376912,0.000099571895,0.00017366852,0.000004351031],"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.0000064789238,0.00016928023,0.00083761866,0.0000029762004,0.0000011139623,4.5750465e-8,0.00023844265,0.001481422,0.00017145598,0.9151369,0.000046165787,0.081908144],"study_design_scores_gemma":[0.00005404042,0.000041913663,0.40432987,0.000005824196,3.5987838e-7,5.865236e-7,0.0000027146518,0.2521513,0.0020045335,0.34136903,0.000008503152,0.00003133826],"about_ca_topic_score_codex":0.00009063944,"about_ca_topic_score_gemma":0.000033274377,"teacher_disagreement_score":0.57376784,"about_ca_system_score_codex":0.00005960475,"about_ca_system_score_gemma":0.000039920167,"threshold_uncertainty_score":0.15217261},"labels":[],"label_agreement":null},{"id":"W1988506401","doi":"10.1145/2089116.2089119","title":"Weak Alphabet Merging of Partial Behavior Models","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Software Engineering and Methodology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":32,"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":"","keywords":"Computer science; Viewpoints; Alphabet; Property (philosophy); Process (computing); Algebraic properties; Theoretical computer science; Component (thermodynamics); Extension (predicate logic); Programming language; Mathematics","score_opus":0.13249928710046624,"score_gpt":0.34050713105717073,"score_spread":0.2080078439567045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988506401","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.024760446,0.00026800984,0.9735612,0.000030854197,0.0010375748,0.00009743513,0.000004413595,0.00022944277,0.000010604074],"genre_scores_gemma":[0.22798811,0.000042563348,0.7718361,0.000018353614,0.000030162448,0.000054175543,6.986601e-7,0.000011355746,0.000018494686],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989317,0.0002129405,0.00023868283,0.0002070722,0.00011617733,0.00029343794],"domain_scores_gemma":[0.99843836,0.00080910773,0.000060121583,0.0005456544,0.000037881906,0.00010890504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011487175,0.00013285011,0.00022437768,0.00018434251,0.00006783736,0.000010400945,0.0003417429,0.000116862015,0.000007747939],"category_scores_gemma":[0.00041157007,0.00013553233,0.00006210263,0.00022438605,0.000038987033,0.00047979385,0.000019404248,0.00020641158,0.0000025352397],"study_design_candidate":"design_other","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.00003586503,0.0002847261,0.0007311983,0.0001257985,0.00010865476,0.0000018294604,0.0035857144,0.11871398,0.013703732,0.084369555,0.000012712176,0.7783262],"study_design_scores_gemma":[0.0017420084,0.00082326005,0.01957758,0.00015259326,0.00042471648,0.00046317608,0.0002984176,0.40950242,0.5531728,0.004545156,0.0076907193,0.0016071213],"about_ca_topic_score_codex":0.000013572487,"about_ca_topic_score_gemma":2.201751e-7,"teacher_disagreement_score":0.7767191,"about_ca_system_score_codex":0.00002035786,"about_ca_system_score_gemma":0.00001442432,"threshold_uncertainty_score":0.55268484},"labels":[],"label_agreement":null},{"id":"W1988662949","doi":"10.1145/567112.567117","title":"On XML integrity constraints in the presence of DTDs","year":2002,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":175,"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":"","keywords":"Unary operation; Undecidable problem; Computer science; Data integrity; Consistency (knowledge bases); Theoretical computer science; XML validation; XML; Negation; Programming language; Decidability; Discrete mathematics; Mathematics; Database","score_opus":0.08962250952427965,"score_gpt":0.3285199342965478,"score_spread":0.23889742477226816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988662949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8698221,0.0001964267,0.099692285,0.020655055,0.0017662226,0.00022365247,0.0000015758512,0.000009255079,0.0076334197],"genre_scores_gemma":[0.87507194,0.000015660466,0.12457934,0.00027561185,0.00002990922,5.255905e-7,5.192045e-9,0.0000012294554,0.0000257694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886185,0.00037518571,0.00027267897,0.000056672765,0.0003511818,0.000082423096],"domain_scores_gemma":[0.9980668,0.00046929583,0.0003394675,0.0010283778,0.00007883684,0.000017263263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019445975,0.00004475884,0.00009103249,0.00005368803,0.000032080243,0.000028185423,0.0045968844,0.00002985252,0.00001759851],"category_scores_gemma":[0.0051014125,0.0000215072,0.00006532824,0.00027370013,0.00012098449,0.0002321239,0.0002467249,0.00042260016,0.0000051860384],"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.00008281986,0.0009917468,0.008569544,0.000055387536,0.000057627403,0.000043218097,0.022411803,0.0015622124,0.0090452535,0.56779873,0.033035062,0.35634658],"study_design_scores_gemma":[0.0016784172,0.0013517529,0.26938578,0.00089420966,0.000031841224,0.0013591988,0.00097266585,0.106743366,0.05432896,0.5590951,0.003805481,0.00035325295],"about_ca_topic_score_codex":0.000003563799,"about_ca_topic_score_gemma":9.309171e-7,"teacher_disagreement_score":0.3559933,"about_ca_system_score_codex":0.00002596719,"about_ca_system_score_gemma":0.000021300626,"threshold_uncertainty_score":0.8542232},"labels":[],"label_agreement":null},{"id":"W1988680012","doi":"10.1016/j.scico.2005.10.008","title":"Modeling component connectors in Reo by constraint automata","year":2006,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":307,"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; Automaton; Component (thermodynamics); Equivalence (formal languages); Constraint (computer-aided design); Cable gland; Theoretical computer science; Model checking; Programming language; Discrete mathematics; Mathematics","score_opus":0.018849874148131957,"score_gpt":0.27851848124175,"score_spread":0.25966860709361805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988680012","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.28585747,0.000044027856,0.7131042,0.000099584,0.00036206993,0.00021853429,6.765274e-7,0.00014631997,0.00016710257],"genre_scores_gemma":[0.5132179,9.278012e-7,0.4867338,0.00001440269,0.00001839849,0.000007925004,0.0000013812665,0.0000035362896,0.0000016971161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974989,0.00008863413,0.00059154106,0.00059496413,0.00068224623,0.0005436781],"domain_scores_gemma":[0.99887794,0.000055385262,0.00017418909,0.0006332677,0.00017050792,0.00008872696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002381606,0.00016102195,0.00023512404,0.0003708929,0.00015251045,0.00028326293,0.0017995603,0.00005001948,0.0000012225835],"category_scores_gemma":[0.000042378793,0.00015900072,0.000051537594,0.001523609,0.00057170604,0.0011384713,0.0004438938,0.00015190733,0.000004145785],"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.0000059014233,0.00038640082,0.0011280768,0.000055276767,0.000004578431,0.0000066068396,0.00073944445,0.07051924,0.017998891,0.3753293,0.00005443497,0.5337719],"study_design_scores_gemma":[0.0002549192,0.00007806559,0.0007444192,0.000062165134,0.0000010232794,0.000011810948,0.00002585842,0.98690146,0.009056765,0.0024687068,0.00021227228,0.00018250622],"about_ca_topic_score_codex":0.0003035242,"about_ca_topic_score_gemma":0.000006924419,"teacher_disagreement_score":0.91638225,"about_ca_system_score_codex":0.00012580551,"about_ca_system_score_gemma":0.00016411053,"threshold_uncertainty_score":0.6483861},"labels":[],"label_agreement":null},{"id":"W1989224068","doi":"10.1007/s10472-006-9041-2","title":"An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs","year":2006,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"Semidefinite programming; Satisfiability; Semidefinite embedding; Mathematical proof; Mathematics; Dimension (graph theory); Discrete mathematics; Grid; Characterization (materials science); Theoretical computer science; Combinatorics; Computer science; Quadratically constrained quadratic program; Mathematical optimization; Quadratic programming","score_opus":0.12182966411229584,"score_gpt":0.3611550192838475,"score_spread":0.23932535517155168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989224068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46138352,0.000014681756,0.5381329,0.000082098006,0.00007594948,0.00016305181,0.00002723337,0.000016419403,0.0001041757],"genre_scores_gemma":[0.76933676,0.000047492475,0.2304973,0.000043253516,0.000036639907,0.000020886077,0.000009266207,0.000005580978,0.0000028434565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987292,0.000044900935,0.00065216713,0.00023129403,0.00019659536,0.00014580655],"domain_scores_gemma":[0.9986909,0.00022672165,0.0004119704,0.00038215326,0.00025224467,0.00003603244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096472807,0.00011074125,0.00021920532,0.00009062343,0.000069368056,0.00005134355,0.0003203771,0.000052646858,0.000003974916],"category_scores_gemma":[0.00016987811,0.00010193931,0.000056177316,0.0002133001,0.00009593677,0.00036587345,0.000031038646,0.000044648023,0.0000012199235],"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.000013099486,0.0002657834,0.000052573043,0.00012053816,0.0000034679774,8.0878976e-8,0.00059404277,0.00011246993,0.06463222,0.8871742,0.0000045350052,0.047027007],"study_design_scores_gemma":[0.000010302065,0.00025068063,0.000692653,0.000054779634,0.0000025309432,4.792964e-7,0.00009050324,0.089619845,0.5592427,0.349913,0.00003861569,0.00008385746],"about_ca_topic_score_codex":0.00002712028,"about_ca_topic_score_gemma":0.00000996957,"teacher_disagreement_score":0.5372612,"about_ca_system_score_codex":0.0000038681437,"about_ca_system_score_gemma":0.000017168406,"threshold_uncertainty_score":0.41569644},"labels":[],"label_agreement":null},{"id":"W1989969310","doi":"10.5555/777092.777239","title":"A model checker for verifying ConGolog programs","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Programming language; Correctness; Model checking; Concurrency; Novelty; Normalization property; Theoretical computer science","score_opus":0.21127067464515997,"score_gpt":0.32273658190682547,"score_spread":0.1114659072616655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989969310","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.0024562557,0.00002833955,0.9847282,0.00015362755,0.00014116144,0.0002923782,2.9806966e-7,0.00026487856,0.011934859],"genre_scores_gemma":[0.090768866,0.0000034535879,0.90712225,0.00027194936,0.000019507737,0.00012930234,6.735485e-7,0.0000050927624,0.0016789027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993529,0.00001639663,0.00012587466,0.00021434975,0.00009531236,0.00019520291],"domain_scores_gemma":[0.99948734,0.000011217703,0.000039524806,0.00036295954,0.00005695257,0.000042011532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024978138,0.000066306944,0.00007297162,0.000030780302,0.000068636335,0.00008020306,0.0004480869,0.000048599555,0.000012675244],"category_scores_gemma":[0.000053176016,0.000057427464,0.000040917486,0.00013945966,0.000027349066,0.0003976146,0.00006858752,0.000048558853,0.00004840704],"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.0000017475625,0.000049447175,0.000052260824,0.000012216396,0.0000044226663,2.3530232e-7,0.0004452996,0.00022467776,0.00030531205,0.84855515,0.00091481,0.14943443],"study_design_scores_gemma":[0.0001471883,0.000048962436,0.0000335312,0.0000027908204,0.0000015259479,0.000003440581,0.00000698132,0.9907714,0.0018588622,0.002972951,0.0040681018,0.00008422723],"about_ca_topic_score_codex":0.0000020464088,"about_ca_topic_score_gemma":7.4721316e-7,"teacher_disagreement_score":0.99054676,"about_ca_system_score_codex":0.000020202022,"about_ca_system_score_gemma":0.000007010551,"threshold_uncertainty_score":0.2341824},"labels":[],"label_agreement":null},{"id":"W1989992186","doi":"10.1504/ijccbs.2012.045074","title":"MDG-SAT: an automated methodology for efficient safety checking","year":2012,"lang":"en","type":"article","venue":"International Journal of Critical Computer-Based Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University","funders":"","keywords":"Correctness; Computer science; Model checking; Formal verification; Boolean satisfiability problem; Satisfiability modulo theories; Programming language; Theoretical computer science; Satisfiability; Automated theorem proving; Invariant (physics); Symbolic execution; Set (abstract data type); ENCODE; Mathematics; Software","score_opus":0.12425199190060088,"score_gpt":0.4393031532817571,"score_spread":0.31505116138115624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989992186","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.011761534,0.00020048565,0.97058773,0.0008837533,0.016083898,0.00020932729,0.000016409162,0.00019026689,0.0000665926],"genre_scores_gemma":[0.50860137,4.907442e-7,0.49003264,0.00020822402,0.0011329069,0.00000756525,0.000004654987,0.000010458701,0.0000017109173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960449,0.0011806325,0.0011807419,0.00025818037,0.0008847396,0.00045085687],"domain_scores_gemma":[0.99471194,0.0022452907,0.0005085064,0.00036447844,0.0018368955,0.00033288304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061896816,0.00020070122,0.00042333486,0.0004118643,0.00011752769,0.00030181202,0.0017742408,0.00014166751,0.000005844994],"category_scores_gemma":[0.0012686169,0.000178127,0.00022321062,0.00019754785,0.000118685486,0.00091047544,0.00013047236,0.00026328527,0.000011130217],"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.00037063664,0.0014032633,0.0005004803,0.0002231494,0.00018736294,0.000050584717,0.0010634889,0.0875141,0.0057165744,0.87960124,0.00038943486,0.022979693],"study_design_scores_gemma":[0.0008065966,0.00045574256,0.0013045198,0.00015093513,0.000021062157,0.00051371974,0.000038502458,0.98976624,0.0036022407,0.0004827629,0.0026579308,0.00019977591],"about_ca_topic_score_codex":0.000006921537,"about_ca_topic_score_gemma":2.0308515e-7,"teacher_disagreement_score":0.9022521,"about_ca_system_score_codex":0.00028354372,"about_ca_system_score_gemma":0.0001628132,"threshold_uncertainty_score":0.7263808},"labels":[],"label_agreement":null},{"id":"W1990325313","doi":"10.1007/s10009-007-0040-3","title":"Improving state class constructions for CTL* model checking of time Petri nets","year":2007,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","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":"Polytechnique Montréal","funders":"","keywords":"Petri net; Computer science; Theory of computation; Class (philosophy); State (computer science); Model checking; Process architecture; Stochastic Petri net; Programming language; Theoretical computer science; CTL*; Artificial intelligence","score_opus":0.028888280928302274,"score_gpt":0.3112200504831442,"score_spread":0.28233176955484196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990325313","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.051599126,0.000029907049,0.9458395,0.000792994,0.0009783,0.00035645874,0.00009238467,0.00024400867,0.0000673202],"genre_scores_gemma":[0.20873041,0.000016587517,0.79084784,0.00018970427,0.000065346074,0.000037260103,0.000007502175,0.000020784686,0.000084576786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982638,0.000017994642,0.0006928269,0.00029860905,0.00038050348,0.0003462775],"domain_scores_gemma":[0.9980443,0.00040544427,0.00021396732,0.0002769549,0.000993175,0.000066174434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010729921,0.00016983149,0.00023394614,0.0008307966,0.00016555215,0.00012630304,0.0013327289,0.00020997826,0.000006045195],"category_scores_gemma":[0.00086120766,0.00016658823,0.0002078322,0.00028492173,0.0001564863,0.0008584891,0.000051521783,0.00038162782,0.0000043635255],"study_design_candidate":"design_other","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.00028986158,0.00012112788,0.00017274472,0.00001990455,0.00016156136,0.000007796149,0.00016117618,0.0052949893,0.025211371,0.2315442,0.00008911529,0.73692614],"study_design_scores_gemma":[0.0039146477,0.0010941941,0.00030507366,0.0001940666,0.000055011016,0.00084645767,0.00007578694,0.43217552,0.41668436,0.13628334,0.007769258,0.00060230924],"about_ca_topic_score_codex":0.0000011748862,"about_ca_topic_score_gemma":0.0000019020645,"teacher_disagreement_score":0.73632383,"about_ca_system_score_codex":0.00019589678,"about_ca_system_score_gemma":0.00014777732,"threshold_uncertainty_score":0.6793271},"labels":[],"label_agreement":null},{"id":"W1990781920","doi":"10.1007/s00165-013-0286-3","title":"Refinement patterns for ASTDs","year":2013,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Computer science; Refinement calculus; Divergence (linguistics); Simple (philosophy); Theoretical computer science; Algorithm","score_opus":0.021674587347506696,"score_gpt":0.2812715598116536,"score_spread":0.25959697246414687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990781920","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.13012876,0.000013648842,0.8635404,0.00014446999,0.00039854617,0.00035599418,0.0000015270776,0.00011027303,0.0053063617],"genre_scores_gemma":[0.54551744,5.7055337e-7,0.45431614,0.00006435625,0.0000652367,0.000012118314,0.0000018921058,0.000004993678,0.000017248274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875104,0.000031226773,0.00039866735,0.00022164639,0.00022784474,0.00036956408],"domain_scores_gemma":[0.99895746,0.00009814779,0.000254986,0.0004225094,0.0002052861,0.00006160552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005498059,0.00011746614,0.00016987229,0.0000963797,0.00012353044,0.000082098384,0.0007536439,0.000041512543,0.000019493951],"category_scores_gemma":[0.00008113686,0.00010828707,0.00008005896,0.00017721622,0.000021016765,0.00085227424,0.0003329759,0.00008133139,0.00002788787],"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.0000037179698,0.000057343837,0.00042893915,0.00011274434,0.000016467333,3.7694514e-7,0.0006099318,0.00055838586,0.0013712146,0.71103734,0.0002400951,0.28556344],"study_design_scores_gemma":[0.00054945616,0.00052867405,0.038895793,0.00008715042,0.0000058438645,0.000011016556,0.000092832146,0.89347106,0.048859116,0.016134908,0.0010984498,0.0002656692],"about_ca_topic_score_codex":0.000041606534,"about_ca_topic_score_gemma":0.0000014672343,"teacher_disagreement_score":0.8929127,"about_ca_system_score_codex":0.000034797722,"about_ca_system_score_gemma":0.000030197478,"threshold_uncertainty_score":0.44158188},"labels":[],"label_agreement":null},{"id":"W1991145672","doi":"10.1023/b:aurc.0000030903.92620.b1","title":"HDL Constructs in Linear Word-Level Decision Diagram Based Specification","year":2004,"lang":"en","type":"article","venue":"Automation and Remote Control","topic":"Formal Methods in Verification","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 Calgary","funders":"","keywords":"Netlist; Verilog; Computer science; Hardware description language; Application-specific integrated circuit; Field-programmable gate array; Binary decision diagram; Word (group theory); Diagram; Influence diagram; Computer architecture; Programming language; Computer hardware; Decision tree; Database; Artificial intelligence; Mathematics","score_opus":0.026293184281512325,"score_gpt":0.28744172189110817,"score_spread":0.26114853760959583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991145672","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.048022117,0.0000784599,0.94967204,0.0010407402,0.0004085157,0.00034950126,0.0000022458291,0.00017561387,0.00025077153],"genre_scores_gemma":[0.51202327,0.000017769193,0.48766991,0.00024884564,0.000022025757,0.0000028319482,0.0000030748488,0.0000041000994,0.000008139293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988001,0.00011311926,0.00036997907,0.0003060596,0.00023761812,0.00017311513],"domain_scores_gemma":[0.99911416,0.00015190606,0.00015834112,0.00040218837,0.00009986323,0.00007356565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066935486,0.00011876169,0.00015833034,0.00022577337,0.00008958047,0.00009692177,0.0002633504,0.00010466264,0.0000056294343],"category_scores_gemma":[0.00039010428,0.00010817857,0.00003267463,0.00043740438,0.000058551388,0.00047613357,0.000026938096,0.00011979426,0.000041609354],"study_design_candidate":"design_other","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.000017941977,0.000030149475,0.00012005986,0.000008706544,0.0000027083272,0.000002487634,0.00014546586,0.0017725916,0.0011610381,0.027679874,0.000009627259,0.96904933],"study_design_scores_gemma":[0.0023913295,0.000034298755,0.11264354,0.000066116525,0.0000032701412,0.0000103565835,0.000009872966,0.87329185,0.0018182785,0.009209806,0.0003924108,0.00012887019],"about_ca_topic_score_codex":0.00004078389,"about_ca_topic_score_gemma":0.000019068992,"teacher_disagreement_score":0.96892047,"about_ca_system_score_codex":0.00009267199,"about_ca_system_score_gemma":0.00009178533,"threshold_uncertainty_score":0.4411394},"labels":[],"label_agreement":null},{"id":"W1991609533","doi":"10.1016/j.entcs.2005.03.007","title":"A New Method for Transforming Timed Automata","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Automaton; Computer science; Timed automaton; Transformation (genetics); Theoretical computer science; Conformance testing; Finite-state machine; State (computer science); Model checking; Algorithm; Programming language; Operating system","score_opus":0.011921949294967406,"score_gpt":0.3276170705568103,"score_spread":0.31569512126184285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991609533","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.0007388291,0.00008228481,0.99476516,0.0028512718,0.00030647035,0.0005040595,6.5810406e-7,0.0002569914,0.00049424515],"genre_scores_gemma":[0.27995688,0.000005620476,0.71942234,0.00041113968,0.00015498007,0.000029030705,5.3418967e-7,0.000009821234,0.000009649951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966742,0.00016046668,0.0004479502,0.00090160774,0.0005650517,0.0012507703],"domain_scores_gemma":[0.9978523,0.00084544875,0.00008324862,0.0008992243,0.00009898997,0.00022078078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005281452,0.0002216283,0.0002617245,0.00032711867,0.00025068273,0.00028204665,0.003205893,0.00008849148,0.000022488859],"category_scores_gemma":[0.00043428713,0.0002013129,0.00009357091,0.0016125187,0.00047251183,0.0013663855,0.00033152974,0.00033942424,0.000028233013],"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.0000088622555,0.000021653866,0.000001775504,0.000003352318,0.000001577078,3.2596787e-7,0.00025991665,0.0005379805,0.00085327466,0.5503234,0.000006648476,0.4479812],"study_design_scores_gemma":[0.00041191932,0.00022958416,0.000038887087,0.000015892349,0.0000029555083,0.000028792583,9.247066e-7,0.7120531,0.05608381,0.22992158,0.0010205341,0.0001919983],"about_ca_topic_score_codex":0.0000073543615,"about_ca_topic_score_gemma":0.000007220454,"teacher_disagreement_score":0.7115151,"about_ca_system_score_codex":0.00040673168,"about_ca_system_score_gemma":0.0007032815,"threshold_uncertainty_score":0.8209302},"labels":[],"label_agreement":null},{"id":"W1992768155","doi":"10.1145/1363686.1363774","title":"Reachability analysis using multiway decision graphs in the HOL theorem prover","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Reachability; Automated theorem proving; Correctness; Computer science; Gas meter prover; Binary decision diagram; Formal verification; Theoretical computer science; Rule of inference; Embedding; Mathematical proof; Programming language; Discrete mathematics; Algorithm; Mathematics; Artificial intelligence","score_opus":0.062254085894555944,"score_gpt":0.3331091357192604,"score_spread":0.27085504982470443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992768155","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.43234995,0.000008251768,0.5663506,0.000031345837,0.00004884206,0.00013881456,2.3417678e-7,0.0000310726,0.0010409278],"genre_scores_gemma":[0.5274329,0.0000029343228,0.47245476,0.00008558966,0.000004767604,0.000005957259,2.9867428e-7,0.0000015546092,0.000011206046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845225,0.00040727682,0.00027131542,0.00033856902,0.00035964738,0.00017095654],"domain_scores_gemma":[0.9983752,0.00033856585,0.000076935336,0.001116693,0.00006456201,0.00002807636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023713072,0.00009074938,0.00013661962,0.00024304318,0.00014281475,0.000050900573,0.0009453524,0.00005133065,0.000011618433],"category_scores_gemma":[0.00035316063,0.000054127726,0.00011470859,0.002404614,0.00010041177,0.0005225957,0.000118512755,0.00012666419,0.000007670885],"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.00004948226,0.00054891675,0.13879806,0.000010703864,0.00008438845,0.000020771764,0.01702906,0.0065365806,0.0025053106,0.54531604,0.000088766,0.2890119],"study_design_scores_gemma":[0.00012710095,0.000022045493,0.19638458,0.000002964271,0.000014698582,0.000012659459,0.000084285326,0.78573745,0.0013687788,0.016051413,0.00009166563,0.00010237873],"about_ca_topic_score_codex":0.00022112366,"about_ca_topic_score_gemma":0.00004470222,"teacher_disagreement_score":0.77920085,"about_ca_system_score_codex":0.00004802878,"about_ca_system_score_gemma":0.000026771962,"threshold_uncertainty_score":0.22072646},"labels":[],"label_agreement":null},{"id":"W1992813097","doi":"10.1109/test.2014.7035339","title":"Clustering-based failure triage for RTL regression debugging","year":2014,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":17,"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":"","keywords":"Computer science; Debugging; Triage; Cluster analysis; Robustness (evolution); Data mining; Machine learning; Reliability engineering; Programming language; Engineering","score_opus":0.0299304796440166,"score_gpt":0.3068266888396271,"score_spread":0.27689620919561053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992813097","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.0005035798,0.0000073055016,0.9955165,0.0011078088,0.0003855168,0.00023012479,4.259343e-7,0.0003579704,0.0018907905],"genre_scores_gemma":[0.19371313,2.3601817e-7,0.80549145,0.0004581874,0.000047981543,0.000040002116,0.000001918983,0.0000071031295,0.00023999158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910134,0.000103875645,0.0001792346,0.00027262268,0.00014546023,0.00019747118],"domain_scores_gemma":[0.99899524,0.00021414748,0.00009238271,0.0005812089,0.000059667043,0.00005733855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009995521,0.00009594755,0.00011212368,0.00007882906,0.00012835018,0.000103851664,0.00058248616,0.00006145338,0.000012559232],"category_scores_gemma":[0.00036744858,0.000073241026,0.000057371508,0.00016057419,0.000016997095,0.0003355865,0.00009018255,0.00006183854,0.000017235527],"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.000065985594,0.00006699413,0.0001802071,0.00014420581,0.000009282134,7.888374e-7,0.00028858983,0.0027987,0.01061113,0.21896894,0.007767375,0.7590978],"study_design_scores_gemma":[0.00046413622,0.00008046146,0.00018366174,0.000028246712,0.0000023499997,0.0000015143725,0.00000373827,0.95425624,0.022535356,0.0017705424,0.020564198,0.00010954062],"about_ca_topic_score_codex":0.0000036725928,"about_ca_topic_score_gemma":0.000012139972,"teacher_disagreement_score":0.95145756,"about_ca_system_score_codex":0.000028330574,"about_ca_system_score_gemma":0.000025732568,"threshold_uncertainty_score":0.29866824},"labels":[],"label_agreement":null},{"id":"W1992837486","doi":"10.1145/2641483.2641529","title":"Using Category Theory and Data Flow Analysis for Modeling and Verifying Properties of Communications in the Process-Oriented Language Erasmus","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Erasmus+; Concurrency; Computer science; Process (computing); Programming language; Data flow diagram; Software engineering; Theoretical computer science; Database","score_opus":0.25329165550763966,"score_gpt":0.3976326043950494,"score_spread":0.14434094888740973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992837486","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.3357054,0.0007781744,0.66327065,0.000037481874,0.0000071711293,0.00013840354,0.000002828569,0.000012629327,0.000047249992],"genre_scores_gemma":[0.5984613,0.000049056634,0.4014405,0.000027143416,0.0000025057866,0.0000101438145,0.0000053606445,0.000001921206,0.0000020946425],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922836,0.00020775347,0.00018749844,0.00018873431,0.00010038674,0.000087296234],"domain_scores_gemma":[0.9986044,0.00011452053,0.000060569462,0.0011386718,0.00006831758,0.000013496009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015719887,0.000057651607,0.00011278818,0.000121695084,0.00018258893,0.00003003125,0.00089523196,0.000024044262,2.9912204e-7],"category_scores_gemma":[0.00022974236,0.00003874464,0.000013189964,0.0004942022,0.000115450115,0.00057047175,0.00031602546,0.00006602122,4.1207045e-8],"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.00023278735,0.00050218595,0.01605154,0.0007968072,0.00051951315,0.0000037456446,0.4120246,0.12452285,0.028618312,0.34849638,0.0000081903345,0.0682231],"study_design_scores_gemma":[0.000100280624,0.000008216487,0.00028008054,0.00001101327,0.000031498115,0.0000066679845,0.0032387795,0.99473083,0.0010201721,0.00051802275,0.000003105772,0.000051358085],"about_ca_topic_score_codex":0.00014689907,"about_ca_topic_score_gemma":0.00005044932,"teacher_disagreement_score":0.87020797,"about_ca_system_score_codex":0.000007903629,"about_ca_system_score_gemma":0.000035975914,"threshold_uncertainty_score":0.16635786},"labels":[],"label_agreement":null},{"id":"W1992839726","doi":"10.1016/s1389-1286(00)00009-8","title":"Feature interaction detection: a LOTOS-based approach","year":2000,"lang":"en","type":"article","venue":"Computer Networks","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"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 Ottawa","funders":"","keywords":"Computer science; Feature (linguistics); TRACE (psycholinguistics); State (computer science); Transition (genetics); Sequence (biology); Space (punctuation); Feature vector; State space; Transition system; Theoretical computer science; Programming language; Data mining; Artificial intelligence","score_opus":0.0169784077909192,"score_gpt":0.2535766569219098,"score_spread":0.2365982491309906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992839726","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.001040669,0.00009434474,0.9935478,0.0001909476,0.0014663159,0.00021735429,2.377534e-7,0.00049377134,0.0029485663],"genre_scores_gemma":[0.21451227,0.0000088484,0.783545,0.00081359415,0.00082775456,0.000039615323,0.0000074530485,0.0000140646,0.00023135928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867237,0.0001895815,0.00017397956,0.00048196403,0.00019295601,0.0002891395],"domain_scores_gemma":[0.9989496,0.000058727495,0.00008410157,0.0007540024,0.000061181556,0.000092373695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003133573,0.00017865995,0.00015457979,0.00008874618,0.00017045205,0.00026687083,0.0007630072,0.00015927284,0.00003168831],"category_scores_gemma":[0.000004392403,0.00017280382,0.000093025694,0.00059937243,0.00003719334,0.00058683794,0.00008063404,0.00040396545,0.00007336323],"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.000017591468,0.000045823974,0.000018000943,0.000006612162,0.000007672564,0.0000023167581,0.000054591073,0.2750215,0.000008254986,0.0010316086,0.0018202309,0.7219658],"study_design_scores_gemma":[0.00022114643,0.00008980213,0.00081250275,0.000018475288,0.0000041415237,0.000051400642,0.0000012908484,0.9510481,0.000261739,0.000092996765,0.0472158,0.0001826295],"about_ca_topic_score_codex":0.0000034348845,"about_ca_topic_score_gemma":9.089758e-7,"teacher_disagreement_score":0.72178316,"about_ca_system_score_codex":0.00007401507,"about_ca_system_score_gemma":0.000019361149,"threshold_uncertainty_score":0.70467347},"labels":[],"label_agreement":null},{"id":"W1996846884","doi":"10.1504/ijguc.2013.056257","title":"FASER (Formal and Automatic Security Enforcement by Rewriting) by BPA algebra with test","year":2013,"lang":"en","type":"article","venue":"International Journal of Grid and Utility Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Rewriting; Computer science; Process calculus; Enforcement; Security policy; Computer security model; Process (computing); Theoretical computer science; Computer security; Programming language; Algebra over a field; Mathematics; Law","score_opus":0.007587784069551583,"score_gpt":0.2514395864404241,"score_spread":0.2438518023708725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996846884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7282741,0.00016790739,0.26988468,0.0005702707,0.00058740296,0.00009473853,0.0000057607767,0.000027470074,0.00038768002],"genre_scores_gemma":[0.9167109,0.000022922226,0.08275886,0.0002844265,0.00020359961,0.0000010938551,0.0000034219784,0.0000043940995,0.000010365658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858,0.0000716673,0.0005074651,0.00017921315,0.0004696693,0.00019200414],"domain_scores_gemma":[0.998611,0.00022428861,0.0004418102,0.00012464273,0.0004786414,0.00011966031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009443726,0.0001244533,0.0001688008,0.00007829798,0.00012224387,0.0003469663,0.0004962812,0.000038925187,0.000024509834],"category_scores_gemma":[0.00021125561,0.00009884679,0.000032266882,0.000082157974,0.00009136709,0.0012485613,0.000248621,0.00022660878,0.0000022103577],"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.000056731224,0.00052917417,0.07072842,0.00014992952,0.00028695326,0.00002859582,0.0040459177,0.000069724374,0.0030397095,0.016073678,0.025288064,0.8797031],"study_design_scores_gemma":[0.0011831119,0.00044526378,0.04619522,0.0002486265,0.000014781491,0.0006314377,0.00030295766,0.9399607,0.0046501546,0.0019210066,0.004178503,0.0002682174],"about_ca_topic_score_codex":0.000056354067,"about_ca_topic_score_gemma":8.8846326e-7,"teacher_disagreement_score":0.939891,"about_ca_system_score_codex":0.00004882431,"about_ca_system_score_gemma":0.000039326354,"threshold_uncertainty_score":0.4030855},"labels":[],"label_agreement":null},{"id":"W1997427041","doi":"10.1016/j.tcs.2005.11.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mtext>CTL</mml:mtext></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup></mml:math> model checking for time Petri nets","year":2005,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":41,"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","funders":"","keywords":"Petri net; CTL*; Computer science; Algorithm; Model checking; Bounded function; State space; Discrete mathematics; Theoretical computer science; Mathematics","score_opus":0.023671791092370376,"score_gpt":0.26775318335223874,"score_spread":0.24408139225986836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997427041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42259398,0.0006130227,0.3650318,0.0015348264,0.0038084558,0.00015336761,0.00013578963,0.00051437924,0.20561436],"genre_scores_gemma":[0.818346,0.00021413059,0.175754,0.0023707475,0.0020951368,0.0004984272,0.00012315845,0.000367649,0.00023073233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9862456,0.00063863315,0.0022689225,0.0032289103,0.003993179,0.0036247643],"domain_scores_gemma":[0.9902256,0.0023290063,0.001781565,0.0036254358,0.0004738559,0.0015645046],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.0062671956,0.0011519156,0.00055215525,0.0007157416,0.0026480684,0.0034958217,0.0066689905,0.0018004414,0.028684417],"category_scores_gemma":[0.0024405648,0.0018122022,0.0015331587,0.0023711056,0.0058970214,0.003803221,0.004908118,0.0019468241,0.0037444532],"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.00071566086,0.00037412933,0.0000029417083,0.0004507882,0.00031096075,0.00024121057,0.0028186163,0.014131988,0.0027230347,0.9458567,0.0136856325,0.018688334],"study_design_scores_gemma":[0.0010938973,0.0014792795,0.000044403947,0.00054992904,0.0003410469,0.0008853294,0.00015771143,0.6913728,0.3003447,0.0013923037,0.0011202532,0.0012183174],"about_ca_topic_score_codex":0.0002138028,"about_ca_topic_score_gemma":0.000047650276,"teacher_disagreement_score":0.9444644,"about_ca_system_score_codex":0.000067204346,"about_ca_system_score_gemma":0.0021282164,"threshold_uncertainty_score":0.99949545},"labels":[],"label_agreement":null},{"id":"W1997489826","doi":"10.4204/eptcs.31.5","title":"On the Complexity of the Evaluation of Transient Extensions of Boolean Functions","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Boolean function; Product term; Boolean circuit; Boolean algebra; Boolean expression; And-inverter graph; Transient (computer programming); Parity function; XOR gate; Circuit minimization for Boolean functions","score_opus":0.03914086889851467,"score_gpt":0.3038161356205675,"score_spread":0.2646752667220528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997489826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6877906,0.000010235365,0.3082966,0.0011383459,0.0004470641,0.00039618486,0.0000012024724,0.000015901871,0.0019039108],"genre_scores_gemma":[0.95976514,0.0000013505535,0.04012749,0.000066324625,0.000017418848,0.000017190701,1.1453203e-7,0.000003957864,0.0000010370273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973639,0.00011257851,0.0004444195,0.0003836893,0.0013268837,0.0003685164],"domain_scores_gemma":[0.9978804,0.00027623156,0.00027339906,0.0006445727,0.00087895297,0.00004647356],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.008639907,0.00011647676,0.000177062,0.00016840614,0.00020965241,0.000035452176,0.0025331152,0.000052053725,0.000020891612],"category_scores_gemma":[0.00143805,0.00006851785,0.00008192401,0.0020346157,0.005654714,0.00029005756,0.00033614933,0.0005308989,0.0000012685952],"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.000009273319,0.00010248182,0.000041040214,0.000007216725,0.0000025278725,1.2326829e-8,0.00058383273,0.00016024841,0.03190015,0.9590391,0.000010497217,0.008143656],"study_design_scores_gemma":[0.00012714733,0.00018442578,0.010953502,0.00003423818,0.000007823762,0.0000055027026,0.000018268134,0.47526026,0.0947592,0.41858715,0.000007910986,0.000054566444],"about_ca_topic_score_codex":0.0000042693423,"about_ca_topic_score_gemma":0.000004121742,"teacher_disagreement_score":0.5404519,"about_ca_system_score_codex":0.000087577144,"about_ca_system_score_gemma":0.00040288357,"threshold_uncertainty_score":0.9970513},"labels":[],"label_agreement":null},{"id":"W1997553387","doi":"10.1007/s00165-012-0252-5","title":"Proving termination of nonlinear command sequences","year":2012,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Theory of computation; Nonlinear system; Simple (philosophy); Computer science; Algorithm; Divergence (linguistics); Class (philosophy); Loop (graph theory); Variable (mathematics); Mathematics; Theoretical computer science; Artificial intelligence; Mathematical analysis; Combinatorics","score_opus":0.02360080994626788,"score_gpt":0.297527706928594,"score_spread":0.2739268969823261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997553387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44285926,0.00006278868,0.5491812,0.000022353259,0.00031391034,0.000115912626,8.6532395e-7,0.000055786055,0.007387913],"genre_scores_gemma":[0.5753933,9.0283896e-7,0.4245175,0.000009531968,0.00007029876,6.6038416e-7,0.0000010478425,0.000003052473,0.0000036735585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880546,0.000071094044,0.00041917805,0.00012003791,0.00028784902,0.00029637862],"domain_scores_gemma":[0.99891806,0.00010866268,0.00048621357,0.00029130408,0.00014436101,0.0000513999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012315735,0.00009557908,0.00018005713,0.00012602273,0.00009587091,0.000025362755,0.000569863,0.00004512969,0.000002461715],"category_scores_gemma":[0.00014649237,0.00008858722,0.000050754137,0.00030541726,0.00006962468,0.0017290871,0.00028188483,0.00010222446,0.000003922224],"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.000010239832,0.0001961784,0.008819379,0.0003312186,0.000021282673,0.0000010107043,0.006419623,0.0008620476,0.012755602,0.7150545,0.000011853027,0.25551707],"study_design_scores_gemma":[0.00024378557,0.00020422842,0.049471606,0.00014075692,0.0000083962495,0.000032979708,0.00016200489,0.6213952,0.32591784,0.002046509,0.00018530538,0.00019140195],"about_ca_topic_score_codex":0.00001896744,"about_ca_topic_score_gemma":8.212504e-7,"teacher_disagreement_score":0.713008,"about_ca_system_score_codex":0.000028775965,"about_ca_system_score_gemma":0.000043354707,"threshold_uncertainty_score":0.3612482},"labels":[],"label_agreement":null},{"id":"W1998474763","doi":"10.1145/1066677.1067029","title":"Synthesis of C++ software for automated teller from CSPm specifications","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 Guelph","funders":"","keywords":"Executable; Computer science; Programming language; Extensibility; Exploit; Formalism (music); Source code; Formal verification; Software; Formal specification; Object-oriented programming; Syntax; Software engineering; Artificial intelligence","score_opus":0.06703305688385326,"score_gpt":0.30702716745523845,"score_spread":0.2399941105713852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998474763","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.0018287393,0.000029362174,0.99323326,0.0007674223,0.00010819037,0.0001811405,0.000018689909,0.00067577994,0.0031574308],"genre_scores_gemma":[0.099103786,0.000005365561,0.9004497,0.000064399406,0.00004477728,0.000059832884,0.000004572258,0.000006553769,0.00026103432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992436,0.00004171973,0.00025644616,0.00021867959,0.000120073244,0.00011946702],"domain_scores_gemma":[0.9986086,0.00046311278,0.00010598054,0.0006289213,0.00015613188,0.00003726536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023976873,0.00007029535,0.000113112386,0.000068640686,0.00006766371,0.00003142379,0.0006466931,0.000050467046,0.00005634827],"category_scores_gemma":[0.0005353616,0.00006478816,0.0000476217,0.00026602074,0.00003544589,0.00029272746,0.000057727142,0.000029874664,0.00006567229],"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.000010841414,0.00019518714,0.00022190322,0.000018608553,0.000039604078,1.206788e-7,0.00052128645,0.00082118006,0.009340295,0.4252863,0.018942904,0.54460174],"study_design_scores_gemma":[0.00013606368,0.000016344242,0.007630885,0.000012209183,0.0000075825296,8.040021e-7,0.000029806084,0.61860985,0.3520627,0.0032394894,0.018118901,0.00013538306],"about_ca_topic_score_codex":0.000029172803,"about_ca_topic_score_gemma":0.0000045165884,"teacher_disagreement_score":0.6177887,"about_ca_system_score_codex":0.000025197474,"about_ca_system_score_gemma":0.000055008575,"threshold_uncertainty_score":0.26419845},"labels":[],"label_agreement":null},{"id":"W199912135","doi":"10.1007/978-3-319-06880-0_10","title":"The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Generalization; Mathematical proof; Probabilistic logic; Probabilistic automaton; Automaton; Computer science; Simple (philosophy); State space; Computation; Theoretical computer science; Discrete mathematics; Algebra over a field; Mathematics; Algorithm; Pure mathematics; Artificial intelligence","score_opus":0.06364226179145153,"score_gpt":0.30335162303579205,"score_spread":0.2397093612443405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W199912135","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.00016156645,0.00010140935,0.9929903,0.00066794985,0.001994995,0.00064635946,0.000005700987,0.00019727809,0.0032344498],"genre_scores_gemma":[0.22666728,0.00001873456,0.7725899,0.00043184814,0.00020361444,0.000005827342,0.0000024422836,0.000025800624,0.000054528733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950388,0.00021895242,0.0009747794,0.0014332933,0.0016267091,0.0007074586],"domain_scores_gemma":[0.99286205,0.0025737737,0.0008985556,0.0030449687,0.00047475006,0.00014588439],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0051478017,0.00052794954,0.0006846806,0.0010469512,0.00062325574,0.0004839753,0.0066054836,0.00029654102,0.0000037301563],"category_scores_gemma":[0.0016874721,0.00039167295,0.00017184069,0.0017910574,0.003485982,0.00025165183,0.0019233578,0.001069715,0.00002479953],"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.000007156013,0.000030270576,0.000014295602,0.00006607034,0.000007248838,0.000003577747,0.00020821867,0.015225582,0.000017705326,0.5054809,0.000012056578,0.47892693],"study_design_scores_gemma":[0.0001666695,0.0002809354,0.00085496774,0.00026133872,0.0000057403277,0.000024670051,7.9142815e-8,0.7416297,0.00053198304,0.25542003,0.00048871746,0.00033513206],"about_ca_topic_score_codex":0.000020408315,"about_ca_topic_score_gemma":0.00002241767,"teacher_disagreement_score":0.72640413,"about_ca_system_score_codex":0.00038290446,"about_ca_system_score_gemma":0.00042106418,"threshold_uncertainty_score":0.9998535},"labels":[],"label_agreement":null},{"id":"W2000038675","doi":"10.1142/s1469026808002193","title":"SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT","year":2008,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Regina","funders":"","keywords":"Satisfiability; Computer science; Completeness (order theory); Propositional calculus; Boolean satisfiability problem; Mathematical optimization; Range (aeronautics); Approximation algorithm; Conjunctive normal form; Local search (optimization); Set (abstract data type); Mathematics; Theoretical computer science; Algorithm","score_opus":0.07812007125231435,"score_gpt":0.3857766504357405,"score_spread":0.30765657918342615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000038675","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.004602219,0.00032503568,0.9939065,0.0004643671,0.00017740461,0.00038412423,0.000008773223,0.000025925247,0.000105644096],"genre_scores_gemma":[0.5950691,0.0001480472,0.40448388,0.00009638286,0.000116131276,0.00006404561,0.0000065240392,0.000004681652,0.000011180023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986306,0.000055259618,0.0005657523,0.00017320795,0.00047048318,0.00010473016],"domain_scores_gemma":[0.9980317,0.0005709378,0.00024876295,0.000114232185,0.0009503658,0.00008402335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057848386,0.000100757126,0.00016786593,0.00023105992,0.00015716297,0.00009745694,0.00062062347,0.000043264914,0.0000030249475],"category_scores_gemma":[0.00009031058,0.00009208632,0.00006172388,0.0001510448,0.00019899149,0.0005313532,0.00011694295,0.00011640825,0.000005340468],"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.00015012272,0.00019644384,0.00014748063,0.00036169303,0.00024384969,0.000009045664,0.0010147677,0.01777983,0.0002591395,0.87388504,0.0001283013,0.105824284],"study_design_scores_gemma":[0.0010411988,0.0009223342,0.0020964232,0.0009003542,0.00007223891,0.0030509422,0.0010673543,0.8307506,0.018385414,0.13898517,0.0021874586,0.00054053124],"about_ca_topic_score_codex":0.0000057601574,"about_ca_topic_score_gemma":8.11282e-7,"teacher_disagreement_score":0.81297076,"about_ca_system_score_codex":0.00008179002,"about_ca_system_score_gemma":0.000105790896,"threshold_uncertainty_score":0.3755171},"labels":[],"label_agreement":null},{"id":"W2001616837","doi":"10.1016/j.scico.2010.05.007","title":"Internal axioms for domain semirings","year":2010,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Axiom; Kleene algebra; Computer science; Domain (mathematical analysis); Simple (philosophy); Modal; Algebra over a field; Set (abstract data type); Relational algebra; State (computer science); Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Programming language; Pure mathematics; Relational database; Data mining","score_opus":0.015384043051828328,"score_gpt":0.307715587988258,"score_spread":0.29233154493642965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001616837","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.112960026,0.000005783779,0.8843014,0.00015581604,0.0019350937,0.00030786454,4.3455907e-7,0.00012547447,0.00020807557],"genre_scores_gemma":[0.3381594,2.1137785e-7,0.6616664,0.00003266135,0.00010138093,0.00002485245,2.5539808e-7,0.0000044717435,0.000010356576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825215,0.000022409491,0.00032068937,0.0004832042,0.00047440408,0.00044716522],"domain_scores_gemma":[0.99859786,0.00007722243,0.00021673916,0.00065850327,0.00032023995,0.00012940986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028267887,0.00012058626,0.00015153167,0.0002588718,0.00021789123,0.00036112455,0.0026838996,0.00004889132,0.0000019502777],"category_scores_gemma":[0.00011788054,0.000109927474,0.00007995932,0.00089260476,0.0006429153,0.0012857548,0.0005265772,0.00018045337,0.000005082652],"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.0000033891954,0.000036723013,0.00009669735,0.000019992163,0.0000025801064,4.5562325e-7,0.0008620637,0.000021634885,0.038134977,0.34968445,0.00001759538,0.61111945],"study_design_scores_gemma":[0.0005844565,0.0005593413,0.0034087754,0.00007770328,0.000004848884,0.00008755548,0.000059661263,0.75429386,0.18997654,0.030052774,0.020439234,0.0004552258],"about_ca_topic_score_codex":0.000011478088,"about_ca_topic_score_gemma":0.0000018221983,"teacher_disagreement_score":0.7542722,"about_ca_system_score_codex":0.00002673017,"about_ca_system_score_gemma":0.00013973245,"threshold_uncertainty_score":0.49873978},"labels":[],"label_agreement":null},{"id":"W2001789462","doi":"10.1109/edoc.2007.36","title":"Model Checking Data-Aware Workflow Properties with CTL-FO+","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"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é du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Workflow; Computer science; Model checking; CTL*; Context (archaeology); Web service; Theoretical computer science; Temporal logic; Programming language; Algorithm; Artificial intelligence; Database","score_opus":0.20048981268854543,"score_gpt":0.32807512388487375,"score_spread":0.12758531119632832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001789462","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.0046962416,0.00004268539,0.986341,0.00016068951,0.00010793568,0.00013864943,7.815202e-7,0.00028986987,0.00822217],"genre_scores_gemma":[0.31871247,0.000002334486,0.6804051,0.00019891224,0.000029718994,0.000003914301,0.0000023861671,0.0000070283895,0.0006381571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987921,0.000026646641,0.00019100939,0.00039887894,0.00031019317,0.00028114134],"domain_scores_gemma":[0.9982985,0.00002096586,0.00006477824,0.0014611916,0.00008869194,0.00006582738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011760482,0.00011105543,0.000102130165,0.00006716322,0.00011019345,0.000143451,0.0015924089,0.000046314144,0.000006186975],"category_scores_gemma":[0.000044661887,0.000074163014,0.000013522167,0.00033254785,0.00005147551,0.0014971091,0.00044406642,0.00011840046,0.000030647705],"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.00009902742,0.00016539334,0.001478354,0.0000841852,0.000049625116,0.000020370684,0.002883026,0.020218017,0.0043837735,0.2317012,0.0014553884,0.7374616],"study_design_scores_gemma":[0.00009384889,0.00002779684,0.00038107295,0.000025894553,0.0000034279738,0.000011352816,0.000047649268,0.9854696,0.01255921,0.000521571,0.0007096633,0.0001489237],"about_ca_topic_score_codex":0.000020726155,"about_ca_topic_score_gemma":0.000032832344,"teacher_disagreement_score":0.96525156,"about_ca_system_score_codex":0.000035939516,"about_ca_system_score_gemma":0.00006677254,"threshold_uncertainty_score":0.302428},"labels":[],"label_agreement":null},{"id":"W2002271077","doi":"10.1145/1811147.1811148","title":"Definition and implementation of a semantic mapping for UML-RT using a timed pi-calculus","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Programming language; Executable; Unified Modeling Language; UML tool; Process calculus; Semantics (computer science); Interpreter; Syntax; Software engineering; Software; Natural language processing","score_opus":0.07652997839223202,"score_gpt":0.3586136196367592,"score_spread":0.2820836412445272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002271077","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.31288564,0.0000035572587,0.68650246,0.00005531778,0.00012225806,0.00019563032,0.0000011328141,0.000026963768,0.00020702915],"genre_scores_gemma":[0.42530936,8.5554035e-7,0.5746287,0.000030663534,0.000011848971,0.000011214475,0.0000013985938,0.000002394672,0.0000035664495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994158,0.000025532509,0.00019723015,0.0001538732,0.00009381473,0.00011376015],"domain_scores_gemma":[0.9995467,0.00005342218,0.000110379115,0.00018220278,0.00008014111,0.000027126955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050531887,0.00005457015,0.00007938534,0.000089188245,0.000066598135,0.00004154017,0.00012743469,0.0000343371,0.000010794796],"category_scores_gemma":[0.00005341281,0.00005235106,0.000022658789,0.00015399152,0.000026120719,0.0003790918,0.000054722826,0.000042653985,0.0000015312805],"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.000004565791,0.000019940906,0.00086285727,0.00008545053,0.0000095072955,1.728911e-7,0.0010421434,0.0000034260936,0.38616627,0.51441765,0.000017069691,0.09737094],"study_design_scores_gemma":[0.00063382456,0.000082204606,0.015720654,0.000018438177,0.000013957941,0.000025843654,0.0002561973,0.8176985,0.1453852,0.019915337,0.00010351912,0.00014636679],"about_ca_topic_score_codex":0.00006808542,"about_ca_topic_score_gemma":0.000024018018,"teacher_disagreement_score":0.817695,"about_ca_system_score_codex":0.000010812906,"about_ca_system_score_gemma":0.000030056244,"threshold_uncertainty_score":0.21348143},"labels":[],"label_agreement":null},{"id":"W2003255006","doi":"10.1145/2591513.2591578","title":"A semi-formal approach for analog circuits behavioral properties verification","year":2014,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Behavioral modeling; Analogue electronics; Computer science; State space; Formal verification; Electronic circuit; State (computer science); Electronic engineering; Tunnel diode; Diode; Algorithm; Electrical engineering; Mathematics; Engineering; Artificial intelligence","score_opus":0.0851383693866395,"score_gpt":0.2992536539257084,"score_spread":0.21411528453906892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003255006","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.01279273,0.000016546977,0.9784445,0.000055439934,0.0001983305,0.00044111456,0.0000011084464,0.0002672891,0.007782935],"genre_scores_gemma":[0.51176757,9.856288e-7,0.48771015,0.00007820924,0.000045575754,0.00015796296,0.00000855526,0.000006107084,0.00022487479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882233,0.00008228711,0.00024605778,0.0003513897,0.00020197815,0.0002959294],"domain_scores_gemma":[0.99904716,0.000018851342,0.00009379809,0.00063750084,0.00013653969,0.00006614318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096888747,0.00011887609,0.00012758291,0.000087993496,0.00017301814,0.00014497517,0.0007348193,0.00007991927,0.0000034579975],"category_scores_gemma":[0.000079587815,0.00009782358,0.000058141402,0.0002381598,0.00004923086,0.0011881634,0.00008524453,0.00007755419,0.00001775651],"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.000011971707,0.00020745464,0.00028812484,0.00008652881,0.00000814459,7.2385326e-8,0.001018897,0.00044973384,0.024861312,0.6152984,0.00036769468,0.3574017],"study_design_scores_gemma":[0.00026896075,0.00021409192,0.0023094069,0.000005814812,0.000008666537,0.000008513803,0.00005256308,0.9453252,0.047848485,0.0007219725,0.0030179385,0.00021836924],"about_ca_topic_score_codex":0.000016252281,"about_ca_topic_score_gemma":0.0000010406558,"teacher_disagreement_score":0.9448755,"about_ca_system_score_codex":0.00004592216,"about_ca_system_score_gemma":0.000034309945,"threshold_uncertainty_score":0.39891297},"labels":[],"label_agreement":null},{"id":"W2003520601","doi":"10.1016/j.ic.2013.02.002","title":"Testing probabilistic equivalence through Reinforcement Learning","year":2013,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Equivalence (formal languages); Mathematics; Bisimulation; Decidability; Probabilistic logic; Discrete mathematics; Theoretical computer science; Computer science","score_opus":0.05048742108083468,"score_gpt":0.29907735545670067,"score_spread":0.248589934375866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003520601","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.020656396,0.000011024969,0.9692508,0.00015768173,0.0001310915,0.0003184893,8.772699e-8,0.0002364725,0.009237969],"genre_scores_gemma":[0.5941372,0.0000032496343,0.40554103,0.00024128708,0.000010805661,0.00003916864,0.00000721517,0.0000017652121,0.000018294395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991226,0.00005344514,0.00035381241,0.00010840826,0.00021710471,0.0001446094],"domain_scores_gemma":[0.99924356,0.00009602614,0.00022373702,0.000120540615,0.0002747681,0.000041381565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028998396,0.00008694761,0.000071712515,0.000070832444,0.00019469942,0.00040782854,0.00017112188,0.000035975034,0.000009065259],"category_scores_gemma":[0.00034705363,0.000083061044,0.000013201844,0.00031403967,0.000031516767,0.00604104,0.00010271766,0.00009939989,0.00019709869],"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.0000018020032,0.000007725363,0.00029528132,0.00008253375,0.0000039190395,1.1224925e-7,0.0035948458,0.16440059,0.0001456888,0.15018585,0.00012367756,0.68115795],"study_design_scores_gemma":[0.00014562412,0.00008212324,0.008694226,0.000023681252,0.0000016253578,0.000010742861,0.00013145537,0.9771416,0.00013895916,0.0127554815,0.0007687983,0.00010565113],"about_ca_topic_score_codex":0.00005265085,"about_ca_topic_score_gemma":1.19207975e-7,"teacher_disagreement_score":0.81274104,"about_ca_system_score_codex":0.000041922514,"about_ca_system_score_gemma":0.000030007683,"threshold_uncertainty_score":0.43796083},"labels":[],"label_agreement":null},{"id":"W2005214031","doi":"10.1145/2635868.2635911","title":"Verifying CTL-live properties of infinite state models using an SMT solver","year":2014,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 Waterloo","funders":"","keywords":"Model checking; CTL*; Computer science; Solver; Satisfiability modulo theories; Computation tree logic; Liveness; Theoretical computer science; Abstraction; State (computer science); Abstraction model checking; Operator (biology); Abstract interpretation; Algorithm; Software; Programming language","score_opus":0.15843364445633012,"score_gpt":0.304024825010353,"score_spread":0.14559118055402287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005214031","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.28604478,0.000015933334,0.71253145,0.000012473468,0.000122060934,0.00007664369,3.3716535e-7,0.00007761876,0.0011186994],"genre_scores_gemma":[0.51664287,0.0000028080067,0.48319206,0.00010780686,0.00001131692,0.0000023553887,1.924467e-7,0.000004969965,0.000035615474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989399,0.000155671,0.00025869106,0.00023420033,0.00022078064,0.00019076814],"domain_scores_gemma":[0.9990858,0.000022475428,0.0001262113,0.00056296063,0.00014737892,0.000055194527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000696909,0.00009856949,0.00013687329,0.00008715559,0.000078368495,0.00008012752,0.00053937495,0.00003291263,0.0000057816583],"category_scores_gemma":[0.0000538489,0.00008018581,0.000029868432,0.00017355943,0.00006640559,0.001928581,0.00017487908,0.000077710145,0.000008541373],"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.000051636074,0.00021246879,0.00039570327,0.00022081957,0.000039992126,0.0000011192744,0.023820383,0.29032663,0.23965731,0.31452924,0.00002434102,0.13072033],"study_design_scores_gemma":[0.00008968915,0.00006225653,0.00008806807,0.000027325385,0.0000025134418,0.0000020300956,0.000054381053,0.8921596,0.10128379,0.0060502454,0.00007160045,0.00010852556],"about_ca_topic_score_codex":0.0002320286,"about_ca_topic_score_gemma":0.000005485903,"teacher_disagreement_score":0.6018329,"about_ca_system_score_codex":0.000026118656,"about_ca_system_score_gemma":0.000044054654,"threshold_uncertainty_score":0.32698825},"labels":[],"label_agreement":null},{"id":"W2005831808","doi":"10.1016/j.ic.2010.08.001","title":"On the consistency, expressiveness, and precision of partial modeling formalisms","year":2010,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","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":"Rotation formalisms in three dimensions; Computer science; Consistency (knowledge bases); Model checking; Theoretical computer science; Logical consequence; Transition system; Succinctness; Expressive power; Class (philosophy); Interpretation (philosophy); Algorithm; Programming language; Mathematics; Artificial intelligence","score_opus":0.028999871383351854,"score_gpt":0.28762111789332434,"score_spread":0.2586212465099725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005831808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36647478,0.0000059529207,0.63257545,0.0001428096,0.00014667683,0.00010763833,9.4141296e-7,0.00002256883,0.0005231858],"genre_scores_gemma":[0.9152921,0.0000080406935,0.08450019,0.00017236317,0.00000911187,0.000011270411,0.000004428331,0.000001417225,0.0000011037639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993531,0.000045732257,0.0002802531,0.000073655945,0.00017801898,0.0000692532],"domain_scores_gemma":[0.9993702,0.0001424997,0.00017354025,0.0001518361,0.00013362772,0.000028301578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054100686,0.00006214172,0.000068290436,0.00007249418,0.00014580245,0.00012739921,0.00013745506,0.00004576361,0.0000022372187],"category_scores_gemma":[0.00015787565,0.00004437712,0.000014627781,0.00010281185,0.00005115329,0.0015426354,0.000067470166,0.00009915181,0.0000037481027],"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.00001723029,0.000009422106,0.000037897567,0.000019507917,0.0000029318699,4.7576258e-8,0.0021957778,0.010895877,0.0005689113,0.7812561,0.00002556859,0.20497073],"study_design_scores_gemma":[0.00016739842,0.00004200767,0.0007460368,0.000015984624,0.0000019398185,0.0000071716295,0.000094516465,0.9763339,0.0029548076,0.019416511,0.00016676036,0.000052932643],"about_ca_topic_score_codex":0.000008874968,"about_ca_topic_score_gemma":6.2292713e-7,"teacher_disagreement_score":0.96543807,"about_ca_system_score_codex":0.000004046285,"about_ca_system_score_gemma":0.000022672333,"threshold_uncertainty_score":0.18096463},"labels":[],"label_agreement":null},{"id":"W2006220703","doi":"10.1002/mma.1055","title":"Formal verification of tail distribution bounds in the HOL theorem prover","year":2008,"lang":"en","type":"article","venue":"Mathematical Methods in the Applied Sciences","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Markov chain; Random variable; Applied mathematics; Automated theorem proving; Chebyshev filter; Discrete mathematics; Bernoulli distribution; Algorithm; Statistics; Mathematical analysis","score_opus":0.08441597948996474,"score_gpt":0.37756799916221445,"score_spread":0.2931520196722497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006220703","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.0490743,0.000028004271,0.9348915,0.00052076386,0.00008314199,0.00066892983,0.0000016317026,0.000029462415,0.014702238],"genre_scores_gemma":[0.45892987,0.000004819876,0.5407602,0.0001290375,0.000014453775,0.00015343729,9.074077e-7,0.0000025202105,0.0000047215854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636304,0.0013389289,0.0006682766,0.0003792739,0.0008412102,0.0004092466],"domain_scores_gemma":[0.99672806,0.0020398765,0.00026889963,0.0008929207,0.00004277965,0.000027433012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023501331,0.00015599535,0.00025145945,0.000117739124,0.00034983383,0.00012259788,0.0031465618,0.00008585561,0.000007617518],"category_scores_gemma":[0.0011753341,0.000082525876,0.00006331178,0.0021114836,0.0011810928,0.00059602235,0.00017827314,0.00029311824,0.000013101989],"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.0000078740195,0.00014616692,0.00005355788,0.00002607769,0.0000014424834,7.8460897e-7,0.008281783,0.000051691106,0.0019194213,0.96637094,0.000025590503,0.023114692],"study_design_scores_gemma":[0.0002495031,0.00012518233,0.006382346,0.000029654699,0.0000067755136,0.000068377696,0.0025833857,0.09995597,0.018284502,0.871734,0.00038630766,0.00019399513],"about_ca_topic_score_codex":0.0000056824633,"about_ca_topic_score_gemma":8.0722424e-7,"teacher_disagreement_score":0.40985557,"about_ca_system_score_codex":0.00004736398,"about_ca_system_score_gemma":0.00008136452,"threshold_uncertainty_score":0.81451386},"labels":[],"label_agreement":null},{"id":"W2007291179","doi":"10.1016/j.jcss.2013.05.002","title":"An approach for lifetime reliability analysis using theorem proving","year":2013,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Reliability (semiconductor); Computer science; Calculus (dental); Mathematics; Automated theorem proving; Reliability engineering; Discrete mathematics; Algorithm; Engineering; Medicine; Physics; Thermodynamics","score_opus":0.035162649597970844,"score_gpt":0.30863702817940114,"score_spread":0.2734743785814303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007291179","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.16722669,0.00006133603,0.8320777,0.000030581916,0.00025934484,0.00018603016,3.4577633e-7,0.000019771884,0.00013819616],"genre_scores_gemma":[0.47044343,5.88108e-7,0.52944034,0.000014979796,0.000095787786,0.0000021798962,7.05233e-8,0.0000013185165,0.0000012960611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982834,0.00033242005,0.0005378529,0.0002771418,0.00038380423,0.00018540217],"domain_scores_gemma":[0.9985525,0.00014201773,0.00051499886,0.0002857938,0.00038207546,0.00012262496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052745305,0.00009781881,0.00031213355,0.00031863563,0.00028484935,0.00071643083,0.0010094609,0.00004059058,7.4997325e-7],"category_scores_gemma":[0.000034119977,0.00006395711,0.00012372577,0.0007775473,0.0001386566,0.002127962,0.00008007004,0.000072148825,3.5137077e-7],"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.00004288344,0.000495575,0.043510538,0.00083539635,0.00047008597,0.000004483279,0.0084712375,0.38233003,0.0033115926,0.30615756,0.00015781904,0.25421283],"study_design_scores_gemma":[0.000091699236,0.00024582073,0.007932449,0.000022182525,0.000039124854,0.00007710448,0.00026313376,0.99034405,0.00012664504,0.0007644378,0.000009001726,0.00008433469],"about_ca_topic_score_codex":0.000017072109,"about_ca_topic_score_gemma":8.5420815e-8,"teacher_disagreement_score":0.60801405,"about_ca_system_score_codex":0.000042691456,"about_ca_system_score_gemma":0.00008649413,"threshold_uncertainty_score":0.69085586},"labels":[],"label_agreement":null},{"id":"W2007316622","doi":"10.1145/1714450.1714452","title":"Formula Caching in DPLL","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":41,"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":"Division of Mathematical Sciences; National Science Foundation","keywords":"DPLL algorithm; Satisfiability; Mathematical proof; Resolution (logic); Computer science; Tree (set theory); Simple (philosophy); Algorithm; Mathematics; Conjunctive normal form; Boolean satisfiability problem; Discrete mathematics; Theoretical computer science; Combinatorics","score_opus":0.019958542382672806,"score_gpt":0.3078544586707602,"score_spread":0.2878959162880874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007316622","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.057527833,0.0000047657895,0.93962115,0.00029469555,0.0009773024,0.0001584397,0.0000015526092,0.00020600694,0.0012082544],"genre_scores_gemma":[0.5644622,0.0000019493452,0.43522638,0.00016986902,0.000014862875,0.00001947719,0.0000013735759,0.0000069596144,0.00009692495],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886346,0.00022407254,0.00026006115,0.00027628615,0.00019060358,0.00018549706],"domain_scores_gemma":[0.99871945,0.0005072736,0.00007626812,0.0005849377,0.000054857534,0.00005718308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011351901,0.00011480526,0.00010276772,0.00032263933,0.00017448282,0.000084313026,0.0007109698,0.00008672941,0.0000380625],"category_scores_gemma":[0.00011007653,0.000118763346,0.000056011908,0.00048320403,0.000044614528,0.0007183085,0.000008858041,0.0004958819,0.00013326043],"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.00002373404,0.00013711226,0.000022976816,0.000008560544,0.0000075709368,0.0000024916142,0.001568717,0.046090703,0.0022126175,0.31792012,0.000008642869,0.63199675],"study_design_scores_gemma":[0.0006619337,0.000080455946,0.0037889238,0.000022491722,0.0000070193546,0.00003492052,0.00008767182,0.4677362,0.014919332,0.5116869,0.0006712209,0.00030286962],"about_ca_topic_score_codex":0.000013524973,"about_ca_topic_score_gemma":0.000028866676,"teacher_disagreement_score":0.6316939,"about_ca_system_score_codex":0.000043565,"about_ca_system_score_gemma":0.00003869354,"threshold_uncertainty_score":0.48430288},"labels":[],"label_agreement":null},{"id":"W2007666139","doi":"10.1007/s00165-012-0223-x","title":"Automatic verification of reduction techniques in Higher Order Logic","year":2012,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Computer science; Correctness; Soundness; Reduction (mathematics); Model checking; Programming language; Heuristics; Consistency (knowledge bases); Partial order reduction; Automated theorem proving; Algorithm; Formal verification; Reduction strategy; Theoretical computer science; Mathematics","score_opus":0.04194995695396473,"score_gpt":0.3097887354940638,"score_spread":0.2678387785400991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007666139","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.32372683,0.000071451774,0.6663898,0.0000724856,0.00052585284,0.0002177211,2.962933e-7,0.00017825348,0.008817283],"genre_scores_gemma":[0.54836136,0.0000014233774,0.45156875,0.000006468181,0.000049801063,0.0000029759842,0.00000100364,0.0000038407843,0.0000044025487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99869674,0.00010186817,0.0005287052,0.00014864781,0.00023676227,0.00028725027],"domain_scores_gemma":[0.9989567,0.000045723085,0.00044254356,0.00038103305,0.0001377131,0.000036317066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012223747,0.00010401404,0.00019751402,0.00023121446,0.00004902623,0.000015256932,0.0004364057,0.000074783806,0.000013986103],"category_scores_gemma":[0.000089253794,0.0001004772,0.00003838892,0.00077248557,0.00005861381,0.0013328727,0.00015329885,0.00012174706,0.000006076393],"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.00000526655,0.00015845268,0.0006896038,0.00013012404,0.0000065906984,2.6245147e-7,0.0015138461,0.00022344972,0.015628105,0.8469974,0.000010185667,0.13463676],"study_design_scores_gemma":[0.00033330717,0.0002460005,0.20226881,0.00026200697,0.000010985653,0.000058310558,0.00016899977,0.30103505,0.4781452,0.016953956,0.00017001819,0.00034733233],"about_ca_topic_score_codex":0.000020235162,"about_ca_topic_score_gemma":2.0763122e-7,"teacher_disagreement_score":0.8300434,"about_ca_system_score_codex":0.00006677355,"about_ca_system_score_gemma":0.000033465763,"threshold_uncertainty_score":0.40973413},"labels":[],"label_agreement":null},{"id":"W2007822392","doi":"10.4271/2011-01-2530","title":"Verification and Validation of Complex Systems","year":2011,"lang":"en","type":"article","venue":"SAE technical papers on CD-ROM/SAE technical paper series","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science","score_opus":0.05737524137348675,"score_gpt":0.287185431678746,"score_spread":0.22981019030525923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007822392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7886157,0.0009678215,0.004738054,0.0022519163,0.0016905195,0.004461965,0.00009395078,0.006824894,0.19035515],"genre_scores_gemma":[0.8421912,0.00015526783,0.15708284,0.00020991801,0.00004471646,0.00017954776,0.000020220117,0.000037787067,0.00007846663],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.996226,0.00035480005,0.0011345771,0.0010081247,0.0007689597,0.0005075358],"domain_scores_gemma":[0.99683744,0.00025173882,0.00050578173,0.001954414,0.0002158339,0.00023479106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013720725,0.00044752032,0.00064387347,0.00025005394,0.0002459897,0.000113351074,0.0015831782,0.00050271885,0.00007794899],"category_scores_gemma":[0.0005468435,0.00040507616,0.00016963,0.00085962785,0.0008403869,0.0011454846,0.0004626228,0.0005203795,0.000050450464],"study_design_candidate":"observational","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.000070477465,0.00016821193,0.00013915755,0.000058598765,0.0000143746065,0.000002892785,0.00009212829,0.0000043975438,0.72158754,0.27208158,0.000245924,0.0055347085],"study_design_scores_gemma":[0.000344778,0.0009308435,0.98384166,0.00011714337,0.000033505778,0.00007601549,0.000072525225,0.000005283242,0.0027607486,0.0044786255,0.0069105267,0.00042835795],"about_ca_topic_score_codex":0.00006997538,"about_ca_topic_score_gemma":0.0009226412,"teacher_disagreement_score":0.9837025,"about_ca_system_score_codex":0.0001471372,"about_ca_system_score_gemma":0.000065008564,"threshold_uncertainty_score":0.9998401},"labels":[],"label_agreement":null},{"id":"W2008270704","doi":"10.4204/eptcs.85.3","title":"Measuring Progress of Probabilistic LTL Model Checking","year":2012,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust","keywords":"Measure (data warehouse); Probabilistic logic; Model checking; Set (abstract data type); Polynomial; Exponential function; Time complexity","score_opus":0.02659591590787949,"score_gpt":0.2787672107818356,"score_spread":0.25217129487395606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008270704","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.1555573,0.0001813429,0.8413832,0.00012047183,0.00021036198,0.00032122727,1.6008282e-7,0.00013763679,0.0020882885],"genre_scores_gemma":[0.6143105,0.0000031672491,0.38556743,0.000032194923,0.0000488791,0.00002896004,7.037234e-8,0.000007565797,0.0000012300311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645513,0.00003875488,0.00049464847,0.0006381893,0.00093694776,0.0014363026],"domain_scores_gemma":[0.99877715,0.00006748901,0.00020539296,0.0004166296,0.00033361424,0.00019973492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064041675,0.00021343274,0.00027207853,0.00036403316,0.00017901488,0.00018122728,0.0028061008,0.00007996358,0.0000025847278],"category_scores_gemma":[0.00046540704,0.00019156853,0.00005552606,0.002198677,0.0018647878,0.0023027179,0.0008883493,0.00043613874,0.0000051488214],"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.000008309251,0.00011762029,0.00092216267,0.000047506266,0.0000022858242,1.6441868e-7,0.0013596911,0.00027900928,0.0016297423,0.9788831,0.000001439066,0.016748995],"study_design_scores_gemma":[0.00012709151,0.0001127951,0.0009553538,0.00006592505,0.0000030953865,0.000024174678,0.0000069569805,0.7608346,0.031747185,0.20593144,0.000006080755,0.00018532517],"about_ca_topic_score_codex":7.2975746e-7,"about_ca_topic_score_gemma":1.1455411e-7,"teacher_disagreement_score":0.77295166,"about_ca_system_score_codex":0.00043295952,"about_ca_system_score_gemma":0.00030213146,"threshold_uncertainty_score":0.7811938},"labels":[],"label_agreement":null},{"id":"W2008284187","doi":"10.1109/tcad.2008.2006144","title":"Functionally Linear Decomposition and Synthesis of Logic Circuits for FPGAs","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":23,"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":"","keywords":"XOR gate; Logic synthesis; Logic optimization; Computer science; Logic family; Scalability; Logic gate; Lookup table; Set (abstract data type); Gaussian elimination; Sequential logic; Algorithm; Binary decision diagram; Electronic circuit; Parallel computing; Gaussian; Programming language; Engineering; Electrical engineering","score_opus":0.07307298586878275,"score_gpt":0.28141459227810056,"score_spread":0.20834160640931781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008284187","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.012698015,0.00018622524,0.9851254,0.000029869963,0.00094884064,0.00079274335,0.00005453979,0.00011078231,0.000053542804],"genre_scores_gemma":[0.83411205,0.00013029449,0.16550067,0.00003459928,0.00004240445,0.00012795908,0.0000031281822,0.000017386066,0.000031491687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778646,0.0003946865,0.0007738251,0.0005003629,0.00031276268,0.00023188673],"domain_scores_gemma":[0.9975066,0.000996813,0.00037131153,0.0004058172,0.0006060568,0.000113399954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083410187,0.00026222583,0.00053334166,0.0004056588,0.0002594069,0.000053560972,0.00033752748,0.0001869513,0.0000027078804],"category_scores_gemma":[0.000033564243,0.0002340109,0.00011414683,0.00044388697,0.00015960277,0.0003875195,0.0000032144562,0.0001714817,0.0000021866724],"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.00024149574,0.0014836974,0.000060141778,0.0012302285,0.00069607736,0.000018863162,0.0018497478,0.28568143,0.12361304,0.03882322,0.00031319077,0.54598886],"study_design_scores_gemma":[0.0007039752,0.0011045906,0.0002638492,0.00039318964,0.000053554642,0.00034912888,0.00005186279,0.91481334,0.08155645,0.0003838999,0.000049621744,0.00027651468],"about_ca_topic_score_codex":0.00006439453,"about_ca_topic_score_gemma":0.0000011137315,"teacher_disagreement_score":0.82141405,"about_ca_system_score_codex":0.00006526346,"about_ca_system_score_gemma":0.00013155169,"threshold_uncertainty_score":0.95426875},"labels":[],"label_agreement":null},{"id":"W2008416362","doi":"10.1007/s10009-002-0082-5","title":"Hierarchical formal verification using a hybrid tool","year":2003,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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":"Computer science; Intelligent verification; HOL; Formal verification; Functional verification; Runtime verification; High-level verification; Theory of computation; Component (thermodynamics); Software verification; Verification; Formal methods; Model checking; Programming language; Computer architecture; Embedded system; Software; Software development; Software construction","score_opus":0.04344229729073261,"score_gpt":0.3178908435027292,"score_spread":0.2744485462119966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008416362","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.116695106,0.000039816183,0.8799518,0.0008659927,0.0017159317,0.00027541723,0.000027221942,0.00031254106,0.000116221934],"genre_scores_gemma":[0.39186874,0.000026970998,0.6074966,0.00041205253,0.00009123642,0.0000513822,0.000007269272,0.00001914607,0.000026614667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99795514,0.00009642325,0.00058502046,0.00038996476,0.00054317777,0.0004302598],"domain_scores_gemma":[0.99863887,0.00019054223,0.000112394606,0.00043800886,0.0005407496,0.000079448444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092949584,0.00021413201,0.00021057014,0.0006602656,0.00028716068,0.00036767035,0.0016081173,0.00020500005,0.000030793308],"category_scores_gemma":[0.0013986751,0.00020339331,0.00019987092,0.00032002563,0.0001234417,0.0019535208,0.000044201184,0.00060537533,0.000026284943],"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.00009935414,0.00013417394,0.00017342722,0.0000053459726,0.00008247737,0.000027361113,0.00005712955,0.00029164474,0.0034531902,0.7844375,0.0000725169,0.21116592],"study_design_scores_gemma":[0.006246475,0.0017200632,0.0013280738,0.00024530065,0.00008145472,0.008822823,0.0000821179,0.04667901,0.40209278,0.3297219,0.20150149,0.001478515],"about_ca_topic_score_codex":4.4743396e-7,"about_ca_topic_score_gemma":2.0486495e-7,"teacher_disagreement_score":0.45471555,"about_ca_system_score_codex":0.0002722032,"about_ca_system_score_gemma":0.00018313222,"threshold_uncertainty_score":0.82941383},"labels":[],"label_agreement":null},{"id":"W2009126184","doi":"10.2514/6.2004-5254","title":"Validation and Verification of Intelligent and Adaptive Control Systems","year":2004,"lang":"en","type":"article","venue":"AIAA Guidance, Navigation, and Control Conference and Exhibit","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Adaptive control; Control (management); Artificial intelligence","score_opus":0.021549716928906372,"score_gpt":0.25486798313300757,"score_spread":0.2333182662041012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009126184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25997555,0.0025601203,0.7363463,0.00031986876,0.00011818438,0.0004314243,0.000009753924,0.0000350262,0.00020380298],"genre_scores_gemma":[0.9897987,0.0006347471,0.009333856,0.00009690702,0.00003168889,0.00006689397,0.0000070573783,0.0000065478935,0.000023590754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862677,0.00013697431,0.00046000525,0.0004193881,0.00018675634,0.00017008351],"domain_scores_gemma":[0.9988261,0.00010459283,0.00028869344,0.00026988564,0.00041838497,0.00009237356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071737065,0.00017140176,0.00030072161,0.000097158525,0.00017770258,0.00021330123,0.00014991722,0.00010601983,7.7013493e-7],"category_scores_gemma":[0.00007709666,0.00016089245,0.0000200017,0.00017892168,0.00025948946,0.0007417693,0.00003776422,0.00010056083,0.0000014476266],"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.000100591256,0.00003725197,0.004587583,0.00013292789,0.000054450582,8.25711e-7,0.0017727009,0.00023717723,0.016058339,0.93059504,0.000009787548,0.04641334],"study_design_scores_gemma":[0.014460741,0.0017952964,0.18924363,0.0018933928,0.00034517611,0.0001548752,0.0029475666,0.57466,0.059467368,0.1513244,0.0022587955,0.0014487634],"about_ca_topic_score_codex":0.00017321923,"about_ca_topic_score_gemma":0.0000035387761,"teacher_disagreement_score":0.77927065,"about_ca_system_score_codex":0.000028135479,"about_ca_system_score_gemma":0.00007873997,"threshold_uncertainty_score":0.6561004},"labels":[],"label_agreement":null},{"id":"W2009346485","doi":"10.1109/isorc.2007.57","title":"Timed-Automata Semantics and Analysis of UML/SPT Models with Concurrency","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Applications of UML; Computer science; Concurrency; Unified Modeling Language; UML tool; Programming language; Semantics (computer science); Consistency (knowledge bases); Artificial intelligence; Software","score_opus":0.027801960870041945,"score_gpt":0.29752763204413407,"score_spread":0.26972567117409213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009346485","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.034144588,0.000037800055,0.95778775,0.000050137467,0.000037109665,0.000065268585,0.0000017586477,0.000074668,0.007800919],"genre_scores_gemma":[0.46787655,0.000007424808,0.53202385,0.000024547722,0.0000029157409,6.4802913e-7,0.0000014259981,0.0000018334329,0.000060813894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918157,0.000027830989,0.00021903425,0.00020647286,0.00022462607,0.00014044948],"domain_scores_gemma":[0.999161,0.00006891545,0.000110107525,0.00049822836,0.00010623103,0.00005553268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072837184,0.00007457006,0.000174263,0.00024817433,0.000030332143,0.000029946339,0.0003382279,0.000035934445,0.0000077545665],"category_scores_gemma":[0.0000209255,0.000056370034,0.000028079534,0.0011288389,0.000070818794,0.00044532144,0.00009786913,0.000048126367,0.000002055456],"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.000008837338,0.000057808753,0.0039913137,0.000023004251,0.00020189256,0.0000026689477,0.0007272608,0.0014901976,0.00046728124,0.9149251,0.00003639447,0.07806823],"study_design_scores_gemma":[0.00011179015,0.000058118538,0.012078013,0.000005828684,0.00009041151,0.0000036626539,0.000019663074,0.980784,0.0056549534,0.0010665806,0.00004373388,0.00008325034],"about_ca_topic_score_codex":0.00002183648,"about_ca_topic_score_gemma":0.0000137318975,"teacher_disagreement_score":0.9792938,"about_ca_system_score_codex":0.000009741364,"about_ca_system_score_gemma":0.00001982977,"threshold_uncertainty_score":0.22987033},"labels":[],"label_agreement":null},{"id":"W2009536531","doi":"10.1016/j.tcs.2005.09.021","title":"LA, permutations, and the Hajós Calculus","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","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":"McMaster University","funders":"","keywords":"Calculus (dental); Mathematics; Combinatorics; Computer science; Discrete mathematics; Medicine","score_opus":0.008720736149654174,"score_gpt":0.28047096780701675,"score_spread":0.27175023165736256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009536531","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.014391091,0.00007326491,0.9751768,0.0044004465,0.0001913707,0.00013711823,3.715823e-7,0.00011971149,0.0055098366],"genre_scores_gemma":[0.57558626,0.000005358462,0.42371333,0.0006209062,0.000056483277,0.000006847141,7.165441e-8,0.000002214811,0.000008542785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828696,0.0003616984,0.00019648636,0.0004104834,0.0004516297,0.00029275086],"domain_scores_gemma":[0.99854535,0.0005235655,0.000049714985,0.0006526751,0.00010296269,0.00012570739],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004241401,0.000104746665,0.000116140305,0.000084061576,0.0004978755,0.00052414305,0.0017170941,0.000036334222,0.000011132466],"category_scores_gemma":[0.00027196028,0.00006462453,0.000030085033,0.0006215861,0.006578747,0.00080025883,0.0007192545,0.00018728034,0.000058701862],"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.0000044167637,0.000010185577,0.0000042558568,0.0000013290615,9.971358e-7,7.4628895e-7,0.001283264,0.000102582206,0.000034070596,0.81865853,0.000010776867,0.17988886],"study_design_scores_gemma":[0.00031547266,0.000028166098,0.0006969425,0.000005712523,0.0000028924683,0.00008836348,0.000013177445,0.882179,0.001089237,0.11491158,0.00057266647,0.000096753625],"about_ca_topic_score_codex":0.0000024615233,"about_ca_topic_score_gemma":3.5813838e-7,"teacher_disagreement_score":0.88207644,"about_ca_system_score_codex":0.000038795788,"about_ca_system_score_gemma":0.00006593606,"threshold_uncertainty_score":0.9961248},"labels":[],"label_agreement":null},{"id":"W2011156106","doi":"10.1109/cjece.2005.1541753","title":"A new approach for minimization of binary decision diagrams","year":2005,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Binary decision diagram; Minification; Binary number; Variable (mathematics); Computer science; Algorithm; Set (abstract data type); Electronic circuit; Process (computing); Mathematical optimization; Mathematics; Arithmetic; Engineering","score_opus":0.01374406576692733,"score_gpt":0.2215030970420767,"score_spread":0.2077590312751494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011156106","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.007867438,0.0005377959,0.99128056,0.00007122492,0.00015741028,0.000064537606,3.7047718e-7,0.000007199372,0.00001347397],"genre_scores_gemma":[0.1772722,0.000011589818,0.82247764,0.000030248819,0.00019577892,9.4479503e-7,4.583626e-7,0.0000044158583,0.00000670205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993784,0.000012422738,0.0002613207,0.00009839296,0.000087663604,0.00016179014],"domain_scores_gemma":[0.9993222,0.000110706154,0.00008963475,0.00009886312,0.000089909496,0.00028869745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000204576,0.00006963169,0.00014077901,0.0002734276,0.000029961668,0.000048062917,0.00029380328,0.00004565025,0.0000012041065],"category_scores_gemma":[0.000088813154,0.00006352054,0.000049641483,0.00032609198,0.0000069587195,0.00026660215,0.000013580822,0.00009123963,2.2366855e-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.000008038497,0.000012245716,0.00013173741,0.000015361376,0.000014594876,0.0000022992258,0.00017669013,0.11120837,0.00019646056,0.020135107,0.0009881739,0.8671109],"study_design_scores_gemma":[0.0002284862,0.00016244745,0.0027454782,0.000019818886,0.0000052636665,0.00007420431,6.155513e-7,0.9923597,0.00053413195,0.00018804325,0.0036120794,0.00006973258],"about_ca_topic_score_codex":0.000024468985,"about_ca_topic_score_gemma":0.0000060706334,"teacher_disagreement_score":0.8811513,"about_ca_system_score_codex":0.000052882024,"about_ca_system_score_gemma":0.00018720425,"threshold_uncertainty_score":0.25902927},"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":"W2011860366","doi":"10.1108/17440080710848080","title":"Test selection criteria for real‐time systems modeled as timed input‐output automata","year":2007,"lang":"en","type":"article","venue":"International Journal of Web Information Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Automaton; Timed automaton; Selection (genetic algorithm); Test (biology); Real-time operating system; Theoretical computer science; Embedded system; Artificial intelligence","score_opus":0.025308706325255902,"score_gpt":0.33239128571862236,"score_spread":0.3070825793933665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011860366","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.017349735,0.000036807738,0.9667468,0.00021488762,0.008205252,0.00060639915,0.000041788808,0.00018583743,0.0066124694],"genre_scores_gemma":[0.8741317,0.000047249476,0.12355986,0.00012207997,0.0013101132,0.000044174725,0.000049362785,0.00001972245,0.0007157783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617153,0.00012970819,0.0019904359,0.0001523302,0.0012698966,0.00028607945],"domain_scores_gemma":[0.99345374,0.0004283765,0.0021341655,0.0002941792,0.0035328083,0.00015674617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051782895,0.00020108456,0.00033908625,0.0009404409,0.0001231435,0.0010089952,0.0014485618,0.00017029494,0.000007379545],"category_scores_gemma":[0.00092351675,0.00018517849,0.00015027467,0.00038466757,0.000030458876,0.006424315,0.000097331715,0.0001888116,0.00018741263],"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.0018546677,0.00091636006,0.00227796,0.0010355476,0.0016800918,0.000045984383,0.011895059,0.066879265,0.095993266,0.59668607,0.0767969,0.14393885],"study_design_scores_gemma":[0.0011483864,0.0003113239,0.0005617419,0.00019391665,0.000015341002,0.00066040864,0.00020949754,0.94686955,0.001998082,0.00017849982,0.047643848,0.00020937376],"about_ca_topic_score_codex":0.000058259906,"about_ca_topic_score_gemma":5.76243e-7,"teacher_disagreement_score":0.87999034,"about_ca_system_score_codex":0.00058522,"about_ca_system_score_gemma":0.0003332582,"threshold_uncertainty_score":0.9729764},"labels":[],"label_agreement":null},{"id":"W2012205236","doi":"10.1016/j.dam.2013.06.021","title":"Semidefinite resolution and exactness of semidefinite relaxations for satisfiability","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semidefinite programming; Semidefinite embedding; Mathematics; Satisfiability; Transformation (genetics); Resolution (logic); Quadratically constrained quadratic program; Discrete mathematics; Combinatorics; Algorithm; Mathematical optimization; Computer science; Quadratic programming","score_opus":0.024181814076874943,"score_gpt":0.2668779148487238,"score_spread":0.24269610077184886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012205236","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.034898877,0.000030154693,0.957913,0.00011664931,0.00006039236,0.00094572623,0.000015866724,0.000100451536,0.005918887],"genre_scores_gemma":[0.23163183,0.00001349623,0.7679123,0.00003079751,0.000011487255,0.00034393344,0.00001021076,0.000011978256,0.000033952037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872255,0.00003170884,0.000530108,0.00029241754,0.00021209459,0.0002111051],"domain_scores_gemma":[0.9980064,0.00061352534,0.00038727323,0.00077368796,0.00015147014,0.000067655965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072774966,0.0001463833,0.0002526152,0.00008566893,0.000118823256,0.0000761812,0.00035957582,0.00009633936,0.0000087052],"category_scores_gemma":[0.00045235382,0.00013269362,0.00005032916,0.0002753736,0.00012989891,0.0003788978,0.00015983467,0.000091123395,0.000016384722],"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.0000029227956,0.000036820322,0.000048762315,0.0003092624,0.000010458267,2.5513181e-8,0.0013777772,0.000070899434,0.0077979644,0.98354465,0.00010245151,0.006698018],"study_design_scores_gemma":[0.000395079,0.000062876934,0.0033423584,0.00006552525,0.000030318062,0.0000047289013,0.0003511232,0.3025778,0.012888291,0.679717,0.0002846806,0.000280203],"about_ca_topic_score_codex":0.000011178669,"about_ca_topic_score_gemma":0.0000012538221,"teacher_disagreement_score":0.3038276,"about_ca_system_score_codex":0.000030710482,"about_ca_system_score_gemma":0.000029225133,"threshold_uncertainty_score":0.54110885},"labels":[],"label_agreement":null},{"id":"W2012728920","doi":"10.5555/777092.777137","title":"On policy iteration as a Newton's method and polynomial policy iteration algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":16,"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 Alberta","funders":"","keywords":"Markov decision process; Mathematics; Power iteration; Upper and lower bounds; Mathematical optimization; Dynamic programming; Time complexity; Polynomial; Linear programming; Newton's method; Iterative method; Combinatorics; Discrete mathematics; Markov process","score_opus":0.026135473730075055,"score_gpt":0.338646164684744,"score_spread":0.31251069095466893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012728920","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.0025339061,0.000033301272,0.9626981,0.009905772,0.00024481062,0.00025306514,0.000002331123,0.00021573895,0.024112975],"genre_scores_gemma":[0.064309284,0.000038689563,0.9251498,0.0042044464,0.0007468318,0.000033637487,0.000005193412,0.000015725082,0.0054963827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983137,0.00029956212,0.00030274538,0.00048346297,0.00030482654,0.00029567894],"domain_scores_gemma":[0.9989625,0.00013959769,0.00012008858,0.0005523882,0.000081058926,0.00014436364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005357964,0.00019138276,0.0001593563,0.0005425121,0.00021569077,0.00060937344,0.0003736845,0.00011910187,0.00007740433],"category_scores_gemma":[0.0004760102,0.0001753225,0.000048053873,0.0007788932,0.00003716104,0.0014823565,0.0001200825,0.00014755213,0.00019697983],"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.0000065075333,0.000040673996,0.0000061177057,0.000004488879,0.000005437708,0.0000013814625,0.0012231522,0.00010324088,0.0019511861,0.61794245,0.0014441457,0.3772712],"study_design_scores_gemma":[0.000564164,0.0004082967,0.0007150155,0.000014108189,0.0000046753526,0.0000953203,0.000014311686,0.9498676,0.015419463,0.019626033,0.012968644,0.00030234642],"about_ca_topic_score_codex":0.00050674385,"about_ca_topic_score_gemma":0.000004775511,"teacher_disagreement_score":0.9497644,"about_ca_system_score_codex":0.00015264774,"about_ca_system_score_gemma":0.000064600936,"threshold_uncertainty_score":0.7149444},"labels":[],"label_agreement":null},{"id":"W2012888313","doi":"10.1016/j.comnet.2010.05.019","title":"Some notes on the history of protocol engineering","year":2010,"lang":"en","type":"article","venue":"Computer Networks","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"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 Ottawa","funders":"National Physical Laboratory","keywords":"Standardization; Computer science; Conformance testing; Protocol (science); Communications protocol; Software engineering; Telecommunications; Computer network","score_opus":0.026766203610247955,"score_gpt":0.254339065222883,"score_spread":0.22757286161263507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012888313","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.00049776543,0.0000135009,0.9896084,0.00012328778,0.003811161,0.005629655,9.3579004e-8,0.00012048018,0.00019563684],"genre_scores_gemma":[0.0354916,9.3322495e-7,0.9552712,0.000589955,0.0013890908,0.007180968,4.519005e-7,0.000016248601,0.000059571863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923915,0.00005176279,0.00019774516,0.00019530971,0.00014793278,0.00016810151],"domain_scores_gemma":[0.9987078,0.00030265687,0.00011332663,0.0007913446,0.00004608748,0.000038796163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052648335,0.000106693515,0.00010775474,0.000049430884,0.00003117778,0.000031036263,0.0010048274,0.000072695926,0.00000732651],"category_scores_gemma":[0.0000473498,0.00007429807,0.000051655832,0.00011754131,0.000052998083,0.00020601277,0.00020118304,0.00036906148,0.000010119057],"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.0000073913156,0.00006290768,0.00006256467,0.000025426341,0.000012054514,0.0000017755184,0.00031251373,0.05954823,0.0009311167,0.77912605,0.0076116812,0.15229832],"study_design_scores_gemma":[0.00008153926,0.00007497112,0.0009714406,0.000020610509,9.379404e-7,0.000002994724,1.4382896e-7,0.96300626,0.0006894909,0.00053709676,0.034529466,0.000085070824],"about_ca_topic_score_codex":0.000002012366,"about_ca_topic_score_gemma":2.494832e-7,"teacher_disagreement_score":0.903458,"about_ca_system_score_codex":0.000043532804,"about_ca_system_score_gemma":0.000034421773,"threshold_uncertainty_score":0.30297872},"labels":[],"label_agreement":null},{"id":"W2012984207","doi":"10.1007/s00165-014-0323-x","title":"Proof-based verification approaches for dynamic properties: application to the information system domain","year":2014,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Reachability; Computer science; Property (philosophy); Set (abstract data type); Domain (mathematical analysis); Proof of concept; Range (aeronautics); Theoretical computer science; Programming language; Mathematics; Engineering","score_opus":0.02273141283079378,"score_gpt":0.23938017854015237,"score_spread":0.2166487657093586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012984207","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.01829912,0.0000098719875,0.9773069,0.00049983925,0.00024808449,0.001885636,0.0000029283847,0.00021482691,0.0015327937],"genre_scores_gemma":[0.6152011,4.583584e-8,0.38450262,0.00007125501,0.000047317684,0.00015735033,0.0000121589355,0.0000066271855,0.0000014831189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983582,0.00012656528,0.00059640006,0.0002530505,0.0003482722,0.000317542],"domain_scores_gemma":[0.9982863,0.000095947755,0.0005172788,0.00078419084,0.0002576677,0.000058588925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024441127,0.00015886297,0.00019029979,0.00016269747,0.00036050088,0.00014683607,0.001079903,0.000068486115,1.4913218e-7],"category_scores_gemma":[0.00018366461,0.00011867614,0.00007426484,0.0005117594,0.000041616062,0.001098193,0.00014336371,0.000099630306,0.000019536385],"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.00003557759,0.00002604564,0.00001054246,0.0004444403,0.000007837957,1.180081e-8,0.0021952656,0.09225628,0.00055807346,0.6896072,0.000012631478,0.21484607],"study_design_scores_gemma":[0.00028272864,0.00018955498,0.0010663053,0.000084622676,0.000006050285,0.0000033779438,0.0003072165,0.98024493,0.014888313,0.0009854041,0.0017912734,0.00015023336],"about_ca_topic_score_codex":0.000007992255,"about_ca_topic_score_gemma":0.0000022137529,"teacher_disagreement_score":0.8879886,"about_ca_system_score_codex":0.00014960777,"about_ca_system_score_gemma":0.0000762896,"threshold_uncertainty_score":0.48394725},"labels":[],"label_agreement":null},{"id":"W2013029218","doi":"10.1007/s10836-010-5148-9","title":"Defining and Providing Coverage for Assertion-Based Dynamic Verification","year":2010,"lang":"en","type":"article","venue":"Journal of Electronic Testing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; CMC Microsystems (Canada)","funders":"","keywords":"Assertion; Nondeterministic algorithm; Computer science; Programming language; Automaton; Property (philosophy); Key (lock); Code coverage; Theoretical computer science; Algorithm; Software; Computer security","score_opus":0.014214017486795101,"score_gpt":0.2958769194560997,"score_spread":0.28166290196930455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013029218","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.3136696,0.00011057792,0.6857036,0.00016173618,0.00018374599,0.00008864866,2.5357375e-7,0.00002743524,0.000054427033],"genre_scores_gemma":[0.5544883,9.730479e-7,0.445441,0.000030262348,0.000026508773,0.000004624008,3.964373e-7,0.0000052817336,0.0000026568325],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906266,0.000047095804,0.0003422333,0.00014471821,0.00015680198,0.00024650202],"domain_scores_gemma":[0.9982495,0.00067235075,0.00057391194,0.0001743705,0.00028019314,0.000049707734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018644171,0.00008147553,0.000119596276,0.00012269292,0.00016323951,0.00013254612,0.00031872466,0.000052020143,6.424312e-7],"category_scores_gemma":[0.0030558787,0.00007711703,0.00003859535,0.0002388931,0.000019080702,0.00060196064,0.000019537309,0.00037943217,5.4744766e-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.00004536539,0.00007154125,0.0047279624,0.00008395962,0.000022960481,0.0000022061697,0.00023007572,0.004417538,0.39141044,0.22498496,0.000014029427,0.373989],"study_design_scores_gemma":[0.0003933299,0.000383425,0.007802136,0.00004311041,0.000012626181,0.00012276355,0.0000072289777,0.9713351,0.010794888,0.008681653,0.00032083382,0.000102897466],"about_ca_topic_score_codex":0.0000021699575,"about_ca_topic_score_gemma":0.0000036561923,"teacher_disagreement_score":0.9669176,"about_ca_system_score_codex":0.000101103724,"about_ca_system_score_gemma":0.00043590684,"threshold_uncertainty_score":0.3658393},"labels":[],"label_agreement":null},{"id":"W2013085877","doi":"10.1109/tcad.2011.2169259","title":"Maximum Circuit Activity Estimation Using Pseudo-Boolean Satisfiability","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"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":"","keywords":"Boolean satisfiability problem; Computer science; Satisfiability; Combinational logic; Scalability; Robustness (evolution); Algorithm; Formal equivalence checking; Electronic circuit; Boolean circuit; Integrated circuit; Equivalence (formal languages); Grid; Boolean function; Computer engineering; Logic gate; Formal verification; Mathematics; Electrical engineering; Engineering","score_opus":0.08674072348592853,"score_gpt":0.289699180289201,"score_spread":0.20295845680327246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013085877","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.06588949,0.00007931843,0.930415,0.000010954489,0.002488734,0.0007956902,0.000020018933,0.00023771025,0.00006308391],"genre_scores_gemma":[0.8198817,0.000011684303,0.17995127,0.000020547808,0.00005839562,0.000039371596,0.0000013968505,0.000021890322,0.000013780824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966498,0.0010797888,0.00074928015,0.0005563602,0.00048525335,0.00047952513],"domain_scores_gemma":[0.9977249,0.0004307838,0.00043356224,0.0008632321,0.00031189751,0.00023562716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020740747,0.00036684735,0.0005467757,0.0003972069,0.00029868158,0.00022000828,0.0005111218,0.0002430829,0.000007950123],"category_scores_gemma":[0.00002967775,0.00033928177,0.0001204225,0.0007672598,0.00013354022,0.0015124852,0.000005881644,0.00039881797,0.000011880071],"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.000033783723,0.00058808713,0.00011114176,0.00024737522,0.00013714498,0.000002494561,0.0014569964,0.30268508,0.045921627,0.009018342,0.000025961173,0.63977194],"study_design_scores_gemma":[0.00035185606,0.00029906593,0.0006026258,0.0001749838,0.000039292263,0.00013308991,0.000051812516,0.96533686,0.032170843,0.0005020806,0.0000133385465,0.0003241352],"about_ca_topic_score_codex":0.00035377554,"about_ca_topic_score_gemma":0.0000013934675,"teacher_disagreement_score":0.7539922,"about_ca_system_score_codex":0.000300379,"about_ca_system_score_gemma":0.00015392643,"threshold_uncertainty_score":0.99990594},"labels":[],"label_agreement":null},{"id":"W2013515339","doi":"10.1007/s10270-015-0456-2","title":"The Unit-B method: refinement guided by progress concerns","year":2015,"lang":"en","type":"article","venue":"Software & Systems Modeling","topic":"Formal Methods in Verification","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":"York University","funders":"","keywords":"Liveness; Computer science; B-Method; Scheduling (production processes); Formal methods; Unit (ring theory); Refinement calculus; Software; Software engineering; Distributed computing; Theoretical computer science; Programming language; Mathematical optimization; Mathematics","score_opus":0.16013739902685942,"score_gpt":0.38606186704508333,"score_spread":0.2259244680182239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013515339","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.0009600408,0.003723741,0.99161816,0.0003019282,0.0019228535,0.000503377,0.000005229961,0.0005581414,0.00040650406],"genre_scores_gemma":[0.07211839,0.00002184099,0.92682093,0.00009127841,0.00018737676,0.00024809924,0.000008427582,0.000027487391,0.00047615037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971272,0.0006465257,0.00063177897,0.000454809,0.00070936023,0.00043036492],"domain_scores_gemma":[0.99765676,0.00016602484,0.00026664673,0.0011794892,0.00054700667,0.00018406786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047300886,0.00019995013,0.00022938926,0.000052564028,0.000352121,0.000477456,0.0014847126,0.00009680816,4.935738e-7],"category_scores_gemma":[0.00052297296,0.0001427916,0.000056640565,0.00035463786,0.000051739848,0.00046036014,0.00032099444,0.0001879649,0.000027808985],"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.00004372323,0.00011149464,0.0018194894,0.0002243385,0.00015832728,0.000011917159,0.0055450844,0.41771546,0.00023914418,0.29357028,0.03661269,0.24394806],"study_design_scores_gemma":[0.00024230676,0.000047001377,0.0000019453023,0.00006572136,0.000007882837,0.000018752644,0.00031915144,0.96207356,0.0001593289,0.0016886828,0.035181623,0.00019406293],"about_ca_topic_score_codex":0.00033167214,"about_ca_topic_score_gemma":0.000004296685,"teacher_disagreement_score":0.5443581,"about_ca_system_score_codex":0.0001839478,"about_ca_system_score_gemma":0.000191987,"threshold_uncertainty_score":0.5822872},"labels":[],"label_agreement":null},{"id":"W2013754071","doi":"10.1016/j.entcs.2009.07.012","title":"LCF-style Platform based on Multiway Decision Graphs","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Reachability; Automated theorem proving; HOL; Computer science; Set (abstract data type); Product (mathematics); Theoretical computer science; Inference; Rule of inference; Programming language; Artificial intelligence; Mathematics","score_opus":0.01075389753875564,"score_gpt":0.28725173771968154,"score_spread":0.2764978401809259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013754071","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.035675514,0.00003368901,0.96142215,0.00063576223,0.00045403163,0.00027823393,4.7441063e-7,0.00021128962,0.0012888386],"genre_scores_gemma":[0.56149864,0.0000040954087,0.43748173,0.00097456085,0.000028690185,0.0000060532234,4.7970246e-7,0.0000051195384,6.578784e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99589944,0.0001515074,0.00046077475,0.0011005297,0.0011257806,0.0012619722],"domain_scores_gemma":[0.99708486,0.0010123679,0.00010851291,0.0014504679,0.00012678166,0.00021702888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004072575,0.000285513,0.00026563084,0.00065475795,0.00034475542,0.0003654125,0.0035351904,0.0001147922,0.000022240174],"category_scores_gemma":[0.00078052614,0.00024054255,0.00009876468,0.0028544348,0.0010107427,0.0009701898,0.00028728662,0.0006186341,0.00006235638],"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.000030758296,0.00011080002,0.000028914363,0.0000012794803,5.7193495e-7,0.000004279688,0.00008705685,0.0028303564,0.0003302369,0.6946819,0.0000029969406,0.30189088],"study_design_scores_gemma":[0.00032666794,0.0007713388,0.0019268548,0.000035928442,0.0000010239622,0.00000868734,6.0065287e-7,0.61636794,0.011841303,0.36848077,0.000042232074,0.00019664338],"about_ca_topic_score_codex":0.000002274553,"about_ca_topic_score_gemma":0.0000016710648,"teacher_disagreement_score":0.6135376,"about_ca_system_score_codex":0.0004159075,"about_ca_system_score_gemma":0.00030096862,"threshold_uncertainty_score":0.98090404},"labels":[],"label_agreement":null},{"id":"W2014047130","doi":"10.1109/ase.2011.6100090","title":"Using model checking to analyze static properties of declarative models","year":2011,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Waterloo","funders":"","keywords":"Model checking; Computer science; Counterexample; Programming language; Abstract interpretation; Symbolic trajectory evaluation; Interpretation (philosophy); Algorithm; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.4533164947735195,"score_gpt":0.3556494020407554,"score_spread":0.09766709273276408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014047130","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.117865175,0.000015562673,0.8777464,0.0000108482745,0.000033156837,0.0001374415,3.5231326e-7,0.000044788474,0.0041462863],"genre_scores_gemma":[0.48351434,5.5950255e-7,0.51639307,0.000050009017,0.0000017056468,0.0000045449833,3.861846e-8,0.000002799723,0.000032927295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991965,0.000057230092,0.00022952448,0.00019498543,0.00017579489,0.00014591968],"domain_scores_gemma":[0.9993198,0.0000067521178,0.00008388022,0.00038060467,0.0001582067,0.000050786235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003634083,0.00007904834,0.0001245814,0.000114457514,0.000044262077,0.000023950512,0.00047827023,0.00002631941,0.0000036129898],"category_scores_gemma":[0.000040060095,0.00006231622,0.000027283235,0.00031741444,0.000031969943,0.0009666752,0.00015746805,0.000044383585,0.000003812578],"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.000016540434,0.000057182202,0.00003660704,0.000032028576,0.000018356724,4.4050105e-7,0.031704407,0.44267866,0.05428125,0.46629837,0.0000071081777,0.004869041],"study_design_scores_gemma":[0.000030222527,0.000022665885,0.0000216065,0.000019518453,0.000003205798,8.2783515e-7,0.000112651665,0.7507769,0.23667479,0.012270595,4.7694095e-7,0.00006654323],"about_ca_topic_score_codex":0.00011083621,"about_ca_topic_score_gemma":0.0000040956634,"teacher_disagreement_score":0.45402777,"about_ca_system_score_codex":0.00003656099,"about_ca_system_score_gemma":0.00007013361,"threshold_uncertainty_score":0.25411817},"labels":[],"label_agreement":null},{"id":"W2015132157","doi":"10.1016/j.dam.2013.11.015","title":"Counting inequivalent monotone Boolean functions","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid; Compute Canada","keywords":"Mathematics; Monotone polygon; Monotonic function; Combinatorics; Boolean function; Discrete mathematics","score_opus":0.023356769323008897,"score_gpt":0.2614921495457749,"score_spread":0.23813538022276598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015132157","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.015525927,0.000015748556,0.9479787,0.0001579529,0.00016298615,0.00050872285,0.000002082583,0.00027025514,0.03537767],"genre_scores_gemma":[0.19961905,0.0000052199207,0.7996321,0.00012900984,0.000051661555,0.0002410608,0.0000063782886,0.000018446075,0.00029710904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868923,0.000015211924,0.00039114986,0.00028298967,0.00032009088,0.00030135215],"domain_scores_gemma":[0.99867314,0.000072310286,0.00020194433,0.0008855665,0.000077757766,0.000089260604],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042507882,0.0001669538,0.00018656527,0.000079995356,0.00016407632,0.00023951348,0.00068119983,0.0000646119,0.00007891001],"category_scores_gemma":[0.0000624903,0.00014741921,0.000054161075,0.0003053681,0.000052387808,0.00047737695,0.00025728048,0.00014821567,0.0012435993],"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":[8.8496057e-7,0.00006623693,0.000011804161,0.00008655797,0.000018094943,3.6021996e-7,0.0012867857,0.00013720847,0.013670483,0.9719471,0.0011647928,0.011609721],"study_design_scores_gemma":[0.00046600515,0.00006117155,0.0009345158,0.00006284594,0.00003655723,0.000018337423,0.0013863348,0.7692452,0.02253634,0.20020351,0.0043390593,0.00071009906],"about_ca_topic_score_codex":0.000007802262,"about_ca_topic_score_gemma":3.7752324e-7,"teacher_disagreement_score":0.7717436,"about_ca_system_score_codex":0.000047090907,"about_ca_system_score_gemma":0.000021744885,"threshold_uncertainty_score":0.9995341},"labels":[],"label_agreement":null},{"id":"W2015172530","doi":"10.1016/j.tcs.2003.09.013","title":"Metrics for labelled Markov processes","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":309,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Bisimulation; Probabilistic logic; Markov process; Metric (unit); Mathematics; Equivalence (formal languages); Markov chain; Property (philosophy); Markov property; Stochastic process; Discrete mathematics; Markov model; Statistics","score_opus":0.023812914768896423,"score_gpt":0.3019455865412595,"score_spread":0.2781326717723631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015172530","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.001970163,0.000059403737,0.9900077,0.00022866963,0.00084920594,0.00034787232,0.0000011851434,0.00020448313,0.0063313106],"genre_scores_gemma":[0.35730705,0.0000047042927,0.6423322,0.00027552724,0.00003433552,0.000024598205,2.4092503e-7,0.0000055576575,0.000015759166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769545,0.00014668757,0.00027981098,0.0006942222,0.0006094947,0.0005743473],"domain_scores_gemma":[0.99756706,0.0006911971,0.000089228415,0.0008407607,0.0005995613,0.0002121928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004033705,0.00016054786,0.00018220418,0.00026879957,0.00046245818,0.00042649437,0.0024461243,0.00005429101,0.00001749044],"category_scores_gemma":[0.0029974924,0.0001325775,0.000048417667,0.003551433,0.0013186593,0.0008635943,0.00033303036,0.00011729991,0.000032751464],"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.0000043590485,0.000045047345,0.000018511539,0.000025047879,0.0000018777291,7.1458396e-7,0.00014045471,0.000027510385,0.0002339752,0.9713329,0.000049984897,0.02811963],"study_design_scores_gemma":[0.0003401676,0.00029149864,0.00007909861,0.000016821015,0.000005758255,0.000030998635,0.0000056800486,0.52199507,0.059651736,0.4143169,0.0029664538,0.00029980854],"about_ca_topic_score_codex":3.305225e-7,"about_ca_topic_score_gemma":8.989627e-8,"teacher_disagreement_score":0.557016,"about_ca_system_score_codex":0.00006370371,"about_ca_system_score_gemma":0.00031445542,"threshold_uncertainty_score":0.54063535},"labels":[],"label_agreement":null},{"id":"W2015211370","doi":"10.1109/async.2010.25","title":"Formal Verification of an Arbiter Circuit","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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 British Columbia","funders":"","keywords":"Arbiter; Computer science; Formal verification; Formal equivalence checking; Programming language; Computer hardware","score_opus":0.026124951831539095,"score_gpt":0.28949739481358827,"score_spread":0.2633724429820492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015211370","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.24139564,0.0000012259111,0.74046475,0.000033780816,0.000336259,0.00006290727,4.1966882e-7,0.00008099573,0.017624032],"genre_scores_gemma":[0.52620035,3.065061e-7,0.47365507,0.000052527586,0.000022537555,0.000004732991,0.0000013263781,0.0000021351766,0.000060990886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993475,0.000030526997,0.00017730225,0.00016452873,0.00015247862,0.00012763462],"domain_scores_gemma":[0.9989984,0.000016816219,0.00008260557,0.0007676613,0.00008516664,0.000049371964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005696748,0.000053045256,0.00006219654,0.00006588446,0.00003971269,0.000039333027,0.00066159916,0.000056075638,0.000052527354],"category_scores_gemma":[0.000051657436,0.000047317386,0.000022728886,0.00018258658,0.000038481354,0.001654301,0.000055405664,0.00010865772,0.00003760414],"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.0000014179029,0.000031157833,0.00014664105,0.0000040619807,0.0000011613764,1.1849875e-7,0.00022082524,0.0000023974285,0.114662215,0.77371067,0.000012574189,0.11120676],"study_design_scores_gemma":[0.0002333126,0.00015110619,0.071847126,0.0000032913736,0.000003376453,0.000024631338,0.000028776836,0.22554865,0.67485374,0.022545932,0.0045579323,0.00020209998],"about_ca_topic_score_codex":0.000011993241,"about_ca_topic_score_gemma":0.000004463398,"teacher_disagreement_score":0.75116473,"about_ca_system_score_codex":0.0000056688878,"about_ca_system_score_gemma":0.0000249449,"threshold_uncertainty_score":0.19295469},"labels":[],"label_agreement":null},{"id":"W2016647275","doi":"10.1016/j.entcs.2009.06.022","title":"Probabilistic Analysis of Wireless Systems Using Theorem Proving","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Automated theorem proving; Probabilistic logic; Probabilistic analysis of algorithms; Wireless; General Packet Radio Service; GSM; HOL; Theoretical computer science; Distributed computing; Computer network; Programming language; Telecommunications","score_opus":0.014751320193868529,"score_gpt":0.2924607097555175,"score_spread":0.277709389561649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016647275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24858533,0.00007704401,0.750604,0.00006285636,0.00017871629,0.00025299445,5.137398e-7,0.00006993626,0.00016866115],"genre_scores_gemma":[0.77356523,0.0000032718654,0.22634363,0.000049940107,0.000027752996,0.000004847342,4.5482366e-7,0.000004493849,4.0105013e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965134,0.00036707244,0.0006196693,0.0008223982,0.0007770649,0.000900377],"domain_scores_gemma":[0.99781144,0.00047620747,0.00023576045,0.0011246401,0.00023840135,0.000113531576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048399484,0.00020714938,0.00046236717,0.000891855,0.00017404706,0.00025719032,0.0026761226,0.000076631,0.0000038735448],"category_scores_gemma":[0.0004635459,0.00017847595,0.0001080882,0.0070616375,0.0013941873,0.0007341264,0.00033023837,0.00031300273,0.0000017234328],"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.000008072703,0.00007818508,0.00014270276,0.000010701642,0.00001533968,0.0000019102933,0.00030973132,0.042104848,0.0026550866,0.9245874,6.586073e-8,0.030085914],"study_design_scores_gemma":[0.00009326682,0.00023716716,0.001588325,0.000040941188,0.000035612757,0.000011428246,0.0000032909984,0.84613097,0.0054976307,0.14618433,9.5013337e-7,0.00017609009],"about_ca_topic_score_codex":0.000014282618,"about_ca_topic_score_gemma":0.00000197566,"teacher_disagreement_score":0.8040261,"about_ca_system_score_codex":0.000448647,"about_ca_system_score_gemma":0.00041164382,"threshold_uncertainty_score":0.72780377},"labels":[],"label_agreement":null},{"id":"W2016818970","doi":"10.1007/s11390-013-1324-6","title":"Formal Reasoning About Finite-State Discrete-Time Markov Chains in HOL","year":2013,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"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":"Computer science; Markov chain; Theoretical computer science; Markov model; Markov property; Markov process; Variable-order Markov model; Formal verification; HOL; Probabilistic logic; Algorithm; Formal methods; Continuous-time Markov chain; Mathematics; Artificial intelligence; Machine learning; Programming language","score_opus":0.007466908350015211,"score_gpt":0.2520141899348308,"score_spread":0.24454728158481562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016818970","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.28725833,0.00009273518,0.7102475,0.0018146922,0.00029163872,0.00010201966,1.996042e-7,0.00004397322,0.00014891995],"genre_scores_gemma":[0.45931515,0.000036500453,0.5404476,0.00014238062,0.000031391526,0.000003819474,4.6509214e-8,0.0000031574666,0.000019921265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829435,0.00005030914,0.0004871288,0.00027093984,0.00042964416,0.00046761543],"domain_scores_gemma":[0.9985511,0.00007796986,0.00038112572,0.00039697354,0.000482117,0.0001107478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022032566,0.00012429887,0.00024849546,0.0013011559,0.0001662999,0.0002877387,0.0018023755,0.00008559947,0.000004105442],"category_scores_gemma":[0.00030648345,0.0000992176,0.000031328414,0.0020761287,0.00054198777,0.0035335084,0.0006753877,0.00037562952,0.000015697096],"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.0000058955106,0.000045144272,0.0018761625,0.000009494186,0.0000065652916,0.000052813597,0.0006197783,0.00029033274,0.0036288064,0.037802935,0.00013800059,0.9555241],"study_design_scores_gemma":[0.00035728823,0.0004771549,0.016408527,0.000098241064,0.0000021076696,0.00066270406,0.000025557458,0.9643818,0.0045494786,0.012387418,0.0004722355,0.00017749054],"about_ca_topic_score_codex":0.000006602358,"about_ca_topic_score_gemma":0.0000010079588,"teacher_disagreement_score":0.9640915,"about_ca_system_score_codex":0.00007365608,"about_ca_system_score_gemma":0.0001933269,"threshold_uncertainty_score":0.40459764},"labels":[],"label_agreement":null},{"id":"W2016884416","doi":"10.1007/s10817-012-9258-1","title":"Specification and Verification of Concurrent Programs Through Refinements","year":2012,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Formal Methods in Verification","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Programming language; Correctness; Automated theorem proving; Predicate abstraction; Gas meter prover; Predicate (mathematical logic); Predicate transformer semantics; TRACE (psycholinguistics); Proof theory; Proof assistant; Separation logic; Automated proof checking; Theoretical computer science; Model checking; Mathematical proof; Operational semantics; Mathematics; Semantics (computer science)","score_opus":0.04461471312132197,"score_gpt":0.3306390048068866,"score_spread":0.28602429168556465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016884416","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.41013795,0.0015924624,0.58599186,0.0001438164,0.0010911701,0.00017248889,6.7958456e-7,0.00014614855,0.0007234049],"genre_scores_gemma":[0.5760812,0.000105595565,0.42374456,0.000006655809,0.00005054832,0.00000188073,0.0000012860346,0.0000040064233,0.0000042702573],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99873805,0.00012991077,0.0005485727,0.00009846048,0.00031793278,0.00016704548],"domain_scores_gemma":[0.99833465,0.000038033795,0.0010664216,0.00022550306,0.00026486884,0.00007051572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012224673,0.00008624521,0.00017172201,0.000091040434,0.000056618326,0.000050580886,0.00029878962,0.000054799824,0.0000031618174],"category_scores_gemma":[0.00020482732,0.00007265792,0.00004127602,0.00032040433,0.000050279992,0.0013390828,0.000048366288,0.0001252562,0.000002994377],"study_design_candidate":"design_other","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.000045164976,0.0007021028,0.019131266,0.00017596272,0.00014180288,0.0000026973532,0.010970258,0.00009899564,0.06827241,0.30453166,0.0006592055,0.5952684],"study_design_scores_gemma":[0.002026791,0.0009904747,0.5081579,0.0012749971,0.00012743063,0.0007550016,0.0009070005,0.27945858,0.18717939,0.0009371709,0.01762431,0.0005609428],"about_ca_topic_score_codex":0.0000039021384,"about_ca_topic_score_gemma":6.807824e-8,"teacher_disagreement_score":0.5947075,"about_ca_system_score_codex":0.000059438382,"about_ca_system_score_gemma":0.00003670729,"threshold_uncertainty_score":0.29629037},"labels":[],"label_agreement":null},{"id":"W2017164430","doi":"10.5555/1756384.1756391","title":"Simulation of gate circuits in the algebra of transients","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Waterloo","funders":"","keywords":"SIGNAL (programming language); State (computer science); Transient (computer programming); Binary number; Computer science; Algorithm; Process (computing); Electronic circuit; Logic gate; Word (group theory); Theoretical computer science; Mathematics; Arithmetic; Programming language; Engineering; Electrical engineering","score_opus":0.071351994544053,"score_gpt":0.3010094990835833,"score_spread":0.22965750453953032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017164430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14271346,0.000018176994,0.8508697,0.00007820032,0.000051460214,0.000098210694,2.8539364e-7,0.000011036888,0.0061594374],"genre_scores_gemma":[0.9510507,0.0000027742553,0.04886343,0.000052549123,0.0000031646437,0.00000194884,1.5054239e-7,0.0000012304581,0.000024027506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939173,0.00009817317,0.00019137067,0.00008182292,0.00017331465,0.00006356471],"domain_scores_gemma":[0.99948853,0.00011958732,0.0000647753,0.00028193925,0.000037317597,0.000007826694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042170656,0.000032525146,0.000059083504,0.000057009573,0.000010200051,0.0000066532907,0.0004094308,0.00002115463,0.00002347864],"category_scores_gemma":[0.00006572068,0.000022934042,0.0000203027,0.00037417415,0.00002239939,0.0002343722,0.000012067835,0.000033802793,0.000005697773],"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.0000035489097,0.00037159154,0.0018935293,0.000068918016,0.000008503214,0.0000011032358,0.022513827,0.2151899,0.0061281025,0.38735572,0.000047800066,0.36641744],"study_design_scores_gemma":[0.000115541014,0.00003237895,0.014641329,0.000006651962,0.0000010119322,4.1789104e-7,0.000023656876,0.97601736,0.0072749145,0.0018021064,0.000056229954,0.000028377446],"about_ca_topic_score_codex":0.000008706311,"about_ca_topic_score_gemma":0.000001415444,"teacher_disagreement_score":0.8083373,"about_ca_system_score_codex":0.000005490295,"about_ca_system_score_gemma":0.0000028992306,"threshold_uncertainty_score":0.09352231},"labels":[],"label_agreement":null},{"id":"W2017548357","doi":"10.1016/j.ijar.2004.08.001","title":"New directions in fuzzy automata","year":2004,"lang":"en","type":"article","venue":"International Journal of Approximate Reasoning","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":149,"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 Guelph","funders":"","keywords":"Fuzzy logic; Computer science; Theoretical computer science; Automata theory; Automaton; Fuzzy set operations; Mathematics; Fuzzy set; Artificial intelligence","score_opus":0.018934174158185504,"score_gpt":0.31020657705824306,"score_spread":0.29127240290005757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017548357","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.027285615,0.00015368547,0.96405536,0.0013479072,0.0017032782,0.000052524134,7.4370087e-7,0.000057169458,0.0053437017],"genre_scores_gemma":[0.17178832,0.000099514575,0.82782364,0.000054782635,0.00019376035,0.0000016544765,6.448531e-7,0.0000067548567,0.00003092406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986999,0.000046032746,0.00045405267,0.00013852165,0.0005106129,0.00015087167],"domain_scores_gemma":[0.9990925,0.00004210324,0.000375515,0.00017110289,0.00023225129,0.000086516244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000756337,0.00008995329,0.00013656338,0.0003909602,0.0000345992,0.00017989302,0.0011761982,0.000045032848,0.0000068081426],"category_scores_gemma":[0.00034176884,0.00008429087,0.00007590682,0.000333177,0.000017360566,0.00129497,0.00012873294,0.00022854701,0.000011985316],"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.000040419534,0.00013967088,0.00085280207,0.000005549096,0.000062447456,0.00013216713,0.0014299148,0.0057875286,0.00199895,0.7767299,0.000111006826,0.21270968],"study_design_scores_gemma":[0.012525113,0.00067890435,0.086316384,0.0031487802,0.000047541445,0.011575409,0.000635827,0.18623304,0.100209914,0.57644325,0.02083101,0.0013548139],"about_ca_topic_score_codex":0.00007791365,"about_ca_topic_score_gemma":0.000006085068,"teacher_disagreement_score":0.21135487,"about_ca_system_score_codex":0.0003257013,"about_ca_system_score_gemma":0.00024468664,"threshold_uncertainty_score":0.3437282},"labels":[],"label_agreement":null},{"id":"W2017779181","doi":"10.1109/qest.2012.30","title":"On-the-Fly Algorithms for Bisimulation Metrics","year":2012,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; McGill University","keywords":"Bisimulation; Computer science; Heuristics; Algorithm; Markov decision process; Metric (unit); Convergence (economics); Computational complexity theory; Theoretical computer science; Mathematical optimization; Pairwise comparison; Markov process; Mathematics; Artificial intelligence","score_opus":0.13557897731246377,"score_gpt":0.3677328676217773,"score_spread":0.23215389030931355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017779181","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.0012560347,0.000024514899,0.992204,0.0004970765,0.00071528845,0.00023018921,7.307674e-7,0.00009640435,0.0049757217],"genre_scores_gemma":[0.1920781,0.0000011891574,0.8068757,0.0005304073,0.000086907785,0.000029333673,8.5661844e-7,0.000004050278,0.00039346374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993598,0.000051192656,0.0001181029,0.00011297123,0.00017564009,0.0001822853],"domain_scores_gemma":[0.99878347,0.00065545476,0.0000528499,0.0003936781,0.000070517126,0.000044024164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012278602,0.000057222616,0.00004998173,0.00009100993,0.000104897066,0.00005836319,0.0004094294,0.000035108154,0.000014540611],"category_scores_gemma":[0.0006029132,0.000037391892,0.000035405585,0.00049484405,0.000012816094,0.00051590236,0.00004864572,0.00004566429,0.000086020926],"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.0000012353368,0.000021268963,0.000048734626,0.0000016149894,0.0000023286145,1.0011671e-8,0.00009332382,0.00009938629,0.0000399296,0.9194254,0.0011705711,0.07909619],"study_design_scores_gemma":[0.00010678112,0.00006206697,0.0013234965,0.0000017783663,0.0000026801174,0.0000010713334,0.000010086813,0.941633,0.011945542,0.023948021,0.020872813,0.00009268572],"about_ca_topic_score_codex":0.0000025408185,"about_ca_topic_score_gemma":9.7158775e-8,"teacher_disagreement_score":0.94153357,"about_ca_system_score_codex":0.000032061474,"about_ca_system_score_gemma":0.0000094216375,"threshold_uncertainty_score":0.15247971},"labels":[],"label_agreement":null},{"id":"W2018678448","doi":"10.1109/fmcad.2013.6679404","title":"Efficient modular SAT solving for IC3","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":22,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid","keywords":"Computer science; Solver; Modular design; Modulo; Satisfiability modulo theories; Boolean satisfiability problem; Sequence (biology); Parallel computing; Algorithm; Theoretical computer science; Programming language; Mathematics; Discrete mathematics","score_opus":0.02590236693379281,"score_gpt":0.27647829920258005,"score_spread":0.2505759322687872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018678448","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.03582159,0.000022965256,0.9597049,0.00032085448,0.00036545828,0.00033437103,2.139127e-7,0.0001570586,0.0032726037],"genre_scores_gemma":[0.27776775,3.3440287e-7,0.7215231,0.000180088,0.000025023259,0.00006492749,3.8400196e-7,0.0000034893867,0.00043489423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993405,0.000023981725,0.00012647579,0.00020199135,0.00012051016,0.00018656717],"domain_scores_gemma":[0.99933493,0.000058351627,0.000037178146,0.00043095055,0.00009142993,0.000047180223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033690865,0.000059927326,0.00006225485,0.000042794538,0.00008129953,0.000117485084,0.0004772373,0.000030369687,0.00003455036],"category_scores_gemma":[0.00010546183,0.00004929622,0.000037204725,0.00012432298,0.0000157484,0.00019326457,0.000106188934,0.00003394653,0.00026993715],"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.0000013352403,0.00005314085,0.000078209945,0.000023230006,0.0000073848782,2.006355e-7,0.00045299632,0.007461474,0.023670511,0.81183255,0.0016332698,0.1547857],"study_design_scores_gemma":[0.00007901334,0.000026683201,0.0019719035,0.0000031093423,9.483424e-7,0.0000014849056,0.000012882727,0.97960323,0.011994773,0.004857644,0.0013727559,0.00007554282],"about_ca_topic_score_codex":0.000018714862,"about_ca_topic_score_gemma":3.4982753e-7,"teacher_disagreement_score":0.9721418,"about_ca_system_score_codex":0.00002697735,"about_ca_system_score_gemma":0.000013210494,"threshold_uncertainty_score":0.3469586},"labels":[],"label_agreement":null},{"id":"W2020273103","doi":"10.1016/j.knosys.2013.06.017","title":"Model checking epistemic–probabilistic logic using probabilistic interpreted systems","year":2013,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":27,"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":"Computer science; Probabilistic logic; Probabilistic argumentation; Probabilistic CTL; Subjective logic; Probabilistic relevance model; Theoretical computer science; Probabilistic logic network; Epistemic modal logic; Model checking; Artificial intelligence; Probabilistic analysis of algorithms; Description logic; Autoepistemic logic; Multimodal logic","score_opus":0.08759247830217692,"score_gpt":0.31318496739230683,"score_spread":0.2255924890901299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020273103","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.023634361,0.001421096,0.96358204,0.000051184343,0.0037521934,0.0027344131,0.00000948408,0.00081875524,0.0039964914],"genre_scores_gemma":[0.88643146,0.0000014216066,0.11206506,0.000036581016,0.00021383971,0.0007844555,0.000009542871,0.0000610968,0.0003965646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947855,0.0011865707,0.0014209225,0.0011634338,0.0005673273,0.0008762391],"domain_scores_gemma":[0.99535096,0.00046739454,0.0006844472,0.002077891,0.0010839299,0.00033538984],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023198295,0.0005646253,0.00078279333,0.00042078935,0.0003412917,0.0010414728,0.002021853,0.0003502196,0.0000092272785],"category_scores_gemma":[0.0009861196,0.00050912733,0.00019511324,0.0010843882,0.00020909947,0.0009961189,0.0003103388,0.00042966177,0.00047323122],"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.00001599935,0.0002794516,0.00027405718,0.003145634,0.00005360659,0.0000069595562,0.0012805997,0.72115225,0.014352592,0.25760606,0.00034097594,0.001491834],"study_design_scores_gemma":[0.00040373887,0.00009482747,0.0000470786,0.0010944679,0.00003155882,0.000056596113,0.00010001685,0.9938313,0.0003377451,0.0032864364,0.0001198251,0.0005964045],"about_ca_topic_score_codex":0.00037914445,"about_ca_topic_score_gemma":0.000007668909,"teacher_disagreement_score":0.8627971,"about_ca_system_score_codex":0.0012106963,"about_ca_system_score_gemma":0.00056011963,"threshold_uncertainty_score":0.9999955},"labels":[],"label_agreement":null},{"id":"W2020345512","doi":"10.1016/j.scico.2012.02.001","title":"Executable formal specifications of complex distributed systems with CoreASM","year":2012,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Defence Research and Development Canada","funders":"","keywords":"Executable; Computer science; Programming language; Software engineering; Formal methods; Extensibility; Formal verification; Formal specification; Software system; Software","score_opus":0.07390001709856975,"score_gpt":0.2975262949599616,"score_spread":0.22362627786139183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020345512","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.030953385,0.000059084523,0.96757305,0.000045183013,0.00048700214,0.00040249436,0.0000060092875,0.00010412568,0.000369668],"genre_scores_gemma":[0.50863254,9.515597e-7,0.4912973,0.000003248527,0.00003849639,0.000015596554,0.0000040212108,0.0000036081094,0.0000042423694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977645,0.00006686863,0.0004281097,0.00031098607,0.0007653244,0.0006641763],"domain_scores_gemma":[0.9978926,0.00006412158,0.00047557146,0.00084334135,0.00053510367,0.00018923008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019529238,0.00014567864,0.00025931004,0.00024338222,0.00024683983,0.00017449343,0.001657886,0.00003707841,0.0000018142536],"category_scores_gemma":[0.000037303704,0.00011928551,0.000045859942,0.0021508879,0.00079356815,0.002966402,0.0003710727,0.00009605063,0.000004700816],"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.000015898577,0.0004165533,0.0074059563,0.00015606376,0.000021811073,6.8802836e-7,0.0015837393,0.0039754203,0.0074274978,0.8154614,0.00011369779,0.16342129],"study_design_scores_gemma":[0.0004790114,0.00048388285,0.10110867,0.00017342219,0.000019867486,0.00013115695,0.00030464082,0.8714396,0.016298529,0.0002586034,0.008855494,0.00044714415],"about_ca_topic_score_codex":0.000031809803,"about_ca_topic_score_gemma":3.9049047e-7,"teacher_disagreement_score":0.8674642,"about_ca_system_score_codex":0.0000696164,"about_ca_system_score_gemma":0.00013460702,"threshold_uncertainty_score":0.4864322},"labels":[],"label_agreement":null},{"id":"W2023042624","doi":"10.1145/1029894.1029900","title":"Automating comprehensive safety analysis of concurrent programs using verisoft and TXL","year":2004,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Static analysis; Program analysis; Programming language; Operating system","score_opus":0.06460338707399395,"score_gpt":0.33977105443002736,"score_spread":0.27516766735603343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023042624","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.33118877,0.00005740038,0.6684015,0.000017017557,0.00006997004,0.00008916513,8.5772837e-7,0.00007096181,0.0001044081],"genre_scores_gemma":[0.45418596,0.0000040180103,0.5457825,0.00001798899,0.0000033772546,0.0000014123625,0.000001945016,0.0000016957491,0.0000010780742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913746,0.00005674995,0.00028787286,0.00021228308,0.00017479008,0.00013081564],"domain_scores_gemma":[0.9993497,0.000043770426,0.0001632748,0.00027756707,0.00012039813,0.000045294135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021367383,0.00008055121,0.00021054868,0.00014410693,0.00007123525,0.00004971757,0.00022910826,0.000032209795,0.000004051233],"category_scores_gemma":[0.000032983768,0.00007194218,0.00005751364,0.0010032969,0.0000769029,0.0002934186,0.00014646097,0.000052524174,9.533135e-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.000005653207,0.00013369106,0.007610436,0.00008790389,0.00043347347,0.000001985417,0.003136818,0.0233834,0.009331019,0.28988263,8.7795166e-7,0.66599214],"study_design_scores_gemma":[0.00023579836,0.00006117415,0.04913496,0.000028905808,0.00010278048,0.0000048226166,0.00010245017,0.9452802,0.004506855,0.00036526407,0.00006365696,0.00011312693],"about_ca_topic_score_codex":0.00010009404,"about_ca_topic_score_gemma":0.0000061070177,"teacher_disagreement_score":0.9218968,"about_ca_system_score_codex":0.000050736064,"about_ca_system_score_gemma":0.00003329894,"threshold_uncertainty_score":0.29337168},"labels":[],"label_agreement":null},{"id":"W2023163864","doi":"10.1186/s13677-015-0032-x","title":"MapReduce for parallel trace validation of LTL properties","year":2015,"lang":"en","type":"article","venue":"Journal of Cloud Computing Advances Systems and Applications","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Cloud computing; Process (computing); Variety (cybernetics); Execution time; Parallel computing; Distributed computing; Theoretical computer science; Programming language; Artificial intelligence; Operating system","score_opus":0.06970177536661169,"score_gpt":0.3266746498857332,"score_spread":0.2569728745191215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023163864","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.028658235,0.005296962,0.9648507,0.00014931551,0.00048378468,0.00039624094,0.0000014735751,0.00002148806,0.00014176368],"genre_scores_gemma":[0.5640093,0.000042840744,0.43558386,0.000006106907,0.0002984369,0.000024424206,3.9525716e-7,0.000004707414,0.000029955581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988171,0.00008436206,0.000631044,0.00013653135,0.00022142801,0.00010955616],"domain_scores_gemma":[0.99794346,0.000112338595,0.0010047568,0.00021984361,0.0006396293,0.00007994929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012499955,0.00008276613,0.00023032627,0.0000729159,0.00009451574,0.0000764506,0.00040035672,0.00003560007,6.2085405e-8],"category_scores_gemma":[0.00010168905,0.00006645403,0.000048234146,0.00019410913,0.000047772388,0.00042081915,0.000043528245,0.00007567722,5.5793424e-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.00008452052,0.00026952566,0.0005606768,0.0008567114,0.00007331941,5.252997e-7,0.0036354237,0.26053485,0.0077769123,0.5287706,0.00064909045,0.19678779],"study_design_scores_gemma":[0.0019019817,0.0009277013,0.0003650151,0.0006663246,0.00006842577,0.0004281228,0.0024071983,0.7774877,0.027472654,0.024597364,0.16320819,0.0004692977],"about_ca_topic_score_codex":0.000004354597,"about_ca_topic_score_gemma":1.013691e-7,"teacher_disagreement_score":0.53535104,"about_ca_system_score_codex":0.000032034426,"about_ca_system_score_gemma":0.000081216946,"threshold_uncertainty_score":0.27099165},"labels":[],"label_agreement":null},{"id":"W2025670801","doi":"10.1145/1982185.1982531","title":"A proof-based approach to verifying reachability properties","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Reachability; Temporal logic; Gas meter prover; Model checking; Computer science; Path (computing); Automated theorem proving; State (computer science); Property (philosophy); Operator (biology); Linear temporal logic; Proof theory; Sequence (biology); Theoretical computer science; Computation tree logic; Formal verification; Proof of concept; Algorithm; Programming language; Mathematics; Mathematical proof","score_opus":0.1844712782503363,"score_gpt":0.30280452208050124,"score_spread":0.11833324383016494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025670801","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.002329858,0.00005266986,0.92959535,0.00015496214,0.0006455258,0.0015329251,0.00000151106,0.0005732014,0.06511397],"genre_scores_gemma":[0.19094029,6.282398e-7,0.8076519,0.00024558575,0.000046997204,0.00076583965,0.0000038082603,0.00001671999,0.00032823652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972973,0.00033223545,0.00043853102,0.0011817764,0.0003981991,0.00035195317],"domain_scores_gemma":[0.99662906,0.000021555563,0.00017152308,0.0028037222,0.00022084458,0.00015331234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017425006,0.00031368984,0.00034110234,0.00018395123,0.000099161996,0.00023830264,0.002621322,0.00027831926,0.000008042275],"category_scores_gemma":[0.000351777,0.00025105683,0.00012512832,0.00028402652,0.00007801068,0.00027444595,0.0021019983,0.00055887055,0.00005222817],"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.00021538924,0.00241888,0.0005556549,0.0053337817,0.000113709866,0.00000335047,0.02020319,0.021224312,0.0037936487,0.5280057,0.0012188525,0.4169135],"study_design_scores_gemma":[0.00018919427,0.00017884416,0.0011123477,0.00022947951,0.000017098135,0.000004702702,0.000050891256,0.84857583,0.13294163,0.012951957,0.0027194577,0.0010285352],"about_ca_topic_score_codex":0.00028309313,"about_ca_topic_score_gemma":0.0000031924183,"teacher_disagreement_score":0.82735157,"about_ca_system_score_codex":0.00018266571,"about_ca_system_score_gemma":0.0003445598,"threshold_uncertainty_score":0.99999416},"labels":[],"label_agreement":null},{"id":"W2026007917","doi":"10.1145/2228360.2228530","title":"Path directed abstraction and refinement in SAT-based design debugging","year":2012,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"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":"","keywords":"Debugging; Computer science; Abstraction; Window (computing); Path (computing); Overhead (engineering); Spurious relationship; Algorithmic program debugging; Task (project management); Nexus (standard); Domain (mathematical analysis); Parallel computing; Programming language; Algorithm; Embedded system; Operating system","score_opus":0.0535848862172849,"score_gpt":0.29573102899331855,"score_spread":0.24214614277603363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026007917","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.028952677,0.000060936633,0.96920484,0.00012459178,0.00016956832,0.00010664194,9.8321536e-8,0.00019609623,0.0011845316],"genre_scores_gemma":[0.4602308,0.0000022071702,0.53965944,0.00006848795,0.000009247847,0.000010631444,4.606672e-7,0.0000018028545,0.000016897959],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999359,0.00010879636,0.00013335024,0.00012732483,0.000106235115,0.0001653099],"domain_scores_gemma":[0.9996176,0.00008425368,0.000046347956,0.00018746425,0.000017969667,0.00004639777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009146558,0.000057572892,0.000055215387,0.00008293603,0.00003741116,0.0000358688,0.000108658925,0.000030151461,0.0000124753915],"category_scores_gemma":[0.00007145089,0.000050976123,0.000008112343,0.00018485679,0.00001012601,0.00049080676,0.000028265767,0.000058720518,0.000014420334],"study_design_candidate":"design_other","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.000047310234,0.00043770188,0.038015675,0.0000737729,0.000011879133,0.0000037571608,0.0019613048,0.0011854685,0.038291477,0.05660245,0.00079795823,0.86257124],"study_design_scores_gemma":[0.00026529378,0.000039734794,0.39794698,0.000019594254,0.0000025201375,0.000003924176,0.000016409322,0.5648457,0.03540065,0.0003340492,0.0009861963,0.00013900125],"about_ca_topic_score_codex":0.00004939727,"about_ca_topic_score_gemma":0.0000036249974,"teacher_disagreement_score":0.86243224,"about_ca_system_score_codex":0.000054570646,"about_ca_system_score_gemma":0.000017903258,"threshold_uncertainty_score":0.2078746},"labels":[],"label_agreement":null},{"id":"W2027573831","doi":"10.1016/j.tcs.2011.12.016","title":"Encapsulating deontic and branching time specifications","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Deontic logic; Computer science; Modular design; Locality; Temporal logic; Branching (polymer chemistry); Theoretical computer science; Linear temporal logic; Programming language; Modular programming; Epistemology","score_opus":0.045977585765061016,"score_gpt":0.2599045389504922,"score_spread":0.2139269531854312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027573831","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.04487234,0.000018568826,0.94121325,0.000109507295,0.00026720713,0.00012115508,4.0940517e-7,0.00020969666,0.013187851],"genre_scores_gemma":[0.49601868,0.000001388741,0.5038567,0.00008172013,0.000031233238,0.0000026804746,1.2388784e-7,0.0000032013763,0.000004268155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826044,0.00012499762,0.0002609677,0.0005883118,0.0003748837,0.00039041406],"domain_scores_gemma":[0.9986688,0.00013366996,0.000079513375,0.00079647,0.00011911586,0.00020244803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019655905,0.00012961449,0.00013419824,0.00016703464,0.0004842831,0.00028780635,0.0016721146,0.000037493744,0.000047986978],"category_scores_gemma":[0.00018972822,0.00011417437,0.0000283558,0.0008824871,0.0018492314,0.0011750946,0.0007051409,0.00015494025,0.00012636604],"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.0000014055473,0.000019809124,0.000068976144,0.0000027741323,0.0000011722186,0.0000013909737,0.0014188886,0.000004266201,0.001817795,0.9161504,0.0000029938133,0.08051011],"study_design_scores_gemma":[0.00008042004,0.00007697177,0.018683657,0.00001858879,0.0000030582366,0.000050851762,0.000005828409,0.74821985,0.007230646,0.2254257,0.000027471497,0.00017693045],"about_ca_topic_score_codex":0.0000027990939,"about_ca_topic_score_gemma":8.046071e-8,"teacher_disagreement_score":0.7482156,"about_ca_system_score_codex":0.00003258853,"about_ca_system_score_gemma":0.00004909559,"threshold_uncertainty_score":0.681357},"labels":[],"label_agreement":null},{"id":"W2027835414","doi":"10.1109/meco.2013.6601339","title":"pState: A probabilistic statecharts translator","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Probabilistic logic; Computer science; Consistency (knowledge bases); Representation (politics); Programming language; Theoretical computer science; State (computer science); Protocol (science); Formal verification; Formal specification; Formal methods; Power consumption; Software; Code (set theory); Distributed computing; Power (physics); Artificial intelligence","score_opus":0.017661033093629038,"score_gpt":0.25184832954159536,"score_spread":0.23418729644796632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027835414","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.013616194,0.000012642522,0.97584486,0.00068088033,0.00018520647,0.00036307756,4.7164775e-7,0.00034751842,0.008949127],"genre_scores_gemma":[0.1902315,0.0000023401644,0.8087778,0.00021292594,0.000010884692,0.00009143289,5.4492455e-7,0.0000048313063,0.0006677078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921733,0.00005055677,0.00016532306,0.00022090522,0.00015295231,0.00019290567],"domain_scores_gemma":[0.9993275,0.000030967938,0.000033279142,0.0004569968,0.00007597242,0.00007529469],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023005213,0.00007524583,0.00007178674,0.0000453056,0.00004529177,0.00013201202,0.0004879517,0.000030082545,0.00021837559],"category_scores_gemma":[0.000042554944,0.000060000548,0.000024440484,0.00021970202,0.000030565665,0.00085236976,0.000041825035,0.00006293126,0.00083397614],"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.0000015563157,0.00005413916,0.000044403638,0.000026182875,0.0000053086023,0.000001250471,0.0008929544,0.000049748076,0.0035969324,0.7699328,0.0025846898,0.22281004],"study_design_scores_gemma":[0.00038755167,0.00019278913,0.005515329,0.000014648591,0.000004349416,0.00002476407,0.000054007145,0.71279514,0.027052743,0.23647778,0.017025394,0.00045549616],"about_ca_topic_score_codex":0.00004327579,"about_ca_topic_score_gemma":0.0000019159368,"teacher_disagreement_score":0.7127454,"about_ca_system_score_codex":0.00002022472,"about_ca_system_score_gemma":0.000028838665,"threshold_uncertainty_score":0.999944},"labels":[],"label_agreement":null},{"id":"W2028045996","doi":"10.1007/s10009-007-0047-9","title":"A framework for counterexample generation and exploration","year":2007,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":31,"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":"Counterexample; Debugging; Mathematical proof; Computer science; Property (philosophy); Programming language; Theoretical computer science; Model checking; Algorithm; Mathematics; Discrete mathematics","score_opus":0.10448173417546926,"score_gpt":0.36803121669309896,"score_spread":0.2635494825176297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028045996","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.022430697,0.00006265346,0.9708614,0.0041866424,0.0017780554,0.0004105464,0.000026699214,0.00023010609,0.000013220119],"genre_scores_gemma":[0.17403387,0.0000595839,0.82450855,0.00088247634,0.00035987527,0.00010374778,0.000018431056,0.000016066691,0.000017382628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873066,0.000020367539,0.00041744355,0.00029632574,0.0002934184,0.000241784],"domain_scores_gemma":[0.99858266,0.00043062607,0.00009268582,0.0002161177,0.00062022364,0.000057674875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010216143,0.00014248132,0.00014169795,0.00046752318,0.00020605412,0.00034865743,0.0007173965,0.00025969112,0.000005183776],"category_scores_gemma":[0.0011674598,0.00013507486,0.0000856541,0.00017729888,0.000066694585,0.0014170039,0.000027535489,0.00027677973,0.0000040447535],"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.00010053061,0.00004327491,0.000068462105,0.0000043180326,0.00004060657,0.000003171865,0.00015286935,0.000042530348,0.0016337564,0.67517227,0.00013596262,0.32260224],"study_design_scores_gemma":[0.0026133342,0.0016949859,0.0008119663,0.00014668134,0.00003392067,0.00048184805,0.00014722333,0.01716223,0.12914588,0.7588444,0.08836135,0.00055623264],"about_ca_topic_score_codex":5.195879e-7,"about_ca_topic_score_gemma":0.0000037536001,"teacher_disagreement_score":0.322046,"about_ca_system_score_codex":0.00012794735,"about_ca_system_score_gemma":0.00004198514,"threshold_uncertainty_score":0.55081934},"labels":[],"label_agreement":null},{"id":"W2028415656","doi":"10.5555/380921.380927","title":"Model-checking infinite state-space systems with fine-grained abstractions using SPIN","year":2001,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":54,"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":"Model checking; Abstraction model checking; Automaton; Computer science; Class (philosophy); State (computer science); State space; Theoretical computer science; Finite-state machine; Temporal logic; Finite state; Transition system; Algorithm; Mathematics; Artificial intelligence","score_opus":0.09034987645924034,"score_gpt":0.32847594716266465,"score_spread":0.23812607070342431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028415656","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.09359863,0.000020732132,0.8986446,0.00013430533,0.00020279466,0.00018517279,0.0000010760235,0.00028084737,0.0069318465],"genre_scores_gemma":[0.42446354,0.0000049516593,0.57467765,0.000032409287,0.00002249833,0.000010047912,8.666772e-7,0.000009069756,0.0007789859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879205,0.00005809386,0.00026454436,0.00031198302,0.00028191906,0.00029137978],"domain_scores_gemma":[0.99895865,0.00004968022,0.00016378696,0.0005958788,0.00014417508,0.000087849774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045694617,0.0001439092,0.00013978984,0.00015983701,0.00018196253,0.00026628468,0.00039320873,0.000050591978,0.0000071437053],"category_scores_gemma":[0.00003911253,0.000119136654,0.000029619845,0.000541554,0.00003679355,0.0011105353,0.000077092416,0.00015499433,0.000029061266],"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.000011386438,0.00003240079,0.00044124213,0.000016533795,0.000013492159,0.000010003975,0.00042773018,0.9198581,0.0033993735,0.07284621,0.000045525398,0.0028979857],"study_design_scores_gemma":[0.00016043927,0.000037909504,0.0005519262,0.00003269899,0.0000050142094,0.000082846454,0.000059355363,0.9966222,0.0010358471,0.0005464483,0.0006873225,0.00017796199],"about_ca_topic_score_codex":0.00032800698,"about_ca_topic_score_gemma":0.000050757502,"teacher_disagreement_score":0.3308649,"about_ca_system_score_codex":0.00009826811,"about_ca_system_score_gemma":0.00009764613,"threshold_uncertainty_score":0.48582518},"labels":[],"label_agreement":null},{"id":"W2028905856","doi":"10.1016/j.entcs.2009.09.064","title":"Formal Verification and Validation of UML 2.0 Sequence Diagrams using Source and Destination of Messages","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"","keywords":"Promela; Sequence diagram; Computer science; Programming language; Unified Modeling Language; Model checking; Applications of UML; UML tool; Software; Theoretical computer science; Software engineering","score_opus":0.02005992062363393,"score_gpt":0.30380842704577804,"score_spread":0.2837485064221441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028905856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4355108,0.000057989324,0.5641756,0.0000913734,0.000028477167,0.00009657052,1.8669986e-7,0.000016769332,0.000022206978],"genre_scores_gemma":[0.6519042,0.000019557123,0.34804192,0.000021083808,0.000009031535,0.0000015235412,4.3886942e-7,0.0000020862449,1.4024184e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983157,0.00015375276,0.0003577427,0.00040252737,0.00040114083,0.00036912615],"domain_scores_gemma":[0.9989776,0.00024484246,0.00020191922,0.0003610644,0.00015672557,0.000057833786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002890291,0.00011369657,0.00017137904,0.00023127763,0.00011865878,0.0000888816,0.00065310544,0.00005350238,9.124812e-7],"category_scores_gemma":[0.0004437282,0.00010746913,0.000018111008,0.00097617885,0.0011990316,0.0012812187,0.0001936871,0.00014488089,1.9182843e-7],"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.0000068220115,0.000025355044,0.0005001831,0.000011072027,7.7992473e-7,1.5695704e-7,0.00033903267,0.0009972261,0.030000076,0.7377539,2.4192643e-8,0.23036532],"study_design_scores_gemma":[0.00011924709,0.00027149156,0.0083945505,0.000036103156,0.000003031336,0.00001920032,0.0000028016582,0.6722065,0.20339844,0.11546394,6.8530335e-7,0.00008396263],"about_ca_topic_score_codex":0.0000067356605,"about_ca_topic_score_gemma":4.388912e-7,"teacher_disagreement_score":0.67120934,"about_ca_system_score_codex":0.00009149486,"about_ca_system_score_gemma":0.00011630689,"threshold_uncertainty_score":0.44178817},"labels":[],"label_agreement":null},{"id":"W2029447607","doi":"10.1049/ic:20040392","title":"A transformational framework for testing and model checking implicit-invocation systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Programming language; Executable; Model checking; Debugging; Formal methods; Formal verification; Software engineering; Software system; Software","score_opus":0.08553096127345554,"score_gpt":0.3326031716873677,"score_spread":0.24707221041391214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029447607","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.008403014,0.000034876277,0.98985237,0.00028350909,0.00012040108,0.00035794883,0.0000017072575,0.00016470598,0.0007814531],"genre_scores_gemma":[0.36377835,0.0000015552595,0.6360238,0.00008773648,0.000026863714,0.000070822105,0.0000010343829,0.000003742567,0.0000060585335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992997,0.000013301192,0.00021657726,0.00018420808,0.00013568735,0.00015053454],"domain_scores_gemma":[0.99941915,0.0001580971,0.00007312864,0.00018885768,0.000117731004,0.000043031538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050091033,0.0000755138,0.000079597725,0.00005749949,0.00015627811,0.00015977999,0.00021940815,0.00006410877,1.9428565e-7],"category_scores_gemma":[0.0002663876,0.00007040119,0.000018140949,0.00020365363,0.000016518508,0.00082885125,0.000024085683,0.00006571444,0.0000020644993],"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.000001401857,0.00000779494,0.00001702539,0.00004058352,0.0000021442945,2.7243338e-8,0.0007086377,0.0548969,0.0010228136,0.931094,0.0000014236387,0.012207273],"study_design_scores_gemma":[0.00013236605,0.000023976761,0.00026162757,0.000041632487,0.0000020821087,0.000010571988,0.00003112615,0.7907483,0.0015948338,0.20706353,0.000014925228,0.00007502555],"about_ca_topic_score_codex":0.000021401562,"about_ca_topic_score_gemma":6.508537e-7,"teacher_disagreement_score":0.7358514,"about_ca_system_score_codex":0.000060278187,"about_ca_system_score_gemma":0.0000643478,"threshold_uncertainty_score":0.2870877},"labels":[],"label_agreement":null},{"id":"W2029586423","doi":"10.1145/2000378.2000399","title":"Symbolic model checking of probabilistic knowledge","year":2011,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Defence Research and Development Canada","keywords":"Computer science; Probabilistic logic; Model checking; Programming language; Theoretical computer science; Artificial intelligence","score_opus":0.14466195010122507,"score_gpt":0.3110605909897139,"score_spread":0.16639864088848882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029586423","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.010542677,0.000021287025,0.8389878,0.0000050297513,0.00009330997,0.000080661346,1.5009772e-7,0.000088995504,0.15018004],"genre_scores_gemma":[0.46860513,9.813416e-7,0.5311487,0.000009092066,0.0000044901435,0.0000064451156,6.326083e-8,0.0000022676468,0.00022283026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994274,0.000035473662,0.00017665654,0.00016085662,0.00008213049,0.00011747992],"domain_scores_gemma":[0.9993188,0.000017862008,0.00006147515,0.00047523016,0.000092820905,0.000033823126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003762813,0.000057601323,0.00008787287,0.00005824962,0.000024082236,0.000009348517,0.0006109939,0.000032499323,0.000014146853],"category_scores_gemma":[0.00008770583,0.000049050625,0.000028439896,0.00021859272,0.000041093706,0.00027628263,0.0001444986,0.000045751818,0.00003282403],"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.0000011427807,0.000056637156,0.000068713816,0.000023010922,0.0000021818823,8.907801e-8,0.0028060204,0.00011209746,0.0009113042,0.98149604,0.000020765909,0.014501976],"study_design_scores_gemma":[0.000047887643,0.000024445962,0.001357705,0.000009222801,0.00000222871,0.0000018107287,0.000010123941,0.9142687,0.03190087,0.05228337,0.000027804823,0.00006583035],"about_ca_topic_score_codex":0.000010957058,"about_ca_topic_score_gemma":0.000001701839,"teacher_disagreement_score":0.9292127,"about_ca_system_score_codex":0.000017189946,"about_ca_system_score_gemma":0.000048618385,"threshold_uncertainty_score":0.20002264},"labels":[],"label_agreement":null},{"id":"W2029839940","doi":"10.1145/2537948","title":"Approximating Markov Processes by Averaging","year":2014,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Bisimulation; Mathematics; Probabilistic logic; Markov process; Probability measure; Bounded function; Equivalence (formal languages); Markov kernel; Probability distribution; Markov chain; Discrete mathematics; Applied mathematics; Markov model; Variable-order Markov model; Mathematical analysis","score_opus":0.014670643517577537,"score_gpt":0.259922977932267,"score_spread":0.24525233441468944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029839940","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.03210431,0.0001144352,0.9627748,0.003171921,0.00057155226,0.000039076716,1.3061964e-7,0.000015849846,0.0012079203],"genre_scores_gemma":[0.19753978,0.000006294475,0.8019437,0.00032066798,0.000104619365,7.0806414e-7,2.4692987e-8,0.0000036330039,0.00008056246],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991679,0.00013795686,0.00026116156,0.0000677961,0.00026324284,0.00010191703],"domain_scores_gemma":[0.99840754,0.00016373773,0.0005093456,0.00074766716,0.00014014551,0.000031534844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016652404,0.00005127704,0.00009062824,0.00003342482,0.00009775411,0.00010295118,0.0032932716,0.000019704858,0.0000021595324],"category_scores_gemma":[0.006562289,0.00003101582,0.000042016905,0.00023261913,0.000019004827,0.000522577,0.00047312176,0.00016296649,0.0000033093606],"study_design_candidate":"design_other","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.000036939018,0.0002086925,0.008065536,0.00048545192,0.00009068408,0.0000034724305,0.006401401,0.0012595387,0.05067177,0.025184132,0.063027635,0.84456474],"study_design_scores_gemma":[0.0012371613,0.00035985903,0.008436452,0.0007856135,0.00005226356,0.0010264849,0.00021962756,0.32876217,0.33801138,0.23663947,0.0838578,0.00061172777],"about_ca_topic_score_codex":8.043358e-7,"about_ca_topic_score_gemma":8.03036e-8,"teacher_disagreement_score":0.843953,"about_ca_system_score_codex":0.000026223142,"about_ca_system_score_gemma":0.00004029194,"threshold_uncertainty_score":0.78561467},"labels":[],"label_agreement":null},{"id":"W2029940726","doi":"10.1007/s10766-005-0004-8","title":"Embedded Software Verification Using Symbolic Execution and Uninterpreted Functions","year":2006,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Symbolic execution; Programming language; Scalability; Formal verification; Model checking; Embedded software; Software; Key (lock); Computer architecture; Parallel computing; Operating system","score_opus":0.020079579519245598,"score_gpt":0.30113860609930204,"score_spread":0.28105902658005644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029940726","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.08975828,0.00022983828,0.90850306,0.00018267204,0.0010460864,0.00010271549,0.0000014321272,0.00006256689,0.00011335104],"genre_scores_gemma":[0.4592128,0.000009952056,0.5405297,0.000024029681,0.00017777403,0.000003883477,0.000004769025,0.0000063499674,0.00003068751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849474,0.00010625618,0.00056461274,0.00019201697,0.00047344514,0.00016894536],"domain_scores_gemma":[0.99842787,0.00005797147,0.0005992652,0.00018855158,0.0006631279,0.00006320434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005656859,0.0001230043,0.00014584762,0.0003280015,0.00010703081,0.00031460382,0.0006187328,0.00006979914,0.0000054331686],"category_scores_gemma":[0.00018092128,0.00011985719,0.00008733545,0.00023743359,0.00007081986,0.001210937,0.000097079355,0.00018636003,0.0000046239825],"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.00029021595,0.00058427284,0.013101359,0.00004926466,0.0003883401,0.00010935874,0.002554805,0.025984207,0.030748513,0.15799503,0.00053003983,0.7676646],"study_design_scores_gemma":[0.0037878223,0.00069420546,0.060997594,0.0006260607,0.0001725889,0.0045979293,0.0008421474,0.8602654,0.007553613,0.025417777,0.03389139,0.001153478],"about_ca_topic_score_codex":0.000047212357,"about_ca_topic_score_gemma":0.0000030577537,"teacher_disagreement_score":0.8342812,"about_ca_system_score_codex":0.0001652214,"about_ca_system_score_gemma":0.00007805191,"threshold_uncertainty_score":0.48876342},"labels":[],"label_agreement":null},{"id":"W2030654258","doi":"10.1145/940071.940083","title":"Evaluating and improving the automatic analysis of implicit invocation systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Model checking; Invocation; Distributed computing; Software system; Focus (optics); Programming language; Event (particle physics); Abstraction model checking; Software; State (computer science); Architectural style; Software engineering; Architecture","score_opus":0.07211482217990091,"score_gpt":0.3668339019643182,"score_spread":0.2947190797844173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030654258","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.24637155,0.000086853564,0.7524299,0.000019301651,0.000068479094,0.00012761717,1.4409163e-7,0.000035907975,0.0008602553],"genre_scores_gemma":[0.6500732,0.0000013411732,0.34986708,0.000019523817,0.000002596015,0.000013324391,2.3290912e-7,0.0000014390448,0.000021314407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990101,0.00030074394,0.00025902977,0.00015306978,0.00019131534,0.00008575933],"domain_scores_gemma":[0.9990144,0.00020065412,0.00018885866,0.0004835528,0.00009380688,0.000018727244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027245872,0.000050176346,0.00011332076,0.00012676159,0.00008290153,0.000086123415,0.0002493559,0.000022570435,0.00000385511],"category_scores_gemma":[0.00050079345,0.00003275589,0.000027487426,0.0009530401,0.000023655182,0.00025011608,0.000045627905,0.000035752233,0.0000012232852],"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":[3.599478e-7,0.000012300789,0.001998851,0.000059458467,0.000115385665,4.6568474e-8,0.0013216523,0.004784091,0.018333977,0.855488,0.0000047762896,0.117881104],"study_design_scores_gemma":[0.00003689825,0.000022136108,0.01788096,0.0000044844833,0.00008473343,0.0000022847717,0.00016692867,0.9786367,0.0027035254,0.0004171027,0.0000047421167,0.00003952205],"about_ca_topic_score_codex":0.000115107076,"about_ca_topic_score_gemma":0.0000037310824,"teacher_disagreement_score":0.9738526,"about_ca_system_score_codex":0.00002265063,"about_ca_system_score_gemma":0.000028732922,"threshold_uncertainty_score":0.13357463},"labels":[],"label_agreement":null},{"id":"W2030960287","doi":"10.5555/2755753.2757138","title":"Automated rectification methodologies to functional state-space unreachability","year":2015,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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":"","keywords":"Computer science; Reachability; Debugging; State (computer science); Automation; State space; Set (abstract data type); Process (computing); Task (project management); Model checking; Formal verification; Algorithm; Programming language; Mathematics; Systems engineering; Engineering","score_opus":0.16544397693952215,"score_gpt":0.3432234632103538,"score_spread":0.17777948627083165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030960287","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.030941974,0.000056691668,0.96540344,0.0007218259,0.0004240131,0.0004472271,0.000002900876,0.0015108685,0.0004910566],"genre_scores_gemma":[0.11815757,0.00001503333,0.8814351,0.00013291856,0.000024604182,0.00006378988,0.000008240589,0.000012738731,0.00014999582],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9972801,0.0012735584,0.0004151029,0.000503246,0.00029949908,0.00022847309],"domain_scores_gemma":[0.99713635,0.0013853002,0.00015917535,0.0005662282,0.00060724403,0.00014568395],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.004868912,0.00016401299,0.00018009543,0.00027876536,0.00010886835,0.00018733252,0.00037832218,0.00006413881,0.0000033560536],"category_scores_gemma":[0.012738395,0.00015552285,0.000015187816,0.0016678153,0.000068720845,0.0008678912,0.000117519194,0.00011859456,0.00008028203],"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.00031499556,0.00095525105,0.049061947,0.00023545031,0.0000650765,0.000029371802,0.035950974,0.12001244,0.0573154,0.23376086,0.03566845,0.46662977],"study_design_scores_gemma":[0.00033396372,0.00026737672,0.5149697,0.000020308655,0.000004551282,0.00002496146,0.000072282615,0.46336803,0.008690034,0.009202548,0.0027743615,0.00027184922],"about_ca_topic_score_codex":0.000049135404,"about_ca_topic_score_gemma":0.0000071668705,"teacher_disagreement_score":0.46635792,"about_ca_system_score_codex":0.00012710401,"about_ca_system_score_gemma":0.00018698694,"threshold_uncertainty_score":0.99557775},"labels":[],"label_agreement":null},{"id":"W2031034024","doi":"10.3166/jesa.43.589-614","title":"Approximation garantie de l'espace d'état atteignable des systèmes dynamiques continus incertains. Encadrement par intervalle de flot d'état","year":2009,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics","score_opus":0.035859371102283856,"score_gpt":0.29445923377043853,"score_spread":0.25859986266815466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031034024","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.15667658,0.018878927,0.81600046,0.0022079987,0.0017388334,0.0008200599,0.000017004739,0.00059961964,0.0030605355],"genre_scores_gemma":[0.45888382,0.0031332518,0.5337636,0.0004969902,0.0004998087,0.000039731294,0.000007036434,0.000084288884,0.0030914708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9895568,0.0040601008,0.0021449132,0.0009130301,0.0012509987,0.0020741753],"domain_scores_gemma":[0.9948081,0.00035346154,0.0018422824,0.0010636033,0.0011113599,0.00082122727],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0067996,0.0009204623,0.0011156444,0.0006068037,0.0015606144,0.0030760395,0.0022049588,0.00044199024,0.00014668146],"category_scores_gemma":[0.0016117244,0.0009220226,0.0005044892,0.001213371,0.00073968904,0.0041616308,0.0003511744,0.001231895,0.00017767218],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016788367,0.00074043917,0.0033555767,0.0021867156,0.00034805952,0.00063843664,0.021035725,0.007831034,0.01011279,0.057222378,0.00487069,0.8914903],"study_design_scores_gemma":[0.001101862,0.0013335189,0.26633132,0.005074113,0.00019115559,0.0051934184,0.0008289114,0.6568315,0.006626903,0.052673317,0.002850781,0.0009631794],"about_ca_topic_score_codex":0.00041117056,"about_ca_topic_score_gemma":0.000060151535,"teacher_disagreement_score":0.89052707,"about_ca_system_score_codex":0.0039405306,"about_ca_system_score_gemma":0.00096401206,"threshold_uncertainty_score":0.9998832},"labels":[],"label_agreement":null},{"id":"W2034102118","doi":"10.1145/990010.990011","title":"Multi-valued symbolic model-checking","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Software Engineering and Methodology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":188,"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":"","keywords":"Model checking; Computer science; CTL*; Computation tree logic; Theoretical computer science; Generalization; Kripke structure; Symbolic trajectory evaluation; Abstraction model checking; Class (philosophy); Temporal logic; Extension (predicate logic); Algorithm; Programming language; Artificial intelligence; Mathematics","score_opus":0.153068929282084,"score_gpt":0.34476235356119034,"score_spread":0.19169342427910635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034102118","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.0048210174,0.0001561692,0.9936835,0.000029477063,0.0006603024,0.000110036424,0.0000019919457,0.0005229053,0.00001459115],"genre_scores_gemma":[0.02937076,0.000073148105,0.9702734,0.00011527309,0.000010683296,0.00005001451,5.15514e-7,0.00002132489,0.000084918924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986447,0.00033299153,0.00021910202,0.0003929144,0.00011053112,0.0002997348],"domain_scores_gemma":[0.9985283,0.00054663635,0.000044624794,0.00072828034,0.000045830988,0.000106308486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001316452,0.00017905785,0.00022980876,0.00022836402,0.00014009586,0.000034452736,0.00039472387,0.00015457101,0.0000049894775],"category_scores_gemma":[0.0019502031,0.00018508562,0.00006556287,0.00030278464,0.000034172022,0.00022635677,0.000012073854,0.0003251522,0.0000067627884],"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.00001356667,0.00011614282,0.00006414621,0.00008457895,0.00008624662,0.000006141932,0.002275815,0.70824534,0.008840775,0.14364566,0.000007039942,0.13661455],"study_design_scores_gemma":[0.00048407287,0.0000849484,0.00050413556,0.00002652259,0.000027458058,0.00012461927,0.000028265094,0.9607433,0.034095403,0.0027027528,0.0008280523,0.00035047822],"about_ca_topic_score_codex":0.0000056705658,"about_ca_topic_score_gemma":6.7269906e-7,"teacher_disagreement_score":0.25249794,"about_ca_system_score_codex":0.000038376515,"about_ca_system_score_gemma":0.000034364508,"threshold_uncertainty_score":0.7547572},"labels":[],"label_agreement":null},{"id":"W2034609074","doi":"10.1093/logcom/exn062","title":"Model Checking Using Description Logic","year":2008,"lang":"en","type":"article","venue":"Journal of Logic and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Model checking; Programming language; Algorithm","score_opus":0.2584475929139776,"score_gpt":0.3542187284267333,"score_spread":0.09577113551275568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034609074","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.25742555,0.00015211514,0.74198484,0.000070128255,0.00016803762,0.000029540655,6.546306e-8,0.000014139336,0.00015559349],"genre_scores_gemma":[0.50670785,0.00003527536,0.49312505,0.00008860081,0.00003685769,1.6663343e-7,1.3330856e-7,0.0000015111677,0.000004551118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992251,0.00007840146,0.00030407042,0.00009737861,0.00020296266,0.00009208609],"domain_scores_gemma":[0.9992801,0.00002551858,0.0003834566,0.000067056295,0.00019989641,0.00004399799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005006979,0.000066441404,0.00012179548,0.00012060514,0.00014226467,0.000051395673,0.00015879347,0.000044569562,6.015276e-7],"category_scores_gemma":[0.00004959069,0.000055099277,0.000038999213,0.0001635032,0.000037465303,0.000894234,0.000039469815,0.000113786504,9.882042e-7],"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.000033334032,0.00009536426,0.0012931747,0.000025747366,0.000019583638,0.00004107882,0.0025533573,0.8147697,0.012626713,0.10960623,0.00010930732,0.058826454],"study_design_scores_gemma":[0.00017009978,0.00009406623,0.0035996852,0.000015978707,0.0000056580616,0.00068508805,0.000029543147,0.9253618,0.0002318805,0.06974013,0.0000070876563,0.000058967893],"about_ca_topic_score_codex":0.0000018159927,"about_ca_topic_score_gemma":7.2553796e-8,"teacher_disagreement_score":0.24928232,"about_ca_system_score_codex":0.0000550961,"about_ca_system_score_gemma":0.000054693293,"threshold_uncertainty_score":0.22468834},"labels":[],"label_agreement":null},{"id":"W2035375594","doi":"10.1109/somet.2013.6645657","title":"A probabilistic verification framework of SysML activity diagrams","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Systems Modeling Language; Correctness; Probabilistic logic; Computer science; Activity diagram; Programming language; Probabilistic automaton; Model checking; Formal verification; Unified Modeling Language; Theoretical computer science; Prism; Algorithm; Artificial intelligence; Software","score_opus":0.023805263103604528,"score_gpt":0.28170215834455326,"score_spread":0.2578968952409487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035375594","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.12722115,0.00000941509,0.8691903,0.00024367927,0.00019898725,0.00033795636,2.9459702e-7,0.00012770841,0.0026705316],"genre_scores_gemma":[0.53662276,0.0000021473445,0.46322188,0.000024938545,0.00001129429,0.00006342375,2.7540597e-7,0.0000025696681,0.00005070328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991234,0.000111501184,0.00018346557,0.00023909619,0.00019790488,0.00014464484],"domain_scores_gemma":[0.9986711,0.00016123327,0.00013250782,0.0008381452,0.00014566524,0.00005131635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034343626,0.00007881112,0.00011332726,0.000048363738,0.000039388433,0.00006699213,0.00059290556,0.00007697929,0.000058999645],"category_scores_gemma":[0.0005609749,0.00006635912,0.000036208396,0.00039452128,0.00006198099,0.0007293652,0.00009041421,0.00010403116,0.00016020957],"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.0000019529703,0.00009768682,0.00032768314,0.000038927083,0.0000046969676,7.4061475e-8,0.00025856908,0.00004408979,0.005754025,0.83508974,0.000100655554,0.15828188],"study_design_scores_gemma":[0.00013223331,0.00017521884,0.20005712,0.000051109422,0.0000073518668,0.0000046250466,0.000033092383,0.4975067,0.07892939,0.22245452,0.00035396358,0.00029467887],"about_ca_topic_score_codex":0.00009181776,"about_ca_topic_score_gemma":0.0000011150735,"teacher_disagreement_score":0.61263525,"about_ca_system_score_codex":0.00003725126,"about_ca_system_score_gemma":0.00003067084,"threshold_uncertainty_score":0.27060464},"labels":[],"label_agreement":null},{"id":"W2035868375","doi":"10.1016/j.scico.2014.10.008","title":"Model checking of concurrent programs with static analysis of field accesses","year":2014,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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; Thread (computing); Heap (data structure); Tree traversal; Partial order reduction; Programming language; Java; Static analysis; Model checking; Distributed computing","score_opus":0.04364811075380737,"score_gpt":0.3294716491577327,"score_spread":0.2858235384039253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035868375","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.16029218,0.000012618232,0.8392485,0.000028264172,0.00010043765,0.00019519163,3.725531e-7,0.0000394861,0.00008297685],"genre_scores_gemma":[0.50355387,0.0000011511636,0.49642125,0.00000806641,0.0000049966784,0.0000071029517,5.9172055e-7,0.0000021816134,8.174433e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790895,0.00006474711,0.00051916746,0.00040228522,0.00079791446,0.00030692352],"domain_scores_gemma":[0.9978813,0.00012826605,0.0006533017,0.0006704257,0.0005885541,0.00007816767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017855209,0.00012788954,0.0003970178,0.0005552621,0.00007552579,0.00011832723,0.0017416499,0.00003109158,7.5486355e-7],"category_scores_gemma":[0.00010202362,0.00010169338,0.00009159253,0.004092526,0.00057306647,0.0008927738,0.0003403469,0.0000834615,1.7565237e-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.000004296728,0.00012430406,0.00236151,0.00012963847,0.000047424626,1.5985418e-7,0.0014096007,0.030262956,0.001215269,0.053105906,7.674965e-7,0.91133815],"study_design_scores_gemma":[0.00011846965,0.00051658205,0.0012323966,0.00010451239,0.00006715858,0.0000010881137,0.000029859568,0.9580597,0.039261885,0.00047357794,0.000023834888,0.000110896224],"about_ca_topic_score_codex":0.000029890534,"about_ca_topic_score_gemma":0.0000054277366,"teacher_disagreement_score":0.9277968,"about_ca_system_score_codex":0.000020522673,"about_ca_system_score_gemma":0.0001649329,"threshold_uncertainty_score":0.4146936},"labels":[],"label_agreement":null},{"id":"W2036054690","doi":"10.3166/jesa.42.1111-1134","title":"Testing duration systems","year":2008,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Duration (music); Computer science; Physics; Acoustics","score_opus":0.09564162590998955,"score_gpt":0.30033703070516793,"score_spread":0.2046954047951784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036054690","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.08277089,0.022195306,0.86583585,0.0006031712,0.014278628,0.0004664716,0.000009945013,0.00055286265,0.0132868895],"genre_scores_gemma":[0.2476637,0.00082708074,0.7375641,0.000108708235,0.0019333437,0.000017321128,0.0000019651436,0.00007714869,0.01180667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99354434,0.002140979,0.001812235,0.0005083296,0.0011128932,0.00088121864],"domain_scores_gemma":[0.9953471,0.00045961663,0.001682791,0.0007618036,0.0013001252,0.0004485541],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030328208,0.0004432557,0.00056167867,0.00035611857,0.0017868865,0.0014876085,0.0012325338,0.0002437873,0.000059114194],"category_scores_gemma":[0.0031123217,0.00043792307,0.00019082855,0.0015528775,0.00048118952,0.004129026,0.00025119077,0.0008375372,0.0009179341],"study_design_candidate":"design_other","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.000014306461,0.00023331262,0.0041064178,0.00091118476,0.00014979987,0.0019428018,0.0058658123,0.008344895,0.0033979292,0.10687167,0.010181756,0.85798013],"study_design_scores_gemma":[0.00031894597,0.00032926296,0.30265963,0.0012313263,0.00004101195,0.0627659,0.00008178766,0.6206805,0.00027078672,0.0016126084,0.009603929,0.00040428338],"about_ca_topic_score_codex":0.00019725757,"about_ca_topic_score_gemma":0.0000024535366,"teacher_disagreement_score":0.85757583,"about_ca_system_score_codex":0.0007745124,"about_ca_system_score_gemma":0.0006704639,"threshold_uncertainty_score":0.99986},"labels":[],"label_agreement":null},{"id":"W2036901448","doi":"10.1007/978-3-642-02777-2_38","title":"Beyond CNF: A Circuit-Based QBF Solver","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":31,"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":"Conjunctive normal form; Boolean satisfiability problem; Computer science; True quantified Boolean formula; Solver; Satisfiability; Representation (politics); Theoretical computer science; DPLL algorithm; Algorithm; Programming language","score_opus":0.027845319325573346,"score_gpt":0.26944593295650254,"score_spread":0.2416006136309292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036901448","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.000012524614,0.00037280025,0.97390556,0.00057822687,0.0023931246,0.0004677121,0.0000045109205,0.0003277494,0.021937797],"genre_scores_gemma":[0.016184192,0.00001551782,0.9785078,0.0042263456,0.00050230493,0.000012619221,0.000006771335,0.00003973309,0.00050471677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99478734,0.000078362136,0.0007083885,0.0019999368,0.0015137275,0.0009122446],"domain_scores_gemma":[0.9959344,0.00041313228,0.00044463665,0.0026155633,0.00033570713,0.00025653906],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018095819,0.0006797721,0.0006197993,0.0011339677,0.0003228488,0.000704436,0.005551145,0.00051937095,0.000039554423],"category_scores_gemma":[0.00019863056,0.00065482495,0.00021199122,0.0009825835,0.0008152305,0.0009576813,0.00072171737,0.0011256767,0.00012709257],"study_design_candidate":"design_other","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.0000040961268,0.00003303937,0.000013291634,0.000025391677,0.0000050156077,0.000036548812,0.00024986852,0.01581437,0.00019957793,0.1073663,0.000031749893,0.87622076],"study_design_scores_gemma":[0.0002875059,0.00024454482,0.0002377492,0.0002293874,0.000008925521,0.000045809007,4.452473e-8,0.58924514,0.0035821015,0.40101427,0.004261038,0.0008434908],"about_ca_topic_score_codex":0.000010339301,"about_ca_topic_score_gemma":0.000018200071,"teacher_disagreement_score":0.87537724,"about_ca_system_score_codex":0.0005124652,"about_ca_system_score_gemma":0.00090556766,"threshold_uncertainty_score":0.9998293},"labels":[],"label_agreement":null},{"id":"W2037696440","doi":"10.1145/2641483.2641522","title":"Verification and Code Generation for Timed Transitions in pCharts","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Nondeterministic algorithm; Computer science; Executable; Probabilistic logic; Automaton; Code (set theory); Code generation; Programming language; Theoretical computer science","score_opus":0.11095474914313706,"score_gpt":0.3072950297213098,"score_spread":0.1963402805781727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037696440","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.062376514,0.000022893599,0.9358634,0.0008512773,0.00009266938,0.00024333208,0.0000031396228,0.00005832259,0.00048847066],"genre_scores_gemma":[0.41017362,0.000015131167,0.58949,0.00010687965,0.000021638041,0.00006855458,0.000009584399,0.000002399724,0.00011222128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994845,0.000038585535,0.00013741192,0.00018715952,0.000066165216,0.00008618374],"domain_scores_gemma":[0.99968934,0.000019010398,0.00002702766,0.00019616523,0.000042186246,0.000026257028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025313985,0.0000459049,0.00005425703,0.00007205321,0.00010024028,0.000022061307,0.00010630515,0.000034924047,0.000004001368],"category_scores_gemma":[0.000034679975,0.00004644167,0.0000127098865,0.00014777671,0.000026149182,0.00044313318,0.000008398258,0.00002941758,0.0000057452553],"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.000014658877,0.00012460515,0.00033052577,0.000019948891,0.000005371081,0.0000015186185,0.005415335,0.00048113067,0.16465129,0.77143687,0.0017338847,0.055784885],"study_design_scores_gemma":[0.00028690585,0.00004056323,0.007195044,0.0000024639617,0.0000013053728,0.00001621586,0.000013762031,0.9586663,0.030665735,0.0011542976,0.0018745455,0.000082821905],"about_ca_topic_score_codex":0.0000041117496,"about_ca_topic_score_gemma":0.00002056358,"teacher_disagreement_score":0.9581852,"about_ca_system_score_codex":0.000020707423,"about_ca_system_score_gemma":0.000021701924,"threshold_uncertainty_score":0.18938363},"labels":[],"label_agreement":null},{"id":"W2038078821","doi":"10.1007/s11334-008-0064-1","title":"Extending statecharts with process algebra operators","year":2008,"lang":"en","type":"article","venue":"Innovations in Systems and Software Engineering","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Process calculus; Computer science; Notation; Process (computing); Communicating sequential processes; Semantics (computer science); Theoretical computer science; Operational semantics; Algebra over a field; Domain (mathematical analysis); Algebraic semantics; Programming language; Mathematics; Arithmetic","score_opus":0.018667884625640042,"score_gpt":0.24778122165339572,"score_spread":0.2291133370277557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038078821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35301238,0.00010464704,0.6463738,0.000007975907,0.00017663334,0.00011988036,9.122722e-7,0.00018262483,0.000021138698],"genre_scores_gemma":[0.7418327,0.0000090432995,0.25802281,0.000012176387,0.000021302585,0.00007651369,0.0000015479295,0.000010030139,0.000013886137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916494,0.000014463468,0.00026298116,0.00021680322,0.00015935671,0.00018143062],"domain_scores_gemma":[0.9995143,0.00004147838,0.000054752607,0.00023485214,0.00012383758,0.000030784115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003247646,0.00010820914,0.00012745967,0.0003157258,0.00011216458,0.000078946585,0.00019710396,0.000044272078,5.9054634e-7],"category_scores_gemma":[0.00013836924,0.00009787114,0.000006239809,0.0012970617,0.000020444515,0.00073192455,0.000037349466,0.00013193762,0.0000013298337],"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.0000073901747,0.00008459768,0.11538706,0.0006075347,0.000045796096,0.00013776321,0.0089337,0.21475232,0.000984436,0.64663553,0.00009926963,0.012324628],"study_design_scores_gemma":[0.0013282406,0.00024938458,0.122826576,0.0010958211,0.0000067223064,0.0014842602,0.0005200462,0.85830283,0.0040173326,0.000272387,0.008342597,0.0015537756],"about_ca_topic_score_codex":0.00001531489,"about_ca_topic_score_gemma":5.326032e-7,"teacher_disagreement_score":0.64636314,"about_ca_system_score_codex":0.00004668306,"about_ca_system_score_gemma":0.0000384187,"threshold_uncertainty_score":0.39910692},"labels":[],"label_agreement":null},{"id":"W2038514592","doi":"10.1007/s00607-015-0445-x","title":"Specification, verification, and quantification of security in model-based systems","year":2015,"lang":"en","type":"article","venue":"Computing","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":"Concordia University","funders":"","keywords":"Computer science; Systems Modeling Language; Correctness; Unified Modeling Language; Software security assurance; Software engineering; Modeling language; Computer security model; Computer security; Security testing; Software; Systems engineering; Security information and event management; Information security; Programming language; Security service; Cloud computing security; Engineering; Operating system","score_opus":0.0877375456571489,"score_gpt":0.32004104581729464,"score_spread":0.23230350016014573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038514592","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.10349501,0.00025888934,0.895138,0.00011372942,0.00024260723,0.00020715794,0.0000010150029,0.00007676456,0.00046679634],"genre_scores_gemma":[0.73849833,0.0000033832932,0.2614463,0.0000127515,0.000020337924,0.0000059441354,0.000004422706,0.0000050363337,0.000003478411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986018,0.00019039598,0.00049181207,0.00033866492,0.00023280377,0.00014454877],"domain_scores_gemma":[0.9985642,0.0000845636,0.00030703022,0.0006459234,0.00032608837,0.00007221951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019351911,0.00009424755,0.00016108176,0.00018094729,0.00004910775,0.000075439464,0.0004725301,0.00006234999,1.8281357e-7],"category_scores_gemma":[0.00029508545,0.000103262406,0.000016880793,0.00056247145,0.00006500102,0.00031741924,0.00007344808,0.00009715164,0.000004830921],"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.000015677275,0.00014967243,0.007941957,0.0001565133,0.0000047861913,6.276078e-7,0.005235096,0.3419218,0.004779843,0.6263225,0.00013078866,0.01334075],"study_design_scores_gemma":[0.0002308857,0.00001809672,0.0064197863,0.000040303366,0.0000016914075,0.000002367951,0.00013556902,0.984936,0.0050822217,0.0029184134,0.00011404611,0.00010063095],"about_ca_topic_score_codex":0.000033145076,"about_ca_topic_score_gemma":0.000001386135,"teacher_disagreement_score":0.6430142,"about_ca_system_score_codex":0.00007876236,"about_ca_system_score_gemma":0.00012098334,"threshold_uncertainty_score":0.42109188},"labels":[],"label_agreement":null},{"id":"W2040233837","doi":"10.5555/2682923.2682960","title":"Reducing CTL-live Model Checking to First-Order Logic Validity Checking","year":2014,"lang":"en","type":"article","venue":"Formal Methods in Computer-Aided Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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 Waterloo","funders":"","keywords":"Model checking; Computation tree logic; Kripke structure; CTL*; Computer science; Temporal logic; Modal μ-calculus; Abstraction model checking; Theoretical computer science; Partial order reduction; Liveness; Linear temporal logic; Abstraction; Algorithm; Description logic; Multimodal logic; Zeroth-order logic","score_opus":0.18076606694857703,"score_gpt":0.39245590140487885,"score_spread":0.21168983445630182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040233837","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.0026879204,0.000035982423,0.992544,0.0002843553,0.0020216692,0.0010149188,0.0000013850477,0.000589186,0.0008205602],"genre_scores_gemma":[0.029210929,0.000011831888,0.9690157,0.0010987332,0.00038273234,0.0001766284,0.000002633331,0.000060282826,0.00004051914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919407,0.0031011717,0.0013539369,0.0014639399,0.0006976757,0.0014425894],"domain_scores_gemma":[0.9947077,0.0020883097,0.00053218676,0.0019325723,0.0003658403,0.000373412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.018568262,0.0006345742,0.000861575,0.00074564805,0.00057699595,0.00048284864,0.0028593957,0.0003563149,0.000013575203],"category_scores_gemma":[0.0022935413,0.00064609747,0.00020418175,0.001914028,0.00009384226,0.0024180803,0.001555224,0.00080610445,0.00008422713],"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.000041157924,0.00009761218,0.00006723455,0.00007059043,0.00001508937,0.0000058828414,0.002997269,0.6386933,0.0018018127,0.037927475,0.000119489276,0.31816313],"study_design_scores_gemma":[0.0005240504,0.0004731123,0.000622262,0.00021415441,0.000013594159,0.00003621682,0.000020278916,0.9366686,0.019269438,0.041079212,0.0003389532,0.0007401565],"about_ca_topic_score_codex":0.00007185688,"about_ca_topic_score_gemma":0.000004022137,"teacher_disagreement_score":0.317423,"about_ca_system_score_codex":0.00044415242,"about_ca_system_score_gemma":0.00017555866,"threshold_uncertainty_score":0.99959904},"labels":[],"label_agreement":null},{"id":"W2044000055","doi":"10.1007/s11390-009-9205-8","title":"An Abstract Reachability Approach by Combining HOL Induction and Multiway Decision Graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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; Reachability; Correctness; Computer science; Binary decision diagram; Automated theorem proving; Benchmark (surveying); Embedding; Theoretical computer science; Set (abstract data type); Binary number; Algorithm; Mathematics; Programming language; Artificial intelligence; Arithmetic","score_opus":0.01806091364229341,"score_gpt":0.29793431518903896,"score_spread":0.27987340154674556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044000055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48336488,0.0000893232,0.5159064,0.00036061922,0.00017239507,0.000047384085,1.1050541e-7,0.000035851474,0.00002305126],"genre_scores_gemma":[0.53599405,0.000024897843,0.4639109,0.000054630644,0.0000135991995,4.166252e-7,6.624045e-8,0.00000114335,2.6106582e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859196,0.000040270177,0.00037886194,0.00035675615,0.00041942237,0.00021272888],"domain_scores_gemma":[0.9986643,0.00004389702,0.00033108916,0.00042452905,0.00041579243,0.00012037168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029155537,0.000106268344,0.00019762675,0.00071869756,0.0002445101,0.00022278485,0.0010562955,0.00012518598,2.2603426e-7],"category_scores_gemma":[0.00014592402,0.00008541016,0.000019814352,0.0012453998,0.0005554593,0.0023134334,0.00013507692,0.00035345074,2.846567e-7],"study_design_candidate":"design_other","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.000006321368,0.00011862973,0.0006081242,0.0000023873336,0.0000018804546,0.0000021726053,0.00021204822,0.00001977754,0.023819761,0.020846538,0.000038542057,0.9543238],"study_design_scores_gemma":[0.0014964428,0.005090396,0.17776415,0.000094022515,0.000013843121,0.0029351746,0.00021105724,0.5522808,0.04002288,0.2188387,0.0007325546,0.0005199829],"about_ca_topic_score_codex":0.0000022605702,"about_ca_topic_score_gemma":1.2253066e-7,"teacher_disagreement_score":0.95380384,"about_ca_system_score_codex":0.000039528204,"about_ca_system_score_gemma":0.00007478093,"threshold_uncertainty_score":0.34829253},"labels":[],"label_agreement":null},{"id":"W2044908638","doi":"10.1109/ccece.2008.4564709","title":"Harnessing overgeneralization in the synthesis of state machines from scenarios","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Spurious relationship; Generalization; Computer science; Set (abstract data type); Syntax; Finite-state machine; State (computer science); Programming language; Artificial intelligence; Machine learning; Mathematics","score_opus":0.02448213156951579,"score_gpt":0.2186512201645152,"score_spread":0.1941690885949994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044908638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40977755,0.00007429403,0.5887838,0.00050639414,0.00014286843,0.00020662598,0.0000060309894,0.00007102211,0.00043137718],"genre_scores_gemma":[0.95856225,0.00010528236,0.041053005,0.00018140636,0.000047583777,0.000030910047,0.0000023517084,0.000009370057,0.000007845822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986284,0.000033027773,0.00031101014,0.0003917056,0.000254262,0.00038163274],"domain_scores_gemma":[0.9992746,0.000106513755,0.0001009343,0.00017861275,0.00017260366,0.00016671298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024223911,0.00020873609,0.00025371872,0.00035630877,0.00012407331,0.00020303461,0.0007405993,0.00008275117,0.000006626074],"category_scores_gemma":[0.00011616621,0.00017411435,0.000032094627,0.0006958658,0.000051610197,0.00044393173,0.000052402193,0.00026938098,0.0000023883586],"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.000027386419,0.00011049963,0.02013024,0.00010480105,0.00004418692,0.000045162134,0.009613253,0.0031459765,0.004839745,0.6169449,0.00022697952,0.34476686],"study_design_scores_gemma":[0.00008907213,0.00006496278,0.03811978,0.00010076641,0.0000037642199,0.00002128302,0.000010330441,0.95807594,0.0018567853,0.0013430185,0.00010743493,0.00020686473],"about_ca_topic_score_codex":0.00543961,"about_ca_topic_score_gemma":0.0005043611,"teacher_disagreement_score":0.95492995,"about_ca_system_score_codex":0.00007888359,"about_ca_system_score_gemma":0.0002501246,"threshold_uncertainty_score":0.82231},"labels":[],"label_agreement":null},{"id":"W2045048599","doi":"10.1016/s1571-0661(04)80486-9","title":"A Semantics for Timed MSC","year":2002,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Semantics (computer science); Programming language; Formal semantics (linguistics); Event (particle physics); Formal specification; Formal methods; Formal verification; Operational semantics; Software engineering","score_opus":0.01736229215600636,"score_gpt":0.2811296066941258,"score_spread":0.2637673145381194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045048599","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.0060644047,0.00012836815,0.99069136,0.0015163202,0.00046770074,0.00037545833,6.0859765e-7,0.00016203751,0.00059375464],"genre_scores_gemma":[0.5368627,0.000010610866,0.4627723,0.00026019508,0.00005766573,0.000024232211,2.3515784e-7,0.0000062048484,0.0000058745077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971022,0.00012222838,0.00034725256,0.00077912695,0.00051213,0.001137064],"domain_scores_gemma":[0.9980545,0.000663658,0.00008086898,0.0009241489,0.00014067517,0.00013616974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026627039,0.00018478151,0.0002111695,0.0002744123,0.00025476568,0.0002820959,0.0027673899,0.000074750526,0.00003388766],"category_scores_gemma":[0.0007105858,0.00016770903,0.00007006483,0.0016518408,0.0012520201,0.0007159851,0.00047267604,0.00030422077,0.0000632512],"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.000004031601,0.00006248128,0.000022587235,0.0000067752117,0.0000018695969,0.0000014919721,0.00026318067,0.00019947295,0.0004987454,0.9088849,0.000015906257,0.09003855],"study_design_scores_gemma":[0.00021691392,0.0002559563,0.000071806826,0.0000130298,0.0000018737688,0.000019939045,6.992547e-7,0.7237581,0.012576964,0.2626139,0.00030383992,0.00016700017],"about_ca_topic_score_codex":0.0000011121195,"about_ca_topic_score_gemma":0.00000107002,"teacher_disagreement_score":0.7235586,"about_ca_system_score_codex":0.00024259835,"about_ca_system_score_gemma":0.00010542665,"threshold_uncertainty_score":0.6838976},"labels":[],"label_agreement":null},{"id":"W2046456520","doi":"10.1007/s00165-002-225-1","title":"On Closure UnderStuttering","year":2003,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"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":"Rotation formalisms in three dimensions; Computer science; Temporal logic; Linear temporal logic; Correctness; Fragment (logic); Model checking; Property (philosophy); Theory of computation; Formalism (music); Programming language; Stuttering; Theoretical computer science; Closure (psychology); Algorithm; Mathematics; Linguistics","score_opus":0.022847237005280765,"score_gpt":0.2745191433185214,"score_spread":0.25167190631324066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046456520","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.15378232,0.000017369632,0.77136177,0.000031621632,0.0004519252,0.00008191121,2.0707772e-7,0.00011547018,0.07415741],"genre_scores_gemma":[0.66618234,6.2215804e-7,0.33369496,0.00008309273,0.000022825805,5.982511e-7,2.5781645e-7,0.0000055600453,0.000009768748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987739,0.00009025658,0.00029712298,0.00022563514,0.00028130508,0.00033180488],"domain_scores_gemma":[0.9991338,0.00012251438,0.00018851562,0.0004387775,0.00006219462,0.000054195723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007846151,0.00012235907,0.00015774246,0.000118323405,0.00014805533,0.000054288314,0.0005499734,0.000047988644,0.0000073242763],"category_scores_gemma":[0.00018824135,0.00011840625,0.00006715735,0.0003419112,0.00003513158,0.00053515995,0.00013603907,0.00015748083,0.00002828456],"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.0000027956096,0.000028025654,0.00009469748,0.000020430012,0.000006949897,0.0000023412579,0.00035478838,0.002599328,0.00034112835,0.98927534,0.000019457677,0.0072546927],"study_design_scores_gemma":[0.0014661427,0.0012136837,0.016561171,0.00031696525,0.000013440728,0.00014681637,0.00029572335,0.4257947,0.24764556,0.30380502,0.0018425063,0.0008982865],"about_ca_topic_score_codex":0.0000029810883,"about_ca_topic_score_gemma":4.312243e-7,"teacher_disagreement_score":0.68547034,"about_ca_system_score_codex":0.000045332104,"about_ca_system_score_gemma":0.000041799085,"threshold_uncertainty_score":0.48284668},"labels":[],"label_agreement":null},{"id":"W2046971437","doi":"10.1002/smr.527","title":"Model checking timed properties of healthcare processes","year":2011,"lang":"en","type":"article","venue":"Journal of Software Maintenance and Evolution Research and Practice","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Correctness; Model checking; Workflow; Temporal logic; Modalities; Process (computing); Software engineering; Distributed computing; Programming language; Database","score_opus":0.2684335454673087,"score_gpt":0.3914422192825324,"score_spread":0.12300867381522373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046971437","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.025931848,0.007444673,0.96356946,0.002410668,0.0000815538,0.00015663638,0.0000013534235,0.000018658897,0.00038511906],"genre_scores_gemma":[0.59936106,0.0016438346,0.3988659,0.000043980654,0.000017971293,0.0000035010955,5.5858727e-8,0.0000033470774,0.00006037264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984053,0.00038276773,0.00034333658,0.00014423263,0.0004833778,0.00024098938],"domain_scores_gemma":[0.99576217,0.00038609406,0.000402183,0.00016754662,0.0031592203,0.00012281169],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005757476,0.000069123475,0.00015152252,0.00019581003,0.00017656072,0.00005706864,0.000310389,0.000055010234,0.0000011179254],"category_scores_gemma":[0.012887039,0.0000499468,0.000018876606,0.00041472696,0.00023317037,0.0023885532,0.00013523313,0.0003746083,0.0000010574422],"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.01905311,0.0025128487,0.025725108,0.011796821,0.0004823631,0.00019754194,0.1003047,0.0004530742,0.028561361,0.49110353,0.0058152764,0.3139943],"study_design_scores_gemma":[0.0070846495,0.019451266,0.08750575,0.012729729,0.00019281263,0.012481405,0.039269045,0.25653452,0.084633015,0.45949307,0.018500132,0.0021246104],"about_ca_topic_score_codex":0.000108992754,"about_ca_topic_score_gemma":0.0000058752194,"teacher_disagreement_score":0.57342917,"about_ca_system_score_codex":0.00005591648,"about_ca_system_score_gemma":0.00049457594,"threshold_uncertainty_score":0.99542785},"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":"W2051749751","doi":"10.2168/lmcs-3(3:1)2007","title":"A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Toronto; Deutsche Forschungsgemeinschaft","keywords":"Decidability; Recursion (computer science); Semantics (computer science); Infinite set; Set (abstract data type); Büchi automaton; Deterministic automaton; Base (topology); Pushdown automaton","score_opus":0.08777243278367756,"score_gpt":0.42680655950871127,"score_spread":0.3390341267250337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051749751","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.00975434,0.000012629338,0.98814523,0.000128177,0.0009195513,0.00041189056,0.0000034545453,0.00009155002,0.0005331984],"genre_scores_gemma":[0.11549487,0.0000074675418,0.8841896,0.0002389877,0.000044774526,0.000010158229,5.7204136e-7,0.0000072273756,0.000006335542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966886,0.00034263384,0.0010361386,0.0007207024,0.00059781753,0.00061409775],"domain_scores_gemma":[0.994631,0.003237633,0.00050941913,0.001189635,0.00028532677,0.00014699294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014364216,0.00020778165,0.00049473665,0.0005000515,0.00010244611,0.00007322334,0.003016062,0.00014512624,0.0000049197083],"category_scores_gemma":[0.0023653088,0.00017415664,0.000120055214,0.0030001805,0.0008574051,0.00065576873,0.0012443532,0.00021959336,0.000002738284],"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.0000405368,0.00024107011,0.0018584094,0.00010157243,0.0000064242718,0.0000058897117,0.0008566893,0.004765077,0.019923573,0.18897745,0.000014934787,0.7832084],"study_design_scores_gemma":[0.00039637313,0.0004676651,0.027436037,0.00005471528,0.0000045003017,0.000011213209,0.0000059054264,0.84949565,0.07153967,0.050008222,0.00037291597,0.00020713356],"about_ca_topic_score_codex":0.000013568642,"about_ca_topic_score_gemma":0.0000030052045,"teacher_disagreement_score":0.84473056,"about_ca_system_score_codex":0.00006276395,"about_ca_system_score_gemma":0.00010687007,"threshold_uncertainty_score":0.7101901},"labels":[],"label_agreement":null},{"id":"W2051988259","doi":"10.1016/s1571-0661(04)80669-8","title":"Improving Termination of MDG-Based Abstract State Enumeration via Term Schematization","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","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":"Université de Montréal","funders":"","keywords":"Enumeration; Exploit; Term (time); Computer science; State (computer science); Theoretical computer science; Algorithm; Mathematics; Discrete mathematics","score_opus":0.008095859017107783,"score_gpt":0.273987958328635,"score_spread":0.2658920993115272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051988259","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.1495854,0.000023101013,0.8496486,0.00014712727,0.00018155506,0.0002353915,5.408014e-7,0.00008096774,0.00009735208],"genre_scores_gemma":[0.67291725,0.000004203232,0.32697555,0.000058622565,0.00002446509,0.000010867242,0.0000022894094,0.0000060503357,6.777461e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974787,0.000136723,0.00054072,0.00058797473,0.00065705826,0.0005987783],"domain_scores_gemma":[0.99843097,0.00031217467,0.00028047088,0.00064788415,0.00024819418,0.00008027901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030455638,0.0001717879,0.00019125697,0.0004232141,0.0001680228,0.00019908369,0.0013164565,0.00006643094,0.0000169953],"category_scores_gemma":[0.0004576895,0.00016394145,0.000045391498,0.0017265996,0.0007323998,0.0013354239,0.00019677547,0.00026320128,0.000010887446],"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.00001559698,0.0001039637,0.0005638302,0.000026161795,0.000001586151,0.0000024432181,0.00021326066,0.0037563147,0.038688503,0.49522942,2.4247916e-7,0.4613987],"study_design_scores_gemma":[0.00019494446,0.00016182172,0.0042941268,0.00003253026,0.0000017009806,0.0000105593645,5.7854663e-7,0.7349182,0.20327961,0.0569669,0.0000029916077,0.00013604172],"about_ca_topic_score_codex":0.000008548079,"about_ca_topic_score_gemma":0.000003969388,"teacher_disagreement_score":0.7311619,"about_ca_system_score_codex":0.00031855787,"about_ca_system_score_gemma":0.00032912896,"threshold_uncertainty_score":0.66853386},"labels":[],"label_agreement":null},{"id":"W2052094717","doi":"10.1109/hase.2012.26","title":"Proving the Absence Property Pattern Using the B Method","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Property (philosophy); Algorithm; Artificial intelligence; Discrete mathematics; Information retrieval; Mathematics; Philosophy","score_opus":0.1283252049544197,"score_gpt":0.3677059413774359,"score_spread":0.2393807364230162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052094717","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.00040868245,0.0001567664,0.9914878,0.0015064771,0.0018489138,0.0008822881,0.0000011545651,0.00018630252,0.0035215984],"genre_scores_gemma":[0.04442003,0.000009916241,0.95379835,0.0007787753,0.00030661997,0.00010331542,7.276625e-7,0.000017370674,0.0005648744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723315,0.0010309084,0.00035504202,0.00053651386,0.00046227,0.0003821274],"domain_scores_gemma":[0.99661696,0.00024593138,0.00035472465,0.002589053,0.00014030906,0.000053042928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047487793,0.00024934675,0.00019100316,0.00004268999,0.00036428668,0.0005560202,0.004129839,0.00015948653,0.000022309012],"category_scores_gemma":[0.00020186698,0.00009212568,0.000111357505,0.00021556718,0.00010136512,0.00044083313,0.0040244367,0.0008689651,0.000032828066],"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.0000020483888,0.000040956722,0.00047598666,0.00013721296,0.000042148156,0.0000012278209,0.0054227132,0.0027949708,0.0015674933,0.031359788,0.0002647105,0.95789075],"study_design_scores_gemma":[0.00002774251,0.0000063928533,0.0010943592,0.00006395629,0.000015675027,0.000035995818,0.000081454134,0.9878243,0.0046216226,0.00269507,0.0032893457,0.0002440715],"about_ca_topic_score_codex":0.00084754766,"about_ca_topic_score_gemma":0.000011057416,"teacher_disagreement_score":0.98502934,"about_ca_system_score_codex":0.00010499078,"about_ca_system_score_gemma":0.00018495414,"threshold_uncertainty_score":0.7674337},"labels":[],"label_agreement":null},{"id":"W2052173215","doi":"10.1145/959221.959238","title":"An approach to formal verication of real time concurrent Ada programs","year":2003,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Carleton University","funders":"","keywords":"Computer science; Correctness; SPARK (programming language); Programming language; Automated theorem proving; Code (set theory); Gas meter prover; Proof assistant; Static analysis; Model checking; Mathematics","score_opus":0.03251390474002544,"score_gpt":0.28535113440254917,"score_spread":0.25283722966252375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052173215","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.24467605,0.000010319453,0.7522797,0.00034269373,0.00028001211,0.00046681394,0.0000017326727,0.000143689,0.0017989752],"genre_scores_gemma":[0.42458153,0.0000017471194,0.574837,0.00045137198,0.000028045986,0.00006616468,0.0000149383295,0.000010226407,0.000008909559],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981279,0.0002372446,0.00036500677,0.0004376146,0.0004517936,0.00038047656],"domain_scores_gemma":[0.99813235,0.000060604805,0.00019750453,0.0013672917,0.00008932621,0.00015291496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007508374,0.00016896674,0.00019482852,0.00010221737,0.00008745038,0.0000820596,0.0014928015,0.00005731363,0.0000047338003],"category_scores_gemma":[0.00017653276,0.0001664434,0.000056442215,0.00059584127,0.00007017516,0.0010738164,0.00014553251,0.0001211497,0.00003333602],"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.000050359202,0.0009960321,0.002373922,0.00015086048,0.00006883803,0.0000048788925,0.0056680134,0.0023972527,0.332673,0.24016443,0.0030544966,0.4123979],"study_design_scores_gemma":[0.0044305613,0.004003466,0.05973578,0.0002788738,0.00015359056,0.00018982892,0.0009515446,0.34646922,0.5072171,0.0037789152,0.06831022,0.004480892],"about_ca_topic_score_codex":0.000055003613,"about_ca_topic_score_gemma":7.0761683e-7,"teacher_disagreement_score":0.407917,"about_ca_system_score_codex":0.00008955302,"about_ca_system_score_gemma":0.000058788282,"threshold_uncertainty_score":0.67873645},"labels":[],"label_agreement":null},{"id":"W2052175425","doi":"10.5555/2485288.2485484","title":"Bridging the gap between dual propagation and CNF-based QBF solving","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":31,"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":"","keywords":"Computer science; Bridging (networking); Conjunctive normal form; Expressive power; True quantified Boolean formula; Dual (grammatical number); Solver; Theoretical computer science; Inefficiency; Algorithm; Programming language","score_opus":0.044566720990065874,"score_gpt":0.2785642733075658,"score_spread":0.2339975523174999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052175425","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.08434511,0.000015894999,0.9114924,0.0021166774,0.00008938984,0.0002350515,2.0480276e-7,0.00012107893,0.0015841874],"genre_scores_gemma":[0.63705355,5.358984e-7,0.36256424,0.00020307211,0.000067052184,0.000020618592,7.5891404e-7,0.0000031651157,0.00008701288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926436,0.00010407124,0.00013910918,0.00018201311,0.00016388172,0.00014655382],"domain_scores_gemma":[0.9993937,0.00011721381,0.00006487096,0.00032305188,0.000063455525,0.000037726324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006425419,0.000065782275,0.000059933307,0.00003942459,0.00017597355,0.00028128282,0.00027625004,0.000027987731,0.000015252258],"category_scores_gemma":[0.0001067148,0.000043099022,0.000014885852,0.00015951882,0.000048220933,0.00071603584,0.00010603126,0.00008156307,0.00004976685],"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.000001329286,0.000018605537,0.016850958,0.000036362355,0.000011470409,5.0506884e-7,0.0011612714,0.00021068662,0.009621173,0.118048824,0.0011956075,0.8528432],"study_design_scores_gemma":[0.00009483601,0.000028338212,0.09463101,0.00001022627,0.0000032761968,0.0000029440835,0.000027689734,0.8808692,0.021905573,0.0021119812,0.0002167542,0.000098160664],"about_ca_topic_score_codex":0.00007176895,"about_ca_topic_score_gemma":0.000001483506,"teacher_disagreement_score":0.8806585,"about_ca_system_score_codex":0.000017606682,"about_ca_system_score_gemma":0.000024858899,"threshold_uncertainty_score":0.27124166},"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":"W2053655101","doi":"10.1017/s096012950400430x","title":"Minimisation and minimal realisation in Span(Graph)","year":2004,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Concurrency; Realisation; Minimisation (clinical trials); Computer science; Reachability; Principle of compositionality; Algebra over a field; Theoretical computer science; Programming language; Mathematics; Artificial intelligence; Pure mathematics","score_opus":0.02542242488827532,"score_gpt":0.2948909800593444,"score_spread":0.26946855517106905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053655101","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.2608307,0.000014245683,0.7381776,0.0003636904,0.00019160072,0.000169069,3.9840674e-7,0.000046342942,0.00020639531],"genre_scores_gemma":[0.4906189,0.0000021330309,0.5092442,0.00010566794,0.000019059282,0.000006633856,2.860845e-7,0.0000025814713,5.257774e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980864,0.0000745114,0.00041590203,0.0005666433,0.000510542,0.00034603762],"domain_scores_gemma":[0.9991449,0.000111718495,0.00009846806,0.00049653364,0.000050154995,0.000098202276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014008633,0.00014572393,0.00017945986,0.00043524525,0.000099722,0.00027593915,0.00097252615,0.00006031739,0.0000039091474],"category_scores_gemma":[0.00023993623,0.00012820646,0.00002201033,0.0012982849,0.00044325416,0.0010498547,0.00035785872,0.00015629028,0.000004600665],"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.0000042626148,0.00004314527,0.0008939196,0.00003120348,7.2296007e-7,0.000008180971,0.0026780006,0.0037124036,0.0005772371,0.9039847,0.0000033389545,0.08806288],"study_design_scores_gemma":[0.00029606707,0.000038281683,0.0950351,0.000042544314,7.1933727e-7,0.0000499305,0.0000139544945,0.31552476,0.002099347,0.5867642,0.0000067239816,0.00012837004],"about_ca_topic_score_codex":0.000029892553,"about_ca_topic_score_gemma":0.000012516252,"teacher_disagreement_score":0.31722048,"about_ca_system_score_codex":0.00015974497,"about_ca_system_score_gemma":0.00008665787,"threshold_uncertainty_score":0.5228108},"labels":[],"label_agreement":null},{"id":"W2054320689","doi":"10.1007/s10472-006-9035-0","title":"A formal mathematical framework for modeling probabilistic hybrid systems","year":2007,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Formal Methods in Verification","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":"University of British Columbia","funders":"","keywords":"Computer science; Probabilistic logic; Hybrid system; Dynamical systems theory; Theoretical computer science; Asynchronous communication; Semantics (computer science); Complex system; Artificial intelligence; Programming language; Machine learning","score_opus":0.23910518440028664,"score_gpt":0.4056549268499324,"score_spread":0.16654974244964574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054320689","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.025375618,0.00013668259,0.97334164,0.00014391678,0.00018128354,0.0005140986,0.0000049748237,0.00005433063,0.0002474721],"genre_scores_gemma":[0.41816792,0.000018069952,0.58170736,0.00002827635,0.000044042827,0.000021480188,5.208424e-7,0.000007806652,0.0000045374654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814326,0.000020540925,0.0009136186,0.0002546265,0.00027802648,0.00038995576],"domain_scores_gemma":[0.9980628,0.0007791045,0.00026729796,0.0004497909,0.0003343077,0.00010673333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034346972,0.00014932017,0.0002936641,0.00010662313,0.00013003172,0.00013448442,0.0004971287,0.00007752283,0.0000030016045],"category_scores_gemma":[0.001507793,0.00013022994,0.00008311342,0.00018752068,0.00009895971,0.00035965396,0.0001260217,0.00011261113,0.000009160288],"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.000009413171,0.00014359016,4.489607e-7,0.00045296724,0.000009898568,8.350609e-7,0.0009312278,0.0022618466,0.00015806936,0.9595482,0.0000037639709,0.03647978],"study_design_scores_gemma":[0.000005006789,0.00006703678,2.8916207e-7,0.000118373864,0.00000392871,0.000008885079,0.0002833689,0.5027091,0.014752229,0.48196694,0.000009460084,0.00007534421],"about_ca_topic_score_codex":0.0000039283213,"about_ca_topic_score_gemma":6.234242e-7,"teacher_disagreement_score":0.5004473,"about_ca_system_score_codex":0.000007709733,"about_ca_system_score_gemma":0.000025863086,"threshold_uncertainty_score":0.53106225},"labels":[],"label_agreement":null},{"id":"W2055102535","doi":"10.4204/eptcs.13.6","title":"Verifying Real-Time Systems using Explicit-time Description Methods","year":2009,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; Atlantic Canada Opportunities Agency","keywords":"Process (computing); Modularity (biology); Rotation formalisms in three dimensions; Synchronization (alternating current); Model checking; Rendezvous; Semaphore; Asynchronous communication","score_opus":0.02040135599401856,"score_gpt":0.319022635246982,"score_spread":0.29862127925296345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055102535","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.09468475,0.00009549349,0.900193,0.00014835541,0.00039267182,0.00041811028,2.0103589e-7,0.00042545973,0.0036419805],"genre_scores_gemma":[0.4617221,0.0000146722095,0.53805107,0.000082944876,0.000099215555,0.0000110147985,2.6326316e-7,0.000009945995,0.000008781411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953965,0.00020441909,0.00067508867,0.0012757862,0.0008788636,0.0015693764],"domain_scores_gemma":[0.9984178,0.00014498559,0.00025652046,0.00059269246,0.00034549736,0.0002425022],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009158017,0.0003459638,0.00044004174,0.0006377742,0.00046817865,0.0011323071,0.0031851123,0.00015666557,0.000009560172],"category_scores_gemma":[0.0003870013,0.0003307269,0.00007932509,0.003467491,0.000668012,0.003238748,0.000513279,0.00056630344,0.00004401069],"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.0000121405965,0.000045480625,0.000009242552,0.000009376062,0.0000022415745,0.0000015194483,0.0003580636,0.00025875657,0.17687804,0.799394,0.000008834569,0.023022268],"study_design_scores_gemma":[0.00018971495,0.000487673,0.00024055765,0.00009128092,0.000005488732,0.00012767699,0.000010603345,0.8653564,0.025421616,0.107676655,0.000045017037,0.00034734118],"about_ca_topic_score_codex":0.000008054637,"about_ca_topic_score_gemma":3.7724263e-8,"teacher_disagreement_score":0.86509764,"about_ca_system_score_codex":0.0011521043,"about_ca_system_score_gemma":0.0003303506,"threshold_uncertainty_score":0.99991447},"labels":[],"label_agreement":null},{"id":"W2055289688","doi":"10.1142/s021812660400188x","title":"MDG-BASED STATE ENUMERATION BY RETIMING AND CIRCUIT TRANSFORMATION","year":2004,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Retiming; Enumeration; Computer science; Transformation (genetics); Representation (politics); Binary decision diagram; State (computer science); Theoretical computer science; Model checking; Algorithm; Programming language; Mathematics; Discrete mathematics","score_opus":0.018987973964126464,"score_gpt":0.23788291335581155,"score_spread":0.21889493939168508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055289688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096189864,0.0006528464,0.90199,0.00024502375,0.0006755477,0.00013696465,0.0000017216987,0.000023396644,0.00008464878],"genre_scores_gemma":[0.97742546,0.00006356474,0.022314254,0.0001244552,0.000058705624,0.0000024563572,0.0000011390114,0.000006536136,0.0000034599327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870735,0.000118556505,0.0005561355,0.00014671382,0.00032198514,0.00014927563],"domain_scores_gemma":[0.99907863,0.000051761876,0.0004561417,0.00014209811,0.00015532697,0.000116054325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009505597,0.000116002135,0.00021676053,0.00016695193,0.00012338205,0.00036067632,0.00022865078,0.000052810577,2.4536612e-7],"category_scores_gemma":[0.000017117038,0.000105211795,0.00004010238,0.00016794229,0.00003407481,0.0012367481,0.000013632839,0.00014123158,7.447686e-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.000027392944,0.00016049053,0.0004311208,0.00069021946,0.0001261578,0.000037171263,0.015101034,0.07314466,0.025804544,0.19345047,0.0003394432,0.6906873],"study_design_scores_gemma":[0.0078006387,0.0022428164,0.008876548,0.002019552,0.00008467194,0.0028219873,0.0006384069,0.93360204,0.020122765,0.013814962,0.0068019326,0.0011737049],"about_ca_topic_score_codex":0.000017610633,"about_ca_topic_score_gemma":4.4450132e-7,"teacher_disagreement_score":0.88123554,"about_ca_system_score_codex":0.000082131985,"about_ca_system_score_gemma":0.00007687599,"threshold_uncertainty_score":0.42904124},"labels":[],"label_agreement":null},{"id":"W2055718439","doi":"10.1145/2237796.2237818","title":"Refinement patterns for ASTD","year":2012,"lang":"en","type":"article","venue":"ACM SIGSOFT Software Engineering Notes","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Computer science; Programming language; Semantics (computer science); Natural language processing; Software engineering","score_opus":0.038991754957743215,"score_gpt":0.2860445925203361,"score_spread":0.2470528375625929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055718439","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.0420289,0.00022001195,0.95544803,0.00013466511,0.0012258973,0.00021391625,0.000011847332,0.00071448385,0.0000022729694],"genre_scores_gemma":[0.4285876,0.000003857043,0.57101995,0.00007731993,0.00017198296,0.00009740908,0.000008536883,0.000017839484,0.00001553947],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99881303,0.000017892233,0.00023170168,0.00024815995,0.00020022316,0.0004889672],"domain_scores_gemma":[0.9885789,0.01011455,0.0000754597,0.0010191124,0.00007312822,0.00013880906],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0005278744,0.00018138591,0.00015136742,0.00009746001,0.00007596183,0.00006456022,0.0009621486,0.00007720975,0.000015262583],"category_scores_gemma":[0.05405723,0.00018256475,0.000076456156,0.0001699406,0.000008353084,0.0006399725,0.00029641317,0.00011217568,0.000041570143],"study_design_candidate":"observational","study_design_consensus":"observational","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.000014651292,0.0002446799,0.6465496,0.0006286225,0.00009070677,0.0000023132075,0.002265455,0.0018448376,0.0057465723,0.06992647,0.0014827169,0.2712034],"study_design_scores_gemma":[0.00081087527,0.00027849313,0.82394737,0.00018557461,0.000039329138,0.000034963585,0.000016702812,0.010650556,0.089759655,0.00022583475,0.07274775,0.0013028908],"about_ca_topic_score_codex":0.000007269389,"about_ca_topic_score_gemma":2.7442985e-7,"teacher_disagreement_score":0.38655868,"about_ca_system_score_codex":0.00006602163,"about_ca_system_score_gemma":0.000015728452,"threshold_uncertainty_score":0.9539108},"labels":[],"label_agreement":null},{"id":"W2055877289","doi":"10.1016/j.scico.2009.02.002","title":"Efficient symbolic computation of process expressions","year":2009,"lang":"en","type":"article","venue":"Science of Computer Programming","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Operational semantics; TRACE (psycholinguistics); Process calculus; Semantics (computer science); Process (computing); Expression (computer science); Computation; Interpreter; Programming language; Theoretical computer science","score_opus":0.021882348870322272,"score_gpt":0.33725302720649564,"score_spread":0.3153706783361734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055877289","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.26383734,0.000031750285,0.73528504,0.00006821418,0.00026273212,0.00022566495,2.3871976e-7,0.000095201794,0.00019380575],"genre_scores_gemma":[0.5191039,3.634177e-7,0.48085827,0.000014430489,0.000016404265,0.0000037281654,2.2661095e-7,0.0000018549374,8.481541e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785316,0.00006182541,0.00047347645,0.00043130617,0.0008253533,0.0003548796],"domain_scores_gemma":[0.99843657,0.000039521197,0.00039282654,0.00049175805,0.0005292279,0.000110092704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012020397,0.00012621077,0.00021676467,0.00039035894,0.00018414679,0.00010919579,0.0015852175,0.000039184037,6.407825e-7],"category_scores_gemma":[0.00008310852,0.00011274527,0.000060936076,0.002256058,0.00041816023,0.0004994209,0.00018597538,0.00009851661,0.0000021712603],"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.000004453814,0.00027083413,0.00008902933,0.000051095223,0.0000026596572,7.296847e-7,0.003347692,0.05292209,0.016844217,0.0668941,0.000004623313,0.8595685],"study_design_scores_gemma":[0.00016165151,0.00030373014,0.0069422936,0.00015429477,0.0000032577811,0.000009464463,0.00005738309,0.92348963,0.06541202,0.0033046415,0.000022693035,0.00013895148],"about_ca_topic_score_codex":0.0000030267167,"about_ca_topic_score_gemma":5.5083817e-8,"teacher_disagreement_score":0.87056756,"about_ca_system_score_codex":0.000033499462,"about_ca_system_score_gemma":0.00019959743,"threshold_uncertainty_score":0.45976186},"labels":[],"label_agreement":null},{"id":"W2056081080","doi":"10.1016/j.tcs.2009.06.019","title":"On-the-fly<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>T</mml:mi><mml:mi>C</mml:mi><mml:mi>T</mml:mi><mml:mi>L</mml:mi></mml:math>model checking for time Petri nets","year":2009,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scroll; Algorithm; Computer science; Computer graphics (images); Artificial intelligence; Mathematics; Theology; Philosophy","score_opus":0.02308841751832871,"score_gpt":0.26984431028839184,"score_spread":0.24675589277006313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056081080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52490425,0.00047663238,0.4229731,0.0026430713,0.0048311134,0.00024196568,0.00016304983,0.00055589335,0.043210912],"genre_scores_gemma":[0.8640827,0.00018132012,0.12889846,0.004238666,0.00164644,0.000374879,0.00013347801,0.00032632807,0.00011770295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98578054,0.0008108638,0.002332864,0.0033049705,0.004104076,0.0036666885],"domain_scores_gemma":[0.9883805,0.0032811598,0.0018264953,0.004475179,0.0004834152,0.001553277],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.0077585834,0.0012543689,0.0006438574,0.00074640824,0.0035064637,0.003510631,0.007851912,0.0015713216,0.005420276],"category_scores_gemma":[0.0029447402,0.0017569799,0.0015077501,0.0028615633,0.0058027743,0.0027986616,0.004022519,0.0021932167,0.002684026],"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.00073583913,0.0004806869,0.0000035689875,0.00031724124,0.00023403326,0.00027499307,0.0023817532,0.010992926,0.0017704158,0.95421,0.016809924,0.011788663],"study_design_scores_gemma":[0.0011404331,0.0022508395,0.000047695852,0.0008513295,0.0003133885,0.0006244319,0.0001362557,0.70832115,0.23511672,0.049055483,0.0007360542,0.0014062269],"about_ca_topic_score_codex":0.00014901413,"about_ca_topic_score_gemma":0.000034405977,"teacher_disagreement_score":0.90515447,"about_ca_system_score_codex":0.0000791798,"about_ca_system_score_gemma":0.0019103831,"threshold_uncertainty_score":0.99972486},"labels":[],"label_agreement":null},{"id":"W2056386139","doi":"10.1016/j.dam.2008.02.012","title":"Representation of graphs by OBDDs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","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":"Canada Research Chairs; University of Toronto","funders":"Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Representation (politics); Combinatorics; Discrete mathematics","score_opus":0.037407934197245675,"score_gpt":0.2960625244126115,"score_spread":0.2586545902153658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056386139","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.03533073,0.00002697969,0.94316655,0.000030566862,0.00006196976,0.00020714682,0.0000036089446,0.00010023916,0.021072207],"genre_scores_gemma":[0.26328433,0.000030229347,0.7365374,0.000026229016,0.000006360718,0.000029548395,0.0000069199023,0.000008377205,0.00007062009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989665,0.000019135692,0.00035061408,0.00020205954,0.00031867888,0.00014301848],"domain_scores_gemma":[0.9988655,0.000085272586,0.0002438401,0.0007141975,0.00004748641,0.00004374374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022302197,0.000101598635,0.00019677848,0.00006555546,0.0000732185,0.00001682526,0.00055245147,0.000051875435,0.000007912074],"category_scores_gemma":[0.00005833005,0.00009270711,0.00005565245,0.00050199195,0.000100763755,0.00020149774,0.00010401921,0.000068608024,0.00002452748],"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.000002569007,0.000061181854,0.000032849624,0.000052889693,0.000011852369,6.215912e-7,0.002451967,0.000020204234,0.03658124,0.95689297,0.0011678354,0.002723843],"study_design_scores_gemma":[0.0005119035,0.000070388094,0.00066508603,0.000028625016,0.000021322896,0.000035534016,0.0004433529,0.065634064,0.6503654,0.28127104,0.00056568417,0.000387565],"about_ca_topic_score_codex":0.0000036088109,"about_ca_topic_score_gemma":1.0977487e-7,"teacher_disagreement_score":0.67562187,"about_ca_system_score_codex":0.000013058459,"about_ca_system_score_gemma":0.000016552727,"threshold_uncertainty_score":0.3780486},"labels":[],"label_agreement":null},{"id":"W2057562551","doi":"10.1016/j.procs.2013.06.144","title":"Towards a Distributed Plan Execution Monitoring Framework","year":2013,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Concordia University","funders":"","keywords":"Computer science; Scalability; Plan (archaeology); Distributed computing; Automaton; Context (archaeology); Runtime verification; Scale (ratio); Software engineering; Formal verification; Programming language; Theoretical computer science; Database","score_opus":0.0303077560838228,"score_gpt":0.2895329646253979,"score_spread":0.2592252085415751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057562551","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.039040677,0.000038864076,0.95691955,0.0004470418,0.002476676,0.00031443223,0.0000013096189,0.00048453233,0.0002769238],"genre_scores_gemma":[0.41745704,0.000004672598,0.58216906,0.00007631453,0.00022506388,0.000058453395,7.9978014e-7,0.000004436455,0.0000041449407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749386,0.000046436675,0.00030077808,0.0007510599,0.00080453156,0.0006033342],"domain_scores_gemma":[0.99823415,0.000073453244,0.00014587551,0.000840559,0.00044253946,0.00026342185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008724087,0.00018880721,0.00015712206,0.0002149873,0.0003948557,0.0010210082,0.0028883233,0.00008429361,0.0000070967662],"category_scores_gemma":[0.0003347433,0.0001720315,0.0000430154,0.0021390098,0.00027819545,0.0034342203,0.00083198963,0.0002589491,0.00020936533],"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.0000039736087,0.00012925499,0.0065517654,0.000056731616,0.000008824024,0.000005336294,0.0033928428,0.00067021145,0.005614803,0.26898926,0.000576033,0.71400094],"study_design_scores_gemma":[0.0001182855,0.00012228994,0.109190084,0.00008827035,0.000002648867,0.000044032244,0.00002188956,0.8197246,0.033326812,0.036551487,0.0004308686,0.00037870338],"about_ca_topic_score_codex":0.00002740787,"about_ca_topic_score_gemma":1.0143234e-7,"teacher_disagreement_score":0.8190544,"about_ca_system_score_codex":0.00016586253,"about_ca_system_score_gemma":0.00025348898,"threshold_uncertainty_score":0.9845606},"labels":[],"label_agreement":null},{"id":"W2058152296","doi":"10.1177/1063293x0100900209","title":"Dynamic Task Communication for Concurrent Processing in Distributed Systems","year":2001,"lang":"en","type":"article","venue":"Concurrent Engineering","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Distributed computing; Synchronization (alternating current); Task (project management); Set (abstract data type); Distributed design patterns; Distributed Computing Environment; Architecture; Process (computing); Generator (circuit theory); Programming language; Distributed algorithm; Systems engineering","score_opus":0.02391386490381725,"score_gpt":0.29633802598299214,"score_spread":0.2724241610791749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058152296","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.0074837664,0.0042017903,0.9863121,0.000066066976,0.0011424046,0.0005015312,0.000012188279,0.00025490776,0.000025276326],"genre_scores_gemma":[0.9404262,0.00011666475,0.059064217,0.0000054676484,0.000021900807,0.0002680167,0.00007415357,0.000013760644,0.000009638323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884313,0.000047345442,0.00038456198,0.00027179602,0.0001500786,0.00030306765],"domain_scores_gemma":[0.9991934,0.00008195258,0.00012675255,0.00043181432,0.0001024525,0.00006363191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005211508,0.00015448904,0.00018809455,0.00014033966,0.0000679132,0.00016073843,0.0007155531,0.000061906365,6.187625e-7],"category_scores_gemma":[0.00017710924,0.0001676261,0.000039980332,0.0004806523,0.00002072331,0.00056001835,0.00011238857,0.00017235635,0.000004202346],"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.000009011312,0.00020021168,0.001309281,0.000988069,0.000020225669,0.0000049389455,0.0015442277,0.29652625,0.0038279153,0.18312863,0.00014132512,0.5122999],"study_design_scores_gemma":[0.0003748373,0.000021739004,0.0022234393,0.00026951203,0.000004088627,0.000008127586,0.000029420426,0.98279446,0.00007522258,0.000039672217,0.013971666,0.00018780625],"about_ca_topic_score_codex":0.0000053020512,"about_ca_topic_score_gemma":0.0000023718553,"teacher_disagreement_score":0.9329424,"about_ca_system_score_codex":0.00025395353,"about_ca_system_score_gemma":0.000039195038,"threshold_uncertainty_score":0.68355936},"labels":[],"label_agreement":null},{"id":"W2058282107","doi":"10.1145/2406336.2406349","title":"Formalization of Measure Theory and Lebesgue Integration for Probabilistic Analysis in HOL","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Computer science; Probabilistic logic; Dependability; Theoretical computer science; Automated theorem proving; Measure (data warehouse); Class (philosophy); Artificial intelligence; Programming language; Data mining; Software engineering","score_opus":0.026216874870004354,"score_gpt":0.2903207323166397,"score_spread":0.26410385744663534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058282107","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.05040116,0.000051213006,0.9480222,0.000038999515,0.00027983586,0.0010416489,0.000003882745,0.00008960121,0.0000714896],"genre_scores_gemma":[0.799019,0.0000027765072,0.2007899,0.000014875193,0.000013324816,0.00012752376,0.0000052389714,0.0000079751635,0.000019395613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982031,0.0004534746,0.00057859515,0.00035344757,0.00022077835,0.0001905918],"domain_scores_gemma":[0.99806106,0.00063992763,0.00025840875,0.00069004676,0.00030566865,0.00004489181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019380569,0.00014495295,0.00029735971,0.00053881924,0.00012637973,0.00012472598,0.0004610535,0.000102477075,0.0000021852072],"category_scores_gemma":[0.0003544488,0.00013331439,0.00009117189,0.0011952214,0.00004460736,0.00054605067,0.000011055158,0.00012262906,0.000002245822],"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.00006799184,0.00027152695,0.00035379114,0.00041655617,0.00028375298,2.9974456e-7,0.010246389,0.50067574,0.00333985,0.24128197,0.000013246078,0.24304888],"study_design_scores_gemma":[0.0002880401,0.00011895134,0.001564763,0.000116508694,0.00007094659,0.00000437594,0.0006282703,0.98928314,0.002218783,0.0055625434,0.000004775138,0.00013891276],"about_ca_topic_score_codex":0.0001222944,"about_ca_topic_score_gemma":0.000020784284,"teacher_disagreement_score":0.7486178,"about_ca_system_score_codex":0.00008272197,"about_ca_system_score_gemma":0.000032886262,"threshold_uncertainty_score":0.5436403},"labels":[],"label_agreement":null},{"id":"W2058639278","doi":"10.1016/j.jala.2004.09.004","title":"Overview and Architecture of the Java Integration Framework, Hybrid Scheduler, and Web-Enabled LIMS","year":2004,"lang":"en","type":"article","venue":"JALA Journal of the Association for Laboratory Automation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Computer science; Software engineering; Web application; Java; Software; Suite; Architecture; Operating system; System integration; World Wide Web; Embedded system","score_opus":0.011611938351070565,"score_gpt":0.26415531352461324,"score_spread":0.2525433751735427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058639278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5246791,0.0008252072,0.46854913,0.0043534837,0.0010718096,0.00042618657,0.000018995777,0.0000311413,0.000044921617],"genre_scores_gemma":[0.76687187,0.00013963749,0.23254412,0.0003099321,0.00008983574,0.000008421778,8.148948e-7,0.000008818316,0.00002653457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847376,0.00037389153,0.0004887844,0.0001168999,0.00043296075,0.00011368474],"domain_scores_gemma":[0.9969394,0.00026139067,0.0017948645,0.00027760732,0.00069107936,0.00003560851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024193935,0.00010364382,0.0001872485,0.00009310825,0.00019477749,0.00012762814,0.00043268772,0.00010928961,8.5201174e-7],"category_scores_gemma":[0.002819914,0.00006430951,0.00009019143,0.0005005299,0.000040162682,0.00079244067,0.000084152605,0.0002892826,4.670926e-7],"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.00007300607,0.00021521692,0.010396818,0.0003091403,0.00025479222,5.131586e-7,0.0057830326,0.005185228,0.04875172,0.86797726,0.0005656506,0.060487602],"study_design_scores_gemma":[0.0035241684,0.00045081077,0.33252582,0.0016893471,0.00026991926,0.00006830572,0.00027128178,0.061833408,0.20305692,0.3876269,0.008211867,0.00047125726],"about_ca_topic_score_codex":0.0000019138317,"about_ca_topic_score_gemma":0.0000032530845,"teacher_disagreement_score":0.48035038,"about_ca_system_score_codex":0.00026172353,"about_ca_system_score_gemma":0.00022066274,"threshold_uncertainty_score":0.3375904},"labels":[],"label_agreement":null},{"id":"W2058949335","doi":"10.1109/tc.2009.165","title":"Formal Reliability Analysis Using Theorem Proving","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Computer science; Reliability (semiconductor); Automated theorem proving; Reliability engineering; Probabilistic logic; Reliability theory; Formal methods; Computer engineering; Theoretical computer science; Programming language; Failure rate; Power (physics); Artificial intelligence; Engineering","score_opus":0.026712253309955747,"score_gpt":0.29191457404592486,"score_spread":0.2652023207359691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058949335","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.027606077,0.000004626705,0.97061825,0.00015991156,0.00082462415,0.00019944897,0.0000024536641,0.0003391012,0.00024551345],"genre_scores_gemma":[0.5216944,0.0000014523984,0.47807005,0.00020160947,0.00001711379,0.000003032071,3.5904407e-7,0.0000035275887,0.00000840155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998345,0.0001828014,0.00033734253,0.0004754746,0.00031272162,0.000346613],"domain_scores_gemma":[0.9986838,0.00010644501,0.00011344893,0.00090287067,0.00008932773,0.00010409622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071841216,0.0001776944,0.00022444209,0.00042707616,0.0003388696,0.0001600164,0.00073287013,0.00007892358,0.000007694131],"category_scores_gemma":[0.000006876763,0.00017233146,0.00025915905,0.0016049347,0.000053055388,0.0012328511,0.0000036530507,0.00024421405,0.000012278945],"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.000018216166,0.00014735782,0.000011484815,0.0000050836943,0.00006722813,0.0000022091237,0.0004960466,0.7093714,0.0004620905,0.005549098,0.000007235553,0.2838626],"study_design_scores_gemma":[0.00015790257,0.00014647175,0.00087664527,0.000012407635,0.000080506135,0.000009361,0.000012534669,0.9869298,0.010685943,0.0008591705,0.00003591566,0.00019336933],"about_ca_topic_score_codex":0.000018560675,"about_ca_topic_score_gemma":0.0000018485849,"teacher_disagreement_score":0.49408835,"about_ca_system_score_codex":0.00017355234,"about_ca_system_score_gemma":0.000051042956,"threshold_uncertainty_score":0.7027473},"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":"W2061420542","doi":"10.1007/11557432_8","title":"UML Vs. Classical Vs. Rhapsody Statecharts: Not All Models Are Created Equal","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Technische Universität München","keywords":"Rotation formalisms in three dimensions; Formalism (music); Computer science; Unified Modeling Language; Programming language; Theoretical computer science; Artificial intelligence; Natural language processing; Mathematics; Software","score_opus":0.05355840429574359,"score_gpt":0.29486514653325696,"score_spread":0.24130674223751336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061420542","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.00006473219,0.00018708041,0.9902932,0.002824016,0.0020145904,0.00068687723,0.000027772021,0.0005710574,0.0033306975],"genre_scores_gemma":[0.045740884,0.0001165979,0.9465042,0.0060325,0.00073935883,0.000032831485,0.000019204179,0.000080853184,0.0007335671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924922,0.00015985307,0.0011324825,0.0027083454,0.0020731483,0.0014339795],"domain_scores_gemma":[0.9949672,0.0005326434,0.0007722287,0.0027474298,0.00052014383,0.00046032533],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002274925,0.0009774538,0.0010165455,0.0011444928,0.0003405628,0.0009420101,0.006182545,0.000801401,0.00004775623],"category_scores_gemma":[0.0002559608,0.00091713504,0.00024032216,0.000864604,0.0011482002,0.002132163,0.0021285967,0.001805225,0.00015729677],"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.00007616187,0.00013263896,0.000015510264,0.00007681688,0.00003824603,0.00015660026,0.0014178307,0.14666247,0.0004003748,0.20503874,0.00034442107,0.6456402],"study_design_scores_gemma":[0.00035959802,0.0003607968,0.000061364146,0.0003102878,0.000015160343,0.00008181364,2.0314019e-7,0.8946671,0.003129304,0.0937733,0.006248888,0.0009921713],"about_ca_topic_score_codex":0.000027842132,"about_ca_topic_score_gemma":0.00005724479,"teacher_disagreement_score":0.7480046,"about_ca_system_score_codex":0.000882116,"about_ca_system_score_gemma":0.0006712993,"threshold_uncertainty_score":0.9993279},"labels":[],"label_agreement":null},{"id":"W2061590884","doi":"10.1109/ase.2011.6100149","title":"Analyzing temporal properties of abstract models","year":2011,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Waterloo","funders":"","keywords":"Model checking; Computer science; Theoretical computer science; Scalability; Programming language; Abstraction model checking; Constraint (computer-aided design); Set (abstract data type); Satisfiability modulo theories; Modulo; Satisfiability; State space; Mathematics","score_opus":0.19708323295053046,"score_gpt":0.285700313853644,"score_spread":0.08861708090311352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061590884","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.072574124,0.00004397714,0.89279366,0.000011675217,0.00007057231,0.00004946663,1.0190028e-7,0.00007155466,0.034384847],"genre_scores_gemma":[0.5361371,0.0000015337079,0.46378434,0.000007094089,0.0000031007119,0.0000017756684,4.3324345e-8,0.0000013608104,0.0000636463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999514,0.000018845567,0.00017127639,0.0001160874,0.00009285285,0.00008698344],"domain_scores_gemma":[0.99951077,0.0000038938774,0.00007266982,0.00032960688,0.000059299593,0.000023771123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032338945,0.00004589179,0.00007003207,0.00005572975,0.00002167264,0.00001395871,0.00044322695,0.00002332247,0.000016912589],"category_scores_gemma":[0.000015861764,0.00003370826,0.00002657867,0.00013351197,0.000031451214,0.0008479835,0.00007178668,0.00003818157,0.0000112534335],"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.000012672975,0.000108839886,0.0016434238,0.00005036342,0.000017388813,0.0000012497268,0.004160513,0.00024068612,0.022795916,0.9137712,0.000040719777,0.057156987],"study_design_scores_gemma":[0.00007251872,0.00004920772,0.0059288377,0.00002280302,0.0000026572202,0.0000029491653,0.00006836453,0.4125949,0.56331307,0.01778307,0.000037741058,0.00012384083],"about_ca_topic_score_codex":0.00018438659,"about_ca_topic_score_gemma":0.000002446351,"teacher_disagreement_score":0.89598817,"about_ca_system_score_codex":0.000007372916,"about_ca_system_score_gemma":0.000021551525,"threshold_uncertainty_score":0.1374583},"labels":[],"label_agreement":null},{"id":"W2062936109","doi":"10.4204/eptcs.57.8","title":"Analysis of Non-Linear Probabilistic Hybrid Systems","year":2011,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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é Laval","funders":"Natural Sciences and Engineering Research Council of Canada; University of Oxford","keywords":"Probabilistic logic; Class (philosophy); Variable (mathematics); Probabilistic analysis of algorithms; Phase portrait; Process (computing); Computer science; Linear approximation; Mathematical optimization; Applied mathematics; Mathematics; Algorithm; Nonlinear system; Artificial intelligence; Bifurcation; Mathematical analysis; Physics","score_opus":0.016288852295071904,"score_gpt":0.2676564201870438,"score_spread":0.2513675678919719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062936109","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.18010926,0.000033728284,0.81576055,0.00001947921,0.000238279,0.00028787923,6.387758e-7,0.00008911849,0.003461067],"genre_scores_gemma":[0.7645832,0.0000055753117,0.23532028,0.000029960604,0.000024584166,0.000027216483,3.2966162e-7,0.0000062881136,0.0000025883292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967919,0.000046394463,0.0006217754,0.0008936217,0.000746832,0.0008994491],"domain_scores_gemma":[0.9984715,0.00008892487,0.00025092645,0.0005801669,0.00045881662,0.00014967096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045359833,0.00020593239,0.000438714,0.0010404941,0.00012732265,0.00012813974,0.003444729,0.000058323905,0.000010334505],"category_scores_gemma":[0.0003307151,0.00018041651,0.00010108421,0.00659454,0.0016640434,0.0009987296,0.00063054444,0.0003369068,0.000008274697],"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.000012627254,0.00010077769,0.00071771804,0.000026971085,0.00002766436,0.0000014746967,0.0008720456,0.0004212881,0.0004852454,0.99407864,0.0000018761183,0.0032537016],"study_design_scores_gemma":[0.00012074818,0.00034969405,0.0043515167,0.000030901785,0.00004110813,0.00001811605,0.000011411695,0.9286829,0.009832373,0.056358214,0.00000787206,0.00019512666],"about_ca_topic_score_codex":0.000014805094,"about_ca_topic_score_gemma":5.6866907e-7,"teacher_disagreement_score":0.9377204,"about_ca_system_score_codex":0.00027951604,"about_ca_system_score_gemma":0.000269647,"threshold_uncertainty_score":0.7357172},"labels":[],"label_agreement":null},{"id":"W2063008354","doi":"10.1145/2651400","title":"Efficient Coverage-Driven Stimulus Generation Using Simultaneous SAT Solving, with Application to SystemVerilog","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 British Columbia","funders":"National Science Council","keywords":"Computer science; Universal asynchronous receiver/transmitter; Exploit; Boolean satisfiability problem; Complement (music); Benchmark (surveying); Algorithm; Speedup; Theoretical computer science; Parallel computing","score_opus":0.02351480804271863,"score_gpt":0.27003769997788096,"score_spread":0.24652289193516233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063008354","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.024394447,0.000042540785,0.97306246,0.000055563225,0.0003340463,0.0017174631,0.000003921895,0.00034743297,0.00004210004],"genre_scores_gemma":[0.6993201,0.0000021458266,0.30036458,0.000029436427,0.00004352315,0.00018209184,0.0000047924623,0.000021377646,0.000031964784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705833,0.0006645227,0.0006525982,0.00057062006,0.0006371341,0.00041680905],"domain_scores_gemma":[0.9973079,0.0004610396,0.00047076738,0.0012961706,0.00035682617,0.00010729226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011877189,0.00025970206,0.00034276108,0.00039533197,0.00029425445,0.0001420593,0.0007596185,0.00013418199,0.0000042012425],"category_scores_gemma":[0.00016158578,0.00024497818,0.000063969055,0.00086950196,0.00003315449,0.000256676,0.000011349212,0.00016795348,0.00006171226],"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.000035758356,0.000083652456,0.000002813971,0.0000602912,0.000034910932,3.2044386e-7,0.00030758494,0.93645614,0.040944535,0.0063293595,0.000006288506,0.015738318],"study_design_scores_gemma":[0.00041173128,0.0008617337,0.000021838869,0.0001086428,0.000038102382,0.00005028488,0.000023296796,0.9790823,0.01895695,0.000071356335,0.00012079753,0.00025299776],"about_ca_topic_score_codex":0.00006878715,"about_ca_topic_score_gemma":0.000009060972,"teacher_disagreement_score":0.6749256,"about_ca_system_score_codex":0.0007466807,"about_ca_system_score_gemma":0.00019479336,"threshold_uncertainty_score":0.99899197},"labels":[],"label_agreement":null},{"id":"W2063121583","doi":"10.1016/s1389-1286(00)00012-8","title":"Feature interaction detection contest of the Fifth International Workshop on Feature Interactions","year":2000,"lang":"en","type":"article","venue":"Computer Networks","topic":"Formal Methods in Verification","field":"Computer Science","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"CONTEST; Feature (linguistics); Computer science; Artificial intelligence; Operations research; Human–computer interaction; Mathematics; Linguistics; Political science","score_opus":0.019547714981176936,"score_gpt":0.28401772511138096,"score_spread":0.26447001013020405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063121583","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.009380864,0.000055399156,0.97527885,0.0028060281,0.009164779,0.0002503283,0.0000022277015,0.00016051684,0.0029009844],"genre_scores_gemma":[0.8936054,0.000053289106,0.101776384,0.0011136339,0.0013269384,0.000030326933,0.000011266324,0.000019840043,0.0020629284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868363,0.00020722447,0.00022694877,0.00039089343,0.0002828128,0.00020850978],"domain_scores_gemma":[0.99855715,0.00021784837,0.00023025136,0.00079661823,0.00014309974,0.000055044766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023053418,0.00019086493,0.00016278085,0.000108337124,0.00018473958,0.00017968017,0.0012217341,0.00014757995,0.00006114574],"category_scores_gemma":[0.000035406716,0.000147203,0.00016066812,0.00056548906,0.000061276456,0.00066433806,0.0001903939,0.0007761093,0.00003480245],"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.00007001057,0.00009727331,0.0001260816,0.000004574029,0.000044981432,0.0000016183994,0.00038172878,0.07526058,0.00012419306,0.0028749164,0.011117425,0.9098966],"study_design_scores_gemma":[0.00022331884,0.00006009449,0.009355282,0.00017207743,0.000008008219,0.000059406128,0.000011244159,0.863769,0.0007813178,0.00014947467,0.12526546,0.00014534305],"about_ca_topic_score_codex":0.000005432395,"about_ca_topic_score_gemma":0.000016532835,"teacher_disagreement_score":0.9097513,"about_ca_system_score_codex":0.00012798783,"about_ca_system_score_gemma":0.000017587487,"threshold_uncertainty_score":0.60027635},"labels":[],"label_agreement":null},{"id":"W2063502165","doi":"10.1016/j.asoc.2014.04.014","title":"Model checking probabilistic social commitments for intelligent agent communication","year":2014,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"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":"Computer science; Probabilistic logic; Multi-agent system; Artificial intelligence; Distributed computing; Computer security; Human–computer interaction","score_opus":0.07946400868594175,"score_gpt":0.32786038193124084,"score_spread":0.2483963732452991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063502165","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.008235623,0.0000148873705,0.9877215,0.0001609591,0.00016542453,0.00068619015,8.8875123e-7,0.00030669963,0.0027078218],"genre_scores_gemma":[0.50863916,6.798991e-7,0.4910127,0.0002236115,0.000042456468,0.00005301356,0.00000843967,0.000011143102,0.0000087998205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847704,0.00011159921,0.00043359265,0.00039280343,0.00024264616,0.0003423022],"domain_scores_gemma":[0.9985055,0.00034283218,0.00029472625,0.00068308756,0.000115396164,0.000058492285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018086507,0.00017152312,0.00021289563,0.00006686013,0.00068486575,0.00016703921,0.0012372483,0.00008470099,7.410959e-7],"category_scores_gemma":[0.00015881719,0.00018572438,0.00007338788,0.00020497278,0.00006736719,0.00013889477,0.0005371112,0.00017846214,0.00001666733],"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.000006341623,0.00006174842,0.00001672686,0.000048250626,0.000011588588,2.5240087e-8,0.0026913693,0.037417576,0.00043864502,0.7102452,0.000118066375,0.24894448],"study_design_scores_gemma":[0.00024064536,0.000020534237,0.0001534456,0.000018105658,0.000008866738,7.6798176e-7,0.000047063866,0.9308307,0.0010495494,0.06645477,0.0009903779,0.0001851384],"about_ca_topic_score_codex":0.0000035480348,"about_ca_topic_score_gemma":0.000001130958,"teacher_disagreement_score":0.8934132,"about_ca_system_score_codex":0.00015800715,"about_ca_system_score_gemma":0.00003463567,"threshold_uncertainty_score":0.757362},"labels":[],"label_agreement":null},{"id":"W2063945695","doi":"10.5555/2682923.2682934","title":"Response property checking via distributed state space exploration","year":2014,"lang":"en","type":"article","venue":"Formal Methods in Computer-Aided Design","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"Liveness; Model checking; Scalability; Computer science; Property (philosophy); State space; State (computer science); Simple (philosophy); Theoretical computer science; Abstraction model checking; Distributed computing; Algorithm; Mathematics","score_opus":0.09403069893817297,"score_gpt":0.3573658922481209,"score_spread":0.2633351933099479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063945695","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.0018270345,0.00002440121,0.9946896,0.00050721935,0.0013919903,0.0008905314,0.000002767,0.00056925317,0.00009720448],"genre_scores_gemma":[0.016880749,0.000009557834,0.9824088,0.00030022932,0.0001289677,0.00016138249,0.000008851449,0.000040573806,0.000060854985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98642296,0.010059482,0.001073944,0.0009332562,0.00055781327,0.0009525205],"domain_scores_gemma":[0.9954282,0.002091073,0.0005082159,0.0014870382,0.00026332735,0.00022211896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.023978475,0.00045374024,0.0005678981,0.00051170355,0.0003015065,0.00040928225,0.0016780614,0.00020586124,0.0000058742485],"category_scores_gemma":[0.0016606728,0.0003700903,0.00012663977,0.00158624,0.00010913976,0.0042594424,0.00067337026,0.0005340544,0.0000559801],"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.00057675684,0.0001306547,0.000057051504,0.0000414591,0.000017567543,0.000012122746,0.001941233,0.06115547,0.013921918,0.0077165994,0.00015674022,0.9142724],"study_design_scores_gemma":[0.0007267661,0.00070312317,0.0016692178,0.00007861085,0.0000058187734,0.000032338223,0.000011483797,0.87999636,0.089866936,0.022878777,0.0035472435,0.0004833076],"about_ca_topic_score_codex":0.000033263943,"about_ca_topic_score_gemma":0.0000017792935,"teacher_disagreement_score":0.9137891,"about_ca_system_score_codex":0.00032087867,"about_ca_system_score_gemma":0.00013099436,"threshold_uncertainty_score":0.9998751},"labels":[],"label_agreement":null},{"id":"W2064923761","doi":"10.1007/s00224-001-1037-z","title":"Pursuit and Evasion on a Ring: An Infinite Hierarchy for Parallel Real-Time Systems","year":2001,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Formal Methods in Verification","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":"Queen's University","funders":"","keywords":"Hierarchy; Integer (computer science); Ring (chemistry); Computer science; Computation; Parallel computing; Memory hierarchy; Execution time; Real number; Algorithm; Discrete mathematics; Mathematics; Programming language","score_opus":0.051753409585569246,"score_gpt":0.3125254380226435,"score_spread":0.26077202843707425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064923761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29901466,0.00015830174,0.6961587,0.000021259835,0.0007055865,0.0007324801,0.0000026837015,0.0002430542,0.0029632535],"genre_scores_gemma":[0.9016922,0.000018790592,0.09766049,0.000021827651,0.0002253275,0.000030027766,0.000004666506,0.000024162046,0.00032247652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972215,0.00097649643,0.0006102229,0.00046485325,0.0003801684,0.0003467484],"domain_scores_gemma":[0.9973917,0.000987938,0.00047505947,0.0008475737,0.00017292588,0.0001248027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00596936,0.00020613238,0.00042064063,0.00023128411,0.00021632672,0.00021961845,0.0008774323,0.000108904234,7.6825654e-7],"category_scores_gemma":[0.00019242075,0.00018827761,0.00005877592,0.00027135535,0.000096937256,0.00033756066,0.00015377367,0.00011442382,0.000012557457],"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.00014448824,0.00007085984,0.00012440699,0.00027728977,0.000026924765,0.000002634843,0.0020550666,0.017052228,0.0034298957,0.95946157,0.000040484745,0.017314153],"study_design_scores_gemma":[0.00064702454,0.0007757295,0.0014438995,0.00054446066,0.000012151822,0.000095674404,0.00018308127,0.9881377,0.00022290427,0.006757879,0.0009161635,0.000263338],"about_ca_topic_score_codex":0.000045382018,"about_ca_topic_score_gemma":2.0349567e-7,"teacher_disagreement_score":0.9710855,"about_ca_system_score_codex":0.000058501817,"about_ca_system_score_gemma":0.00003693512,"threshold_uncertainty_score":0.7677738},"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":"W2065518690","doi":"10.1145/1109118.1109123","title":"Simplifying the design and automating the verification of pipelines with structural hazards","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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 Waterloo","funders":"","keywords":"Computer science; Datapath; Correctness; Pipeline (software); Microprocessor; Pipeline transport; Computer architecture; Formal verification; Embedded system; Programming language","score_opus":0.03096008423381525,"score_gpt":0.2810010768775404,"score_spread":0.25004099264372515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065518690","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.011774677,0.00032534223,0.9860481,0.0006265769,0.000102155056,0.0009477803,0.000001346757,0.00015281941,0.000021228028],"genre_scores_gemma":[0.6691791,0.000020466861,0.3306343,0.000018480374,0.000019668696,0.00009880343,6.144035e-7,0.000009149237,0.000019451998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977309,0.0007824074,0.00056187913,0.00025351535,0.00042453283,0.00024673765],"domain_scores_gemma":[0.99731153,0.00097166107,0.0005335356,0.0009401875,0.00021514474,0.000027958002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021450594,0.00016586253,0.00020278823,0.00013726173,0.0003533025,0.00010019167,0.0008398349,0.000071128314,0.0000038799026],"category_scores_gemma":[0.00012237049,0.000098201555,0.000043994794,0.0005842582,0.000120746634,0.0006010001,0.000008255011,0.00019329741,0.0000031407558],"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.00005412623,0.00003314794,0.00000860025,0.000075711505,0.00008402428,8.427624e-8,0.002330724,0.7557992,0.009966333,0.030033981,0.000024379578,0.20158973],"study_design_scores_gemma":[0.00024774778,0.00027237908,0.0005551413,0.00006646011,0.000032430307,0.00005488332,0.00019108923,0.956721,0.040978182,0.00070058624,0.00007343675,0.00010664859],"about_ca_topic_score_codex":0.000027432388,"about_ca_topic_score_gemma":0.0000030551935,"teacher_disagreement_score":0.65740436,"about_ca_system_score_codex":0.00012273015,"about_ca_system_score_gemma":0.00018651779,"threshold_uncertainty_score":0.4004543},"labels":[],"label_agreement":null},{"id":"W2066882107","doi":"10.4204/eptcs.115.1","title":"On a New Notion of Partial Refinement","year":2013,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Implementation; Computer science; Software implementation; Partial evaluation; Partial function; Software; Programming language; State (computer science); Theoretical computer science; Mathematics","score_opus":0.009488073523694195,"score_gpt":0.26036392529289676,"score_spread":0.2508758517692026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066882107","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.11856059,0.000014479501,0.87525177,0.0009279436,0.00023762042,0.00031334176,6.731887e-8,0.0000875321,0.0046066856],"genre_scores_gemma":[0.7383177,0.0000036486047,0.26138663,0.00020716999,0.000049639497,0.000022246473,1.07129374e-7,0.0000044812186,0.000008346317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747,0.000028076509,0.00039836793,0.00063661137,0.0007246582,0.0007422862],"domain_scores_gemma":[0.9990582,0.00007914954,0.00014426355,0.00035426844,0.00020985768,0.0001542948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018403282,0.0001567444,0.00018538297,0.000312211,0.00010183488,0.00020504576,0.0019870433,0.00005796428,0.00004416084],"category_scores_gemma":[0.00031679086,0.00013365506,0.000041780535,0.0016620195,0.00069260085,0.0010656506,0.0004160312,0.00030501856,0.0000615581],"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.000008596659,0.00006450167,0.000030936102,0.0000065111,0.0000013635959,1.6590417e-7,0.00028869364,0.00005481608,0.0029467337,0.93878776,0.00006154719,0.057748385],"study_design_scores_gemma":[0.00022239785,0.0006795267,0.0011881604,0.000038257494,0.0000011997284,0.0000059507774,0.0000035984945,0.46097392,0.054238707,0.48246115,0.00005482128,0.00013229322],"about_ca_topic_score_codex":0.000012800114,"about_ca_topic_score_gemma":2.2322484e-7,"teacher_disagreement_score":0.6197572,"about_ca_system_score_codex":0.0002656094,"about_ca_system_score_gemma":0.00026733402,"threshold_uncertainty_score":0.5450295},"labels":[],"label_agreement":null},{"id":"W2066969803","doi":"10.1109/ds-rt.2010.31","title":"From DEVS to RTA-DEVS","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Computer science; Extension (predicate logic); Theoretical computer science; Distributed computing; Modeling and simulation; Programming language; Simulation","score_opus":0.01857230148038762,"score_gpt":0.3050017942461155,"score_spread":0.2864294927657279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066969803","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.0908656,0.0000019459553,0.8803219,0.00077789277,0.0012616586,0.000072071125,8.440823e-7,0.00019051835,0.026507564],"genre_scores_gemma":[0.13428964,2.3245408e-7,0.86387086,0.0008938204,0.0001192736,0.000008707299,7.3676534e-7,0.0000034399052,0.0008133083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993417,0.00002320023,0.000118526914,0.00022617623,0.00015093396,0.00013941832],"domain_scores_gemma":[0.99904084,0.000054809658,0.000025948622,0.00073202513,0.00004765635,0.000098745964],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002715184,0.00006118055,0.00006146183,0.000045773075,0.00004549638,0.00010715108,0.00090541993,0.000048441147,0.0002008829],"category_scores_gemma":[0.00016704034,0.000052280062,0.000020661795,0.00021288257,0.000014793739,0.00036716866,0.00018995584,0.000118473974,0.0013619317],"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.0000023852858,0.000020634989,0.00023973122,0.0000011116628,0.000003919774,0.0000013019662,0.0008065962,0.0000082493,0.055476047,0.7362159,0.0049217436,0.2023024],"study_design_scores_gemma":[0.00026220505,0.000095480056,0.03549095,0.0000064337883,0.0000044076173,0.000008852554,0.00005201896,0.09035957,0.41023496,0.047085304,0.41590077,0.0004990417],"about_ca_topic_score_codex":0.00021760359,"about_ca_topic_score_gemma":0.00006239556,"teacher_disagreement_score":0.6891306,"about_ca_system_score_codex":0.000009217734,"about_ca_system_score_gemma":0.000025660982,"threshold_uncertainty_score":0.99941564},"labels":[],"label_agreement":null},{"id":"W2067623660","doi":"10.1007/s100090050045","title":"Formalization and validation of the General Inter-ORB Protocol (GIOP) using PROMELA and SPIN","year":2000,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":51,"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":"Promela; Computer science; Common Object Request Broker Architecture; Model checking; Programming language; Protocol (science); Formal verification; Linear temporal logic; Formal specification; Theoretical computer science","score_opus":0.03510101619760418,"score_gpt":0.34227709844996096,"score_spread":0.30717608225235676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067623660","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.31978676,0.0000061768446,0.67569214,0.00054187205,0.00017181452,0.0037169782,0.000007843362,0.000052963383,0.000023433877],"genre_scores_gemma":[0.41803786,0.000025751364,0.57845896,0.00027526976,0.00010562699,0.0029846388,0.000004049514,0.000022841143,0.00008497323],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989363,0.000055280783,0.00040325275,0.00020255588,0.00026259816,0.0001400064],"domain_scores_gemma":[0.99935,0.000043992015,0.0001089674,0.00019684108,0.00027045922,0.000029736182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038242087,0.00011992786,0.00013021275,0.0002429602,0.00013586064,0.00015892005,0.0006560532,0.00013949604,0.000017925022],"category_scores_gemma":[0.00017176614,0.00008949785,0.000061332226,0.00020916473,0.00013242135,0.0009568074,0.000050323826,0.00020553799,8.134017e-7],"study_design_candidate":"design_other","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.00022966047,0.00012345937,0.0040112576,0.00004590412,0.00008946114,0.0000030994397,0.0003612586,0.00075210974,0.0069068405,0.11907663,0.000026580768,0.86837375],"study_design_scores_gemma":[0.0069488934,0.001979334,0.013921073,0.00088949525,0.00008218274,0.0026724993,0.000067015855,0.112204626,0.7310315,0.09560372,0.033778556,0.00082113565],"about_ca_topic_score_codex":0.0000017849926,"about_ca_topic_score_gemma":6.4283006e-7,"teacher_disagreement_score":0.8675526,"about_ca_system_score_codex":0.00006621621,"about_ca_system_score_gemma":0.000046144414,"threshold_uncertainty_score":0.36496165},"labels":[],"label_agreement":null},{"id":"W2068567751","doi":"10.1109/dsd.2013.31","title":"An Efficient Hardware Implementation of a SAT Problem Solver on FPGA","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Field-programmable gate array; Scalability; Parallel computing; VHDL; Boolean satisfiability problem; Solver; Compiler; Memory footprint; Computer hardware; Backtracking; Algorithm; Embedded system; Programming language","score_opus":0.025233911975929755,"score_gpt":0.3300692443921049,"score_spread":0.3048353324161751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068567751","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.25695184,0.0000025772608,0.73960626,0.00016948192,0.00009716988,0.00042819028,0.0000012691813,0.00009648758,0.0026467459],"genre_scores_gemma":[0.50546753,4.2427325e-7,0.49433485,0.000105209525,0.00000858654,0.000035628666,0.0000025613774,0.0000029354753,0.000042314135],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990828,0.00007381562,0.00021620351,0.00022030607,0.00025708284,0.00014979272],"domain_scores_gemma":[0.99921095,0.000021075282,0.00009940008,0.0004895784,0.00012715913,0.000051812804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033037324,0.00007346498,0.000078624296,0.000078040415,0.000044819222,0.0000686581,0.0004298051,0.000027347236,0.00022290759],"category_scores_gemma":[0.00000866178,0.00005897641,0.000026331256,0.00018915627,0.000019256478,0.00043756707,0.000058674585,0.0000441203,0.00016504405],"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.0000073810443,0.00043850037,0.001833169,0.00006252412,0.000019060491,4.803257e-7,0.004113648,0.0035313016,0.0533651,0.4335316,0.001975372,0.5011219],"study_design_scores_gemma":[0.00051353016,0.0008308413,0.095345765,0.00002507313,0.0000060219018,0.0000024964984,0.00063694385,0.38339028,0.5151474,0.0033743086,0.00046496725,0.00026238913],"about_ca_topic_score_codex":0.00017240318,"about_ca_topic_score_gemma":0.0000058983837,"teacher_disagreement_score":0.50085944,"about_ca_system_score_codex":0.000036869893,"about_ca_system_score_gemma":0.000027703909,"threshold_uncertainty_score":0.24406818},"labels":[],"label_agreement":null},{"id":"W2068726498","doi":"10.1145/839268.839270","title":"Feature specification and automated conflict detection","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Software Engineering and Methodology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":65,"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 Ottawa","funders":"","keywords":"Computer science; Feature (linguistics); Model checking; Formal specification; Formal methods; Specification language; Extractor; Field (mathematics); Software engineering; Programming language; Data mining","score_opus":0.0813120162940838,"score_gpt":0.3161018302563561,"score_spread":0.23478981396227228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068726498","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.008814172,0.00025702943,0.98894477,0.00012468689,0.000701615,0.000121394536,0.000001879047,0.0010206626,0.000013763382],"genre_scores_gemma":[0.05730532,0.00017202583,0.9423321,0.000054766417,0.000014863839,0.000034615674,8.9772124e-7,0.000012993263,0.00007245467],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998958,0.00031316094,0.0001307601,0.00033607116,0.00008169855,0.00018030513],"domain_scores_gemma":[0.9986043,0.0007574012,0.000046912646,0.00046468247,0.000046247886,0.00008047326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008583867,0.000141384,0.00016220604,0.00020108339,0.00013542744,0.000043181604,0.0001694351,0.00017000466,0.0000032535922],"category_scores_gemma":[0.0012145846,0.00014439783,0.000029185394,0.00030119746,0.00003702195,0.00021341689,0.000006170497,0.00026321897,0.0000038506387],"study_design_candidate":"design_other","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.00004417855,0.00007896351,0.000121431636,0.00014118239,0.00011238986,0.0000063546236,0.0018332012,0.014152778,0.048138056,0.0455482,0.00006183551,0.88976145],"study_design_scores_gemma":[0.0018492043,0.00086198415,0.033544473,0.000090749265,0.00012340248,0.0016418828,0.00019595366,0.34397697,0.4955776,0.0031721005,0.117600754,0.0013648983],"about_ca_topic_score_codex":0.000004200977,"about_ca_topic_score_gemma":0.0000010207618,"teacher_disagreement_score":0.8883965,"about_ca_system_score_codex":0.000030484049,"about_ca_system_score_gemma":0.000013053052,"threshold_uncertainty_score":0.58883727},"labels":[],"label_agreement":null},{"id":"W2069313594","doi":"10.2200/s00065ed1v01y200709dcs012","title":"Multiple Valued Logic: Concepts and Representations","year":2007,"lang":"en","type":"article","venue":"Synthesis lectures on digital circuits and systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":136,"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 Victoria","funders":"","keywords":"Computer science; Epistemology; Philosophy","score_opus":0.045807318667635655,"score_gpt":0.3125782211352746,"score_spread":0.26677090246763896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069313594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09340715,0.0009792208,0.8700375,0.000101134254,0.0005817263,0.00053935207,0.000022251314,0.0002340852,0.034097582],"genre_scores_gemma":[0.997175,0.000009920574,0.0024840662,0.00009341085,0.00006912043,0.000024307305,0.0000018399154,0.0000099782355,0.0001323828],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986507,0.000099210025,0.00029401726,0.00042996884,0.0002710892,0.00025495604],"domain_scores_gemma":[0.99826133,0.0010136884,0.00012318445,0.00040776393,0.0000663786,0.00012764042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006556797,0.00015294437,0.00020407904,0.00012615278,0.00018125662,0.0006849297,0.0002686944,0.00008856968,0.0000015840868],"category_scores_gemma":[0.0013021079,0.000121643985,0.000038269718,0.0001911233,0.00010332204,0.0005282338,0.000061176615,0.00009283998,0.000010403149],"study_design_candidate":"observational","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.000024090215,0.00010876234,0.007494792,0.00011889164,0.00007171315,0.000026391237,0.0020288911,0.00026881942,0.003261712,0.47716448,0.00031515723,0.5091163],"study_design_scores_gemma":[0.0037609374,0.0018549892,0.5568769,0.0012399754,0.00013465784,0.0017613453,0.004725691,0.23629117,0.10601615,0.046673346,0.035743356,0.00492147],"about_ca_topic_score_codex":0.000027076967,"about_ca_topic_score_gemma":0.000003823847,"teacher_disagreement_score":0.9037678,"about_ca_system_score_codex":0.000028782435,"about_ca_system_score_gemma":0.000015242072,"threshold_uncertainty_score":0.6604793},"labels":[],"label_agreement":null},{"id":"W2071396752","doi":"10.1007/s10270-007-0076-6","title":"Use Case Maps as a property specification language","year":2007,"lang":"en","type":"article","venue":"Software & Systems Modeling","topic":"Formal Methods in Verification","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":"Computer science; Model checking; Formal specification; Programming language; Rotation formalisms in three dimensions; Property (philosophy); Specification language; Notation; Architectural style; Computation tree logic; Software engineering; Temporal logic; Formal verification; Architecture","score_opus":0.0794449198254544,"score_gpt":0.3125764168692408,"score_spread":0.2331314970437864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071396752","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.075388,0.0003571123,0.9217962,0.000025469866,0.0008916519,0.00047027867,0.00000423181,0.00068355247,0.0003834849],"genre_scores_gemma":[0.56197035,0.0000062148542,0.43729496,0.000043530417,0.00014981446,0.000024461377,0.000006415446,0.000018781437,0.0004854667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980132,0.00015155876,0.0005503258,0.0005083798,0.0003923137,0.00038422013],"domain_scores_gemma":[0.9982642,0.00011364764,0.00017990507,0.0010714675,0.0002325326,0.00013827287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020887274,0.00018023053,0.00018665778,0.00017558054,0.0002202756,0.00036027134,0.00053832453,0.00012272026,0.0000025389102],"category_scores_gemma":[0.0005060566,0.00013884963,0.00006229419,0.00041530706,0.000021871081,0.0012657621,0.00012758466,0.0001968595,0.00013724143],"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.00012930679,0.00036158212,0.0017309313,0.00079456123,0.00011036928,0.0050278315,0.03911535,0.19990912,0.0112441825,0.16424991,0.00085009885,0.57647675],"study_design_scores_gemma":[0.00016062062,0.000041944753,0.000019411087,0.00011530393,0.000008388361,0.002791994,0.0011785915,0.99176824,0.00086609094,0.00028406543,0.002441077,0.00032429353],"about_ca_topic_score_codex":0.0018223878,"about_ca_topic_score_gemma":0.000025934365,"teacher_disagreement_score":0.7918591,"about_ca_system_score_codex":0.00018793985,"about_ca_system_score_gemma":0.00006517459,"threshold_uncertainty_score":0.56621236},"labels":[],"label_agreement":null},{"id":"W2071589114","doi":"10.1109/hldvt.2006.319966","title":"Efficient Automata-Based Assertion-Checker Synthesis of PSL Properties","year":2006,"lang":"en","type":"article","venue":"Proceedings","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Assertion; Automaton; Emulation; Modular design; Programming language; Debugging; Hardware emulation; Set (abstract data type); Theoretical computer science; Software","score_opus":0.020398391524600167,"score_gpt":0.23922219338249248,"score_spread":0.21882380185789232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071589114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7304089,0.00006700842,0.25865504,0.00038239022,0.00018328709,0.0002869028,0.0000012971079,0.00047504247,0.009540119],"genre_scores_gemma":[0.6398998,3.8843052e-7,0.35994604,0.000026898519,0.000021383037,0.000054119715,2.1599259e-7,0.0000066397756,0.00004450559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883425,0.00001352467,0.0003070238,0.00027395206,0.0003670203,0.00020420756],"domain_scores_gemma":[0.9992629,0.00002221643,0.00019317468,0.00020237532,0.0002856952,0.00003363758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000615747,0.00011632821,0.00015052567,0.0001356857,0.0000818335,0.00008873448,0.0005584274,0.000058711037,0.0000050603935],"category_scores_gemma":[0.0002840264,0.000096817894,0.00005548451,0.0004462965,0.00007296457,0.00023184482,0.00007479106,0.00006834702,0.000026884125],"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.00008183028,0.0010676958,0.00817533,0.001073785,0.000031074287,0.000001650356,0.0012137057,0.0047906013,0.2752252,0.67262787,0.0018347378,0.033876512],"study_design_scores_gemma":[0.00007205445,0.000024728526,0.0067081484,0.000051843486,0.000005589871,0.0000019871054,0.000015181462,0.5189885,0.47353905,0.00023383835,0.00026926873,0.00008980265],"about_ca_topic_score_codex":0.000037629063,"about_ca_topic_score_gemma":2.6523898e-7,"teacher_disagreement_score":0.67239404,"about_ca_system_score_codex":0.000054066168,"about_ca_system_score_gemma":0.000049965452,"threshold_uncertainty_score":0.3948119},"labels":[],"label_agreement":null},{"id":"W2073490936","doi":"10.1109/icst.2012.135","title":"A Runtime Monitoring Framework for Event Streams with Non-primitive Arguments","year":2012,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Runtime verification; Temporal logic; Overhead (engineering); Specification language; Programming language; Limit (mathematics); State (computer science); System monitoring; Process (computing); Sequence (biology); Event (particle physics); Formal specification; Real-time computing; Linear temporal logic; Finite-state machine; Distributed computing; Embedded system; Formal verification; Operating system","score_opus":0.03184284827170318,"score_gpt":0.3381982361814578,"score_spread":0.3063553879097546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073490936","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.046132103,0.000021193644,0.95093906,0.000051122934,0.0006594633,0.00032118335,8.7202903e-7,0.0000887626,0.0017862273],"genre_scores_gemma":[0.43925506,0.0000015116668,0.56041896,0.000028699124,0.00010647928,0.00007399979,4.2314122e-7,0.000005585274,0.00010926849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991001,0.000026968659,0.00013416406,0.00020033473,0.00020681754,0.00033165023],"domain_scores_gemma":[0.9992217,0.000109375316,0.00008338284,0.0004166538,0.00006957963,0.00009933103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000382512,0.00010725146,0.00009974542,0.000043986696,0.000095223906,0.00006366202,0.00040714705,0.000055158922,0.000006149595],"category_scores_gemma":[0.00006178074,0.00008239389,0.000034625857,0.00018135799,0.000018078186,0.0008111358,0.00010010385,0.000089259825,0.000039724237],"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.00004856451,0.00038828928,0.041582234,0.000042280826,0.00009372276,7.929266e-7,0.003929364,0.00012061559,0.0012452354,0.7303347,0.000135264,0.22207896],"study_design_scores_gemma":[0.0016677806,0.0012142861,0.26204407,0.00047274635,0.00007274059,0.00002514914,0.001034283,0.08829019,0.60416937,0.036811028,0.0028847153,0.0013136374],"about_ca_topic_score_codex":0.000008589461,"about_ca_topic_score_gemma":1.2333058e-7,"teacher_disagreement_score":0.69352365,"about_ca_system_score_codex":0.00007027098,"about_ca_system_score_gemma":0.000020920901,"threshold_uncertainty_score":0.33599254},"labels":[],"label_agreement":null},{"id":"W2075309900","doi":"10.1145/780822.781144","title":"Points-to analysis using BDDs","year":2003,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Binary decision diagram; Computer science; Algorithm; Solver; Model checking; Simple (philosophy); Data structure; Satisfiability; Theoretical computer science; Programming language","score_opus":0.06622918099250913,"score_gpt":0.3433915543306719,"score_spread":0.2771623733381628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075309900","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.19949399,0.000035705496,0.7971858,0.00017179792,0.00031167123,0.00008122967,0.000001634325,0.00009313916,0.0026250586],"genre_scores_gemma":[0.40349883,7.982972e-7,0.59614617,0.000292726,0.000017842473,0.0000025196723,8.8945444e-7,0.000003896265,0.00003632284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987395,0.00020066864,0.00020751376,0.00034473758,0.00026050146,0.00024710622],"domain_scores_gemma":[0.99832237,0.00019449493,0.000105728715,0.001199745,0.00006801157,0.000109673645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082832284,0.00010927466,0.000165473,0.00030125116,0.000117351374,0.00016521008,0.0012249509,0.000048854763,0.000047080866],"category_scores_gemma":[0.0012085458,0.00010349822,0.00006770328,0.0017528577,0.000021830221,0.00052194233,0.0001629124,0.00007826877,0.00013763134],"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.00003279378,0.00027568816,0.08883579,0.000080344136,0.00096293626,0.00005314311,0.008501492,0.05759178,0.013581482,0.77866477,0.00093464,0.05048516],"study_design_scores_gemma":[0.0006271422,0.00030733342,0.08120882,0.000050666884,0.0008079,0.000027549308,0.0005558912,0.778128,0.08902867,0.017538222,0.030096332,0.0016234268],"about_ca_topic_score_codex":0.000043629454,"about_ca_topic_score_gemma":0.000018518342,"teacher_disagreement_score":0.7611265,"about_ca_system_score_codex":0.00004138868,"about_ca_system_score_gemma":0.00003346005,"threshold_uncertainty_score":0.4220535},"labels":[],"label_agreement":null},{"id":"W2076018800","doi":"10.1007/s10270-010-0176-6","title":"Code generation for a family of executable modelling notations","year":2010,"lang":"en","type":"article","venue":"Software & Systems Modeling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"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; Executable; Programming language; Code generation; Notation; Semantics (computer science); Operational semantics; Generator (circuit theory); Code (set theory); Petri net; Parameterized complexity; Algorithm; Operating system","score_opus":0.10588557448072579,"score_gpt":0.3097429828756449,"score_spread":0.20385740839491912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076018800","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.06462949,0.00016733244,0.9326475,0.000015208233,0.0017241564,0.00052288815,0.000021967984,0.00021849951,0.000052933556],"genre_scores_gemma":[0.45830303,0.0000036387316,0.5413963,0.000012406157,0.00011586259,0.00011439929,0.000010519934,0.00001236717,0.000031472016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848706,0.000056444314,0.00056539103,0.00037334306,0.00027527375,0.0002425218],"domain_scores_gemma":[0.9984027,0.0001062296,0.00022505986,0.00065808755,0.00054597814,0.000061930026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010849537,0.00013313007,0.00021701636,0.0001364935,0.00021886657,0.00013502358,0.00050966494,0.00012156488,4.634641e-7],"category_scores_gemma":[0.00020653597,0.00013728961,0.00007878157,0.00024151354,0.000019087393,0.0007329097,0.000055807563,0.00014887737,0.0000038626804],"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.0000026676535,0.0000156854,0.000021091559,0.00006753235,0.0000068891777,9.7760335e-8,0.0005283719,0.9045291,0.03436111,0.05858565,0.000028175824,0.0018536499],"study_design_scores_gemma":[0.0001585272,0.00002554711,0.0000011720808,0.00003890553,0.00000964228,0.000004591542,0.00006720852,0.9955627,0.0017630279,0.0019811187,0.00024154685,0.00014601761],"about_ca_topic_score_codex":0.0001770705,"about_ca_topic_score_gemma":0.00000826163,"teacher_disagreement_score":0.39367354,"about_ca_system_score_codex":0.00003477204,"about_ca_system_score_gemma":0.00012418599,"threshold_uncertainty_score":0.5598508},"labels":[],"label_agreement":null},{"id":"W2078739669","doi":"10.1145/996841.996860","title":"Symbolic pointer analysis revisited","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":101,"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":"","keywords":"Computer science; Pointer analysis; Pointer (user interface); Compiler; Call graph; Theoretical computer science; Binary decision diagram; Programming language; Optimizing compiler; Static analysis; Algorithm; Artificial intelligence","score_opus":0.01729907821748301,"score_gpt":0.29185562870249004,"score_spread":0.27455655048500704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078739669","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.007578147,0.000020714204,0.97446656,0.0004839874,0.00006179766,0.000044552587,2.98605e-7,0.00020760062,0.017136322],"genre_scores_gemma":[0.31871694,0.0000033108265,0.680459,0.0005134984,0.0000138609485,0.0000027834683,0.0000013377311,0.0000020152247,0.00028723956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993635,0.000037109934,0.00014295868,0.00020441541,0.00013089886,0.000121160636],"domain_scores_gemma":[0.99924856,0.000011856761,0.0000398416,0.0006061339,0.00004892992,0.00004467076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028073665,0.000057003344,0.000101950434,0.00020050014,0.000036264224,0.00007897585,0.00051954447,0.000026207063,0.00006197458],"category_scores_gemma":[0.000044310895,0.000046801884,0.0000851497,0.0015068434,0.0000145249805,0.00035871865,0.000089215326,0.00004880353,0.0002451524],"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":[9.909043e-7,0.000020780826,0.000432237,0.0000026985917,0.00006429192,0.0000017294818,0.00023933126,0.00035839542,0.00029727523,0.99150395,0.00011239272,0.0069659525],"study_design_scores_gemma":[0.0022986063,0.00030258892,0.24819864,0.00005902922,0.0004917039,0.000071128714,0.000107158216,0.4444982,0.12853652,0.15198246,0.021994555,0.0014593843],"about_ca_topic_score_codex":0.000025349545,"about_ca_topic_score_gemma":0.0000029093655,"teacher_disagreement_score":0.83952147,"about_ca_system_score_codex":0.000038439353,"about_ca_system_score_gemma":0.000013259532,"threshold_uncertainty_score":0.31510198},"labels":[],"label_agreement":null},{"id":"W2078940150","doi":"10.1109/tcad.2013.2278491","title":"Debugging RTL Using Structural Dominance","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"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":"","keywords":"Computer science; Debugging; Bottleneck; Boolean satisfiability problem; Speedup; Parallel computing; Formal equivalence checking; Theoretical computer science; Programming language; Formal verification; Algorithm; Embedded system","score_opus":0.052498521200370574,"score_gpt":0.27317165305372476,"score_spread":0.2206731318533542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078940150","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.022222623,0.00011109487,0.9745929,0.000012083411,0.0023943363,0.00040973705,0.000007403588,0.00019594483,0.00005387875],"genre_scores_gemma":[0.7587237,0.000010359815,0.2411265,0.00003388243,0.00005220813,0.000016002985,6.20788e-7,0.000015918546,0.000020869244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975158,0.00065700954,0.0006627017,0.0005225135,0.00032364638,0.00031833813],"domain_scores_gemma":[0.9983243,0.00033255218,0.00032811554,0.00061742926,0.00028015216,0.00011750242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009873989,0.0002863593,0.0004635037,0.0003253199,0.00027461266,0.00023671426,0.00058762555,0.00014890613,0.000002894862],"category_scores_gemma":[0.00001664629,0.0002468235,0.0000866042,0.0005691895,0.00009960033,0.0005630328,0.0000039317338,0.00028082644,0.000004579956],"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.000027954935,0.00006791671,0.000015809821,0.0001469635,0.000098585166,0.000004854764,0.0007843334,0.509462,0.042126384,0.017586416,0.00003222079,0.42964655],"study_design_scores_gemma":[0.0004050037,0.00032009996,0.00006534757,0.00030635478,0.000021143356,0.00014987771,0.000031067382,0.9713216,0.026765162,0.00030512927,0.000053865322,0.00025537208],"about_ca_topic_score_codex":0.00020049185,"about_ca_topic_score_gemma":0.000001670662,"teacher_disagreement_score":0.73650104,"about_ca_system_score_codex":0.00010950312,"about_ca_system_score_gemma":0.00009767152,"threshold_uncertainty_score":0.9999984},"labels":[],"label_agreement":null},{"id":"W2081166128","doi":"10.1145/1878537.1878686","title":"Rational time-advance DEVS (RTA-DEVS)","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Formalism (music); Computer science; Automaton; Model checking; Theoretical computer science; Extension (predicate logic); Modeling and simulation; Programming language; Simulation","score_opus":0.012141111788697706,"score_gpt":0.28329223279049737,"score_spread":0.27115112100179967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081166128","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.00682574,0.0000064366704,0.9386913,0.00042163397,0.000690358,0.0000813668,6.20634e-7,0.00020594425,0.05307658],"genre_scores_gemma":[0.030141512,0.0000010781041,0.96442944,0.00047491275,0.000088366774,0.0000128640795,0.0000022824522,0.0000044496046,0.0048451126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992187,0.000031202282,0.00016110194,0.00022304243,0.00021684253,0.00014910683],"domain_scores_gemma":[0.99917907,0.0000764313,0.000055317047,0.00053271564,0.00009745845,0.000059017344],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004383428,0.00007381971,0.00006546653,0.00004633997,0.00009034077,0.00008982135,0.00069007894,0.000050657967,0.00039334272],"category_scores_gemma":[0.00020007069,0.00006527312,0.000026466607,0.00020891844,0.000043254466,0.00089091825,0.00010747513,0.0001517372,0.0013937334],"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.000001482739,0.000015836733,0.00007028747,0.0000014761611,0.0000018246453,5.001985e-7,0.000050075814,0.000029690756,0.021493843,0.94208837,0.0014357407,0.03481086],"study_design_scores_gemma":[0.00030982538,0.00005698136,0.00922154,0.0000042224415,0.0000028482968,0.000047789872,0.000005456983,0.5756687,0.13929644,0.051407162,0.22359231,0.00038670248],"about_ca_topic_score_codex":0.000004335577,"about_ca_topic_score_gemma":0.000006511253,"teacher_disagreement_score":0.8906812,"about_ca_system_score_codex":0.000012519986,"about_ca_system_score_gemma":0.00006051381,"threshold_uncertainty_score":0.9993838},"labels":[],"label_agreement":null},{"id":"W2081776044","doi":"10.1007/s10878-008-9142-4","title":"Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":21,"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; Group for Research in Decision Analysis","funders":"","keywords":"Heuristics; Satisfiability; Cardinality (data modeling); Propositional formula; Computer science; Theory of computation; Propositional calculus; Boolean satisfiability problem; Algorithm; Propositional variable; Theoretical computer science; Mathematics; Discrete mathematics; Mathematical optimization","score_opus":0.053358679394723676,"score_gpt":0.30089530516683954,"score_spread":0.24753662577211588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081776044","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.16255452,0.000027902748,0.83436704,0.00007837979,0.0025563634,0.00023307456,8.446687e-7,0.00001694985,0.000164915],"genre_scores_gemma":[0.3309772,0.000017288761,0.66884077,0.000025314966,0.00012093292,0.0000021128233,6.1581414e-7,0.000008308357,0.0000074335276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978633,0.00024098776,0.0009189117,0.00019370121,0.0005458771,0.00023722411],"domain_scores_gemma":[0.9982558,0.00012425482,0.00058001344,0.00031445452,0.00059079065,0.00013470046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014588019,0.00013922251,0.00031022597,0.00034362142,0.00011820709,0.00007758382,0.00054542307,0.00011312547,0.000009711253],"category_scores_gemma":[0.0010704928,0.00013884784,0.000062842344,0.0010147638,0.000041201733,0.0012278205,0.00009954872,0.00023784908,0.0000026362645],"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.000059677113,0.00016217037,0.004983586,0.000018159006,0.000007020388,0.000011665383,0.0009867776,0.97606593,0.00053128606,0.016536698,0.00007866364,0.00055834587],"study_design_scores_gemma":[0.001375377,0.00053706986,0.009330694,0.000075740674,0.000009672516,0.00014057901,0.000015464819,0.97879004,0.0019910499,0.0073102494,0.00020558591,0.00021849024],"about_ca_topic_score_codex":0.000029678891,"about_ca_topic_score_gemma":6.870942e-7,"teacher_disagreement_score":0.1684227,"about_ca_system_score_codex":0.00033078034,"about_ca_system_score_gemma":0.00032414406,"threshold_uncertainty_score":0.5662051},"labels":[],"label_agreement":null},{"id":"W2083104467","doi":"10.1145/1377492.1377494","title":"Relations as an abstraction for BDD-based program analysis","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Computer science; Programming language; Binary decision diagram; Theoretical computer science; Language construct","score_opus":0.04614680829532904,"score_gpt":0.3601858993755705,"score_spread":0.3140390910802415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083104467","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.07044612,0.00012461939,0.92752975,0.00012823139,0.00020697768,0.00093180826,0.000008891541,0.00052380015,0.00009981873],"genre_scores_gemma":[0.5777602,0.0000071952936,0.42139804,0.000018518527,0.000025381352,0.0005604385,0.000021285443,0.000009117331,0.00019980219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866474,0.00011561148,0.00032581852,0.00041866914,0.00023311845,0.00024204126],"domain_scores_gemma":[0.9986665,0.00017332709,0.0001470979,0.00076803734,0.00012623728,0.00011877273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005097426,0.00014946403,0.00020148794,0.00033497938,0.0005945314,0.00018876865,0.0003501238,0.00011850114,0.0000051834872],"category_scores_gemma":[0.00006653718,0.0001384546,0.0001405167,0.00080329063,0.0000590355,0.0005477008,0.0000038512558,0.00014407696,0.000008342471],"study_design_candidate":"design_other","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.000040595725,0.0006652919,0.00072505773,0.000069309324,0.00027332225,0.000009953964,0.0017099716,0.013275626,0.0002050136,0.006982011,0.000012717404,0.9760311],"study_design_scores_gemma":[0.0013031898,0.0026088986,0.013563901,0.00007026122,0.00061446946,0.0001735968,0.002330154,0.9516467,0.002609482,0.00034215007,0.023887252,0.0008499756],"about_ca_topic_score_codex":0.00033837234,"about_ca_topic_score_gemma":0.00004376907,"teacher_disagreement_score":0.97518116,"about_ca_system_score_codex":0.000048798367,"about_ca_system_score_gemma":0.000050437025,"threshold_uncertainty_score":0.5646015},"labels":[],"label_agreement":null},{"id":"W2083418238","doi":"10.1109/ccece.2013.6567845","title":"A graphical software tool with integer linear programming for microcontroller input/output interface selection feasibility","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Graphical user interface; Interface (matter); Software; Integer programming; Microcontroller; User interface; XML; Application programming interface; Linear programming; Programming language; Embedded system; Operating system; Algorithm","score_opus":0.026339699984113743,"score_gpt":0.2969687428821628,"score_spread":0.27062904289804907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083418238","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.057477735,0.000014700448,0.93940854,0.00040650615,0.00014235964,0.0020293277,7.4636404e-7,0.00046593542,0.000054140113],"genre_scores_gemma":[0.27228993,5.7091313e-7,0.7266314,0.00017175433,0.000042570788,0.0005031189,0.0000015502663,0.0000121439825,0.00034696312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839544,0.00011131497,0.00034311236,0.0005689659,0.00020852925,0.00037262568],"domain_scores_gemma":[0.99861306,0.00015171061,0.00012654775,0.0004884132,0.00053229125,0.000087977074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000684736,0.0001940295,0.00021686596,0.00011655499,0.00014918926,0.00026868083,0.0005477762,0.00012160625,0.00002413842],"category_scores_gemma":[0.00036363272,0.00013888,0.000093286864,0.00052005117,0.00008243965,0.0010651569,0.00011918399,0.000228259,0.00004330978],"study_design_candidate":"design_other","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.00044109422,0.00067035086,0.018947225,0.00021375502,0.00014114102,8.139202e-7,0.0015957255,0.00040791873,0.008204556,0.02654972,0.002086787,0.9407409],"study_design_scores_gemma":[0.0035889342,0.0024528424,0.020080643,0.00010511999,0.000041334162,0.00008617297,0.00014590658,0.9017384,0.04638159,0.009901852,0.014386552,0.001090658],"about_ca_topic_score_codex":0.000058693382,"about_ca_topic_score_gemma":0.00002157761,"teacher_disagreement_score":0.93965024,"about_ca_system_score_codex":0.000094191135,"about_ca_system_score_gemma":0.00007201518,"threshold_uncertainty_score":0.56633615},"labels":[],"label_agreement":null},{"id":"W2083829851","doi":"10.1145/1101908.1101974","title":"Compositional reasoning for port-based distributed systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"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 Waterloo","funders":"","keywords":"Liveness; Computer science; Distributed computing; Protocol (science); Model checking; Communications protocol; Feature (linguistics); Architecture; Port (circuit theory); Theoretical computer science; Computer network","score_opus":0.028560543182553886,"score_gpt":0.30201203946343363,"score_spread":0.2734514962808797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083829851","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.0011259756,0.00003066123,0.9959879,0.00064117095,0.0002468666,0.00021463985,0.000021284393,0.00022401969,0.0015074876],"genre_scores_gemma":[0.29238814,1.877708e-7,0.7071869,0.0001582913,0.0000757748,0.000050132796,0.000055201504,0.0000031969619,0.00008220293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926966,0.00004041418,0.00018458186,0.00018820129,0.00016132681,0.00015578515],"domain_scores_gemma":[0.9993807,0.00009175131,0.00007560407,0.00028499137,0.00011430518,0.000052667827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004373797,0.00006710332,0.00008114619,0.000039835435,0.000108502994,0.00010820993,0.00035111397,0.000036634163,0.0000081077405],"category_scores_gemma":[0.00005289894,0.0000617421,0.000039480772,0.00014360875,0.000017329123,0.0003298669,0.000028015605,0.000040471386,0.000022656517],"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.000007740551,0.00004185513,0.00010797,0.000013703071,0.000005110277,3.736059e-7,0.000015522099,0.012454028,0.0009912021,0.97864276,0.0024772987,0.005242446],"study_design_scores_gemma":[0.00022655979,0.000033760756,0.0010177053,0.000013901187,0.0000022440977,0.000008044497,0.0000047095923,0.9717194,0.0064681545,0.00019344756,0.020221917,0.0000901605],"about_ca_topic_score_codex":0.0000072571434,"about_ca_topic_score_gemma":7.1400206e-7,"teacher_disagreement_score":0.9784493,"about_ca_system_score_codex":0.000074313975,"about_ca_system_score_gemma":0.000046755904,"threshold_uncertainty_score":0.25177696},"labels":[],"label_agreement":null},{"id":"W2084213867","doi":"10.1016/j.camwa.2003.08.004","title":"Computation of signal output probability for Boolean functions represented by OBDD","year":2004,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Formal Methods in Verification","field":"Computer Science","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":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Boolean function; Discrete mathematics; Integer (computer science); Computation; Algorithm; Variable (mathematics); Probability distribution; Boolean circuit; Maximum satisfiability problem; Computer science; Statistics","score_opus":0.03343385346512235,"score_gpt":0.2863888344368873,"score_spread":0.25295498097176494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084213867","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.0018649454,0.00003374084,0.99477977,0.0004284102,0.00006721668,0.0021766047,0.000032408658,0.00024331656,0.00037357016],"genre_scores_gemma":[0.09312285,0.0000020136147,0.9057832,0.00004281401,0.000030605916,0.0008955655,0.000063549174,0.000018859102,0.00004056465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833006,0.000038324437,0.0005844201,0.0004939805,0.00031265776,0.00024054712],"domain_scores_gemma":[0.9978246,0.00021265449,0.00046680492,0.00094466866,0.00044349293,0.00010776804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045471755,0.00019355053,0.00027520373,0.0001182943,0.00022199386,0.0000845905,0.00075052906,0.00007177828,0.0000010211362],"category_scores_gemma":[0.00004127124,0.00017807813,0.00009118326,0.0006560919,0.00016763942,0.0003257729,0.000119545744,0.00011324956,0.000013441019],"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.00003102098,0.0020031158,0.00008600907,0.00072616746,0.00013504208,3.377961e-7,0.0021202208,0.05857446,0.002256349,0.85539657,0.0022990773,0.076371655],"study_design_scores_gemma":[0.0016753777,0.0004801429,0.00032874173,0.00017189531,0.00008048471,0.000034339184,0.0001760581,0.641063,0.009475028,0.3427808,0.003233366,0.0005007731],"about_ca_topic_score_codex":0.000007207718,"about_ca_topic_score_gemma":0.0000022029676,"teacher_disagreement_score":0.58248854,"about_ca_system_score_codex":0.00011364094,"about_ca_system_score_gemma":0.00012421899,"threshold_uncertainty_score":0.7261815},"labels":[],"label_agreement":null},{"id":"W2085380106","doi":"10.1007/s10009-009-0117-2","title":"Approximating the safely reusable set of learned facts","year":2009,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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":"Theory of computation; Computer science; Set (abstract data type); Programming language; Theoretical computer science","score_opus":0.06439611653173218,"score_gpt":0.34099256682886137,"score_spread":0.2765964502971292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085380106","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.03230713,0.000049815473,0.95410395,0.012269053,0.00057517196,0.00023185714,0.000015303032,0.0002015531,0.00024617434],"genre_scores_gemma":[0.49943075,0.000036449204,0.4996763,0.000684694,0.000081413156,0.000018682527,0.0000038551657,0.000008877028,0.000058980993],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984563,0.000060680195,0.0005469618,0.00023100898,0.00046213865,0.00024293963],"domain_scores_gemma":[0.99861014,0.0002926328,0.00016816493,0.0003996738,0.00049171713,0.000037656286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009400569,0.00014270417,0.00019520376,0.0003286158,0.00016997485,0.00017756587,0.0024052344,0.00016899327,0.000012390085],"category_scores_gemma":[0.0013953038,0.00010301171,0.00014734954,0.00031318658,0.00010024355,0.0007477508,0.000042477008,0.00048950233,0.000010372652],"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.00008785748,0.00006366547,0.00008972113,0.0000049172872,0.00006482648,0.000006623792,0.000246972,0.00050145487,0.0034667458,0.3928904,0.00013596119,0.6024409],"study_design_scores_gemma":[0.0032504392,0.0027832717,0.0033672098,0.000367503,0.000049851104,0.0012115149,0.00028307847,0.016565343,0.37398136,0.5470503,0.05041828,0.0006718645],"about_ca_topic_score_codex":7.292668e-7,"about_ca_topic_score_gemma":3.8378244e-7,"teacher_disagreement_score":0.60176903,"about_ca_system_score_codex":0.00008689698,"about_ca_system_score_gemma":0.000069405156,"threshold_uncertainty_score":0.44695637},"labels":[],"label_agreement":null},{"id":"W2086056248","doi":"10.1109/fmcad.2007.13","title":"Boosting Verification by Automatic Tuning of Decision Procedures","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":94,"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 British Columbia","funders":"","keywords":"Computer science; Heuristics; Parameterized complexity; Solver; Model checking; Boosting (machine learning); Software; Machine learning; Satisfiability modulo theories; Heuristic; Artificial intelligence; Bounded function; Process (computing); Algorithm; Programming language; Mathematics","score_opus":0.019168789614420038,"score_gpt":0.3105799987214886,"score_spread":0.2914112091070686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086056248","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.09874144,0.000054613396,0.8965703,0.000029455237,0.000120612276,0.000106249034,1.9580149e-7,0.00014665147,0.004230456],"genre_scores_gemma":[0.45596156,0.0000021438161,0.5439461,0.00003168405,0.000006660886,0.0000020634686,5.390027e-7,0.000002794632,0.000046489735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989938,0.000029877096,0.0003593673,0.00019161377,0.00026857745,0.00015677787],"domain_scores_gemma":[0.999052,0.00022971914,0.0001851648,0.00039113613,0.0000984324,0.00004358622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015103698,0.00006871639,0.000088105335,0.000101496466,0.00006748946,0.000036884165,0.0004978108,0.00004611707,0.000011722344],"category_scores_gemma":[0.0008913386,0.000061588944,0.000022750584,0.0004185949,0.00002705856,0.0004902052,0.000071647475,0.00005659946,0.000016761935],"study_design_candidate":"design_other","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.0000058345872,0.000049653732,0.00063159014,0.000056825807,0.0000042497986,6.5463485e-7,0.00078478083,0.00003590381,0.13126807,0.08631192,0.00082942116,0.7800211],"study_design_scores_gemma":[0.00018540422,0.00007643479,0.01433422,0.00010113524,0.0000037158366,0.000016276654,0.00013744895,0.55150795,0.42925,0.0035749369,0.0006446911,0.00016779224],"about_ca_topic_score_codex":0.000010569573,"about_ca_topic_score_gemma":0.0000018729337,"teacher_disagreement_score":0.7798533,"about_ca_system_score_codex":0.000034127803,"about_ca_system_score_gemma":0.000034976827,"threshold_uncertainty_score":0.2511524},"labels":[],"label_agreement":null},{"id":"W2087572620","doi":"10.5555/1015090.1015324","title":"Satisfiability and integer programming as complementary tools","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"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 New Brunswick","funders":"","keywords":"Integer programming; Satisfiability; Computer science; Linear programming; Integer (computer science); Boolean satisfiability problem; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics; Programming language","score_opus":0.0462836254713043,"score_gpt":0.3279257747107677,"score_spread":0.2816421492394634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087572620","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.074689105,0.00001648978,0.92040557,0.00088272314,0.0001118758,0.00022291021,4.769744e-7,0.00014778892,0.003523064],"genre_scores_gemma":[0.34852737,0.0000014847212,0.65114164,0.00028975072,0.000009145597,0.000012155247,0.0000010552044,0.0000017569732,0.000015639365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992954,0.000044628043,0.00015363157,0.00023263352,0.00013028999,0.00014341748],"domain_scores_gemma":[0.99949574,0.000043993965,0.000033215078,0.00034054366,0.000032808428,0.00005372096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005039023,0.00006588977,0.00007031172,0.000029265278,0.00007236374,0.00014954571,0.00027981924,0.000021170477,0.000032252283],"category_scores_gemma":[0.00009395285,0.0000562785,0.000016656953,0.00014337737,0.000059188857,0.0007196452,0.00019608316,0.00006690781,0.000029204391],"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.0000014274573,0.000022679558,0.0010683711,0.000007066609,0.0000027919184,7.9221786e-7,0.0003747975,0.000008429638,0.00022030465,0.5793304,0.00001697351,0.41894597],"study_design_scores_gemma":[0.0025598295,0.0014696426,0.16959001,0.00009006548,0.000019868676,0.00021853342,0.0011845796,0.02244541,0.078980416,0.66882837,0.05341354,0.0011997548],"about_ca_topic_score_codex":0.00022337234,"about_ca_topic_score_gemma":0.000021916807,"teacher_disagreement_score":0.41774622,"about_ca_system_score_codex":0.000052768577,"about_ca_system_score_gemma":0.000029169489,"threshold_uncertainty_score":0.22949706},"labels":[],"label_agreement":null},{"id":"W2089187314","doi":"10.1109/aspdac.2007.358006","title":"Efficient Automata-Based Assertion-Checker Synthesis of SEREs for Hardware Emulation","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Emulation; Assertion; Automaton; Programming language; Hardware emulation; Generator (circuit theory); Intersection (aeronautics); Theoretical computer science; Regular expression; Algorithm; Software","score_opus":0.033729124617208804,"score_gpt":0.32441065734554897,"score_spread":0.2906815327283402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089187314","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.054400302,0.0000062667796,0.94372684,0.000111576046,0.00020657548,0.00026963418,0.0000035676328,0.00018595923,0.0010892814],"genre_scores_gemma":[0.47844842,8.3406746e-8,0.5214521,0.00003566174,0.000010553632,0.000016458414,0.0000018154557,0.0000038790013,0.00003097629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898463,0.00004458023,0.00032222146,0.00021891398,0.00025325353,0.00017639055],"domain_scores_gemma":[0.9987282,0.00038320574,0.00015240032,0.00046915992,0.00022270976,0.000044315857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014437848,0.00008433565,0.00011890587,0.00014113559,0.00007163267,0.000031749718,0.0003612201,0.000062961044,0.000011810765],"category_scores_gemma":[0.00051971327,0.00007423424,0.00007245263,0.00029197827,0.00002497913,0.00013081072,0.000034285862,0.000032795957,0.000010527833],"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.0001638121,0.0005871968,0.0028659129,0.00034665936,0.00004244811,0.0000012843077,0.00058680255,0.09442619,0.035213556,0.59773725,0.00044679744,0.26758206],"study_design_scores_gemma":[0.000105705134,0.000028234557,0.020340811,0.000011685899,0.000004425404,3.934227e-7,0.000014370206,0.635715,0.34333873,0.00017543785,0.00020329932,0.00006188664],"about_ca_topic_score_codex":0.000013638413,"about_ca_topic_score_gemma":0.0000038452185,"teacher_disagreement_score":0.59756184,"about_ca_system_score_codex":0.00005082161,"about_ca_system_score_gemma":0.000043223776,"threshold_uncertainty_score":0.30271843},"labels":[],"label_agreement":null},{"id":"W2089939112","doi":"10.1016/j.tcs.2008.03.011","title":"Embedding finite automata within regular expressions","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"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; Automaton; Nondeterministic finite automaton; Timed automaton; Theoretical computer science; Büchi automaton; Set (abstract data type); Deterministic automaton; Algorithm; Expression (computer science); Representation (politics); Automata theory; Programming language","score_opus":0.029109684257736527,"score_gpt":0.3043006566341777,"score_spread":0.2751909723764412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089939112","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.047386885,0.000013339466,0.9480572,0.0003319617,0.0010246019,0.00014411485,9.176351e-7,0.00056362577,0.0024773683],"genre_scores_gemma":[0.48633966,0.000002916583,0.51334727,0.00022406652,0.000059275037,0.0000064125243,3.2420508e-7,0.0000054181214,0.0000146366465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695605,0.0002306094,0.00039173904,0.00083502976,0.0009933524,0.00059320993],"domain_scores_gemma":[0.99729973,0.00031039756,0.0001277958,0.0017366153,0.00019290241,0.00033256024],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023606718,0.00019862979,0.00020753195,0.00024352806,0.0010643165,0.00026867696,0.003928072,0.00007078501,0.000026774544],"category_scores_gemma":[0.00047740573,0.0001635947,0.0000651936,0.0015270159,0.00353291,0.0015596084,0.0016213214,0.00027188784,0.00014909574],"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.0000036694862,0.000041681895,0.000020492915,0.0000037763343,0.0000016609686,0.00002088594,0.0011597337,0.0022717414,0.0019682772,0.9887079,0.000058228332,0.005741931],"study_design_scores_gemma":[0.00014358186,0.00010031351,0.00063643424,0.000037525217,0.0000018461126,0.00016124704,0.0000048925963,0.9123418,0.021650594,0.06457367,0.00012770329,0.00022041239],"about_ca_topic_score_codex":0.0000014431513,"about_ca_topic_score_gemma":3.7854086e-8,"teacher_disagreement_score":0.92413425,"about_ca_system_score_codex":0.000067839435,"about_ca_system_score_gemma":0.00019213445,"threshold_uncertainty_score":0.9991789},"labels":[],"label_agreement":null},{"id":"W2090120682","doi":"10.1109/cacsd.2013.6663474","title":"A mixed approach to rigorous development of control designs","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Component (thermodynamics); Computer science; Notation; Control (management); Controller (irrigation); Cruise control; Modal; Component-based software engineering; Control engineering; Development (topology); Software development; Software; Control system; Software engineering; Engineering; Programming language; Artificial intelligence; Mathematics","score_opus":0.12877057070720818,"score_gpt":0.3008884567431703,"score_spread":0.1721178860359621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090120682","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.003962542,0.000026407519,0.9798726,0.000055094282,0.00056674506,0.001141041,0.0000016708229,0.0001690352,0.014204859],"genre_scores_gemma":[0.12792712,9.1930184e-7,0.8711289,0.00012920395,0.000023568704,0.0004730499,0.0000037696689,0.000010700813,0.00030273214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790275,0.00020977927,0.00059895014,0.0006169767,0.00040164954,0.00026988855],"domain_scores_gemma":[0.9980165,0.00006492397,0.00027315275,0.0012575829,0.00025285297,0.00013498364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011737668,0.00023350619,0.0003900322,0.00019162352,0.00005235236,0.000113935464,0.002119401,0.0002064008,0.000012637911],"category_scores_gemma":[0.000117772324,0.0002009269,0.000073002746,0.00020267094,0.000029661393,0.00014483037,0.00117466,0.0002379874,0.00012633017],"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.000021555892,0.00051000406,0.000072220704,0.0004440323,0.00018776604,7.6415677e-7,0.0077680545,0.0078101875,0.0034645947,0.57418954,0.0023240224,0.40320724],"study_design_scores_gemma":[0.0009068575,0.00013913034,0.010090904,0.00015826778,0.000034246674,0.000012895947,0.00013311587,0.8735742,0.09239496,0.015761659,0.0053473045,0.0014464471],"about_ca_topic_score_codex":0.000048270886,"about_ca_topic_score_gemma":0.0000016553779,"teacher_disagreement_score":0.865764,"about_ca_system_score_codex":0.00011986618,"about_ca_system_score_gemma":0.00034100056,"threshold_uncertainty_score":0.8193561},"labels":[],"label_agreement":null},{"id":"W2090152890","doi":"10.1145/1403375.1403493","title":"Semantics for model-based validation of continuous/discrete systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Semantics (computer science); Representation (politics); Discrete modelling; Programming language; Theoretical computer science; Discrete system","score_opus":0.059309288349836765,"score_gpt":0.3051234034330122,"score_spread":0.24581411508317544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090152890","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.015840713,0.000015582811,0.9822469,0.00007165317,0.00023444367,0.00034016816,0.0000036948002,0.0000959006,0.0011509766],"genre_scores_gemma":[0.4726658,0.0000014079594,0.52706206,0.000020469126,0.000010426462,0.000019644127,0.0000028561956,0.000003468977,0.00021385601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923784,0.00004690974,0.00025966647,0.00016310951,0.000174461,0.000117999574],"domain_scores_gemma":[0.9991078,0.00007567561,0.00014937863,0.00041730204,0.00022021907,0.000029668516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044343038,0.00006667292,0.00013493573,0.00006499864,0.00006321135,0.00002256812,0.00036082152,0.000046193938,8.7108725e-7],"category_scores_gemma":[0.000087235945,0.00005935821,0.000047962705,0.0001451471,0.000037343645,0.00027938272,0.000028072473,0.000028455197,0.0000033944332],"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.000017268962,0.000054185337,0.00042368835,0.00016152197,0.000011463477,5.049581e-7,0.00040128618,0.22052026,0.008415843,0.7680817,0.0007827068,0.0011295592],"study_design_scores_gemma":[0.0001891509,0.000054313667,0.00004845268,0.000010658902,0.0000033342303,0.0000027541275,0.000008518321,0.88008696,0.118699595,0.0006520264,0.00017761909,0.00006659547],"about_ca_topic_score_codex":0.000009767087,"about_ca_topic_score_gemma":1.445085e-7,"teacher_disagreement_score":0.7674297,"about_ca_system_score_codex":0.000017903836,"about_ca_system_score_gemma":0.0000619451,"threshold_uncertainty_score":0.24205576},"labels":[],"label_agreement":null},{"id":"W2090584523","doi":"10.3166/jesa.39.303-318","title":"Lemme de Haar sur diverses structures idempotentes. Applications à la comparaison et au contrôle de systèmes à événements discrets","year":2005,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy","score_opus":0.053593160290932175,"score_gpt":0.32868343906084463,"score_spread":0.27509027876991243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090584523","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.05626348,0.011858155,0.9200483,0.0037556195,0.0012736066,0.00083254016,0.00009781673,0.00041100793,0.005459481],"genre_scores_gemma":[0.53741074,0.0013619486,0.4577767,0.0006143646,0.00075218204,0.00006290628,0.000009240776,0.000074805954,0.001937118],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99179846,0.0035284671,0.0015149721,0.00068093435,0.0010387847,0.001438403],"domain_scores_gemma":[0.99552983,0.0007496886,0.0014893664,0.0009092123,0.0005591382,0.00076278456],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004167407,0.0006565551,0.00080953405,0.00037919942,0.0012845043,0.001944911,0.0020636448,0.0003201001,0.00015242654],"category_scores_gemma":[0.0008922781,0.00064117037,0.0003787887,0.000715117,0.0006821868,0.0029319252,0.00053750665,0.0010740503,0.0002430483],"study_design_candidate":"design_other","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.000038562008,0.0004510071,0.011076221,0.00078300666,0.00034434043,0.00015194056,0.0069758976,0.013611794,0.0015874973,0.34901005,0.006026958,0.60994273],"study_design_scores_gemma":[0.001211968,0.00018295636,0.5874726,0.0012134643,0.00021023833,0.0049338294,0.00029962536,0.32424372,0.0008147333,0.023997772,0.05474345,0.00067562424],"about_ca_topic_score_codex":0.0008232492,"about_ca_topic_score_gemma":0.00018932152,"teacher_disagreement_score":0.6092671,"about_ca_system_score_codex":0.002125665,"about_ca_system_score_gemma":0.0012596153,"threshold_uncertainty_score":0.999604},"labels":[],"label_agreement":null},{"id":"W2090852585","doi":"10.1109/tcad.2013.2263036","title":"Path-Directed Abstraction and Refinement for SAT-Based Design Debugging","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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":"","keywords":"Debugging; Computer science; TRACE (psycholinguistics); Abstraction; Path (computing); Representation (politics); Programming language; Algorithmic program debugging; Theoretical computer science; Algorithm","score_opus":0.05912471977764951,"score_gpt":0.26176545369754917,"score_spread":0.20264073391989965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090852585","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.0032735544,0.00014469026,0.9931079,0.00006333529,0.0011736762,0.0018152766,0.000016635297,0.00038632387,0.000018615916],"genre_scores_gemma":[0.60403025,0.00002248641,0.3954538,0.000051148527,0.000026919251,0.00036349954,0.0000037084164,0.000019155983,0.000029027724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975759,0.0005021833,0.00073852815,0.0005743846,0.0002886649,0.00032033847],"domain_scores_gemma":[0.9977217,0.00080412225,0.00034478976,0.00046154423,0.00051991,0.00014793448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010939708,0.00030998362,0.0004258592,0.00038690146,0.0002719449,0.00033107476,0.00031710375,0.0001800044,0.000006662879],"category_scores_gemma":[0.000023313381,0.0002702448,0.00007782115,0.0004167196,0.000072160445,0.000537596,0.0000023282914,0.00022065772,0.0000070842325],"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.0000954577,0.0004189314,0.00000961596,0.00047630176,0.00021886732,0.0000039319293,0.00071678485,0.220618,0.093045995,0.0019124988,0.000824485,0.68165916],"study_design_scores_gemma":[0.00077014376,0.0008812188,0.00017797264,0.00032634102,0.000034134144,0.000033877623,0.000055310305,0.9616119,0.035557117,0.00019745549,0.00008377422,0.0002707017],"about_ca_topic_score_codex":0.00030188184,"about_ca_topic_score_gemma":0.0000017232162,"teacher_disagreement_score":0.740994,"about_ca_system_score_codex":0.00012044592,"about_ca_system_score_gemma":0.00014076901,"threshold_uncertainty_score":0.99997497},"labels":[],"label_agreement":null},{"id":"W2091011159","doi":"10.1080/0020716031000148205","title":"Language equations for timed alternating finite automata","year":2003,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Lethbridge","funders":"","keywords":"Computation; Computer science; Automaton; Finite-state machine; Timed automaton; Deterministic automaton; ω-automaton; Set (abstract data type); Quantum finite automata; Asynchronous communication; Theoretical computer science; Automata theory; Algorithm; Algebra over a field; Mathematics; Programming language; Pure mathematics","score_opus":0.04358645793215987,"score_gpt":0.3512650919097619,"score_spread":0.30767863397760203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091011159","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.0033953434,0.000037765338,0.9929966,0.00033435665,0.0022687141,0.00012982101,0.0000049290315,0.000048776183,0.00078369933],"genre_scores_gemma":[0.084466025,0.0000062263434,0.9149326,0.00019073342,0.00030524618,0.000006224799,0.0000022118347,0.000011857276,0.000078869365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983478,0.0000800269,0.0007099731,0.0001272797,0.00058320013,0.00015172287],"domain_scores_gemma":[0.99719507,0.0009302783,0.00078052934,0.00030052665,0.00072624435,0.00006735769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013217754,0.000118393174,0.00019200696,0.00025336028,0.00005358785,0.00024869686,0.0014693458,0.000043103955,0.000013632843],"category_scores_gemma":[0.0011585408,0.00010593083,0.00014598454,0.00013507667,0.0000229925,0.00066193205,0.00010409014,0.00012756648,0.000018156028],"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.000007265244,0.00028525898,0.000022213677,0.000037796137,0.00018528792,0.000024998135,0.0040460504,0.008274942,0.0007370162,0.9345735,0.00067776255,0.051127918],"study_design_scores_gemma":[0.0007060603,0.00010589906,0.000036844285,0.00010319236,0.000012893661,0.00021532258,0.000044735116,0.95617205,0.0047278595,0.035165224,0.0025845584,0.00012536751],"about_ca_topic_score_codex":6.514665e-7,"about_ca_topic_score_gemma":2.3602153e-7,"teacher_disagreement_score":0.9478971,"about_ca_system_score_codex":0.00007976967,"about_ca_system_score_gemma":0.00009490581,"threshold_uncertainty_score":0.43197337},"labels":[],"label_agreement":null},{"id":"W2091601951","doi":"10.3166/objet.9.4.115-134","title":"Theorem Proving Support for View Consistency Checking","year":2003,"lang":"en","type":"article","venue":"L objet","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Consistency (knowledge bases); Calculus (dental); Computer science; Automated theorem proving; Mathematics; Programming language; Discrete mathematics; Medicine","score_opus":0.044308475529533944,"score_gpt":0.3107443345924043,"score_spread":0.2664358590628704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091601951","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.0009231912,0.00010626185,0.9579095,0.00009288175,0.0005640206,0.00033502583,0.0000013546253,0.00012491811,0.039942842],"genre_scores_gemma":[0.12748331,0.000006945367,0.87158394,0.00037107576,0.000027079066,0.000064137785,0.0000015786279,0.000008715916,0.00045321762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990979,0.00009508918,0.0002058304,0.0002498581,0.00012538706,0.00022596543],"domain_scores_gemma":[0.99921495,0.00009070192,0.000098144716,0.0004744495,0.00007577351,0.00004595371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012178975,0.000086760614,0.00011805723,0.000040233375,0.000118909935,0.00008543817,0.00039808496,0.000043308406,0.000023259874],"category_scores_gemma":[0.0005178591,0.00007892458,0.000056084682,0.00017597848,0.000035222904,0.0003508005,0.00004490206,0.00006360329,0.000033048145],"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.0000012154028,0.00001581207,0.00013339368,0.000040501338,0.0000038815047,9.60417e-7,0.00032387435,0.0000052920795,0.00065676024,0.9561236,0.00015118075,0.04254353],"study_design_scores_gemma":[0.0011700942,0.0005046145,0.0024881305,0.00015411225,0.000039151375,0.0001857824,0.0002422609,0.06267058,0.16719589,0.16562286,0.5987066,0.0010199331],"about_ca_topic_score_codex":0.0000013587422,"about_ca_topic_score_gemma":7.159671e-7,"teacher_disagreement_score":0.79050076,"about_ca_system_score_codex":0.00003143332,"about_ca_system_score_gemma":0.00009348286,"threshold_uncertainty_score":0.3218451},"labels":[],"label_agreement":null},{"id":"W2091607538","doi":"10.1109/lics.2013.38","title":"Stone Duality for Markov Processes","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Probabilistic logic; Markov chain; Duality (order theory); Countable set; Mathematics; Completeness (order theory); Algebra over a field; Algebraic number; Stone's representation theorem for Boolean algebras; Modal logic; Markov process; Complete Boolean algebra; Markov kernel; Algebraic structure; Free Boolean algebra; Discrete mathematics; Modal; Pure mathematics; Two-element Boolean algebra; Markov model; Variable-order Markov model; Algebra representation","score_opus":0.040697512796563584,"score_gpt":0.3221777949655652,"score_spread":0.2814802821690016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091607538","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.0049862177,0.000018485816,0.984918,0.00083122094,0.0001607661,0.00033400612,5.833335e-7,0.0001658973,0.008584809],"genre_scores_gemma":[0.057108674,0.0000025066088,0.94047725,0.00033247255,0.000027271994,0.00017896388,8.329648e-7,0.0000029626362,0.0018690621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999457,0.000027040298,0.00011721312,0.0001712134,0.00009709215,0.00013046083],"domain_scores_gemma":[0.99929225,0.0000954261,0.000041743133,0.0003277747,0.00020537488,0.00003744039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003451241,0.000049911952,0.000057948644,0.000023819963,0.000054162727,0.00010001746,0.00042985668,0.00002594072,0.000058249145],"category_scores_gemma":[0.00031930153,0.00003959253,0.000016171285,0.00018512798,0.000020225043,0.00078782823,0.00006919824,0.000025939264,0.00010045629],"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.000004597602,0.00009584148,0.00045978976,0.00022324086,0.000009200229,1.3106012e-7,0.000496677,0.000007030639,0.0017959494,0.6318398,0.017293697,0.347774],"study_design_scores_gemma":[0.00095959206,0.00041333967,0.06329028,0.000033689284,0.000010410359,0.00002017284,0.00021575407,0.35636473,0.27094382,0.22964291,0.07719108,0.0009142226],"about_ca_topic_score_codex":0.000026705684,"about_ca_topic_score_gemma":0.0000022716938,"teacher_disagreement_score":0.4021969,"about_ca_system_score_codex":0.000012902715,"about_ca_system_score_gemma":0.000038084567,"threshold_uncertainty_score":0.16145365},"labels":[],"label_agreement":null},{"id":"W2091661303","doi":"10.1016/j.cosrev.2013.05.001","title":"A survey of timed automata for the development of real-time systems","year":2013,"lang":"en","type":"article","venue":"Computer Science Review","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Automaton; Formalism (music); Semantics (computer science); Timed automaton; Theoretical computer science; Model checking; Programming language","score_opus":0.09551778634109966,"score_gpt":0.34979943924560425,"score_spread":0.2542816529045046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091661303","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.0007798508,0.0048308247,0.992274,0.00010695921,0.00044900813,0.0013991428,0.0000018366006,0.00004842204,0.00010995556],"genre_scores_gemma":[0.008454024,0.0012708969,0.99001634,0.000055341512,0.000014509572,0.00015671554,0.0000016833055,0.0000048606507,0.000025651116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979289,0.00021989674,0.0007481293,0.00034424447,0.00050752837,0.0002512563],"domain_scores_gemma":[0.9968308,0.0005061989,0.00049569213,0.0012295804,0.0008670595,0.00007066094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008874647,0.00011328724,0.00036784666,0.00008388342,0.00014695928,0.000098039265,0.003247065,0.000022999247,0.000005031932],"category_scores_gemma":[0.00034521314,0.000070732,0.00005304485,0.0013976457,0.00025418695,0.0006246711,0.00052887166,0.000040662195,0.000053046842],"study_design_candidate":"design_other","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":[6.7887953e-7,0.000042811,0.000051508036,0.0016881245,0.000012877017,4.5657842e-8,0.000286122,0.000057855836,0.0014665901,0.006407644,0.0013089585,0.9886768],"study_design_scores_gemma":[0.00007465317,0.000052813433,0.047092997,0.0013028402,0.000006423645,0.0000041929125,0.0000011222611,0.9489501,0.0010862811,0.00005167558,0.0012600097,0.00011685327],"about_ca_topic_score_codex":0.00006611537,"about_ca_topic_score_gemma":7.895446e-7,"teacher_disagreement_score":0.9885599,"about_ca_system_score_codex":0.000045203462,"about_ca_system_score_gemma":0.000496055,"threshold_uncertainty_score":0.6033909},"labels":[],"label_agreement":null},{"id":"W2092844858","doi":"10.1016/j.scico.2006.04.008","title":"Using source transformation to test and model check implicit-invocation systems","year":2006,"lang":"en","type":"article","venue":"Science of Computer Programming","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":"Queen's University","funders":"","keywords":"Computer science; Programming language; Executable; Model transformation; Transformation (genetics); Invocation; Program transformation; Source code; Software system; Software engineering; Software; Artificial intelligence","score_opus":0.03677212379515102,"score_gpt":0.30870860501789044,"score_spread":0.2719364812227394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092844858","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.18151146,0.000026803076,0.8176207,0.000068326604,0.0001751004,0.0003972537,4.977092e-7,0.00010498876,0.000094875],"genre_scores_gemma":[0.48202285,4.2384693e-7,0.517915,0.000012500693,0.000031731568,0.000009955472,4.5866963e-7,0.000003616805,0.000003446189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830186,0.00003250551,0.0004144496,0.00039773967,0.0005041966,0.00034923802],"domain_scores_gemma":[0.9990104,0.00003879872,0.00018623823,0.000391527,0.00027314163,0.00009991365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001524627,0.00012681358,0.00015460249,0.0003276184,0.00027622702,0.0004954004,0.00075947447,0.000042074033,7.7929606e-8],"category_scores_gemma":[0.00003471442,0.00012451052,0.000026859894,0.0013065434,0.00015823357,0.0018369827,0.00017345947,0.00006823852,0.0000017264146],"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.00000256003,0.0000975509,0.00032602184,0.00010565756,0.0000020059215,2.141436e-7,0.0023087056,0.4472805,0.063131124,0.14420073,0.000006417387,0.3425385],"study_design_scores_gemma":[0.00009311921,0.00009891794,0.00075250026,0.000053084525,0.000003244133,0.000019763358,0.000042930926,0.9858558,0.012031665,0.00078429317,0.0001235501,0.00014113961],"about_ca_topic_score_codex":0.00013361398,"about_ca_topic_score_gemma":0.0000022892648,"teacher_disagreement_score":0.5385753,"about_ca_system_score_codex":0.000091800546,"about_ca_system_score_gemma":0.00012067596,"threshold_uncertainty_score":0.5077392},"labels":[],"label_agreement":null},{"id":"W2094368841","doi":"10.1145/1822327.1822333","title":"Scalable formula decomposition for propositional satisfiability","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"DPLL algorithm; Satisfiability; Computer science; Probabilistic logic; Scalability; Boolean satisfiability problem; Propositional formula; Theoretical computer science; Decomposition; Conjunctive normal form; Algorithm; Propositional variable; Artificial intelligence","score_opus":0.01586873743303921,"score_gpt":0.326603456725126,"score_spread":0.31073471929208674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094368841","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.041298397,0.0000016696836,0.9519465,0.0005640416,0.00052765064,0.000419577,0.0000039273295,0.00017361355,0.0050646393],"genre_scores_gemma":[0.28966823,1.7389348e-7,0.7099469,0.00013186294,0.00005015047,0.00008732525,0.0000077549275,0.0000032174441,0.00010438086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992285,0.000028970087,0.00017256735,0.0002511553,0.00015096522,0.00016785067],"domain_scores_gemma":[0.9992042,0.00009715844,0.000050909555,0.00042720416,0.0001617288,0.000058793335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006983188,0.00007101504,0.00007086722,0.000043501615,0.00016475315,0.00010232471,0.00038719096,0.0000645447,0.000058484155],"category_scores_gemma":[0.00010760071,0.000062299165,0.00004824283,0.0001343726,0.00004198073,0.0008165697,0.00006472521,0.000097421274,0.000034862147],"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.000006520521,0.00005073197,0.00032936048,0.0000123039445,0.0000022934091,6.147253e-8,0.000030139265,0.000010920325,0.046607453,0.91967815,0.00037775355,0.032894302],"study_design_scores_gemma":[0.00035751465,0.00013652552,0.019969534,0.000004416742,0.000004066262,0.000024172192,0.0000034025065,0.5056485,0.2427585,0.22587807,0.0050165276,0.00019876489],"about_ca_topic_score_codex":0.000009599257,"about_ca_topic_score_gemma":0.000011024099,"teacher_disagreement_score":0.6938001,"about_ca_system_score_codex":0.000027447895,"about_ca_system_score_gemma":0.00004846295,"threshold_uncertainty_score":0.25404865},"labels":[],"label_agreement":null},{"id":"W2094376641","doi":"10.1145/1292316.1292327","title":"Specification and verification of trustworthy component-based real-time reactive systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Trustworthiness; Component (thermodynamics); Computer science; Formal verification; Model checking; Formal methods; Formal specification; Protocol (science); Software engineering; Computer security; Programming language","score_opus":0.02083359258631319,"score_gpt":0.27289513557664025,"score_spread":0.25206154299032707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094376641","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.099546604,0.000033956774,0.8863985,0.00006511942,0.00018934377,0.00029411368,0.0000017005427,0.00013724325,0.013333401],"genre_scores_gemma":[0.58938,0.0000137728075,0.4104496,0.000011188665,0.00002616696,0.000007883238,0.000009236182,0.0000058556907,0.00009629541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987142,0.000121182136,0.00041662971,0.00031316275,0.00027236532,0.00016246624],"domain_scores_gemma":[0.9985679,0.00019472586,0.0003225258,0.00065323676,0.00019032459,0.00007132346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016738104,0.00010333703,0.00016248139,0.00017626067,0.00006155752,0.00004758184,0.00033228658,0.00007478265,0.0000061459023],"category_scores_gemma":[0.00006136356,0.000099060526,0.000027717484,0.0003936548,0.0000792182,0.0004188659,0.000034705543,0.000066570894,0.000025946254],"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.0000812679,0.00013997807,0.0011323793,0.000056935813,0.000014653761,0.0000012410969,0.00044383036,0.0002632052,0.32682988,0.6399044,0.00012118322,0.031011056],"study_design_scores_gemma":[0.0005322918,0.00016542751,0.1905107,0.000044125078,0.000013151206,0.000012369474,0.0001860799,0.5653844,0.2406022,0.00047140045,0.0017902545,0.00028762178],"about_ca_topic_score_codex":0.00012910328,"about_ca_topic_score_gemma":0.0000014051467,"teacher_disagreement_score":0.63943297,"about_ca_system_score_codex":0.00007464798,"about_ca_system_score_gemma":0.000031806074,"threshold_uncertainty_score":0.4039571},"labels":[],"label_agreement":null},{"id":"W2094437360","doi":"10.1016/j.scico.2013.11.005","title":"Infeasible paths in object-oriented programs","year":2013,"lang":"en","type":"article","venue":"Science of Computer Programming","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 Waterloo","funders":"","keywords":"Dataflow; Computer science; Reachability; Traverse; Control flow; Control flow graph; Graph; Program analysis; Reachability problem; Path (computing); Theoretical computer science; Algorithm; Context (archaeology); Call graph; Data-flow analysis; Data flow diagram; Parallel computing; Programming language","score_opus":0.022254709808713774,"score_gpt":0.2856804653230817,"score_spread":0.263425755514368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094437360","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.23307943,0.000029281055,0.764719,0.00009473348,0.0006162593,0.00076894514,8.767723e-8,0.00018819359,0.0005040705],"genre_scores_gemma":[0.42541838,0.0000012774584,0.5744422,0.000023877561,0.00002331089,0.00007803036,5.137864e-7,0.000004368489,0.000008059772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973747,0.00009000486,0.00050351763,0.0006058363,0.0007425982,0.0006833193],"domain_scores_gemma":[0.99835134,0.000041045783,0.00022900442,0.00080888835,0.00041252273,0.0001572228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018230022,0.00016531539,0.00022095727,0.0005237903,0.00013949547,0.00044238725,0.0019829418,0.000056398705,0.0000044625367],"category_scores_gemma":[0.000100560705,0.00015064968,0.00005809085,0.003932462,0.00055594085,0.00293086,0.0006584554,0.00017755378,0.000039605184],"study_design_candidate":"design_other","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.0000010823784,0.00015335076,0.0062859054,0.000023114282,0.0000017866519,0.0000014807038,0.0011159662,0.000089588524,0.0014288365,0.058339752,0.000008339082,0.9325508],"study_design_scores_gemma":[0.00067270437,0.00079535454,0.07621592,0.00023574012,0.000003119818,0.00003221686,0.00018697056,0.8913233,0.019840604,0.007811236,0.0023108434,0.0005719298],"about_ca_topic_score_codex":0.00015450484,"about_ca_topic_score_gemma":0.0000048373195,"teacher_disagreement_score":0.9319789,"about_ca_system_score_codex":0.000094744486,"about_ca_system_score_gemma":0.00023111564,"threshold_uncertainty_score":0.61433154},"labels":[],"label_agreement":null},{"id":"W2094838194","doi":"10.1007/s001650070035","title":"Algebraic Composition of Function Tables","year":2000,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Composition (language); Theory of computation; Notation; Mathematical proof; Algebra over a field; Representation (politics); Computer science; Function (biology); Mathematics; Theoretical computer science; Algorithm; Pure mathematics; Arithmetic","score_opus":0.012689989583964247,"score_gpt":0.2507308861064802,"score_spread":0.23804089652251595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094838194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37359053,0.00004792099,0.6116895,0.00002041497,0.00017968878,0.00008820514,0.0000011362945,0.00008041255,0.014302199],"genre_scores_gemma":[0.74418515,0.0000034577547,0.25570855,0.000030017041,0.00004847392,8.547021e-7,0.0000048027214,0.0000048718325,0.000013844465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876106,0.0000723214,0.00045138877,0.00018790929,0.0002876168,0.00023973278],"domain_scores_gemma":[0.9991509,0.00006751777,0.00027230944,0.0003475163,0.00012077985,0.00004099363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005487703,0.0001073801,0.00019937905,0.000120276105,0.00011173336,0.000028754026,0.0004775411,0.00005245993,0.000065073844],"category_scores_gemma":[0.000017801645,0.00010794006,0.000071854614,0.00044473732,0.000057987523,0.0009993816,0.000105302955,0.000100138444,0.000022085056],"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.00003600719,0.00009503494,0.000147377,0.00008184825,0.000019701074,8.222603e-7,0.00059127586,0.0070874183,0.009155689,0.66510725,0.00003122641,0.31764638],"study_design_scores_gemma":[0.00059770944,0.0006436624,0.03984799,0.00017888875,0.000019219735,0.000039113253,0.000050768886,0.74586123,0.18709117,0.024854353,0.0005376747,0.00027824097],"about_ca_topic_score_codex":0.000024663059,"about_ca_topic_score_gemma":7.4424804e-7,"teacher_disagreement_score":0.73877376,"about_ca_system_score_codex":0.000025123274,"about_ca_system_score_gemma":0.000032863958,"threshold_uncertainty_score":0.4401668},"labels":[],"label_agreement":null},{"id":"W2095956920","doi":"10.1109/hase.2007.52","title":"A Formal Approach to Website Maintenance","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"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 Windsor","funders":"","keywords":"Correctness; Computer science; Model checking; Automaton; Formal verification; The Internet; Software engineering; Temporal logic; Programming language; Web application; Theoretical computer science; World Wide Web","score_opus":0.028166827431127413,"score_gpt":0.2901603247418721,"score_spread":0.26199349731074467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095956920","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.0015450964,0.0000037788197,0.7438928,0.00011074353,0.00016234978,0.00011179435,1.4014502e-7,0.00015135384,0.2540219],"genre_scores_gemma":[0.14130133,5.0981765e-7,0.855673,0.0010438983,0.000035725243,0.000008140054,3.2590395e-7,0.0000035893952,0.0019334558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990302,0.000017937573,0.00016504689,0.00023313786,0.00018411159,0.00036962022],"domain_scores_gemma":[0.99928117,0.00002289358,0.000032783948,0.00049294194,0.000057416906,0.00011277675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014504099,0.0000709907,0.000068352136,0.00009185538,0.000065271735,0.00006080119,0.000734215,0.0000345267,0.0000053800118],"category_scores_gemma":[0.00006586259,0.000058317346,0.000028123774,0.0004894187,0.000015814005,0.0007231371,0.0002128587,0.0000707395,0.00024088567],"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.000005999499,0.000026505291,0.00007039498,0.0000037590282,0.0000015301489,8.679226e-7,0.0003160911,0.00004023861,0.0005448745,0.91433346,0.0012027578,0.08345355],"study_design_scores_gemma":[0.0007681959,0.00034048271,0.08413119,0.000024351968,0.0000048512056,0.00020401868,0.0003472343,0.5798698,0.06449267,0.009792447,0.2590667,0.00095803215],"about_ca_topic_score_codex":0.000009086805,"about_ca_topic_score_gemma":0.0000021051922,"teacher_disagreement_score":0.904541,"about_ca_system_score_codex":0.000041075895,"about_ca_system_score_gemma":0.000014169915,"threshold_uncertainty_score":0.30961782},"labels":[],"label_agreement":null},{"id":"W2096009274","doi":"10.1109/aiccsa.2003.1227511","title":"Timed alternating finite automata","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 Lethbridge","funders":"","keywords":"Computer science; Computation; Automaton; Finite-state machine; ω-automaton; Asynchronous communication; Timed automaton; Deterministic automaton; Quantum finite automata; Set (abstract data type); Deterministic finite automaton; Theoretical computer science; Automata theory; Nondeterministic finite automaton; Algorithm; Programming language","score_opus":0.026405146480071768,"score_gpt":0.2935545732813409,"score_spread":0.26714942680126913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096009274","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.0056876596,0.000006119502,0.9614165,0.00042998264,0.0002667564,0.000051027328,1.8518953e-7,0.000415004,0.031726766],"genre_scores_gemma":[0.18934059,0.0000016527982,0.8100571,0.00028743673,0.00002552341,0.000004489231,4.5440368e-7,0.000002898151,0.00027984398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994067,0.000023097486,0.00012154619,0.00016516633,0.00015277324,0.00013072831],"domain_scores_gemma":[0.99941057,0.000036964484,0.00004433929,0.0004433764,0.0000269477,0.00003778595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030650003,0.000051817584,0.000048676797,0.000045239714,0.00005334973,0.000080467515,0.0006533513,0.000022062566,0.000016926107],"category_scores_gemma":[0.0001382884,0.000045721703,0.000019312234,0.00019240758,0.000014008884,0.0004973413,0.00014458994,0.000054103835,0.00037272292],"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":[7.1058906e-7,0.000025439334,0.000050805724,0.0000041171434,0.0000035317062,0.000004068206,0.0002927456,0.003590559,0.0011379486,0.90483916,0.00006264204,0.08998825],"study_design_scores_gemma":[0.00041622744,0.000052243282,0.002636732,0.000015740326,0.0000013352668,0.000017219449,0.000007470003,0.90014577,0.06187741,0.03249158,0.002173945,0.0001643329],"about_ca_topic_score_codex":0.00003014022,"about_ca_topic_score_gemma":0.0000011215118,"teacher_disagreement_score":0.8965552,"about_ca_system_score_codex":0.00003465591,"about_ca_system_score_gemma":0.000027344127,"threshold_uncertainty_score":0.47907233},"labels":[],"label_agreement":null},{"id":"W2096199323","doi":"10.1145/2103621.2103693","title":"Verification of parameterized concurrent programs by modular reasoning about data and control","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":30,"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":"","keywords":"Computer science; Thread (computing); Parameterized complexity; Modular design; Programming language; Separation logic; Control flow; Theoretical computer science; Boolean data type; Bounded function; Algorithm","score_opus":0.06308417104739514,"score_gpt":0.3242422977401453,"score_spread":0.2611581266927502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096199323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35597494,0.0022093384,0.64064693,0.00012103081,0.00045840137,0.00037181153,0.000049211474,0.000094876676,0.00007342538],"genre_scores_gemma":[0.6662638,0.000033036507,0.33354557,0.000029903887,0.000031131935,0.00001683286,0.00007078557,0.000005226948,0.000003685882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986913,0.00020311915,0.00029262,0.00032096021,0.00023716278,0.00025481792],"domain_scores_gemma":[0.9977568,0.00023503811,0.0003258169,0.0015258043,0.000056552984,0.00009998709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011721582,0.00012016106,0.00019719616,0.000039374856,0.00006623196,0.00010561115,0.0015071027,0.00006279999,0.0000028777638],"category_scores_gemma":[0.0008190322,0.00010852616,0.000017345556,0.00015089537,0.00010334706,0.0013801395,0.00032417363,0.000091952286,0.0000069066355],"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.00006789812,0.00042051973,0.04349889,0.00024400526,0.00012102073,9.000793e-7,0.0031469641,0.000023234146,0.08765104,0.036532074,0.0004293951,0.82786405],"study_design_scores_gemma":[0.002406484,0.00043228603,0.08029246,0.00021932159,0.0001665546,0.00002124073,0.00023346585,0.84906244,0.041138656,0.0005874996,0.024656497,0.000783085],"about_ca_topic_score_codex":0.000031650696,"about_ca_topic_score_gemma":7.785889e-7,"teacher_disagreement_score":0.8490392,"about_ca_system_score_codex":0.000012555643,"about_ca_system_score_gemma":0.000016227732,"threshold_uncertainty_score":0.44255686},"labels":[],"label_agreement":null},{"id":"W2096425546","doi":"10.1007/s007660200017","title":"Guest Editorial: Special Issue on Model Checking in Requirements Engineering","year":2002,"lang":"en","type":"editorial","venue":"Requirements Engineering","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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":"Model checking; Computer science; Debugging; Formal methods; Abstraction; Formal verification; Programming language; Software engineering; Formal specification; Software","score_opus":0.03224077244937619,"score_gpt":0.2969755649954588,"score_spread":0.2647347925460826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096425546","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025445732,0.00008487693,0.10599922,0.000018096513,0.89084,0.0005474454,0.000023888564,0.00053870043,0.0019223269],"genre_scores_gemma":[0.00008718582,0.00016164129,0.103839114,0.0000132082,0.89510345,0.0001420819,0.00006831584,0.00017995462,0.00040506505],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9930773,0.00007435806,0.0013398344,0.0014185493,0.0028116505,0.0012783331],"domain_scores_gemma":[0.9971771,0.00025830526,0.00043997308,0.0016593472,0.00021520272,0.0002500542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001707867,0.0009919688,0.0008916523,0.0010909578,0.000108816545,0.00043035552,0.0025882374,0.001201634,0.000023840865],"category_scores_gemma":[0.001989469,0.0011952086,0.00020206926,0.00091073744,0.000023064498,0.0015180813,0.0006361336,0.0019014721,0.00017875113],"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.000014024139,0.00011820323,0.0000026173427,0.00030595955,0.000060275353,0.00002612017,0.00033111335,0.16409731,0.0007811499,0.00097531424,0.83145595,0.0018319769],"study_design_scores_gemma":[0.0005407885,0.00007504881,0.0000042721063,0.00072253565,0.000014446355,6.830286e-7,0.0000016931177,0.41492292,0.0007064147,0.000019564379,0.58230335,0.00068826013],"about_ca_topic_score_codex":0.000022106264,"about_ca_topic_score_gemma":0.0000021589253,"teacher_disagreement_score":0.2508256,"about_ca_system_score_codex":0.0018442855,"about_ca_system_score_gemma":0.00014754538,"threshold_uncertainty_score":0.9990498},"labels":[],"label_agreement":null},{"id":"W2097984101","doi":"10.1109/rtcsa.1999.811221","title":"Formal description of real-time systems using SDL","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Semantics (computer science); Interpretation (philosophy); Programming language; Formal semantics (linguistics); Formal description; Language construct; Abstract interpretation","score_opus":0.07129079096362986,"score_gpt":0.2963650844093104,"score_spread":0.22507429344568056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097984101","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.09083304,0.000019214343,0.87748325,0.0000027212868,0.00037373422,0.000103297476,2.6966774e-7,0.00007385124,0.031110642],"genre_scores_gemma":[0.3397549,0.0000032933897,0.6598605,0.00000634054,0.000009642613,0.0000023543244,2.6955158e-7,0.0000030428876,0.0003596455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915314,0.0001404759,0.00023952388,0.00013521832,0.00017118124,0.0001604693],"domain_scores_gemma":[0.99936897,0.000021018546,0.00011605645,0.00036983262,0.00008956644,0.000034559307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008997491,0.000060737122,0.000101272664,0.00007511167,0.00005246966,0.000052680367,0.00025342786,0.000044131848,0.000012740352],"category_scores_gemma":[0.00006187647,0.000054389937,0.00002778045,0.00026064785,0.000021307636,0.0011565995,0.0000386778,0.000034571007,0.000026358626],"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.0000022501413,0.000022091917,0.00022098732,0.000027919928,0.0000046217315,4.4114302e-7,0.00017836293,0.0011231214,0.11347332,0.88324934,0.00006418942,0.0016333695],"study_design_scores_gemma":[0.0001305539,0.00005475478,0.00075735827,0.000021522246,0.0000042937536,0.000039685412,0.00005138306,0.9460779,0.0513413,0.00094701187,0.0004636694,0.00011059215],"about_ca_topic_score_codex":0.0001093566,"about_ca_topic_score_gemma":3.6856568e-7,"teacher_disagreement_score":0.94495475,"about_ca_system_score_codex":0.00004927315,"about_ca_system_score_gemma":0.000037961934,"threshold_uncertainty_score":0.22179572},"labels":[],"label_agreement":null},{"id":"W2098127690","doi":"10.1109/ccece.2005.1557336","title":"An operational semantics for RTPA","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 Calgary","funders":"","keywords":"Operational semantics; Computer science; Programming language; Semantics (computer science); Process calculus; Formal specification; Specification language; Language Of Temporal Ordering Specification; Process (computing); Formal methods; Action semantics; Formal semantics (linguistics); Software engineering; Denotational semantics","score_opus":0.023400212379909618,"score_gpt":0.3188179181194393,"score_spread":0.2954177057395297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098127690","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.00345577,0.000005724587,0.9918684,0.00044035524,0.00018270654,0.00010223679,0.0000010869397,0.000098973826,0.0038447438],"genre_scores_gemma":[0.14267145,3.2067297e-7,0.8564923,0.0002190521,0.00009142933,0.000014190276,0.0000070522888,0.0000023751986,0.00050187693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957997,0.000019020847,0.00009607017,0.00013039703,0.000089565874,0.0000849834],"domain_scores_gemma":[0.9996163,0.000023520597,0.000019179786,0.00024819543,0.00007467374,0.000018131055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024236055,0.000037022677,0.000035006506,0.00002546281,0.00007144243,0.000105135856,0.00031437227,0.000022162345,0.000009725639],"category_scores_gemma":[0.00001597286,0.000032485972,0.000015238066,0.00007935825,0.000011147664,0.00052952516,0.000018979652,0.000018126182,0.000016129521],"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":[6.7809157e-7,0.000023583236,0.00010598469,0.000001803711,5.0692097e-7,7.114824e-8,0.000015492704,0.00042079762,0.0019613802,0.99185616,0.0009907457,0.004622774],"study_design_scores_gemma":[0.000096362215,0.000049562434,0.0037172614,8.429908e-7,8.449692e-7,0.0000029247328,0.0000033677843,0.93172383,0.026145179,0.02755794,0.010632613,0.0000692574],"about_ca_topic_score_codex":0.000014934982,"about_ca_topic_score_gemma":0.0000053587796,"teacher_disagreement_score":0.96429825,"about_ca_system_score_codex":0.000011009811,"about_ca_system_score_gemma":0.000021638645,"threshold_uncertainty_score":0.13247395},"labels":[],"label_agreement":null},{"id":"W2098347190","doi":"10.3233/sat190050","title":"Improved SAT-based Reachability Analysis with Observability Don’t Cares","year":2008,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":22,"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":"","keywords":"Observability; Reachability; Mathematics; Computer science; Theoretical computer science; Applied mathematics","score_opus":0.04621811252362271,"score_gpt":0.2875096499397546,"score_spread":0.24129153741613188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098347190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48180366,0.00002498266,0.51758647,0.00021124762,0.00008054925,0.000180642,0.0000021592316,0.00008666681,0.00002359096],"genre_scores_gemma":[0.6284816,0.000006513682,0.37130094,0.0001456995,0.000032724536,0.000013653591,0.000007292459,0.00000799037,0.0000035636235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967585,0.000780082,0.00077134086,0.0007363131,0.0006379648,0.00031579187],"domain_scores_gemma":[0.9975655,0.0003327188,0.00036866372,0.0007623896,0.00072774256,0.0002429718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025931173,0.00027751297,0.00045912983,0.0002900723,0.0006647308,0.00022839164,0.00038549877,0.00011518671,0.000003597228],"category_scores_gemma":[0.0003732226,0.0002249142,0.00017389642,0.00094893784,0.0001788826,0.0007448629,0.000063817955,0.0005244086,0.0000016757866],"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.00017757034,0.0001845316,0.04500212,0.000037517206,0.00008717346,0.000005265927,0.00076196087,0.90725654,0.00010502148,0.00074712076,0.0000053719373,0.045629814],"study_design_scores_gemma":[0.0005252031,0.0005162034,0.058813017,0.000019988696,0.000077408986,0.000034882167,0.000066951594,0.9356999,0.00014109843,0.0038506615,0.000009942286,0.0002447899],"about_ca_topic_score_codex":0.00019562116,"about_ca_topic_score_gemma":0.000057161,"teacher_disagreement_score":0.14667794,"about_ca_system_score_codex":0.00029563185,"about_ca_system_score_gemma":0.00028530814,"threshold_uncertainty_score":0.9171735},"labels":[],"label_agreement":null},{"id":"W2098613964","doi":"10.1109/lcn.1999.802005","title":"Using formal specification and observers to specify and validate the ATM signaling protocols","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Conformance testing; Protocol (science); Formal specification; Language Of Temporal Ordering Specification; Formal methods; Communications protocol; Specification language; Programming language; Service (business); Formal description; Software engineering; Computer network; Operating system","score_opus":0.2147017645115252,"score_gpt":0.3762920693246581,"score_spread":0.16159030481313288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098613964","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.08010619,0.000012103594,0.91362435,0.0002052508,0.00007039209,0.0037571215,3.705736e-7,0.000050958904,0.0021732834],"genre_scores_gemma":[0.118553266,0.0000029419157,0.88077307,0.0001926948,0.000028058206,0.00037258753,2.1942007e-7,0.00000600719,0.00007113837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999004,0.00014844697,0.00020105629,0.00026905126,0.0001718742,0.00020558016],"domain_scores_gemma":[0.99931866,0.00006044954,0.0000762543,0.0004117832,0.000056661396,0.00007616429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012683821,0.00009607948,0.00008549691,0.000045422326,0.00023964749,0.00030740662,0.00029532218,0.000035269797,0.000011173488],"category_scores_gemma":[0.00010324093,0.000068836984,0.000016217653,0.00029153677,0.0000429725,0.0008707309,0.00011464952,0.00007626452,0.000007883944],"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.000011149065,0.000018077246,0.0014441288,0.000022472614,0.000006673752,8.68606e-7,0.0011349029,0.00043957966,0.030327285,0.94253683,0.000048321475,0.024009725],"study_design_scores_gemma":[0.0011041319,0.00036011645,0.032980125,0.00012296281,0.000021574162,0.00016938096,0.000983088,0.25184572,0.61815566,0.020993192,0.07234745,0.0009165778],"about_ca_topic_score_codex":0.000009016206,"about_ca_topic_score_gemma":0.000001263183,"teacher_disagreement_score":0.9215436,"about_ca_system_score_codex":0.000032908334,"about_ca_system_score_gemma":0.00002367454,"threshold_uncertainty_score":0.2964329},"labels":[],"label_agreement":null},{"id":"W2099467084","doi":"10.1109/icmla.2009.36","title":"Sensitivity Analysis of POMDP Value Functions","year":2009,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Partially observable Markov decision process; Computer science; Markov decision process; Multiplicative function; Bellman equation; Sensitivity (control systems); Mathematical optimization; Scope (computer science); Observable; Dynamical systems theory; Markov process; Markov chain; Markov model; Machine learning; Mathematics","score_opus":0.024866545436027922,"score_gpt":0.3016634149746945,"score_spread":0.2767968695386666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099467084","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.023387535,0.000004826479,0.9600179,0.00028661746,0.000084349806,0.000031103886,0.0000010958574,0.00008304688,0.016103491],"genre_scores_gemma":[0.562758,7.2837776e-7,0.43689495,0.00014064596,0.000005740003,3.6646563e-7,9.906558e-7,5.180341e-7,0.00019806641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938756,0.00010679521,0.00013212253,0.00015140927,0.00013876369,0.00008335402],"domain_scores_gemma":[0.99929833,0.00005695706,0.000056639525,0.00048534598,0.00007310826,0.000029586961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005602507,0.000043475215,0.00011370088,0.00021448209,0.00003818574,0.000018903847,0.00015129792,0.00002579505,0.000016190766],"category_scores_gemma":[0.00007559583,0.000038491777,0.00008463708,0.0015878332,0.000016241178,0.00027080762,0.000028087426,0.00003867457,0.00001492524],"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.0000024132655,0.00008302605,0.00092003,0.0000012757233,0.000103552506,0.0000010567319,0.00016716853,0.0087718675,0.010104649,0.89409894,0.00021025373,0.08553579],"study_design_scores_gemma":[0.000030111682,0.000037971953,0.26163977,8.396385e-7,0.00006842024,0.0000016598287,0.000009727905,0.7276351,0.008952109,0.0013652385,0.00020612829,0.000052934112],"about_ca_topic_score_codex":0.000049737693,"about_ca_topic_score_gemma":0.000007675252,"teacher_disagreement_score":0.8927337,"about_ca_system_score_codex":0.000015900738,"about_ca_system_score_gemma":0.000014303246,"threshold_uncertainty_score":0.15696491},"labels":[],"label_agreement":null},{"id":"W2099948248","doi":"10.1145/581339.581461","title":"An architecture-centric approach to the development of a distributed model-checker for timed automata","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Model checking; Automaton; Architecture; Timed automaton; Distributed computing; Development (topology); Model driven development; Programming language; Computer architecture; Theoretical computer science; Unified Modeling Language; Software","score_opus":0.0689152956602451,"score_gpt":0.29489728643583174,"score_spread":0.22598199077558664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099948248","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.002219166,0.000008249247,0.99517167,0.0001852929,0.000048768106,0.0006769734,0.000008252263,0.00012779134,0.0015538542],"genre_scores_gemma":[0.108913265,2.879182e-7,0.89064896,0.00011408243,0.0000111915115,0.00015839066,0.000012045637,0.00000561008,0.00013614647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989437,0.000058626585,0.00026835938,0.00027549226,0.00023303789,0.00022077533],"domain_scores_gemma":[0.9990126,0.000024720128,0.00007254859,0.0007352583,0.000074322794,0.00008054188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006067422,0.000097647346,0.00010927459,0.00007169966,0.00010819424,0.000049751234,0.0011410125,0.0000384458,0.000004825091],"category_scores_gemma":[0.000070479495,0.00006273878,0.00003215072,0.00048459115,0.000019358438,0.00014304383,0.00013249903,0.000054696313,0.000011436171],"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.00003363913,0.0010354582,0.000024107623,0.000076351025,0.000047806305,1.3506273e-7,0.0154856555,0.18848687,0.0011571092,0.30932665,0.004991781,0.4793344],"study_design_scores_gemma":[0.0001636807,0.0000350445,0.00036553777,0.000002418592,0.0000028791121,0.0000017903604,0.00001574464,0.98999125,0.0059461966,0.00036037626,0.003020068,0.00009502248],"about_ca_topic_score_codex":0.000001373415,"about_ca_topic_score_gemma":0.0000013553727,"teacher_disagreement_score":0.8015044,"about_ca_system_score_codex":0.00004279445,"about_ca_system_score_gemma":0.000036522502,"threshold_uncertainty_score":0.2558413},"labels":[],"label_agreement":null},{"id":"W2100201046","doi":"10.1109/icecs.2000.911590","title":"An efficient verification method for a class of multi-phase sequential circuits","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Retiming; Sequential logic; Computer science; Combinational logic; Correctness; Electronic circuit; Algorithm; Equivalence (formal languages); Logic gate; Mathematics; Engineering","score_opus":0.11796279847227548,"score_gpt":0.402426506799508,"score_spread":0.2844637083272325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100201046","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.0055990047,0.00002870865,0.99266225,0.000086209635,0.00035088792,0.0004750983,0.000008361512,0.00014870735,0.0006407733],"genre_scores_gemma":[0.26296893,0.0000018197898,0.73679537,0.000056826346,0.000025706537,0.000053751864,0.0000041732837,0.00000712046,0.00008631707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986264,0.00020963502,0.0003526335,0.00039104014,0.00021603752,0.00020424223],"domain_scores_gemma":[0.99862075,0.000086783184,0.00018490526,0.0008207558,0.00020295642,0.00008384426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010675039,0.000106624844,0.00014968494,0.00012676926,0.00008232782,0.00005511314,0.00071193854,0.00007716221,0.0000352531],"category_scores_gemma":[0.00014683562,0.000101821024,0.00007248009,0.0003460236,0.000038572423,0.0003403499,0.000038511622,0.000060096765,0.000017901091],"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.000009783505,0.001039022,0.000006254933,0.00004043978,0.000013164933,4.4097092e-7,0.0014472906,0.0035631654,0.18872079,0.34505948,0.00011268647,0.45998746],"study_design_scores_gemma":[0.00078756287,0.00020909538,0.00008879235,0.000003898775,0.0000070046776,0.0000040440714,0.000024399395,0.842222,0.15550137,0.00018860963,0.00085994124,0.00010331906],"about_ca_topic_score_codex":0.000012925343,"about_ca_topic_score_gemma":0.0000012744135,"teacher_disagreement_score":0.8386588,"about_ca_system_score_codex":0.000048688,"about_ca_system_score_gemma":0.000020639227,"threshold_uncertainty_score":0.41521406},"labels":[],"label_agreement":null},{"id":"W2100684203","doi":"10.1109/asic.2001.954701","title":"Model reduction based on value dependency","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Reduction (mathematics); Computer science; Model checking; Dependency (UML); Solver; Algorithm; Satisfiability; Satisfiability modulo theories; Data flow diagram; Control flow; Boolean satisfiability problem; Formal verification; State (computer science); Application-specific integrated circuit; Theoretical computer science; Programming language; Artificial intelligence; Mathematics; Embedded system","score_opus":0.07900838730124558,"score_gpt":0.29048659051363135,"score_spread":0.21147820321238575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100684203","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.0010437679,0.0000061003025,0.9081987,0.0005159694,0.00027201758,0.000070608905,1.7025316e-7,0.0002073775,0.08968529],"genre_scores_gemma":[0.3662982,0.0000021051262,0.63229847,0.00021787825,0.000019261575,0.0000072030307,2.031688e-7,0.0000029706455,0.0011537333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992426,0.000057609348,0.000113947775,0.00023275301,0.00022871663,0.00012435566],"domain_scores_gemma":[0.9993217,0.000016057826,0.000036174635,0.0005510406,0.00003314621,0.000041852123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025520535,0.000064843625,0.00004919601,0.00008044064,0.000067994195,0.000046759622,0.00039508948,0.000042513635,0.00006949579],"category_scores_gemma":[0.00004582997,0.00005801982,0.000029147403,0.00021301034,0.000013174222,0.00040982224,0.000028310082,0.00007939978,0.0002450084],"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.0000023748169,0.00009246797,0.000007425412,0.0000038014746,0.000001291759,6.31861e-7,0.0001377496,0.15179014,0.0015278877,0.75491524,0.0013225388,0.09019849],"study_design_scores_gemma":[0.00008044551,0.00004511503,0.000050424092,0.0000033181398,9.622466e-7,0.0000039145584,0.0000023479713,0.981257,0.009861188,0.008490953,0.00012970816,0.00007458891],"about_ca_topic_score_codex":0.0000049553482,"about_ca_topic_score_gemma":1.708101e-7,"teacher_disagreement_score":0.8294669,"about_ca_system_score_codex":0.00004420448,"about_ca_system_score_gemma":0.000010993372,"threshold_uncertainty_score":0.3149169},"labels":[],"label_agreement":null},{"id":"W2100893927","doi":"10.1006/inco.2001.2962","title":"Bisimulation for Labelled Markov Processes","year":2002,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":307,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bisimulation; Probabilistic logic; Mathematics; Markov chain; Markov process; State space; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.037638548441248657,"score_gpt":0.2940433828801528,"score_spread":0.25640483443890416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100893927","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.0071893986,0.00005280951,0.98992324,0.00042385375,0.0001662245,0.00033821154,0.00000231456,0.00017207742,0.001731901],"genre_scores_gemma":[0.51020116,0.000028780427,0.48928016,0.00036153864,0.00002140135,0.00004380115,0.000026118254,0.0000027190958,0.000034314508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936676,0.00002511612,0.00027122739,0.000095556235,0.00014123534,0.0001001056],"domain_scores_gemma":[0.99931836,0.00010101138,0.00016321149,0.00010050721,0.0002813963,0.000035539873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023957016,0.00007302651,0.00006906344,0.00013944837,0.00015368266,0.00023102167,0.00012420732,0.0000439685,0.000005918521],"category_scores_gemma":[0.00018426566,0.00007182327,0.000015567193,0.0003228054,0.000014959163,0.003099735,0.00002827475,0.00003424335,0.000036022193],"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.0000097142265,0.000020881109,0.0000926215,0.00015248002,0.0000056080003,4.5479805e-8,0.0025688317,0.0048313877,0.000021974158,0.04762426,0.0008134797,0.94385874],"study_design_scores_gemma":[0.00044762855,0.000057785663,0.0009022747,0.00000952351,0.000002684489,0.000004247879,0.00003039938,0.9840585,0.00027184022,0.003631752,0.010489651,0.00009371329],"about_ca_topic_score_codex":0.0000022655902,"about_ca_topic_score_gemma":5.194583e-7,"teacher_disagreement_score":0.9792271,"about_ca_system_score_codex":0.000020390058,"about_ca_system_score_gemma":0.000013457388,"threshold_uncertainty_score":0.2928868},"labels":[],"label_agreement":null},{"id":"W2101814946","doi":"10.1145/2071368.2071369","title":"Robust Vacuity for Branching Temporal Logic","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":25,"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":"","keywords":"Computer science; Temporal logic; Bisimulation; Linear temporal logic; Atomic sentence; Theoretical computer science; Model checking; TRACE (psycholinguistics); Algorithm; Artificial intelligence; Linguistics; Philosophy","score_opus":0.14772062146454748,"score_gpt":0.3420534356106389,"score_spread":0.1943328141460914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101814946","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.0016352715,0.00005056458,0.99477965,0.0013423072,0.0010796243,0.00038415138,0.00002126366,0.00029316067,0.00041402187],"genre_scores_gemma":[0.4391695,0.0000018368828,0.5599852,0.00063767354,0.00007214854,0.000065884575,0.000015657935,0.000007756661,0.00004434665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984775,0.0001470104,0.00032248796,0.0003521695,0.00032398241,0.00037685258],"domain_scores_gemma":[0.9983915,0.00068077934,0.00013006029,0.0005183135,0.00015122064,0.00012813606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007987808,0.00018419964,0.00017185627,0.00017534515,0.0004739989,0.00009660419,0.0008331424,0.000100593265,0.000050215967],"category_scores_gemma":[0.00011700058,0.00017376289,0.00014614037,0.00034898808,0.000053105035,0.0010086135,0.000018897255,0.00021958508,0.00012254415],"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.00003216885,0.00046046256,0.0001992811,0.000032029966,0.000037183792,5.083449e-7,0.00037176308,0.47746387,0.00006836201,0.43768758,0.00016937529,0.08347743],"study_design_scores_gemma":[0.0008163161,0.00032817613,0.012065386,0.000019442303,0.00002797973,0.00004983323,0.00004327124,0.52653027,0.0008936879,0.4563946,0.002329719,0.00050133845],"about_ca_topic_score_codex":0.000007946599,"about_ca_topic_score_gemma":0.0000016637558,"teacher_disagreement_score":0.43753424,"about_ca_system_score_codex":0.00010979776,"about_ca_system_score_gemma":0.00005931692,"threshold_uncertainty_score":0.70858455},"labels":[],"label_agreement":null},{"id":"W2102080474","doi":"10.1109/wfcs.1997.634351","title":"Engineering families of protocols using a formal language: successes and failures","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Hierarchy; Retransmission; Notation; Programming language; Refinement; Formal methods; Theoretical computer science; Protocol (science); Formal language; Formal description; Communications protocol; Variation (astronomy); Software engineering; Computer security; Computer network; Mathematics","score_opus":0.03642843150868986,"score_gpt":0.3090944844918145,"score_spread":0.27266605298312463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102080474","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.083250195,0.000054099834,0.9144399,0.000031592164,0.000026804706,0.0011811302,4.4747435e-7,0.00008624065,0.00092955877],"genre_scores_gemma":[0.3299256,0.0000023186246,0.66987157,0.000009401598,0.000009539733,0.00014884942,5.995788e-8,0.0000026075243,0.000030044352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999531,0.000015090668,0.00012920462,0.00010543077,0.00010164858,0.00011767311],"domain_scores_gemma":[0.9996723,0.000027996957,0.00004486562,0.00020223226,0.000029395727,0.000023195053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016134571,0.00005750367,0.000079134836,0.00007559899,0.000029814211,0.00005274008,0.00022651034,0.000024303681,0.000015215549],"category_scores_gemma":[0.00007630783,0.000048967464,0.000013310231,0.00017945311,0.000022110127,0.00086942175,0.00010862385,0.000038390852,0.0000016492124],"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.0000097488655,0.00012293285,0.003799736,0.0009565951,0.00003326008,0.000006359746,0.012241212,0.003753992,0.169591,0.56107694,0.00009027625,0.24831796],"study_design_scores_gemma":[0.00012186272,0.000037415597,0.0012038248,0.000034014374,0.000001638513,0.000015711557,0.000118522534,0.8817842,0.11581348,0.00004570607,0.00073300337,0.00009062391],"about_ca_topic_score_codex":0.00006450434,"about_ca_topic_score_gemma":0.000002337429,"teacher_disagreement_score":0.8780302,"about_ca_system_score_codex":0.0000069137263,"about_ca_system_score_gemma":0.0000046438804,"threshold_uncertainty_score":0.19968352},"labels":[],"label_agreement":null},{"id":"W2102191448","doi":"10.1109/isre.1999.777992","title":"Events in linear-time properties","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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":"","keywords":"Rotation formalisms in three dimensions; Formalism (music); Temporal logic; Model checking; Natural language; Interpretation (philosophy); Context (archaeology); Linear temporal logic","score_opus":0.04378634382111287,"score_gpt":0.28258930783347563,"score_spread":0.23880296401236276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102191448","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.07717733,0.000038845974,0.8871312,0.00014899968,0.00030846818,0.00015384675,4.9966836e-8,0.00012532249,0.03491593],"genre_scores_gemma":[0.2356972,0.0000018211604,0.7602744,0.00011127873,0.0000053927547,0.000009579555,7.7400145e-8,0.0000023911916,0.003897839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945354,0.00010370217,0.00010805269,0.00012738955,0.00009724214,0.000110072404],"domain_scores_gemma":[0.99967337,0.000009426219,0.000018481836,0.00025783636,0.000020192741,0.000020683245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044323358,0.000042242747,0.000049721,0.000045458048,0.000019060037,0.000009559179,0.0002758308,0.000023180353,0.00003128455],"category_scores_gemma":[0.00014228921,0.000032543874,0.000011762793,0.00021987032,0.000009426258,0.00033328997,0.00003621557,0.00004505115,0.00035172122],"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.000009518317,0.00029040454,0.009889938,0.000029822884,0.000008280889,0.0000039153756,0.0016752582,0.00064153876,0.024064437,0.9115964,0.0004979284,0.051292554],"study_design_scores_gemma":[0.00061295694,0.00012873532,0.020565141,0.000045419372,0.0000015930801,0.00002489735,0.00004244225,0.6354871,0.30879164,0.0151668275,0.01869124,0.0004420415],"about_ca_topic_score_codex":0.000008692149,"about_ca_topic_score_gemma":0.0000011109124,"teacher_disagreement_score":0.8964296,"about_ca_system_score_codex":0.000021001943,"about_ca_system_score_gemma":0.00002472479,"threshold_uncertainty_score":0.45207822},"labels":[],"label_agreement":null},{"id":"W2102364390","doi":"10.5555/1015090.1015142","title":"Design diagnosis using Boolean satisfiability","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":60,"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":"","keywords":"Satisfiability; Boolean satisfiability problem; Computer science; DPLL algorithm; Maximum satisfiability problem; Debugging; Boolean function; Theoretical computer science; Algorithm; Programming language","score_opus":0.10672360753232428,"score_gpt":0.32983769263099166,"score_spread":0.22311408509866737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102364390","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.020699762,0.000017161194,0.9776662,0.00021183919,0.00019465767,0.00015697077,1.2896817e-7,0.00018977385,0.00086352],"genre_scores_gemma":[0.2890464,0.0000028917486,0.71076256,0.00015199577,0.000013464328,0.000011922187,7.862816e-8,0.000002953951,0.000007749101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916977,0.00011587572,0.00015509022,0.00024347287,0.00015534427,0.00016047379],"domain_scores_gemma":[0.99923,0.000078524754,0.000044614837,0.00055117154,0.000042191445,0.000053482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074103527,0.00007151102,0.0000743446,0.000042546002,0.00008789963,0.00007709683,0.00046237107,0.000037337933,0.000023277677],"category_scores_gemma":[0.00015942162,0.00006447939,0.000026848287,0.00027583764,0.000037279795,0.00060535595,0.00010176209,0.000059001362,0.000047889796],"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.0000040752384,0.00013115541,0.0036742627,0.0000136941735,0.000008559144,0.000003753675,0.0008222342,0.0362878,0.0030715398,0.82500625,0.000076334756,0.13090034],"study_design_scores_gemma":[0.00045000765,0.00015736927,0.020272981,0.000021436272,0.000008039909,0.000023345787,0.000030572974,0.38319814,0.37425205,0.22073407,0.00044243742,0.0004095295],"about_ca_topic_score_codex":0.000115205585,"about_ca_topic_score_gemma":0.0000024810547,"teacher_disagreement_score":0.6042722,"about_ca_system_score_codex":0.0001291179,"about_ca_system_score_gemma":0.00006408303,"threshold_uncertainty_score":0.2629393},"labels":[],"label_agreement":null},{"id":"W2102679084","doi":"10.1109/mnrc.2008.4683387","title":"Assertion checkers - enablers of quality design","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Assertion; Computer science; Generator (circuit theory); IBM; Programming language; Software engineering; Field (mathematics); Quality (philosophy); Computer architecture","score_opus":0.2120062588017335,"score_gpt":0.3560172045566864,"score_spread":0.1440109457549529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102679084","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.023410114,0.000009417743,0.97117585,0.000095742886,0.0001233541,0.00008271908,1.4095144e-7,0.000093610804,0.005009055],"genre_scores_gemma":[0.28450018,0.00000711762,0.7151976,0.00006989751,0.0000055205423,0.0000041049248,3.3840928e-7,0.0000017453249,0.00021347558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99913156,0.00020089948,0.0002152383,0.000147922,0.0001982329,0.000106163854],"domain_scores_gemma":[0.99933094,0.00006488254,0.00010033255,0.00039357986,0.000076773926,0.000033465974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010509131,0.000049962713,0.00008607331,0.000048078364,0.000051889587,0.00000845848,0.00037653552,0.000037206035,0.000015839087],"category_scores_gemma":[0.00017163518,0.000044411976,0.000030449755,0.00027559284,0.000049409307,0.00048009297,0.0000414088,0.0000429329,0.000022347847],"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.00003833155,0.0001768739,0.0029203354,0.00004088109,0.000023713139,0.0000027588708,0.0030778197,0.0017453895,0.09078908,0.8702717,0.0025640414,0.028349098],"study_design_scores_gemma":[0.00025010572,0.000116818075,0.064841874,0.000006272927,0.0000022144284,0.000013366231,0.00008588026,0.1298678,0.8000627,0.003919896,0.0006538406,0.00017922591],"about_ca_topic_score_codex":0.00007150492,"about_ca_topic_score_gemma":5.407118e-7,"teacher_disagreement_score":0.8663518,"about_ca_system_score_codex":0.00002863869,"about_ca_system_score_gemma":0.00005284574,"threshold_uncertainty_score":0.18110679},"labels":[],"label_agreement":null},{"id":"W2102973409","doi":"10.1109/ccece.2003.1226147","title":"Issues in V&amp;V of autonomous and adaptive systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Autonomy; Computer science; Adaptive system; Formal verification; Formal methods; Systems engineering; Software engineering; Engineering; Artificial intelligence; Theoretical computer science; Political science","score_opus":0.04571804281052043,"score_gpt":0.3113545092114174,"score_spread":0.26563646640089694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102973409","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.04231765,0.00032068716,0.9525959,0.00010954889,0.00011630217,0.000098105054,2.8192122e-7,0.00004147133,0.0044000503],"genre_scores_gemma":[0.41491103,0.000010865411,0.5849095,0.000009813972,0.000005121993,0.0000038822022,7.5772114e-8,0.0000011714159,0.00014853365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956375,0.000035315687,0.00013628772,0.00011895868,0.0000740528,0.00007164857],"domain_scores_gemma":[0.99969226,0.00001906953,0.000042780783,0.00020049082,0.000026705608,0.000018666102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028090956,0.000039543105,0.00008345713,0.00006224042,0.000010914122,0.000021084894,0.00018104183,0.000025662732,0.0000010962818],"category_scores_gemma":[0.000027380416,0.000034212757,0.000007266616,0.000150572,0.000029501916,0.00025282337,0.00005616816,0.000033348602,0.000007865852],"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.0000019064847,0.000018689643,0.00020080456,0.000011336643,0.0000017411533,6.0205303e-7,0.0011617763,0.001168115,0.00047883915,0.98978883,0.000009787217,0.007157551],"study_design_scores_gemma":[0.004147425,0.0015809522,0.13606669,0.0006734223,0.000015677519,0.0002077032,0.0021810026,0.5171081,0.14056295,0.17148566,0.024407776,0.0015626374],"about_ca_topic_score_codex":0.00064992753,"about_ca_topic_score_gemma":0.000028367313,"teacher_disagreement_score":0.81830317,"about_ca_system_score_codex":0.00003080436,"about_ca_system_score_gemma":0.000023387,"threshold_uncertainty_score":0.13951556},"labels":[],"label_agreement":null},{"id":"W2103544847","doi":"10.1109/vtest.2000.843855","title":"Using arithmetic transform for verification of datapath circuits via error modeling","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Datapath; Arithmetic; Computer science; Arithmetic circuit complexity; Arbitrary-precision arithmetic; Electronic circuit; Bounded function; Algorithm; Formal equivalence checking; Formal verification; Theoretical computer science; Mathematics; Parallel computing","score_opus":0.2568258965560346,"score_gpt":0.35286267842220753,"score_spread":0.09603678186617293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103544847","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.0054845503,0.000057040146,0.9925194,0.00008030172,0.00019289379,0.00035356503,0.0000051053803,0.00008231139,0.0012248411],"genre_scores_gemma":[0.46340922,0.0000054177117,0.5365037,0.000023607663,0.000013622373,0.000012953213,0.0000024162491,0.0000055643277,0.000023561603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998962,0.00003369606,0.00034558112,0.00028152892,0.00019114357,0.0001860723],"domain_scores_gemma":[0.9991038,0.000046541667,0.000097380274,0.00057672424,0.00013153735,0.00004405355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005016403,0.00009414258,0.00013585709,0.000112009475,0.000083999075,0.00003566382,0.00056931266,0.00005876987,0.00001391901],"category_scores_gemma":[0.0000754269,0.00009223834,0.000046716963,0.00030776885,0.000024840298,0.0008399357,0.000026115036,0.000055578144,0.0000056139147],"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.0000069375333,0.0002157644,0.00001551071,0.00019142318,0.000024122752,3.6358384e-7,0.0021358202,0.03455028,0.08848335,0.15920635,0.000031998825,0.7151381],"study_design_scores_gemma":[0.00017454344,0.00005213759,0.000017278055,0.0000122062,0.000009536147,0.0000064474784,0.00002072783,0.9666006,0.029269425,0.0036247368,0.000103977516,0.00010837865],"about_ca_topic_score_codex":0.00002295858,"about_ca_topic_score_gemma":0.0000014199741,"teacher_disagreement_score":0.93205035,"about_ca_system_score_codex":0.0000443262,"about_ca_system_score_gemma":0.000015971458,"threshold_uncertainty_score":0.37613702},"labels":[],"label_agreement":null},{"id":"W2103927343","doi":"10.1109/csd.2004.1309128","title":"Equivalence verification of timed transition models","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Automaton; Transition system; Computer science; Equivalence (formal languages); Model checking; Formal verification; Programming language; Theoretical computer science; Finite-state machine; Event (particle physics); Bisimulation; Transition (genetics); State (computer science); Temporal logic; Mathematics; Discrete mathematics","score_opus":0.044154253538075165,"score_gpt":0.2788834456373667,"score_spread":0.23472919209929155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103927343","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.011497121,0.00002026311,0.9827076,0.00032777718,0.00009593747,0.00011059424,7.569517e-7,0.00011630462,0.005123596],"genre_scores_gemma":[0.5089431,0.0000078168,0.4909735,0.00004443957,0.0000053271665,0.0000057047555,0.0000010363034,0.0000017898086,0.000017296377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992926,0.000035711193,0.00019483232,0.00018041694,0.00019472056,0.00010170661],"domain_scores_gemma":[0.99935865,0.000010986566,0.00007206245,0.0004403889,0.0000866702,0.00003122144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032379618,0.000056468958,0.00007251132,0.00006343174,0.000031322386,0.000017413431,0.00042249833,0.000040169754,0.0000067177043],"category_scores_gemma":[0.000018028644,0.000054053577,0.000031388045,0.00028999746,0.000030521736,0.0010049965,0.000023278862,0.000042777767,0.000025649475],"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.000004206682,0.000042158925,5.718764e-7,0.000013220792,0.000002193233,1.9961665e-7,0.0008891865,0.021962522,0.038448878,0.9234885,0.0000072207595,0.015141138],"study_design_scores_gemma":[0.00025511632,0.00007294506,0.00042492824,0.00001919724,0.0000031332636,0.0000052507726,0.00003451399,0.52244395,0.33266428,0.14395422,0.000023957982,0.00009847275],"about_ca_topic_score_codex":0.000026553558,"about_ca_topic_score_gemma":5.458025e-7,"teacher_disagreement_score":0.7795343,"about_ca_system_score_codex":0.00003906794,"about_ca_system_score_gemma":0.00004312183,"threshold_uncertainty_score":0.22042409},"labels":[],"label_agreement":null},{"id":"W2103972622","doi":"10.1109/icccas.2009.5250313","title":"Automatic formal verification of software: Fundamental concepts","year":2009,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 British Columbia","funders":"","keywords":"Computer science; Formal methods; Software verification; Software engineering; Verification and validation; Formal verification; Software; Software construction; Programming language; Software development; Formal specification; Engineering","score_opus":0.023568284663770582,"score_gpt":0.3209188483977244,"score_spread":0.2973505637339538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103972622","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.06754058,0.00002396848,0.9283995,0.0001224225,0.00018023331,0.0001375434,7.1861194e-7,0.0002500728,0.0033449389],"genre_scores_gemma":[0.48424307,0.00000165946,0.51554966,0.00012925584,0.000008178586,0.0000032299229,0.0000015205292,0.000001435588,0.00006199832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991142,0.000049360508,0.00027632265,0.00016613568,0.00022545285,0.0001685356],"domain_scores_gemma":[0.9992568,0.00003383416,0.00013837489,0.00046990425,0.000057326495,0.00004374996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037769743,0.00007591952,0.00010575306,0.00006290369,0.00005674837,0.000038554157,0.0005331828,0.000041715477,0.000056725075],"category_scores_gemma":[0.00007972186,0.000069359005,0.000040281946,0.00026435888,0.00004231809,0.0011292275,0.00004637584,0.000051386,0.000047284346],"study_design_candidate":"design_other","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.000002712856,0.00006220599,0.0001736982,0.000010200536,0.0000032137473,2.8176504e-7,0.00040980594,0.000017107572,0.0054423786,0.41456002,0.00012488234,0.57919353],"study_design_scores_gemma":[0.00076024927,0.00072963623,0.18739595,0.000036885274,0.000010155421,0.000032543878,0.00011790248,0.56678057,0.22502594,0.01674348,0.001981543,0.0003851275],"about_ca_topic_score_codex":0.0000039982465,"about_ca_topic_score_gemma":2.0968673e-7,"teacher_disagreement_score":0.57880837,"about_ca_system_score_codex":0.000041130035,"about_ca_system_score_gemma":0.00003544142,"threshold_uncertainty_score":0.28283784},"labels":[],"label_agreement":null},{"id":"W2104141758","doi":"","title":"Towards integrated verification of timed transition models","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Model checking; Computer science; Automaton; Equivalence (formal languages); Temporal logic; Transition system; Formal verification; Abstraction model checking; Event (particle physics); Programming language; Theoretical computer science; State (computer science); Truth value; Algorithm; Mathematics; Discrete mathematics","score_opus":0.025743574221746147,"score_gpt":0.258158924531401,"score_spread":0.23241535030965485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104141758","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.007050975,0.000017070754,0.97327566,0.00019502631,0.00009846888,0.00011310703,0.0000020468885,0.00015750132,0.019090159],"genre_scores_gemma":[0.5055882,0.0000020259627,0.49427468,0.000023684752,0.000008637919,0.000007010723,0.000010158654,0.0000024125566,0.0000831929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992258,0.00007138137,0.0002487738,0.00017536625,0.00018057486,0.00009809871],"domain_scores_gemma":[0.9993771,0.000010270773,0.00008022283,0.00036362733,0.00014927913,0.000019544004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033450325,0.00006809409,0.000090548165,0.00008950567,0.000027106711,0.000025864496,0.00033606766,0.000054548233,0.000014265922],"category_scores_gemma":[0.000012008078,0.00006024294,0.000036066318,0.00041103008,0.000026331438,0.0006948555,0.000015318137,0.000049840844,0.000014110838],"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.0000085566535,0.00007026411,0.0000022497013,0.000008792751,0.0000032802916,2.1429557e-7,0.00027993773,0.004469457,0.03804724,0.88716984,0.00027968612,0.06966047],"study_design_scores_gemma":[0.00010139637,0.00002731669,0.0007805046,0.00000529576,0.0000023701814,0.0000017901788,0.00001788319,0.7544369,0.21451688,0.029916523,0.0001314591,0.00006167204],"about_ca_topic_score_codex":0.00029606366,"about_ca_topic_score_gemma":0.0000036590177,"teacher_disagreement_score":0.8572533,"about_ca_system_score_codex":0.000035292574,"about_ca_system_score_gemma":0.00004348022,"threshold_uncertainty_score":0.24566358},"labels":[],"label_agreement":null},{"id":"W2104618219","doi":"10.1109/icm.2000.916406","title":"Hardware modeling and verification of an ATM ring MAC protocol","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Intelligent verification; Model checking; Functional verification; Protocol (science); High-level verification; Asynchronous communication; Formal verification; Verification; Embedded system; Asynchronous Transfer Mode; Computer hardware; Computer network; Operating system; Programming language; Software","score_opus":0.07990674361309368,"score_gpt":0.3262851310654015,"score_spread":0.24637838745230783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104618219","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.014308463,0.000004664334,0.9748322,0.000041571995,0.00003087374,0.006937079,3.1249257e-7,0.000101144215,0.0037436953],"genre_scores_gemma":[0.18675469,0.0000013000662,0.80889136,0.00002084003,0.000013374903,0.0042386292,3.2590995e-7,0.000004105542,0.00007537866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993283,0.0000533075,0.00018285587,0.00020892976,0.00013261342,0.000093997296],"domain_scores_gemma":[0.9993905,0.000009724462,0.00006412112,0.00042834028,0.000065862645,0.000041465366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029280822,0.0000586331,0.00006981969,0.00004909496,0.000053536154,0.000049720864,0.00029553662,0.000034006276,0.000021228901],"category_scores_gemma":[0.00003568235,0.000053922475,0.000012628455,0.00014361723,0.000018040582,0.0008114265,0.0000630291,0.000047818536,0.000007657833],"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.000015322052,0.00018145493,0.0003048411,0.00018874819,0.000009100375,0.0000011375372,0.002603387,0.012156383,0.014994071,0.255529,0.000038413564,0.7139781],"study_design_scores_gemma":[0.00013591496,0.000048434445,0.00026270628,0.000009976749,9.556896e-7,0.0000038343014,0.000019799247,0.9838412,0.014631536,0.0007019518,0.0002788334,0.00006484806],"about_ca_topic_score_codex":0.000012810105,"about_ca_topic_score_gemma":8.98214e-7,"teacher_disagreement_score":0.9716848,"about_ca_system_score_codex":0.000013799975,"about_ca_system_score_gemma":0.000005117061,"threshold_uncertainty_score":0.21988948},"labels":[],"label_agreement":null},{"id":"W2105167627","doi":"10.1145/1297666.1297670","title":"Automata-based assertion-checker synthesis of PSL properties","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Assertion; Computer science; Programming language; Automaton; Debugging; Modular design; Operator (biology); Emulation; Set (abstract data type); Theoretical computer science; Büchi automaton; Deterministic automaton","score_opus":0.06655507728057433,"score_gpt":0.2663195237633659,"score_spread":0.19976444648279154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105167627","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.014963701,0.00016394397,0.9832833,0.00013614638,0.0002542188,0.0006619225,0.0000037520263,0.0004042228,0.0001288159],"genre_scores_gemma":[0.755522,0.000028208846,0.2440411,0.000013286524,0.000009294362,0.00027787976,0.0000011454824,0.000015686983,0.00009137563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720895,0.00065662013,0.0008199369,0.00034472567,0.00063691585,0.00033284427],"domain_scores_gemma":[0.99738765,0.0004104616,0.0005206737,0.0013017845,0.00032385197,0.000055594483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001201593,0.000208965,0.00037982676,0.00045043416,0.00019858572,0.00003170403,0.0009871849,0.0001463973,0.000017782811],"category_scores_gemma":[0.00029086767,0.00019210714,0.00014213924,0.00080988737,0.00011078705,0.0006706444,0.000006102125,0.00016808348,0.00003931637],"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.00038142785,0.0020428475,0.000092067,0.0011434591,0.00053279754,0.0000044331314,0.0022233082,0.74520206,0.1290819,0.049453087,0.0003867944,0.06945579],"study_design_scores_gemma":[0.0002383792,0.00029362476,0.00038292562,0.0001255369,0.000021711212,0.000027135406,0.00002539135,0.5953087,0.40324703,0.00013614634,0.000057847257,0.00013557557],"about_ca_topic_score_codex":0.00005735584,"about_ca_topic_score_gemma":0.0000011728283,"teacher_disagreement_score":0.7405583,"about_ca_system_score_codex":0.00024896482,"about_ca_system_score_gemma":0.000509897,"threshold_uncertainty_score":0.78339016},"labels":[],"label_agreement":null},{"id":"W2105210717","doi":"10.1109/ictai.2004.67","title":"Guiding real-world SAT solving with dynamic hypergraph separator decomposition","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":35,"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 Waterloo","funders":"","keywords":"Satisfiability; Solver; Hypergraph; Preprocessor; Computer science; Decomposition; Boolean satisfiability problem; Mathematical optimization; Theoretical computer science; Algorithm; Parallel computing; Mathematics; Discrete mathematics; Artificial intelligence","score_opus":0.0225522952811187,"score_gpt":0.3226581852749304,"score_spread":0.3001058899938117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105210717","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.08025748,0.000032305856,0.8926819,0.0004517153,0.0001527097,0.00013060008,4.4151807e-7,0.00039502306,0.025897844],"genre_scores_gemma":[0.4287454,0.000010624661,0.57061327,0.00017838656,0.000030224139,0.000009682269,0.0000020162825,0.000006921102,0.00040348838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988631,0.00007542001,0.00022882133,0.0003403538,0.0002327213,0.00025961077],"domain_scores_gemma":[0.9991636,0.00005220749,0.00009644277,0.00053401745,0.000074662355,0.00007905154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041367818,0.00013128055,0.00012007887,0.00020307967,0.00018070266,0.0001580894,0.0005084433,0.00003691292,0.000022580823],"category_scores_gemma":[0.000012229766,0.000109304034,0.000038080012,0.00061926653,0.0000323358,0.0011835273,0.000092192284,0.00007044458,0.000106385945],"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.000048041577,0.00016356766,0.0050880723,0.000036543224,0.0000571906,0.000009061514,0.0010053043,0.0047543077,0.07897057,0.6915391,0.0014041733,0.21692404],"study_design_scores_gemma":[0.00028457234,0.00009897909,0.014298785,0.00004503691,0.00001031708,0.00003220712,0.000025130634,0.94649684,0.03354567,0.00088536134,0.003934523,0.00034258477],"about_ca_topic_score_codex":0.00004021177,"about_ca_topic_score_gemma":0.0002854567,"teacher_disagreement_score":0.94174254,"about_ca_system_score_codex":0.00015537179,"about_ca_system_score_gemma":0.00003715457,"threshold_uncertainty_score":0.44572893},"labels":[],"label_agreement":null},{"id":"W2105960367","doi":"","title":"Bounding Performance Loss in Approximate MDP Homomorphisms","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Homomorphism; Metric (unit); Markov decision process; Bounding overwatch; Bounded function; Heuristics; Mathematics; Kernel (algebra); Discrete mathematics; Upper and lower bounds; Markov process; Computer science; Combinatorics; Mathematical optimization; Artificial intelligence","score_opus":0.044423123610973045,"score_gpt":0.26828889012255036,"score_spread":0.2238657665115773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105960367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4526996,0.000018470664,0.5364719,0.00006201264,0.00022955125,0.00007922272,1.2490703e-7,0.000120684395,0.010318415],"genre_scores_gemma":[0.56030875,0.00003817417,0.43926483,0.00007407735,0.000014955541,0.000012082731,3.9313906e-7,0.0000035338624,0.00028322142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999025,0.00004907296,0.00021083263,0.000249812,0.0002021281,0.00026316926],"domain_scores_gemma":[0.999378,0.000025335037,0.000055582386,0.0004650022,0.000030030806,0.000046023015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052644924,0.00008979018,0.00010771804,0.00013359037,0.00013621942,0.000041694,0.0006597529,0.000043554293,0.000016713499],"category_scores_gemma":[0.000034907636,0.00008227961,0.000022446908,0.00052877347,0.00008099123,0.0010086172,0.00013663623,0.00012189855,0.00011664466],"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.000016747583,0.0001728642,0.070459194,0.000068236164,0.0000066134917,0.00008628056,0.0033669898,0.0010082546,0.0017255993,0.8676144,0.00031781214,0.055157043],"study_design_scores_gemma":[0.00036908605,0.00007215653,0.0902475,0.000025154182,8.6500773e-7,0.00031140592,0.000018944394,0.874832,0.029879382,0.0023734316,0.0015851824,0.00028492013],"about_ca_topic_score_codex":0.000014110786,"about_ca_topic_score_gemma":0.0000013056953,"teacher_disagreement_score":0.8738237,"about_ca_system_score_codex":0.00006874824,"about_ca_system_score_gemma":0.000038327802,"threshold_uncertainty_score":0.33552653},"labels":[],"label_agreement":null},{"id":"W2106027274","doi":"10.1109/pacrim.1997.620411","title":"A formalized methodology for constructing safe multiphase protocols","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 Regina","funders":"","keywords":"Protocol (science); Computer science; Correctness; Two-phase commit protocol; Construct (python library); Finite-state machine; Component (thermodynamics); State (computer science); Communications protocol; Distributed computing; Universal composability; Theoretical computer science; Algorithm; Programming language; Computer network; Cryptographic protocol","score_opus":0.35984037311495926,"score_gpt":0.43325631537621573,"score_spread":0.07341594226125647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106027274","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.00026094244,0.000008809109,0.9806098,0.00023825736,0.00020399118,0.009033233,0.0000016203808,0.00023910966,0.009404244],"genre_scores_gemma":[0.0010846951,8.9871793e-7,0.98829293,0.0004020089,0.000041925516,0.009726806,6.4949296e-7,0.00000777449,0.0004423137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986238,0.0002811004,0.00035044874,0.00030994657,0.00012211574,0.00031261035],"domain_scores_gemma":[0.99852216,0.000606043,0.00016201376,0.00051787024,0.00012080274,0.000071114875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015902848,0.00011408391,0.00019765725,0.00009340303,0.00012773143,0.00007894972,0.00063312566,0.00008032405,0.0001234218],"category_scores_gemma":[0.0012791813,0.00009889487,0.000077406745,0.00023015423,0.000062729836,0.0006430561,0.00011277404,0.00008446893,0.000038538823],"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.000022127946,0.000043480282,0.000056380217,0.00003570951,0.0000095979985,8.9921645e-7,0.0005263185,0.0000136845765,0.0069491146,0.60354567,0.0004917848,0.38830525],"study_design_scores_gemma":[0.0026399433,0.000278553,0.00003200673,0.000016129932,0.0000058227865,0.0001106901,0.00010275077,0.7910653,0.13338798,0.012295998,0.05977344,0.00029138965],"about_ca_topic_score_codex":0.0000046768514,"about_ca_topic_score_gemma":0.0000010207958,"teacher_disagreement_score":0.7910516,"about_ca_system_score_codex":0.000028813995,"about_ca_system_score_gemma":0.000015256436,"threshold_uncertainty_score":0.40328154},"labels":[],"label_agreement":null},{"id":"W2106173323","doi":"10.1109/iccd.2002.1106750","title":"Environment synthesis for compositional model checking","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Verilog; Model checking; Functional verification; Runtime verification; Formal verification; Construct (python library); Intelligent verification; Programming language; High-level verification; Component (thermodynamics); Range (aeronautics); Theoretical computer science; Distributed computing; Embedded system; Software; Software system; Field-programmable gate array","score_opus":0.05305162501978016,"score_gpt":0.27860842968240446,"score_spread":0.2255568046626243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106173323","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.00073966756,0.000010079657,0.9878729,0.000121833895,0.00005826293,0.000114299124,0.0000014138416,0.00004998154,0.01103156],"genre_scores_gemma":[0.11444441,0.0000023535156,0.8850626,0.000147595,0.0000070621854,0.000080087215,5.606723e-7,0.0000034048326,0.00025192587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994609,0.000032765074,0.000103797036,0.00016840395,0.00011877248,0.000115410774],"domain_scores_gemma":[0.999599,0.00008597433,0.00003155329,0.00024005056,0.000012643844,0.000030809202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003710951,0.000052856903,0.000054064167,0.000026721953,0.00008109755,0.00003315094,0.00023188179,0.00002469837,0.000025521602],"category_scores_gemma":[0.000050622864,0.000049648203,0.000034846165,0.0000368229,0.000015871601,0.00021659353,0.000027225355,0.000024775187,0.000024715375],"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.0000010802986,0.000025382265,0.000007862226,0.0000033100785,0.0000030391925,5.8909972e-8,0.00004077653,0.009006144,0.0038879511,0.98124176,0.00009215983,0.0056904973],"study_design_scores_gemma":[0.000051908464,0.000009394543,0.000053401825,0.000002282814,0.000002101048,0.0000028517843,0.0000034494215,0.854744,0.11510383,0.02831928,0.0016385397,0.00006893845],"about_ca_topic_score_codex":5.109104e-7,"about_ca_topic_score_gemma":3.8706215e-8,"teacher_disagreement_score":0.95292246,"about_ca_system_score_codex":0.000044026398,"about_ca_system_score_gemma":0.000016130465,"threshold_uncertainty_score":0.2024595},"labels":[],"label_agreement":null},{"id":"W2107629078","doi":"10.1109/date.2006.244005","title":"Efficient Assertion Based Verification using TLM","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Assertion; Database transaction; Transaction-level modeling; Metric (unit); Computer engineering; Programming language; Theoretical computer science","score_opus":0.03253845833347391,"score_gpt":0.29222317945130305,"score_spread":0.25968472111782914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107629078","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.10766637,0.000010369455,0.88601726,0.00010484855,0.00026602848,0.00010773345,2.4474954e-7,0.000218845,0.005608277],"genre_scores_gemma":[0.4848201,6.619054e-8,0.51505584,0.00004919103,0.00002317753,0.0000042026545,0.0000019072066,0.0000029379569,0.00004255894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999094,0.00008472611,0.00019686503,0.0002466351,0.00022665599,0.00015109214],"domain_scores_gemma":[0.99928695,0.000026285083,0.00008771339,0.00048503815,0.00008718846,0.000026838623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048741253,0.000074745905,0.00006071249,0.000099117475,0.0001063567,0.0000939123,0.00031897094,0.00004635225,0.000014512854],"category_scores_gemma":[0.000033598764,0.00007092575,0.000032450287,0.00042040128,0.0000196433,0.00017147878,0.000029932678,0.000048903006,0.000052919557],"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.0000058534397,0.00015755823,0.0005340264,0.000011489249,0.0000018119782,8.2939727e-7,0.00003316844,0.24020311,0.13852589,0.60858315,0.00012369126,0.01181943],"study_design_scores_gemma":[0.00009603122,0.000012582591,0.013384308,0.000004356864,0.0000019577508,0.0000018506369,0.000002377034,0.907213,0.07813705,0.00074912974,0.0003117943,0.000085601525],"about_ca_topic_score_codex":0.00009981914,"about_ca_topic_score_gemma":0.0000019588044,"teacher_disagreement_score":0.66700983,"about_ca_system_score_codex":0.00010303843,"about_ca_system_score_gemma":0.000044932283,"threshold_uncertainty_score":0.2892268},"labels":[],"label_agreement":null},{"id":"W2107952055","doi":"10.5555/2343896.2343940","title":"Analysis of methods for solving MDPs","year":2012,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Convergence (economics); Mathematical proof; Simple (philosophy); Computer science; Mathematical optimization; Value (mathematics); Function (biology); Bellman equation; Power iteration; Markov decision process; Applied mathematics; Mathematics; Algorithm; Iterative method; Markov process; Statistics","score_opus":0.18693710335017455,"score_gpt":0.4286122566916662,"score_spread":0.24167515334149164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107952055","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.015751788,0.0013200291,0.98097765,0.0000070626893,0.0010752048,0.0005907039,0.000020643516,0.000042632102,0.00021426781],"genre_scores_gemma":[0.4701879,0.00003948016,0.52945966,0.000027950638,0.00003404672,0.00006580222,0.00000474426,0.000008320038,0.00017206711],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982892,0.00033943998,0.00047984996,0.00034698006,0.00017178278,0.00037274076],"domain_scores_gemma":[0.99851733,0.00023609349,0.00039132373,0.00050737854,0.00018898412,0.00015890456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023207332,0.00017371553,0.00043669887,0.0003138215,0.00014311897,0.000063048945,0.00043844353,0.0000882672,0.0000054057123],"category_scores_gemma":[0.00019302584,0.00015054556,0.00016071156,0.0006275414,0.000049468155,0.00066330016,0.00018729195,0.000064629436,0.0000040208733],"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.00012456944,0.0017212216,0.13319367,0.00075396785,0.010563517,0.0000024995045,0.032540694,0.004266448,0.020910267,0.29649648,0.0010906822,0.498336],"study_design_scores_gemma":[0.00036384948,0.000058899495,0.07356718,0.000026159147,0.00031896555,0.0000020553848,0.00032480047,0.9191619,0.0010612167,0.000016555367,0.0049162763,0.0001821136],"about_ca_topic_score_codex":0.00017453585,"about_ca_topic_score_gemma":0.0000021062706,"teacher_disagreement_score":0.9148955,"about_ca_system_score_codex":0.000050664963,"about_ca_system_score_gemma":0.00001577665,"threshold_uncertainty_score":0.613907},"labels":[],"label_agreement":null},{"id":"W2107973751","doi":"10.1109/mtv.2010.11","title":"An Automated Framework for Correction and Debug of PSL Assertions","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vennsa Technologies (Canada); University of Toronto","funders":"","keywords":"Assertion; Debugging; Computer science; Bottleneck; Programming language; Correctness; Key (lock); Process (computing); Property (philosophy); Software engineering; Embedded system","score_opus":0.022302555166443937,"score_gpt":0.37537116146612226,"score_spread":0.35306860629967834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107973751","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.12436428,0.0000019244662,0.87367046,0.00007593047,0.0010757151,0.00011168745,5.723064e-7,0.0003887766,0.00031066206],"genre_scores_gemma":[0.4245949,5.7390184e-7,0.5753269,0.000027740967,0.000013600225,0.000011670997,7.3963776e-7,0.000001973315,0.000021869748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958366,0.000026030544,0.00011596939,0.0001367235,0.00006107131,0.000076535434],"domain_scores_gemma":[0.99936783,0.00011620902,0.00005816295,0.00032196363,0.00009675893,0.00003908408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031025507,0.000041916643,0.000056895573,0.000050278843,0.000068855676,0.00004238863,0.00020322637,0.00007747776,0.0000070252045],"category_scores_gemma":[0.000283754,0.00003744957,0.000014434618,0.00016669197,0.000028990038,0.00041582907,0.000020898595,0.000080821446,0.0000018161321],"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.0000051827033,0.00005890123,0.0009252873,0.000008305739,0.0000035801077,3.5134438e-8,0.00027190635,0.000030549283,0.046959776,0.8860396,0.00025423444,0.06544264],"study_design_scores_gemma":[0.000051091283,0.00009333463,0.027357608,0.0000040004056,0.000002335438,0.0000047363965,0.000017273887,0.89305735,0.061593983,0.017563483,0.0002053573,0.000049438127],"about_ca_topic_score_codex":0.000019682644,"about_ca_topic_score_gemma":0.000014757988,"teacher_disagreement_score":0.8930268,"about_ca_system_score_codex":0.0000044599487,"about_ca_system_score_gemma":0.000017964974,"threshold_uncertainty_score":0.15271491},"labels":[],"label_agreement":null},{"id":"W2108013453","doi":"10.1109/ccece.1995.526285","title":"Timing diagrams: semantics and passage towards an intermediate model","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Université de Montréal","funders":"","keywords":"Computer science; Semantics (computer science); Decidability; Programming language; Formal semantics (linguistics); Model checking; Diagram; Theoretical computer science; Database","score_opus":0.08767287888877545,"score_gpt":0.30839874969529124,"score_spread":0.2207258708065158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108013453","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.034464594,0.00003286309,0.9582588,0.00030125765,0.00013930943,0.0000655922,5.59146e-7,0.00017766582,0.006559348],"genre_scores_gemma":[0.45861483,0.00004284363,0.5408069,0.00019913774,0.000018032324,0.0000040867963,3.6407064e-7,0.000004028739,0.00030981976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992494,0.000049621623,0.00014273191,0.00024027133,0.00014558858,0.00017240131],"domain_scores_gemma":[0.9993925,0.000020199928,0.000042033746,0.0004228785,0.000032203476,0.00009019624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031298486,0.000085712985,0.00008647099,0.000055022232,0.00006287358,0.00014752011,0.00042290692,0.00004623897,0.000013877478],"category_scores_gemma":[0.00005701294,0.000074056436,0.000017525192,0.00012090466,0.000044498905,0.00088628003,0.000184077,0.00008424182,0.000021542792],"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.0000012826961,0.0000821054,0.00026300582,0.000022214432,0.0000063630437,0.0000052828836,0.003994358,0.00059696287,0.0005348307,0.21323487,0.00041582662,0.7808429],"study_design_scores_gemma":[0.000075191165,0.00004574476,0.00067823805,0.000005478682,0.0000024075393,0.00000666979,0.0000252802,0.9919199,0.0015228342,0.0054716025,0.00014051546,0.00010617402],"about_ca_topic_score_codex":0.000006176646,"about_ca_topic_score_gemma":0.0000033827855,"teacher_disagreement_score":0.9913229,"about_ca_system_score_codex":0.000016369684,"about_ca_system_score_gemma":0.000005983699,"threshold_uncertainty_score":0.3019934},"labels":[],"label_agreement":null},{"id":"W2108096932","doi":"10.1145/1740582.1740584","title":"On the completeness of compositional reasoning methods","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":23,"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 Waterloo","funders":"National Science Foundation","keywords":"Completeness (order theory); Computer science; Concurrency; Reasoning system; Automated reasoning; Deductive reasoning; Component (thermodynamics); Model checking; Theoretical computer science; Qualitative reasoning; Programming language; Model-based reasoning; Artificial intelligence; Mathematics; Knowledge representation and reasoning","score_opus":0.05707745779628404,"score_gpt":0.361903936170222,"score_spread":0.30482647837393795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108096932","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.011577633,0.000005538198,0.9837243,0.002592409,0.0006866813,0.00019054681,0.000018059789,0.00010417327,0.0011006553],"genre_scores_gemma":[0.43008634,6.5668695e-7,0.5692679,0.00057943555,0.000016270164,0.000026546068,0.000006759422,0.0000052493674,0.000010803807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832714,0.0004055371,0.00033797923,0.00031668376,0.0004448973,0.00016776586],"domain_scores_gemma":[0.99549484,0.0032859202,0.00017347255,0.0007389447,0.00025128678,0.000055537064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089695,0.00015020755,0.0001661811,0.0001625104,0.0004167787,0.00006361008,0.0012368273,0.00007695504,0.0001442035],"category_scores_gemma":[0.0002581823,0.000113195,0.00011827165,0.0005017267,0.00018439283,0.00021154515,0.000022810224,0.00047537673,0.000050429207],"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.000018418721,0.00015094425,0.00000478276,0.0000048214283,0.000021069607,7.965479e-7,0.000078806646,0.10559485,0.0028553454,0.86368734,0.000025262083,0.02755756],"study_design_scores_gemma":[0.00023250544,0.00018260333,0.00605024,0.000021107371,0.00001000401,0.00005555577,0.000016511725,0.43231016,0.009719362,0.5509886,0.00025161327,0.00016169075],"about_ca_topic_score_codex":0.000008071108,"about_ca_topic_score_gemma":0.0000016202354,"teacher_disagreement_score":0.4185087,"about_ca_system_score_codex":0.000030114721,"about_ca_system_score_gemma":0.00007442836,"threshold_uncertainty_score":0.4615958},"labels":[],"label_agreement":null},{"id":"W2108229542","doi":"10.5555/1874620.1875025","title":"Sequential logic rectifications with approximate SPFDs","year":2009,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vennsa Technologies (Canada); University of Toronto","funders":"","keywords":"Sequential logic; Logic optimization; Computer science; Combinational logic; Logic synthesis; Robustness (evolution); Digital electronics; Logic gate; Very-large-scale integration; Algorithm; Transformation (genetics); Pass transistor logic; Logic family; Theoretical computer science; Electronic circuit; Engineering; Embedded system","score_opus":0.0508544817254369,"score_gpt":0.3120294124736287,"score_spread":0.2611749307481918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108229542","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.001143839,0.000009588194,0.94173276,0.0012856894,0.00011792485,0.00012798583,2.873775e-7,0.00036333047,0.05521862],"genre_scores_gemma":[0.18018568,0.0000030329732,0.8187133,0.00041386142,0.000024670844,0.000010323853,0.0000014979211,0.0000025324105,0.0006450752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992249,0.000057304387,0.00013199817,0.00026200237,0.00016018552,0.00016359004],"domain_scores_gemma":[0.999178,0.000014414498,0.000059520273,0.00062600983,0.00007260395,0.000049442453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030855677,0.0000778885,0.00007010823,0.0000651734,0.00010646342,0.00011983835,0.0005345307,0.00003551556,0.000025215351],"category_scores_gemma":[0.00002774134,0.000057456793,0.000020498686,0.00044420382,0.0000320959,0.00050829945,0.000029101848,0.000078141944,0.000075617216],"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.0000034674777,0.000037687234,0.000015419264,0.0000014984851,0.0000023796022,0.000001198756,0.00010303821,0.00007973304,0.003525186,0.9570783,0.0001894742,0.03896261],"study_design_scores_gemma":[0.00082367554,0.0011825556,0.019548742,0.000031445466,0.000025816325,0.0003089895,0.0001114936,0.4819786,0.23959991,0.2432361,0.0121364305,0.001016238],"about_ca_topic_score_codex":0.000005600035,"about_ca_topic_score_gemma":0.0000014331724,"teacher_disagreement_score":0.7138422,"about_ca_system_score_codex":0.000030803767,"about_ca_system_score_gemma":0.00003431841,"threshold_uncertainty_score":0.234302},"labels":[],"label_agreement":null},{"id":"W2108886305","doi":"10.1109/qest.2008.42","title":"Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bisimulation; Probabilistic logic; Computer science; Logical equivalence; Theoretical computer science; Equivalence (formal languages); Robustness (evolution); Closeness; Soundness; Metric (unit); Algorithm; Mathematics; Discrete mathematics; Artificial intelligence","score_opus":0.0666572969321753,"score_gpt":0.325424812103734,"score_spread":0.25876751517155866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108886305","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.07500507,0.000043387932,0.9234676,0.000024608604,0.000016159125,0.000114189024,6.45832e-7,0.00006787876,0.0012604868],"genre_scores_gemma":[0.58666116,0.000010050954,0.41325924,0.000019519639,0.0000024226704,0.0000058078463,0.0000010838797,0.00000118036,0.00003954521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933904,0.00004140358,0.00019114057,0.00020274377,0.00014374945,0.000081928476],"domain_scores_gemma":[0.9992904,0.00012689586,0.00010562283,0.00028062385,0.00017040576,0.000026069907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024038974,0.00005836511,0.0001436343,0.00016571388,0.00004658923,0.000018387476,0.00020559845,0.000028745122,0.0000078257535],"category_scores_gemma":[0.00037711055,0.000045930577,0.000023820397,0.0012926816,0.00007572103,0.00035665592,0.000060377264,0.000026031139,0.0000012985921],"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.000020658284,0.00023596424,0.016721573,0.00044697992,0.00024905486,0.0000026240393,0.0052485014,0.48218423,0.0005716569,0.46904922,0.000018850533,0.025250707],"study_design_scores_gemma":[0.00004889701,0.0000317644,0.018451724,0.0000028380143,0.00003768036,0.0000018442747,0.000013036302,0.9764237,0.0008681075,0.004036195,0.000025706639,0.000058508744],"about_ca_topic_score_codex":0.0000083677005,"about_ca_topic_score_gemma":0.000002605482,"teacher_disagreement_score":0.5116561,"about_ca_system_score_codex":0.000010370746,"about_ca_system_score_gemma":0.000029355147,"threshold_uncertainty_score":0.18729945},"labels":[],"label_agreement":null},{"id":"W2108930304","doi":"10.1109/newcas.2004.1359017","title":"Formal verification of a bus structure modeled in SystemC","year":2004,"lang":"en","type":"article","venue":"The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004.","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"SystemC; Computer science; Formal verification; Programming language; Debugging; Model checking; Verilog; Electronic system-level design and verification; Functional verification; Abstraction; Intelligent verification; Embedded system; Hardware description language; Code (set theory); Reduction (mathematics); Software; Software development; Software construction","score_opus":0.035279528500329616,"score_gpt":0.27794382237141607,"score_spread":0.24266429387108646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108930304","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6290711,0.0029267545,0.3628887,0.00037466467,0.0018031358,0.0016827768,0.00012881572,0.00017780505,0.00094623864],"genre_scores_gemma":[0.9979474,0.000053427,0.0013992348,0.00008624158,0.00023048339,0.000063073305,0.0000109637285,0.000032984608,0.0001762056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964872,0.00041042583,0.0010611387,0.00066675094,0.0007140296,0.0006604484],"domain_scores_gemma":[0.99759406,0.0001422019,0.00055591506,0.0012389155,0.00029619946,0.00017271214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014489425,0.00040659652,0.00061354873,0.00031257598,0.00029003405,0.00019385222,0.0010767762,0.00028073628,0.0000036970828],"category_scores_gemma":[0.000081395825,0.0002996831,0.000098818884,0.001024744,0.00016186845,0.0010428483,0.000073624506,0.00046799026,0.000017316672],"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.00019207533,0.0004617499,0.0010378389,0.00074360747,0.00012157091,0.000039364848,0.017730989,0.70586187,0.0023134407,0.20818593,0.00022904546,0.0630825],"study_design_scores_gemma":[0.018431604,0.0025785014,0.04585485,0.010516702,0.000313812,0.003117271,0.027053786,0.8569281,0.008148957,0.015657729,0.0053977347,0.006000954],"about_ca_topic_score_codex":0.00048008797,"about_ca_topic_score_gemma":0.00013519912,"teacher_disagreement_score":0.36887628,"about_ca_system_score_codex":0.00022055898,"about_ca_system_score_gemma":0.00019900584,"threshold_uncertainty_score":0.9999455},"labels":[],"label_agreement":null},{"id":"W2109157377","doi":"10.1007/11589976_13","title":"Synthesizing B Specifications from eb 3 Attribute Definitions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Programming language; Specification language; Formal specification; Language Of Temporal Ordering Specification; Formal methods; Formal language; B-Method; Simple (philosophy); Formal verification; State (computer science); Theoretical computer science","score_opus":0.10859320255770162,"score_gpt":0.2820982728755352,"score_spread":0.17350507031783358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109157377","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.000035263987,0.0005641614,0.98568344,0.0013016496,0.0017377028,0.00036452507,0.00005231497,0.00033253504,0.009928424],"genre_scores_gemma":[0.019282872,0.00019858095,0.9785141,0.000830696,0.0008899904,0.000024400706,0.000027977756,0.00003888512,0.0001925029],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576324,0.0000778531,0.0007538042,0.0017344367,0.000999578,0.00067106925],"domain_scores_gemma":[0.9953839,0.0010760651,0.00044097836,0.002582441,0.00030934732,0.00020726223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010670845,0.00053226517,0.0005030079,0.00087513134,0.00050389185,0.00070064334,0.004491274,0.00038727684,0.00009261598],"category_scores_gemma":[0.00034082052,0.0005469444,0.00016831268,0.0008326867,0.00073008327,0.0011326916,0.0010264046,0.0009608105,0.00041672905],"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.0000023654027,0.00004169868,0.0000314034,0.000010359151,0.000014151708,0.000019110497,0.000578095,0.0088736,0.00035669937,0.34423184,0.00004139801,0.6457993],"study_design_scores_gemma":[0.00026332325,0.0000934641,0.0012090165,0.0005932332,0.00003018791,0.00007236811,6.01637e-7,0.4684635,0.0078079044,0.500711,0.019300666,0.0014546717],"about_ca_topic_score_codex":0.000028855393,"about_ca_topic_score_gemma":0.000059298436,"teacher_disagreement_score":0.64434457,"about_ca_system_score_codex":0.0005913369,"about_ca_system_score_gemma":0.00050427445,"threshold_uncertainty_score":0.9996982},"labels":[],"label_agreement":null},{"id":"W2109482834","doi":"10.1109/robot.1997.619173","title":"Controller design for multiple simultaneous specifications with applications to robotic systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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":"","keywords":"Control engineering; Controller (irrigation); Computer science; Range (aeronautics); Design methods; Set (abstract data type); Control system; Robot; Control theory (sociology); Control (management); Engineering; Artificial intelligence","score_opus":0.13044081203303873,"score_gpt":0.28846793839211204,"score_spread":0.15802712635907332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109482834","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.000013004008,0.00007184276,0.9939977,0.00052981457,0.00011180273,0.0034035747,0.0000036212778,0.0003074273,0.0015612021],"genre_scores_gemma":[0.2580249,0.0000035441465,0.73733765,0.00012926018,0.0000557528,0.0021278406,0.0000013796748,0.000012140937,0.0023075123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878114,0.000076837445,0.00027332088,0.00041553937,0.00019013116,0.00026300718],"domain_scores_gemma":[0.9977139,0.0010124339,0.000093171686,0.0007585115,0.0002837488,0.00013821256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030568286,0.00013250412,0.0001713213,0.00011138901,0.00022640207,0.00018899904,0.0007251228,0.000047688394,0.000010936549],"category_scores_gemma":[0.00022775544,0.00010645791,0.00003431543,0.0005243563,0.000029683857,0.00023712062,0.0000345169,0.000055626988,0.0003185414],"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.000017726039,0.00013572347,0.000015308957,0.000015601125,0.000020605004,5.651092e-7,0.0002643716,0.63092333,0.0008408757,0.35118055,0.0016867039,0.014898595],"study_design_scores_gemma":[0.0004005191,0.00014843458,0.000027196777,0.000006535695,0.000008615405,0.000012557558,0.000040453713,0.97345436,0.0005723679,0.00023668137,0.024927,0.00016528396],"about_ca_topic_score_codex":0.000008999929,"about_ca_topic_score_gemma":0.000003827443,"teacher_disagreement_score":0.3509439,"about_ca_system_score_codex":0.00007214396,"about_ca_system_score_gemma":0.000015433423,"threshold_uncertainty_score":0.43412277},"labels":[],"label_agreement":null},{"id":"W2109577721","doi":"10.5555/968878.969032","title":"Managing don't cares in Boolean satisfiability","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":24,"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":"","keywords":"Satisfiability; Boolean satisfiability problem; Computer science; And-inverter graph; Boolean circuit; Boolean function; Very-large-scale integration; Theoretical computer science; Circuit minimization for Boolean functions; Maximum satisfiability problem; Representation (politics); Boolean expression; Process (computing); Algorithm; Programming language; Embedded system","score_opus":0.020125414324483712,"score_gpt":0.2869123942921041,"score_spread":0.26678697996762035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109577721","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.051957414,0.0000238002,0.9311777,0.00092063827,0.00021600083,0.0000974794,9.5766865e-8,0.00013695617,0.01546995],"genre_scores_gemma":[0.51716924,0.000002727083,0.48264647,0.00013372394,0.000007287448,0.000005013278,1.5482573e-7,0.0000016437814,0.00003377084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992837,0.000055999353,0.00015132414,0.00022895486,0.00012754621,0.00015252426],"domain_scores_gemma":[0.9994099,0.000023594675,0.000026171681,0.00048747004,0.000020253921,0.000032591604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053045055,0.000058269412,0.00006718498,0.00007344978,0.000034173514,0.000058504556,0.00045076938,0.000026531025,0.000011299359],"category_scores_gemma":[0.000067291745,0.000053612508,0.000018688852,0.0003052708,0.000027800379,0.0004955768,0.00012042295,0.00007932593,0.000028404704],"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.0000014320542,0.000023769342,0.004678496,0.0000108799895,9.971337e-7,0.0000037647717,0.0008221278,0.002040119,0.00037352525,0.8968172,0.000022587874,0.09520511],"study_design_scores_gemma":[0.00074290007,0.000094598836,0.18966752,0.000036504618,0.0000019743284,0.000013572705,0.00034067096,0.064199455,0.052944094,0.6899571,0.0015866542,0.00041494306],"about_ca_topic_score_codex":0.00051869656,"about_ca_topic_score_gemma":0.00023286139,"teacher_disagreement_score":0.4652118,"about_ca_system_score_codex":0.000114921924,"about_ca_system_score_gemma":0.000030695963,"threshold_uncertainty_score":0.21862546},"labels":[],"label_agreement":null},{"id":"W2109627209","doi":"10.1109/icdar.1995.601962","title":"Analyzing the logical structure of data flow diagrams in software documents","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Diagrammatic reasoning; Data flow diagram; Computer science; Logical data model; Concurrency; Formalism (music); Data structure; Theoretical computer science; Notation; Software; Programming language; Flowchart; Equivalence (formal languages); Data modeling; Algorithm; Software engineering; Mathematics; Database; Discrete mathematics","score_opus":0.08355708970866374,"score_gpt":0.32587905092645525,"score_spread":0.2423219612177915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109627209","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.014235647,0.0001145028,0.98484653,0.00020693184,0.00011557041,0.00009117956,0.000005191808,0.00003896299,0.0003454837],"genre_scores_gemma":[0.3728744,0.000015199441,0.62700266,0.000055410448,0.000011765422,8.500145e-7,0.0000034476377,0.0000015524996,0.00003471627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991572,0.00011468743,0.00019117868,0.00024056996,0.00016524529,0.0001311296],"domain_scores_gemma":[0.998602,0.00009917985,0.00006165283,0.0011921254,0.000022236367,0.000022859278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032454933,0.0000628628,0.0000891547,0.000040004452,0.000037123315,0.00005518289,0.002036724,0.00004089176,0.00015430483],"category_scores_gemma":[0.00021805911,0.000036558788,0.000015809646,0.00043315423,0.000042182815,0.000718092,0.00056392315,0.0001148715,0.000009457604],"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.0000022492159,0.00005924824,0.018344693,0.0000135065375,0.000011541861,0.00000281421,0.0005824972,0.00076067983,0.00041666155,0.027600829,0.0010444345,0.95116085],"study_design_scores_gemma":[0.00016425482,0.000029928704,0.024772042,0.000011857284,0.0000036124559,0.000005643793,0.000020005924,0.96423644,0.0014692221,0.008234823,0.0009413779,0.000110789435],"about_ca_topic_score_codex":0.00002297918,"about_ca_topic_score_gemma":0.000022917733,"teacher_disagreement_score":0.96347576,"about_ca_system_score_codex":0.000014783845,"about_ca_system_score_gemma":0.000004816401,"threshold_uncertainty_score":0.3784774},"labels":[],"label_agreement":null},{"id":"W2109666882","doi":"10.1109/ismvl.2015.17","title":"Using SPIN to Check Nondeterministic Simulink Stateflow Models","year":2015,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology; CMC Microsystems","keywords":"Stateflow; Model checking; Computer science; Promela; Nondeterministic algorithm; Finite-state machine; Abstraction; Programming language; Markov chain; State (computer science); Theoretical computer science; Computer engineering; Machine learning; MATLAB","score_opus":0.36453452709381734,"score_gpt":0.4262703106787759,"score_spread":0.06173578358495857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109666882","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.018259434,0.0000073982756,0.97166616,0.00013585748,0.00047826802,0.00015900005,9.1632864e-7,0.00017245952,0.009120511],"genre_scores_gemma":[0.3172157,3.3772818e-7,0.68209445,0.00038878273,0.000034408233,0.0000044653875,3.665528e-7,0.0000062690888,0.00025520357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888325,0.00006648563,0.00022166321,0.00030336555,0.00027942465,0.00024581235],"domain_scores_gemma":[0.9989028,0.000027156882,0.000051233947,0.00063446653,0.00014329242,0.00024107963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006196042,0.00010578865,0.00011746394,0.00009297951,0.00004699348,0.00013333415,0.000715546,0.00004457408,0.00000652044],"category_scores_gemma":[0.00014990926,0.00009727228,0.000025190846,0.00035200323,0.000019699031,0.00075427996,0.0002608955,0.0000699797,0.00016738298],"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.000025149397,0.00008873414,0.00004944772,0.000022666714,0.000010612034,0.000019788313,0.0046836734,0.6924617,0.0035449006,0.20820896,0.00075838604,0.090125985],"study_design_scores_gemma":[0.00012332387,0.000085458225,0.000028858194,0.000006865527,0.0000020568723,0.000007935078,0.00003061592,0.9807804,0.0038242023,0.01404413,0.0009231306,0.00014298383],"about_ca_topic_score_codex":0.000037762664,"about_ca_topic_score_gemma":0.0000016161449,"teacher_disagreement_score":0.29895627,"about_ca_system_score_codex":0.00009981201,"about_ca_system_score_gemma":0.00013203702,"threshold_uncertainty_score":0.39666483},"labels":[],"label_agreement":null},{"id":"W2109850278","doi":"10.1145/505306.505341","title":"Term ordering problem on MDG","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Rewriting; Computer science; Term (time); Representation (politics); Binary decision diagram; State (computer science); Theoretical computer science; Algorithm; Function (biology); Range (aeronautics); Symbol (formal); Programming language; Engineering","score_opus":0.05497055059660941,"score_gpt":0.27855419019261185,"score_spread":0.22358363959600244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109850278","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.0028096347,0.000010531935,0.7823786,0.00040206985,0.00015652271,0.00007616274,5.9047274e-8,0.000237119,0.21392931],"genre_scores_gemma":[0.12545231,0.000005603228,0.87174225,0.0002954668,0.00002370023,0.000010057095,8.4482394e-8,0.0000034998343,0.0024670074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946266,0.00002495656,0.000093989955,0.00017041626,0.00012121074,0.00012674571],"domain_scores_gemma":[0.99952275,0.000019142863,0.00002675844,0.00038245964,0.000017292492,0.000031594886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014691283,0.000053102358,0.00004437042,0.0000438579,0.000050848117,0.00006742608,0.00042540094,0.00002295278,0.000118769494],"category_scores_gemma":[0.000021293688,0.00004410359,0.000015995567,0.00017698709,0.000012316604,0.0002959292,0.0000710372,0.000058655383,0.0005196986],"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":[5.756889e-7,0.00004236057,0.00011935522,0.0000070683645,0.0000020993416,0.000001593929,0.00035073992,0.00007433022,0.0010009627,0.5744395,0.0011833459,0.42277804],"study_design_scores_gemma":[0.00035135992,0.00030996514,0.005749536,0.000039600523,0.0000021848014,0.000028145061,0.000014976087,0.889937,0.04704591,0.009086855,0.047009006,0.0004254965],"about_ca_topic_score_codex":0.000002623159,"about_ca_topic_score_gemma":4.8915973e-7,"teacher_disagreement_score":0.88986266,"about_ca_system_score_codex":0.000019437124,"about_ca_system_score_gemma":0.000002495162,"threshold_uncertainty_score":0.6679847},"labels":[],"label_agreement":null},{"id":"W2110642232","doi":"10.5381/jot.2008.7.1.a1","title":"Applying Model Checking to Concurrent UML Models.","year":2008,"lang":"en","type":"article","venue":"The Journal of Object Technology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Programming language; Unified Modeling Language; Object Constraint Language; Rewriting; Class diagram; Model checking; UML tool; Applications of UML; Formal methods; Software","score_opus":0.07437595441592651,"score_gpt":0.3084446203884434,"score_spread":0.23406866597251688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110642232","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.072528824,0.000363519,0.9251068,0.0009915943,0.00029871447,0.00017506,2.5171585e-7,0.000099973666,0.000435229],"genre_scores_gemma":[0.63098556,0.000096036245,0.3687202,0.00014212736,0.000025143565,0.000010624617,2.4379386e-8,0.00000560452,0.000014676057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888057,0.00007450915,0.00039607455,0.00011914061,0.00028738423,0.00024233568],"domain_scores_gemma":[0.9988597,0.00004576704,0.00032447968,0.00051365263,0.00020436001,0.00005205757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010888691,0.00010648254,0.00020651695,0.0004180656,0.00018566975,0.000015912923,0.0018789058,0.00009428357,0.0000010545126],"category_scores_gemma":[0.00016487889,0.00007412743,0.000056753903,0.00073799933,0.000112013164,0.00038828191,0.00033343784,0.00046409122,0.000010544917],"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.000034144206,0.000091882896,0.00008249538,0.000012724665,0.000048930946,0.00003116869,0.004766954,0.2769193,0.030088563,0.26349357,0.00074692856,0.42368332],"study_design_scores_gemma":[0.00020092404,0.00018319521,0.00003815493,0.00003130396,0.000009723134,0.0015791772,0.00009254584,0.9300487,0.0370648,0.03021003,0.0004303892,0.000111041765],"about_ca_topic_score_codex":0.0000025733902,"about_ca_topic_score_gemma":5.7223843e-7,"teacher_disagreement_score":0.6531294,"about_ca_system_score_codex":0.000098919605,"about_ca_system_score_gemma":0.0001298193,"threshold_uncertainty_score":0.34915057},"labels":[],"label_agreement":null},{"id":"W2110806620","doi":"10.1177/0037549711424424","title":"Principles of Discrete Event System Specification model verification","year":2011,"lang":"en","type":"article","venue":"SIMULATION","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Computer science; Model checking; Formalism (music); Automaton; Formal verification; Discrete event simulation; Formal specification; Modeling and simulation; Formal methods; Theoretical computer science; Systems modeling; Programming language; Software engineering; Simulation","score_opus":0.144454379368252,"score_gpt":0.3207455792321893,"score_spread":0.17629119986393732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110806620","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.021383556,0.000019020692,0.9678129,0.000012580623,0.00019891003,0.00029563843,0.0000027582018,0.00017170262,0.010102947],"genre_scores_gemma":[0.63797307,0.0000023507655,0.36191654,0.0000033332,0.000017406519,0.000015421941,0.000007112317,0.000006183275,0.000058612415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987032,0.000105437495,0.00049439893,0.00028617008,0.0002833034,0.00012751803],"domain_scores_gemma":[0.99860495,0.00003435524,0.00042613302,0.0006889411,0.00020354344,0.000042094012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065628486,0.00010081219,0.00012001737,0.0001264066,0.0000698954,0.000021371146,0.0004193254,0.00007095366,0.000004570625],"category_scores_gemma":[0.000077981684,0.0000993392,0.000051997096,0.00030595515,0.000032592612,0.00076206215,0.000060571954,0.00005821997,0.000028700664],"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.000016260823,0.000031884927,0.00026525755,0.000042071046,0.0000048234288,9.8809274e-8,0.0012479852,0.2829228,0.0025114166,0.7047511,0.0000010049242,0.008205329],"study_design_scores_gemma":[0.00010708834,0.000030914838,0.018793477,0.00002688675,0.0000068551944,7.231366e-7,0.00004846623,0.958115,0.021232123,0.0014373818,0.000102804646,0.00009828481],"about_ca_topic_score_codex":0.00001072298,"about_ca_topic_score_gemma":6.497518e-7,"teacher_disagreement_score":0.7033137,"about_ca_system_score_codex":0.00011161425,"about_ca_system_score_gemma":0.00003790058,"threshold_uncertainty_score":0.40509352},"labels":[],"label_agreement":null},{"id":"W2110962519","doi":"10.1613/jair.2078","title":"Anytime Point-Based Approximations for Large POMDPs","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":374,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Partially observable Markov decision process; Computer science; Markov decision process; Selection (genetic algorithm); Set (abstract data type); Mathematical optimization; Artificial intelligence; Simplex; Point (geometry); Robotics; Observable; Machine learning; Bellman equation; Markov chain; Markov process; Robot; Mathematics; Markov model","score_opus":0.1885125475786514,"score_gpt":0.45591062523435766,"score_spread":0.2673980776557062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110962519","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.0033465056,0.00009638862,0.99307233,0.0020062057,0.00036743892,0.00034816022,0.0000057986017,0.000039763738,0.00071739766],"genre_scores_gemma":[0.23950051,0.00000727614,0.759962,0.00003922695,0.00037536453,0.0000215573,0.0000015578912,0.000010886651,0.00008159452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695176,0.00039887056,0.0008784746,0.00023000987,0.0009783874,0.000562512],"domain_scores_gemma":[0.99627715,0.0008265962,0.00031754895,0.00045794866,0.0019950923,0.00012564172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010025819,0.000107738495,0.0002007795,0.00073429337,0.00037903414,0.00034905318,0.0013505138,0.00009502768,0.000038731843],"category_scores_gemma":[0.0013640514,0.00009495563,0.00016973107,0.0012151876,0.00009486289,0.00087940606,0.00010097758,0.0004656592,0.00007607314],"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.000069037014,0.00058244314,0.000030912044,0.000039937746,0.000011385451,0.000008223577,0.00029339248,0.0015538237,0.010675318,0.9419853,0.001503923,0.043246273],"study_design_scores_gemma":[0.00006332541,0.00044503048,0.00007544181,0.00003362273,0.0000041887115,0.000019136934,0.00022025699,0.56452304,0.22435997,0.20398463,0.0061606304,0.00011074648],"about_ca_topic_score_codex":0.000018866613,"about_ca_topic_score_gemma":0.000010408176,"teacher_disagreement_score":0.7380007,"about_ca_system_score_codex":0.00018691526,"about_ca_system_score_gemma":0.000454759,"threshold_uncertainty_score":0.3872178},"labels":[],"label_agreement":null},{"id":"W2111110847","doi":"10.1109/ismvl.2005.1","title":"A Characterization of Antisymmetry in Boolean and Multi-Valued Functions","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Victoria; University of Lethbridge","funders":"","keywords":"Antisymmetry; Characterization (materials science); Boolean function; Class (philosophy); Boolean algebra; Computer science; Boolean expression; Mathematics; Algebra over a field; Theoretical computer science; Discrete mathematics; Algorithm; Pure mathematics; Artificial intelligence; Physics","score_opus":0.02857360524793943,"score_gpt":0.28953632687395114,"score_spread":0.2609627216260117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111110847","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.33381924,0.0000069807948,0.66554874,0.00007655672,0.000053473912,0.000057924186,6.8256065e-7,0.000029170016,0.00040723907],"genre_scores_gemma":[0.4715826,0.000008400711,0.5281928,0.00005467447,0.000008728045,0.0000028000532,0.0000014711521,0.0000016457591,0.00014690676],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951005,0.00004528546,0.00016505245,0.00013363446,0.000070928254,0.00007502904],"domain_scores_gemma":[0.9996934,0.000009171329,0.000056157365,0.00019136012,0.000028244709,0.000021669859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025530907,0.00004311542,0.00006671571,0.00013040799,0.00002120704,0.00001937591,0.00012808082,0.00003017683,0.000007878211],"category_scores_gemma":[0.000040015937,0.000041145464,0.000010473547,0.0003039732,0.000021380834,0.00055680185,0.00005219417,0.00004264329,0.000009592424],"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.000007363867,0.0002157001,0.0192435,0.00002486489,0.0000058839614,4.8805e-7,0.0010215106,0.000043304517,0.37989807,0.23472744,0.000018540462,0.36479333],"study_design_scores_gemma":[0.00021950009,0.000021846947,0.3454916,0.000008140633,0.0000011090871,0.0000032464716,0.000013763098,0.60461766,0.049169753,0.000041609183,0.0003545983,0.000057172223],"about_ca_topic_score_codex":0.000016502245,"about_ca_topic_score_gemma":0.000015484355,"teacher_disagreement_score":0.6045744,"about_ca_system_score_codex":0.000014178453,"about_ca_system_score_gemma":0.000010494244,"threshold_uncertainty_score":0.16778633},"labels":[],"label_agreement":null},{"id":"W2112020780","doi":"10.1109/ccece.2006.277745","title":"MDG-Based Verification of the Look-Aside Interface","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Aside; Programming language; Computer science; Interface (matter); Verilog; Formal verification; Model checking; Operating system","score_opus":0.014761944917597141,"score_gpt":0.26356069531133197,"score_spread":0.24879875039373484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112020780","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.02749686,0.000023282906,0.95923316,0.0005309506,0.00025377728,0.000112561174,5.0325485e-7,0.00007373294,0.012275148],"genre_scores_gemma":[0.6295517,2.7566003e-7,0.37004524,0.00006663323,0.000010272339,0.0000047569574,3.2452837e-7,0.0000023284515,0.00031844477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992895,0.000088811095,0.00019652561,0.00015632807,0.00017614392,0.00009265721],"domain_scores_gemma":[0.99898016,0.00004347255,0.00012191859,0.00076947204,0.00007237914,0.000012612767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033134068,0.00005760191,0.00006010873,0.00003556682,0.000045092827,0.000029156608,0.0008001634,0.0000325295,0.0000139824],"category_scores_gemma":[0.000055381875,0.00003949195,0.000040807525,0.00030605524,0.000059328024,0.00019618002,0.00007188953,0.00005530682,0.000026679438],"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.0000072575563,0.00010252026,0.002180135,0.000021156306,0.0000035134237,1.3655206e-7,0.00010694997,0.0055185324,0.08477255,0.8848031,0.0015338685,0.020950288],"study_design_scores_gemma":[0.00009865775,0.000018997689,0.031763617,0.000009536782,0.0000020180926,0.0000010483899,0.000008084166,0.1721723,0.79019165,0.0035343377,0.0021390961,0.000060686736],"about_ca_topic_score_codex":0.0001013193,"about_ca_topic_score_gemma":0.0000102927415,"teacher_disagreement_score":0.88126874,"about_ca_system_score_codex":0.000030293866,"about_ca_system_score_gemma":0.000040870014,"threshold_uncertainty_score":0.16104351},"labels":[],"label_agreement":null},{"id":"W2112322240","doi":"10.1007/978-3-642-24690-6_13","title":"Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Ode; Predicative expression; Ordinary differential equation; Enclosure; Modulo; Mathematics; Computer science; State (computer science); Monotonic function; Algorithm; Domain (mathematical analysis); Theoretical computer science; Applied mathematics; Differential equation; Discrete mathematics","score_opus":0.03437690028281664,"score_gpt":0.2992385995798528,"score_spread":0.2648616992970362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112322240","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.0001153176,0.0010825989,0.9926945,0.00007943794,0.004283938,0.0010499569,0.00003742594,0.00025899205,0.00039784436],"genre_scores_gemma":[0.06026245,0.000030926956,0.93880445,0.00022085852,0.00024602286,0.00008862945,0.00003452411,0.000054464555,0.0002576566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99425113,0.00026346656,0.0010800632,0.0024209286,0.0010011861,0.0009832227],"domain_scores_gemma":[0.994578,0.0011304847,0.0010235709,0.0025542718,0.0004443085,0.000269332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037880964,0.000831157,0.0012744393,0.0014690479,0.00044842548,0.0009016358,0.005086417,0.0004062998,0.000007977172],"category_scores_gemma":[0.00035486868,0.00073661737,0.0004370768,0.00094792986,0.0005253685,0.0008485981,0.0014419877,0.000868046,0.000007816553],"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.0000138085,0.00007875029,0.00009707014,0.00021500305,0.00021490746,0.000010140286,0.0010499553,0.0218991,0.0015024594,0.05014977,0.000040761846,0.9247283],"study_design_scores_gemma":[0.0002340758,0.00027474592,0.00005259785,0.00015683986,0.00014854538,0.00001723907,3.6958397e-7,0.945382,0.009474576,0.042742632,0.00066219,0.0008541825],"about_ca_topic_score_codex":0.00009431848,"about_ca_topic_score_gemma":0.000012880302,"teacher_disagreement_score":0.9238741,"about_ca_system_score_codex":0.0005305392,"about_ca_system_score_gemma":0.0002461328,"threshold_uncertainty_score":0.9995085},"labels":[],"label_agreement":null},{"id":"W2113201355","doi":"10.5555/823453.823837","title":"Bridging CSP and C++ with selective formalism and executable specifications","year":2003,"lang":"en","type":"article","venue":"International Conference on Formal Methods and Models for Co-Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"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 Guelph","funders":"","keywords":"Computer science; Communicating sequential processes; Programming language; Executable; Formal specification; Formalism (music); Formal methods; Specification language; Language Of Temporal Ordering Specification; Formal verification; Concurrency; Inter-process communication; Semantics (computer science); Operational semantics; Distributed computing","score_opus":0.22047810455563632,"score_gpt":0.3901348550870173,"score_spread":0.16965675053138096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113201355","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.000530454,0.00008990542,0.9860019,0.00027970274,0.00013827182,0.0006300559,0.0000126992,0.00006607364,0.012250927],"genre_scores_gemma":[0.20320028,0.00018991054,0.79606766,0.00013049194,0.00002172937,0.00016128068,0.000004094354,0.000013125034,0.00021144278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835074,0.00029489284,0.00028684112,0.00050246617,0.00023837555,0.00032666844],"domain_scores_gemma":[0.9987647,0.00034177426,0.0001773123,0.00024556968,0.00033512508,0.00013552868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021184774,0.0002238634,0.00022251402,0.00020195961,0.00033310743,0.00037643476,0.00031360504,0.00008455905,0.0000053834274],"category_scores_gemma":[0.00014790778,0.00019216341,0.000029250657,0.00013239811,0.00012933773,0.00202877,0.00006681867,0.00017065063,8.994901e-7],"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.00011383626,0.000026862626,0.000010770238,0.000011203405,0.000033921264,6.2881276e-7,0.00068303145,0.0010252927,0.0011639474,0.9184403,0.000040982424,0.078449264],"study_design_scores_gemma":[0.0006047528,0.00045147835,0.00010303272,0.000036839487,0.000013695217,0.00009675122,0.00011780207,0.8168884,0.017888308,0.16248691,0.0010702178,0.00024179682],"about_ca_topic_score_codex":0.000012438753,"about_ca_topic_score_gemma":9.4620617e-7,"teacher_disagreement_score":0.81586313,"about_ca_system_score_codex":0.000048594673,"about_ca_system_score_gemma":0.00010378303,"threshold_uncertainty_score":0.78361964},"labels":[],"label_agreement":null},{"id":"W2113380728","doi":"10.1109/mwscas.2011.6026268","title":"Generating compact assertions for control-based logic signals","year":2011,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; McGill University; CMC Microsystems (Canada)","funders":"","keywords":"Assertion; Computer science; Set (abstract data type); Measure (data warehouse); Control (management); Algorithm; State (computer science); SIGNAL (programming language); Programming language; Theoretical computer science; Quality (philosophy); Data mining; Artificial intelligence","score_opus":0.16265425659116325,"score_gpt":0.347086360493684,"score_spread":0.18443210390252077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113380728","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.0014073814,0.000013837595,0.99134886,0.00022998851,0.00018270678,0.00027312065,0.0000022853867,0.00020245356,0.0063393414],"genre_scores_gemma":[0.4251256,1.2451612e-7,0.5739292,0.00084729906,0.00001918067,0.000023942659,0.000001053383,0.0000030145288,0.00005057877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992209,0.00009868726,0.00019851359,0.00019708916,0.00009928631,0.00018554537],"domain_scores_gemma":[0.99922234,0.00015892027,0.000087315675,0.000351168,0.00012363694,0.00005663633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006703351,0.00007984721,0.00010701402,0.000055571152,0.00014319226,0.000064788335,0.00044701467,0.000039354392,0.00005785737],"category_scores_gemma":[0.00016077106,0.000065110864,0.00006265445,0.00013857464,0.000022634586,0.0002956766,0.000014193091,0.00004562725,0.000026999762],"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.000018823594,0.00014282844,0.0005285348,0.0000132365,0.000017607026,7.8341344e-7,0.00020779177,0.006814337,0.034742296,0.9502426,0.00069219025,0.006578966],"study_design_scores_gemma":[0.00032024214,0.00013550177,0.0011366822,0.0000033824124,0.0000045677243,0.0000011157562,0.0000072823013,0.944376,0.04362651,0.0101298345,0.00016153471,0.00009732892],"about_ca_topic_score_codex":0.000022503422,"about_ca_topic_score_gemma":0.000003375679,"teacher_disagreement_score":0.94011277,"about_ca_system_score_codex":0.000021542297,"about_ca_system_score_gemma":0.000045603752,"threshold_uncertainty_score":0.26551437},"labels":[],"label_agreement":null},{"id":"W2113879582","doi":"10.1109/isads.2003.1193948","title":"A rigorous approach to modeling autonomous traffic control systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Formalism (music); Computer science; Control system; Formal description; Formal verification; Road traffic control; Control (management); Distributed computing; Systems engineering; Artificial intelligence; Theoretical computer science; Programming language; Engineering","score_opus":0.03847872968529164,"score_gpt":0.2629569098492101,"score_spread":0.22447818016391846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113879582","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.0054887095,0.000085300504,0.95009375,0.000033801327,0.00048402586,0.00045644538,4.96254e-7,0.00038539903,0.04297209],"genre_scores_gemma":[0.5161479,4.2476717e-7,0.48344058,0.000120226236,0.000015444573,0.00005923523,1.8884201e-7,0.0000053607373,0.0002106047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861145,0.0002045438,0.00027884415,0.00039237438,0.00021698182,0.00029578034],"domain_scores_gemma":[0.9990675,0.00003190082,0.000045990797,0.00064537965,0.000078014564,0.00013122488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010154402,0.00012309938,0.0001737614,0.00010161009,0.00009583404,0.00020107249,0.00062099687,0.00006291251,0.0000020647742],"category_scores_gemma":[0.000099395766,0.00010734358,0.00004183126,0.00033690175,0.000010243232,0.0003286044,0.000029527067,0.00009228556,0.0000973166],"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.0000012553506,0.00003316515,0.0000011358957,0.000006409291,0.000004153251,3.7753728e-7,0.00023943555,0.5967799,0.00004719769,0.3996086,0.000036399237,0.0032419967],"study_design_scores_gemma":[0.0002260403,0.000039286013,0.0000034244072,0.0000038127773,0.0000031777436,0.000040831146,0.00007006931,0.9979233,0.000087547545,0.00018429705,0.0012681751,0.00015001006],"about_ca_topic_score_codex":0.000024065828,"about_ca_topic_score_gemma":4.7266875e-7,"teacher_disagreement_score":0.5106592,"about_ca_system_score_codex":0.000085298234,"about_ca_system_score_gemma":0.00006380054,"threshold_uncertainty_score":0.4377344},"labels":[],"label_agreement":null},{"id":"W2113932434","doi":"","title":"Clause learning can effectively P-simulate general propositional resolution","year":2008,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":49,"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":"","keywords":"DPLL algorithm; Mathematical proof; Computer science; Resolution (logic); Class (philosophy); Artificial intelligence; Algorithm; Mathematics","score_opus":0.1641521181636323,"score_gpt":0.3675864209641359,"score_spread":0.20343430280050362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113932434","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.047742784,0.000012818763,0.9415364,0.001039643,0.00045483257,0.00032413314,0.000009462222,0.00025124027,0.008628651],"genre_scores_gemma":[0.88157547,0.000021292622,0.117517956,0.0002836619,0.00018619664,0.000053492306,0.000022887449,0.000010944274,0.00032812255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971208,0.000402107,0.00045476446,0.0005933681,0.0010908525,0.00033809504],"domain_scores_gemma":[0.9981141,0.00022355093,0.00020795388,0.00025708423,0.0010767498,0.00012053667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000883504,0.00021242154,0.00017472536,0.00028268973,0.00066448806,0.0001419168,0.00067169353,0.000134221,0.00007863159],"category_scores_gemma":[0.00085237063,0.00021728803,0.000078799116,0.0006237621,0.00023267836,0.00056600664,0.00010774653,0.0004844342,0.00040286937],"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.000052697655,0.0001063072,0.00006589812,0.000004411057,0.000009491743,0.000007885247,0.00039607883,0.035301562,0.0045473855,0.9363451,0.00005380775,0.023109378],"study_design_scores_gemma":[0.00004284507,0.00026013044,0.0043794434,0.000027554437,0.000002542346,0.00003591526,0.000018014935,0.817826,0.04702513,0.12986584,0.00025486073,0.00026172723],"about_ca_topic_score_codex":0.00004844966,"about_ca_topic_score_gemma":0.000013105978,"teacher_disagreement_score":0.8338327,"about_ca_system_score_codex":0.0003173907,"about_ca_system_score_gemma":0.00046630672,"threshold_uncertainty_score":0.8860749},"labels":[],"label_agreement":null},{"id":"W2114139508","doi":"10.1109/async.2004.1299293","title":"Bolstering faith in GasP circuits through formal verification","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Handshake; Correctness; Modular design; Electronic circuit; Formal verification; Debugging; Set (abstract data type); Exploit; Algorithm; Programming language; Overhead (engineering)","score_opus":0.04435762094354133,"score_gpt":0.2985641179535366,"score_spread":0.25420649700999526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114139508","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.057017908,0.000022394974,0.92240065,0.00024247194,0.0002655675,0.00015843907,2.690646e-7,0.00017811138,0.019714173],"genre_scores_gemma":[0.56133974,0.0000072328435,0.43843126,0.00015192988,0.000018223242,0.000018825089,0.0000010173954,0.000004196076,0.000027579292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99892664,0.000037809674,0.00026016578,0.00028760667,0.00019661788,0.0002911361],"domain_scores_gemma":[0.9993087,0.000014916751,0.00007014604,0.0005336775,0.000036509737,0.000036073114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043614532,0.00009768557,0.000097407974,0.00008142864,0.000068226465,0.00009836152,0.00061247934,0.00005831639,0.000008608879],"category_scores_gemma":[0.00004836833,0.00009486385,0.00002722848,0.0004761304,0.000024953582,0.0028606537,0.00011849678,0.00011113204,0.00009580822],"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.0000023700156,0.000048501857,0.00021379846,0.000014023779,0.0000020857358,0.0000031291208,0.0020767823,0.0013416691,0.0073348605,0.9324118,0.00000883285,0.05654216],"study_design_scores_gemma":[0.0035489479,0.00045198994,0.23334587,0.00019328714,0.000007957067,0.00017860458,0.00068821147,0.109418795,0.49683738,0.14745861,0.006496373,0.0013739571],"about_ca_topic_score_codex":0.000089534784,"about_ca_topic_score_gemma":0.000016391497,"teacher_disagreement_score":0.7849532,"about_ca_system_score_codex":0.00014355716,"about_ca_system_score_gemma":0.00005161508,"threshold_uncertainty_score":0.38684353},"labels":[],"label_agreement":null},{"id":"W2114140119","doi":"10.1109/icfem.2000.873808","title":"SPIN vs. VIS: a case study on the formal verification of the ATMR protocol","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Asynchronous communication; Interleaving; Formal verification; Protocol (science); Software verification; Software; Model checking; Formal methods; Intelligent verification; Promela; High-level verification; Functional verification; Communications protocol; Verification; Embedded system; Computer hardware; Software system; Theoretical computer science; Programming language; Operating system; Computer network; Software construction","score_opus":0.08978592293705602,"score_gpt":0.3503049249776166,"score_spread":0.2605190020405606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114140119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38870147,0.0000029096059,0.43310636,0.0025238104,0.0003989355,0.15591958,0.0000016503578,0.00024558787,0.019099679],"genre_scores_gemma":[0.9347336,1.376321e-7,0.033118214,0.0002450215,0.00002295994,0.031650603,4.273272e-8,0.00000550126,0.00022390849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986911,0.0003211834,0.00028611912,0.0002136411,0.00032903085,0.00015896084],"domain_scores_gemma":[0.9982863,0.00007636572,0.00018164318,0.0013530026,0.00007783653,0.00002483891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009960524,0.000096841635,0.00008392862,0.00003562353,0.00023088901,0.00006679253,0.0010173987,0.00003286205,0.000041901356],"category_scores_gemma":[0.00013578628,0.000047694502,0.00005066129,0.00047404412,0.00005720456,0.0004135899,0.00018524633,0.00013078039,0.000050477032],"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.0000875878,0.0035184196,0.0037587464,0.00008239812,0.00006481557,0.00005524983,0.029859358,0.00036127807,0.0016955297,0.7149367,0.0037829112,0.24179703],"study_design_scores_gemma":[0.0017364087,0.0025918803,0.044089705,0.000054607503,0.000021584878,0.00052089425,0.004237159,0.8812461,0.05466025,0.0007956103,0.009603154,0.00044263472],"about_ca_topic_score_codex":0.000056923363,"about_ca_topic_score_gemma":0.00001012813,"teacher_disagreement_score":0.8808848,"about_ca_system_score_codex":0.000034117475,"about_ca_system_score_gemma":0.000015685413,"threshold_uncertainty_score":0.19449253},"labels":[],"label_agreement":null},{"id":"W2114163208","doi":"10.1109/icecs.2007.4511232","title":"Communication Structure Refinement using Temporal Constraints Analysis","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Computer science; Consistency (knowledge bases); Property (philosophy); Temporal logic; Local consistency; Communications protocol; Protocol (science); Distributed computing; SIGNAL (programming language); Theoretical computer science; Data structure; Programming language; Artificial intelligence; Constraint satisfaction; Computer network","score_opus":0.04587027417220486,"score_gpt":0.3493936062537659,"score_spread":0.30352333208156107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114163208","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.06292428,0.000021563874,0.93228817,0.00007905965,0.000074723896,0.000071852155,0.0000013215006,0.000085396554,0.004453649],"genre_scores_gemma":[0.48659042,8.510764e-7,0.5132898,0.00008262419,0.0000059703575,3.191929e-7,0.0000054803268,0.0000014128498,0.00002311979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991018,0.00008241614,0.00026656603,0.00018426181,0.00020664661,0.00015831181],"domain_scores_gemma":[0.9987831,0.000041515283,0.00013156669,0.00086801016,0.00012408198,0.00005168649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010449816,0.00007482312,0.00010700887,0.00021331514,0.00011669872,0.00007023848,0.0006363293,0.000050990635,0.00011670158],"category_scores_gemma":[0.00004770813,0.00006675194,0.000043278567,0.0013617922,0.000079599755,0.00030928245,0.0001448887,0.00009060257,0.0000045460247],"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.000008746584,0.000068515685,0.024026968,0.000009885632,0.00024641585,0.0000032520397,0.0009212647,0.0017412758,0.0113260215,0.7857024,0.000104650746,0.1758406],"study_design_scores_gemma":[0.0003678844,0.00004479224,0.10495917,0.000011881158,0.00014401364,0.00002226286,0.00030598856,0.8430496,0.042508796,0.006144106,0.0020187588,0.00042274818],"about_ca_topic_score_codex":0.00011064315,"about_ca_topic_score_gemma":0.00010154794,"teacher_disagreement_score":0.8413083,"about_ca_system_score_codex":0.00007669181,"about_ca_system_score_gemma":0.000030185181,"threshold_uncertainty_score":0.27220652},"labels":[],"label_agreement":null},{"id":"W2114385068","doi":"10.1109/iwsm.1996.534146","title":"Applying the policy concept to the management of ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"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":"Computer science; Network management; Structure of Management Information; Personalization; Asynchronous Transfer Mode; Integrated Services Digital Network; Network element; Element management system; Resource management (computing); Distributed computing; Systems management; Domain (mathematical analysis); Computer network; Network management application; Network management station; Network architecture; World Wide Web","score_opus":0.041057454078828555,"score_gpt":0.2977036271046283,"score_spread":0.25664617302579973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114385068","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.00008242157,0.00008873383,0.9553983,0.003186991,0.00016440554,0.0005196518,1.3214947e-7,0.000042063693,0.0405173],"genre_scores_gemma":[0.33726266,0.00004110986,0.6575001,0.002741266,0.00011583851,0.0002742688,1.15174146e-7,0.0000042518395,0.0020603966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937123,0.00006811616,0.00013080738,0.00012400617,0.00016237813,0.00014343546],"domain_scores_gemma":[0.9991507,0.00004679014,0.000047304227,0.0007081149,0.000023002556,0.000024121031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040244003,0.000051963874,0.000049349368,0.000022123855,0.00010906711,0.000049728314,0.0011588624,0.000015518446,0.000024504508],"category_scores_gemma":[0.000010237275,0.000026485483,0.00002651965,0.0005585185,0.000037293947,0.00009878836,0.00030749216,0.000055478762,0.000048168087],"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":[2.9815308e-7,0.000005329698,0.0000058248334,0.0000016811015,0.0000065236486,1.4991907e-7,0.00040281098,0.005863313,0.0000031298887,0.58246267,0.0015241881,0.40972406],"study_design_scores_gemma":[0.00007260053,0.00002760214,0.0009553452,0.000011051191,0.000004412861,0.0000027979831,0.00027220024,0.89707804,0.00047112704,0.001077777,0.09995369,0.00007337749],"about_ca_topic_score_codex":0.000029494991,"about_ca_topic_score_gemma":0.0000010121663,"teacher_disagreement_score":0.8912147,"about_ca_system_score_codex":0.00001870283,"about_ca_system_score_gemma":0.000002497668,"threshold_uncertainty_score":0.2153474},"labels":[],"label_agreement":null},{"id":"W2114600785","doi":"10.1007/978-3-540-74970-7_49","title":"Hierarchical Hardness Models for SAT","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":47,"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":"Classifier (UML); Computer science; Boolean satisfiability problem; Solver; Class (philosophy); Artificial intelligence; Machine learning; Algorithm","score_opus":0.06872056972064919,"score_gpt":0.32058859081652596,"score_spread":0.2518680210958768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114600785","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.000010286198,0.00023197163,0.98961854,0.00036256286,0.0038107065,0.000753553,0.000009392782,0.00022283183,0.004980177],"genre_scores_gemma":[0.0050129467,0.000019160576,0.9925345,0.001358867,0.0005630999,0.000026568048,0.000008502393,0.00004131045,0.00043505378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556243,0.000042095726,0.00066631346,0.0017401319,0.0011118142,0.00087718666],"domain_scores_gemma":[0.99661225,0.00065597263,0.00030015217,0.0018107693,0.00038786847,0.00023297362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027924452,0.0005251133,0.00054675585,0.0010102462,0.00030719832,0.00047891287,0.00459212,0.00050509046,0.000006978848],"category_scores_gemma":[0.00021054834,0.0004929572,0.00019381847,0.0006091795,0.0008378753,0.0010721876,0.0011288611,0.0008844698,0.000028485367],"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.000010791682,0.000015777381,0.0000022935053,0.000037171743,0.0000048275383,0.000010721787,0.00034094148,0.022025693,0.000038029513,0.36494124,0.000015262143,0.6125573],"study_design_scores_gemma":[0.00014547772,0.00009822566,0.000015541851,0.00010682373,0.000003670342,0.00003014404,3.643119e-8,0.5816592,0.0008397974,0.41468635,0.0020499944,0.00036475435],"about_ca_topic_score_codex":0.0000061919595,"about_ca_topic_score_gemma":0.000016103304,"teacher_disagreement_score":0.6121925,"about_ca_system_score_codex":0.0003948134,"about_ca_system_score_gemma":0.0005391894,"threshold_uncertainty_score":0.9997522},"labels":[],"label_agreement":null},{"id":"W2115026027","doi":"10.1016/j.jal.2011.01.002","title":"Formal reliability analysis of combinational circuits using theorem proving","year":2011,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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":"Combinational logic; Automated theorem proving; Computer science; HOL; Reliability (semiconductor); Reliability engineering; Boolean circuit; Benchmark (surveying); Sequential logic; Algorithm; Logic gate; Theoretical computer science; Computer engineering; Programming language; Engineering","score_opus":0.07512871240220503,"score_gpt":0.29436376033530653,"score_spread":0.2192350479331015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115026027","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.24911654,0.000011692174,0.7438259,0.0000098503915,0.00012308225,0.00007328233,7.2923893e-7,0.000010337522,0.006828569],"genre_scores_gemma":[0.62985647,0.0000015562781,0.3700962,0.000027848846,0.000013387858,8.689581e-7,2.8849684e-7,0.0000021771082,0.0000012216829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985691,0.00007856643,0.0006472568,0.0001386067,0.0004072695,0.00015919987],"domain_scores_gemma":[0.9981744,0.000093450806,0.0010056825,0.00031731214,0.00035406096,0.000055080898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027652907,0.000086923865,0.0002969243,0.00039822195,0.000073652554,0.000023407485,0.0007234286,0.000062292886,0.00002775112],"category_scores_gemma":[0.00012995681,0.00006876467,0.00016280977,0.0009603113,0.000089236935,0.0006111819,0.00011040893,0.00017231883,0.0000011915428],"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.00002182953,0.00021526922,0.0015088008,0.000022337033,0.00017581497,0.0000024502851,0.0015724327,0.006087349,0.0054720724,0.95907587,0.0000029981938,0.025842773],"study_design_scores_gemma":[0.0007362804,0.00039728853,0.20882523,0.000026883288,0.00055799115,0.000054557164,0.00028663914,0.4385123,0.03151024,0.3187605,0.000034209643,0.00029786126],"about_ca_topic_score_codex":0.0000035145003,"about_ca_topic_score_gemma":2.2949705e-7,"teacher_disagreement_score":0.64031535,"about_ca_system_score_codex":0.00008547391,"about_ca_system_score_gemma":0.00009844821,"threshold_uncertainty_score":0.2804142},"labels":[],"label_agreement":null},{"id":"W2115161547","doi":"10.1007/978-3-642-00602-9_1","title":"Applications of MetiTarski in the Verification of Control and Hybrid Systems","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Hybrid system; Inverted pendulum; Trigonometry; Control system; Maple; Trigonometric functions; Stability (learning theory); Control (management); Control theory (sociology); Algorithm; Control engineering; Mathematics; Artificial intelligence; Machine learning","score_opus":0.015217009148785066,"score_gpt":0.2601215772770818,"score_spread":0.24490456812829672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115161547","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.00011728981,0.0011041682,0.9963953,0.0002171619,0.0002248597,0.00084658485,0.000007703314,0.000020914822,0.001066029],"genre_scores_gemma":[0.57860285,0.00007391505,0.42102805,0.00017008423,0.00006431174,0.000035155743,0.0000023755288,0.000007341041,0.000015925027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997789,0.00011073266,0.0006336673,0.00062286056,0.00062766584,0.00021601906],"domain_scores_gemma":[0.9974323,0.0005184863,0.0005181692,0.0012670448,0.00022625453,0.000037780617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023178076,0.000212112,0.0003965917,0.00057011365,0.00006839315,0.00010287831,0.002286463,0.00012086711,7.050456e-7],"category_scores_gemma":[0.000097278644,0.00016686543,0.00005004031,0.0005843424,0.0005647288,0.00031915808,0.00014774254,0.00033081905,0.0000016700253],"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.0000056475183,0.000038234208,0.000054274864,0.00008795813,0.0000052396886,0.0000021855253,0.00067408575,0.009368379,0.00050585286,0.27476752,0.0000028121874,0.7144878],"study_design_scores_gemma":[0.00045070442,0.00028441948,0.0025151153,0.0003978276,0.000019696892,0.00007936634,0.0000017060277,0.8504971,0.0024919244,0.14103812,0.0018081088,0.00041590966],"about_ca_topic_score_codex":0.000036639623,"about_ca_topic_score_gemma":0.0000075785633,"teacher_disagreement_score":0.8411287,"about_ca_system_score_codex":0.00007867465,"about_ca_system_score_gemma":0.00016297927,"threshold_uncertainty_score":0.6804575},"labels":[],"label_agreement":null},{"id":"W2115178223","doi":"10.1007/s10817-008-9113-6","title":"Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables","year":2008,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"HOL; Variance (accounting); Random variable; Probabilistic logic; Computer science; Mathematics; Automated theorem proving; Variable (mathematics); Probabilistic analysis of algorithms; Theoretical computer science; Statistics","score_opus":0.035131381346365564,"score_gpt":0.32424610219894545,"score_spread":0.2891147208525799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115178223","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.1666564,0.00010424475,0.83243126,0.00009046312,0.00033014317,0.00018209383,6.6804927e-7,0.000104533334,0.000100212616],"genre_scores_gemma":[0.38902056,0.000010760853,0.61086094,0.000025850757,0.00006466359,0.0000037533105,2.2136753e-7,0.000007637327,0.000005632465],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988554,0.00015728576,0.00040729067,0.0001647473,0.00022320895,0.00019207156],"domain_scores_gemma":[0.9987575,0.00024393036,0.0004922618,0.00016618834,0.00024670668,0.000093448616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00134819,0.00010730215,0.00022700249,0.00016413316,0.0002758785,0.0001164359,0.00030239506,0.00006462233,0.0000010818698],"category_scores_gemma":[0.0012674088,0.00008969048,0.00005240994,0.00031560851,0.00003107144,0.0010460337,0.000058093923,0.00012445568,3.9057858e-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.0021395243,0.00021207206,0.0041788626,0.00038287163,0.00046501152,0.00020849405,0.05143698,0.1522971,0.5323291,0.20145689,0.0009895245,0.05390358],"study_design_scores_gemma":[0.0009933808,0.00015241766,0.0034953335,0.00027530853,0.000018169378,0.00084488833,0.000109982626,0.98183835,0.011355521,0.00066457194,0.0001248913,0.00012717438],"about_ca_topic_score_codex":0.0000053494123,"about_ca_topic_score_gemma":1.4848956e-7,"teacher_disagreement_score":0.82954127,"about_ca_system_score_codex":0.00007692173,"about_ca_system_score_gemma":0.00012009679,"threshold_uncertainty_score":0.36574715},"labels":[],"label_agreement":null},{"id":"W2115995803","doi":"10.1109/ismvl.2001.924571","title":"Model checking with multi-valued temporal logics","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":18,"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":"","keywords":"Computation tree logic; Model checking; Kripke structure; Computer science; Kripke semantics; Linear temporal logic; Temporal logic; Binary decision diagram; Theoretical computer science; Atomic sentence; Truth value; Extension (predicate logic); Semantics (computer science); Algorithm; Symbolic trajectory evaluation; Programming language; Intermediate logic; Description logic; Artificial intelligence","score_opus":0.19604181908418036,"score_gpt":0.31589745328777186,"score_spread":0.1198556342035915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115995803","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.0034867695,0.000019970897,0.9830971,0.00010507085,0.00006371264,0.000094245916,2.0524315e-7,0.00026306172,0.012869894],"genre_scores_gemma":[0.27501398,0.000003072144,0.7236436,0.00021781353,0.000009348382,0.0000060046746,2.5695735e-7,0.00000445742,0.0011014704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922943,0.00003582803,0.00012897681,0.00023938416,0.00019007965,0.00017629145],"domain_scores_gemma":[0.99936026,0.000007860482,0.00005881156,0.00046823814,0.000054210992,0.000050641458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002597358,0.00008750146,0.00008137979,0.0000452296,0.00007630555,0.00007892851,0.0005236131,0.000041969903,0.000021860982],"category_scores_gemma":[0.00002956557,0.00006344515,0.000020936965,0.00023779874,0.000034161676,0.0005450768,0.00009054649,0.000089340276,0.00006555],"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.000005440179,0.00019828376,0.0017995118,0.000015003748,0.000011887698,0.000008045933,0.0017598602,0.023960829,0.00078941626,0.93572754,0.0005761369,0.035148077],"study_design_scores_gemma":[0.0001883336,0.00003718569,0.00029807657,0.0000043718214,0.0000014042103,0.000008198306,0.000011647764,0.9966098,0.0019334385,0.0006647308,0.00012974544,0.000113052454],"about_ca_topic_score_codex":0.000009913751,"about_ca_topic_score_gemma":0.0000038410085,"teacher_disagreement_score":0.972649,"about_ca_system_score_codex":0.000027696273,"about_ca_system_score_gemma":0.000010708424,"threshold_uncertainty_score":0.25872183},"labels":[],"label_agreement":null},{"id":"W2116002481","doi":"10.1109/ccece.2007.353","title":"Pipeline Design and Verification in Bluenose II","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Waterloo","funders":"","keywords":"Computer science; Pipeline (software); Formal verification; Functional verification; Time to market; Abstraction; Pipeline transport; Intelligent verification; Model checking; High-level verification; Runtime verification; Formal methods; Software engineering; Verification; Embedded system; Reliability engineering; Programming language; Software; Engineering; Software development","score_opus":0.03727691401040105,"score_gpt":0.30727524836191983,"score_spread":0.26999833435151877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116002481","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.019885782,0.0000350469,0.97617483,0.00018678504,0.00009665353,0.00013578891,4.8487884e-8,0.00007982212,0.003405253],"genre_scores_gemma":[0.306654,0.000009418321,0.6929518,0.000119381235,0.000011107756,0.0000031975144,2.8967324e-7,0.000002091374,0.00024872486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932736,0.00005719908,0.0001822625,0.00019456497,0.00010042637,0.00013819362],"domain_scores_gemma":[0.9995214,0.000073336036,0.000039513907,0.00029251302,0.000032400232,0.000040835774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020061275,0.00005388419,0.000055879394,0.00011336824,0.000051797706,0.000028596665,0.00024319145,0.000040786283,0.00000421404],"category_scores_gemma":[0.00010568832,0.00005002051,0.00000705478,0.00033250081,0.00002390955,0.00038765068,0.0000754653,0.000060440627,0.000013838282],"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.000023659479,0.000086795575,0.00042197027,0.000006775225,0.000001321708,0.0000039758716,0.0013724393,0.00020672703,0.012914618,0.4834347,0.0003992831,0.5011277],"study_design_scores_gemma":[0.00044802227,0.00013286875,0.05641461,0.000010953644,0.000001754833,0.000018572327,0.000060229057,0.73830384,0.1913981,0.008119072,0.004870505,0.0002214576],"about_ca_topic_score_codex":0.000017338556,"about_ca_topic_score_gemma":0.0000052711393,"teacher_disagreement_score":0.73809713,"about_ca_system_score_codex":0.00002892023,"about_ca_system_score_gemma":0.000014588872,"threshold_uncertainty_score":0.20397772},"labels":[],"label_agreement":null},{"id":"W2116117396","doi":"10.1109/tse.2003.1237171","title":"Temporal logic query checking: a tool for model exploration","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Software Engineering","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":67,"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":"","keywords":"Computer science; Temporal logic; Model checking; Kripke structure; Theoretical computer science; Query optimization; Computation tree logic; Linear temporal logic; Interval temporal logic; Query language; Set (abstract data type); Programming language; Information retrieval","score_opus":0.05622366089218801,"score_gpt":0.2785760117045132,"score_spread":0.22235235081232518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116117396","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.001168264,0.000018108467,0.9967959,0.000026194286,0.00089992513,0.00033125482,0.0000063870616,0.0007340842,0.00001989177],"genre_scores_gemma":[0.2911915,0.000005216846,0.7083837,0.000049057162,0.00001593222,0.00024800186,0.0000012896887,0.000019483556,0.00008585965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989728,0.000029053295,0.00025208652,0.0003157709,0.00017791081,0.00025238242],"domain_scores_gemma":[0.99927706,0.00010647689,0.00005316676,0.00042508854,0.000080564474,0.000057663845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003882326,0.00017133506,0.00013934915,0.0001774914,0.00013907418,0.00008302315,0.00025991,0.000099336874,0.0000036658967],"category_scores_gemma":[0.000108610904,0.00018657792,0.0001047273,0.0003299566,0.000010941278,0.0010330372,0.0000011029255,0.00017462758,0.000011238383],"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.000005544655,0.000045171495,0.0000033113145,0.0000337616,0.000010220092,5.7048453e-7,0.00022837799,0.96522975,0.0009111373,0.026355172,0.000019656514,0.007157341],"study_design_scores_gemma":[0.00022627295,0.00006420879,0.000007647496,0.000023370234,0.000007775653,0.0000071054524,0.000008358098,0.9439422,0.053620555,0.0012675811,0.00059312605,0.00023181213],"about_ca_topic_score_codex":0.0000014139827,"about_ca_topic_score_gemma":5.7658787e-7,"teacher_disagreement_score":0.2900232,"about_ca_system_score_codex":0.00011175569,"about_ca_system_score_gemma":0.00005803399,"threshold_uncertainty_score":0.7608427},"labels":[],"label_agreement":null},{"id":"W2116591673","doi":"10.1109/fdl.2008.4641435","title":"The performance of combining multiway decision graphs and HOL theorem prover","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Automated theorem proving; Computer science; Consistency (knowledge bases); Rule of inference; Inference; Theoretical computer science; Automation; Programming language; Algorithm; Artificial intelligence","score_opus":0.02288197179140945,"score_gpt":0.2676747469142631,"score_spread":0.24479277512285363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116591673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77432734,0.0000567127,0.223446,0.000028339973,0.00014251297,0.000109395696,1.11005896e-7,0.00004032349,0.0018492518],"genre_scores_gemma":[0.651824,0.00012156325,0.34793428,0.000026485855,0.0000024171509,0.0000045891684,6.0305e-8,0.0000020552682,0.00008457847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932796,0.000049815924,0.00017217395,0.00014321915,0.00019227777,0.00011457053],"domain_scores_gemma":[0.9991562,0.0002669087,0.00007927734,0.00040554945,0.00006496988,0.000027103175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006621597,0.000059643324,0.00006994712,0.00003716931,0.00025236132,0.000027214337,0.00044824628,0.000026865642,0.0000017193313],"category_scores_gemma":[0.00010832825,0.00003470999,0.000020150459,0.00019878344,0.0001741827,0.00039982205,0.00014800238,0.000068047724,0.0000046390437],"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.000027044289,0.00002840028,0.009663179,0.000008686259,0.0000054936263,6.0586586e-7,0.001399144,0.00004414174,0.0019739072,0.60183096,0.00012477818,0.3848937],"study_design_scores_gemma":[0.00046483905,0.00025189877,0.11121064,0.000029506911,0.0000021724709,0.000051438947,0.000059303147,0.8071866,0.07027379,0.00935703,0.0009661219,0.00014663897],"about_ca_topic_score_codex":0.000004408233,"about_ca_topic_score_gemma":6.103452e-7,"teacher_disagreement_score":0.8071425,"about_ca_system_score_codex":0.000006032819,"about_ca_system_score_gemma":0.000016537324,"threshold_uncertainty_score":0.19409847},"labels":[],"label_agreement":null},{"id":"W2116868051","doi":"10.1109/ccece.2005.1557217","title":"An executable specification of the PCI-X bus standard in AsmL","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Conventional PCI; PCI configuration space; Executable; Computer science; Programming language; Abstract state machines; Unified Modeling Language; Extension (predicate logic); Finite-state machine; Operating system; Embedded system; System bus; Software; Control bus","score_opus":0.012516699298861372,"score_gpt":0.263946459119511,"score_spread":0.25142975982064963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116868051","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.071808495,0.000018181428,0.90378463,0.0001402763,0.00017821125,0.00012361137,9.777709e-7,0.00004053636,0.023905078],"genre_scores_gemma":[0.5542255,0.0000015137894,0.44553268,0.000022271439,0.000017940558,0.0000028059476,5.427114e-7,0.0000021634057,0.00019460637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991706,0.00008511312,0.00023001833,0.00015937879,0.00023550206,0.00011936768],"domain_scores_gemma":[0.99910593,0.000028900738,0.00009229683,0.0006860902,0.00007154715,0.000015237899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086244964,0.000049359878,0.000069013564,0.00006703366,0.000033294116,0.000036498786,0.00068258686,0.000035374942,0.000013453914],"category_scores_gemma":[0.000031215208,0.0000353069,0.00001911873,0.0005512336,0.000038790193,0.0004384648,0.0000505379,0.00006034467,0.000005901499],"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.000008745313,0.000060564296,0.0059699602,0.0000050778217,6.6745207e-7,2.5989024e-7,0.00015862091,0.0008219107,0.019783458,0.9466566,0.00027870157,0.026255446],"study_design_scores_gemma":[0.0003036019,0.00008642838,0.28576902,0.00001533882,0.0000017847532,0.00000521767,0.000083481515,0.093974866,0.5752154,0.035927687,0.008464841,0.00015232018],"about_ca_topic_score_codex":0.00021562682,"about_ca_topic_score_gemma":0.000071046896,"teacher_disagreement_score":0.91072893,"about_ca_system_score_codex":0.000057175057,"about_ca_system_score_gemma":0.000036051842,"threshold_uncertainty_score":0.14397736},"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":"W2117158482","doi":"","title":"Automated debugging of missing input constraints in a formal verification environment","year":2012,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"","keywords":"Debugging; Computer science; Intuition; Formal verification; Documentation; Process (computing); Function (biology); Algorithmic program debugging; Set (abstract data type); Missing data; False positive paradox; Formal methods; Programming language; Data mining; Artificial intelligence; Machine learning","score_opus":0.03258323140663232,"score_gpt":0.2917010949930042,"score_spread":0.25911786358637184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117158482","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.084259264,0.000041789823,0.91191274,0.000065426146,0.0001131826,0.0001172635,3.8741666e-7,0.00019133325,0.0032986046],"genre_scores_gemma":[0.54321474,0.0000020210389,0.45674065,0.00002399986,0.000005703554,0.0000052393925,8.9805144e-7,0.00000213756,0.0000046530936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906933,0.00009629612,0.00029159646,0.00012748838,0.00015959125,0.00025569252],"domain_scores_gemma":[0.9994544,0.000042650103,0.00012060177,0.00031443758,0.0000125636025,0.000055353765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010113084,0.00007092453,0.0000983753,0.000114227514,0.000035669756,0.00001909102,0.0002705407,0.00004733031,0.000030085397],"category_scores_gemma":[0.000059561822,0.00006865337,0.000020425841,0.00018292751,0.000069045585,0.0012005348,0.00008482593,0.00006117725,0.00002705148],"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.000008031055,0.00021345002,0.006849858,0.000042755848,0.00000944784,9.858181e-7,0.0034018732,0.00033742806,0.073210314,0.17847817,0.00003776586,0.73740995],"study_design_scores_gemma":[0.00025471157,0.000028498107,0.13049467,0.00002688349,0.0000028938962,0.000020104597,0.00006477477,0.75702447,0.11124891,0.00036443566,0.0003331587,0.00013650351],"about_ca_topic_score_codex":0.000010416625,"about_ca_topic_score_gemma":2.184603e-7,"teacher_disagreement_score":0.75668705,"about_ca_system_score_codex":0.000075303804,"about_ca_system_score_gemma":0.000025652731,"threshold_uncertainty_score":0.27996033},"labels":[],"label_agreement":null},{"id":"W2117344189","doi":"10.1109/iccie.2009.5223955","title":"Table-based specification techniques","year":2009,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Table (database); Completeness (order theory); Programming language; Consistency (knowledge bases); Formal specification; System requirements specification; Software engineering; Database; Artificial intelligence; Mathematics","score_opus":0.033555736880831716,"score_gpt":0.3038566249366055,"score_spread":0.2703008880557738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117344189","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.00016305759,0.000010610418,0.9292833,0.0013191696,0.000068855625,0.00010850824,1.5007551e-7,0.0006401706,0.06840614],"genre_scores_gemma":[0.10881012,0.0000028780807,0.8899192,0.00092484953,0.000032371325,0.000007944813,0.0000013389437,0.0000019528372,0.00029933607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99938804,0.00003853149,0.00013132344,0.00018746394,0.00014008205,0.00011453802],"domain_scores_gemma":[0.9992767,0.000016981245,0.000050114093,0.00055970665,0.00006385829,0.000032663673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035801792,0.000057924255,0.000052940384,0.0000742329,0.0000487403,0.00008115172,0.0005268257,0.000037478047,0.000023650477],"category_scores_gemma":[0.00003696882,0.00005145563,0.000018248726,0.0003800509,0.0000129295295,0.0004398559,0.0000150968335,0.000052015446,0.000059213493],"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.0000015398065,0.000029182924,0.00002023008,9.800377e-7,3.2090264e-7,2.848344e-7,0.000014850782,0.000007726221,0.010795111,0.68588966,0.0008833055,0.30235684],"study_design_scores_gemma":[0.00007551195,0.00011982761,0.0068280026,0.0000063236153,0.0000010229594,0.0000028779325,0.0000030370677,0.090984225,0.8366088,0.018070467,0.047155973,0.00014390578],"about_ca_topic_score_codex":0.0000029056791,"about_ca_topic_score_gemma":2.3340056e-7,"teacher_disagreement_score":0.8258137,"about_ca_system_score_codex":0.000024740755,"about_ca_system_score_gemma":0.000027495718,"threshold_uncertainty_score":0.20982997},"labels":[],"label_agreement":null},{"id":"W2117444225","doi":"10.1109/ispass.2008.4510741","title":"Performance Analysis of ARQ Protocols using a Theorem Prover","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Automatic repeat request; HOL; Selective Repeat ARQ; Sliding window protocol; Automated theorem proving; Hybrid automatic repeat request; Protocol (science); Transmission (telecommunications); Go-Back-N ARQ; Theoretical computer science; Algorithm; Programming language; Window (computing); Telecommunications","score_opus":0.09979860810567057,"score_gpt":0.35313365256058166,"score_spread":0.25333504445491106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117444225","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.30822974,0.000001277025,0.6849155,0.0000065036597,0.000020598865,0.0017168672,3.182432e-7,0.0000458319,0.0050633866],"genre_scores_gemma":[0.41536713,8.7106173e-7,0.58418876,0.000025717512,0.0000062777,0.0003029755,2.3764268e-7,0.0000021127055,0.000105938816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918085,0.0000593686,0.00022651412,0.00018124274,0.0002270408,0.0001249549],"domain_scores_gemma":[0.9991414,0.000021384598,0.00013476388,0.0005735787,0.00010120542,0.00002767215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042719743,0.00006603139,0.00015641403,0.00020749643,0.00006968154,0.00001492804,0.0005034703,0.00003061512,0.000026321968],"category_scores_gemma":[0.000041157826,0.000051674004,0.00006995468,0.001490862,0.00006859587,0.0005466974,0.00009261234,0.000046616795,0.000005604495],"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.00008866939,0.0005368657,0.23623441,0.00020075968,0.0007391549,0.000005196725,0.0067473054,0.028154217,0.04438152,0.5576022,0.00012230342,0.12518737],"study_design_scores_gemma":[0.00006798836,0.000044857985,0.03505421,0.0000072901466,0.000020153166,0.000005470201,0.0000046373625,0.9238982,0.04058459,0.00010273783,0.00014095189,0.00006886845],"about_ca_topic_score_codex":0.000013220215,"about_ca_topic_score_gemma":5.9939975e-7,"teacher_disagreement_score":0.895744,"about_ca_system_score_codex":0.000026837024,"about_ca_system_score_gemma":0.000055598914,"threshold_uncertainty_score":0.21072046},"labels":[],"label_agreement":null},{"id":"W2117798332","doi":"","title":"Model Checking Communicative Agent- Based Systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Soundness; Computer science; Model checking; Completeness (order theory); Set (abstract data type); Protocol (science); Formal methods; Theoretical computer science; Negotiation; Communications protocol; Communicating sequential processes; Temporal logic; Programming language; Software; Formal verification; Multi-agent system; Distributed computing; Artificial intelligence; Semantics (computer science); Mathematics; Operational semantics","score_opus":0.1095339850209968,"score_gpt":0.3147490523154181,"score_spread":0.2052150672944213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117798332","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.001904453,0.000043285814,0.9633114,0.0002970615,0.0001382212,0.00024826828,2.9820293e-7,0.00022461289,0.033832453],"genre_scores_gemma":[0.45534542,0.0000017301592,0.54402024,0.00021534375,0.000005255436,0.000059311376,6.3296267e-7,0.0000033304975,0.0003487327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991646,0.00014891315,0.00018043512,0.00017458324,0.00016857256,0.00016293998],"domain_scores_gemma":[0.99854964,0.00006844167,0.00008527178,0.0011192106,0.00012025848,0.000057177283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044365504,0.0000786031,0.00009227703,0.00005360593,0.00009769226,0.0001957415,0.0012780137,0.00004070489,0.000021143695],"category_scores_gemma":[0.000046458925,0.00006615166,0.000029155248,0.00019137013,0.00003331239,0.0007299138,0.0002109682,0.00009640509,0.00028102426],"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.0000010904046,0.000063240106,0.00014324412,0.00002650344,0.000010173549,3.043249e-7,0.00085631356,0.028904086,0.0062535126,0.94537723,0.0015168372,0.016847493],"study_design_scores_gemma":[0.00007579664,0.000011005472,0.00034617842,0.000011077933,9.959725e-7,9.051353e-7,0.000046068595,0.99376535,0.0035991857,0.0017350813,0.0003188769,0.0000894539],"about_ca_topic_score_codex":0.00015628876,"about_ca_topic_score_gemma":9.463405e-7,"teacher_disagreement_score":0.9648613,"about_ca_system_score_codex":0.000052301984,"about_ca_system_score_gemma":0.000033810942,"threshold_uncertainty_score":0.36120918},"labels":[],"label_agreement":null},{"id":"W2117883771","doi":"10.1145/513918.513952","title":"High-Level specification and automatic generation of IP interface monitors","year":2002,"lang":"en","type":"article","venue":"Proceedings - ACM IEEE Design Automation Conference","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":42,"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 British Columbia","funders":"","keywords":"Computer science; Interface (matter); Operating system; Embedded system","score_opus":0.2551343654171854,"score_gpt":0.31254168734624593,"score_spread":0.057407321929060506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117883771","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.16023134,0.000056000794,0.8378501,0.00040673834,0.00041221935,0.0004550549,0.0000026854848,0.00037346262,0.00021239654],"genre_scores_gemma":[0.53023005,0.000047906626,0.46954274,0.000017316066,0.000049609862,0.000052206127,0.0000013662045,0.000009017602,0.000049788003],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980093,0.00008890254,0.0006755471,0.00051447813,0.00046945826,0.00024226036],"domain_scores_gemma":[0.99798685,0.00012577875,0.00066764624,0.000465968,0.0006581675,0.00009557188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009007187,0.00023502542,0.00026960878,0.00029651588,0.00015633875,0.00036725553,0.001003697,0.00014205037,0.000051747986],"category_scores_gemma":[0.0007837034,0.00024079357,0.00003334703,0.0006031462,0.000108766726,0.002156334,0.000117883355,0.0001528962,0.00006042375],"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.0000082495635,0.00014638553,0.00021055268,0.00025050275,0.00003286911,4.6521367e-7,0.0070938175,0.00031267013,0.51772964,0.15622522,0.0021346456,0.315855],"study_design_scores_gemma":[0.00017703546,0.000092342714,0.0035238082,0.000057489826,0.000010235345,0.000011403287,0.000051042756,0.6770139,0.31542504,0.0034401973,0.00002481818,0.00017271274],"about_ca_topic_score_codex":0.000009279372,"about_ca_topic_score_gemma":2.9711865e-7,"teacher_disagreement_score":0.6767012,"about_ca_system_score_codex":0.00009628934,"about_ca_system_score_gemma":0.000037874994,"threshold_uncertainty_score":0.9819277},"labels":[],"label_agreement":null},{"id":"W2117930267","doi":"10.1145/1086228.1086284","title":"Cutpoints for formal equivalence verification of embedded software","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":31,"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 British Columbia","funders":"","keywords":"Computer science; Formal equivalence checking; Equivalence (formal languages); Formal verification; Software; Program optimization; Theoretical computer science; Formal methods; Programming language; Computer engineering; Computer architecture; Mathematics; Discrete mathematics","score_opus":0.0377981304802072,"score_gpt":0.3222204679625033,"score_spread":0.2844223374822961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117930267","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.006944068,0.000027523049,0.99062437,0.00017433979,0.00018854933,0.00028199624,0.0000036226988,0.00015903264,0.0015965118],"genre_scores_gemma":[0.19271113,0.000005751998,0.80677605,0.0001082768,0.000043122513,0.000043716627,0.0000031552388,0.0000050816275,0.00030370764],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99900573,0.000031984546,0.0003094016,0.00023391098,0.00019476547,0.00022418777],"domain_scores_gemma":[0.99890524,0.00008882592,0.0001582549,0.0006148256,0.0001863031,0.000046553378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064180326,0.00008424537,0.00011076962,0.00007421214,0.000070038834,0.000030057918,0.00075027917,0.0000544535,0.000025115836],"category_scores_gemma":[0.00028683277,0.00007879052,0.000060250553,0.00021238402,0.000040088387,0.0015262493,0.00010152644,0.000045929537,0.000037238413],"study_design_candidate":"design_other","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.000021470254,0.000068957255,0.000087394954,0.000056313762,0.0000065757076,5.9013114e-8,0.0006058607,0.00027229128,0.00686287,0.3707961,0.0005805041,0.6206416],"study_design_scores_gemma":[0.00057620776,0.00021430508,0.0041356143,0.000025153773,0.000008091509,0.000008458676,0.000052383195,0.41161758,0.567624,0.007169251,0.008313414,0.00025553769],"about_ca_topic_score_codex":0.0000025004729,"about_ca_topic_score_gemma":0.0000011141078,"teacher_disagreement_score":0.62038606,"about_ca_system_score_codex":0.00003800069,"about_ca_system_score_gemma":0.000045065968,"threshold_uncertainty_score":0.32129842},"labels":[],"label_agreement":null},{"id":"W2118262051","doi":"10.1109/ccece.2002.1015291","title":"On the model checking of the RCMP-800 input FIFO","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"FIFO (computing and electronics); Computer science; Header; Model checking; Asynchronous communication; Asynchronous Transfer Mode; Routing (electronic design automation); Process (computing); Embedded system; Real-time computing; Computer hardware; Computer network; Programming language","score_opus":0.05305236225538907,"score_gpt":0.278846156678468,"score_spread":0.22579379442307895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118262051","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.02438939,0.000007703074,0.8865427,0.00059870014,0.00017674154,0.000102920116,2.0750203e-7,0.00002994257,0.088151716],"genre_scores_gemma":[0.6758575,0.0000013583368,0.3227246,0.00071548816,0.000004518321,0.000005778736,2.2988303e-8,0.0000026255161,0.0006881117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992904,0.00014151208,0.00012740023,0.00012732054,0.00020718813,0.000106182095],"domain_scores_gemma":[0.9989589,0.000111919835,0.00007184207,0.00080422556,0.000038945665,0.00001415908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007874545,0.000055793218,0.00005268588,0.000019080928,0.000094445924,0.000030241394,0.0008798482,0.000028288943,0.00001838011],"category_scores_gemma":[0.00033211382,0.000026755672,0.000041072177,0.0002578141,0.000043703458,0.00012955103,0.00009554578,0.00009941667,0.00001542306],"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":[5.055764e-7,0.000011001814,0.000028152475,0.0000016150645,0.0000015975006,2.4649994e-8,0.00031237007,0.0043307175,0.0006851055,0.99212986,0.00026806595,0.0022309683],"study_design_scores_gemma":[0.000045570723,0.000013432923,0.00039122763,0.000009168572,0.0000013129642,0.0000014779869,0.000019205607,0.8155795,0.10904859,0.0742517,0.00058827066,0.000050560953],"about_ca_topic_score_codex":0.0000047511944,"about_ca_topic_score_gemma":9.600388e-7,"teacher_disagreement_score":0.9178782,"about_ca_system_score_codex":0.000018184752,"about_ca_system_score_gemma":0.00003974232,"threshold_uncertainty_score":0.16349915},"labels":[],"label_agreement":null},{"id":"W2118462183","doi":"10.1109/hldvt.2012.6418248","title":"Embedded system verification through constraint-based scheduling","year":2012,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"MPSoC; Computer science; Correctness; Scheduling (production processes); Multiprocessing; Functional verification; Embedded system; Constraint programming; System on a chip; Constraint (computer-aided design); Formal verification; Parallel computing; Distributed computing; Programming language; Engineering","score_opus":0.05134845037038891,"score_gpt":0.3106666714775103,"score_spread":0.2593182211071214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118462183","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.006673211,0.000068287045,0.96548903,0.00012319178,0.00088788604,0.00017641178,7.428444e-7,0.0005984714,0.025982775],"genre_scores_gemma":[0.4857844,4.8255106e-7,0.51400065,0.00011776748,0.00005163718,0.00001703714,0.000001783858,0.000004203711,0.000022000459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988176,0.00014944433,0.0002624464,0.00022853438,0.00023439378,0.0003075402],"domain_scores_gemma":[0.9989014,0.000072530645,0.00012484494,0.00072568073,0.000089795656,0.00008571947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093060156,0.00011073207,0.00011415505,0.00005270527,0.00012035181,0.000092748895,0.00052382675,0.00007678267,0.000021471715],"category_scores_gemma":[0.000102405334,0.000101082485,0.00004630023,0.0003278531,0.000056285997,0.0012861711,0.00004786045,0.000096341115,0.0003068838],"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.0000022649865,0.00003318108,0.00020963431,0.000033619155,0.000004406914,2.406691e-7,0.00040665967,0.00021267585,0.0037764856,0.98773104,0.00003980114,0.0075500156],"study_design_scores_gemma":[0.0003719997,0.00003674199,0.0017078406,0.000050466548,0.00001002391,0.000027908623,0.00077192544,0.81330687,0.18026802,0.00040193755,0.002719468,0.0003268162],"about_ca_topic_score_codex":0.000009990489,"about_ca_topic_score_gemma":1.6819408e-7,"teacher_disagreement_score":0.98732907,"about_ca_system_score_codex":0.00010430922,"about_ca_system_score_gemma":0.00006059773,"threshold_uncertainty_score":0.41220242},"labels":[],"label_agreement":null},{"id":"W2120254441","doi":"10.1109/icnp.1993.340888","title":"Language-based analysis of communicating finite state machines","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Ottawa; Acceleware (Canada)","funders":"","keywords":"Reachability; Computer science; Finite-state machine; Process (computing); Process mining; Theoretical computer science; Protocol (science); Graph; Parallelism (grammar); Process calculus; Focus (optics); State (computer science); Programming language; Communicating sequential processes; Model checking; Algorithm; Work in process; Parallel computing; Business process modeling; Semantics (computer science)","score_opus":0.046268710998212406,"score_gpt":0.3171683474924796,"score_spread":0.2708996364942672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120254441","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.03830697,0.00010932553,0.9536828,0.00014825522,0.000026245049,0.00004055485,0.0000031970349,0.00009801536,0.00758468],"genre_scores_gemma":[0.45742133,0.0000045712236,0.54227334,0.00012681952,0.0000015645636,0.0000023386938,0.0000020879693,0.0000018398777,0.0001661353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999257,0.00015580922,0.00021981409,0.00012431793,0.00014322923,0.000099792436],"domain_scores_gemma":[0.99851805,0.00027395412,0.00013259295,0.0009966977,0.000051857318,0.00002686404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043681407,0.000058404967,0.00013862559,0.0002379819,0.000044376287,0.000031421227,0.0008346057,0.000017432347,0.00013815408],"category_scores_gemma":[0.00015001,0.000049719838,0.00007260445,0.0013555025,0.000034119963,0.0001694849,0.0001128096,0.00006237832,0.00001654428],"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.000006498244,0.00029948313,0.014076115,0.0000505161,0.00045241995,0.0000062148283,0.011312515,0.08108826,0.0048748357,0.047937084,0.0002067852,0.83968925],"study_design_scores_gemma":[0.0000662921,0.000015491667,0.004333367,0.0000032359178,0.00002661824,2.2643687e-7,0.000016419655,0.9908009,0.004507838,0.000072269075,0.00009928512,0.000058047615],"about_ca_topic_score_codex":0.0001513913,"about_ca_topic_score_gemma":0.000033098564,"teacher_disagreement_score":0.9097127,"about_ca_system_score_codex":0.000010455254,"about_ca_system_score_gemma":0.0000043087803,"threshold_uncertainty_score":0.20275162},"labels":[],"label_agreement":null},{"id":"W2120406836","doi":"","title":"APRICODD: Approximate Policy Construction Using Decision Diagrams","year":2000,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":121,"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; University of British Columbia","funders":"","keywords":"Markov decision process; Dynamic programming; Influence diagram; Computer science; Mathematical optimization; Value (mathematics); Bellman equation; Class (philosophy); Markov process; Space (punctuation); Algebraic number; Mathematics; Decision tree; Artificial intelligence; Machine learning; Statistics","score_opus":0.030395231635788274,"score_gpt":0.3178480168016136,"score_spread":0.28745278516582534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120406836","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.09710269,0.000013520834,0.88942724,0.00007948111,0.00022377743,0.00010546733,3.778136e-7,0.00022626849,0.012821185],"genre_scores_gemma":[0.06013554,0.000025377607,0.93943506,0.00015655947,0.00008862793,0.000004433559,6.7923435e-7,0.000006025342,0.00014771921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989939,0.000066202025,0.00022064854,0.0002773838,0.00022180229,0.00022007921],"domain_scores_gemma":[0.9992547,0.00004321692,0.00005577175,0.00053246645,0.00004259014,0.000071278155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034278518,0.00009678441,0.00009808277,0.00013399127,0.00013544672,0.00015161668,0.00046894423,0.00006229098,0.00012178507],"category_scores_gemma":[0.0000691469,0.00008445826,0.00003981949,0.0007321056,0.000058945443,0.0007929484,0.00007311728,0.0000754566,0.0001307285],"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.0000033224792,0.000013526411,0.00010574675,0.0000021255853,0.0000016532565,4.797137e-7,0.00006586669,0.0003954207,0.00048908964,0.22128232,0.000017714978,0.77762276],"study_design_scores_gemma":[0.00021394387,0.000032725562,0.0015448638,0.000013670785,0.0000028976444,0.00011715875,0.000015732896,0.93400186,0.009721531,0.050796103,0.003345127,0.00019437485],"about_ca_topic_score_codex":0.00007921926,"about_ca_topic_score_gemma":9.628978e-7,"teacher_disagreement_score":0.93360645,"about_ca_system_score_codex":0.0000850658,"about_ca_system_score_gemma":0.00005132369,"threshold_uncertainty_score":0.34441078},"labels":[],"label_agreement":null},{"id":"W2120484044","doi":"10.1109/fmcad.2009.5351147","title":"Software model checking via large-block encoding","year":2009,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":147,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca; European Commission","keywords":"Computer science; Predicate abstraction; Theoretical computer science; Encoding (memory); Block (permutation group theory); Reachability; Programming language; Abstraction; Program synthesis; Model checking; Algorithm; Artificial intelligence; Mathematics","score_opus":0.03604302314982662,"score_gpt":0.3023138911467048,"score_spread":0.2662708679968782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120484044","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.0022017064,0.00002515078,0.98724455,0.000258868,0.00014365843,0.00007361656,2.7106367e-7,0.00047142428,0.009580748],"genre_scores_gemma":[0.33379006,0.0000024079716,0.6652491,0.000636921,0.000024325886,0.0000022487388,3.8477032e-7,0.0000029313835,0.00029161954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905604,0.000030604555,0.00017143601,0.00026919795,0.00020484401,0.00026785472],"domain_scores_gemma":[0.99930733,0.000022018703,0.000057227924,0.00049766834,0.00005560896,0.000060158705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004903389,0.000092779104,0.00009109498,0.00007000261,0.00013162356,0.0000922222,0.0006743178,0.000054920452,0.000007777353],"category_scores_gemma":[0.00009236399,0.000085956286,0.000041438365,0.00026461695,0.000008277245,0.00073040545,0.00010449714,0.00010754714,0.000049534072],"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.0000041284193,0.00010335991,0.00023298782,0.0000110233095,0.0000059403073,0.0000045587367,0.0016031277,0.012081829,0.010522911,0.648937,0.0006005156,0.32589263],"study_design_scores_gemma":[0.000092602204,0.000023670378,0.0005389023,0.0000072180665,0.0000013844228,0.00000886863,0.0000057184825,0.9622668,0.016022123,0.02051542,0.0003928905,0.00012441461],"about_ca_topic_score_codex":0.0000020246691,"about_ca_topic_score_gemma":6.15148e-7,"teacher_disagreement_score":0.95018494,"about_ca_system_score_codex":0.000042609045,"about_ca_system_score_gemma":0.000022400633,"threshold_uncertainty_score":0.35051957},"labels":[],"label_agreement":null},{"id":"W2121059177","doi":"10.1109/glsv.1994.289974","title":"An efficient algorithm for the realizability analysis of signal transition graphs","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Realizability; Concurrency; Computer science; Transition system; SIGNAL (programming language); Algorithm; State space; Exponential function; Polynomial; Theoretical computer science; State (computer science); Mathematics; Programming language","score_opus":0.03737201445620189,"score_gpt":0.30285074408500434,"score_spread":0.2654787296288025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121059177","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.006297265,0.00002708121,0.9929866,0.00013378767,0.000062659135,0.00022142049,0.000011974399,0.00005560128,0.00020360558],"genre_scores_gemma":[0.42459765,0.0000033908386,0.5753131,0.000050529237,0.000005900317,0.00001974257,0.0000030200044,0.0000015632987,0.0000051118927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991094,0.00013160425,0.00022182861,0.00022352977,0.0002004694,0.00011315467],"domain_scores_gemma":[0.99897796,0.00017325468,0.00007224634,0.00061546924,0.00012766621,0.000033402615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010646314,0.000060395567,0.00012023314,0.00013670154,0.00009655146,0.000031434232,0.00048371684,0.00003268872,0.000063022344],"category_scores_gemma":[0.000015594935,0.0000402054,0.00015103669,0.0012234238,0.000065942026,0.00015295792,0.000012489069,0.00003418563,0.0000010059875],"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.0000050321128,0.0003461536,0.00004430651,0.000009153227,0.00016525933,1.1696791e-7,0.0024800547,0.080391675,0.000969293,0.11951694,0.00004583605,0.7960262],"study_design_scores_gemma":[0.000076916,0.00009579973,0.0033838183,8.20492e-7,0.000113297065,3.9556596e-7,0.000047425605,0.9911226,0.0041298834,0.0009417388,0.00003518588,0.000052088944],"about_ca_topic_score_codex":0.00007014796,"about_ca_topic_score_gemma":0.000005773486,"teacher_disagreement_score":0.91073096,"about_ca_system_score_codex":0.000016331482,"about_ca_system_score_gemma":0.0000049136825,"threshold_uncertainty_score":0.16395286},"labels":[],"label_agreement":null},{"id":"W2121072219","doi":"10.5555/1870926.1871338","title":"Leveraging dominators for preprocessing QBF","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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":"","keywords":"Preprocessor; Conjunctive normal form; Computer science; Very-large-scale integration; Algorithm; True quantified Boolean formula; Computational complexity theory; Time complexity; Theoretical computer science; Artificial intelligence","score_opus":0.025755956314191027,"score_gpt":0.3165616450073915,"score_spread":0.29080568869320045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121072219","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.038921982,0.0000052235473,0.9521115,0.00018477798,0.0007526647,0.00011557945,9.984386e-8,0.00017295279,0.007735216],"genre_scores_gemma":[0.35804304,1.6797833e-7,0.641501,0.000097161785,0.00003661911,0.00001864446,1.7180912e-7,0.000003133792,0.0003000716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999424,0.000012342727,0.00011056412,0.00022336052,0.00008855393,0.00014119188],"domain_scores_gemma":[0.9993908,0.000067337925,0.000048287107,0.0003883553,0.00006770695,0.0000375519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063704146,0.00005402084,0.000054177202,0.000045540834,0.000113128444,0.00013133648,0.0005137129,0.000037312137,0.000010962192],"category_scores_gemma":[0.00022367101,0.000047261045,0.000026475105,0.00013083026,0.000021631728,0.00058602117,0.00007698125,0.0000857214,0.000012756983],"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.000003290641,0.00002007493,0.0003434408,0.000029251074,0.0000030992042,2.6297255e-7,0.0009940999,0.000019999401,0.03402217,0.53213775,0.00027956755,0.43214697],"study_design_scores_gemma":[0.00027199075,0.000025773074,0.0017430299,0.000008394351,0.0000029147818,0.000014158846,0.000050951818,0.5721881,0.3596313,0.045972522,0.019883335,0.0002075396],"about_ca_topic_score_codex":0.0000036088022,"about_ca_topic_score_gemma":9.96449e-7,"teacher_disagreement_score":0.5721681,"about_ca_system_score_codex":0.000008895946,"about_ca_system_score_gemma":0.00003153032,"threshold_uncertainty_score":0.19272494},"labels":[],"label_agreement":null},{"id":"W2121269177","doi":"10.1145/996566.996632","title":"A general decomposition strategy for verifying register renaming","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Waterloo","funders":"","keywords":"Computer science; Correctness; Processor register; Programming language; Register file; Register allocation; Parallel computing; Pentium; Register (sociolinguistics); Set (abstract data type); Instruction set; Compiler; Operating system","score_opus":0.07529847677923784,"score_gpt":0.37018474962650716,"score_spread":0.2948862728472693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121269177","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.017400716,0.000019467552,0.97723943,0.00025696462,0.00025513562,0.00017265102,4.921699e-7,0.00015227655,0.004502855],"genre_scores_gemma":[0.20392108,0.0000019642239,0.7955702,0.00021454434,0.00006321137,0.00003078686,0.0000028772533,0.0000049707787,0.00019037203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993095,0.000024101151,0.00016145407,0.00022983628,0.00010068253,0.0001744167],"domain_scores_gemma":[0.9995059,0.000019527091,0.000060156854,0.00032257685,0.0000524181,0.000039424536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002779688,0.00007216925,0.000070561815,0.00005335389,0.000112166126,0.00013452496,0.0003257952,0.000043242682,0.0000029970297],"category_scores_gemma":[0.000022341366,0.0000675305,0.000042175234,0.00013063512,0.00001568314,0.00065447175,0.00004731056,0.00004806642,0.000012728077],"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.000007666809,0.000023731267,0.000009030463,0.000015718582,0.000004366891,0.0000012174659,0.00018152205,0.005641493,0.013111032,0.93829066,0.0000718156,0.042641774],"study_design_scores_gemma":[0.0015401827,0.00044362014,0.0023639,0.00006125231,0.000010192518,0.00008195607,0.000051464478,0.67049277,0.20029016,0.11958154,0.0045813094,0.0005016694],"about_ca_topic_score_codex":0.000025044885,"about_ca_topic_score_gemma":0.0000051440297,"teacher_disagreement_score":0.8187091,"about_ca_system_score_codex":0.00008351813,"about_ca_system_score_gemma":0.000037036043,"threshold_uncertainty_score":0.2753814},"labels":[],"label_agreement":null},{"id":"W2121877285","doi":"10.1109/iccad.1989.76940","title":"State assignment for multilevel logic using dynamic literal estimation","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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 British Columbia","funders":"","keywords":"Literal (mathematical logic); Heuristics; State (computer science); Estimator; Computer science; Selection (genetic algorithm); Representation (politics); Artificial intelligence; Combinational logic; Finite-state machine; Theoretical computer science; Algorithm; Mathematics; Logic gate; Statistics","score_opus":0.07423349604570027,"score_gpt":0.36911753977249073,"score_spread":0.29488404372679045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121877285","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.007165119,0.000012276252,0.9916196,0.000037840127,0.00032447118,0.00030406663,0.0000019525594,0.00009540302,0.0004392963],"genre_scores_gemma":[0.18864773,8.270475e-7,0.81092966,0.000111617206,0.0000029851903,0.000022519864,0.0000018319249,0.0000045511324,0.00027831423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991908,0.00008162947,0.0001916437,0.0002226526,0.0001286333,0.00018462006],"domain_scores_gemma":[0.99947345,0.000060694354,0.00008296813,0.00028339762,0.000060469465,0.00003904653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005484967,0.00008305108,0.00007554991,0.000059649963,0.00008811261,0.000107321226,0.00022067672,0.000029577539,0.000008357228],"category_scores_gemma":[0.00014287309,0.000072910596,0.000031257943,0.00011389091,0.000015595226,0.00056270254,0.000030063982,0.000038499675,0.000011270946],"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.000006626801,0.00008226506,0.000050451916,0.00003611133,0.000009718428,8.6137555e-7,0.00064460863,0.055804487,0.008462426,0.6626931,0.000031620697,0.27217773],"study_design_scores_gemma":[0.00017775453,0.00004079927,0.00037287103,0.0000065206655,0.0000019683537,0.0000057819743,0.000005103292,0.9453634,0.0070086345,0.046697784,0.0002234875,0.00009591906],"about_ca_topic_score_codex":0.0000047069598,"about_ca_topic_score_gemma":5.4650053e-7,"teacher_disagreement_score":0.8895589,"about_ca_system_score_codex":0.00013177189,"about_ca_system_score_gemma":0.00003560068,"threshold_uncertainty_score":0.29732078},"labels":[],"label_agreement":null},{"id":"W2122159838","doi":"10.1109/ismvl.2003.1201420","title":"CTL model-checking over logics with non-classical negations","year":2004,"lang":"en","type":"article","venue":"","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":"St. Francis Xavier University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CTL*; Negation; Model checking; Computer science; Computation tree logic; Programming language; Theoretical computer science; Negation as failure; Mathematics; Algebra over a field; Description logic; Pure mathematics; Stable model semantics; Medicine","score_opus":0.03248530986428076,"score_gpt":0.2891900487914606,"score_spread":0.2567047389271798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122159838","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.01205469,0.0000028434695,0.9650254,0.0007275746,0.00008367483,0.00010025924,3.3294478e-7,0.00017258505,0.02183264],"genre_scores_gemma":[0.3664739,0.0000011485724,0.6329255,0.0003172008,0.000018132123,0.000008943791,5.413849e-7,0.0000041495978,0.00025045197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991706,0.000016580943,0.00013683036,0.00025217814,0.00023852955,0.00018528331],"domain_scores_gemma":[0.99932116,0.000022817983,0.00005299639,0.00047448147,0.00006261908,0.000065940214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017963731,0.000090945134,0.00008220943,0.00005427254,0.000113512746,0.00011188221,0.00044921375,0.000054031592,0.000007882777],"category_scores_gemma":[0.000031991454,0.000067237524,0.000026851008,0.000341365,0.000053656615,0.000711383,0.000104615734,0.0001236168,0.000039588125],"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.0000024173432,0.000041186122,0.000076048476,0.000002766843,0.0000037111722,0.0000018962601,0.0003017677,0.09581298,0.0005793192,0.8991846,0.00006770649,0.003925621],"study_design_scores_gemma":[0.0002691024,0.000059512076,0.001754198,0.000010556108,0.0000032099017,0.000009677209,0.000010171602,0.9561064,0.006231116,0.035193697,0.00022221344,0.00013014059],"about_ca_topic_score_codex":0.000016318358,"about_ca_topic_score_gemma":0.000011364575,"teacher_disagreement_score":0.8639909,"about_ca_system_score_codex":0.00008210131,"about_ca_system_score_gemma":0.0001064329,"threshold_uncertainty_score":0.27418667},"labels":[],"label_agreement":null},{"id":"W2122172746","doi":"10.1007/978-3-540-75221-9_3","title":"A Denotational Semantics for Handel-C","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Denotational semantics of the Actor model; Denotational semantics; Normalisation by evaluation; Assertion; Action semantics; Programming language; Computer science; Operational semantics; Semantics (computer science); Construct (python library); Domain theory; Mathematics; Discrete mathematics","score_opus":0.028121117244248824,"score_gpt":0.32303307329081465,"score_spread":0.29491195604656584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122172746","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.009933721,0.000041311716,0.9876968,0.00056936726,0.0013691664,0.00026888214,7.545834e-7,0.00009762028,0.00002236632],"genre_scores_gemma":[0.42820242,7.951932e-7,0.5711387,0.00053719664,0.00011029228,0.000005971084,5.8007674e-7,0.0000034904917,5.758109e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981096,0.000029449127,0.0002959713,0.00056884426,0.0004893715,0.0005068104],"domain_scores_gemma":[0.99836975,0.0006435649,0.00010061928,0.0005444187,0.00024866994,0.00009295448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029787691,0.0001312466,0.00012882393,0.00037289833,0.0002330439,0.0002505429,0.0015586099,0.000067609544,0.0000013716971],"category_scores_gemma":[0.00049446855,0.000121546684,0.000043299082,0.0016971815,0.00024315526,0.00073984766,0.00026435696,0.0001453751,0.000007235836],"study_design_candidate":"design_other","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.00001071932,0.00005056813,0.0010924157,0.000017339647,0.0000023900648,0.000005583306,0.0012383044,0.027941495,0.0037776008,0.05426506,0.000006948256,0.9115916],"study_design_scores_gemma":[0.00022234567,0.00008530432,0.007012318,0.000017856977,0.0000011196778,0.000026540594,4.2070766e-7,0.88279164,0.05421753,0.0553203,0.00014515243,0.00015949162],"about_ca_topic_score_codex":0.000006235035,"about_ca_topic_score_gemma":0.000024451983,"teacher_disagreement_score":0.9114321,"about_ca_system_score_codex":0.00012662055,"about_ca_system_score_gemma":0.00018505997,"threshold_uncertainty_score":0.495653},"labels":[],"label_agreement":null},{"id":"W2122279036","doi":"10.1049/ip-sen:20000681","title":"The logic of software design","year":2000,"lang":"en","type":"article","venue":"IEE Proceedings - Software","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Software engineering; Programming language; Software; Mathematical proof; Mathematics","score_opus":0.03527924645339317,"score_gpt":0.2732307429936452,"score_spread":0.23795149654025202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122279036","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.006555084,0.00038670024,0.9906334,0.0002654853,0.0002601109,0.00035466423,0.0000021560556,0.00061414397,0.0009282489],"genre_scores_gemma":[0.029058788,0.00010435001,0.9696876,0.00021265645,0.00006657789,0.00006835899,6.160037e-7,0.000018547471,0.0007825513],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838376,0.000036796555,0.0003734427,0.00038994403,0.0004324506,0.00038359262],"domain_scores_gemma":[0.9986994,0.00027431877,0.00020579185,0.00040057622,0.00033587666,0.00008403658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010427842,0.00018136042,0.00018390999,0.00006452482,0.00035095133,0.00019760497,0.0017812478,0.000109765904,0.00004617008],"category_scores_gemma":[0.0010068116,0.00013149956,0.0000813815,0.0006443513,0.00016770838,0.00078844524,0.00012795185,0.0001990362,0.000112245114],"study_design_candidate":"design_other","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.00005837211,0.00007604224,0.0019269874,0.00009574748,0.000027851798,0.0000022456716,0.0017668892,0.0002141007,0.0005830031,0.057156596,0.005765693,0.9323265],"study_design_scores_gemma":[0.0020917458,0.0021616113,0.038822316,0.00058350374,0.00011179079,0.00038471335,0.00050664315,0.055028062,0.16262902,0.6021168,0.13287994,0.002683819],"about_ca_topic_score_codex":0.0000059046306,"about_ca_topic_score_gemma":2.5098444e-7,"teacher_disagreement_score":0.9296427,"about_ca_system_score_codex":0.000051661726,"about_ca_system_score_gemma":0.00006792173,"threshold_uncertainty_score":0.5362396},"labels":[],"label_agreement":null},{"id":"W2122378552","doi":"10.5772/5318","title":"Model Checking of Time Petri Nets","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Petri net; Computer science; Stochastic Petri net; Programming language; Petri dish; Biology","score_opus":0.07366863599740656,"score_gpt":0.2727233702364684,"score_spread":0.19905473423906186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122378552","genre_codex":"other","genre_gemma":"methods","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.0000025532856,0.00008323427,0.48371458,0.000019401275,0.00007910792,0.00006605139,0.0000014128997,0.000075115284,0.51595855],"genre_scores_gemma":[0.00010754325,0.0001267371,0.5857974,0.00007000595,0.000023625336,0.0000014228236,0.000002527705,0.000013981761,0.41385671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987981,0.000011717165,0.00034612976,0.00033604843,0.00036310148,0.00014495014],"domain_scores_gemma":[0.9986452,0.00003676637,0.00027738308,0.00086543075,0.0001257894,0.000049449725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024393605,0.00018437461,0.00027277815,0.0001781901,0.00004041626,0.00002006306,0.0009791795,0.00021517451,0.000098324344],"category_scores_gemma":[0.000026906673,0.00017670119,0.00011250354,0.00004655767,0.00006597478,0.00025708057,0.00026633404,0.00019589225,0.0002676286],"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.0000022663442,0.000008520593,4.8560975e-7,0.000019391806,0.000015953936,0.0000034028187,0.00017519192,0.0010754949,0.00022731144,0.9603663,0.004420655,0.03368502],"study_design_scores_gemma":[0.00007103108,0.00003495579,0.0000055102532,0.000054375367,0.0000060343455,0.000022998465,2.5047754e-7,0.9499519,0.0014991106,0.018286746,0.029815596,0.00025151024],"about_ca_topic_score_codex":0.000004013714,"about_ca_topic_score_gemma":2.931897e-7,"teacher_disagreement_score":0.9488764,"about_ca_system_score_codex":0.00004713474,"about_ca_system_score_gemma":0.00010186642,"threshold_uncertainty_score":0.7205666},"labels":[],"label_agreement":null},{"id":"W2122503480","doi":"10.1109/iceccs.2008.40","title":"Verifying Statecharts with State Invariants","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Executable; Computer science; Locality; Programming language; Invariant (physics); Consistency (knowledge bases); Model checking; Abstract state machines; State (computer science); Theoretical computer science; Finite-state machine; Artificial intelligence; Mathematics","score_opus":0.041395021306127086,"score_gpt":0.24347670359615148,"score_spread":0.20208168229002438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122503480","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.05405247,0.0000073350157,0.933671,0.000048637517,0.00011627849,0.000084427644,3.417134e-7,0.00023066933,0.011788829],"genre_scores_gemma":[0.2596294,0.000011340167,0.739639,0.00020257695,0.0000073764863,0.000004134251,3.8041205e-7,0.0000047629246,0.00050107285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992049,0.000034940982,0.00012751714,0.00020787581,0.00022183936,0.00020295466],"domain_scores_gemma":[0.9993848,0.000025967413,0.000052107618,0.0004126292,0.000060636896,0.000063814085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034164774,0.000073978335,0.00007064195,0.00007386643,0.00011728039,0.000037912654,0.00039567228,0.000020377403,0.000015528194],"category_scores_gemma":[0.000021126816,0.000056385652,0.000010700928,0.0003282965,0.00004557736,0.00076764927,0.000085964806,0.00007931882,0.00009157571],"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.00015547957,0.00025782897,0.009870753,0.000058944424,0.00007070354,0.00064108014,0.014178341,0.001025487,0.011660453,0.64854336,0.0029551103,0.31058243],"study_design_scores_gemma":[0.0023161387,0.001161483,0.10017724,0.00007556538,0.000008048399,0.0014238246,0.00018241875,0.28784657,0.5494345,0.011475813,0.044290062,0.0016083157],"about_ca_topic_score_codex":0.00002877571,"about_ca_topic_score_gemma":0.0000038795674,"teacher_disagreement_score":0.63706756,"about_ca_system_score_codex":0.000024153085,"about_ca_system_score_gemma":0.000046733927,"threshold_uncertainty_score":0.229934},"labels":[],"label_agreement":null},{"id":"W2123310608","doi":"10.1109/apsec.2001.991479","title":"A rigorous method for testing real-time reactive systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Formalism (music); Reactive material; Complement (music); System testing; Real-time computing; Reliability engineering; Programming language; Engineering","score_opus":0.05294902079699112,"score_gpt":0.3462069002898979,"score_spread":0.2932578794929068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123310608","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.00043141755,0.000015276039,0.9468556,0.0001589277,0.00019413982,0.00041809923,0.0000016345612,0.0004407972,0.051484093],"genre_scores_gemma":[0.0026697665,0.000001042638,0.9949751,0.00007572576,0.000178243,0.00011632318,0.0000010407556,0.000010742314,0.0019720418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998825,0.00016319842,0.00025524574,0.00034334007,0.00016527736,0.0002479341],"domain_scores_gemma":[0.9982827,0.0008256378,0.00014667674,0.00047786086,0.00020322397,0.000063954874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017006791,0.00010584869,0.00015603656,0.00007281846,0.00011132474,0.00012410905,0.0005415178,0.000060777566,0.000003870497],"category_scores_gemma":[0.0006069643,0.00009185656,0.000039249142,0.00031043318,0.00001400459,0.0006784513,0.000085135354,0.0000651599,0.00010509456],"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.00001274395,0.00006324466,0.00002388059,0.000034149452,0.00002178013,0.0000011904656,0.0006706441,0.0026799082,0.07498074,0.53259164,0.0013968877,0.3875232],"study_design_scores_gemma":[0.00014425543,0.000081793965,0.00015604256,0.000012854616,0.000005215543,0.000038881994,0.000023872997,0.9758464,0.016751997,0.0012425923,0.005563369,0.00013273646],"about_ca_topic_score_codex":0.00024940495,"about_ca_topic_score_gemma":0.000001856462,"teacher_disagreement_score":0.97316647,"about_ca_system_score_codex":0.000111784044,"about_ca_system_score_gemma":0.000048524766,"threshold_uncertainty_score":0.37458017},"labels":[],"label_agreement":null},{"id":"W2123413615","doi":"10.1109/iccd.2001.955050","title":"Arithmetic transforms for verifying compositions of sequential datapaths","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Datapath; Arithmetic; Equivalence (formal languages); Computer science; Canonical form; Formal equivalence checking; Representation (politics); Electronic circuit; Theoretical computer science; Formal verification; Algorithm; Parallel computing; Mathematics; Discrete mathematics","score_opus":0.10727750167418343,"score_gpt":0.3152833931803503,"score_spread":0.20800589150616688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123413615","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.0020771117,0.000032316304,0.9919722,0.00019651247,0.00023238937,0.00022280808,0.00001540613,0.00008309435,0.0051681795],"genre_scores_gemma":[0.27755988,0.000008460804,0.72224075,0.00005573306,0.000016597964,0.00002229766,0.000005282025,0.0000036026238,0.00008737784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931884,0.000026639014,0.0002158758,0.0001683475,0.00012930277,0.00014102041],"domain_scores_gemma":[0.999431,0.000052639523,0.00005196466,0.00036885048,0.00005895935,0.000036558497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023707339,0.000063754705,0.00009995701,0.000070869566,0.00008362255,0.00003855086,0.00048137316,0.000035239267,0.00004793762],"category_scores_gemma":[0.000023097142,0.00005682875,0.000058433365,0.00019850119,0.000043063344,0.00054831774,0.00003519184,0.000047984635,0.000013744896],"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.000005618276,0.00014632888,0.000013849654,0.00007539209,0.000018154145,6.2570047e-7,0.0008840796,0.00016937003,0.03296821,0.8586916,0.0004613221,0.106565475],"study_design_scores_gemma":[0.0003940678,0.00014714884,0.00015363612,0.000015113541,0.000011442295,0.000014493789,0.000024504412,0.8619196,0.1294257,0.004164431,0.0035980032,0.0001318681],"about_ca_topic_score_codex":0.000009154562,"about_ca_topic_score_gemma":0.0000014531811,"teacher_disagreement_score":0.8617502,"about_ca_system_score_codex":0.000017960607,"about_ca_system_score_gemma":0.000008226026,"threshold_uncertainty_score":0.2317409},"labels":[],"label_agreement":null},{"id":"W2123601456","doi":"10.1109/icm.1998.825579","title":"Verificatiom of synchronous realizability of interfaces from timing diagram specifications","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Realizability; Computer science; Consistency (knowledge bases); Property (philosophy); Static timing analysis; Diagram; Synchronous circuit; Algorithm; Real-time computing; Clock signal; Embedded system; Jitter","score_opus":0.1348468794209357,"score_gpt":0.29735870903384903,"score_spread":0.16251182961291333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123601456","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.09439243,0.00018066338,0.89319503,0.00016182425,0.00017908748,0.00016325967,0.000013330912,0.00009167097,0.011622676],"genre_scores_gemma":[0.5690367,0.000038983908,0.43084693,0.00000726289,0.000010324611,0.000008687914,0.0000024660073,0.0000031801778,0.000045425502],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99870044,0.00012839337,0.00052144245,0.00031398333,0.00020862535,0.00012710063],"domain_scores_gemma":[0.9979886,0.00019770011,0.0002887576,0.0013257469,0.00015389545,0.000045335073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035218455,0.000094756615,0.00019259626,0.00008369517,0.000042410145,0.000024825342,0.000971767,0.00005706828,0.00031219618],"category_scores_gemma":[0.00023532826,0.00008873901,0.00005284561,0.00042216072,0.00016209316,0.0003582078,0.00011476455,0.00006999703,0.0000442905],"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.000010567072,0.0009201576,0.005570962,0.00009237754,0.00006256609,5.16887e-7,0.00801182,0.00033280213,0.07379138,0.3855445,0.0010220151,0.5246403],"study_design_scores_gemma":[0.00020234166,0.0001293645,0.06544089,0.00004050176,0.000015953958,0.0000019430909,0.00018971766,0.4042325,0.5221697,0.0061899484,0.0011540627,0.00023309163],"about_ca_topic_score_codex":0.00035170914,"about_ca_topic_score_gemma":0.000007593735,"teacher_disagreement_score":0.52440727,"about_ca_system_score_codex":0.000043002135,"about_ca_system_score_gemma":0.00001531126,"threshold_uncertainty_score":0.3618672},"labels":[],"label_agreement":null},{"id":"W2123615615","doi":"10.1016/j.ipl.2005.04.004","title":"The convex hull of a regular set of integer vectors is polyhedral and effectively computable","year":2005,"lang":"en","type":"article","venue":"Information Processing Letters","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":"Université de Montréal","funders":"","keywords":"Convex hull; Polyhedron; Convex polytope; Mathematics; Combinatorics; Integer (computer science); Regular polygon; Set (abstract data type); Numerical digit; Convex set; Discrete mathematics; Representation (politics); Computer science; Arithmetic; Convex optimization","score_opus":0.010070287330799664,"score_gpt":0.25320449769055053,"score_spread":0.24313421035975086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123615615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2122181,0.000081797734,0.784079,0.0030691663,0.0001004578,0.00014813195,0.0000023853197,0.000045272074,0.00025567392],"genre_scores_gemma":[0.8549465,0.000004113858,0.14374173,0.0012685241,0.000019281288,0.0000074189165,0.0000017785745,0.0000032405112,0.0000074055347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999066,0.000058888123,0.0004034633,0.000086990854,0.00024571916,0.0001389677],"domain_scores_gemma":[0.99907994,0.000086046355,0.00043814935,0.00021503765,0.00015281049,0.00002798626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006918714,0.00008780761,0.00012726932,0.00010982254,0.0001321256,0.00013233551,0.00035819877,0.000038887323,0.0000012912361],"category_scores_gemma":[0.000085957254,0.00006648202,0.000027999275,0.00029664833,0.00017909531,0.0026798262,0.000084848754,0.00009458043,0.00000467625],"study_design_candidate":"design_other","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.000057414858,0.000020244988,0.001070426,0.00054153125,0.000038312053,1.806517e-7,0.03271263,0.0022628189,0.012736208,0.015593076,0.0025469293,0.93242025],"study_design_scores_gemma":[0.00059399713,0.00009467228,0.009038046,0.00017747027,0.000012152893,0.000023470428,0.0003126396,0.79316765,0.17824242,0.0005027179,0.017612875,0.00022191237],"about_ca_topic_score_codex":0.000011802115,"about_ca_topic_score_gemma":2.393142e-7,"teacher_disagreement_score":0.9321983,"about_ca_system_score_codex":0.000035279812,"about_ca_system_score_gemma":0.000036787314,"threshold_uncertainty_score":0.2711058},"labels":[],"label_agreement":null},{"id":"W2123804472","doi":"10.1109/glsv.1991.143973","title":"Test plan generation and concurrent scheduling of tests in the presence of conflicts","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 Guelph","funders":"","keywords":"Computer science; Test (biology); Scheduling (production processes); Plan (archaeology); Test plan; Operations research; Mathematical optimization; Engineering; Mathematics; Political science; Law","score_opus":0.13083520653855088,"score_gpt":0.31727206320575113,"score_spread":0.18643685666720025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123804472","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.562709,0.00028321275,0.43437317,0.0002527994,0.00011319951,0.00020477227,0.0000012832819,0.000015298014,0.0020472829],"genre_scores_gemma":[0.8154036,0.000024647507,0.18451202,0.000032410127,0.00000991771,0.000004162892,2.8732902e-7,8.683497e-7,0.000012100938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994574,0.00006863154,0.0001743594,0.00010318097,0.00013451933,0.00006188916],"domain_scores_gemma":[0.99939924,0.00024891895,0.0000821684,0.00021324697,0.000043858527,0.000012567473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043695632,0.000038331404,0.00006224689,0.000039199123,0.000017550243,0.000019718938,0.00027982544,0.000020506139,0.0000044543376],"category_scores_gemma":[0.00037652074,0.000026659489,0.000007213996,0.00017372805,0.00005232548,0.00020227143,0.000042836793,0.000046154655,0.0000011255075],"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.0000019880597,0.0003506329,0.041608486,0.00010638502,0.0000059270583,0.0000017420974,0.016299661,0.0015263897,0.15421687,0.6268744,0.00021715551,0.15879038],"study_design_scores_gemma":[0.00011536305,0.00006886844,0.020549297,0.000016213737,9.836814e-7,0.000004799755,0.000039554103,0.93060446,0.048343427,0.00010889276,0.00011088553,0.000037237656],"about_ca_topic_score_codex":0.000018933328,"about_ca_topic_score_gemma":0.000007388528,"teacher_disagreement_score":0.9290781,"about_ca_system_score_codex":0.0000040473124,"about_ca_system_score_gemma":0.0000052993614,"threshold_uncertainty_score":0.10871424},"labels":[],"label_agreement":null},{"id":"W2124132041","doi":"10.1109/ecbs.1996.494542","title":"Behavioral views for software requirements engineering","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Software requirements specification; Formal specification; Notation; Scope (computer science); Functional specification; System requirements specification; Software requirements; Software engineering; Functional requirement; Formal methods; Programming language; Software; Software design; Software system; Software construction; Software development","score_opus":0.20134997137817112,"score_gpt":0.3582825423886446,"score_spread":0.15693257101047348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124132041","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.0015581835,0.000045549772,0.99701715,0.0000538853,0.00040898158,0.00018238522,7.570182e-7,0.0002510189,0.00048209724],"genre_scores_gemma":[0.011423734,0.0000032179423,0.9875868,0.00008647042,0.00002975358,0.000061850806,8.139418e-7,0.0000060048046,0.00080134947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994187,0.000010045967,0.00013982906,0.00016592906,0.000106368694,0.00015913461],"domain_scores_gemma":[0.9995349,0.000019736486,0.00003235379,0.00033907982,0.00003467823,0.000039270693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019256058,0.00006403363,0.000064637185,0.0000424566,0.0000431833,0.000052337757,0.00040843233,0.000028795876,0.00004747576],"category_scores_gemma":[0.000057515837,0.000059943908,0.000036599748,0.00012289471,0.0000056787085,0.00048190882,0.00006179399,0.000033763237,0.00005900586],"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.0000018572003,0.00016227829,0.0003935345,0.0000483727,0.000008179739,0.0000016089427,0.0007509705,0.0002406369,0.0039802524,0.12623268,0.0072850124,0.8608946],"study_design_scores_gemma":[0.00033028275,0.00017585991,0.0006865515,0.000015696394,0.000006225839,0.000006582105,0.0000063293073,0.8733456,0.018206885,0.0005755751,0.10636734,0.0002770474],"about_ca_topic_score_codex":0.0000019662284,"about_ca_topic_score_gemma":4.191532e-7,"teacher_disagreement_score":0.873105,"about_ca_system_score_codex":0.000030187703,"about_ca_system_score_gemma":0.000002581539,"threshold_uncertainty_score":0.24444416},"labels":[],"label_agreement":null},{"id":"W2124650155","doi":"10.1109/newcas.2010.5603785","title":"SAT based model checking for MDG models","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University","funders":"","keywords":"Correctness; Computer science; Boolean satisfiability problem; Model checking; Satisfiability; Solver; Theoretical computer science; Dependency graph; Property (philosophy); Representation (politics); Computability; Graph; Algorithm; Programming language","score_opus":0.07648957632071667,"score_gpt":0.323051643323677,"score_spread":0.2465620670029603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124650155","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.0038706234,0.0000023975333,0.98773897,0.00028877895,0.00033737466,0.0001812703,0.0000012421567,0.00020657208,0.00737277],"genre_scores_gemma":[0.32081762,1.8010846e-7,0.67856663,0.00036010574,0.000023503659,0.000033627734,0.0000010757805,0.000005134267,0.0001921225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930984,0.000012916329,0.00013237592,0.00023475377,0.00013226352,0.00017785681],"domain_scores_gemma":[0.99918365,0.00005579985,0.000044667857,0.0005770165,0.00008662537,0.000052216885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057112763,0.00007311695,0.00007200387,0.000053571843,0.00008205742,0.0000844096,0.00064829143,0.00006393521,0.0000063110197],"category_scores_gemma":[0.00007223452,0.000064588356,0.00004737242,0.00011169387,0.00001992205,0.00069277186,0.00006646134,0.00010031679,0.000011344115],"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.0000027677047,0.0000177608,0.000007037425,0.0000071391755,0.0000011979467,5.857012e-8,0.00010099213,0.053183235,0.012040023,0.91792285,0.0001604453,0.016556507],"study_design_scores_gemma":[0.00012625073,0.000014863147,0.000016117663,0.000001747036,0.000001282845,6.8252456e-7,0.00000189511,0.8850202,0.03110187,0.083367184,0.00026299906,0.000084894426],"about_ca_topic_score_codex":0.000003924635,"about_ca_topic_score_gemma":0.000006788954,"teacher_disagreement_score":0.8345556,"about_ca_system_score_codex":0.000012906368,"about_ca_system_score_gemma":0.000059661612,"threshold_uncertainty_score":0.2633837},"labels":[],"label_agreement":null},{"id":"W2125299458","doi":"10.5555/1366982.1366988","title":"Interface Automata with Complex Actions: Limiting Interleaving in Interface Automata","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Waterloo","funders":"","keywords":"Interleaving; Computer science; Automaton; Rotation formalisms in three dimensions; Concurrency; Theoretical computer science; Interface (matter); Associative property; Petri net; Component (thermodynamics); Distributed computing; Mathematics; Parallel computing","score_opus":0.10016448150673117,"score_gpt":0.33705320096661073,"score_spread":0.23688871945987955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125299458","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.20470436,0.000023284712,0.77707523,0.00045134666,0.00034664283,0.00049338833,0.0000064996375,0.00070381525,0.016195454],"genre_scores_gemma":[0.58181214,0.000017622697,0.41770625,0.00025901909,0.000017493932,0.000050400005,0.0000091469665,0.000011673968,0.00011625931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974695,0.000134685,0.00095323,0.00036265873,0.0005071061,0.0005728534],"domain_scores_gemma":[0.9979842,0.00018478071,0.00041088153,0.0011920105,0.0000880258,0.0001401013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073287974,0.00031314732,0.0003516127,0.00040979098,0.00029806935,0.0003473468,0.0016902037,0.00008866807,0.00007420899],"category_scores_gemma":[0.00019433156,0.00028313012,0.000058034515,0.0008414074,0.00020719871,0.0045269993,0.0008494164,0.0004572873,0.00027972666],"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.00077254244,0.0026539434,0.030632736,0.002126702,0.00059520325,0.00019945319,0.21947551,0.016677838,0.009888789,0.13319708,0.021702545,0.56207764],"study_design_scores_gemma":[0.001515085,0.0005122173,0.019627688,0.0005947803,0.000009877974,0.0007576413,0.0029337283,0.94837296,0.007062877,0.00017577522,0.01780554,0.00063182344],"about_ca_topic_score_codex":0.000051853476,"about_ca_topic_score_gemma":0.000018891473,"teacher_disagreement_score":0.9316951,"about_ca_system_score_codex":0.0004367272,"about_ca_system_score_gemma":0.000109982844,"threshold_uncertainty_score":0.9999621},"labels":[],"label_agreement":null},{"id":"W2125395260","doi":"10.1109/qsic.2007.4385519","title":"A Denotational Semantic Model for Validating JVML/CLDC Optimizations under Isabelle/HOL","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Concordia University","funders":"","keywords":"HOL; Computer science; Programming language; Concurrency; Denotational semantics; Semantics (computer science); Operational semantics; Extension (predicate logic); Theoretical computer science","score_opus":0.08547348748158205,"score_gpt":0.3600340148784934,"score_spread":0.27456052739691134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125395260","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.0014855376,0.0000099160125,0.99372834,0.00042178048,0.00018224481,0.00031777692,0.0000024150831,0.00019545735,0.0036565529],"genre_scores_gemma":[0.1389795,0.0000013537853,0.8588743,0.00053037546,0.000037931466,0.000031394375,0.000009786315,0.000011092305,0.0015242483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882394,0.000030280558,0.00032371967,0.0002986804,0.00024311584,0.0002802719],"domain_scores_gemma":[0.9989316,0.00030169313,0.00010573822,0.00036884026,0.00021949282,0.0000726771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010428446,0.00010584056,0.000095394076,0.0001264651,0.0002675152,0.00011681596,0.00047666344,0.000050730836,0.00001765182],"category_scores_gemma":[0.0002116099,0.000103983584,0.000055195982,0.00036846258,0.00003080337,0.0006602961,0.00009818583,0.00006929514,0.000024219256],"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.0000025878385,0.000034525827,0.000024695271,0.000008979059,0.000006961113,1.8810759e-7,0.000398069,0.3327911,0.0007044793,0.662655,0.00021844315,0.0031549702],"study_design_scores_gemma":[0.000219926,0.000018321594,0.00014386415,0.000006392912,0.0000064383016,0.00000700868,0.00006866086,0.9647863,0.0050438843,0.029502202,0.00006146401,0.00013554671],"about_ca_topic_score_codex":0.0000047200633,"about_ca_topic_score_gemma":0.000008889546,"teacher_disagreement_score":0.6331528,"about_ca_system_score_codex":0.000061300445,"about_ca_system_score_gemma":0.00008260564,"threshold_uncertainty_score":0.42403278},"labels":[],"label_agreement":null},{"id":"W2125490728","doi":"10.1007/978-1-4615-0292-0_18","title":"A Method for Concurrent Decomposition and Factorization of Boolean Expressions","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Simplicity; Literal (mathematical logic); Factorization; Cube (algebra); Algebraic expression; Decomposition; Benchmark (surveying); Duality (order theory); Computer science; Mathematics; Algorithm; Algebraic number; Algebra over a field; Theoretical computer science; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.04805647182341729,"score_gpt":0.3630438527436214,"score_spread":0.3149873809202041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125490728","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":[9.550994e-7,0.0001437827,0.9457249,0.000048637947,0.00041949964,0.00046190224,0.000023570552,0.00005156978,0.053125154],"genre_scores_gemma":[0.00021263078,0.000072286566,0.9818148,0.00007539286,0.000028112228,0.000026239457,0.000032186384,0.000016283864,0.017722063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989863,0.000053074495,0.0003457131,0.00034159116,0.00016805167,0.00010525584],"domain_scores_gemma":[0.9989048,0.00018213569,0.00033358374,0.00034580138,0.00017362699,0.00006003964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003605898,0.00017055182,0.00024507265,0.00013231533,0.00006618661,0.000037187972,0.00024813885,0.00018362797,0.000024783161],"category_scores_gemma":[0.000041157742,0.00015563663,0.00007436128,0.000028482715,0.000034218345,0.00022949536,0.000079251404,0.000097456075,0.0000017806925],"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.000002383434,0.000008166145,7.5867325e-7,0.000053554566,0.000011664685,6.862663e-8,0.00008587849,0.0000055276423,0.001641026,0.9248405,0.0003719198,0.072978534],"study_design_scores_gemma":[0.00097064686,0.0006024185,0.0000637585,0.0005685938,0.00012822266,0.00002673315,0.000017489609,0.08430229,0.081681766,0.43583292,0.3948281,0.0009770781],"about_ca_topic_score_codex":0.0000018764014,"about_ca_topic_score_gemma":6.4536493e-7,"teacher_disagreement_score":0.48900762,"about_ca_system_score_codex":0.0000360547,"about_ca_system_score_gemma":0.000032032087,"threshold_uncertainty_score":0.6346678},"labels":[],"label_agreement":null},{"id":"W2126365971","doi":"10.1109/syscon.2011.5929129","title":"Control of swarms of autonomous robots using Model Driven Development - A state-based approach","year":2011,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Robot; Computer science; Emulation; IBM; MATLAB; Control engineering; Controller (irrigation); Finite-state machine; Ant robotics; Mobile robot; Artificial intelligence; Simulation; Robot control; Engineering; Programming language","score_opus":0.11277072670566177,"score_gpt":0.2779821088961522,"score_spread":0.16521138219049045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126365971","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.043063648,0.000006332939,0.9550729,0.0000034841487,0.00004209588,0.00020007794,0.0000010985406,0.000051229246,0.0015591513],"genre_scores_gemma":[0.47789556,1.0501421e-7,0.5220614,0.000018123641,9.556187e-7,0.0000063520215,3.593485e-7,0.0000033070455,0.000013817818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897563,0.000063934305,0.00038962884,0.00020788668,0.00020213657,0.00016077138],"domain_scores_gemma":[0.999152,0.000020172969,0.00023479156,0.00040742147,0.00013817477,0.000047462167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047667502,0.000094328236,0.00019168928,0.00010891698,0.00002982615,0.000008948841,0.000557308,0.0000399328,0.0000044380317],"category_scores_gemma":[0.000019767374,0.000081472215,0.00003820277,0.00017933143,0.00005635679,0.0002396494,0.00007344901,0.000049067887,0.0000016103031],"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.000031186835,0.00029197574,0.00060422596,0.00006366405,0.000028532999,4.1227582e-7,0.0035282613,0.92452604,0.012162845,0.04678352,0.0000025138465,0.011976841],"study_design_scores_gemma":[0.00030243734,0.000031144937,0.0006276009,0.000007782311,0.0000038695,7.6223716e-7,0.000009844701,0.8428687,0.1555728,0.00049215695,0.00000216564,0.000080741076],"about_ca_topic_score_codex":0.000063914,"about_ca_topic_score_gemma":9.906355e-7,"teacher_disagreement_score":0.43483192,"about_ca_system_score_codex":0.00005523352,"about_ca_system_score_gemma":0.00032978607,"threshold_uncertainty_score":0.33223403},"labels":[],"label_agreement":null},{"id":"W2126602474","doi":"10.1007/bf03192393","title":"On synthesizing test cases in symbolic real-time testing","year":2006,"lang":"en","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Test (biology); Symbolic execution; Formal specification; Test case; Programming language; Algorithm; Software","score_opus":0.018707792455028918,"score_gpt":0.25662419585911744,"score_spread":0.23791640340408854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126602474","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70196676,0.00008504799,0.29196566,0.0018415679,0.0016269733,0.000274084,0.0000027884641,0.00013253176,0.0021045802],"genre_scores_gemma":[0.3150121,0.0000058865485,0.6840558,0.0003773133,0.0004556092,0.0000013514114,1.1061326e-7,0.000012888549,0.00007892107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823296,0.00022774232,0.0006092638,0.00021566421,0.00042869768,0.00028565136],"domain_scores_gemma":[0.99687505,0.0017686324,0.00060480007,0.0005375499,0.00015722039,0.00005674332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001418872,0.00016503982,0.00026264085,0.00007951623,0.0001896513,0.00018659732,0.0015154876,0.00008144884,0.0000024606838],"category_scores_gemma":[0.00043793948,0.00011865193,0.0002777735,0.0007422589,0.00007228081,0.0005002157,0.00025757702,0.0003975801,0.000013166412],"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.00008137045,0.0033967204,0.11016464,0.00037458548,0.00025809006,0.00062169833,0.0087326,0.12391207,0.08527526,0.07088083,0.104001164,0.49230096],"study_design_scores_gemma":[0.0006437974,0.00040102153,0.27133578,0.00075383805,0.000019294417,0.0011761303,0.000027577245,0.7087223,0.0068484982,0.009185894,0.000507063,0.00037881732],"about_ca_topic_score_codex":0.000042268937,"about_ca_topic_score_gemma":0.000002198662,"teacher_disagreement_score":0.5848102,"about_ca_system_score_codex":0.00021747724,"about_ca_system_score_gemma":0.000117842654,"threshold_uncertainty_score":0.48384854},"labels":[],"label_agreement":null},{"id":"W2126736762","doi":"10.1109/cdc.2013.6759861","title":"Design of reach controllers on simplices","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"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":"","keywords":"Affine transformation; Triangulation; Computer science; Control theory (sociology); State space; Piecewise; State (computer science); Control (management); Space (punctuation); Mathematics; Mathematical optimization; Algorithm; Artificial intelligence; Pure mathematics; Geometry","score_opus":0.048408057177914854,"score_gpt":0.28641314893980835,"score_spread":0.2380050917618935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126736762","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.0026824912,0.000006389131,0.9769818,0.0002522827,0.000085375425,0.0002108334,6.67605e-8,0.000064848646,0.019715877],"genre_scores_gemma":[0.34399936,0.0000018063698,0.65553176,0.00020183568,0.0000061279075,0.00001839066,7.599306e-8,0.0000017243697,0.00023888316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943167,0.00009196823,0.00013171518,0.00012551254,0.00012425373,0.000094887844],"domain_scores_gemma":[0.9993038,0.00016276626,0.000066995584,0.00037628668,0.00006146407,0.000028642124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003424959,0.00004746076,0.00007952895,0.00004668255,0.000021906017,0.000032364525,0.00044924382,0.000026169506,0.00005016819],"category_scores_gemma":[0.000068623114,0.000035140463,0.0000173024,0.00012230474,0.000022190248,0.00032318672,0.00003381449,0.000034788296,0.00015836683],"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.00001489923,0.00007784803,0.0000761353,0.000008922609,0.000015411542,2.60917e-7,0.00040396818,0.0031825458,0.044456694,0.74702597,0.0041348883,0.20060247],"study_design_scores_gemma":[0.0003355522,0.00029822325,0.0035813665,0.0000070484457,0.0000018575151,0.0000014487903,0.000035844278,0.8881262,0.09407148,0.012928171,0.00049985136,0.00011297612],"about_ca_topic_score_codex":0.000044413548,"about_ca_topic_score_gemma":1.2913512e-7,"teacher_disagreement_score":0.88494366,"about_ca_system_score_codex":0.000010797368,"about_ca_system_score_gemma":0.000012554244,"threshold_uncertainty_score":0.20355381},"labels":[],"label_agreement":null},{"id":"W2126983591","doi":"10.1145/1057661.1057725","title":"Utilizing don't care states in SAT-based bounded sequential problems","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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":"","keywords":"Bounded function; Boolean satisfiability problem; Model checking; Computer science; Solver; Equivalence (formal languages); Theoretical computer science; Mathematics; Mathematical optimization; Algorithm; Discrete mathematics; Programming language","score_opus":0.03977499646281055,"score_gpt":0.3085277922968641,"score_spread":0.26875279583405354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126983591","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.0775931,0.00014119096,0.91492194,0.00047454788,0.0002337911,0.0002714486,0.0000014872828,0.00028107635,0.0060814247],"genre_scores_gemma":[0.47708872,0.0000025827853,0.5226025,0.00020972695,0.000021414198,0.00001668759,0.0000054494258,0.000004526963,0.000048365408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884653,0.0001078982,0.0002527183,0.00030181778,0.0002204658,0.0002705793],"domain_scores_gemma":[0.99935466,0.000036782254,0.000061501414,0.0004277894,0.00006818163,0.000051092324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041394177,0.0001046234,0.000102341364,0.00013262959,0.0000689495,0.00016059687,0.000536242,0.00005435572,0.00003836772],"category_scores_gemma":[0.000030542422,0.00009735755,0.00003411283,0.000359242,0.000036519366,0.00063537504,0.00008970048,0.00011756021,0.000054681714],"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.000040553277,0.00029528298,0.010485482,0.00029081627,0.000018892983,0.000014656269,0.019645449,0.045443155,0.014182109,0.32371804,0.0005231862,0.58534235],"study_design_scores_gemma":[0.0006044421,0.0000690542,0.001963449,0.00003752225,0.0000023081973,0.0000032726039,0.00044844553,0.91573423,0.06433135,0.0020482081,0.01450151,0.00025620565],"about_ca_topic_score_codex":0.00018149316,"about_ca_topic_score_gemma":0.0006564779,"teacher_disagreement_score":0.87029105,"about_ca_system_score_codex":0.00018599346,"about_ca_system_score_gemma":0.000108427615,"threshold_uncertainty_score":0.39701256},"labels":[],"label_agreement":null},{"id":"W2127990882","doi":"10.1109/acsd.2006.18","title":"On-the-fly TCTL model checking for Time Petri Nets using state class graphs","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Petri net; Decidability; Model checking; Computer science; Abstraction; State (computer science); Bounded function; Finite-state machine; Property (philosophy); Class (philosophy); Deadlock; Automaton; Theoretical computer science; Algorithm; Distributed computing; Mathematics; Artificial intelligence","score_opus":0.05047877643729652,"score_gpt":0.2959950325073843,"score_spread":0.24551625607008776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127990882","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.050559163,0.000011280519,0.9413945,0.0003301026,0.00015117478,0.00027785904,0.0000030137758,0.00015529928,0.0071175965],"genre_scores_gemma":[0.12726358,9.938602e-7,0.8705924,0.0005241632,0.000023228737,0.000018957238,0.0000018342066,0.000013653583,0.0015612034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883264,0.00006061806,0.00024430803,0.00030877546,0.00024409658,0.00030952928],"domain_scores_gemma":[0.9990038,0.00020223753,0.00011996285,0.0005404936,0.00009670434,0.000036783884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007905887,0.00012768527,0.00011363316,0.000114348804,0.00021837608,0.0001756959,0.0006747521,0.00004455306,0.0000074925874],"category_scores_gemma":[0.00007134553,0.00009716723,0.0000764136,0.00037387206,0.000042103682,0.0004348986,0.000095358664,0.00009636929,0.000031306026],"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.000008889791,0.000035592027,0.000010929238,0.0000062176764,0.0000055479927,5.145335e-7,0.00009304392,0.11768622,0.0061960113,0.8694917,0.0020507367,0.004414592],"study_design_scores_gemma":[0.00011386774,0.000034176537,0.000043258286,0.000007871593,0.0000025223694,0.0000026138584,0.0000020731732,0.8345649,0.013980762,0.15076005,0.00037158813,0.00011627662],"about_ca_topic_score_codex":0.0000355226,"about_ca_topic_score_gemma":0.0000028340999,"teacher_disagreement_score":0.71873164,"about_ca_system_score_codex":0.00006298564,"about_ca_system_score_gemma":0.00005130538,"threshold_uncertainty_score":0.39623648},"labels":[],"label_agreement":null},{"id":"W2127994412","doi":"10.1109/iccd.1994.331894","title":"Automatic verification of refinement","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 British Columbia","funders":"","keywords":"Computer science; Synchronizer; Trajectory; Programming language; Model checking; Symbolic trajectory evaluation; Theoretical computer science; Refinement calculus; Algorithm","score_opus":0.051173762994626844,"score_gpt":0.26965155312928896,"score_spread":0.21847779013466212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127994412","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.012553732,0.000035349658,0.95100504,0.00033661103,0.00013480113,0.00007679072,1.5582526e-7,0.00013558693,0.03572191],"genre_scores_gemma":[0.32903174,0.000006952093,0.67056644,0.000046697132,0.0000049162295,0.0000069794573,2.1043643e-7,0.0000013805982,0.0003346901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994608,0.000035932906,0.00017951358,0.00010922221,0.0001450586,0.000069429334],"domain_scores_gemma":[0.9993526,0.00001796589,0.00007854094,0.00049150444,0.00003989957,0.000019514378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022961886,0.00003768862,0.00005279675,0.000048967795,0.00002110914,0.000014255534,0.0003590058,0.000018466002,0.0003296167],"category_scores_gemma":[0.000051183997,0.000032887303,0.000017969525,0.00021269139,0.00001618563,0.00021709666,0.0000386863,0.000023503128,0.00013625984],"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":[1.9920718e-7,0.000054383698,0.000061956176,0.000016096883,0.0000029580299,1.1984066e-7,0.00032413463,0.000012211444,0.0033727065,0.57229537,0.0011290709,0.42273077],"study_design_scores_gemma":[0.0000760658,0.000042396754,0.0054875934,0.000005835265,0.0000014999597,0.0000018806292,0.000009347964,0.9574227,0.03303876,0.0010442171,0.0028164207,0.000053306918],"about_ca_topic_score_codex":0.0000046747955,"about_ca_topic_score_gemma":2.2949467e-7,"teacher_disagreement_score":0.95741045,"about_ca_system_score_codex":0.00001714885,"about_ca_system_score_gemma":0.0000036086278,"threshold_uncertainty_score":0.36090717},"labels":[],"label_agreement":null},{"id":"W2128232779","doi":"10.1109/iccd.1999.808259","title":"Verification of real time controllers against timing diagram specifications using constraint logic programming","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Scheme for Promotion of Academic and Research Collaboration","keywords":"Computer science; Finite-state machine; Controller (irrigation); Programming language; Constraint (computer-aided design); Verilog; Commit; Consistency (knowledge bases); Logic programming; Algorithm; Theoretical computer science; Embedded system; Mathematics","score_opus":0.11156388998758418,"score_gpt":0.31920216093134224,"score_spread":0.20763827094375806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128232779","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.014943407,0.000026423644,0.94995856,0.00007762759,0.00018086072,0.0005008677,0.000001830446,0.00020353218,0.034106873],"genre_scores_gemma":[0.34759828,0.000017129903,0.6522348,0.000028620412,0.000013713626,0.000019903611,0.0000044669946,0.000007446955,0.00007564791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826056,0.0002623316,0.00053826073,0.0003842451,0.00026461392,0.00029001603],"domain_scores_gemma":[0.9984727,0.0001340207,0.0003490323,0.0007351292,0.00021932006,0.0000898211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011349241,0.00015234125,0.0002289782,0.0001600214,0.0001619425,0.00009707705,0.00048380357,0.00009027412,0.00003387092],"category_scores_gemma":[0.00036436622,0.00014616162,0.000086581924,0.00059935136,0.00018671801,0.00044858624,0.00003915816,0.0001073215,0.000038826267],"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.0000048811467,0.00012183229,0.00014945155,0.000013949127,0.000020731544,0.0000011609419,0.0003602248,0.0013310702,0.08588896,0.82432854,0.00002255368,0.087756656],"study_design_scores_gemma":[0.00096496276,0.00014090026,0.0016110269,0.00005253119,0.00003451316,0.000032257612,0.000482118,0.91335124,0.07548447,0.0043139956,0.002954892,0.00057709584],"about_ca_topic_score_codex":0.000017531527,"about_ca_topic_score_gemma":7.867653e-7,"teacher_disagreement_score":0.91202015,"about_ca_system_score_codex":0.00012108502,"about_ca_system_score_gemma":0.00013820677,"threshold_uncertainty_score":0.59602976},"labels":[],"label_agreement":null},{"id":"W2128754884","doi":"10.1002/cpe.1065","title":"A methodology for early validation of cache coherence protocols based on relational databases","year":2006,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Formal Methods in Verification","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Correctness; Cache coherence; Protocol (science); Relational database; Table (database); Database; Cache; Relational algebra; Multiprocessing; Programming language; Theoretical computer science; Cache algorithms; CPU cache; Parallel computing","score_opus":0.22308943891776134,"score_gpt":0.45130836044949973,"score_spread":0.2282189215317384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128754884","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.04084495,0.00006176952,0.9566296,0.000223349,0.00010708411,0.0017239935,0.000009153342,0.0000346026,0.0003655383],"genre_scores_gemma":[0.4403218,0.0000024811752,0.55844724,0.00009129631,0.000018214054,0.0010929989,0.000016634494,0.000002664199,0.000006644306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986404,0.00036973393,0.00032897107,0.00034343847,0.00019923606,0.000118186035],"domain_scores_gemma":[0.99695295,0.0021735665,0.00037731003,0.00018453374,0.00027623627,0.000035409463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009109499,0.000103696846,0.0001372597,0.000083769875,0.00015679146,0.000065916596,0.00014755198,0.000044219953,0.0000029587407],"category_scores_gemma":[0.0012818954,0.00010078928,0.000019828803,0.00021827486,0.00013242019,0.0014167391,0.0000414045,0.00008201096,0.0000010871947],"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.00029454453,0.00029606948,0.0040299133,0.00015274207,0.0000098815835,0.0000015525227,0.0044329925,0.0042154845,0.0042012664,0.86068577,0.00013062004,0.1215492],"study_design_scores_gemma":[0.0020466796,0.0014370248,0.026452713,0.00019561622,0.000035175613,0.00003760963,0.00060272205,0.8757226,0.06807456,0.016684199,0.008202026,0.00050906517],"about_ca_topic_score_codex":0.00005345553,"about_ca_topic_score_gemma":5.3854797e-7,"teacher_disagreement_score":0.8715071,"about_ca_system_score_codex":0.000011662474,"about_ca_system_score_gemma":0.00007864485,"threshold_uncertainty_score":0.41100675},"labels":[],"label_agreement":null},{"id":"W2129323560","doi":"10.1109/mtv.2008.22","title":"BackSpace: Moving Towards Reality","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"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 British Columbia","funders":"Semiconductor Research Corporation","keywords":"Debugging; Computer science; TRACE (psycholinguistics); Field-programmable gate array; Embedded system; Simple (philosophy); Chip; Software; Crash; System on a chip; Computer hardware; Computer architecture; Operating system","score_opus":0.09068310219385438,"score_gpt":0.33100437479140693,"score_spread":0.24032127259755254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129323560","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.00805957,0.000014034829,0.8961381,0.00067776215,0.00023225167,0.000049707436,2.2137418e-7,0.00025274555,0.09457565],"genre_scores_gemma":[0.18574512,0.000014860358,0.81244767,0.00025291098,0.000032512813,0.000004230671,3.3480137e-7,0.0000026864893,0.001499666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992649,0.00007168404,0.00012248136,0.00020053121,0.00019234262,0.00014807],"domain_scores_gemma":[0.9992572,0.00002113833,0.00003852535,0.000574905,0.00005273843,0.000055468387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044092975,0.00005892038,0.00006955387,0.000035608096,0.0001085835,0.000029488661,0.0005339085,0.000036035563,0.000037959453],"category_scores_gemma":[0.000116917756,0.000051047635,0.000028900062,0.00025220617,0.000039872062,0.0005106802,0.00015555992,0.000068878195,0.00011507372],"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.0000031804761,0.000046431083,0.0011026337,0.000010704573,0.000006061144,0.0000123253685,0.0012467052,0.000075004114,0.0010521646,0.84418046,0.008861222,0.14340311],"study_design_scores_gemma":[0.00047153767,0.00014498332,0.31416366,0.000015111266,0.000004006024,0.0002939518,0.00007799415,0.51128,0.0852779,0.017526433,0.07005458,0.0006898842],"about_ca_topic_score_codex":0.000114118055,"about_ca_topic_score_gemma":0.000002435165,"teacher_disagreement_score":0.826654,"about_ca_system_score_codex":0.00003605871,"about_ca_system_score_gemma":0.000054308897,"threshold_uncertainty_score":0.20816621},"labels":[],"label_agreement":null},{"id":"W2129458963","doi":"10.1109/apsec.2000.896738","title":"A study on static analysis in network of synchronizing FSMs","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Synchronizing; Computer science; Correctness; Thread (computing); Finite-state machine; Semaphore; Nondeterministic algorithm; Java; Programming language; Synchronization (alternating current); Theoretical computer science; Abstract state machines; Distributed computing","score_opus":0.07721372720516495,"score_gpt":0.32115220327463684,"score_spread":0.2439384760694719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129458963","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.24504657,0.000020410174,0.75069547,0.00004140511,0.000057312896,0.00013333453,1.0101338e-7,0.000032745374,0.003972679],"genre_scores_gemma":[0.68427896,0.0000017931948,0.31561607,0.00003771109,0.000006008491,0.000006498142,8.9889376e-8,0.0000015923612,0.000051269268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990448,0.00017951532,0.0002472216,0.00019113315,0.0001969968,0.00014034874],"domain_scores_gemma":[0.9992671,0.00011059988,0.00007976747,0.0004937054,0.000026741485,0.00002208348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006615186,0.00005791735,0.00015617462,0.00015856377,0.000022609389,0.000024219658,0.0003824381,0.000016618033,0.000039870494],"category_scores_gemma":[0.00006161398,0.000049972183,0.000035382378,0.0021745758,0.000012426821,0.00016690113,0.000063661006,0.00006117826,0.000020348807],"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.000012951622,0.0023199676,0.228858,0.000030882013,0.0004897965,0.000036431407,0.02057841,0.32989278,0.00010855445,0.23412119,0.000515406,0.18303564],"study_design_scores_gemma":[0.00014260056,0.00020417396,0.096878365,0.0000069709486,0.000020955946,2.9743447e-7,0.00018782745,0.9018672,0.00013901696,0.00047743114,0.000010811486,0.00006434238],"about_ca_topic_score_codex":0.000040811956,"about_ca_topic_score_gemma":0.00003910528,"teacher_disagreement_score":0.5719744,"about_ca_system_score_codex":0.00004430583,"about_ca_system_score_gemma":0.0000051550855,"threshold_uncertainty_score":0.20378065},"labels":[],"label_agreement":null},{"id":"W2129590195","doi":"10.1109/ccece.2002.1013008","title":"Towards language emptiness model checking for MDG","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Automaton; Computer science; Emptiness; Model checking; Programming language; Automata theory; Theoretical computer science","score_opus":0.05686210956197389,"score_gpt":0.348748276419683,"score_spread":0.2918861668577091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129590195","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.006421561,0.000029291303,0.95829165,0.00008170693,0.00020408802,0.00013887492,7.129111e-7,0.00015669008,0.034675453],"genre_scores_gemma":[0.16015103,0.0000011394101,0.83846575,0.00022200466,0.000016901637,0.000032840893,6.536817e-7,0.0000055739956,0.0011040923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993668,0.000029841802,0.00012251732,0.00019699882,0.000113131435,0.00017069689],"domain_scores_gemma":[0.9994558,0.000023188808,0.000039414957,0.00038579508,0.000059359034,0.000036458867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058794586,0.00006860305,0.0000748152,0.000040743667,0.000060168833,0.000065406515,0.0004044748,0.000038155467,0.000009919675],"category_scores_gemma":[0.00021493815,0.00005934845,0.00003738299,0.00015961664,0.000011562843,0.00034769977,0.000043972053,0.0000412053,0.000011382161],"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.0000012859392,0.000015874553,0.000018815694,0.0000121387575,0.0000023268651,2.7609357e-7,0.000772023,0.0009786028,0.0016650761,0.9631587,0.00016600393,0.033208832],"study_design_scores_gemma":[0.00014535386,0.000018160685,0.00007821715,0.0000034540305,0.0000017134074,0.0000039203765,0.000056390098,0.9058667,0.08157306,0.011021436,0.0011250472,0.00010656842],"about_ca_topic_score_codex":0.000005751043,"about_ca_topic_score_gemma":0.0000011004056,"teacher_disagreement_score":0.9521373,"about_ca_system_score_codex":0.00002398883,"about_ca_system_score_gemma":0.000047967478,"threshold_uncertainty_score":0.24201596},"labels":[],"label_agreement":null},{"id":"W2129965357","doi":"10.1109/5.871306","title":"Effective synthesis of switching controllers for linear systems","year":2000,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":222,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Reachability; Computation; Linear system; Computer science; Controller (irrigation); Set (abstract data type); Control theory (sociology); Hybrid system; Scheme (mathematics); Mathematical optimization; Mathematics; Algorithm; Control (management)","score_opus":0.012684991670989035,"score_gpt":0.2563641487441835,"score_spread":0.24367915707319449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129965357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.836595,0.00011899361,0.15288134,0.00027175405,0.0009447799,0.002116658,0.0000073995907,0.0001059937,0.0069580977],"genre_scores_gemma":[0.8971245,0.000005314412,0.10255646,0.000015597498,0.000058738675,0.0001393576,1.7736538e-8,0.000007383096,0.00009262168],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992299,0.000015747448,0.00025742574,0.00016750957,0.00019458552,0.00013481418],"domain_scores_gemma":[0.99903727,0.00028965392,0.0002789532,0.00015252488,0.0002184186,0.000023194696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009881629,0.00008346459,0.0002198638,0.000047531947,0.0000732315,0.000028154389,0.00086531095,0.00004739713,9.5317665e-7],"category_scores_gemma":[0.0004727616,0.000058214635,0.00010566336,0.00021568319,0.000038226997,0.0003130141,0.00003346766,0.000064177955,0.0000019348386],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0005906259,0.00022037076,0.0010849279,0.0022508851,0.00028781916,1.1074938e-7,0.0043992805,0.0042335684,0.558714,0.15092705,0.0009501557,0.27634123],"study_design_scores_gemma":[0.00032516665,0.000097224176,0.0005420851,0.00023865685,0.000030084882,0.000004140137,0.00006797057,0.3126854,0.68400013,0.0015039742,0.00040820384,0.00009694461],"about_ca_topic_score_codex":0.000019923316,"about_ca_topic_score_gemma":8.541112e-8,"teacher_disagreement_score":0.30845183,"about_ca_system_score_codex":0.000030211024,"about_ca_system_score_gemma":0.000014477025,"threshold_uncertainty_score":0.2373924},"labels":[],"label_agreement":null},{"id":"W2130550680","doi":"10.1007/978-3-642-14295-6_43","title":"Abstract Analysis of Symbolic Executions","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"University of Toronto","funders":"","keywords":"Computer science; Symbolic execution; Matching (statistics); Programming language; Theoretical computer science; Symbolic data analysis; Model checking; Software; Mathematics","score_opus":0.0242290981888959,"score_gpt":0.29092688373530423,"score_spread":0.26669778554640833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130550680","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.00045826077,0.00012699282,0.9914242,0.00013907078,0.0014090945,0.00021587749,0.000011880186,0.000102366364,0.0061122775],"genre_scores_gemma":[0.15938948,0.000026466842,0.840146,0.00020320655,0.00012126049,0.000005938002,0.000007116817,0.000015031785,0.00008550179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967569,0.00002785896,0.00069876236,0.0011281504,0.00094314775,0.00044515723],"domain_scores_gemma":[0.99629074,0.00039751205,0.00055280165,0.002257114,0.0003637695,0.00013808731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00141526,0.00036864242,0.00066979084,0.00256698,0.00018097226,0.00021764163,0.0038913877,0.00042422063,0.000055715787],"category_scores_gemma":[0.00019722238,0.00034888776,0.00028004375,0.0023918885,0.0009607082,0.00057330134,0.0007683526,0.0009788993,0.00002347462],"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.000004372197,0.00006948686,0.00015672324,0.00005140325,0.00015945076,0.000018530374,0.0012688164,0.04016384,0.005774603,0.27634606,0.000004313936,0.6759824],"study_design_scores_gemma":[0.00015556887,0.00010078269,0.012034074,0.00018399615,0.00017917936,0.000020742847,1.8125407e-7,0.82153934,0.018623643,0.14506008,0.0012322364,0.0008702016],"about_ca_topic_score_codex":0.00004236177,"about_ca_topic_score_gemma":0.0000959304,"teacher_disagreement_score":0.78137547,"about_ca_system_score_codex":0.00014618132,"about_ca_system_score_gemma":0.00040685185,"threshold_uncertainty_score":0.9998963},"labels":[],"label_agreement":null},{"id":"W2130747899","doi":"10.1109/ismvl.2010.63","title":"Heterogeneous Decision Diagrams for Applications in Harmonic Analysis on Finite Non-Abelian Groups","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Victoria","funders":"","keywords":"Abelian group; Algebra over a field; Matrix representation; Theoretical computer science; Matrix (chemical analysis); Computer science; Representation (politics); Mathematics; Algorithm; Pure mathematics; Group (periodic table)","score_opus":0.022063331871809883,"score_gpt":0.3129632775987513,"score_spread":0.29089994572694144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130747899","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.11231019,0.000006418129,0.88650644,0.00010147645,0.00018058215,0.0004786574,0.0000039256506,0.00007919266,0.0003330973],"genre_scores_gemma":[0.51840156,0.0000044292824,0.4811422,0.000106832784,0.0000208047,0.0002680744,0.000008974186,0.000005207975,0.00004193238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876034,0.000030564686,0.0003039099,0.00047143767,0.00019125568,0.00024246634],"domain_scores_gemma":[0.99811536,0.00052679813,0.000091945614,0.0011068083,0.00007226245,0.00008682233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060612,0.00012613018,0.00017511297,0.0004445561,0.00011403541,0.00012054724,0.000925723,0.00009925109,0.0000129731625],"category_scores_gemma":[0.00014994407,0.000106957305,0.00014245078,0.0015985155,0.00002900408,0.0002261609,0.00009664548,0.00016251345,0.000053868192],"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.000035178356,0.0005415953,0.007422091,0.000017275326,0.00010419136,0.0000025397571,0.00048412685,0.012303867,0.0065310886,0.22096848,0.00013528398,0.7514543],"study_design_scores_gemma":[0.0002885047,0.00011200668,0.020472486,0.0000041012,0.000031064057,0.0000016172,0.000008132331,0.94450444,0.017773421,0.01338928,0.003198056,0.00021689104],"about_ca_topic_score_codex":0.000027542403,"about_ca_topic_score_gemma":0.00035950443,"teacher_disagreement_score":0.93220055,"about_ca_system_score_codex":0.000034591954,"about_ca_system_score_gemma":0.000020998015,"threshold_uncertainty_score":0.43615925},"labels":[],"label_agreement":null},{"id":"W2131332110","doi":"10.1007/s10270-012-0295-3","title":"Improving the SAT modulo ODE approach to hybrid systems analysis by combining different enclosure methods","year":2012,"lang":"en","type":"article","venue":"Software & Systems Modeling","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Ode; Computer science; Ordinary differential equation; Reachability; Hybrid system; Algorithm; Solver; Enclosure; Theoretical computer science; Heuristics; Mathematical optimization; Applied mathematics; Mathematics; Differential equation; Programming language","score_opus":0.04413045282746789,"score_gpt":0.30249605674917457,"score_spread":0.25836560392170665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131332110","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.043028615,0.0041481787,0.94855607,0.000020842543,0.0024982921,0.0010099454,0.000020075264,0.00061568164,0.000102279075],"genre_scores_gemma":[0.5794145,0.000004707884,0.41995496,0.00004223129,0.0001790853,0.0002884354,0.000020782132,0.000033038064,0.00006228861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99423033,0.0018501442,0.0010878271,0.00090714823,0.0009126561,0.0010118794],"domain_scores_gemma":[0.9963524,0.00041958914,0.00048521993,0.0021125714,0.00024972667,0.00038052053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0068042413,0.00048028125,0.00083530205,0.00037101784,0.0006403571,0.0008099555,0.0020380465,0.0001598655,7.1178164e-7],"category_scores_gemma":[0.00048770563,0.00034627365,0.00029592795,0.0012073003,0.000036097932,0.0010432892,0.00064994756,0.00046596723,0.000016350688],"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.00000881574,0.00013316835,0.0033291061,0.0003298806,0.00043508087,5.396665e-7,0.003985385,0.9647448,0.0018752649,0.011253052,0.000161297,0.013743625],"study_design_scores_gemma":[0.00013137836,0.000027758211,0.00006568332,0.00006893809,0.00021616685,0.000027314889,0.0007829027,0.9976579,0.00034530772,0.00005576981,0.00018041056,0.00044046558],"about_ca_topic_score_codex":0.0008825904,"about_ca_topic_score_gemma":9.250462e-7,"teacher_disagreement_score":0.53638583,"about_ca_system_score_codex":0.0003594956,"about_ca_system_score_gemma":0.000047827787,"threshold_uncertainty_score":0.9998989},"labels":[],"label_agreement":null},{"id":"W2131659851","doi":"10.1109/real.1989.63560","title":"Real-time temporal logic decision procedures","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Reachability; Temporal logic; Model checking; Class (philosophy); Computer science; Linear temporal logic; Theoretical computer science; Graph; State (computer science); Algorithm; Artificial intelligence","score_opus":0.030665134314339423,"score_gpt":0.3148106458169055,"score_spread":0.28414551150256606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131659851","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.010049824,0.000014096513,0.88885415,0.000072667906,0.0001758424,0.00011210398,1.2153768e-7,0.00025244648,0.10046878],"genre_scores_gemma":[0.07055252,0.000011214814,0.9277653,0.00013381151,0.000012130474,0.000008461085,4.444665e-7,0.000004293486,0.0015118032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911094,0.000087562155,0.00017114,0.00025876664,0.00020527713,0.0001663309],"domain_scores_gemma":[0.9992723,0.00007058316,0.00005461084,0.00048417947,0.00006028646,0.000058075024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062368147,0.00008021822,0.00008292262,0.00006293301,0.00007176409,0.000080738144,0.00048766664,0.00005044631,0.0001190407],"category_scores_gemma":[0.0005135159,0.000061204264,0.000029215184,0.0003211213,0.000023268707,0.00042993666,0.000060351707,0.000049701375,0.0005089869],"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.0000032960063,0.000035953904,0.0003621866,0.000005059889,0.0000018217817,0.0000022305173,0.00008140262,0.000029456016,0.0036480806,0.9793541,0.0030314105,0.01344499],"study_design_scores_gemma":[0.00087165186,0.00052026927,0.017096983,0.000061956176,0.000008218944,0.00020527201,0.00007131105,0.14779301,0.12353129,0.67786753,0.03098298,0.0009895271],"about_ca_topic_score_codex":0.000010268059,"about_ca_topic_score_gemma":0.0000016479049,"teacher_disagreement_score":0.30148658,"about_ca_system_score_codex":0.000027260636,"about_ca_system_score_gemma":0.000074295815,"threshold_uncertainty_score":0.6542166},"labels":[],"label_agreement":null},{"id":"W2131878172","doi":"10.1109/tse.2003.1237169","title":"Template semantics for model-based notations","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Software Engineering","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":58,"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":"University of Waterloo; University of Minnesota","keywords":"Computer science; Notation; Semantics (computer science); Programming language; Operational semantics; Structuring; Denotational semantics; Action semantics; Variety (cybernetics); Well-founded semantics; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.028663676038960133,"score_gpt":0.2666123737194766,"score_spread":0.23794869768051646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131878172","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.0007026584,0.000009890624,0.9974793,0.000029948678,0.00087057694,0.00025345696,0.00001594608,0.00061845296,0.000019767347],"genre_scores_gemma":[0.2735963,0.0000017885382,0.72612953,0.000052105624,0.0000074897243,0.00013072613,9.2302326e-7,0.000020196714,0.000060976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991351,0.000020193653,0.0002037461,0.00025237794,0.00015144233,0.0002371802],"domain_scores_gemma":[0.99914426,0.00022360875,0.000039165512,0.00042928377,0.00008937951,0.0000743194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023566464,0.00014554407,0.00011580089,0.00019482167,0.00017146103,0.00006128138,0.00025775,0.00007448246,0.000003946092],"category_scores_gemma":[0.00008476161,0.0001657915,0.000098546276,0.000355752,0.000012231513,0.0003179533,5.4054345e-7,0.0001520046,0.000012570602],"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.0000023501543,0.00003614781,0.0000016273676,0.00003275106,0.000009416787,3.8371633e-7,0.00008197996,0.9842075,0.0005375054,0.0118705565,0.000016442578,0.0032033084],"study_design_scores_gemma":[0.00023603185,0.000039678074,0.000009199332,0.00002133146,0.000011240194,0.0000037373945,0.000002540429,0.92076933,0.07776257,0.00021876217,0.0007524141,0.00017318269],"about_ca_topic_score_codex":8.313676e-7,"about_ca_topic_score_gemma":6.323684e-7,"teacher_disagreement_score":0.2728936,"about_ca_system_score_codex":0.00007065873,"about_ca_system_score_gemma":0.000067323796,"threshold_uncertainty_score":0.6760781},"labels":[],"label_agreement":null},{"id":"W2132314839","doi":"10.1145/1120725.1120784","title":"BDD-based two variable sharing extraction","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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":"","keywords":"Binary decision diagram; Computer science; Variable (mathematics); Theoretical computer science; Algorithm; Binary number; Product (mathematics); Time complexity; Mathematics; Arithmetic","score_opus":0.03785756157578817,"score_gpt":0.34098127496363256,"score_spread":0.3031237133878444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132314839","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.0015407499,0.000010019662,0.9354912,0.00027526743,0.0002624999,0.00006256206,1.1908086e-7,0.0002967475,0.06206085],"genre_scores_gemma":[0.122516744,6.246033e-7,0.8757275,0.0004580264,0.00009038172,0.000010208992,7.1360455e-7,0.000004007937,0.0011918488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928963,0.00002864832,0.00014211798,0.00023690422,0.00014757874,0.00015512963],"domain_scores_gemma":[0.9993343,0.00003794564,0.000050920284,0.00048939785,0.000043816737,0.000043642875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005692858,0.00006179453,0.00005382961,0.00006520807,0.00007813415,0.000120492805,0.0004903651,0.000030119698,0.00015878238],"category_scores_gemma":[0.000047896305,0.00005888279,0.000020307034,0.00026644106,0.000009712954,0.0010645115,0.00006375771,0.0000834317,0.00024211574],"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.0000027936894,0.000047295507,0.00022129262,0.000004586758,0.0000023334335,4.4220596e-7,0.000042776563,0.012465284,0.009979106,0.85353744,0.00032010043,0.12337656],"study_design_scores_gemma":[0.00014706588,0.000012892664,0.0005079754,0.000004279121,0.0000013663926,0.000004485911,0.0000020744546,0.9282364,0.04226054,0.002763284,0.025977416,0.00008217348],"about_ca_topic_score_codex":0.000038713963,"about_ca_topic_score_gemma":0.0000043654554,"teacher_disagreement_score":0.9157712,"about_ca_system_score_codex":0.00006913569,"about_ca_system_score_gemma":0.000035626206,"threshold_uncertainty_score":0.3111989},"labels":[],"label_agreement":null},{"id":"W2132609582","doi":"10.1109/ase.2004.48","title":"Mapping template semantics to SMV","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"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 Waterloo","funders":"","keywords":"Computer science; Programming language; Semantics (computer science); Specification language; Set (abstract data type); Notation; Model checking; Mathematics","score_opus":0.04244733512051396,"score_gpt":0.30085039365759864,"score_spread":0.2584030585370847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132609582","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.016245665,0.000004197934,0.97151977,0.0018126854,0.00031566736,0.000087419554,1.2388432e-7,0.00020382322,0.009810674],"genre_scores_gemma":[0.15332976,0.000001202043,0.84557194,0.0007834083,0.00002257776,0.0000041499297,1.3983696e-7,0.0000029784292,0.00028384346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941194,0.000015657155,0.0001200227,0.00017262541,0.00012865174,0.0001510825],"domain_scores_gemma":[0.9994597,0.000012130474,0.000024327022,0.00040496592,0.00003583472,0.000063075226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002800233,0.000054005886,0.00005598848,0.00008078861,0.000058541384,0.00007414967,0.0005009249,0.00002512038,0.000006802238],"category_scores_gemma":[0.00004995106,0.000049044782,0.000018124709,0.00040574785,0.000008718887,0.0002875026,0.00014690467,0.000047055975,0.00045198904],"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":[8.560233e-7,0.000019618103,0.00009394423,0.000008624385,0.000003768697,0.000004510521,0.0014568662,0.0017812648,0.0059703165,0.96071506,0.00030792304,0.02963724],"study_design_scores_gemma":[0.00125966,0.00040576953,0.039891794,0.00018168069,0.000005872493,0.00018322952,0.00044713574,0.12222943,0.48959485,0.19851477,0.14583735,0.0014484636],"about_ca_topic_score_codex":0.000020822437,"about_ca_topic_score_gemma":0.0000025192403,"teacher_disagreement_score":0.7622003,"about_ca_system_score_codex":0.00003852265,"about_ca_system_score_gemma":0.000022878163,"threshold_uncertainty_score":0.5809555},"labels":[],"label_agreement":null},{"id":"W2132856032","doi":"","title":"Specifying module interfaces with finitely defined automata","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Assertion; Concurrency; Computer science; Programming language; Automaton; TRACE (psycholinguistics); Algebraic specification; Formal specification; Algebraic number; Design by contract; Theoretical computer science; Formal verification; Formal methods; Software; Software development; Mathematics; Software construction","score_opus":0.041752597787220964,"score_gpt":0.2944838601399106,"score_spread":0.25273126235268967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132856032","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.05866063,0.000015893478,0.89194924,0.0001499196,0.00019526828,0.00007677397,2.2579673e-7,0.00039939844,0.048552677],"genre_scores_gemma":[0.38183153,0.0000016529211,0.61769575,0.000103861064,0.00001831199,0.0000018279394,3.756311e-7,0.0000043527875,0.00034233095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990943,0.00002789134,0.0001797861,0.00025282818,0.00021313163,0.00023203088],"domain_scores_gemma":[0.9991623,0.00009693897,0.00006751387,0.00056072156,0.000054339613,0.000058181544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079215417,0.00009300892,0.00008654654,0.000101016296,0.000070116905,0.000112646034,0.0006890402,0.00003565692,0.000029780422],"category_scores_gemma":[0.00006303592,0.000069432375,0.000015693566,0.00038954985,0.00003760591,0.0006304203,0.00015213146,0.00008711281,0.0001376031],"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.000039511182,0.000076128,0.0014921996,0.000018542514,0.00001530003,0.000016622265,0.00076905877,0.00020140251,0.0032933308,0.7324714,0.00052380527,0.26108268],"study_design_scores_gemma":[0.0008921237,0.00056351366,0.07848347,0.00006955139,0.000007942786,0.00012892688,0.00022491929,0.4096334,0.48959702,0.00685591,0.01286342,0.0006798317],"about_ca_topic_score_codex":0.000018096936,"about_ca_topic_score_gemma":0.00001777456,"teacher_disagreement_score":0.7256155,"about_ca_system_score_codex":0.00003408356,"about_ca_system_score_gemma":0.000019997542,"threshold_uncertainty_score":0.28313702},"labels":[],"label_agreement":null},{"id":"W2132874521","doi":"10.3217/jucs-010-09-1156","title":"Symbolic Approach to the Analysis of Security Protocols","year":2020,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Symbolic data analysis; Cryptographic protocol; Computer security; Security analysis; The Symbolic; Theoretical computer science; Cryptography; Psychology","score_opus":0.03006844700649969,"score_gpt":0.28569993836323426,"score_spread":0.2556314913567346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132874521","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.006297683,0.00006825778,0.98027676,0.0049097813,0.000027660588,0.0067407712,0.000021713295,0.00044238818,0.0012149629],"genre_scores_gemma":[0.36668414,0.0000057669135,0.6216868,0.0033839147,0.000052523825,0.008144629,0.000005684496,0.000016023589,0.000020500875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975999,0.00035246785,0.0005391145,0.0005469933,0.000523388,0.00043816093],"domain_scores_gemma":[0.99750006,0.00008240783,0.00028639392,0.0016607384,0.00016375569,0.0003066598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013292456,0.00022512444,0.00044813496,0.00041438444,0.00015389602,0.00018525322,0.0026079991,0.00013899672,0.000005983366],"category_scores_gemma":[0.00049222785,0.00017837042,0.00025310757,0.0050373594,0.00006525587,0.0003880348,0.00060307916,0.00032279443,0.000012164981],"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.00010477896,0.00054410356,0.011217265,0.00016771602,0.00056038424,0.000005128451,0.014121992,0.04543499,0.0068721925,0.8772193,0.0030672837,0.040684845],"study_design_scores_gemma":[0.00011730135,0.00010957014,0.022317857,0.000011144236,0.00008416122,0.0000054724874,0.00008429928,0.9581411,0.0143759865,0.0009344187,0.0035989364,0.00021973562],"about_ca_topic_score_codex":0.0008944183,"about_ca_topic_score_gemma":0.00009095183,"teacher_disagreement_score":0.91270614,"about_ca_system_score_codex":0.00012230224,"about_ca_system_score_gemma":0.000129887,"threshold_uncertainty_score":0.7273735},"labels":[],"label_agreement":null},{"id":"W2133022776","doi":"10.1007/978-3-642-32940-1_30","title":"Modeling Interval Order Structures with Partially Commutative Monoids","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Interval (graph theory); Commutative property; Order (exchange); Computer science; Algorithm; Discrete mathematics; Mathematics; Combinatorics","score_opus":0.037364793366591965,"score_gpt":0.29349729631196175,"score_spread":0.25613250294536977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133022776","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.00049759407,0.00042194428,0.99677044,0.00010287244,0.0008436937,0.00033612887,0.0000039583097,0.00009843054,0.00092493044],"genre_scores_gemma":[0.2885666,0.000014713186,0.71106195,0.00017751426,0.00012942863,0.000006368285,0.0000024786816,0.000023205985,0.000017725974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968932,0.00008757671,0.00060537056,0.00091158866,0.00093318976,0.0005690642],"domain_scores_gemma":[0.99727494,0.00023137164,0.0003735421,0.0014125321,0.0005644572,0.00014318468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011404557,0.00048016378,0.00056855683,0.0005754504,0.00016266298,0.00021577901,0.003190307,0.00026178546,0.000014808681],"category_scores_gemma":[0.0001086429,0.00038196912,0.00008105949,0.0006260835,0.000839832,0.0010233735,0.0010635037,0.0008211825,0.000007901329],"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.000019622898,0.000019512978,0.000039281837,0.000041673105,0.000018768416,0.000006869319,0.0027047603,0.45445624,0.000110499335,0.098140724,7.2454213e-7,0.44444132],"study_design_scores_gemma":[0.00016683662,0.0002278191,0.00005353387,0.00022326797,0.000011679888,0.000040129093,6.192347e-7,0.89554495,0.0037331155,0.09951485,0.000052361713,0.00043084688],"about_ca_topic_score_codex":0.000040563387,"about_ca_topic_score_gemma":0.000055973163,"teacher_disagreement_score":0.44401047,"about_ca_system_score_codex":0.00018557,"about_ca_system_score_gemma":0.0004719241,"threshold_uncertainty_score":0.9998632},"labels":[],"label_agreement":null},{"id":"W2133105422","doi":"10.1109/aiccsa.2005.1387097","title":"A comparative study of specification methods for electronic commerce systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 Manitoba","funders":"","keywords":"Computer science; Formal specification; Sample (material); System requirements specification; E-commerce; Software engineering; Database; World Wide Web","score_opus":0.1284523664360049,"score_gpt":0.45266868265963695,"score_spread":0.324216316223632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133105422","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.014559376,0.00014699175,0.9810354,0.00010244486,0.00015217108,0.0011987127,5.4677e-7,0.0000880757,0.0027162635],"genre_scores_gemma":[0.45615116,0.0000027626227,0.5435201,0.000014572516,0.000027095517,0.00011492861,8.005194e-7,0.000003027737,0.00016556283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849963,0.00050073577,0.00039576527,0.00026782966,0.00013786477,0.00019819952],"domain_scores_gemma":[0.99858916,0.00031226134,0.00022137995,0.00064127386,0.00020295537,0.000032948716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017871822,0.000096259784,0.00024427444,0.000096910655,0.000071274975,0.000047365058,0.00069095317,0.000033913955,0.0000039383526],"category_scores_gemma":[0.00004610741,0.00008456136,0.00003649182,0.00034866427,0.00002256316,0.0004056905,0.000059542643,0.000079528254,0.000010464445],"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.00002275712,0.0005696216,0.00005993016,0.000016911174,0.000039788665,1.5437621e-8,0.0052953707,0.0018240301,0.0046278965,0.91775435,0.0003028192,0.069486514],"study_design_scores_gemma":[0.00054863375,0.0007379694,0.0017764919,0.000005035248,0.000012482626,0.0000028802917,0.001825804,0.95733035,0.018099997,0.00080472033,0.018718649,0.0001370187],"about_ca_topic_score_codex":0.000026652391,"about_ca_topic_score_gemma":0.0000112966845,"teacher_disagreement_score":0.95550627,"about_ca_system_score_codex":0.0001036166,"about_ca_system_score_gemma":0.000037939855,"threshold_uncertainty_score":0.34483123},"labels":[],"label_agreement":null},{"id":"W2133285313","doi":"10.1109/ssst.1994.287794","title":"An improved decomposition approach for reachability analysis","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Reachability; Computer science; Deadlock; Set (abstract data type); Model checking; Decomposition; State space; State (computer science); Protocol (science); Theoretical computer science; Space (punctuation); Formal verification; Algorithm; Distributed computing; Programming language; Mathematics; Operating system","score_opus":0.04401070915585536,"score_gpt":0.33259617742165565,"score_spread":0.2885854682658003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133285313","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.0057887305,0.0000065507775,0.9889471,0.00007890186,0.00005229126,0.00026860443,0.0000020403957,0.00017306072,0.0046827495],"genre_scores_gemma":[0.36248693,5.003929e-7,0.63727707,0.00006386652,0.000017022394,0.00004857989,0.00001133942,0.0000022835623,0.00009241353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998929,0.00014565732,0.00023826555,0.00041679468,0.000117892996,0.00015239132],"domain_scores_gemma":[0.9986597,0.00004908129,0.00008308623,0.0010372911,0.00010404306,0.000066834684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010659145,0.000078195044,0.00014152247,0.00012419203,0.0000977937,0.000113103706,0.00059765135,0.000052339947,0.000031368763],"category_scores_gemma":[0.000054931363,0.00006719993,0.00012226283,0.0006706271,0.000022667875,0.0007097837,0.00003422819,0.000045667144,0.0000054128755],"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.000026962103,0.0015073351,0.0028288804,0.000052041032,0.00025930523,1.9213373e-7,0.0016168534,0.0039787777,0.02951548,0.315306,0.00039726318,0.6445109],"study_design_scores_gemma":[0.00009496904,0.00010149051,0.00378059,1.75168e-7,0.000030874864,8.330319e-7,0.000012278505,0.99036425,0.0044236663,0.000980407,0.0001199759,0.000090483445],"about_ca_topic_score_codex":0.000025234653,"about_ca_topic_score_gemma":0.0000029482176,"teacher_disagreement_score":0.98638546,"about_ca_system_score_codex":0.00004214402,"about_ca_system_score_gemma":0.0000036690399,"threshold_uncertainty_score":0.27403337},"labels":[],"label_agreement":null},{"id":"W2133381457","doi":"10.1109/ccece.2007.352","title":"Formal Verification of a Pipelined Cryptographic Circuit Using Equivalence Checking and Completion Functions","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Waterloo","funders":"","keywords":"Formal equivalence checking; Computer science; Equivalence (formal languages); Formal verification; Model checking; Pipeline (software); Cryptography; Functional verification; Parallel computing; Theoretical computer science; Programming language; Computer engineering; Algorithm; Mathematics","score_opus":0.0827118194666272,"score_gpt":0.3178807426779773,"score_spread":0.23516892321135008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133381457","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.20595124,0.00004357315,0.7919743,0.00001726078,0.00018624293,0.00012831923,6.874435e-7,0.00008851891,0.0016098422],"genre_scores_gemma":[0.593261,0.000006960712,0.40666792,0.00002420653,0.000021445394,0.000002154055,0.0000015644052,0.0000034757152,0.000011297364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881876,0.00004892931,0.00038855008,0.00025431294,0.00024889666,0.00024057484],"domain_scores_gemma":[0.9990729,0.00007143054,0.00020951254,0.0003969646,0.00018794666,0.00006125047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016804432,0.00009462464,0.00012101201,0.00022577871,0.00030759422,0.000093053226,0.0002813521,0.00006326731,0.000007783569],"category_scores_gemma":[0.0000966678,0.00009639172,0.000040427836,0.00075491524,0.00010158291,0.0010735289,0.00009787387,0.000090074696,0.0000031025927],"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.000023027344,0.000076451426,0.0056420323,0.000076693716,0.00001300089,6.2847056e-7,0.000632677,0.0002036322,0.31557462,0.56963784,0.000008416888,0.108111024],"study_design_scores_gemma":[0.00050685037,0.00015789032,0.21224849,0.00007389275,0.000024970888,0.00006461098,0.00032286553,0.7323198,0.04779703,0.0057039396,0.00045091502,0.00032879555],"about_ca_topic_score_codex":0.00006141521,"about_ca_topic_score_gemma":0.00000696119,"teacher_disagreement_score":0.7321161,"about_ca_system_score_codex":0.000036698424,"about_ca_system_score_gemma":0.000028097096,"threshold_uncertainty_score":0.39307404},"labels":[],"label_agreement":null},{"id":"W2133406570","doi":"10.1016/j.sysarc.2007.03.007","title":"Formal verification of ASMs using MDGs","year":2007,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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":"Computer science; Formal verification; Abstract state machines; Programming language; Software engineering; Finite-state machine","score_opus":0.02990984917345966,"score_gpt":0.3042110438137437,"score_spread":0.274301194640284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133406570","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.20345011,0.0003562503,0.7943972,0.00003049963,0.001353311,0.00009856019,8.686096e-7,0.000012593123,0.000300636],"genre_scores_gemma":[0.59133166,0.0000036274532,0.40839586,0.0000114884215,0.00024035164,3.3418496e-7,1.6364514e-7,0.0000054339107,0.000011100262],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981359,0.00012665051,0.00088534434,0.000112457055,0.0005165597,0.00022307245],"domain_scores_gemma":[0.99768746,0.00009068606,0.0012764207,0.00037087555,0.0004835213,0.00009103431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034510645,0.000103737024,0.00025298836,0.0003515596,0.00006697147,0.000048752336,0.0007078278,0.0000910743,0.0000013290112],"category_scores_gemma":[0.00021934652,0.000080773774,0.000110537556,0.00042091843,0.000042526895,0.0006069525,0.00006106047,0.00027815124,0.0000014067016],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00032234448,0.0002321352,0.0023978078,0.0007018433,0.00018421371,0.000056312936,0.010485442,0.077568986,0.5000819,0.120573714,0.00019785613,0.28719744],"study_design_scores_gemma":[0.0041180835,0.0030741396,0.09110196,0.0026751836,0.00019277663,0.013966155,0.00224114,0.38453668,0.44674218,0.009137391,0.040650558,0.0015637592],"about_ca_topic_score_codex":0.000018136485,"about_ca_topic_score_gemma":0.0000010392637,"teacher_disagreement_score":0.38788155,"about_ca_system_score_codex":0.00009266053,"about_ca_system_score_gemma":0.00008757268,"threshold_uncertainty_score":0.3293859},"labels":[],"label_agreement":null},{"id":"W2133689258","doi":"10.1109/icccn.1995.540100","title":"An efficient method for protocol conversion","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Interoperability; Internetworking; Protocol (science); Computation; Equivalence (formal languages); Channel (broadcasting); Computer network; Distributed computing; Formal specification; Converters; Algorithm; Programming language; Engineering; Operating system; The Internet","score_opus":0.06089899354454965,"score_gpt":0.38634303523942587,"score_spread":0.32544404169487623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133689258","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.000046622088,6.653488e-7,0.9648529,0.0001506605,0.00012459414,0.030395973,4.2804024e-7,0.00019728158,0.004230849],"genre_scores_gemma":[0.0009790772,5.9216138e-8,0.9639378,0.00023561099,0.000025826503,0.0344385,3.30022e-7,0.000004488973,0.0003782965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991922,0.00011029301,0.00013665295,0.00026281347,0.00014269711,0.00015536904],"domain_scores_gemma":[0.99922574,0.00006597332,0.000054259264,0.0005132709,0.000076144315,0.00006461355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007445351,0.00006669631,0.00006887267,0.000053765292,0.00009200965,0.00006775267,0.0005564645,0.000040194052,0.00009999666],"category_scores_gemma":[0.00005202831,0.000054307828,0.00003421955,0.00017405282,0.000013672695,0.00027024918,0.000049275965,0.0000390158,0.000071633294],"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.000018457355,0.00033495293,0.000030513664,0.00006413334,0.000003690929,6.4734644e-7,0.0007408748,0.0020760468,0.005508262,0.6499235,0.0035464745,0.3377524],"study_design_scores_gemma":[0.00030996787,0.0001868113,0.000066031185,0.000002330791,9.816735e-7,0.000002891349,0.000009390324,0.91998214,0.048559386,0.00046475776,0.030336946,0.00007837066],"about_ca_topic_score_codex":0.000003988295,"about_ca_topic_score_gemma":1.3871986e-7,"teacher_disagreement_score":0.9179061,"about_ca_system_score_codex":0.000028295894,"about_ca_system_score_gemma":0.0000069035186,"threshold_uncertainty_score":0.2214609},"labels":[],"label_agreement":null},{"id":"W2133708183","doi":"10.1109/aiccsa.2003.1227510","title":"Promotion of specifications","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 Regina","funders":"","keywords":"Promotion (chess); Reuse; Computer science; Software engineering; Algebraic specification; Formal specification; Risk analysis (engineering); Programming language; Engineering; Business; Political science","score_opus":0.12073924396581277,"score_gpt":0.3133749816381516,"score_spread":0.19263573767233882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133708183","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.0059351437,0.0000049669784,0.9709748,0.00058034,0.00009927828,0.0000677068,1.7807504e-7,0.00007340664,0.022264188],"genre_scores_gemma":[0.3783936,0.0000018971274,0.62150186,0.000010048261,0.0000068330964,0.0000034942411,3.1059972e-7,8.766529e-7,0.000081123304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99964267,0.000014246362,0.000110300134,0.00009084944,0.000090795504,0.000051111292],"domain_scores_gemma":[0.99953973,0.0000061139417,0.000045542292,0.00033745644,0.00005427961,0.0000168865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016288045,0.000025750693,0.000033971653,0.00004291827,0.000021607102,0.000011614647,0.00029383833,0.00001575335,0.000013828131],"category_scores_gemma":[0.00003376636,0.000022808594,0.00001547671,0.00024687647,0.00002023344,0.00028917647,0.000028919994,0.000023009527,0.000052298594],"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":[1.9196267e-7,0.000042171236,0.000026248805,0.000002139379,7.3208486e-7,5.2218972e-8,0.00011481365,0.00008817694,0.006287845,0.9825373,0.000013152446,0.010887169],"study_design_scores_gemma":[0.00026002934,0.00013140582,0.033714913,0.000012921771,0.000002105573,0.0000103312295,0.000026781094,0.008514528,0.7537136,0.20183946,0.0016578427,0.00011607417],"about_ca_topic_score_codex":0.000006671392,"about_ca_topic_score_gemma":8.332975e-7,"teacher_disagreement_score":0.7806979,"about_ca_system_score_codex":0.000020449925,"about_ca_system_score_gemma":0.000023710494,"threshold_uncertainty_score":0.093010746},"labels":[],"label_agreement":null},{"id":"W2133853708","doi":"10.5555/776816.776844","title":"Data flow testing as model checking","year":2003,"lang":"en","type":"article","venue":"ScholarlyCommons (University of Pennsylvania)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":90,"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 Ottawa","funders":"","keywords":"Model checking; Computer science; Computation tree logic; Temporal logic; Counterexample; Linear temporal logic; Construct (python library); CTL*; Programming language; Set (abstract data type); Test case; Algorithm; Theoretical computer science; Mathematics; Machine learning","score_opus":0.1557889296470551,"score_gpt":0.294810634822528,"score_spread":0.1390217051754729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133853708","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.04505778,0.00006872429,0.92589915,0.0001765163,0.00016135738,0.00014095067,0.00002759134,0.00018000494,0.028287932],"genre_scores_gemma":[0.24431366,0.000007688559,0.7553065,0.00003920233,0.0000077530585,1.5163373e-7,0.000008778516,0.000008809129,0.0003074688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827856,0.0002583585,0.00017571166,0.000574807,0.00039981832,0.0003127494],"domain_scores_gemma":[0.9969517,0.00013466192,0.00022174446,0.0023174342,0.00022935818,0.00014510263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001730681,0.0001507917,0.0002160867,0.00021260224,0.0005057171,0.00014661223,0.003850273,0.00011171993,0.00003648196],"category_scores_gemma":[0.0011373152,0.0002034374,0.0000576573,0.0009111727,0.00011455457,0.0051438003,0.0011908913,0.00043046643,0.000114708084],"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.000038722228,0.0004311936,0.0058235577,0.000103420745,0.00011352538,0.00009707484,0.0038869965,0.010120983,0.029674115,0.80525213,0.0015787142,0.14287959],"study_design_scores_gemma":[0.00039666446,0.000055001234,0.0020436437,0.000038404833,0.000024832547,0.000039087623,0.00038295952,0.9803958,0.00068595243,0.010174865,0.005486843,0.00027593088],"about_ca_topic_score_codex":0.000096465985,"about_ca_topic_score_gemma":0.000047072015,"teacher_disagreement_score":0.9702748,"about_ca_system_score_codex":0.000071318944,"about_ca_system_score_gemma":0.00023137605,"threshold_uncertainty_score":0.82959366},"labels":[],"label_agreement":null},{"id":"W2133953358","doi":"10.1109/icnp.1993.340891","title":"An approach to evaluating the performance of communication protocols based on formal specifications","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 British Columbia","funders":"","keywords":"Extended finite-state machine; Reachability; Computer science; Finite-state machine; Formal methods; Formal verification; State space; Protocol (science); Queueing theory; Sliding window protocol; State (computer science); Communications protocol; Formal specification; Model checking; Theoretical computer science; Automaton; Simple (philosophy); Window (computing); Programming language; Computer network; Operating system; Mathematics","score_opus":0.3071351936941251,"score_gpt":0.40749039022228156,"score_spread":0.10035519652815644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133953358","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.022092123,0.0000023943003,0.92930067,0.00050491106,0.000023094677,0.006416138,9.010334e-7,0.00010095131,0.04155884],"genre_scores_gemma":[0.45547718,6.204787e-7,0.54081637,0.00017745045,0.000009560031,0.0034413382,0.000001710719,0.000003897443,0.00007188867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985677,0.0003370078,0.00028470476,0.00022160237,0.00041182325,0.0001771848],"domain_scores_gemma":[0.99720055,0.000114904775,0.00016044262,0.0022976,0.00017391835,0.00005261249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021225018,0.00009159029,0.00009110191,0.00009486356,0.00030660338,0.00008989836,0.0019472555,0.000035028213,0.000024778667],"category_scores_gemma":[0.00010416684,0.000064037944,0.00003041386,0.00061287667,0.000054580727,0.0008198548,0.00009390443,0.00012927814,0.000045654473],"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.000042930853,0.001016318,0.0006661053,0.000048681977,0.0000057407897,2.0246599e-8,0.0027568345,0.13401392,0.00588417,0.5946526,0.00038973187,0.26052296],"study_design_scores_gemma":[0.00013767384,0.0005364538,0.009015985,0.00001931968,0.0000016415348,9.762292e-7,0.000044578883,0.9818019,0.007875415,0.00006603137,0.0004163626,0.00008361408],"about_ca_topic_score_codex":0.0000040035916,"about_ca_topic_score_gemma":4.0750376e-7,"teacher_disagreement_score":0.84778804,"about_ca_system_score_codex":0.000040412535,"about_ca_system_score_gemma":0.000021251468,"threshold_uncertainty_score":0.36185175},"labels":[],"label_agreement":null},{"id":"W2134021948","doi":"10.1007/978-3-540-78913-0_22","title":"Solving Linear Equations in *-continuous Action Lattices","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Mathematics; Action (physics); Algebraic equation; Linear equation; Algebraic number; Algebra over a field; Sign (mathematics); Applied mathematics; Lattice (music); Pure mathematics; Nonlinear system; Mathematical analysis","score_opus":0.058569033436331054,"score_gpt":0.31306149589153615,"score_spread":0.25449246245520507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134021948","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.000287899,0.00032560827,0.993588,0.0003027705,0.0020806938,0.00037114305,0.0000017088166,0.00018111411,0.0028610746],"genre_scores_gemma":[0.054482143,0.00013917146,0.94427997,0.00041644782,0.00038486483,0.000014873357,0.0000039445586,0.000026807747,0.00025176594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657524,0.00007915673,0.00065079564,0.0012541267,0.00086081395,0.0005798676],"domain_scores_gemma":[0.9973631,0.0006483767,0.00040358907,0.0012549484,0.0002228269,0.00010719091],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013653004,0.0003981955,0.000435232,0.001243663,0.00028068974,0.00029720968,0.0025696892,0.00035142177,0.000011959437],"category_scores_gemma":[0.00045516223,0.000403152,0.00009574264,0.00095612055,0.0004758011,0.0014602732,0.00072254374,0.00096323964,0.00006671681],"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.0000048404386,0.00003941397,0.00010695016,0.000034770568,0.000005432946,0.000052051862,0.0019682536,0.051159084,0.0003128169,0.022276623,0.00001037003,0.9240294],"study_design_scores_gemma":[0.00018325359,0.00009670285,0.00047772637,0.0002723339,0.0000038615713,0.000057986283,3.6030463e-7,0.96994007,0.0019955083,0.025066398,0.0013988308,0.00050696137],"about_ca_topic_score_codex":0.00005520115,"about_ca_topic_score_gemma":0.00016205835,"teacher_disagreement_score":0.9235224,"about_ca_system_score_codex":0.00045548496,"about_ca_system_score_gemma":0.00046422763,"threshold_uncertainty_score":0.99984205},"labels":[],"label_agreement":null},{"id":"W2134071215","doi":"10.1007/s00165-003-0024-3","title":"ERC – An object-oriented refinement calculus for Eiffel","year":2004,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Eiffel; Refinement calculus; Computer science; Programming language; Executable; Notation; Unified Modeling Language; Process calculus; Context (archaeology); Object-oriented programming; Algorithm; Software; Theoretical computer science; Mathematics","score_opus":0.023043907709131232,"score_gpt":0.3050553951612518,"score_spread":0.28201148745212057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134071215","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.1594275,0.000022595303,0.836506,0.00014006613,0.00061269954,0.00034741132,0.0000029483524,0.00020000308,0.002740792],"genre_scores_gemma":[0.5208268,5.4418166e-7,0.47899917,0.00006409017,0.00008264427,0.0000063377156,0.000005624893,0.000007908259,0.0000068519216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819595,0.00004542936,0.0005173791,0.00037111717,0.00036106282,0.000509053],"domain_scores_gemma":[0.99865615,0.00006221133,0.00031361647,0.00060344086,0.00024986063,0.000114726645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095927465,0.00017777612,0.00024609268,0.00014807492,0.00025384172,0.000061978535,0.0008338816,0.000071359245,0.0000025154013],"category_scores_gemma":[0.00015001584,0.00017182485,0.00010444149,0.00041814212,0.000052204567,0.0010013047,0.00030392874,0.00013437084,0.00000656918],"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.000020212103,0.00012592303,0.000021504806,0.000051681593,0.00001354147,0.0000018478496,0.0013084131,0.005877192,0.001920966,0.9551236,0.000011846451,0.035523247],"study_design_scores_gemma":[0.0026940813,0.0020165627,0.00885865,0.00013737127,0.000021159856,0.00004972591,0.00025914065,0.7708962,0.18421197,0.028232014,0.0020498908,0.0005732165],"about_ca_topic_score_codex":0.00004621002,"about_ca_topic_score_gemma":0.000009702552,"teacher_disagreement_score":0.9268916,"about_ca_system_score_codex":0.0001297209,"about_ca_system_score_gemma":0.00012176555,"threshold_uncertainty_score":0.7006814},"labels":[],"label_agreement":null},{"id":"W2134435359","doi":"10.1109/icecs.2010.5724598","title":"Timing verification of cyclic systems based on temporal constraint analysis","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Solver; Computer science; Asynchronous communication; Bounded function; Integer (computer science); Constraint (computer-aided design); Constraint satisfaction problem; Algorithm; Parallel computing; Static timing analysis; Component (thermodynamics); Mathematical optimization; Mathematics; Programming language","score_opus":0.03443760709217951,"score_gpt":0.3036199152027088,"score_spread":0.2691823081105293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134435359","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.058935642,0.0000023140224,0.932538,0.000089439374,0.0003749962,0.00012606484,0.000002003848,0.00009595507,0.007835615],"genre_scores_gemma":[0.6201953,1.8305762e-7,0.37971756,0.000028239621,0.000012062123,0.000008682022,0.0000041208646,0.0000022404604,0.000031603584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989708,0.00009827703,0.0003059961,0.00025035045,0.00025858826,0.00011597238],"domain_scores_gemma":[0.9986604,0.00010200281,0.00020491339,0.0008751259,0.000105941304,0.000051617197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093212805,0.000080562495,0.00016014853,0.00030231866,0.000047732345,0.00006127439,0.00049316074,0.00006797033,0.0000288688],"category_scores_gemma":[0.00012783392,0.00007014291,0.00007914272,0.0008479412,0.00006795564,0.0001935427,0.000024687744,0.0001203436,0.00001917061],"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.000011870877,0.00016873817,0.01127117,0.000044710978,0.00008679372,0.0000012422763,0.0002287917,0.016054008,0.07113349,0.87494993,0.00006336807,0.025985869],"study_design_scores_gemma":[0.000083440835,0.00003688421,0.012864265,0.000005232936,0.000023252836,0.000001006827,0.000022899701,0.96009624,0.026475225,0.0000750181,0.00023512197,0.00008141515],"about_ca_topic_score_codex":0.000103981096,"about_ca_topic_score_gemma":0.000007776199,"teacher_disagreement_score":0.9440422,"about_ca_system_score_codex":0.000018971583,"about_ca_system_score_gemma":0.000046619003,"threshold_uncertainty_score":0.2860345},"labels":[],"label_agreement":null},{"id":"W2134616364","doi":"10.1109/iccd.1994.331890","title":"Area efficient synthesis of asynchronous interface circuits","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Asynchronous communication; Computer science; Divide and conquer algorithms; Graph; Electronic circuit; Interface (matter); High-level synthesis; Digital electronics; Theoretical computer science; Computer engineering; Computer architecture; Algorithm; Parallel computing; Embedded system; Computer network","score_opus":0.04055690700098744,"score_gpt":0.26536992276474175,"score_spread":0.22481301576375431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134616364","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.026171185,0.000092175884,0.92900795,0.000100457866,0.0002137799,0.00008325387,6.642272e-7,0.00011217339,0.04421839],"genre_scores_gemma":[0.7436118,0.000005734658,0.256229,0.000019606532,0.0000065864037,0.0000077090335,3.375711e-8,0.0000033522374,0.00011613811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999152,0.00006628417,0.00021484555,0.00021630779,0.00019541515,0.00015512742],"domain_scores_gemma":[0.99906814,0.00013617806,0.00009099187,0.0005984876,0.000061469356,0.000044715103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030862287,0.00007822609,0.00012011126,0.00008132792,0.00003460078,0.000029330056,0.0007074021,0.00003825892,0.00021290715],"category_scores_gemma":[0.00023174818,0.00006808578,0.00004162819,0.00028741613,0.00004525474,0.00013868866,0.000119144555,0.00005384923,0.00017187044],"study_design_candidate":"design_other","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.0000015513369,0.00033513526,0.00015295846,0.000046667607,0.000021907701,0.0000024451674,0.0015359713,0.005154049,0.013597212,0.12344881,0.00060290226,0.8551004],"study_design_scores_gemma":[0.000048248097,0.0000326162,0.0006582439,0.00001999283,0.0000030697627,0.000009705993,0.000021940701,0.69749916,0.3012588,0.0001144681,0.00024076505,0.00009299518],"about_ca_topic_score_codex":0.0000074888485,"about_ca_topic_score_gemma":4.3681337e-7,"teacher_disagreement_score":0.8550074,"about_ca_system_score_codex":0.000042309635,"about_ca_system_score_gemma":0.000007918027,"threshold_uncertainty_score":0.27764577},"labels":[],"label_agreement":null},{"id":"W2135268474","doi":"10.1109/hicss.1993.270634","title":"A verifier for network decompositions of command-based specifications","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":16,"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 Waterloo","funders":"","keywords":"Correctness; Computer science; Programming language; Implementation; Notation; Formal verification; Theoretical computer science; Arithmetic; Mathematics","score_opus":0.1419743367238666,"score_gpt":0.298580494185763,"score_spread":0.15660615746189638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135268474","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.00033449897,0.000051037165,0.9833284,0.00082682446,0.00021387584,0.00025758718,0.0000051070087,0.00009717703,0.014885474],"genre_scores_gemma":[0.11418549,0.000004934746,0.88517535,0.00022524323,0.000047559144,0.00007448961,0.00000474076,0.0000047007475,0.00027750977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930704,0.000049229217,0.00022938703,0.00016277054,0.00010036048,0.00015118766],"domain_scores_gemma":[0.9989612,0.00019507649,0.00009036756,0.0005979177,0.00011262033,0.000042812826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024477686,0.00006389433,0.000097133685,0.0000558478,0.0001362031,0.00003352835,0.0004961289,0.0000363934,0.0001080574],"category_scores_gemma":[0.000035741425,0.000061870654,0.00006716446,0.000357532,0.000045850866,0.00019194632,0.00002998438,0.00004277019,0.000031694657],"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.000003911534,0.00012532683,0.000103831844,0.000011458428,0.000007568061,9.464497e-8,0.00009655448,0.0029337222,0.00063401746,0.9699709,0.015626388,0.01048625],"study_design_scores_gemma":[0.00029138007,0.000084802574,0.0017178032,0.0000110197225,0.000006720811,0.0000017449365,0.0000058663168,0.94713676,0.008495435,0.006408758,0.035730455,0.00010928311],"about_ca_topic_score_codex":0.0000029659755,"about_ca_topic_score_gemma":0.0000022511313,"teacher_disagreement_score":0.96356213,"about_ca_system_score_codex":0.000019511626,"about_ca_system_score_gemma":0.00001175484,"threshold_uncertainty_score":0.25230122},"labels":[],"label_agreement":null},{"id":"W2135486194","doi":"10.1109/lics.2006.19","title":"Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematical proof; Proof complexity; Constant (computer programming); Upper and lower bounds; Sequent calculus; Mathematics; Hierarchy; Modular design; Sequent; Exponential function; Discrete mathematics; Propositional calculus; Combinatorics; Calculus (dental); Computer science; Geometry","score_opus":0.017065228661331512,"score_gpt":0.26034386446076985,"score_spread":0.24327863579943834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135486194","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.02220927,0.00003739157,0.9666449,0.00004553903,0.00011989146,0.00051289337,0.000017533343,0.00011795696,0.010294624],"genre_scores_gemma":[0.55973005,1.231637e-7,0.44007152,0.000014332651,0.000018010029,0.000055411936,0.000004426358,0.0000039214538,0.00010222407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991414,0.000046485242,0.00021735732,0.00023737518,0.00020715136,0.00015023073],"domain_scores_gemma":[0.9991593,0.00010966409,0.00014263357,0.0002948109,0.00026657572,0.000027025617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031834835,0.00009007969,0.00014682187,0.00006294908,0.00007316428,0.0000497265,0.0002651027,0.000038791422,0.000005080689],"category_scores_gemma":[0.000022441061,0.00006882317,0.000037978014,0.00016376305,0.00013868263,0.00037602556,0.000028673834,0.00003433118,0.0000032897494],"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.000031095977,0.000052933683,0.00016731708,0.00006533842,0.000014133293,0.0000012430374,0.00003032496,0.00044058377,0.002337044,0.99636275,0.00010826233,0.00038899734],"study_design_scores_gemma":[0.0026088401,0.001291492,0.007979558,0.0001604122,0.000032527038,0.0001661746,0.00028577555,0.7231049,0.18268676,0.07845196,0.0026855909,0.0005460338],"about_ca_topic_score_codex":0.00001799913,"about_ca_topic_score_gemma":0.0000070370374,"teacher_disagreement_score":0.91791075,"about_ca_system_score_codex":0.00005183213,"about_ca_system_score_gemma":0.000093719216,"threshold_uncertainty_score":0.28065273},"labels":[],"label_agreement":null},{"id":"W2135523993","doi":"10.5555/1326073.1326122","title":"A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":45,"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":"","keywords":"Computer science; Very-large-scale integration; Debugging; Encoding (memory); Representation (politics); Satisfiability; Frame (networking); Sequential logic; Model checking; Algorithm; Theoretical computer science; Computer engineering; Parallel computing; Logic gate; Programming language; Embedded system; Artificial intelligence","score_opus":0.037046229261104964,"score_gpt":0.3211840071330828,"score_spread":0.28413777787197786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135523993","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.024777241,0.000007217512,0.96875936,0.00063796644,0.00003398424,0.0006961457,0.0000015612342,0.00019681112,0.0048896982],"genre_scores_gemma":[0.44740993,0.0000024792114,0.55196804,0.00033688277,0.000022204837,0.00014784609,0.0000060221323,0.0000050486196,0.00010158642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988119,0.00004155277,0.00024970775,0.00045700005,0.00023008214,0.00020976491],"domain_scores_gemma":[0.9986001,0.00025303866,0.00011215367,0.0006447612,0.00026252546,0.00012739468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045037718,0.0001269994,0.00010677945,0.00017799479,0.00021267672,0.00012756338,0.00037834796,0.000046018253,0.000008718331],"category_scores_gemma":[0.00011047787,0.00010317442,0.000015228191,0.00093474024,0.000071816045,0.0005910304,0.00003732265,0.00008337386,0.000052496467],"study_design_candidate":"observational","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.00020183188,0.0006605655,0.21647283,0.00012351453,0.000044122487,0.0000047907165,0.006751709,0.009394382,0.11840861,0.33866712,0.00056885026,0.30870163],"study_design_scores_gemma":[0.00085206097,0.0009405064,0.40733162,0.000048865408,0.00002023297,0.000037205682,0.0002716782,0.27276492,0.30931398,0.0008027178,0.0069628386,0.00065338216],"about_ca_topic_score_codex":0.000012113587,"about_ca_topic_score_gemma":0.00001512552,"teacher_disagreement_score":0.42263266,"about_ca_system_score_codex":0.000062638945,"about_ca_system_score_gemma":0.000052140153,"threshold_uncertainty_score":0.42073306},"labels":[],"label_agreement":null},{"id":"W2135655782","doi":"10.1109/hldvt.2000.889562","title":"Compositional verification of an ATM switch module using interface recognizer/suppliers (IRS)","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Interface (matter); Computer science; Automaton; Programming language; Model checking; Application programming interface; Distributed computing; Embedded system; Theoretical computer science; Parallel computing","score_opus":0.0702460859643823,"score_gpt":0.31315149384709534,"score_spread":0.24290540788271303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135655782","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.25419343,0.000022564956,0.74261683,0.000099774246,0.00021006753,0.000114110175,0.0000029035127,0.00008875424,0.002651577],"genre_scores_gemma":[0.47605348,0.0000034179418,0.5238187,0.000037428894,0.000017646646,0.0000039541114,0.0000031621203,0.000004956802,0.000057274017],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988168,0.000110596695,0.00031639123,0.0003277621,0.0002624544,0.00016603022],"domain_scores_gemma":[0.9989816,0.00004028231,0.00015942454,0.0006045518,0.0001414641,0.0000727045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036938838,0.00010676025,0.00012977708,0.00009936555,0.00009416521,0.00005952527,0.00063057675,0.000066362954,0.00017867825],"category_scores_gemma":[0.000033705106,0.0001086572,0.000040077342,0.00034017468,0.00006260289,0.0010243461,0.00008385296,0.00009393585,0.000060476323],"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.000037820537,0.0006342119,0.0003906502,0.00005462625,0.00004164837,0.0000017824549,0.0020760738,0.008663132,0.6997494,0.15799648,0.00056226423,0.12979193],"study_design_scores_gemma":[0.00015001776,0.00006773872,0.0009643685,0.000010488136,0.000004079267,0.000015946862,0.00003324315,0.7822052,0.21508245,0.0011368502,0.00021660075,0.00011299957],"about_ca_topic_score_codex":0.000030140132,"about_ca_topic_score_gemma":0.0000012492982,"teacher_disagreement_score":0.7735421,"about_ca_system_score_codex":0.000088291155,"about_ca_system_score_gemma":0.000017725015,"threshold_uncertainty_score":0.44309118},"labels":[],"label_agreement":null},{"id":"W2135664660","doi":"10.1109/fmcad.2008.ecp.11","title":"Verifying an Arbiter Circuit","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":23,"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 British Columbia","funders":"","keywords":"Arbiter; Computer science; Parallel computing","score_opus":0.1257499411242284,"score_gpt":0.3046518231055421,"score_spread":0.1789018819813137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135664660","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.05340945,0.000010565499,0.9033819,0.0000403062,0.00022449104,0.000040438645,8.425414e-8,0.0002338637,0.042658888],"genre_scores_gemma":[0.394225,0.0000033616222,0.604955,0.00040484505,0.000033397973,0.0000038921266,3.7114972e-7,0.0000029461166,0.00037116258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993892,0.000046594687,0.00010096471,0.00019104821,0.00013848451,0.00013374002],"domain_scores_gemma":[0.9993499,0.000013845388,0.0000261324,0.0005221534,0.000031292915,0.00005669511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020086038,0.000052410818,0.000052240524,0.000046458987,0.000104087965,0.000038583887,0.0005284847,0.00003023948,0.000041854088],"category_scores_gemma":[0.000024688272,0.000047222307,0.000018552739,0.00017969633,0.000027568612,0.00097556075,0.000061889354,0.00006365831,0.00016645028],"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.000001607381,0.000055577366,0.0023309398,0.000005217196,0.0000038001192,0.00001643129,0.002058408,0.000028138546,0.0053518806,0.91006774,0.00046098224,0.079619266],"study_design_scores_gemma":[0.0007405992,0.00042600118,0.18651788,0.000018221073,0.0000053114068,0.00080652,0.00009393722,0.5977191,0.122522846,0.036579467,0.053494886,0.0010752543],"about_ca_topic_score_codex":0.000010522257,"about_ca_topic_score_gemma":5.207554e-7,"teacher_disagreement_score":0.8734883,"about_ca_system_score_codex":0.000017663033,"about_ca_system_score_gemma":0.000021380456,"threshold_uncertainty_score":0.21394372},"labels":[],"label_agreement":null},{"id":"W2136264185","doi":"10.1109/itng.2008.218","title":"Boundary Value Analysis Using Divide-and-Rule Approach","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Computer science; Dependency (UML); Value (mathematics); Boundary (topology); Algorithm; Artificial intelligence; Mathematics; Machine learning","score_opus":0.0687283212160836,"score_gpt":0.30353679900600383,"score_spread":0.23480847778992023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136264185","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.10347562,0.00008524529,0.8871852,0.000034484896,0.00006898031,0.000051902276,3.3877876e-7,0.00010795159,0.008990272],"genre_scores_gemma":[0.2833263,0.000009280949,0.7163212,0.00010503923,0.00001826336,0.0000026549096,9.934956e-7,0.0000028705094,0.00021346667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990517,0.00010689522,0.0001646409,0.0002991574,0.00021636028,0.00016128109],"domain_scores_gemma":[0.999316,0.000032449185,0.00005587876,0.00049480336,0.00003817491,0.00006274424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046455069,0.00008137776,0.00014378157,0.00018555221,0.00026438717,0.0000906209,0.00039523497,0.000041345113,0.0000084626545],"category_scores_gemma":[0.000041999818,0.00007110207,0.00006720256,0.0010461347,0.00009379431,0.0005898434,0.00019985021,0.00007210931,0.000008373199],"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.0000097394895,0.0002895577,0.049886383,0.00004803574,0.000642039,0.000016483278,0.0058319136,0.01941184,0.004020203,0.8478536,0.0004626271,0.07152756],"study_design_scores_gemma":[0.000060462688,0.000009929019,0.035929654,9.537694e-7,0.0000405884,0.00004404505,0.000012534829,0.9600356,0.0011469644,0.0022326154,0.0003707336,0.00011587654],"about_ca_topic_score_codex":0.0000852416,"about_ca_topic_score_gemma":6.8699967e-7,"teacher_disagreement_score":0.9406238,"about_ca_system_score_codex":0.00003203229,"about_ca_system_score_gemma":0.000040686657,"threshold_uncertainty_score":0.2899458},"labels":[],"label_agreement":null},{"id":"W2136755926","doi":"10.1007/s10817-008-9105-6","title":"Performance Analysis and Functional Verification of the Stop-and-Wait Protocol in HOL","year":2008,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":22,"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; Computer science; Automated theorem proving; Protocol (science); Theoretical computer science; Proof assistant; Relation (database); Process (computing); Programming language; Distributed computing; Mathematics; Data mining; Mathematical proof","score_opus":0.022932527700165545,"score_gpt":0.28076397970697303,"score_spread":0.25783145200680746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136755926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96260065,0.000017383161,0.035728246,0.00007740724,0.00006876046,0.0013778238,2.6352689e-7,0.000026844702,0.00010263237],"genre_scores_gemma":[0.8818407,0.000014585622,0.11793769,0.000011696574,0.000014254837,0.00016720292,1.415406e-7,0.0000027512897,0.00001098741],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989914,0.00013369168,0.00039950703,0.000103937346,0.00028269677,0.00008879511],"domain_scores_gemma":[0.9989906,0.00004961291,0.00058510434,0.00018761662,0.00015449332,0.000032594206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009042248,0.00006533065,0.00016422056,0.00026703955,0.000105196734,0.000023444267,0.00021944249,0.0000454129,0.0000025431355],"category_scores_gemma":[0.0001773068,0.000044924298,0.000048969967,0.0009877627,0.000075598145,0.0005512501,0.000056847322,0.0001644371,3.259173e-7],"study_design_candidate":"observational","study_design_consensus":"observational","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.00017035421,0.0001762943,0.9118321,0.00011068854,0.00025266,0.000010528014,0.004423068,0.023469876,0.024731172,0.004053934,0.000104602004,0.030664729],"study_design_scores_gemma":[0.00017700973,0.000037744867,0.57989496,0.000046295485,0.000013704226,0.00010809142,0.000013819048,0.41491428,0.0047244993,0.0000116640895,0.000028775114,0.000029162893],"about_ca_topic_score_codex":0.000008010478,"about_ca_topic_score_gemma":5.7499125e-7,"teacher_disagreement_score":0.3914444,"about_ca_system_score_codex":0.00004225402,"about_ca_system_score_gemma":0.00008555025,"threshold_uncertainty_score":0.18319598},"labels":[],"label_agreement":null},{"id":"W2137974383","doi":"10.1109/iccd.2005.66","title":"Incorporating efficient assertion checkers into hardware emulation","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Emulation; Assertion; Hardware emulation; Computer science; Overhead (engineering); Generator (circuit theory); Computer architecture; Embedded system; Programming language; Computer hardware; Software","score_opus":0.016208226178780358,"score_gpt":0.2756031815261945,"score_spread":0.25939495534741414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137974383","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.10908858,0.000010561358,0.88324106,0.00019400982,0.00027385185,0.00012102644,1.1660205e-7,0.00028782382,0.006782981],"genre_scores_gemma":[0.5111564,9.334155e-8,0.4886642,0.000033206557,0.00003456385,0.0000071805134,0.0000045149213,0.0000031366415,0.00009672156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901855,0.0000760489,0.00025499286,0.00025721252,0.00025823174,0.00013498426],"domain_scores_gemma":[0.99934196,0.000024964773,0.00013529474,0.00035742036,0.00010950126,0.000030883508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005539452,0.00008603564,0.000073117815,0.00009597651,0.00014734633,0.00013062368,0.00031309327,0.000053352487,0.0000072903936],"category_scores_gemma":[0.000068622234,0.00008033286,0.000032559466,0.00044103173,0.000021488811,0.00046884676,0.0000853428,0.0000693797,0.00007166009],"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.0000038866597,0.00006371547,0.0028373937,0.00001597636,0.0000027113083,0.0000011450056,0.0002837972,0.052698757,0.022237964,0.8855511,0.00023223698,0.036071334],"study_design_scores_gemma":[0.000101622485,0.000022018296,0.028365916,0.0000075921625,0.0000015563525,0.0000021170908,0.0000237783,0.9256881,0.03693233,0.008443611,0.00029876246,0.00011258987],"about_ca_topic_score_codex":0.00020043708,"about_ca_topic_score_gemma":0.000017859124,"teacher_disagreement_score":0.87710744,"about_ca_system_score_codex":0.000111058085,"about_ca_system_score_gemma":0.000029161232,"threshold_uncertainty_score":0.3275879},"labels":[],"label_agreement":null},{"id":"W2138002452","doi":"10.1109/date.2005.228","title":"On the Design and Verification Methodology of the Look-Aside Interface","year":2005,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; SystemC; Verilog; Programming language; Interface (matter); Model checking; Unified Modeling Language; Design flow; Formal verification; Set (abstract data type); Functional verification; Verification; Formal equivalence checking; Computer architecture; Embedded system; Software; Operating system; Field-programmable gate array; Software development","score_opus":0.08688248799410567,"score_gpt":0.30641684825552146,"score_spread":0.2195343602614158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138002452","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.035806958,0.00013106244,0.96197397,0.0012837456,0.000096353106,0.00038024204,5.5428484e-7,0.0000563281,0.00027077238],"genre_scores_gemma":[0.45565042,0.00005431767,0.5440057,0.00020780507,0.000011492131,0.000015556923,2.0120275e-7,0.000006070338,0.000048424066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742126,0.0017946255,0.00029297915,0.0002357886,0.00013762405,0.00011770999],"domain_scores_gemma":[0.9958179,0.0033571797,0.00019546106,0.00049444713,0.00011203805,0.00002296032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003125377,0.00010329516,0.000113871465,0.00008072392,0.00012070834,0.000060018043,0.00049149286,0.000045007568,0.0000044071553],"category_scores_gemma":[0.0033906382,0.000064188585,0.000012656623,0.00049936253,0.00014310452,0.00028124248,0.00008112817,0.000117266085,0.000009847775],"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.000038162645,0.00018478013,0.0015072234,0.000042140826,0.000016653628,9.406773e-7,0.008227948,0.014832499,0.049715754,0.7659284,0.00087315677,0.15863234],"study_design_scores_gemma":[0.00026356944,0.00019988624,0.12547885,0.000055485525,0.000009185355,0.000029618248,0.00003991373,0.7294047,0.13145216,0.011833558,0.0010843955,0.00014869276],"about_ca_topic_score_codex":0.0000071128843,"about_ca_topic_score_gemma":0.0000016844879,"teacher_disagreement_score":0.75409484,"about_ca_system_score_codex":0.000021182808,"about_ca_system_score_gemma":0.000044536613,"threshold_uncertainty_score":0.40591553},"labels":[],"label_agreement":null},{"id":"W2138089556","doi":"","title":"Value-Directed Compression of POMDPs","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":99,"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":"","keywords":"Computer science; Lossy compression; Lossless compression; Mathematical optimization; Markov decision process; Partially observable Markov decision process; Set (abstract data type); Quality (philosophy); Compression (physics); Value (mathematics); Space (punctuation); Data compression; Artificial intelligence; Machine learning; Mathematics; Markov process; Statistics; Markov chain","score_opus":0.047770203440844886,"score_gpt":0.28043784092141083,"score_spread":0.23266763748056596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138089556","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.009635874,0.00008571764,0.9078125,0.00014661203,0.00028288667,0.00008392399,2.7520412e-7,0.0005824499,0.08136976],"genre_scores_gemma":[0.22230037,0.000009560793,0.77721965,0.000056183588,0.00000912325,0.0000019998683,1.5753706e-7,0.000002135053,0.00040084645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993846,0.00008269708,0.00014738,0.00013155073,0.00016288525,0.00009092475],"domain_scores_gemma":[0.99939054,0.000043942604,0.000063579864,0.00041979607,0.000051054023,0.00003109476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016827723,0.000047208505,0.00007416976,0.000051665946,0.000030359472,0.00001527458,0.00046522365,0.0000311058,0.0001119663],"category_scores_gemma":[0.00004736754,0.00003840641,0.000024159755,0.00026609225,0.000017357226,0.00025564485,0.00009662435,0.000043280103,0.000069294874],"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.0000033246495,0.00030587075,0.00037806685,0.000032148033,0.000013894441,0.0000016484826,0.0016512955,0.00014695863,0.032494146,0.8018678,0.008839662,0.15426518],"study_design_scores_gemma":[0.00010655892,0.000035837857,0.0031205248,0.00000935004,0.0000013770106,0.000003521936,0.0000041326234,0.91187185,0.08063281,0.0010198142,0.0031322942,0.00006194304],"about_ca_topic_score_codex":0.000010511335,"about_ca_topic_score_gemma":1.3033208e-7,"teacher_disagreement_score":0.91172487,"about_ca_system_score_codex":0.000010922108,"about_ca_system_score_gemma":0.0000033362637,"threshold_uncertainty_score":0.15661679},"labels":[],"label_agreement":null},{"id":"W2138106527","doi":"10.1007/11562948_8","title":"An Approach for the Verification of SystemC Designs Using AsmL","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":25,"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":"SystemC; Computer science; Correctness; Programming language; Formal verification; Embedded system; Model checking; Assertion; Functional verification; Software engineering","score_opus":0.09503968511718412,"score_gpt":0.3246511646376925,"score_spread":0.22961147952050837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138106527","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.00003008566,0.00040386905,0.9970069,0.00006530187,0.0008875981,0.0010299006,0.000006013791,0.00007939174,0.0004909594],"genre_scores_gemma":[0.06910066,0.000014666304,0.93024457,0.00014640465,0.00040596156,0.000029613655,0.0000047545104,0.000025001904,0.000028379163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970658,0.00009426633,0.0006234793,0.001069189,0.000744176,0.00040312583],"domain_scores_gemma":[0.99623555,0.00051070395,0.0006014674,0.0021722207,0.00039770684,0.000082349434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029184367,0.00034070428,0.0003980379,0.0004442868,0.0003160464,0.00030379306,0.004313224,0.00027271215,0.0000022324318],"category_scores_gemma":[0.00012965468,0.00026181038,0.00011713682,0.0005361408,0.0006024686,0.00083582225,0.00029719714,0.0003643183,0.000002000707],"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.000010073394,0.00004035143,0.000008713707,0.00011315483,0.000011500156,5.5207784e-7,0.00080052763,0.36041594,0.002655531,0.12055629,0.0000020244363,0.5153853],"study_design_scores_gemma":[0.000115271105,0.000116438714,0.000046627007,0.000109910216,0.00001614504,0.000027316637,7.2169695e-7,0.9829586,0.0068408297,0.00930696,0.00017186215,0.0002893048],"about_ca_topic_score_codex":0.000013658643,"about_ca_topic_score_gemma":0.0000032213156,"teacher_disagreement_score":0.6225427,"about_ca_system_score_codex":0.00030012816,"about_ca_system_score_gemma":0.00043270303,"threshold_uncertainty_score":0.99998343},"labels":[],"label_agreement":null},{"id":"W2139289843","doi":"10.1145/2071368.2071375","title":"Reachability Problems in Piecewise FIFO Systems","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Waterloo; Critical Systems Labs","funders":"","keywords":"FIFO (computing and electronics); Piecewise; Reachability; Computer science; Limit (mathematics); Channel (broadcasting); Set (abstract data type); Regular language; Algorithm; Theoretical computer science; Mathematics; Computer network; Programming language","score_opus":0.07257438177833501,"score_gpt":0.31310532786628825,"score_spread":0.24053094608795322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139289843","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.0070385663,0.00013769558,0.9900279,0.00052972697,0.00086769625,0.00039716845,0.000007885429,0.0001934799,0.000799853],"genre_scores_gemma":[0.62658834,0.0000045954544,0.37310964,0.00011350269,0.000027753995,0.00010003634,0.0000055998803,0.0000056564995,0.000044855664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982716,0.0003084762,0.000394078,0.00033310257,0.00036866593,0.0003241097],"domain_scores_gemma":[0.99856555,0.00047592566,0.00010071095,0.00064841594,0.00010252555,0.00010683822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010810824,0.00015243291,0.00016588497,0.00023095524,0.0001441039,0.00007176816,0.0007039844,0.00009297412,0.00002118551],"category_scores_gemma":[0.00010577663,0.00014535898,0.000064767424,0.0006582757,0.000056529127,0.00087611284,0.000017482433,0.00026360157,0.00015752153],"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.000009068204,0.00066734134,0.001159062,0.00004755289,0.000013212108,8.698838e-7,0.0007718786,0.81111944,0.000048744503,0.14294149,0.000028281982,0.043193087],"study_design_scores_gemma":[0.00074651465,0.00025810092,0.09218491,0.000072167415,0.000011964078,0.0000814675,0.0000950777,0.7790273,0.00019204683,0.12475027,0.002064282,0.0005158937],"about_ca_topic_score_codex":0.00006314841,"about_ca_topic_score_gemma":0.0000045891265,"teacher_disagreement_score":0.6195498,"about_ca_system_score_codex":0.00019770238,"about_ca_system_score_gemma":0.000053201456,"threshold_uncertainty_score":0.5927567},"labels":[],"label_agreement":null},{"id":"W2139324515","doi":"10.1109/tc.2010.84","title":"Generating Reliable Code from Hybrid-Systems Models","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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 Waterloo","funders":"","keywords":"Computer science; Automaton; Code generation; Hybrid system; Code (set theory); Distributed computing; Formalism (music); Set (abstract data type); Programming language; Theoretical computer science","score_opus":0.03588080040127277,"score_gpt":0.2650586328657621,"score_spread":0.2291778324644893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139324515","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.02548334,0.000015805148,0.9623648,0.00013216402,0.010968987,0.00021637726,0.000027808766,0.00048731535,0.00030340918],"genre_scores_gemma":[0.43401796,0.0000063734014,0.5655388,0.00020271582,0.000114814786,0.00003147698,0.0000020198627,0.000014471524,0.000071323644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983421,0.00009749853,0.00036003254,0.00055534596,0.00034049468,0.0003045145],"domain_scores_gemma":[0.99840415,0.00019832389,0.00011857408,0.0010383852,0.00009840796,0.0001421401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003678263,0.00020264609,0.00019867107,0.0001525374,0.00033394236,0.00034347564,0.0009712084,0.00009531915,0.000010711874],"category_scores_gemma":[0.000004785864,0.00021029539,0.0000964748,0.00027497674,0.000049994327,0.0009628983,0.0000059374365,0.00052097475,0.00008766868],"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.000005594651,0.00006997589,0.0000011699221,0.0000047296376,0.00002201907,0.000004510629,0.00024045246,0.93333334,0.010243253,0.0047614793,0.0005254314,0.050788052],"study_design_scores_gemma":[0.00023218639,0.000047978418,0.000004768543,0.00002280227,0.000007659359,0.000021393607,0.000008272971,0.9604964,0.036892302,0.000718019,0.0013262619,0.00022195849],"about_ca_topic_score_codex":0.0002916996,"about_ca_topic_score_gemma":0.00002257986,"teacher_disagreement_score":0.40853462,"about_ca_system_score_codex":0.00005695426,"about_ca_system_score_gemma":0.00006235371,"threshold_uncertainty_score":0.8575597},"labels":[],"label_agreement":null},{"id":"W2139403746","doi":"","title":"Formal probabilistic analysis using theorem proving","year":2008,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Probabilistic logic; Soundness; Computer science; Probabilistic analysis of algorithms; Random variable; Automated theorem proving; Theoretical computer science; Probabilistic CTL; Algorithm; Mathematics; Artificial intelligence; Programming language; Statistics","score_opus":0.047790940781775815,"score_gpt":0.31655871352318027,"score_spread":0.26876777274140445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139403746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7562382,0.0001358002,0.119180344,0.000029340523,0.0012811704,0.0011080671,0.0000069127004,0.00037044942,0.12164969],"genre_scores_gemma":[0.9573227,0.00006660264,0.02089015,0.0000037409359,0.00027233947,0.000008333421,0.00007139417,0.000049516744,0.02131522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942483,0.0013600312,0.0005490557,0.0012527466,0.0014270602,0.00116284],"domain_scores_gemma":[0.9964786,0.0002781552,0.0005013764,0.001736987,0.00067350565,0.0003313475],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0017081356,0.00040264698,0.00062200223,0.0037329944,0.0017601227,0.0004128375,0.0029923443,0.00046329858,0.0000155804],"category_scores_gemma":[0.00032659658,0.000452306,0.0004904141,0.0067858975,0.00033865075,0.0018512569,0.00052098493,0.0014785709,0.000022524948],"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.001517856,0.00085589185,0.056240216,0.00176986,0.004055966,0.0052143643,0.010726525,0.0057747224,0.017769665,0.87968963,0.00033729724,0.016048007],"study_design_scores_gemma":[0.0017848056,0.0015404646,0.19498746,0.000491722,0.002101545,0.00041358397,0.006479768,0.687311,0.08222926,0.007983021,0.010593373,0.004084021],"about_ca_topic_score_codex":0.004301889,"about_ca_topic_score_gemma":0.0025470804,"teacher_disagreement_score":0.8717066,"about_ca_system_score_codex":0.0016879163,"about_ca_system_score_gemma":0.0018011238,"threshold_uncertainty_score":0.9997929},"labels":[],"label_agreement":null},{"id":"W2139426253","doi":"10.1109/acc.2010.5531392","title":"Overapproximating the reachable sets of LTI systems through a similarity transformation","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"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 British Columbia","funders":"","keywords":"Reachability; Reduction (mathematics); Disjoint sets; Computer science; Set (abstract data type); Decomposition; Transformation (genetics); Similarity (geometry); Series (stratigraphy); Algorithm; Computational complexity theory; Controller (irrigation); Linear system; Mathematics; Control theory (sociology); Mathematical optimization; Discrete mathematics; Control (management); Artificial intelligence","score_opus":0.037108821403748174,"score_gpt":0.3048743828217536,"score_spread":0.26776556141800545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139426253","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.038041655,0.000017316626,0.93178755,0.00035134822,0.000537145,0.00030982253,0.0000017009123,0.0001058265,0.028847659],"genre_scores_gemma":[0.5228946,0.000002868738,0.4769785,0.000058788944,0.000015759359,0.000017691957,9.927467e-7,0.0000027308702,0.00002799927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990233,0.00011249924,0.0003138109,0.00014229382,0.00026371662,0.0001443662],"domain_scores_gemma":[0.99899393,0.000101629055,0.000157142,0.0006258573,0.00010113321,0.000020290901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014367612,0.00007684301,0.00010857835,0.00002640903,0.00013340144,0.000094363684,0.00065206364,0.000069240225,0.000007405841],"category_scores_gemma":[0.0000963054,0.00004981244,0.000039947357,0.00026471438,0.000050106988,0.0012499077,0.00005082714,0.00021111238,0.000006601218],"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.0000020384894,0.000024802317,0.00004726711,0.000057722646,0.0000050675635,7.674641e-8,0.004438677,0.00015083284,0.009989366,0.97601634,0.00008469347,0.009183086],"study_design_scores_gemma":[0.00014524304,0.000034562705,0.0007007858,0.000015649717,0.0000040019813,0.000018154193,0.0002737532,0.93955517,0.046018094,0.01048461,0.0026529022,0.000097068936],"about_ca_topic_score_codex":0.00021220552,"about_ca_topic_score_gemma":0.000010062949,"teacher_disagreement_score":0.96553177,"about_ca_system_score_codex":0.000011801461,"about_ca_system_score_gemma":0.000029813144,"threshold_uncertainty_score":0.20312923},"labels":[],"label_agreement":null},{"id":"W2139509158","doi":"10.1016/j.peva.2009.12.008","title":"Symbolic partition refinement with automatic balancing of time and space","year":2010,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Formal Methods in Verification","field":"Computer Science","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":"IBM (Canada)","funders":"","keywords":"Markov chain; Computer science; Partition (number theory); Markov model; Markov process; Preprocessor; State space; Theoretical computer science; Algorithm; Variable-order Markov model; Mathematics; Artificial intelligence; Machine learning","score_opus":0.018084209964057362,"score_gpt":0.2860252269698289,"score_spread":0.26794101700577155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139509158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9466123,0.000012993969,0.05185688,0.00014535346,0.00012628922,0.0002553069,4.0483664e-7,0.000057545258,0.00093295565],"genre_scores_gemma":[0.7679006,0.00000754467,0.23199134,0.000014394409,0.000022243854,0.000037480622,0.0000040981095,0.0000036588888,0.000018665061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902654,0.000063275314,0.00018995162,0.00016845495,0.00043474764,0.000117012794],"domain_scores_gemma":[0.9992433,0.000025336121,0.0001739335,0.0003424428,0.00018344336,0.00003153245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018502965,0.000075368174,0.00009574337,0.00008441463,0.00007639766,0.000033682863,0.000149518,0.0000348148,0.000046868005],"category_scores_gemma":[0.00009453501,0.00006272477,0.000009511238,0.00022985604,0.00004290699,0.00067946175,0.000037963968,0.00008847104,0.000027541519],"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.00002358912,0.00009900237,0.01794327,0.0001987,0.000023712582,2.349061e-7,0.0032492133,0.0031485332,0.22348224,0.013154442,0.00008427589,0.7385928],"study_design_scores_gemma":[0.00021299813,0.00011168941,0.14643155,0.000037554906,0.000012387342,0.0000072099037,0.000005494877,0.80766666,0.045273952,0.00013712668,0.000036619265,0.00006676171],"about_ca_topic_score_codex":0.000006078686,"about_ca_topic_score_gemma":0.000004803537,"teacher_disagreement_score":0.8045181,"about_ca_system_score_codex":0.000028744349,"about_ca_system_score_gemma":0.00006557164,"threshold_uncertainty_score":0.25578418},"labels":[],"label_agreement":null},{"id":"W2139761195","doi":"10.1109/case.1992.200142","title":"Validation of LOTOS specifications using an interpreter: an application to telephone systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Interpreter; Standardization; Computer science; Programming language; Interconnection; Formal specification; Sample (material); Software engineering; Operating system; Telecommunications","score_opus":0.09282684102455753,"score_gpt":0.3375896041814963,"score_spread":0.2447627631569388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139761195","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.1427914,0.000007605889,0.85459256,0.000014210406,0.00024598016,0.00051044923,0.000001969234,0.000120172146,0.001715674],"genre_scores_gemma":[0.5287406,7.3831745e-7,0.47115186,0.0000199966,0.000018694229,0.00003814575,0.000004344329,0.000006140678,0.000019486906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985253,0.00029445306,0.00041177875,0.00038394058,0.00023377968,0.0001507525],"domain_scores_gemma":[0.99820775,0.00003010812,0.00018747311,0.0012231229,0.00023164993,0.000119897304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008700498,0.000103220475,0.00013202168,0.00019581323,0.000080821796,0.0001194175,0.0006437915,0.000057688325,0.000010158587],"category_scores_gemma":[0.00008290495,0.00010437798,0.000024338651,0.000673144,0.000024858688,0.0012461657,0.000040397885,0.000053988028,0.00003249968],"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.000005310863,0.00021090293,0.00036672442,0.000021749818,0.000006397029,1.1091477e-7,0.0013943226,0.019030146,0.45452818,0.51341355,0.000015588199,0.011006997],"study_design_scores_gemma":[0.000083264575,0.00013711043,0.00057949295,0.000013891889,0.000005459744,0.000013808097,0.00023314673,0.5560029,0.4409338,0.00095501984,0.0008721722,0.00016994649],"about_ca_topic_score_codex":0.00009784903,"about_ca_topic_score_gemma":0.00000270722,"teacher_disagreement_score":0.53697276,"about_ca_system_score_codex":0.00009015309,"about_ca_system_score_gemma":0.00004590801,"threshold_uncertainty_score":0.42564106},"labels":[],"label_agreement":null},{"id":"W2139826119","doi":"","title":"Automatic and Verifiable Synthesis of Implementations from Mathematical Models","year":2009,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Soundness; Correctness; Computer science; Verifiable secret sharing; Theoretical computer science; Process calculus; Implementation; Process (computing); Programming language; Formalism (music); Component (thermodynamics); Code (set theory); Software; Class (philosophy); Artificial intelligence; Set (abstract data type)","score_opus":0.03830697770510761,"score_gpt":0.3106066325736349,"score_spread":0.2722996548685273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139826119","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.04563836,0.0000135710425,0.94609606,0.00021972171,0.000019107874,0.00009033783,0.0000033190377,0.00008037488,0.0078391405],"genre_scores_gemma":[0.3874134,0.0000030986484,0.61251074,0.000046536617,0.0000027666244,0.0000064221667,4.20968e-7,0.0000012770489,0.000015342814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936604,0.000042634187,0.00022460974,0.00013488167,0.00013585122,0.00009596002],"domain_scores_gemma":[0.99935555,0.00018360259,0.00006070573,0.00033529237,0.00002681771,0.00003801151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002368238,0.000055620345,0.000115593044,0.000045491302,0.000038213602,0.00004100669,0.00025405537,0.00002318816,0.000106337146],"category_scores_gemma":[0.00007811648,0.00004766375,0.000019031793,0.00012813493,0.000022319116,0.0005288156,0.000042004536,0.000025621364,0.000010609543],"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":[6.0761084e-7,0.00003724274,0.000009498816,0.00000920023,0.000005716885,1.781944e-7,0.00037219177,0.000053455773,0.001519217,0.89493495,0.00007447278,0.10298328],"study_design_scores_gemma":[0.00004175565,0.000018787976,0.0009120095,0.000010296999,0.0000052955097,0.0000012360591,0.00004081229,0.65815246,0.02040248,0.32036924,0.0000058288942,0.000039801867],"about_ca_topic_score_codex":0.000022066619,"about_ca_topic_score_gemma":5.08428e-7,"teacher_disagreement_score":0.658099,"about_ca_system_score_codex":0.000010924016,"about_ca_system_score_gemma":0.00001611869,"threshold_uncertainty_score":0.19436713},"labels":[],"label_agreement":null},{"id":"W2140352245","doi":"10.1109/ccece.2003.1226387","title":"Modeling and verification of an ATM port controller in VIS","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Foundation for Research, Science and Technology","keywords":"Port (circuit theory); Asynchronous Transfer Mode; Computer science; Asynchronous communication; Controller (irrigation); Key (lock); Verilog; Model checking; Process (computing); Embedded system; Computer network; Engineering; Operating system; Electronic engineering; Programming language","score_opus":0.029440351145087494,"score_gpt":0.2984493608000003,"score_spread":0.2690090096549128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140352245","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.3719396,0.000015224888,0.627324,0.000057605077,0.000024628029,0.0000633018,1.1487386e-7,0.000021642758,0.0005538706],"genre_scores_gemma":[0.5638512,0.000005130015,0.43610072,0.000029357785,0.0000035559258,0.0000036811966,3.5731583e-7,0.0000013728165,0.0000046722257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994507,0.000029476269,0.00018701752,0.0001610238,0.00009640745,0.00007536705],"domain_scores_gemma":[0.999652,0.000007691611,0.000037685037,0.00023170575,0.000043337302,0.000027557597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045847704,0.000043400243,0.00008142661,0.000066202556,0.000017426873,0.000019047773,0.00018355554,0.000032377928,0.0000014255247],"category_scores_gemma":[0.000034687317,0.00003977874,0.000009877672,0.0001545339,0.000016541813,0.00055509614,0.000027558106,0.000037958293,0.0000018752902],"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.000023178674,0.00011665734,0.00040035087,0.00001307218,0.000004038441,0.0000010514514,0.0013493164,0.08472082,0.017706957,0.8180504,7.8760206e-7,0.077613406],"study_design_scores_gemma":[0.00042154553,0.000043627733,0.004532351,0.00000584221,8.659868e-7,0.0000030518108,0.0000357381,0.97832644,0.0076819435,0.008892431,0.0000070422184,0.000049108807],"about_ca_topic_score_codex":0.00018064334,"about_ca_topic_score_gemma":0.000013451299,"teacher_disagreement_score":0.89360565,"about_ca_system_score_codex":0.000023193847,"about_ca_system_score_gemma":0.000024199811,"threshold_uncertainty_score":0.162213},"labels":[],"label_agreement":null},{"id":"W2140717390","doi":"10.1109/wcadm.1995.514648","title":"Relative liveness: from intuition to automated verification","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Waterloo","funders":"","keywords":"Liveness; Computer science; Intuition; Automaton; Equivalence (formal languages); Modular design; Theoretical computer science; Programming language; Mathematics; Discrete mathematics; Cognitive science","score_opus":0.04881166251626381,"score_gpt":0.28945762340671694,"score_spread":0.24064596089045312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140717390","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.011865343,0.000024864228,0.97505057,0.00062416994,0.00031789628,0.00018053135,0.0000023881664,0.0012720025,0.010662223],"genre_scores_gemma":[0.38529062,0.000005906593,0.6142017,0.00025860383,0.000025459494,0.000029781488,0.00000514888,0.000004384152,0.0001783352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990404,0.00013068927,0.00019476548,0.00031882638,0.00018252227,0.0001327517],"domain_scores_gemma":[0.99913466,0.00007268176,0.00007031021,0.00055812905,0.00009328438,0.0000709066],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021487525,0.00008497978,0.00008265863,0.00009839235,0.00006929253,0.000088198496,0.00047120795,0.00006330757,0.00020357512],"category_scores_gemma":[0.0001671701,0.00008229739,0.000024374434,0.0005464042,0.000017145012,0.0010543359,0.00008271113,0.00007022826,0.0020812557],"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.000007871359,0.00013071025,0.00013862115,0.0000055119262,0.000019873216,0.0000022303839,0.005334393,0.00042047873,0.024028068,0.79900986,0.0057680015,0.1651344],"study_design_scores_gemma":[0.000116182775,0.000068541674,0.01381675,0.00001568653,0.0000032085982,0.0000015413418,0.000026612852,0.94751287,0.026616378,0.008222919,0.003444299,0.00015500015],"about_ca_topic_score_codex":0.000056856603,"about_ca_topic_score_gemma":0.000002134312,"teacher_disagreement_score":0.9470924,"about_ca_system_score_codex":0.00008683459,"about_ca_system_score_gemma":0.000006958997,"threshold_uncertainty_score":0.99869573},"labels":[],"label_agreement":null},{"id":"W2141327607","doi":"10.1109/qsic.2008.53","title":"A Boundary Checking Technique for Testing Real-Time Systems Modeled as Timed Input Output Automata (Short Paper)","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Automaton; Computer science; Timed automaton; Set (abstract data type); Transition system; Process (computing); Boundary (topology); State (computer science); Finite-state machine; Model checking; Algorithm; Theoretical computer science; Programming language; Mathematics","score_opus":0.07064925849412035,"score_gpt":0.30780910774185394,"score_spread":0.2371598492477336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141327607","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.0081734145,0.000034499513,0.959758,0.00007474482,0.00027829473,0.0015413163,0.000003634274,0.0017168334,0.028419305],"genre_scores_gemma":[0.08532081,0.000013167725,0.9113171,0.00008488391,0.00010511184,0.0006808152,0.000009116154,0.0000348472,0.0024341135],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977372,0.00015624818,0.00058171403,0.0006251445,0.00041643195,0.0004832428],"domain_scores_gemma":[0.9980203,0.0003176979,0.00017330122,0.0010615006,0.00029847535,0.0001287195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016909458,0.00024888891,0.00034999222,0.00017288695,0.00047921026,0.00021850136,0.0011664153,0.00017912214,0.0000050610583],"category_scores_gemma":[0.0006319732,0.00023234506,0.00008709538,0.0005867305,0.000087761626,0.0011858839,0.00030311558,0.00016351261,0.000073454896],"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.000056422647,0.00026128656,0.0003911189,0.00034726757,0.00008575207,0.00004208536,0.0013961998,0.0019286377,0.84348834,0.086526684,0.004303478,0.06117272],"study_design_scores_gemma":[0.00016560678,0.00017281328,0.00039786124,0.00008591946,0.000008201902,0.00022140668,0.000012095013,0.9599035,0.03603615,0.001123895,0.001541852,0.00033069332],"about_ca_topic_score_codex":0.00019029192,"about_ca_topic_score_gemma":3.981671e-7,"teacher_disagreement_score":0.95797485,"about_ca_system_score_codex":0.00017419654,"about_ca_system_score_gemma":0.00033815348,"threshold_uncertainty_score":0.9474756},"labels":[],"label_agreement":null},{"id":"W2141753131","doi":"10.1109/tim.2007.913760","title":"BER Testing of Communication Interfaces","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Instrumentation and Measurement","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Additive white Gaussian noise; Bit error rate; Computer science; Field-programmable gate array; Electronic engineering; Generator (circuit theory); Channel (broadcasting); Computer engineering; Embedded system; Engineering; Telecommunications; Power (physics)","score_opus":0.14309665326016327,"score_gpt":0.2987446164801695,"score_spread":0.1556479632200062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141753131","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.15570185,0.000028170514,0.8428681,0.000100010555,0.0001885461,0.00014496541,0.0000012631342,0.0000528305,0.0009142845],"genre_scores_gemma":[0.7430695,0.0000624098,0.25676966,0.00004611434,0.0000024370015,0.00002435427,2.9015132e-7,0.0000031692418,0.000022064589],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990725,0.000102481106,0.00025266962,0.00014651337,0.0003440433,0.00008182425],"domain_scores_gemma":[0.9993512,0.0000336719,0.00012042014,0.00027665863,0.00018006707,0.000037971116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039361182,0.00007706831,0.0000836155,0.00011013155,0.00020810401,0.000019598438,0.0001825013,0.000028333277,0.000007111994],"category_scores_gemma":[0.000014561589,0.00007676188,0.000020957537,0.00022723926,0.00007513127,0.00039996553,0.0000021993228,0.00008479513,0.000004936541],"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.000051662577,0.0005372919,0.00052092585,0.00005721728,0.00007239085,5.972681e-7,0.0065793497,0.0031794012,0.09031708,0.00584889,0.000085382846,0.8927498],"study_design_scores_gemma":[0.0006380485,0.00028245157,0.0040447926,0.0000870606,0.000013859077,0.000023774375,0.00023962861,0.019072402,0.97495437,0.00028242415,0.00022164939,0.00013951404],"about_ca_topic_score_codex":0.000040846397,"about_ca_topic_score_gemma":0.000008866207,"teacher_disagreement_score":0.8926103,"about_ca_system_score_codex":0.00007269846,"about_ca_system_score_gemma":0.000039394647,"threshold_uncertainty_score":0.31302583},"labels":[],"label_agreement":null},{"id":"W2141781571","doi":"10.1109/iccad.1990.129833","title":"Tautology checking using cross-controllability and cross-observability relations","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Observability; Controllability; Formal equivalence checking; Equivalence relation; Computer science; Binary decision diagram; Tautology (logic); Formal verification; Theoretical computer science; Equivalence (formal languages); Modular design; Algorithm; Mathematics; Programming language; Discrete mathematics; Applied mathematics","score_opus":0.10348490166497228,"score_gpt":0.3671955910447949,"score_spread":0.2637106893798226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141781571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52723795,0.0000725304,0.46884707,0.00014727071,0.00019804132,0.00012348474,8.074685e-7,0.00014063666,0.0032322167],"genre_scores_gemma":[0.56441045,0.0000015607965,0.43528998,0.00007443615,0.000017730654,0.000005490633,2.1384984e-7,0.0000033262643,0.0001968276],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984946,0.00018419218,0.00039344653,0.000504108,0.0001542283,0.0002694053],"domain_scores_gemma":[0.99857944,0.00022069513,0.000119692835,0.0008196903,0.00018182273,0.00007866163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012405345,0.00011928647,0.0001763023,0.000051247207,0.00035513513,0.0003224437,0.0004179441,0.00012862276,0.00020161527],"category_scores_gemma":[0.000979356,0.00011240446,0.00004847094,0.00033587092,0.0003437031,0.0014159291,0.00022719397,0.00016128551,0.00003198592],"study_design_candidate":"observational","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.000007550162,0.00009272978,0.7931775,0.00002560817,0.000011343681,0.0000014815391,0.0006429107,0.0019035408,0.0020211705,0.18252197,0.000019969397,0.01957422],"study_design_scores_gemma":[0.00020359184,0.000016276339,0.3645268,0.0000018940866,0.0000023471712,0.000014549664,0.0000035203623,0.62712795,0.0006658403,0.007066746,0.00027880448,0.00009169872],"about_ca_topic_score_codex":0.00006636199,"about_ca_topic_score_gemma":0.0000065437293,"teacher_disagreement_score":0.6252244,"about_ca_system_score_codex":0.00010089434,"about_ca_system_score_gemma":0.000021272104,"threshold_uncertainty_score":0.4583721},"labels":[],"label_agreement":null},{"id":"W2142455750","doi":"10.1109/cdc.2009.5400336","title":"Schur-based decomposition for reachability analysis of linear time-invariant systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"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 British Columbia","funders":"","keywords":"Reachability; Reduction (mathematics); Linear system; Decomposition; Computer science; Invariant (physics); Computational complexity theory; LTI system theory; Set (abstract data type); Algorithm; Variety (cybernetics); Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.02820843780917342,"score_gpt":0.33845604286770514,"score_spread":0.3102476050585317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142455750","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.016755389,0.000011579264,0.98152655,0.0002471036,0.00008466111,0.00031981076,0.000008599906,0.00010016111,0.0009461276],"genre_scores_gemma":[0.3664517,2.4314906e-7,0.63338614,0.00007018127,0.000013632212,0.000010951738,0.000016995631,0.0000017152016,0.000048429254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868596,0.0002030102,0.00045955868,0.00029942003,0.00021728699,0.00013476395],"domain_scores_gemma":[0.9984249,0.00020542544,0.00021470936,0.00084284117,0.00026364613,0.000048485574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020088498,0.00008524337,0.0002817691,0.00026124853,0.00006411316,0.00004498686,0.00046078648,0.00006278009,0.0000107245805],"category_scores_gemma":[0.0001834655,0.00007253533,0.00017108783,0.0009831297,0.000021300213,0.00025360237,0.000018544544,0.00004074961,0.000008809449],"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.00012961918,0.00075674074,0.0007354899,0.0001086601,0.00034475807,8.7592866e-7,0.0002839045,0.108566195,0.09286286,0.75560343,0.00034278244,0.04026467],"study_design_scores_gemma":[0.0001414681,0.00019557445,0.006377005,0.0000069889998,0.000084515406,4.349548e-7,0.0000034987486,0.96994716,0.022550143,0.00049622863,0.00011795511,0.00007905679],"about_ca_topic_score_codex":0.00004439807,"about_ca_topic_score_gemma":0.0000013214265,"teacher_disagreement_score":0.86138093,"about_ca_system_score_codex":0.00005407197,"about_ca_system_score_gemma":0.00004068706,"threshold_uncertainty_score":0.2957905},"labels":[],"label_agreement":null},{"id":"W2142595764","doi":"10.1109/glocom.1990.116809","title":"An execution model for LOTOS specifications","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Programming language; Tree (set theory); Process (computing); Branching (polymer chemistry); Theoretical computer science; Execution model; Formal specification; Control (management); Process calculus; Artificial intelligence; Mathematics","score_opus":0.23779235459725087,"score_gpt":0.3368709806248273,"score_spread":0.09907862602757642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142595764","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.0005136052,0.000011539621,0.98869514,0.00040693683,0.00011482331,0.00025156327,0.0000021182584,0.00024633488,0.009757936],"genre_scores_gemma":[0.20676087,0.0000067456112,0.7914819,0.00014195802,0.000033174623,0.000076338285,0.000002427354,0.0000041448584,0.0014924328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993783,0.000024818233,0.00013727175,0.0002275365,0.000101550875,0.00013048653],"domain_scores_gemma":[0.99914634,0.000021876094,0.000041986834,0.0006545799,0.00008067291,0.000054512253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021805808,0.000056492165,0.000049315182,0.000056944216,0.00011265336,0.00007976508,0.00053618447,0.000036282665,0.000032011583],"category_scores_gemma":[0.00003226575,0.000053884196,0.000028346394,0.00016691866,0.000018746192,0.0008648545,0.000020747728,0.000033918248,0.00008316816],"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":[8.274324e-7,0.000067263696,0.0000052050154,0.0000022909505,0.0000011054447,3.1199427e-8,0.00038794836,0.0028533598,0.0029853468,0.95643425,0.0018113789,0.03545099],"study_design_scores_gemma":[0.000077518795,0.000034127253,0.00013319583,9.419151e-7,0.0000013598979,0.0000015951414,0.000010701525,0.9800237,0.0046162955,0.01291475,0.0021092107,0.000076597404],"about_ca_topic_score_codex":0.0000017403792,"about_ca_topic_score_gemma":0.000001185772,"teacher_disagreement_score":0.97717035,"about_ca_system_score_codex":0.000029883106,"about_ca_system_score_gemma":0.0000072836224,"threshold_uncertainty_score":0.21973337},"labels":[],"label_agreement":null},{"id":"W2143208164","doi":"10.1145/1278480.1278498","title":"An effective guidance strategy for abstraction-guided simulation","year":2007,"lang":"en","type":"article","venue":"Proceedings - ACM IEEE Design Automation Conference","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":46,"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 British Columbia","funders":"","keywords":"Computer science; Assertion; Abstraction; Formal verification; Model checking; Functional verification; State (computer science); Formal methods; Theoretical computer science; Distributed computing; Computer engineering; Programming language","score_opus":0.1434452489782713,"score_gpt":0.40355069288561124,"score_spread":0.2601054439073399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143208164","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.031679373,0.0000097061575,0.964296,0.0000732161,0.0004971158,0.0016398812,0.0000027698097,0.00090369454,0.000898264],"genre_scores_gemma":[0.53989875,0.0000015019692,0.45975122,0.000051139534,0.000096496995,0.00016558249,0.0000038429293,0.000012561875,0.00001889991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977306,0.00006227534,0.00064757135,0.0006769396,0.00044725736,0.00043535448],"domain_scores_gemma":[0.99632674,0.00071994547,0.00062855845,0.00048164692,0.0016873152,0.00015577632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036576001,0.00026444107,0.00022754754,0.00027672565,0.00031566265,0.0005956835,0.0012578017,0.00020173658,0.000010361252],"category_scores_gemma":[0.0016639788,0.0002812161,0.00005923098,0.00059699896,0.000061419305,0.0041686594,0.000040332507,0.0001768559,0.000037773134],"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.0001576915,0.00020451026,0.0003038996,0.00022023534,0.000035019806,0.0000012954002,0.0027532286,0.059735063,0.28585416,0.24325892,0.00044258576,0.40703338],"study_design_scores_gemma":[0.00032444324,0.00028538142,0.016062815,0.000036907073,0.000009842443,0.000008190696,0.000061005165,0.7670881,0.19225408,0.023500144,0.00010648601,0.00026258756],"about_ca_topic_score_codex":0.000009020648,"about_ca_topic_score_gemma":0.0000011628177,"teacher_disagreement_score":0.70735306,"about_ca_system_score_codex":0.00021146488,"about_ca_system_score_gemma":0.000118742835,"threshold_uncertainty_score":0.999964},"labels":[],"label_agreement":null},{"id":"W2143388350","doi":"10.5555/996070.1009884","title":"Efficient Generation of Monitor Circuits for GSTE Assertion Graphs","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":21,"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 British Columbia","funders":"","keywords":"Computer science; Assertion; Formal verification; Scalability; Overhead (engineering); Automaton; Programming language; Abstraction; Correctness; Theoretical computer science; Electronic circuit; Computer engineering","score_opus":0.07348915379278435,"score_gpt":0.3162174707600432,"score_spread":0.24272831696725883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143388350","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.14820841,0.000025235098,0.8494194,0.000021510967,0.0006081472,0.00023502021,6.236369e-7,0.000046830086,0.0014348138],"genre_scores_gemma":[0.5515278,0.0000010807744,0.448353,0.000019691224,0.000012548392,0.00002610328,9.686842e-7,0.0000025615236,0.00005624392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992472,0.000081893406,0.00021043277,0.00018573388,0.00015834438,0.000116401636],"domain_scores_gemma":[0.99934953,0.000039054416,0.00009930252,0.00031466817,0.00016713902,0.000030285026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006487099,0.000060419057,0.00007538566,0.00008421225,0.000063177205,0.000030788186,0.00019894438,0.00004290849,0.000003993935],"category_scores_gemma":[0.00016589649,0.000055179178,0.000046504054,0.0002673077,0.0000144226615,0.00013042004,0.000012155318,0.000026684815,0.000004875353],"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":[9.5603e-7,0.000049887836,0.00008439746,0.000012768762,0.000003887041,4.086847e-8,0.00012037945,0.0027703615,0.12676641,0.8487905,0.000076546225,0.021323852],"study_design_scores_gemma":[0.00013738757,0.00006481967,0.00090628024,0.0000031183984,0.0000027868718,0.0000014253845,0.000010054636,0.49345523,0.50304663,0.0020797634,0.00023015418,0.0000623395],"about_ca_topic_score_codex":0.0000030480371,"about_ca_topic_score_gemma":7.0654374e-7,"teacher_disagreement_score":0.84671074,"about_ca_system_score_codex":0.000024648582,"about_ca_system_score_gemma":0.000024784771,"threshold_uncertainty_score":0.22501415},"labels":[],"label_agreement":null},{"id":"W2143473941","doi":"10.1145/2789208","title":"Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata","year":2015,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Royal Society of Canada; National Science Foundation","keywords":"Mathematics; Monotone polygon; Upper and lower bounds; Combinatorics; Rounding; Discrete mathematics; Rate of convergence; Function (biology); Newton's method; Probabilistic logic; Markov chain; Context (archaeology); Applied mathematics; Computer science; Nonlinear system","score_opus":0.09159530198170775,"score_gpt":0.34461930435817323,"score_spread":0.2530240023764655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143473941","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.10691053,0.00015760821,0.88870364,0.002606126,0.0009576111,0.00041782606,0.000007431855,0.00002020773,0.00021903672],"genre_scores_gemma":[0.13697718,0.0000038170456,0.862493,0.00010344548,0.00015224077,0.000008451542,1.7390629e-7,0.000011602154,0.0002501037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858135,0.0002056093,0.00051167095,0.00014630496,0.00040000264,0.00015505361],"domain_scores_gemma":[0.9975663,0.0002278343,0.0007222104,0.0010891944,0.00031261088,0.000081840044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003377798,0.000106218,0.00029253023,0.00010108271,0.000064420514,0.00011960034,0.0019863793,0.00006766677,4.758036e-7],"category_scores_gemma":[0.0024109185,0.00007059712,0.000095629,0.00011911796,0.000047419388,0.0005000293,0.00047021027,0.00015775672,0.0000014390556],"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.003454219,0.0015820733,0.0010035046,0.001309439,0.0009161289,0.000007866576,0.021208962,0.43789715,0.1409991,0.25580564,0.09014291,0.045673035],"study_design_scores_gemma":[0.0006877196,0.0002831919,0.0003814858,0.00014906496,0.000039895556,0.000084244384,0.000026520462,0.97518784,0.004774246,0.017594578,0.00070264237,0.00008859651],"about_ca_topic_score_codex":0.000011519993,"about_ca_topic_score_gemma":2.1682207e-7,"teacher_disagreement_score":0.5372907,"about_ca_system_score_codex":0.00015744062,"about_ca_system_score_gemma":0.00022099743,"threshold_uncertainty_score":0.36912197},"labels":[],"label_agreement":null},{"id":"W2143813917","doi":"10.1109/tencon.1994.369159","title":"Formal specification techniques for complex software systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Manitoba; Brock University; Concordia University","funders":"","keywords":"Computer science; Dependability; Formal specification; Software engineering; Software requirements specification; Formal methods; Software system; Programming language; Formal verification; Software development; Software; Software construction","score_opus":0.12960562566924064,"score_gpt":0.31417845888366774,"score_spread":0.1845728332144271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143813917","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.000053527652,0.000051505205,0.9872903,0.0002050763,0.00027971913,0.00058070174,0.0000034992527,0.0008368294,0.010698827],"genre_scores_gemma":[0.038427435,0.0000125014885,0.96005046,0.00011675153,0.000105463696,0.00019960404,0.0000060526536,0.00000834798,0.0010733568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906653,0.000040626834,0.0002566558,0.00024131578,0.0001662568,0.00022860027],"domain_scores_gemma":[0.99906284,0.00007112653,0.00010576384,0.00057244056,0.00014112095,0.0000467058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004538576,0.00009217916,0.000106487205,0.00008561483,0.00014589533,0.00015692362,0.000661482,0.00005955551,0.00003560413],"category_scores_gemma":[0.000082973354,0.000082716586,0.000044933284,0.00020594074,0.000026169373,0.001008737,0.00007266611,0.000049328788,0.000076604374],"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.0000022129125,0.00003836104,0.000038631337,0.000038174385,0.00000389806,1.814142e-7,0.00014161105,0.00001531319,0.001289997,0.74688095,0.013047474,0.23850322],"study_design_scores_gemma":[0.00012965398,0.00011625579,0.00070178893,0.000011284047,0.0000027310637,0.00001896224,0.000028285798,0.7915326,0.010577467,0.0019021055,0.19478136,0.0001975122],"about_ca_topic_score_codex":0.0000062579047,"about_ca_topic_score_gemma":4.362725e-7,"teacher_disagreement_score":0.79151726,"about_ca_system_score_codex":0.000054157717,"about_ca_system_score_gemma":0.000005450297,"threshold_uncertainty_score":0.33730844},"labels":[],"label_agreement":null},{"id":"W2145158997","doi":"10.4204/eptcs.14.6","title":"An Efficient Explicit-time Description Method for Timed Model Checking","year":2009,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; Atlantic Canada Opportunities Agency","keywords":"Model checking; Process (computing); Rendezvous; Synchronization (alternating current); Modularity (biology); Automaton; State (computer science); Variable (mathematics); Semaphore","score_opus":0.013223714116252217,"score_gpt":0.3050697146368014,"score_spread":0.29184600052054915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145158997","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.03762836,0.000024534733,0.95986855,0.000469519,0.00014044793,0.0006267653,4.5754425e-7,0.00034222967,0.00089916046],"genre_scores_gemma":[0.48809147,0.0000014199644,0.51152414,0.0002840556,0.000052720323,0.000034669287,5.016699e-7,0.00000741167,0.000003636212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960464,0.000059186536,0.00048769696,0.0012871445,0.00073349447,0.0013860485],"domain_scores_gemma":[0.9985925,0.00009858051,0.00016526529,0.0005289553,0.00037938662,0.00023532298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007441346,0.00028188346,0.00030686412,0.00047550764,0.00040380558,0.00067283044,0.0032330004,0.000119407596,0.0000032999578],"category_scores_gemma":[0.0003032305,0.00026490507,0.00007928073,0.0019286852,0.00038371346,0.0018313074,0.00023984809,0.00039495222,0.000009578302],"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.000028023802,0.00012584927,0.0000020389418,0.000006024149,0.0000012877167,2.5479582e-7,0.00069344195,0.009448635,0.04874284,0.8851853,0.000009095104,0.05575719],"study_design_scores_gemma":[0.0002363388,0.00068393507,0.00007209963,0.000022209564,0.0000031965137,0.000018101691,0.0000050558247,0.66764235,0.037316762,0.29376492,0.000009954147,0.00022510941],"about_ca_topic_score_codex":7.883182e-7,"about_ca_topic_score_gemma":8.769245e-8,"teacher_disagreement_score":0.6581937,"about_ca_system_score_codex":0.0006106552,"about_ca_system_score_gemma":0.00029565563,"threshold_uncertainty_score":0.99998033},"labels":[],"label_agreement":null},{"id":"W2145554021","doi":"10.1109/wccit.2013.6618673","title":"Cone of influence and constants propgation reduction techniques for MDG model checker","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Model checking; Reduction (mathematics); Computer science; Abstraction model checking; Process (computing); Reduction strategy; Theoretical computer science; Constant (computer programming); State (computer science); Algorithm; Formal verification; Programming language; Mathematics","score_opus":0.029580769292974728,"score_gpt":0.29978598978718446,"score_spread":0.27020522049420975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145554021","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.1314383,0.000009197024,0.8668869,0.00010185102,0.000027173257,0.0005630976,7.768921e-7,0.00008916117,0.0008835395],"genre_scores_gemma":[0.41399497,0.00000590827,0.58581185,0.000022750844,0.000003848152,0.00008770344,4.12665e-7,0.0000018129721,0.000070705195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947816,0.000019272456,0.00018034274,0.00015466414,0.000087783796,0.000079770616],"domain_scores_gemma":[0.99933714,0.000011696223,0.00010484688,0.00020695341,0.00031559638,0.000023744518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002894412,0.00005167222,0.00007368486,0.0000520492,0.00003573478,0.00003884615,0.00014344438,0.000045026387,0.000002262045],"category_scores_gemma":[0.0000895217,0.000044125125,0.0000110427645,0.0001059249,0.000095520314,0.0011691075,0.00004176796,0.000030022215,0.000001784669],"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.000005619544,0.000022449796,0.00008019218,0.00004751491,0.0000035680303,1.1842329e-8,0.0003254097,0.00011728826,0.32286057,0.6011088,0.00016422606,0.0752644],"study_design_scores_gemma":[0.00005648288,0.00004260233,0.0005289178,0.000010215414,0.000001330856,0.0000031306122,0.000014476403,0.5419781,0.43646726,0.020830568,0.0000216625,0.000045226217],"about_ca_topic_score_codex":0.00002361092,"about_ca_topic_score_gemma":2.2598729e-7,"teacher_disagreement_score":0.5802782,"about_ca_system_score_codex":0.000015218912,"about_ca_system_score_gemma":0.000028948825,"threshold_uncertainty_score":0.17993705},"labels":[],"label_agreement":null},{"id":"W2145660755","doi":"10.1109/icwe.2008.38","title":"Specification Patterns for Formal Web Verification","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal; Université de Montréal","funders":"","keywords":"Computer science; Web modeling; Task (project management); Software engineering; Formal specification; Process (computing); Field (mathematics); Set (abstract data type); Web application; Web service; World Wide Web; Programming language; Systems engineering; Engineering","score_opus":0.07313836402409415,"score_gpt":0.295369087230036,"score_spread":0.22223072320594187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145660755","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.023201976,0.00001263624,0.96916026,0.00026968654,0.0004560877,0.0003541105,0.000004531702,0.00027946482,0.0062612346],"genre_scores_gemma":[0.470784,0.00003218621,0.5285382,0.000107369466,0.000075463955,0.00009042556,0.000013197401,0.0000059822223,0.00035311648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897027,0.000037982154,0.00026083077,0.00030314457,0.00018965037,0.00023810929],"domain_scores_gemma":[0.99894804,0.000050836858,0.00011270024,0.00069027033,0.00014092078,0.000057257257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041793197,0.00009594315,0.000088974026,0.00009263857,0.00023108274,0.0000472865,0.0006374076,0.00005944173,0.000026218559],"category_scores_gemma":[0.000070467664,0.000091323804,0.000057089026,0.00022080183,0.000029594918,0.0013499261,0.00005616412,0.000057211386,0.00009841042],"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.00001674519,0.00008230115,0.0011274498,0.000021828591,0.0000069602675,6.3406486e-7,0.00056094356,0.000033660395,0.011382329,0.89021456,0.0020934623,0.09445913],"study_design_scores_gemma":[0.00085234444,0.00023129053,0.12217949,0.000010779256,0.0000067597553,0.00008456927,0.0000738432,0.64118034,0.13891323,0.0035409941,0.09242413,0.0005022135],"about_ca_topic_score_codex":0.0000048320617,"about_ca_topic_score_gemma":0.0000016104296,"teacher_disagreement_score":0.88667357,"about_ca_system_score_codex":0.00005451192,"about_ca_system_score_gemma":0.00005264986,"threshold_uncertainty_score":0.37240767},"labels":[],"label_agreement":null},{"id":"W2145729425","doi":"10.1109/acc.2009.5160605","title":"Fault-tolerant controller synthesis for piecewise-affine systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Control theory (sociology); Linear-quadratic regulator; Controller (irrigation); Piecewise; Fault tolerance; Quadratic equation; Upper and lower bounds; Affine transformation; Mobile robot; Fault (geology); Computer science; Piecewise linear function; Optimal control; Control engineering; Mathematics; Engineering; Control (management); Mathematical optimization; Robot; Artificial intelligence","score_opus":0.02757862762708487,"score_gpt":0.28702023757057,"score_spread":0.25944160994348514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145729425","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.00079156674,0.00013406386,0.9872366,0.0010569019,0.0004834497,0.0005625151,0.0000028331292,0.00030757344,0.009424486],"genre_scores_gemma":[0.4480853,0.00000527394,0.5499787,0.0003903627,0.0001008336,0.00011973578,5.731872e-7,0.0000056137287,0.0013136131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882585,0.00007974832,0.00030950684,0.00031231204,0.00020181658,0.00027074997],"domain_scores_gemma":[0.99892706,0.00026531334,0.00010097475,0.00049701845,0.00013634519,0.00007326526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075615937,0.00012649213,0.00023993339,0.000081359794,0.000108728775,0.00018595399,0.00070107245,0.00006882647,0.000010356597],"category_scores_gemma":[0.00029788,0.00009955605,0.00008226488,0.00019818492,0.00001645207,0.0004078837,0.000028683331,0.000052707626,0.000054255524],"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.000032019754,0.000077672514,0.0000054515453,0.000018131588,0.000016319615,9.240745e-7,0.000110547735,0.0009957553,0.0051761437,0.7565656,0.0028851838,0.23411626],"study_design_scores_gemma":[0.00047592397,0.00013330484,0.0004870575,0.00002172418,0.0000096699405,0.000010704544,0.000022054193,0.97076046,0.010000093,0.0018369382,0.016056327,0.0001857486],"about_ca_topic_score_codex":0.000013914181,"about_ca_topic_score_gemma":6.0323543e-7,"teacher_disagreement_score":0.9697647,"about_ca_system_score_codex":0.000042922347,"about_ca_system_score_gemma":0.000023594925,"threshold_uncertainty_score":0.4059778},"labels":[],"label_agreement":null},{"id":"W2146041937","doi":"10.1109/mmse.2003.1254438","title":"A component-based design of a fault-tolerant multimedia communication protocol","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Dependability; Correctness; Computer science; Protocol (science); Component (thermodynamics); Fault tolerance; Communications protocol; Distributed computing; Embedded system; Computer network; Programming language; Software engineering","score_opus":0.06566225526966574,"score_gpt":0.3337073135060176,"score_spread":0.2680450582363519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146041937","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.00015761657,0.000004708859,0.97294444,0.000075581345,0.000037056063,0.024981895,4.1206678e-7,0.000114737086,0.0016835661],"genre_scores_gemma":[0.037946243,3.5021267e-7,0.9374316,0.00009617321,0.0000022295274,0.024487447,0.0000011020826,0.0000059921144,0.000028874087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831134,0.00076357345,0.00034241352,0.00018805815,0.00024425663,0.0001503449],"domain_scores_gemma":[0.99829847,0.00023386367,0.00019382064,0.0010730523,0.00014871369,0.000052087446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001275306,0.00009884995,0.00013978055,0.000090061425,0.00006892713,0.000035290446,0.00082765456,0.00005370155,0.00003411962],"category_scores_gemma":[0.00021239748,0.000085264415,0.0000383551,0.00032295915,0.00007644232,0.00028095694,0.00005211181,0.00009193108,0.000028172075],"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.0002326289,0.0023790537,0.0007055369,0.00032018832,0.000052856194,0.000003894092,0.0031832226,0.05827567,0.09340415,0.71223354,0.0014427103,0.12776652],"study_design_scores_gemma":[0.00072091166,0.000078931604,0.00030005004,0.000022960183,0.0000017889677,0.0000022265533,0.000013499724,0.86306286,0.13298705,0.0006306382,0.002081745,0.00009733274],"about_ca_topic_score_codex":0.00001916244,"about_ca_topic_score_gemma":9.3625044e-7,"teacher_disagreement_score":0.8047872,"about_ca_system_score_codex":0.00003437922,"about_ca_system_score_gemma":0.000098892764,"threshold_uncertainty_score":0.3476982},"labels":[],"label_agreement":null},{"id":"W2146165236","doi":"10.1109/cmpsac.1993.404207","title":"Entity behaviour descriptions-A specification model for communicating entities","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Semantics (computer science); Traceability; Set (abstract data type); Process (computing); Programming language; Component (thermodynamics); Software engineering; Behavioral modeling; Formal specification; Artificial intelligence","score_opus":0.21589771052783385,"score_gpt":0.320190001317028,"score_spread":0.10429229078919416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146165236","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.0038376327,0.0000865592,0.9861312,0.00035952692,0.00018821156,0.00026675907,0.0000031890033,0.00025323054,0.008873707],"genre_scores_gemma":[0.34301344,0.000038631995,0.6540179,0.00007324645,0.00001583745,0.000081122394,0.000004145832,0.0000053634762,0.0027502766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991075,0.000064724576,0.00026534413,0.00022584495,0.0001562734,0.00018035849],"domain_scores_gemma":[0.9987927,0.000055908164,0.00011224308,0.000849963,0.00014542224,0.000043730794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005027102,0.00008666973,0.000087841254,0.00008432636,0.00029637702,0.00019663801,0.00091573666,0.000049472583,0.000046297268],"category_scores_gemma":[0.00009709564,0.000090105845,0.0000620836,0.00017951975,0.000048661364,0.0010503376,0.00014902088,0.00008866257,0.00006195588],"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.0000011731576,0.00012186176,0.00046717146,0.000012170562,0.000004426371,5.748479e-8,0.001286441,0.00031472056,0.0013448851,0.96223015,0.0025634367,0.031653535],"study_design_scores_gemma":[0.00010544205,0.000016091843,0.00079214637,0.0000053046033,0.0000047525327,0.0000022579766,0.000057999543,0.9885442,0.0021936467,0.007252126,0.0009157074,0.00011029347],"about_ca_topic_score_codex":0.000017398446,"about_ca_topic_score_gemma":0.000008846818,"teacher_disagreement_score":0.9882295,"about_ca_system_score_codex":0.00006884136,"about_ca_system_score_gemma":0.000008997884,"threshold_uncertainty_score":0.36744097},"labels":[],"label_agreement":null},{"id":"W2146225612","doi":"10.1145/764808.764832","title":"Language emptiness checking using MDGs","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Model checking; Computer science; Automaton; Emptiness; Formal equivalence checking; Formal verification; Theoretical computer science; Programming language; Equivalence (formal languages); Algorithm; Mathematics; Discrete mathematics","score_opus":0.05497015897849935,"score_gpt":0.342186102579402,"score_spread":0.2872159436009027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146225612","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.09745178,0.000041814405,0.8812405,0.000014682001,0.0003979807,0.00004282854,6.171592e-8,0.000126383,0.020683967],"genre_scores_gemma":[0.26260933,5.791335e-7,0.7369723,0.00010915998,0.000020574917,0.0000014861146,1.1271995e-7,0.0000034592758,0.00028300637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993974,0.00007243195,0.00011117345,0.00016030092,0.00011520828,0.00014350213],"domain_scores_gemma":[0.99949074,0.000019432724,0.000042331223,0.00036824757,0.00004790101,0.000031371463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049003994,0.000056854387,0.00005804623,0.00004636208,0.0000625203,0.000072463445,0.0003118928,0.000028386778,0.000038531296],"category_scores_gemma":[0.0002193853,0.00005060358,0.000020328509,0.0002883007,0.000013211393,0.00040229806,0.000050009614,0.000051731797,0.00003397822],"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":[8.1505283e-7,0.000027234666,0.0011349571,0.00001330485,0.0000048378643,0.000005794479,0.0017804453,0.00023790821,0.027952699,0.9318115,0.000067029956,0.03696349],"study_design_scores_gemma":[0.000321269,0.00002641392,0.003898588,0.000025208665,0.0000056954573,0.00008488715,0.00041854632,0.45355323,0.53073806,0.0034746912,0.0070141233,0.0004392969],"about_ca_topic_score_codex":0.000020407424,"about_ca_topic_score_gemma":8.6411586e-7,"teacher_disagreement_score":0.9283368,"about_ca_system_score_codex":0.000026337386,"about_ca_system_score_gemma":0.000024004928,"threshold_uncertainty_score":0.20635541},"labels":[],"label_agreement":null},{"id":"W2146269846","doi":"10.1109/cdc.2007.4434805","title":"Reachability and control of affine hypersurface systems on polytopes","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"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":"","keywords":"Reachability; Polytope; Hypersurface; Affine transformation; Mathematics; Polytope model; Piecewise; Set (abstract data type); Characterization (materials science); Mathematical optimization; State (computer science); Computer science; Discrete mathematics; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.017439384420546624,"score_gpt":0.27304329862829035,"score_spread":0.25560391420774375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146269846","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.13091987,0.000100929145,0.8577671,0.00012989138,0.00018747277,0.00014833962,8.701291e-7,0.000057213198,0.01068834],"genre_scores_gemma":[0.8133685,0.0000023118773,0.18637829,0.00004689373,0.000012935265,0.000001403436,9.0301995e-8,0.0000018418261,0.00018775978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929845,0.00006978715,0.00019493962,0.00017442736,0.00014819816,0.00011418268],"domain_scores_gemma":[0.9992138,0.00022499912,0.00006945367,0.00039220077,0.000056306606,0.000043245054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017328605,0.000057725014,0.00011888734,0.00004347548,0.000026141579,0.0000208264,0.00022415804,0.000037091395,0.0000026078753],"category_scores_gemma":[0.00015225174,0.000044942546,0.000015926358,0.00012585004,0.000048670743,0.0001516404,0.00003537502,0.000047865866,0.000004549857],"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.0000668085,0.000098621305,0.004405346,0.000053792184,0.000012247036,0.0000010824186,0.000348172,0.000164964,0.037634004,0.8637675,0.000039065344,0.093408376],"study_design_scores_gemma":[0.0024765655,0.0015670686,0.26574117,0.000089337154,0.000019380881,0.000046368103,0.00050200714,0.4075338,0.31116992,0.001701274,0.008554689,0.0005984057],"about_ca_topic_score_codex":0.00012793753,"about_ca_topic_score_gemma":0.000003440954,"teacher_disagreement_score":0.86206627,"about_ca_system_score_codex":0.000019821737,"about_ca_system_score_gemma":0.0000092265145,"threshold_uncertainty_score":0.18327038},"labels":[],"label_agreement":null},{"id":"W2146404976","doi":"10.1109/wpc.1993.263910","title":"A process algebra based program and system representation for reverse engineering","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Computer Research Institute of Montréal","funders":"","keywords":"Process calculus; Representation (politics); Computer science; Reverse engineering; Process (computing); Programming language; Code (set theory); Theoretical computer science; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.042129018359934156,"score_gpt":0.3069697558434208,"score_spread":0.26484073748348663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146404976","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.0062721707,0.000020044376,0.99174744,0.00012833098,0.00010984656,0.0006265027,5.2886855e-7,0.0005022087,0.0005929456],"genre_scores_gemma":[0.2421165,6.6128916e-7,0.7575098,0.000030025374,0.000017311211,0.00026431726,8.9619624e-7,0.0000043837795,0.000056075212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943775,0.000018075554,0.0001230658,0.00020748514,0.00009992714,0.00011367205],"domain_scores_gemma":[0.99957395,0.000046785142,0.00004413206,0.00023192452,0.00006421982,0.00003898357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021930948,0.000058550406,0.000065349894,0.000055792294,0.000043791682,0.00008056561,0.0001689737,0.00002961217,0.0000025782122],"category_scores_gemma":[0.00010491038,0.00005402642,0.000018000406,0.00022839844,0.000008459263,0.00041580308,0.000018617795,0.000029374156,0.0000039571714],"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.000017207212,0.00018341889,0.00061847805,0.0015343697,0.000023839684,0.000004557969,0.0016206512,0.0033996091,0.0023167727,0.4249455,0.0010090829,0.5643265],"study_design_scores_gemma":[0.00018562944,0.000056550085,0.00027685653,0.00002419815,0.0000028140128,0.000005455135,0.00003706089,0.9933266,0.0053709988,0.00004642675,0.0005971325,0.00007024601],"about_ca_topic_score_codex":0.0000028446786,"about_ca_topic_score_gemma":1.8095143e-7,"teacher_disagreement_score":0.989927,"about_ca_system_score_codex":0.000021666741,"about_ca_system_score_gemma":0.000005135124,"threshold_uncertainty_score":0.22031334},"labels":[],"label_agreement":null},{"id":"W2146504260","doi":"10.1109/imtc.1994.352097","title":"Software design of sensor-based robot skills","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Ottawa; National Research Council Canada","funders":"","keywords":"Robot; Computer science; Software; Human–computer interaction; Software design; Control engineering; Robot control; Artificial intelligence; Mobile robot; Programming language; Software development; Engineering","score_opus":0.05955731255873302,"score_gpt":0.2744259833520842,"score_spread":0.21486867079335115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146504260","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.00024073907,0.000023290013,0.9980553,0.00012835993,0.0001288432,0.00010903521,4.0860903e-7,0.00017613899,0.0011378909],"genre_scores_gemma":[0.031161362,0.000003134266,0.967956,0.00026241774,0.000010200194,0.0000055265473,2.1976022e-7,0.0000045125666,0.00059663417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992119,0.00012346677,0.00017182837,0.00017589377,0.00018289234,0.00013400821],"domain_scores_gemma":[0.99909186,0.00018232627,0.000073998526,0.0005350388,0.00007710145,0.00003969475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031875676,0.000068313515,0.00009313076,0.00006806608,0.00003320014,0.00002372925,0.00048037298,0.00004175682,0.00014644749],"category_scores_gemma":[0.0002220941,0.00005935426,0.000033012275,0.0002823554,0.000034350272,0.0002223783,0.000040311927,0.000047751873,0.0001204338],"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.000012343968,0.0008843274,0.0021445015,0.00009762843,0.000031705968,0.000013541769,0.0011855925,0.16791467,0.018772267,0.110753655,0.008402162,0.6897876],"study_design_scores_gemma":[0.00018497428,0.0001021209,0.0011689457,0.00001126733,0.0000024662666,0.000004107629,0.0000050107146,0.8846257,0.11257188,0.00073015376,0.0004689722,0.00012442358],"about_ca_topic_score_codex":0.000004989118,"about_ca_topic_score_gemma":7.209089e-8,"teacher_disagreement_score":0.716711,"about_ca_system_score_codex":0.000017247932,"about_ca_system_score_gemma":0.0000125675015,"threshold_uncertainty_score":0.24203965},"labels":[],"label_agreement":null},{"id":"W2147121279","doi":"10.1007/11609773_14","title":"A Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":38,"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":"Transitive closure; Computer science; Predicate abstraction; Predicate (mathematical logic); Heap (data structure); Predicate variable; Programming language; Theoretical computer science; Transitive relation; Predicate logic; Model checking; Mathematics; Description logic; Discrete mathematics; Multimodal logic","score_opus":0.04989235046967225,"score_gpt":0.3150562467343075,"score_spread":0.2651638962646352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147121279","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.00062233576,0.00032193388,0.99683183,0.00014442831,0.00062839396,0.000995107,0.0000023957173,0.00010646243,0.00034711394],"genre_scores_gemma":[0.08612388,0.000033062184,0.91340214,0.00014068099,0.00022195047,0.00002949419,0.000004017725,0.000018878107,0.000025922762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971804,0.000016933618,0.00063658785,0.0011002569,0.0006719144,0.00039390297],"domain_scores_gemma":[0.9978953,0.00038347635,0.00057931046,0.0007448516,0.00029501083,0.000102078746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001418237,0.00032917442,0.00039446517,0.00047290613,0.0001774921,0.00023236308,0.0013426706,0.00031758336,0.0000022021052],"category_scores_gemma":[0.00022415684,0.00029126104,0.0000827468,0.00036707302,0.00043169328,0.0007360395,0.0004736204,0.00041023368,0.0000022807992],"study_design_candidate":"design_other","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.00001207358,0.000028337368,0.000050583396,0.00009927789,0.000003946741,0.0000014324082,0.00021492243,0.010956972,0.00019306692,0.020855876,0.0000017376252,0.96758175],"study_design_scores_gemma":[0.00020274852,0.00038017487,0.00054376107,0.0005482841,0.00000772272,0.000059562357,1.933351e-7,0.81140494,0.0012788745,0.18498544,0.00029984026,0.0002884311],"about_ca_topic_score_codex":0.000005661339,"about_ca_topic_score_gemma":0.000019623909,"teacher_disagreement_score":0.9672933,"about_ca_system_score_codex":0.00015118744,"about_ca_system_score_gemma":0.00022659688,"threshold_uncertainty_score":0.9999539},"labels":[],"label_agreement":null},{"id":"W2147290904","doi":"10.1007/978-3-319-12214-4_15","title":"Applying Formal Methods into Safety-Critical Health Applications","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Correctness; Stateflow; Formal methods; Formal verification; Construct (python library); Model checking; Life-critical system; Software engineering; Key (lock); Programming language; Software; Computer security","score_opus":0.03300731199408783,"score_gpt":0.36993222658219005,"score_spread":0.3369249145881022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147290904","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":[1.8381702e-7,0.0006452797,0.9910573,0.0013945211,0.0016383666,0.0016034476,0.000003336098,0.0003237682,0.0033338165],"genre_scores_gemma":[0.0011943949,0.000060567632,0.9943036,0.0033072634,0.00057088764,0.00041126582,0.000008268183,0.000043382857,0.00010036246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994585,0.0002771491,0.0010919059,0.0018860566,0.0010665767,0.0010933083],"domain_scores_gemma":[0.9948076,0.001512849,0.00046947968,0.002483224,0.00033823776,0.00038861026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007004125,0.00059227005,0.00078055845,0.00095361326,0.00093134557,0.0005540487,0.0047938838,0.0003935711,0.000014487599],"category_scores_gemma":[0.00045289894,0.00058112957,0.00017035649,0.000963468,0.0011329718,0.0010106572,0.0019953959,0.0012561058,0.00008318115],"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.0000021777846,0.000009326763,0.0000017538763,0.00006968799,0.000002866089,0.0000012710559,0.00028865415,0.0019238851,0.0000320869,0.37389407,0.0000047602366,0.62376946],"study_design_scores_gemma":[0.00014145776,0.00017071994,0.000024199118,0.00022153692,0.0000057185093,0.00007098652,2.7304418e-7,0.5597129,0.00076957775,0.37684065,0.061407737,0.00063425256],"about_ca_topic_score_codex":0.000029106572,"about_ca_topic_score_gemma":0.000019611029,"teacher_disagreement_score":0.6231352,"about_ca_system_score_codex":0.0007584998,"about_ca_system_score_gemma":0.0008762677,"threshold_uncertainty_score":0.999664},"labels":[],"label_agreement":null},{"id":"W2147399734","doi":"10.1109/ccece.2005.1557053","title":"A new logic synthesis, exorbds","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Benchmark (surveying); Field-programmable gate array; Boolean function; Combinational logic; Logic synthesis; Minification; Logic gate; Electronic circuit; Sequential logic; Binary decision diagram; Functional decomposition; Algorithm; Arithmetic; Mathematics; Computer hardware; Engineering","score_opus":0.027421288153055265,"score_gpt":0.27507323754860796,"score_spread":0.24765194939555268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147399734","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.00025917936,0.00003954966,0.8875768,0.0005053832,0.00016453162,0.000042189135,8.473146e-8,0.0002329021,0.11117938],"genre_scores_gemma":[0.042415746,0.00000197001,0.9535659,0.00018423345,0.00007533147,0.000006180939,1.8424277e-7,0.0000027712065,0.0037477005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994078,0.000041684703,0.000115482064,0.00017341577,0.00012706421,0.00013450478],"domain_scores_gemma":[0.999443,0.000058335718,0.000033464945,0.00041011945,0.000018990693,0.00003606778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022536858,0.000057197296,0.00006328247,0.000043548043,0.0000378993,0.00007535397,0.0005422216,0.00003329923,0.00010524536],"category_scores_gemma":[0.000058183046,0.000046499918,0.000026505806,0.00021973554,0.000010853945,0.0003087076,0.00007495802,0.00003759974,0.0002942093],"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":[4.527036e-7,0.000008780244,0.00006474371,0.0000012604834,6.918786e-7,9.306311e-7,0.000009070584,0.000021384107,0.0006359756,0.9178101,0.005919039,0.07552756],"study_design_scores_gemma":[0.0002547286,0.00008719953,0.03697721,0.000018608282,0.000008875458,0.000063671236,0.000015296515,0.123371385,0.23545216,0.5026433,0.100522086,0.0005854856],"about_ca_topic_score_codex":0.00018905633,"about_ca_topic_score_gemma":0.0000067933856,"teacher_disagreement_score":0.41516683,"about_ca_system_score_codex":0.000020534468,"about_ca_system_score_gemma":0.00003182061,"threshold_uncertainty_score":0.37815636},"labels":[],"label_agreement":null},{"id":"W2147420447","doi":"10.1007/978-3-642-11811-1_2","title":"Formal Probabilistic Analysis: A Higher-Order Logic Based Approach","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Probabilistic logic; Computer science; Probabilistic CTL; Probabilistic analysis of algorithms; Theoretical computer science; Probabilistic argumentation; Scale (ratio); Artificial intelligence","score_opus":0.03217981723058657,"score_gpt":0.2749233640525519,"score_spread":0.24274354682196533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147420447","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.000018050257,0.00013078634,0.9887764,0.00031966824,0.0017276388,0.0006776349,0.000005637871,0.0002976041,0.008046591],"genre_scores_gemma":[0.033551656,0.0000037686189,0.9646013,0.0012473703,0.0002982235,0.00004809823,0.000018816621,0.00003118746,0.00019960664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99456185,0.00010036527,0.0007808262,0.0021671867,0.0014079707,0.0009818275],"domain_scores_gemma":[0.99548274,0.0003988283,0.0003966272,0.0029326011,0.0005505155,0.00023870691],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0025459742,0.00069865736,0.0008121651,0.0018201532,0.0004224265,0.00072725717,0.0054451865,0.00069409347,0.000054071264],"category_scores_gemma":[0.00026688527,0.0006016732,0.00029110422,0.0030879325,0.001244341,0.001102874,0.0012178691,0.0016474789,0.000039073722],"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.000016218475,0.00014879488,0.000057498135,0.00014212806,0.000080885045,0.00003156028,0.00042024147,0.2742392,0.00023871455,0.48492208,0.000005017503,0.23969765],"study_design_scores_gemma":[0.00019774516,0.00012756577,0.0002956142,0.000049724895,0.00007148555,0.000017564811,5.3091497e-8,0.8673961,0.00048740176,0.12995766,0.0007263112,0.0006727384],"about_ca_topic_score_codex":0.00001776171,"about_ca_topic_score_gemma":0.000033008644,"teacher_disagreement_score":0.59315693,"about_ca_system_score_codex":0.00031282075,"about_ca_system_score_gemma":0.0007671745,"threshold_uncertainty_score":0.9999358},"labels":[],"label_agreement":null},{"id":"W2147657785","doi":"10.1109/tai.2000.889888","title":"History checking of temporal fuzzy logic formulas for monitoring behavior-based mobile robots","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Temporal logic; Robot; Semantics (computer science); Fuzzy logic; Mobile robot; Artificial intelligence; Independence (probability theory); Noise (video); Programming language","score_opus":0.12945641036250372,"score_gpt":0.3259657884210686,"score_spread":0.1965093780585649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147657785","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.026245087,0.00034544014,0.9689767,0.000019895504,0.00095229014,0.00049285655,9.0024156e-7,0.00018206614,0.002784778],"genre_scores_gemma":[0.43939796,0.0000022993534,0.5601215,0.000020181813,0.00003568618,0.00016139315,7.2240505e-7,0.000006537955,0.0002537589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989593,0.000034376433,0.00030640684,0.0002640376,0.00021085683,0.00022504097],"domain_scores_gemma":[0.99907035,0.00006229269,0.0001796963,0.00051707623,0.00011664627,0.0000539622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039343527,0.00011426819,0.00015788116,0.00011491233,0.000059411534,0.000019849937,0.0005801541,0.000075320255,0.000034061763],"category_scores_gemma":[0.000050403152,0.00010884033,0.000095389805,0.00015024966,0.000041402815,0.00046239607,0.0000631381,0.000074890835,0.000009284316],"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.00006072332,0.0016087276,0.031156324,0.00048528687,0.0000365087,0.00001188984,0.003098549,0.0119974315,0.09051232,0.1980349,0.0020557228,0.6609416],"study_design_scores_gemma":[0.0011728901,0.0011432994,0.00799884,0.00006812245,0.000032299726,0.000007927701,0.00008240194,0.71079606,0.26694345,0.0015727954,0.009559278,0.0006226101],"about_ca_topic_score_codex":0.000021997443,"about_ca_topic_score_gemma":6.718793e-7,"teacher_disagreement_score":0.69879866,"about_ca_system_score_codex":0.00023759772,"about_ca_system_score_gemma":0.000028055298,"threshold_uncertainty_score":0.443838},"labels":[],"label_agreement":null},{"id":"W2147881532","doi":"10.5555/857171.857211","title":"The Complexity of TRMCS-like Spiral Specification","year":2000,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"Spiral (railway); Computer science; Class (philosophy); System requirements specification; Pessimism; Programming language; Formal specification; Theoretical computer science; Software engineering; Artificial intelligence; Mathematics","score_opus":0.10421760896520248,"score_gpt":0.31243526992489823,"score_spread":0.20821766095969574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147881532","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.02161936,0.000050270253,0.8770531,0.0011965948,0.00030416067,0.0001716928,9.0595114e-7,0.00012671041,0.09947721],"genre_scores_gemma":[0.33096746,0.000035052504,0.6665993,0.000117536874,0.000033096036,0.0000065349586,0.0000012813015,0.0000029828593,0.0022367712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992515,0.00008993823,0.0002137361,0.000143648,0.00018296618,0.000118238764],"domain_scores_gemma":[0.99912685,0.000045725825,0.000066305714,0.0006842426,0.000050774546,0.000026102734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005074606,0.000052200998,0.00006278824,0.000019071535,0.0001224519,0.000050841994,0.00080867135,0.000023207202,0.00013481746],"category_scores_gemma":[0.000020229283,0.000034744236,0.000034041175,0.00023935488,0.00023009774,0.00026755538,0.000038979393,0.000053953438,0.00019234807],"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.0000047899603,0.000017213526,0.000050509152,0.000001544755,0.0000018059008,6.066272e-8,0.00010809574,0.000013469093,0.00037627155,0.77381307,0.00047598113,0.22513719],"study_design_scores_gemma":[0.0004624809,0.00021257142,0.1977781,0.000011438894,0.000006274544,0.00001687811,0.000095667885,0.2897617,0.051199973,0.16216739,0.29794413,0.00034339458],"about_ca_topic_score_codex":0.000021276643,"about_ca_topic_score_gemma":0.0000057327584,"teacher_disagreement_score":0.6116457,"about_ca_system_score_codex":0.000017501945,"about_ca_system_score_gemma":0.000016154161,"threshold_uncertainty_score":0.24723095},"labels":[],"label_agreement":null},{"id":"W2148428788","doi":"10.1109/csd.2001.981776","title":"Semi-hiding operators and the analysis of active-edge specifications for digital circuits","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Asynchronous communication; Concurrency; Abstraction; Information hiding; Operator (biology); Model checking; Theoretical computer science; Formal verification; Interface (matter); Enhanced Data Rates for GSM Evolution; Programming language; Distributed computing; Parallel computing; Computer network; Artificial intelligence","score_opus":0.09240868306695992,"score_gpt":0.29144998593299926,"score_spread":0.19904130286603933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148428788","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.023366185,0.000062466046,0.96575755,0.00033066102,0.00005780841,0.00020661954,0.00001050683,0.00003513418,0.010173085],"genre_scores_gemma":[0.9257883,0.000021973981,0.0737046,0.000036570353,0.000014411881,0.00002814683,0.000002001029,0.000002999888,0.00040104165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938387,0.000039742874,0.00018641443,0.00018863902,0.0001052987,0.00009601464],"domain_scores_gemma":[0.99901325,0.00036444506,0.00008452143,0.00041252846,0.00009502523,0.000030235047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029513615,0.000059466456,0.00014067128,0.00014078805,0.00011739114,0.00013767244,0.00040430544,0.000024624034,0.000019062434],"category_scores_gemma":[0.00023518667,0.00004012841,0.00007847996,0.00095141307,0.00009821762,0.0006025131,0.000062622916,0.000036645637,0.000003566575],"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.0000029073487,0.000037337464,0.0004077748,0.0000056726194,0.00018262638,5.2812247e-8,0.0022758916,0.000121900186,0.00058198505,0.83386403,0.0001594759,0.16236036],"study_design_scores_gemma":[0.00039490068,0.000020945918,0.01167528,0.00000381478,0.00011477212,0.000001790074,0.00026032105,0.97552735,0.008286773,0.0017276274,0.0018701445,0.00011629601],"about_ca_topic_score_codex":0.0000033638062,"about_ca_topic_score_gemma":0.0000012783545,"teacher_disagreement_score":0.97540545,"about_ca_system_score_codex":0.000016486114,"about_ca_system_score_gemma":0.0000056848085,"threshold_uncertainty_score":0.1636389},"labels":[],"label_agreement":null},{"id":"W2149391410","doi":"10.1109/glsv.1999.757434","title":"A hierarchical approach to the formal verification of embedded systems using MDGs [microcontrollers]","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Correctness; Computer science; Microcontroller; Formal verification; Embedded system; Abstraction; Embedded software; Model checking; Formal methods; Software; Programming language; Software engineering","score_opus":0.047059242070363,"score_gpt":0.29055524581757886,"score_spread":0.24349600374721586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149391410","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.008590495,0.000054176293,0.9749248,0.00007349157,0.0004062374,0.0006449998,0.0000010204488,0.00005969104,0.015245107],"genre_scores_gemma":[0.43200362,0.0000010015499,0.5677351,0.000096087264,0.000026082947,0.00003924583,5.756596e-7,0.000004893323,0.00009337869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831384,0.00044357567,0.00039335992,0.00028553364,0.00029124986,0.00027242312],"domain_scores_gemma":[0.9986541,0.00010938439,0.00014584856,0.0008444541,0.00017208909,0.00007409481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002308453,0.000110541085,0.00017557843,0.00010522705,0.00015257763,0.00010465817,0.00081537454,0.000064032145,0.000002197793],"category_scores_gemma":[0.00042253875,0.00007492219,0.000060360337,0.00058015424,0.000046315716,0.00047748192,0.000085145904,0.000117155534,0.000014626366],"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.000015294729,0.00006829119,0.000026463445,0.000024240182,0.000013689046,9.69396e-8,0.0012926334,0.010521102,0.007917537,0.9753549,0.00019501123,0.004570709],"study_design_scores_gemma":[0.00030138702,0.000049276998,0.00021902286,0.000009234883,0.000007298745,0.000028330527,0.00031448458,0.9833329,0.01013789,0.0003874676,0.0050823577,0.00013040552],"about_ca_topic_score_codex":0.000032207845,"about_ca_topic_score_gemma":5.0081434e-7,"teacher_disagreement_score":0.9749675,"about_ca_system_score_codex":0.000054689175,"about_ca_system_score_gemma":0.000081096354,"threshold_uncertainty_score":0.3055238},"labels":[],"label_agreement":null},{"id":"W2149404610","doi":"10.1109/time.2006.11","title":"CTL Model Checking for Labelled Tree Queries","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"XPath; Computation tree logic; CTL*; Computer science; Theoretical computer science; Model checking; Fragment (logic); Branching (polymer chemistry); Tree (set theory); Computation; Temporal logic; Programming language; Algorithm; Mathematics; XML; Combinatorics; Chemistry","score_opus":0.03369699989097832,"score_gpt":0.28904535183833285,"score_spread":0.25534835194735456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149404610","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.0035592911,0.000024152512,0.963469,0.00028145115,0.00012852372,0.00014829723,7.4221515e-7,0.00021750049,0.032171022],"genre_scores_gemma":[0.08542659,0.0000012661793,0.91030777,0.00012428404,0.00004123102,0.000042878662,0.0000016072975,0.0000055002915,0.0040488546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993688,0.000017374514,0.00015299933,0.00019124152,0.00010580757,0.00016379089],"domain_scores_gemma":[0.99949366,0.000042751755,0.000049686518,0.00033255696,0.000061784434,0.000019556925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003130523,0.00006933337,0.00008037511,0.000042395644,0.000094704505,0.00007671237,0.00040142762,0.000038202685,0.0000037656814],"category_scores_gemma":[0.000044722583,0.00006079339,0.000038375965,0.00013614804,0.000022000117,0.00044491416,0.00006976165,0.00003307499,0.000010233774],"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.000003194856,0.000017942692,0.000037678437,0.000006673408,0.0000015087788,9.709012e-8,0.000087834465,0.0022734907,0.0027167564,0.97954047,0.0009875298,0.014326835],"study_design_scores_gemma":[0.00015545188,0.000022502858,0.00018871293,0.0000024813792,0.000001550607,9.860271e-7,0.000006217683,0.89892346,0.04009763,0.05852669,0.001989835,0.00008445854],"about_ca_topic_score_codex":0.000030327836,"about_ca_topic_score_gemma":0.00002295843,"teacher_disagreement_score":0.9210138,"about_ca_system_score_codex":0.000024346118,"about_ca_system_score_gemma":0.000027668599,"threshold_uncertainty_score":0.24790825},"labels":[],"label_agreement":null},{"id":"W2149952006","doi":"10.1145/587051.587074","title":"Composable semantics for model-based notations","year":2002,"lang":"en","type":"article","venue":"","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":"University of Waterloo","keywords":"Computer science; Programming language; Semantics (computer science); Notation; Concurrency; Operational semantics; Synchronization (alternating current); Component (thermodynamics); Formal semantics (linguistics); Formal specification; Action semantics; Denotational semantics; Communicating sequential processes; Variety (cybernetics); Transition system; Well-founded semantics; Theoretical computer science; Formal methods; Artificial intelligence; Mathematics","score_opus":0.09530562017389484,"score_gpt":0.3107307447803508,"score_spread":0.21542512460645596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149952006","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.00029870652,0.000009374264,0.9901432,0.0013886067,0.00013082834,0.00017271294,0.0000020777086,0.00017053324,0.00768401],"genre_scores_gemma":[0.14063486,0.0000011263033,0.8576893,0.0004963992,0.000011509537,0.00003160487,0.0000016467287,0.0000041756543,0.0011293433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994774,0.000017405691,0.000121932964,0.00014975732,0.00009929638,0.00013421006],"domain_scores_gemma":[0.9993833,0.00008533209,0.000036717844,0.00036626187,0.00009232217,0.000036104066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016632328,0.00005596192,0.00006122143,0.000048071197,0.00010621642,0.00006575699,0.00037674463,0.000027609593,0.000018327357],"category_scores_gemma":[0.000041948246,0.000050702507,0.000035667323,0.00016982022,0.000019041287,0.00027995123,0.00002495695,0.000032446005,0.000059671216],"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.0000010998724,0.00006334775,0.000017132044,0.000013520746,0.000002417639,1.07789866e-7,0.00013377654,0.10171466,0.00048406978,0.88538486,0.0046279905,0.007557016],"study_design_scores_gemma":[0.0001515665,0.000026389453,0.00001950764,0.0000023614693,0.0000022638162,5.700728e-7,0.0000027482417,0.98341125,0.007388071,0.006809325,0.0021138312,0.00007211374],"about_ca_topic_score_codex":0.0000013910551,"about_ca_topic_score_gemma":7.43852e-7,"teacher_disagreement_score":0.8816966,"about_ca_system_score_codex":0.000017683175,"about_ca_system_score_gemma":0.000012758319,"threshold_uncertainty_score":0.20675883},"labels":[],"label_agreement":null},{"id":"W2150272723","doi":"10.1109/acsd.2007.41","title":"A more efficient time Petri net state space abstraction preserving linear properties","year":2007,"lang":"en","type":"article","venue":"Proceedings","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Petri net; Abstraction; Partial order reduction; State space; Construct (python library); Computer science; Theoretical computer science; Reduction (mathematics); Time complexity; Stochastic Petri net; State (computer science); Space (punctuation); Spacetime; Net (polyhedron); Algorithm; Model checking; Mathematics; Programming language","score_opus":0.02504138761063466,"score_gpt":0.2761425962226173,"score_spread":0.2511012086119826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150272723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7056555,0.000092547365,0.28491068,0.0004883734,0.0002835599,0.00037975344,6.7221134e-7,0.0005035632,0.0076853293],"genre_scores_gemma":[0.5481618,0.0000076248025,0.44989386,0.00008572385,0.00013418154,0.000017481027,7.528424e-7,0.0000184954,0.0016800626],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985215,0.000007743304,0.00027703642,0.0003721795,0.00043559304,0.0003859178],"domain_scores_gemma":[0.9991774,0.000023242852,0.00018732727,0.0002011885,0.00030800025,0.00010285268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014826846,0.00014437511,0.00012215786,0.00017305564,0.00015340438,0.00019687926,0.00062630046,0.00006160102,0.000009051404],"category_scores_gemma":[0.00032903047,0.00012717157,0.000037769027,0.00057019555,0.000050366118,0.0008535064,0.00022876872,0.00021140825,0.00015304508],"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.00046393313,0.00074560166,0.0036689872,0.0011338438,0.0000914147,0.000025421265,0.054533426,0.009020812,0.7659427,0.039739795,0.0053608953,0.11927319],"study_design_scores_gemma":[0.00016998523,0.00009176597,0.008096957,0.00007021925,0.0000053138588,0.000030395462,0.00019119737,0.74786377,0.23638256,0.00018991625,0.0066710194,0.0002369169],"about_ca_topic_score_codex":0.000028554316,"about_ca_topic_score_gemma":4.3386532e-7,"teacher_disagreement_score":0.73884296,"about_ca_system_score_codex":0.00010504222,"about_ca_system_score_gemma":0.00003174732,"threshold_uncertainty_score":0.5185906},"labels":[],"label_agreement":null},{"id":"W2150337299","doi":"10.1109/ismvl.2015.32","title":"Using QMDD in Numerical Methods for Solving Linear Differential Equations via Walsh Functions","year":2015,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 Victoria","funders":"","keywords":"Computation; Convolution (computer science); Dimension (graph theory); Series (stratigraphy); Applied mathematics; Walsh function; Computer science; Differential equation; Differential (mechanical device); Algebra over a field; Mathematics; Algorithm; Mathematical analysis; Pure mathematics; Artificial intelligence","score_opus":0.25551147966693516,"score_gpt":0.45869587369909554,"score_spread":0.20318439403216038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150337299","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.00067066296,0.000023821878,0.9971162,0.00013412244,0.0011290298,0.0002683957,0.0000010467402,0.00014306804,0.00051361974],"genre_scores_gemma":[0.048124842,4.634695e-7,0.95142615,0.00006801659,0.000118589516,0.000053423475,0.000004257574,0.000010378581,0.00019386908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987018,0.0002344714,0.000333618,0.0003076269,0.00015745766,0.0002650243],"domain_scores_gemma":[0.9988262,0.0003908871,0.000088783214,0.0004128011,0.00016571404,0.00011562093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011967729,0.000109875575,0.00016257171,0.00017635754,0.00012362207,0.0000859183,0.00040849854,0.0000776705,0.00001872147],"category_scores_gemma":[0.0010082301,0.00010243777,0.00006525666,0.0005556633,0.000027504024,0.0006288744,0.00016756568,0.00012332812,0.000019181194],"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.00005002966,0.00047528985,0.00046424344,0.000033326538,0.000043972897,0.0000012184361,0.0023870957,0.020037716,0.040735222,0.3654862,0.00038452615,0.56990117],"study_design_scores_gemma":[0.00028009168,0.00005361354,0.00019640486,0.000005424622,0.000008001401,0.0000041607773,0.000044234745,0.98855615,0.0040857787,0.0056607747,0.00097482494,0.00013053545],"about_ca_topic_score_codex":0.000098095086,"about_ca_topic_score_gemma":0.000006909471,"teacher_disagreement_score":0.96851844,"about_ca_system_score_codex":0.00014015696,"about_ca_system_score_gemma":0.00010975498,"threshold_uncertainty_score":0.4177291},"labels":[],"label_agreement":null},{"id":"W2150553773","doi":"10.1109/icre.2003.1232750","title":"Understanding and comparing model-based specification notations","year":2004,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"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 Waterloo","funders":"","keywords":"Notation; Computer science; Semantics (computer science); Programming language; Petri net; Generality; Linguistics","score_opus":0.16191987948312625,"score_gpt":0.3117031790170023,"score_spread":0.14978329953387604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150553773","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.04882061,0.000080946214,0.9461581,0.0041727303,0.00014743196,0.000054741868,1.6046337e-7,0.00007156472,0.0004937076],"genre_scores_gemma":[0.53192407,0.0000120957775,0.4680203,0.000025577689,0.000011914227,9.1419224e-7,9.842707e-8,0.000002795063,0.0000022733575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992216,0.000021325654,0.00034885205,0.00012410976,0.00015846035,0.00012563977],"domain_scores_gemma":[0.9991724,0.000028752074,0.0003713004,0.0002527204,0.00013212398,0.000042712363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039504323,0.000073711904,0.00015192576,0.0006161286,0.00010661998,0.000050509647,0.0004264142,0.00009490118,7.3670805e-7],"category_scores_gemma":[0.00010610425,0.00006766672,0.00003149336,0.0004929697,0.000103503415,0.00040972137,0.000052005686,0.00023270723,0.0000027785734],"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.0000053169556,0.000032909928,0.00044778184,0.0000055095875,0.0000074736886,0.0000049586624,0.0001782529,0.014770026,0.006268944,0.97716254,0.000014765526,0.0011015268],"study_design_scores_gemma":[0.0007740611,0.0001821216,0.00070928835,0.00006187099,0.00001306433,0.0002165566,0.00013111653,0.46709135,0.04345108,0.4870978,0.0001462119,0.00012546516],"about_ca_topic_score_codex":5.6355935e-7,"about_ca_topic_score_gemma":0.0000016570465,"teacher_disagreement_score":0.49006474,"about_ca_system_score_codex":0.00025892636,"about_ca_system_score_gemma":0.00009736247,"threshold_uncertainty_score":0.27593687},"labels":[],"label_agreement":null},{"id":"W2150864252","doi":"10.1145/505306.505344","title":"Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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 Victoria","funders":"","keywords":"Computer science; Graph; Implementation; Arithmetic; Theoretical computer science; Boolean function; Walsh function; Algorithm; Influence diagram; Graph theory; Mathematics; Programming language; Decision tree; Artificial intelligence","score_opus":0.05062126250057109,"score_gpt":0.29064083864989915,"score_spread":0.24001957614932806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150864252","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.10168932,0.00012869295,0.8929387,0.00019638028,0.00026049587,0.0001592612,6.098351e-7,0.0001713833,0.0044551645],"genre_scores_gemma":[0.37640283,0.00004315149,0.62341046,0.00008757701,0.000025657895,0.0000013002851,3.9496123e-7,0.000004897083,0.000023767247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987552,0.000078207384,0.0003391166,0.00028753982,0.00026221375,0.00027771652],"domain_scores_gemma":[0.9992416,0.0001476523,0.00007148165,0.00037781833,0.000059159458,0.000102298225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000523647,0.00013169069,0.00014351914,0.00018569452,0.00029189145,0.0002393548,0.00038531394,0.00006591857,0.000041104533],"category_scores_gemma":[0.000065477936,0.000116162606,0.00005600954,0.00057066185,0.00006607671,0.00090736017,0.000085297135,0.00014247131,0.00002773541],"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.0000038297826,0.000105397536,0.0006261585,0.000019625648,0.000016137465,0.0000042677816,0.0026378492,0.0016261949,0.0014686354,0.24289833,0.0002494072,0.75034416],"study_design_scores_gemma":[0.00023828006,0.000045393004,0.0035002227,0.000022903694,0.0000063212533,0.00006845357,0.00004304846,0.9859063,0.0020912846,0.007491975,0.000414148,0.00017169557],"about_ca_topic_score_codex":0.000025811045,"about_ca_topic_score_gemma":0.000007225971,"teacher_disagreement_score":0.98428005,"about_ca_system_score_codex":0.00003446348,"about_ca_system_score_gemma":0.0000067908677,"threshold_uncertainty_score":0.47369736},"labels":[],"label_agreement":null},{"id":"W2150919766","doi":"10.1109/acsd.2007.32","title":"Structural Conditions for Model-checking of Parameterized Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"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 Waterloo","funders":"","keywords":"Parameterized complexity; Bounded function; Equivalence (formal languages); Mathematics; TRACE (psycholinguistics); Piecewise; Equivalence relation; Ring (chemistry); Observable; Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis; Physics","score_opus":0.06522568128119582,"score_gpt":0.3587962826626049,"score_spread":0.29357060138140906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150919766","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.05810299,0.000007616519,0.9405429,0.000023414179,0.00021740787,0.00017289669,0.0000018102085,0.00007133551,0.0008596417],"genre_scores_gemma":[0.47998434,4.1147788e-7,0.5199133,0.00004932988,0.000011775862,0.000005657007,0.0000022541265,0.0000021621256,0.00003074531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993526,0.000016350126,0.00023143124,0.0001403141,0.0000889705,0.00017035777],"domain_scores_gemma":[0.999348,0.00014011135,0.00010064095,0.00028990512,0.00008543663,0.000035925474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056306116,0.000058037178,0.00009597042,0.00005369954,0.000062929095,0.000024281793,0.0003289312,0.000046645204,0.000004555096],"category_scores_gemma":[0.00006704281,0.00005113338,0.000050902763,0.00015784243,0.00003849412,0.00029606285,0.000050530776,0.000045438996,5.3013366e-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.000013695808,0.0000069760326,0.00006033947,0.000008033399,0.0000076103183,1.4796666e-7,0.00014621759,0.04970926,0.0062720114,0.9251518,0.000046703255,0.018577153],"study_design_scores_gemma":[0.0001637477,0.000029072295,0.0009496234,0.0000035998494,0.0000028252307,0.000002302929,0.0000090868225,0.9608076,0.015113646,0.022833461,0.000022595448,0.000062422645],"about_ca_topic_score_codex":0.0000039453057,"about_ca_topic_score_gemma":0.0000016724779,"teacher_disagreement_score":0.91109836,"about_ca_system_score_codex":0.000016732249,"about_ca_system_score_gemma":0.000014303413,"threshold_uncertainty_score":0.20851587},"labels":[],"label_agreement":null},{"id":"W2151629759","doi":"10.1109/sefm.2005.44","title":"Stuttering abstraction for model checking","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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":"","keywords":"Abstraction; Computer science; Abstraction model checking; Model checking; Set (abstract data type); Scalability; Theoretical computer science; Construct (python library); Operator (biology); Abstract interpretation; Programming language; Database","score_opus":0.07152038508651672,"score_gpt":0.34756606220760794,"score_spread":0.27604567712109124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151629759","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.0067398353,0.000005249662,0.9846038,0.0003732128,0.00012931679,0.00009908689,1.9035107e-7,0.00016531361,0.007883974],"genre_scores_gemma":[0.2766677,0.0000011738756,0.72264427,0.00016452756,0.000055993718,0.00001798919,2.7181747e-7,0.0000027849014,0.00044525907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995546,0.0000058277333,0.00011046145,0.00014010748,0.00007624873,0.00011279011],"domain_scores_gemma":[0.99967766,0.000018134479,0.000039092833,0.00021160305,0.000032156415,0.000021344284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030975757,0.000043032087,0.00003994911,0.000034955712,0.00006298759,0.000063360385,0.0002429499,0.000024799856,0.0000036640622],"category_scores_gemma":[0.00002498856,0.000041312323,0.000023533114,0.00005644007,0.0000051712705,0.00088424236,0.000038544145,0.000036387682,0.000020269037],"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.0000028663667,0.000020425758,0.000010175527,0.000008908722,0.000002829523,5.0959645e-8,0.00028717864,0.07016065,0.018202465,0.39411822,0.0002194491,0.51696676],"study_design_scores_gemma":[0.000064935884,0.000008153174,0.00018770016,0.0000020699456,7.770117e-7,0.000001823968,0.000005449381,0.94791263,0.045951698,0.0021417795,0.0036693271,0.00005366013],"about_ca_topic_score_codex":0.000001959503,"about_ca_topic_score_gemma":0.0000014006165,"teacher_disagreement_score":0.87775195,"about_ca_system_score_codex":0.00004159658,"about_ca_system_score_gemma":0.0000113340875,"threshold_uncertainty_score":0.16846676},"labels":[],"label_agreement":null},{"id":"W2151884108","doi":"10.1109/tcad.2010.2049150","title":"Validating Assertion Language Rewrite Rules and Semantics With Automated Theorem Provers","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"Buddhist Tzu Chi Medical Foundation; École de technologie supérieure","keywords":"Assertion; Programming language; Computer science; Mathematical proof; Correctness; Semantics (computer science); Automated theorem proving; Syntax; Notation; Operational semantics; Artificial intelligence; Mathematics; Arithmetic","score_opus":0.02350517213242489,"score_gpt":0.2601432923140669,"score_spread":0.23663812018164201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151884108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20118709,0.000025776304,0.79720545,0.00001894916,0.0006239628,0.00046530282,0.000012387753,0.0004105418,0.000050558392],"genre_scores_gemma":[0.80241615,0.0000114586355,0.19746235,0.000019132487,0.000023983768,0.000027478487,0.0000029064756,0.000017774302,0.000018761739],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981872,0.00037141732,0.0004683739,0.00044575345,0.00029503647,0.0002322489],"domain_scores_gemma":[0.9985572,0.00029297828,0.0002851829,0.00048387086,0.00027473865,0.000106040774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009851365,0.00025077074,0.00033551673,0.0002732555,0.00020272966,0.0003239604,0.0003203514,0.0001643585,0.0000017618939],"category_scores_gemma":[0.000018665789,0.00019185824,0.00003793923,0.00041000353,0.00012362814,0.0005344574,0.0000035320465,0.00038373028,0.0000026523048],"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.000117750984,0.00044564027,0.00012121049,0.0005997931,0.00035306302,0.00004423978,0.0061773425,0.043553974,0.57695013,0.06488535,0.0000706329,0.30668083],"study_design_scores_gemma":[0.00043321328,0.0005032179,0.00018310544,0.0003086332,0.000028130295,0.0002107762,0.00025181044,0.9290289,0.06873433,0.000079004094,0.000013854562,0.00022498374],"about_ca_topic_score_codex":0.00015819688,"about_ca_topic_score_gemma":0.000008554744,"teacher_disagreement_score":0.885475,"about_ca_system_score_codex":0.00003533515,"about_ca_system_score_gemma":0.00008372551,"threshold_uncertainty_score":0.7823752},"labels":[],"label_agreement":null},{"id":"W2152595206","doi":"10.1016/j.tcs.2004.10.021","title":"Domain theory, testing and simulation for labelled Markov processes","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Preorder; Mathematics; Probabilistic logic; Domain theory; Equivalence (formal languages); Domain (mathematical analysis); Markov chain; State space; Markov kernel; Markov process; Discrete mathematics; Kernel (algebra); Computer science; Pure mathematics; Markov model; Variable-order Markov model","score_opus":0.02515576003690079,"score_gpt":0.30781641537150756,"score_spread":0.28266065533460677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152595206","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.034418944,0.000024422374,0.96365005,0.0003025982,0.00022122567,0.00042493435,9.599493e-7,0.00019479993,0.00076205767],"genre_scores_gemma":[0.46578273,6.7263306e-7,0.53400564,0.00014785964,0.000042738782,0.00001463813,1.7169268e-7,0.000004172932,0.0000013448741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982904,0.00009610429,0.00024742665,0.0005995007,0.00036774602,0.00039881328],"domain_scores_gemma":[0.9973885,0.001511737,0.00009241954,0.00046414463,0.0003960555,0.00014713529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034694516,0.00014351965,0.00014250276,0.00012730237,0.0005468989,0.00039981084,0.0011584635,0.000045263016,0.000002329787],"category_scores_gemma":[0.0017162067,0.00011833753,0.00002167867,0.0012155767,0.0015711299,0.00088245457,0.00046677465,0.000093035014,0.0000059702834],"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.000019644616,0.000025714367,0.000014732355,0.000029603569,0.0000014422931,7.3009494e-7,0.00047889052,0.0043677846,0.00058737386,0.93826467,5.0359e-7,0.0562089],"study_design_scores_gemma":[0.00038497295,0.00016253625,0.00022020827,0.00002731734,0.000002256846,0.000011541961,0.000004539237,0.41497228,0.0032541445,0.5808232,0.00002395636,0.00011309771],"about_ca_topic_score_codex":8.733136e-7,"about_ca_topic_score_gemma":1.4856757e-7,"teacher_disagreement_score":0.4313638,"about_ca_system_score_codex":0.000056663863,"about_ca_system_score_gemma":0.00018090269,"threshold_uncertainty_score":0.57888937},"labels":[],"label_agreement":null},{"id":"W2152708691","doi":"10.1109/scam.2005.15","title":"Implementation and Verification of Implicit-Invocation Systems Using Source Transformation","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Programming language; Executable; Model transformation; Transformation (genetics); Invocation; Program transformation; Software engineering; Software system; Formal verification; Software; Artificial intelligence","score_opus":0.027666563521538283,"score_gpt":0.3159978485095209,"score_spread":0.2883312849879826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152708691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24246387,0.000048869948,0.7563967,0.000038687787,0.00009136827,0.00025102092,0.0000011952566,0.00006459686,0.00064365315],"genre_scores_gemma":[0.7890271,0.000006761336,0.21088788,0.000009542236,0.000022826674,0.000014031124,0.000013898222,0.0000044190883,0.000013527835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990144,0.000087939094,0.00041877828,0.00017501634,0.00018921767,0.000114673676],"domain_scores_gemma":[0.9993458,0.000024090119,0.0002311935,0.00025676523,0.000120372446,0.000021805834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053850835,0.00007873253,0.00009751916,0.00013155959,0.00008545431,0.000081896265,0.00015924225,0.000045767585,0.000002354031],"category_scores_gemma":[0.000006363572,0.00007865835,0.000018903784,0.00029319336,0.00002528824,0.0011282001,0.000018593833,0.00003271263,0.0000020613354],"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.0000040197997,0.000023000277,0.0011914453,0.000078457946,0.0000046368464,3.018946e-8,0.00070579717,0.0032402868,0.13084266,0.8134651,0.000021047626,0.050423488],"study_design_scores_gemma":[0.00030003997,0.000046210498,0.02370228,0.000013578105,0.000011323355,0.000014560043,0.0006947336,0.8557389,0.11726011,0.0016447612,0.00043930212,0.00013423314],"about_ca_topic_score_codex":0.001352679,"about_ca_topic_score_gemma":0.000015195532,"teacher_disagreement_score":0.8524986,"about_ca_system_score_codex":0.00005919584,"about_ca_system_score_gemma":0.000026243039,"threshold_uncertainty_score":0.32075945},"labels":[],"label_agreement":null},{"id":"W2153490237","doi":"10.1145/1120725.1120908","title":"Integration of supercubing and learning in a SAT solver","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 British Columbia","funders":"","keywords":"Exploit; Solver; Pruning; Computer science; Point (geometry); Enhanced Data Rates for GSM Evolution; Theoretical computer science; Boolean satisfiability problem; Artificial intelligence; Algorithm; Mathematics; Programming language; Geometry","score_opus":0.028715792464329544,"score_gpt":0.2909801335004877,"score_spread":0.26226434103615814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153490237","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.3892625,0.000018894778,0.6083964,0.00011591453,0.000017984648,0.000025344192,1.4395357e-8,0.000022444297,0.0021405232],"genre_scores_gemma":[0.519326,0.0000043139034,0.4805685,0.000025950492,0.0000045029024,9.442099e-7,1.3312865e-7,7.677996e-7,0.000068935784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962133,0.000057261535,0.00011098298,0.00009060408,0.00006159629,0.000058239704],"domain_scores_gemma":[0.9998182,0.00003878027,0.000021947804,0.000091101225,0.000018302908,0.000011647147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048014105,0.000029983838,0.000047411468,0.00007043461,0.000018406507,0.00001963613,0.000099148,0.000021153961,0.000006859049],"category_scores_gemma":[0.00010587492,0.000026016938,0.000007281134,0.00013469996,0.000014064714,0.0005445232,0.000043891174,0.00008035639,0.0000046498835],"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.0000024750777,0.000016616526,0.0040385285,0.0000063243037,0.0000010491489,1.8918436e-7,0.004589903,0.00053957006,0.08550814,0.14895134,0.000011780845,0.75633407],"study_design_scores_gemma":[0.00011511036,0.000033521,0.03723983,0.000017467351,5.8542037e-7,0.0000036471467,0.00018328738,0.9114715,0.049792465,0.00054145115,0.0005450248,0.000056103032],"about_ca_topic_score_codex":0.000036058995,"about_ca_topic_score_gemma":0.000035615263,"teacher_disagreement_score":0.91093194,"about_ca_system_score_codex":0.000017403509,"about_ca_system_score_gemma":0.000007973037,"threshold_uncertainty_score":0.106093995},"labels":[],"label_agreement":null},{"id":"W2153601367","doi":"","title":"A Novel Prioritization Technique for Solving Markov Decision Processes","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Backup; Computer science; Markov decision process; Prioritization; Overhead (engineering); Metric (unit); Markov process; Mathematical optimization; Sequence (biology); Function (biology); Markov chain; Computation; Distributed computing; Algorithm; Machine learning; Mathematics; Engineering","score_opus":0.04371288046499113,"score_gpt":0.31268359193981016,"score_spread":0.26897071147481905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153601367","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.00040520725,0.000029159439,0.9962578,0.000060170994,0.0001445905,0.00057371106,9.5221185e-7,0.00023587384,0.002292571],"genre_scores_gemma":[0.043631654,0.000026408057,0.95581275,0.0000982266,0.000036284877,0.00020540174,0.0000017540722,0.000007739543,0.00017978779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99921227,0.000009196063,0.00019490618,0.00025747996,0.00017503579,0.00015109785],"domain_scores_gemma":[0.9990828,0.0001902143,0.000073769166,0.0003145656,0.00030369483,0.000034955287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042999722,0.000078063706,0.00008068298,0.00009589584,0.00018757721,0.000050314047,0.00046346986,0.00006135265,0.0000030276888],"category_scores_gemma":[0.00095704076,0.00007021658,0.000024949979,0.0004840137,0.000024209952,0.00074294547,0.000088444234,0.00004385609,0.0000046807845],"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.000056165478,0.00031234458,0.0006144111,0.00032408352,0.000010707766,0.0000027826006,0.0011418738,0.00010551163,0.318853,0.4787717,0.002054688,0.19775273],"study_design_scores_gemma":[0.0005624175,0.0002006032,0.0020173313,0.00011349325,0.000004222782,0.00025911545,0.00002426436,0.1720317,0.80129135,0.018325277,0.0047645764,0.00040566656],"about_ca_topic_score_codex":0.0000035651062,"about_ca_topic_score_gemma":0.0000020533275,"teacher_disagreement_score":0.48243833,"about_ca_system_score_codex":0.00003763837,"about_ca_system_score_gemma":0.00012478375,"threshold_uncertainty_score":0.2863349},"labels":[],"label_agreement":null},{"id":"W2153606867","doi":"10.1109/ccece.2003.1226154","title":"Translating LTL specification to MDG-HDL","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Benchmark (surveying); Computer science; Automaton; Linear temporal logic; Model checking; Programming language; Set (abstract data type); Formal verification; Büchi automaton; Theoretical computer science; Software engineering","score_opus":0.046207815087053794,"score_gpt":0.30966791280916234,"score_spread":0.26346009772210854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153606867","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.0053036488,0.000010828214,0.9585957,0.0030501387,0.00024825757,0.00015480338,2.4470066e-7,0.00024675057,0.032389615],"genre_scores_gemma":[0.28979075,0.0000011858992,0.7096976,0.0003118269,0.000041836327,0.000010453541,5.055875e-7,0.000003890894,0.00014193852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991806,0.00002933026,0.00018604108,0.00025691927,0.00018446939,0.00016260662],"domain_scores_gemma":[0.9993306,0.000016068361,0.000038293343,0.0004919399,0.000048409154,0.00007472756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037644274,0.000070072485,0.00006438828,0.00007840739,0.00007593175,0.000087088665,0.00054836087,0.000033212793,0.000020774674],"category_scores_gemma":[0.0000545907,0.000066090746,0.000027547589,0.0004703416,0.000011849118,0.00048766256,0.000039643477,0.00006244101,0.0004293294],"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.000001526045,0.00001915822,0.000020617139,0.0000029482449,0.0000013821566,4.971392e-7,0.0012162756,0.0010027664,0.009984223,0.7708154,0.000041279643,0.21689396],"study_design_scores_gemma":[0.0014628831,0.0004881507,0.044261828,0.00009019124,0.000010786915,0.000060630795,0.00042765218,0.084230155,0.67124325,0.13900928,0.057431523,0.0012836552],"about_ca_topic_score_codex":0.000030206933,"about_ca_topic_score_gemma":0.000009293323,"teacher_disagreement_score":0.66125906,"about_ca_system_score_codex":0.000067952315,"about_ca_system_score_gemma":0.000032203305,"threshold_uncertainty_score":0.5518304},"labels":[],"label_agreement":null},{"id":"W2153925299","doi":"10.5555/1998496.1998532","title":"Predicate abstraction with adjustable-block encoding","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Encoding (memory); Unification; Predicate abstraction; Block (permutation group theory); Programming language; Predicate (mathematical logic); Theoretical computer science; Abstraction; Algorithm; Parallel computing; Mathematics; Model checking; Artificial intelligence","score_opus":0.016855078466746158,"score_gpt":0.2625197398130171,"score_spread":0.2456646613462709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153925299","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.047794074,0.0000028743339,0.89062357,0.00026438895,0.00055912015,0.00010230003,2.3765132e-7,0.00030949505,0.060343944],"genre_scores_gemma":[0.4819978,0.0000014683043,0.5174755,0.000046550147,0.00004153065,0.000008383602,3.5039648e-7,0.0000031532518,0.0004253073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927896,0.00001903925,0.000120762794,0.00022080327,0.00019889533,0.00016151769],"domain_scores_gemma":[0.999287,0.00003329415,0.00007412204,0.00047443138,0.000065361055,0.00006575922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004031386,0.000070406,0.000057402303,0.000059850325,0.000090996626,0.00009739692,0.00044211056,0.000053175732,0.00004376763],"category_scores_gemma":[0.00004619291,0.000053180767,0.000013883098,0.00022359437,0.000033406202,0.0009238994,0.000055500182,0.00022444692,0.00008454822],"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.000019776495,0.00008946084,0.0017487908,0.000023984958,0.000014786304,0.000006077711,0.00044657776,0.00023396047,0.1262627,0.7700104,0.00083188334,0.10031162],"study_design_scores_gemma":[0.000863905,0.00031242828,0.0758925,0.000031107727,0.0000189479,0.00038851163,0.00012037257,0.30211484,0.5747745,0.005220469,0.039575376,0.0006870464],"about_ca_topic_score_codex":0.000027823167,"about_ca_topic_score_gemma":0.000018812707,"teacher_disagreement_score":0.76478994,"about_ca_system_score_codex":0.000013623952,"about_ca_system_score_gemma":0.00004027384,"threshold_uncertainty_score":0.21686487},"labels":[],"label_agreement":null},{"id":"W2154269166","doi":"10.1109/tc.2010.74","title":"Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":35,"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":"","keywords":"Computer science; Very-large-scale integration; Encoding (memory); Satisfiability; Computability; Algorithm; Sequential logic; Theoretical computer science; True quantified Boolean formula; Computer engineering; Logic gate; Embedded system; Artificial intelligence","score_opus":0.040505280702170424,"score_gpt":0.27504136869582535,"score_spread":0.23453608799365494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154269166","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.0034593432,0.0000032056673,0.9936746,0.0006887506,0.00078805553,0.0009895649,0.000022460847,0.00028594022,0.00008812325],"genre_scores_gemma":[0.38124844,0.0000034643567,0.6178738,0.00027007255,0.0000606199,0.0004818891,0.0000022420045,0.0000148833315,0.000044601897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870527,0.000029355493,0.0002362272,0.00057510356,0.00019921098,0.00025480587],"domain_scores_gemma":[0.9984858,0.00035619643,0.00008626651,0.0006849802,0.00019486537,0.00019186828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030053666,0.00017961583,0.00014293635,0.00021803098,0.00041050816,0.00021452627,0.0006198596,0.00008633821,0.0000043989694],"category_scores_gemma":[0.00001566142,0.00017835069,0.00004821809,0.0005259128,0.000092107366,0.0004464276,0.0000043400355,0.00023031888,0.000023570281],"study_design_candidate":"design_other","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.00004392268,0.0005489401,0.00008464091,0.00008358625,0.000072799376,0.000001653598,0.0016696679,0.05896666,0.06729872,0.05003764,0.0006881975,0.8205036],"study_design_scores_gemma":[0.0018518982,0.0012618765,0.0018142059,0.00008706018,0.00009390889,0.00020701671,0.000060200608,0.75687176,0.20439109,0.0009885285,0.031113554,0.0012588956],"about_ca_topic_score_codex":0.000013531916,"about_ca_topic_score_gemma":0.000026654361,"teacher_disagreement_score":0.8192447,"about_ca_system_score_codex":0.0000465882,"about_ca_system_score_gemma":0.0000733396,"threshold_uncertainty_score":0.727293},"labels":[],"label_agreement":null},{"id":"W2154274494","doi":"10.1007/978-3-540-74610-2_12","title":"Logic Programming Approach to Automata-Based Decision Procedures","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"Datalog; Computer science; Logic programming; Automaton; Programming language; Theoretical computer science; Focus (optics); Decision problem","score_opus":0.05198899101779367,"score_gpt":0.3219868572395209,"score_spread":0.2699978662217273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154274494","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.000021738777,0.00015146422,0.99068224,0.00019568553,0.0013903216,0.00117936,0.0000019023769,0.00052961154,0.0058476804],"genre_scores_gemma":[0.008714026,0.000004433212,0.98865175,0.0021987145,0.0002690337,0.000043368458,0.0000052816704,0.00004152818,0.00007187549],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941595,0.0000500102,0.00077044015,0.0022201887,0.0018164087,0.0009834296],"domain_scores_gemma":[0.99620366,0.00052272395,0.00036551664,0.0021731597,0.00040587207,0.0003290557],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0032710638,0.0006495951,0.0005609357,0.0017670381,0.00033118305,0.00083954603,0.005460748,0.00047689117,0.0000045626584],"category_scores_gemma":[0.00073583063,0.0005681606,0.00014564928,0.0017172932,0.00052419904,0.0006564613,0.0012861878,0.0008337501,0.000071143004],"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.000013053638,0.0000662315,0.000009641233,0.00007248795,0.0000032111504,0.000017167285,0.0002962111,0.05588372,0.000032225373,0.05245678,0.000014447173,0.8911348],"study_design_scores_gemma":[0.00026561643,0.0003339841,0.00017804553,0.0005274965,0.000006742396,0.00007732405,1.9910654e-7,0.92088044,0.0017592384,0.071361795,0.0037242072,0.00088493177],"about_ca_topic_score_codex":0.000008844737,"about_ca_topic_score_gemma":0.000018945097,"teacher_disagreement_score":0.8902499,"about_ca_system_score_codex":0.00052676414,"about_ca_system_score_gemma":0.00086258806,"threshold_uncertainty_score":0.9999202},"labels":[],"label_agreement":null},{"id":"W2155379435","doi":"10.1007/3-540-47884-1_8","title":"Translating Statecharts to B","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Programming language; Notation; Translation (biology); Code (set theory); Code generation; Class diagram; Theoretical computer science; Unified Modeling Language; Software; Operating system; Arithmetic; Set (abstract data type); Mathematics","score_opus":0.038511489866800176,"score_gpt":0.28295324781612824,"score_spread":0.24444175794932807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155379435","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.000018127781,0.00012243161,0.98648655,0.0009724487,0.0016937411,0.0004766536,0.000005522676,0.00026514966,0.009959365],"genre_scores_gemma":[0.011256617,0.000014993329,0.98661697,0.0013663007,0.00024661995,0.000012513599,0.0000016516788,0.000033036184,0.00045127657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961191,0.000043508855,0.0005725787,0.001519522,0.0010401056,0.00070517877],"domain_scores_gemma":[0.99750865,0.00020135555,0.00021690894,0.0016403152,0.00019436001,0.00023843927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012841906,0.000462058,0.00042554087,0.0009701977,0.0002326075,0.0004895225,0.0036189065,0.00026148005,0.000042410386],"category_scores_gemma":[0.0001352026,0.00045436673,0.00010043255,0.00088292675,0.00028672355,0.0007573678,0.00074373005,0.0007215835,0.00019537531],"study_design_candidate":"design_other","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.0000015787509,0.000010737541,0.0000064682836,0.000019818846,0.000003108057,0.000025937357,0.001498973,0.015846731,0.00019908542,0.044675168,0.000013160025,0.93769926],"study_design_scores_gemma":[0.00016981448,0.00025121486,0.00006984587,0.0003842669,0.0000048733586,0.000066678775,1.1196585e-7,0.86645,0.0042057033,0.120244674,0.007239333,0.00091344723],"about_ca_topic_score_codex":0.0000065721742,"about_ca_topic_score_gemma":0.000013851228,"teacher_disagreement_score":0.93678576,"about_ca_system_score_codex":0.00031350917,"about_ca_system_score_gemma":0.00019414455,"threshold_uncertainty_score":0.9997908},"labels":[],"label_agreement":null},{"id":"W2155675486","doi":"10.1109/iceccs.2008.9","title":"Revisiting Safe Realizability of Message Sequence Charts Specifications","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Calgary","funders":"","keywords":"Realizability; Computer science; Sequence (biology); Deadlock; Formal specification; Property (philosophy); Programming language; Sequence diagram; Measure (data warehouse); Theoretical computer science; Distributed computing; Unified Modeling Language; Software; Data mining","score_opus":0.19827951101943814,"score_gpt":0.33747110795812546,"score_spread":0.13919159693868732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155675486","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.019093331,0.000039894378,0.92848074,0.00063174195,0.00010312609,0.00014266037,0.0000027199276,0.00013228785,0.051373485],"genre_scores_gemma":[0.411279,0.000048406142,0.5883562,0.000082664425,0.000025888583,0.000007253113,0.0000014581987,0.0000027883386,0.00019637129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99880916,0.0001501812,0.0003664291,0.00029081642,0.0002355757,0.00014782496],"domain_scores_gemma":[0.9984679,0.000104307604,0.00016880268,0.0010372081,0.00016811713,0.000053665946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008260218,0.000076479286,0.00013384881,0.000058377987,0.00013351097,0.000015445203,0.00067478884,0.000037105856,0.000072869705],"category_scores_gemma":[0.00032903408,0.000071249306,0.000046305446,0.00047656902,0.0001344958,0.00050716265,0.00011079573,0.00007446449,0.00003329608],"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.0000023303417,0.00004303518,0.0030709046,0.00003752675,0.0000044594735,0.0000031449135,0.000922349,0.000036849124,0.014883341,0.958066,0.00045693375,0.02247311],"study_design_scores_gemma":[0.0004647248,0.00013366522,0.41392854,0.00014220057,0.00001314412,0.00028984973,0.0001696849,0.16337807,0.37022614,0.020875648,0.02952221,0.0008560919],"about_ca_topic_score_codex":0.000059781287,"about_ca_topic_score_gemma":5.900166e-7,"teacher_disagreement_score":0.93719035,"about_ca_system_score_codex":0.000043836313,"about_ca_system_score_gemma":0.000053896692,"threshold_uncertainty_score":0.29054624},"labels":[],"label_agreement":null},{"id":"W2156684181","doi":"10.1109/dsd.2003.1231963","title":"The application of formal verification to SPW designs","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; HOL; Formal verification; Programming language; Intelligent verification; Functional verification; Abstraction; Embedding; Formal methods; Automated theorem proving; Model checking; High-level verification; Extensibility; Computer architecture; Theoretical computer science; Software; Artificial intelligence; Software development","score_opus":0.04497270470847224,"score_gpt":0.31549535210230484,"score_spread":0.2705226473938326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156684181","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.002173076,0.000016554342,0.98360205,0.00020297918,0.00013186142,0.00028646545,2.0918026e-7,0.00005734423,0.013529458],"genre_scores_gemma":[0.41403472,0.0000037973998,0.58571464,0.000068960275,0.000006308633,0.000053445365,3.3420062e-7,0.0000024270043,0.00011535743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991994,0.00009844137,0.00021344266,0.00016123339,0.00017355861,0.0001539304],"domain_scores_gemma":[0.9989363,0.00008182829,0.000090296504,0.0007380709,0.00011043933,0.000043081265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012151368,0.000055150944,0.0000542905,0.00004054876,0.00014296602,0.000043953463,0.0006030356,0.000029218007,0.0000029211994],"category_scores_gemma":[0.0001998423,0.000039372146,0.0000236766,0.00043595937,0.000026999385,0.00038908928,0.000040712875,0.00003951003,0.000071165465],"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.0000023561347,0.000010766128,0.000050906583,0.000001912056,0.0000014047615,1.1021557e-8,0.00011305124,0.000081005135,0.009523487,0.8893485,0.000087084416,0.100779526],"study_design_scores_gemma":[0.00018505231,0.00016368713,0.010006375,0.000004429664,0.000004782333,0.0000075504795,0.00012822547,0.117970854,0.7133537,0.024722097,0.13324133,0.00021194422],"about_ca_topic_score_codex":0.000008489133,"about_ca_topic_score_gemma":0.000002911249,"teacher_disagreement_score":0.8646264,"about_ca_system_score_codex":0.000027897822,"about_ca_system_score_gemma":0.00003445679,"threshold_uncertainty_score":0.16055495},"labels":[],"label_agreement":null},{"id":"W2157985692","doi":"10.1145/2494444.2494476","title":"Static analysis of concurrent programs by adapted vector clock","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Deadlock; Computer science; Erasmus+; Spectrum analyzer; Programming language; Deadlock prevention algorithms; Static analysis; Abstract interpretation; Theoretical computer science","score_opus":0.029247023413529884,"score_gpt":0.29070747004118536,"score_spread":0.2614604466276555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157985692","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.0388159,0.000039110786,0.95984703,0.00016867348,0.00011899155,0.00023990001,0.0000019995928,0.00009502928,0.0006733369],"genre_scores_gemma":[0.5548154,0.000003047093,0.44492972,0.000047785787,0.000002856008,0.000037260226,0.000009350204,0.000002231616,0.00015234476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990894,0.000084916515,0.00025986973,0.00019248798,0.00022760694,0.00014570203],"domain_scores_gemma":[0.99918836,0.000049134796,0.00012757216,0.0004234203,0.00014938334,0.000062120664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020509076,0.00007227672,0.00017190314,0.00011220676,0.000020825588,0.0000587328,0.00047695145,0.000027090051,0.00014381149],"category_scores_gemma":[0.000044567027,0.000057482823,0.0000655673,0.0011956873,0.00003885716,0.00031854815,0.00006940647,0.000045677112,0.000048685644],"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.0000017548184,0.00029674376,0.0020186156,0.000030443203,0.00045399342,2.1768551e-7,0.00077357463,0.00015215855,0.005591736,0.28874213,0.0047027566,0.6972359],"study_design_scores_gemma":[0.00009865745,0.000119799464,0.0109058395,0.0000042942806,0.00006722855,2.4107007e-7,0.000038592174,0.9785961,0.007730269,0.00026087632,0.0020733117,0.00010477083],"about_ca_topic_score_codex":0.00020176583,"about_ca_topic_score_gemma":0.0000057254088,"teacher_disagreement_score":0.978444,"about_ca_system_score_codex":0.00002232226,"about_ca_system_score_gemma":0.000017417919,"threshold_uncertainty_score":0.23440816},"labels":[],"label_agreement":null},{"id":"W2158266165","doi":"10.1109/ccece.2000.849694","title":"Modeling and verification of embedded systems using Cadence SMV","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Formal verification; Model checking; Verification; Functional verification; Intelligent verification; Cadence; Verilog; Runtime verification; Embedded system; Software verification; Formal methods; Abstraction; Electronic system-level design and verification; High-level verification; Programming language; Software; Software system; Software construction; Engineering; Field-programmable gate array","score_opus":0.1229041462733915,"score_gpt":0.3061002754615999,"score_spread":0.1831961291882084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158266165","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.123689584,0.00028284857,0.8748745,0.000016615208,0.00015219231,0.00008522688,2.443405e-7,0.000049943457,0.00084889645],"genre_scores_gemma":[0.58236325,0.000016896516,0.41756618,0.0000067672777,0.000008840176,0.000002127758,8.244785e-8,0.0000020032394,0.000033849123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992774,0.000074971744,0.00021499462,0.00018430907,0.0001519554,0.000096372336],"domain_scores_gemma":[0.9994325,0.00002334393,0.00007175928,0.00035988455,0.000080191145,0.000032314274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004178167,0.000055875018,0.000087441986,0.000063589345,0.000050378694,0.0000525809,0.00026229493,0.000041140396,0.0000037946431],"category_scores_gemma":[0.00006261269,0.000052676696,0.000012267162,0.00020681793,0.000024632369,0.0005484325,0.000051959865,0.000045097033,0.000004506815],"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.0000034277837,0.000054993114,0.00021488829,0.00015328918,0.000012131471,9.646058e-7,0.0034903514,0.2077346,0.082241006,0.6758023,0.000028619143,0.030263463],"study_design_scores_gemma":[0.000047464953,0.000011134623,0.000039268678,0.00001974263,0.000002304552,0.0000125407205,0.00007318411,0.9950135,0.004488568,0.00022063541,0.000011292659,0.000060401566],"about_ca_topic_score_codex":0.00008345958,"about_ca_topic_score_gemma":3.4374628e-7,"teacher_disagreement_score":0.78727883,"about_ca_system_score_codex":0.000021455038,"about_ca_system_score_gemma":0.0000069293387,"threshold_uncertainty_score":0.21480933},"labels":[],"label_agreement":null},{"id":"W2159348557","doi":"10.1142/s0218126607004052","title":"A DESIGN FOR VERIFICATION APPROACH USING AN EMBEDDING OF PSL IN AsmL","year":2007,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"SiliconPro (Canada); Concordia University","funders":"","keywords":"Computer science; Abstract state machines; Programming language; Embedding; Unified Modeling Language; Finite-state machine; Code (set theory); Model checking; Embedded system; Theoretical computer science; Software; Artificial intelligence","score_opus":0.1152658094134228,"score_gpt":0.34237714236379774,"score_spread":0.22711133295037494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159348557","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.12032865,0.00020049886,0.8785888,0.00000420347,0.0006049115,0.00023598548,2.9461694e-7,0.00000783879,0.000028847913],"genre_scores_gemma":[0.5524012,0.0000032312485,0.44751415,0.0000063143198,0.00006890264,0.000001211098,1.5595684e-7,0.0000040981454,7.57637e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985005,0.00021249491,0.0007257799,0.00015822877,0.00023542065,0.0001675338],"domain_scores_gemma":[0.99855334,0.00017635999,0.0007638629,0.00020503026,0.0002233508,0.00007803476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054724067,0.00009015762,0.00027260382,0.0003462338,0.000049106842,0.00009034494,0.00040111365,0.000066637236,6.152743e-8],"category_scores_gemma":[0.00004654032,0.00008325519,0.000044724067,0.00029136924,0.00002532704,0.0007702238,0.000022038264,0.00009557331,4.968193e-8],"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.00010944745,0.00055598025,0.0013658655,0.0009294251,0.00010433376,0.000019292482,0.013318292,0.53306794,0.074902035,0.10410286,0.0000377298,0.27148682],"study_design_scores_gemma":[0.00043894796,0.00024499654,0.0016341993,0.0001481577,0.000007866811,0.00031158575,0.00029830678,0.9944154,0.002086585,0.00028824303,0.00003173524,0.00009397551],"about_ca_topic_score_codex":0.000010359878,"about_ca_topic_score_gemma":1.2605867e-7,"teacher_disagreement_score":0.46134746,"about_ca_system_score_codex":0.000080273785,"about_ca_system_score_gemma":0.0000674622,"threshold_uncertainty_score":0.3395048},"labels":[],"label_agreement":null},{"id":"W2159356489","doi":"10.1023/b:aurc.0000030902.91316.b9","title":"Malyugin's Theorems: A New Concept in Logical Control, VLSI Design, and Data Structures for New Technologies","year":2004,"lang":"en","type":"article","venue":"Automation and Remote Control","topic":"Formal Methods in Verification","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 Calgary","funders":"","keywords":"Arithmetic function; Linearization; Logical data model; Very-large-scale integration; Computer science; Logical conjunction; Theoretical computer science; Arithmetic; Control (management); Mathematics; Algebra over a field; Pure mathematics; Nonlinear system; Programming language; Discrete mathematics; Artificial intelligence; Software engineering; Embedded system; Data modeling","score_opus":0.04248148558181747,"score_gpt":0.31551785144763284,"score_spread":0.27303636586581537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159356489","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.0011807781,0.0010063893,0.98990464,0.0065146633,0.00012260982,0.0008761128,0.0000064352676,0.0003641094,0.000024235367],"genre_scores_gemma":[0.40217984,0.000047833513,0.59737843,0.0003379833,0.00002894366,0.0000028725294,0.00000442124,0.0000046477617,0.0000150029655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883676,0.00010983437,0.00027928964,0.00043041058,0.00013124968,0.00021243465],"domain_scores_gemma":[0.99892205,0.00027216613,0.00014119603,0.0005551429,0.000040529605,0.00006892125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006214666,0.0001462978,0.00024137239,0.00011875972,0.00008999836,0.00018277272,0.00062195177,0.00015980695,0.0000020175685],"category_scores_gemma":[0.00076780684,0.00011180029,0.00002045826,0.00017284397,0.00013510685,0.0006477816,0.000111613605,0.000115695446,0.0000013772466],"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.00005152427,0.000008724929,0.000014597675,0.000009729362,0.000014291124,0.0000019570239,0.00028450968,0.0012194728,0.0011749191,0.25949198,0.00016598197,0.7375623],"study_design_scores_gemma":[0.004913981,0.00014091026,0.0032107465,0.000029224047,0.000014151251,0.000029373967,0.00005064561,0.74682826,0.0008706491,0.24285439,0.00090869115,0.00014899735],"about_ca_topic_score_codex":0.000065323096,"about_ca_topic_score_gemma":0.0000070209708,"teacher_disagreement_score":0.74560875,"about_ca_system_score_codex":0.00003329747,"about_ca_system_score_gemma":0.00012936484,"threshold_uncertainty_score":0.45590836},"labels":[],"label_agreement":null},{"id":"W2159544030","doi":"10.4018/978-1-60960-165-2.ch005","title":"Inference Strategies for Solving Semi-Markov Decision Processes","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 British Columbia","funders":"","keywords":"Markov decision process; Inference; Computer science; Partially observable Markov decision process; Connection (principal bundle); Artificial intelligence; Probabilistic logic; Graphical model; Machine learning; Reinforcement learning; Markov chain; Influence diagram; Maximization; Markov process; Markov model; Mathematical optimization; Decision tree; Mathematics","score_opus":0.05404889460258089,"score_gpt":0.31460208889673624,"score_spread":0.26055319429415535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159544030","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.000010612084,0.0002085053,0.51686984,0.0000044279695,0.0004805383,0.0003351448,0.000025682775,0.000185418,0.48187983],"genre_scores_gemma":[0.04254495,0.000032423683,0.94324976,0.00021682063,0.00023356757,0.00012371947,0.000004475683,0.00005089062,0.01354341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781215,0.000015958401,0.00053493166,0.00078404404,0.00044146404,0.00041142115],"domain_scores_gemma":[0.9975256,0.00026778932,0.00045696794,0.0010238651,0.0005933416,0.00013245238],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003896954,0.00045803178,0.0004173516,0.00009965314,0.0001842154,0.0004679881,0.0018286128,0.00045423242,0.0000119541],"category_scores_gemma":[0.0003417063,0.00043628307,0.00014437287,0.000047864458,0.00011844788,0.00059127697,0.00045008483,0.000242597,0.000064541964],"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.000024837655,0.0000059228214,0.0000022887195,0.00015248773,0.000019826488,0.000003896253,0.0001635784,0.000006367393,0.00001535887,0.9043019,0.00036823816,0.09493529],"study_design_scores_gemma":[0.00015714073,0.00016132332,0.000013713244,0.0005007397,0.00002567596,0.000019819365,0.0000108196555,0.0010346961,0.000375007,0.98182464,0.015385648,0.00049079745],"about_ca_topic_score_codex":0.000025863828,"about_ca_topic_score_gemma":0.000055895067,"teacher_disagreement_score":0.46833643,"about_ca_system_score_codex":0.00017081805,"about_ca_system_score_gemma":0.001053233,"threshold_uncertainty_score":0.9998089},"labels":[],"label_agreement":null},{"id":"W2159636735","doi":"10.1007/978-3-642-28412-0_6","title":"Towards a First-Order Deontic Action Logic","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Deontic logic; Computer science; Action (physics); Extension (predicate logic); Normal modal logic; Accessibility relation; Dynamic logic (digital electronics); Propositional calculus; Order (exchange); Artificial intelligence; Programming language; Theoretical computer science; Algorithm; Description logic; Intermediate logic; Epistemology; Multimodal logic; Philosophy","score_opus":0.0559099361370329,"score_gpt":0.3075559766692313,"score_spread":0.2516460405321984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159636735","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.000024677098,0.000764867,0.9891703,0.00071855757,0.0043077925,0.00042921596,0.0000018337756,0.00027358648,0.004309158],"genre_scores_gemma":[0.021928143,0.00013116167,0.9759985,0.00102324,0.00063566887,0.000020249192,0.0000034185189,0.000033482873,0.00022614372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608344,0.0000658098,0.0005515994,0.0013538792,0.0011080357,0.0008372077],"domain_scores_gemma":[0.99695915,0.00024654772,0.00039291126,0.0018256186,0.00036137074,0.00021442612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016627294,0.0005495948,0.00048283872,0.0008261402,0.00033479754,0.0004717272,0.0035343317,0.00047818254,0.000056917084],"category_scores_gemma":[0.00029261678,0.00049865857,0.00013117766,0.0009633332,0.00058898603,0.001459779,0.0012169416,0.00092430407,0.00019188944],"study_design_candidate":"design_other","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.000004302468,0.000028348673,0.000027856178,0.000051274237,0.0000072334656,0.000011312508,0.0005834074,0.004979519,0.00007618457,0.08658636,0.000013812803,0.9076304],"study_design_scores_gemma":[0.00026165962,0.00021603898,0.00090548676,0.00029523394,0.000019350482,0.00018273293,2.2724231e-7,0.7098814,0.0023243017,0.27391556,0.010898215,0.0010997634],"about_ca_topic_score_codex":0.000029598468,"about_ca_topic_score_gemma":0.00005651421,"teacher_disagreement_score":0.9065306,"about_ca_system_score_codex":0.00059666554,"about_ca_system_score_gemma":0.00045508533,"threshold_uncertainty_score":0.9997465},"labels":[],"label_agreement":null},{"id":"W2160517518","doi":"10.1109/iceccs.2000.873924","title":"Managing complexity in real-time reactive systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Process (computing); Work (physics); Engineering; Programming language","score_opus":0.12041456917637863,"score_gpt":0.31501078448623027,"score_spread":0.19459621530985163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160517518","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.0059168213,0.000024141313,0.64258486,0.00028846634,0.00021701692,0.00016573031,3.7165796e-7,0.0002460973,0.35055652],"genre_scores_gemma":[0.21116535,0.000026239057,0.78620386,0.000060841758,0.000029575993,0.0000181911,6.780453e-7,0.0000061244637,0.0024891305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909276,0.00015120687,0.0001826264,0.0002378219,0.00015713258,0.00017847272],"domain_scores_gemma":[0.99933696,0.000057519712,0.00006218188,0.00047449002,0.00003065114,0.00003820669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004995923,0.000070802125,0.00011177985,0.00010960426,0.00004236535,0.00008199383,0.00048375255,0.000032078384,0.0000463373],"category_scores_gemma":[0.000032368243,0.00006668555,0.000017929608,0.0003707554,0.00003293974,0.0005786286,0.00010655278,0.00008094619,0.00042784173],"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.0000021500139,0.000059855494,0.00026568284,0.00001688304,0.0000048239476,0.000010247009,0.0009595876,0.0003544014,0.0014887045,0.97907555,0.0009136028,0.01684851],"study_design_scores_gemma":[0.00008990717,0.000017319586,0.003964717,0.000014635604,6.4382937e-7,0.000010733434,0.00004096853,0.9904091,0.00047320436,0.004425438,0.00045937893,0.00009399673],"about_ca_topic_score_codex":0.00047480132,"about_ca_topic_score_gemma":0.000005940146,"teacher_disagreement_score":0.99005467,"about_ca_system_score_codex":0.00009686313,"about_ca_system_score_gemma":0.000004024198,"threshold_uncertainty_score":0.54991823},"labels":[],"label_agreement":null},{"id":"W2160664342","doi":"10.1109/mwscas.1994.519194","title":"Token ring arbitration circuits for dynamic priority algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Waterloo; University of Regina","funders":"","keywords":"Computer science; Security token; Arbitration; Token ring; Ring (chemistry); Algorithm; Electronic circuit; Parallel computing; Computer network; Engineering; Electrical engineering","score_opus":0.05134657811609136,"score_gpt":0.30808000036872046,"score_spread":0.2567334222526291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160664342","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.0026488174,0.0000440064,0.98340964,0.00024141179,0.0004724298,0.00029397954,0.0000011166301,0.00024591366,0.01264271],"genre_scores_gemma":[0.17473981,0.000010218224,0.8243568,0.00017928323,0.000043824442,0.00004015756,0.0000015268095,0.0000054530965,0.00062296266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915844,0.000037714824,0.00018472299,0.00026689915,0.000157182,0.00019505879],"domain_scores_gemma":[0.9993603,0.00005694437,0.00006459647,0.00039596637,0.000074347925,0.000047806323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042118353,0.00008091265,0.00008284103,0.000059896433,0.00011657963,0.00011244345,0.00044570616,0.00005370523,0.000020702391],"category_scores_gemma":[0.000093474824,0.00007934853,0.00004216916,0.00020718464,0.0000158761,0.00080177415,0.000050456714,0.00007270791,0.000053596475],"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":[7.315221e-7,0.00005549552,0.00005803114,0.000024085506,0.000007108532,6.262114e-7,0.0005732638,0.00007827511,0.0034311041,0.2643651,0.00017128771,0.7312349],"study_design_scores_gemma":[0.00016172776,0.000046998022,0.0018297689,0.000004288505,0.0000023663729,0.0000062470554,0.000007770696,0.98655283,0.0054009343,0.0042395573,0.0016331242,0.00011436833],"about_ca_topic_score_codex":0.0000065667623,"about_ca_topic_score_gemma":0.000004056364,"teacher_disagreement_score":0.9864746,"about_ca_system_score_codex":0.00006988912,"about_ca_system_score_gemma":0.00001065267,"threshold_uncertainty_score":0.32357392},"labels":[],"label_agreement":null},{"id":"W2161320179","doi":"10.1109/iccd.1998.727045","title":"Model checking of a real ATM switch","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Concordia University","funders":"Scheme for Promotion of Academic and Research Collaboration","keywords":"Computer science; FIFO (computing and electronics); Asynchronous Transfer Mode; Model checking; Asynchronous communication; Abstraction; Network switch; State (computer science); Embedded system; Transfer (computing); State space; Parallel computing; Computer hardware; Computer network; Programming language","score_opus":0.1128650639139806,"score_gpt":0.30780555246706964,"score_spread":0.19494048855308904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161320179","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.0154709425,0.000011834847,0.88151187,0.00009061559,0.000056067704,0.000037470272,1.2595616e-7,0.000078195466,0.102742895],"genre_scores_gemma":[0.41691262,0.000011600577,0.5824056,0.000033205957,0.000006286193,0.0000019844997,4.6878572e-8,0.0000016724777,0.00062696147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994724,0.000019226254,0.00013810906,0.00013065305,0.0001397136,0.000099889876],"domain_scores_gemma":[0.99947554,0.000015643827,0.000053470765,0.00038871766,0.000041412495,0.000025233237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022540809,0.000042803258,0.000065352746,0.000035126828,0.00002404774,0.00001673124,0.0004210281,0.000028441487,0.000025350852],"category_scores_gemma":[0.000027972528,0.000037527778,0.000024573677,0.00018669074,0.000015672123,0.00030542433,0.00008590425,0.00004095023,0.000027557047],"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.0000010711352,0.000044317832,0.00021759975,0.000010942996,0.000003647285,4.8690697e-7,0.001276103,0.0018607246,0.008875473,0.8948196,0.0004274157,0.09246257],"study_design_scores_gemma":[0.00005243401,0.000014703295,0.00038247797,0.0000034815002,8.2461804e-7,0.0000019044255,0.0000056993044,0.9811251,0.014804908,0.003487767,0.000075554264,0.000045100438],"about_ca_topic_score_codex":0.000022589458,"about_ca_topic_score_gemma":0.0000013126827,"teacher_disagreement_score":0.97926444,"about_ca_system_score_codex":0.000015054309,"about_ca_system_score_gemma":0.0000068617846,"threshold_uncertainty_score":0.15303384},"labels":[],"label_agreement":null},{"id":"W2161390130","doi":"","title":"A framework for system level verification : the SystemC Case","year":2005,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"SystemC; Computer science; Electronic system-level design and verification; Intelligent verification; High-level verification; Functional verification; System on a chip; Formal verification; Transaction-level modeling; Programming language; Runtime verification; Random testing; Computer architecture; Embedded system; Software; Test case; Software system; Software construction","score_opus":0.08966554500480338,"score_gpt":0.34810462736219544,"score_spread":0.25843908235739205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161390130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08426893,0.00061288883,0.8165167,0.0006900461,0.0071055572,0.004985773,0.000070013564,0.00081713765,0.08493298],"genre_scores_gemma":[0.9240989,0.00004016136,0.048447005,0.000007941227,0.0011125228,0.00011747495,0.00005922988,0.000068847934,0.02604789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99484813,0.0015345075,0.0005919815,0.001151736,0.0010155246,0.00085810345],"domain_scores_gemma":[0.99481505,0.00106962,0.0006009843,0.002423509,0.000835183,0.00025563437],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002837545,0.00038215826,0.0004530683,0.0010120834,0.002296734,0.00064598845,0.0032471486,0.00066673406,0.000004182169],"category_scores_gemma":[0.00044628317,0.00035746736,0.00032120646,0.0019496941,0.0001902066,0.00077261584,0.00023186186,0.0014852571,0.000057696612],"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.00021702194,0.000055446857,0.00015923638,0.0008812114,0.000116180156,0.00083444273,0.0012261574,0.000030450732,0.00048705383,0.99119,0.00044927173,0.004353526],"study_design_scores_gemma":[0.0050469306,0.0037368096,0.038783535,0.006341805,0.0013117114,0.013420324,0.14921254,0.20942013,0.16836828,0.015975488,0.38091072,0.007471715],"about_ca_topic_score_codex":0.0026901055,"about_ca_topic_score_gemma":0.0027470454,"teacher_disagreement_score":0.97521454,"about_ca_system_score_codex":0.0021423153,"about_ca_system_score_gemma":0.0010974569,"threshold_uncertainty_score":0.9998877},"labels":[],"label_agreement":null},{"id":"W2161526001","doi":"10.1109/hldvt.2005.1568836","title":"B-cubing theory: new possibilities for efficient SAT-solving","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 British Columbia","funders":"","keywords":"Computer science; Correctness; Boolean satisfiability problem; Maximum satisfiability problem; Generalization; Range (aeronautics); Boolean expression; Pruning; Theoretical computer science; Solver; Standard Boolean model; Satisfiability modulo theories; Boolean circuit; And-inverter graph; Boolean function; Programming language; Algorithm; Mathematics","score_opus":0.02362827668597089,"score_gpt":0.28046964469865204,"score_spread":0.25684136801268115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161526001","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.018528849,0.000100595935,0.967838,0.00018140073,0.00044301158,0.00022756425,7.428898e-7,0.00027286942,0.012407004],"genre_scores_gemma":[0.16620529,3.4372576e-7,0.8278734,0.00011915481,0.00011908931,0.000013446269,0.000001375809,0.000006713348,0.0056611663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990493,0.00006279762,0.00020766727,0.0002789814,0.00015197565,0.0002492953],"domain_scores_gemma":[0.99908614,0.00028214123,0.00006501811,0.0004642104,0.000059544018,0.000042918753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009988662,0.0000919448,0.00009389274,0.00006927256,0.00013847137,0.00017738409,0.00051006296,0.000038701874,0.000017321054],"category_scores_gemma":[0.00019786849,0.00007757814,0.000060744504,0.00018353791,0.00003237258,0.00026083487,0.000102496386,0.0000467003,0.00002713515],"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.000004207667,0.000016159102,0.000040623752,0.000008522048,0.0000017858384,1.3913358e-7,0.00032210708,0.0010356514,0.0009904748,0.96808934,0.00057751936,0.028913481],"study_design_scores_gemma":[0.00034785643,0.00007715722,0.0020159157,0.000020545609,0.000005427365,0.0000066169764,0.00015794269,0.57506096,0.036903992,0.38141343,0.003739756,0.00025037953],"about_ca_topic_score_codex":0.00009210464,"about_ca_topic_score_gemma":0.0000060082334,"teacher_disagreement_score":0.5866759,"about_ca_system_score_codex":0.000057647812,"about_ca_system_score_gemma":0.00006319726,"threshold_uncertainty_score":0.31635448},"labels":[],"label_agreement":null},{"id":"W2161797215","doi":"10.1016/s0304-3975(99)00021-3","title":"Automata of asynchronous behaviors","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"Automaton; Asynchronous communication; Computer science; Theoretical computer science; Programming language; Computer network","score_opus":0.01062701085896973,"score_gpt":0.2832916232939664,"score_spread":0.2726646124349967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161797215","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.14033167,0.000009229396,0.8503346,0.0001330885,0.00030088887,0.0001091674,9.685715e-7,0.00020015166,0.008580226],"genre_scores_gemma":[0.52329755,0.0000028712273,0.47659308,0.00007232465,0.000022034501,0.0000027723186,1.8078609e-7,0.0000030152044,0.0000061803416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794215,0.0001172389,0.00032700525,0.000519469,0.0006852717,0.00040886685],"domain_scores_gemma":[0.9982825,0.00009019706,0.00007003541,0.0012590036,0.00012581135,0.0001724455],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016928358,0.00012976366,0.00017793372,0.00014160738,0.00019411194,0.000144407,0.0032916039,0.000046961588,0.00024089329],"category_scores_gemma":[0.000052799038,0.00011139446,0.000054035925,0.0012134028,0.0028349543,0.0008353902,0.0004413018,0.00012920628,0.00015408696],"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.0000029150037,0.000052389067,0.000022105132,0.000003110248,7.822595e-7,0.0000018635029,0.00019419931,0.000100974125,0.00058181677,0.7049486,0.00000654924,0.29408473],"study_design_scores_gemma":[0.00019097935,0.0003443928,0.005879599,0.000024012452,0.000004602869,0.000056739995,0.0000021838546,0.8912618,0.03554183,0.066315055,0.0001620186,0.00021674726],"about_ca_topic_score_codex":0.0000040913255,"about_ca_topic_score_gemma":7.760488e-8,"teacher_disagreement_score":0.89116085,"about_ca_system_score_codex":0.00004751268,"about_ca_system_score_gemma":0.000113091366,"threshold_uncertainty_score":0.99987876},"labels":[],"label_agreement":null},{"id":"W2162070270","doi":"10.1109/imtc.1998.679821","title":"Synthesis of multiplexor-based FPGAs using 123-decision diagrams","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 Windsor","funders":"","keywords":"Field-programmable gate array; Multiplexer; Binary decision diagram; Computer science; Programmable Array Logic; Programmable logic array; Programmable logic device; Diagram; Binary number; Logic synthesis; Parallel computing; Computer architecture; Embedded system; Computer hardware; Algorithm; Logic gate; Arithmetic; Mathematics; Multiplexing; Logic family","score_opus":0.0904268912087738,"score_gpt":0.3065031609679983,"score_spread":0.2160762697592245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162070270","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.08246688,0.000032493983,0.915162,0.00005936298,0.00020792992,0.00009968513,8.3126986e-7,0.000103167,0.0018676291],"genre_scores_gemma":[0.46235994,0.0000030943324,0.53755707,0.000039133804,0.000010143878,0.000003895998,8.317163e-8,0.000004003415,0.000022645676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988636,0.00010460435,0.0002931234,0.0002536555,0.00031050097,0.00017452208],"domain_scores_gemma":[0.9984845,0.00052122964,0.00012622333,0.000727231,0.000083690145,0.00005712994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004932059,0.00009748389,0.00014870828,0.00012497311,0.00006522591,0.000045871286,0.0006650809,0.000060363433,0.00009797954],"category_scores_gemma":[0.0006977285,0.00008238181,0.000072494055,0.00044180037,0.000051698404,0.00037465937,0.000091953414,0.000058193087,0.000073174284],"study_design_candidate":"design_other","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.000009125061,0.00023128935,0.0012596956,0.0000265308,0.0000076555325,0.0000030056867,0.000179199,0.005467733,0.015686493,0.021838361,0.00020087256,0.95509005],"study_design_scores_gemma":[0.000101571815,0.000024381907,0.001161003,0.00002713373,0.000003431909,0.0000022710249,0.0000060124785,0.82538486,0.1723987,0.0005124457,0.00028925936,0.00008894545],"about_ca_topic_score_codex":0.000039108225,"about_ca_topic_score_gemma":0.0000024733285,"teacher_disagreement_score":0.9550011,"about_ca_system_score_codex":0.00004001652,"about_ca_system_score_gemma":0.000011969596,"threshold_uncertainty_score":0.33594328},"labels":[],"label_agreement":null},{"id":"W2162351824","doi":"10.1007/978-3-540-77566-9_17","title":"A Useful Bounded Resource Functional Language","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Western University","funders":"","keywords":"Computer science; Compiler; Programming language; Functional programming; Recursion (computer science); Static analysis; Traverse; Software; Theoretical computer science","score_opus":0.03113242641672817,"score_gpt":0.26262491647131353,"score_spread":0.23149249005458536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162351824","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.0001661634,0.0006089106,0.9865453,0.00034416182,0.0016617252,0.0003054649,0.00000409062,0.00029955973,0.010064599],"genre_scores_gemma":[0.015733229,0.00004337993,0.98014903,0.0018730109,0.0007045099,0.000013535675,0.0000111711215,0.000041663072,0.001430448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958126,0.00007324817,0.00052869885,0.0015544397,0.0013898897,0.0006411056],"domain_scores_gemma":[0.9970473,0.00030462784,0.00032679315,0.001941312,0.00019912464,0.00018086005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011074432,0.0004915057,0.00043178236,0.00086435373,0.00039480542,0.00043188248,0.0032420408,0.00037106065,0.00004025314],"category_scores_gemma":[0.00018708267,0.00047177734,0.00014984804,0.0007308424,0.0009346397,0.000771086,0.001162758,0.000972313,0.00013942698],"study_design_candidate":"design_other","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.000024142986,0.00006042623,0.000042892163,0.000050047613,0.000021678197,0.00033314613,0.0034246235,0.029744966,0.00039741755,0.055107255,0.00063029927,0.9101631],"study_design_scores_gemma":[0.0006078849,0.0003009228,0.0011326374,0.00035151525,0.000012786214,0.0011728224,7.7158046e-7,0.86805207,0.0041717137,0.07520128,0.0473628,0.0016327865],"about_ca_topic_score_codex":0.000013632475,"about_ca_topic_score_gemma":0.000013270817,"teacher_disagreement_score":0.9085303,"about_ca_system_score_codex":0.0004522273,"about_ca_system_score_gemma":0.00061164214,"threshold_uncertainty_score":0.9997734},"labels":[],"label_agreement":null},{"id":"W2162407796","doi":"10.1109/ismvl.2002.1011094","title":"Variable selection heuristics and optimum decision trees-an experimental study","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Heuristics; Computation; Variable (mathematics); Heuristic; Decision tree; Computer science; Tree (set theory); Selection (genetic algorithm); Algorithm; Mathematical optimization; Feature selection; Node (physics); Mathematics; Artificial intelligence; Combinatorics; Engineering","score_opus":0.034669341975195514,"score_gpt":0.33486051456724714,"score_spread":0.30019117259205164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162407796","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.16222563,0.000021732038,0.8331426,0.0000024757428,0.00025536263,0.00017343539,1.245504e-7,0.000100577105,0.0040780874],"genre_scores_gemma":[0.422064,6.64163e-7,0.57778704,0.000021988624,0.000009136338,0.000008997453,1.8739054e-7,0.000003544043,0.00010445267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899787,0.00018660794,0.0001663813,0.00031929623,0.00019076712,0.00013909992],"domain_scores_gemma":[0.9994501,0.00005493668,0.0000403565,0.0003301682,0.0000499299,0.00007450128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007160725,0.00008948829,0.00008716094,0.000065117085,0.00015208965,0.00014495754,0.00022314953,0.00003714353,0.00004037106],"category_scores_gemma":[0.00011700831,0.00008004705,0.000009826393,0.00029858996,0.00001578992,0.00065243995,0.00006178403,0.00006524992,0.000010558284],"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.000020125379,0.0014576984,0.0036487896,0.0000020746338,0.000009920434,0.0000022635152,0.0013442693,0.0006392486,0.010329571,0.9677309,0.0001763077,0.014638863],"study_design_scores_gemma":[0.0016268018,0.0043558823,0.010625081,0.000008546563,0.000016314474,0.00011914003,0.0016877641,0.8380955,0.11771361,0.022474559,0.002716588,0.00056022196],"about_ca_topic_score_codex":0.000025952404,"about_ca_topic_score_gemma":0.0000044071485,"teacher_disagreement_score":0.9452563,"about_ca_system_score_codex":0.000043491633,"about_ca_system_score_gemma":0.000025507616,"threshold_uncertainty_score":0.3264224},"labels":[],"label_agreement":null},{"id":"W2162493591","doi":"10.1145/1065579.1065774","title":"Efficient SAT solving","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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 British Columbia","funders":"","keywords":"Computer science","score_opus":0.024260871888720864,"score_gpt":0.2889960319657439,"score_spread":0.264735160077023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162493591","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.015894111,0.000029382316,0.94528353,0.0005294126,0.00018877852,0.000041668052,4.944489e-8,0.00019494185,0.03783811],"genre_scores_gemma":[0.3376948,4.901126e-7,0.661557,0.00025873483,0.000036559493,0.000002077545,7.537603e-8,0.0000014833829,0.00044879437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999489,0.000024896694,0.00009426994,0.0001405832,0.0001255347,0.00012572588],"domain_scores_gemma":[0.99955505,0.00002312661,0.000023572511,0.0003398843,0.000023955025,0.00003440658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032614497,0.000040991792,0.000037692716,0.00003752556,0.00005290968,0.0000542025,0.0003995096,0.000018705337,0.00003969212],"category_scores_gemma":[0.00004200529,0.000034530338,0.000018880854,0.00014815926,0.000012085507,0.00012528744,0.00010584556,0.00004108719,0.000576127],"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":[5.672106e-7,0.000028859004,0.000055465083,0.0000020088473,0.0000014250165,3.7009872e-7,0.0003708861,0.007109679,0.0021521435,0.64778286,0.000517752,0.34197798],"study_design_scores_gemma":[0.00004517091,0.000008885352,0.0013769962,0.0000019527213,4.2964427e-7,0.0000048066554,0.0000061364585,0.97435933,0.012917196,0.00025631493,0.01096506,0.000057713532],"about_ca_topic_score_codex":0.0000025610154,"about_ca_topic_score_gemma":0.0000010451554,"teacher_disagreement_score":0.96724963,"about_ca_system_score_codex":0.000033925964,"about_ca_system_score_gemma":0.0000119121605,"threshold_uncertainty_score":0.74051386},"labels":[],"label_agreement":null},{"id":"W2162555555","doi":"10.1109/acc.2007.4282824","title":"Blocking in Parameterized Networks of Discrete-Event-Systems","year":2007,"lang":"en","type":"article","venue":"Proceedings of the ... American Control Conference/Proceedings of the American Control Conference","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Waterloo","funders":"","keywords":"Blocking (statistics); Undecidable problem; Decidability; Parameterized complexity; Computer science; Theoretical computer science; Process (computing); Class (philosophy); Component (thermodynamics); Distributed computing; Algorithm; Computer network; Artificial intelligence","score_opus":0.01504984748450166,"score_gpt":0.2669087959828706,"score_spread":0.25185894849836893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162555555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83461887,0.00014835363,0.15821558,0.0013436279,0.000562007,0.00202487,0.0000367921,0.00013893723,0.0029109323],"genre_scores_gemma":[0.9841353,0.000086941676,0.014945204,0.00042458327,0.00012622963,0.00014947413,6.1490715e-7,0.000062401414,0.00006920372],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927143,0.00012465728,0.0027921512,0.0012434138,0.0016612135,0.0014642779],"domain_scores_gemma":[0.98411447,0.00082322,0.010483516,0.0009021121,0.0033719705,0.00030469874],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0045869127,0.0008827548,0.0028804764,0.0006117892,0.00026085865,0.00035114473,0.007493754,0.00017044587,0.000006597769],"category_scores_gemma":[0.0019350912,0.0006344801,0.0007125915,0.0039481064,0.0038936993,0.0011075885,0.0009752855,0.0010794823,0.0000016579907],"study_design_candidate":"observational","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.0030364557,0.0004574706,0.21684773,0.00037998485,0.0005648538,0.0000016548627,0.00210591,0.0008329109,0.47746116,0.26060137,0.000115887546,0.03759461],"study_design_scores_gemma":[0.0076291184,0.0024704256,0.37422976,0.0018748938,0.00052565057,0.00008015776,0.008973947,0.5541384,0.043023292,0.0047711427,0.00033267922,0.0019504946],"about_ca_topic_score_codex":0.0015452411,"about_ca_topic_score_gemma":0.000031138337,"teacher_disagreement_score":0.5533055,"about_ca_system_score_codex":0.00023066154,"about_ca_system_score_gemma":0.00038564243,"threshold_uncertainty_score":0.99961066},"labels":[],"label_agreement":null},{"id":"W2162780302","doi":"10.1145/1101908.1101980","title":"Properties and scopes in web model checking","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Model checking; World Wide Web; Programming language","score_opus":0.08977451999202225,"score_gpt":0.28494899522635037,"score_spread":0.19517447523432813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162780302","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.21009791,0.0001946437,0.77624756,0.00064752327,0.000025503588,0.000075466756,4.864419e-8,0.00008231273,0.012629039],"genre_scores_gemma":[0.48064542,0.000012333548,0.51894236,0.00012037627,0.000006733162,0.0000042383526,1.6515942e-8,0.0000011896086,0.00026736778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960023,0.000019455108,0.000091578826,0.00012744618,0.000069768386,0.000091502865],"domain_scores_gemma":[0.999793,0.000005170967,0.000015265827,0.00015521949,0.000013525983,0.000017836626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028505555,0.00003963246,0.00004533201,0.000050931114,0.000025145957,0.000061205734,0.00020041091,0.000019268524,0.000002075941],"category_scores_gemma":[0.000026790858,0.00003053017,0.000005442442,0.00009824244,0.000019962043,0.0007154573,0.00009843712,0.000042561085,0.000009977232],"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.0000054584702,0.000046084264,0.00086998,0.000025352767,0.0000022066633,5.649283e-7,0.0037685027,0.018825825,0.031205786,0.4393511,0.00010736038,0.5057918],"study_design_scores_gemma":[0.00006270535,0.000005754704,0.00034838013,0.000011770974,2.19236e-7,0.0000018216466,0.000013192911,0.974901,0.023699695,0.00057730585,0.0003300581,0.000048096455],"about_ca_topic_score_codex":0.0000068143595,"about_ca_topic_score_gemma":0.00002656856,"teacher_disagreement_score":0.9560752,"about_ca_system_score_codex":0.000018073173,"about_ca_system_score_gemma":0.000023109604,"threshold_uncertainty_score":0.12449842},"labels":[],"label_agreement":null},{"id":"W2163348426","doi":"10.3233/sat190036","title":"An Extended Semidefinite Relaxation for Satisfiability","year":2007,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"Natural Sciences and Engineering Research Council of Canada; Technische Universiteit Delft","keywords":"Semidefinite programming; Relaxation (psychology); Satisfiability; Semidefinite embedding; Mathematics; Class (philosophy); Extension (predicate logic); Combinatorics; Mathematical optimization; Discrete mathematics; Computer science; Quadratically constrained quadratic program; Quadratic programming; Artificial intelligence","score_opus":0.046582195121019944,"score_gpt":0.35056300591015194,"score_spread":0.30398081078913197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163348426","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.38220522,0.000027851833,0.61676186,0.00014033957,0.0003215082,0.00033922523,0.000002483617,0.00011440609,0.00008707321],"genre_scores_gemma":[0.54678833,0.000009183787,0.45291272,0.00015643763,0.00010226023,0.0000110955025,0.000006675636,0.0000104573755,0.000002866965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971867,0.00039750323,0.00094660925,0.0005994968,0.00050661183,0.0003630398],"domain_scores_gemma":[0.9976573,0.00057490566,0.00044282802,0.0005055254,0.0005575721,0.00026187848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008756869,0.00022582065,0.0002678969,0.00025424626,0.00056132657,0.0003849054,0.0003404742,0.00015131003,0.0000019258334],"category_scores_gemma":[0.0007649407,0.00021681796,0.00010694291,0.00028001974,0.000061835555,0.001346016,0.000042702337,0.00040110803,0.0000035618787],"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.00017189202,0.00016401002,0.0013046091,0.00004267071,0.000013521547,0.0000014597528,0.0010087881,0.2156895,0.00055200484,0.0606692,0.000014462158,0.7203679],"study_design_scores_gemma":[0.00048101798,0.00056442304,0.01891815,0.000031739688,0.000010789077,0.000037356975,0.00010475086,0.7978942,0.00023345392,0.18148905,0.000038046815,0.00019702413],"about_ca_topic_score_codex":0.000015345991,"about_ca_topic_score_gemma":0.000008996042,"teacher_disagreement_score":0.72017086,"about_ca_system_score_codex":0.00024306415,"about_ca_system_score_gemma":0.00009613349,"threshold_uncertainty_score":0.884158},"labels":[],"label_agreement":null},{"id":"W2163831654","doi":"10.1109/ishls.1994.302350","title":"H/W-S/W co-verification in ATM","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Emulation; Interface (matter); Computer science; Software; Operating system; Embedded system; Programming language; Software engineering","score_opus":0.06306230400363537,"score_gpt":0.3071457762355169,"score_spread":0.24408347223188154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163831654","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.0071912147,0.000038486414,0.87754315,0.0004568304,0.00014169121,0.00009107235,1.6306468e-7,0.00014818937,0.11438923],"genre_scores_gemma":[0.41508636,0.000019430112,0.5835808,0.00019842805,0.000013915196,0.000013510437,5.3158016e-7,0.0000026387904,0.0010843916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935126,0.00006118474,0.00014926986,0.00018803187,0.00012443578,0.00012583217],"domain_scores_gemma":[0.99943453,0.000024591456,0.000036189864,0.00045510897,0.000020497055,0.000029097853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030549528,0.000050181443,0.000053953816,0.00008255456,0.000028735221,0.000046747093,0.0004468582,0.00003594652,0.00015627252],"category_scores_gemma":[0.000055129083,0.000047593305,0.000015598675,0.00036515752,0.000017731612,0.0005228635,0.000019526404,0.000060720253,0.0007237793],"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":[9.3357136e-7,0.000075310294,0.0016338719,0.0000043991918,0.0000012897939,0.0000018311597,0.00069773244,0.000042758948,0.0032598206,0.7907481,0.0023447452,0.20118922],"study_design_scores_gemma":[0.0002763122,0.00005599423,0.03657298,0.0000067103715,7.147989e-7,0.000010859106,0.00002817712,0.90319854,0.031159129,0.00363751,0.024849376,0.00020366826],"about_ca_topic_score_codex":0.000012072456,"about_ca_topic_score_gemma":0.0000023910216,"teacher_disagreement_score":0.9031558,"about_ca_system_score_codex":0.000039475213,"about_ca_system_score_gemma":0.0000042054853,"threshold_uncertainty_score":0.93029606},"labels":[],"label_agreement":null},{"id":"W2163985541","doi":"10.1109/cdc.2005.1582699","title":"Analysis of Arbitrarily Large Networks of Discrete-Event Systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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 Waterloo","funders":"","keywords":"Undecidable problem; Bounded function; Equivalence (formal languages); Network topology; Computer science; Range (aeronautics); Theoretical computer science; Model checking; Event (particle physics); Discrete mathematics; Mathematics; Topology (electrical circuits); Decidability; Combinatorics","score_opus":0.010792375584736323,"score_gpt":0.27359568156163616,"score_spread":0.2628033059768998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163985541","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.012879294,0.00016275387,0.98005486,0.000013976219,0.00018260475,0.000083711915,0.000004051713,0.000036991583,0.0065817717],"genre_scores_gemma":[0.8396628,0.000003520289,0.1600931,0.000010482575,0.000018286562,0.000004570253,0.0000059330596,0.0000023849395,0.00019895156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893117,0.00010116043,0.00042298244,0.00017126379,0.00022572972,0.00014769186],"domain_scores_gemma":[0.9990116,0.000055582506,0.00024746178,0.0005745433,0.000086897555,0.000023917022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070023496,0.000066950626,0.00024746874,0.00019043413,0.000022424909,0.000022372973,0.00047501773,0.000048292717,0.000009580404],"category_scores_gemma":[0.00001545823,0.000054689815,0.00012804923,0.0013298007,0.000026343434,0.0001922779,0.00008379,0.00004825309,0.0000012805125],"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.0000027577403,0.00006411659,0.007025958,0.000016793818,0.000111054775,3.4567339e-7,0.00004267629,0.13704701,0.0002923354,0.85465175,0.0000787544,0.00066643424],"study_design_scores_gemma":[0.000066625624,0.000023593902,0.050109413,0.000007074936,0.00007123092,3.9568076e-7,0.00001459713,0.948062,0.0011292214,0.00024550085,0.00021183271,0.000058538455],"about_ca_topic_score_codex":0.00043466108,"about_ca_topic_score_gemma":0.000029062647,"teacher_disagreement_score":0.85440624,"about_ca_system_score_codex":0.000016624026,"about_ca_system_score_gemma":0.00001425456,"threshold_uncertainty_score":0.2230186},"labels":[],"label_agreement":null},{"id":"W2164608950","doi":"10.1109/ccece.1997.608242","title":"Safety analysis in real-time system using constraint logic programming","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Prolog; Constraint logic programming; Computer science; Logic programming; Constraint satisfaction; Property (philosophy); Constraint programming; Programming language; Temporal logic; Constraint (computer-aided design); Theoretical computer science; Algorithm; Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.06603490163475807,"score_gpt":0.30811116075406286,"score_spread":0.2420762591193048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164608950","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.009561435,0.00001603159,0.9686802,0.000046775574,0.00006454711,0.0001742177,6.149686e-7,0.00027386378,0.021182317],"genre_scores_gemma":[0.3152624,0.0000030847602,0.68462616,0.000014383842,0.000008689082,0.000004367111,7.080488e-7,0.0000025648978,0.000077618424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868685,0.00020116504,0.0003631792,0.0003123183,0.00018952921,0.00024697708],"domain_scores_gemma":[0.9992364,0.000058432244,0.00011074051,0.00049063057,0.000049173737,0.00005459526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000978165,0.00009604882,0.00021143557,0.0002957087,0.00006996018,0.000101776284,0.00042237388,0.000058851347,0.00007658751],"category_scores_gemma":[0.00004421646,0.000084656436,0.00007490018,0.0018998336,0.00004679822,0.00032100815,0.00009056682,0.000075049546,0.000059806564],"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.000004638022,0.00012500977,0.0034851076,0.00006114408,0.00013172462,0.00004477631,0.0011272974,0.012348644,0.002725538,0.761971,0.00001318889,0.2179619],"study_design_scores_gemma":[0.00008712565,0.000015500798,0.0012060051,0.000014792497,0.000023595101,0.000018567182,0.00009871079,0.99803233,0.00025231572,0.000061059785,0.00008032416,0.00010969037],"about_ca_topic_score_codex":0.0001651731,"about_ca_topic_score_gemma":0.000009057279,"teacher_disagreement_score":0.9856837,"about_ca_system_score_codex":0.00021800958,"about_ca_system_score_gemma":0.000012531988,"threshold_uncertainty_score":0.34521893},"labels":[],"label_agreement":null},{"id":"W2164973259","doi":"10.1109/icdcs.1996.508011","title":"Deadlock detection by fair reachability analysis: from cyclic to multi-cyclic protocols (and beyond?)","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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 Ottawa","funders":"","keywords":"Reachability; Correctness; Computer science; Decidability; Protocol (science); State (computer science); Deadlock; Topology (electrical circuits); Set (abstract data type); Component (thermodynamics); Theoretical computer science; Distributed computing; Algorithm; Mathematics; Combinatorics; Programming language","score_opus":0.04027782726795532,"score_gpt":0.3097080401084212,"score_spread":0.26943021284046587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164973259","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.075633705,0.000023863673,0.91845137,0.0002639112,0.00006503635,0.0045208796,0.0000061572077,0.00030958644,0.0007254837],"genre_scores_gemma":[0.41574168,0.00000183531,0.5803221,0.0002719779,0.000020880796,0.00335427,0.0000024815222,0.000007085395,0.00027768328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980104,0.00027159465,0.0003967335,0.0007565091,0.00029112614,0.00027365156],"domain_scores_gemma":[0.998402,0.00010683046,0.000119798045,0.0011042607,0.00007440018,0.00019270794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000577504,0.00017959312,0.00025544575,0.00020174483,0.00015250526,0.00018379626,0.00063354446,0.00011617237,0.000059149363],"category_scores_gemma":[0.00024434098,0.0001633792,0.0000917053,0.0013020854,0.000045402096,0.0006306085,0.00020774116,0.00015197287,0.00010303117],"study_design_candidate":"design_other","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.000025114912,0.000561139,0.008531273,0.000023317505,0.00019766891,0.0000018337342,0.0026355283,0.0001965279,0.07735406,0.0015271521,0.00057458115,0.9083718],"study_design_scores_gemma":[0.0005581866,0.00023961953,0.05259695,0.000008240201,0.000067447305,0.0000037139457,0.000101541336,0.82332647,0.11640371,0.001108492,0.0051286905,0.0004569661],"about_ca_topic_score_codex":0.0005913654,"about_ca_topic_score_gemma":0.00029807797,"teacher_disagreement_score":0.9079148,"about_ca_system_score_codex":0.00009842763,"about_ca_system_score_gemma":0.000005039012,"threshold_uncertainty_score":0.666241},"labels":[],"label_agreement":null},{"id":"W2165081124","doi":"10.1109/ccece.1999.807202","title":"Description and validation of the Internet Stream Protocol (ST2+) using SDL/MSC","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Resource Reservation Protocol; Protocol (science); Reservation; The Internet; Internet layer; Task (project management); Formal specification; Internet Protocol; Computer network; Programming language; Distributed computing; Operating system","score_opus":0.07879078876582608,"score_gpt":0.331406318395601,"score_spread":0.2526155296297749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165081124","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.13692407,0.0000010756307,0.85271114,0.000014359989,0.00011098448,0.007658099,1.5578877e-7,0.000025464327,0.0025546653],"genre_scores_gemma":[0.42800105,1.1252452e-7,0.57063794,0.000021384265,0.0000056855392,0.0011696145,1.1841757e-7,0.0000026860514,0.00016144905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993183,0.00018065673,0.00016364391,0.00013487508,0.00012882381,0.00007368288],"domain_scores_gemma":[0.9995025,0.000015545773,0.00011323504,0.00029326457,0.000058164736,0.000017328091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045484953,0.000053242802,0.00005326993,0.00003467301,0.000037325266,0.000062044026,0.00022121203,0.000030975745,0.00001352137],"category_scores_gemma":[0.00010611857,0.000036144036,0.000017650664,0.00018972643,0.00003755486,0.0005021397,0.000068952344,0.00004510815,0.0000015872862],"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.000011794793,0.0001341254,0.01725187,0.000089499306,0.000011343797,2.0624847e-7,0.0013147036,0.00039910836,0.07698834,0.88056564,0.00014461615,0.023088725],"study_design_scores_gemma":[0.00020920696,0.00006006255,0.003785572,0.000029297575,0.0000035841003,0.000013032453,0.000037652597,0.13829651,0.8511506,0.005236231,0.0011024104,0.0000758365],"about_ca_topic_score_codex":0.000034573084,"about_ca_topic_score_gemma":0.0000017441747,"teacher_disagreement_score":0.87532943,"about_ca_system_score_codex":0.000029502879,"about_ca_system_score_gemma":0.000026697055,"threshold_uncertainty_score":0.1473911},"labels":[],"label_agreement":null},{"id":"W2165104465","doi":"10.1109/iccd.1994.331935","title":"Retiming for the global optimization of synchronous sequential circuit","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Retiming; Bipartite graph; Computer science; Petri net; Sequential logic; Electronic circuit; Algorithm; Graph; Theoretical computer science; Logic gate; Engineering","score_opus":0.07066588705872172,"score_gpt":0.2971126285388429,"score_spread":0.22644674148012117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165104465","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.00010946373,0.00007602824,0.9914932,0.00023378618,0.0003386143,0.00020961017,0.000001813008,0.00006226711,0.00747518],"genre_scores_gemma":[0.19924212,0.000011925898,0.800541,0.00007329412,0.000034887347,0.000015491378,5.898132e-7,0.0000024437431,0.000078302495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942446,0.000035022276,0.00016210834,0.00013788199,0.00012812288,0.00011239335],"domain_scores_gemma":[0.99937797,0.00007322526,0.000086968765,0.0003617606,0.00008153533,0.000018533205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030645615,0.00005010135,0.00006055672,0.000016149914,0.00008764085,0.000045667453,0.0005195903,0.000033382672,0.0000669048],"category_scores_gemma":[0.00010946506,0.000036919766,0.000040613242,0.00021334428,0.000038744616,0.000266125,0.0000584988,0.000025317106,0.0000054821894],"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.0000027577441,0.000032247226,0.000058200796,0.000018782443,0.000014757424,2.1226191e-7,0.00031700564,0.124067426,0.00013034229,0.73812807,0.00038224374,0.13684794],"study_design_scores_gemma":[0.00009793608,0.000038568014,0.00007498968,0.0000037866785,0.0000060227007,0.000006425373,0.000011725649,0.9961874,0.0017181927,0.0014239408,0.0003842593,0.00004674582],"about_ca_topic_score_codex":0.000012461685,"about_ca_topic_score_gemma":8.9414397e-7,"teacher_disagreement_score":0.87211996,"about_ca_system_score_codex":0.000054820062,"about_ca_system_score_gemma":0.000012098011,"threshold_uncertainty_score":0.15055443},"labels":[],"label_agreement":null},{"id":"W2165235091","doi":"10.1109/eurmic.1998.711805","title":"Verification of real time controllers against timing diagram specifications using constraint logic programming","year":2002,"lang":"en","type":"article","venue":"Proceedings. 24th EUROMICRO Conference (Cat. No.98EX204)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Programming language; Finite-state machine; Consistency (knowledge bases); Logic programming; Constraint (computer-aided design); Controller (irrigation); Constraint logic programming; Constraint programming; Formal specification; Formal verification; Algorithm; Theoretical computer science; Constraint satisfaction; Mathematics; Mathematical optimization","score_opus":0.1519271106969447,"score_gpt":0.29120678809306094,"score_spread":0.13927967739611624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165235091","genre_codex":"empirical","genre_gemma":"methods","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.5127887,0.0000863459,0.4270594,0.00081633095,0.0011545346,0.0031651394,0.000051137875,0.0013300877,0.053548273],"genre_scores_gemma":[0.42331272,0.00026326207,0.57584447,0.00008314866,0.00012417136,0.00007705206,0.00001759882,0.000039301118,0.00023827582],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959651,0.00012033039,0.0012614399,0.001194178,0.0005980834,0.00086086267],"domain_scores_gemma":[0.9959567,0.00013305663,0.0012782238,0.0007994759,0.001550047,0.00028246967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001196957,0.00053842395,0.00069270696,0.00041985099,0.00044160514,0.0006119745,0.0018376148,0.0002628356,0.00012001101],"category_scores_gemma":[0.0008106716,0.00056434184,0.00020107262,0.0010729124,0.0005901558,0.0014436414,0.00029316923,0.00033487444,0.00035850878],"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.000034197135,0.00033894688,0.00047949303,0.00014013557,0.000062009836,0.0000040150035,0.002446493,0.00006575388,0.8258506,0.08564876,0.00028062603,0.08464897],"study_design_scores_gemma":[0.0009537135,0.00024081764,0.0015984748,0.0002136858,0.00006700798,0.00005226723,0.00033917493,0.9639416,0.02949763,0.0005616622,0.0017319384,0.0008020401],"about_ca_topic_score_codex":0.00003698244,"about_ca_topic_score_gemma":9.09121e-7,"teacher_disagreement_score":0.96387583,"about_ca_system_score_codex":0.0003276553,"about_ca_system_score_gemma":0.00019814722,"threshold_uncertainty_score":0.9996808},"labels":[],"label_agreement":null},{"id":"W2165303269","doi":"10.1109/ismvl.1994.302217","title":"Multiple-valued logic operations with universal literals","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Literal (mathematical logic); Product (mathematics); Computer science; Function (biology); Variable (mathematics); Implicant; Canonical normal form; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Boolean function","score_opus":0.05590618435567126,"score_gpt":0.27901789460597737,"score_spread":0.2231117102503061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165303269","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.0055414503,0.000019905212,0.9731249,0.00054923206,0.000091247355,0.00012410348,6.8116486e-7,0.00022152688,0.020326933],"genre_scores_gemma":[0.23704758,0.0000038625626,0.7595503,0.00035748185,0.000015693156,0.000006411072,8.6698765e-7,0.000003094366,0.003014707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993266,0.000078544355,0.00010517308,0.00021062346,0.00013876647,0.00014032805],"domain_scores_gemma":[0.9993838,0.00003250668,0.000021150478,0.0004318472,0.00007826368,0.00005241187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000135461,0.0000741653,0.00006676066,0.000062993284,0.00011037499,0.00013284132,0.00044547592,0.000030487656,0.00016525736],"category_scores_gemma":[0.000051146886,0.00005422594,0.000018161738,0.00032178304,0.000037394275,0.0008779432,0.00006227243,0.0000630403,0.00019680354],"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.0000027032968,0.00006255527,0.00027500116,0.0000028149761,0.0000072870052,0.0000057561388,0.0010006387,0.0020194922,0.0007417538,0.9855562,0.0005036858,0.009822122],"study_design_scores_gemma":[0.000262343,0.000098995384,0.0008059539,0.000004764548,0.0000020949747,0.000016386291,0.000026636317,0.9942906,0.0017711299,0.00031678446,0.0022924375,0.0001118627],"about_ca_topic_score_codex":0.000024550962,"about_ca_topic_score_gemma":0.000011174273,"teacher_disagreement_score":0.9922711,"about_ca_system_score_codex":0.000029559998,"about_ca_system_score_gemma":0.000009736316,"threshold_uncertainty_score":0.2529577},"labels":[],"label_agreement":null},{"id":"W2166178773","doi":"10.1145/330855.330947","title":"Formal hardware verification by integrating HOL and MDG","year":2000,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada); Université de Montréal; Concordia University","funders":"Concordia University","keywords":"HOL; Automated theorem proving; Formal equivalence checking; Computer science; Formal verification; Intelligent verification; Automated proof checking; Model checking; Programming language; Formal methods; Abstraction; Verification; Functional verification; Equivalence (formal languages); Runtime verification; High-level verification; Mathematics; Software; Software development; Software construction; Discrete mathematics","score_opus":0.014049157454006256,"score_gpt":0.2632437443451588,"score_spread":0.24919458689115254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166178773","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.04083911,0.00007088004,0.9294252,0.00026728053,0.00007975542,0.00011120057,0.0000016610162,0.00018952643,0.029015385],"genre_scores_gemma":[0.2585877,0.000037650632,0.7392056,0.00027557233,0.000021567856,0.000018472201,0.0000059168765,0.00000494809,0.0018425909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992653,0.00004936933,0.00016215259,0.00022820474,0.00012847176,0.0001665046],"domain_scores_gemma":[0.999514,0.000024482773,0.000039742295,0.00033532482,0.00003392451,0.00005254711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003524156,0.000079240875,0.00006829072,0.000030940064,0.00012964362,0.00014902504,0.00033635474,0.000045138822,0.000119026794],"category_scores_gemma":[0.000039544262,0.00006824559,0.000016466713,0.00017070766,0.000031474923,0.0014093709,0.00004502798,0.00008656067,0.000076374956],"study_design_candidate":"design_other","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.0000032415298,0.000013336647,0.000110259476,0.000005409114,0.0000021291823,2.2668641e-7,0.00047535574,0.0000049485643,0.0027721224,0.08568968,0.0014873004,0.909436],"study_design_scores_gemma":[0.00054924143,0.00021934768,0.009733657,0.000033005104,0.000007133825,0.000055073135,0.00026038356,0.756739,0.080062285,0.0033097686,0.14848544,0.0005456466],"about_ca_topic_score_codex":0.000025755011,"about_ca_topic_score_gemma":0.0000014251146,"teacher_disagreement_score":0.90889037,"about_ca_system_score_codex":0.00002046291,"about_ca_system_score_gemma":0.000012401608,"threshold_uncertainty_score":0.27829742},"labels":[],"label_agreement":null},{"id":"W2167737301","doi":"10.1007/11678779_2","title":"The Safety Simple Subset","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"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; Automaton; Regular expression; Translation (biology); Prefix; Simple (philosophy); Büchi automaton; Linear temporal logic; Expression (computer science); Theoretical computer science; Algorithm; Deterministic automaton; Programming language","score_opus":0.019851094047621313,"score_gpt":0.26954455614006717,"score_spread":0.24969346209244586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167737301","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.000010404426,0.00043848282,0.98305124,0.000700186,0.0021821046,0.00037042343,0.00000685614,0.00018289256,0.013057406],"genre_scores_gemma":[0.011429501,0.000089698915,0.9858244,0.0009569825,0.00060712674,0.000013661421,0.000011642108,0.000038823713,0.001028176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961257,0.00008307788,0.0006584208,0.0012552314,0.0011243523,0.0007532455],"domain_scores_gemma":[0.99596244,0.00087699015,0.00037413885,0.002419208,0.00025140145,0.00011583819],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024871172,0.00045358256,0.00036417326,0.00035651767,0.00079669367,0.0008471367,0.005839733,0.00028736977,0.000009057824],"category_scores_gemma":[0.00020491694,0.00033342134,0.00013266406,0.0006943209,0.0010869206,0.000621792,0.0013917043,0.00084807386,0.000072228686],"study_design_candidate":"design_other","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.0000052702358,0.000009536655,0.000025867004,0.00001058483,0.0000045707743,0.000014951664,0.00013141519,0.016937364,0.000029587112,0.18756872,0.00024273514,0.7950194],"study_design_scores_gemma":[0.0001436157,0.000087378554,0.00050855137,0.00007379311,0.0000045302822,0.000048547943,6.7079974e-8,0.58449066,0.0010482415,0.3448442,0.06819816,0.00055224536],"about_ca_topic_score_codex":0.000034442844,"about_ca_topic_score_gemma":0.00009825295,"teacher_disagreement_score":0.79446715,"about_ca_system_score_codex":0.0003999972,"about_ca_system_score_gemma":0.00043601196,"threshold_uncertainty_score":0.9999118},"labels":[],"label_agreement":null},{"id":"W2167987424","doi":"10.1109/time.2008.20","title":"Satisfying a Fragment of XQuery by Branching-Time Reduction","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Fragment (logic); Satisfiability; Computer science; XQuery; Leverage (statistics); CTL*; Branching (polymer chemistry); Boolean satisfiability problem; Decidability; Reduction (mathematics); Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Artificial intelligence; Chemistry; XML","score_opus":0.018438612413040522,"score_gpt":0.248989714332751,"score_spread":0.23055110191971048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167987424","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.16486745,0.00005929904,0.82968986,0.000118302996,0.00019941275,0.00008010428,4.682545e-7,0.00010264123,0.0048824754],"genre_scores_gemma":[0.3687295,0.00001784642,0.6306206,0.000037713176,0.000018078876,0.0000049648806,9.017908e-7,0.000003077222,0.00056735025],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992448,0.000067741435,0.00020269849,0.00017727537,0.00019906044,0.00010839791],"domain_scores_gemma":[0.9994653,0.000022404232,0.000095286974,0.00034501756,0.00004004091,0.000031951848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030572515,0.000060708637,0.00009197195,0.000056379144,0.00007821095,0.000012478027,0.00028358618,0.00003489831,0.000034367153],"category_scores_gemma":[0.00003747428,0.00005681821,0.000030119092,0.00021849846,0.000041805702,0.0004761242,0.00006276956,0.000059482027,0.00004089583],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000010910747,0.00014327446,0.00049737404,0.000032279433,0.000021021378,0.0000017795517,0.0029418427,0.0002703223,0.77294016,0.062202632,0.013704348,0.14723407],"study_design_scores_gemma":[0.00032503327,0.00015884302,0.0063773044,0.000032418033,0.0000041216867,0.00014952254,0.00003136274,0.112701304,0.874534,0.0028465784,0.002571432,0.00026808583],"about_ca_topic_score_codex":0.000046722518,"about_ca_topic_score_gemma":1.2002222e-7,"teacher_disagreement_score":0.20386204,"about_ca_system_score_codex":0.000032864027,"about_ca_system_score_gemma":0.00002463826,"threshold_uncertainty_score":0.23169795},"labels":[],"label_agreement":null},{"id":"W2168004790","doi":"","title":"A Boundary Checking Technique for Testing Real-Time Systems Modeled as Timed Input Output Automata","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Automaton; Computer science; Set (abstract data type); Process (computing); Transition system; Timed automaton; State (computer science); Boundary (topology); Algorithm; Theoretical computer science; Mathematics; Programming language","score_opus":0.07524305892057433,"score_gpt":0.3082481071389693,"score_spread":0.23300504821839496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168004790","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.0065496922,0.000026118998,0.9669653,0.0000714144,0.00025925733,0.0012996608,0.0000030360561,0.0015944245,0.023231095],"genre_scores_gemma":[0.04957355,0.000007030767,0.94621056,0.000055448905,0.00008752996,0.0005386219,0.000006140914,0.00002776911,0.003493342],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811685,0.00014007384,0.00047506863,0.00051879475,0.0003387258,0.0004104851],"domain_scores_gemma":[0.9981955,0.0003033605,0.00023033083,0.00089492556,0.0002713944,0.00010446921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014808933,0.00020188135,0.0002885164,0.0001727061,0.0004176947,0.0001954308,0.001051666,0.00014454902,0.0000033541091],"category_scores_gemma":[0.00065831246,0.00018924019,0.00006909493,0.00054947624,0.00007420249,0.0008669748,0.00026405154,0.00013201813,0.00009623585],"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.00007009244,0.00031939885,0.0002965673,0.0004898855,0.00009124986,0.00004366096,0.0022949665,0.0032460326,0.73953974,0.18982933,0.0068897293,0.056889325],"study_design_scores_gemma":[0.00020035934,0.00014147193,0.00017900871,0.00007064302,0.000005151218,0.00017162392,0.000008682978,0.95922005,0.037236676,0.0016174165,0.0008975815,0.00025136105],"about_ca_topic_score_codex":0.00020409528,"about_ca_topic_score_gemma":2.0287368e-7,"teacher_disagreement_score":0.955974,"about_ca_system_score_codex":0.00015071679,"about_ca_system_score_gemma":0.00030874586,"threshold_uncertainty_score":0.77169913},"labels":[],"label_agreement":null},{"id":"W2168312001","doi":"","title":"Minimization of multiway decision graphs for RTL verification by stochastic optimization","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Algoma University","funders":"","keywords":"Correctness; Computer science; Minification; Variable (mathematics); State (computer science); Algorithm; Theoretical computer science; Mathematics; Programming language","score_opus":0.013187441558696085,"score_gpt":0.2696376096437597,"score_spread":0.2564501680850636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168312001","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.0018661214,0.00004906189,0.9967666,0.000056836587,0.00028793697,0.00051584403,0.000009919164,0.00012379196,0.00032385383],"genre_scores_gemma":[0.20594522,0.0000051011693,0.79377055,0.000021846316,0.00001544102,0.00005919356,0.00008100189,0.000009501739,0.00009212717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876374,0.000053581978,0.00045299414,0.00032557343,0.0002509956,0.00015309242],"domain_scores_gemma":[0.9987,0.00020424656,0.00027724626,0.00046623428,0.00031989792,0.00003234731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040004213,0.000113024886,0.00013283736,0.00017012696,0.00009233629,0.000054217275,0.00042294402,0.00009154426,0.000010920585],"category_scores_gemma":[0.0002510014,0.00010964057,0.000056278757,0.00053149293,0.000038837494,0.0006467847,0.000036216792,0.000034870533,0.0000037915427],"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.00004286436,0.00017076796,0.00004837073,0.000023380931,0.0000055382966,3.243932e-8,0.000086625536,0.6739989,0.008803332,0.2645034,0.0027852517,0.049531534],"study_design_scores_gemma":[0.00042985636,0.00006635016,0.0005815778,0.00001213545,0.0000069430816,9.0253747e-7,0.000008629549,0.9658138,0.026491642,0.006228269,0.00023895067,0.00012092572],"about_ca_topic_score_codex":0.00002878075,"about_ca_topic_score_gemma":0.0000018014683,"teacher_disagreement_score":0.29181492,"about_ca_system_score_codex":0.000041018637,"about_ca_system_score_gemma":0.000027671646,"threshold_uncertainty_score":0.44710127},"labels":[],"label_agreement":null},{"id":"W2168637331","doi":"10.1109/mcs.2007.284509","title":"Implementation of stabilizing control laws - How many controller blocks are neede for a universally good implementation?","year":2007,"lang":"en","type":"article","venue":"IEEE Control Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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 Waterloo","funders":"","keywords":"Implementation; Conjecture; Controller (irrigation); Computer science; Block (permutation group theory); Control (management); Mathematics; Algorithm; Discrete mathematics; Programming language; Artificial intelligence; Combinatorics","score_opus":0.023658338608273478,"score_gpt":0.31929185154016704,"score_spread":0.29563351293189355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168637331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03442603,0.00020657243,0.9594314,0.00043715807,0.0012974989,0.0037274903,0.00017412087,0.0001472757,0.0001524312],"genre_scores_gemma":[0.98067987,0.0000029626246,0.018455029,0.00015945065,0.00026976274,0.00030996252,0.000008216353,0.000028579836,0.00008614175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696916,0.0003417224,0.0009887776,0.0005190746,0.0005322766,0.00064898754],"domain_scores_gemma":[0.99652493,0.00070423103,0.0013150444,0.0005804907,0.0007224061,0.00015292736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035519332,0.0002889604,0.000672907,0.00029129308,0.00020751789,0.00023093353,0.0007497898,0.0001302565,0.000007194083],"category_scores_gemma":[0.00007405392,0.0002832235,0.00021459798,0.00035509077,0.000058429396,0.0008603726,0.000029651846,0.00012123918,0.0000035658538],"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.0015270442,0.0003972191,0.08132843,0.00085189217,0.0018129265,0.000026166073,0.0069954256,0.006455817,0.3045619,0.53761953,0.002948328,0.05547532],"study_design_scores_gemma":[0.11693898,0.0031688595,0.073251605,0.0003298852,0.00084670144,0.000090185036,0.05117319,0.67206275,0.060813807,0.0022912126,0.016611267,0.002421571],"about_ca_topic_score_codex":0.00045929654,"about_ca_topic_score_gemma":0.00040981828,"teacher_disagreement_score":0.94625384,"about_ca_system_score_codex":0.00028613175,"about_ca_system_score_gemma":0.00013372574,"threshold_uncertainty_score":0.999962},"labels":[],"label_agreement":null},{"id":"W2168685706","doi":"10.1109/cic.2006.60","title":"Removing Timed Delays in Stochastic Automata","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 Ottawa","funders":"","keywords":"Automaton; Computer science; Property (philosophy); Markov chain; Markov process; Timed automaton; State (computer science); Stochastic process; Continuous spatial automaton; Theoretical computer science; Automata theory; Quantum finite automata; Algorithm; Mathematics; Machine learning","score_opus":0.01096568528861276,"score_gpt":0.24892171883465863,"score_spread":0.2379560335460459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168685706","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.010921045,0.000014519016,0.9683574,0.00014883067,0.0001534122,0.00008215394,1.56854e-7,0.00024226186,0.02008025],"genre_scores_gemma":[0.37665924,1.7992565e-7,0.6229145,0.00005284039,0.000017089473,0.0000051040015,6.422977e-7,0.0000028125612,0.0003476008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999265,0.000050213035,0.00017913156,0.00019573882,0.00014087859,0.00016904078],"domain_scores_gemma":[0.9994396,0.000057576184,0.000040436396,0.00042002546,0.000020659556,0.000021681039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004524727,0.000059826423,0.000068053865,0.00010618552,0.000031919277,0.000056408757,0.0004949941,0.0000346872,0.000013965773],"category_scores_gemma":[0.00007662424,0.000056180408,0.000015120617,0.00035932555,0.000016018486,0.0004106596,0.00011561858,0.000066217945,0.00011420953],"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.000003462931,0.000072757124,0.00026316827,0.0000067668375,0.0000016296466,0.000009155339,0.00015883896,0.011801958,0.002625532,0.91657573,0.0009006228,0.067580365],"study_design_scores_gemma":[0.00012916053,0.000012387854,0.0134105105,0.00000786091,5.620298e-7,0.000010710993,0.000004134285,0.9759457,0.0010996511,0.009134727,0.00016246838,0.0000821248],"about_ca_topic_score_codex":0.00017642243,"about_ca_topic_score_gemma":0.00002999867,"teacher_disagreement_score":0.96414375,"about_ca_system_score_codex":0.000052508785,"about_ca_system_score_gemma":0.000025112802,"threshold_uncertainty_score":0.22909705},"labels":[],"label_agreement":null},{"id":"W2168690391","doi":"10.5555/381473.381516","title":"A framework for multi-valued reasoning over inconsistent viewpoints","year":2001,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":157,"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":"","keywords":"Viewpoints; Computer science; Negotiation; Theoretical computer science; Model checking; Temporal logic; Artificial intelligence; Machine learning","score_opus":0.11240682971880231,"score_gpt":0.3928930492158512,"score_spread":0.2804862194970489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168690391","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.003776631,0.000060321865,0.9931139,0.00015151009,0.0005052241,0.0003171718,6.3119154e-7,0.00021748903,0.0018571565],"genre_scores_gemma":[0.008770826,0.000019127094,0.9895605,0.0010511996,0.00005716122,0.00007457795,8.7687886e-7,0.000009471579,0.00045624742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894494,0.000076973716,0.00022979411,0.00032431723,0.00017071127,0.000253285],"domain_scores_gemma":[0.9990434,0.00007921763,0.00009814241,0.0006151167,0.00008557968,0.00007856292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000735806,0.00010631988,0.00013052278,0.00006278857,0.000119570286,0.00010099269,0.00054771284,0.00008873472,0.000038974205],"category_scores_gemma":[0.0008251581,0.00009317263,0.00008029651,0.0003022746,0.000028030987,0.0004089926,0.00014449997,0.000109544024,0.000057354915],"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.000007924969,0.00004181903,0.00055993773,0.0000075274284,0.0000074241752,0.0000012384735,0.00020884207,0.000014115681,0.000070566755,0.97385186,0.00015804044,0.02507068],"study_design_scores_gemma":[0.0003901149,0.000060858263,0.009297101,0.00005827056,0.0000057630486,0.000020247546,0.000027513555,0.9567671,0.0017300736,0.02461546,0.0068361047,0.00019144158],"about_ca_topic_score_codex":0.000016173795,"about_ca_topic_score_gemma":0.0000040934433,"teacher_disagreement_score":0.95675296,"about_ca_system_score_codex":0.00005869585,"about_ca_system_score_gemma":0.000031126765,"threshold_uncertainty_score":0.37994698},"labels":[],"label_agreement":null},{"id":"W2169019194","doi":"10.1109/ismvl.2007.59","title":"Variable Reordering and Sifting for QMDD","year":2007,"lang":"en","type":"article","venue":"Proceedings/Proceedings - International Symposium on Multiple-Valued Logic","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Variable (mathematics); Computer science; Quantum; Electronic circuit; Algorithm; Mathematics; Engineering; Electrical engineering; Physics","score_opus":0.031962478156664184,"score_gpt":0.3046107170511642,"score_spread":0.2726482388945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169019194","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.15410344,0.00008792926,0.7576938,0.0021340265,0.0026867606,0.0017404691,0.00001642026,0.0012542496,0.080282904],"genre_scores_gemma":[0.4145735,0.000020191706,0.583761,0.0006821907,0.00052729825,0.00014022113,0.0000070290416,0.000043836917,0.00024476077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960976,0.00000757906,0.0008748962,0.0012848885,0.000867631,0.00086737354],"domain_scores_gemma":[0.9971079,0.00045349775,0.0006256547,0.00017898975,0.0013677701,0.00026615118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036108121,0.00048596977,0.0003831925,0.00044305623,0.00053768896,0.0008461815,0.0016139632,0.00027738354,0.00001152919],"category_scores_gemma":[0.0034833287,0.0004819559,0.00012848886,0.00067415874,0.00012343122,0.0019699153,0.00051759795,0.00044811307,0.000018810786],"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.0002247606,0.00013053864,0.005290722,0.00013626138,0.00006114885,0.0000013818274,0.0009757932,0.000050011102,0.12379984,0.86362886,0.0002634706,0.005437199],"study_design_scores_gemma":[0.0043225633,0.0012363625,0.008814076,0.0005020128,0.00007103581,0.00027204375,0.001161906,0.73794913,0.15603384,0.05529516,0.03247577,0.0018660823],"about_ca_topic_score_codex":0.000020412685,"about_ca_topic_score_gemma":8.280622e-7,"teacher_disagreement_score":0.8083337,"about_ca_system_score_codex":0.00036561387,"about_ca_system_score_gemma":0.000033395892,"threshold_uncertainty_score":0.9997632},"labels":[],"label_agreement":null},{"id":"W2169252349","doi":"10.1109/iscas.2004.1329525","title":"Formal verification of an SoC platform protocol converter","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Liveness; Computer science; Formal verification; Embedded system; Protocol (science); Block (permutation group theory); Runtime verification; System on a chip; Formal methods; Intelligent verification; Functional verification; Operating system; Programming language; Software","score_opus":0.042919503180711104,"score_gpt":0.3321361254030685,"score_spread":0.28921662222235744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169252349","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.0071379878,3.6777203e-7,0.97386426,0.00006336222,0.000088897286,0.012545075,5.860241e-7,0.00013344418,0.0061660353],"genre_scores_gemma":[0.19662291,1.532218e-7,0.7931748,0.000112796675,0.00002113657,0.010014897,0.000002307823,0.000005166521,0.0000458134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991047,0.000021350235,0.00027710755,0.0001998686,0.00021962445,0.00017736352],"domain_scores_gemma":[0.9990868,0.000009210693,0.00013247917,0.0006171826,0.00009718669,0.000057163044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004567968,0.0000819422,0.000093094095,0.00006783332,0.00006015022,0.00004387719,0.00063608494,0.000062171515,0.000028104656],"category_scores_gemma":[0.000022226717,0.00006937617,0.000032989457,0.00020704689,0.000048462003,0.0027948837,0.000074437594,0.00006678123,0.00004724456],"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.000022681736,0.0001164196,0.00003488377,0.000030887986,0.000003707571,4.079547e-7,0.00063578435,0.00006838873,0.0056712525,0.86066437,0.000014378005,0.13273688],"study_design_scores_gemma":[0.001888502,0.0007354091,0.010362093,0.000022105185,0.0000036096746,0.000026036229,0.00010218054,0.15005562,0.7969838,0.036266588,0.0032614183,0.00029268934],"about_ca_topic_score_codex":0.000031021616,"about_ca_topic_score_gemma":0.0000034447949,"teacher_disagreement_score":0.82439774,"about_ca_system_score_codex":0.000050637067,"about_ca_system_score_gemma":0.00008652394,"threshold_uncertainty_score":0.2829078},"labels":[],"label_agreement":null},{"id":"W2169604423","doi":"10.1109/ccece.2000.849693","title":"The impact of design changes on verification using MDGs","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Scheme for Promotion of Academic and Research Collaboration; University of Cambridge","keywords":"Computer science; Formal verification; Functional verification; Intelligent verification; Compromise; Verification; Formal methods; Electronic system-level design and verification; Software engineering; Programming language; Reliability engineering; Engineering; Software; Software development","score_opus":0.20936379522606494,"score_gpt":0.3650632383727629,"score_spread":0.15569944314669795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169604423","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.010940174,0.00006444083,0.9863667,0.00015336365,0.00015294687,0.00013110346,2.598621e-7,0.000048685244,0.002142364],"genre_scores_gemma":[0.4603154,0.000041287385,0.5394473,0.0000251426,0.0000257521,0.000005613767,1.0057473e-7,0.0000036387573,0.00013572683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993502,0.00014414657,0.00011509351,0.00012594533,0.00014377179,0.00012087212],"domain_scores_gemma":[0.99911135,0.0001428506,0.0001037861,0.00053451216,0.00008333994,0.000024146242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005927972,0.000059927555,0.000056637957,0.00004812289,0.00010983197,0.000051828123,0.00047541907,0.00002811609,0.000015386395],"category_scores_gemma":[0.0001637795,0.000035643963,0.000032429416,0.00027330796,0.000036724265,0.00013709476,0.000030014264,0.000044490214,0.000023340672],"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.000020261881,0.00011589169,0.00010353267,0.0000061098417,0.000025958223,3.966284e-7,0.0012496115,0.009230123,0.050472137,0.18064655,0.0013561103,0.7567733],"study_design_scores_gemma":[0.000049360096,0.00017625872,0.0021505384,0.000005087519,0.0000013066191,0.0000020885807,0.000009539735,0.9352402,0.06136941,0.00078953535,0.00015493429,0.000051750685],"about_ca_topic_score_codex":0.000036093796,"about_ca_topic_score_gemma":6.4615335e-7,"teacher_disagreement_score":0.9260101,"about_ca_system_score_codex":0.000057516656,"about_ca_system_score_gemma":0.000010727216,"threshold_uncertainty_score":0.14535186},"labels":[],"label_agreement":null},{"id":"W2170216372","doi":"10.1109/cicc.1998.694913","title":"Synthesis of interface controllers from timing diagram specifications","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Realizability; Computer science; Interface (matter); Schedule; Heuristic; Diagram; Static timing analysis; Programming language; Algorithm; Real-time computing; Embedded system; Operating system","score_opus":0.11313190117579379,"score_gpt":0.2920377024000595,"score_spread":0.1789058012242657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170216372","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.0042931465,0.00010773561,0.9616646,0.00056752533,0.00018740556,0.000098948054,0.000003387609,0.00010570028,0.032971527],"genre_scores_gemma":[0.5345584,0.000021194137,0.46512565,0.000024667264,0.000012980497,0.000012045609,1.8407862e-7,0.0000027313788,0.00024211929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920446,0.00008344262,0.0002471723,0.00020606244,0.00014374078,0.000115110364],"domain_scores_gemma":[0.9987751,0.00038206452,0.0001136446,0.0006319556,0.000055163495,0.000042049294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020002996,0.00007110656,0.00013361807,0.00006842403,0.000045382418,0.000042411597,0.000672156,0.000036855512,0.0003772466],"category_scores_gemma":[0.00032983444,0.0000636661,0.00004888023,0.00022592656,0.00004873129,0.00031551145,0.00007208791,0.00005642605,0.00019898206],"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.000006918544,0.00021436244,0.00039175985,0.000008818217,0.000057494402,8.515063e-7,0.0018356341,0.0005176509,0.01724496,0.21957706,0.003379694,0.75676477],"study_design_scores_gemma":[0.00014895044,0.000022505059,0.002629367,0.000017670915,0.000009616253,0.000001049333,0.00009614581,0.771406,0.22160886,0.0012780642,0.0026505047,0.00013130026],"about_ca_topic_score_codex":0.000045583784,"about_ca_topic_score_gemma":0.0000025135132,"teacher_disagreement_score":0.7708883,"about_ca_system_score_codex":0.00002638076,"about_ca_system_score_gemma":0.0000050239983,"threshold_uncertainty_score":0.41305855},"labels":[],"label_agreement":null},{"id":"W2170296074","doi":"","title":"Equivalence relations in fully and partially observable Markov decision processes","year":2009,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Observability; Equivalence (formal languages); Observable; Mathematics; Bisimulation; Logical equivalence; Markov process; Equivalence relation; Partially observable Markov decision process; Markov chain; Markov kernel; Markov decision process; Discrete mathematics; Markov model; Mathematical economics; Applied mathematics; Variable-order Markov model; Statistics","score_opus":0.03218690019228274,"score_gpt":0.30322398814727874,"score_spread":0.271037087954996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170296074","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.06362085,0.00017101756,0.9280484,0.0007874681,0.00007318253,0.00013049749,2.3961414e-7,0.0000999949,0.0070683677],"genre_scores_gemma":[0.34927288,0.00004969332,0.65020055,0.00018505908,0.00000776776,0.000005869514,3.0787825e-7,0.0000015987989,0.00027630065],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991177,0.000045601886,0.00022020486,0.00026786214,0.00017688729,0.00017179066],"domain_scores_gemma":[0.9993382,0.0001532718,0.00005062627,0.0003249508,0.000081872175,0.000051094405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055987126,0.000072681665,0.0000815465,0.00008185674,0.0000726472,0.00011448259,0.00039505784,0.000046724665,0.000017172388],"category_scores_gemma":[0.0006194803,0.00006452686,0.000009960615,0.00065824704,0.000021960728,0.00126995,0.00007905463,0.00007714558,0.000022835078],"study_design_candidate":"design_other","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.000029603247,0.00012963213,0.012032148,0.000030351954,0.0000019459999,0.0000075676303,0.0007641766,0.0009346066,0.0016038844,0.32989073,0.00063129887,0.6539441],"study_design_scores_gemma":[0.00047455737,0.00030517476,0.54645497,0.00014074873,0.00000391775,0.000026061414,0.000043600237,0.29630706,0.0058651017,0.14686236,0.0031645936,0.00035185547],"about_ca_topic_score_codex":0.000009642621,"about_ca_topic_score_gemma":0.000034613862,"teacher_disagreement_score":0.65359217,"about_ca_system_score_codex":0.000025713729,"about_ca_system_score_gemma":0.00008158242,"threshold_uncertainty_score":0.2631329},"labels":[],"label_agreement":null},{"id":"W2170457047","doi":"10.1109/fmcad.2006.11","title":"Design for Verification of the PCI-X Bus","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"SystemC; Computer science; Embedded system; USable; Conventional PCI; PCI configuration space; Model checking; Formal verification; Unified Modeling Language; System on a chip; Electronic system-level design and verification; Verification; Functional verification; Computer architecture; Intelligent verification; Software engineering; PCI Express; Field-programmable gate array; Programming language; Software; Software system; Software construction","score_opus":0.04695310806423794,"score_gpt":0.28019980282455403,"score_spread":0.2332466947603161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170457047","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.0011641667,0.000014941378,0.9946701,0.0002528777,0.00021670182,0.00026974597,4.037283e-7,0.000042332937,0.0033687288],"genre_scores_gemma":[0.21034224,6.071815e-7,0.7891426,0.00003613868,0.000017116861,0.000027022186,3.5441204e-7,0.000002119056,0.00043181665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99951714,0.000058423324,0.00013730362,0.000110169516,0.00010162197,0.000075324766],"domain_scores_gemma":[0.999288,0.000082484825,0.00008553134,0.00045771856,0.00007881072,0.0000074194377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045702248,0.000037049565,0.00004327958,0.00002036325,0.000051531213,0.000019297402,0.00054563273,0.00002511859,0.0000029600212],"category_scores_gemma":[0.000066912464,0.000024676028,0.000029270528,0.00019561425,0.000026647785,0.00016281402,0.000032688873,0.000020435442,0.000004630627],"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.0000037623588,0.000022866197,0.000054772394,0.0000064774285,0.0000013220098,9.598955e-9,0.000047583195,0.0009987146,0.024133166,0.9557402,0.0014135943,0.017577508],"study_design_scores_gemma":[0.00014442156,0.00003847868,0.007902812,0.0000041114918,0.000003066601,0.000001758487,0.000005286874,0.32138896,0.620414,0.0453239,0.0047083,0.000064861946],"about_ca_topic_score_codex":0.000019718378,"about_ca_topic_score_gemma":8.5896676e-7,"teacher_disagreement_score":0.9104163,"about_ca_system_score_codex":0.000015711155,"about_ca_system_score_gemma":0.000027587155,"threshold_uncertainty_score":0.101393044},"labels":[],"label_agreement":null},{"id":"W2170568320","doi":"10.1007/11562436_29","title":"Submodule Construction for Extended State Machine Models","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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 Ottawa","funders":"","keywords":"Parameterized complexity; Finite-state machine; Computer science; Automaton; State (computer science); Simple (philosophy); Variable (mathematics); Context (archaeology); Theoretical computer science; State variable; Algorithm; Mathematics","score_opus":0.028443257186956908,"score_gpt":0.27774211977457613,"score_spread":0.24929886258761924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170568320","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.000027441953,0.00037026458,0.99358875,0.00036481794,0.0023437229,0.0007972049,0.000023993889,0.00024193396,0.002241889],"genre_scores_gemma":[0.008882095,0.0000698566,0.98968357,0.00055599347,0.00035551784,0.00003372131,0.000010164746,0.000037623962,0.00037145705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996288,0.000045055887,0.00064344745,0.0015508742,0.000802212,0.0006704076],"domain_scores_gemma":[0.99722475,0.00028084574,0.0004282689,0.0015263133,0.00038022568,0.00015960111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014644496,0.0005011273,0.0004901316,0.0007678024,0.00028268527,0.0004281089,0.0027910662,0.00027733497,0.000010616922],"category_scores_gemma":[0.00009967768,0.00048371576,0.00014955092,0.00045253034,0.0006996614,0.0014787327,0.00066300307,0.00059235294,0.000017379085],"study_design_candidate":"design_other","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.000009793703,0.000014174325,0.000001700857,0.000024118468,0.0000056623207,0.0000032111607,0.00026712517,0.08386191,0.00007720108,0.16598557,0.0000053847884,0.7497441],"study_design_scores_gemma":[0.00018528753,0.00008994646,0.000012485499,0.0000625239,0.0000039241713,0.00004779549,4.8023473e-8,0.5960044,0.001970159,0.40045038,0.00084515096,0.0003278486],"about_ca_topic_score_codex":0.000012398012,"about_ca_topic_score_gemma":0.000028776632,"teacher_disagreement_score":0.7494163,"about_ca_system_score_codex":0.0004284667,"about_ca_system_score_gemma":0.00040838416,"threshold_uncertainty_score":0.99976146},"labels":[],"label_agreement":null},{"id":"W2185653305","doi":"10.5555/2615731.2615853","title":"POMDP planning and execution in an augmented space","year":2014,"lang":"en","type":"article","venue":"Kent Academic Repository (University of Kent)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Waterloo","funders":"","keywords":"Upper and lower bounds; Markov decision process; Computer science; Mathematical optimization; Partially observable Markov decision process; Suite; Linear programming; Space (punctuation); Branch and bound; Markov process; Mathematics; Algorithm","score_opus":0.019335016617178145,"score_gpt":0.2526442581872991,"score_spread":0.23330924157012092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185653305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7442184,0.0001050376,0.25401607,0.00013445797,0.00017967359,0.000096567,2.4621178e-7,0.000057923404,0.001191594],"genre_scores_gemma":[0.9344065,0.000026280994,0.06526321,0.000023883666,0.000027198756,2.72497e-7,0.0000018453443,0.0000036510285,0.0002471106],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99895746,0.00022907316,0.00014549459,0.00030485386,0.00020686531,0.00015625377],"domain_scores_gemma":[0.9993409,0.000041130144,0.00019329869,0.00029735948,0.000039196937,0.00008815195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053241255,0.00008617245,0.00013278109,0.00014841206,0.00013628801,0.000018776096,0.0005529938,0.00013700787,0.0000015388273],"category_scores_gemma":[0.000026957798,0.00010935474,0.000025152933,0.00021031224,0.00008942521,0.0010231804,0.0001527999,0.0002551159,0.0000024975961],"study_design_candidate":"observational","study_design_consensus":"observational","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.00026729167,0.00023078838,0.47906744,0.0002159953,0.000048864928,0.00006556743,0.03370846,0.0028989532,0.29521915,0.14155559,0.0013926637,0.045329224],"study_design_scores_gemma":[0.0010655911,0.00027624526,0.48971823,0.00022657766,0.000020427458,0.000046705103,0.0016792695,0.48805422,0.014733568,0.0013332639,0.0025183293,0.0003275757],"about_ca_topic_score_codex":0.00007431333,"about_ca_topic_score_gemma":0.000002156414,"teacher_disagreement_score":0.48515525,"about_ca_system_score_codex":0.000101696176,"about_ca_system_score_gemma":0.000024000536,"threshold_uncertainty_score":0.4459357},"labels":[],"label_agreement":null},{"id":"W21870292","doi":"10.1007/978-3-642-22012-8_22","title":"A Progress Measure for Explicit-State Probabilistic Model-Checkers","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"York University","funders":"Medical Research and Materiel Command","keywords":"Computer science; Measure (data warehouse); Model checking; Probabilistic logic; Property (philosophy); Theoretical computer science; Set (abstract data type); Interval (graph theory); State space; Algorithm; State (computer science); Programming language; Mathematics; Artificial intelligence; Data mining","score_opus":0.06402134570840635,"score_gpt":0.2911511280380323,"score_spread":0.22712978232962594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21870292","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.000033409528,0.0003316458,0.9945018,0.00024009815,0.0013372375,0.0017582254,0.000012520233,0.00029847983,0.0014865324],"genre_scores_gemma":[0.020967212,0.000013077178,0.97787166,0.0003983107,0.00016683643,0.00020908137,0.000004642077,0.000058818627,0.00031036223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995271,0.000052357955,0.00071716233,0.0020093815,0.0010398579,0.00091022067],"domain_scores_gemma":[0.99625546,0.00024394349,0.00050416996,0.0021071285,0.00065988465,0.00022941417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021744617,0.00066249556,0.0006084465,0.0007001107,0.00029246035,0.00044874306,0.0038316213,0.00037209602,0.0000042319907],"category_scores_gemma":[0.00028442743,0.0006009658,0.00019807692,0.0005524227,0.00089446676,0.00092060905,0.00096041843,0.0006882105,0.000019892568],"study_design_candidate":"design_other","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.000027946893,0.00004637351,0.00000858958,0.00015074144,0.0000148332665,0.00001291916,0.0021347788,0.04224406,0.00006526744,0.20544982,0.000017979628,0.74982667],"study_design_scores_gemma":[0.00016234218,0.00015490847,0.0000108980585,0.0002110206,0.00000809805,0.000023607097,4.9002658e-8,0.6062459,0.0011959297,0.39127094,0.00025083957,0.00046551155],"about_ca_topic_score_codex":0.0000066080984,"about_ca_topic_score_gemma":0.000022956654,"teacher_disagreement_score":0.74936116,"about_ca_system_score_codex":0.000423154,"about_ca_system_score_gemma":0.00086023787,"threshold_uncertainty_score":0.99964416},"labels":[],"label_agreement":null},{"id":"W2187140470","doi":"10.1287/ijoc.2015.0648","title":"Discrete Optimization with Decision Diagrams","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Binary decision diagram; Solver; Integer programming; Lagrangian relaxation; Mathematical optimization; Satisfiability; Mathematics; Benchmark (surveying); True quantified Boolean formula; Boolean satisfiability problem; Linear programming; Linear programming relaxation; Algorithm; Computer science","score_opus":0.016549421733042496,"score_gpt":0.2819093452471662,"score_spread":0.26535992351412374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187140470","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.021798193,0.000009572546,0.97553945,0.00037834834,0.00063383084,0.000085950924,2.849352e-7,0.000109937304,0.0014444301],"genre_scores_gemma":[0.29645252,0.000016360764,0.7031692,0.00019527292,0.0001326934,8.0726034e-7,2.4564412e-7,0.000008005213,0.000024881325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985235,0.000047008416,0.00042417116,0.00018592068,0.0005206966,0.00029871904],"domain_scores_gemma":[0.99860215,0.00028173183,0.00040470014,0.00037553208,0.00019179759,0.00014406869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010476044,0.00014430817,0.0001386345,0.00018239398,0.00031087673,0.0003893247,0.00075632957,0.00005320992,0.000010406328],"category_scores_gemma":[0.00029474442,0.000070420916,0.000055272438,0.0003634028,0.000040270792,0.0017742788,0.00013989687,0.00020463811,0.000049134764],"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.000039112383,0.000013155048,0.00056341814,0.0000021585518,0.000009497769,0.000010444318,0.00017873259,0.09941865,0.00003825373,0.028481584,0.000056041878,0.87118894],"study_design_scores_gemma":[0.0013723073,0.0008635569,0.005277615,0.00072963175,0.000005459642,0.00073557725,0.000025978494,0.9810538,0.0021084005,0.004781275,0.002657929,0.000388458],"about_ca_topic_score_codex":6.757679e-7,"about_ca_topic_score_gemma":3.225663e-7,"teacher_disagreement_score":0.8816352,"about_ca_system_score_codex":0.00012661036,"about_ca_system_score_gemma":0.00007632594,"threshold_uncertainty_score":0.3754267},"labels":[],"label_agreement":null},{"id":"W2187974744","doi":"","title":"Computer-aided algorithm design: automated tuning, configuration, selection, and beyond ( Invited Talk Abstract )","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"Computer science; Benchmark (surveying); Key (lock); Heuristic; Scheduling (production processes); Process (computing); Software; Selection (genetic algorithm); Computer engineering; Mathematical optimization; Machine learning; Artificial intelligence; Programming language","score_opus":0.021429711028560026,"score_gpt":0.28188839574391017,"score_spread":0.26045868471535016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187974744","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.010430357,0.000008029975,0.985699,0.00047732983,0.00072753645,0.0002849055,0.0000012500601,0.0016087012,0.0007629023],"genre_scores_gemma":[0.06989865,0.000003566062,0.92921454,0.000662559,0.00009520048,0.000018842753,0.000008715614,0.000012036708,0.00008588713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985791,0.00011602868,0.0003638961,0.0004414217,0.00024369423,0.00025589607],"domain_scores_gemma":[0.9988123,0.00014993733,0.00017575776,0.0004044956,0.0003155066,0.0001419586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008746655,0.00018192794,0.00016362497,0.00018762285,0.000256616,0.00039804296,0.00044928683,0.000156346,0.00006580309],"category_scores_gemma":[0.000105931314,0.00017192235,0.000026652353,0.00056926673,0.00008175413,0.0011440812,0.00008961956,0.0002881184,0.000033448043],"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.000011639614,0.00020630348,0.00023609228,0.0000296306,0.00006739792,0.00001447233,0.001221929,0.000688738,0.29949093,0.0785151,0.016928477,0.6025893],"study_design_scores_gemma":[0.0002612274,0.000097221746,0.011742867,0.0000041873573,0.0000042675333,0.00012563416,0.000008759077,0.9277803,0.056429006,0.0012450664,0.0020930292,0.00020844216],"about_ca_topic_score_codex":0.000058576177,"about_ca_topic_score_gemma":0.000013090431,"teacher_disagreement_score":0.92709154,"about_ca_system_score_codex":0.000024010931,"about_ca_system_score_gemma":0.00006035384,"threshold_uncertainty_score":0.701079},"labels":[],"label_agreement":null},{"id":"W2188082489","doi":"10.1007/978-3-642-41071-0_14","title":"Formal Analysis of Memory Contention in a Multiprocessor System","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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":"Computer science; HOL; Multiprocessing; Parallel computing; Scalability; Automated theorem proving; Distributed memory; Theoretical computer science; Shared memory; Programming language; Operating system","score_opus":0.02587207319668973,"score_gpt":0.26855053189223715,"score_spread":0.24267845869554744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188082489","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.0015560032,0.00020926842,0.99404407,0.000043216703,0.00090269325,0.0005241124,0.000005121515,0.000097461525,0.002618034],"genre_scores_gemma":[0.42111033,0.000008716319,0.5786069,0.000088170294,0.000050911287,0.000021729535,0.0000050345357,0.000012583906,0.00009559288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633694,0.00007605362,0.000986598,0.0011116947,0.0009498859,0.00053880323],"domain_scores_gemma":[0.9970792,0.0002858532,0.0007326249,0.001339545,0.0004627231,0.00010004059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021162366,0.00037895612,0.0008393863,0.0029879103,0.000098078584,0.00020627031,0.002813923,0.00032524503,0.000012977134],"category_scores_gemma":[0.00014987201,0.00034655406,0.00021539284,0.0023981726,0.0004334663,0.0014888244,0.0007632028,0.0005077465,0.000020528918],"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.000014714669,0.00005443417,0.000267698,0.00033012909,0.00009721567,0.000021711694,0.0019408423,0.11443906,0.0005906166,0.09596003,0.0000020211721,0.7862815],"study_design_scores_gemma":[0.00024244687,0.000081264225,0.001922236,0.00038729148,0.00004848772,0.000011582341,0.0000015052872,0.9912723,0.002191784,0.0034734448,0.000022463168,0.00034522943],"about_ca_topic_score_codex":0.00013400547,"about_ca_topic_score_gemma":0.00012474296,"teacher_disagreement_score":0.8768332,"about_ca_system_score_codex":0.00045257778,"about_ca_system_score_gemma":0.00024545577,"threshold_uncertainty_score":0.9998987},"labels":[],"label_agreement":null},{"id":"W2189209925","doi":"10.1109/wimob.2015.7347964","title":"Formal reliability analysis of wireless sensor network data transport protocols using HOL","year":2015,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Correctness; Reliability block diagram; Computer science; Wireless sensor network; Automated theorem proving; Reliability (semiconductor); Formal verification; Distributed computing; Mathematical proof; Computer network; Reliability engineering; Theoretical computer science; Algorithm; Engineering; Fault tree analysis; Programming language","score_opus":0.23430814362520172,"score_gpt":0.40725673254089095,"score_spread":0.17294858891568923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189209925","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.07029986,0.0000025230402,0.9258943,0.000031728643,0.00008463114,0.0028217023,0.000012887711,0.00008579175,0.0007665732],"genre_scores_gemma":[0.15943566,3.7545385e-7,0.84026355,0.0000334915,0.00003510296,0.00018161155,0.000020475964,0.0000048088514,0.000024954164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815387,0.00017566422,0.0005164485,0.00044577307,0.0004280135,0.00028026226],"domain_scores_gemma":[0.996782,0.000045945293,0.00022357596,0.0025881676,0.0002473316,0.00011296344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037142634,0.00011121278,0.0003236955,0.00011009124,0.00005659443,0.000033333414,0.0016602206,0.00007182013,0.0000090990225],"category_scores_gemma":[0.000096344804,0.00009438067,0.00007596476,0.0018857616,0.00007300184,0.0017206656,0.00031426526,0.000095412535,0.0000024417081],"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.00030634823,0.0006853006,0.2790152,0.00026055015,0.00080313295,0.0000089560735,0.0027295968,0.5462219,0.0014643531,0.102883615,0.00061544834,0.06500557],"study_design_scores_gemma":[0.00016079837,0.00004452717,0.017030997,0.000010871156,0.000100274425,0.0000019247984,0.00002852642,0.9804163,0.0011899166,0.00029960874,0.0005967908,0.0001194873],"about_ca_topic_score_codex":0.0001725178,"about_ca_topic_score_gemma":0.000020246684,"teacher_disagreement_score":0.43419436,"about_ca_system_score_codex":0.000047809397,"about_ca_system_score_gemma":0.00014852533,"threshold_uncertainty_score":0.3848732},"labels":[],"label_agreement":null},{"id":"W2191686679","doi":"10.1609/aaai.v28i1.8849","title":"Relaxation Search: A Simple Way of Managing Optional Clauses","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"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":"","keywords":"Satisfiability; Solver; Relaxation (psychology); Simple (philosophy); Computer science; Maximum satisfiability problem; Heuristic; Boolean satisfiability problem; Set (abstract data type); Task (project management); Flexibility (engineering); Algorithm; Conjunctive normal form; Mathematical optimization; Mathematics; Theoretical computer science; Artificial intelligence; Boolean function; Programming language","score_opus":0.13206539481356144,"score_gpt":0.33748093039612076,"score_spread":0.20541553558255932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2191686679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2046389,0.000009032367,0.7790237,0.0015113952,0.00041986725,0.00034280843,0.0000028897155,0.00008999134,0.013961412],"genre_scores_gemma":[0.91438806,0.000016735394,0.08538557,0.000076397126,0.000054122225,0.0000133127805,5.36998e-7,0.000007633282,0.000057640078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99822426,0.000049181537,0.00053817616,0.00035179945,0.00059910404,0.00023750454],"domain_scores_gemma":[0.99812543,0.00014004574,0.00046937354,0.00034021444,0.0008692032,0.000055724668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014374856,0.00014170806,0.00019477942,0.00016416052,0.00014342547,0.000110627174,0.0016855849,0.000070723676,0.000035284273],"category_scores_gemma":[0.0011619388,0.000112522925,0.0000854184,0.00063567556,0.0002671498,0.00056481507,0.00032170335,0.00021909135,0.00004122468],"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.000024695904,0.000051287218,0.00018762593,0.00004142436,0.0000053676713,2.1929084e-8,0.00071826344,0.00027568408,0.031211823,0.86302125,0.000030334902,0.104432225],"study_design_scores_gemma":[0.0000139296,0.00012029275,0.00087891746,0.00008801484,0.000004254194,0.0000011889983,0.00018372886,0.26802382,0.47333494,0.25718957,0.00006965358,0.00009166685],"about_ca_topic_score_codex":0.00003389855,"about_ca_topic_score_gemma":0.0000025334946,"teacher_disagreement_score":0.70974916,"about_ca_system_score_codex":0.00003964831,"about_ca_system_score_gemma":0.00005010748,"threshold_uncertainty_score":0.45885515},"labels":[],"label_agreement":null},{"id":"W2203616022","doi":"10.1145/587051.587073","title":"Model exploration with temporal logic query checking","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":36,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Temporal logic; Computer science; Model checking; Interval temporal logic; Computation tree logic; Linear temporal logic; Theoretical computer science; Temporal logic of actions; Set (abstract data type); Dynamic logic (digital electronics); Computation; Programming language","score_opus":0.19449058098194363,"score_gpt":0.2996504649904978,"score_spread":0.10515988400855417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203616022","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.00200355,0.000017860737,0.97293705,0.00054081174,0.000062500934,0.00008471881,9.870339e-8,0.000246657,0.024106737],"genre_scores_gemma":[0.3708114,0.0000043923183,0.62820005,0.00021621992,0.000013708778,0.000011979943,4.950186e-7,0.000003193879,0.00073853775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993236,0.000036296264,0.00012289593,0.0002076158,0.00017868004,0.00013089115],"domain_scores_gemma":[0.999471,0.00001073626,0.00005923127,0.0003729385,0.000050900366,0.000035176556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002261289,0.000073019655,0.00006446664,0.00005428678,0.000070520764,0.00009167207,0.00032138277,0.000033817345,0.00002040852],"category_scores_gemma":[0.000019101706,0.000054463464,0.000015454912,0.00024152383,0.00002183368,0.0017216656,0.000050744802,0.0000655671,0.00007309975],"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.000003706143,0.00006100113,0.0003092927,0.0000084386265,0.000004225493,0.0000029774096,0.0013054283,0.021461777,0.0007358514,0.9353366,0.0006511235,0.0401196],"study_design_scores_gemma":[0.00007848506,0.000044957655,0.000060349492,0.0000048311917,0.0000010013165,0.000005480151,0.000024723573,0.9879091,0.002407939,0.009193704,0.00017657939,0.00009285557],"about_ca_topic_score_codex":0.000007889078,"about_ca_topic_score_gemma":0.000004944143,"teacher_disagreement_score":0.9664473,"about_ca_system_score_codex":0.000028387354,"about_ca_system_score_gemma":0.00001038708,"threshold_uncertainty_score":0.22209555},"labels":[],"label_agreement":null},{"id":"W2208792883","doi":"10.1007/978-3-642-41707-8_14","title":"Challenges of Testing Periodic Messages in Avionics Systems Using TTCN-3","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","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":"University of Ottawa","funders":"","keywords":"Avionics; Computer science; Certification; Conformance testing; Embedded system; Test (biology); Layer (electronics); Programming language; Reliability engineering; Software engineering; Operating system; Engineering","score_opus":0.0933684558747225,"score_gpt":0.3042184143432304,"score_spread":0.21084995846850788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2208792883","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.0009109721,0.0045688925,0.98837143,0.0001139288,0.0017513774,0.0005311825,0.0000017177869,0.000085089414,0.0036653897],"genre_scores_gemma":[0.16296263,0.00013389665,0.8366166,0.000054328302,0.0001469334,0.000012843401,6.23689e-7,0.000027491522,0.00004470695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613786,0.0001269319,0.00089006056,0.0012830648,0.00096821255,0.0005938487],"domain_scores_gemma":[0.9967057,0.00055094727,0.00069232204,0.0015265403,0.0004186341,0.000105832376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002287415,0.00046156358,0.0006957162,0.0011108661,0.00014800904,0.00036423668,0.0031519122,0.0003854632,0.000004919603],"category_scores_gemma":[0.00043167136,0.00043717594,0.00007770982,0.0009096229,0.00064690784,0.00096020574,0.0010925331,0.0007623371,0.000013915026],"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.0000022812096,0.0000341338,0.00015045115,0.0003231913,0.0000070618653,0.000027882075,0.0016496523,0.1461201,0.00094823027,0.10616732,0.0000013908339,0.7445683],"study_design_scores_gemma":[0.00013645826,0.00012868116,0.0006946021,0.0015356431,0.000005076575,0.00009414112,0.0000014647738,0.9726574,0.0007854365,0.02342495,0.00007023012,0.00046593242],"about_ca_topic_score_codex":0.00012233369,"about_ca_topic_score_gemma":0.000026635253,"teacher_disagreement_score":0.82653725,"about_ca_system_score_codex":0.0004163884,"about_ca_system_score_gemma":0.000539441,"threshold_uncertainty_score":0.999808},"labels":[],"label_agreement":null},{"id":"W2213664160","doi":"10.1007/978-3-642-40787-1_18","title":"Reducing Monitoring Overhead by Integrating Event- and Time-Triggered Techniques","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"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; Overhead (engineering); Event (particle physics); Instrumentation (computer programming); Set (abstract data type); Runtime verification; Embedded system; State (computer science); Event monitoring; Real-time computing; Distributed computing; Program analysis; Execution time; Formal verification; Operating system; Wireless sensor network; Programming language","score_opus":0.017917282363314482,"score_gpt":0.28394053372725336,"score_spread":0.2660232513639389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213664160","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.00028858753,0.00078687497,0.9940952,0.00017615591,0.0010209322,0.00050102803,0.0000027278984,0.00032233185,0.002806136],"genre_scores_gemma":[0.013272474,0.000086800406,0.98554116,0.00014845465,0.00034564198,0.000024984352,0.0000025858837,0.000035095018,0.00054281024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655056,0.00007366636,0.0006213396,0.0014277146,0.0007524083,0.0005743147],"domain_scores_gemma":[0.9976248,0.0003809402,0.00042295948,0.0011776175,0.00023152256,0.00016217347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015151342,0.0005082888,0.00048511094,0.00058334443,0.00030422184,0.00085723674,0.0022167917,0.00036693036,0.000014825524],"category_scores_gemma":[0.00026256422,0.00046776613,0.00007453119,0.00047410539,0.00047886476,0.0013742475,0.0011538645,0.0009269518,0.000033585675],"study_design_candidate":"design_other","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.0000017105807,0.000010313353,0.0000194402,0.00003094623,0.000005372839,0.0000048843335,0.0005014128,0.0001786058,0.012742763,0.0067325816,0.00004658466,0.97972536],"study_design_scores_gemma":[0.00017145165,0.00030169467,0.00007965993,0.0019277476,0.000010432243,0.000111860114,6.799348e-7,0.6961096,0.22106738,0.07714726,0.0018484445,0.0012237949],"about_ca_topic_score_codex":0.0000572632,"about_ca_topic_score_gemma":0.0000011322287,"teacher_disagreement_score":0.9785016,"about_ca_system_score_codex":0.00037941453,"about_ca_system_score_gemma":0.00021442203,"threshold_uncertainty_score":0.9997774},"labels":[],"label_agreement":null},{"id":"W2222821827","doi":"10.1007/978-3-662-49674-9_28","title":"Approaching the Coverability Problem Continuously","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Petri net; Computer science; Reachability; Reachability problem; Pruning; Theoretical computer science; Encoding (memory); Process architecture; Programming language; Algorithm; Artificial intelligence","score_opus":0.024608110521431154,"score_gpt":0.2624790926917302,"score_spread":0.23787098217029903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2222821827","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.000030054047,0.00020458477,0.97537595,0.0014740725,0.0015865075,0.0007872754,0.000004210796,0.00020877986,0.020328555],"genre_scores_gemma":[0.030715108,0.00002130323,0.966973,0.0011642381,0.00043652052,0.000029997365,0.000001146236,0.000030396955,0.00062830036],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99574786,0.00016279526,0.00064353645,0.0016227441,0.0011149158,0.00070814666],"domain_scores_gemma":[0.9956023,0.000900777,0.00046565908,0.0026320766,0.00027141056,0.0001277411],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0044329795,0.0004940764,0.00046133334,0.00033680163,0.0004679907,0.00069976563,0.0059771296,0.00029938403,0.000013656997],"category_scores_gemma":[0.00032999934,0.00030226054,0.00014928127,0.00046806014,0.0013039308,0.000991285,0.0017429284,0.0009881123,0.00006505997],"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.0000037397951,0.000013078264,0.00003485992,0.000025130199,0.0000057507973,0.00000531323,0.0006144815,0.0017569956,0.00008921016,0.27877137,0.000009647809,0.7186704],"study_design_scores_gemma":[0.00024601835,0.0001410773,0.00023140782,0.00036439896,0.0000076735005,0.00008542667,1.6617825e-7,0.27530885,0.0013990649,0.71537524,0.0061241114,0.0007165633],"about_ca_topic_score_codex":0.0000123150185,"about_ca_topic_score_gemma":0.000015697118,"teacher_disagreement_score":0.71795386,"about_ca_system_score_codex":0.00042929867,"about_ca_system_score_gemma":0.00050890824,"threshold_uncertainty_score":0.99994296},"labels":[],"label_agreement":null},{"id":"W2227373513","doi":"","title":"Application d'une méthode de preuve probabiliste pour prouver la terminaison en temps moyen fini du protocole CSMA/CA 802.11b","year":2006,"lang":"fr","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Formal Methods in Verification","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":"Prevention of Organ Failure","funders":"","keywords":"Physics","score_opus":0.019164642138579397,"score_gpt":0.2575796435969476,"score_spread":0.23841500145836822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227373513","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.015715394,0.0004090154,0.89891064,0.01696457,0.00027375662,0.006718671,0.000057141504,0.00044747308,0.060503334],"genre_scores_gemma":[0.121322595,0.00010458121,0.8185794,0.00015101576,0.00016830092,0.005079383,0.00014552166,0.000099135854,0.054350097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9764133,0.019052403,0.0012416438,0.0014968433,0.0008152876,0.0009805395],"domain_scores_gemma":[0.9902375,0.002458359,0.0010942279,0.0035202987,0.0023770565,0.0003125715],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.019179208,0.0006116843,0.00053395,0.00026014037,0.00074862014,0.0010817097,0.0030000352,0.00061960693,0.0000833725],"category_scores_gemma":[0.0027820144,0.0006913498,0.00026622854,0.0015470191,0.00069195667,0.0014268304,0.0010432504,0.00082585175,0.00027589643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043825734,0.0023744628,0.0077306577,0.0006655018,0.000041085972,0.000015324704,0.014678227,0.00074733194,0.010038847,0.7822288,0.004807767,0.17662813],"study_design_scores_gemma":[0.0013960481,0.0000074402724,0.034292087,0.0017733404,0.000079397665,0.00026776272,0.00016115626,0.54806376,0.10434115,0.041891523,0.26663426,0.0010920684],"about_ca_topic_score_codex":0.006636455,"about_ca_topic_score_gemma":0.0024995785,"teacher_disagreement_score":0.7403373,"about_ca_system_score_codex":0.00072334014,"about_ca_system_score_gemma":0.00090159266,"threshold_uncertainty_score":0.9999784},"labels":[],"label_agreement":null},{"id":"W2234078087","doi":"10.1007/978-3-642-30885-7_11","title":"Temporal Logic Model Checking in Alloy","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":28,"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; Temporal logic; Transitive closure; Model checking; Description logic; Programming language; Computation tree logic; Semantics (computer science); Theoretical computer science; Transition system; Temporal logic of actions; Logic model; First-order logic; Interval temporal logic; Mathematics","score_opus":0.0604905728739901,"score_gpt":0.30076121105373504,"score_spread":0.24027063817974495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234078087","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.00013122657,0.0005501653,0.9933709,0.00029701836,0.0014024215,0.0003763131,0.0000017914464,0.00016355365,0.0037066138],"genre_scores_gemma":[0.13958359,0.00003771151,0.85903347,0.000921926,0.00023766309,0.000012250299,0.0000029389048,0.000027849677,0.00014258568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599195,0.00006560652,0.0006814064,0.0013892441,0.0009765524,0.0008952384],"domain_scores_gemma":[0.997474,0.00019735146,0.00036753042,0.0016314215,0.00015568132,0.00017397372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002569822,0.00052263215,0.0005292929,0.0010523552,0.00015208172,0.00034179498,0.004133717,0.00045034543,0.000012052789],"category_scores_gemma":[0.00015353602,0.0004938717,0.000111314264,0.0007653253,0.00052358385,0.0014000874,0.0015364175,0.0011127156,0.00005275145],"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.000005075886,0.000042146945,0.00036072228,0.00004175036,0.0000038480034,0.000029065835,0.0012100562,0.18825282,0.00029647484,0.19891155,0.000005605881,0.61084086],"study_design_scores_gemma":[0.00012384162,0.00004381618,0.0002836044,0.00017237653,0.0000024535157,0.000029868392,6.887794e-8,0.81196666,0.0007068758,0.18594606,0.00024379246,0.00048059324],"about_ca_topic_score_codex":0.000027382177,"about_ca_topic_score_gemma":0.000050595896,"teacher_disagreement_score":0.62371385,"about_ca_system_score_codex":0.0005432821,"about_ca_system_score_gemma":0.00045853716,"threshold_uncertainty_score":0.99975127},"labels":[],"label_agreement":null},{"id":"W2240436135","doi":"10.1109/tencon.2015.7373092","title":"SPIN model checking for the BEE system","year":2015,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Victoria","funders":"CMC Microsystems","keywords":"Stateflow; Model checking; Computer science; Nondeterministic algorithm; Spin (aerodynamics); Theoretical computer science; Programming language; MATLAB; Engineering; Mechanical engineering","score_opus":0.1606182181921288,"score_gpt":0.3553622359804744,"score_spread":0.1947440177883456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240436135","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.0004560696,0.00004241309,0.99046,0.0002899555,0.00031083138,0.00020814472,3.3320075e-7,0.00016701606,0.008065233],"genre_scores_gemma":[0.25479668,3.9356775e-7,0.74462515,0.000101860576,0.000039674,0.00004277454,1.0860928e-7,0.000002970579,0.0003904071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994862,0.000023475786,0.000108741624,0.00012933982,0.00013686508,0.00011534495],"domain_scores_gemma":[0.9994301,0.000048525355,0.000042652544,0.00035093166,0.00009024028,0.000037557864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011190143,0.000045657685,0.000051317722,0.000018701545,0.00007245222,0.00008342607,0.0006970496,0.000024484283,2.771111e-7],"category_scores_gemma":[0.00009259019,0.000028048697,0.000025865209,0.000103953585,0.0000129539885,0.00027480104,0.00009980289,0.000034368957,0.00001924574],"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.0000016271263,0.000003450524,0.0000043536706,0.000008902999,0.0000022805027,5.793452e-8,0.0003263791,0.007903731,0.0001238709,0.9732972,0.00072298816,0.017605187],"study_design_scores_gemma":[0.00008730598,0.00002615134,0.00001887676,0.0000050513245,0.0000020724412,0.0000033395581,0.00011747691,0.99249095,0.0033790788,0.0030051786,0.0008199577,0.000044586028],"about_ca_topic_score_codex":0.000011076399,"about_ca_topic_score_gemma":0.0000010336094,"teacher_disagreement_score":0.9845872,"about_ca_system_score_codex":0.00005394005,"about_ca_system_score_gemma":0.00004616808,"threshold_uncertainty_score":0.12953031},"labels":[],"label_agreement":null},{"id":"W2242407529","doi":"10.1109/ase.2015.71","title":"General LTL Specification Mining (T)","year":2015,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":134,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Computer science; Linear temporal logic; Property (philosophy); Temporal logic; Programming language; Set (abstract data type); Theoretical computer science; Formal specification; Data mining","score_opus":0.1335533269288322,"score_gpt":0.33297226979390454,"score_spread":0.19941894286507234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242407529","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.016973631,0.000020462978,0.8991391,0.00034162984,0.00048483931,0.000049613966,9.0383075e-8,0.00017908186,0.08281152],"genre_scores_gemma":[0.06274851,0.0000017026199,0.93483084,0.00017997898,0.00011015161,0.0000067453952,0.0000011508981,0.000003294039,0.0021176168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934155,0.000055871576,0.00012887311,0.00017803132,0.00018036133,0.00011534085],"domain_scores_gemma":[0.9993268,0.000014004456,0.000047422905,0.0004467397,0.00008426376,0.00008072001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054520095,0.000050565362,0.000049460992,0.000050364986,0.000030977815,0.00008008419,0.0004758347,0.000028402414,0.0000122412],"category_scores_gemma":[0.0000944138,0.000045308574,0.00001532862,0.00022907877,0.000015795084,0.0005337953,0.00007960351,0.000035425852,0.00022799392],"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.0000018339603,0.00001571053,0.0003993488,0.0000011647982,0.0000017831992,7.658997e-7,0.0006886503,0.00009765005,0.0010549151,0.9088497,0.007099266,0.08178918],"study_design_scores_gemma":[0.00036391203,0.00009954662,0.011259124,0.0000045565075,0.0000024643427,0.000029155806,0.00018618767,0.82357955,0.041418456,0.013456418,0.10931407,0.0002865365],"about_ca_topic_score_codex":0.000008649695,"about_ca_topic_score_gemma":8.0563035e-7,"teacher_disagreement_score":0.8953933,"about_ca_system_score_codex":0.000046743167,"about_ca_system_score_gemma":0.00003846888,"threshold_uncertainty_score":0.29304767},"labels":[],"label_agreement":null},{"id":"W2246097493","doi":"10.1109/icumt.2015.7382395","title":"Optimal control in a value-based automatic behavior composition framework","year":2015,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Université de Sherbrooke","funders":"","keywords":"Computation; Computer science; Set (abstract data type); Controller (irrigation); Control (management); Composition (language); Value (mathematics); Line (geometry); Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.03858075328261272,"score_gpt":0.3268700344256999,"score_spread":0.28828928114308716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246097493","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.108767115,0.000012984113,0.8894909,0.00036242406,0.0002652676,0.00029422372,7.053622e-7,0.00024636104,0.0005599921],"genre_scores_gemma":[0.46927682,6.565986e-8,0.5302579,0.0003867449,0.000011225104,0.000057922993,9.592703e-7,0.0000032177009,0.000005128245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988238,0.00023364072,0.0002473951,0.00021795183,0.00028483412,0.00019235212],"domain_scores_gemma":[0.9991828,0.000118722186,0.000073154624,0.0004555027,0.00006898599,0.00010083531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085115543,0.00009424828,0.00013582154,0.00012443366,0.000031308453,0.00009925559,0.0004922634,0.00008688923,0.000013693286],"category_scores_gemma":[0.0001109724,0.00008781481,0.00003287854,0.00035903644,0.000033406894,0.00041499312,0.000041586572,0.0001461885,0.00008691638],"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.00006436661,0.0010971663,0.01044434,0.00003963898,0.0000122764695,0.00005330433,0.001784649,0.06350893,0.002793325,0.8603186,0.00045674777,0.05942666],"study_design_scores_gemma":[0.00068961474,0.000114034076,0.011640292,0.000026238462,0.000005652711,0.0000065044956,0.000015589749,0.98388284,0.0018107884,0.0016588476,0.000034375793,0.00011521983],"about_ca_topic_score_codex":0.000030635125,"about_ca_topic_score_gemma":8.173477e-7,"teacher_disagreement_score":0.9203739,"about_ca_system_score_codex":0.00012699826,"about_ca_system_score_gemma":0.00009439876,"threshold_uncertainty_score":0.35809842},"labels":[],"label_agreement":null},{"id":"W2256808767","doi":"10.14279/tuj.eceasst.72.1026.1010","title":"Model-based WCET Analysis with Invariants","year":2015,"lang":"en","type":"article","venue":"Technische Universität Berlin – Universitätsbibliothek","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Correctness; Concurrency; Probabilistic logic; Markov decision process; State (computer science); Code (set theory); Static analysis; Automaton; Process (computing); Theoretical computer science; Programming language; Algorithm; Markov process; Artificial intelligence; Mathematics","score_opus":0.05179158253438404,"score_gpt":0.2640285841724283,"score_spread":0.21223700163804426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256808767","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.003556335,0.000033142314,0.95450157,0.00051437586,0.000072979725,0.00029113362,0.000020845771,0.0009136671,0.040095974],"genre_scores_gemma":[0.30790535,0.000010164044,0.6902187,0.00026193133,0.000014578225,0.0000019734675,0.000026504298,0.00002115127,0.0015396399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997356,0.00020168892,0.0002426774,0.0008370122,0.00080988865,0.0005527072],"domain_scores_gemma":[0.9968766,0.00008478508,0.00028827655,0.0017553292,0.0005246991,0.00047032896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008323669,0.00036606917,0.00043908914,0.006610579,0.00029481587,0.0002169323,0.0028271908,0.0002296875,0.00004794785],"category_scores_gemma":[0.000051400395,0.0003640387,0.00018507449,0.018031001,0.00026419933,0.0063418257,0.00049756106,0.00036344348,0.00006745036],"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.00045381353,0.00040713916,0.0020761532,0.000030159814,0.0010867404,0.0003525785,0.0017175635,0.23919296,0.0008110492,0.74505466,0.0060510193,0.0027661333],"study_design_scores_gemma":[0.0017906261,0.0003129811,0.00018645823,0.00002226821,0.0006068818,0.000014586438,0.000540563,0.982913,0.0017301062,0.0015668826,0.009689548,0.00062605273],"about_ca_topic_score_codex":0.00012083368,"about_ca_topic_score_gemma":0.000049129143,"teacher_disagreement_score":0.74372005,"about_ca_system_score_codex":0.00040731992,"about_ca_system_score_gemma":0.0007402483,"threshold_uncertainty_score":0.99988115},"labels":[],"label_agreement":null},{"id":"W2259714137","doi":"10.4204/eptcs.184.6","title":"Using Indexed and Synchronous Events to Model and Validate Cyber-Physical Systems","year":2015,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Liveness; Event (particle physics); Semantics (computer science); Search engine indexing; Construct (python library); State (computer science); Syntax; Model checking; Programming language; Real-time computing; Information retrieval; Artificial intelligence","score_opus":0.02960301789718997,"score_gpt":0.3100154273053389,"score_spread":0.28041240940814893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2259714137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45699033,0.00004090926,0.54228127,0.00009985257,0.00010774428,0.00021627503,2.2012794e-7,0.000058607402,0.00020481186],"genre_scores_gemma":[0.717749,0.0000033404422,0.28208444,0.000088831854,0.000049594026,0.000015129668,7.022077e-8,0.0000080063355,0.0000015643303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722785,0.00004800505,0.00028619144,0.0009003345,0.00066758343,0.00087002746],"domain_scores_gemma":[0.9989265,0.000051735205,0.000088197296,0.00027800183,0.00023278485,0.00042274015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031709152,0.00021321511,0.00027654585,0.0003051479,0.0001853864,0.000491662,0.0012947149,0.000065129716,1.5062149e-7],"category_scores_gemma":[0.00024646314,0.00019275055,0.000018367815,0.0012939355,0.00071799575,0.0013325085,0.0012294209,0.00031807937,0.0000036341],"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.000012318274,0.00003549406,0.0001668472,0.000014041558,0.0000020979874,8.9009404e-7,0.0016192954,0.0030651507,0.0022638263,0.9885815,0.0000026692398,0.004235904],"study_design_scores_gemma":[0.0002097888,0.0002606366,0.00017238197,0.000044993452,0.0000033068015,0.00008817207,0.000018063032,0.817455,0.0018576345,0.17968382,0.000006862526,0.00019932321],"about_ca_topic_score_codex":0.000007797318,"about_ca_topic_score_gemma":2.6341328e-7,"teacher_disagreement_score":0.8143899,"about_ca_system_score_codex":0.00044594734,"about_ca_system_score_gemma":0.0003454998,"threshold_uncertainty_score":0.78601396},"labels":[],"label_agreement":null},{"id":"W2261464827","doi":"10.1007/978-3-642-39634-2_22","title":"Formal Reasoning about Classified Markov Chains in HOL","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; HOL; Markov chain; Theoretical computer science; Probabilistic logic; Model checking; Scalability; State space; Formal verification; Formal methods; Markov model; Automated theorem proving; Computation; Markov process; Algorithm; Programming language; Artificial intelligence; Machine learning; Mathematics","score_opus":0.024989372464550366,"score_gpt":0.27105376374123474,"score_spread":0.2460643912766844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261464827","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.00032478102,0.00028889565,0.97873116,0.00038083768,0.002274929,0.0006811232,0.0000028156906,0.00020046337,0.017115],"genre_scores_gemma":[0.04548237,0.00006291115,0.9521396,0.0010088055,0.00036195392,0.00004339694,0.000004934413,0.000042188563,0.0008538423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99494636,0.000102827275,0.00086144754,0.001741876,0.0011539927,0.0011935133],"domain_scores_gemma":[0.99668103,0.00036879515,0.0004900544,0.0019989093,0.00024184154,0.00021937645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025166771,0.0006367057,0.000642479,0.0013739574,0.00027249937,0.0007579086,0.004704618,0.00055789115,0.000043718814],"category_scores_gemma":[0.00031483217,0.0006052501,0.0001371589,0.0010351967,0.0006946528,0.0022948221,0.0017880308,0.0014672001,0.00012487944],"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.000006543107,0.000022353583,0.00008160029,0.000039559756,0.0000046774207,0.00003713349,0.0008697176,0.0046288306,0.0001385227,0.16080132,0.00002393652,0.83334583],"study_design_scores_gemma":[0.0002938934,0.00013316462,0.002376878,0.0006257932,0.0000036480096,0.000071901675,4.0351352e-7,0.95223576,0.0010828134,0.040979713,0.0013967426,0.00079926115],"about_ca_topic_score_codex":0.000057506222,"about_ca_topic_score_gemma":0.00008019334,"teacher_disagreement_score":0.947607,"about_ca_system_score_codex":0.0006402278,"about_ca_system_score_gemma":0.0005416436,"threshold_uncertainty_score":0.99963987},"labels":[],"label_agreement":null},{"id":"W2275767068","doi":"10.1145/2833258.2833285","title":"Stateflow to Tabular Expressions","year":2015,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Stateflow; Completeness (order theory); Expression (computer science); Computer science; Programming language; Semantics (computer science); Theoretical computer science; Algorithm; Mathematics","score_opus":0.10089033329294664,"score_gpt":0.3473226410801108,"score_spread":0.24643230778716416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275767068","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.004847054,0.000010127669,0.9739004,0.0006575933,0.0003793071,0.00008304908,3.7352214e-7,0.00018551324,0.01993663],"genre_scores_gemma":[0.038207818,6.003154e-7,0.9598591,0.0005749489,0.000023161618,0.000015254636,3.7195088e-7,0.0000030040574,0.001315738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993826,0.000050607996,0.00009229915,0.00016083347,0.00018319367,0.00013042524],"domain_scores_gemma":[0.9991777,0.000015206868,0.00001701057,0.0005140154,0.000076024604,0.0002000746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039944585,0.000046248617,0.00004813962,0.000049662456,0.00003181756,0.000059391292,0.0005690796,0.000019739431,0.00001849214],"category_scores_gemma":[0.00017503063,0.000037026806,0.000011535225,0.00025339084,0.000007961794,0.0003870115,0.0002081048,0.00003784931,0.00055578456],"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.0000081693,0.00007279457,0.00025644994,0.0000038436146,0.0000049438663,0.0000064516244,0.0035151758,0.0016697287,0.010290801,0.7959338,0.083546944,0.10469089],"study_design_scores_gemma":[0.00045125498,0.00029612443,0.001842217,0.000020614487,0.0000027542444,0.000010429492,0.00036390056,0.18412177,0.15473832,0.030353656,0.6273277,0.00047128013],"about_ca_topic_score_codex":0.0000146749735,"about_ca_topic_score_gemma":0.0000012668851,"teacher_disagreement_score":0.7655802,"about_ca_system_score_codex":0.000024757028,"about_ca_system_score_gemma":0.000039562103,"threshold_uncertainty_score":0.71436715},"labels":[],"label_agreement":null},{"id":"W2282572932","doi":"10.1007/3-540-45694-5_24","title":"Weak Bisimulation is Sound and Complete for PCTL*","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McGill University; Université Laval","funders":"","keywords":"Bisimulation; Probabilistic logic; Mathematics; Discrete mathematics; Computer science; Countable set; Markov chain; Theoretical computer science; Artificial intelligence","score_opus":0.06391941755167309,"score_gpt":0.3009457811428017,"score_spread":0.2370263635911286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282572932","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.000051565163,0.0003253732,0.9948279,0.0005781596,0.0012965867,0.0006662362,0.00001437803,0.00012713838,0.0021126163],"genre_scores_gemma":[0.026189756,0.00003823031,0.9718549,0.0011960425,0.0003138583,0.000011680839,0.0000046491114,0.000030140622,0.00036071124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968735,0.000034341254,0.00050636573,0.0014014199,0.0006725438,0.000511803],"domain_scores_gemma":[0.9974464,0.00061016675,0.00033061294,0.0012020802,0.0002761446,0.00013459066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010181065,0.00042568467,0.00042914366,0.0006533396,0.00034732715,0.0006056269,0.001868464,0.00030252038,0.000017929044],"category_scores_gemma":[0.00014413269,0.00041327605,0.000098778495,0.00041299805,0.000592062,0.00081624364,0.0006824836,0.00041403057,0.00002592859],"study_design_candidate":"design_other","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.000007352388,0.000017820996,0.00004774439,0.00007980789,0.000010797363,0.0000035087223,0.0010318811,0.010659771,0.00012038721,0.17499775,0.000042242533,0.81298095],"study_design_scores_gemma":[0.00019599497,0.00012314456,0.0001309412,0.00008106373,0.000005655887,0.000023759647,6.804102e-8,0.72097147,0.00026954795,0.2727389,0.0051015047,0.00035794528],"about_ca_topic_score_codex":0.0000073099573,"about_ca_topic_score_gemma":0.000006855717,"teacher_disagreement_score":0.81262296,"about_ca_system_score_codex":0.00019529532,"about_ca_system_score_gemma":0.00008890265,"threshold_uncertainty_score":0.9998319},"labels":[],"label_agreement":null},{"id":"W2283789680","doi":"10.14288/1.0052102","title":"Projectagon-based reachability analysis for circuit-level formal verification","year":2011,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 British Columbia","funders":"","keywords":"Reachability; Computer science; Formal verification; Correctness; Model checking; Computation; Nonlinear system; Theoretical computer science; Algorithm; Analogue electronics; Computer engineering; Electronic circuit; Electrical engineering","score_opus":0.06681171458693645,"score_gpt":0.22590077158348884,"score_spread":0.1590890569965524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283789680","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.28837654,0.00000971443,0.71000946,0.000014420575,0.00009420057,0.00038856413,0.00010152865,0.000105426305,0.0009001248],"genre_scores_gemma":[0.6878155,0.0000030548958,0.31203288,0.00001862522,0.0000075226376,0.0000047224453,0.000027361293,0.0000052676837,0.000085047825],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99857354,0.000115472656,0.00020855351,0.000554441,0.00025134336,0.00029664277],"domain_scores_gemma":[0.99819773,0.00006313074,0.0002748878,0.0008642762,0.00050384155,0.000096149844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009945238,0.000052865315,0.00026681804,0.00014168816,0.0002856334,0.00007777825,0.0010446141,0.00012298465,0.000026026888],"category_scores_gemma":[0.00012739864,0.00017827642,0.00023685044,0.0012319767,0.00019545812,0.0011395768,0.00010819868,0.000090614674,0.00000610975],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027919099,0.00033086888,0.025869435,0.00011998784,0.00013874902,0.0000049427026,0.0010333133,0.000029863184,0.00035863763,0.00074517657,0.00013453107,0.97120655],"study_design_scores_gemma":[0.0005135276,0.0001328608,0.94953334,0.000016618955,0.000108967084,0.0000036724261,0.00020654082,0.04801967,0.000055412773,0.0011197863,0.00010323052,0.00018635986],"about_ca_topic_score_codex":0.03706016,"about_ca_topic_score_gemma":0.029371917,"teacher_disagreement_score":0.9710202,"about_ca_system_score_codex":0.00011257231,"about_ca_system_score_gemma":0.0001708898,"threshold_uncertainty_score":0.98833954},"labels":[],"label_agreement":null},{"id":"W2286310935","doi":"10.48550/arxiv.1510.04316","title":"Probabilistic Opacity in Refinement-Based Modeling","year":2015,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Probabilistic logic; Markov chain; Computer science; Predicate (mathematical logic); Opacity; Theoretical computer science; TRACE (psycholinguistics); Algorithm; Discrete mathematics; Mathematics; Programming language; Artificial intelligence","score_opus":0.046850076674516475,"score_gpt":0.2891373620883717,"score_spread":0.24228728541385525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286310935","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.035607778,0.00065276027,0.95755154,0.0019114498,0.0005201284,0.0016942269,0.00003706089,0.0012939362,0.0007311347],"genre_scores_gemma":[0.31833556,0.000029723069,0.6793994,0.00061293686,0.00007957874,0.0013792401,0.0000449622,0.00005257675,0.00006606459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99497366,0.00067057536,0.0011499973,0.0013650559,0.0008563812,0.0009843402],"domain_scores_gemma":[0.995074,0.00010575963,0.0005508696,0.0034426975,0.00042894518,0.00039776147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0045425934,0.0006577453,0.00073798816,0.0010414618,0.00013688998,0.0005330868,0.0032343438,0.0008225914,0.000007288818],"category_scores_gemma":[0.0013767487,0.0007167289,0.00021883934,0.0009563879,0.00009352774,0.00054238713,0.002129519,0.0017708526,0.00001762738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005460495,0.00034748952,0.0013184595,0.00025910005,0.000017962811,0.000039982595,0.00033354684,0.8969981,0.0002797176,0.08595898,0.00037262175,0.014019409],"study_design_scores_gemma":[0.00040922943,0.00007895411,0.0008387367,0.0002550463,0.000016088166,0.000014030465,0.000016262798,0.9425772,0.0010290183,0.05393153,0.00018084497,0.0006531003],"about_ca_topic_score_codex":0.0099530835,"about_ca_topic_score_gemma":0.0021444405,"teacher_disagreement_score":0.28272778,"about_ca_system_score_codex":0.0025161128,"about_ca_system_score_gemma":0.0017758992,"threshold_uncertainty_score":0.9995284},"labels":[],"label_agreement":null},{"id":"W2293413622","doi":"10.1007/978-3-319-30303-1_15","title":"Runtime Monitoring of Stream Logic Formulae","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Programming language; Parallel computing; Algorithm; Theoretical computer science","score_opus":0.03395117547719776,"score_gpt":0.29131269466324794,"score_spread":0.25736151918605016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293413622","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.00013644378,0.00028347512,0.9896442,0.00015156483,0.0023717685,0.0002907541,0.000004490502,0.00013090234,0.006986361],"genre_scores_gemma":[0.06423101,0.000049733528,0.9348744,0.00009930942,0.000393173,0.0000067361566,7.013152e-7,0.000023549937,0.00032137695],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966449,0.000039938248,0.000640004,0.0011313653,0.0009789905,0.00056475814],"domain_scores_gemma":[0.9968475,0.00040191022,0.00052041165,0.0017831172,0.00032421455,0.00012284586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012063838,0.00042562606,0.00051228,0.0007564254,0.0001422685,0.00017336637,0.00398927,0.0003168178,0.000015171011],"category_scores_gemma":[0.00017980147,0.0003344557,0.0001364746,0.000490888,0.0006349979,0.0009122211,0.0012595705,0.0004580331,0.0000465975],"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.000004133278,0.000017922941,0.00017787256,0.000040458595,0.000007750952,0.000011159846,0.00026333323,0.0017297909,0.0009962284,0.16367345,0.0000020403477,0.8330759],"study_design_scores_gemma":[0.0004384822,0.00047064174,0.0011727032,0.0014366192,0.000013958785,0.00006664238,2.3560737e-7,0.1589928,0.075775765,0.7596497,0.0008555858,0.0011268858],"about_ca_topic_score_codex":0.0000060498082,"about_ca_topic_score_gemma":0.0000019346426,"teacher_disagreement_score":0.831949,"about_ca_system_score_codex":0.0002890128,"about_ca_system_score_gemma":0.00031817972,"threshold_uncertainty_score":0.9999108},"labels":[],"label_agreement":null},{"id":"W2294843272","doi":"10.1007/978-3-662-48899-7_29","title":"Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":30,"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":"Preprocessor; Computer science; True quantified Boolean formula; Cube (algebra); Algorithm; Solver; Power (physics); Artificial intelligence; Mathematics; Combinatorics; Programming language","score_opus":0.02872134792203278,"score_gpt":0.29912275326076293,"score_spread":0.27040140533873014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294843272","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.00016601452,0.0005406668,0.9951211,0.00062013615,0.0017407415,0.00050093874,0.0000073146202,0.00029787258,0.0010051895],"genre_scores_gemma":[0.08381505,0.000018672488,0.9150716,0.000514593,0.00015676809,0.000014277794,0.00002030847,0.000047392496,0.0003413331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99477166,0.00014198864,0.00070628466,0.0017109829,0.0018280265,0.0008410675],"domain_scores_gemma":[0.996323,0.0005149729,0.00041024448,0.0018008373,0.00068258925,0.0002683733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036342747,0.00057177513,0.000504361,0.0010623462,0.00033393397,0.00066817924,0.0039546336,0.0004489359,0.000015861657],"category_scores_gemma":[0.00043863175,0.0005769636,0.0001133648,0.00088477414,0.00073531154,0.0010893294,0.0010053514,0.001091327,0.000064583706],"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.000014033518,0.000059310965,0.0000097104175,0.000111151916,0.000011667675,0.000027844271,0.0012644451,0.0570437,0.010579609,0.017214872,0.00006770543,0.913596],"study_design_scores_gemma":[0.00026804555,0.00019025801,0.000038464383,0.0003382745,0.000007756089,0.000021053937,3.3241477e-7,0.9509478,0.022862,0.023835048,0.0008517732,0.0006391767],"about_ca_topic_score_codex":0.000027157217,"about_ca_topic_score_gemma":0.00007050759,"teacher_disagreement_score":0.9129568,"about_ca_system_score_codex":0.0012060595,"about_ca_system_score_gemma":0.0010897941,"threshold_uncertainty_score":0.9996682},"labels":[],"label_agreement":null},{"id":"W2295941719","doi":"","title":"Composing snippets","year":2000,"lang":"en","type":"article","venue":"International Symposium on Advanced Research in Asynchronous Circuits and Systems","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Computer science; Constraint (computer-aided design); Implementation; Simple (philosophy); Process (computing); Formal verification; Distributed computing; Programming language; Model checking; Formal methods; Theoretical computer science; Software engineering; Engineering","score_opus":0.06170759449847835,"score_gpt":0.3706100543107172,"score_spread":0.30890245981223885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295941719","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3922572,0.0016147075,0.14530317,0.0059599043,0.0056795897,0.0024505574,0.000034435754,0.00045457415,0.44624585],"genre_scores_gemma":[0.99334216,0.0004890071,0.00509567,0.00007482684,0.00016924649,0.00010984141,0.0000059712834,0.000016610808,0.0006966912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690497,0.00048663488,0.00045481176,0.0006290353,0.0010119235,0.00051265],"domain_scores_gemma":[0.99874955,0.00031672113,0.00007849749,0.0005050922,0.00020211596,0.00014799357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020099573,0.00016216232,0.00020970327,0.00034762334,0.00022855285,0.000466054,0.001071799,0.00009073132,0.00003372248],"category_scores_gemma":[0.00006036283,0.00015402795,0.000035554727,0.00046376052,0.0001289211,0.0007452549,0.0001128992,0.0004470838,0.00015184919],"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.00004594657,0.00027610728,0.0009019335,0.000067574416,0.000027491713,0.00009226581,0.00081717985,0.022382058,0.015341082,0.2776366,0.000080981605,0.6823308],"study_design_scores_gemma":[0.002501076,0.0008885286,0.010146726,0.0012999824,0.000002425288,0.0004469467,0.00024549675,0.8580082,0.004733546,0.004274967,0.116643615,0.0008084984],"about_ca_topic_score_codex":0.00010932866,"about_ca_topic_score_gemma":0.000006203308,"teacher_disagreement_score":0.8356261,"about_ca_system_score_codex":0.000442686,"about_ca_system_score_gemma":0.000061075094,"threshold_uncertainty_score":0.6281077},"labels":[],"label_agreement":null},{"id":"W2296115762","doi":"10.1109/aspdac.2016.7428000","title":"A complete approach to unreachable state diagnosability via property directed reachability","year":2016,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"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":"","keywords":"Reachability; Computer science; Model checking; Bounded function; State (computer science); Relation (database); Abstract interpretation; Transition system; Invariant (physics); Formal verification; Liveness; Set (abstract data type); Theoretical computer science; Algorithm; Mathematics; Programming language","score_opus":0.050960989746703114,"score_gpt":0.2749802512701578,"score_spread":0.2240192615234547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296115762","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.0063418243,0.0000056260715,0.9624889,0.0014586287,0.00015714791,0.0009268516,0.000013211588,0.0010095666,0.027598247],"genre_scores_gemma":[0.15797128,0.0000018921055,0.838823,0.0002475064,0.000024455427,0.0002610064,0.0000023649984,0.000012449387,0.0026560149],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971841,0.0005648941,0.00043485354,0.0009415611,0.00038728226,0.00048730307],"domain_scores_gemma":[0.99717575,0.00029379333,0.00009275783,0.0019312482,0.00024445422,0.00026198206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021177267,0.00021423062,0.0002727183,0.00008611203,0.00013327325,0.00008840845,0.0012740486,0.0000622483,0.000048845057],"category_scores_gemma":[0.0009852967,0.000106561914,0.00007212208,0.00067195273,0.00014120316,0.0008349466,0.00051795534,0.00010977421,0.0004230852],"study_design_candidate":"design_other","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.0000603937,0.00085454335,0.004148931,0.00006748106,0.000022279373,9.227059e-7,0.0011371583,0.000033289016,0.024722623,0.037824765,0.0013575556,0.92977005],"study_design_scores_gemma":[0.0022233673,0.0011937761,0.2133473,0.0001220419,0.000021730733,0.0000590748,0.0000558832,0.4407885,0.06532789,0.066342086,0.20798856,0.0025297946],"about_ca_topic_score_codex":0.00065420306,"about_ca_topic_score_gemma":0.000030315217,"teacher_disagreement_score":0.92724025,"about_ca_system_score_codex":0.00022999784,"about_ca_system_score_gemma":0.000060609185,"threshold_uncertainty_score":0.5438045},"labels":[],"label_agreement":null},{"id":"W2297874203","doi":"10.48550/arxiv.1603.03916","title":"Robust Supervisors for Intersection Collision Avoidance in the Presence of Uncontrolled Vehicles","year":2016,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centers for Disease Control and Prevention; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Supervisor; Intersection (aeronautics); Collision avoidance; Metric (unit); Bounded function; Computer science; Process (computing); Collision; Control theory (sociology); Controller (irrigation); Mathematical optimization; Control (management); Mathematics; Engineering; Artificial intelligence","score_opus":0.09927373631633664,"score_gpt":0.30714599286269845,"score_spread":0.20787225654636182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2297874203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5137049,0.00011390081,0.4838925,0.00054158416,0.00078957155,0.0007763128,0.000007937836,0.000035864196,0.00013743168],"genre_scores_gemma":[0.9231467,0.000064867214,0.07608478,0.0000841053,0.00011586972,0.00040558714,0.0000038549492,0.000012874544,0.000081329534],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977657,0.0005206245,0.0005654665,0.0005828988,0.00030768587,0.00025760423],"domain_scores_gemma":[0.9972276,0.0008243644,0.00042069587,0.0012630125,0.000232777,0.0000315242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023392653,0.0002101545,0.00034316312,0.00016468405,0.00008943773,0.000064432694,0.002172784,0.00021786972,0.0000022848847],"category_scores_gemma":[0.0010455634,0.00014000408,0.0001537585,0.00029841618,0.0001069354,0.0004131306,0.00059538725,0.0003541072,0.000008565851],"study_design_candidate":"observational","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.0025870365,0.0017635613,0.45034078,0.0033746513,0.00038894644,0.000022232602,0.056631383,0.092319146,0.110422075,0.15467104,0.0041752337,0.12330391],"study_design_scores_gemma":[0.0033510516,0.0005965749,0.3375988,0.0018943191,0.00005159184,0.000011095115,0.00093021715,0.5548782,0.06647445,0.031906653,0.0014068973,0.0009001658],"about_ca_topic_score_codex":0.00009237205,"about_ca_topic_score_gemma":0.00004921393,"teacher_disagreement_score":0.46255904,"about_ca_system_score_codex":0.00011652033,"about_ca_system_score_gemma":0.0001127864,"threshold_uncertainty_score":0.57092005},"labels":[],"label_agreement":null},{"id":"W2311867883","doi":"10.1145/3076125.3076127","title":"Automated closed-loop model checking of implantable pacemakers using abstraction trees","year":2017,"lang":"en","type":"article","venue":"ACM SIGBED Review","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Abstraction; Model checking; Computer science; Set (abstract data type); Domain (mathematical analysis); Tree (set theory); Variety (cybernetics); Abstraction model checking; Artificial intelligence; Programming language","score_opus":0.14148504968645098,"score_gpt":0.4129384550422411,"score_spread":0.2714534053557901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2311867883","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.07759658,0.028272763,0.8825677,0.0008919882,0.0012938859,0.0016548045,0.000020202611,0.0010749296,0.006627115],"genre_scores_gemma":[0.21356703,0.0105578685,0.7755731,0.00016169589,0.000030876636,0.00001710674,0.000005286033,0.000016377826,0.00007065373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866575,0.00009905286,0.00045900178,0.00029604443,0.0002518784,0.00022826341],"domain_scores_gemma":[0.9967641,0.000077826844,0.00084972935,0.002133876,0.00011849027,0.000055960332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012211899,0.00014581459,0.00037711882,0.000054700555,0.00028035487,0.00011536915,0.0014649715,0.00007480319,0.0000056919735],"category_scores_gemma":[0.0011963107,0.0001291651,0.00009935689,0.00014951093,0.000058446592,0.001252908,0.00032784874,0.0001299162,0.00001677155],"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.000033391134,0.0002650928,0.001097396,0.009843441,0.00020324398,0.00002006444,0.0006606672,0.011335406,0.27485484,0.035237044,0.0042339964,0.6622154],"study_design_scores_gemma":[0.00017043091,0.000023742958,0.0016383189,0.002197563,0.000058456186,0.0000400243,0.0000053186277,0.9741869,0.019814651,0.00091093214,0.00074764586,0.00020599499],"about_ca_topic_score_codex":0.00007352177,"about_ca_topic_score_gemma":0.0000025224924,"teacher_disagreement_score":0.9628515,"about_ca_system_score_codex":0.000060506067,"about_ca_system_score_gemma":0.000089207955,"threshold_uncertainty_score":0.52672},"labels":[],"label_agreement":null},{"id":"W2318407799","doi":"10.3166/jesa.43.821-835","title":"Synthèse de contrôleurs discrets Mise en oeuvre matérielle de superviseurs","year":2009,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Medicine","score_opus":0.03725183192654378,"score_gpt":0.2979985180817157,"score_spread":0.2607466861551719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318407799","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.16058043,0.02098557,0.79517215,0.010690407,0.0037365565,0.00053487817,0.00003532946,0.000547301,0.007717392],"genre_scores_gemma":[0.33758292,0.002687316,0.64861417,0.0013597906,0.0011304149,0.000008784175,0.0000031759826,0.00009406762,0.008519407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99141693,0.0037984548,0.0014367121,0.000660916,0.0009484646,0.0017385406],"domain_scores_gemma":[0.996001,0.0005525521,0.0008428567,0.0010786847,0.00044683044,0.0010780492],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0047135605,0.0006602812,0.0007846637,0.00037455236,0.00090357644,0.0019802153,0.002382258,0.00041857222,0.00026873467],"category_scores_gemma":[0.0021659094,0.00065374107,0.00045405034,0.00090329925,0.00039461392,0.0027493502,0.0002594582,0.0013094079,0.00040079633],"study_design_candidate":"design_other","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.000059980885,0.00036926926,0.0008618885,0.00029409237,0.00012139258,0.0014747721,0.015686303,0.0017900337,0.0035662411,0.12490462,0.0071474854,0.8437239],"study_design_scores_gemma":[0.0011657542,0.00094415015,0.39838746,0.0021679304,0.00020935734,0.023781879,0.0007103686,0.50337183,0.0024695483,0.046413213,0.019400405,0.0009780619],"about_ca_topic_score_codex":0.0001397993,"about_ca_topic_score_gemma":0.000013460555,"teacher_disagreement_score":0.84274584,"about_ca_system_score_codex":0.0013596053,"about_ca_system_score_gemma":0.00088194036,"threshold_uncertainty_score":0.9995914},"labels":[],"label_agreement":null},{"id":"W2324628900","doi":"10.3166/jesa.47.403-421","title":"Safe design method of embedded control systems. Case study","year":2013,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Counterexample; Controller (irrigation); Component (thermodynamics); Formal verification; Code (set theory); Embedded system; Control (management); Programming language; Set (abstract data type)","score_opus":0.06715318886156338,"score_gpt":0.3328472048347488,"score_spread":0.2656940159731854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2324628900","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.032940034,0.008144226,0.94908863,0.00023512683,0.005601433,0.0028219009,0.000015448843,0.00018956783,0.00096363557],"genre_scores_gemma":[0.36248112,0.00008514813,0.6347572,0.000055087698,0.00033459833,0.000083878585,2.5983846e-7,0.00006412316,0.0021385949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9785499,0.015550664,0.0029177843,0.00068258034,0.0012878546,0.00101121],"domain_scores_gemma":[0.9912795,0.0017276398,0.0027942029,0.0014260272,0.0021403227,0.0006323233],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01101118,0.0006547597,0.0014163536,0.0005742148,0.00070860476,0.0018086013,0.0017099886,0.00028000315,0.00032919794],"category_scores_gemma":[0.0017522363,0.0005857966,0.00034747014,0.0012631923,0.00034579713,0.003405111,0.00029954148,0.0009219322,0.000515423],"study_design_candidate":"design_other","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.000044460725,0.0012066027,0.0006621542,0.001019414,0.0009430763,0.0075608552,0.016631177,0.040409137,0.0016831583,0.0155160045,0.0041781734,0.91014576],"study_design_scores_gemma":[0.0018210857,0.0018543643,0.018874258,0.00076575484,0.00034496177,0.12820375,0.004134899,0.84066015,0.0002878443,0.0021886071,0.0003462653,0.00051806803],"about_ca_topic_score_codex":0.0021193624,"about_ca_topic_score_gemma":0.0000092109685,"teacher_disagreement_score":0.90962774,"about_ca_system_score_codex":0.0005408073,"about_ca_system_score_gemma":0.00057912845,"threshold_uncertainty_score":0.99965936},"labels":[],"label_agreement":null},{"id":"W2324937174","doi":"10.3166/jesa.47.29-46","title":"Modélisation algébrique du dîner des philosophes","year":2013,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Philosophy; Political science","score_opus":0.05491088448781514,"score_gpt":0.2829298627585049,"score_spread":0.22801897827068976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2324937174","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.13458838,0.009471614,0.8360777,0.0042071193,0.0046099457,0.0006090896,0.0000082819615,0.00041104676,0.010016833],"genre_scores_gemma":[0.41336548,0.0015829161,0.5783394,0.00041752894,0.0016772973,0.000046597368,0.0000026013088,0.00008568099,0.004482539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936557,0.0023084092,0.001485925,0.000596174,0.00095137773,0.0010024392],"domain_scores_gemma":[0.995568,0.00032615862,0.0012253922,0.00086978666,0.0014161034,0.0005946019],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0025208022,0.00056730304,0.00058767956,0.00039999068,0.001162827,0.002964185,0.0016022569,0.00030854307,0.0009925043],"category_scores_gemma":[0.0015564987,0.0005295999,0.00032306684,0.0009404729,0.00088612566,0.00813583,0.0003876945,0.00082574395,0.0028224583],"study_design_candidate":"design_other","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.0000097866905,0.00019355273,0.0011924336,0.00039192714,0.0001291696,0.00010503348,0.00560081,0.0035843402,0.0012997655,0.13459513,0.006478664,0.8464194],"study_design_scores_gemma":[0.00033842868,0.00027230917,0.27281228,0.00075876364,0.00004961186,0.004538089,0.00010215635,0.5232477,0.00093810604,0.19411919,0.0023702132,0.00045314213],"about_ca_topic_score_codex":0.0003955541,"about_ca_topic_score_gemma":0.000009879883,"teacher_disagreement_score":0.8459662,"about_ca_system_score_codex":0.0008697737,"about_ca_system_score_gemma":0.00033061136,"threshold_uncertainty_score":0.9999207},"labels":[],"label_agreement":null},{"id":"W2328863850","doi":"10.3166/jesa.47.93-107","title":"Conception sûre de systèmes de contrôle-commande matériels à base de COTS","year":2013,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Programming language; Embedded system","score_opus":0.04128994444606702,"score_gpt":0.2910591953014581,"score_spread":0.24976925085539106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328863850","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.1906501,0.007851986,0.79071665,0.0033162588,0.0027019852,0.0007333663,0.000025490222,0.00047080644,0.00353334],"genre_scores_gemma":[0.4725912,0.0010343457,0.5182591,0.0010371016,0.001128711,0.00007724946,0.000003274926,0.00009709235,0.005771906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99022776,0.0046611615,0.0016431573,0.0006214391,0.00091465295,0.0019318459],"domain_scores_gemma":[0.99466014,0.00074027764,0.0014656232,0.0010158474,0.0009543009,0.0011637848],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.005327142,0.0006687615,0.0008722436,0.00038256112,0.0010484773,0.00302323,0.0018845411,0.00051145896,0.0010505746],"category_scores_gemma":[0.00201678,0.00067063334,0.00039906206,0.00080369075,0.00068260136,0.003924312,0.0003623862,0.0013022595,0.0012848016],"study_design_candidate":"design_other","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.000044946828,0.00039490362,0.013429913,0.0012696447,0.0003150652,0.00066693895,0.010337996,0.0029814246,0.012877209,0.11543606,0.033827674,0.8084182],"study_design_scores_gemma":[0.0010080218,0.00036089632,0.39876473,0.0018570176,0.00012939259,0.011693699,0.00043828198,0.544579,0.0019705712,0.035731383,0.0028470436,0.00061995164],"about_ca_topic_score_codex":0.00094789575,"about_ca_topic_score_gemma":0.000026538506,"teacher_disagreement_score":0.80779827,"about_ca_system_score_codex":0.0026617257,"about_ca_system_score_gemma":0.0013456916,"threshold_uncertainty_score":0.9998626},"labels":[],"label_agreement":null},{"id":"W2334804121","doi":"10.1016/j.jlamp.2016.02.005","title":"Logic programming approach to automata-based decision procedures","year":2016,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Formal Methods in Verification","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":"Datalog; Successor cardinal; Computer science; Logic programming; Horn clause; Automaton; Decision problem; Programming language; Inductive logic programming; Focus (optics); Theoretical computer science; Mathematics","score_opus":0.06277961365753304,"score_gpt":0.3824389205900534,"score_spread":0.31965930693252037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2334804121","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.011818811,0.0003595595,0.9860281,0.0008196427,0.0002887009,0.00043264832,2.4526378e-7,0.00008999057,0.00016231144],"genre_scores_gemma":[0.058693152,0.000025564235,0.9408035,0.0003099978,0.000089666515,0.00005316322,1.65181e-7,0.000011999783,0.000012782691],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965235,0.0008301851,0.0010633579,0.00050272956,0.00055689976,0.00052333815],"domain_scores_gemma":[0.9973257,0.0012286686,0.0005246761,0.00037758984,0.00021468093,0.00032867552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0084210625,0.00025327082,0.0005223605,0.00045826187,0.00011514613,0.000248533,0.0010650689,0.00017272845,0.000004720453],"category_scores_gemma":[0.005776113,0.00013706126,0.00014592668,0.0010117011,0.00013958625,0.000636303,0.00028893066,0.0003265143,0.0000029268804],"study_design_candidate":"design_other","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.00006477076,0.0002725716,0.00053961924,0.00005195438,0.000008969956,0.000018008992,0.00016720576,0.00003800623,0.0016950584,0.04910831,0.00001332546,0.9480222],"study_design_scores_gemma":[0.01100543,0.011061075,0.048127744,0.0044241613,0.00014796742,0.0033810528,0.0007378392,0.072152525,0.037253767,0.72089815,0.08743108,0.0033792192],"about_ca_topic_score_codex":0.0000014035952,"about_ca_topic_score_gemma":5.3529493e-7,"teacher_disagreement_score":0.94464296,"about_ca_system_score_codex":0.000088780514,"about_ca_system_score_gemma":0.00011644305,"threshold_uncertainty_score":0.6914964},"labels":[],"label_agreement":null},{"id":"W2335352604","doi":"10.3166/jesa.47.423-446","title":"Formal models for conformance test of programmable logic controllers","year":2013,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Programmable logic controller; Computer science; Conformance testing; Test (biology); Programming language; Operating system; Standardization","score_opus":0.05790080107376413,"score_gpt":0.2962219807418898,"score_spread":0.2383211796681257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2335352604","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.0069238623,0.0065426445,0.97483087,0.0010192432,0.0024707455,0.0020126312,0.00004021413,0.00018161915,0.005978154],"genre_scores_gemma":[0.19549908,0.00063565635,0.7973124,0.00021053839,0.00032493085,0.00017599961,0.00000333389,0.000054509408,0.005783595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953557,0.00039834308,0.0018695784,0.000390702,0.0007052461,0.001280433],"domain_scores_gemma":[0.99439543,0.0006278534,0.0019862321,0.00066772493,0.0019234291,0.00039930898],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0027364818,0.00045136208,0.0008381793,0.00029411336,0.0006070972,0.0011254912,0.001499485,0.00024479305,0.00012146767],"category_scores_gemma":[0.0010678951,0.00039736446,0.0004106614,0.00066651753,0.0005952823,0.0086133275,0.00025478902,0.00047804578,0.00016927764],"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.000034721164,0.00025068753,0.00017396455,0.0010652399,0.0001280788,0.00001091765,0.0012679573,0.011826,0.0007248212,0.2269768,0.0031164705,0.75442433],"study_design_scores_gemma":[0.00160516,0.0014384799,0.011266039,0.0007266546,0.00007438545,0.0011148434,0.00013736442,0.8902547,0.00085782923,0.08798404,0.0041564726,0.00038407353],"about_ca_topic_score_codex":0.00011058166,"about_ca_topic_score_gemma":0.000004475874,"teacher_disagreement_score":0.87842864,"about_ca_system_score_codex":0.00030899068,"about_ca_system_score_gemma":0.00046260154,"threshold_uncertainty_score":0.9999114},"labels":[],"label_agreement":null},{"id":"W2335568261","doi":"10.3724/sp.j.1001.2010.03711","title":"Syntax and Semantics of Timed Property Sequence Chart","year":2011,"lang":"en","type":"article","venue":"Journal of Software","topic":"Formal Methods in Verification","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":"Parkinson Canada","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Sequence (biology); Chart; Computer science; Property (philosophy); Programming language; Expressive power; Syntax; Specification pattern; Semantics (computer science); Automaton; Algorithm; Theoretical computer science; Natural language processing; Mathematics; Software; Statistics; Software development","score_opus":0.09417235706746867,"score_gpt":0.27839863327797154,"score_spread":0.18422627621050286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2335568261","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.090715356,0.00012786893,0.9084486,0.00011888266,0.00027541097,0.00007093593,0.0000012432043,0.000022425917,0.0002192862],"genre_scores_gemma":[0.231861,0.000043105236,0.7679709,0.000044180728,0.00001912203,5.007199e-7,4.6477876e-8,0.0000035466715,0.00005759799],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927574,0.000053853666,0.00029428877,0.0000802506,0.00020582454,0.00009005998],"domain_scores_gemma":[0.9991078,0.00003368349,0.0003825982,0.00020470329,0.00021019296,0.000061064704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057759974,0.000059780497,0.00014541317,0.000062779254,0.00002869237,0.0000152474395,0.0004235902,0.00003856494,0.000017499946],"category_scores_gemma":[0.0003271858,0.00003790772,0.000034795838,0.00013583171,0.0000687537,0.0005663841,0.0000982911,0.00011837977,0.0000053566882],"study_design_candidate":"design_other","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.00019089223,0.00049497565,0.07555417,0.000639485,0.00017994418,0.00022037493,0.019558266,0.000047904527,0.052562848,0.016660187,0.0030500598,0.8308409],"study_design_scores_gemma":[0.0021805728,0.0038596175,0.3578348,0.0017489411,0.00017711757,0.0056682187,0.00041601766,0.032521438,0.548207,0.03728592,0.008917504,0.0011828585],"about_ca_topic_score_codex":0.0000071172635,"about_ca_topic_score_gemma":2.955522e-7,"teacher_disagreement_score":0.82965803,"about_ca_system_score_codex":0.000018200008,"about_ca_system_score_gemma":0.00005315677,"threshold_uncertainty_score":0.1545832},"labels":[],"label_agreement":null},{"id":"W2336283925","doi":"10.1145/2815493.2815501","title":"Probabilistic bisimulation","year":2015,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bisimulation; Probabilistic logic; Mathematics; Computer science; Artificial intelligence; Discrete mathematics","score_opus":0.12191699494823618,"score_gpt":0.34182679035582164,"score_spread":0.21990979540758546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336283925","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.031681344,0.000056258465,0.95794344,0.0009965764,0.000870523,0.00024221736,4.9335983e-7,0.0002997945,0.007909335],"genre_scores_gemma":[0.33841303,0.0000016035691,0.6610193,0.0002966967,0.000078793666,0.000015501757,0.0000022389413,0.0000052476703,0.0001675506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999086,0.000115642375,0.00017822802,0.00024302764,0.00021902926,0.00015805165],"domain_scores_gemma":[0.9984841,0.00010631033,0.00007782626,0.0011175532,0.000114918344,0.00009930484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051205885,0.00007832982,0.000085370186,0.000058839014,0.000040282288,0.00007793074,0.0010094516,0.00005332959,0.000005025974],"category_scores_gemma":[0.0025721367,0.00007033693,0.000023899865,0.00034598194,0.000028460685,0.000570579,0.00026260197,0.00007135297,0.0002788366],"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.000020020456,0.00011196319,0.0044566966,0.000020959353,0.000010557449,0.0000068713975,0.0020966632,0.0075944937,0.00089708104,0.60199016,0.010571806,0.37222275],"study_design_scores_gemma":[0.000746932,0.00029591177,0.010743046,0.000014972188,0.0000095727155,0.000023575942,0.00006442981,0.49555042,0.0025315948,0.41423753,0.075369686,0.00041232575],"about_ca_topic_score_codex":0.000033947003,"about_ca_topic_score_gemma":0.000005866753,"teacher_disagreement_score":0.48795593,"about_ca_system_score_codex":0.0000695129,"about_ca_system_score_gemma":0.00007054663,"threshold_uncertainty_score":0.35839736},"labels":[],"label_agreement":null},{"id":"W2343090072","doi":"10.1007/s10489-016-0790-2","title":"Verifying concurrent probabilistic systems using probabilistic-epistemic logic specifications","year":2016,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic CTL; Probabilistic logic; Computer science; Model checking; Theoretical computer science; Binary decision diagram; Computation tree logic; Probabilistic argumentation; Probabilistic relevance model; Probabilistic analysis of algorithms; Artificial intelligence","score_opus":0.1870776865943099,"score_gpt":0.3303050581157015,"score_spread":0.1432273715213916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343090072","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.0021235568,0.00020812299,0.9912914,0.00017837592,0.0012593102,0.00106574,0.000007058393,0.0003438046,0.0035226361],"genre_scores_gemma":[0.77281994,0.000053546853,0.22662362,0.000037110236,0.000110102694,0.00024028835,0.0000019518977,0.000018861345,0.000094549534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973198,0.00015595657,0.0007585641,0.00084438716,0.00042419697,0.000497063],"domain_scores_gemma":[0.9975051,0.00040975795,0.00036501497,0.0013279968,0.00024123307,0.00015086704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00098751,0.00027701436,0.00028711357,0.0001342344,0.00023714543,0.00020270755,0.0016003746,0.00011887872,0.000027472506],"category_scores_gemma":[0.00044171792,0.00020545015,0.00006474979,0.0006546929,0.00031392233,0.00045131735,0.00027167145,0.00017511763,0.00045647583],"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.0000042078555,0.000053160253,0.000020771557,0.00007452665,0.000007709551,0.0000011820581,0.00019034189,0.0019391435,0.015296086,0.94012755,0.00003191128,0.042253412],"study_design_scores_gemma":[0.00038064833,0.00022674164,0.0004983953,0.00078231865,0.00006385978,0.00019627568,0.0004213564,0.6278679,0.059967365,0.29924297,0.008532388,0.0018198014],"about_ca_topic_score_codex":0.000016407277,"about_ca_topic_score_gemma":0.0000010903937,"teacher_disagreement_score":0.7706964,"about_ca_system_score_codex":0.00047137128,"about_ca_system_score_gemma":0.0001427008,"threshold_uncertainty_score":0.8378014},"labels":[],"label_agreement":null},{"id":"W2346166411","doi":"10.3850/9783981537079_0490","title":"MCXplore: An Automated Framework for Validating Memory Controller Designs","year":2016,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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 Waterloo","funders":"","keywords":"Computer science; Correctness; Dram; Construct (python library); Set (abstract data type); Test suite; Model checking; Regression testing; Dynamic random-access memory; Memory controller; Embedded system; Programming language; Test case; Operating system; Computer hardware; Software; Machine learning; Software development; Regression analysis; Semiconductor memory","score_opus":0.1203879029141282,"score_gpt":0.389645553215192,"score_spread":0.2692576503010638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346166411","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.003303371,0.000007665223,0.9931424,0.00048598653,0.00040498367,0.00037357214,0.0000019122256,0.001609627,0.0006704595],"genre_scores_gemma":[0.14749509,0.0000013382007,0.8517098,0.00039948718,0.00008082342,0.00010335416,6.3457924e-7,0.000011672141,0.00019782867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876595,0.0001736605,0.00025158084,0.00034215327,0.00017039337,0.00029629207],"domain_scores_gemma":[0.99839807,0.00067722343,0.00011678758,0.0005822249,0.00013217478,0.00009351383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012091324,0.00011239665,0.00014470692,0.00006294499,0.00013251066,0.00010975897,0.00074859854,0.00009999515,0.000032690932],"category_scores_gemma":[0.0009961248,0.00007102687,0.00005069506,0.00018918762,0.000035426772,0.0010403423,0.000073908115,0.00005131039,0.0000648787],"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.000017707342,0.000033709493,0.000034107416,0.000006716342,0.000012079872,3.9636964e-7,0.00034029686,0.0000307335,0.023563901,0.7979124,0.00053125236,0.17751667],"study_design_scores_gemma":[0.0008335958,0.00024242306,0.0005507806,0.0000442755,0.0000072993166,0.0000050393023,0.000057609337,0.73590994,0.13546294,0.12599514,0.0006194809,0.00027146505],"about_ca_topic_score_codex":0.0000032859398,"about_ca_topic_score_gemma":5.1308416e-7,"teacher_disagreement_score":0.7358792,"about_ca_system_score_codex":0.00004233506,"about_ca_system_score_gemma":0.000036540598,"threshold_uncertainty_score":0.28963917},"labels":[],"label_agreement":null},{"id":"W2346562987","doi":"10.3850/9783981537079_0465","title":"Root-Cause Analysis for Memory-Locked Errors","year":2016,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"","keywords":"Computer science; Debugging; Correctness; Root cause; Root cause analysis; Reduction (mathematics); Root (linguistics); Embedded system; Real-time computing; Parallel computing; Algorithm; Reliability engineering; Programming language","score_opus":0.05629952336888002,"score_gpt":0.32811582781092974,"score_spread":0.27181630444204974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346562987","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.0148470355,0.000007971522,0.9811007,0.001090196,0.00022634161,0.00015232463,0.0000016260134,0.00019310664,0.0023807255],"genre_scores_gemma":[0.27455002,0.0000015833275,0.7219262,0.00011002669,0.000025071271,0.000038623355,6.8263364e-7,0.0000043142704,0.0033434879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907964,0.00005813911,0.00019150216,0.00030867007,0.00015942137,0.00020261775],"domain_scores_gemma":[0.99882156,0.00015179896,0.00007764901,0.0007809923,0.000099803816,0.00006822222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005894121,0.00008325083,0.0001337801,0.00019271064,0.00006805084,0.000043674212,0.0007079255,0.000045622754,0.00006785525],"category_scores_gemma":[0.00022123274,0.000051000006,0.0001267217,0.00071308075,0.00003177311,0.0004916791,0.000093190756,0.00002277716,0.00008291041],"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.000024308883,0.00008188955,0.0060326266,0.000013323518,0.00054135855,0.0000016011951,0.00046477697,0.00016201186,0.009858454,0.64920706,0.002954367,0.33065823],"study_design_scores_gemma":[0.0017703029,0.00032550393,0.08084795,0.000019730793,0.00045229582,0.000007515005,0.00006316704,0.5692678,0.289745,0.029105654,0.02741915,0.0009759389],"about_ca_topic_score_codex":0.000011235644,"about_ca_topic_score_gemma":0.000026790765,"teacher_disagreement_score":0.6201014,"about_ca_system_score_codex":0.00004017884,"about_ca_system_score_gemma":0.000022606962,"threshold_uncertainty_score":0.20797199},"labels":[],"label_agreement":null},{"id":"W2359630901","doi":"10.1016/j.scico.2016.04.011","title":"A formal validation of the RBAC ANSI 2012 standard using B","year":2016,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Role-based access control; Software engineering; Operating system; Access control","score_opus":0.03379121972956286,"score_gpt":0.3088459989268042,"score_spread":0.27505477919724136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2359630901","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.24180344,0.000014996705,0.75718737,0.00010211121,0.0006185687,0.00018866645,9.274999e-7,0.00003402702,0.000049896567],"genre_scores_gemma":[0.46078885,7.3124545e-7,0.539169,0.000007495977,0.000024757364,0.000002286303,4.2875477e-8,0.0000024594717,0.0000043552354],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980901,0.00009184538,0.00037065468,0.00029272438,0.0007877161,0.00036695963],"domain_scores_gemma":[0.99835426,0.00005552143,0.00039286446,0.0007202029,0.0004174916,0.00005966357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00249858,0.00009833331,0.00014746404,0.00016024182,0.00022080992,0.00010316349,0.0017971371,0.000033740547,0.0000021998665],"category_scores_gemma":[0.000095426665,0.000056957902,0.00007178662,0.0013188113,0.0007183699,0.0033485875,0.00068073685,0.000056206223,0.0000012996156],"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.000006267485,0.000027353306,0.0012204004,0.000022847908,0.0000037906823,1.499073e-7,0.00058374414,0.00027638843,0.050245382,0.06164464,0.000006873269,0.8859622],"study_design_scores_gemma":[0.00038368502,0.00027242844,0.006113,0.0002638806,0.000008714252,0.000022417491,0.000025311218,0.116316795,0.8714992,0.0037229953,0.0011640326,0.00020755974],"about_ca_topic_score_codex":0.0000069581843,"about_ca_topic_score_gemma":4.1651555e-7,"teacher_disagreement_score":0.8857546,"about_ca_system_score_codex":0.000078980054,"about_ca_system_score_gemma":0.00027276628,"threshold_uncertainty_score":0.33395576},"labels":[],"label_agreement":null},{"id":"W2373763064","doi":"","title":"Mapping from Real-time Temporal Logic Language XYZ/RE to Timed Automata","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Automaton; Timed automaton; Temporal logic; Model checking; Process (computing); Real-time operating system; Programming language; Linear temporal logic; Theoretical computer science; Real-time computing; Embedded system","score_opus":0.028494717368649895,"score_gpt":0.28479051629669144,"score_spread":0.25629579892804155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2373763064","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.020243503,0.000040882936,0.9736705,0.0008862347,0.000043697768,0.0008811244,0.000031315612,0.0010114292,0.003191303],"genre_scores_gemma":[0.008064099,0.000016511833,0.98962533,0.00094233983,0.00023283092,0.00042250275,0.000112472495,0.00002276578,0.00056116853],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816215,0.00009986258,0.00041190867,0.00073601404,0.00023301184,0.00035705653],"domain_scores_gemma":[0.99812317,0.000099346944,0.00014820938,0.0013502559,0.00009276369,0.00018628173],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000237107,0.00022426687,0.00024399496,0.00021073635,0.00032860046,0.00012045861,0.0017939723,0.00010421833,0.000053452935],"category_scores_gemma":[0.0000034450368,0.00023327698,0.0000834602,0.0009202816,0.000059122867,0.0003537247,0.0005941204,0.00015102851,0.0028607443],"study_design_candidate":"not_applicable","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.000012282103,0.0005667496,0.000726817,0.000040930245,0.00009206438,0.000044080272,0.020025684,0.0003833201,0.31344935,0.016489824,0.04385164,0.60431725],"study_design_scores_gemma":[0.0012374334,0.00014334421,0.04494879,0.00008290732,0.000020707044,0.00019209112,0.00019768218,0.2005615,0.042571615,0.0057837223,0.70251435,0.0017458332],"about_ca_topic_score_codex":0.00019436759,"about_ca_topic_score_gemma":0.000003772978,"teacher_disagreement_score":0.65866274,"about_ca_system_score_codex":0.000103734405,"about_ca_system_score_gemma":0.0000692627,"threshold_uncertainty_score":0.9979156},"labels":[],"label_agreement":null},{"id":"W2395626435","doi":"10.2168/lmcs-11(3:11)2015","title":"Abstract Model Repair","year":2015,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"European Social Fund; Natural Sciences and Engineering Research Council of Canada; European Commission; Athens University of Economics and Business","keywords":"Kripke structure; Model checking; Soundness; Computer science; Abstraction; Theoretical computer science; Semantics (computer science); Kripke semantics; State (computer science); Abstraction model checking; Modal logic; Algorithm; Discrete mathematics; Programming language; Modal; Mathematics; Intermediate logic; Description logic","score_opus":0.22226986399824017,"score_gpt":0.4436221654901364,"score_spread":0.22135230149189622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395626435","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.0037913704,0.00005899824,0.98888206,0.000240451,0.0013938701,0.00019231297,3.4581848e-7,0.000532905,0.0049077063],"genre_scores_gemma":[0.0397356,0.0000040450686,0.9593649,0.00076619466,0.000083485276,0.00002177561,1.7740702e-7,0.0000065715135,0.000017239323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636084,0.0004572345,0.00055558205,0.0011162896,0.0008427352,0.0006673476],"domain_scores_gemma":[0.9973966,0.00035113076,0.00015177362,0.0014148016,0.00026483962,0.00042085882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014519916,0.00021401596,0.0002957256,0.00035916307,0.00014096977,0.00029281265,0.0035521926,0.00012025633,0.0000037396055],"category_scores_gemma":[0.0014280716,0.00017587961,0.00009148429,0.0024674654,0.00057406735,0.0018335282,0.0014537649,0.00039711478,0.00004398807],"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.0000083318655,0.00014674597,0.0003118053,0.000009099659,0.000001993228,0.00002360254,0.0007366003,0.0691528,0.0018696226,0.35731822,0.00013510996,0.5702861],"study_design_scores_gemma":[0.00016874401,0.00009013025,0.0055707237,0.000013109852,8.0716364e-7,0.00002164219,0.000004555681,0.86194766,0.0024071105,0.12932271,0.00023884636,0.000213956],"about_ca_topic_score_codex":0.00001168501,"about_ca_topic_score_gemma":7.4768303e-7,"teacher_disagreement_score":0.7927949,"about_ca_system_score_codex":0.00024325415,"about_ca_system_score_gemma":0.00036837623,"threshold_uncertainty_score":0.71721625},"labels":[],"label_agreement":null},{"id":"W2396737989","doi":"10.1007/978-3-319-30303-1_22","title":"Security Enforcement by Rewriting: An Algebraic Approach","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Rewriting; Computer science; Process calculus; Security policy; Enforcement; Path (computing); Algebraic number; Polynomial; Theoretical computer science; Programming language; Algebra over a field; Computer security; Mathematics; Law","score_opus":0.023085630879702494,"score_gpt":0.2730735932959605,"score_spread":0.24998796241625798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396737989","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.00003519788,0.00025448314,0.96404344,0.00021524678,0.0011760229,0.00051133084,0.000011176931,0.0002790068,0.03347409],"genre_scores_gemma":[0.04862629,0.00004103043,0.9491776,0.0011699334,0.00048310807,0.000027812874,0.000015021807,0.000044088523,0.00041511815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994831,0.00009614828,0.0007009992,0.002134556,0.001377255,0.0008599875],"domain_scores_gemma":[0.99626935,0.00023655892,0.0004496152,0.0024891933,0.00025764215,0.00029762049],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024301896,0.00061245513,0.0005197456,0.00059795426,0.0003262656,0.0006129572,0.0054229805,0.00043095992,0.000035872476],"category_scores_gemma":[0.00013958223,0.00051432935,0.000119742705,0.00050793606,0.0008378833,0.0016090979,0.0014214185,0.00079149206,0.000049708764],"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.0000044499648,0.000045258395,0.0000073749234,0.00003873568,0.000006757847,0.0000073152078,0.0007024356,0.00073742704,0.00028226283,0.4837164,0.00005077283,0.51440084],"study_design_scores_gemma":[0.00032716966,0.00032520763,0.000013969297,0.0002477223,0.000007087339,0.00007360791,4.0564012e-7,0.58919257,0.0056999824,0.39563522,0.0074252933,0.0010517352],"about_ca_topic_score_codex":0.000014039522,"about_ca_topic_score_gemma":0.000004898237,"teacher_disagreement_score":0.58845514,"about_ca_system_score_codex":0.0004906609,"about_ca_system_score_gemma":0.00037568877,"threshold_uncertainty_score":0.99995816},"labels":[],"label_agreement":null},{"id":"W2397288865","doi":"10.29007/28ww","title":"Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Deutsche Forschungsgemeinschaft","keywords":"Preprocessor; Solver; Computer science; Boosting (machine learning); Data pre-processing; Algorithm; Artificial intelligence; Programming language","score_opus":0.0180842090583107,"score_gpt":0.27646896351676065,"score_spread":0.25838475445844994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397288865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79997516,0.00013208807,0.1978222,0.00013806338,0.00029870967,0.00009361086,2.436429e-7,0.0000553141,0.0014846048],"genre_scores_gemma":[0.74822944,0.000009339074,0.251598,0.000074302836,0.000053494885,0.0000019661838,2.4474159e-7,0.000004459071,0.000028778866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989859,0.00009254442,0.0002943292,0.00025597244,0.00015318424,0.00021807208],"domain_scores_gemma":[0.9991118,0.0002295398,0.0002004623,0.00036231818,0.00007329218,0.00002263668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014033265,0.0000909939,0.00012483548,0.00004741632,0.000253915,0.000062998355,0.0005978823,0.000036563833,0.0000028218044],"category_scores_gemma":[0.00035772286,0.000075300486,0.00001361015,0.00037381775,0.00026452533,0.00054448633,0.00042122346,0.00013604488,0.0000018536349],"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.000067909925,0.00006110483,0.12830915,0.00046183998,0.00003542161,0.000002719092,0.060525842,0.0019224943,0.022260888,0.03984707,0.00040985807,0.7460957],"study_design_scores_gemma":[0.00016926808,0.00017223675,0.015122205,0.00017675241,0.0000024796452,0.000026704673,0.0005180171,0.9229252,0.059412517,0.00045818972,0.00086603954,0.00015039554],"about_ca_topic_score_codex":0.000019275116,"about_ca_topic_score_gemma":0.0000019837132,"teacher_disagreement_score":0.9210027,"about_ca_system_score_codex":0.000022859394,"about_ca_system_score_gemma":0.000027215132,"threshold_uncertainty_score":0.30706647},"labels":[],"label_agreement":null},{"id":"W2397773411","doi":"10.3233/978-1-61499-419-0-369","title":"LTL Verification of Online Executions with Sensing in Bounded Situation Calculus","year":2014,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Bounded function; Calculus (dental); Computer science; Situation calculus; Theoretical computer science; Mathematics; Programming language; Mathematical analysis; Medicine","score_opus":0.04222530158833162,"score_gpt":0.2890240130402732,"score_spread":0.24679871145194157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397773411","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.00018509096,0.00022536748,0.99166054,0.00022589092,0.00015633237,0.00076943304,0.000018256223,0.000048482292,0.006710608],"genre_scores_gemma":[0.06281958,0.0005470544,0.93408954,0.000074536736,0.00013281668,0.000107978376,0.00015541728,0.00003709535,0.0020359713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981166,0.000055186225,0.00078393565,0.00057975715,0.00025740115,0.00020708649],"domain_scores_gemma":[0.9985207,0.00007137563,0.00043428043,0.00072987593,0.0001813805,0.000062388164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047909142,0.00023300412,0.00036298635,0.0005631183,0.000111920766,0.00006647585,0.00043139164,0.0002444888,0.0000038738754],"category_scores_gemma":[0.000044495617,0.00024711745,0.000046498968,0.0004076547,0.00032084447,0.00021254602,0.000070839465,0.00033902808,0.000010376912],"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.000011267329,0.000038407165,0.000017862407,0.000025495036,0.000006802716,5.360059e-7,0.00032804464,0.00055216503,0.00010903456,0.66342634,0.000022486653,0.33546156],"study_design_scores_gemma":[0.00007939127,0.00012226148,0.00032348622,0.00033790333,0.00004002198,0.000009611564,0.00043090677,0.41410753,0.003919654,0.5678056,0.01225655,0.0005670972],"about_ca_topic_score_codex":0.000058668997,"about_ca_topic_score_gemma":0.00026657313,"teacher_disagreement_score":0.41355535,"about_ca_system_score_codex":0.00015577627,"about_ca_system_score_gemma":0.00013109736,"threshold_uncertainty_score":0.9999981},"labels":[],"label_agreement":null},{"id":"W2398327122","doi":"10.1109/fmcad.2015.7542253","title":"Compositional recurrence analysis","year":2015,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":59,"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":"","keywords":"Abstraction; Computer science; Transition (genetics); Transition system; Program analysis; Recurrence relation; Theoretical computer science; Loop (graph theory); Algorithm; Algebra over a field; Programming language; Mathematics; Pure mathematics; Combinatorics","score_opus":0.08949856153707213,"score_gpt":0.3436620251147191,"score_spread":0.25416346357764696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398327122","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.0024995175,0.000017092976,0.9675326,0.00027859153,0.00016907013,0.00002521755,5.595037e-7,0.000095105264,0.02938225],"genre_scores_gemma":[0.21533531,6.211054e-7,0.7843438,0.00014591092,0.000013894701,0.0000033886638,0.0000030705523,7.155576e-7,0.0001533047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941224,0.000061821534,0.0000948915,0.00014618241,0.0002056491,0.000079234575],"domain_scores_gemma":[0.99944466,0.000022629985,0.000031882162,0.00031402966,0.000110056055,0.00007671513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043531923,0.00003760261,0.000060456412,0.00010518138,0.000027492055,0.00005594148,0.0004451337,0.000016991946,0.000020400703],"category_scores_gemma":[0.00004633013,0.000032899683,0.000034226214,0.00093024643,0.000019478435,0.00037837727,0.000079808065,0.000036898215,0.00013998576],"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.0000016319635,0.000024209165,0.001617701,6.6927555e-7,0.000028971852,7.535617e-7,0.00015821817,0.00045367292,0.000085811764,0.98385537,0.001497317,0.012275648],"study_design_scores_gemma":[0.00014179623,0.000056832574,0.023679523,0.0000018881411,0.00002991588,0.00000878206,0.000020918707,0.9417703,0.005070178,0.022505106,0.0065524555,0.00016227303],"about_ca_topic_score_codex":0.000011599361,"about_ca_topic_score_gemma":0.0000016123759,"teacher_disagreement_score":0.96135026,"about_ca_system_score_codex":0.000027699441,"about_ca_system_score_gemma":0.00003296261,"threshold_uncertainty_score":0.17992803},"labels":[],"label_agreement":null},{"id":"W2398591195","doi":"","title":"Contract-Based Specification and Analysis of AADL Models.","year":2014,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Liveness; Computer science; Specification language; Reuse; Programming language; Model checking; Software engineering; Formal specification; Process (computing); Interface (matter); Property (philosophy); Engineering; Operating system","score_opus":0.038283261749284425,"score_gpt":0.2792352512380817,"score_spread":0.24095198948879726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398591195","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.018175816,0.000014427188,0.97364086,0.0001238676,0.000035714467,0.000047999947,7.434507e-7,0.00004456317,0.007915982],"genre_scores_gemma":[0.54384834,0.0000023672524,0.45606157,0.00006381822,0.0000035107378,0.000002048129,0.0000017658822,0.0000010530723,0.000015499478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993754,0.00007682353,0.00017468275,0.00017220317,0.0001312068,0.00006965581],"domain_scores_gemma":[0.9992221,0.00010404088,0.00010164969,0.00045624046,0.00008290456,0.00003305328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059715833,0.000047007517,0.00012581804,0.00018927477,0.00002367929,0.00003111361,0.00024474823,0.000029829314,0.000011829773],"category_scores_gemma":[0.000054921285,0.00004093465,0.000036397352,0.00057214353,0.000033357046,0.0002973465,0.000023797305,0.000029268776,0.0000026742323],"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.0000027050135,0.00002194546,0.0007429724,0.0000040803066,0.00002696837,2.5835584e-8,0.00008921695,0.0055311588,0.0017136616,0.93245846,0.000013655912,0.059395146],"study_design_scores_gemma":[0.000081632155,0.000019398438,0.042560212,0.0000012299495,0.00003535082,1.2157803e-7,0.0000025818138,0.94497585,0.008950657,0.003133127,0.00019353721,0.00004630833],"about_ca_topic_score_codex":0.00002874134,"about_ca_topic_score_gemma":0.0000046495256,"teacher_disagreement_score":0.93944466,"about_ca_system_score_codex":0.000009551661,"about_ca_system_score_gemma":0.000009623515,"threshold_uncertainty_score":0.16692665},"labels":[],"label_agreement":null},{"id":"W2399372291","doi":"","title":"Path Decompositions Which Contain No Proper Subsystems.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Computer science; Computer network","score_opus":0.01984630761633057,"score_gpt":0.2750636740636844,"score_spread":0.2552173664473539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399372291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67119,0.0008705222,0.22764657,0.00078096264,0.029344123,0.0015899406,0.00000924807,0.0012285892,0.06734002],"genre_scores_gemma":[0.88045,0.000005298478,0.11910643,0.00011381944,0.000033295473,0.00007963607,0.0000047982358,0.000013354266,0.00019336544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984457,0.00030198166,0.00028171434,0.00025393258,0.0002925925,0.00042411083],"domain_scores_gemma":[0.998521,0.00007936731,0.000118852666,0.00079149456,0.00031158523,0.00017774448],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010833422,0.00014698997,0.00017085577,0.00007272522,0.00020044719,0.00012103607,0.0007548409,0.000090396345,0.00002008134],"category_scores_gemma":[0.00017272934,0.0001345212,0.00004629748,0.0004980365,0.000029893929,0.0012256199,0.00017716135,0.00017373348,0.00094452966],"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.0000036260901,0.0001456672,0.0044596777,0.000020394566,0.000010511971,9.128528e-7,0.0004477192,0.0000013578864,0.0014479579,0.9913155,0.0015103605,0.0006363371],"study_design_scores_gemma":[0.006779826,0.0017951796,0.23423895,0.0006225594,0.00013544604,0.00046181877,0.0004301812,0.117740154,0.080364354,0.39149165,0.16163476,0.004305113],"about_ca_topic_score_codex":0.000028070452,"about_ca_topic_score_gemma":0.0000012153197,"teacher_disagreement_score":0.59982383,"about_ca_system_score_codex":0.000118905235,"about_ca_system_score_gemma":0.000062242434,"threshold_uncertainty_score":0.99983335},"labels":[],"label_agreement":null},{"id":"W2400151297","doi":"10.3233/978-1-61499-434-3-132","title":"A Probabilistic Logic to Reason about the Interaction between Knowledge and Social Commitments in MASs","year":2014,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Probabilistic logic; Epistemology; Computer science; Cognitive science; Psychology; Artificial intelligence; Philosophy","score_opus":0.09562412796514055,"score_gpt":0.3476769094125505,"score_spread":0.25205278144740995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400151297","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.00009482209,0.00032254128,0.9838089,0.00082118163,0.00026607414,0.001280305,0.000012173055,0.00003848623,0.0133555215],"genre_scores_gemma":[0.30639434,0.001365764,0.6676884,0.0009778785,0.001893058,0.0044079847,0.00015831264,0.00014574177,0.016968518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844563,0.00009754629,0.0005435998,0.0005520203,0.00014331135,0.00021790624],"domain_scores_gemma":[0.99908507,0.00015830627,0.0001959851,0.00042793082,0.00007152771,0.00006117728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007307976,0.00022179524,0.00030750307,0.0002805029,0.00022481638,0.00015240425,0.0006172153,0.00020963483,0.0000037531202],"category_scores_gemma":[0.000049540286,0.00019910559,0.000040093986,0.00021173999,0.00022499425,0.00013143133,0.00018843576,0.00042522338,0.000046741916],"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.000004929822,0.000013851284,0.00008967119,0.000024183119,0.000005428357,1.7189878e-7,0.00073215424,0.00003071916,0.000003312091,0.5608142,0.00016932625,0.43811205],"study_design_scores_gemma":[0.000029964882,0.000067617206,0.00058948976,0.00014064444,0.000024084413,0.0000017554605,0.00026717575,0.025337672,0.00011659048,0.8589549,0.11412872,0.00034140862],"about_ca_topic_score_codex":0.000020831672,"about_ca_topic_score_gemma":0.00007073379,"teacher_disagreement_score":0.43777063,"about_ca_system_score_codex":0.00017218072,"about_ca_system_score_gemma":0.00003765298,"threshold_uncertainty_score":0.81192905},"labels":[],"label_agreement":null},{"id":"W2401576199","doi":"10.1145/2896982.2896990","title":"Representing hierarchical state machine models in SMT-LIB","year":2016,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Waterloo","funders":"","keywords":"Computer science; Semantics (computer science); Syntax; Hierarchy; Programming language; Finite-state machine; Representation (politics); State (computer science); Exploit; Variety (cybernetics); Abstract syntax; Theoretical computer science; Artificial intelligence","score_opus":0.04290827532304629,"score_gpt":0.3017696438197035,"score_spread":0.2588613684966572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401576199","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.02740213,0.000016639427,0.95705426,0.0012114109,0.00012875085,0.000086888016,7.670876e-7,0.00014912795,0.013950028],"genre_scores_gemma":[0.38628623,0.00001161775,0.6121963,0.00010011507,0.000012223944,0.0000084042,1.8824039e-7,0.0000045013726,0.0013804322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988392,0.00015236958,0.00024408071,0.0003247106,0.00019548953,0.00024413657],"domain_scores_gemma":[0.9991266,0.00013380515,0.000049098562,0.0006042224,0.000027590486,0.000058691407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087296625,0.00007358131,0.00009198342,0.000109594825,0.000032696127,0.000049168695,0.00064155075,0.000030331723,0.000020290017],"category_scores_gemma":[0.00015561635,0.000046830162,0.000026355532,0.00026601186,0.000037145834,0.000978762,0.0003265504,0.0000943165,0.000048154714],"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.0000078847415,0.000032096388,0.0014928617,0.0000041987582,0.0000024649255,0.0000065809777,0.00029763638,0.00039690136,0.0035664332,0.5833391,0.000074229,0.41077963],"study_design_scores_gemma":[0.00024851045,0.000017599388,0.0040797014,0.00001631151,3.572468e-7,0.000006108656,0.0000019938714,0.79527855,0.00817688,0.19160105,0.00046779474,0.00010515762],"about_ca_topic_score_codex":0.00006657154,"about_ca_topic_score_gemma":0.000013731628,"teacher_disagreement_score":0.79488164,"about_ca_system_score_codex":0.00003485285,"about_ca_system_score_gemma":0.000022969218,"threshold_uncertainty_score":0.19096786},"labels":[],"label_agreement":null},{"id":"W2403478642","doi":"","title":"Single-Solver Algorithms for 2QBF (Poster Presentation)","year":2012,"lang":"en","type":"article","venue":"Theory and Applications of Satisfiability Testing","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"Solver; Computer science; Boolean satisfiability problem; DPLL algorithm; Algorithm; Heuristic; Set (abstract data type); Satisfiability; Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.07232481774454069,"score_gpt":0.3347471103248786,"score_spread":0.2624222925803379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403478642","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.031294398,0.00012318016,0.96621805,0.000062857274,0.000051220617,0.00072406576,0.0000121767425,0.000093807925,0.001420217],"genre_scores_gemma":[0.41558835,6.5757854e-7,0.58405155,0.00003515738,0.000058861744,0.00024313922,0.000002601813,0.0000045180723,0.000015173505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899566,0.00017035729,0.0003069691,0.00022825677,0.000107536594,0.00019123922],"domain_scores_gemma":[0.9964233,0.002622175,0.00017871814,0.0005284967,0.00017788682,0.000069413356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026458413,0.00009112584,0.00012082229,0.00005093918,0.00017141843,0.000035405636,0.00025084475,0.000044520213,0.000007674213],"category_scores_gemma":[0.001253021,0.000088530986,0.00003009638,0.00026424156,0.00016625671,0.00069684937,0.00011911045,0.000059039845,0.0000034624984],"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.0000045709508,0.00008322503,0.0038291155,0.000060547816,0.0000044922263,5.790359e-9,0.00043250388,0.00000798896,0.0037348468,0.6203495,0.000004608587,0.37148857],"study_design_scores_gemma":[0.00035706395,0.00013123886,0.051170763,0.00003012312,0.00003534873,0.000016844679,0.00021674659,0.0069157244,0.044622127,0.8937448,0.002463171,0.0002960217],"about_ca_topic_score_codex":0.0000057928523,"about_ca_topic_score_gemma":2.0175568e-7,"teacher_disagreement_score":0.38429394,"about_ca_system_score_codex":0.00002022204,"about_ca_system_score_gemma":0.000016817474,"threshold_uncertainty_score":0.36101887},"labels":[],"label_agreement":null},{"id":"W2403555318","doi":"10.3233/978-1-61499-125-0-91","title":"Quantitative Model Checking of Knowledge","year":2012,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science","score_opus":0.13112756143281407,"score_gpt":0.34966312590459464,"score_spread":0.21853556447178057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403555318","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.0000066244925,0.003665369,0.92113787,0.00003918291,0.00021011315,0.00043611313,0.000013863598,0.00003787598,0.074452974],"genre_scores_gemma":[0.0075437087,0.0014233189,0.9849734,0.000018250295,0.00008724577,0.0001557863,0.000011285487,0.00002470845,0.005762352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986131,0.000024169643,0.0006012172,0.0004043649,0.00014962423,0.00020751334],"domain_scores_gemma":[0.99884975,0.0000684398,0.00031482652,0.0005567882,0.00013766575,0.00007255532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004907566,0.00020357742,0.00032641614,0.00033751893,0.00009238145,0.000034828343,0.00064950273,0.00021757184,0.0000072525477],"category_scores_gemma":[0.000029605115,0.00022302513,0.000069575755,0.0001859879,0.00028786852,0.00029779086,0.00017154125,0.0002860058,0.000039134164],"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.000003498648,0.000029064366,0.000005325205,0.000027442798,0.000007831539,6.9538544e-8,0.0006254432,0.00030806454,0.00006680741,0.6823853,0.00006427924,0.31647685],"study_design_scores_gemma":[0.000007715455,0.000022087499,0.000004017629,0.00006426551,0.000014113639,7.940494e-7,0.000090429574,0.34451216,0.0029928093,0.64441144,0.0076837246,0.00019642034],"about_ca_topic_score_codex":0.000004768007,"about_ca_topic_score_gemma":0.0000069915473,"teacher_disagreement_score":0.34420413,"about_ca_system_score_codex":0.00006750859,"about_ca_system_score_gemma":0.000083736246,"threshold_uncertainty_score":0.9094701},"labels":[],"label_agreement":null},{"id":"W2405468764","doi":"","title":"Bisimulation Metrics are Optimal Value Functions","year":2014,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bisimulation; Markov decision process; Equivalence (formal languages); Metric (unit); Markov process; Bellman equation; Metric space; State space; Mathematics; Function (biology); Computer science; Theoretical computer science; Discrete mathematics; Mathematical optimization","score_opus":0.028703943109004842,"score_gpt":0.267680366191953,"score_spread":0.23897642308294817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405468764","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.013308669,0.0004147166,0.9621352,0.0043412377,0.0011027388,0.00050844933,0.000030728508,0.00073205924,0.01742623],"genre_scores_gemma":[0.3228987,0.00011032217,0.6736421,0.000117655676,0.0000527733,0.00008465347,0.0001929945,0.00004128311,0.0028595177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9886658,0.007893139,0.0008173647,0.001297325,0.0008518267,0.0004745165],"domain_scores_gemma":[0.9887022,0.0019307242,0.0012149768,0.0047245803,0.003173327,0.00025424265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.010771322,0.0004532341,0.00048547186,0.00066858105,0.0005765694,0.0010235276,0.0033042715,0.0005146294,0.000042315376],"category_scores_gemma":[0.0053035687,0.0005062005,0.00030282504,0.0013900504,0.00019045758,0.0005475163,0.0027887397,0.0009987069,0.00016526057],"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.0000111912605,0.00065222144,0.001927957,0.00027009824,0.0001223013,0.0000038080086,0.0045021055,0.03523602,0.0005638262,0.8146894,0.0022486232,0.13977244],"study_design_scores_gemma":[0.00032529834,6.813354e-7,0.0058654784,0.00060913496,0.000045353347,0.000009384578,0.000038178,0.95615613,0.009867799,0.0069731916,0.019539393,0.0005699461],"about_ca_topic_score_codex":0.00031409322,"about_ca_topic_score_gemma":0.00007131516,"teacher_disagreement_score":0.92092013,"about_ca_system_score_codex":0.00028045906,"about_ca_system_score_gemma":0.00029257374,"threshold_uncertainty_score":0.99973893},"labels":[],"label_agreement":null},{"id":"W2408618519","doi":"","title":"The Mean Integrity of Paths and Cycles.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Statistics","score_opus":0.01737940416127694,"score_gpt":0.2801621557768803,"score_spread":0.2627827516156034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408618519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.988171,0.000062486586,0.0060487054,0.00036985643,0.0032501314,0.000101786216,5.6338877e-7,0.000054858105,0.001940619],"genre_scores_gemma":[0.9286136,0.000017852582,0.071314685,0.000022339254,0.0000038824446,0.000005196955,1.6168921e-7,0.000003238759,0.000019037367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993642,0.0000782877,0.00014870384,0.00014267175,0.00015096705,0.0001151487],"domain_scores_gemma":[0.99901354,0.00017948155,0.00008828116,0.0005889024,0.00008675682,0.00004304088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010122797,0.000059578702,0.00007661562,0.000022446136,0.00012091584,0.000059656035,0.0006597112,0.000054245837,0.0000013126312],"category_scores_gemma":[0.00029093339,0.00004205923,0.00002145099,0.00015128538,0.00014825758,0.00021406474,0.00018922683,0.00028017745,0.0000050495505],"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.0000014710113,0.000015822727,0.0012400773,0.0000030726976,0.0000025822953,2.484342e-7,0.0003089328,5.5958953e-8,0.00254833,0.95984656,0.000071161034,0.035961706],"study_design_scores_gemma":[0.0001811593,0.000050138915,0.036246426,0.000005416611,0.0000025060392,0.000006256115,0.00003521466,0.005871065,0.025578376,0.92974347,0.0022000612,0.00007991951],"about_ca_topic_score_codex":0.00002592866,"about_ca_topic_score_gemma":0.000010866824,"teacher_disagreement_score":0.065265976,"about_ca_system_score_codex":0.0000072858907,"about_ca_system_score_gemma":0.00002786599,"threshold_uncertainty_score":0.17151256},"labels":[],"label_agreement":null},{"id":"W2411345296","doi":"10.1016/j.crma.2016.04.009","title":"La logique des parties fractionnaires de nombres réels","year":2016,"lang":"fr","type":"article","venue":"Comptes Rendus Mathématique","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Decidability; Modulo; Natural number; Order (exchange); Arithmetic; Mathematics; Quantifier (linguistics); Humanities; Discrete mathematics; Combinatorics; Computer science; Philosophy; Artificial intelligence","score_opus":0.06246491907906349,"score_gpt":0.3193250077799947,"score_spread":0.2568600887009312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411345296","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.07105119,0.007620426,0.90720683,0.004660827,0.0014606508,0.00025351302,0.000021511994,0.00041960942,0.007305458],"genre_scores_gemma":[0.44919854,0.0034858203,0.54203725,0.00029707066,0.00029996134,0.00012873238,0.0000016970063,0.000042978798,0.0045079496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956422,0.0020805055,0.0006401069,0.0005659672,0.00030878186,0.00076246436],"domain_scores_gemma":[0.9965512,0.001525345,0.00039538412,0.0010089627,0.00026132909,0.00025775318],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021736503,0.00038778278,0.00039347567,0.00016971992,0.00031844122,0.0004243778,0.0011224777,0.00050692895,0.00059280865],"category_scores_gemma":[0.0015221271,0.00031221396,0.00015910543,0.00036983553,0.0010929013,0.0019524639,0.0003796439,0.0004686821,0.0010345348],"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.000019678686,0.00020278376,0.0029797533,0.00031693035,0.00005578569,0.00004370594,0.004359797,0.00011211391,0.0055033253,0.60588557,0.012352815,0.36816776],"study_design_scores_gemma":[0.00081328244,0.0004610234,0.1135097,0.0035900327,0.00006787649,0.0012667347,0.00041116338,0.038620744,0.13413307,0.45776224,0.24802724,0.0013368962],"about_ca_topic_score_codex":0.00022219622,"about_ca_topic_score_gemma":0.0000453738,"teacher_disagreement_score":0.37814736,"about_ca_system_score_codex":0.00045910425,"about_ca_system_score_gemma":0.00038308068,"threshold_uncertainty_score":0.999933},"labels":[],"label_agreement":null},{"id":"W2411596298","doi":"10.4204/eptcs.209.1","title":"Formal refinement of extended state machines","year":2016,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Formal specification; B-Method; Formal methods; Programming language; Event (particle physics); Consistency (knowledge bases); Construct (python library); Process (computing); Language Of Temporal Ordering Specification; Process calculus; Theoretical computer science; Artificial intelligence","score_opus":0.006850093954983825,"score_gpt":0.2623549203145504,"score_spread":0.25550482635956656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411596298","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.12865286,0.000035621317,0.86809397,0.00061430555,0.00020512709,0.00018998107,6.027657e-7,0.00010479874,0.0021027566],"genre_scores_gemma":[0.7214779,0.000020812802,0.27836227,0.00007945729,0.000026344811,0.000016501524,6.040848e-8,0.0000057914303,0.000010805459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996914,0.000034306937,0.00050751545,0.00069271727,0.00075680565,0.0010946055],"domain_scores_gemma":[0.9988841,0.00010113522,0.00019020837,0.0004123754,0.00028504926,0.0001271275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004076067,0.00018813483,0.00023148277,0.00037156913,0.00013618154,0.000113385446,0.002758599,0.00004524756,0.000016632806],"category_scores_gemma":[0.00029785352,0.00012365705,0.000050987896,0.0015699972,0.0014892101,0.001948267,0.0009584565,0.0002006157,0.000010842418],"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.000018757739,0.00004804557,0.00015026837,0.0000101988035,0.0000019837717,5.4188524e-7,0.00021780934,0.0000034107259,0.010503272,0.7887575,0.0000056374515,0.20028257],"study_design_scores_gemma":[0.00053051463,0.00072186824,0.0044301813,0.000089755595,0.0000021509225,0.000035018067,0.0000036173337,0.22556654,0.13894491,0.62928474,0.00013397446,0.00025674695],"about_ca_topic_score_codex":0.000002147752,"about_ca_topic_score_gemma":7.0571616e-7,"teacher_disagreement_score":0.59282506,"about_ca_system_score_codex":0.00029077657,"about_ca_system_score_gemma":0.00023595394,"threshold_uncertainty_score":0.54870564},"labels":[],"label_agreement":null},{"id":"W2432950841","doi":"10.1016/j.jal.2016.05.007","title":"Formalization of Reliability Block Diagrams in Higher-order Logic","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"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":"Qatar National Research Fund","keywords":"Computer science; HOL; Reliability block diagram; Correctness; Automated theorem proving; Theoretical computer science; Reliability (semiconductor); Mathematical proof; Maintainability; Block (permutation group theory); Formal verification; Programming language; Algorithm; Reliability engineering; Fault tree analysis; Mathematics","score_opus":0.04105063957027853,"score_gpt":0.2843084071889894,"score_spread":0.24325776761871087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2432950841","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.09936161,0.00005424869,0.8938946,0.001022314,0.0004943551,0.0001882663,7.889805e-7,0.000022107379,0.004961721],"genre_scores_gemma":[0.6894662,0.00004420847,0.31031087,0.00010698645,0.000044668363,0.0000039415454,1.6508443e-7,0.000003552157,0.000019440025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984985,0.00008819788,0.0007327549,0.00016496939,0.0003316688,0.00018392998],"domain_scores_gemma":[0.9984389,0.00015280992,0.00072895584,0.00037656946,0.00024763943,0.00005510158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017054094,0.00010364845,0.00025414326,0.00016150474,0.000027161175,0.00001905318,0.00066625036,0.00010201302,0.000026152777],"category_scores_gemma":[0.0002081895,0.00006191879,0.000062011044,0.00055338803,0.00007906996,0.00044128575,0.00009880024,0.00013375256,0.000009226383],"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.00015229463,0.00035008218,0.0030699437,0.00005736661,0.000013931241,0.0000068514896,0.00040416067,0.0029823065,0.02255018,0.9009915,0.0001661939,0.06925519],"study_design_scores_gemma":[0.0029285958,0.0010191273,0.10776941,0.00015654521,0.00002542743,0.000064512256,0.00007194984,0.0061357147,0.057364203,0.81943506,0.004559444,0.00047000693],"about_ca_topic_score_codex":0.0000017850265,"about_ca_topic_score_gemma":9.732906e-7,"teacher_disagreement_score":0.5901046,"about_ca_system_score_codex":0.00010595606,"about_ca_system_score_gemma":0.00005895118,"threshold_uncertainty_score":0.2524975},"labels":[],"label_agreement":null},{"id":"W2481123737","doi":"10.1007/978-1-4899-7276-7_13","title":"Motion planning for underactuated systems","year":2005,"lang":"en","type":"book-chapter","venue":"Texts in applied mathematics","topic":"Formal Methods in Verification","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":"Queen's University","funders":"","keywords":"Controllability; Kinematics; Reduction (mathematics); Motion (physics); Affine transformation; Mathematics; Computer science; Control theory (sociology); Control (management); Artificial intelligence; Pure mathematics; Applied mathematics; Geometry; Classical mechanics","score_opus":0.07329843599725733,"score_gpt":0.31397469918011045,"score_spread":0.24067626318285312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481123737","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.0000028118832,0.00011952794,0.6840863,0.000014837668,0.00026158104,0.0009594089,0.0000059568024,0.00018828471,0.31436127],"genre_scores_gemma":[0.00091176986,0.000020857595,0.96605337,0.0000466607,0.000188244,0.00018562068,0.000041025014,0.00007368081,0.03247878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981511,0.000008973475,0.00075443677,0.00044613707,0.0003567577,0.00028255052],"domain_scores_gemma":[0.998084,0.00030858238,0.00061106257,0.00087999715,0.00006150697,0.000054830976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009020595,0.00033771252,0.00048795657,0.00029460544,0.00007414259,0.00014628092,0.0008111766,0.00041101573,0.00001879951],"category_scores_gemma":[0.000051651507,0.00034340186,0.000069478876,0.00006972879,0.000040507144,0.0001303308,0.00013674739,0.00033237753,0.00022997579],"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.0000034141872,0.000029905821,4.673278e-8,0.00041142726,0.000015053839,0.0000012600724,0.0006456799,0.0014491503,0.000042158772,0.95959425,0.00035434004,0.03745331],"study_design_scores_gemma":[0.00035102645,0.000029099585,0.0000012097609,0.000552543,0.000025300724,0.000017332492,0.000036094032,0.48423293,0.00017473075,0.48061725,0.03346616,0.0004963015],"about_ca_topic_score_codex":5.68749e-7,"about_ca_topic_score_gemma":5.645814e-7,"teacher_disagreement_score":0.4827838,"about_ca_system_score_codex":0.00026771624,"about_ca_system_score_gemma":0.0000515988,"threshold_uncertainty_score":0.9999018},"labels":[],"label_agreement":null},{"id":"W2487387108","doi":"10.4018/978-1-60960-086-0.ch013","title":"Formal Analysis of Real-Time Systems","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Computer science; Automated theorem proving; Parallelism (grammar); Gas meter prover; Formal methods; Theoretical computer science; State (computer science); Programming language; Mathematics; Parallel computing; Mathematical proof","score_opus":0.03411807452634276,"score_gpt":0.27224591328039005,"score_spread":0.2381278387540473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487387108","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046181354,0.000092009206,0.16030626,0.0000017695357,0.00046190145,0.00023482546,0.000085860265,0.00016306434,0.83860815],"genre_scores_gemma":[0.109794274,0.000058189416,0.53092414,0.00015412942,0.00046464778,0.000087640015,0.000043865723,0.00012895981,0.35834414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780613,0.0000573729,0.0007359014,0.00052467093,0.0005370073,0.00033889676],"domain_scores_gemma":[0.9971829,0.000035035522,0.0007920735,0.0015989487,0.00025965736,0.00013137002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005737503,0.00034087608,0.0008122131,0.00032347566,0.00006297921,0.00007646329,0.0015122236,0.00041043552,0.000027304859],"category_scores_gemma":[0.000018665325,0.00033114306,0.00043006736,0.00012975826,0.00010833617,0.00022924544,0.00040637393,0.00015981498,0.00017295763],"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.000011050749,0.000005894603,0.000007040731,0.00003614984,0.00060269784,0.0000069454127,0.00008801224,0.000032535318,0.000034818928,0.9929756,0.00015920369,0.0060400413],"study_design_scores_gemma":[0.0009775852,0.0010864479,0.0018508554,0.0008699275,0.0068718097,0.00015826104,0.000021202322,0.14813451,0.0011554904,0.7968766,0.03828584,0.003711468],"about_ca_topic_score_codex":0.0003357357,"about_ca_topic_score_gemma":0.00001011918,"teacher_disagreement_score":0.48026398,"about_ca_system_score_codex":0.00018863543,"about_ca_system_score_gemma":0.00013920362,"threshold_uncertainty_score":0.99991405},"labels":[],"label_agreement":null},{"id":"W2489459579","doi":"10.4018/978-1-61520-655-1.ch030","title":"Process Algebras for Locality","year":2012,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Locality; Process calculus; Computer science; Process (computing); Calculus (dental); Theoretical computer science; Programming language; Medicine; Linguistics; Philosophy","score_opus":0.04540552408168338,"score_gpt":0.31726356159500163,"score_spread":0.2718580375133183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489459579","genre_codex":"other","genre_gemma":"methods","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.0000066205553,0.00021252368,0.44407195,0.00003008107,0.00067228597,0.0004613599,0.0000418741,0.00019921493,0.5543041],"genre_scores_gemma":[0.04747661,0.000006128316,0.8830544,0.0016868496,0.0014461953,0.000320081,0.000014508772,0.00011099254,0.06588428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981328,0.000026490668,0.00041072877,0.00058300723,0.0004127576,0.00043416562],"domain_scores_gemma":[0.99813,0.000042974247,0.00033418566,0.0010507581,0.00025439393,0.00018766196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052030984,0.000359518,0.00036092527,0.00004544193,0.00011727819,0.00011048814,0.0013861136,0.00043576307,0.000009980114],"category_scores_gemma":[0.00005939232,0.00035475122,0.00019098917,0.00002442897,0.000110419984,0.00023216906,0.00022994983,0.00021222304,0.0001678307],"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.000010937808,0.000007435774,0.000003911799,0.00009479341,0.000024465273,0.0000012218333,0.000054808534,0.0000013513762,0.0000034433026,0.92656606,0.00047029884,0.07276129],"study_design_scores_gemma":[0.0001682136,0.00006862655,0.000028364779,0.00007136016,0.000034306355,0.000024830882,0.0000019909974,0.0007989664,0.00055136817,0.92931724,0.06850517,0.0004295749],"about_ca_topic_score_codex":0.000008183818,"about_ca_topic_score_gemma":0.000004729416,"teacher_disagreement_score":0.48841983,"about_ca_system_score_codex":0.00023322672,"about_ca_system_score_gemma":0.00022206819,"threshold_uncertainty_score":0.99989045},"labels":[],"label_agreement":null},{"id":"W2490656683","doi":"10.4018/978-1-4666-4789-3.ch013","title":"Formal Reliability Analysis of Engineering Systems","year":2014,"lang":"en","type":"book-chapter","venue":"Advances in information security, privacy, and ethics book series","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Reliability (semiconductor); Computer science; Probabilistic logic; Reliability engineering; Formal methods; Random variable; Theoretical computer science; Mathematics; Engineering; Programming language; Artificial intelligence; Statistics","score_opus":0.01764874580091416,"score_gpt":0.28019239476501695,"score_spread":0.2625436489641028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490656683","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.000104979954,0.0046557193,0.89694613,0.00021916727,0.0010313003,0.0005244024,0.000057764675,0.00017833969,0.09628221],"genre_scores_gemma":[0.18178524,0.17578612,0.62521696,0.0017641945,0.00047636923,0.0003743648,0.0009163164,0.00015413376,0.013526318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973514,0.00007976246,0.0013273049,0.00029964783,0.00066400605,0.00027788582],"domain_scores_gemma":[0.9970422,0.00048406568,0.0009318597,0.0009687303,0.0004915783,0.0000815838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002873477,0.0003367284,0.00072945375,0.0008783727,0.00013035309,0.00018431158,0.00083074946,0.0006002049,0.000008323569],"category_scores_gemma":[0.0006798519,0.00034553438,0.00013891123,0.0002979912,0.00026002162,0.012469589,0.0005937994,0.0010161056,0.000006385873],"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.00001558238,0.0000038216817,0.000049013506,0.0012863363,0.000057503785,2.9489777e-7,0.0072904495,0.0076654977,5.3482137e-7,0.9806631,0.000011701326,0.0029561312],"study_design_scores_gemma":[0.00019967694,0.000119939206,0.00024506584,0.00037224728,0.00012163262,0.000010270106,0.00011060775,0.21922015,0.00007842359,0.040411163,0.7385808,0.0005300278],"about_ca_topic_score_codex":0.000019421446,"about_ca_topic_score_gemma":0.000014391582,"teacher_disagreement_score":0.94025195,"about_ca_system_score_codex":0.00010365895,"about_ca_system_score_gemma":0.00010718489,"threshold_uncertainty_score":0.9998997},"labels":[],"label_agreement":null},{"id":"W2491068252","doi":"10.1109/tdsc.2016.2596719","title":"Symbolic Synthesis of Timed Models with Strict 2-Phase Fault Recovery","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Automaton; Timed automaton; Bisimulation; Model checking; Theoretical computer science; Time complexity; Fault model; Algorithm","score_opus":0.021828073778649017,"score_gpt":0.2616526338298034,"score_spread":0.2398245600511544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491068252","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.08383156,0.00004038212,0.91517615,0.00007329884,0.00018090736,0.00015604583,0.000016224001,0.00011698433,0.00040842098],"genre_scores_gemma":[0.7915251,0.00005225695,0.20831032,0.000025432839,0.00001492699,0.000008667465,2.0771188e-7,0.000012081736,0.000050990187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986192,0.000159578,0.0003081071,0.00039165549,0.0002588004,0.00026263698],"domain_scores_gemma":[0.99861157,0.00058511377,0.00015994017,0.00044211323,0.0001082029,0.00009304588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048329672,0.0001725744,0.00025276945,0.00021237475,0.00019902614,0.00005563667,0.00035516897,0.00008834391,0.000009856511],"category_scores_gemma":[0.000019606296,0.00011959381,0.00006258654,0.00039461788,0.000058948306,0.0006835263,0.000005643831,0.00013999439,0.0000065615063],"study_design_candidate":"design_other","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.00015930626,0.00023591497,0.0000040327577,0.000055035543,0.000081824684,0.000008425459,0.0004940239,0.041644767,0.0066145025,0.0041673523,0.000018119963,0.9465167],"study_design_scores_gemma":[0.00088470976,0.00042766417,0.000026233085,0.0002860783,0.000039342318,0.000069482456,0.000044877874,0.7365299,0.26037747,0.000980498,0.0000678328,0.00026596113],"about_ca_topic_score_codex":0.000027764625,"about_ca_topic_score_gemma":0.0000056609715,"teacher_disagreement_score":0.94625074,"about_ca_system_score_codex":0.000040682055,"about_ca_system_score_gemma":0.000063154686,"threshold_uncertainty_score":0.4876894},"labels":[],"label_agreement":null},{"id":"W2498324117","doi":"10.1007/978-3-319-40970-2_9","title":"Learning Rate Based Branching Heuristic for SAT Solvers","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":160,"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":"Heuristics; Computer science; Leverage (statistics); Solver; Branching (polymer chemistry); Heuristic; Mathematical optimization; Reinforcement learning; Artificial intelligence; Optimization problem; Machine learning; Theoretical computer science; Algorithm; Mathematics; Programming language","score_opus":0.023853973969740764,"score_gpt":0.27565994816613043,"score_spread":0.25180597419638967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498324117","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.000026888587,0.0001150717,0.99371666,0.00047801057,0.0027516992,0.0005612113,0.00000548527,0.00026129268,0.0020837022],"genre_scores_gemma":[0.04797611,0.00001016328,0.9500322,0.0010106185,0.0004340429,0.000024978552,0.0000049120954,0.00004608005,0.00046094364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963744,0.000111587615,0.0005432792,0.0015505842,0.0006619251,0.00075820537],"domain_scores_gemma":[0.9960989,0.0017746618,0.00045467308,0.0012248469,0.00028609255,0.00016083448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028792592,0.00050033483,0.00048308604,0.000749945,0.0004809752,0.0005222857,0.0030551245,0.00029948927,0.000016601369],"category_scores_gemma":[0.0008630684,0.0004262063,0.00017864181,0.00039233812,0.00054319005,0.000789654,0.00058539637,0.00071423716,0.00004994408],"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.000015724941,0.000010270176,0.000020841924,0.00007850462,0.00000820318,0.000011345128,0.0003981867,0.049770307,0.0005361092,0.044881172,0.000009485648,0.90425986],"study_design_scores_gemma":[0.0004002025,0.00023953196,0.00007520065,0.00039388603,0.000009086832,0.000011927167,8.637917e-8,0.8792271,0.0029350284,0.1131229,0.0029814688,0.00060355326],"about_ca_topic_score_codex":0.0000032865516,"about_ca_topic_score_gemma":0.0000060855,"teacher_disagreement_score":0.9036563,"about_ca_system_score_codex":0.0003944221,"about_ca_system_score_gemma":0.0005621945,"threshold_uncertainty_score":0.999819},"labels":[],"label_agreement":null},{"id":"W2500782055","doi":"10.4018/978-1-4666-5888-2.ch705","title":"Formal Verification Methods","year":2014,"lang":"en","type":"book-chapter","venue":"Advances in information quality and management","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science","score_opus":0.04842339022231228,"score_gpt":0.3855151116572161,"score_spread":0.3370917214349038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500782055","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":[5.756298e-7,0.00035006666,0.59286326,0.00010690004,0.00034787357,0.00031367285,0.0000025501763,0.00007345249,0.4059416],"genre_scores_gemma":[0.00011933527,0.009699397,0.9775974,0.0010347717,0.000034336474,0.000102785714,0.00007079319,0.000009336582,0.01133183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980271,0.00012783601,0.0009811409,0.00028287465,0.0003541605,0.00022692219],"domain_scores_gemma":[0.9983274,0.000080718506,0.00070334016,0.000748205,0.00008393191,0.000056417324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034493015,0.00023824674,0.00028881774,0.00038944252,0.000116643096,0.00015529264,0.00058565655,0.00016459581,0.000015344458],"category_scores_gemma":[0.00006652797,0.00024806315,0.00005534959,0.000097027056,0.000080955164,0.005530606,0.00036651146,0.00022143753,0.00008817088],"study_design_candidate":"not_applicable","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.000005023523,0.0000020746577,0.0000010088145,0.0002864,0.0000040504838,1.087293e-7,0.00016829764,0.0000705921,1.6453957e-7,0.53034616,0.000034550474,0.4690816],"study_design_scores_gemma":[0.00024167619,0.000031972562,0.00042003236,0.00009175021,0.000008389917,0.0000019168467,0.000033782133,0.007945515,0.000020806174,0.13619436,0.85473186,0.000277939],"about_ca_topic_score_codex":0.000003472156,"about_ca_topic_score_gemma":0.0000036174422,"teacher_disagreement_score":0.8546973,"about_ca_system_score_codex":0.00011244686,"about_ca_system_score_gemma":0.000012853725,"threshold_uncertainty_score":0.99999714},"labels":[],"label_agreement":null},{"id":"W2502854692","doi":"10.4018/978-1-4666-3922-5.ch002","title":"Formal Reliability Analysis of Embedded Computing Systems","year":2013,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Reliability (semiconductor); Computer science; Reliability engineering; HOL; Automated theorem proving; Formal verification; Formal methods; Digital electronics; Computer engineering; Theoretical computer science; Power (physics); Electronic circuit; Software engineering; Engineering; Programming language","score_opus":0.026776399454926037,"score_gpt":0.2837175472533581,"score_spread":0.2569411477984321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502854692","genre_codex":"other","genre_gemma":"methods","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.00035906857,0.000087565975,0.4130483,0.0000050106573,0.00064063416,0.00035362653,0.00003780529,0.00014957099,0.58531845],"genre_scores_gemma":[0.43926954,0.0000031439802,0.53943235,0.00013849454,0.00021255751,0.000025073125,0.000014707585,0.00004178236,0.020862337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969655,0.00010585341,0.0010893013,0.0007173291,0.0007043488,0.0004176136],"domain_scores_gemma":[0.99623543,0.00010376304,0.0010480518,0.0019566158,0.00050681154,0.00014930766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010183756,0.0003975648,0.0009876684,0.00025676042,0.000107109605,0.00016833443,0.0015643348,0.00044658783,0.00001424996],"category_scores_gemma":[0.00007946935,0.00038209028,0.0004954104,0.00017425652,0.00014766557,0.0002903819,0.00063728675,0.0002895539,0.00008411726],"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.0000054272855,0.000008041478,0.000023060258,0.00008871903,0.00037276806,0.0000023241487,0.00012669877,0.0015588388,0.000008170778,0.9878066,0.00017202509,0.009827297],"study_design_scores_gemma":[0.00032505824,0.00019784202,0.001150952,0.000301894,0.0011039162,0.000026517608,0.000026365502,0.8665645,0.00014921807,0.12427683,0.0048495377,0.0010273447],"about_ca_topic_score_codex":0.0002157961,"about_ca_topic_score_gemma":0.0000054946504,"teacher_disagreement_score":0.8650057,"about_ca_system_score_codex":0.00036545945,"about_ca_system_score_gemma":0.00014820263,"threshold_uncertainty_score":0.9998631},"labels":[],"label_agreement":null},{"id":"W2507455848","doi":"10.1007/978-3-319-44953-1_6","title":"Multiobjective Optimization by Decision Diagrams","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":24,"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; The Scarborough Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Influence diagram; Computer science; Mathematical optimization; Multi-objective optimization; Set (abstract data type); Optimization problem; Diagram; State space; State (computer science); Algorithm; Decision tree; Mathematics; Artificial intelligence","score_opus":0.01541185246162005,"score_gpt":0.27135947443988234,"score_spread":0.2559476219782623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507455848","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.000009355679,0.00028297503,0.9924383,0.00022415708,0.0024973662,0.0004883578,0.0000098670835,0.00021794246,0.0038316369],"genre_scores_gemma":[0.005345555,0.000102972575,0.99339944,0.0004881304,0.00025467272,0.000017998382,0.0000056230206,0.000035301207,0.00035030668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960114,0.000067857865,0.00056928134,0.0016611421,0.0011117869,0.0005785697],"domain_scores_gemma":[0.99664605,0.00078123494,0.00040868862,0.0016054977,0.00038807731,0.0001704295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012990951,0.000494073,0.0004214377,0.0006847662,0.00026968223,0.00046858174,0.0032845666,0.00042019758,0.0000289758],"category_scores_gemma":[0.00044719983,0.00039781578,0.00011166192,0.00062155916,0.0006136643,0.001353074,0.0010454517,0.0005256679,0.00008226338],"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.0000069807793,0.000018783092,0.000011401138,0.0000073828355,0.0000045458364,0.0000064709375,0.00022059864,0.05740669,0.00012773635,0.021786356,0.000031354666,0.9203717],"study_design_scores_gemma":[0.00029333754,0.0001448584,0.00003680436,0.00032767528,0.000004375181,0.00002417081,5.817608e-8,0.87701154,0.0034281737,0.11698967,0.0011504759,0.00058883824],"about_ca_topic_score_codex":0.000006281631,"about_ca_topic_score_gemma":0.000007930549,"teacher_disagreement_score":0.9197829,"about_ca_system_score_codex":0.0006112679,"about_ca_system_score_gemma":0.0002918866,"threshold_uncertainty_score":0.99984735},"labels":[],"label_agreement":null},{"id":"W2513565709","doi":"10.1145/2967973.2968601","title":"Iterated process analysis over lattice-valued regular expressions","year":2016,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Compute Canada","funders":"","keywords":"Message passing; Computer science; Iterated function; Theoretical computer science; Lattice (music); Semantics (computer science); Process (computing); Interdependence; Algorithm; Programming language; Mathematics","score_opus":0.02569352422599992,"score_gpt":0.3314852989982639,"score_spread":0.305791774772264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513565709","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.054197762,0.000013340122,0.93891555,0.00030814667,0.000107418055,0.000090101516,0.0000016862523,0.00025812627,0.0061078416],"genre_scores_gemma":[0.38543007,0.0000030367535,0.60927767,0.00018177317,0.000024022947,0.000025754176,0.000001406223,0.0000060006505,0.005050249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987769,0.00014012853,0.00022231355,0.00036833916,0.00028717623,0.00020510293],"domain_scores_gemma":[0.99872035,0.00006803464,0.00009753622,0.00087186997,0.00015296304,0.000089227564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042455617,0.00010200824,0.00014308521,0.00021403254,0.00009280323,0.00009668769,0.00074299186,0.00006132405,0.00030618525],"category_scores_gemma":[0.00015681208,0.000058999103,0.00007658846,0.0015210683,0.0000384625,0.0010360314,0.00011786853,0.000045577373,0.00008435217],"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.000036978334,0.0002825135,0.010377654,0.00003810492,0.00058276206,0.00001238169,0.0017404428,0.0002882494,0.11914214,0.7512533,0.002090764,0.11415472],"study_design_scores_gemma":[0.0011283234,0.00011029387,0.07261514,0.00010900594,0.00025937412,0.000008055187,0.000057386478,0.57977855,0.32103342,0.017414935,0.0066333036,0.0008522094],"about_ca_topic_score_codex":0.0000046576124,"about_ca_topic_score_gemma":0.0000015037829,"teacher_disagreement_score":0.7338384,"about_ca_system_score_codex":0.00003020354,"about_ca_system_score_gemma":0.000032399083,"threshold_uncertainty_score":0.33525136},"labels":[],"label_agreement":null},{"id":"W251738500","doi":"10.1007/978-3-319-07725-3_46","title":"Formalizing the Glucose Homeostasis Mechanism","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Correctness; Computer science; Process (computing); Domain (mathematical analysis); Mechanism (biology); Reliability engineering; Formal verification; Formal methods; Risk analysis (engineering); Distributed computing; Software engineering; Programming language","score_opus":0.026481463382299064,"score_gpt":0.2676860127515334,"score_spread":0.24120454936923436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W251738500","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.000029762643,0.0007032218,0.99144787,0.00081681204,0.0028981746,0.00046741022,0.000002623396,0.00022424666,0.0034098567],"genre_scores_gemma":[0.039012555,0.00014773096,0.9574563,0.0026422795,0.0004870951,0.00002100764,0.000002617441,0.000039916984,0.00019052504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959021,0.00010817835,0.00061235443,0.0013369207,0.0012586003,0.0007818526],"domain_scores_gemma":[0.9958971,0.0005889632,0.00045864368,0.0026497943,0.00025394658,0.00015154062],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0034036147,0.00053856475,0.000470213,0.0006434672,0.00057778286,0.0008184308,0.006611824,0.00033684468,0.000016483504],"category_scores_gemma":[0.00025351904,0.0003946326,0.0001678416,0.0007385525,0.00068470644,0.00075801,0.0020329251,0.0009907258,0.00010520772],"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.0000016536842,0.0000044214303,9.640179e-7,0.000015121486,0.0000043106884,0.000006296187,0.00040311163,0.0017418776,0.000069074136,0.39989763,0.000009415857,0.5978461],"study_design_scores_gemma":[0.00013692089,0.00012885513,0.000026595542,0.00017166535,0.000008568452,0.000088429486,2.2395929e-7,0.57104015,0.010301082,0.41013017,0.0074311155,0.0005362217],"about_ca_topic_score_codex":0.000015825906,"about_ca_topic_score_gemma":0.000020827987,"teacher_disagreement_score":0.5973099,"about_ca_system_score_codex":0.0003140533,"about_ca_system_score_gemma":0.00031956926,"threshold_uncertainty_score":0.9998506},"labels":[],"label_agreement":null},{"id":"W2523195045","doi":"10.1007/978-3-319-46520-3_19","title":"Observational Refinement and Merge for Disjunctive MTSs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","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":"University of Toronto; University of Waterloo","funders":"","keywords":"Merge (version control); Alphabet; Computer science; Formalism (music); Theoretical computer science; Algorithm; Programming language; Information retrieval; Linguistics","score_opus":0.05876600179384918,"score_gpt":0.3025982328056963,"score_spread":0.24383223101184714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523195045","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.00003336389,0.00020584895,0.99368745,0.0016566282,0.0017356034,0.0005447578,0.000017685039,0.00007973037,0.0020389105],"genre_scores_gemma":[0.003394799,0.000035845205,0.9943298,0.0010891038,0.00036213986,0.000051032825,0.0000052716564,0.000020502144,0.00071147067],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724966,0.000028908757,0.00042375462,0.0012187388,0.00065157074,0.00042736685],"domain_scores_gemma":[0.99777853,0.0006011483,0.00028200072,0.00089194736,0.00033373712,0.000112657835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012587741,0.00034773565,0.00032988828,0.00037896595,0.00024183941,0.0002229208,0.0016459088,0.00019749583,0.00001121012],"category_scores_gemma":[0.00025148204,0.00027272545,0.00007582878,0.00024927015,0.0005223518,0.0007084071,0.0008121381,0.0002485321,0.000010159091],"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.0000075280786,0.000008951534,0.000038587965,0.000024711588,0.0000068989875,0.0000017065329,0.00018850538,0.0003343659,0.0001433935,0.47804922,0.00002664582,0.5211695],"study_design_scores_gemma":[0.00044913308,0.00027944607,0.0014068737,0.000311442,0.000009406685,0.000018545794,1.1187672e-7,0.3162661,0.0016292983,0.6642161,0.014762157,0.0006513655],"about_ca_topic_score_codex":0.0000036956092,"about_ca_topic_score_gemma":0.000009758228,"teacher_disagreement_score":0.5205181,"about_ca_system_score_codex":0.00026585077,"about_ca_system_score_gemma":0.00029647598,"threshold_uncertainty_score":0.9999725},"labels":[],"label_agreement":null},{"id":"W2524005430","doi":"","title":"Template semantics: a parameterized approach to semantics-based model compilation","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"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 Waterloo","funders":"","keywords":"Programming language; Computer science; Notation; Semantics (computer science); Well-founded semantics; Operational semantics; Denotational semantics; Computational semantics; Action semantics; Parameterized complexity; Formal semantics (linguistics); Proof-theoretic semantics; Theoretical computer science; Algorithm; Mathematics","score_opus":0.055856346079306264,"score_gpt":0.30523499309687585,"score_spread":0.2493786470175696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2524005430","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.0062879226,0.0000056305967,0.9852889,0.0014407405,0.000104697785,0.0004194622,0.0000036023346,0.00041662628,0.0060324124],"genre_scores_gemma":[0.38182527,4.9709274e-7,0.6169907,0.0009177633,0.000026375967,0.000025881123,0.0000071554896,0.000009154364,0.00019722704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841726,0.00010117189,0.00035892354,0.00046368103,0.00034931765,0.000309638],"domain_scores_gemma":[0.9987254,0.000058349826,0.00010410877,0.0008684301,0.00010814552,0.00013552613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000614949,0.00017249447,0.00020197382,0.00019321208,0.00011800749,0.0001988251,0.00078578974,0.00008127015,0.0000062894946],"category_scores_gemma":[0.00006757932,0.00015944219,0.00006605753,0.00046145293,0.00003019457,0.00063145906,0.00013821137,0.00011341708,0.00014132597],"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.000021793703,0.00020358367,0.00004164375,0.000024479496,0.0000104153405,4.276112e-7,0.00069261086,0.7928855,0.004666527,0.18677801,0.0006983483,0.013976678],"study_design_scores_gemma":[0.00032463195,0.000040931594,0.00025019125,0.000009021962,0.0000057177376,0.000004245522,0.000006561507,0.9762187,0.021013785,0.0012018459,0.0007036322,0.00022074446],"about_ca_topic_score_codex":0.0000060916573,"about_ca_topic_score_gemma":0.0000023039827,"teacher_disagreement_score":0.37553734,"about_ca_system_score_codex":0.000068123634,"about_ca_system_score_gemma":0.00005374173,"threshold_uncertainty_score":0.6501864},"labels":[],"label_agreement":null},{"id":"W2525976117","doi":"","title":"An incremental method for testing timed input output automata","year":2008,"lang":"en","type":"article","venue":"International Conference on Telecommunications","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; Automaton; Reliability engineering; System requirements specification; System testing; Formal specification; Test strategy; Fault coverage; Software requirements specification; System under test; Model-based testing; Conformance testing; Test case; Software system; Software; Programming language; Engineering; Software engineering; Theoretical computer science; Operating system","score_opus":0.2258861082196891,"score_gpt":0.41838123890737455,"score_spread":0.19249513068768545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525976117","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.0028452154,0.000008455439,0.9563864,0.0023504905,0.00027422895,0.0003731463,0.000037278787,0.00039877155,0.037326027],"genre_scores_gemma":[0.3422403,0.000021869102,0.656783,0.00037316428,0.000044511387,0.0001984132,0.000087503424,0.000011021655,0.00024020542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982918,0.0002923458,0.00042829942,0.00039804142,0.00036136742,0.00022817837],"domain_scores_gemma":[0.99679255,0.0005206637,0.00025783712,0.001638313,0.000687344,0.00010328515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008519634,0.00016720597,0.00015696196,0.0002459507,0.0005061665,0.00017527724,0.0039727897,0.00007819789,0.000041490253],"category_scores_gemma":[0.0007562606,0.0001775811,0.00006284512,0.00031093034,0.0000937625,0.0009519597,0.00032316978,0.0002452617,0.00008156524],"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.000017903154,0.00041144568,0.0003254749,0.0000041716066,0.000040924762,0.0000010764996,0.0007045888,0.0002813067,0.008915818,0.8675319,0.0006546419,0.12111073],"study_design_scores_gemma":[0.00042462867,0.00022530906,0.0050134393,0.000024765566,0.000005207451,0.000050410883,0.00005847929,0.9726183,0.005749792,0.010914444,0.0046864944,0.00022872616],"about_ca_topic_score_codex":0.00007777945,"about_ca_topic_score_gemma":0.000011664768,"teacher_disagreement_score":0.972337,"about_ca_system_score_codex":0.00015552214,"about_ca_system_score_gemma":0.00022403593,"threshold_uncertainty_score":0.73824984},"labels":[],"label_agreement":null},{"id":"W2526743241","doi":"10.23638/lmcs-13(3:24)2017","title":"Well Behaved Transition Systems","year":2017,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Undecidable problem; Decidability; Mathematical proof; Monotone polygon; Monotonic function; Class (philosophy); Mathematics; Discrete mathematics; Computer science","score_opus":0.14399914835937896,"score_gpt":0.43131535263420245,"score_spread":0.2873162042748235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526743241","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.0018198651,0.00029480606,0.9812293,0.00040730476,0.012613951,0.00089686166,0.0000044395574,0.00039440556,0.0023390807],"genre_scores_gemma":[0.036230788,0.00005936862,0.9628463,0.0002657572,0.0003943046,0.00015497349,0.0000033705905,0.000017363847,0.000027817858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919754,0.002160673,0.0010682936,0.0026022384,0.0012138984,0.0009794472],"domain_scores_gemma":[0.99360853,0.00054034457,0.0007880929,0.004349056,0.00037829505,0.00033570584],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.016320083,0.00056107587,0.000905949,0.00073262624,0.0005740361,0.0026370005,0.0115120895,0.0006226815,0.00000801684],"category_scores_gemma":[0.0006581072,0.00049842487,0.00022162347,0.00094149745,0.0012434759,0.0014315802,0.005637602,0.0016337106,0.00004524587],"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.000016374386,0.00031104303,0.00011822846,0.000269058,0.0000139313015,0.00010710593,0.0015311271,0.09003322,0.0017168476,0.17128015,0.000062013,0.7345409],"study_design_scores_gemma":[0.00020066806,0.00012252745,0.004414124,0.00027777482,0.000008024163,0.00005058588,0.0000047513763,0.9361137,0.0018484988,0.05590095,0.00047205668,0.0005862967],"about_ca_topic_score_codex":0.00012308573,"about_ca_topic_score_gemma":0.0000018412962,"teacher_disagreement_score":0.84608054,"about_ca_system_score_codex":0.00042947644,"about_ca_system_score_gemma":0.00046949633,"threshold_uncertainty_score":0.99974674},"labels":[],"label_agreement":null},{"id":"W2528006267","doi":"","title":"Mixed-Integer Linear Programming for Planning with Temporal Logic Tasks [Position Paper]","year":2015,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nutrasource","funders":"","keywords":"Integer programming; Computer science; Linear programming; Computation; Mathematical optimization; Linear temporal logic; Dynamical systems theory; Task (project management); Integer (computer science); Theoretical computer science; Algorithm; Mathematics; Engineering; Programming language; Systems engineering","score_opus":0.3511121685748741,"score_gpt":0.41381928557568937,"score_spread":0.06270711700081527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528006267","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.001046612,0.000017866436,0.9931987,0.0015951376,0.00044259764,0.00052226614,0.000010435641,0.00019775174,0.002968619],"genre_scores_gemma":[0.5517786,8.20715e-7,0.44752172,0.00035404423,0.00012990263,0.00012947114,0.000031776814,0.000009030526,0.000044651304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977341,0.00012656688,0.00043933632,0.00053674047,0.00083374046,0.00032946],"domain_scores_gemma":[0.99751055,0.00020030531,0.00023384384,0.0002880942,0.001610906,0.00015629937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013972962,0.00021057698,0.00018391764,0.00019407088,0.00020690972,0.00028593873,0.0006843785,0.00012176857,0.000015353695],"category_scores_gemma":[0.00075873284,0.00018086139,0.00005485372,0.00047243398,0.00013056223,0.00082714076,0.000066656874,0.00024646916,0.00010964815],"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.00014469071,0.00010708542,0.000030448378,0.00000897851,0.000009043311,0.0000032724863,0.0004197551,0.0072587277,0.00029885533,0.92009985,0.00010720051,0.07151212],"study_design_scores_gemma":[0.00008050828,0.00090378686,0.00007016093,0.00008587777,0.0000061625874,0.000017679622,0.00043410514,0.7288894,0.021264527,0.2453415,0.0025858502,0.00032043556],"about_ca_topic_score_codex":0.00001860193,"about_ca_topic_score_gemma":0.000018944758,"teacher_disagreement_score":0.7216307,"about_ca_system_score_codex":0.00017977414,"about_ca_system_score_gemma":0.00046606056,"threshold_uncertainty_score":0.73753136},"labels":[],"label_agreement":null},{"id":"W2530599745","doi":"","title":"Cycles and Degenerate Cycles Through Specified Vertices","year":2005,"lang":"en","type":"article","venue":"Far East Journal of Applied Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Degenerate energy levels; Computer science; Mathematics; Combinatorics; Physics; Quantum mechanics","score_opus":0.04766510816210762,"score_gpt":0.291902780908251,"score_spread":0.24423767274614339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2530599745","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.12546678,0.00038452132,0.8666753,0.00038295303,0.0001634387,0.00010122948,9.919193e-7,0.000036991973,0.006787763],"genre_scores_gemma":[0.16767018,0.00015507525,0.83181477,0.00012672824,0.0002043069,0.000002255411,1.75331e-7,0.00001126733,0.000015213627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871564,0.000022967915,0.000575339,0.00014250098,0.00035271546,0.00019082375],"domain_scores_gemma":[0.9988718,0.000076358716,0.000546512,0.00031834372,0.00010095554,0.00008605207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065919885,0.00014581399,0.00026654414,0.00008263158,0.000096670374,0.00016546728,0.0006202541,0.00006048834,0.0000107917695],"category_scores_gemma":[0.000046317553,0.00011718183,0.000052097115,0.00016398945,0.00007235237,0.0006305631,0.00012183834,0.0001715427,0.00003663537],"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.000026357922,0.00015807383,0.000009594825,0.0000799288,0.000045437573,0.000004481182,0.0071347062,0.00085226324,0.011762377,0.9070634,0.00020850642,0.07265485],"study_design_scores_gemma":[0.0022071057,0.00028347998,0.001429716,0.0002858355,0.00015634634,0.0009659561,0.0029715216,0.21226764,0.28111315,0.47360304,0.023734834,0.0009813808],"about_ca_topic_score_codex":3.1447115e-7,"about_ca_topic_score_gemma":8.626722e-7,"teacher_disagreement_score":0.43346038,"about_ca_system_score_codex":0.000035098128,"about_ca_system_score_gemma":0.00003510499,"threshold_uncertainty_score":0.47785366},"labels":[],"label_agreement":null},{"id":"W2534287380","doi":"10.1109/icm.2000.884812","title":"Formal verification of the RCMP egress routing logic [ATM]","year":2000,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; Verilog; High-level verification; Formal verification; Functional verification; Liveness; Embedded system; Intelligent verification; Routing (electronic design automation); Model checking; VHDL; Verification; Field-programmable gate array; Algorithm; Distributed computing; Software; Programming language","score_opus":0.0299928681973316,"score_gpt":0.2816442360907728,"score_spread":0.2516513678934412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2534287380","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.06515367,0.000021328184,0.8788981,0.00037671588,0.00026283786,0.0001608511,6.470373e-7,0.000103646555,0.055022206],"genre_scores_gemma":[0.6585309,0.0000053160834,0.34057075,0.00014552666,0.00001855852,0.000006162568,4.0471505e-7,0.0000025995068,0.00071978464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991165,0.000105598425,0.00023225034,0.00016726035,0.00020788204,0.00017050686],"domain_scores_gemma":[0.99906445,0.000036076224,0.00010922888,0.00071372715,0.000053494467,0.000023001567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006068465,0.00006759316,0.00007460958,0.00002309879,0.00012352454,0.000039086048,0.0009785333,0.000045347922,0.00011186062],"category_scores_gemma":[0.00006192665,0.000043591033,0.000049010883,0.0003519,0.00005346744,0.000633425,0.00009557215,0.000081667735,0.000057431524],"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.000004796674,0.000029748508,0.0004168353,0.0000072993143,0.0000034048287,1.220344e-7,0.0005140877,0.0005020072,0.001633568,0.6829432,0.00006820999,0.31387666],"study_design_scores_gemma":[0.00038066402,0.00012357078,0.11369394,0.000039250084,0.00000975851,0.000025366955,0.00010380457,0.71387696,0.15358989,0.012692073,0.0051689795,0.00029574215],"about_ca_topic_score_codex":0.00002314984,"about_ca_topic_score_gemma":0.0000010883742,"teacher_disagreement_score":0.713375,"about_ca_system_score_codex":0.00002401751,"about_ca_system_score_gemma":0.000026365715,"threshold_uncertainty_score":0.18183747},"labels":[],"label_agreement":null},{"id":"W2537392761","doi":"10.1109/edtc.1994.326892","title":"High-level synthesis of digital circuits by finding fixpoints","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 Saskatchewan","funders":"","keywords":"Computer science; Electronic circuit; High-level synthesis; Digital electronics; Function (biology); Algorithm; Theoretical computer science; Product (mathematics); Mathematics; Computer hardware; Engineering","score_opus":0.07652171480482232,"score_gpt":0.26766771137278444,"score_spread":0.1911459965679621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537392761","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.01774265,0.00002457818,0.95832926,0.00018376322,0.0002109517,0.00006762253,0.000017149341,0.00010619553,0.023317859],"genre_scores_gemma":[0.7312303,0.0000046542723,0.2674817,0.000030447707,0.000010596572,0.0000056463737,6.097834e-7,0.0000044360027,0.0012315544],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914545,0.000031939562,0.00022196842,0.00021230524,0.00022445366,0.00016386904],"domain_scores_gemma":[0.9992,0.00018213144,0.00009793555,0.00042994262,0.000041915435,0.0000480736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019854971,0.00008071645,0.00012087824,0.000070033464,0.000042755695,0.000086430664,0.0006517956,0.000045803466,0.0001511845],"category_scores_gemma":[0.00038756253,0.00007403747,0.00003825676,0.0002731734,0.00003524864,0.0008921597,0.000105210296,0.00005119773,0.00018045281],"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":[7.987273e-7,0.0001309398,0.0005407394,0.00002434091,0.000017884691,0.0000015900151,0.00031785303,0.000015500042,0.0057871947,0.11678174,0.008867058,0.8675144],"study_design_scores_gemma":[0.0003258704,0.000120435536,0.0059952843,0.000066504654,0.000011352537,0.000026676254,0.00005126987,0.11320743,0.87124515,0.0057875672,0.0026119351,0.00055049785],"about_ca_topic_score_codex":0.0000073605825,"about_ca_topic_score_gemma":1.7863259e-7,"teacher_disagreement_score":0.86696386,"about_ca_system_score_codex":0.000026695729,"about_ca_system_score_gemma":0.000005482733,"threshold_uncertainty_score":0.301916},"labels":[],"label_agreement":null},{"id":"W2537939981","doi":"10.1109/issoc.2004.1411179","title":"Assertion based verification of PSL for systemC designs","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"SystemC; Computer science; Assertion; Programming language; Embedding; Compiler; PSL; Computer architecture; Artificial intelligence","score_opus":0.08907385122175004,"score_gpt":0.3397331175498206,"score_spread":0.25065926632807056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537939981","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.003171775,0.00001692457,0.9947638,0.00031795292,0.00014610925,0.00033395155,0.0000014532005,0.00011408428,0.0011339388],"genre_scores_gemma":[0.42644575,5.349377e-7,0.5733484,0.000056939476,0.000021080696,0.000046096415,0.0000030844421,0.0000028393456,0.00007525136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923617,0.00007651094,0.00025617596,0.00017994456,0.00014465908,0.00010651784],"domain_scores_gemma":[0.99911666,0.00009225584,0.00014012253,0.00045851988,0.00016334842,0.000029067885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081585854,0.000059462247,0.00008718561,0.00007803736,0.000044302327,0.000028773275,0.00037763637,0.000048401293,0.000008355507],"category_scores_gemma":[0.00012211154,0.00005475826,0.000043518732,0.00020210534,0.000013983354,0.00047904602,0.000013808967,0.000025533578,0.000018107034],"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.000026151201,0.00012090612,0.00012402341,0.00012592682,0.000007535169,3.826463e-8,0.00020269754,0.0027489108,0.10301464,0.79143244,0.0007627918,0.10143395],"study_design_scores_gemma":[0.00014960146,0.000059605158,0.00088855025,0.000010325481,0.0000030796482,5.4592675e-7,0.000009041719,0.6595839,0.33710504,0.000270613,0.0018656073,0.00005407745],"about_ca_topic_score_codex":0.000005263296,"about_ca_topic_score_gemma":0.0000014691659,"teacher_disagreement_score":0.79116184,"about_ca_system_score_codex":0.00005495024,"about_ca_system_score_gemma":0.000047765476,"threshold_uncertainty_score":0.2232977},"labels":[],"label_agreement":null},{"id":"W253810439","doi":"10.1007/978-3-642-15228-3_5","title":"Verification, Validation, and Accreditation","year":2010,"lang":"en","type":"book-chapter","venue":"","topic":"Formal Methods in Verification","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":"Defence Research and Development Canada; Concordia University","funders":"","keywords":"Accreditation; Computer science; Software engineering; Medicine; Medical education","score_opus":0.025545842298287068,"score_gpt":0.263022564904228,"score_spread":0.2374767226059409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W253810439","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.000011258276,0.000048613107,0.6177648,0.00030108026,0.0006357436,0.00017013388,0.0000027013682,0.00017958609,0.38088614],"genre_scores_gemma":[0.00027751087,0.00011056597,0.7957708,0.00013593778,0.00017693838,0.00001557089,0.000047351703,0.000021084832,0.20344421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882495,0.000020532852,0.0003086804,0.00046037894,0.00027434976,0.00011108699],"domain_scores_gemma":[0.9984593,0.00006976868,0.00025666287,0.00086293084,0.00027744722,0.0000738813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047157693,0.00018808749,0.00015118778,0.00016537705,0.00012290875,0.00019923857,0.0005563003,0.0003448755,0.00014841442],"category_scores_gemma":[0.0001084661,0.00018713821,0.00003604266,0.000044362845,0.00008869615,0.00066147436,0.00012640179,0.00030640292,0.00023702992],"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":[8.9777257e-7,0.0000029602554,0.0000020630418,0.000010702884,0.000006120264,2.2292814e-7,0.000092244874,5.155433e-7,0.0005269534,0.9666132,0.0006394102,0.032104712],"study_design_scores_gemma":[0.00014404448,0.000054124474,0.00046452179,0.000027786436,0.000021087253,0.00002670607,0.000003823517,0.0029936216,0.01095345,0.41732153,0.56751055,0.00047876552],"about_ca_topic_score_codex":0.000002887122,"about_ca_topic_score_gemma":0.0000015612579,"teacher_disagreement_score":0.5668711,"about_ca_system_score_codex":0.000028550732,"about_ca_system_score_gemma":0.00007975878,"threshold_uncertainty_score":0.7631275},"labels":[],"label_agreement":null},{"id":"W2539628077","doi":"10.1109/icm.2010.5696177","title":"An automated SAT encoding-verification approach for efficient model checking","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University","funders":"","keywords":"Automated theorem proving; HOL; Computer science; Formal verification; Functional verification; Boolean satisfiability problem; Model checking; Conjunctive normal form; Programming language; Encoding (memory); Satisfiability modulo theories; Automated reasoning; Satisfiability; Software verification; Intelligent verification; Algorithm; Theoretical computer science; Gas meter prover; Mathematics; Artificial intelligence; Software; Software development; Mathematical proof","score_opus":0.048262673461797724,"score_gpt":0.34366966467737053,"score_spread":0.2954069912155728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539628077","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.058128662,0.0000022837603,0.9356011,0.000043636122,0.00031961245,0.00041646074,0.000001915694,0.0014277432,0.0040585734],"genre_scores_gemma":[0.46756813,1.9033418e-7,0.5322359,0.00004363319,0.000025525022,0.00006531786,0.000011979847,0.000006957632,0.000042346328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987721,0.000041696145,0.00024511552,0.00047187315,0.00021450147,0.0002547488],"domain_scores_gemma":[0.9986499,0.000031379943,0.000114996066,0.0009574553,0.00015274643,0.00009353457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011775745,0.00012298455,0.00011356846,0.00010745648,0.0001938179,0.00019320029,0.0009643245,0.000114663475,0.0000030966617],"category_scores_gemma":[0.000109866225,0.000111442416,0.000046456367,0.0002848031,0.000040809307,0.0005208993,0.00006184918,0.00013854096,0.00001027518],"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.0000060791617,0.00016982731,0.00002534113,0.000020017584,0.000003422756,8.3244785e-8,0.00076286006,0.11785559,0.29342785,0.5742523,0.00007944926,0.013397164],"study_design_scores_gemma":[0.00013875891,0.000030401907,0.0005179023,0.000001546807,0.0000032198498,0.0000053932367,0.00002219452,0.9417983,0.056652144,0.00061086955,0.000069501904,0.00014972154],"about_ca_topic_score_codex":0.0000058264527,"about_ca_topic_score_gemma":9.1940547e-7,"teacher_disagreement_score":0.8239427,"about_ca_system_score_codex":0.00003555426,"about_ca_system_score_gemma":0.000057614583,"threshold_uncertainty_score":0.45444897},"labels":[],"label_agreement":null},{"id":"W2540172011","doi":"10.1109/tic-sth.2009.5444387","title":"Model-driven coding with VPAT: The Verbal Protocol Analysis Tool","year":2009,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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":"","keywords":"Computer science; Coding (social sciences); Usability; Human–computer interaction","score_opus":0.038178236924265446,"score_gpt":0.32289543704964946,"score_spread":0.28471720012538404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540172011","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.001028621,3.1084133e-7,0.9793335,0.0004240731,0.000011253479,0.009995509,3.2022234e-7,0.0001293218,0.009077054],"genre_scores_gemma":[0.19914871,1.4956024e-7,0.7942032,0.00040587535,0.000014447878,0.005956509,4.0453176e-7,0.000002215584,0.00026844832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910915,0.00006737929,0.00015296617,0.00023620891,0.00027001658,0.00016425057],"domain_scores_gemma":[0.9991153,0.000024617411,0.00007490824,0.0006863365,0.000068341695,0.000030505775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037262336,0.00008655865,0.00010361441,0.00007186959,0.00013749856,0.00015655418,0.0007841385,0.00002863305,0.000011890483],"category_scores_gemma":[0.000017192797,0.00004722381,0.0000534535,0.0009583398,0.00002766945,0.00049859297,0.000057387668,0.00008856424,0.000013388444],"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.00003293113,0.0000668961,0.00056010927,0.000005205611,0.00007433388,0.00000218781,0.0009654252,0.12242473,0.00088323327,0.8210083,0.00026739197,0.053709254],"study_design_scores_gemma":[0.00013793458,0.00008705257,0.002921964,0.0000031868033,0.000022664093,0.0000022760992,0.00000895725,0.9929393,0.0021124005,0.0012183925,0.0004544702,0.00009138209],"about_ca_topic_score_codex":0.0000062724107,"about_ca_topic_score_gemma":0.0000050338494,"teacher_disagreement_score":0.8705146,"about_ca_system_score_codex":0.000033700388,"about_ca_system_score_gemma":0.00003818797,"threshold_uncertainty_score":0.1925731},"labels":[],"label_agreement":null},{"id":"W2541480683","doi":"10.1109/icm.2007.4497706","title":"Automatic generation of systemc transactors from graphical FSM","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"SystemC; Computer science; Transaction-level modeling; Finite-state machine; Abstraction; Embedded system; Formal verification; Protocol (science); State (computer science); Abstract state machines; Abstraction layer; Computer architecture; Programming language; Software","score_opus":0.048369024091412985,"score_gpt":0.2962043814315525,"score_spread":0.2478353573401395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2541480683","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.29844627,0.000021915708,0.70027214,0.000031463864,0.0003185901,0.0000749626,6.4071816e-7,0.00009965793,0.00073435757],"genre_scores_gemma":[0.54208016,9.915311e-7,0.45785484,0.000024807176,0.000024788818,0.0000016661785,0.0000011619682,0.0000020339826,0.000009572866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990442,0.00008088297,0.00034155228,0.00017020809,0.000245328,0.000117852214],"domain_scores_gemma":[0.99933016,0.00009321334,0.00008895178,0.00038663362,0.000052089774,0.000048950642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008249107,0.000065853324,0.000113341244,0.000099339544,0.000032192052,0.000026427648,0.00036772838,0.0000684155,0.000035993988],"category_scores_gemma":[0.00003896339,0.000055083565,0.000046519075,0.00032195423,0.000028114235,0.00031695302,0.000015521522,0.00005552362,0.000011800066],"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.000004694461,0.000109525085,0.0011309427,0.000064594075,0.00003289551,0.000002909632,0.0017541404,0.000059111197,0.15886295,0.65037835,0.0001247737,0.18747512],"study_design_scores_gemma":[0.00013059277,0.000047261958,0.014956339,0.00001682387,0.0000062438125,0.0000028061481,0.00003360444,0.73010504,0.25308523,0.0014602413,0.000057781785,0.00009807479],"about_ca_topic_score_codex":0.00006759263,"about_ca_topic_score_gemma":0.000019841124,"teacher_disagreement_score":0.7300459,"about_ca_system_score_codex":0.000021202073,"about_ca_system_score_gemma":0.000017366898,"threshold_uncertainty_score":0.22462425},"labels":[],"label_agreement":null},{"id":"W2545534145","doi":"10.1109/edtc.1994.326876","title":"An extended OBDD representation for extended FSMs","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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 Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; École Polytechnique Fédérale de Lausanne; CMC Microsystems","keywords":"Computer science; Datapath; Binary decision diagram; Theoretical computer science; Finite-state machine; Programming language; Representation (politics); Predicate (mathematical logic); Formal verification; Algorithm; Parallel computing","score_opus":0.09143256092160935,"score_gpt":0.3679633936864008,"score_spread":0.27653083276479146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2545534145","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.002333881,0.00002836076,0.98572767,0.00034643803,0.00041140078,0.00033049734,0.0000010497959,0.00035228653,0.010468416],"genre_scores_gemma":[0.19782141,0.000007688354,0.8004143,0.00023705186,0.00006604538,0.000077047225,0.0000035948854,0.0000073389047,0.0013654891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886006,0.000098555596,0.0002214767,0.00040589317,0.00020152878,0.0002124809],"domain_scores_gemma":[0.99873805,0.00007190189,0.000084439474,0.0009132997,0.00011085439,0.000081463324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040450742,0.00009236413,0.00009745948,0.00008322656,0.00011639223,0.00014233995,0.0006789461,0.000054865734,0.00011125919],"category_scores_gemma":[0.00014757444,0.00008485109,0.000050922154,0.00029433006,0.000028413968,0.0013313378,0.000046520163,0.00005286505,0.00007748229],"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.0000074319164,0.00014794598,0.000035674027,0.000007294821,0.0000057222787,9.815776e-7,0.00060417096,0.00006507536,0.007787579,0.52390283,0.0022598372,0.46517545],"study_design_scores_gemma":[0.00032650522,0.00019959854,0.004702095,0.0000027654382,0.00000379005,0.000010459188,0.000057113935,0.92293346,0.042189196,0.027056769,0.0023587365,0.00015951402],"about_ca_topic_score_codex":0.000010338196,"about_ca_topic_score_gemma":0.0000023708085,"teacher_disagreement_score":0.9228684,"about_ca_system_score_codex":0.00003074587,"about_ca_system_score_gemma":0.000007955388,"threshold_uncertainty_score":0.3460127},"labels":[],"label_agreement":null},{"id":"W2546991541","doi":"10.1145/3550483","title":"Decentralized Asynchronous Crash-resilient Runtime Verification","year":2022,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México; Agence Nationale de la Recherche","keywords":"Computer science; Crash; Asynchronous communication; Runtime verification; Distributed computing; Model checking; Formal verification; Programming language; Computer network","score_opus":0.020888571723054545,"score_gpt":0.2768892200078629,"score_spread":0.2560006482848084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546991541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46551803,0.00072454376,0.5127182,0.0135994945,0.006415405,0.00032629346,0.000003124165,0.000055190114,0.0006397575],"genre_scores_gemma":[0.5424455,0.000026219168,0.45689416,0.0004230505,0.00008119469,0.00000682499,2.7090277e-7,0.000007196393,0.00011563792],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99839145,0.0004058469,0.00036812716,0.00011268178,0.0005711223,0.00015079243],"domain_scores_gemma":[0.9976276,0.000075619704,0.0006035639,0.0015381195,0.00010445701,0.000050612663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014183838,0.00006929879,0.0001183608,0.00007833684,0.00029488924,0.00006796772,0.005230499,0.00001913455,0.00007468041],"category_scores_gemma":[0.0009466217,0.000049834347,0.00012830949,0.0003944399,0.00002966896,0.00033874347,0.0011778764,0.0002830608,0.000013686345],"study_design_candidate":"not_applicable","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.0005791661,0.002069807,0.0203495,0.00007812175,0.00044516358,0.00007868339,0.012610091,0.075505994,0.18280658,0.2340283,0.13069494,0.34075364],"study_design_scores_gemma":[0.0033315385,0.0011953467,0.36051244,0.00007414359,0.00013736452,0.0022178062,0.00050703937,0.08780332,0.12063684,0.10630656,0.3165395,0.00073809444],"about_ca_topic_score_codex":0.0000033623023,"about_ca_topic_score_gemma":2.2583751e-7,"teacher_disagreement_score":0.34016293,"about_ca_system_score_codex":0.00025662922,"about_ca_system_score_gemma":0.00013321101,"threshold_uncertainty_score":0.97196555},"labels":[],"label_agreement":null},{"id":"W2547318924","doi":"10.1109/hol.1991.596279","title":"Implementing And Verifying Finite-state Machines Using Types In Higher-order Logic","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Calgary","funders":"","keywords":"Correctness; Computer science; Finite-state machine; Programming language; Abstract state machines; Equivalence (formal languages); Implementation; Theoretical computer science; State (computer science); Formal verification; Abstract machine; Mathematics; Discrete mathematics","score_opus":0.09442509622965133,"score_gpt":0.35292887485608865,"score_spread":0.2585037786264373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547318924","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.14406916,0.00015370741,0.85125834,0.00043012085,0.00014414523,0.00008483724,4.2824496e-7,0.000086733846,0.0037725032],"genre_scores_gemma":[0.2731384,0.000009456407,0.72643846,0.00024245634,0.000026232176,0.0000021609656,3.7728384e-7,0.0000037584307,0.00013872918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992093,0.00005932978,0.00019109034,0.00020596731,0.000090204674,0.0002441348],"domain_scores_gemma":[0.9996399,0.00006758557,0.00005822507,0.00017997569,0.00002778756,0.000026515321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000559397,0.00007891133,0.00008298948,0.000097180615,0.000095310694,0.00012040835,0.00020585913,0.000024101499,0.000048315174],"category_scores_gemma":[0.000056712193,0.00006921439,0.000010657983,0.00030904877,0.000019221156,0.0005935505,0.00022871219,0.00007579892,0.000009165417],"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.000007008305,0.00005348915,0.01114379,0.00003883176,0.000009550684,0.000008542508,0.0012808652,0.0108150765,0.0040752073,0.18365484,0.000018035187,0.7888948],"study_design_scores_gemma":[0.00018903308,0.00001262141,0.003867838,0.000009303949,0.0000014914746,0.0000054885695,0.0000119925335,0.9885041,0.0010768748,0.0027504566,0.0034537883,0.000117026146],"about_ca_topic_score_codex":0.00008805806,"about_ca_topic_score_gemma":0.000049373935,"teacher_disagreement_score":0.977689,"about_ca_system_score_codex":0.000029262901,"about_ca_system_score_gemma":0.000013511887,"threshold_uncertainty_score":0.28224808},"labels":[],"label_agreement":null},{"id":"W2547679913","doi":"10.1145/2950290.2950330","title":"SMT-based verification of parameterized systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":43,"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 Waterloo","funders":"European Research Council; U.S. Department of Defense","keywords":"Parameterized complexity; Decidability; Computer science; Modulo; Satisfiability; Reduction (mathematics); Satisfiability modulo theories; Horn clause; Theoretical computer science; Model checking; Algorithm; Formal verification; Automated theorem proving; Boolean satisfiability problem; Invariant (physics); Programming language; Mathematics; Discrete mathematics; Prolog","score_opus":0.03274884067065573,"score_gpt":0.2694360252140056,"score_spread":0.2366871845433499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547679913","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.01621732,0.000016638807,0.9810456,0.00020423546,0.00038168786,0.00013969571,0.0000014598711,0.00013108482,0.0018622592],"genre_scores_gemma":[0.5459704,0.0000020319196,0.453829,0.000021487187,0.00000767892,0.000019408992,3.3992092e-7,0.0000025470638,0.00014711125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991405,0.0001327776,0.00024949503,0.00018931422,0.00017916148,0.000108727414],"domain_scores_gemma":[0.9988506,0.00013218202,0.00014908594,0.0007317771,0.00010109702,0.00003527811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005384616,0.00006128988,0.00010623281,0.00007187345,0.000021327525,0.000027159764,0.00051565445,0.000041785446,0.0000133432095],"category_scores_gemma":[0.00015881968,0.000038146885,0.000033049513,0.00020720874,0.00004413812,0.00031979522,0.000030791554,0.000019106987,0.00005945655],"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.000015811342,0.000043375436,0.0002706662,0.00003116225,0.00000607762,2.6223472e-7,0.000039832117,0.000044653185,0.29774463,0.63873374,0.00014241689,0.062927336],"study_design_scores_gemma":[0.00086897536,0.00018564974,0.008179342,0.00008605856,0.000005472344,0.00000369751,0.000012584919,0.281268,0.70252645,0.0014814505,0.0051548574,0.00022747123],"about_ca_topic_score_codex":0.000016238047,"about_ca_topic_score_gemma":1.4745243e-7,"teacher_disagreement_score":0.63725233,"about_ca_system_score_codex":0.00002898627,"about_ca_system_score_gemma":0.000037081547,"threshold_uncertainty_score":0.15555848},"labels":[],"label_agreement":null},{"id":"W2549874460","doi":"10.1002/9780470522622.ch13","title":"Design Verification with State Invariants","year":2009,"lang":"en","type":"other","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Invariant (physics); State (computer science); Computer science; Programming language; Theoretical computer science; Mathematics; Mathematical physics","score_opus":0.034544723864442455,"score_gpt":0.26588815519587394,"score_spread":0.23134343133143148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549874460","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":[1.1631191e-7,0.000034339773,0.6196616,0.000028151966,0.00010960342,0.00023481337,5.306649e-7,0.00041500977,0.3795158],"genre_scores_gemma":[0.000011427762,0.00003052507,0.70535874,0.00016363485,0.000030407497,0.000009566056,0.0000032333203,0.00006946249,0.294323],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998833,0.00012044455,0.00015933102,0.00040275548,0.00028132234,0.00020313988],"domain_scores_gemma":[0.998692,0.00002482453,0.00022162031,0.0009604501,0.000040755247,0.00006038197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005698799,0.00018054104,0.00015239838,0.00025253824,0.000027971979,0.000101692516,0.00084437436,0.00013453519,0.00014745291],"category_scores_gemma":[0.000018962226,0.00014063503,0.000015400392,0.00037770745,0.000031478437,0.0002061757,0.000036731948,0.00012376593,0.00036016264],"study_design_candidate":"not_applicable","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.00003111846,0.00009002486,0.000005245164,0.00003570599,0.000048346068,0.000016898179,0.00028279665,0.00010341003,0.00026173255,0.16328321,0.35543612,0.48040542],"study_design_scores_gemma":[0.0008120743,0.00074324146,0.0011420229,0.0002951643,0.0000270435,0.00005259113,0.000011523986,0.056133367,0.01337026,0.0067857774,0.91910356,0.0015233576],"about_ca_topic_score_codex":0.00004388069,"about_ca_topic_score_gemma":0.00001076518,"teacher_disagreement_score":0.5636675,"about_ca_system_score_codex":0.000039845807,"about_ca_system_score_gemma":0.000090556765,"threshold_uncertainty_score":0.57349306},"labels":[],"label_agreement":null},{"id":"W2555545605","doi":"10.1007/978-3-319-48989-6_41","title":"Finite Model Finding Using the Logic of Equality with Uninterpreted Functions","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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; Scope (computer science); Decidability; Range (aeronautics); First-order logic; Theoretical computer science; Set (abstract data type); Programming language; Algorithm","score_opus":0.08757135658462582,"score_gpt":0.3201194808364773,"score_spread":0.23254812425185145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555545605","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.00010070364,0.00006832585,0.9955222,0.00024910294,0.0006775202,0.00030106495,0.000010852098,0.000080141814,0.0029900915],"genre_scores_gemma":[0.18882181,0.0000055674686,0.8105055,0.00034524605,0.00008031435,0.0000049383734,9.358373e-7,0.000017105694,0.00021855427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725235,0.00010009989,0.00051167596,0.0009181091,0.0007865213,0.0004312247],"domain_scores_gemma":[0.99654603,0.0007653916,0.0005578078,0.0017129269,0.0003431954,0.0000746555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001674983,0.00035382525,0.00037376737,0.00048397193,0.0003048884,0.00018612097,0.0029321823,0.00020531371,0.000008530318],"category_scores_gemma":[0.00015429898,0.0002083098,0.00009495075,0.00066388363,0.0012410183,0.00064334425,0.0009326049,0.00054342713,0.0000059442614],"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.000015886264,0.000014481616,0.000029246645,0.000031817,0.000018354429,0.0000039216943,0.00096922985,0.66690344,0.0007743135,0.21530992,0.0000012942797,0.11592812],"study_design_scores_gemma":[0.00010338081,0.000102208556,0.000015471212,0.00039615203,0.00001176884,0.000023463945,2.875885e-7,0.88431233,0.0015449359,0.11319859,0.000027851438,0.0002635566],"about_ca_topic_score_codex":0.000010293865,"about_ca_topic_score_gemma":0.000013656105,"teacher_disagreement_score":0.21740893,"about_ca_system_score_codex":0.00027251485,"about_ca_system_score_gemma":0.0005541306,"threshold_uncertainty_score":0.8494627},"labels":[],"label_agreement":null},{"id":"W2556118493","doi":"","title":"Depth-based Local Search Heuristics for Boolean Circuit Satisfiability","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"York University","funders":"","keywords":"Heuristics; Boolean satisfiability problem; Heuristic; Satisfiability; Completeness (order theory); Local search (optimization); Maximum satisfiability problem; Computer science; Algorithm; Theoretical computer science; Variable (mathematics); Mathematical optimization; Mathematics; Boolean function","score_opus":0.05270903099005436,"score_gpt":0.32901280176796177,"score_spread":0.2763037707779074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556118493","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.010136659,0.0000022192303,0.9839016,0.00033113954,0.0005968562,0.0003439952,0.0000041257877,0.00020926869,0.0044741146],"genre_scores_gemma":[0.49565366,1.16882894e-7,0.5040432,0.00016346246,0.000035710393,0.000020598585,0.0000018865873,0.0000049642963,0.00007636514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987731,0.00008566088,0.00022672443,0.00036535668,0.0002622457,0.00028693595],"domain_scores_gemma":[0.9982934,0.00037691795,0.00004249018,0.00096428307,0.00020254361,0.00012033942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015132497,0.000100134865,0.00011170077,0.00005879557,0.0001234222,0.00010249665,0.0008321461,0.00009621273,0.000040504845],"category_scores_gemma":[0.00052403176,0.00009220984,0.000060395236,0.00020847293,0.0001690694,0.00021397579,0.00008937049,0.00023508334,0.00004936814],"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.000006419794,0.00006021477,0.0028530345,0.00003637476,0.000002734561,5.059076e-7,0.000054960972,0.00024877297,0.002339576,0.68602365,0.0002920412,0.30808172],"study_design_scores_gemma":[0.00028076203,0.000110639405,0.018556636,0.0000027986387,0.0000031739855,0.0000034150676,0.00001206214,0.9172728,0.045073967,0.013081375,0.0054298593,0.00017248205],"about_ca_topic_score_codex":0.00003828757,"about_ca_topic_score_gemma":0.000070085036,"teacher_disagreement_score":0.9170241,"about_ca_system_score_codex":0.00004011458,"about_ca_system_score_gemma":0.00016093224,"threshold_uncertainty_score":0.37602082},"labels":[],"label_agreement":null},{"id":"W2560178783","doi":"10.1007/978-3-319-47307-9_7","title":"Analysis and Implementation of Embedded System Models: Example of Tags in Item Management Application","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Executable; Probabilistic logic; Automaton; Collision; Theoretical computer science; Statistical model; Programming language; Artificial intelligence","score_opus":0.03318738944413976,"score_gpt":0.2961052659761246,"score_spread":0.26291787653198484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560178783","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.00018641101,0.000044790646,0.8599973,0.000009213025,0.000027539369,0.0005190595,0.000012187714,0.000033949524,0.13916956],"genre_scores_gemma":[0.27607954,0.00018418465,0.7122512,0.000014155254,0.000016410713,0.00013377854,0.00003579447,0.000022441467,0.011262518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983624,0.00004128029,0.0007260463,0.00044149312,0.0003186614,0.00011012452],"domain_scores_gemma":[0.99829984,0.00006334147,0.00067256734,0.00081830105,0.000115731236,0.000030206602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007259261,0.00015667533,0.00038495392,0.0007684066,0.000016787028,0.000015768992,0.00042202577,0.000101668935,0.00001506728],"category_scores_gemma":[0.0000018389813,0.0001359548,0.00008088901,0.00022580367,0.000034973647,0.00030577573,0.0001977981,0.000045949488,0.0000027963345],"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.000003185534,0.0000050053163,0.00008621872,0.00025063966,0.00013263845,2.3837521e-7,0.00019935612,0.00006286706,0.00009041319,0.9000695,0.0000033856,0.09909657],"study_design_scores_gemma":[0.0017069287,0.00021021362,0.0078082914,0.0006293631,0.0011784938,0.000005553439,0.00091514236,0.83518183,0.010138717,0.1392866,0.0018347783,0.0011040817],"about_ca_topic_score_codex":0.0002669542,"about_ca_topic_score_gemma":0.00008719477,"teacher_disagreement_score":0.83511895,"about_ca_system_score_codex":0.000112170455,"about_ca_system_score_gemma":0.000016908421,"threshold_uncertainty_score":0.5544076},"labels":[],"label_agreement":null},{"id":"W2562025441","doi":"","title":"Simulation-Based Verification of Avionic Systems Deployed on IMA Architectures","year":2015,"lang":"fr","type":"preprint","venue":"Espace ÉTS (ETS)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Concordia University; École de Technologie Supérieure","funders":"","keywords":"Avionics; Integrated modular avionics; DEVS; Computer science; Embedded system; Modular design; Ethernet; Formal verification; FlexRay; Event (particle physics); Systems engineering; Model checking; Software engineering; Computer architecture; Modeling and simulation; Engineering; Operating system; Automotive industry; Simulation; Programming language","score_opus":0.058753216034119,"score_gpt":0.32931230190520866,"score_spread":0.2705590858710897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562025441","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.098246165,0.0011833542,0.8901528,0.0012117545,0.0058823708,0.0018381119,0.00007887833,0.00033480598,0.0010717524],"genre_scores_gemma":[0.8438866,0.00001645914,0.15430336,0.00009043184,0.00037004348,0.00017863017,0.000075746335,0.00007731112,0.0010014179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933268,0.0019299409,0.0012195482,0.0014338458,0.0014536353,0.0006362235],"domain_scores_gemma":[0.99146926,0.0017758544,0.0017881808,0.003373678,0.001262335,0.00033071486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031383426,0.0007177905,0.00086778146,0.0005744367,0.00021660775,0.00036633862,0.0020701764,0.0007308179,0.000028804103],"category_scores_gemma":[0.0031424358,0.00074407173,0.0003067664,0.0008866558,0.00034854104,0.00025503838,0.00043072822,0.0010696873,0.00030645813],"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.00022066558,0.0002595587,0.00037776263,0.00046075883,0.000051635703,0.000004631538,0.0020213767,0.91321295,0.0007869844,0.07166491,0.00022288699,0.010715903],"study_design_scores_gemma":[0.000681935,0.00036641394,0.008194126,0.0010020902,0.000075448515,0.0000041680614,0.000076477765,0.9745172,0.0055289585,0.0017179865,0.0071798414,0.000655321],"about_ca_topic_score_codex":0.00043479697,"about_ca_topic_score_gemma":0.000022830882,"teacher_disagreement_score":0.74564046,"about_ca_system_score_codex":0.00080357795,"about_ca_system_score_gemma":0.0011037528,"threshold_uncertainty_score":0.99950105},"labels":[],"label_agreement":null},{"id":"W2563503795","doi":"10.1109/cdc.1992.371016","title":"Equivalence preserving transformations for timed transition models","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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":"","keywords":"Equivalence (formal languages); Computer science; Set (abstract data type); Software; Theoretical computer science; Transition system; Algebra over a field; Programming language; Algorithm; Discrete mathematics; Mathematics; Pure mathematics","score_opus":0.06651413722898313,"score_gpt":0.31457798135152515,"score_spread":0.248063844122542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563503795","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.00055920647,0.00003093963,0.9828263,0.003058902,0.00007768716,0.00038825013,0.000004269642,0.00025865468,0.012795817],"genre_scores_gemma":[0.1986492,0.000010540681,0.80064714,0.0002997275,0.000039486007,0.0000988249,0.0000040097784,0.0000043671043,0.0002467217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921834,0.000036527876,0.00021786873,0.00017904442,0.00015714059,0.0001910509],"domain_scores_gemma":[0.9994371,0.000049760092,0.000036002708,0.0003394841,0.0000877947,0.000049858052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004657891,0.000073808,0.000071814764,0.00006979448,0.00012956523,0.00007696172,0.0005607083,0.000043865028,0.000021837228],"category_scores_gemma":[0.000019964866,0.00007026149,0.000055274522,0.00018557071,0.000012750554,0.0034997398,0.000020686102,0.000050006172,0.000023876779],"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.000008168558,0.00004790817,2.5851884e-7,0.000040677827,0.0000058730716,5.3049913e-8,0.0034754938,0.062412694,0.002686959,0.7786078,0.0007811135,0.15193303],"study_design_scores_gemma":[0.00018582726,0.00003047921,0.000012721127,0.000008455218,0.0000035265844,0.0000029896921,0.000026607506,0.9540699,0.018330384,0.025411675,0.0018251986,0.00009220865],"about_ca_topic_score_codex":0.0000043264354,"about_ca_topic_score_gemma":0.0000038868798,"teacher_disagreement_score":0.89165723,"about_ca_system_score_codex":0.00003673389,"about_ca_system_score_gemma":0.00002668748,"threshold_uncertainty_score":0.28651807},"labels":[],"label_agreement":null},{"id":"W2564001612","doi":"10.1609/aaai.v30i1.10439","title":"Exponential Recency Weighted Average Branching Heuristic for SAT Solvers","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":67,"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 Waterloo","funders":"","keywords":"Heuristics; Heuristic; Branching (polymer chemistry); Computer science; Hash function; Benchmark (surveying); Exponential function; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.08381016544744409,"score_gpt":0.3122846525582125,"score_spread":0.22847448711076845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564001612","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.07726159,0.000011922971,0.9155826,0.0022491922,0.0013528161,0.0006403895,0.000010504745,0.0001362975,0.0027547076],"genre_scores_gemma":[0.90244,0.000034702356,0.096994005,0.000102403814,0.00010947709,0.000061010247,4.53861e-7,0.000015520813,0.0002424225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978335,0.000034510682,0.0006399674,0.00059076736,0.00047215284,0.00042911898],"domain_scores_gemma":[0.99806446,0.00024990877,0.00051012816,0.0004269795,0.0006523883,0.000096159485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095630885,0.0002378123,0.00025891772,0.00014617687,0.00028305926,0.00019183244,0.0022749824,0.000109177556,0.000054271546],"category_scores_gemma":[0.0012450583,0.00015256373,0.00016210899,0.00045838693,0.0002553274,0.0008173132,0.00029485158,0.00017495757,0.000088174216],"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.00011547469,0.000062601815,0.000049497365,0.0000328668,0.000010042331,1.1592117e-7,0.0007277313,0.0000041067387,0.11859793,0.7277162,0.00009584659,0.15258756],"study_design_scores_gemma":[0.000058519872,0.00021710721,0.0001055122,0.0002576196,0.0000099522995,0.0000029706584,0.00007432081,0.041505847,0.6860037,0.27127227,0.00027175352,0.00022048186],"about_ca_topic_score_codex":0.000011479913,"about_ca_topic_score_gemma":0.0000026936204,"teacher_disagreement_score":0.82517844,"about_ca_system_score_codex":0.00008354054,"about_ca_system_score_gemma":0.0000905465,"threshold_uncertainty_score":0.6221369},"labels":[],"label_agreement":null},{"id":"W2564348232","doi":"","title":"Path graphs and pr-trees","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"","keywords":"Tree (set theory); Path (computing); Mathematics; Combinatorics; Ackermann function; K-ary tree; Inverse; Gomory–Hu tree; Graph; Discrete mathematics; Tree structure; Binary tree; Computer science","score_opus":0.020940457298664183,"score_gpt":0.2979886627635859,"score_spread":0.2770482054649217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564348232","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.14900608,0.005300781,0.5005592,0.00009899042,0.0073033986,0.0009020172,0.0000060705033,0.0011651363,0.33565828],"genre_scores_gemma":[0.070993505,0.00015858878,0.9149898,0.000090179245,0.000052532563,0.000046551846,0.000076545046,0.000018050374,0.013574214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99917686,0.000047623926,0.00016197437,0.00026041098,0.00018628773,0.00016682426],"domain_scores_gemma":[0.99930036,0.000038382204,0.000113574926,0.00042107346,0.000059395912,0.000067223125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028338432,0.00013902568,0.00012872354,0.00011508939,0.00006596737,0.00009539999,0.00043372603,0.00015507326,0.000030078554],"category_scores_gemma":[0.000056632554,0.00011850097,0.000035172394,0.0001715275,0.000014931684,0.00049845694,0.000043178577,0.00013208138,0.000048276142],"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.000003726973,0.000023355296,0.00046517304,0.000083523075,0.000010786037,4.0289197e-7,0.001591665,1.3849511e-7,0.00069060613,0.8300288,0.0008764768,0.16622536],"study_design_scores_gemma":[0.00046550302,0.00024309139,0.8187986,0.00026692197,0.00008808567,0.00003740162,0.0013682285,0.012430357,0.025631329,0.110479064,0.028347947,0.0018434384],"about_ca_topic_score_codex":0.000027817354,"about_ca_topic_score_gemma":0.00003891077,"teacher_disagreement_score":0.81833345,"about_ca_system_score_codex":0.0000109977655,"about_ca_system_score_gemma":0.000026668833,"threshold_uncertainty_score":0.48323295},"labels":[],"label_agreement":null},{"id":"W2569788251","doi":"10.1287/moor.2014.0699","title":"The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes","year":2015,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":20,"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 Waterloo","funders":"","keywords":"Mathematics; Simplex; Bounded function; Markov decision process; Combinatorics; Discounting; Polynomial; Simplex algorithm; Mathematical optimization; Markov chain; Discrete mathematics; Binary logarithm; Time complexity; Markov process; Applied mathematics; Linear programming; Statistics","score_opus":0.2552575597432615,"score_gpt":0.5082352828044298,"score_spread":0.2529777230611683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569788251","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.0050202548,0.00007648736,0.9924088,0.0005884788,0.00011465623,0.0008112429,0.00001639203,0.000026158541,0.00093753816],"genre_scores_gemma":[0.03839941,0.0000135040245,0.9606198,0.000012562594,0.00005235116,0.0002729661,0.0000024301994,0.000012851962,0.0006140993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978652,0.00024453716,0.0004846682,0.00024971578,0.000832922,0.0003229695],"domain_scores_gemma":[0.9937404,0.003072634,0.0000650052,0.0009372036,0.0020766011,0.00010820436],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.007239034,0.0000983966,0.00016406015,0.00016697934,0.00056915794,0.00050325826,0.0015452853,0.000060721664,0.0000061431733],"category_scores_gemma":[0.0120186955,0.00006790041,0.000043805572,0.00066982553,0.00015321966,0.00041305894,0.00034866147,0.00014865617,0.000021905638],"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.0001497949,0.0006411665,0.000016828908,0.0006707664,0.00007129089,0.0000018315861,0.017790833,0.0055444636,0.002828113,0.5549508,0.028148534,0.38918558],"study_design_scores_gemma":[0.000284503,0.00026142504,0.000013347498,0.000034238838,0.0000051725415,0.00000845213,0.0007118722,0.95528865,0.013962923,0.022725716,0.0066123693,0.00009133149],"about_ca_topic_score_codex":0.000015532107,"about_ca_topic_score_gemma":0.00003230782,"teacher_disagreement_score":0.94974416,"about_ca_system_score_codex":0.00007477463,"about_ca_system_score_gemma":0.000763313,"threshold_uncertainty_score":0.9963035},"labels":[],"label_agreement":null},{"id":"W2570756997","doi":"10.1109/cdc.2016.7799252","title":"An interval analysis approach to invariance control synthesis for discrete-time switched systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"University of Waterloo","keywords":"Computer science; Formal verification; Abstraction; Spurious relationship; Invariant (physics); Interval arithmetic; Quantifier elimination; Controller (irrigation); Partition (number theory); Interval (graph theory); Set (abstract data type); Algorithm; Theoretical computer science; Mathematics; Programming language","score_opus":0.026359367030936307,"score_gpt":0.288543296290922,"score_spread":0.2621839292599857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570756997","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.0017985468,0.00000788623,0.9949215,0.0004583808,0.0001552252,0.0006262414,0.000020434421,0.0002156205,0.0017961387],"genre_scores_gemma":[0.5156066,3.0093747e-7,0.483555,0.000094197436,0.00004062109,0.00034550403,9.62423e-7,0.0000067348005,0.00035011154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821997,0.0002850934,0.0003623143,0.0005982894,0.00023131375,0.00030304352],"domain_scores_gemma":[0.9978932,0.00044267255,0.00013397289,0.0012020082,0.00014960469,0.00017852845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016581233,0.00015415851,0.0003827889,0.00022720541,0.00007991881,0.00022609938,0.0014268468,0.00007269187,0.000012407065],"category_scores_gemma":[0.0005158095,0.00009574478,0.00014647483,0.0007074857,0.00002877289,0.0008868822,0.000078926074,0.000032919623,0.00007494185],"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.00024905623,0.00037990106,0.0012836042,0.00009319887,0.0012078276,9.506731e-7,0.0009769347,0.007362045,0.08777694,0.8135585,0.0007877082,0.086323306],"study_design_scores_gemma":[0.00026054247,0.00010540625,0.0014410182,0.000016637932,0.000114757,0.000001837841,0.000031732092,0.99109626,0.0060938867,0.00030477514,0.00031073217,0.00022239983],"about_ca_topic_score_codex":0.000045196455,"about_ca_topic_score_gemma":0.000002671104,"teacher_disagreement_score":0.98373425,"about_ca_system_score_codex":0.00008292573,"about_ca_system_score_gemma":0.000027940821,"threshold_uncertainty_score":0.39043587},"labels":[],"label_agreement":null},{"id":"W2571456196","doi":"10.48550/arxiv.1103.4342","title":"MDP Optimal Control under Temporal Logic Constraints","year":2011,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Waterloo","funders":"Air Force Office of Scientific Research; Army Research Office; Office of Naval Research; Multidisciplinary University Research Initiative; National Science Foundation","keywords":"Markov decision process; Temporal logic; Dynamic programming; Linear temporal logic; Mathematical optimization; Computer science; Set (abstract data type); Optimal control; Proposition; Control (management); Process (computing); Partially observable Markov decision process; Markov process; Mathematics; Artificial intelligence; Algorithm; Theoretical computer science","score_opus":0.1593707195394043,"score_gpt":0.20796651172556252,"score_spread":0.048595792186158226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571456196","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.07656821,0.000007456574,0.9096505,0.000025611445,0.00024347274,0.00013048147,0.0000026178316,0.00019025293,0.013181386],"genre_scores_gemma":[0.84850925,0.0000034893546,0.15093087,0.0002149492,0.000016431848,3.9310606e-7,8.6019554e-7,0.0000056665035,0.00031808674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988767,0.00015548564,0.00015809147,0.000462644,0.000062354404,0.00028473831],"domain_scores_gemma":[0.99900466,0.000046818408,0.0001298183,0.0005954908,0.000092717506,0.00013047381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037647632,0.00013950028,0.00014842,0.00011535235,0.000118749,0.000033015745,0.0009743356,0.00009712502,0.00015669256],"category_scores_gemma":[0.00003617051,0.00014831281,0.00007981573,0.00043210227,0.00029299478,0.00073049474,0.0001434883,0.00015434442,0.00025206647],"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.000026934504,0.00006376037,0.006439771,0.0000039177557,0.000019525154,0.00007803374,0.00013202782,0.0027705934,0.0000924693,0.989524,0.000036830872,0.0008121065],"study_design_scores_gemma":[0.002460956,0.00039965406,0.033761058,0.000018282626,0.000061373175,0.00006278857,0.00046021576,0.8576227,0.0020840967,0.10179958,0.00048561292,0.0007836938],"about_ca_topic_score_codex":0.000036992646,"about_ca_topic_score_gemma":0.0000034280472,"teacher_disagreement_score":0.88772446,"about_ca_system_score_codex":0.00007271831,"about_ca_system_score_gemma":0.000058780948,"threshold_uncertainty_score":0.6048021},"labels":[],"label_agreement":null},{"id":"W2571905942","doi":"","title":"Infinite paths in the situation calculus: axiomatization and properties","year":2016,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Correctness; sort; Situation calculus; Formalism (music); Computer science; Calculus (dental); Futures contract; Natural deduction; Theoretical computer science; Mathematics; Algorithm; Artificial intelligence; Programming language","score_opus":0.06647694693038328,"score_gpt":0.31551713390056374,"score_spread":0.24904018697018046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571905942","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56531,0.00055850676,0.4309347,0.00045481249,0.00008104699,0.00025036695,4.838744e-7,0.00003449044,0.0023756209],"genre_scores_gemma":[0.96469414,0.00024708576,0.03491967,0.000011540309,0.000018104014,0.0000280547,9.773065e-7,0.0000035862238,0.00007686436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990674,0.00025972325,0.0002512135,0.00019268095,0.0001375724,0.00009141023],"domain_scores_gemma":[0.9993029,0.00020206849,0.00014318034,0.00022372791,0.00010381621,0.000024275452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008576464,0.000068534035,0.00009144221,0.00011820136,0.000082156024,0.000056395933,0.00017975492,0.000036981488,0.0000010166391],"category_scores_gemma":[0.0009221471,0.00003852619,0.000014796858,0.00029250325,0.00008542586,0.0006006441,0.00011568826,0.000038155526,0.000001990117],"study_design_candidate":"observational","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.000020931991,0.000077723365,0.052083574,0.00012902047,0.000011754196,0.0000011182257,0.039660703,0.000064848304,0.03048227,0.45683798,0.0000090017575,0.4206211],"study_design_scores_gemma":[0.0008849167,0.0000795777,0.55936277,0.00061382685,0.000011770536,0.000041172083,0.0014908551,0.3988907,0.035667438,0.0018264682,0.0009105248,0.0002199515],"about_ca_topic_score_codex":0.000018566156,"about_ca_topic_score_gemma":0.00002003526,"teacher_disagreement_score":0.5072792,"about_ca_system_score_codex":0.000018274326,"about_ca_system_score_gemma":0.000027456652,"threshold_uncertainty_score":0.15710524},"labels":[],"label_agreement":null},{"id":"W2572095861","doi":"","title":"Semidefinite resolution and exactness of semidefinite relaxations for satisfiability","year":2011,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Formal Methods in Verification","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Semidefinite embedding; Semidefinite programming; Satisfiability; Mathematics; Transformation (genetics); Quadratically constrained quadratic program; Resolution (logic); Discrete mathematics; Mathematical optimization; Computer science; Quadratic programming","score_opus":0.03627239038286461,"score_gpt":0.26106580801805335,"score_spread":0.22479341763518873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572095861","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.044706445,0.0003330164,0.9522652,0.0003023157,0.00013051003,0.00078617106,0.00004267108,0.00039584114,0.0010378428],"genre_scores_gemma":[0.3823088,0.00007183918,0.6170043,0.0001549014,0.000016327465,0.0003592161,0.0000071870077,0.00001640679,0.00006104471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796855,0.00023696055,0.0006306417,0.00049746555,0.00024422773,0.000422161],"domain_scores_gemma":[0.9975166,0.00035460823,0.0004682381,0.0012285778,0.00026837076,0.00016360304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018668128,0.00021940943,0.0003024871,0.00034199638,0.00021751852,0.00006499125,0.00065807824,0.00023561002,0.000006327441],"category_scores_gemma":[0.0012129479,0.00022958695,0.000108117805,0.00063347834,0.00017525895,0.0008594821,0.00026587592,0.00021513511,0.00000257765],"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.00007851344,0.00016225516,0.025670946,0.000110789144,0.000023980394,0.0000014976525,0.0014632946,0.0002636853,0.0054534785,0.93051684,0.0001920063,0.03606271],"study_design_scores_gemma":[0.0006066124,0.00038641522,0.29824242,0.00009012555,0.000042135303,0.000059845665,0.00008561195,0.5257694,0.055929337,0.11735565,0.0009324965,0.000499934],"about_ca_topic_score_codex":0.001919551,"about_ca_topic_score_gemma":0.00026084777,"teacher_disagreement_score":0.8131612,"about_ca_system_score_codex":0.00017029217,"about_ca_system_score_gemma":0.0001442209,"threshold_uncertainty_score":0.9362284},"labels":[],"label_agreement":null},{"id":"W2572265446","doi":"10.1109/candar.2016.0087","title":"How to Speed Up CUDA-WSat-PcL by 5x","year":2016,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Simon Fraser University","funders":"","keywords":"CUDA; Computer science; Parallel computing; Speedup; Graphics processing unit; General-purpose computing on graphics processing units; Graphics; Computer graphics (images)","score_opus":0.03465887984380847,"score_gpt":0.2897523237724636,"score_spread":0.2550934439286552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572265446","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.0036377534,0.00001251886,0.97543025,0.009272856,0.0007464674,0.00012286795,0.000002275359,0.00022121581,0.010553802],"genre_scores_gemma":[0.089339666,0.000004845471,0.85251325,0.0009980348,0.000053498192,0.0000074004784,4.6318783e-7,0.000007807704,0.057075042],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99906945,0.000058537502,0.000113020564,0.00030767915,0.00022204152,0.00022924505],"domain_scores_gemma":[0.99900514,0.00006229278,0.000041333904,0.00070354115,0.000065876164,0.00012182517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003481655,0.00008974709,0.00008585393,0.000057542646,0.00004629134,0.00015842824,0.0008877489,0.000043795062,0.00006191853],"category_scores_gemma":[0.00023237462,0.000056278124,0.000030012077,0.00025698173,0.000024544415,0.0007360356,0.0002004086,0.000036909452,0.00068469724],"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.0000060692637,0.000023089939,0.00014697434,0.0000048532397,0.000005878316,9.744938e-7,0.00023157983,7.840755e-7,0.15198551,0.28793848,0.0994247,0.4602311],"study_design_scores_gemma":[0.00040824703,0.00015986283,0.0022215196,0.000026658903,0.0000024770698,0.000009618876,0.00003204726,0.0046119117,0.51017654,0.0050998805,0.47687575,0.0003754515],"about_ca_topic_score_codex":0.000012156683,"about_ca_topic_score_gemma":0.0000016411088,"teacher_disagreement_score":0.45985565,"about_ca_system_score_codex":0.00004654319,"about_ca_system_score_gemma":0.00001837737,"threshold_uncertainty_score":0.8800626},"labels":[],"label_agreement":null},{"id":"W2574291663","doi":"10.1007/978-3-319-52234-0_28","title":"IC3 - Flipping the E in ICE","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Computer science; Invariant (physics); Extension (predicate logic); Key (lock); Model checking; Theoretical computer science; Focus (optics); Algorithm; Artificial intelligence; Programming language; Mathematics","score_opus":0.04088450634873628,"score_gpt":0.3010576536049343,"score_spread":0.260173147256198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574291663","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.000045133114,0.00037792663,0.9815868,0.0012073116,0.0028496995,0.00040540876,0.0000013182905,0.00009522704,0.013431155],"genre_scores_gemma":[0.042621996,0.000073458905,0.9544427,0.0015720229,0.00055321073,0.000020150854,0.0000014856455,0.000031228425,0.0006837674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651486,0.00008750007,0.0005196319,0.0013103117,0.00092416356,0.0006435574],"domain_scores_gemma":[0.9955535,0.0005312556,0.00045875792,0.0032047506,0.00015905849,0.00009270422],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0030877474,0.00041659828,0.00040849202,0.00062853337,0.00051559316,0.0009948926,0.008761573,0.00029653148,0.000009856589],"category_scores_gemma":[0.0004779585,0.00031705407,0.000099627156,0.00037011201,0.0010219525,0.0011170289,0.0019853923,0.0012018626,0.000063941065],"study_design_candidate":"design_other","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.0000030103552,0.000011851905,0.000058864796,0.000022825672,0.0000037797047,0.000038155416,0.0011357802,0.010558343,0.00007814581,0.099452004,0.000012028012,0.8886252],"study_design_scores_gemma":[0.00019935892,0.000076210126,0.0015030911,0.0005345615,0.000004272988,0.00007869255,2.3688604e-7,0.7615903,0.0010742547,0.22636071,0.007944506,0.00063382316],"about_ca_topic_score_codex":0.00006208447,"about_ca_topic_score_gemma":0.00020406417,"teacher_disagreement_score":0.88799137,"about_ca_system_score_codex":0.00034025963,"about_ca_system_score_gemma":0.00046675248,"threshold_uncertainty_score":0.9999282},"labels":[],"label_agreement":null},{"id":"W2580401938","doi":"10.29007/vz48","title":"Proving uniformity and independence by self-composition and coupling","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Horizon 2020 Framework Programme; European Commission; Simons Foundation; National Science Foundation","keywords":"Mathematical proof; Probabilistic logic; Computer science; Theoretical computer science; Probabilistic CTL; Probabilistic argumentation; Independence (probability theory); Markov chain; Abstraction; Probabilistic relevance model; Proof assistant; Programming language; Mathematics; Probabilistic analysis of algorithms; Artificial intelligence; Machine learning","score_opus":0.011702104608956926,"score_gpt":0.27000418668284665,"score_spread":0.2583020820738897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2580401938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59698284,0.000093493196,0.4020767,0.00008351073,0.00021361889,0.00010013536,2.717383e-7,0.00012278942,0.00032662298],"genre_scores_gemma":[0.6143087,0.0000106764855,0.38557282,0.00005135009,0.00004656872,0.0000015718185,5.1471704e-7,0.000003758702,0.0000040432146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989763,0.000060265,0.00023607953,0.0003461456,0.00015875144,0.00022249705],"domain_scores_gemma":[0.99942976,0.000111651934,0.000114108756,0.00023534695,0.00006233204,0.000046820835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010673611,0.00010750129,0.00012290456,0.00007293219,0.00027567113,0.00017151503,0.00028139673,0.00007035015,0.000001230979],"category_scores_gemma":[0.00008727968,0.000114634386,0.000008252819,0.00026175377,0.00013065035,0.0009174157,0.00040761312,0.00017950629,0.000001817701],"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.000071239665,0.00019755737,0.21652618,0.0005109223,0.000043291726,0.000029994559,0.031144833,0.0006179074,0.02191416,0.26871213,0.00013246034,0.4600993],"study_design_scores_gemma":[0.00024229118,0.00013411415,0.030382717,0.000108192995,0.000002855627,0.00012487739,0.00018258549,0.94910216,0.016316481,0.0029665704,0.00020269089,0.00023448396],"about_ca_topic_score_codex":0.000035315454,"about_ca_topic_score_gemma":0.000006027617,"teacher_disagreement_score":0.94848424,"about_ca_system_score_codex":0.00005464529,"about_ca_system_score_gemma":0.000026719283,"threshold_uncertainty_score":0.46746546},"labels":[],"label_agreement":null},{"id":"W2580735446","doi":"10.3233/sat190111","title":"Hard satisfiable 3-SAT instances via autocorrelation","year":2016,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"Formal Methods in Verification","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":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Autocorrelation; Boolean satisfiability problem; Reduction (mathematics); Satisfiability; Computer science; Mathematics; Combinatorics; Algorithm; Statistics","score_opus":0.03937523132885755,"score_gpt":0.2920864361888223,"score_spread":0.25271120485996473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2580735446","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.27408552,0.000052744042,0.7241929,0.0006630735,0.0004810758,0.0002081059,0.0000013895652,0.00012386883,0.00019133976],"genre_scores_gemma":[0.6514786,0.000038854203,0.34820712,0.00013374706,0.00008358255,0.000012533352,0.0000011672278,0.000009206082,0.00003518798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976899,0.0003891543,0.00066017336,0.0004604818,0.0005283602,0.00027191985],"domain_scores_gemma":[0.9986303,0.0002591109,0.00033352905,0.000342448,0.000272469,0.00016216587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019667386,0.00019993717,0.00023087859,0.00020308926,0.00040832753,0.0002975635,0.0002951189,0.00010559901,0.000007662057],"category_scores_gemma":[0.00027505585,0.00014471685,0.000076010205,0.00023789576,0.000063657746,0.0016724514,0.00006934804,0.00026660642,0.000038398004],"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.00004360751,0.00004633123,0.002713753,0.000016684526,0.000014516946,0.0000018671003,0.00037341725,0.10170863,0.0008182358,0.031904094,0.00004769118,0.8623112],"study_design_scores_gemma":[0.0004570481,0.00020472142,0.010859105,0.00010707509,0.00000692255,0.000048803115,0.000018823941,0.8309575,0.00013397582,0.15692976,0.00009713204,0.0001791366],"about_ca_topic_score_codex":0.000010472021,"about_ca_topic_score_gemma":0.0000021904661,"teacher_disagreement_score":0.862132,"about_ca_system_score_codex":0.00022587142,"about_ca_system_score_gemma":0.00008540383,"threshold_uncertainty_score":0.5901382},"labels":[],"label_agreement":null},{"id":"W2595059463","doi":"10.1007/s00165-017-0424-4","title":"Synthesizing and verifying controllers for multi-lane traffic maneuvers","year":2017,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Deutsche Forschungsgemeinschaft","keywords":"Theory of computation; Interleaving; Controller (irrigation); Computer science; Semantics (computer science); Finite-state machine; State (computer science); Transition system; Distributed computing; Control theory (sociology); Control (management); Control engineering; Real-time computing; Theoretical computer science; Programming language; Artificial intelligence; Engineering","score_opus":0.0643636300957055,"score_gpt":0.3309971874528164,"score_spread":0.2666335573571109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595059463","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.22220641,0.00006474549,0.77559185,0.00008282242,0.00044572324,0.00030489854,0.0000018287672,0.00009818135,0.0012035414],"genre_scores_gemma":[0.55236864,0.0000033777403,0.4475499,0.000017866461,0.0000434181,0.0000029953014,4.3845304e-7,0.0000068707313,0.0000064834458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875253,0.00003894165,0.0003395639,0.00029890155,0.00017641202,0.00039361688],"domain_scores_gemma":[0.99854046,0.00021581218,0.0005178797,0.0005570712,0.00009152568,0.000077264776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018094,0.00015331499,0.00029115667,0.000097933545,0.00080925884,0.00025084577,0.0009532144,0.00006681228,7.971165e-7],"category_scores_gemma":[0.00049218617,0.00015151667,0.000082049846,0.000051980507,0.00011869219,0.0011238991,0.00032971354,0.00011860692,0.000002000569],"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.00009420901,0.000080925034,0.00045527122,0.00037380544,0.00008111532,0.000009382547,0.002627378,0.004825151,0.003077092,0.35368732,0.000020066595,0.6346683],"study_design_scores_gemma":[0.0011998803,0.00013202772,0.010454598,0.00010193553,0.000011862984,0.000019640818,0.0001178869,0.98051125,0.006716677,0.00042235636,0.00012634345,0.00018557227],"about_ca_topic_score_codex":0.000012124459,"about_ca_topic_score_gemma":0.000003660617,"teacher_disagreement_score":0.9756861,"about_ca_system_score_codex":0.000032217562,"about_ca_system_score_gemma":0.000035688907,"threshold_uncertainty_score":0.62242466},"labels":[],"label_agreement":null},{"id":"W2603330110","doi":"10.1007/s00165-017-0426-2","title":"Simulation relations for fault-tolerance","year":2017,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Fondo para la Investigación Científica y Tecnológica","keywords":"Liveness; Fault tolerance; Computer science; Software fault tolerance; Theory of computation; Distributed computing; Fault coverage; Fault model; Relation (database); Fault (geology); Reliability engineering; Theoretical computer science; Algorithm; Data mining; Engineering","score_opus":0.04085635996822392,"score_gpt":0.345178802840271,"score_spread":0.3043224428720471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603330110","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.06653894,0.000016950977,0.92294,0.00011807086,0.0005491838,0.0002603243,0.0000021548344,0.00010267743,0.009471688],"genre_scores_gemma":[0.56135553,2.7701216e-7,0.43851256,0.000014928538,0.00008257635,0.000002682714,0.0000013551968,0.000004541141,0.000025560617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895924,0.00002595341,0.00034654757,0.00021586702,0.00019528304,0.0002571072],"domain_scores_gemma":[0.9980738,0.00026400454,0.0005974659,0.0007757536,0.00024608217,0.00004286338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006832249,0.000099635734,0.0001578255,0.000072302806,0.000852858,0.00016752657,0.0010502246,0.000057610127,0.0000020801122],"category_scores_gemma":[0.00079851516,0.00010245018,0.00008123711,0.0000870937,0.000059081332,0.0019249377,0.0002621223,0.00009325559,0.000011272727],"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.0000069640687,0.000019392795,0.00022952154,0.000026201498,0.000006140987,2.661663e-7,0.0004533065,0.342248,0.00019437597,0.61047965,0.000010946362,0.04632522],"study_design_scores_gemma":[0.0003082851,0.00007184223,0.021387441,0.00004336551,0.0000039716015,0.0000014798796,0.000010606541,0.9557745,0.0044595487,0.017286263,0.0005405072,0.00011217742],"about_ca_topic_score_codex":0.000008978392,"about_ca_topic_score_gemma":0.000001823115,"teacher_disagreement_score":0.6135265,"about_ca_system_score_codex":0.000031611355,"about_ca_system_score_gemma":0.000042810752,"threshold_uncertainty_score":0.65595806},"labels":[],"label_agreement":null},{"id":"W2603469395","doi":"10.1007/s10626-017-0243-z","title":"Augmented finite transition systems as abstractions for control synthesis","year":2017,"lang":"en","type":"article","venue":"Discrete Event Dynamic Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":47,"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":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Realizability; Liveness; Preorder; Transition system; Abstraction; Computer science; Representation (politics); Class (philosophy); Temporal logic; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics","score_opus":0.020220997884108624,"score_gpt":0.3220518371624749,"score_spread":0.30183083927836624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603469395","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.004161236,0.00017609155,0.9873903,0.00058911165,0.0044937306,0.0016632986,0.00023286404,0.0002174906,0.0010759224],"genre_scores_gemma":[0.98954517,0.00001771304,0.008139918,0.00002366634,0.00014318456,0.0014119068,0.000033420114,0.000027016911,0.00065803557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783206,0.00026114713,0.00061586156,0.0005140323,0.00039449363,0.00038239823],"domain_scores_gemma":[0.9970879,0.0004060653,0.0006992479,0.0015039447,0.00017684349,0.00012601058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013421704,0.00023641899,0.00037166083,0.00013363823,0.0008588544,0.00084303773,0.0011818149,0.00014708641,0.000004276025],"category_scores_gemma":[0.0004603596,0.00022229915,0.00020373464,0.00007085148,0.00006927981,0.0011156825,0.000042386506,0.0001238688,0.00010455391],"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.00040992707,0.0004614869,0.00037969407,0.0022241212,0.0011272585,0.00004487676,0.002454233,0.3848588,0.009231047,0.5705798,0.0009383032,0.027290449],"study_design_scores_gemma":[0.00059655844,0.00008630792,0.0014019124,0.00028756176,0.00005953699,0.00003731071,0.00026093735,0.99482757,0.00010846594,0.0003643569,0.0017047127,0.000264799],"about_ca_topic_score_codex":0.0005496756,"about_ca_topic_score_gemma":0.000013315049,"teacher_disagreement_score":0.9853839,"about_ca_system_score_codex":0.00021985245,"about_ca_system_score_gemma":0.0000711528,"threshold_uncertainty_score":0.90650964},"labels":[],"label_agreement":null},{"id":"W2604294253","doi":"10.1109/tac.2017.2692561","title":"Reduction of Distributions: Definitions, Properties, and Applications","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reduction (mathematics); Supervisor; Mathematical proof; Computer science; Decomposition; Theoretical computer science; Substitution (logic); Algorithm; Computational complexity theory; Mathematics; Programming language","score_opus":0.0518757946034491,"score_gpt":0.2755561916350046,"score_spread":0.2236803970315555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604294253","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.0033744827,0.000069448084,0.99448675,0.0005870786,0.00025973577,0.0006433287,0.000042480315,0.00018643813,0.00035027077],"genre_scores_gemma":[0.9003123,0.00005682985,0.09897253,0.000021694617,0.000019389105,0.0005682096,0.0000010897429,0.0000066781613,0.00004126881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989887,0.000088578876,0.00034280634,0.000248258,0.00018537276,0.0001462903],"domain_scores_gemma":[0.99839115,0.00006319058,0.00027643866,0.0010842156,0.00011962904,0.00006538844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003376474,0.00011706248,0.00018206143,0.00011187965,0.00078911375,0.00015636854,0.0004954859,0.00006588203,0.000011575436],"category_scores_gemma":[0.000042435175,0.00010935478,0.00006396427,0.00011885803,0.00021991799,0.0006371256,0.0000032278244,0.000102031416,0.000022937069],"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.00002076557,0.0004278989,0.000014053911,0.00013271857,0.00008781241,5.6610577e-7,0.00027655115,0.00049628894,0.014154524,0.13749863,0.000036590533,0.8468536],"study_design_scores_gemma":[0.0025636717,0.00032323753,0.005493806,0.00025971793,0.00019652757,0.00013657883,0.00010852033,0.86821926,0.10268747,0.01848732,0.000992763,0.000531151],"about_ca_topic_score_codex":0.000030388766,"about_ca_topic_score_gemma":0.0000035989697,"teacher_disagreement_score":0.89693785,"about_ca_system_score_codex":0.000051372965,"about_ca_system_score_gemma":0.00006638448,"threshold_uncertainty_score":0.6069305},"labels":[],"label_agreement":null},{"id":"W2605185012","doi":"10.3233/fi-2017-1519","title":"SMC4AC: A New Symbolic Model Checker for Intelligent Agent Communication","year":2017,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Model checking; Symbolic communication; Semantics (computer science); Autonomous agent; Human–computer interaction; Intelligent agent; Artificial intelligence; Theoretical computer science; Programming language","score_opus":0.1291633609914421,"score_gpt":0.37503862014180495,"score_spread":0.24587525915036285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605185012","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.002834573,0.000048727543,0.9830236,0.00085793703,0.0003368541,0.00077139505,0.000007961128,0.00013917481,0.011979768],"genre_scores_gemma":[0.080304965,0.00007364277,0.9172083,0.00090610393,0.000043177428,0.00016819859,0.000020788504,0.000012722148,0.0012621011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985239,0.000032780816,0.00058652944,0.00019534964,0.00030981287,0.00035166263],"domain_scores_gemma":[0.9962709,0.00003747024,0.00051973504,0.0028794685,0.000107046784,0.00018539267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008622933,0.00018343453,0.00020916369,0.00010024651,0.0007552805,0.0009861343,0.0031155313,0.00008525605,0.000024069543],"category_scores_gemma":[0.00029658238,0.00017382353,0.00011239339,0.00007666966,0.00010493558,0.0027777106,0.0008307997,0.00015270789,0.00026648815],"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.000020755768,0.000070448594,0.00012312832,0.00007513183,0.00004058304,1.4573047e-7,0.00815758,0.000734704,0.00006307736,0.8293892,0.009344355,0.15198089],"study_design_scores_gemma":[0.00043313784,0.000066879235,0.0007440687,0.000053955388,0.0000134206575,0.0000047506187,0.000141664,0.94573814,0.004232787,0.013906949,0.034436993,0.0002272292],"about_ca_topic_score_codex":0.00004327249,"about_ca_topic_score_gemma":0.000006140683,"teacher_disagreement_score":0.94500345,"about_ca_system_score_codex":0.00017522911,"about_ca_system_score_gemma":0.00014305707,"threshold_uncertainty_score":0.95093155},"labels":[],"label_agreement":null},{"id":"W2611416225","doi":"10.5555/2008503.2008525","title":"Specifying overlaps of heterogeneous models for global consistency checking","year":2010,"lang":"en","type":"article","venue":"Model Driven Engineering Languages and Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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":"Consistency (knowledge bases); Computer science; Metamodeling; Sketch; Consistency model; Set (abstract data type); Semantics (computer science); Theoretical computer science; Model checking; Formal specification; Partial evaluation; Programming language; Artificial intelligence; Distributed computing; Algorithm; Data consistency","score_opus":0.02855019008990831,"score_gpt":0.2842031484270314,"score_spread":0.2556529583371231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611416225","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.10617094,0.0004458886,0.8923883,0.0000069155617,0.00039271588,0.00020322343,0.000012025289,0.0000910959,0.0002889308],"genre_scores_gemma":[0.6686442,0.000006550458,0.3312597,0.0000038187645,0.000041815772,0.000020633937,0.0000013736787,0.0000074752265,0.000014408486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919134,0.000012301007,0.0002458076,0.00022353134,0.00013549217,0.00019152167],"domain_scores_gemma":[0.99939615,0.00003876657,0.000088826484,0.00034835347,0.000067501576,0.000060394334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026853,0.000117866155,0.00020439843,0.00004583547,0.00004528087,0.000072782925,0.00028742087,0.000079133664,2.300839e-7],"category_scores_gemma":[0.000043077907,0.00011357073,0.000055578683,0.00008210333,0.000018977309,0.0002270794,0.000077002485,0.00008120417,2.3901103e-7],"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.000001558316,0.000006294225,0.00004217341,0.00014765155,0.000011248674,0.0000014027294,0.0003341592,0.69448966,0.013795541,0.28991163,0.0000025287643,0.0012561714],"study_design_scores_gemma":[0.0001354469,0.00002123131,0.00006442149,0.000044816785,0.0000057556367,0.000042436062,0.000029046252,0.9979652,0.0010745036,0.00045001917,0.000045561726,0.0001215396],"about_ca_topic_score_codex":0.000026025788,"about_ca_topic_score_gemma":0.0000029494197,"teacher_disagreement_score":0.5624733,"about_ca_system_score_codex":0.000022474533,"about_ca_system_score_gemma":0.00001832405,"threshold_uncertainty_score":0.46312797},"labels":[],"label_agreement":null},{"id":"W2615016184","doi":"10.1016/s1474-6670(17)36455-8","title":"Discrete Abstractions for Two-Dimensional Nearly Integrable Continuous Systems","year":2003,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Integrable system; Computer science; Focus (optics); Class (philosophy); Hybrid system; Theoretical computer science; Control (management); Nonlinear system; Property (philosophy); Control engineering; Control system; Distributed computing; Algebra over a field; Mathematics; Pure mathematics; Engineering; Artificial intelligence; Physics","score_opus":0.021626251343698364,"score_gpt":0.28730417246767326,"score_spread":0.26567792112397487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615016184","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.1127479,0.00046028921,0.85558504,0.00035561167,0.0030739296,0.0013054298,0.000018605775,0.0007202884,0.025732908],"genre_scores_gemma":[0.4952171,0.000001917574,0.50117195,0.000059192535,0.00008845847,0.00022502578,0.0000025451616,0.000018567716,0.0032152298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847543,0.00001999795,0.0003535306,0.00046005705,0.00029088216,0.0004001142],"domain_scores_gemma":[0.9988575,0.000089998146,0.00022725623,0.00022396672,0.0004820231,0.00011922993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008874877,0.00018100804,0.00022351826,0.000117142125,0.0003294197,0.000544895,0.00050496886,0.000089001944,0.000012145819],"category_scores_gemma":[0.0005066629,0.00016880724,0.00009165108,0.00028449748,0.00007168394,0.0014460755,0.000054049102,0.00018629553,0.00007937207],"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.0000174494,0.00007359244,0.0014005055,0.00009181741,0.000042302596,0.0000010286293,0.00060724455,0.0004634345,0.010450983,0.974671,0.007101155,0.005079507],"study_design_scores_gemma":[0.0022269567,0.000763307,0.0029897727,0.00026183008,0.00008038384,0.00042070606,0.0015018969,0.72261095,0.055431366,0.032827295,0.17939723,0.0014883019],"about_ca_topic_score_codex":0.00007509731,"about_ca_topic_score_gemma":0.0000013736695,"teacher_disagreement_score":0.9418437,"about_ca_system_score_codex":0.00008745142,"about_ca_system_score_gemma":0.00008185327,"threshold_uncertainty_score":0.68837595},"labels":[],"label_agreement":null},{"id":"W2616807090","doi":"10.1109/tcad.2017.2705123","title":"MCXplore: Automating the Validation Process of DRAM Memory Controller Designs","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":21,"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 Waterloo","funders":"","keywords":"Computer science; Correctness; Construct (python library); Set (abstract data type); Dram; Model checking; Process (computing); Programming language; Regression testing; Software engineering; Reliability engineering; Embedded system; Software; Computer hardware; Software development; Engineering","score_opus":0.08582618862246036,"score_gpt":0.3059920161716072,"score_spread":0.22016582754914685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616807090","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.014450912,0.00006837969,0.98282814,0.000055394605,0.0013052531,0.0010041173,0.00001225694,0.00013378811,0.00014172832],"genre_scores_gemma":[0.96101993,0.000019862924,0.03871616,0.000022997256,0.000044356802,0.00011583457,9.242861e-7,0.000018072833,0.000041858675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728405,0.00071919896,0.0008531391,0.0004214247,0.00046521286,0.0002569553],"domain_scores_gemma":[0.9967469,0.00055250915,0.0010031078,0.0009837415,0.0006342821,0.00007946968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021513884,0.00026021642,0.0005072857,0.00021738227,0.0006644292,0.0004184487,0.001265379,0.00015279495,0.0000028239242],"category_scores_gemma":[0.00007185085,0.00018245545,0.00010704422,0.00028810633,0.0002458319,0.0008257814,0.0000055963233,0.0002849829,0.000003925251],"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.00008938879,0.00039805067,0.000030649837,0.0004657945,0.0003868042,0.000005329254,0.0056780092,0.41208106,0.051455174,0.011477533,0.00009985085,0.51783234],"study_design_scores_gemma":[0.00064932584,0.00039498028,0.00013830153,0.00037759068,0.000037922986,0.00003793794,0.00023825078,0.8883413,0.10921455,0.00038456716,0.0000073788965,0.00017790763],"about_ca_topic_score_codex":0.0001672881,"about_ca_topic_score_gemma":0.0000013237675,"teacher_disagreement_score":0.946569,"about_ca_system_score_codex":0.000056942765,"about_ca_system_score_gemma":0.00015864821,"threshold_uncertainty_score":0.7440317},"labels":[],"label_agreement":null},{"id":"W2616942550","doi":"10.1109/syscon.2017.7934785","title":"Formalization of Birth-Death and IID processes in higher-order logic","year":2017,"lang":"en","type":"article","venue":"2017 Annual IEEE International Systems Conference (SysCon)","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; Mathematical proof; Theoretical computer science; Process calculus; Markov process; State space; Markov chain; Scalability; Model checking; Formal methods; Probabilistic logic; Algorithm; Mathematics; Programming language; Artificial intelligence; Machine learning","score_opus":0.1256810603399984,"score_gpt":0.35755243010320975,"score_spread":0.23187136976321135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616942550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13430882,0.00039735273,0.81022143,0.0018111463,0.0079339305,0.0009540764,0.00014171902,0.00015932608,0.044072196],"genre_scores_gemma":[0.98512983,0.00013050999,0.012817172,0.000046049798,0.0001390358,0.000059772312,0.000008317317,0.000008795896,0.0016605408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983045,0.00009451845,0.00053378154,0.00041142254,0.00043372303,0.00022209472],"domain_scores_gemma":[0.99712735,0.00007252571,0.00076842617,0.00063862413,0.0013244515,0.000068624584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006786395,0.00018149473,0.0002795389,0.00020890291,0.00017136833,0.00051616656,0.0016899231,0.00012810246,0.000019526275],"category_scores_gemma":[0.0005216889,0.00016532151,0.000027203521,0.000114646784,0.00015161121,0.00304674,0.00022911603,0.00012693068,0.00002234183],"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.000036796922,0.000100363104,0.019542675,0.00033437586,0.000041858122,0.000011133433,0.0017260445,0.0002900117,0.0009868961,0.9718631,0.00018042978,0.004886327],"study_design_scores_gemma":[0.004724356,0.00092171214,0.4302466,0.00319716,0.000041077466,0.00027605228,0.0012539723,0.46302134,0.016682765,0.028038878,0.049388513,0.0022075726],"about_ca_topic_score_codex":0.00057817757,"about_ca_topic_score_gemma":0.00007712261,"teacher_disagreement_score":0.94382423,"about_ca_system_score_codex":0.000059700127,"about_ca_system_score_gemma":0.00019162426,"threshold_uncertainty_score":0.67416155},"labels":[],"label_agreement":null},{"id":"W2617541639","doi":"10.1145/3019612.3019827","title":"Runtime verification of LTL on lossy traces","year":2017,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":20,"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 Waterloo","funders":"","keywords":"Soundness; Runtime verification; Computer science; Lossy compression; TRACE (psycholinguistics); Linear temporal logic; Temporal logic; Real-time computing; Programming language; Formal verification; Artificial intelligence","score_opus":0.047242716006276074,"score_gpt":0.34003703774238214,"score_spread":0.2927943217361061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617541639","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.11066021,0.000016019601,0.78214246,0.0008165034,0.00052378123,0.00014347084,0.0000010683992,0.000101698985,0.1055948],"genre_scores_gemma":[0.64083016,0.000005582683,0.35852543,0.000033396223,0.000018897686,0.000004364539,3.4638575e-7,0.0000022717275,0.00057957694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993559,0.000035891146,0.00015153112,0.00018658332,0.00017900701,0.000091085436],"domain_scores_gemma":[0.9983027,0.00003036903,0.00021588015,0.0013617523,0.000063047584,0.000026242209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043373107,0.000057602476,0.00008076079,0.00004619515,0.00015585838,0.000115760435,0.0012227407,0.00003934777,0.000023398785],"category_scores_gemma":[0.00018352059,0.000049016733,0.00002681575,0.000051800438,0.00007088135,0.0006571965,0.00007616393,0.00005001548,0.00012807798],"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.0000071104314,0.000058550795,0.00048391978,0.00000976436,0.000004611283,3.447383e-7,0.00020373208,0.000019629777,0.009938786,0.8661995,0.00025662183,0.12281744],"study_design_scores_gemma":[0.00027529092,0.00020435573,0.28187013,0.000027432532,0.0000044671965,0.0000028854602,0.000020417587,0.06665906,0.637037,0.008999982,0.0047086664,0.00019036107],"about_ca_topic_score_codex":0.000027195243,"about_ca_topic_score_gemma":0.0000013291553,"teacher_disagreement_score":0.8571995,"about_ca_system_score_codex":0.000013013933,"about_ca_system_score_gemma":0.000017542437,"threshold_uncertainty_score":0.22721769},"labels":[],"label_agreement":null},{"id":"W2623081226","doi":"","title":"An effective fixed point calculus for deterministic systems applied to model checking","year":2001,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Formal Methods in Verification","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":"Prevention of Organ Failure","funders":"","keywords":"Fixed point; Model checking; Transition system; Computer science; Heuristics; Automaton; Algorithm; Theoretical computer science; Computation; Mathematics; Mathematical optimization","score_opus":0.020467257334689692,"score_gpt":0.2723576569820687,"score_spread":0.251890399647379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623081226","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.02773998,0.00004670462,0.96009,0.0007047377,0.00019591083,0.0012279853,0.000009872241,0.00033805636,0.009646775],"genre_scores_gemma":[0.55190825,0.0000057035722,0.44714117,0.00008808584,0.000013803155,0.00037903537,0.000016544882,0.00001875627,0.00042865708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635947,0.001758352,0.00041978125,0.00072230306,0.00032154622,0.0004185463],"domain_scores_gemma":[0.9954149,0.0009413539,0.0002484494,0.0020348576,0.0011028044,0.00025763366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061315605,0.00022277482,0.00026735017,0.00018125068,0.00042502917,0.00050466345,0.0016701453,0.00011365876,0.0000034673672],"category_scores_gemma":[0.0011921293,0.00023548129,0.00008746473,0.00058850896,0.00007457851,0.0004370517,0.00031021208,0.00015608867,0.000028647224],"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.000034154175,0.0003135918,0.00009077379,0.00006982332,0.000020653102,0.000002084229,0.008720963,0.0077007734,0.029769773,0.7994443,0.00010912924,0.15372396],"study_design_scores_gemma":[0.0003834654,0.000002217303,0.00074220536,0.00015378701,0.000011237255,0.000014069561,0.000070071146,0.95272434,0.04228784,0.00208085,0.0012577323,0.0002721812],"about_ca_topic_score_codex":0.0001061813,"about_ca_topic_score_gemma":0.00007834029,"teacher_disagreement_score":0.9450236,"about_ca_system_score_codex":0.00017172274,"about_ca_system_score_gemma":0.00008813234,"threshold_uncertainty_score":0.9602648},"labels":[],"label_agreement":null},{"id":"W2624695533","doi":"","title":"Dynamic constraint and variable aggregation in column generation","year":2014,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Solver; Degeneracy (biology); Mathematical optimization; Column generation; Column (typography); Constraint (computer-aided design); Variable (mathematics); Mathematics; Linear programming; Computer science; Algorithm; Geometry; Mathematical analysis","score_opus":0.017274953390242726,"score_gpt":0.2513417828475569,"score_spread":0.2340668294573142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624695533","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.04336798,0.0040132096,0.9441621,0.005338511,0.000926168,0.00087506376,0.000021336948,0.00028093485,0.0010146971],"genre_scores_gemma":[0.27124813,0.0006178998,0.72534734,0.0011593392,0.00012243225,0.00024245985,0.000023380384,0.00003411642,0.0012049174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964036,0.0008958209,0.00076923217,0.0007729642,0.00037144282,0.0007869711],"domain_scores_gemma":[0.9979484,0.00020263622,0.00038166053,0.0009882912,0.00019947188,0.00027951592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003531188,0.0003650736,0.0004006062,0.0004779868,0.00026971023,0.00065053336,0.0005772972,0.0005387834,0.00003177385],"category_scores_gemma":[0.0009408995,0.00045941395,0.000067085966,0.001025889,0.00030946,0.0015102252,0.00027573528,0.0005731243,0.00002159355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000130732005,0.00012972506,0.0029160273,0.00007316596,0.0000113646365,0.000008369827,0.0004300188,0.005607866,0.007836385,0.6449498,0.0002686532,0.33775553],"study_design_scores_gemma":[0.0005179057,0.00019899436,0.019179882,0.00017272518,0.000020071138,0.00021147261,0.000033412714,0.94990754,0.0036683301,0.018498747,0.007163766,0.00042714865],"about_ca_topic_score_codex":0.010595709,"about_ca_topic_score_gemma":0.0056433794,"teacher_disagreement_score":0.9442997,"about_ca_system_score_codex":0.00086674216,"about_ca_system_score_gemma":0.0003599482,"threshold_uncertainty_score":0.9997858},"labels":[],"label_agreement":null},{"id":"W2626008201","doi":"10.23638/lmcs-17(2:3)2021","title":"Semipullbacks of labelled Markov processes","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Markov chain; Computer science; Mathematics; Statistics","score_opus":0.06453886262054401,"score_gpt":0.398004675370218,"score_spread":0.333465812749674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626008201","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.007265506,0.00027139173,0.9888969,0.00024867462,0.0009675933,0.00014475234,7.4152996e-7,0.0001031281,0.0021013357],"genre_scores_gemma":[0.026796384,0.000045347788,0.972647,0.0004081391,0.000050052662,0.000016061456,4.1433512e-7,0.000005419405,0.000031189873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963196,0.0009192659,0.0006233116,0.0009881919,0.0006447386,0.0005049198],"domain_scores_gemma":[0.9967234,0.0010929217,0.00021890708,0.001148693,0.0006666067,0.00014943349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005986946,0.00018425008,0.00039380192,0.0002535449,0.00013105062,0.0001836372,0.0027406064,0.000105621075,0.000026088952],"category_scores_gemma":[0.0031186787,0.00015644175,0.00006290827,0.005944808,0.00061372196,0.0008943342,0.0016409486,0.00027982297,0.000007995674],"study_design_candidate":"design_other","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.000008102811,0.00027102474,0.0012522131,0.00011833971,0.0000045856054,0.00004041098,0.000622464,0.00089281355,0.040010933,0.098654844,0.000023279581,0.858101],"study_design_scores_gemma":[0.00038220768,0.00019132934,0.011283341,0.00012046585,0.0000037783886,0.000109003864,0.000017317785,0.49181613,0.4345991,0.060438875,0.0006590522,0.00037939657],"about_ca_topic_score_codex":0.000004494084,"about_ca_topic_score_gemma":0.0000015125147,"teacher_disagreement_score":0.85772157,"about_ca_system_score_codex":0.0000755337,"about_ca_system_score_gemma":0.0005408921,"threshold_uncertainty_score":0.63795096},"labels":[],"label_agreement":null},{"id":"W2726042643","doi":"","title":"Vous avez dit raffinement ?","year":2005,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science","score_opus":0.029414021338616734,"score_gpt":0.26282080922528456,"score_spread":0.23340678788666783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726042643","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.011427431,0.0026397465,0.82905036,0.03605015,0.0019209556,0.000953849,0.000055004748,0.00055476377,0.11734775],"genre_scores_gemma":[0.07903426,0.0018559183,0.84784186,0.00042133455,0.00020541427,0.0002182724,0.00027084877,0.000091817,0.07006025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9798285,0.014106502,0.001568022,0.0021136433,0.0012930656,0.0010902925],"domain_scores_gemma":[0.98513335,0.0019002324,0.0014666718,0.0066559035,0.0042965785,0.00054729334],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.016857684,0.0008625629,0.0007865755,0.00036172016,0.00087954605,0.0015354085,0.0058231843,0.00069535547,0.00084465917],"category_scores_gemma":[0.00356845,0.0010055422,0.000505621,0.0010912479,0.0006808483,0.00084315444,0.0049937153,0.0015371733,0.001118442],"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.0000095228925,0.0008594691,0.00021624898,0.00014347976,0.00008239335,0.0000085501615,0.01321786,0.00068922143,0.001029101,0.6417775,0.0023750684,0.33959156],"study_design_scores_gemma":[0.0009547235,0.0000016825229,0.008397289,0.0026489024,0.00010766658,0.00007985445,0.00012628741,0.41983876,0.060752593,0.008715427,0.49695608,0.0014207115],"about_ca_topic_score_codex":0.0013235651,"about_ca_topic_score_gemma":0.0011925454,"teacher_disagreement_score":0.6330621,"about_ca_system_score_codex":0.0006737244,"about_ca_system_score_gemma":0.00083088997,"threshold_uncertainty_score":0.9996593},"labels":[],"label_agreement":null},{"id":"W2726753079","doi":"10.2168/lmcs-4(2:2)2008","title":"Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems","year":2008,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); York University","funders":"","keywords":"Probabilistic logic; Duality (order theory); Interval (graph theory); Dual (grammatical number); Discounting; Order (exchange); Zero (linguistics); Decision theory; Degree (music)","score_opus":0.17581771995864062,"score_gpt":0.40642351785911274,"score_spread":0.23060579790047211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726753079","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.02974012,0.000098270975,0.9664374,0.00007444112,0.002024019,0.0011978167,0.0000018063765,0.00024626302,0.00017987507],"genre_scores_gemma":[0.21134168,0.0000040488053,0.78813475,0.00009475528,0.000099407946,0.00030071312,6.072744e-7,0.000009917406,0.000014139359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952751,0.0007549061,0.0009358759,0.0013164409,0.0008331485,0.00088452635],"domain_scores_gemma":[0.9966384,0.0013103466,0.00036386863,0.001131347,0.0003227341,0.00023326297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010646169,0.00029446222,0.00053992146,0.00071224925,0.0005667075,0.00043028066,0.0032596458,0.00012316855,0.0000014659315],"category_scores_gemma":[0.002840805,0.00023052462,0.00010902218,0.0046746866,0.0009250112,0.0013822858,0.00089061214,0.00034142888,0.0000060188895],"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.00003088266,0.0006068644,0.013260644,0.00020268362,0.0000090708,0.000035300174,0.0021940586,0.020759717,0.003579323,0.510959,0.000024797766,0.4483376],"study_design_scores_gemma":[0.00034494387,0.00030467712,0.01674887,0.000047974318,0.000003836648,0.00024371904,0.00001061841,0.97046524,0.0008032387,0.010642345,0.000049215905,0.0003353372],"about_ca_topic_score_codex":0.000031348467,"about_ca_topic_score_gemma":5.523906e-7,"teacher_disagreement_score":0.9497055,"about_ca_system_score_codex":0.00032816836,"about_ca_system_score_gemma":0.00021884916,"threshold_uncertainty_score":0.9400521},"labels":[],"label_agreement":null},{"id":"W2734058336","doi":"10.1609/socs.v8i1.18421","title":"Non-Markovian Rewards Expressed in LTL: Guiding Search Via Reward Shaping","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":35,"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":"","keywords":"Markov decision process; Linear temporal logic; Automaton; Computer science; Markov process; Temporal logic; Mathematical optimization; Planner; State (computer science); Quality (philosophy); Finite-state machine; Theoretical computer science; Artificial intelligence; Mathematics; Algorithm","score_opus":0.0432312004337493,"score_gpt":0.3062496548638452,"score_spread":0.2630184544300959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734058336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9298789,0.0000324062,0.005958208,0.012393395,0.009673551,0.0006845643,0.000008190449,0.00012557267,0.041245226],"genre_scores_gemma":[0.98090464,0.00003590183,0.018223988,0.00016049192,0.00037360325,0.000041765896,0.0000023794294,0.000024871822,0.00023234243],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99634427,0.0000738926,0.0005911122,0.0006559202,0.0018965291,0.00043828186],"domain_scores_gemma":[0.9977181,0.00019412702,0.00019475474,0.0004071331,0.0013798566,0.000106028616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002689851,0.00020290975,0.00026391537,0.00024136905,0.00017948258,0.00035728866,0.0034664874,0.00014447873,0.000020903912],"category_scores_gemma":[0.00069371436,0.00018585961,0.00014938493,0.0010901267,0.000096203454,0.00080366863,0.0016649731,0.0004723988,0.000016452803],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00015162393,0.00032118586,0.0055582086,0.00009510909,0.000046362744,0.000006128371,0.0016339689,0.0002534516,0.6469468,0.3418897,0.00043018168,0.002667311],"study_design_scores_gemma":[0.0009897404,0.00012879964,0.003246268,0.00037910306,0.0000045815805,0.000016470805,0.0001308979,0.045077235,0.9337495,0.014632731,0.0014065664,0.00023811887],"about_ca_topic_score_codex":0.00016218764,"about_ca_topic_score_gemma":0.0000020497744,"teacher_disagreement_score":0.32725698,"about_ca_system_score_codex":0.0005705086,"about_ca_system_score_gemma":0.00020037664,"threshold_uncertainty_score":0.75791353},"labels":[],"label_agreement":null},{"id":"W2736035841","doi":"10.23919/acc.2017.7963336","title":"Output-feedback safety-preserving control","year":2017,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 British Columbia","funders":"","keywords":"Control theory (sociology); Observer (physics); Control (management); Computer science; State (computer science); Set (abstract data type); Control system; State observer; Control engineering; Engineering; Nonlinear system; Algorithm; Artificial intelligence; Physics","score_opus":0.0395358904324216,"score_gpt":0.30852538706976185,"score_spread":0.26898949663734023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736035841","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.00076923124,0.000015495345,0.84969527,0.0020090605,0.00059699925,0.00010252557,7.7958106e-7,0.00014157622,0.14666907],"genre_scores_gemma":[0.44996986,0.000004883956,0.54617935,0.00040767496,0.000067528636,0.0000065864397,1.8855353e-7,0.000004544197,0.0033593422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910986,0.00007013371,0.00017097684,0.00024925583,0.00018929783,0.00021046352],"domain_scores_gemma":[0.9974708,0.000059971913,0.00014437767,0.0021649252,0.00006485033,0.00009510315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076443754,0.00008245416,0.00011133518,0.00003424328,0.0005188215,0.00048264262,0.003089975,0.00004773238,0.00007410909],"category_scores_gemma":[0.00076226355,0.00007067661,0.00004372693,0.000040549494,0.00005386939,0.0013872471,0.00053904665,0.00008966357,0.00026070693],"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.00001438188,0.000015901078,0.0031179292,0.000010621077,0.000015675192,0.0000039653914,0.00021535352,0.00008344693,0.0007644676,0.82958585,0.00273433,0.16343805],"study_design_scores_gemma":[0.0011485105,0.000062698644,0.14729035,0.00002249871,0.0000065109302,0.000011461092,0.000027019933,0.7652186,0.0051452345,0.016721666,0.064004354,0.0003410821],"about_ca_topic_score_codex":0.00006548933,"about_ca_topic_score_gemma":0.0000066516154,"teacher_disagreement_score":0.8128642,"about_ca_system_score_codex":0.000025542107,"about_ca_system_score_gemma":0.00003080061,"threshold_uncertainty_score":0.57419944},"labels":[],"label_agreement":null},{"id":"W2736911465","doi":"10.29007/b8gq","title":"Automated analysis of Stateflow models","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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 Waterloo","funders":"Centre National d’Etudes Spatiales; Agence Nationale de la Recherche; National Aeronautics and Space Administration","keywords":"Stateflow; Computer science; Programming language; Code generation; Toolbox; Semantics (computer science); Software engineering; Key (lock)","score_opus":0.04062794395109122,"score_gpt":0.3368461936602954,"score_spread":0.2962182497092042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736911465","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.23605233,0.000018584627,0.7608136,0.00003904338,0.00032783643,0.00005434427,9.120695e-7,0.00028233748,0.0024110246],"genre_scores_gemma":[0.5352801,0.0000016658507,0.4646555,0.000029907438,0.000018324754,8.444571e-7,0.0000012696983,0.0000028309364,0.000009576761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987306,0.00015817641,0.0004232802,0.00027503783,0.00019264643,0.00022024427],"domain_scores_gemma":[0.9989665,0.00011497471,0.00018713804,0.00056541176,0.00013577852,0.000030186775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094644685,0.00009200773,0.00025151687,0.00040572893,0.00007247903,0.000042088624,0.00067395775,0.000046473957,0.000011094181],"category_scores_gemma":[0.00012876905,0.00009431362,0.00005309456,0.0026423584,0.00012555197,0.00056843454,0.00027940623,0.00007668576,0.00000470934],"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.000032541484,0.00011240584,0.00912293,0.00005806709,0.00037140242,0.000009360995,0.019506563,0.3848823,0.0013566157,0.45864177,0.00014963408,0.12575641],"study_design_scores_gemma":[0.00007656387,0.000055840937,0.015392729,0.000016957283,0.000015891967,0.0000019803915,0.00006205602,0.97618407,0.004001794,0.0040501826,0.000050669692,0.000091262315],"about_ca_topic_score_codex":0.00006361508,"about_ca_topic_score_gemma":0.000021804815,"teacher_disagreement_score":0.5913018,"about_ca_system_score_codex":0.000046754736,"about_ca_system_score_gemma":0.000034709563,"threshold_uncertainty_score":0.38459978},"labels":[],"label_agreement":null},{"id":"W2737371798","doi":"10.1007/978-3-319-63121-9_6","title":"Bicategories of Markov Processes","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Markov chain; Morphism; Computer science; Construct (python library); Markov process; Continuous-time Markov chain; Theoretical computer science; Probabilistic logic; Markov property; Examples of Markov chains; Markov kernel; Algebra over a field; Variable-order Markov model; Discrete mathematics; Markov model; Mathematics; Pure mathematics; Programming language; Artificial intelligence; Machine learning","score_opus":0.03005402368765252,"score_gpt":0.2903962621706746,"score_spread":0.26034223848302207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737371798","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.000021577094,0.00056879513,0.98425263,0.0002517528,0.0015401925,0.00028500363,0.000004407473,0.00010424097,0.012971414],"genre_scores_gemma":[0.041982718,0.00011608006,0.95692956,0.00016242196,0.000218044,0.000009715693,0.0000022718225,0.000022993287,0.00055619294],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690884,0.000032071726,0.0005446379,0.0011346769,0.0009324161,0.00044733842],"domain_scores_gemma":[0.9956445,0.0003507196,0.0007787666,0.0025177582,0.00060491764,0.000103346305],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012853954,0.00039819995,0.00052711455,0.0006686245,0.0002757844,0.00044761476,0.006433545,0.00028658577,0.000011838959],"category_scores_gemma":[0.0007520904,0.00035378448,0.00008591463,0.0003612367,0.001583119,0.0011502785,0.0014453316,0.00050568045,0.000020201689],"study_design_candidate":"design_other","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.000006740974,0.000022907994,0.00006887755,0.0002603038,0.000008957474,0.00001553267,0.0007317783,0.0011015232,0.00016978246,0.09906999,0.000012750892,0.89853084],"study_design_scores_gemma":[0.0003141088,0.0003789797,0.0006281768,0.0010892224,0.00001759606,0.000098572345,2.5088883e-7,0.18145928,0.04398753,0.7647748,0.0060105473,0.0012409333],"about_ca_topic_score_codex":0.000017237142,"about_ca_topic_score_gemma":0.00002694259,"teacher_disagreement_score":0.89728993,"about_ca_system_score_codex":0.00012568565,"about_ca_system_score_gemma":0.0010501,"threshold_uncertainty_score":0.9998914},"labels":[],"label_agreement":null},{"id":"W2744362221","doi":"10.1109/cjece.2016.2630421","title":"Toward a Rigorous Approach for Verifying Cyber-Physical Systems Against Requirements","year":2017,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dependability; Computer science; Cyber-physical system; Risk analysis (engineering); Systems engineering; Physical system; Reliability engineering; Software engineering; Engineering","score_opus":0.04598191464131355,"score_gpt":0.2592453479957977,"score_spread":0.21326343335448414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744362221","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.021266859,0.00044245072,0.9772634,0.00006305721,0.0007233221,0.0001240883,0.0000011867841,0.000016437136,0.00009921103],"genre_scores_gemma":[0.6713894,0.000009203203,0.3281313,0.00003215697,0.00041723135,0.000005781547,4.5440987e-7,0.000008308976,0.0000061753267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905664,0.0000223299,0.00025284107,0.00017735394,0.00014207565,0.00034875015],"domain_scores_gemma":[0.99895734,0.00005532025,0.00018560166,0.00027087418,0.000120523866,0.00041031456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003376426,0.00012743598,0.00024338572,0.00017777058,0.00024174288,0.0005667197,0.00083881686,0.00005523832,8.7669605e-8],"category_scores_gemma":[0.00012719554,0.00011662762,0.000077066055,0.00009666409,0.000025091895,0.0005477442,0.00004527697,0.0002076319,3.8544883e-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.000033381693,0.00011502267,0.0014948571,0.0004467306,0.0003453217,0.0002550878,0.002087541,0.09419634,0.0020512273,0.30327132,0.0012041839,0.594499],"study_design_scores_gemma":[0.00026897062,0.00017386278,0.0017107591,0.000046472473,0.000008550721,0.00013334784,0.0000017876981,0.9949388,0.00017036115,0.00012421343,0.002281345,0.00014151701],"about_ca_topic_score_codex":0.000120503435,"about_ca_topic_score_gemma":0.000003337761,"teacher_disagreement_score":0.9007425,"about_ca_system_score_codex":0.00012218324,"about_ca_system_score_gemma":0.0001580135,"threshold_uncertainty_score":0.54648906},"labels":[],"label_agreement":null},{"id":"W2751513393","doi":"10.2168/lmcs-8(1:27)2012","title":"On the Parameterized Intractability of Monadic Second-Order Logic","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Deutsche Forschungsgemeinschaft","keywords":"Parameterized complexity; Bounded function; Class (philosophy); Hierarchy; Complexity class; Second-order logic; Order (exchange)","score_opus":0.11143000463636157,"score_gpt":0.40350800274537085,"score_spread":0.29207799810900925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751513393","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.113540456,0.000050854018,0.88319033,0.00041110592,0.0013369101,0.00033776535,7.823456e-7,0.00007287017,0.0010589366],"genre_scores_gemma":[0.38164166,0.000001987585,0.6174213,0.00086226425,0.00003862309,0.000027703962,1.005818e-7,0.0000032739003,0.000003066557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950721,0.00219651,0.0006471486,0.00070109963,0.00064110226,0.00074202934],"domain_scores_gemma":[0.9937294,0.004024334,0.0002804821,0.001589408,0.00018023705,0.00019615146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018681526,0.000224277,0.00037144183,0.00023180818,0.00020304795,0.00013502508,0.003453142,0.00011900338,0.00009498687],"category_scores_gemma":[0.0037275038,0.00013621988,0.00008920599,0.0028970325,0.0012632402,0.001026084,0.0009849694,0.0004991594,0.000021456335],"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.000013103658,0.0002820083,0.0006648534,0.000013546159,0.0000026337195,0.0000010596996,0.0005701203,0.00035556595,0.008127069,0.7198038,0.000009225982,0.270157],"study_design_scores_gemma":[0.0002612078,0.00040690062,0.10054443,0.000025709009,0.0000034718248,0.000028404469,0.00001406857,0.53100616,0.043882016,0.32321522,0.0002560262,0.00035638845],"about_ca_topic_score_codex":0.000008289697,"about_ca_topic_score_gemma":5.856356e-7,"teacher_disagreement_score":0.53065056,"about_ca_system_score_codex":0.00011951532,"about_ca_system_score_gemma":0.00009814843,"threshold_uncertainty_score":0.64746815},"labels":[],"label_agreement":null},{"id":"W2755744672","doi":"10.1109/ivsw.2017.8031554","title":"Learning lemma support graphs in Quip and IC3","year":2017,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"","keywords":"Computer science; Satisfiability; Satisfiability modulo theories; Formal verification; Model checking; Subroutine; Boolean satisfiability problem; Theoretical computer science; Lemma (botany); Graph; Functional verification; Runtime verification; Programming language; Algorithm","score_opus":0.03748121500807641,"score_gpt":0.3224533001387928,"score_spread":0.28497208513071637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755744672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4292613,0.00001931426,0.47254863,0.0007677493,0.00038043445,0.000120523146,1.3176557e-7,0.00014068847,0.09676124],"genre_scores_gemma":[0.6831933,0.000010783785,0.31608498,0.00004779065,0.0000067887318,0.0000033027152,1.6297457e-7,0.000001993178,0.0006508619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994613,0.00004477717,0.000101223384,0.00017841364,0.00008800167,0.0001262663],"domain_scores_gemma":[0.99940914,0.000022409356,0.00006728716,0.00044935037,0.000017095252,0.000034729142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068538595,0.000047872065,0.000063597014,0.00006271015,0.00016614007,0.00021313707,0.0005281032,0.00003108103,0.000015342583],"category_scores_gemma":[0.00018315447,0.000043288605,0.000012146392,0.000051645737,0.000052305782,0.00076427497,0.00022196685,0.000100436235,0.00002355678],"study_design_candidate":"observational","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.000002711786,0.000013853228,0.11486473,0.00000888325,0.0000023263285,0.000008200872,0.000865368,0.000009505935,0.0008273856,0.6152846,0.00013420015,0.26797822],"study_design_scores_gemma":[0.0003828375,0.00016459805,0.88188815,0.000014328061,0.0000016888965,0.00002753824,0.00008398177,0.08231056,0.0067999675,0.02038381,0.007718276,0.00022425651],"about_ca_topic_score_codex":0.00008999091,"about_ca_topic_score_gemma":0.00002394283,"teacher_disagreement_score":0.76702344,"about_ca_system_score_codex":0.000007957632,"about_ca_system_score_gemma":0.000014147136,"threshold_uncertainty_score":0.20552856},"labels":[],"label_agreement":null},{"id":"W2757786437","doi":"10.1109/rew.2017.70","title":"DASH: A New Language for Declarative Behavioural Requirements with Control State Hierarchy","year":2017,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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 Waterloo","funders":"","keywords":"Dash; Hierarchy; Computer science; Programming language; State (computer science); Control (management); Theoretical computer science; Artificial intelligence; Operating system","score_opus":0.08692277813182188,"score_gpt":0.3687902882156623,"score_spread":0.2818675100838404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757786437","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.038965818,0.000013721148,0.9577469,0.0005433683,0.0001556893,0.00052157795,0.0000074089953,0.00008584838,0.0019596328],"genre_scores_gemma":[0.38346386,7.271537e-7,0.613624,0.00017235569,0.000022644303,0.00004208084,0.0000018200361,0.0000059862114,0.0026665607],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99909824,0.00004571495,0.0001468433,0.00027036679,0.00019634863,0.00024250428],"domain_scores_gemma":[0.99868816,0.00004228477,0.0001874388,0.00088974775,0.00008922205,0.000103160775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036800155,0.0001074887,0.00012675818,0.00004086359,0.00029818228,0.00036098366,0.0010311289,0.000027416876,0.000009824921],"category_scores_gemma":[0.000110058645,0.00007857479,0.000033184686,0.00004283878,0.00006642386,0.0012916502,0.000097200405,0.00006606097,0.000014032896],"study_design_candidate":"design_other","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.00064834626,0.00021678765,0.03134648,0.000038740975,0.00018835752,0.00004291374,0.014990834,0.00006876241,0.011424252,0.34205014,0.0030166323,0.59596777],"study_design_scores_gemma":[0.023786437,0.0043120184,0.42479846,0.00017237612,0.00013032205,0.00006384272,0.0005894913,0.32527965,0.18154103,0.03037282,0.006948243,0.0020053056],"about_ca_topic_score_codex":0.00025906877,"about_ca_topic_score_gemma":0.00013135799,"teacher_disagreement_score":0.59396243,"about_ca_system_score_codex":0.000039763505,"about_ca_system_score_gemma":0.00009144556,"threshold_uncertainty_score":0.34809738},"labels":[],"label_agreement":null},{"id":"W2757936534","doi":"","title":"Modeling Security Protocols using UML2.","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Computer security; Cryptographic protocol; Unified Modeling Language; Cryptography; Software; Programming language","score_opus":0.19174326471766398,"score_gpt":0.3861013611420359,"score_spread":0.19435809642437193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757936534","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.039473407,0.0000038059086,0.95404387,0.000024955181,0.000067293025,0.00213181,1.2662407e-7,0.00019500816,0.0040597366],"genre_scores_gemma":[0.19790484,7.08247e-7,0.8015562,0.00008045437,0.000029141787,0.00038612678,1.2890963e-7,0.0000034873067,0.00003890307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992376,0.00005719478,0.00016044604,0.00020393387,0.00018465931,0.00015614384],"domain_scores_gemma":[0.99938625,0.000007886122,0.000031357515,0.00045621005,0.00007267114,0.00004560161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033008718,0.00006530765,0.000074413736,0.00004618207,0.0001489723,0.000041812666,0.0004886287,0.00003840088,0.000010132036],"category_scores_gemma":[0.000046479974,0.000058912323,0.000028068283,0.0002283746,0.000021634816,0.0007349108,0.00013107371,0.00008062771,0.00002582204],"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.000016182306,0.00022276724,0.0016116536,0.0000681525,0.000013925935,0.000018217892,0.0049088923,0.0971935,0.0070527,0.87173116,0.00023432908,0.016928507],"study_design_scores_gemma":[0.00007297046,0.000014857589,0.00003857754,0.000007642382,4.1090317e-7,0.000046885136,0.0000059554354,0.9878659,0.0067537376,0.00490684,0.0002032197,0.000082952916],"about_ca_topic_score_codex":0.00004200735,"about_ca_topic_score_gemma":7.1860364e-7,"teacher_disagreement_score":0.89067245,"about_ca_system_score_codex":0.000036653957,"about_ca_system_score_gemma":0.00005750678,"threshold_uncertainty_score":0.24023747},"labels":[],"label_agreement":null},{"id":"W2758043160","doi":"10.29007/p319","title":"SC-square: when Satisfiability Checking and Symbolic Computation join forces","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Formal Methods in Verification","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 Waterloo","funders":"Horizon 2020 Framework Programme; Agence Nationale de la Recherche","keywords":"Satisfiability; Join (topology); Computer science; Computation; Square (algebra); Focus (optics); Theoretical computer science; Symbolic computation; Algorithm; Mathematics; Combinatorics","score_opus":0.03089286117739838,"score_gpt":0.31207660951298394,"score_spread":0.28118374833558557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758043160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45317858,0.00007122982,0.5446484,0.0002328332,0.0005606244,0.00015507477,3.1446243e-7,0.0001222572,0.001030663],"genre_scores_gemma":[0.5562741,0.0000033548304,0.44348493,0.00009527255,0.00012455524,0.0000032326338,8.2139326e-7,0.0000062133704,0.0000075020857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981611,0.0002945131,0.00046818008,0.0005082751,0.00023132397,0.00033663213],"domain_scores_gemma":[0.9989371,0.0002749467,0.00019661782,0.00041712372,0.00011477465,0.000059442107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017154145,0.00016424812,0.00023336572,0.00014609618,0.0003009745,0.00022419663,0.0004554515,0.000081117185,0.000008073028],"category_scores_gemma":[0.0004806054,0.00017378674,0.00002888649,0.00045986552,0.00027265222,0.00069425313,0.00047214286,0.00017809533,0.000009420627],"study_design_candidate":"design_other","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.00002182842,0.000047760648,0.08687135,0.00014739178,0.000015395735,0.000005023948,0.024088278,0.0008445042,0.0008249474,0.15466651,0.00009630006,0.73237073],"study_design_scores_gemma":[0.00031597298,0.00017806077,0.24740769,0.000138407,0.0000033267488,0.0000438485,0.00027587978,0.69780415,0.0036804264,0.049347755,0.0005122087,0.00029230074],"about_ca_topic_score_codex":0.00009795219,"about_ca_topic_score_gemma":0.000034133842,"teacher_disagreement_score":0.73207843,"about_ca_system_score_codex":0.00009413988,"about_ca_system_score_gemma":0.000041592622,"threshold_uncertainty_score":0.70868176},"labels":[],"label_agreement":null},{"id":"W2766112195","doi":"10.23638/lmcs-16(2:13)2020","title":"Forward Analysis for WSTS, Part III: Karp-Miller Trees","year":2020,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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; Natural Sciences and Engineering Research Council of Canada","keywords":"Miller; Computer science; Geology","score_opus":0.1480144954118037,"score_gpt":0.40900433236721107,"score_spread":0.26098983695540734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766112195","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.001353323,0.00007861744,0.9945264,0.0018321103,0.0010323125,0.00047685686,0.000002978037,0.00026187953,0.00043552587],"genre_scores_gemma":[0.03597959,0.00001447984,0.9606092,0.0030339023,0.0002412144,0.000096075266,0.0000016906072,0.000008686414,0.000015158389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537855,0.0007044001,0.0007816001,0.001630967,0.00069293875,0.00081154826],"domain_scores_gemma":[0.99681693,0.001161535,0.00025248367,0.0010938761,0.00024459494,0.00043057912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066364924,0.00029583625,0.00066113425,0.00048515774,0.00030317315,0.00045078498,0.004140629,0.00013914908,0.000023378338],"category_scores_gemma":[0.0013907691,0.0002397041,0.0003074142,0.007872328,0.0005510654,0.0011157715,0.0012532551,0.00030491716,0.000014510908],"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.00003714447,0.00012269158,0.0017112701,0.000022272385,0.00005493243,0.00000890349,0.001454034,0.027272953,0.0018512169,0.15941674,0.00020831109,0.8078395],"study_design_scores_gemma":[0.0003639007,0.00031623268,0.011030564,0.000009415189,0.000027608743,0.0000037352452,0.000011277854,0.9643423,0.004817542,0.014016497,0.004719356,0.00034159838],"about_ca_topic_score_codex":0.000008946207,"about_ca_topic_score_gemma":0.0000033921297,"teacher_disagreement_score":0.9370693,"about_ca_system_score_codex":0.00010705945,"about_ca_system_score_gemma":0.00012396753,"threshold_uncertainty_score":0.97748494},"labels":[],"label_agreement":null},{"id":"W2767753763","doi":"10.1016/j.ic.2017.11.001","title":"Handling infinitely branching well-structured transition systems","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Branching (polymer chemistry); Transition (genetics); Computer science; Theoretical computer science; Statistical physics; Biological system; Chemistry; Physics; Biology","score_opus":0.0246912400431496,"score_gpt":0.2898175308023667,"score_spread":0.2651262907592171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767753763","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.0538359,0.0000293573,0.94183534,0.00023097124,0.00078156625,0.00018982124,0.000001941293,0.00014515212,0.0029499363],"genre_scores_gemma":[0.88423795,0.000013471119,0.11548323,0.0001798408,0.00004591498,0.0000097136435,0.000021284834,0.0000028985592,0.000005696194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991556,0.000054916713,0.00034134462,0.00011529083,0.00021268422,0.00012021237],"domain_scores_gemma":[0.9991142,0.000031767107,0.00039040466,0.00027684856,0.00013451843,0.000052242405],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00045797875,0.000097815406,0.00010462748,0.00014119477,0.0007025623,0.0016821558,0.00030096,0.0000693198,0.0000013967592],"category_scores_gemma":[0.00007472731,0.00009737728,0.000024294659,0.00007579689,0.000037250964,0.0065077213,0.000053493182,0.00009994721,0.000033580745],"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.000024902343,0.000011239426,0.0002496043,0.00016934382,0.000017536442,9.075675e-7,0.009574367,0.05540326,0.0002375733,0.20538941,0.00011941226,0.72880244],"study_design_scores_gemma":[0.00041400365,0.00002851557,0.015102608,0.000039280752,0.000003901421,0.000026492342,0.00012376209,0.9792852,0.00034349822,0.002658311,0.0018473698,0.00012710142],"about_ca_topic_score_codex":0.000050833445,"about_ca_topic_score_gemma":0.000001505817,"teacher_disagreement_score":0.9238819,"about_ca_system_score_codex":0.00002626796,"about_ca_system_score_gemma":0.000025317004,"threshold_uncertainty_score":0.9993542},"labels":[],"label_agreement":null},{"id":"W2768277027","doi":"10.1017/s0960129519000094","title":"Singular value automata and approximate minimization","year":2019,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Singular value decomposition; Mathematics; Automaton; Hankel matrix; Rank (graph theory); Canonical form; Singular value; Construct (python library); Decomposition; Value (mathematics); Minification; Discrete mathematics; Algorithm; Applied mathematics; Algebra over a field; Pure mathematics; Combinatorics; Computer science; Mathematical optimization; Theoretical computer science; Mathematical analysis; Statistics","score_opus":0.014093987979408125,"score_gpt":0.27687725863627083,"score_spread":0.2627832706568627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768277027","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.09964077,0.000020305077,0.89869714,0.00012682848,0.00045730616,0.00027232908,3.3977045e-7,0.00013104186,0.0006539203],"genre_scores_gemma":[0.3358202,0.0000014875719,0.6640081,0.00013794596,0.00001791743,0.000004230522,3.130024e-7,0.000004738577,0.000005094097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979824,0.00008339842,0.00033827778,0.0006457409,0.00058313744,0.00036707654],"domain_scores_gemma":[0.9987215,0.0001286514,0.00010508091,0.00087769475,0.00006086247,0.00010624588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011207996,0.00015854678,0.00020892158,0.00022824558,0.00011543623,0.00047079986,0.0014857737,0.000053732612,0.000013254089],"category_scores_gemma":[0.00016106994,0.00013104474,0.000023858538,0.00090551446,0.00032765503,0.0010334881,0.00085783907,0.00013236226,0.000022816523],"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.0000017509321,0.000024183437,0.00044800484,0.00006486774,0.0000012248222,0.0000027581316,0.0006415825,0.0025181675,0.00045915172,0.92647,0.0000066133503,0.0693617],"study_design_scores_gemma":[0.00015109035,0.00002737019,0.006182674,0.00003005214,9.468937e-7,0.000053357922,0.0000035563535,0.74872994,0.0013143631,0.24335189,0.000028682765,0.00012608946],"about_ca_topic_score_codex":0.0000023806492,"about_ca_topic_score_gemma":1.11235046e-7,"teacher_disagreement_score":0.74621177,"about_ca_system_score_codex":0.00006662136,"about_ca_system_score_gemma":0.000059635833,"threshold_uncertainty_score":0.5343849},"labels":[],"label_agreement":null},{"id":"W2772456949","doi":"10.1007/978-3-319-77935-5_10","title":"Formal Dynamic Fault Trees Analysis Using an Integration of Theorem Proving and Model Checking","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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":"Computer science; Model checking; Automated theorem proving; Fault tree analysis; Formal methods; Algorithm; Theoretical computer science; Programming language; Reliability engineering","score_opus":0.035706098404780555,"score_gpt":0.30842993628922866,"score_spread":0.2727238378844481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772456949","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.015283191,0.000079375335,0.9837504,0.00001749981,0.0002710247,0.00025755327,0.0000041546677,0.000070171016,0.000266612],"genre_scores_gemma":[0.41060507,0.0000067375604,0.5892725,0.000044863973,0.00004170395,0.0000018207186,0.000003359243,0.000010888295,0.000013031415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720275,0.000063832216,0.0005839922,0.0010634484,0.0006745916,0.00041135555],"domain_scores_gemma":[0.9977281,0.00012851912,0.0005641928,0.0011248899,0.0003600138,0.000094261224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001962534,0.00036301382,0.00050360296,0.0013991395,0.00024560586,0.00037024793,0.0017962832,0.00025636176,0.0000036019917],"category_scores_gemma":[0.00012093537,0.0003183193,0.00011221135,0.0010012939,0.0008719991,0.0022571578,0.00078595645,0.00038775598,6.602839e-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.000007803321,0.00002003751,0.000031058113,0.000030595773,0.000027774191,0.000001858245,0.0045178575,0.38857824,0.004380826,0.0298893,6.4796936e-8,0.5725146],"study_design_scores_gemma":[0.00007587235,0.00012067376,0.00014614812,0.00015329066,0.000049750626,0.000013679109,0.0000015092996,0.9152804,0.0045402884,0.07931377,0.0000011311114,0.00030346203],"about_ca_topic_score_codex":0.000024421128,"about_ca_topic_score_gemma":0.00018732631,"teacher_disagreement_score":0.57221115,"about_ca_system_score_codex":0.0002353494,"about_ca_system_score_gemma":0.00026314618,"threshold_uncertainty_score":0.99992687},"labels":[],"label_agreement":null},{"id":"W2775713557","doi":"10.1007/s11241-017-9297-0","title":"Delay-dependent partial order reduction technique for real time systems","year":2017,"lang":"en","type":"article","venue":"Real-Time Systems","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":"Polytechnique Montréal","funders":"","keywords":"Reachability; Partial order reduction; Convex hull; Reduction (mathematics); Petri net; Regular polygon; Context (archaeology); Set (abstract data type); Computer science; State space; Automaton; State (computer science); Hull; Identity (music); Order (exchange); Mathematics; Model checking; Algorithm; Theoretical computer science; Geometry; Physics","score_opus":0.03138281613212452,"score_gpt":0.3137023800549307,"score_spread":0.28231956392280616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775713557","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.0041797836,0.00007293246,0.96482074,0.000110963236,0.0045181355,0.0036700957,0.000035075398,0.0007557434,0.021836525],"genre_scores_gemma":[0.45025808,0.00017502121,0.5057326,0.000009088963,0.003685222,0.005066744,0.00007600263,0.00018219445,0.03481503],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968378,0.00044390978,0.00078093115,0.0007950319,0.00057532516,0.0005670067],"domain_scores_gemma":[0.9958003,0.000091401605,0.00093782623,0.0025271678,0.00046116905,0.00018212064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032243389,0.00030670143,0.00051026366,0.00015837423,0.00074920576,0.00092987716,0.0017056952,0.0003357474,0.000010506018],"category_scores_gemma":[0.00023548424,0.00028925677,0.000120678254,0.00017415502,0.00009945252,0.0011686279,0.00024881065,0.0001640213,0.00046130005],"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.00016346732,0.00023219682,0.00008697319,0.00083660154,0.00019643974,0.00003015827,0.00076389534,0.0033746518,0.81318057,0.16181459,0.012297599,0.0070228833],"study_design_scores_gemma":[0.0010406893,0.0005850955,0.0002833181,0.00055107847,0.000075366755,0.0010198184,0.0000853917,0.9309486,0.048752926,0.00048681552,0.015113483,0.0010573927],"about_ca_topic_score_codex":0.0022050734,"about_ca_topic_score_gemma":0.0000017386751,"teacher_disagreement_score":0.927574,"about_ca_system_score_codex":0.0003127849,"about_ca_system_score_gemma":0.00017547702,"threshold_uncertainty_score":0.99995595},"labels":[],"label_agreement":null},{"id":"W2778034045","doi":"10.1145/3158149","title":"Strategy synthesis for linear arithmetic games","year":2017,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":36,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reachability; Computer science; Combinatorial game theory; Satisfiability; Dimension (graph theory); Game tree; Game theory; Repeated game; Theoretical computer science; Sequential game; Mathematical economics; Mathematics; Combinatorics","score_opus":0.04933114638016753,"score_gpt":0.34786677953858947,"score_spread":0.2985356331584219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778034045","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91997993,0.00066160585,0.046841145,0.014386967,0.0013572645,0.0038918357,0.00002367272,0.0010331911,0.011824411],"genre_scores_gemma":[0.4472399,0.0000051681945,0.5523515,0.000031180993,0.00006223983,0.0001252873,1.2903651e-7,0.000010292644,0.00017429591],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989742,0.000009069301,0.00020460041,0.00030217972,0.00025407856,0.00025589622],"domain_scores_gemma":[0.9978813,0.00016415949,0.00048176554,0.0012199002,0.00021142658,0.000041450774],"candidate_categories":["metaresearch","open_science"],"consensus_categories":[],"category_scores_codex":[0.00088166806,0.0001340464,0.00017558425,0.000062675834,0.00037367633,0.00040094147,0.00560471,0.00006884993,0.0000013585355],"category_scores_gemma":[0.010779417,0.00009178014,0.00011714353,0.00010437752,0.00014888887,0.00048038585,0.0007899685,0.000116924035,0.0000032945954],"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.000022965454,0.00009111762,0.0014033022,0.00024040448,0.000032045773,3.1807267e-7,0.0005612883,0.000004373607,0.0062858067,0.12355352,0.00024640755,0.8675584],"study_design_scores_gemma":[0.0003780859,0.0004408424,0.014788986,0.0004150259,0.00006420086,0.0000151442855,0.00074344437,0.007087735,0.9464869,0.023406683,0.0057756035,0.00039732974],"about_ca_topic_score_codex":0.000018489787,"about_ca_topic_score_gemma":7.541272e-7,"teacher_disagreement_score":0.9402011,"about_ca_system_score_codex":0.000021209524,"about_ca_system_score_gemma":0.000020394353,"threshold_uncertainty_score":0.99977547},"labels":[],"label_agreement":null},{"id":"W2781885368","doi":"10.1145/3147660","title":"Mining Timed Regular Specifications from System Traces","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":28,"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 Waterloo","funders":"","keywords":"Speedup; Computer science; Property (philosophy); Fragment (logic); Event (particle physics); State (computer science); Theoretical computer science; Algorithm; Parallel computing","score_opus":0.06219605248601161,"score_gpt":0.29068639963480536,"score_spread":0.22849034714879374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781885368","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.032216433,0.000121724916,0.9587634,0.00017612903,0.0043667196,0.00046987852,0.000014395555,0.0013261347,0.002545189],"genre_scores_gemma":[0.57740813,0.0000021883031,0.42194822,0.00003077282,0.00038291552,0.000030794006,0.000004915452,0.000023074565,0.00016901425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966654,0.00054962735,0.00082300015,0.000902788,0.00058678,0.00047239367],"domain_scores_gemma":[0.9957286,0.0005712618,0.00040614346,0.0028121462,0.0003127003,0.00016910676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010655412,0.00031322142,0.0003915933,0.00032535614,0.0008979569,0.0004590466,0.002247667,0.00019121618,0.000015530539],"category_scores_gemma":[0.0000937056,0.0003199703,0.00014016406,0.001021311,0.00014255187,0.000526754,0.0000351061,0.00027908097,0.0004642871],"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.0002126828,0.0012722849,0.0002083976,0.00059296086,0.001219115,0.000061661056,0.065355524,0.07631462,0.029989526,0.26869664,0.00346015,0.5526165],"study_design_scores_gemma":[0.0005166753,0.00020369436,0.00042230982,0.00047166055,0.000046525376,0.00008065777,0.0034857858,0.97454727,0.01646392,0.00026815137,0.0029879722,0.0005054045],"about_ca_topic_score_codex":0.00012647148,"about_ca_topic_score_gemma":0.0000051810007,"teacher_disagreement_score":0.89823264,"about_ca_system_score_codex":0.00027346727,"about_ca_system_score_gemma":0.000080179736,"threshold_uncertainty_score":0.99992526},"labels":[],"label_agreement":null},{"id":"W2785433728","doi":"10.29007/zxc5","title":"A Few Things We Heard About RV Tools (Position Paper)","year":2018,"lang":"en","type":"article","venue":"Kalpa publications in computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Dozen; Computer science; Position (finance); Position paper; Data science; World Wide Web; Business; Finance; Mathematics","score_opus":0.05417842030145728,"score_gpt":0.3327876516048202,"score_spread":0.2786092313033629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785433728","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.008296246,0.00012785224,0.9567549,0.013633836,0.00068002695,0.00036173366,0.0000029285823,0.00064492685,0.019497532],"genre_scores_gemma":[0.3120873,0.00001714167,0.685877,0.0015195166,0.00028136667,0.000038428112,0.000014016429,0.000014516945,0.00015067216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773705,0.0002594131,0.000598011,0.00062462274,0.00031983227,0.00046104824],"domain_scores_gemma":[0.99772185,0.00030800002,0.0002680092,0.0011822709,0.00041571906,0.00010415894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019165887,0.0001832373,0.00019548876,0.00045508117,0.00049492385,0.000861749,0.0015326805,0.00012416861,0.00003577104],"category_scores_gemma":[0.0007627334,0.00019144478,0.00006781641,0.0021769786,0.0001406783,0.0033645157,0.0004902283,0.00032202952,0.00023420039],"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.0000024175038,0.00009281191,0.00061254756,0.000016606578,0.000007791996,5.341428e-7,0.0025481388,0.00008861859,0.0010809473,0.6602752,0.0020284094,0.33324596],"study_design_scores_gemma":[0.0004931667,0.00013691183,0.08108753,0.00023343416,0.000007700559,0.00008114828,0.00013765843,0.7348272,0.002823176,0.020891394,0.1587055,0.00057513826],"about_ca_topic_score_codex":0.000035500376,"about_ca_topic_score_gemma":0.000009379276,"teacher_disagreement_score":0.7347386,"about_ca_system_score_codex":0.00023174561,"about_ca_system_score_gemma":0.00014301506,"threshold_uncertainty_score":0.8309865},"labels":[],"label_agreement":null},{"id":"W2785870089","doi":"10.29007/3pxg","title":"Improving SAT Solver Performance with Structure-based Preferential Bumping","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bumping; Solver; Exploit; Computer science; Boolean satisfiability problem; Computational science; Parallel computing; Theoretical computer science; Programming language; Engineering","score_opus":0.0164611457732456,"score_gpt":0.25275935420218226,"score_spread":0.23629820842893667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785870089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4719849,0.000008315819,0.5266193,0.00004446189,0.00076307566,0.00010882111,3.3118826e-7,0.000125263,0.00034552783],"genre_scores_gemma":[0.55223113,3.2932073e-7,0.44749022,0.00007454335,0.00018397198,0.000001958316,0.0000014416843,0.000008323914,0.000008108411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984594,0.00010322237,0.0003089698,0.00045362857,0.00026448,0.00041028223],"domain_scores_gemma":[0.9989857,0.00007383042,0.00020255608,0.0005872561,0.000103640756,0.000047024507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047506497,0.00017875007,0.00017528638,0.00013547535,0.00028919723,0.00017470401,0.0007687495,0.00007065337,0.000018023458],"category_scores_gemma":[0.00009740292,0.00015971727,0.000023252393,0.000501064,0.00017460043,0.00073314505,0.00029695488,0.00023756041,0.000008811713],"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.00026712238,0.000118332086,0.076223254,0.00048065913,0.00004252121,0.000015030854,0.009898669,0.016731586,0.010630768,0.03422773,0.000055755343,0.8513086],"study_design_scores_gemma":[0.00044600232,0.00038763578,0.032089293,0.0001492982,0.0000037312095,0.000016543921,0.000049477305,0.89468616,0.07129196,0.00025441125,0.0003340734,0.0002914207],"about_ca_topic_score_codex":0.000027695602,"about_ca_topic_score_gemma":0.000026869422,"teacher_disagreement_score":0.87795454,"about_ca_system_score_codex":0.00009964316,"about_ca_system_score_gemma":0.00010845215,"threshold_uncertainty_score":0.6513081},"labels":[],"label_agreement":null},{"id":"W2787370237","doi":"10.1109/edis.2017.8284024","title":"Automotive safety verification under temporal failure of adaptive cruise control system using statistical model checking","year":2017,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cruise control; Automotive industry; Computer science; Throttle; System safety; Control system; Reliability engineering; Probabilistic logic; Statistical model; Automaton; Intelligent transportation system; Control (management); Automotive engineering; Engineering; Artificial intelligence","score_opus":0.07012594166175608,"score_gpt":0.32840629892320544,"score_spread":0.2582803572614494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787370237","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.0032470082,0.000007764288,0.9934534,0.00013207541,0.00019753541,0.0003479824,0.00003206937,0.00013263582,0.0024495227],"genre_scores_gemma":[0.5123301,3.3114912e-7,0.4876021,0.000016581376,0.00001578592,0.000005909648,0.0000016484373,0.000006264446,0.000021282869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834603,0.00019403579,0.00045624448,0.00040551793,0.0003602619,0.00023788435],"domain_scores_gemma":[0.99767894,0.000096297736,0.0005951314,0.0011282455,0.00041405845,0.00008731157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009340139,0.00015970114,0.00028945616,0.00007679674,0.0004083065,0.00016467315,0.0009553468,0.00011171364,0.0000050073],"category_scores_gemma":[0.00023098975,0.00014566163,0.000056855242,0.00008807829,0.00018643313,0.0011240684,0.00015894375,0.00014488214,0.00000866671],"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.00004817511,0.000032871252,0.00023597103,0.000034975754,0.000027693208,0.000001528279,0.00031364596,0.03225779,0.0020734996,0.96310884,0.000014886376,0.0018501156],"study_design_scores_gemma":[0.0004931892,0.00004543973,0.0069133504,0.00006241388,0.000021126529,0.0000067315605,0.0002519954,0.98647326,0.0029812702,0.0025885638,0.0000069199746,0.00015575142],"about_ca_topic_score_codex":0.00017266977,"about_ca_topic_score_gemma":0.000009127075,"teacher_disagreement_score":0.96052027,"about_ca_system_score_codex":0.00025621077,"about_ca_system_score_gemma":0.0001913704,"threshold_uncertainty_score":0.5939909},"labels":[],"label_agreement":null},{"id":"W2788459610","doi":"10.1609/aaai.v32i1.12203","title":"A SAT+CAS Method for Enumerating Williamson Matrices of Even Order","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Enumeration; Solver; Satisfiability; Order (exchange); Symbolic computation; Field (mathematics); Boolean satisfiability problem; Computation; Domain (mathematical analysis); Discrete mathematics; Computer science; Mathematics; Algebra over a field; Combinatorics; Algorithm; Pure mathematics; Mathematical optimization","score_opus":0.1032482280250316,"score_gpt":0.38150325656186534,"score_spread":0.27825502853683376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788459610","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.027966488,0.000025383768,0.966827,0.0009000074,0.0004776618,0.00060014805,0.000006573217,0.00006256971,0.003134174],"genre_scores_gemma":[0.48944035,0.000010314227,0.51027906,0.000072392,0.00008548869,0.00003546178,2.4736104e-7,0.000008734401,0.00006791942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980319,0.00004252079,0.0007099122,0.00046614325,0.00043706517,0.0003124615],"domain_scores_gemma":[0.9966972,0.00024370936,0.000815922,0.0003733331,0.0018121866,0.000057669757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017394008,0.00019642312,0.00030076038,0.0001474906,0.00021833708,0.0001418783,0.0020396283,0.00010475424,0.00003032759],"category_scores_gemma":[0.0018938361,0.00015024026,0.00011416436,0.0010169571,0.00027823175,0.0005436336,0.00030202052,0.00016902511,0.000026413554],"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.000059784667,0.0000606011,0.000070630245,0.0000748889,0.000013182369,2.4142045e-8,0.002192733,0.00002125089,0.091103084,0.70198315,0.0000559596,0.2043647],"study_design_scores_gemma":[0.000019467097,0.00031827556,0.000088418914,0.00013984261,0.000011490697,0.0000020537436,0.00024704201,0.24454114,0.64604825,0.10830647,0.00015700926,0.00012057905],"about_ca_topic_score_codex":0.000045833,"about_ca_topic_score_gemma":0.000008289138,"teacher_disagreement_score":0.5936767,"about_ca_system_score_codex":0.000038510017,"about_ca_system_score_gemma":0.00011150935,"threshold_uncertainty_score":0.61266196},"labels":[],"label_agreement":null},{"id":"W2788677878","doi":"10.23919/acc.2018.8431863","title":"Robustly Complete Reach-and-Stay Control Synthesis for Switched Systems via Interval Analysis","year":2018,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Partition (number theory); Interval (graph theory); Computer science; Abstraction; Algorithm; Partition problem; State space; Mathematics; Mathematical optimization","score_opus":0.0465434081024166,"score_gpt":0.29556835434437895,"score_spread":0.24902494624196236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788677878","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.0061061676,0.000035229143,0.9915709,0.00026448784,0.00031361668,0.00041274933,0.000010281179,0.00019127697,0.0010953106],"genre_scores_gemma":[0.5691036,0.0000010293032,0.43049562,0.00011695792,0.00007621432,0.00008925888,0.0000015049162,0.000006305193,0.00010947805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843246,0.00023039186,0.00039421942,0.00045829744,0.00020729435,0.00027735974],"domain_scores_gemma":[0.998164,0.0005046582,0.00018151793,0.0007758135,0.00027326256,0.00010075246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016241965,0.0001511245,0.00039532865,0.00023132731,0.00015622891,0.00021399526,0.00072359736,0.00007529376,0.000023561211],"category_scores_gemma":[0.00033054728,0.00012299807,0.00014795779,0.0005551558,0.00010165622,0.00039032707,0.00011096055,0.000060101418,0.000033118875],"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.00041856256,0.00029641468,0.008772537,0.0003351179,0.005909023,0.00000510892,0.0028728843,0.0019670806,0.03761258,0.7802889,0.0023389095,0.15918288],"study_design_scores_gemma":[0.00025114923,0.00013041982,0.0027751655,0.000008775612,0.00027207195,0.0000065881477,0.00004862647,0.99271065,0.0020899153,0.0004925007,0.0010449295,0.00016922799],"about_ca_topic_score_codex":0.00014965878,"about_ca_topic_score_gemma":0.00003186783,"teacher_disagreement_score":0.9907436,"about_ca_system_score_codex":0.00006225877,"about_ca_system_score_gemma":0.000016652639,"threshold_uncertainty_score":0.5015716},"labels":[],"label_agreement":null},{"id":"W2796295393","doi":"10.1145/3178126.3178153","title":"ROCS","year":2018,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"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 Waterloo","funders":"","keywords":"Realizability; Robustness (evolution); Computer science; Nonlinear system; Robust control; Control system; Interval (graph theory); Control theory (sociology); Algorithm; Control (management); Mathematics; Engineering; Artificial intelligence","score_opus":0.02828522585651348,"score_gpt":0.3114379991752826,"score_spread":0.2831527733187691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796295393","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.0013230806,0.0000024961387,0.84773445,0.00015203447,0.00027024784,0.000016098962,1.8340822e-8,0.00012242458,0.15037917],"genre_scores_gemma":[0.12548576,4.078448e-7,0.8729709,0.00036829046,0.00005989149,0.0000012923497,3.6786705e-8,9.242036e-7,0.001112481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973345,0.000014679298,0.000043588538,0.00008359137,0.000060700175,0.00006396378],"domain_scores_gemma":[0.99964255,0.000007330067,0.000011494915,0.00028335405,0.00003679977,0.000018488476],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015478382,0.000020589267,0.000019226258,0.00001783847,0.00003464996,0.000030166802,0.0003528582,0.000012314236,0.00005517046],"category_scores_gemma":[0.000029979314,0.00001663533,0.000007241201,0.00013199139,0.000022702206,0.00024501482,0.00006711116,0.000016174314,0.00079691247],"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":[2.5152454e-7,0.0000034437733,0.000043711494,3.7053638e-7,4.681167e-7,9.962054e-8,0.00009134137,1.8253536e-7,0.0005997116,0.9107107,0.0015128204,0.08703693],"study_design_scores_gemma":[0.00012901289,0.00019404654,0.011778679,0.0000034626853,0.0000010212549,0.000016496184,0.000015652906,0.396533,0.2938654,0.04838863,0.24888542,0.00018914789],"about_ca_topic_score_codex":0.0000035419584,"about_ca_topic_score_gemma":8.789988e-7,"teacher_disagreement_score":0.86232203,"about_ca_system_score_codex":0.0000060518064,"about_ca_system_score_gemma":0.000007657296,"threshold_uncertainty_score":0.9999811},"labels":[],"label_agreement":null},{"id":"W2796695740","doi":"10.23638/lmcs-14(4:12)2018","title":"Reasoning with Finite Sets and Cardinality Constraints in SMT","year":2018,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; National Science Foundation","keywords":"Cardinality (data modeling); Computer science; Venn diagram; Theoretical computer science; Satisfiability; DPLL algorithm; Automated reasoning; Boolean satisfiability problem; Intersection (aeronautics); Answer set programming; Satisfiability modulo theories; Propositional calculus; Modular design; Algorithm; Mathematics; Programming language; Logic programming; Data mining","score_opus":0.10177870130467023,"score_gpt":0.41461597540848916,"score_spread":0.3128372741038189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796695740","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.038598087,0.00011106258,0.9580728,0.0001509088,0.0013214544,0.0005103347,0.0000034416441,0.0001426487,0.001089293],"genre_scores_gemma":[0.112861186,0.000021299058,0.88667923,0.00028861017,0.00008230814,0.000054291268,0.0000010174582,0.000009725367,0.0000023230014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930615,0.0021726305,0.0007654615,0.0023708036,0.0007860521,0.00084354053],"domain_scores_gemma":[0.9961041,0.001229458,0.00039452378,0.0017320525,0.00026740675,0.00027245015],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.01728413,0.0004569063,0.0007746341,0.0006181016,0.00019155962,0.0007348629,0.0034855173,0.00035604887,0.0000064884075],"category_scores_gemma":[0.0015518034,0.00036879707,0.000067099674,0.002096783,0.0033865408,0.000737913,0.0058770264,0.0013319509,0.0000043920154],"study_design_candidate":"design_other","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.000023197714,0.000098218,0.013191678,0.00010210945,0.000008347682,0.000099509714,0.0014546047,0.0059841606,0.00010699051,0.040517315,0.000003948996,0.9384099],"study_design_scores_gemma":[0.00027715502,0.00024145244,0.15090975,0.00047835716,0.0000043784607,0.00009261349,0.000009319635,0.78558385,0.0006390175,0.061211545,0.000044755627,0.0005077809],"about_ca_topic_score_codex":0.00006978351,"about_ca_topic_score_gemma":0.000009249893,"teacher_disagreement_score":0.93790215,"about_ca_system_score_codex":0.00028067623,"about_ca_system_score_gemma":0.0004540589,"threshold_uncertainty_score":0.9998764},"labels":[],"label_agreement":null},{"id":"W2803843036","doi":"10.1007/978-3-319-10575-8_8","title":"BDD-Based Symbolic Model Checking","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"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":"Binary decision diagram; Model checking; Computer science; Symbolic trajectory evaluation; Boolean function; Formal verification; Theoretical computer science; Abstraction model checking; Programming language; Context (archaeology); Domain (mathematical analysis); Key (lock); Algorithm; Mathematics; Operating system","score_opus":0.06917413523250482,"score_gpt":0.29361193146973785,"score_spread":0.22443779623723303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803843036","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.000001991997,0.000023888477,0.52604926,0.000049594055,0.00023650023,0.000096235235,0.0000014561921,0.0002278025,0.47331327],"genre_scores_gemma":[0.00019612131,0.0000063067437,0.64496446,0.0005418614,0.00012308634,0.0000074870254,0.000004223593,0.000027258684,0.35412917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845356,0.000017502787,0.00031822175,0.00056561903,0.000400287,0.0002448279],"domain_scores_gemma":[0.9980883,0.000035472847,0.00021341414,0.0014027033,0.00017105392,0.000089081324],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046775118,0.00028017227,0.000256111,0.00020117576,0.000092087364,0.00013031534,0.0014280736,0.0003185001,0.00030412278],"category_scores_gemma":[0.000031258936,0.0002629194,0.00012822475,0.00004829426,0.000096747004,0.0002828553,0.00025044085,0.000256001,0.0008819595],"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.0000015774568,0.0000048190045,2.645826e-7,0.000018076607,0.000007905493,0.0000012127181,0.00007429936,0.00030403837,0.00003886369,0.98511565,0.0015425902,0.012890722],"study_design_scores_gemma":[0.00007346538,0.00003160944,0.0000018426882,0.000062650084,0.000008358034,0.0000029085168,4.7592027e-7,0.8246659,0.0014216524,0.13363442,0.03979119,0.0003054987],"about_ca_topic_score_codex":0.0000033407882,"about_ca_topic_score_gemma":0.000001836896,"teacher_disagreement_score":0.8514812,"about_ca_system_score_codex":0.00009856562,"about_ca_system_score_gemma":0.00021231346,"threshold_uncertainty_score":0.9999823},"labels":[],"label_agreement":null},{"id":"W28039488","doi":"10.1007/978-3-319-03089-0_11","title":"How Good is Weak-Stabilization?","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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; Geology","score_opus":0.025396128938620997,"score_gpt":0.2639165069636338,"score_spread":0.23852037802501277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28039488","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.00001539101,0.0003033506,0.9811889,0.0023946965,0.0024206294,0.0005873637,0.0000047117487,0.00025247916,0.012832466],"genre_scores_gemma":[0.009308128,0.000052676016,0.98501545,0.0015406964,0.00039422483,0.00002422431,0.000004637729,0.000042729294,0.0036172282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956714,0.00006414547,0.0005072295,0.0017936042,0.0012666445,0.0006970138],"domain_scores_gemma":[0.9961062,0.0002852783,0.00042766568,0.0024650746,0.00050921686,0.00020652902],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009854496,0.00057417684,0.0004942218,0.0007937254,0.00028430307,0.001655948,0.0047447016,0.0004375404,0.00008438854],"category_scores_gemma":[0.00022082601,0.00052741345,0.00013570685,0.00092788,0.000727288,0.002001719,0.0013861764,0.0007578799,0.00019839262],"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.0000013368436,0.000022337132,0.000039199225,0.00004340646,0.000007954709,0.000006422946,0.0006983659,0.0020742405,0.00016562713,0.29586652,0.00012507064,0.7009495],"study_design_scores_gemma":[0.00018901117,0.00015733158,0.0001531522,0.00020415615,0.0000075243033,0.000050804785,3.4351714e-7,0.7063241,0.0054026763,0.26531088,0.02132244,0.0008775643],"about_ca_topic_score_codex":0.00001181108,"about_ca_topic_score_gemma":0.000010213373,"teacher_disagreement_score":0.70424986,"about_ca_system_score_codex":0.00036725812,"about_ca_system_score_gemma":0.00045146118,"threshold_uncertainty_score":0.9997178},"labels":[],"label_agreement":null},{"id":"W2807813222","doi":"10.24963/ijcai.2018/651","title":"LTL Realizability via Safety and Reachability Games","year":2018,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Realizability; Reachability; Computer science; Bounded function; Duality (order theory); Theoretical computer science; Mathematical optimization; Mathematics; Algorithm; Discrete mathematics","score_opus":0.019357731195057053,"score_gpt":0.2962855395209094,"score_spread":0.27692780832585234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807813222","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.022022191,0.000015412967,0.9481994,0.0004955287,0.00022873843,0.00013561692,8.399075e-7,0.00021437343,0.028687928],"genre_scores_gemma":[0.37586108,0.0000066104367,0.62375146,0.0001603628,0.000041381332,0.0000022693712,4.754241e-7,0.0000025316215,0.00017384032],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99885744,0.00020264958,0.00022470915,0.00040528868,0.00014543133,0.0001644783],"domain_scores_gemma":[0.99865925,0.00009535489,0.000054665,0.000991005,0.00012211507,0.00007762513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017152356,0.00008298923,0.00011061912,0.000029606406,0.00011562182,0.000050637143,0.0004067724,0.00005525678,0.00005004036],"category_scores_gemma":[0.00032601634,0.00006799172,0.000022893097,0.00021468967,0.00030252623,0.00046989898,0.000253599,0.000064826796,0.000036951933],"study_design_candidate":"observational","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.000027667898,0.000053246113,0.0060464065,0.000020910202,0.000004730285,2.6250342e-7,0.0010214238,5.975658e-7,0.0010159644,0.41694346,0.00020185378,0.57466346],"study_design_scores_gemma":[0.00030619587,0.00039824538,0.61458224,0.00000965394,0.0000053689214,0.000029785286,0.000046117475,0.21296625,0.02338017,0.11538905,0.032529533,0.00035741256],"about_ca_topic_score_codex":0.00024261259,"about_ca_topic_score_gemma":0.000030226402,"teacher_disagreement_score":0.6085358,"about_ca_system_score_codex":0.000044080338,"about_ca_system_score_gemma":0.000021533537,"threshold_uncertainty_score":0.27726218},"labels":[],"label_agreement":null},{"id":"W2810026609","doi":"10.1609/icaps.v28i1.13919","title":"Compiling Optimal Numeric Planning to Mixed Integer Linear Programming","year":2018,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Integer programming; Mathematical optimization; Linear programming; Computer science; Encoding (memory); Heuristic; Integer (computer science); Dependency (UML); Simple (philosophy); State (computer science); Class (philosophy); Branch and price; Action (physics); Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.06534018288188553,"score_gpt":0.34910988811430615,"score_spread":0.2837697052324206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810026609","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8236452,0.000020645175,0.17142029,0.000764758,0.0008147702,0.00018561655,0.000002130985,0.0004946309,0.0026519904],"genre_scores_gemma":[0.60675544,8.3741367e-7,0.3929944,0.00012202651,0.00007923332,0.00001059758,0.0000010189049,0.0000081009675,0.000028351074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984666,0.000017173055,0.00037887835,0.00040861158,0.00046220855,0.00026650593],"domain_scores_gemma":[0.9987142,0.00006671661,0.0003148544,0.00014493396,0.0006665848,0.000092704235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007815604,0.00018627656,0.00019331764,0.00023366736,0.00025385,0.00034694647,0.0013225834,0.00008098199,0.0000054086845],"category_scores_gemma":[0.00057786825,0.0001499904,0.000046969893,0.00041433892,0.00010826415,0.00043970734,0.00044292683,0.0002856196,0.000011832354],"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.00064872706,0.00029817893,0.040758204,0.00025637142,0.00038652585,0.000009373552,0.03168927,0.04263869,0.24804334,0.5894772,0.00077096367,0.045023147],"study_design_scores_gemma":[0.00016211202,0.00015996637,0.0024278734,0.00083103526,0.0000064021133,0.000025675941,0.00077749917,0.9482169,0.04662629,0.00033993553,0.0002521163,0.0001741645],"about_ca_topic_score_codex":0.000008767527,"about_ca_topic_score_gemma":1.1528551e-7,"teacher_disagreement_score":0.90557826,"about_ca_system_score_codex":0.000048016896,"about_ca_system_score_gemma":0.000049628812,"threshold_uncertainty_score":0.61164314},"labels":[],"label_agreement":null},{"id":"W2810178509","doi":"10.1609/icaps.v28i1.13908","title":"Finite LTL Synthesis as Planning","year":2018,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":58,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Linear temporal logic; Leverage (statistics); Automaton; Program synthesis; Finite-state machine; Theoretical computer science; Bottleneck; Transformation (genetics); Exploit; Algorithm; Artificial intelligence","score_opus":0.06458275588763768,"score_gpt":0.33623961333948554,"score_spread":0.27165685745184787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810178509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93707895,0.000034277455,0.014083892,0.0013405511,0.0007558843,0.00011355396,0.0000036728695,0.0005380907,0.046051104],"genre_scores_gemma":[0.8807368,0.000005330282,0.118892595,0.00018924905,0.00007260361,0.000010584252,5.2541833e-7,0.0000073968986,0.00008488901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882126,0.000014673816,0.00027318657,0.00030457613,0.000408737,0.00017757676],"domain_scores_gemma":[0.99884415,0.00019769673,0.00032025806,0.0001319037,0.00045313223,0.000052838506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062576984,0.00013956167,0.00014133276,0.00016722357,0.00021455938,0.00030630865,0.0012164399,0.00007939341,0.000015991905],"category_scores_gemma":[0.0016805881,0.000109004955,0.00003892874,0.00022222767,0.00012167532,0.0004468579,0.0002770967,0.00019203615,0.000017542261],"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.00014851254,0.000068513975,0.015284948,0.000084509724,0.00013430713,0.0000032182859,0.0058341185,0.0016929148,0.09485862,0.874532,0.00040342726,0.0069549577],"study_design_scores_gemma":[0.000102963444,0.00007381557,0.003831462,0.000854181,0.0000070883957,0.00002254021,0.00033605398,0.8563024,0.13355324,0.004687189,0.000097802484,0.00013127018],"about_ca_topic_score_codex":0.000009582071,"about_ca_topic_score_gemma":9.070921e-8,"teacher_disagreement_score":0.8698448,"about_ca_system_score_codex":0.000030034047,"about_ca_system_score_gemma":0.000058136095,"threshold_uncertainty_score":0.4445093},"labels":[],"label_agreement":null},{"id":"W2810353660","doi":"10.1007/978-3-319-94205-6_10","title":"Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Toronto","funders":"","keywords":"Maximum satisfiability problem; Satisfiability modulo theories; Satisfiability; Computer science; Conjunctive normal form; Modulo; Propositional formula; Solver; Propositional calculus; Set (abstract data type); Boolean satisfiability problem; Theoretical computer science; Answer set programming; Algorithm; Propositional variable; Programming language; Mathematics; Discrete mathematics; Boolean function","score_opus":0.0335173284289863,"score_gpt":0.30900776724270745,"score_spread":0.27549043881372115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810353660","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.00013194855,0.00012820482,0.9931666,0.00037284294,0.0034831006,0.0010063209,0.00003591635,0.00028478072,0.0013902338],"genre_scores_gemma":[0.011787871,0.000010209601,0.98628986,0.0007332135,0.00091825787,0.000054408738,0.000010069018,0.000044447985,0.00015167799],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99503124,0.00011269806,0.0008194034,0.0021787107,0.00093467865,0.00092328986],"domain_scores_gemma":[0.9948598,0.0012598955,0.0005334848,0.0025219927,0.0006447864,0.00018002582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005067068,0.0006344986,0.00065205444,0.00055628654,0.00052363036,0.00070522114,0.0044918694,0.0004527842,0.000028603195],"category_scores_gemma":[0.0008746713,0.0005807918,0.0002000429,0.0006225887,0.0014322004,0.0010257326,0.0016073716,0.0006408887,0.00003490599],"study_design_candidate":"design_other","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.000009439727,0.000014746608,0.000037211583,0.00007944919,0.000010818613,0.000003753082,0.0015075714,0.0020846114,0.00013069846,0.1317077,0.000027009613,0.864387],"study_design_scores_gemma":[0.00012599434,0.00017426745,0.00009440879,0.00010574182,0.0000055040273,0.000025069594,3.6130598e-7,0.43129343,0.0026036766,0.564101,0.0010415902,0.0004289594],"about_ca_topic_score_codex":0.00002035265,"about_ca_topic_score_gemma":0.000022071872,"teacher_disagreement_score":0.86395806,"about_ca_system_score_codex":0.00045794787,"about_ca_system_score_gemma":0.0004813946,"threshold_uncertainty_score":0.99966437},"labels":[],"label_agreement":null},{"id":"W2814827538","doi":"10.24963/ijcai.2018/723","title":"Reduced Cost Fixing for Maximum Satisfiability","year":2018,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"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":"Helsingin Yliopisto","keywords":"Maximum satisfiability problem; Boolean satisfiability problem; Satisfiability; Solver; Computer science; Integer programming; Set (abstract data type); Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Boolean function; Programming language","score_opus":0.05785960665417542,"score_gpt":0.3490497924107515,"score_spread":0.29119018575657607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2814827538","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.009922148,0.0000031192044,0.9748842,0.00043638196,0.000705138,0.00036623824,0.0000011843869,0.00018181802,0.013499777],"genre_scores_gemma":[0.2317915,3.2350385e-7,0.7676248,0.00021201787,0.000096434065,0.00004656229,6.7796145e-7,0.0000034164118,0.00022427544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921644,0.000066358436,0.00015902708,0.00027049298,0.000104216066,0.0001834936],"domain_scores_gemma":[0.9990198,0.00012699162,0.00004967942,0.0006074882,0.00014821935,0.00004784776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011264314,0.00006234049,0.00007294476,0.000032589465,0.00012674999,0.00007331112,0.0005072911,0.000039218274,0.000042744894],"category_scores_gemma":[0.00048688857,0.000055199376,0.000032144657,0.00018398091,0.00006916953,0.00039269935,0.00010341663,0.000037646714,0.00006870552],"study_design_candidate":"design_other","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.0000126854975,0.000031542968,0.00040082738,0.000017463324,0.0000052448368,1.1929886e-7,0.00047804316,0.0000032297048,0.012543473,0.40298748,0.0030430316,0.5804769],"study_design_scores_gemma":[0.0004168356,0.00029670077,0.01622008,0.00001257172,0.000004496937,0.0000077649565,0.000037129703,0.40268192,0.39820254,0.13785535,0.043948162,0.00031645238],"about_ca_topic_score_codex":0.000013363295,"about_ca_topic_score_gemma":0.0000050766917,"teacher_disagreement_score":0.58016044,"about_ca_system_score_codex":0.000044666936,"about_ca_system_score_gemma":0.00003473006,"threshold_uncertainty_score":0.22509652},"labels":[],"label_agreement":null},{"id":"W28306372","doi":"10.1200/jop.2016.016808","title":"Verification of an In-place Quicksort in ACL2","year":2006,"lang":"en","type":"article","venue":"Journal of Oncology Practice","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Quicksort; Computer science; Correctness; Equivalence (formal languages); Sorting algorithm; sort; Theoretical computer science; Simple (philosophy); Algorithm; Sorting; Programming language; Mathematics; Discrete mathematics","score_opus":0.028656881917091086,"score_gpt":0.38389889294944674,"score_spread":0.35524201103235564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28306372","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7606805,0.0002297704,0.21941291,0.0043400056,0.0010051947,0.00017476069,4.2584594e-7,0.000013367234,0.014143085],"genre_scores_gemma":[0.4368685,0.000047438138,0.56287956,0.00012432094,0.000058593396,0.0000019020079,2.984707e-7,0.000003109104,0.000016287353],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9977813,0.0009265654,0.0007720116,0.0001317897,0.00025126853,0.00013708301],"domain_scores_gemma":[0.99731874,0.00064404553,0.0014148311,0.0002876992,0.00029809444,0.000036603073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053864303,0.00006579932,0.00022115292,0.00033498715,0.000019475392,0.000020048512,0.00059320324,0.00012125059,0.000004302889],"category_scores_gemma":[0.0015683045,0.00006402685,0.000030254816,0.0005322291,0.00004629145,0.0029994692,0.00004144792,0.00040276017,0.0000050512817],"study_design_candidate":"observational","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.0026173557,0.009174517,0.020204214,0.00009087468,0.000058613277,0.00087611494,0.0072649936,0.022574134,0.116313174,0.30340672,0.0015692845,0.51585],"study_design_scores_gemma":[0.0060825176,0.0063719777,0.59566694,0.000120815836,0.00007398928,0.004683564,0.0018859041,0.071554564,0.042824924,0.011339729,0.25889006,0.0005049978],"about_ca_topic_score_codex":0.00011781644,"about_ca_topic_score_gemma":0.0000630674,"teacher_disagreement_score":0.57546276,"about_ca_system_score_codex":0.00029298718,"about_ca_system_score_gemma":0.00039773565,"threshold_uncertainty_score":0.2610939},"labels":[],"label_agreement":null},{"id":"W2876334621","doi":"10.24963/ijcai.2018/848","title":"SynKit: LTL Synthesis as a Service","year":2018,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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":"","keywords":"Computer science; Linear temporal logic; Software engineering; Program synthesis; Programming language; Software; Temporal logic; Service (business); Model checking","score_opus":0.031247349675089454,"score_gpt":0.3074605161974025,"score_spread":0.27621316652231304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2876334621","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.013394554,0.000006674781,0.8335513,0.0015102928,0.000383156,0.00006985135,2.5780184e-7,0.0003060981,0.1507778],"genre_scores_gemma":[0.21807702,0.0000022235633,0.77911645,0.0019783797,0.00008553764,0.000015937327,9.657684e-8,0.0000046056502,0.0007197642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99924684,0.0000674933,0.00011883038,0.00023377355,0.00016849127,0.0001645773],"domain_scores_gemma":[0.9989487,0.00012408318,0.000042227068,0.00068598456,0.00014096613,0.000058075275],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040858216,0.00006936276,0.000069143956,0.0000529603,0.000093066694,0.00008994692,0.0009039975,0.000041963176,0.0002806521],"category_scores_gemma":[0.00032253223,0.000058988673,0.00002126498,0.00045527195,0.000033476892,0.00048321055,0.00018944724,0.00004170645,0.0042031095],"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.0000049494956,0.000033208395,0.00007489054,0.00001566337,0.000009408008,0.000001844464,0.0007760061,0.0000017328636,0.0045598913,0.87295973,0.0013717046,0.12019099],"study_design_scores_gemma":[0.00013391598,0.00018394203,0.00601436,0.00004721712,0.000010796767,0.000074087366,0.00010511653,0.16829023,0.74645555,0.027093811,0.051151898,0.00043908096],"about_ca_topic_score_codex":0.00009811196,"about_ca_topic_score_gemma":0.000022837141,"teacher_disagreement_score":0.8458659,"about_ca_system_score_codex":0.00002208931,"about_ca_system_score_gemma":0.00004547828,"threshold_uncertainty_score":0.99657226},"labels":[],"label_agreement":null},{"id":"W2880009070","doi":"10.24963/ijcai.2018/745","title":"An Empirical Study of Branching Heuristics through the Lens of Global Learning Rate","year":2018,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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 Waterloo","funders":"","keywords":"Heuristics; Heuristic; Computer science; Solver; Branching (polymer chemistry); Maximization; Mathematical optimization; Greedy algorithm; Metric (unit); Algorithm; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.07194611468903432,"score_gpt":0.40374013209794035,"score_spread":0.331794017408906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2880009070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43480083,0.0000044077838,0.56222785,0.00005394502,0.00013418014,0.00007681863,2.6741e-7,0.000033976914,0.002667733],"genre_scores_gemma":[0.7411064,8.5831346e-7,0.25876477,0.0000753385,0.000038256072,0.0000012589016,1.1500326e-7,0.0000023095345,0.000010715114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864227,0.0005577782,0.00027100652,0.00018919965,0.00021500877,0.00012473845],"domain_scores_gemma":[0.9989693,0.00011194576,0.0001621061,0.0005743806,0.00016378226,0.000018445555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009348275,0.000069193105,0.00012339318,0.000011327075,0.00012751372,0.000034047647,0.0007742101,0.00002903758,0.000006776759],"category_scores_gemma":[0.00025763715,0.000045530516,0.00002307984,0.0003972943,0.00012450975,0.0004168735,0.0001622031,0.000101380785,0.0000059549425],"study_design_candidate":"observational","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.000102830796,0.0019888454,0.2490275,0.000048791404,0.00011751584,0.0000028318157,0.07598156,0.0061203116,0.0052698683,0.60571265,0.00039415428,0.055233102],"study_design_scores_gemma":[0.00067071524,0.004231544,0.44451684,0.000019418023,0.00003142053,0.000008807392,0.003475335,0.5256421,0.008490331,0.011525354,0.0011414766,0.0002466823],"about_ca_topic_score_codex":0.00012843989,"about_ca_topic_score_gemma":0.000029288296,"teacher_disagreement_score":0.5941873,"about_ca_system_score_codex":0.000017335866,"about_ca_system_score_gemma":0.000031343934,"threshold_uncertainty_score":0.18566805},"labels":[],"label_agreement":null},{"id":"W2883153098","doi":"10.1007/s00165-018-0460-8","title":"Parameterized verification of monotone information systems","year":2018,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Parameterized complexity; Theory of computation; Computer science; State space; Theoretical computer science; Computability; Notation; State (computer science); Mathematics; Algebra over a field; Discrete mathematics; Programming language; Algorithm; Pure mathematics; Arithmetic","score_opus":0.018896035897974454,"score_gpt":0.2746004658031187,"score_spread":0.25570442990514425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883153098","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.19377702,0.000015765112,0.79894847,0.000011961291,0.0009950915,0.00023370447,0.0000018336293,0.00009889243,0.0059172697],"genre_scores_gemma":[0.61535466,0.0000010889146,0.3845432,0.000011361563,0.00007798722,0.0000028240245,0.000003745498,0.0000031697623,0.000001980711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983917,0.00007373076,0.0007802954,0.00015159512,0.00035606942,0.00024665124],"domain_scores_gemma":[0.9979439,0.00006304473,0.0008701663,0.000577897,0.0004973267,0.000047684607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010402036,0.000118448705,0.00024914756,0.00021285706,0.00010726907,0.00006923564,0.00072356605,0.00007061466,0.0000022734243],"category_scores_gemma":[0.00015777838,0.00011601904,0.00005890666,0.0005312075,0.00011581009,0.002367994,0.00020959055,0.00008631153,0.000029537608],"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.00003860291,0.00004474397,0.00010140819,0.00017229428,0.000022028576,1.916383e-7,0.002552241,0.0020408104,0.006035963,0.94382566,0.000025487536,0.045140583],"study_design_scores_gemma":[0.000331251,0.00033751322,0.006070878,0.000079111756,0.000005677436,0.000010882732,0.00009125919,0.9060941,0.08487299,0.0014908394,0.00048628962,0.00012922971],"about_ca_topic_score_codex":0.00004598017,"about_ca_topic_score_gemma":2.684553e-7,"teacher_disagreement_score":0.94233483,"about_ca_system_score_codex":0.000039005234,"about_ca_system_score_gemma":0.00005929561,"threshold_uncertainty_score":0.4731119},"labels":[],"label_agreement":null},{"id":"W2883844381","doi":"10.1007/978-3-319-96145-3_39","title":"Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Markov chain; Probabilistic logic; Generalization; Equivalence relation; Equivalence (formal languages); Algorithm; Markov process; Mathematics; Discrete mathematics; Total variation; Combinatorics; Computer science; Statistics","score_opus":0.04381443064443207,"score_gpt":0.2925889104563065,"score_spread":0.2487744798118744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883844381","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.000071044786,0.00022678547,0.9934193,0.0005372215,0.0025830045,0.001333212,0.000020743197,0.00024471132,0.0015639635],"genre_scores_gemma":[0.012321746,0.000028314753,0.9856976,0.00069263263,0.0006464975,0.00006673867,0.000008337794,0.000045827124,0.0004922902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99517703,0.000076680524,0.0007522006,0.0020731855,0.0010315547,0.0008893659],"domain_scores_gemma":[0.9954052,0.0010125027,0.00051351846,0.00221415,0.00065143214,0.00020320194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030420285,0.00058896927,0.0006701399,0.0006245223,0.00052623154,0.00058595,0.0045273225,0.0004183635,0.000025078205],"category_scores_gemma":[0.0011392862,0.00057820487,0.00016501942,0.0008114834,0.00115999,0.00075260614,0.0012608916,0.0006445856,0.000026250416],"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.000046591584,0.000098833174,0.000032727196,0.00030107843,0.000024912883,0.000012843544,0.0012953577,0.003443873,0.00037093807,0.3700059,0.000081182174,0.62428576],"study_design_scores_gemma":[0.00028730682,0.00024302707,0.00007116946,0.000432209,0.00001191359,0.000015110446,1.08333914e-7,0.6711545,0.0019889423,0.3228113,0.0023567083,0.0006276786],"about_ca_topic_score_codex":0.0000060070556,"about_ca_topic_score_gemma":0.00007825182,"teacher_disagreement_score":0.66771066,"about_ca_system_score_codex":0.00064403587,"about_ca_system_score_gemma":0.00061827706,"threshold_uncertainty_score":0.9996669},"labels":[],"label_agreement":null},{"id":"W2888864260","doi":"10.48550/arxiv.1808.10831","title":"Finite LTL Synthesis with Environment Assumptions and Quality Measures","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Linear temporal logic; Computer science; Automaton; Finite-state machine; Quality (philosophy); Temporal logic; Extension (predicate logic); State (computer science); Theoretical computer science; Algorithm; Programming language","score_opus":0.15512375572433226,"score_gpt":0.21657430673170439,"score_spread":0.06145055100737212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888864260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2189377,0.000008823554,0.77945083,0.000039910403,0.000038721,0.00006403088,0.0000021534968,0.000067734,0.0013901239],"genre_scores_gemma":[0.9132248,0.00004665088,0.086354665,0.000041539304,0.000019910118,8.116362e-7,3.165096e-7,0.000004425602,0.00030688153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906886,0.00019669652,0.00010082038,0.00039830874,0.00007769159,0.00015763713],"domain_scores_gemma":[0.9989517,0.00025177625,0.00009020286,0.00057540456,0.000044048902,0.0000868649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047793024,0.00009734408,0.000100507445,0.00007787926,0.00020990812,0.0000428113,0.0004006084,0.000046860623,0.000028095325],"category_scores_gemma":[0.00014546937,0.00009373447,0.000025071044,0.00024275476,0.00026033277,0.00048306736,0.00014528703,0.000071226794,0.000103307386],"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.000092450355,0.00016126472,0.05570527,0.00003319924,0.000078762016,0.00002245865,0.00066691736,0.011434352,0.0011186436,0.9166956,0.00004038523,0.0139507055],"study_design_scores_gemma":[0.001089472,0.0006407291,0.31226236,0.00008140332,0.00015695786,0.0000141011105,0.00039076267,0.6414079,0.020557646,0.012489875,0.009682959,0.0012258282],"about_ca_topic_score_codex":0.000033873093,"about_ca_topic_score_gemma":0.000029466026,"teacher_disagreement_score":0.90420574,"about_ca_system_score_codex":0.000059837803,"about_ca_system_score_gemma":0.00002121856,"threshold_uncertainty_score":0.38223806},"labels":[],"label_agreement":null},{"id":"W2889124254","doi":"10.46298/lmcs-17(3:1)2021","title":"Affine Extensions of Integer Vector Addition Systems with States","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Fonds de recherche du Québec – Nature et technologies; European Commission","keywords":"Monoid; Reachability; Undecidable problem; Mathematics; Affine transformation; Combinatorics; Decidability; Integer (computer science); Discrete mathematics; Conjecture; Rewriting; Reachability problem; Pure mathematics; Computer science","score_opus":0.060180768383201945,"score_gpt":0.3714641031173124,"score_spread":0.31128333473411046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889124254","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.006481701,0.00015899386,0.9913995,0.00021666322,0.001152239,0.0001835086,0.0000032492637,0.00010277184,0.000301367],"genre_scores_gemma":[0.08419129,0.000017575978,0.91552246,0.000161391,0.00005629261,0.000025958785,0.0000020411899,0.000005720116,0.00001728221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660033,0.0009864335,0.0005280774,0.0008518176,0.00061248994,0.00042087713],"domain_scores_gemma":[0.9970278,0.00095436466,0.00021928088,0.0010250646,0.0006300945,0.00014339412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038388728,0.0001789578,0.00037681058,0.00025991612,0.0001276569,0.00021371804,0.00141069,0.000077371595,0.000020962669],"category_scores_gemma":[0.0007710416,0.00013009222,0.000050476527,0.003345025,0.0005989146,0.0008592409,0.00074280926,0.00027156473,0.0000059915565],"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.000026363241,0.00035865032,0.00036763764,0.00007971267,0.0000122154115,0.00011362328,0.0011022575,0.03904534,0.035890963,0.5131468,0.00006683295,0.40978962],"study_design_scores_gemma":[0.00021806253,0.0003036287,0.010823011,0.00015393787,0.0000036066483,0.00014395785,0.000041787087,0.9432083,0.03631449,0.008236547,0.00033145977,0.00022122603],"about_ca_topic_score_codex":0.000018218156,"about_ca_topic_score_gemma":0.0000022866552,"teacher_disagreement_score":0.90416294,"about_ca_system_score_codex":0.00010114228,"about_ca_system_score_gemma":0.00025165686,"threshold_uncertainty_score":0.53050065},"labels":[],"label_agreement":null},{"id":"W2889333894","doi":"10.32604/csse.2018.33.021","title":"Probabliistic Analysis Of Electrocardiogram (Ecg) Heart Signal","year":2018,"lang":"en","type":"article","venue":"Computer Systems Science and Engineering","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Probabilistic logic; Computer science; SIGNAL (programming language); Electrocardiography; Artificial intelligence; Pattern recognition (psychology); Cardiology; Medicine","score_opus":0.013471508840764241,"score_gpt":0.24300283742254808,"score_spread":0.22953132858178385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889333894","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.032661848,0.000113470276,0.96597946,0.000012031096,0.00089922897,0.00010867241,4.8093546e-7,0.000111066096,0.00011376776],"genre_scores_gemma":[0.6759736,0.000001721115,0.32387567,0.000014264577,0.0001222539,0.000006661547,2.2429404e-7,0.000002761056,0.0000028614188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986146,0.000028354565,0.0002542031,0.0003678194,0.00043470017,0.0003003134],"domain_scores_gemma":[0.9989993,0.000045479246,0.00006887801,0.00044324642,0.00033921635,0.000103887134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015011567,0.00010431542,0.00025577526,0.00076688465,0.000119095115,0.0002431601,0.00070274895,0.000032040447,5.0445306e-7],"category_scores_gemma":[0.000043544154,0.0000958128,0.000049816732,0.004388414,0.00018476945,0.00058495754,0.00019469573,0.000061519,0.0000035235885],"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.000012115163,0.00012595068,0.009937775,0.0005394814,0.0008880872,0.000009341997,0.0039799986,0.2608787,0.1606378,0.48316652,0.0008940784,0.07893016],"study_design_scores_gemma":[0.00003796137,0.00012517016,0.012998624,0.000026105356,0.00002756509,0.00001805542,0.0000036845213,0.98382187,0.002094364,0.000012143238,0.0007275547,0.00010691888],"about_ca_topic_score_codex":0.000020277485,"about_ca_topic_score_gemma":3.8678206e-7,"teacher_disagreement_score":0.7229431,"about_ca_system_score_codex":0.000046472564,"about_ca_system_score_gemma":0.00006756979,"threshold_uncertainty_score":0.39071327},"labels":[],"label_agreement":null},{"id":"W2889713213","doi":"","title":"Bayesian Inference of Temporal Task Specifications from Demonstrations","year":2018,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Inference; Task (project management); Artificial intelligence; Machine learning; Prior probability; Probabilistic logic; Bayesian inference; Bayesian probability; Domain (mathematical analysis)","score_opus":0.03832744405571576,"score_gpt":0.293282919196827,"score_spread":0.2549554751411112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889713213","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.04502602,0.00012569033,0.9453655,0.003329942,0.00079700485,0.00033869984,0.00010663116,0.00047385925,0.004436674],"genre_scores_gemma":[0.51743114,0.000018758408,0.4824019,0.000022283144,0.000041218143,0.000023918057,0.000013015368,0.000007808527,0.000039911814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978607,0.0000618572,0.0007533017,0.00060199725,0.0003796871,0.0003423987],"domain_scores_gemma":[0.9965466,0.000062887404,0.0006599337,0.002143709,0.00049556623,0.00009129458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032339853,0.00025355406,0.00039913954,0.0008005167,0.00023013965,0.000046538455,0.0022724466,0.00040142433,0.00003513056],"category_scores_gemma":[0.00075150974,0.0002607213,0.000102899765,0.0021483127,0.0017527618,0.0010695028,0.00037980452,0.00034029302,0.000057412242],"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.000013213492,0.00029443752,0.025685903,0.000025713078,0.00011315251,0.0000049840487,0.0006056781,0.000049992606,0.05311622,0.86523044,0.0009980337,0.053862207],"study_design_scores_gemma":[0.0014196503,0.0009075698,0.044158157,0.00038012234,0.00013336133,0.000033565062,0.0003438722,0.050955076,0.58348775,0.13567269,0.18119875,0.0013094593],"about_ca_topic_score_codex":0.00012856841,"about_ca_topic_score_gemma":0.00019753847,"teacher_disagreement_score":0.72955775,"about_ca_system_score_codex":0.000077357625,"about_ca_system_score_gemma":0.0003073601,"threshold_uncertainty_score":0.9999845},"labels":[],"label_agreement":null},{"id":"W2889910550","doi":"10.1109/tac.2020.2987711","title":"Robustly Complete Synthesis of Memoryless Controllers for Nonlinear Systems With Reach-and-Stay Specifications","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":16,"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":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Nonlinear system; Set (abstract data type); Scheme (mathematics); Control (management); Feature (linguistics); Benchmarking; Control theory (sociology); Control system; Robust control","score_opus":0.06078054966542726,"score_gpt":0.2603273919768355,"score_spread":0.19954684231140826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889910550","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.0023311907,0.00003621405,0.99355793,0.0015875348,0.00019682097,0.0016656835,0.00020210106,0.00028240273,0.0001401099],"genre_scores_gemma":[0.6973082,0.000006145905,0.30198973,0.00013936931,0.00002675619,0.00049179414,0.0000012559278,0.00001872483,0.000018042223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982076,0.00022838432,0.00059165276,0.0004121827,0.00032238205,0.00023777151],"domain_scores_gemma":[0.99749243,0.001204858,0.00032462727,0.0006108308,0.00020982002,0.00015742621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005110091,0.00021277531,0.0005543878,0.00014172253,0.00019682541,0.000096284675,0.00051606965,0.000073945754,0.000012533463],"category_scores_gemma":[0.00008720298,0.00018120298,0.00012286914,0.00035799298,0.00012552502,0.0002767571,0.0000018213973,0.00011774538,0.0000120921],"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.0020948562,0.0017996589,0.000049529463,0.0029519147,0.0033997237,0.000015233782,0.007879223,0.476672,0.04876978,0.06461538,0.00050213287,0.39125058],"study_design_scores_gemma":[0.0020564003,0.0003320318,0.000120426565,0.000071450064,0.00018869132,0.000011319833,0.00021544744,0.9926782,0.003861043,0.00003012311,0.00024349117,0.0001913443],"about_ca_topic_score_codex":0.000014832916,"about_ca_topic_score_gemma":0.000004954509,"teacher_disagreement_score":0.694977,"about_ca_system_score_codex":0.000058323156,"about_ca_system_score_gemma":0.000086214284,"threshold_uncertainty_score":0.7389243},"labels":[],"label_agreement":null},{"id":"W2890608676","doi":"10.1609/aaai.v33i01.33011443","title":"Improving Optimization Bounds Using Machine Learning: Decision Diagrams Meet Deep Reinforcement Learning","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Bounding overwatch; Reinforcement learning; Computer science; Maximum cut; Mathematical optimization; Set (abstract data type); Relaxation (psychology); Perspective (graphical); Optimization problem; Function (biology); Artificial intelligence; Algorithm; Mathematics; Theoretical computer science; Graph","score_opus":0.08560422175768673,"score_gpt":0.32333212729102756,"score_spread":0.23772790553334083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890608676","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.021054123,0.00007590742,0.9737866,0.0001824504,0.0016921017,0.0009765002,0.0000012751955,0.0002030477,0.0020280061],"genre_scores_gemma":[0.70968884,0.00012886096,0.2898347,0.00004385391,0.00008830566,0.00003660474,0.000005426242,0.00003667031,0.00013672592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99560934,0.00011291444,0.0013316681,0.0011675789,0.0011991124,0.00057938707],"domain_scores_gemma":[0.99523544,0.00019825272,0.0023041528,0.0007635556,0.0013709598,0.00012763166],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022068047,0.0005710909,0.0006262591,0.00038359227,0.0005217074,0.0011079998,0.0037007222,0.00043560704,0.000053849613],"category_scores_gemma":[0.0028250457,0.0004834818,0.00027512285,0.0007892134,0.00023588835,0.00080469955,0.0032785404,0.0016265713,0.0000332516],"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.00007442547,0.00005694258,0.00028399093,0.00016972882,0.000022223303,2.4885776e-7,0.0011012788,0.78681475,0.0061529693,0.1491147,0.000002649218,0.05620611],"study_design_scores_gemma":[0.000036047688,0.00022914425,0.0000148085965,0.0006535763,0.000035832694,0.0000042179004,0.00019877641,0.87351876,0.10511003,0.019735236,0.000029222116,0.000434346],"about_ca_topic_score_codex":0.00021394073,"about_ca_topic_score_gemma":0.000009056039,"teacher_disagreement_score":0.68863475,"about_ca_system_score_codex":0.0003542169,"about_ca_system_score_gemma":0.0002860747,"threshold_uncertainty_score":0.99992895},"labels":[],"label_agreement":null},{"id":"W2890771647","doi":"10.1109/icra.2018.8460769","title":"Sampling-Based Motion Planning with μ-Calculus Specifications Without Steering","year":2018,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Waterloo","funders":"","keywords":"Liveness; Motion planning; Computer science; State space; Bellman equation; Kripke structure; Function (biology); Linear temporal logic; Reachability; Mathematical optimization; Temporal logic; State (computer science); Control theory (sociology); Model checking; Algorithm; Mathematics; Theoretical computer science; Control (management); Artificial intelligence","score_opus":0.13356811533596463,"score_gpt":0.3410346155343664,"score_spread":0.2074665001984018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890771647","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.011090624,0.000009110917,0.9760431,0.00018391549,0.00022574789,0.00015284102,4.4931988e-7,0.00042679525,0.01186739],"genre_scores_gemma":[0.4506484,1.7330213e-7,0.5490865,0.00008684905,0.000071646005,0.000012404661,0.000001515795,0.000006421077,0.000086100015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989745,0.000049121016,0.0001825515,0.00033804993,0.00023975367,0.00021604271],"domain_scores_gemma":[0.9989384,0.000042512816,0.00009391762,0.0006846258,0.00016814996,0.00007239062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039270514,0.00011028822,0.000093854964,0.00011998465,0.00021446792,0.00015345913,0.00050998817,0.0000430392,0.000030235573],"category_scores_gemma":[0.000053042546,0.000090423986,0.000021398248,0.00046574557,0.00009202357,0.00050268613,0.00005337892,0.00009191971,0.000118678756],"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.00007422568,0.00019596644,0.017236616,0.000041941315,0.000036438916,0.000003729959,0.0022091917,0.017911341,0.012259995,0.8456195,0.00028247767,0.104128584],"study_design_scores_gemma":[0.0003030329,0.00019714542,0.03467785,0.000044119333,0.0000059404865,0.000010844642,0.000058556816,0.9221725,0.03809847,0.00048279972,0.0037096697,0.00023908689],"about_ca_topic_score_codex":0.0000111997315,"about_ca_topic_score_gemma":0.0000044164835,"teacher_disagreement_score":0.9042612,"about_ca_system_score_codex":0.0000587474,"about_ca_system_score_gemma":0.000045444278,"threshold_uncertainty_score":0.36873832},"labels":[],"label_agreement":null},{"id":"W2897103696","doi":"10.1109/modre.2018.00008","title":"A Comparison of the Declarative Modelling Languages B, Dash, and TLA+","year":2018,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"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 Waterloo","funders":"","keywords":"Computer science; Programming language; Dash; Declarative programming; Natural language processing; Programming paradigm; Operating system","score_opus":0.08727455611420606,"score_gpt":0.39711650559899386,"score_spread":0.3098419494847878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897103696","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.107623644,0.00005748491,0.884228,0.00009453946,0.00006463572,0.000056932808,2.1014152e-7,0.000024500765,0.007850085],"genre_scores_gemma":[0.5452547,0.0000010668857,0.45462686,0.000034258865,0.000009712491,0.0000010226163,3.4850228e-8,8.9934264e-7,0.000071463335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995765,0.000058020516,0.000101507256,0.00010467286,0.00009613376,0.00006314788],"domain_scores_gemma":[0.9995423,0.000039193517,0.000060095572,0.0002871053,0.00005693852,0.000014391138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020253305,0.00003790972,0.00006497338,0.000018751447,0.00006558134,0.000023207549,0.0003351177,0.000021719981,0.0000041318053],"category_scores_gemma":[0.000021929334,0.000023258153,0.000012215814,0.00014630855,0.00010639868,0.00016356123,0.00013810226,0.000042971795,0.000003932656],"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.0000050631484,0.00004027871,0.0057958085,0.000011798476,0.000009779276,9.11177e-8,0.01364069,0.00075974246,0.0049839364,0.93682384,0.00027132078,0.037657674],"study_design_scores_gemma":[0.0000387214,0.00003683171,0.0017171585,0.0000067448523,0.000001537662,0.0000010689953,0.00022710513,0.85828155,0.13717598,0.0021973334,0.0002823064,0.00003365827],"about_ca_topic_score_codex":0.00002363151,"about_ca_topic_score_gemma":0.000007636425,"teacher_disagreement_score":0.93462646,"about_ca_system_score_codex":0.0000055240703,"about_ca_system_score_gemma":0.000010848571,"threshold_uncertainty_score":0.094844},"labels":[],"label_agreement":null},{"id":"W2897141232","doi":"10.4204/eptcs.282.1","title":"A Theory of Lazy Imperative Timing","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","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":"","keywords":"Computer science; Lazy evaluation; Programming language; Functional programming","score_opus":0.013642270608609753,"score_gpt":0.28849984624969816,"score_spread":0.2748575756410884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897141232","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.12096109,0.000036346108,0.8694232,0.00015089895,0.00023993672,0.00018792812,2.0475753e-7,0.00010175278,0.008898619],"genre_scores_gemma":[0.67245907,0.000004306798,0.32729962,0.00013717025,0.00007911268,0.000010461567,6.100432e-8,0.0000056052554,0.000004604052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732333,0.00006997105,0.00039812023,0.0007327896,0.00059809687,0.0008776616],"domain_scores_gemma":[0.9986881,0.00015576731,0.00015245439,0.0003862553,0.0005066253,0.00011078567],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0057461793,0.00017790083,0.00023056718,0.00037874773,0.00023425721,0.00018513073,0.0028378442,0.000069241956,0.000021660053],"category_scores_gemma":[0.00056031434,0.00015291522,0.000045743625,0.0025499144,0.0039924784,0.0012944458,0.000805968,0.00034374473,0.000019365927],"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.000019386298,0.00004060753,0.000079961945,0.00000781612,0.0000027744645,4.521329e-7,0.0022453847,0.0000030045853,0.0062059397,0.95786846,0.0000059204413,0.033520296],"study_design_scores_gemma":[0.0001566134,0.000618343,0.00061290304,0.000040427083,0.000001996346,0.00002667086,0.000028760622,0.31214163,0.14483196,0.5413446,0.000039135743,0.00015698482],"about_ca_topic_score_codex":0.0000012261731,"about_ca_topic_score_gemma":3.9097483e-7,"teacher_disagreement_score":0.55149794,"about_ca_system_score_codex":0.00023799358,"about_ca_system_score_gemma":0.0003232516,"threshold_uncertainty_score":0.9987181},"labels":[],"label_agreement":null},{"id":"W2898631824","doi":"","title":"Strategy Synthesis for Linear Arithmetic Games","year":2018,"lang":"en","type":"article","venue":"Symposium on Principles of Programming Languages","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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":"","keywords":"Reachability; Computer science; Satisfiability; Combinatorial game theory; Dimension (graph theory); Game theory; Game tree; Theoretical computer science; Repeated game; Sequential game; Mathematical economics; Mathematics; Combinatorics","score_opus":0.04412962643162666,"score_gpt":0.33670801020447344,"score_spread":0.2925783837728468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898631824","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.05814878,0.00024130524,0.9305855,0.0006340826,0.00046509443,0.0011849017,0.000019623416,0.00060411106,0.008116602],"genre_scores_gemma":[0.3560362,0.000007950538,0.64334,0.00003599138,0.00014588053,0.00014966945,0.0000025164943,0.000016269878,0.00026555907],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99847305,0.00010291236,0.00036230718,0.00042916148,0.00027934252,0.00035323767],"domain_scores_gemma":[0.9983107,0.00032756082,0.00024948415,0.0008086139,0.00022782978,0.000075805896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094216794,0.00017835565,0.00023378782,0.00016612286,0.00011964843,0.00009826653,0.0009518171,0.00009669908,0.0000072334533],"category_scores_gemma":[0.0006011565,0.00015573273,0.00011036484,0.00028083418,0.0001964751,0.00023782482,0.00014462235,0.000089136265,0.000020449492],"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.000055619275,0.00025586173,0.00026777797,0.0002657507,0.000058613077,0.000003570812,0.0012631713,0.00016270287,0.019448584,0.46202195,0.00003132077,0.5161651],"study_design_scores_gemma":[0.0003552026,0.0017773187,0.0011552562,0.00020149008,0.000042945758,0.000014079585,0.00041190462,0.038467877,0.9251086,0.0006733564,0.031353224,0.00043871254],"about_ca_topic_score_codex":0.00002216912,"about_ca_topic_score_gemma":0.0000073365163,"teacher_disagreement_score":0.90566003,"about_ca_system_score_codex":0.000035912082,"about_ca_system_score_gemma":0.000062743704,"threshold_uncertainty_score":0.63505965},"labels":[],"label_agreement":null},{"id":"W2898837242","doi":"10.1007/978-3-030-03421-4_22","title":"Lightweight Statistical Model Checking in Nondeterministic Continuous Time","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":25,"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":"Exploratory Research for Advanced Technology; Universität des Saarlandes","keywords":"Computer science; Nondeterministic algorithm; Rotation formalisms in three dimensions; Automaton; Probabilistic logic; Theoretical computer science; Markov chain; Artificial intelligence; Mathematics; Machine learning","score_opus":0.023803568122986785,"score_gpt":0.28317921841443355,"score_spread":0.25937565029144677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898837242","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.00013629968,0.00007804057,0.9908239,0.00012007365,0.0011280659,0.00042446816,0.000011928842,0.00015877602,0.0071184477],"genre_scores_gemma":[0.024221627,0.000009981263,0.9741598,0.0005786792,0.00030900617,0.000014105834,0.000006671937,0.000041089486,0.00065903686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533814,0.00008102008,0.0008519834,0.0018103982,0.0010570915,0.00086138496],"domain_scores_gemma":[0.9969478,0.0005712555,0.00036743705,0.0016679347,0.00025044786,0.00019512295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018445579,0.0005786078,0.00072039274,0.0009787913,0.00018082546,0.00053085346,0.0037963036,0.0004395094,0.00006880483],"category_scores_gemma":[0.00037429458,0.0005526475,0.00008513602,0.00055648026,0.0011084502,0.0007114647,0.0013264911,0.0009098448,0.00028110525],"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.000030400006,0.000110520865,0.000056517492,0.00011201974,0.000014268834,0.00036036293,0.003079359,0.028905675,0.0007621387,0.18300714,0.00009227681,0.7834693],"study_design_scores_gemma":[0.0001731814,0.0001487635,0.0000672304,0.0002693956,0.0000049015616,0.00005258743,5.3521504e-8,0.7995816,0.000934553,0.19797541,0.00027744443,0.00051490724],"about_ca_topic_score_codex":0.0000083872,"about_ca_topic_score_gemma":0.00001766816,"teacher_disagreement_score":0.7829544,"about_ca_system_score_codex":0.00048398797,"about_ca_system_score_gemma":0.00067304855,"threshold_uncertainty_score":0.9996925},"labels":[],"label_agreement":null},{"id":"W2898989991","doi":"","title":"On Limited Conjunctions in Polynomial Feature Logics, with Applications in OBDA.","year":2018,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"Formal Methods in Verification","field":"Computer Science","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":"University of Waterloo","funders":"","keywords":"Computer science; Feature (linguistics); Polynomial; Theoretical computer science; Mathematics; Artificial intelligence; Algebra over a field; Algorithm; Pure mathematics; Linguistics","score_opus":0.040384707731373495,"score_gpt":0.3263807146401066,"score_spread":0.2859960069087331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898989991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41778466,0.00035886985,0.5278023,0.00037322272,0.0002735072,0.0008454733,0.0000031964,0.00011892725,0.05243987],"genre_scores_gemma":[0.83796847,0.000032117303,0.1615001,0.000018137129,0.000046100733,0.000059873062,0.0000063716657,0.0000063523617,0.00036250154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990903,0.000118930155,0.00021812455,0.00032279608,0.00011095591,0.00013886188],"domain_scores_gemma":[0.99913144,0.0001991676,0.00013778648,0.00034536482,0.00013778584,0.00004844296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032913094,0.000096510434,0.00014418081,0.00029318716,0.00009156125,0.000036996415,0.00022604973,0.00006926845,0.0000029207952],"category_scores_gemma":[0.00029040076,0.00008032414,0.000019203368,0.00083942246,0.00014881886,0.00024236037,0.00009858504,0.0001457918,0.000006199762],"study_design_candidate":"observational","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.00015870357,0.00042428504,0.15495077,0.000061651524,0.0000211516,0.000002672163,0.0069172806,0.0007056169,0.0016764868,0.79620296,0.000081999475,0.038796417],"study_design_scores_gemma":[0.0017763511,0.0003989494,0.77235067,0.00036721097,0.0000122075135,0.000025430778,0.0009087598,0.19640726,0.02105054,0.0015864166,0.004762089,0.0003541248],"about_ca_topic_score_codex":0.0000347477,"about_ca_topic_score_gemma":0.00020372335,"teacher_disagreement_score":0.7946166,"about_ca_system_score_codex":0.00005284174,"about_ca_system_score_gemma":0.000062170555,"threshold_uncertainty_score":0.32755235},"labels":[],"label_agreement":null},{"id":"W2901626279","doi":"10.1115/dscc2018-9224","title":"Towards Integrated Planning and Control of Autonomous Vehicles Using Nested MPCs","year":2018,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Motion planning; Path (computing); Controller (irrigation); Scheme (mathematics); Computer science; Collision; Collision avoidance; Control theory (sociology); Control (management); Action (physics); Work (physics); Control engineering; Engineering; Mathematics; Robot; Artificial intelligence; Computer network","score_opus":0.052480206103923434,"score_gpt":0.32754795469704423,"score_spread":0.2750677485931208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901626279","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.23063055,0.000044163196,0.7681012,0.000038587576,0.00013101603,0.000065191416,7.017508e-7,0.000079210855,0.0009093644],"genre_scores_gemma":[0.5529779,3.5060367e-7,0.44692662,0.00006333515,0.00001591913,8.835225e-7,1.8583978e-7,0.0000022933807,0.000012486313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993489,0.00007689401,0.00018967166,0.00016347894,0.00009825119,0.00012281832],"domain_scores_gemma":[0.99944645,0.000041720607,0.00009417953,0.00023300112,0.00014566716,0.00003899091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040375482,0.00007149425,0.00012289571,0.00007693649,0.00006037415,0.000051866708,0.0002645117,0.000047937716,0.0000056661434],"category_scores_gemma":[0.00009996951,0.000058466227,0.000014807866,0.00023814586,0.00012106205,0.00032900675,0.00006958312,0.00005370928,0.0000024090368],"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.00008111822,0.00008047897,0.012413028,0.00004518014,0.000062018335,0.0000066893763,0.0055491487,0.00034842483,0.2791073,0.1934834,0.00007634529,0.50874686],"study_design_scores_gemma":[0.00023396293,0.00010732632,0.011065801,0.000022004497,0.0000049142213,0.000015666452,0.00006527549,0.8720711,0.11550666,0.00061233534,0.00021789994,0.00007706504],"about_ca_topic_score_codex":0.000111878944,"about_ca_topic_score_gemma":0.000001268742,"teacher_disagreement_score":0.8717227,"about_ca_system_score_codex":0.000023151082,"about_ca_system_score_gemma":0.000066098495,"threshold_uncertainty_score":0.23841836},"labels":[],"label_agreement":null},{"id":"W2904101382","doi":"10.1007/978-3-030-30281-8_10","title":"Fast Falsification of Hybrid Systems Using Probabilistically Adaptive Input","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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":"Margin (machine learning); Computer science; Discretization; Key (lock); Tree (set theory); Feature (linguistics); Las vegas; Hybrid system; Artificial intelligence; Algorithm; Theoretical computer science; Mathematics; Machine learning","score_opus":0.05059250578223105,"score_gpt":0.3049642944555652,"score_spread":0.25437178867333415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904101382","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.029766295,0.00015629787,0.9640003,0.00006893724,0.004614824,0.0012220425,0.000012915298,0.00012286993,0.000035549507],"genre_scores_gemma":[0.4943238,0.0000041540425,0.50550497,0.00004107203,0.000094678784,0.000018581793,0.0000024866256,0.000009961524,3.246668e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99515384,0.00040232565,0.0009612185,0.0017243034,0.0011731242,0.0005851949],"domain_scores_gemma":[0.9951096,0.00046904353,0.00087130006,0.0025727293,0.000857126,0.00012020817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028681816,0.0004235804,0.0006587257,0.00075555395,0.00012663109,0.00052765745,0.0047342777,0.00022095483,0.0000014309786],"category_scores_gemma":[0.00066381984,0.00040050666,0.00011125761,0.0016340164,0.0007105326,0.000734551,0.0031769066,0.0008586838,0.000013331944],"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.000008603268,0.00009449077,0.0002119974,0.00022958653,0.0000073448023,0.000003975442,0.0006162429,0.9138051,0.0024541623,0.009065997,8.91728e-7,0.07350157],"study_design_scores_gemma":[0.00015176118,0.00015025276,0.00066331,0.0005399568,0.000007981211,0.00004099985,0.0000010125749,0.96388257,0.016690953,0.017479615,0.0000051456627,0.00038646022],"about_ca_topic_score_codex":0.00015254469,"about_ca_topic_score_gemma":0.0000034890707,"teacher_disagreement_score":0.4645575,"about_ca_system_score_codex":0.0006088398,"about_ca_system_score_gemma":0.0012827672,"threshold_uncertainty_score":0.9998447},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W2907511104","doi":"10.1145/3302504.3313354","title":"Invariant, viability and discriminating kernel under-approximation via zonotope scaling","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reachability; Scaling; Invariant (physics); Parametric statistics; Affine transformation; Kernel (algebra); Scalability; Computer science; Nonlinear system; Model predictive control; Regular polygon; Mathematical optimization; Control theory (sociology); Algorithm; Mathematics; Artificial intelligence; Discrete mathematics; Control (management); Pure mathematics","score_opus":0.04830138435669108,"score_gpt":0.3049434866517462,"score_spread":0.25664210229505513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907511104","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.03557234,0.000033889966,0.9552806,0.00039033397,0.00086668355,0.00079548266,0.0000023984007,0.00026558043,0.006792709],"genre_scores_gemma":[0.44795784,0.0000068373333,0.55178267,0.000069167596,0.00003759195,0.00003630979,0.00000779398,0.000010207695,0.00009155097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975073,0.00035771754,0.00054121146,0.0009843279,0.00034037273,0.00026911276],"domain_scores_gemma":[0.9977076,0.00020987228,0.00038875185,0.0014614436,0.00014696662,0.00008534706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022114648,0.00027908085,0.0003296033,0.00013210368,0.00013038355,0.0005244477,0.0010513087,0.00030362426,0.000012840944],"category_scores_gemma":[0.00031121055,0.00025852118,0.00007308858,0.00017281645,0.00008169271,0.0007731409,0.0026693186,0.00054762745,0.0000298118],"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.00000945457,0.00013011748,0.0016189469,0.0013233011,0.00004065931,0.0000011012223,0.0029007967,0.009444524,0.0023769904,0.76386386,0.0000326845,0.21825755],"study_design_scores_gemma":[0.00010435284,0.000018598777,0.017307756,0.0000857704,0.000011440027,0.000006743242,0.000074739,0.8607555,0.002189633,0.11913004,0.000021620366,0.0002938249],"about_ca_topic_score_codex":0.00027791847,"about_ca_topic_score_gemma":0.000008520189,"teacher_disagreement_score":0.85131097,"about_ca_system_score_codex":0.00016675876,"about_ca_system_score_gemma":0.00010957325,"threshold_uncertainty_score":0.9999867},"labels":[],"label_agreement":null},{"id":"W2910794638","doi":"10.1145/3287624.3287661","title":"Suspect2vec","year":2019,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"","keywords":"Debugging; Computer science; Suspect; Boolean satisfiability problem; Overhead (engineering); Algorithmic program debugging; Key (lock); Baseline (sea); Prioritization; Solver; Satisfiability; Software deployment; Programming language; Algorithm; Software engineering; Operating system","score_opus":0.00897527818925105,"score_gpt":0.24923335243321434,"score_spread":0.24025807424396328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910794638","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.013302258,0.0000051832753,0.7539688,0.00015431351,0.000323489,0.00004437022,2.1513971e-8,0.00013118231,0.23207043],"genre_scores_gemma":[0.28291327,6.583869e-7,0.7126344,0.00017270404,0.000009832139,0.0000013169943,7.398439e-8,0.000001244034,0.0042664916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967194,0.00001739053,0.000049633567,0.00010902115,0.000078575766,0.0000734281],"domain_scores_gemma":[0.99954873,0.000015101729,0.000013924494,0.00038755764,0.000016956055,0.000017698394],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016395291,0.000025870411,0.000030753898,0.000023201424,0.000011440321,0.000033671433,0.00037991593,0.00001370055,0.0001707765],"category_scores_gemma":[0.000013791732,0.000021246131,0.000012458436,0.0001280469,0.000004742138,0.00030089827,0.00006878832,0.000028502058,0.002267788],"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":[2.2983549e-7,0.0000035691987,0.00053093577,0.0000010576769,5.518876e-7,1.5181143e-7,0.000038406088,0.0000048711445,0.0009961474,0.9841931,0.0002469032,0.013984102],"study_design_scores_gemma":[0.00044625913,0.0001952507,0.05948103,0.000008330403,0.000001526897,0.00003176647,0.000050941562,0.60211277,0.13761382,0.060344372,0.13928647,0.00042747136],"about_ca_topic_score_codex":0.000004104519,"about_ca_topic_score_gemma":3.046619e-7,"teacher_disagreement_score":0.9238487,"about_ca_system_score_codex":0.000010886719,"about_ca_system_score_gemma":0.000009155695,"threshold_uncertainty_score":0.99850905},"labels":[],"label_agreement":null},{"id":"W2911867448","doi":"10.1007/978-3-642-39799-8_22","title":"Beautiful Interpolants","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":75,"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":"Simple (philosophy); Computer science; Mathematical proof; Interpolation (computer graphics); Set (abstract data type); Heuristic; Algorithm; Theoretical computer science; Algebra over a field; Calculus (dental); Artificial intelligence; Programming language; Mathematics; Pure mathematics","score_opus":0.026175716744134124,"score_gpt":0.2763478119893099,"score_spread":0.2501720952451758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911867448","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.000047775284,0.00026071307,0.9778093,0.00034161794,0.0034519173,0.00042787445,0.0000028330444,0.0002492358,0.01740871],"genre_scores_gemma":[0.020030845,0.000035049055,0.97735167,0.0011783905,0.00035968795,0.000016309692,0.000003206747,0.000034444816,0.0009904095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960776,0.000053883006,0.00060470245,0.0015525301,0.0009986298,0.0007126522],"domain_scores_gemma":[0.9967377,0.00027121993,0.00036049925,0.002157909,0.00026965005,0.0002030044],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011586368,0.0005270415,0.00049098575,0.00089759124,0.00019770325,0.00071572664,0.005406405,0.0003834034,0.000090567206],"category_scores_gemma":[0.00017298214,0.0004780617,0.00012392264,0.0005659397,0.0007129315,0.0012415245,0.0018491363,0.00093860115,0.0006580728],"study_design_candidate":"design_other","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.0000019138292,0.00001457909,0.0000144004425,0.00002256199,0.000006115921,0.0000194053,0.00043321855,0.0010101552,0.00016302009,0.11726748,0.000052949912,0.8809942],"study_design_scores_gemma":[0.00015910214,0.00015709826,0.00024616806,0.000347429,0.000004951295,0.00009993184,8.961969e-8,0.72098047,0.00315454,0.26915076,0.004926713,0.00077271444],"about_ca_topic_score_codex":0.000027848095,"about_ca_topic_score_gemma":0.0000139006015,"teacher_disagreement_score":0.8802215,"about_ca_system_score_codex":0.00038420098,"about_ca_system_score_gemma":0.00037938313,"threshold_uncertainty_score":0.99997485},"labels":[],"label_agreement":null},{"id":"W2914871854","doi":"10.1007/11889205_37","title":"Preprocessing QBF","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":45,"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":"Preprocessor; Computer science; True quantified Boolean formula; Expressive power; Solver; Algorithm; Conjunctive normal form; Time complexity; Range (aeronautics); Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.02513833083533195,"score_gpt":0.2811366149434357,"score_spread":0.25599828410810377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914871854","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.000020782103,0.00043990076,0.9716552,0.00021569643,0.0018141587,0.0002800546,0.0000017470173,0.00028824387,0.025284229],"genre_scores_gemma":[0.01660917,0.00001224518,0.9813658,0.00060940924,0.00046025967,0.000009054794,0.0000034114837,0.000032076583,0.00089856674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959888,0.000041495085,0.0005790206,0.0017036059,0.0010558243,0.0006312623],"domain_scores_gemma":[0.9970879,0.00023365111,0.00039403123,0.001901502,0.0002634433,0.00011945511],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014422298,0.00046969167,0.00042084637,0.00076299947,0.0002840602,0.00075172144,0.004157543,0.00034581294,0.000012580613],"category_scores_gemma":[0.00014722785,0.0004484482,0.00010617503,0.0007260568,0.0006784965,0.0011286718,0.0012157786,0.00077128905,0.000068866735],"study_design_candidate":"design_other","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.0000022677505,0.000019316612,0.000032210573,0.00005238987,0.0000035334451,0.000029076311,0.0002883191,0.03901884,0.00015753275,0.040256288,0.00004766207,0.9200926],"study_design_scores_gemma":[0.00013284774,0.00007625121,0.00018426686,0.0003254267,0.000005082847,0.000072246155,3.5198507e-8,0.7501922,0.004403289,0.2401361,0.0038152277,0.0006570044],"about_ca_topic_score_codex":0.000021048809,"about_ca_topic_score_gemma":0.000013239826,"teacher_disagreement_score":0.91943556,"about_ca_system_score_codex":0.00035535335,"about_ca_system_score_gemma":0.00051649933,"threshold_uncertainty_score":0.99979675},"labels":[],"label_agreement":null},{"id":"W2919672876","doi":"","title":"Cycle Extensions in PBD Block-Intersection Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Intersection (aeronautics); Block (permutation group theory); Combinatorics; Geography","score_opus":0.01743400842951365,"score_gpt":0.28109735408279235,"score_spread":0.2636633456532787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919672876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9701425,0.00002794798,0.015960677,0.0002867494,0.006859067,0.00017117779,4.227366e-7,0.00023693319,0.006314554],"genre_scores_gemma":[0.94744784,0.000005383522,0.052274194,0.00018506055,0.00001189681,0.000016929209,6.184279e-7,0.000008346591,0.000049759856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886954,0.0001323563,0.00022701947,0.00033215372,0.00019162537,0.00024731137],"domain_scores_gemma":[0.99902505,0.000049744314,0.00007873822,0.0006524871,0.00012702047,0.00006698367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005304093,0.00010512671,0.00011705797,0.00020617817,0.00012796203,0.00006186634,0.0005710945,0.000075738804,0.000010563472],"category_scores_gemma":[0.00015185148,0.00010898674,0.000043623597,0.00084048795,0.000090556285,0.0005039245,0.00017240275,0.00015563589,0.00016765181],"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.000005922863,0.00008164594,0.0009458339,0.0000026549646,0.0000037481996,0.0000038456724,0.00055561325,0.000006062546,0.0017039989,0.9915654,0.0007722915,0.0043529933],"study_design_scores_gemma":[0.0005744223,0.00026741653,0.041245352,0.000030054985,0.0000037070147,0.000027347824,0.000045827426,0.03858133,0.015575237,0.9013301,0.0020875863,0.00023162203],"about_ca_topic_score_codex":0.00007695545,"about_ca_topic_score_gemma":0.000021532198,"teacher_disagreement_score":0.09023529,"about_ca_system_score_codex":0.00008055604,"about_ca_system_score_gemma":0.000030156481,"threshold_uncertainty_score":0.444435},"labels":[],"label_agreement":null},{"id":"W2932678026","doi":"10.48550/arxiv.1904.00976","title":"Bisimulation for Feller-Dynkin Processes","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bisimulation; Discrete time and continuous time; Equivalence (formal languages); Generalization; Mathematics; Markov chain; Markov process; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.1586007484789236,"score_gpt":0.23819502958319588,"score_spread":0.07959428110427227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2932678026","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.05365053,0.000043173295,0.9426261,0.00005173152,0.0010000144,0.00081573863,0.000014372007,0.0002653423,0.0015329965],"genre_scores_gemma":[0.8637223,0.00005233162,0.13471012,0.00004980548,0.00007679956,0.0000040838067,0.000028262515,0.000018056082,0.0013382395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829274,0.00010218882,0.00023780308,0.000996338,0.0000925986,0.00027831167],"domain_scores_gemma":[0.997642,0.00022004587,0.00037257624,0.0012557821,0.00043395875,0.000075671065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047672875,0.00024488565,0.00026277135,0.00025978065,0.00012765233,0.00013995166,0.001776393,0.0003059779,0.000009345365],"category_scores_gemma":[0.00024961328,0.00028692285,0.00013735637,0.00063273375,0.000050213257,0.0006304332,0.00091502594,0.00028931454,0.000093222974],"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.000042490912,0.00006445026,0.0022597895,0.0006847297,0.000036774236,0.000005045231,0.00019419414,0.70107496,0.000027532136,0.2929581,0.00016685629,0.0024850487],"study_design_scores_gemma":[0.00033020592,0.000059191854,0.000724335,0.00006688203,0.00003187941,9.2349677e-7,0.000015690268,0.9422316,0.00066974363,0.05211104,0.0034113573,0.0003471282],"about_ca_topic_score_codex":0.00003210972,"about_ca_topic_score_gemma":0.000008915945,"teacher_disagreement_score":0.81007177,"about_ca_system_score_codex":0.00018366419,"about_ca_system_score_gemma":0.0002923409,"threshold_uncertainty_score":0.9999583},"labels":[],"label_agreement":null},{"id":"W2944100452","doi":"10.1016/j.ic.2019.04.002","title":"Expressiveness of probabilistic modal logics: A gradual approach","year":2019,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki; Agence Nationale de la Recherche; Alan Turing Institute","keywords":"Bisimulation; Mathematical proof; Probabilistic logic; Characterization (materials science); Computer science; Modal; Theoretical computer science; Modal logic; Mathematics; Discrete mathematics; Artificial intelligence","score_opus":0.022157233803333017,"score_gpt":0.26529203065534646,"score_spread":0.24313479685201345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944100452","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.16906804,0.000009821654,0.8275332,0.00002207982,0.00012428299,0.00024656107,0.0000012743723,0.000055041004,0.0029396845],"genre_scores_gemma":[0.7305338,0.0000019356391,0.26937234,0.00004944666,0.0000052352298,0.000012442939,0.000017656766,0.0000013439627,0.000005805949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926823,0.00005662141,0.00029780268,0.000098089055,0.00019762183,0.00008164158],"domain_scores_gemma":[0.9993884,0.00003909513,0.00023255884,0.00015423825,0.00015772152,0.000027999891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002961256,0.00006857622,0.00010025558,0.00011079316,0.000036560552,0.00008273175,0.00018208829,0.000043187694,0.0000018366319],"category_scores_gemma":[0.00004048585,0.0000625274,0.0000196838,0.00020578467,0.000029566298,0.0019284292,0.000069471695,0.000052347536,0.000020152529],"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.000023983122,0.000055723205,0.00082241173,0.0003501252,0.000009116632,8.395182e-8,0.004954129,0.08880579,0.00025894263,0.69363195,0.000034712055,0.21105304],"study_design_scores_gemma":[0.00029347354,0.00006826128,0.010914953,0.000013387902,0.0000019609317,0.000008565894,0.00015907422,0.9789839,0.00045884235,0.008873766,0.00014280235,0.00008104673],"about_ca_topic_score_codex":0.0000063389243,"about_ca_topic_score_gemma":5.3306195e-8,"teacher_disagreement_score":0.8901781,"about_ca_system_score_codex":0.000017432778,"about_ca_system_score_gemma":0.000031739903,"threshold_uncertainty_score":0.2549793},"labels":[],"label_agreement":null},{"id":"W2945778040","doi":"10.1007/978-3-030-25540-4_9","title":"Property Directed Self Composition","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Waterloo","funders":"European Commission; Blavatnik Family Foundation","keywords":"Computer science; Composition (language); Property (philosophy); Invariant (physics); Function (biology); Program analysis; Set (abstract data type); Algorithm; Theoretical computer science; Programming language; Rule of inference; Mathematics","score_opus":0.023351352869770418,"score_gpt":0.2845058115426765,"score_spread":0.2611544586729061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945778040","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.00787593,0.00013499965,0.9829982,0.00072588463,0.0061344327,0.0009543963,0.0000029920598,0.0010212115,0.00015198968],"genre_scores_gemma":[0.39555982,0.0000131669685,0.6037481,0.0004632911,0.00016365561,0.00003168965,0.0000059557246,0.000012890516,0.0000014294575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529696,0.00036389875,0.0005755641,0.00197039,0.0010649763,0.00072820415],"domain_scores_gemma":[0.99616235,0.00025475444,0.00036600372,0.0026594393,0.0004142659,0.00014319895],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001984137,0.00047076104,0.00050223526,0.0007252328,0.00022608912,0.0010269558,0.005569419,0.00037298683,0.000004512304],"category_scores_gemma":[0.00017709841,0.00035532002,0.00011487149,0.0022160246,0.00031146657,0.000972232,0.004590619,0.0012464826,0.000072411916],"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.000011555974,0.00024138251,0.0014124218,0.00024222831,0.000016438873,0.0000202485,0.0031455746,0.4061131,0.0027158062,0.0014736933,0.000029101768,0.58457845],"study_design_scores_gemma":[0.00017927724,0.000086018445,0.004762078,0.00025381774,0.0000051445572,0.000032789947,1.05260604e-7,0.9652125,0.018623298,0.010232706,0.00009703354,0.0005151836],"about_ca_topic_score_codex":0.00007726265,"about_ca_topic_score_gemma":0.000007440854,"teacher_disagreement_score":0.5840633,"about_ca_system_score_codex":0.00062050833,"about_ca_system_score_gemma":0.00083800976,"threshold_uncertainty_score":0.99988985},"labels":[],"label_agreement":null},{"id":"W2946812972","doi":"10.1007/978-3-030-18305-9_30","title":"Towards Causal Analysis of Protocol Violations","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Protocol (science); Formal methods; Theoretical computer science; Pi calculus; Formal description; Distributed computing; Software engineering; Programming language","score_opus":0.033227533398187827,"score_gpt":0.32670350434002376,"score_spread":0.2934759709418359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946812972","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.00001541059,0.00001409853,0.9804279,0.0000969346,0.0006715718,0.011078916,0.000010206595,0.00008710189,0.007597826],"genre_scores_gemma":[0.009052256,0.0000021994147,0.9892819,0.00022223177,0.000102977196,0.0010741065,0.0000067673254,0.000019185221,0.00023838594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996458,0.000066915614,0.00077339326,0.0011828296,0.0011071202,0.00041173137],"domain_scores_gemma":[0.99641365,0.00027884977,0.00063759973,0.0021173654,0.00045144692,0.00010111906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014978678,0.0003758806,0.000706544,0.002243684,0.00011489248,0.00021587167,0.0033687446,0.00030307967,0.000046433594],"category_scores_gemma":[0.00017470175,0.00034038446,0.00024306512,0.0026187634,0.0004940924,0.00066427724,0.0010077396,0.0005288976,0.000026299427],"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.000008813366,0.000042523814,0.0003132154,0.00008072974,0.00011584607,0.0000063818197,0.0006811315,0.10018013,0.00023598177,0.21308771,0.000007184835,0.6852403],"study_design_scores_gemma":[0.00016078298,0.00015927725,0.0034255423,0.00012815605,0.00006695348,0.0000060984353,6.6333506e-8,0.95560527,0.0020364462,0.036815662,0.0011798528,0.0004159204],"about_ca_topic_score_codex":0.000035964676,"about_ca_topic_score_gemma":0.000042867454,"teacher_disagreement_score":0.8554251,"about_ca_system_score_codex":0.0002704117,"about_ca_system_score_gemma":0.00095709186,"threshold_uncertainty_score":0.9999048},"labels":[],"label_agreement":null},{"id":"W2948911651","doi":"10.1007/s00165-019-00484-1","title":"A verification-driven framework for iterative design of controllers","year":2019,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Horizon 2020 Framework Programme","keywords":"Computer science; Correctness; Iterative and incremental development; Modular design; Reuse; Scalability; Component (thermodynamics); Process (computing); Rework; Formal verification; Systems engineering; Software engineering; Distributed computing; Programming language; Embedded system; Engineering","score_opus":0.028276755830070117,"score_gpt":0.2995027640333482,"score_spread":0.2712260082032781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948911651","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.0264938,0.000034698525,0.9707218,0.000053692445,0.00043615428,0.00083142763,0.0000036282486,0.000061750114,0.0013630685],"genre_scores_gemma":[0.5004357,8.992409e-7,0.4994953,0.000023572029,0.000026303993,0.00000628549,0.0000012720412,0.000005319348,0.0000053107033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858475,0.00010556228,0.0005176953,0.0002616792,0.0002485864,0.00028171844],"domain_scores_gemma":[0.99768573,0.0008121025,0.0006202658,0.0005073136,0.0003304612,0.000044099685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085087493,0.00013320452,0.00033569956,0.00013228547,0.00008221012,0.00003895891,0.00078203477,0.00008292205,0.000006554261],"category_scores_gemma":[0.00033520182,0.00012784984,0.00010776335,0.0003399956,0.00005293759,0.0006657722,0.00013303316,0.000121428195,0.00001086266],"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.00006358732,0.000041827556,0.00013633133,0.00007758316,0.000033160137,1.5879111e-7,0.00198559,0.03386717,0.003973335,0.95186275,0.0000098722385,0.00794861],"study_design_scores_gemma":[0.0006331481,0.0004926686,0.0017817864,0.00012729694,0.000007325602,0.0000025401912,0.000105633066,0.921168,0.041577972,0.033912938,0.000051084866,0.00013959019],"about_ca_topic_score_codex":0.0000029894225,"about_ca_topic_score_gemma":8.888921e-8,"teacher_disagreement_score":0.91794986,"about_ca_system_score_codex":0.00003738748,"about_ca_system_score_gemma":0.00009489148,"threshold_uncertainty_score":0.52135646},"labels":[],"label_agreement":null},{"id":"W2949900368","doi":"","title":"Decompositions of All Different, Global Cardinality and Related Constraints","year":2009,"lang":"en","type":"preprint","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Cardinality (data modeling); Local consistency; Pruning; Consistency (knowledge bases); Solver; Range (aeronautics); Simple (philosophy); Computer science; Decomposition; Propagator; Constraint (computer-aided design); Mathematical optimization; Theoretical computer science; Mathematics; Constraint satisfaction problem; Probabilistic logic; Artificial intelligence; Data mining","score_opus":0.03636397575494158,"score_gpt":0.33868637824003867,"score_spread":0.30232240248509706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949900368","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.07208443,0.000121375095,0.8921728,0.0003184974,0.00045475978,0.00025696846,0.000040890576,0.00015268562,0.034397606],"genre_scores_gemma":[0.5490122,0.00003295757,0.45086876,0.000043462114,0.0000067272404,0.000004668879,0.000013199769,0.0000018658151,0.00001620952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853396,0.00025136492,0.0004136779,0.00044255125,0.00019947939,0.00015898957],"domain_scores_gemma":[0.9987397,0.000043819513,0.00023982364,0.00078110636,0.00010431555,0.00009119824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004105738,0.00017675063,0.00031816115,0.000048402504,0.000038427035,0.00007573829,0.00065388106,0.00022780555,0.000018431534],"category_scores_gemma":[0.00004725568,0.00016150124,0.000104251645,0.00011116589,0.00019615254,0.00011722716,0.0007207478,0.00025275766,0.000003551517],"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.0000050454287,0.000103011334,0.0017497167,0.00007743926,0.000105402105,0.0000043247574,0.00016542387,0.00010307314,0.00028051125,0.9395564,0.00013870238,0.05771092],"study_design_scores_gemma":[0.0004155976,0.00011107005,0.39528108,0.00017637218,0.00009246316,0.00016167662,0.0000178616,0.055938013,0.0031158086,0.54410535,0.000083210376,0.00050147594],"about_ca_topic_score_codex":0.000051441406,"about_ca_topic_score_gemma":0.000003236877,"teacher_disagreement_score":0.47692773,"about_ca_system_score_codex":0.00008846482,"about_ca_system_score_gemma":0.000057409383,"threshold_uncertainty_score":0.658583},"labels":[],"label_agreement":null},{"id":"W2949910966","doi":"10.1609/aaai.v29i1.9755","title":"SAT Modulo Monotonic Theories","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Earl Haig Secondary School; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid; Compute Canada","keywords":"Monotonic function; Computer science; Modulo; Answer set programming; Theoretical computer science; Satisfiability modulo theories; Variety (cybernetics); Set (abstract data type); Programming language; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.13960626480657615,"score_gpt":0.33423574303286674,"score_spread":0.1946294782262906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949910966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2173591,0.00009385895,0.6622522,0.0058342605,0.002623829,0.0010584504,0.0000066941366,0.00044441663,0.11032721],"genre_scores_gemma":[0.9292302,0.000016909982,0.070229426,0.00016116399,0.000060301954,0.00003270776,2.1589415e-7,0.00001046721,0.00025858503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980928,0.000038136015,0.00049367076,0.00044540243,0.00060411874,0.00032591354],"domain_scores_gemma":[0.99800736,0.000064598615,0.00037677176,0.00050483126,0.0009177888,0.0001286381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001276514,0.00020571145,0.00022679806,0.00011449173,0.00014260162,0.0002685717,0.0028288893,0.00009428862,0.000016781254],"category_scores_gemma":[0.001188309,0.00014958484,0.00009294915,0.0007387875,0.00035426757,0.0007866631,0.0005025539,0.00027500535,0.0002022017],"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.000037540758,0.000057994926,0.000083541214,0.000011808573,0.0000060317825,1.2584306e-7,0.0017176806,0.000066583234,0.0074119265,0.94021976,0.0000987545,0.05028827],"study_design_scores_gemma":[0.000014892213,0.00012636233,0.00010196002,0.000046926252,0.0000043364666,0.0000033652761,0.00046396133,0.083300985,0.39523605,0.5204158,0.00015526004,0.0001301065],"about_ca_topic_score_codex":0.000023012775,"about_ca_topic_score_gemma":0.0000027021244,"teacher_disagreement_score":0.71187115,"about_ca_system_score_codex":0.00008009443,"about_ca_system_score_gemma":0.00015587361,"threshold_uncertainty_score":0.6099893},"labels":[],"label_agreement":null},{"id":"W2950271745","doi":"10.48550/arxiv.1903.03218","title":"Local Reasoning for Parameterized First Order Protocols","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Parameterized complexity; Computer science; Oracle; Topology (electrical circuits); Modular design; Bounded function; Theoretical computer science; Process (computing); Network topology; Model checking; Distributed computing; Algorithm; Mathematics; Programming language; Computer network","score_opus":0.13119809707499966,"score_gpt":0.2557453834104316,"score_spread":0.12454728633543197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950271745","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.005235562,0.0000066929842,0.9813797,0.000044538116,0.0005627014,0.011502525,0.000014019004,0.00029026397,0.00096399966],"genre_scores_gemma":[0.4101405,0.000008447366,0.5881511,0.000072198876,0.000049948114,0.00047635072,0.000016971599,0.00002915877,0.0010553108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776775,0.0001745231,0.00030601965,0.0012333501,0.00010487657,0.0004135095],"domain_scores_gemma":[0.9969839,0.00020697738,0.0004445365,0.0019267765,0.00031749383,0.00012030424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007255813,0.00032315322,0.00041859577,0.0001870964,0.00017706794,0.00018759449,0.0023694194,0.00039602647,0.000015635931],"category_scores_gemma":[0.0002795773,0.00036951367,0.000219391,0.0005327935,0.000119970864,0.00049545517,0.0015230707,0.00046933707,0.000093321694],"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.00026047576,0.00014465491,0.0016916376,0.0007903212,0.00009872758,0.000030415747,0.00026317395,0.43619284,0.00004600333,0.556308,0.00036814026,0.0038056343],"study_design_scores_gemma":[0.0007648828,0.00012525902,0.0003259135,0.00020195966,0.000029165098,0.0000030939943,0.000022961942,0.9774459,0.00039125138,0.0133689,0.0068716845,0.00044904006],"about_ca_topic_score_codex":0.00004589972,"about_ca_topic_score_gemma":0.000007934692,"teacher_disagreement_score":0.54293907,"about_ca_system_score_codex":0.00028233684,"about_ca_system_score_gemma":0.00024410198,"threshold_uncertainty_score":0.99987566},"labels":[],"label_agreement":null},{"id":"W2950924851","doi":"10.2168/lmcs-2(1:4)2006","title":"Approximate reasoning for real-time probabilistic processes","year":2006,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Bisimulation; Probabilistic logic; Metric (unit); Computer science; Characterization (materials science); Coinduction; Algorithm; Kernel (algebra); Class (philosophy); Theoretical computer science; Mathematics; Discrete mathematics; Artificial intelligence; Mathematical proof","score_opus":0.0542199564321787,"score_gpt":0.3756684191022505,"score_spread":0.3214484626700718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950924851","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.0028362651,0.00004128168,0.99300086,0.00013882374,0.00056435534,0.00076013635,0.0000015027211,0.00040699108,0.0022497794],"genre_scores_gemma":[0.005437191,0.000004655284,0.99401337,0.00011207244,0.00016717927,0.00021248072,0.0000015272149,0.000011567044,0.00003996326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622804,0.0004890299,0.00063726754,0.0013070835,0.00051894377,0.00081961346],"domain_scores_gemma":[0.9968424,0.0014313081,0.00025075642,0.00093836617,0.00040547733,0.00013170402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008596239,0.00025842272,0.00038200457,0.00030698086,0.00033597258,0.00052874535,0.0028827486,0.00011313295,0.000004233098],"category_scores_gemma":[0.0024129231,0.0002123792,0.00006794524,0.0032112026,0.00062500185,0.0012271437,0.0005690174,0.00019236964,0.000010331164],"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.000019064102,0.00026222726,0.00026170493,0.00017487079,0.0000022939018,0.0000074362956,0.00029183066,0.010667779,0.013966389,0.66611123,0.000051929568,0.30818322],"study_design_scores_gemma":[0.00019660154,0.00016767798,0.0028844206,0.000052898777,0.0000025046622,0.000024482122,0.0000019517825,0.8180525,0.009872158,0.16829522,0.00017906651,0.00027053544],"about_ca_topic_score_codex":0.000026635998,"about_ca_topic_score_gemma":0.0000016510113,"teacher_disagreement_score":0.8073847,"about_ca_system_score_codex":0.00017924327,"about_ca_system_score_gemma":0.00027785578,"threshold_uncertainty_score":0.8660572},"labels":[],"label_agreement":null},{"id":"W2950981526","doi":"10.48550/arxiv.1209.4623","title":"Counting inequivalent monotone Boolean functions","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monotone polygon; Monotonic function; Combinatorics; Mathematics; Boolean function; Discrete mathematics; Mathematical analysis","score_opus":0.14141903910241485,"score_gpt":0.22206075483099294,"score_spread":0.08064171572857809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950981526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11339098,0.000085272266,0.8788323,0.000041084815,0.0018294371,0.00026537626,0.000011767035,0.00034615977,0.0051976233],"genre_scores_gemma":[0.9430431,0.000064203945,0.055092208,0.00006444036,0.00019440439,0.0000025218358,0.000018943307,0.000019669096,0.001500477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980699,0.00019503375,0.00029593555,0.00086579885,0.00012732144,0.00044600345],"domain_scores_gemma":[0.9974719,0.000059824317,0.0003960477,0.0017012615,0.0001864013,0.00018453381],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084071385,0.00029252417,0.000271318,0.0002648394,0.00023815951,0.00013260792,0.0017474977,0.00028691997,0.00004785041],"category_scores_gemma":[0.00007997437,0.0003564215,0.00018403653,0.00057469436,0.00009595984,0.000865166,0.0022129945,0.00070988113,0.00039283952],"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.000027367032,0.00023843863,0.013430372,0.00016858545,0.00012284628,0.000044608223,0.0005209999,0.141495,0.00026973445,0.83740973,0.0006385252,0.0056338077],"study_design_scores_gemma":[0.00037146243,0.000043533604,0.007945655,0.00010202046,0.0001370779,0.000009739225,0.00011666511,0.96983284,0.0007241409,0.013527137,0.0063255085,0.00086424954],"about_ca_topic_score_codex":0.00008606034,"about_ca_topic_score_gemma":0.000005614931,"teacher_disagreement_score":0.82965213,"about_ca_system_score_codex":0.00034649,"about_ca_system_score_gemma":0.00011175058,"threshold_uncertainty_score":0.9998888},"labels":[],"label_agreement":null},{"id":"W2951523223","doi":"10.48550/arxiv.1305.6669","title":"Domino Tatami Covering is NP-complete","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","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 Victoria","funders":"","keywords":"Domino; Combinatorics; Boolean satisfiability problem; Mathematics; Graph; Induced subgraph; NP-complete; Discrete mathematics; Computer science; Time complexity; Biology","score_opus":0.14061143713504784,"score_gpt":0.2112181318636684,"score_spread":0.07060669472862055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951523223","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.12805937,0.000036238765,0.8639918,0.000082386316,0.0011549614,0.0003507937,0.000023614193,0.00031956652,0.005981273],"genre_scores_gemma":[0.82425416,0.00010763089,0.17238224,0.0003711127,0.00009869653,0.0000032280204,0.0000126922905,0.000025792659,0.0027444493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759126,0.0001993952,0.00032279897,0.0012959862,0.00014327405,0.00044731426],"domain_scores_gemma":[0.9967957,0.000097612916,0.0004171282,0.0023054732,0.00019508721,0.00018900415],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044134993,0.00036888418,0.00038214668,0.00027960233,0.00018208078,0.00026773755,0.0032763905,0.00031707616,0.00016875844],"category_scores_gemma":[0.00006582186,0.00044343228,0.00022408899,0.0005320205,0.00013936836,0.00093650457,0.003191152,0.00068804796,0.0009752557],"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.000027784834,0.00009976737,0.0021067725,0.0002632783,0.00013749422,0.00014166044,0.0008587,0.052510653,0.000612875,0.93466973,0.0021096102,0.0064616594],"study_design_scores_gemma":[0.00040144197,0.00004313036,0.0027883095,0.00006708688,0.000044925004,0.000011517993,0.000033501732,0.9350069,0.0008069113,0.0480948,0.011968224,0.0007332323],"about_ca_topic_score_codex":0.00028725062,"about_ca_topic_score_gemma":0.000004118812,"teacher_disagreement_score":0.8865749,"about_ca_system_score_codex":0.0002887918,"about_ca_system_score_gemma":0.00011127538,"threshold_uncertainty_score":0.9998026},"labels":[],"label_agreement":null},{"id":"W2951581191","doi":"10.1145/3328833.3328866","title":"Case Study","year":2019,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"McMaster University; Royal Bank of Canada","funders":"","keywords":"Liveness; Computer science; Correctness; Model checking; Computation tree logic; Temporal logic; Formal verification; Process (computing); Software engineering; Programming language","score_opus":0.050203918006621655,"score_gpt":0.33278875542635117,"score_spread":0.2825848374197295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951581191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55270195,0.0000012029037,0.43113792,0.000014543981,0.00022179635,0.00012274829,1.675659e-8,0.00007875876,0.015721044],"genre_scores_gemma":[0.6295907,4.680962e-8,0.36952624,0.000048856196,0.0000048056504,0.0000028268064,1.40156855e-8,9.318406e-7,0.0008256049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996258,0.00004373601,0.00006264012,0.00012676624,0.000078563244,0.000062473846],"domain_scores_gemma":[0.9994516,0.000018267552,0.000015288457,0.00047670587,0.000019218325,0.000018920517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029049997,0.000028560287,0.00003456306,0.000025199293,0.000020293885,0.000039379916,0.000263094,0.000009564361,0.0000518932],"category_scores_gemma":[0.000010758582,0.000022788041,0.00000904079,0.00013300934,0.0000031261568,0.0002873249,0.00009305582,0.000030216543,0.0006377134],"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.0000025331403,0.00042291806,0.040292013,0.000008949089,0.000015263871,0.0011965284,0.006413266,0.000074393,0.00066624396,0.74865025,0.00045173266,0.20180592],"study_design_scores_gemma":[0.0016967161,0.0017914126,0.027205849,0.0000053701924,0.000009079559,0.011980163,0.008658304,0.92556,0.0096270265,0.0043267165,0.008392277,0.000747097],"about_ca_topic_score_codex":0.00005054446,"about_ca_topic_score_gemma":0.000003085018,"teacher_disagreement_score":0.9254856,"about_ca_system_score_codex":0.0000080540285,"about_ca_system_score_gemma":0.0000076016136,"threshold_uncertainty_score":0.8196729},"labels":[],"label_agreement":null},{"id":"W2951800195","doi":"10.48550/arxiv.1005.5142","title":"Unprovability of the Logical Characterization of Bisimulation","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Characterization (materials science); Bisimulation; Counterexample; Markov chain; Markov process; Set (abstract data type); Mathematics; State (computer science); Discrete mathematics; Event (particle physics); Computer science; Theoretical computer science; Pure mathematics; Algorithm; Programming language; Statistics","score_opus":0.10242870429841003,"score_gpt":0.2162461906276554,"score_spread":0.11381748632924538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951800195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5211497,8.625373e-7,0.47807807,0.00001991685,0.00037783963,0.00017921359,0.0000069382,0.00002526704,0.00016218322],"genre_scores_gemma":[0.9826274,0.0000068188297,0.017253986,0.00001133067,0.000020975447,4.6489902e-7,0.000008453557,0.000004670826,0.00006589958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987516,0.00026738294,0.00031115848,0.0004575425,0.00010496788,0.000107339576],"domain_scores_gemma":[0.997429,0.0000654443,0.0007166141,0.0014660797,0.0002891617,0.00003371381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005896379,0.00012891526,0.00021457375,0.00009281325,0.00005384611,0.000016369331,0.0015393059,0.0003041691,0.000011834977],"category_scores_gemma":[0.0001928639,0.00011051596,0.00014970331,0.00053846114,0.00020626404,0.00026026138,0.0011619027,0.0004250331,0.0000027432225],"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.000047453774,0.0002492526,0.056476146,0.00029920222,0.000031228315,0.0000015895639,0.00033992747,0.08103763,0.047200356,0.8103253,0.0000016116561,0.0039902767],"study_design_scores_gemma":[0.00012599863,0.00002574962,0.24073243,0.000032982534,0.000023713106,4.9518684e-7,0.000004868794,0.7044553,0.025952974,0.028465832,0.0000483229,0.0001313318],"about_ca_topic_score_codex":0.000028784985,"about_ca_topic_score_gemma":0.0000037755717,"teacher_disagreement_score":0.7818595,"about_ca_system_score_codex":0.00005849572,"about_ca_system_score_gemma":0.00009595888,"threshold_uncertainty_score":0.450671},"labels":[],"label_agreement":null},{"id":"W2953100857","doi":"10.48550/arxiv.1710.05763","title":"A Hierarchy of Scheduler Classes for Stochastic Automata","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Computer science; Reachability; Automaton; Rotation formalisms in three dimensions; Probabilistic logic; Scheduling (production processes); Hierarchy; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.17335391700904576,"score_gpt":0.2617578539073676,"score_spread":0.08840393689832185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953100857","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.03642901,0.00003320617,0.9608118,0.000057178153,0.0008729104,0.00051958836,0.0000368645,0.0001788374,0.0010606122],"genre_scores_gemma":[0.7303689,0.000018224502,0.26901242,0.000013684484,0.000045179113,0.0000039196325,0.0000088105235,0.000013234778,0.00051562296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983794,0.000114407085,0.00027045317,0.00084632623,0.000102399594,0.00028702721],"domain_scores_gemma":[0.9961432,0.00018718484,0.00069664686,0.0025558036,0.00031165918,0.00010545714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061894424,0.00024146975,0.00037583406,0.00028201647,0.00018845424,0.000111970454,0.0035501856,0.00028520453,0.000005795394],"category_scores_gemma":[0.00046362224,0.00027966042,0.00022155965,0.00019391785,0.00023138635,0.00055603095,0.0019317216,0.00034843665,0.000018107474],"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.000052010717,0.00010038027,0.00024212008,0.00033546335,0.00007844756,0.000010538863,0.0001370685,0.069355346,0.00008737762,0.9259525,0.00013785201,0.0035108721],"study_design_scores_gemma":[0.00041368158,0.00007858182,0.0010306247,0.000120254954,0.0000564924,0.0000022222098,0.000014445843,0.89115375,0.0004353729,0.106069475,0.0003400412,0.00028503968],"about_ca_topic_score_codex":0.000036401612,"about_ca_topic_score_gemma":0.0000052659198,"teacher_disagreement_score":0.82179844,"about_ca_system_score_codex":0.00012565473,"about_ca_system_score_gemma":0.0003005859,"threshold_uncertainty_score":0.99996555},"labels":[],"label_agreement":null},{"id":"W2954319419","doi":"10.1007/978-3-030-24258-9_12","title":"Simplifying CDCL Clause Database Reduction","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid","keywords":"Computer science; Reduction (mathematics); Simple (philosophy); Sorting; Solver; Scheme (mathematics); Theoretical computer science; Algorithm; Programming language; Mathematics","score_opus":0.04248878874882649,"score_gpt":0.30148621342021886,"score_spread":0.25899742467139236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954319419","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.00007927391,0.00027760016,0.9878781,0.0003009598,0.005509133,0.0005370811,0.00000772455,0.00026492277,0.005145221],"genre_scores_gemma":[0.014825892,0.00008901215,0.98327446,0.00059844746,0.00059724326,0.000008504204,0.000015462507,0.000043365708,0.00054761284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955098,0.000074485826,0.0006303558,0.0019450937,0.0011448174,0.0006954721],"domain_scores_gemma":[0.99580675,0.00027103667,0.00045387202,0.003022262,0.0002766256,0.00016947492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018705707,0.0005329869,0.00048507986,0.0010018063,0.00027277926,0.00058488786,0.004124789,0.00037530463,0.000026590687],"category_scores_gemma":[0.00021017344,0.00052127766,0.0001196835,0.0008180983,0.00054797094,0.0022961546,0.0017426799,0.0011237351,0.00025440435],"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.000010165735,0.000029442721,0.000017789105,0.00010016221,0.000010831828,0.000029620598,0.00062794937,0.019816218,0.0023528503,0.18094397,0.000055004064,0.796006],"study_design_scores_gemma":[0.00035364827,0.00022018718,0.00011052004,0.00066691963,0.000015250131,0.00030005467,3.9254093e-7,0.8843583,0.011677075,0.09362809,0.0073974454,0.0012721433],"about_ca_topic_score_codex":0.000019811352,"about_ca_topic_score_gemma":0.000008336466,"teacher_disagreement_score":0.86454207,"about_ca_system_score_codex":0.0005027709,"about_ca_system_score_gemma":0.00070943026,"threshold_uncertainty_score":0.99972385},"labels":[],"label_agreement":null},{"id":"W2954358149","doi":"10.5381/jot.2019.18.2.a15","title":"A Model-driven Approach to Trace Checking of Temporal Properties with Aggregations.","year":2019,"lang":"en","type":"article","venue":"The Journal of Object Technology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; Université du Luxembourg","keywords":"TRACE (psycholinguistics); Computer science; Model checking; Programming language; Linguistics","score_opus":0.03461403729600643,"score_gpt":0.25778804401557076,"score_spread":0.22317400671956433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954358149","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.43520045,0.000097990145,0.56358635,0.0005428215,0.000037109294,0.00015443275,1.4039566e-7,0.000029203911,0.00035149022],"genre_scores_gemma":[0.55763674,0.000005765125,0.44229808,0.000016719903,0.0000049012565,0.0000030089848,2.6570655e-8,0.0000041344833,0.000030616895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911207,0.00007825784,0.00032061906,0.0001018367,0.00024420788,0.00014303309],"domain_scores_gemma":[0.99872726,0.000021996279,0.0004712209,0.0005044984,0.00025151618,0.000023516575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082726986,0.000085630345,0.00021138178,0.00034202726,0.000048027814,0.000015867001,0.0013035983,0.00007366706,6.2780543e-7],"category_scores_gemma":[0.000084397645,0.00004764774,0.000033740267,0.00075222005,0.000109172855,0.00031997147,0.0001328956,0.00027974043,0.0000037588609],"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.0005241962,0.00049460435,0.0048821853,0.00018390552,0.00022057335,0.0000048062357,0.020104824,0.43411142,0.2732365,0.19381776,0.00013456082,0.07228464],"study_design_scores_gemma":[0.0005516419,0.0012654526,0.0005876915,0.00020747074,0.000030188745,0.00078063377,0.0011370995,0.77164716,0.22006473,0.0033839336,0.00016797331,0.00017601023],"about_ca_topic_score_codex":0.0000046868336,"about_ca_topic_score_gemma":0.0000012002702,"teacher_disagreement_score":0.33753574,"about_ca_system_score_codex":0.00004232619,"about_ca_system_score_gemma":0.00012656358,"threshold_uncertainty_score":0.24224317},"labels":[],"label_agreement":null},{"id":"W2955759369","doi":"10.1007/978-3-030-24258-9_11","title":"Speeding Up Assumption-Based SAT","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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; Solver; Boolean satisfiability problem; Maximum satisfiability problem; Simple (philosophy); Satisfiability; Conjunctive normal form; Propositional calculus; Propositional formula; Algorithm; Forcing (mathematics); Theoretical computer science; Mathematical optimization; Programming language; Mathematics; Boolean function; Propositional variable; Description logic","score_opus":0.039111113249432665,"score_gpt":0.291996833086991,"score_spread":0.2528857198375583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955759369","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.00006912016,0.0001830686,0.9859741,0.00043936397,0.007146653,0.0004624985,0.0000039705014,0.00025322833,0.005468017],"genre_scores_gemma":[0.02735437,0.000015040008,0.969778,0.0014249375,0.0004649832,0.0000061314054,0.000008009516,0.00004030705,0.0009082237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956102,0.000058933678,0.0005912053,0.001698157,0.0013454028,0.00069614156],"domain_scores_gemma":[0.99641657,0.0005988273,0.00043076856,0.0020873994,0.0003045204,0.00016194208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018997885,0.00054140727,0.0005188654,0.0010825241,0.00023019458,0.0006882875,0.0043787374,0.0004215172,0.00004796685],"category_scores_gemma":[0.0002349303,0.0005202461,0.00016345864,0.0007104707,0.00051178975,0.00095847086,0.0009197839,0.0009534311,0.00043886193],"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.000008745649,0.000022424365,0.0001963469,0.00009562576,0.000009565011,0.000022669828,0.000416533,0.065087594,0.00057892007,0.12549752,0.000050896146,0.80801314],"study_design_scores_gemma":[0.00025529708,0.00012933332,0.0003490811,0.00037438198,0.0000066688926,0.000026161013,7.445623e-8,0.9394962,0.0042862017,0.051061142,0.0033218064,0.000693611],"about_ca_topic_score_codex":0.00001013522,"about_ca_topic_score_gemma":0.000010833663,"teacher_disagreement_score":0.87440866,"about_ca_system_score_codex":0.00057620317,"about_ca_system_score_gemma":0.00090035255,"threshold_uncertainty_score":0.9997249},"labels":[],"label_agreement":null},{"id":"W2960547283","doi":"10.1007/978-3-030-20323-8_9","title":"An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Formal Methods in Verification","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 Victoria","funders":"","keywords":"Boolean function; Affine transformation; Equivalence (formal languages); Mathematics; Algorithm; Boolean expression; Equivalence class (music); Class (philosophy); Representation (politics); Sequence (biology); And-inverter graph; Discrete mathematics; Computer science; Pure mathematics; Artificial intelligence","score_opus":0.049039556625157334,"score_gpt":0.30364176512512336,"score_spread":0.254602208499966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960547283","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.000010838376,0.000049692786,0.87753785,0.00008503419,0.00048070218,0.0004504283,0.000047552545,0.000085913205,0.12125197],"genre_scores_gemma":[0.00012330929,0.0000322576,0.79736036,0.000031919564,0.00017749977,0.000011010282,0.000077053606,0.000020850612,0.20216571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885327,0.000017577928,0.00034317718,0.00046368584,0.00018374731,0.00013856331],"domain_scores_gemma":[0.9985489,0.00006896307,0.00027167497,0.00085061666,0.0001945983,0.0000652439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039737273,0.00018578567,0.00024656556,0.0001751586,0.00005707971,0.000045175322,0.00043513326,0.00021630684,0.000051428342],"category_scores_gemma":[0.000018162944,0.00017627269,0.00007983121,0.000042160864,0.00007484467,0.0003931412,0.000059664733,0.00015056119,0.000031060164],"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.0000034197656,0.000015244881,0.0000017598134,0.000024197232,0.000013290426,7.6142825e-8,0.000027532884,0.0000056055073,0.0003975674,0.67113787,0.00024439723,0.32812905],"study_design_scores_gemma":[0.0003274825,0.0006713131,0.00056109787,0.000041127936,0.000042606767,0.000011443187,0.000016484926,0.874776,0.0012739456,0.015919851,0.10599788,0.00036075627],"about_ca_topic_score_codex":0.0000050742456,"about_ca_topic_score_gemma":0.0000048676925,"teacher_disagreement_score":0.8747704,"about_ca_system_score_codex":0.000038788763,"about_ca_system_score_gemma":0.00008453957,"threshold_uncertainty_score":0.7188192},"labels":[],"label_agreement":null},{"id":"W2963063504","doi":"10.48550/arxiv.0907.3123","title":"Verification of Timed Automata Using Rewrite Rules and Strategies","year":2009,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Rewriting; Computer science; Automaton; Model checking; Programming language; Theoretical computer science; Graph; Constraint (computer-aided design); Mathematics","score_opus":0.07371287393755604,"score_gpt":0.32965824813825484,"score_spread":0.2559453742006988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963063504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77107394,0.00008323608,0.2278257,0.00010464163,0.00007540934,0.0000709614,9.701326e-7,0.00009233073,0.00067279505],"genre_scores_gemma":[0.6684115,0.000018069235,0.3315006,0.00003659337,0.000016487957,0.0000011950743,0.0000015401245,0.0000026959467,0.000011344102],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99922895,0.00007023273,0.00021792794,0.00022241677,0.00013282246,0.00012765572],"domain_scores_gemma":[0.9992134,0.000028476932,0.00014416911,0.0005105664,0.00006751723,0.000035847923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003474305,0.00008222119,0.000111763366,0.00007395966,0.00006986066,0.000060971768,0.0003462646,0.000051655603,0.0000026327805],"category_scores_gemma":[0.00006489882,0.0000806841,0.00002014261,0.00020985087,0.00006183725,0.00095933775,0.000049457187,0.00006419692,0.000012774964],"study_design_candidate":"observational","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.000023731254,0.00013343891,0.018044263,0.0000671254,0.000018604862,0.0000040447017,0.001670566,0.00020868484,0.4906923,0.38384843,0.000059127604,0.105229706],"study_design_scores_gemma":[0.00017393757,0.00009084326,0.82093674,0.00003593009,0.000007768044,0.000012535569,0.00006400335,0.1317961,0.042060655,0.0044351346,0.0002505603,0.00013578293],"about_ca_topic_score_codex":0.000019343992,"about_ca_topic_score_gemma":4.4264021e-7,"teacher_disagreement_score":0.8028925,"about_ca_system_score_codex":0.00001926406,"about_ca_system_score_gemma":0.00004315714,"threshold_uncertainty_score":0.3290202},"labels":[],"label_agreement":null},{"id":"W2963570331","doi":"10.31390/cosa.12.2.02","title":"Reversibility Checking for Markov Chains","year":2018,"lang":"en","type":"article","venue":"Communications on Stochastic Analysis","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Computer science; Machine learning","score_opus":0.08325838113447669,"score_gpt":0.3787710051011339,"score_spread":0.2955126239666572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963570331","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.0008558683,0.000057458423,0.99505264,0.0010601443,0.000099571014,0.00028900008,0.000015041165,0.00013209097,0.0024381734],"genre_scores_gemma":[0.48718914,0.000004825858,0.51234907,0.0001664444,0.000027210514,0.00007752362,0.000018043176,0.0000047074286,0.0001630218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986426,0.00020861745,0.00033904935,0.0003906445,0.00020031435,0.00021874947],"domain_scores_gemma":[0.9932354,0.00060193177,0.00021347326,0.005440744,0.0004310957,0.000077345234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014191901,0.00012576504,0.000235779,0.00041440627,0.0006525594,0.000087488996,0.0030804116,0.00006491019,0.00001881149],"category_scores_gemma":[0.00095611333,0.00012707197,0.00022166505,0.0021956975,0.00029227298,0.00023949872,0.00051351875,0.00013432596,0.0000553917],"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.000034483146,0.00033080723,0.0003430439,0.000012506681,0.000694462,9.321549e-8,0.0016831735,0.0011135327,0.00014330639,0.9258885,0.00055059954,0.0692055],"study_design_scores_gemma":[0.00014345629,0.00011487542,0.003013767,0.000010765401,0.00025823113,5.772812e-7,0.000071156064,0.99119496,0.00014674946,0.0038891109,0.0009994388,0.00015691125],"about_ca_topic_score_codex":0.000025328449,"about_ca_topic_score_gemma":0.00005040144,"teacher_disagreement_score":0.9900814,"about_ca_system_score_codex":0.00013135496,"about_ca_system_score_gemma":0.000051483214,"threshold_uncertainty_score":0.57242227},"labels":[],"label_agreement":null},{"id":"W2963772421","doi":"10.1609/aaai.v33i01.33011443","title":"Improving Optimization Bounds Using Machine Learning: Decision Diagrams Meet Deep Reinforcement Learning","year":2019,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Bounding overwatch; Reinforcement learning; Computer science; Maximum cut; Mathematical optimization; Set (abstract data type); Relaxation (psychology); Perspective (graphical); Optimization problem; Function (biology); Artificial intelligence; Algorithm; Mathematics; Theoretical computer science","score_opus":0.019186684797348707,"score_gpt":0.2741466304740873,"score_spread":0.25495994567673863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963772421","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.02114157,0.00006105649,0.9746246,0.000022124921,0.00057051866,0.0002725716,3.8536495e-8,0.00032379292,0.002983729],"genre_scores_gemma":[0.3468237,0.000014361514,0.65251666,0.000051605137,0.000027327293,0.0000050561166,0.0000065764434,0.000014703551,0.0005400296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981137,0.00017793945,0.0004133152,0.00046611985,0.0004800678,0.00034886057],"domain_scores_gemma":[0.99881446,0.00013695129,0.00029291297,0.00052585255,0.00013809185,0.00009170676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012333945,0.0001841858,0.00018268172,0.00018686402,0.00031026808,0.000399566,0.00060754485,0.000101816775,0.00014464413],"category_scores_gemma":[0.0004553164,0.00016872368,0.000067052955,0.0005317491,0.000023027176,0.0013830998,0.0004279585,0.0002672643,0.00006525558],"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.000010372784,0.000011310745,0.0026139983,0.000012217485,0.0000056633867,6.7511326e-7,0.00024149637,0.93818897,0.0022372587,0.012843768,0.000001774833,0.043832473],"study_design_scores_gemma":[0.0003218031,0.00017999104,0.00010730389,0.000022300412,0.000006107243,0.00001030344,0.00004634189,0.9951355,0.0031968392,0.00015896751,0.0005893793,0.00022516576],"about_ca_topic_score_codex":0.00014419835,"about_ca_topic_score_gemma":0.0000067606647,"teacher_disagreement_score":0.32568213,"about_ca_system_score_codex":0.00018821222,"about_ca_system_score_gemma":0.000047631285,"threshold_uncertainty_score":0.6880352},"labels":[],"label_agreement":null},{"id":"W2963864435","doi":"10.48550/arxiv.1509.06082","title":"Extending ACL2 with SMT Solvers","year":2015,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 British Columbia","funders":"","keywords":"Computer science; Satisfiability modulo theories; Programming language; Automated theorem proving; Extension (predicate logic); Satisfiability; Range (aeronautics); Key (lock); Theoretical computer science","score_opus":0.16465563654670326,"score_gpt":0.2057636509691067,"score_spread":0.041108014422403444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963864435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15108493,0.000009450528,0.83846325,0.000029830158,0.00020042341,0.0000729392,4.5258716e-7,0.0001848899,0.009953852],"genre_scores_gemma":[0.8660676,0.0000052813157,0.1330137,0.000058697657,0.000021976735,2.598627e-7,6.8847703e-7,0.000006455747,0.00082537904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991061,0.00008100986,0.00008803043,0.0004019731,0.000088185225,0.00023470406],"domain_scores_gemma":[0.99898624,0.000031881365,0.000089235014,0.0006066858,0.000108149725,0.00017780156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038730522,0.00010913754,0.0001009953,0.00012423472,0.000098713266,0.000056433342,0.00084175606,0.00005039073,0.000007721089],"category_scores_gemma":[0.000048146645,0.00010733089,0.000033724722,0.0007754216,0.000082759325,0.0011371815,0.00018469994,0.00011682504,0.00012970407],"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.000041784457,0.00004030008,0.008719949,0.0000067529413,0.000017053912,0.00013001024,0.00040975653,0.020291641,0.00010165365,0.9676765,0.00034183045,0.0022227464],"study_design_scores_gemma":[0.0014015059,0.0003525382,0.0036717798,0.000027811257,0.000033393753,0.000058240337,0.0006073285,0.96732605,0.0025132291,0.017396186,0.006049878,0.00056208717],"about_ca_topic_score_codex":0.000035683217,"about_ca_topic_score_gemma":0.000007689836,"teacher_disagreement_score":0.9502803,"about_ca_system_score_codex":0.00014671587,"about_ca_system_score_gemma":0.00007518324,"threshold_uncertainty_score":0.43768266},"labels":[],"label_agreement":null},{"id":"W2964122084","doi":"10.1109/tac.2018.2828105","title":"Automatic Generation of Optimal Reductions of Distributions","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation Singapore","keywords":"Reduction (mathematics); Backtracking; Algorithm; Mathematics; Property (philosophy); Distribution (mathematics); Mathematical optimization; Computer science; Partial order reduction; Reduction strategy; Model checking","score_opus":0.030881592967351205,"score_gpt":0.2927154525967401,"score_spread":0.2618338596293889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964122084","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.08934187,0.000011371796,0.90859145,0.0002467544,0.00096992403,0.0003952603,0.000056584522,0.0002415466,0.00014521524],"genre_scores_gemma":[0.6827723,0.0000024464348,0.3170506,0.000019758814,0.000040322822,0.00007249293,0.0000017394708,0.0000072523303,0.000033115084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825186,0.00021343502,0.0007176043,0.00026321627,0.00034500475,0.00020890008],"domain_scores_gemma":[0.9982644,0.00015828882,0.00034298454,0.00082526286,0.00033502822,0.00007404708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005074544,0.00015499457,0.00030251112,0.00027352554,0.0002275846,0.00003480775,0.0004637113,0.0000907934,0.00019997658],"category_scores_gemma":[0.00006508179,0.00015208038,0.00015407665,0.000726721,0.00026400702,0.00044664202,0.0000023192626,0.0001019267,0.000047330785],"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.000029824167,0.0014854727,0.000009343426,0.00018242202,0.0003694825,0.000001257138,0.0026291204,0.017165322,0.24814808,0.050561078,0.0005206378,0.678898],"study_design_scores_gemma":[0.0004795523,0.00028782844,0.0003499572,0.00003907812,0.00006221105,0.000013835984,0.000025632307,0.8061672,0.1921895,0.0002470763,0.000033848362,0.00010430356],"about_ca_topic_score_codex":0.000020824113,"about_ca_topic_score_gemma":0.0000066340062,"teacher_disagreement_score":0.7890018,"about_ca_system_score_codex":0.00008462821,"about_ca_system_score_gemma":0.00013717092,"threshold_uncertainty_score":0.62016577},"labels":[],"label_agreement":null},{"id":"W2964131705","doi":"10.3182/20110828-6-it-1002.02287","title":"LTL Control in Uncertain Environments with Probabilistic Satisfaction Guarantees","year":2016,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":58,"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 Waterloo","funders":"","keywords":"Markov decision process; Probabilistic logic; Linear temporal logic; Task (project management); Computer science; Set (abstract data type); Mathematical optimization; Markov process; Robot; Temporal logic; Mathematics; Theoretical computer science; Artificial intelligence; Engineering","score_opus":0.014707213788945935,"score_gpt":0.24479539215054694,"score_spread":0.230088178361601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964131705","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.047925837,0.0000068273894,0.9505617,0.0003289504,0.00009512404,0.00024839526,7.8839037e-7,0.00005281354,0.00077957305],"genre_scores_gemma":[0.7605592,0.000004299224,0.23907039,0.000096844065,0.0000102806125,0.000043624485,1.2242485e-7,0.0000035537769,0.00021166091],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991408,0.00010946256,0.00015428098,0.0002506054,0.00018141873,0.00016346118],"domain_scores_gemma":[0.9994452,0.000096918644,0.000058055968,0.00035569895,0.000014799545,0.00002934524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003293921,0.00008149839,0.00008865509,0.000059194448,0.000027403352,0.000024506964,0.00022791546,0.000032835294,0.000027877986],"category_scores_gemma":[0.000115469025,0.00004536941,0.0000121589765,0.00012813897,0.000054794193,0.00053329306,0.000025556072,0.00003924131,0.00007109326],"study_design_candidate":"observational","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.00012538773,0.00012486705,0.12161046,0.000019560677,0.000020356569,0.0000091316715,0.00050100987,0.0010375936,0.028841812,0.4036626,0.00008389588,0.44396332],"study_design_scores_gemma":[0.0033404757,0.00048785508,0.87776154,0.00010899404,0.000007789363,0.000018082848,0.0000318177,0.09137758,0.00887375,0.015352575,0.002204305,0.00043524522],"about_ca_topic_score_codex":0.00007141366,"about_ca_topic_score_gemma":0.00005881642,"teacher_disagreement_score":0.7561511,"about_ca_system_score_codex":0.00014292689,"about_ca_system_score_gemma":0.0000204494,"threshold_uncertainty_score":0.18501107},"labels":[],"label_agreement":null},{"id":"W2964199111","doi":"10.1109/formalise.2019.00021","title":"On the Formalization of Importance Measures Using HOL Theorem Proving","year":2019,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Computer science; Component (thermodynamics); Scalability; Reliability (semiconductor); Measure (data warehouse); Property (philosophy); Rank (graph theory); Theoretical computer science; Formal verification; Automated theorem proving; Data mining; Mathematics; Programming language","score_opus":0.04569896071797715,"score_gpt":0.28440895998873356,"score_spread":0.23870999927075642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964199111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23773126,0.0000096476215,0.7514938,0.000052967578,0.00012725667,0.00020818792,1.628323e-7,0.000036929738,0.010339762],"genre_scores_gemma":[0.7845106,0.0000010094717,0.2152677,0.000146907,0.0000075755133,0.0000031462912,1.9141446e-7,0.000003515236,0.000059331676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925786,0.0000888217,0.00017144492,0.00013534016,0.00024351275,0.00010301283],"domain_scores_gemma":[0.9991305,0.00008859766,0.00015235983,0.00053347193,0.00008229742,0.000012780661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010052742,0.000057781785,0.00006672072,0.000039725757,0.000051542105,0.00003930881,0.0004895159,0.000026341859,0.000023792334],"category_scores_gemma":[0.00016738582,0.000034761615,0.00002668225,0.00023470551,0.000024078066,0.0004649419,0.00006408742,0.000051296585,0.000011879742],"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.000003314154,0.000008353971,0.0017724569,0.000008291557,0.0000024540027,4.8994554e-8,0.00024307263,0.0008774711,0.008218591,0.9848047,0.000014190383,0.0040470497],"study_design_scores_gemma":[0.000086450505,0.00006260302,0.0027307374,0.00003152386,0.000002282065,0.0000031357074,0.000068270565,0.8318943,0.13900764,0.025931263,0.000091415684,0.00009040275],"about_ca_topic_score_codex":0.000009097873,"about_ca_topic_score_gemma":0.0000013430663,"teacher_disagreement_score":0.95887345,"about_ca_system_score_codex":0.000025012081,"about_ca_system_score_gemma":0.00003228107,"threshold_uncertainty_score":0.14175375},"labels":[],"label_agreement":null},{"id":"W2964574649","doi":"10.1609/icaps.v29i1.3460","title":"Towards a Unified View of AI Planning and Reactive Synthesis","year":2019,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":31,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research","keywords":"Plan (archaeology); Linear temporal logic; Computer science; Temporal logic; Automated planning and scheduling; Artificial intelligence; Theoretical computer science; Geography","score_opus":0.04851122598432915,"score_gpt":0.32375637927044454,"score_spread":0.2752451532861154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964574649","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98497653,0.00008124208,0.0036554064,0.00076501793,0.00022669685,0.00013629897,0.0000042415286,0.00013379888,0.010020768],"genre_scores_gemma":[0.93325,0.000010936561,0.06660997,0.00007849689,0.000010898689,0.000007256181,5.5841673e-7,0.0000057924085,0.000026093685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899626,0.000016775924,0.00027536452,0.00025966333,0.00033234587,0.00011956511],"domain_scores_gemma":[0.9990356,0.00011803049,0.0003519511,0.00010441512,0.00035436815,0.00003565465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062069885,0.00012209038,0.00020348087,0.00014646794,0.00006068984,0.00012940486,0.00065556075,0.000071194,0.0000049530563],"category_scores_gemma":[0.00043679736,0.00009438441,0.000031419382,0.00016773863,0.00006340826,0.0004278766,0.00022323316,0.00021342022,0.00000135237],"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.00014933536,0.000052169904,0.031128997,0.0002875279,0.00013949418,9.813223e-7,0.0046198117,0.00084891886,0.17104207,0.78174055,0.000030467096,0.009959681],"study_design_scores_gemma":[0.00017919336,0.00007237246,0.019338673,0.0017648329,0.000011656336,0.000020774061,0.0006445673,0.8309528,0.14290215,0.0039512687,0.00003147505,0.00013019377],"about_ca_topic_score_codex":0.000016360062,"about_ca_topic_score_gemma":4.3543235e-8,"teacher_disagreement_score":0.83010393,"about_ca_system_score_codex":0.000024012674,"about_ca_system_score_gemma":0.00005438537,"threshold_uncertainty_score":0.38488844},"labels":[],"label_agreement":null},{"id":"W2965200887","doi":"10.1109/mise.2019.00015","title":"Extracting Counterexamples from Transitive-Closure-Based Model Checking","year":2019,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Waterloo","funders":"","keywords":"Counterexample; Transitive closure; Model checking; Computer science; Closure (psychology); Transitive relation; Representation (politics); Transition system; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.032686054796558145,"score_gpt":0.26885197832587265,"score_spread":0.2361659235293145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965200887","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.15367647,0.000017800208,0.83548844,0.00012940116,0.0002155575,0.00012687643,0.0000035814821,0.00020523452,0.010136617],"genre_scores_gemma":[0.508148,6.364687e-7,0.4914633,0.00025850598,0.000015606833,0.000003975289,0.000002706233,0.0000057396023,0.00010148738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988674,0.00007543463,0.00021295798,0.00037538196,0.00026133354,0.00020748453],"domain_scores_gemma":[0.99904424,0.00019128207,0.00009251599,0.0005540609,0.000070795286,0.000047122936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005301422,0.0001172775,0.0001352715,0.000057212663,0.000062749656,0.00013910083,0.0005808597,0.000064837746,0.00008595215],"category_scores_gemma":[0.00004054389,0.00010957925,0.00005926295,0.00015180167,0.00001837849,0.0008438897,0.00004089392,0.00013800347,0.00012974652],"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.000083229774,0.0002425165,0.012255019,0.00008341027,0.00006402392,0.0000078226285,0.005864053,0.09943186,0.33374766,0.4587391,0.00015826707,0.08932302],"study_design_scores_gemma":[0.00024960248,0.000018644765,0.0024513653,0.000024886158,0.0000030456351,8.940415e-7,0.00004576068,0.9496685,0.045368742,0.0017966095,0.00022451355,0.0001473859],"about_ca_topic_score_codex":0.00010568643,"about_ca_topic_score_gemma":0.000013300416,"teacher_disagreement_score":0.8502367,"about_ca_system_score_codex":0.00004704073,"about_ca_system_score_gemma":0.00006874372,"threshold_uncertainty_score":0.4468512},"labels":[],"label_agreement":null},{"id":"W2965773389","doi":"10.24963/ijcai.2019/767","title":"Strong Fully Observable Non-Deterministic Planning with LTL and LTLf Goals","year":2019,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Observable; Linear temporal logic; Computer science; Mathematical proof; Task (project management); Frame (networking); Selection (genetic algorithm); Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence","score_opus":0.022578070315523422,"score_gpt":0.27420339416624095,"score_spread":0.2516253238507175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965773389","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.30337515,0.000019960657,0.6759699,0.00004756235,0.0001534987,0.00016546863,5.06353e-7,0.00008711183,0.02018084],"genre_scores_gemma":[0.49979582,9.013119e-7,0.4990272,0.00008643019,0.000013512018,0.0000066765533,5.7943043e-7,0.0000052337587,0.0010636472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991103,0.000034554785,0.00014349661,0.00031143855,0.00017450738,0.000225696],"domain_scores_gemma":[0.99924874,0.00007756289,0.00007462498,0.00049673265,0.00003503422,0.0000672774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031611798,0.000106614796,0.00013374034,0.00004677828,0.00006613553,0.00016860694,0.00041395298,0.00003991099,0.000025683206],"category_scores_gemma":[0.000019677,0.000082384904,0.0000128916945,0.00013232321,0.00003120671,0.000670394,0.00014189597,0.00008870371,0.00009592741],"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.00016924727,0.00016482598,0.27473357,0.0004916074,0.00010345968,0.00008097534,0.0054297075,0.0055399914,0.019611266,0.5972658,0.0010780478,0.09533153],"study_design_scores_gemma":[0.0007688548,0.00085641694,0.15136118,0.000118516946,0.0000115425455,0.000080823236,0.00027027994,0.83613974,0.0063064666,0.0011363558,0.0024635126,0.00048632413],"about_ca_topic_score_codex":0.000015464639,"about_ca_topic_score_gemma":0.0000011261194,"teacher_disagreement_score":0.8305997,"about_ca_system_score_codex":0.000018736484,"about_ca_system_score_gemma":0.000042313444,"threshold_uncertainty_score":0.3359559},"labels":[],"label_agreement":null},{"id":"W2966537673","doi":"10.24963/ijcai.2019/840","title":"LTL and Beyond: Formal Languages for Reward Function Specification in Reinforcement Learning","year":2019,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":152,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Social Innovation; Vector Institute; University of Toronto","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; Microsoft Research","keywords":"Reinforcement learning; Computer science; Function (biology); Artificial intelligence; Automaton; Representation (politics); Temporal difference learning; Reinforcement; Machine learning; Psychology","score_opus":0.017557404901728094,"score_gpt":0.2801044758634209,"score_spread":0.26254707096169283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966537673","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.03989252,0.000032021402,0.94040483,0.00016060186,0.00019584053,0.00037313608,1.2076579e-7,0.00008197486,0.01885893],"genre_scores_gemma":[0.69006693,0.000015364245,0.30741444,0.0001281405,0.000027395576,0.00003855718,0.000007526254,0.000004617745,0.0022970515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929357,0.000034101355,0.00018262706,0.00020847305,0.000116728384,0.0001645227],"domain_scores_gemma":[0.9995766,0.000053347136,0.000078109726,0.00022864105,0.00003806865,0.000025229947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073274475,0.000065721135,0.00007690958,0.0001081638,0.000049642473,0.00006256942,0.00015573912,0.00004365216,0.000028539955],"category_scores_gemma":[0.00005488573,0.000060821843,0.000015457204,0.00014616938,0.000009485861,0.00096363906,0.00006949441,0.000077581535,0.000035217916],"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.000049706225,0.000014009673,0.0030446409,0.00004578396,0.0000047321705,1.5270481e-7,0.0010153686,0.0027644665,0.0066325283,0.78520685,0.00011126467,0.20111051],"study_design_scores_gemma":[0.0012172513,0.00087407464,0.06276667,0.000023038152,0.000005844409,0.000006478745,0.0012348114,0.8895011,0.012648557,0.0036420566,0.027758494,0.00032165763],"about_ca_topic_score_codex":0.000012265213,"about_ca_topic_score_gemma":0.0000035697958,"teacher_disagreement_score":0.8867366,"about_ca_system_score_codex":0.000042762134,"about_ca_system_score_gemma":0.0000119827155,"threshold_uncertainty_score":0.24802428},"labels":[],"label_agreement":null},{"id":"W2968959540","doi":"10.29007/6l77","title":"Towards Formal Reliability Analysis of Logistics Service Supply Chains using Theorem Proving","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Qatar National Research Fund; Fonds National de la Recherche Luxembourg; Qatar Foundation","keywords":"Computer science; HOL; Reliability (semiconductor); Mathematical proof; Reliability engineering; Service (business); Reliability theory; Node (physics); Product (mathematics); Reliability block diagram; Automated theorem proving; Theoretical computer science; Fault tree analysis; Engineering; Mathematics; Programming language; Business","score_opus":0.04765700939063607,"score_gpt":0.33431774445010043,"score_spread":0.2866607350594644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968959540","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.35259372,0.000011243426,0.6459313,0.00007538972,0.00032927922,0.00011166909,0.0000018468685,0.000069757014,0.0008758305],"genre_scores_gemma":[0.5271624,9.88757e-7,0.47268724,0.00007473123,0.00006389924,0.0000010451614,0.0000018039652,0.000004794407,0.00000310452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789155,0.0002879342,0.00067247136,0.00042770017,0.00030409358,0.00041622855],"domain_scores_gemma":[0.99807525,0.00022267715,0.00036853785,0.00090004015,0.00038473585,0.000048776958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029427996,0.00016214029,0.0003788449,0.00033595297,0.00020134199,0.000074754695,0.001023912,0.000092972805,0.000012511734],"category_scores_gemma":[0.00091014354,0.00016040253,0.0000844138,0.0030049833,0.00024857026,0.0007714145,0.0008288057,0.00017962465,0.000001695433],"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.000088060675,0.00017705864,0.072010934,0.0003511526,0.0002183662,0.000008273035,0.026446631,0.17578717,0.0016136544,0.58446985,0.0000068194695,0.138822],"study_design_scores_gemma":[0.00010137631,0.00008125393,0.051796507,0.00004593684,0.000041385607,0.000006165777,0.00028072752,0.9394465,0.004906699,0.003098372,0.000039835188,0.00015523648],"about_ca_topic_score_codex":0.0003677187,"about_ca_topic_score_gemma":0.00008588325,"teacher_disagreement_score":0.76365936,"about_ca_system_score_codex":0.00016118445,"about_ca_system_score_gemma":0.0001304155,"threshold_uncertainty_score":0.65410256},"labels":[],"label_agreement":null},{"id":"W2972042414","doi":"10.46298/lmcs-17(3:3)2021","title":"The Complexity of Reachability in Affine Vector Addition Systems with States","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; European Commission","keywords":"Undecidable problem; Reachability; Decidability; Parameterized complexity; Affine transformation; Reachability problem; Computational complexity theory","score_opus":0.11524955498833166,"score_gpt":0.38193316286230883,"score_spread":0.26668360787397716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972042414","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.020447217,0.0001316286,0.9775636,0.00054854277,0.0007138683,0.00026861488,0.0000030134943,0.000055302786,0.00026818953],"genre_scores_gemma":[0.18126854,0.000015875785,0.81858873,0.00005587604,0.00002949612,0.000032098178,0.0000011675672,0.000003167306,0.00000505124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953266,0.0021915748,0.00063158385,0.00078848406,0.00061070593,0.00045106738],"domain_scores_gemma":[0.9963428,0.0017919625,0.00023098837,0.0011727784,0.00036919193,0.000092312184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0101191355,0.0001583273,0.0003434607,0.000140706,0.00018484917,0.000250711,0.0018304444,0.00006387172,0.0000041199132],"category_scores_gemma":[0.0011100374,0.00010021441,0.00004078619,0.003269182,0.002026584,0.00062513485,0.00074388797,0.00031706112,0.0000016219459],"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.00003336709,0.0002829077,0.001596778,0.000052860356,0.0000040340665,0.000022860984,0.00067307526,0.0112825455,0.0042461804,0.60208935,0.000008340553,0.37970772],"study_design_scores_gemma":[0.00022555201,0.00021805616,0.10270319,0.00007714293,0.0000012318027,0.00003756217,0.000039866663,0.8348071,0.011183304,0.050358422,0.00019244148,0.00015613298],"about_ca_topic_score_codex":0.00009244152,"about_ca_topic_score_gemma":0.000048683713,"teacher_disagreement_score":0.82352453,"about_ca_system_score_codex":0.00018610193,"about_ca_system_score_gemma":0.0002170474,"threshold_uncertainty_score":0.74670327},"labels":[],"label_agreement":null},{"id":"W2972294382","doi":"10.1007/978-3-030-30281-8_5","title":"Finite Approximation of LMPs for Exact Verification of Reachability Properties","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","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":"Université Laval","funders":"","keywords":"Reachability; Markov decision process; Discretization; Bisimulation; Countable set; Computer science; Probabilistic logic; Computation; Mathematics; State space; Markov process; Discrete mathematics; Algorithm","score_opus":0.047917370854531564,"score_gpt":0.2755737733067918,"score_spread":0.2276564024522602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972294382","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.00047273372,0.00016067535,0.99625635,0.0001136647,0.00087606895,0.0011712885,0.0000113638025,0.00005288547,0.00088499225],"genre_scores_gemma":[0.2247301,0.000014769671,0.7750064,0.000047387493,0.00006236605,0.00002212936,0.000007811253,0.000015443426,0.000093575676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997209,0.00006648817,0.0008180992,0.0009303131,0.00069312606,0.0002829685],"domain_scores_gemma":[0.99609137,0.00054204976,0.00088443654,0.0017568171,0.0006785719,0.000046730787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023051081,0.00029028367,0.000520498,0.0005409749,0.00007451408,0.00007801091,0.002153078,0.00026588052,0.0000034061752],"category_scores_gemma":[0.0006836444,0.00025629142,0.00013328773,0.00043119944,0.00064299244,0.0007398094,0.0003810391,0.00027539127,0.0000046287278],"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.000046734905,0.000073722375,0.0000751524,0.0009369397,0.000012442151,2.417267e-7,0.0019235164,0.041186888,0.009403478,0.12883532,0.0000030594979,0.8175025],"study_design_scores_gemma":[0.00017667985,0.00028459902,0.00026112952,0.00035290638,0.000007593075,0.0000027072938,3.5718756e-7,0.84477955,0.097222395,0.05641773,0.00023389808,0.00026045783],"about_ca_topic_score_codex":0.000020062871,"about_ca_topic_score_gemma":0.0000056587764,"teacher_disagreement_score":0.817242,"about_ca_system_score_codex":0.00018528731,"about_ca_system_score_gemma":0.0005155033,"threshold_uncertainty_score":0.9999889},"labels":[],"label_agreement":null},{"id":"W2973427087","doi":"10.1109/access.2019.2942829","title":"A Methodology for the Formal Verification of Dynamic Fault Trees Using HOL Theorem Proving","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Computer science; Automated theorem proving; Formal verification; Probabilistic logic; Fault tree analysis; Theoretical computer science; Model checking; Spare part; Formal methods; Algorithm; Programming language; Reliability engineering; Artificial intelligence","score_opus":0.14094293948162648,"score_gpt":0.41428185082736724,"score_spread":0.27333891134574073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973427087","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.26781592,0.000046629884,0.73051995,0.00007230738,0.0007947554,0.00059957115,0.0000028997254,0.00003944565,0.000108524415],"genre_scores_gemma":[0.5806243,0.000004945567,0.41922775,0.000045732402,0.000024299428,0.000043473992,9.719249e-7,0.000007107837,0.000021426846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987533,0.00024645228,0.00030496196,0.0002804655,0.00017350337,0.0002412841],"domain_scores_gemma":[0.9979189,0.00075226487,0.00034536113,0.0008038424,0.00015788779,0.00002174377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020827092,0.00010644387,0.00017601666,0.00009836319,0.00012472578,0.000112871756,0.0017932341,0.00007711633,0.000003617113],"category_scores_gemma":[0.00024945755,0.00007604593,0.00007585924,0.0003289567,0.00007330282,0.0016288216,0.00015561357,0.000098073004,0.0000039589318],"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.000134738,0.00006510183,0.0009668743,0.00019772876,0.0000612567,2.9494427e-7,0.0022542723,0.011409505,0.26959455,0.22321346,0.000019862826,0.49208236],"study_design_scores_gemma":[0.00023989336,0.00006708514,0.0061811195,0.000017883074,0.000016683758,0.000007279122,0.00007936816,0.8992696,0.08783071,0.0060481,0.00013512989,0.00010717084],"about_ca_topic_score_codex":0.00005649361,"about_ca_topic_score_gemma":0.000011213294,"teacher_disagreement_score":0.88786006,"about_ca_system_score_codex":0.00005009749,"about_ca_system_score_gemma":0.0000693577,"threshold_uncertainty_score":0.3332305},"labels":[],"label_agreement":null},{"id":"W2974244195","doi":"","title":"Interfacing ASM with the MDG tool","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Interfacing; Computer science; Programming language; Interface (matter); Abstract state machines; Model transformation; Representation (politics); Syntax; Simple (philosophy); Finite-state machine; Software engineering; Artificial intelligence; Operating system; Computer hardware","score_opus":0.019659602215354042,"score_gpt":0.25441472890560196,"score_spread":0.23475512669024792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974244195","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.018736172,0.000010552765,0.9036145,0.00038344244,0.00010924627,0.00006410278,2.9723179e-8,0.000074620286,0.07700729],"genre_scores_gemma":[0.41729814,4.1071496e-7,0.5816653,0.00024539419,0.000005198657,0.000005505468,1.9910972e-8,0.000001807212,0.0007782432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995262,0.00007907987,0.000063835454,0.0001211442,0.00010741485,0.00010232968],"domain_scores_gemma":[0.9994684,0.000041628664,0.000026996637,0.0004199285,0.000028752702,0.000014294654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046784562,0.000045890924,0.00003638438,0.000017095765,0.00007101155,0.00008628366,0.0003834487,0.000013801666,0.000026088459],"category_scores_gemma":[0.000054329776,0.000023482715,0.0000108336535,0.00018966844,0.0000255453,0.00020425457,0.000059400732,0.00007356127,0.000068255984],"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":[9.352856e-7,0.0000051514057,0.000048343834,0.0000013677569,0.0000026626117,4.3391407e-7,0.00033807286,0.00005222716,0.00070228067,0.9750244,0.00036208495,0.023462031],"study_design_scores_gemma":[0.0006196105,0.0004030825,0.0039963406,0.00003611059,0.000011036926,0.00020741828,0.0006731866,0.1194702,0.7051807,0.031906813,0.13685344,0.0006420557],"about_ca_topic_score_codex":0.000004374615,"about_ca_topic_score_gemma":0.0000020379252,"teacher_disagreement_score":0.9431176,"about_ca_system_score_codex":0.0000139915055,"about_ca_system_score_gemma":0.000020397418,"threshold_uncertainty_score":0.09575973},"labels":[],"label_agreement":null},{"id":"W2975757208","doi":"","title":"Affine extensions of integer vector addition systems with states","year":2021,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Monoid; Reachability; Undecidable problem; Mathematics; Combinatorics; Affine transformation; Decidability; Integer (computer science); Discrete mathematics; Rewriting; Conjecture; Reachability problem; Pure mathematics; Computer science","score_opus":0.03581996187329878,"score_gpt":0.2685257887072357,"score_spread":0.23270582683393692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975757208","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.097574994,0.00007006843,0.88594514,0.0006636108,0.00012310057,0.00042780215,0.00034112888,0.000100108395,0.014754022],"genre_scores_gemma":[0.56461924,0.0012741353,0.428957,0.000014028727,0.0000341843,5.383646e-7,0.00024966415,0.000022519383,0.0048287283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99693656,0.0008854694,0.00017908665,0.0005860047,0.0008942228,0.0005186443],"domain_scores_gemma":[0.99647284,0.0005463991,0.00024190873,0.0009826341,0.00149887,0.00025736503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008521587,0.00017876404,0.00038518422,0.0007706603,0.00055807235,0.000044781995,0.0016076347,0.000097012824,0.00013450737],"category_scores_gemma":[0.00016751263,0.00020606461,0.00013849328,0.0019481931,0.000847806,0.0012092288,0.001255856,0.0005150016,0.000007627186],"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.0020177523,0.0010563437,0.0036452548,0.0007974932,0.000578901,0.001405909,0.012414714,0.0040956866,0.019230014,0.9229743,0.009245568,0.022538064],"study_design_scores_gemma":[0.0058675758,0.0039669513,0.05476663,0.0014572025,0.00018293505,0.0002366816,0.09340931,0.3530312,0.007781177,0.007980651,0.46989685,0.0014228278],"about_ca_topic_score_codex":0.0005574087,"about_ca_topic_score_gemma":0.00040661887,"teacher_disagreement_score":0.91499364,"about_ca_system_score_codex":0.00021364941,"about_ca_system_score_gemma":0.000625907,"threshold_uncertainty_score":0.8403071},"labels":[],"label_agreement":null},{"id":"W2976821674","doi":"10.48550/arxiv.1909.13039","title":"Guaranteed-Safe Approximate Reachability via State Dependency-Based Decomposition","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","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":"Simon Fraser University","funders":"","keywords":"Reachability; State space; Computer science; Bounded function; Dependency (UML); Graph; State (computer science); Corollary; Model checking; Topology (electrical circuits); Control theory (sociology); Mathematical optimization; Mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Discrete mathematics","score_opus":0.061695672900666985,"score_gpt":0.22680672596166992,"score_spread":0.16511105306100293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976821674","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.16371807,0.000022252201,0.8321051,0.00004182931,0.0009918688,0.0007109271,0.00003132196,0.00041112548,0.0019675104],"genre_scores_gemma":[0.8200973,0.000016375632,0.17943631,0.00010213638,0.00002882488,0.0000036939466,0.000039649094,0.00002388573,0.00025180035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640363,0.0006520516,0.0004910439,0.0017252287,0.00021860412,0.00050946017],"domain_scores_gemma":[0.9958197,0.0001610783,0.00062926643,0.0029405158,0.00028310958,0.00016634782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013782285,0.00046062315,0.00048537148,0.0003714453,0.00018495697,0.0001620703,0.002736504,0.0003959375,0.00002852578],"category_scores_gemma":[0.000069729744,0.0005477098,0.00030803785,0.00062925415,0.00015561275,0.0006649056,0.0014227161,0.000879284,0.00026686635],"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.00026000664,0.00043600192,0.013558505,0.0007960845,0.00009758778,0.00012708668,0.00036245416,0.8328967,0.0008109633,0.1426367,0.00004615922,0.007971741],"study_design_scores_gemma":[0.00045501237,0.00008388696,0.0027538436,0.000080229904,0.000041824922,0.0000061655137,0.000010430096,0.9203643,0.0023996632,0.07316022,0.00009950292,0.0005449272],"about_ca_topic_score_codex":0.00024937643,"about_ca_topic_score_gemma":0.000022932603,"teacher_disagreement_score":0.6563792,"about_ca_system_score_codex":0.00056118844,"about_ca_system_score_gemma":0.00030304593,"threshold_uncertainty_score":0.99969745},"labels":[],"label_agreement":null},{"id":"W2978807476","doi":"10.1007/s11081-020-09507-w","title":"How to catch a lion in the desert: on the solution of the coverage directed generation (CDG) problem","year":2020,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"Noise (video); Function (biology); Reliability (semiconductor); Software; Financial engineering; Optimization problem; Quadratic equation","score_opus":0.030665663267915158,"score_gpt":0.2170810003309102,"score_spread":0.18641533706299507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978807476","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.013988536,0.000014516559,0.9751423,0.010363873,0.000078140845,0.00028125924,5.808912e-7,0.000038874983,0.00009191174],"genre_scores_gemma":[0.7637652,0.000018408042,0.23571825,0.00041875857,0.00003115245,0.000031288113,0.0000018050794,0.000004478967,0.0000106648995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950594,0.000079805264,0.00009798956,0.00011369578,0.00012824575,0.000074304335],"domain_scores_gemma":[0.9996936,0.000040691146,0.000040025403,0.00017481382,0.000032472955,0.000018445133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027390252,0.00005870959,0.000048804035,0.000031176813,0.00006750674,0.00010286051,0.0002457233,0.000026213394,8.666299e-7],"category_scores_gemma":[0.00020302866,0.000033199707,0.0000137410825,0.0005848216,0.000006823438,0.00018518597,0.00004551167,0.00007697983,4.544223e-7],"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.0000019296956,0.0000060586003,0.00003053091,0.000009006935,0.0000015056602,7.120686e-8,0.0018737869,0.98079425,0.006769132,0.008853902,0.00010559309,0.0015542571],"study_design_scores_gemma":[0.00005791113,0.000025669431,0.0013696621,0.000014514235,0.0000015107669,8.4527636e-7,0.000016133037,0.9926259,0.005564373,0.000010335257,0.000271755,0.000041370313],"about_ca_topic_score_codex":0.000005625518,"about_ca_topic_score_gemma":0.000001985199,"teacher_disagreement_score":0.74977666,"about_ca_system_score_codex":0.000019090954,"about_ca_system_score_gemma":0.00000906555,"threshold_uncertainty_score":0.13538447},"labels":[],"label_agreement":null},{"id":"W2978827086","doi":"10.1109/async.2019.00021","title":"Verifying Timed, Asynchronous Circuits using ACL2","year":2019,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 British Columbia","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Asynchronous communication; Mathematical proof; Parameterized complexity; State (computer science); Programming language; Theoretical computer science; Satisfiability modulo theories; Solver; Algorithm","score_opus":0.04046882695762483,"score_gpt":0.2976091208444998,"score_spread":0.257140293886875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978827086","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.09587218,0.000033976827,0.86977786,0.000028454804,0.00074657006,0.00013508083,1.800424e-7,0.0001883704,0.033217352],"genre_scores_gemma":[0.43261832,0.0000015039523,0.56691957,0.00014578404,0.000029914445,0.0000019070219,3.2940258e-7,0.0000058467317,0.00027682364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907804,0.000058112295,0.00015541773,0.00028259543,0.00019882966,0.00022702696],"domain_scores_gemma":[0.9991536,0.00003742158,0.000065405715,0.00064465875,0.000046182337,0.00005274247],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003821362,0.00008756335,0.00010304785,0.000071870025,0.00007156173,0.00010829727,0.0006509828,0.0000558473,0.00014574992],"category_scores_gemma":[0.00003702864,0.000083163075,0.0000345192,0.00028341883,0.000017925495,0.00080514315,0.00016965756,0.00009507374,0.00096691656],"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.000003415857,0.000070479604,0.0041118306,0.000069364956,0.000026585116,0.0000069388566,0.0011016355,0.002234542,0.11274713,0.4193474,0.00015255602,0.4601281],"study_design_scores_gemma":[0.00021654788,0.000054811342,0.0030612384,0.000020480731,0.0000032216938,0.000042258736,0.000023167213,0.95097727,0.041968215,0.0012133487,0.002178788,0.000240638],"about_ca_topic_score_codex":0.000020243753,"about_ca_topic_score_gemma":3.9188356e-7,"teacher_disagreement_score":0.94874275,"about_ca_system_score_codex":0.0000858101,"about_ca_system_score_gemma":0.00005999246,"threshold_uncertainty_score":0.99981093},"labels":[],"label_agreement":null},{"id":"W2979145587","doi":"10.4018/978-1-60960-845-3.ch008","title":"Logical Methods for Self-Configuration of Network Devices","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université du Québec à Chicoutimi","funders":"","keywords":"Scripting language; Computer science; Template; Programming language; Logical conjunction; Constraint (computer-aided design); Point (geometry); Logical consequence; Theoretical computer science; Mathematics; Artificial intelligence; Geometry","score_opus":0.0667305861970299,"score_gpt":0.34198561517672704,"score_spread":0.2752550289796971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979145587","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":[8.383428e-7,0.00020547783,0.5273929,0.000007981583,0.0005665897,0.00036545505,0.000008051822,0.00012600567,0.47132668],"genre_scores_gemma":[0.0012367925,0.0000052776877,0.9935466,0.00020529961,0.0002594296,0.00004745205,0.0000032485816,0.000019362124,0.004676528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812585,0.0001301583,0.00064015953,0.0005591153,0.00023233613,0.00031239638],"domain_scores_gemma":[0.99786514,0.00017194936,0.00071443216,0.0008376887,0.00030965466,0.00010112835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011018009,0.00033265614,0.0005104842,0.000049989434,0.00009237155,0.00006729596,0.0011636852,0.00052212883,0.000014955017],"category_scores_gemma":[0.000065289336,0.00030638918,0.0002488099,0.00003605546,0.000110025736,0.00014997619,0.0002050795,0.00017843292,0.000027126385],"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.000018288807,0.0000072709618,0.0000018456261,0.000055242916,0.000053528798,7.9509755e-7,0.00006304406,0.0000062698127,0.000016758568,0.8606306,0.00024726582,0.13889912],"study_design_scores_gemma":[0.0001482557,0.00023642615,0.0000491432,0.00008876228,0.00007024033,0.000014242037,0.0000011594268,0.0022743335,0.0010321392,0.9199807,0.07578172,0.00032289358],"about_ca_topic_score_codex":0.000009201592,"about_ca_topic_score_gemma":0.0000043685304,"teacher_disagreement_score":0.46665016,"about_ca_system_score_codex":0.00011393773,"about_ca_system_score_gemma":0.00015795958,"threshold_uncertainty_score":0.99993885},"labels":[],"label_agreement":null},{"id":"W2980072217","doi":"","title":"Practical Posterior Error Bounds from Variational Objectives","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","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":"University of British Columbia; University of British Columbia Hospital","funders":"","keywords":"Computer science; Mathematical optimization; Mathematical economics; Mathematics","score_opus":0.08651474734814653,"score_gpt":0.24220790264512568,"score_spread":0.15569315529697914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980072217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34378058,0.0000032786468,0.6520608,0.00015481442,0.00044079154,0.00010285138,0.000004760559,0.00009693473,0.003355171],"genre_scores_gemma":[0.78572655,0.0000017677537,0.21324022,0.00015560302,0.00003736988,3.4342324e-7,0.000004476188,0.000005705636,0.00082796847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886274,0.00017835239,0.00013499065,0.00053053215,0.00009825013,0.0001951553],"domain_scores_gemma":[0.9988463,0.00020738729,0.00013174616,0.00062579085,0.00010360691,0.00008516795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027128452,0.00011414798,0.00012566434,0.00009648041,0.000098376615,0.00009372262,0.0005980796,0.00008966789,0.00018037157],"category_scores_gemma":[0.00011745328,0.00012789186,0.00006360134,0.00045065445,0.000054401695,0.001592541,0.00025212253,0.00016471531,0.0007702576],"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.00005503846,0.000082264756,0.015544885,0.000005190023,0.00003185481,0.00002769801,0.00027105774,0.0014084041,0.0011513246,0.9809094,0.00009746432,0.0004154182],"study_design_scores_gemma":[0.00063528615,0.00013782557,0.10973614,0.000011169945,0.000022704537,0.0000146340435,0.0001482826,0.8547461,0.00086818205,0.031518336,0.0018505338,0.00031080146],"about_ca_topic_score_codex":0.00007104743,"about_ca_topic_score_gemma":0.0000063382645,"teacher_disagreement_score":0.94939107,"about_ca_system_score_codex":0.00012615568,"about_ca_system_score_gemma":0.00011848887,"threshold_uncertainty_score":0.990036},"labels":[],"label_agreement":null},{"id":"W2980365261","doi":"10.1007/978-3-030-33636-3_3","title":"Certification of Breadth-First Algorithms by Extraction","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Certification; Computer science; Extraction (chemistry); Algorithm; Chromatography; Chemistry; Political science; Law","score_opus":0.029191592871803822,"score_gpt":0.28726548133904184,"score_spread":0.258073888467238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980365261","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.00004219637,0.0003514496,0.99291587,0.00044246402,0.002786082,0.000469562,0.000010260379,0.00011528256,0.0028668211],"genre_scores_gemma":[0.03248563,0.000095037394,0.9663042,0.00021521731,0.00019999185,0.0000101986925,0.00001585271,0.000032942953,0.0006409453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964466,0.00004912553,0.00070890726,0.0013171752,0.0010518668,0.00042631748],"domain_scores_gemma":[0.9965624,0.00037117786,0.00072818424,0.0018739364,0.00036361156,0.00010066383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013198192,0.0003967461,0.0004567153,0.0006651496,0.00015061244,0.00023066413,0.0029138986,0.00039291047,0.0000202281],"category_scores_gemma":[0.00012437064,0.00039072675,0.00011285868,0.00064528215,0.0005106913,0.0011145918,0.00049341377,0.00060285773,0.00007849321],"study_design_candidate":"design_other","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.000007029128,0.000050702063,0.000040854822,0.000085491505,0.00000913479,0.0000030630683,0.00045682047,0.008025588,0.002933331,0.033944957,0.00009068255,0.9543523],"study_design_scores_gemma":[0.00022934152,0.00023067485,0.00046387312,0.00035182916,0.000011474839,0.00005637759,2.6381338e-7,0.91205496,0.042041376,0.037317492,0.0065606614,0.0006816591],"about_ca_topic_score_codex":0.00004175605,"about_ca_topic_score_gemma":0.000013888799,"teacher_disagreement_score":0.9536707,"about_ca_system_score_codex":0.000370032,"about_ca_system_score_gemma":0.00037061673,"threshold_uncertainty_score":0.99985445},"labels":[],"label_agreement":null},{"id":"W2981584093","doi":"10.1007/s10009-019-00543-1","title":"A formal refinement-based analysis of the hybrid ERTMS/ETCS level 3 standard","year":2019,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","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":"Université de Sherbrooke","funders":"","keywords":"Train; Supervisor; Theory of computation; Computer science; Nondeterministic algorithm; Event (particle physics); Control (management); Algorithm; Artificial intelligence","score_opus":0.03523788722718633,"score_gpt":0.3029168370994255,"score_spread":0.26767894987223917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981584093","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.19234332,0.0000207874,0.8034033,0.0026091526,0.0010064298,0.00024598095,0.00021812394,0.000100078076,0.00005279958],"genre_scores_gemma":[0.720927,0.000009063375,0.27813238,0.00076493336,0.000026693302,0.000034295965,0.0000131257675,0.000012240888,0.00008028061],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980235,0.000056362533,0.00058814156,0.00028108724,0.000773207,0.00027769702],"domain_scores_gemma":[0.99818224,0.00021762999,0.0001962498,0.00059845875,0.00076503656,0.00004041416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007710956,0.00016799099,0.00031219522,0.00096510036,0.00011856012,0.00013072006,0.0025566518,0.00013083636,0.00007211571],"category_scores_gemma":[0.0004453962,0.00012201062,0.00046273522,0.0008448083,0.00010317752,0.00068346853,0.00008810057,0.0003908256,0.000008907611],"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.0010692414,0.00038175273,0.01646155,0.00004016934,0.0031567817,0.000015760963,0.00020597906,0.013546182,0.0049060863,0.41611472,0.00062996754,0.5434718],"study_design_scores_gemma":[0.011610111,0.0038801746,0.048856024,0.0005461706,0.0011545749,0.00031790478,0.0001260539,0.1267395,0.64012647,0.027075391,0.13819286,0.0013747412],"about_ca_topic_score_codex":0.000001896304,"about_ca_topic_score_gemma":0.000003653614,"teacher_disagreement_score":0.6352204,"about_ca_system_score_codex":0.00019455038,"about_ca_system_score_gemma":0.00016833753,"threshold_uncertainty_score":0.49754488},"labels":[],"label_agreement":null},{"id":"W2984152414","doi":"","title":"A Formal Mathematical Framework for Modeling Probabilistic Hybrid Systems.","year":2006,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"Computer science; Probabilistic logic; Hybrid system; Dynamical systems theory; Theoretical computer science; Semantics (computer science); Asynchronous communication; Artificial intelligence; Programming language; Machine learning","score_opus":0.04568789712795484,"score_gpt":0.30469147771830524,"score_spread":0.2590035805903504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984152414","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.002677296,0.00003357703,0.99222296,0.00009541343,0.0002992761,0.00062384957,0.000002025145,0.00030237788,0.0037432201],"genre_scores_gemma":[0.2980699,2.7903204e-7,0.70151347,0.00003012712,0.000090724156,0.00016527748,0.0000016187428,0.0000075307917,0.000121094934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877053,0.000038574206,0.00037382988,0.00026854593,0.00021491117,0.00033359192],"domain_scores_gemma":[0.9990325,0.00020401346,0.000071651375,0.00052874495,0.00011593852,0.000047179128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080262317,0.000111329326,0.00015649802,0.00005395171,0.000119855875,0.0002029645,0.0005502658,0.000059015423,0.0000050379167],"category_scores_gemma":[0.0003209038,0.000091846305,0.00006203439,0.0001365048,0.000022000728,0.00061320857,0.00010077242,0.000089155226,0.00004136878],"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.0000030721342,0.000034868048,0.000001961229,0.00010509751,0.0000022115182,4.124932e-7,0.000027464337,0.02732192,0.00001575894,0.97109395,0.000078494435,0.0013147916],"study_design_scores_gemma":[0.000053407588,0.00002291181,0.000002329568,0.00002342994,0.00000282363,0.000015624459,0.000007059199,0.5779578,0.00017803414,0.4215782,0.0000839229,0.000074486605],"about_ca_topic_score_codex":0.000012161205,"about_ca_topic_score_gemma":3.1113387e-7,"teacher_disagreement_score":0.5506359,"about_ca_system_score_codex":0.000052419244,"about_ca_system_score_gemma":0.00003395912,"threshold_uncertainty_score":0.37453836},"labels":[],"label_agreement":null},{"id":"W2984988196","doi":"10.1109/tac.2019.2953452","title":"Auditor Product and Controller Synthesis for Nondeterministic Transition Systems With Practical LTL Specifications","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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":"Canada Research Chairs","keywords":"Nondeterministic algorithm; Transition system; Computer science; Product (mathematics); Controller (irrigation); Programming language; Algorithm; Mathematics","score_opus":0.029601102676275273,"score_gpt":0.27435022521319713,"score_spread":0.24474912253692185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984988196","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.0036500401,0.000021444752,0.9899716,0.0017570426,0.0010428691,0.0030328128,0.000053857006,0.00032550108,0.00014488053],"genre_scores_gemma":[0.82735026,0.0000049059486,0.17073645,0.00009766488,0.00008043435,0.0015548053,8.4120865e-7,0.000023175442,0.00015148315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980556,0.00025404486,0.00046636636,0.00056959986,0.0003522989,0.00030213926],"domain_scores_gemma":[0.9971112,0.0016525013,0.0002262701,0.0006988905,0.00019153647,0.00011957611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006960216,0.00024134162,0.00043035546,0.00019818945,0.0002402221,0.0002430762,0.00025989194,0.000088837056,0.00002728175],"category_scores_gemma":[0.000088454144,0.00019972512,0.00009317478,0.00024673218,0.00008365349,0.00061756244,8.6651147e-7,0.00014727408,0.000087687535],"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.0036934658,0.0050621657,0.000045621277,0.0039108465,0.0026085933,0.000036833964,0.006433007,0.09261661,0.06298017,0.124088384,0.0013193851,0.69720495],"study_design_scores_gemma":[0.0020857714,0.00046183137,0.00028061075,0.00011441865,0.00018750435,0.000103803584,0.00009018921,0.9935858,0.002251851,0.000111163834,0.00045922564,0.0002677982],"about_ca_topic_score_codex":0.0000066975767,"about_ca_topic_score_gemma":0.0000023946914,"teacher_disagreement_score":0.9009692,"about_ca_system_score_codex":0.000096000644,"about_ca_system_score_gemma":0.00012812398,"threshold_uncertainty_score":0.81445545},"labels":[],"label_agreement":null},{"id":"W2988367020","doi":"10.23919/fmcad.2019.8894268","title":"Chasing Minimal Inductive Validity Cores in Hardware Model Checking","year":2019,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"","keywords":"Computer science; Model checking; Programming language; Embedded system","score_opus":0.10606895194637858,"score_gpt":0.3260835646897533,"score_spread":0.22001461274337472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988367020","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.4465147,0.0000043898403,0.54596734,0.000056819492,0.00019997229,0.000106668616,3.870588e-7,0.000064037435,0.007085689],"genre_scores_gemma":[0.5347946,8.929909e-7,0.46493253,0.0000585689,0.000013303499,0.0000046407968,4.0530244e-7,0.0000034495918,0.00019157786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990187,0.000077110395,0.00018081917,0.0003211134,0.00019651851,0.0002056907],"domain_scores_gemma":[0.999378,0.000044025473,0.00007207729,0.00041821034,0.00005349643,0.000034166216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005767728,0.00009060725,0.00012321683,0.00010984284,0.00003658343,0.00007490394,0.0005273429,0.000064584776,0.0000143061025],"category_scores_gemma":[0.00008963311,0.000084937165,0.000029870598,0.00028358796,0.000022240209,0.0009975537,0.00020895706,0.0001535664,0.0000598464],"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.0000406157,0.00017828081,0.045948535,0.00006979207,0.0000127955,0.000006745267,0.011150895,0.016879728,0.032933436,0.7846483,0.00013914499,0.10799173],"study_design_scores_gemma":[0.00014920495,0.000041273885,0.012243588,0.000019758163,7.9453014e-7,0.0000028408706,0.00010646574,0.9611531,0.021246757,0.0048488504,0.00005996895,0.0001274096],"about_ca_topic_score_codex":0.00004166668,"about_ca_topic_score_gemma":0.000005613575,"teacher_disagreement_score":0.94427335,"about_ca_system_score_codex":0.00008676973,"about_ca_system_score_gemma":0.000055092107,"threshold_uncertainty_score":0.34636372},"labels":[],"label_agreement":null},{"id":"W2989341942","doi":"10.1007/s00200-020-00426-y","title":"A nonexistence certificate for projective planes of order ten with weight 15 codewords","year":2020,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Carleton University; University of Waterloo","funders":"","keywords":"Satisfiability; Certificate; Symbolic computation; Simple (philosophy); Projective test; Projective plane; Computation; Theory of computation","score_opus":0.039743496003378974,"score_gpt":0.2590012909516102,"score_spread":0.2192577949482312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989341942","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.024652075,0.00023021219,0.9736151,0.00058371463,0.000017520293,0.0005150382,0.0000017974406,0.00013887566,0.00024567344],"genre_scores_gemma":[0.5233744,0.000020534246,0.4764628,0.00006160944,0.000008692071,0.000057496964,0.0000042034567,0.000008550225,0.000001713178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990536,0.00004437742,0.0003106369,0.00028786188,0.00011636258,0.00018718601],"domain_scores_gemma":[0.9988865,0.00027416137,0.0001533899,0.0005261628,0.000103892075,0.000055873967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003839345,0.0001321038,0.00021582378,0.00007540187,0.00007952803,0.000050633727,0.000761944,0.00005161376,6.0543135e-7],"category_scores_gemma":[0.00008491985,0.00012510142,0.000018577033,0.0006941476,0.000050669016,0.00018594472,0.00024997973,0.00017313105,0.0000010033167],"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.00016263608,0.00021305216,0.0041102665,0.0010925418,0.0001002703,0.0000017452389,0.014539613,0.10468239,0.013663986,0.78201973,0.00006648369,0.07934726],"study_design_scores_gemma":[0.0003722765,0.00008907418,0.0017914738,0.00008724197,0.0000053174986,0.000006084674,0.00011697502,0.98971486,0.0064355386,0.00040542785,0.0008114965,0.00016421106],"about_ca_topic_score_codex":0.000029828963,"about_ca_topic_score_gemma":0.000001943604,"teacher_disagreement_score":0.8850325,"about_ca_system_score_codex":0.000021369724,"about_ca_system_score_gemma":0.000029710245,"threshold_uncertainty_score":0.51014876},"labels":[],"label_agreement":null},{"id":"W2991129629","doi":"10.1109/smc.2019.8914605","title":"Tuning Controls for Interaction with Unstructured Environments based on Human Personality Types","year":2019,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Calgary","funders":"","keywords":"Personality psychology; Computer science; Fuzzy logic; Artificial intelligence; Robot; Robotics; Process (computing); Personality; Fuzzy control system; Human–computer interaction; Control (management); Machine learning; Psychology","score_opus":0.03668507913018632,"score_gpt":0.3151816299205219,"score_spread":0.2784965507903356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991129629","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.088254064,0.0000011249412,0.90646964,0.00010867415,0.00016807718,0.00032826705,0.0000012694953,0.000046677167,0.004622217],"genre_scores_gemma":[0.6742563,5.8565092e-8,0.32513046,0.00026112175,0.0000140716365,0.00001615178,0.000004203726,0.000004020668,0.0003135602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934393,0.000057515044,0.000097935685,0.00023362378,0.00015552796,0.000111482106],"domain_scores_gemma":[0.9994641,0.000082309285,0.00008116472,0.00032902238,0.000015665455,0.00002775131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025339416,0.00007834816,0.0000876949,0.000041303378,0.000067592366,0.000054663324,0.00022609139,0.000031974207,0.00006671651],"category_scores_gemma":[0.000019845093,0.000058677644,0.00002774299,0.00005378351,0.000017360455,0.00029575283,0.000017156892,0.00006553993,0.000025703306],"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.0008562563,0.0002839181,0.016133161,0.00010772808,0.00010424328,0.0000014774747,0.0011645627,0.017673675,0.23287871,0.6624698,0.00021624267,0.06811021],"study_design_scores_gemma":[0.0012122757,0.000613415,0.020603457,0.000024393315,0.0000069610937,0.0000018714769,0.000038975853,0.9459411,0.026430776,0.00075415627,0.00420544,0.00016717396],"about_ca_topic_score_codex":0.00001072402,"about_ca_topic_score_gemma":0.0000019806266,"teacher_disagreement_score":0.9282674,"about_ca_system_score_codex":0.00006339755,"about_ca_system_score_gemma":0.000011260619,"threshold_uncertainty_score":0.23928049},"labels":[],"label_agreement":null},{"id":"W2991627118","doi":"10.1109/models-c.2019.00082","title":"Optimizing Hierarchical, Concurrent State Machines in Umple for Model Checking","year":2019,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 Ottawa; University of the Fraser Valley","funders":"","keywords":"Model checking; Computer science; State (computer science); State space; Reduction (mathematics); Finite-state machine; Semantics (computer science); Encoding (memory); Resource (disambiguation); Distributed computing; Theoretical computer science; Abstract state machines; Software; Programming language; Artificial intelligence; Mathematics","score_opus":0.04895541616293567,"score_gpt":0.3358860619517525,"score_spread":0.2869306457888169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991627118","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.045951728,0.000027557342,0.95115304,0.00015711266,0.00029013839,0.00034832,0.0000021668332,0.00009074975,0.00197919],"genre_scores_gemma":[0.20671982,0.0000058701585,0.79274595,0.00013742824,0.0000092409555,0.00003492053,0.0000019030098,0.0000064289934,0.00033844964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990664,0.00004095107,0.00022936278,0.0002923653,0.00013023744,0.00024066701],"domain_scores_gemma":[0.99942493,0.00009719307,0.000060614577,0.00033592182,0.000039619663,0.00004173671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059632247,0.00009019797,0.00012952238,0.00009712656,0.000038668906,0.00008659933,0.000520573,0.00002908121,0.0000075568555],"category_scores_gemma":[0.000055397122,0.000078957775,0.00003916649,0.00017118089,0.000016449203,0.00049442454,0.0001616441,0.00010869873,0.000015902375],"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.000012309464,0.000055213204,0.0005637511,0.00006335492,0.0000050829835,3.4532152e-7,0.0019027144,0.18364789,0.004013848,0.6325669,0.00007108442,0.17709748],"study_design_scores_gemma":[0.0003220251,0.000034014673,0.00018454192,0.000014186794,6.287808e-7,8.090206e-7,0.0000074108134,0.98317075,0.0031870722,0.012557951,0.00040851333,0.000112083115],"about_ca_topic_score_codex":0.000017870705,"about_ca_topic_score_gemma":0.000005917142,"teacher_disagreement_score":0.7995229,"about_ca_system_score_codex":0.00004315596,"about_ca_system_score_gemma":0.00004216503,"threshold_uncertainty_score":0.32198048},"labels":[],"label_agreement":null},{"id":"W2995736486","doi":"10.3233/sat190119","title":"MaxSAT Evaluation 2018: New Developments and Detailed Results","year":2019,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":20,"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":"Carnegie Mellon Portugal; National Science Foundation","keywords":"Maximum satisfiability problem; Satisfiability; Boolean satisfiability problem; Series (stratigraphy); Computer science; Radiomics; Theoretical computer science; Artificial intelligence; Algorithm; Boolean function","score_opus":0.06352342221819057,"score_gpt":0.3266440326746796,"score_spread":0.26312061045648905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995736486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46621713,0.000056538465,0.53265816,0.00024204675,0.00029770637,0.00025315033,5.539139e-7,0.000033039465,0.00024168367],"genre_scores_gemma":[0.6526798,0.000030062025,0.34708247,0.00011724425,0.00004305145,0.000003602767,0.0000035142878,0.000006119572,0.00003416058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977236,0.00039362724,0.00060401816,0.00044753123,0.0006389829,0.0001922781],"domain_scores_gemma":[0.99886423,0.00014488756,0.0002814228,0.00026938858,0.00026967618,0.00017037068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037297574,0.00016017671,0.00019281975,0.00016624725,0.00020943698,0.00035759286,0.00019050704,0.00008344475,0.0000038365943],"category_scores_gemma":[0.00033356415,0.0001461521,0.00003542812,0.00017324484,0.00002080092,0.00084210926,0.00008235444,0.0002726061,0.000024424835],"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.00010031597,0.000028492455,0.0023964283,0.000017868653,0.000014562329,6.2739656e-7,0.0010644115,0.21120584,0.00012588558,0.0027349654,0.00006339881,0.7822472],"study_design_scores_gemma":[0.001172027,0.00017964032,0.02420705,0.000075156546,0.000010975844,0.000038462033,0.000050139577,0.9368488,0.00006048382,0.03714147,0.000057155827,0.00015862193],"about_ca_topic_score_codex":0.000012875316,"about_ca_topic_score_gemma":0.0000027865644,"teacher_disagreement_score":0.7820886,"about_ca_system_score_codex":0.00016984346,"about_ca_system_score_gemma":0.00018734139,"threshold_uncertainty_score":0.59599096},"labels":[],"label_agreement":null},{"id":"W2995907685","doi":"10.1016/j.entcs.2019.09.004","title":"Bisimulation for Feller-Dynkin Processes","year":2019,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bisimulation; Discrete time and continuous time; Equivalence (formal languages); Generalization; Mathematics; Markov chain; Markov process; Time reversibility; Pure mathematics; Algebra over a field; Discrete mathematics; Markov property; Markov model; Mathematical analysis","score_opus":0.010950336446238763,"score_gpt":0.29327613781849843,"score_spread":0.28232580137225965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995907685","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.074527115,0.000067556604,0.92331576,0.00045786973,0.000492984,0.0006018376,5.0389946e-7,0.00012955902,0.00040679448],"genre_scores_gemma":[0.61711514,0.000005321415,0.38263997,0.00015763432,0.000045766134,0.00002504972,8.124537e-7,0.00000662525,0.0000036673275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972993,0.00010049774,0.00033351802,0.0008426598,0.00052431563,0.00089972443],"domain_scores_gemma":[0.99781823,0.0009391311,0.000098726916,0.00078735745,0.0002677065,0.0000888477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002899177,0.0001740628,0.0002006949,0.0003006209,0.00017367571,0.00029053708,0.0022832947,0.0000727531,0.000019139163],"category_scores_gemma":[0.0007648656,0.00015522228,0.000046952504,0.0021823023,0.0005894932,0.0011244228,0.00039252534,0.00023614877,0.000058093436],"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.000015310161,0.000042524927,0.00030917278,0.000028884657,0.0000015590832,2.7456886e-7,0.00020202123,0.0034053673,0.0006579298,0.93702936,0.0000012589275,0.058306314],"study_design_scores_gemma":[0.00025370653,0.00031235116,0.0004908325,0.000023442255,0.0000011340014,0.000005356267,9.942289e-7,0.6676727,0.018861167,0.3119974,0.00022098619,0.00015991775],"about_ca_topic_score_codex":0.0000028740624,"about_ca_topic_score_gemma":0.0000026887017,"teacher_disagreement_score":0.66426736,"about_ca_system_score_codex":0.00025332524,"about_ca_system_score_gemma":0.00052970235,"threshold_uncertainty_score":0.6329781},"labels":[],"label_agreement":null},{"id":"W2997435475","doi":"10.1007/s10270-019-00763-8","title":"Transitive-closure-based model checking (TCMC) in Alloy","year":2020,"lang":"en","type":"article","venue":"Software & Systems Modeling","topic":"Formal Methods in Verification","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":"University of Waterloo","funders":"","keywords":"Transitive closure; Computer science; Model checking; Closure (psychology); Bounded function; Deadlock; State space; Transitive relation; State (computer science); Set (abstract data type); Property (philosophy); Representation (politics); Theoretical computer science; Programming language; Discrete mathematics; Mathematics","score_opus":0.08301324290759049,"score_gpt":0.2764508165908048,"score_spread":0.1934375736832143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997435475","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.029677544,0.00030540815,0.9682338,0.00030051067,0.00030263004,0.00041343144,0.0000056221506,0.000643953,0.00011708585],"genre_scores_gemma":[0.60040426,0.0000026754888,0.39916095,0.00030135232,0.00005588508,0.00004503677,0.0000035136927,0.000021508133,0.000004826165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975073,0.00023840128,0.0006507522,0.0006812972,0.00049050414,0.000431778],"domain_scores_gemma":[0.9989413,0.000074401425,0.00013995961,0.0005335681,0.0001446232,0.00016613433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010726437,0.0002443623,0.00036424317,0.00014180322,0.00011457238,0.00017944806,0.0008972664,0.00015019215,0.0000011195025],"category_scores_gemma":[0.00023910949,0.00025862735,0.00011126829,0.0005909077,0.000021699523,0.00076217303,0.00008502177,0.00033182316,0.000020358202],"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.000014011958,0.000018980907,0.0005174024,0.0001463309,0.000005889644,0.00000813635,0.0023348,0.9897831,0.0009197668,0.0048500746,0.0000069644816,0.0013945221],"study_design_scores_gemma":[0.00042766272,0.000034264234,0.000020047575,0.00019730629,0.0000056183294,0.0000035351513,0.00008797457,0.9982692,0.00032368908,0.0003109602,0.00003187247,0.00028789282],"about_ca_topic_score_codex":0.000109784174,"about_ca_topic_score_gemma":0.0000067092965,"teacher_disagreement_score":0.5707267,"about_ca_system_score_codex":0.00014073715,"about_ca_system_score_gemma":0.0002083131,"threshold_uncertainty_score":0.9999866},"labels":[],"label_agreement":null},{"id":"W2998256767","doi":"10.48550/arxiv.1912.13430","title":"Towards Neural-Guided Program Synthesis for Linear Temporal Logic Specifications","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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":"","keywords":"Programming language; Computer science; Temporal logic; Linear temporal logic","score_opus":0.3233193035189145,"score_gpt":0.28548590475949737,"score_spread":0.03783339875941716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998256767","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.015238911,0.00003098363,0.97720444,0.00032384435,0.0012445148,0.0019569676,0.000049014692,0.00071630994,0.0032350083],"genre_scores_gemma":[0.5400828,0.00004064734,0.4587751,0.000054400305,0.00010923831,0.000033631568,0.000031863183,0.000022258218,0.0008500334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738324,0.00024325491,0.00042336874,0.0013808956,0.00013289772,0.00043634753],"domain_scores_gemma":[0.99633133,0.0002093936,0.00053058425,0.0023595144,0.0004135198,0.00015565254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072072586,0.00037292877,0.00043817802,0.00031547848,0.00019322392,0.00017695231,0.003024252,0.00040063288,0.000023322707],"category_scores_gemma":[0.00037803836,0.00041107094,0.00037473795,0.0006944079,0.00013858973,0.0004889312,0.0012067406,0.00047415012,0.0001332497],"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.000051044997,0.00041734363,0.0021432892,0.00040910256,0.000110285575,0.000027545595,0.00015970213,0.16821027,0.000052411884,0.8056787,0.0011157894,0.021624472],"study_design_scores_gemma":[0.00021744722,0.00009837153,0.001400418,0.000043572163,0.00007476861,0.000004492203,0.000030799252,0.96852946,0.00064223225,0.023168888,0.0052993447,0.00049021264],"about_ca_topic_score_codex":0.00006384489,"about_ca_topic_score_gemma":0.0000048761,"teacher_disagreement_score":0.8003192,"about_ca_system_score_codex":0.00027635528,"about_ca_system_score_gemma":0.000257447,"threshold_uncertainty_score":0.9998341},"labels":[],"label_agreement":null},{"id":"W2999398032","doi":"10.1504/ijccbs.2019.10026129","title":"Iterative integration of TTEthernet network flows","year":2019,"lang":"en","type":"article","venue":"International Journal of Critical Computer-Based Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Avionics; Computer science; Ethernet; Control reconfiguration; System requirements specification; Distributed computing; Real-time computing; Computer network; Embedded system; Engineering; Software engineering","score_opus":0.027521719459134304,"score_gpt":0.3296904030206428,"score_spread":0.3021686835615085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999398032","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.043510843,0.00014107,0.9453597,0.0005766269,0.009905977,0.00015121778,0.000006598267,0.000026718351,0.00032121514],"genre_scores_gemma":[0.662653,0.0000014854874,0.3364936,0.00014643163,0.0006815793,0.0000026414414,0.0000025694815,0.000007362143,0.00001132874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694014,0.00053556514,0.0010819365,0.00021607446,0.0010279712,0.00019831513],"domain_scores_gemma":[0.99601877,0.0008354261,0.00058763486,0.000328645,0.002124005,0.00010550189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015439971,0.00016027612,0.00037607143,0.00026195514,0.000029637667,0.0002582352,0.0015070959,0.000094654315,0.000024749384],"category_scores_gemma":[0.00026286682,0.00013472763,0.00018924661,0.00023956616,0.000071963215,0.0008711921,0.00010461404,0.00029300703,0.00002926964],"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.0002418106,0.0005329962,0.0013332173,0.00016404843,0.00020327735,0.00010672488,0.0011141961,0.16413133,0.008688427,0.798268,0.0010076534,0.024208318],"study_design_scores_gemma":[0.0006198131,0.0006963001,0.0009510724,0.0006001849,0.000010680863,0.00019210995,0.000033124077,0.98896605,0.003769155,0.0029015816,0.0011056913,0.00015421811],"about_ca_topic_score_codex":0.000016021859,"about_ca_topic_score_gemma":0.000001195476,"teacher_disagreement_score":0.82483476,"about_ca_system_score_codex":0.00013613977,"about_ca_system_score_gemma":0.00015294903,"threshold_uncertainty_score":0.5494033},"labels":[],"label_agreement":null},{"id":"W3000360140","doi":"10.4230/lipics.concur.2017.4","title":"A new notion of compositionality for concurrent program proofs","year":2017,"lang":"en","type":"article","venue":"International Conference on Concurrency Theory","topic":"Formal Methods in Verification","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":"","keywords":"Principle of compositionality; Mathematical proof; Programming language; Computer science; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.13515281614284286,"score_gpt":0.4384656416520773,"score_spread":0.30331282550923444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000360140","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.0013186163,0.00003249005,0.9597237,0.0012145761,0.0035459911,0.0007809756,0.000080910635,0.000113168884,0.03318958],"genre_scores_gemma":[0.834237,0.000014592209,0.16490676,0.000057372217,0.00016708641,0.00018261968,0.0000443397,0.0000074346817,0.0003828022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983629,0.00013828592,0.00042787142,0.00042139695,0.0004565036,0.00019305204],"domain_scores_gemma":[0.9975279,0.00017994302,0.0006711587,0.0007541859,0.00077160663,0.00009523816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009433261,0.00017392432,0.00020852561,0.00010547666,0.0002136342,0.000335116,0.0023313744,0.000078366305,0.00013437288],"category_scores_gemma":[0.00063119526,0.00016559672,0.00013321493,0.000048584894,0.00020167841,0.00083318906,0.0002055902,0.00015682037,0.000028643703],"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.000040261395,0.000111080204,0.00006303747,0.000014159608,0.00002174192,2.6503204e-7,0.00008961155,0.0000027508759,0.00057093886,0.60785145,0.0001182382,0.39111647],"study_design_scores_gemma":[0.002048767,0.0010053955,0.013635648,0.00039487347,0.000025263302,0.000009621977,0.000031164356,0.13171788,0.02596154,0.81137097,0.013300122,0.0004987332],"about_ca_topic_score_codex":0.000015266236,"about_ca_topic_score_gemma":0.000003283001,"teacher_disagreement_score":0.8329184,"about_ca_system_score_codex":0.00007121784,"about_ca_system_score_gemma":0.00028449536,"threshold_uncertainty_score":0.6752838},"labels":[],"label_agreement":null},{"id":"W3003857160","doi":"10.1007/s00165-019-00503-1","title":"Formal reliability and failure analysis of ethernet based communication networks in a smart grid substation","year":2020,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Smart grid; Ethernet; Reliability block diagram; Computer science; Telecommunications network; Reliability (semiconductor); Reliability engineering; Embedded system; Fault tree analysis; Transformer; Automation; Distributed computing; Computer network; Engineering; Electrical engineering; Voltage","score_opus":0.018513417091901543,"score_gpt":0.26544738332224643,"score_spread":0.2469339662303449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003857160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4115673,0.00004267595,0.587757,0.00020596714,0.000028264012,0.00012899323,0.0000021138133,0.000035309073,0.00023236722],"genre_scores_gemma":[0.69523585,0.000003888369,0.3046519,0.00007099281,0.000012273357,0.0000019328338,0.000018977707,0.0000039995516,1.7389758e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983007,0.00026845117,0.0006725523,0.0002528225,0.00025448177,0.00025103014],"domain_scores_gemma":[0.9984432,0.00031764607,0.00051818654,0.00047956852,0.00017510906,0.000066319495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017570779,0.00012341762,0.00035598394,0.00022974335,0.00007957244,0.000037101603,0.0005948538,0.00008145561,0.0000035467374],"category_scores_gemma":[0.0002401024,0.00012608731,0.00008866713,0.0017869105,0.00008603316,0.0010088388,0.00030562122,0.00022812163,4.5202395e-7],"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.000093198854,0.0001020108,0.041651838,0.00018222003,0.00008784267,9.812705e-7,0.006742571,0.824014,0.00032997932,0.096401535,0.0000126092145,0.030381216],"study_design_scores_gemma":[0.0003003282,0.00010714839,0.1666412,0.00003193227,0.000033801807,5.2781473e-7,0.00010517705,0.83093435,0.0013856356,0.00034917644,0.000017553612,0.00009314569],"about_ca_topic_score_codex":0.00011431408,"about_ca_topic_score_gemma":0.00007915108,"teacher_disagreement_score":0.28366858,"about_ca_system_score_codex":0.00003698719,"about_ca_system_score_gemma":0.000043864944,"threshold_uncertainty_score":0.5141691},"labels":[],"label_agreement":null},{"id":"W3005043524","doi":"10.1145/996893.996860","title":"Symbolic pointer analysis revisited","year":2004,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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":"","keywords":"Computer science; Pointer (user interface); Pointer analysis; Compiler; Call graph; Theoretical computer science; Binary decision diagram; Programming language; Symbolic execution; Optimizing compiler; Static analysis; Algorithm; Software; Artificial intelligence","score_opus":0.02748096730214771,"score_gpt":0.3031241112063783,"score_spread":0.27564314390423056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005043524","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.1783404,0.00019573043,0.81473386,0.0014511633,0.0002923093,0.00014472728,0.000006389581,0.00038757967,0.004447844],"genre_scores_gemma":[0.5727628,0.000006709938,0.42669505,0.0004214739,0.000044526365,0.0000044298517,0.000008443379,0.0000046521127,0.000051902345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99885696,0.00008590986,0.0002394614,0.0003499129,0.00024202764,0.00022570998],"domain_scores_gemma":[0.99822944,0.00011952828,0.00013817806,0.0013688647,0.00006671145,0.000077293065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004317612,0.00011884693,0.00019619706,0.00028333184,0.000085338244,0.00018259857,0.0017008013,0.000056073277,0.000037733433],"category_scores_gemma":[0.00043405258,0.00010430806,0.00010329552,0.0013826042,0.000035423054,0.0006657944,0.00026397387,0.00010909383,0.00028856745],"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.000052074058,0.00033784192,0.025821343,0.00014446487,0.0013530485,0.000094428324,0.009207192,0.0117987245,0.0038222177,0.8875311,0.0011599254,0.058677655],"study_design_scores_gemma":[0.0037212088,0.00075171667,0.63551986,0.00028551865,0.0018171662,0.00008930137,0.00040425608,0.15275322,0.07563352,0.09922551,0.027001722,0.0027969903],"about_ca_topic_score_codex":0.00006276866,"about_ca_topic_score_gemma":0.00001511121,"teacher_disagreement_score":0.7883056,"about_ca_system_score_codex":0.000043600583,"about_ca_system_score_gemma":0.000023409671,"threshold_uncertainty_score":0.42535594},"labels":[],"label_agreement":null},{"id":"W3006339109","doi":"","title":"A New Approach to Upward-Closed Set Backward Reachability Analysis.","year":2004,"lang":"en","type":"article","venue":"Infinity Journal","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 British Columbia","funders":"","keywords":"Reachability; Parameterized complexity; Petri net; Binary decision diagram; Intersection (aeronautics); Model checking; Fixed point; Set (abstract data type); Computation; Class (philosophy); Computer science; Theoretical computer science; Convergence (economics); Algorithm; Mathematics; State (computer science); Programming language","score_opus":0.0704019921991426,"score_gpt":0.3305189717620785,"score_spread":0.2601169795629359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006339109","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.026886405,0.000016184806,0.9576966,0.0010569356,0.00034940554,0.00014728836,0.00000278791,0.00010146317,0.013742927],"genre_scores_gemma":[0.10898552,0.000005117488,0.89021224,0.00046468797,0.00017630172,0.0000042886004,0.0000021712012,0.0000069422513,0.00014276317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99776053,0.00033393112,0.00053350336,0.00040429056,0.00059040246,0.0003773231],"domain_scores_gemma":[0.9979431,0.000068470494,0.00023422833,0.0010029338,0.00020750343,0.00054374477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030097761,0.0001736317,0.00032140544,0.00042376394,0.00024111151,0.00039522766,0.0014799914,0.00010417688,0.000048407295],"category_scores_gemma":[0.00066157343,0.00015786977,0.00026296132,0.0020647377,0.000039452985,0.0007776289,0.00022758405,0.0005746518,0.00021200154],"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.00021618845,0.001100748,0.012651999,0.00006454796,0.0013113234,0.000056498713,0.027903127,0.1830676,0.0015707307,0.3882286,0.008702312,0.37512633],"study_design_scores_gemma":[0.005832961,0.0011704066,0.471309,0.000108816006,0.000776239,0.0019695563,0.00065570755,0.073924884,0.009743286,0.3285741,0.103255086,0.0026799582],"about_ca_topic_score_codex":0.0001849383,"about_ca_topic_score_gemma":0.000012969488,"teacher_disagreement_score":0.45865703,"about_ca_system_score_codex":0.00029616253,"about_ca_system_score_gemma":0.0004359755,"threshold_uncertainty_score":0.6437742},"labels":[],"label_agreement":null},{"id":"W3015157678","doi":"10.1145/3253000","title":"Session details: Model checking","year":2011,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"","keywords":"Session (web analytics); Computer science; Model checking; Programming language; World Wide Web","score_opus":0.14974551986748685,"score_gpt":0.3185373050553063,"score_spread":0.16879178518781945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015157678","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.0049284473,0.000008666878,0.8874641,0.000019795454,0.00012765185,0.000039367136,4.3815433e-8,0.00019076957,0.107221164],"genre_scores_gemma":[0.28288424,0.0000020642933,0.7165249,0.00011706341,0.000006845888,0.000004211976,8.36635e-8,0.0000024809528,0.00045815032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994709,0.00002829434,0.00010622648,0.00016400377,0.00010959756,0.00012101792],"domain_scores_gemma":[0.99947274,0.0000074269738,0.0000382603,0.00040821516,0.00003457013,0.000038818085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032321413,0.000051150168,0.00004771166,0.000040500305,0.000052747368,0.000028356679,0.00052504893,0.000033882905,0.000029956043],"category_scores_gemma":[0.000030625248,0.000040963103,0.00002090665,0.00013648787,0.0000133475605,0.00070695166,0.00014320867,0.00005361277,0.00008485655],"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.0000017520243,0.000024624102,0.00021751242,0.000003937635,0.0000017013813,7.320623e-7,0.0012857587,0.00012855239,0.0026245527,0.9017605,0.00010835662,0.09384201],"study_design_scores_gemma":[0.000037984573,0.000010791891,0.0008669667,0.000004296926,8.0646896e-7,0.0000026399405,0.000013327524,0.9159648,0.062459797,0.020463165,0.0001107115,0.00006475032],"about_ca_topic_score_codex":0.000009292487,"about_ca_topic_score_gemma":7.152156e-7,"teacher_disagreement_score":0.9158362,"about_ca_system_score_codex":0.000015196263,"about_ca_system_score_gemma":0.000020091722,"threshold_uncertainty_score":0.16704269},"labels":[],"label_agreement":null},{"id":"W3019994833","doi":"10.1007/978-3-030-46902-3_1","title":"Formal Verification of Cyber-Physical Systems Using Theorem Proving","year":2020,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","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":"Cyber-physical system; Avionics; Computer science; Aerospace; Automotive industry; Systems engineering; Reliability (semiconductor); Automated theorem proving; Software engineering; Computer security; Engineering","score_opus":0.0750023494951009,"score_gpt":0.32315307202799637,"score_spread":0.24815072253289547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019994833","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.00026357232,0.0001756911,0.9284294,0.00013933676,0.00033599883,0.00057278277,0.00001258521,0.000087769935,0.06998283],"genre_scores_gemma":[0.25840348,0.00036365207,0.7408396,0.00015345274,0.00006985048,0.00002926044,0.000033558765,0.000014451682,0.00009267051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777424,0.00008049876,0.00095533906,0.0003270798,0.0006209223,0.00024192806],"domain_scores_gemma":[0.9960218,0.00017239823,0.00088623556,0.002260502,0.0005513421,0.000107731044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016274432,0.00023945406,0.00036633646,0.00074970245,0.00037063492,0.00045193286,0.0036473356,0.00012901313,9.786532e-7],"category_scores_gemma":[0.00011031462,0.00024163938,0.00006268806,0.0006426997,0.0009385669,0.0113157015,0.002222858,0.0004348349,0.000018174884],"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.0000027908586,0.000012244773,0.000008646234,0.00007256279,0.0000042586316,9.3930915e-8,0.0019455898,0.001169437,0.000068645844,0.9258392,0.000006921607,0.07086962],"study_design_scores_gemma":[0.00014609814,0.000063698346,0.00023955894,0.00020628261,0.000008067818,0.000018155493,0.00003907615,0.9858714,0.0001302369,0.006046086,0.006989596,0.0002417839],"about_ca_topic_score_codex":0.000015835229,"about_ca_topic_score_gemma":5.5736155e-7,"teacher_disagreement_score":0.98470193,"about_ca_system_score_codex":0.0001995265,"about_ca_system_score_gemma":0.00040412147,"threshold_uncertainty_score":0.98537683},"labels":[],"label_agreement":null},{"id":"W3021579240","doi":"10.1016/b978-012369526-0/50013-9","title":"Processor Verification","year":2007,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Formal Methods in Verification","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Functional verification; Computer science; Runtime verification; Correctness; Software verification; High-level verification; Intelligent verification; Formal verification; Verification; Assertion; Computer engineering; Software; Embedded system; Computer architecture; Programming language; Software construction; Software system","score_opus":0.04824886346774474,"score_gpt":0.30209967220958667,"score_spread":0.2538508087418419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021579240","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015102019,0.00042377715,0.08568723,0.0000423015,0.0007318918,0.0004916341,0.0000038667104,0.00031517868,0.9123026],"genre_scores_gemma":[0.000039950366,0.00003614311,0.27417284,0.00026686015,0.0002202174,0.00003383485,0.000009490068,0.00004400151,0.72517663],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978276,0.000031534382,0.0005537489,0.00070646434,0.000560094,0.00032059473],"domain_scores_gemma":[0.99759555,0.00004947504,0.00047651608,0.0014992324,0.00025134717,0.00012785236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009546503,0.00036550485,0.00033229982,0.00027426126,0.00013092061,0.00013368964,0.0014479401,0.00042856485,0.000042804153],"category_scores_gemma":[0.00005452927,0.00036821238,0.00014343896,0.00004171608,0.000115195144,0.00023406993,0.00020913269,0.00049547903,0.00072152406],"study_design_candidate":"not_applicable","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.0000029466296,0.000003385122,2.634178e-7,0.00004288692,0.000011358316,0.000004054724,0.00012805416,2.926575e-7,0.00002648822,0.3285493,0.000037655285,0.6711933],"study_design_scores_gemma":[0.00009420786,0.00004607518,0.00002256636,0.00013517155,0.000019822488,0.000021725467,0.0000013534528,0.00048033166,0.00086024613,0.03753366,0.96037555,0.0004092861],"about_ca_topic_score_codex":1.3622727e-7,"about_ca_topic_score_gemma":0.000001787582,"teacher_disagreement_score":0.9603379,"about_ca_system_score_codex":0.00015483795,"about_ca_system_score_gemma":0.0001638296,"threshold_uncertainty_score":0.999877},"labels":[],"label_agreement":null},{"id":"W3022618186","doi":"10.1007/978-3-030-72013-1_16","title":"MachSMT: A Machine Learning-based Algorithm Selector for SMT Solvers","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"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 Waterloo","funders":"Office of Naval Research; Defense Advanced Research Projects Agency","keywords":"Algorithm; Computer science; Machine learning; Ranking (information retrieval); Artificial intelligence","score_opus":0.022442758596539512,"score_gpt":0.2719503525007648,"score_spread":0.2495075939042253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022618186","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.0000048867314,0.0006761422,0.9950586,0.00047574044,0.002338183,0.00068091817,0.000018861232,0.0002995708,0.0004471082],"genre_scores_gemma":[0.0012008941,0.000031309264,0.99645257,0.0010777229,0.00047400186,0.000047969294,0.000035544792,0.000058822152,0.00062117155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99530464,0.00011381992,0.00062125997,0.0020185031,0.0010660144,0.00087577],"domain_scores_gemma":[0.9963254,0.0009841799,0.00045180588,0.0014477716,0.00057320396,0.00021769006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018666143,0.00064678106,0.0006672369,0.00083258486,0.00044050696,0.00061553804,0.003356664,0.00043709477,0.000031220112],"category_scores_gemma":[0.00047562094,0.0006429026,0.00027073268,0.0009453747,0.00052485784,0.0005335493,0.0007623251,0.0011672963,0.000013388337],"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.000008831851,0.000034134973,0.00001548054,0.00007068493,0.00001341505,0.000032623397,0.0001835547,0.02011464,0.00011341927,0.013000927,0.000023604462,0.9663887],"study_design_scores_gemma":[0.00042779068,0.0003241938,0.0000150641,0.00019563895,0.000013180291,0.000034847424,8.6329344e-8,0.9521627,0.0055848677,0.030252695,0.010296398,0.0006925462],"about_ca_topic_score_codex":0.000021125663,"about_ca_topic_score_gemma":0.000039453935,"teacher_disagreement_score":0.96569616,"about_ca_system_score_codex":0.0005174784,"about_ca_system_score_gemma":0.0011337749,"threshold_uncertainty_score":0.9996022},"labels":[],"label_agreement":null},{"id":"W3023048853","doi":"10.48550/arxiv.2005.13415","title":"CDCL(Crypto) SAT Solvers for Cryptanalysis","year":2020,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Computer science; Boolean satisfiability problem; Cryptanalysis; Theoretical computer science; Hash function; Solver; Cryptography; Signature (topology); Algorithm; Programming language; Mathematics","score_opus":0.15066818759342657,"score_gpt":0.2056643858400523,"score_spread":0.054996198246625744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023048853","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.033624187,0.00001225869,0.96430933,0.00038190046,0.00014795063,0.00016605963,0.0000045960355,0.00021556587,0.0011381533],"genre_scores_gemma":[0.8066242,0.000011521794,0.19264534,0.0004901582,0.00004685312,7.87726e-7,0.0000035564324,0.000007943846,0.00016968185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884933,0.00007505071,0.00016113289,0.0005841403,0.00007181102,0.0002585052],"domain_scores_gemma":[0.99895054,0.00009145278,0.00012541568,0.00053263764,0.00011406025,0.00018587023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024053265,0.00013407109,0.00017559613,0.00010135265,0.00013740106,0.00006154797,0.0011236711,0.00007387043,0.0000334177],"category_scores_gemma":[0.00015578001,0.00015379905,0.00018002634,0.0011359425,0.00006214767,0.0007442738,0.0002006312,0.0001065508,0.00015087267],"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.000058062535,0.000035943147,0.0028085767,0.00003263789,0.00007156411,0.000023255738,0.0005594896,0.028214546,0.00086036336,0.9636926,0.00073225494,0.0029106727],"study_design_scores_gemma":[0.00044259327,0.00010198982,0.00064499053,0.000003549855,0.000055459084,9.2632195e-7,0.00012378483,0.9810411,0.0014529353,0.008360984,0.007545062,0.00022662233],"about_ca_topic_score_codex":0.0000101856995,"about_ca_topic_score_gemma":0.000005371105,"teacher_disagreement_score":0.9553316,"about_ca_system_score_codex":0.000083917286,"about_ca_system_score_gemma":0.000042902775,"threshold_uncertainty_score":0.62717426},"labels":[],"label_agreement":null},{"id":"W3023134755","doi":"","title":"Hybrid verification integrating HOL theorem proving with MDG model checking","year":2006,"lang":"en","type":"article","venue":"Spectrum Research Repository (Concordia University)","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"HOL; Automated theorem proving; Computer science; Programming language; Model checking; Formal verification; Embedding; Theoretical computer science; Higher-order logic; Algorithm; Artificial intelligence; Description logic","score_opus":0.03215153907610052,"score_gpt":0.27461391215956155,"score_spread":0.24246237308346102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023134755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34693182,0.000017363342,0.5722177,0.00017905307,0.00010808982,0.0003264859,0.0000011303597,0.00024139196,0.079976946],"genre_scores_gemma":[0.917927,0.0000046530186,0.079112545,0.000006679321,0.00013631799,0.000006510906,0.0000040553555,0.000022290611,0.002779923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968561,0.0006029266,0.00028972456,0.00078126334,0.00078857306,0.0006813998],"domain_scores_gemma":[0.9980344,0.00015245855,0.00021349518,0.0010825671,0.00037024915,0.00014681852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015238522,0.0002079982,0.00020331125,0.00070845865,0.0009689075,0.00048437575,0.001603604,0.00008530127,0.0000026407022],"category_scores_gemma":[0.00011425715,0.0002025395,0.00007909458,0.0012970206,0.00038019277,0.0018581729,0.00037633136,0.0007298476,0.00001436339],"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.000114204384,0.00010142372,0.015735166,0.000047053014,0.000022677033,0.00022362723,0.0003092816,0.0030108306,0.0406327,0.9353747,0.00010996294,0.004318392],"study_design_scores_gemma":[0.00054242276,0.0003179349,0.0143744815,0.000088910434,0.00001515708,0.00010559825,0.000397714,0.72613215,0.2461195,0.009641719,0.0017956872,0.0004687034],"about_ca_topic_score_codex":0.0028458722,"about_ca_topic_score_gemma":0.00033494376,"teacher_disagreement_score":0.925733,"about_ca_system_score_codex":0.0008018003,"about_ca_system_score_gemma":0.0005463355,"threshold_uncertainty_score":0.8259321},"labels":[],"label_agreement":null},{"id":"W3024074289","doi":"10.1145/373243.360221","title":"What packets may come","year":2001,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Protocol (science); Specification language; Construct (python library); Network packet; Point (geometry); Programming language; Theoretical computer science; Computer network","score_opus":0.060322502143974284,"score_gpt":0.33191332472271057,"score_spread":0.2715908225787363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024074289","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69593406,0.0011136859,0.27115983,0.009102376,0.0070353895,0.0004251991,0.0000035967937,0.00089996407,0.01432589],"genre_scores_gemma":[0.64940864,0.00016927398,0.34901416,0.0007779903,0.00012531737,0.000009797074,0.00000453118,0.000008757797,0.0004815],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988347,0.00011877048,0.00019242559,0.0003078534,0.00027175056,0.00027446536],"domain_scores_gemma":[0.99822176,0.00029534753,0.00011517861,0.001227919,0.000051908726,0.00008788468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005029761,0.00011980946,0.00012587241,0.000084606225,0.000109459164,0.00048715615,0.0019049454,0.00006577739,0.00005437511],"category_scores_gemma":[0.00033598163,0.00010703447,0.00003536276,0.000338558,0.000050934923,0.0026432015,0.00032155772,0.00011782809,0.00055052695],"study_design_candidate":"design_other","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.000049594975,0.00021786238,0.029084273,0.00007667237,0.000056680386,0.00016384757,0.005079877,0.0003092515,0.0023869162,0.2961439,0.0046528005,0.66177833],"study_design_scores_gemma":[0.0018432877,0.0008453596,0.28123182,0.0003770349,0.00006792002,0.00041768193,0.0015691097,0.1295393,0.03450359,0.0760812,0.47119653,0.0023271586],"about_ca_topic_score_codex":0.000014336181,"about_ca_topic_score_gemma":0.0000112748985,"teacher_disagreement_score":0.6594512,"about_ca_system_score_codex":0.00002530518,"about_ca_system_score_gemma":0.00001977068,"threshold_uncertainty_score":0.70760936},"labels":[],"label_agreement":null},{"id":"W3027230419","doi":"10.1007/978-3-030-48077-6_28","title":"An Event-B Model of an Automotive Adaptive Exterior Light System","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Visibility; Context (archaeology); Event (particle physics); Controller (irrigation); Key (lock); Point (geometry); Actuator; Real-time computing; Simulation; Artificial intelligence; Computer security; Mathematics","score_opus":0.03066390509838676,"score_gpt":0.2779981820092014,"score_spread":0.24733427691081464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027230419","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.00020239699,0.00009640171,0.9962146,0.00014478521,0.0011355756,0.0005705259,0.000019642506,0.00032040378,0.001295668],"genre_scores_gemma":[0.29130286,0.0000031739153,0.70816064,0.00028057655,0.00018341687,0.000011372672,0.0000034177724,0.0000309262,0.00002362843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953888,0.00016774442,0.0008122655,0.0019139944,0.0012023114,0.00051489746],"domain_scores_gemma":[0.996082,0.00012786294,0.0006975196,0.0021753681,0.00058969215,0.00032752944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013294205,0.0005766526,0.000747984,0.0006388163,0.00019564552,0.0003041718,0.0052799275,0.00037846863,0.0000035704704],"category_scores_gemma":[0.00008416442,0.0005416869,0.00014200603,0.00073364447,0.00052917906,0.0019343391,0.00093040656,0.0007186169,0.000018263552],"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.00003043817,0.000068793095,0.0000024864514,0.000121175035,0.00001589114,0.000044189946,0.0041944995,0.4191655,0.0045089405,0.22294539,0.0000021273706,0.3489006],"study_design_scores_gemma":[0.00015315964,0.0007520924,0.000026445114,0.00039091764,0.000011159509,0.000035631096,0.000001727174,0.94989556,0.01827038,0.02993028,0.000016498532,0.0005161355],"about_ca_topic_score_codex":0.000012702555,"about_ca_topic_score_gemma":0.000011861867,"teacher_disagreement_score":0.53073007,"about_ca_system_score_codex":0.00046406494,"about_ca_system_score_gemma":0.00078293774,"threshold_uncertainty_score":0.99970347},"labels":[],"label_agreement":null},{"id":"W3028344048","doi":"10.1007/978-3-030-48077-6_29","title":"Modeling of a Speed Control System Using Event-B","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Event (particle physics); Set (abstract data type); Controller (irrigation); Point (geometry); Key (lock); State (computer science); Speed limit; Position (finance); Limit (mathematics); Control (management); Electronic speed control; Real-time computing; Algorithm; Artificial intelligence; Programming language; Computer security; Mathematics","score_opus":0.043906783752162455,"score_gpt":0.28515550324706407,"score_spread":0.24124871949490162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028344048","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.00012920702,0.00025356794,0.9964481,0.00010737466,0.0015587977,0.000469788,0.000006022753,0.00015193697,0.00087519625],"genre_scores_gemma":[0.4284636,0.0000025824752,0.5711719,0.00016673977,0.00017068065,0.0000013116019,6.725006e-7,0.000017474435,0.0000050730587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638855,0.00008447482,0.00085015944,0.0011927427,0.0010452349,0.0004388553],"domain_scores_gemma":[0.9975718,0.00017893047,0.00047476965,0.0012620469,0.0003590004,0.00015345404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013710232,0.00041685867,0.0007069652,0.00058256247,0.00014527039,0.00021287308,0.0031491816,0.00026971428,0.0000025335892],"category_scores_gemma":[0.00015039553,0.00040102322,0.00016440853,0.00065453036,0.0003231921,0.0006025177,0.0007526068,0.00059217424,0.0000120863215],"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.000008849481,0.0000083727655,0.00000782366,0.0001353677,0.000011330588,0.000020801834,0.00033359602,0.87738025,0.0010553993,0.075174056,3.3351898e-7,0.04586382],"study_design_scores_gemma":[0.0002562897,0.0000826893,0.0000034935806,0.000623921,0.000014224566,0.000057245783,3.7628544e-7,0.9835215,0.0015177029,0.01355053,0.000013247556,0.00035876897],"about_ca_topic_score_codex":0.000031791587,"about_ca_topic_score_gemma":0.0000034851396,"teacher_disagreement_score":0.42833441,"about_ca_system_score_codex":0.00042950953,"about_ca_system_score_gemma":0.00057643524,"threshold_uncertainty_score":0.9998442},"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":"W3030250248","doi":"10.1007/s10009-020-00563-2","title":"An efficient statistical model checker for nondeterminism and rare events","year":2020,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":39,"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 Waterloo","funders":"Exploratory Research for Advanced Technology; Agencia Nacional de Promoción Científica y Tecnológica; RWTH Aachen University; Singapore University of Technology and Design; Westfälische Wilhelms-Universität Münster; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; University of Twente","keywords":"Nondeterministic algorithm; Computer science; Rotation formalisms in three dimensions; Model checking; Modular design; Theoretical computer science; Statistical model; Rare events; Programming language; Parallel computing; Distributed computing; Algorithm; Artificial intelligence","score_opus":0.05361837148655482,"score_gpt":0.34287862601652463,"score_spread":0.28926025452996984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030250248","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.04705151,0.000019406605,0.948691,0.0029477833,0.00043795674,0.00039152926,0.00022085557,0.0002315878,0.00000837539],"genre_scores_gemma":[0.33459488,0.000009755969,0.664122,0.0010794753,0.00007297528,0.00008382089,0.000014381091,0.000016033313,0.000006715864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985801,0.000030872892,0.00038765467,0.0004030642,0.00034479026,0.00025354614],"domain_scores_gemma":[0.9990935,0.00012142021,0.00006478828,0.00020697697,0.00036181213,0.00015154755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003124771,0.0001707643,0.00019702983,0.00020562152,0.00014506414,0.00018072804,0.0011976049,0.00018959935,0.0000066055927],"category_scores_gemma":[0.0005981322,0.00015612681,0.00008859325,0.000108818276,0.00008399936,0.00051571016,0.000048834452,0.0003078207,0.000005069575],"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.00047491497,0.00022467536,0.00015565123,0.00002690631,0.00010341784,0.000022345097,0.0005406434,0.006799439,0.0014291719,0.74284333,0.00017596927,0.24720353],"study_design_scores_gemma":[0.0018017024,0.0011600248,0.00030648467,0.000034087283,0.000020092528,0.00015579938,0.000029663943,0.9580754,0.008026085,0.027762236,0.0023820451,0.00024635007],"about_ca_topic_score_codex":1.4119438e-7,"about_ca_topic_score_gemma":1.7397801e-7,"teacher_disagreement_score":0.951276,"about_ca_system_score_codex":0.00006694831,"about_ca_system_score_gemma":0.00008120617,"threshold_uncertainty_score":0.63666666},"labels":[],"label_agreement":null},{"id":"W3038491760","doi":"10.1007/s10270-020-00806-5","title":"Mixed-semantics composition of statecharts for the component-based design of reactive systems","year":2020,"lang":"en","type":"article","venue":"Software & Systems Modeling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Innovációs és Technológiai Minisztérium; Budapesti Műszaki és Gazdaságtudományi Egyetem","keywords":"Computer science; Programming language; Composition (language); Component (thermodynamics); Semantics (computer science); Formal semantics (linguistics); Code generation; Formal methods; Formal verification; Operational semantics; Model checking","score_opus":0.13886652548896844,"score_gpt":0.2893922879197075,"score_spread":0.15052576243073906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038491760","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.005640207,0.0005861661,0.9910969,0.000103935985,0.00081254286,0.0015393877,0.00004406125,0.00017427925,0.0000025189822],"genre_scores_gemma":[0.6317233,0.0000046767664,0.36810476,0.000018198461,0.00004040012,0.00008486029,0.000008618386,0.000014347924,8.276605e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788743,0.00037182108,0.0007621732,0.000322917,0.00044067844,0.00021499241],"domain_scores_gemma":[0.99740565,0.00078248663,0.00061967986,0.0005566015,0.00056991057,0.00006565335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001380191,0.00016693222,0.000397368,0.0000779809,0.00014081603,0.00007292,0.0007289946,0.00008585154,1.4819103e-7],"category_scores_gemma":[0.00019683658,0.00013481022,0.000098913944,0.00027978944,0.000048185513,0.00029161293,0.00007622135,0.00011704417,0.0000016631889],"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.000062083775,0.00003058697,0.000023095294,0.00073129626,0.000038327842,5.1152324e-7,0.00083915977,0.97229224,0.013277948,0.012040277,0.000033517135,0.0006309697],"study_design_scores_gemma":[0.00031923005,0.00016290837,0.0000040672444,0.00033595148,0.000034307704,0.0000036746678,0.0004017577,0.98619694,0.012262472,0.00012154534,0.000025996942,0.00013114377],"about_ca_topic_score_codex":0.00013779501,"about_ca_topic_score_gemma":1.9084777e-7,"teacher_disagreement_score":0.6260831,"about_ca_system_score_codex":0.000064131884,"about_ca_system_score_gemma":0.0001033523,"threshold_uncertainty_score":0.54974014},"labels":[],"label_agreement":null},{"id":"W3038610974","doi":"10.1007/978-3-030-51825-7_17","title":"Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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":"Computer science; Theoretical computer science","score_opus":0.09338436767244732,"score_gpt":0.2992194355844736,"score_spread":0.2058350679120263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038610974","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.00009104095,0.00012530174,0.9901537,0.0009127378,0.0011403935,0.0004024983,0.0000054369243,0.00009697234,0.0070719267],"genre_scores_gemma":[0.28994867,0.000023689796,0.70943695,0.000470492,0.00008050465,0.0000037546454,0.000003180092,0.00002086781,0.000011887025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962283,0.00011178238,0.0007499636,0.0012810219,0.0010872723,0.00054168195],"domain_scores_gemma":[0.9976963,0.00037766414,0.00042352543,0.0012199653,0.00012468213,0.0001579028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016836617,0.00042923994,0.0006485179,0.0010201354,0.00012739995,0.00021676844,0.0032868094,0.00027129863,0.000016071872],"category_scores_gemma":[0.00029457986,0.0004273796,0.00012414661,0.0011448122,0.0018589433,0.0005884893,0.0012903165,0.00085161545,0.000013895005],"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.000015376738,0.00001809234,0.000054008582,0.00010949236,0.0000058244686,0.000047956422,0.0023669307,0.0071036927,0.00014406149,0.929222,0.0000057275006,0.06090684],"study_design_scores_gemma":[0.00018618503,0.00014768742,0.00014213411,0.00037856845,0.000003826201,0.000017002954,0.000001289264,0.3812429,0.001258348,0.61621183,0.0000840233,0.00032618488],"about_ca_topic_score_codex":0.000034522516,"about_ca_topic_score_gemma":0.0000761784,"teacher_disagreement_score":0.37413922,"about_ca_system_score_codex":0.00089907617,"about_ca_system_score_gemma":0.0006360145,"threshold_uncertainty_score":0.9998178},"labels":[],"label_agreement":null},{"id":"W3041597941","doi":"10.24963/ijcai.2020/690","title":"Pure-Past Linear Temporal and Dynamic Logic on Finite Traces","year":2020,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"European Commission","keywords":"TRACE (psycholinguistics); Exponential function; Computer science; Exploit; Expressive power; Linear temporal logic; Temporal logic; Theoretical computer science; Algorithm; Markov decision process; Discrete mathematics; Algebra over a field; Mathematics; Markov process; Pure mathematics; Statistics","score_opus":0.05130476406004403,"score_gpt":0.30588764752452885,"score_spread":0.2545828834644848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041597941","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.021347813,0.000037595266,0.9686542,0.005957611,0.00012612114,0.00010543348,0.0000012863862,0.00021193572,0.0035579638],"genre_scores_gemma":[0.46615255,0.0000075537423,0.532154,0.0015085195,0.00003104339,0.000003278681,0.0000011952687,0.0000032056557,0.00013865609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930567,0.000057970406,0.00012717673,0.000263523,0.0001302296,0.00011541782],"domain_scores_gemma":[0.9995805,0.00006420487,0.000045794077,0.0002119193,0.000020458981,0.000077130644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001784905,0.000081261715,0.000086136795,0.00003219966,0.00005305678,0.00007043023,0.00035182384,0.000041219024,0.000013706336],"category_scores_gemma":[0.00009281707,0.000064206215,0.000017950359,0.00020717697,0.000034826928,0.00027593062,0.00009100713,0.00010442866,0.00009148248],"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.0000776504,0.00017002426,0.0024082428,0.00012991377,0.000026577134,0.000051604282,0.0046678223,0.0027356453,0.0037995854,0.70953995,0.0017520619,0.2746409],"study_design_scores_gemma":[0.00015624172,0.00035562477,0.0021093609,0.0000062235044,0.0000017200773,0.000005362465,0.000048280297,0.9895764,0.0016222255,0.0026748867,0.0033061104,0.00013754996],"about_ca_topic_score_codex":0.0000029841467,"about_ca_topic_score_gemma":0.0000015854203,"teacher_disagreement_score":0.9868408,"about_ca_system_score_codex":0.000008932872,"about_ca_system_score_gemma":0.000011408005,"threshold_uncertainty_score":0.26182535},"labels":[],"label_agreement":null},{"id":"W3045548741","doi":"10.23919/acc45564.2020.9147572","title":"Guaranteed-Safe Approximate Reachability via State Dependency-Based Decomposition","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Reachability; State space; Computer science; Bounded function; Dependency (UML); Model checking; State (computer science); Graph; Corollary; System dynamics; Mathematical optimization; Control theory (sociology); Topology (electrical circuits); Theoretical computer science; Mathematics; Algorithm; Artificial intelligence; Discrete mathematics","score_opus":0.03830172392467697,"score_gpt":0.32308850961054925,"score_spread":0.2847867856858723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045548741","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.0035027314,0.000041623487,0.98689336,0.0012886537,0.0011800611,0.000993032,0.000030303267,0.0010774706,0.004992746],"genre_scores_gemma":[0.18009067,0.0000069138714,0.81890285,0.00066729786,0.000058068563,0.00014394893,0.000064582586,0.000025432504,0.000040261195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959041,0.0006441157,0.0008343684,0.0014933656,0.00068259763,0.00044148212],"domain_scores_gemma":[0.99659574,0.00013948859,0.00049912237,0.0023369733,0.00022970072,0.00019899299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016548379,0.00046289555,0.0005081472,0.00018093798,0.00014335067,0.00034413047,0.0025510846,0.00031353944,0.000048183345],"category_scores_gemma":[0.00015903161,0.00045480413,0.00025488855,0.00036892187,0.00009966376,0.00040314405,0.0016159135,0.0009360015,0.0001807259],"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.0005795104,0.0014279035,0.0016067968,0.00465059,0.00029031816,0.00009565766,0.004105342,0.041569557,0.032157823,0.30068874,0.00095952343,0.61186826],"study_design_scores_gemma":[0.00021731418,0.0000815536,0.000989169,0.00005886782,0.000014274014,0.000006631638,0.00000420208,0.8220872,0.03115412,0.14470927,0.00022773937,0.00044965383],"about_ca_topic_score_codex":0.00024600307,"about_ca_topic_score_gemma":0.000016158809,"teacher_disagreement_score":0.78051764,"about_ca_system_score_codex":0.00026772634,"about_ca_system_score_gemma":0.0003400659,"threshold_uncertainty_score":0.9997904},"labels":[],"label_agreement":null},{"id":"W3046688479","doi":"10.1007/978-3-030-53291-8_7","title":"Global Guidance for Local Generalization in Model Checking","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"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 Waterloo","funders":"Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Locality; Computer science; Model checking; Heuristics; Generalization; Interpolation (computer graphics); Solver; Theoretical computer science; Satisfiability modulo theories; Formal verification; Algorithm; Artificial intelligence; Programming language; Mathematics","score_opus":0.041737171983816504,"score_gpt":0.3030613982134793,"score_spread":0.26132422622966284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046688479","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.000012747051,0.00027047758,0.996185,0.0005669108,0.0010806107,0.0005760176,0.0000098891,0.00013572215,0.0011626482],"genre_scores_gemma":[0.045464747,0.000015419402,0.9524903,0.0017004624,0.00023384082,0.000028591016,0.0000075362213,0.000022321945,0.00003674504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965922,0.00003970806,0.00063955964,0.0014926421,0.00070519064,0.0005306868],"domain_scores_gemma":[0.9982728,0.000118800854,0.00031118258,0.0009403569,0.00023178219,0.00012511751],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011054692,0.00040716177,0.0004323569,0.0003422151,0.00013937491,0.00031351173,0.002968694,0.0003196728,0.0000015502729],"category_scores_gemma":[0.00022290224,0.00042406857,0.000102437545,0.00093877054,0.0003807601,0.0007820179,0.00082398305,0.0003473292,0.000007018913],"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.000005137863,0.000006870828,0.000027602691,0.000032477543,0.0000015399218,0.000004479002,0.00017470603,0.5832113,0.000032680924,0.18333311,0.000009420655,0.23316067],"study_design_scores_gemma":[0.00017749223,0.000056952307,0.000058535647,0.0001574629,0.0000023600796,0.0000091425545,5.8720726e-8,0.7509461,0.00055229175,0.24750887,0.00020024061,0.0003305008],"about_ca_topic_score_codex":0.000014826355,"about_ca_topic_score_gemma":0.0000751094,"teacher_disagreement_score":0.23283017,"about_ca_system_score_codex":0.00083563745,"about_ca_system_score_gemma":0.0006064084,"threshold_uncertainty_score":0.9998211},"labels":[],"label_agreement":null},{"id":"W3048371688","doi":"10.1007/978-3-030-57663-9_1","title":"Teaching Formal Methods: An Experience Report","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Computer science; Formal methods; Formal specification; Software engineering; Formal verification; Notation; Software deployment; Unified Modeling Language; Programming language; B-Method; Software","score_opus":0.052022686145985486,"score_gpt":0.3615113901187566,"score_spread":0.3094887039727711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048371688","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.000051956653,0.00013547933,0.9868846,0.0005091635,0.002823427,0.00043797414,0.0000019036182,0.00045747712,0.008698035],"genre_scores_gemma":[0.009991173,0.000008091546,0.98735964,0.0017373962,0.000624218,0.000023686895,0.000006755644,0.000045252043,0.00020377239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939525,0.0002563866,0.0010354525,0.0025452708,0.0013226003,0.00088779797],"domain_scores_gemma":[0.99531156,0.00040565542,0.0006867147,0.0029464099,0.00024281262,0.000406874],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0048710634,0.00066591863,0.000681039,0.00068236695,0.0005711991,0.00081275287,0.0064399666,0.00040061734,0.000015767091],"category_scores_gemma":[0.00082872866,0.00063410733,0.00016353013,0.00063838117,0.0007741241,0.0039987443,0.00250176,0.0017447777,0.000033848897],"study_design_candidate":"design_other","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.0000050321632,0.00001903594,0.000011693207,0.000025828736,0.0000049422065,0.00022852662,0.003949931,0.0021670999,0.0006760973,0.13162734,0.0000032200203,0.8612813],"study_design_scores_gemma":[0.00013952104,0.00028506466,0.000070814276,0.00015792479,0.0000073294973,0.00082727644,0.0000014595603,0.84128153,0.0065169735,0.14268881,0.007091067,0.0009322336],"about_ca_topic_score_codex":0.000045228717,"about_ca_topic_score_gemma":0.000010977546,"teacher_disagreement_score":0.860349,"about_ca_system_score_codex":0.00036613242,"about_ca_system_score_gemma":0.00057667465,"threshold_uncertainty_score":0.999611},"labels":[],"label_agreement":null},{"id":"W3049098040","doi":"10.1145/605466.605488","title":"Model exploration with temporal logic query checking","year":2002,"lang":"en","type":"article","venue":"ACM SIGSOFT Software Engineering Notes","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Temporal logic; Computer science; Computation tree logic; Model checking; Interval temporal logic; Linear temporal logic; Programming language; Set (abstract data type); Theoretical computer science; Computation","score_opus":0.0878801679724055,"score_gpt":0.26115136230340985,"score_spread":0.17327119433100435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049098040","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.022082185,0.0001855739,0.97582835,0.00024022962,0.00019892892,0.00014732683,0.0000018099183,0.0013052106,0.000010403314],"genre_scores_gemma":[0.47869816,0.000009186114,0.5211084,0.00006661774,0.00003975242,0.00003341772,0.0000038346993,0.000018687593,0.000021950354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867034,0.000026169955,0.00024874258,0.00040575577,0.00031300797,0.00033601216],"domain_scores_gemma":[0.99587125,0.0028484976,0.00010347802,0.0009891747,0.00009688619,0.00009071277],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00027054397,0.00023362086,0.0001833154,0.00014882174,0.0001079126,0.00014584817,0.0009134393,0.00010160773,0.000011034869],"category_scores_gemma":[0.01944624,0.000214999,0.000047548852,0.000429478,0.000025243662,0.0017138522,0.00019581792,0.00022071195,0.00005344235],"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.000017178409,0.00020081294,0.06281815,0.00028069597,0.000062605664,0.000046630947,0.005113733,0.79781157,0.0046766293,0.051247876,0.00046639863,0.07725775],"study_design_scores_gemma":[0.00022582256,0.00010540082,0.0041689724,0.00008818471,0.000008954434,0.000026222944,0.000008453183,0.9878253,0.006168114,0.0006087894,0.00027924584,0.00048655027],"about_ca_topic_score_codex":0.000008288185,"about_ca_topic_score_gemma":0.0000011402012,"teacher_disagreement_score":0.45661598,"about_ca_system_score_codex":0.00007297864,"about_ca_system_score_gemma":0.000019940706,"threshold_uncertainty_score":0.9888134},"labels":[],"label_agreement":null},{"id":"W3083389432","doi":"","title":"Timed diagnostics and test case minimization for real time systems","year":2006,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Formal Methods in Verification","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":"Université de Montréal; Université TÉLUQ","funders":"","keywords":"TRACE (psycholinguistics); Computer science; Automaton; Set (abstract data type); Reliability (semiconductor); Path (computing); Representation (politics); Algorithm; Timed automaton; Minification; Theoretical computer science; Real-time computing","score_opus":0.017126912988849927,"score_gpt":0.248408615772694,"score_spread":0.23128170278384408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083389432","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.014790854,0.0006846352,0.97260064,0.0014016812,0.00043521583,0.001244935,0.00017520884,0.00044074692,0.008226066],"genre_scores_gemma":[0.05333058,0.000565199,0.93956566,0.000029580793,0.00006091647,0.00034484072,0.0006391156,0.000053369862,0.005410725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948924,0.0028265428,0.0006765543,0.0009196538,0.00033639744,0.0003484369],"domain_scores_gemma":[0.98824155,0.0064097056,0.00073818414,0.0022767338,0.0021690903,0.00016474795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005195966,0.00033895645,0.0003903374,0.00021984107,0.0004071134,0.00093594927,0.0012608003,0.0003717096,0.000005807572],"category_scores_gemma":[0.00603478,0.00037792235,0.000108650114,0.00034608523,0.00018039692,0.0003016501,0.0012649427,0.000323055,0.000018345527],"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.000024984469,0.0018255427,0.003816635,0.0019346963,0.00016870834,0.00013524404,0.012520255,0.0022940605,0.0027162854,0.7733867,0.021261122,0.17991577],"study_design_scores_gemma":[0.0004504278,0.0000013704899,0.0013945182,0.00078460167,0.000055438264,0.00018835539,0.000021112215,0.98390406,0.005518172,0.0022319946,0.0049427636,0.0005071536],"about_ca_topic_score_codex":0.0012503935,"about_ca_topic_score_gemma":0.00015574238,"teacher_disagreement_score":0.98161006,"about_ca_system_score_codex":0.0001457204,"about_ca_system_score_gemma":0.00021990825,"threshold_uncertainty_score":0.99986726},"labels":[],"label_agreement":null},{"id":"W3085136136","doi":"10.1007/978-3-030-58768-0_17","title":"Formal Verification of Human-Robot Interaction in Healthcare Scenarios","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Toolchain; Computer science; Automaton; Model checking; Formalism (music); Formal verification; Human–computer interaction; Robot; Formal methods; Representation (politics); Human–robot interaction; Artificial intelligence; Software engineering; Theoretical computer science; Programming language","score_opus":0.05406738394847032,"score_gpt":0.32825334805878387,"score_spread":0.27418596411031354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085136136","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.00033469807,0.00014210174,0.99534196,0.0012442091,0.0013650028,0.00051168253,0.0000033956908,0.00009731363,0.000959636],"genre_scores_gemma":[0.50004715,0.000022121294,0.49923342,0.0004973761,0.00014048259,0.000012135918,0.000009496689,0.000019037825,0.00001880279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964792,0.00009453428,0.0009383405,0.0011845737,0.0008245563,0.00047878007],"domain_scores_gemma":[0.99753493,0.00017610195,0.0006666873,0.001217096,0.0002768312,0.00012837762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012907675,0.00037615534,0.00052659237,0.0009770803,0.00015443844,0.00017500791,0.0025555652,0.0003271233,0.0000070578267],"category_scores_gemma":[0.0001630406,0.0003910793,0.00010348678,0.0009320379,0.00037651815,0.0015276754,0.0007845998,0.0010393896,0.00002117127],"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.000025263049,0.000052830077,0.00020362234,0.00023512842,0.0000066238786,0.000018956718,0.0022008624,0.024259998,0.0033733228,0.2194258,0.0000051201177,0.75019246],"study_design_scores_gemma":[0.0004042371,0.0005829996,0.0024895945,0.00079231,0.0000059885488,0.000039739505,0.0000010935408,0.89178723,0.016098859,0.08679584,0.0003212113,0.0006809074],"about_ca_topic_score_codex":0.0001263499,"about_ca_topic_score_gemma":0.00012960778,"teacher_disagreement_score":0.86752725,"about_ca_system_score_codex":0.000546907,"about_ca_system_score_gemma":0.00040607678,"threshold_uncertainty_score":0.9998541},"labels":[],"label_agreement":null},{"id":"W3088039827","doi":"10.1109/icse43902.2021.00082","title":"Trace-Checking CPS Properties: Bridging the Cyber-Physical Gap","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Formal Methods in Verification","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":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Politecnico di Milano; European Commission; Université du Luxembourg","keywords":"TRACE (psycholinguistics); Computer science; Specification language; Programming language; Bridging (networking); Model checking; Cyber-physical system; Temporal logic; Formal specification; Operating system","score_opus":0.1012271678064248,"score_gpt":0.31646480532249804,"score_spread":0.21523763751607325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088039827","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.06845615,0.00034960284,0.91698253,0.0016133512,0.0013747488,0.0004065046,6.91449e-7,0.00038989016,0.010426554],"genre_scores_gemma":[0.5672272,0.000024435312,0.43116477,0.0002919391,0.00044991745,0.00011243603,0.0000024693127,0.000021097469,0.00070573454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974918,0.0004037956,0.00035762787,0.00082731876,0.00055582327,0.0003636317],"domain_scores_gemma":[0.9973585,0.00010299187,0.00021769591,0.0020716114,0.00017922063,0.00007000824],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010535518,0.000289679,0.00031959944,0.00006567449,0.00022871922,0.0011017396,0.0025302032,0.00015991149,0.000015685508],"category_scores_gemma":[0.00028400702,0.00018947404,0.0002242465,0.00030803672,0.0001062196,0.00048178877,0.0028352207,0.0010155378,0.00004430859],"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.000012026898,0.00036965328,0.000111455585,0.0005634569,0.00019421222,0.00003911425,0.041484613,0.013651178,0.013009628,0.25765744,0.0010231165,0.6718841],"study_design_scores_gemma":[0.000071898474,0.000017617273,0.0007112552,0.00025015874,0.00001968681,0.000029087449,0.0003495666,0.952647,0.04134203,0.0025505805,0.001596314,0.00041485846],"about_ca_topic_score_codex":0.0001356565,"about_ca_topic_score_gemma":0.0000064567603,"teacher_disagreement_score":0.9389958,"about_ca_system_score_codex":0.00012587666,"about_ca_system_score_gemma":0.00026538686,"threshold_uncertainty_score":0.9999352},"labels":[],"label_agreement":null},{"id":"W3088182729","doi":"10.1145/3324884.3416631","title":"Trace-checking signal-based temporal properties","year":2020,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; H2020 European Research Council; Université du Luxembourg","keywords":"TRACE (psycholinguistics); Computer science; Temporal logic; Specification language; SIGNAL (programming language); Programming language; Model checking; Formal specification; Theoretical computer science","score_opus":0.12121084156860466,"score_gpt":0.2781040980665356,"score_spread":0.1568932564979309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088182729","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.0071739317,0.000052593554,0.984962,0.0037030852,0.00007836774,0.00011568194,1.8655389e-7,0.00037598884,0.0035381657],"genre_scores_gemma":[0.5217627,2.3046263e-7,0.4771319,0.0010113966,0.00002694821,0.0000066123002,2.1573477e-7,0.0000033251195,0.000056659057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992132,0.000071953305,0.000155398,0.00022734978,0.00019142205,0.00014063281],"domain_scores_gemma":[0.99958366,0.000017427863,0.00004810186,0.00022644615,0.000044065277,0.00008030436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024075307,0.0000770127,0.0000828651,0.00002742945,0.000063065076,0.000109693974,0.0005575946,0.000031861127,0.000043483593],"category_scores_gemma":[0.00007213096,0.0000602179,0.000034992627,0.0002679997,0.000028387585,0.0004497159,0.00006631642,0.000084727515,0.00009298304],"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.000112974136,0.00024015734,0.006038502,0.00033997025,0.000039741124,0.00003509831,0.009989791,0.008509982,0.20714307,0.30696926,0.0050460524,0.4555354],"study_design_scores_gemma":[0.00010716775,0.00007543516,0.0003017016,0.0000073391057,0.0000012734569,9.3394567e-7,0.000029929579,0.79159075,0.20190106,0.00014918849,0.0057300157,0.00010517604],"about_ca_topic_score_codex":0.00001681944,"about_ca_topic_score_gemma":9.168773e-7,"teacher_disagreement_score":0.7830808,"about_ca_system_score_codex":0.000016741622,"about_ca_system_score_gemma":0.00006537972,"threshold_uncertainty_score":0.24556147},"labels":[],"label_agreement":null},{"id":"W3088768572","doi":"10.4204/eptcs.327.7","title":"Proceedings of the Sixteenth International Workshop on the ACL2 Theorem Prover and its Applications","year":2020,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"Automated theorem proving; Calculus (dental); Programming language; Computer science; Gas meter prover; Software engineering; Mathematics; Mathematical proof; Medicine","score_opus":0.012881381362688701,"score_gpt":0.2568102535012909,"score_spread":0.24392887213860218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088768572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26317644,0.00016661502,0.6460003,0.059462663,0.00049399707,0.0030667768,0.0000029330176,0.0002921571,0.027338084],"genre_scores_gemma":[0.97739637,0.000026204438,0.02080215,0.0015320986,0.000118623466,0.00010727285,9.149648e-8,0.000009044429,0.000008121692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975826,0.000021881267,0.00034231963,0.00072109775,0.00081360334,0.00051846047],"domain_scores_gemma":[0.9988904,0.00022742139,0.00020939927,0.00021362623,0.000350121,0.00010903345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002059421,0.00018450922,0.0001596266,0.00010636505,0.00029200432,0.0003534778,0.004475684,0.000062157174,0.00000849812],"category_scores_gemma":[0.0008637128,0.000110042274,0.000051009487,0.0021986389,0.0013726574,0.0008055228,0.0013201431,0.0005892872,0.000006596346],"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.000016256226,0.000038061793,0.0000979809,0.000013698056,0.0000042352694,5.714997e-8,0.0010408373,0.000010503509,0.0037066052,0.98399276,0.00003660706,0.011042425],"study_design_scores_gemma":[0.00021290268,0.0001964617,0.000974738,0.00008104769,0.000005267329,0.000015691558,0.000076129334,0.64640325,0.06916091,0.28176495,0.00090292987,0.00020572844],"about_ca_topic_score_codex":2.2312098e-7,"about_ca_topic_score_gemma":6.478278e-8,"teacher_disagreement_score":0.7142199,"about_ca_system_score_codex":0.0001364524,"about_ca_system_score_gemma":0.0001346927,"threshold_uncertainty_score":0.83170086},"labels":[],"label_agreement":null},{"id":"W3090654214","doi":"10.1145/3365438.3410936","title":"Synthesis of state machine models","year":2020,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Ottawa; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Executable; Unified Modeling Language; Computer science; Component (thermodynamics); Scalability; State (computer science); Software; Finite-state machine; State space; Programming language; Operating system","score_opus":0.058386967574919305,"score_gpt":0.2767164230592295,"score_spread":0.2183294554843102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090654214","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.0016604756,0.000017584098,0.98471814,0.00081449095,0.00003254798,0.000041384334,0.000001794208,0.00008608117,0.012627509],"genre_scores_gemma":[0.41126058,0.0000053854224,0.5884958,0.00020103264,0.0000032322337,0.0000022312727,7.477178e-8,0.0000016662785,0.000030012165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952936,0.000042329408,0.00012621323,0.00012039709,0.00011465406,0.000067018096],"domain_scores_gemma":[0.9996092,0.000046989106,0.000044960234,0.00022555207,0.000029713961,0.000043608008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016492522,0.0000388315,0.00007368171,0.000018817735,0.000012351858,0.000013097871,0.0004521357,0.000011269548,0.000016373819],"category_scores_gemma":[0.00008554837,0.00003211267,0.000021428436,0.00017882505,0.00001403824,0.00034118837,0.00010354363,0.000030848547,0.000021363874],"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.000009083602,0.00002399103,0.00005189958,0.00003481576,0.000010164778,0.0000010616739,0.0010486592,0.006780839,0.005388612,0.7107435,0.00026064526,0.27564675],"study_design_scores_gemma":[0.000022169646,0.000017676375,0.0000707341,0.0000017024353,8.9320764e-7,4.0459472e-7,0.0000033820916,0.8335256,0.15942806,0.0067358403,0.00015976159,0.00003375926],"about_ca_topic_score_codex":0.000017214263,"about_ca_topic_score_gemma":3.9678616e-7,"teacher_disagreement_score":0.8267448,"about_ca_system_score_codex":0.000004649582,"about_ca_system_score_gemma":0.000012267185,"threshold_uncertainty_score":0.13095167},"labels":[],"label_agreement":null},{"id":"W3091761631","doi":"10.3233/fi-2020-1956","title":"Algebraic Structure of Step Traces and Interval Traces","year":2020,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Interval (graph theory); Algebraic number; Algebraic structure; Quotient; Mathematics; Algebra over a field; Interval arithmetic; Semantics (computer science); Subject (documents); Computer science; Discrete mathematics; Pure mathematics; Combinatorics; Programming language","score_opus":0.024982280232024416,"score_gpt":0.26311614310968523,"score_spread":0.2381338628776608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091761631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5900067,0.00012793601,0.40666115,0.0010509108,0.00021632764,0.00028100045,0.0000236737,0.000114539405,0.0015177615],"genre_scores_gemma":[0.6470198,0.000009923766,0.35230738,0.0006266293,0.000019422298,0.0000026914481,0.0000030323622,0.0000035769895,0.0000075474577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892277,0.000048088506,0.00046147258,0.00014228103,0.0002603467,0.00016505636],"domain_scores_gemma":[0.99929,0.000060982595,0.00022665561,0.00026975622,0.00003763855,0.00011495144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016395286,0.00012474053,0.00020151799,0.000060689297,0.0000570506,0.00014328954,0.0006288253,0.000053621217,0.00006887915],"category_scores_gemma":[0.00009659446,0.0001058618,0.00003768248,0.00024655287,0.000104596846,0.0016463816,0.00022797882,0.00013529026,0.000018795181],"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.00009272958,0.0000826709,0.0031954423,0.00152373,0.00014814417,0.0000029454163,0.081717096,0.000111658555,0.014823582,0.32808477,0.002739603,0.56747764],"study_design_scores_gemma":[0.0020986255,0.0018668756,0.029797845,0.00020242158,0.00006205192,0.00008614399,0.006856415,0.77902323,0.1379034,0.0062065236,0.034944687,0.0009517694],"about_ca_topic_score_codex":0.0000048064735,"about_ca_topic_score_gemma":0.0000013405448,"teacher_disagreement_score":0.7789116,"about_ca_system_score_codex":0.000016150212,"about_ca_system_score_gemma":0.000025616648,"threshold_uncertainty_score":0.43169188},"labels":[],"label_agreement":null},{"id":"W3093622937","doi":"10.1016/j.entcs.2020.09.004","title":"Towards a Classification of Behavioural Equivalences in Continuous-time Markov Processes","year":2020,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bisimulation; Equivalence (formal languages); Mathematics; Interpretation (philosophy); Theoretical computer science; Semantics (computer science); Algebra over a field; Computer science; Pure mathematics; Programming language","score_opus":0.030788265707390784,"score_gpt":0.29334818792738837,"score_spread":0.2625599222199976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093622937","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.2105187,0.00010946896,0.78693014,0.0015911468,0.00009656849,0.0002553877,0.0000010305281,0.0000770499,0.00042050966],"genre_scores_gemma":[0.7485078,0.000015307802,0.25127435,0.00015138411,0.000026849804,0.00001727277,7.3178245e-7,0.0000056799186,6.5542673e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691844,0.00025549566,0.0005833002,0.00078664726,0.0007056066,0.00075053266],"domain_scores_gemma":[0.9986038,0.00035798983,0.00018619909,0.00049887126,0.00021951682,0.0001336297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002485706,0.00018655168,0.00031946754,0.00025840566,0.00007709239,0.00014778205,0.0028970407,0.000077616685,0.00002888549],"category_scores_gemma":[0.0014133352,0.00016896627,0.000044585726,0.003231212,0.0016136818,0.0009913823,0.000551757,0.000369097,0.000014992644],"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.000031321204,0.00010179711,0.0031700279,0.00004247414,0.0000017399819,0.000003504342,0.0012140162,0.00012156407,0.006128417,0.8988722,0.000001509548,0.09031143],"study_design_scores_gemma":[0.0003398461,0.00068513723,0.02004778,0.000078437806,0.0000034579639,0.000011551194,0.000013226017,0.85499245,0.055270247,0.06828202,0.000010432938,0.00026539317],"about_ca_topic_score_codex":0.000013124052,"about_ca_topic_score_gemma":0.000004314755,"teacher_disagreement_score":0.8548709,"about_ca_system_score_codex":0.00018773753,"about_ca_system_score_gemma":0.0007598436,"threshold_uncertainty_score":0.68902445},"labels":[],"label_agreement":null},{"id":"W3096653528","doi":"10.1145/3419804.3420263","title":"Bounded Verification of State Machine Models","year":2020,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bounded function; Computer science; State (computer science); Theoretical computer science; Algorithm; Mathematics; Mathematical analysis","score_opus":0.06932429081240729,"score_gpt":0.272263933830727,"score_spread":0.2029396430183197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096653528","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.005447635,0.000023637807,0.9861886,0.0008640952,0.00006601625,0.00009184566,0.0000019317636,0.00012902211,0.007187247],"genre_scores_gemma":[0.44362482,0.0000080547115,0.5560618,0.00024668773,0.0000052729174,0.000002965999,0.0000012903625,0.00000245316,0.00004666781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932736,0.00005211307,0.00019418141,0.00017861907,0.00016243797,0.00008527465],"domain_scores_gemma":[0.9994382,0.000016862703,0.0000872163,0.00033799963,0.00006493464,0.00005474944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020849213,0.000053688833,0.00008173985,0.00002696213,0.000024765912,0.000030218174,0.00050418987,0.00001895332,0.00001301599],"category_scores_gemma":[0.00004368666,0.00004864209,0.000024096378,0.00028428412,0.000024070923,0.00059618405,0.00008022981,0.000049297592,0.000027506247],"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.000010159085,0.000022519052,0.000024619536,0.000020356501,0.000005686904,2.9681064e-7,0.0017073815,0.0022902025,0.013149962,0.9409085,0.0001357678,0.041724533],"study_design_scores_gemma":[0.000090728354,0.000045745724,0.00025057665,0.0000014566078,0.0000010765517,5.7374325e-7,0.000007933947,0.9088218,0.06592245,0.024270527,0.0005337649,0.000053341668],"about_ca_topic_score_codex":0.000022133121,"about_ca_topic_score_gemma":7.356692e-7,"teacher_disagreement_score":0.916638,"about_ca_system_score_codex":0.000011821556,"about_ca_system_score_gemma":0.000027428905,"threshold_uncertainty_score":0.19835669},"labels":[],"label_agreement":null},{"id":"W3099300391","doi":"","title":"Robust Abstractions for Control Synthesis: Completeness via Robustness for Linear-Time Properties","year":2017,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"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 Waterloo","funders":"","keywords":"Robustness (evolution); Computer science; Robust control; Linear system; Decidability; Nonlinear system; Control theory (sociology); Completeness (order theory); Abstraction; Algorithm; Mathematics; Control (management); Artificial intelligence","score_opus":0.2178528798722542,"score_gpt":0.22654125145601975,"score_spread":0.008688371583765536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099300391","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.026105683,0.000008599638,0.9720539,0.00021681056,0.00039422789,0.0007454164,0.000028373557,0.00016327763,0.00028373435],"genre_scores_gemma":[0.84026814,0.0000034215573,0.15882799,0.0000310467,0.00008978926,0.000028432292,0.000002257969,0.0000151101585,0.0007338175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880576,0.00006731839,0.00020657935,0.00053523184,0.000060091064,0.00032502046],"domain_scores_gemma":[0.99779063,0.00027274495,0.0003328134,0.0011454979,0.00036071765,0.00009762034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005741691,0.0001713688,0.00025329608,0.000096892916,0.0011991147,0.00019189605,0.0016748771,0.00010804369,0.000009366241],"category_scores_gemma":[0.00041523098,0.00017486801,0.000157543,0.00009649101,0.00017901827,0.0014198013,0.00012842946,0.00009479288,0.000037691734],"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.00029654082,0.00018618036,0.00060185697,0.00015154193,0.000108961685,0.000008481222,0.00006088326,0.86681634,0.002784623,0.12320572,0.00014468511,0.0056342096],"study_design_scores_gemma":[0.00073045463,0.00006373092,0.0014311457,0.000026907584,0.000066292094,0.0000046258897,0.000024677489,0.99256694,0.0028766696,0.0012252227,0.0007408084,0.00024250953],"about_ca_topic_score_codex":0.00003652955,"about_ca_topic_score_gemma":0.000012230192,"teacher_disagreement_score":0.81416243,"about_ca_system_score_codex":0.00008719209,"about_ca_system_score_gemma":0.00006322303,"threshold_uncertainty_score":0.92227423},"labels":[],"label_agreement":null},{"id":"W3108616151","doi":"10.4204/eptcs.329.1","title":"How to Formally Model Human in Collaborative Robotics","year":2020,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Robotics; Robot; Workspace; Artificial intelligence; Computer science; Human–robot interaction; Human–computer interaction; Risk analysis (engineering); Business","score_opus":0.015733728773702712,"score_gpt":0.277300833355258,"score_spread":0.2615671045815553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108616151","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.020537542,0.00002055171,0.96234363,0.0141568445,0.00008157913,0.0004921153,4.614921e-7,0.00014944888,0.0022178022],"genre_scores_gemma":[0.5598618,0.0000021521441,0.4390523,0.001001571,0.000046675108,0.000024698,1.4909688e-7,0.000007226652,0.000003410147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659055,0.000038574908,0.00039123854,0.0010337764,0.0007533733,0.0011924964],"domain_scores_gemma":[0.9988655,0.000048332826,0.00010628127,0.00029764112,0.00034395518,0.00033828572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021473623,0.000244454,0.00029245406,0.00038147767,0.00020606315,0.0008290237,0.003577765,0.00008465543,0.000001375613],"category_scores_gemma":[0.00049899815,0.0002355078,0.000034997982,0.005552056,0.0006828378,0.0022700012,0.0011469419,0.00059607194,0.000008796838],"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.000016570246,0.000030030042,0.00006523372,0.0000118944145,0.000001190473,0.000002010211,0.0029597923,0.007830185,0.003717495,0.979213,0.000020695994,0.0061319238],"study_design_scores_gemma":[0.00025179115,0.0005406752,0.00015464528,0.000024270188,0.0000010701632,0.0000051068278,0.000033312022,0.8035916,0.009532715,0.1855665,0.00005524915,0.00024305625],"about_ca_topic_score_codex":7.6911994e-7,"about_ca_topic_score_gemma":0.0000019636586,"teacher_disagreement_score":0.7957614,"about_ca_system_score_codex":0.00046931434,"about_ca_system_score_gemma":0.0004362728,"threshold_uncertainty_score":0.960373},"labels":[],"label_agreement":null},{"id":"W3111234428","doi":"10.1109/smc42975.2020.9283204","title":"A Model-driven Approach for the Formal Analysis of Human-Robot Interaction Scenarios","year":2020,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Robot; Computer science; Set (abstract data type); Automaton; Domain (mathematical analysis); Mobile robot; Model checking; Human–computer interaction; Range (aeronautics); Formal verification; Human–robot interaction; Model-based design; Artificial intelligence; Software engineering; Simulation; Theoretical computer science; Programming language; Engineering","score_opus":0.16369819166471,"score_gpt":0.36166752156243953,"score_spread":0.19796932989772953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111234428","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.0024106766,0.000005841241,0.9954425,0.00037165696,0.000037067883,0.00026975988,0.0000023446426,0.00006214201,0.0013979985],"genre_scores_gemma":[0.4832112,9.637903e-7,0.5165334,0.00017760586,0.000012931126,0.000031070053,0.0000048422494,0.0000022699985,0.000025773723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921155,0.000037870712,0.00024590173,0.00021338304,0.00015984426,0.00013145663],"domain_scores_gemma":[0.99927753,0.00007070328,0.00014274578,0.0003695693,0.0001019799,0.000037455146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003281264,0.000072575414,0.00015419218,0.00009302921,0.00012089548,0.00005290184,0.0007205622,0.000034570035,0.0000057150246],"category_scores_gemma":[0.0000541676,0.000048929927,0.00015990667,0.0007574106,0.000027913506,0.0006786147,0.00014958809,0.0000792622,0.0000013722288],"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.00001594651,0.000033318152,0.0000637975,0.00001743119,0.00018792886,2.5087544e-8,0.0021495335,0.8470842,0.003377792,0.13702697,0.00009763318,0.009945378],"study_design_scores_gemma":[0.00010635693,0.00006929389,0.000308062,0.0000010427622,0.00013226128,2.9266454e-7,0.00013400974,0.99642134,0.0025977197,0.00011163759,0.00005738798,0.000060590493],"about_ca_topic_score_codex":0.000021099137,"about_ca_topic_score_gemma":0.0000053763965,"teacher_disagreement_score":0.4808005,"about_ca_system_score_codex":0.000020550866,"about_ca_system_score_gemma":0.00001679826,"threshold_uncertainty_score":0.19953045},"labels":[],"label_agreement":null},{"id":"W3112111357","doi":"10.48550/arxiv.2012.04011","title":"Real-Time Formal Verification of Autonomous Systems With An FPGA","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Field-programmable gate array; Reachability; Computation; Curse of dimensionality; Formal verification; Formal methods; Embedded system; MATLAB; Software deployment; Obstacle; Grid; Unmanned ground vehicle; Computer engineering; Real-time computing; Algorithm; Artificial intelligence","score_opus":0.08466157346551478,"score_gpt":0.21339325836900733,"score_spread":0.12873168490349254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112111357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20553069,0.00000960054,0.7896595,0.000018163371,0.00027754277,0.00043058713,0.000017745495,0.00034617767,0.0037099835],"genre_scores_gemma":[0.8876076,0.00003606801,0.11199343,0.00000843218,0.000049033442,0.0000029027244,0.00003973669,0.000020467964,0.00024235119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979278,0.00029099724,0.00036886684,0.00097386725,0.00014897974,0.00028948026],"domain_scores_gemma":[0.99698144,0.00004478939,0.0007265306,0.0017905954,0.00027095326,0.00018567257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052937324,0.00027898242,0.0004091869,0.00020713295,0.00010716116,0.00010595198,0.002087381,0.00026231518,0.0000073657234],"category_scores_gemma":[0.00003061904,0.00030283455,0.00009556878,0.0006198376,0.0001289468,0.001201948,0.00076030416,0.00036573777,0.000056074936],"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.00019374763,0.00014536624,0.000665232,0.00041584863,0.0000944705,0.00006374824,0.00068336487,0.2804788,0.0015373838,0.71402776,0.000029741781,0.0016645439],"study_design_scores_gemma":[0.00028283562,0.00033120875,0.0023095692,0.00006910331,0.000059831025,0.000007877339,0.0000837226,0.99240136,0.0013672673,0.0026220877,0.0001024044,0.0003627108],"about_ca_topic_score_codex":0.00031617886,"about_ca_topic_score_gemma":0.0000035754006,"teacher_disagreement_score":0.7119226,"about_ca_system_score_codex":0.00023475739,"about_ca_system_score_gemma":0.00030073003,"threshold_uncertainty_score":0.99994236},"labels":[],"label_agreement":null},{"id":"W3112626473","doi":"10.1145/3400302.3415708","title":"Word level property directed reachability","year":2020,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":16,"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 Waterloo","funders":"","keywords":"Computer science; Satisfiability modulo theories; Reachability; Predicate abstraction; Formal verification; Word (group theory); Programming language; Model checking; Theoretical computer science; Firmware; Algorithm; Computer hardware; Mathematics","score_opus":0.15580024217156702,"score_gpt":0.30383832281147627,"score_spread":0.14803808063990925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112626473","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.0026516265,0.000007595473,0.9669171,0.0050136275,0.00013424411,0.00015687285,7.803552e-7,0.0008478361,0.024270339],"genre_scores_gemma":[0.11467117,0.0000012353844,0.8832815,0.0009942907,0.000034475444,0.0000116450055,6.4848905e-7,0.0000035918938,0.0010014353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991367,0.00011854155,0.00015073855,0.00030510107,0.00015785501,0.00013107428],"domain_scores_gemma":[0.99932617,0.000031508505,0.0000351191,0.00044285564,0.000069279966,0.000095051444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032258348,0.0000686495,0.000085578955,0.000014945,0.00004755313,0.000053993732,0.00064030394,0.000033267956,0.000045817273],"category_scores_gemma":[0.0005051936,0.00004214081,0.00002809183,0.00040502066,0.000030376059,0.00040181138,0.00018986166,0.00009170219,0.0001493809],"study_design_candidate":"design_other","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.000012445599,0.00005024315,0.0007099963,0.000022108949,0.000005835124,0.000001389659,0.0012430007,0.000008996836,0.006149739,0.0633643,0.0024338677,0.9259981],"study_design_scores_gemma":[0.00026999362,0.0001437128,0.051952504,0.0000075582248,0.0000033804815,0.000004999859,0.00003247125,0.81643194,0.039515253,0.0020015596,0.0892956,0.000340994],"about_ca_topic_score_codex":0.00005144571,"about_ca_topic_score_gemma":0.000002979516,"teacher_disagreement_score":0.9256571,"about_ca_system_score_codex":0.00002333309,"about_ca_system_score_gemma":0.00003466296,"threshold_uncertainty_score":0.1920039},"labels":[],"label_agreement":null},{"id":"W3113301275","doi":"10.1016/j.jss.2020.110881","title":"Signal-Based Properties of Cyber-Physical Systems: Taxonomy and Logic-based Characterization","year":2020,"lang":"en","type":"article","venue":"Journal of Systems and Software","topic":"Formal Methods in Verification","field":"Computer Science","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 Ottawa","funders":"European Research Council; Université du Luxembourg","keywords":"Completeness (order theory); Taxonomy (biology); Property (philosophy); System requirements specification; Aerospace; Software requirements specification","score_opus":0.06730184173844211,"score_gpt":0.2426470715689955,"score_spread":0.1753452298305534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113301275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21697794,0.00063932425,0.78178984,0.00016883794,0.00017371865,0.00021866514,0.00000498554,0.000022000017,0.0000046944574],"genre_scores_gemma":[0.9635668,0.000008356143,0.036163922,0.00008466245,0.00015192173,0.000012434206,9.738003e-7,0.0000064326036,0.0000044975573],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988223,0.00018948062,0.00047646355,0.0001415333,0.00027060113,0.00009964463],"domain_scores_gemma":[0.99868786,0.00006331404,0.0006882425,0.00012923703,0.0003154787,0.00011584029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043080313,0.00010820154,0.0003507163,0.00007700202,0.00005812194,0.00014235338,0.0002203433,0.00005404516,4.5037777e-7],"category_scores_gemma":[0.0001307732,0.00007728485,0.000047473888,0.00015304991,0.00005440379,0.00045749886,0.000032328644,0.00011075178,6.414421e-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.0011455514,0.0010455291,0.06367709,0.025160883,0.00051586854,0.00017450307,0.01303942,0.05109649,0.6963419,0.049914464,0.0005181679,0.09737016],"study_design_scores_gemma":[0.0012632159,0.0014363648,0.006491607,0.0016736033,0.000052580486,0.00009353461,0.0003733378,0.96733856,0.017174572,0.000031797015,0.0037282256,0.0003426218],"about_ca_topic_score_codex":0.00001275815,"about_ca_topic_score_gemma":7.4318564e-8,"teacher_disagreement_score":0.91624206,"about_ca_system_score_codex":0.000022951104,"about_ca_system_score_gemma":0.000106813284,"threshold_uncertainty_score":0.3151585},"labels":[],"label_agreement":null},{"id":"W31173899","doi":"10.1016/j.bbmt.2019.05.035","title":"Propositional Satisfiability: Algorithms and Applications","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"York University","funders":"Thomas Jefferson University","keywords":"Satisfiability; Algorithm; Boolean satisfiability problem; Computer science; Representation (politics); Propositional formula; Bounded function; Conjunctive normal form; Propositional calculus; Theoretical computer science; Propositional variable; Mathematics; Discrete mathematics; Programming language; Description logic; Intermediate logic","score_opus":0.02848831540534338,"score_gpt":0.27992457003216464,"score_spread":0.2514362546268213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31173899","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.0018718347,0.00003123238,0.98985755,0.0003316007,0.00003403851,0.00019545847,9.802147e-7,0.00013298423,0.0075443285],"genre_scores_gemma":[0.047685757,0.000013634297,0.95177746,0.00015981145,0.000036146586,0.00009599342,0.0000015284536,0.0000020129125,0.00022766915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999473,0.000031152827,0.00009854096,0.00019388694,0.00012401535,0.00007944798],"domain_scores_gemma":[0.9995615,0.000033536046,0.00002321373,0.00028559906,0.000051227096,0.000044927325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016441422,0.00004430646,0.000045382898,0.000031628497,0.00015614314,0.000023473502,0.00019211773,0.000023606332,0.000014179986],"category_scores_gemma":[0.000015294447,0.000039085844,0.000011470796,0.0001669832,0.000094971816,0.00032439918,0.000076330914,0.000043097156,0.0000351347],"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":[4.5343785e-7,0.00002795715,0.0011261951,0.0000042203033,0.000002115705,4.97905e-7,0.00010166227,0.0000042712995,0.00022976976,0.8697269,0.00013752388,0.12863843],"study_design_scores_gemma":[0.0005732225,0.00019967325,0.3408868,0.000008240928,0.000007556972,0.0009594574,0.000041119943,0.3825898,0.017035853,0.20115587,0.055910982,0.00063141703],"about_ca_topic_score_codex":0.000007903463,"about_ca_topic_score_gemma":3.8994253e-7,"teacher_disagreement_score":0.66857105,"about_ca_system_score_codex":0.00001614856,"about_ca_system_score_gemma":0.000031385367,"threshold_uncertainty_score":0.15938744},"labels":[],"label_agreement":null},{"id":"W3119037501","doi":"10.1016/j.eswa.2021.114572","title":"Reliability-driven Automotive Software Deployment based on a Parametrizable Probabilistic Model Checking","year":2021,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Formal Methods in Verification","field":"Computer Science","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":"Concordia University","funders":"","keywords":"Computer science; Soundness; Software deployment; Probabilistic logic; Software; Systems Modeling Language; Software system; Distributed computing; Software engineering; Programming language; Embedded system; Unified Modeling Language; Artificial intelligence","score_opus":0.03097557327469753,"score_gpt":0.2899925838896725,"score_spread":0.25901701061497495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119037501","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.000318551,0.00014514138,0.995844,0.00034921733,0.00011500837,0.0016365041,0.000014837487,0.0006110312,0.0009657041],"genre_scores_gemma":[0.22416247,0.000004090082,0.7699219,0.000304213,0.000047425212,0.0053038453,0.000016979793,0.00002694339,0.0002121546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755824,0.00022754516,0.0004215038,0.0009042187,0.0005480077,0.00034051522],"domain_scores_gemma":[0.99662817,0.0003103013,0.0002167945,0.0020485981,0.0006380062,0.00015816055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047732767,0.000231078,0.00027613054,0.00012767647,0.00033117237,0.00022296356,0.0007213592,0.0001017028,0.000004622137],"category_scores_gemma":[0.00041084437,0.00019906525,0.000065214954,0.0011783547,0.000075387434,0.00031142475,0.00011053519,0.0001923236,0.000050184666],"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.000012134168,0.00045535798,0.00017863183,0.0001112351,0.00001831254,0.0000037943794,0.00070569594,0.90085334,0.0005058744,0.093894884,0.00032554707,0.0029352123],"study_design_scores_gemma":[0.0002722432,0.00008001218,0.00019144197,0.0001255579,0.0000078200555,0.0000129998,0.00007658098,0.99220175,0.0023147652,0.00077721756,0.0036860963,0.00025354073],"about_ca_topic_score_codex":0.0000341185,"about_ca_topic_score_gemma":0.000002990711,"teacher_disagreement_score":0.22592212,"about_ca_system_score_codex":0.00042262377,"about_ca_system_score_gemma":0.00048451967,"threshold_uncertainty_score":0.81176454},"labels":[],"label_agreement":null},{"id":"W3120557648","doi":"10.1142/s0129054121500106","title":"Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Undecidable problem; Bounded function; Computer science; Decidability; Timed automaton; Automaton; Word (group theory); Discretization; Upper and lower bounds; Regular language; Discrete mathematics; Mathematics; Algorithm; Theoretical computer science","score_opus":0.0166647698265721,"score_gpt":0.3381901749490095,"score_spread":0.3215254051224374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120557648","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.090384476,0.000036588564,0.9048935,0.0017337946,0.0019830728,0.00010111367,0.000006665979,0.000023021688,0.0008377648],"genre_scores_gemma":[0.52424985,0.0000070140454,0.47549212,0.00013920155,0.00007850719,0.0000017915806,0.000007808126,0.000004324931,0.00001937651],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962121,0.00021929543,0.0009751103,0.00033066375,0.0020761548,0.0001866395],"domain_scores_gemma":[0.99424183,0.00032720444,0.0012835956,0.00073564524,0.0033018421,0.00010989453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022200174,0.00014461516,0.0002795635,0.00082458335,0.00024559523,0.00028707794,0.0030819243,0.000055051398,0.0000470261],"category_scores_gemma":[0.00090677396,0.00013522521,0.00016585545,0.0012805257,0.00047150435,0.0016373852,0.00074243575,0.00018921336,0.0000086338505],"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.00034731257,0.0017302352,0.00054941385,0.000055632714,0.00016611352,0.000059796854,0.0058220243,0.015588756,0.36569664,0.35509378,0.00028524277,0.25460505],"study_design_scores_gemma":[0.0013168993,0.00031512824,0.008459785,0.0002347397,0.00001671669,0.00008565257,0.000039516606,0.6898941,0.28991714,0.008683908,0.00085231755,0.00018411281],"about_ca_topic_score_codex":0.000012351527,"about_ca_topic_score_gemma":0.0000023343673,"teacher_disagreement_score":0.6743053,"about_ca_system_score_codex":0.00026805926,"about_ca_system_score_gemma":0.0013837587,"threshold_uncertainty_score":0.5727033},"labels":[],"label_agreement":null},{"id":"W3122722131","doi":"10.1002/smr.2334","title":"A formal approach to rigorous development of critical systems","year":2021,"lang":"en","type":"article","venue":"Journal of Software Evolution and Process","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; McMaster University Medical Centre","funders":"","keywords":"Toolchain; Computer science; Avionics; Life-critical system; Formal methods; Software engineering; Formal specification; Formal verification; Process (computing); Code generation; Domain (mathematical analysis); Model-based design; Software; Systems engineering; Programming language; Computer security; Engineering; Simulation","score_opus":0.029928507112248558,"score_gpt":0.3104433275643223,"score_spread":0.28051482045207377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122722131","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.026563736,0.0010438582,0.9717271,0.00006151361,0.0003593893,0.00005481007,8.8524126e-7,0.000017449807,0.00017125717],"genre_scores_gemma":[0.4605828,0.0000024169367,0.5393416,0.0000220129,0.00003124989,0.0000031215034,2.3484573e-7,0.0000022571487,0.000014261145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987966,0.00007114826,0.0004829797,0.00012481246,0.00037384767,0.00015064025],"domain_scores_gemma":[0.9985245,0.000061107894,0.00020130753,0.000120844285,0.00096616487,0.00012609774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089880853,0.00007215811,0.00018090209,0.00011405979,0.000101712096,0.00006153512,0.00026805172,0.00005370216,0.0000011971559],"category_scores_gemma":[0.0007495511,0.00006189982,0.000030112731,0.000356191,0.000033751283,0.00076685584,0.0000810016,0.00012043889,0.0000014014336],"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.00034621047,0.0024677103,0.009563439,0.008683101,0.00021938527,0.00006534631,0.05297196,0.007856628,0.0028273712,0.54476315,0.00088340684,0.36935228],"study_design_scores_gemma":[0.009822361,0.0043503474,0.27975965,0.0062700943,0.00040719175,0.03352576,0.025968278,0.39542753,0.14452884,0.060277753,0.03495992,0.0047023045],"about_ca_topic_score_codex":9.269526e-7,"about_ca_topic_score_gemma":2.2556141e-7,"teacher_disagreement_score":0.48448542,"about_ca_system_score_codex":0.00006579843,"about_ca_system_score_gemma":0.00042494136,"threshold_uncertainty_score":0.25242013},"labels":[],"label_agreement":null},{"id":"W3122794747","doi":"","title":"On Fixed-Path Rationing Methods","year":2001,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Formal Methods in Verification","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":"Université de Montréal","funders":"","keywords":"Rationing; Path (computing); Fixed point; Economics; Mathematics; Mathematical economics; Computer science; Mathematical analysis; Economic growth; Computer network","score_opus":0.07519155436166415,"score_gpt":0.41816230973224194,"score_spread":0.3429707553705778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122794747","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.026362201,0.00016344774,0.538425,0.00072756433,0.0032187512,0.0015832447,0.0000136343015,0.00028333234,0.42922276],"genre_scores_gemma":[0.017898975,0.0023994455,0.9769073,0.00017435677,0.00022615075,0.00035489415,0.000018575476,0.000049901322,0.0019703668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99480605,0.0018376354,0.00076331175,0.0013843586,0.00039676737,0.000811878],"domain_scores_gemma":[0.99526846,0.0014621019,0.00030360863,0.0026072683,0.00017040277,0.0001881805],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0094326865,0.00032721285,0.0004770453,0.00080165593,0.00025368974,0.0005272855,0.0026570617,0.0004980046,0.000059005113],"category_scores_gemma":[0.0024429313,0.0003646517,0.00016065736,0.00038051282,0.00018681343,0.0003541969,0.0022422022,0.0024141162,0.000053622443],"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.000024970159,0.00009038815,0.00019949803,0.000055030454,0.000026129286,0.000016128772,0.00046942633,0.032284785,0.00013027377,0.08202271,0.000064699,0.88461596],"study_design_scores_gemma":[0.00040205455,0.00019231586,0.0023463417,0.00029727156,0.0000039782517,0.000020728578,0.00012121415,0.9057018,0.0023702697,0.065189384,0.022666978,0.0006876423],"about_ca_topic_score_codex":0.00003359977,"about_ca_topic_score_gemma":0.000015066549,"teacher_disagreement_score":0.8839283,"about_ca_system_score_codex":0.0012909996,"about_ca_system_score_gemma":0.00060873025,"threshold_uncertainty_score":0.99988735},"labels":[],"label_agreement":null},{"id":"W3123946441","doi":"10.1145/3558549","title":"Continuous One-counter Automata","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Formal Methods in Verification","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":"Vlaamse regering; Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek","keywords":"Reachability; Decidability; Upper and lower bounds; Reachability problem; Automaton; Mathematics; Discrete mathematics; Combinatorics; Counterexample; Parametric statistics; Computer science; Theoretical computer science","score_opus":0.05042667329219194,"score_gpt":0.29836543458208986,"score_spread":0.24793876128989792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123946441","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.0019883553,0.000019569616,0.99231267,0.0027913796,0.0007895751,0.00021566538,0.00003468926,0.00042854197,0.0014195405],"genre_scores_gemma":[0.45400554,0.0000017896136,0.54420996,0.0014306986,0.00001680432,0.00011169468,0.000015658195,0.000007911343,0.00019994343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822617,0.000240931,0.00027966456,0.00040834298,0.00063145,0.00021343867],"domain_scores_gemma":[0.9987036,0.00032218028,0.000106552565,0.00070894853,0.000099352816,0.000059396203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047637403,0.00013323867,0.0001417154,0.00021469402,0.00067045266,0.00009720715,0.0013810811,0.00003518379,0.00038525544],"category_scores_gemma":[0.000039736322,0.00014780078,0.0000922421,0.00055942126,0.000048411217,0.00037515222,0.00006144453,0.00032622975,0.0001848386],"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.00003638832,0.00064546627,0.000017789891,0.000008853135,0.000046421923,0.000010360227,0.00039576358,0.62815934,0.00009414453,0.25659,0.00043939857,0.11355609],"study_design_scores_gemma":[0.00081884145,0.00062962715,0.004108572,0.0000078015055,0.000016948492,0.0001550068,0.00008735201,0.7050904,0.0003186675,0.27876776,0.009615025,0.00038395874],"about_ca_topic_score_codex":0.000010195669,"about_ca_topic_score_gemma":7.878219e-7,"teacher_disagreement_score":0.45201716,"about_ca_system_score_codex":0.00016859405,"about_ca_system_score_gemma":0.00008739696,"threshold_uncertainty_score":0.60271406},"labels":[],"label_agreement":null},{"id":"W3126524491","doi":"","title":"Safe Swerve Maneuvers for Autonomous Driving.","year":2020,"lang":"en","type":"article","venue":"IV","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"RSS; Brake; Kinematics; Vehicle dynamics; Active safety; Computer science; Engineering; Simulation; Control (management); Automotive engineering; Control theory (sociology); Artificial intelligence","score_opus":0.0494913159426132,"score_gpt":0.29389383345804043,"score_spread":0.24440251751542724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126524491","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.0039350954,0.000018465305,0.9888446,0.003190466,0.00041975552,0.0001710086,0.0000015655854,0.00018617597,0.0032328945],"genre_scores_gemma":[0.1924115,0.0000015667096,0.8061819,0.0011036714,0.00009278492,0.00002211056,0.000001239891,0.0000061263336,0.00017908229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938744,0.00002812739,0.000120552955,0.00022371036,0.00009356651,0.00014659236],"domain_scores_gemma":[0.9995095,0.000057010995,0.000053084466,0.0002728265,0.00003193977,0.00007561196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001825244,0.00006180896,0.00007602856,0.000020861373,0.000058635123,0.00005842056,0.0005920246,0.000034341338,0.000012794336],"category_scores_gemma":[0.0001737863,0.000062709216,0.00004498006,0.00014104201,0.00001780364,0.00026854844,0.0000993329,0.00005625183,0.00011560394],"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.000034100234,0.00004959435,0.000600838,0.00008775002,0.000027118063,0.000010155606,0.004312939,0.0007293095,0.005495293,0.6030786,0.021096837,0.36447746],"study_design_scores_gemma":[0.00031018292,0.00019719268,0.003859301,0.000007084044,0.000005433038,0.00000500596,0.000027556862,0.7127163,0.0125455875,0.0033506923,0.26677367,0.00020202663],"about_ca_topic_score_codex":0.0000025147256,"about_ca_topic_score_gemma":7.458924e-7,"teacher_disagreement_score":0.71198696,"about_ca_system_score_codex":0.000029624127,"about_ca_system_score_gemma":0.000032393564,"threshold_uncertainty_score":0.25572076},"labels":[],"label_agreement":null},{"id":"W3127870088","doi":"10.4230/lipics.ccc.2021.6","title":"On the Power and Limitations of Branch and Cut","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation; National Science Foundation","keywords":"Mathematical proof; Conjecture; Bounded function; Polynomial; Mathematics; Cutting-plane method; Integer (computer science); Exponential function; Integer programming; Algebraic number; Discrete mathematics; Pure mathematics; Algebra over a field; Combinatorics; Computer science; Geometry; Algorithm; Mathematical analysis","score_opus":0.05304068730325925,"score_gpt":0.2892556532147285,"score_spread":0.23621496591146926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127870088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36076146,0.00021909649,0.62841815,0.0010125055,0.0013494072,0.0014817952,0.00022689837,0.000102220925,0.0064284364],"genre_scores_gemma":[0.7773548,0.00037674434,0.22094305,0.0009062646,0.000035028912,0.00016785455,0.000115453935,0.000027199192,0.000073606025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977091,0.000119037744,0.0009879813,0.00035815738,0.0004632712,0.00036246216],"domain_scores_gemma":[0.99636,0.0009940614,0.0007156608,0.0014015461,0.00041254642,0.00011615969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010821981,0.00036996047,0.00046717154,0.00021894413,0.0002571325,0.0006279331,0.0011212649,0.00031610852,0.0000070000806],"category_scores_gemma":[0.0009825836,0.00028756543,0.00016983367,0.00023408738,0.00025055258,0.00084862136,0.0015596378,0.0007155952,0.000007486815],"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.00009257251,0.0004438084,0.0010151919,0.0023075906,0.0004955849,0.0000027852025,0.0731677,0.00052352453,0.00016034982,0.8412404,0.002258264,0.07829225],"study_design_scores_gemma":[0.0062478445,0.0019047135,0.031101793,0.004160056,0.0003845082,0.0003225903,0.011299733,0.7566377,0.01731222,0.113697745,0.052969575,0.003961554],"about_ca_topic_score_codex":0.000007921498,"about_ca_topic_score_gemma":0.000008744894,"teacher_disagreement_score":0.7561141,"about_ca_system_score_codex":0.00005416186,"about_ca_system_score_gemma":0.00012203644,"threshold_uncertainty_score":0.9999576},"labels":[],"label_agreement":null},{"id":"W3140317730","doi":"10.1109/sew.2007.104","title":"Mise en Scene: Converting Scenarios to CSP Traces in Support of Requirements-Based Programming","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Guelph","funders":"","keywords":"Computer science; Notation; TRACE (psycholinguistics); Programming language; Communicating sequential processes; Software engineering; Semantics (computer science)","score_opus":0.043111449874230115,"score_gpt":0.35257254963669477,"score_spread":0.30946109976246466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140317730","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.15938929,0.000007606588,0.8382192,0.00034959198,0.00016578229,0.0003854465,2.861744e-7,0.000095561496,0.0013872355],"genre_scores_gemma":[0.42766923,3.349258e-7,0.5719255,0.00032080332,0.000010330495,0.000009222101,6.6935155e-7,0.000004407587,0.00005947612],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983725,0.0000813721,0.00054251694,0.0003005932,0.0003471665,0.0003558619],"domain_scores_gemma":[0.99913585,0.000115342904,0.00014107057,0.000412861,0.000095872885,0.00009898656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036096273,0.00010423317,0.00015207524,0.00024375395,0.00003686329,0.000039477276,0.00064414664,0.00006047703,0.000023563885],"category_scores_gemma":[0.00032721405,0.00010018069,0.00003720315,0.00068886456,0.000032599,0.0004110501,0.000094069816,0.00009249105,0.000016584883],"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.000071357914,0.00032586188,0.035615947,0.00012876408,0.000008884809,0.000021578351,0.0039403606,0.00045225804,0.047403708,0.011676498,0.00012241144,0.9002324],"study_design_scores_gemma":[0.0010184286,0.0005127313,0.031569257,0.00010870581,0.0000063264565,0.0000059892104,0.00040976738,0.0910344,0.86507887,0.00015679003,0.009686941,0.00041178387],"about_ca_topic_score_codex":0.00009762154,"about_ca_topic_score_gemma":0.000062257735,"teacher_disagreement_score":0.89982057,"about_ca_system_score_codex":0.000094755516,"about_ca_system_score_gemma":0.000089511115,"threshold_uncertainty_score":0.408525},"labels":[],"label_agreement":null},{"id":"W3142192680","doi":"10.1109/famcad.2007.9","title":"Boosting Verification by Automatic Tuning of Decision Procedures","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":50,"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 British Columbia","funders":"","keywords":"Computer science; Heuristics; Parameterized complexity; Solver; Model checking; Boosting (machine learning); Machine learning; Software; Heuristic; Artificial intelligence; Satisfiability modulo theories; Bounded function; Algorithm; Programming language; Mathematics","score_opus":0.019168789614420038,"score_gpt":0.3105799987214886,"score_spread":0.2914112091070686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142192680","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.09874144,0.000054613396,0.8965703,0.000029455237,0.000120612276,0.000106249034,1.9580149e-7,0.00014665147,0.004230456],"genre_scores_gemma":[0.45596156,0.0000021438161,0.5439461,0.00003168405,0.000006660886,0.0000020634686,5.390027e-7,0.000002794632,0.000046489735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989938,0.000029877096,0.0003593673,0.00019161377,0.00026857745,0.00015677787],"domain_scores_gemma":[0.999052,0.00022971914,0.0001851648,0.00039113613,0.0000984324,0.00004358622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015103698,0.00006871639,0.000088105335,0.000101496466,0.00006748946,0.000036884165,0.0004978108,0.00004611707,0.000011722344],"category_scores_gemma":[0.0008913386,0.000061588944,0.000022750584,0.0004185949,0.00002705856,0.0004902052,0.000071647475,0.00005659946,0.000016761935],"study_design_candidate":"design_other","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.0000058345872,0.000049653732,0.00063159014,0.000056825807,0.0000042497986,6.5463485e-7,0.00078478083,0.00003590381,0.13126807,0.08631192,0.00082942116,0.7800211],"study_design_scores_gemma":[0.00018540422,0.00007643479,0.01433422,0.00010113524,0.0000037158366,0.000016276654,0.00013744895,0.55150795,0.42925,0.0035749369,0.0006446911,0.00016779224],"about_ca_topic_score_codex":0.000010569573,"about_ca_topic_score_gemma":0.0000018729337,"teacher_disagreement_score":0.7798533,"about_ca_system_score_codex":0.000034127803,"about_ca_system_score_gemma":0.000034976827,"threshold_uncertainty_score":0.2511524},"labels":[],"label_agreement":null},{"id":"W3145100375","doi":"10.1007/978-3-030-72013-1_1","title":"Directed Reachability for Infinite-State Systems","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Reachability; Petri net; Computer science; Algorithm; Graph; Reachability problem; Theoretical computer science; State (computer science); Stochastic Petri net; Domain (mathematical analysis); Mathematics","score_opus":0.03548021178645722,"score_gpt":0.28647125512758237,"score_spread":0.25099104334112515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145100375","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.00005422636,0.0006557869,0.99076885,0.00021971876,0.004701986,0.000988232,0.00002157905,0.0004063108,0.0021833105],"genre_scores_gemma":[0.006286554,0.000040455958,0.9918566,0.00035538897,0.00034913546,0.00007245499,0.00001713142,0.00003984771,0.0009824412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546486,0.0001285163,0.0008257795,0.0019475177,0.00092099,0.0007123547],"domain_scores_gemma":[0.9948389,0.0012494402,0.00047443778,0.0024245807,0.00082980795,0.00018285759],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027731159,0.0005320251,0.00069831655,0.00063632504,0.0002770623,0.0008125903,0.0032552367,0.00035716555,0.0000060583907],"category_scores_gemma":[0.00093257846,0.0005115759,0.00018172311,0.0008752034,0.0005922372,0.00071585143,0.0010846215,0.00069526955,0.000015605528],"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.000013546411,0.000045313387,0.000035743706,0.00026477437,0.00001974807,0.000027004698,0.0008453184,0.03630097,0.00030196688,0.122995414,0.00002911379,0.8391211],"study_design_scores_gemma":[0.00022219736,0.00015513493,0.00011369945,0.0003921364,0.000007763724,0.000043621927,1.7169852e-7,0.91234267,0.0019305797,0.07627179,0.00786328,0.000656952],"about_ca_topic_score_codex":0.00004409031,"about_ca_topic_score_gemma":0.000034156456,"teacher_disagreement_score":0.8760417,"about_ca_system_score_codex":0.0005045718,"about_ca_system_score_gemma":0.00076058815,"threshold_uncertainty_score":0.99973357},"labels":[],"label_agreement":null},{"id":"W3148292035","doi":"10.1109/date.2009.5090936","title":"Sequential logic rectifications with approximate SPFDs","year":2009,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vennsa Technologies (Canada); University of Toronto","funders":"","keywords":"Sequential logic; Computer science; Logic optimization; Combinational logic; Digital electronics; Robustness (evolution); Logic synthesis; Logic gate; Very-large-scale integration; Algorithm; Transformation (genetics); Logic family; Theoretical computer science; Construct (python library); Electronic circuit; Programming language; Engineering","score_opus":0.0508544817254369,"score_gpt":0.3120294124736287,"score_spread":0.2611749307481918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3148292035","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.001143839,0.000009588194,0.94173276,0.0012856894,0.00011792485,0.00012798583,2.873775e-7,0.00036333047,0.05521862],"genre_scores_gemma":[0.18018568,0.0000030329732,0.8187133,0.00041386142,0.000024670844,0.000010323853,0.0000014979211,0.0000025324105,0.0006450752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992249,0.000057304387,0.00013199817,0.00026200237,0.00016018552,0.00016359004],"domain_scores_gemma":[0.999178,0.000014414498,0.000059520273,0.00062600983,0.00007260395,0.000049442453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030855677,0.0000778885,0.00007010823,0.0000651734,0.00010646342,0.00011983835,0.0005345307,0.00003551556,0.000025215351],"category_scores_gemma":[0.00002774134,0.000057456793,0.000020498686,0.00044420382,0.0000320959,0.00050829945,0.000029101848,0.000078141944,0.000075617216],"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.0000034674777,0.000037687234,0.000015419264,0.0000014984851,0.0000023796022,0.000001198756,0.00010303821,0.00007973304,0.003525186,0.9570783,0.0001894742,0.03896261],"study_design_scores_gemma":[0.00082367554,0.0011825556,0.019548742,0.000031445466,0.000025816325,0.0003089895,0.0001114936,0.4819786,0.23959991,0.2432361,0.0121364305,0.001016238],"about_ca_topic_score_codex":0.000005600035,"about_ca_topic_score_gemma":0.0000014331724,"teacher_disagreement_score":0.7138422,"about_ca_system_score_codex":0.000030803767,"about_ca_system_score_gemma":0.00003431841,"threshold_uncertainty_score":0.234302},"labels":[],"label_agreement":null},{"id":"W3150028190","doi":"10.1109/famcad.2007.25","title":"Combining Symbolic Simulation and Interval Arithmetic for the Verification of AMS Designs","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Concordia University","funders":"","keywords":"Interval arithmetic; Computer science; Bounded function; Model checking; State space; Formal verification; Symbolic trajectory evaluation; Interval (graph theory); Analogue electronics; Symbolic data analysis; Mixed-signal integrated circuit; Algorithm; Theoretical computer science; Electronic circuit; Integrated circuit; Mathematics; Engineering; Electrical engineering","score_opus":0.10769050297787294,"score_gpt":0.37519260476853566,"score_spread":0.2675021017906627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150028190","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.027057579,0.000045384284,0.9719521,0.0000952266,0.00016393213,0.0002771406,3.1502293e-7,0.000043046974,0.00036529882],"genre_scores_gemma":[0.6010057,0.0000021487174,0.3989116,0.000038368096,0.000011240645,0.0000068401023,5.165247e-7,0.0000024814808,0.00002113087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937254,0.000040511964,0.0002273349,0.00014081804,0.00011039998,0.00010841439],"domain_scores_gemma":[0.99868,0.00078543276,0.000112468435,0.00029695878,0.000101757214,0.000023406565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016453966,0.00005464587,0.00007481922,0.00006104545,0.000085302716,0.000041596344,0.0002846941,0.000034530134,0.0000014192302],"category_scores_gemma":[0.0002312247,0.000039955234,0.000024541594,0.00019208546,0.00005499448,0.0002506929,0.000046376554,0.000043203476,0.0000012553354],"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.000026889973,0.000035802514,0.00051389955,0.000027909166,0.000013058032,7.2726415e-8,0.0018373148,0.0039356765,0.0066787535,0.61882216,0.000010518503,0.36809796],"study_design_scores_gemma":[0.00016099197,0.00008844259,0.03144161,0.000008319256,0.000007020107,0.0000016192016,0.00010617883,0.94598734,0.018132905,0.0037714113,0.00024148132,0.000052693693],"about_ca_topic_score_codex":0.000011630054,"about_ca_topic_score_gemma":0.0000021860153,"teacher_disagreement_score":0.94205165,"about_ca_system_score_codex":0.000016198233,"about_ca_system_score_gemma":0.00001096479,"threshold_uncertainty_score":0.16293272},"labels":[],"label_agreement":null},{"id":"W3150180001","doi":"10.1109/famcad.2007.39","title":"Circuit Level Verification of a High-Speed Toggle","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 British Columbia","funders":"","keywords":"Computer science; Digital electronics; Projection (relational algebra); Solver; Very-large-scale integration; Electronic circuit; Computer engineering; Algorithm; Electronic engineering; Embedded system; Electrical engineering; Engineering","score_opus":0.09556933078876165,"score_gpt":0.3121776807763957,"score_spread":0.21660834998763404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150180001","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.038944263,0.000012615933,0.94383675,0.0000793137,0.0003233552,0.00010230287,0.0000010584406,0.00010541793,0.016594946],"genre_scores_gemma":[0.5075914,0.0000014700329,0.49204877,0.00005247973,0.000017823137,0.0000010466941,0.0000011565836,0.0000026777577,0.00028312913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99908215,0.000027700975,0.00028411442,0.00020755042,0.00023568129,0.00016279059],"domain_scores_gemma":[0.9989989,0.000064420616,0.00012504922,0.000635763,0.00012820067,0.000047700476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011067089,0.00006606934,0.00009756659,0.00010845537,0.000037893602,0.000022972785,0.0006022315,0.0000553273,0.00003265041],"category_scores_gemma":[0.0001106452,0.0000627048,0.00003076278,0.000442823,0.000037723297,0.00039811828,0.00006328435,0.00005825367,0.00006475249],"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.000003825156,0.000035552966,0.00011920613,0.0000067861492,0.0000033844233,4.0497707e-7,0.00025465165,0.000012540489,0.04889925,0.8417041,0.00010559779,0.10885473],"study_design_scores_gemma":[0.0003189372,0.00009862428,0.15936033,0.000010024213,0.000004098854,0.000009660438,0.00006533749,0.015003712,0.80506784,0.017683348,0.002184888,0.00019320202],"about_ca_topic_score_codex":0.00010093491,"about_ca_topic_score_gemma":0.0000059788695,"teacher_disagreement_score":0.82402074,"about_ca_system_score_codex":0.00004146861,"about_ca_system_score_gemma":0.000031365125,"threshold_uncertainty_score":0.25570276},"labels":[],"label_agreement":null},{"id":"W3150464090","doi":"10.1007/s11390-011-9421-x","title":"NuMDG: A New Tool for Multiway Decision Graphs Construction","year":2011,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"Computer science; Correctness; Binary decision diagram; Operator (biology); Representation (politics); Theoretical computer science; Pruning; Set (abstract data type); Tree traversal; Data structure; Programming language; Theory of computation; Tuple; Algorithm; Mathematics; Discrete mathematics","score_opus":0.02954144827780394,"score_gpt":0.28708517276760975,"score_spread":0.25754372448980584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150464090","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.10661696,0.00007163666,0.8915335,0.0003331809,0.0012581128,0.00010500891,1.576658e-7,0.000047787864,0.000033653363],"genre_scores_gemma":[0.14043966,0.000027074966,0.8594023,0.00007673885,0.000047362737,0.0000017265398,1.7748231e-8,0.0000024619094,0.0000026283558],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988506,0.000016004517,0.000374569,0.000238655,0.0003044625,0.00021574958],"domain_scores_gemma":[0.99843585,0.000062202904,0.00034998948,0.00033629377,0.0007299822,0.00008564695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013788359,0.00008812106,0.00017237868,0.0009581266,0.00017048496,0.00009717765,0.0012954336,0.000092046146,0.0000015433675],"category_scores_gemma":[0.0002833619,0.00006984843,0.00004185804,0.0013698846,0.0004944863,0.0013546611,0.00023998557,0.00014946358,0.0000017553332],"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.000010632452,0.000016904878,0.0005019984,0.0000021781407,0.0000035890555,0.000002405826,0.00017076725,0.0000022778347,0.0012981738,0.26591408,0.000121966914,0.731955],"study_design_scores_gemma":[0.0013729996,0.0019285029,0.007576839,0.00008530004,0.00001465452,0.002751645,0.00005147641,0.11291434,0.06996154,0.79846334,0.004601686,0.0002776717],"about_ca_topic_score_codex":0.0000017329917,"about_ca_topic_score_gemma":3.575803e-7,"teacher_disagreement_score":0.73167735,"about_ca_system_score_codex":0.000034674173,"about_ca_system_score_gemma":0.00027717295,"threshold_uncertainty_score":0.2848336},"labels":[],"label_agreement":null},{"id":"W3158643107","doi":"10.1145/3412841.3442138","title":"Offline monitoring of LTL with bit vectors","year":2021,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Bitmap; Computer science; Extension (predicate logic); Linear temporal logic; Event (particle physics); Throughput; Temporal logic; Programming language; Algorithm; Real-time computing; Theoretical computer science; Artificial intelligence; Operating system","score_opus":0.03018059981207601,"score_gpt":0.2873061213270114,"score_spread":0.2571255215149354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158643107","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.12740119,0.000043929656,0.86640716,0.00009080979,0.0002578571,0.000026071568,1.7270797e-7,0.00005940583,0.005713414],"genre_scores_gemma":[0.21038882,0.000004731559,0.7890081,0.000011961449,0.000026870795,0.0000018158411,2.1120344e-7,0.0000024200406,0.0005550818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995003,0.00003190216,0.00010524136,0.00013393958,0.00014786026,0.000080781065],"domain_scores_gemma":[0.9994124,0.000030421374,0.00004378665,0.00037211005,0.000115460774,0.000025814315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014807981,0.00004215049,0.000068168556,0.00003090133,0.000019805224,0.000020875928,0.00023491375,0.000018100312,0.000013085236],"category_scores_gemma":[0.000050008217,0.000032804444,0.000015079716,0.00038683094,0.00001673962,0.00021873551,0.00007345569,0.000042029278,0.00000735072],"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.000015135562,0.00017746745,0.0498226,0.00008498128,0.00004772111,0.000027422777,0.0011450943,0.0004666908,0.07181902,0.71228886,0.00011403273,0.16399097],"study_design_scores_gemma":[0.000098362914,0.000052998996,0.024283081,0.000020492145,0.0000023121893,0.00001086853,0.000050000544,0.008702615,0.9654364,0.00054505386,0.000731518,0.000066313216],"about_ca_topic_score_codex":0.00000805494,"about_ca_topic_score_gemma":8.65801e-7,"teacher_disagreement_score":0.8936174,"about_ca_system_score_codex":0.000012370789,"about_ca_system_score_gemma":0.00004408922,"threshold_uncertainty_score":0.13377264},"labels":[],"label_agreement":null},{"id":"W3173620164","doi":"10.1109/lics52264.2021.9470662","title":"Fixed-Points for Quantitative Equational Logics","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Formal Methods in Verification","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fixed point; Mathematics; Bounded function; Fixed-point theorem; Metric space; Extension (predicate logic); Fixed-point iteration; Least fixed point; Metric (unit); Convergence (economics); Discrete mathematics; Applied mathematics; Pure mathematics; Algebra over a field; Computer science; Mathematical analysis; Brouwer fixed-point theorem","score_opus":0.17899140283199072,"score_gpt":0.4002243949964254,"score_spread":0.2212329921644347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173620164","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.0005024129,0.00011187023,0.99188304,0.0008979714,0.0019208605,0.00047721664,0.000018455012,0.0001621302,0.004026036],"genre_scores_gemma":[0.0069436533,0.000018555535,0.9917458,0.00046154705,0.0000706429,0.0002101527,0.0001170932,0.00001012856,0.00042239003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983032,0.00017238634,0.0003535104,0.00064731215,0.00032157105,0.00020203521],"domain_scores_gemma":[0.99780905,0.0005012902,0.00024795238,0.0008233666,0.00056425756,0.00005407669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010941182,0.0001809104,0.00023176077,0.000094812676,0.00008875205,0.00032872506,0.001152293,0.000218025,0.000054750235],"category_scores_gemma":[0.0012250794,0.00017367593,0.00015189679,0.00016902418,0.000043912725,0.0003386739,0.0011613076,0.0002674609,0.000035568377],"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.0000040476066,0.0000372681,0.000013331025,0.00006625216,0.000023946033,8.716593e-7,0.00043424932,0.0012344685,0.000084768384,0.98925817,0.00043716564,0.008405482],"study_design_scores_gemma":[0.00012717588,0.00006129318,0.00058453233,0.00004585995,0.000008384822,0.0000026762539,0.00008724591,0.73092026,0.0042357384,0.2626176,0.0010389519,0.00027029056],"about_ca_topic_score_codex":0.000012106403,"about_ca_topic_score_gemma":0.00000633582,"teacher_disagreement_score":0.7296858,"about_ca_system_score_codex":0.000095964344,"about_ca_system_score_gemma":0.0003417153,"threshold_uncertainty_score":0.7082299},"labels":[],"label_agreement":null},{"id":"W3174155805","doi":"10.1145/3464794","title":"The Reachability Problem for Two-Dimensional Vector Addition Systems with States","year":2021,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Montréal; Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Technische Universität München; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Reachability; Unary operation; Bounded function; Mathematics; Reachability problem; Sequence (biology); Discrete mathematics; Path (computing); Combinatorics; Binary number; Computer science; Arithmetic","score_opus":0.024238930255484625,"score_gpt":0.28678470539047834,"score_spread":0.2625457751349937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174155805","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.23625268,0.001548801,0.7102529,0.04441089,0.005907762,0.0012188571,0.000037949758,0.0000628133,0.00030734873],"genre_scores_gemma":[0.13211839,0.000007888131,0.8671897,0.00014055941,0.00025869522,0.00002406404,0.0000014040197,0.000008014844,0.0002512869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885535,0.00029665264,0.00028735265,0.0001010344,0.00034071482,0.00011890968],"domain_scores_gemma":[0.9972925,0.0006329605,0.00044371642,0.0009772425,0.00061811396,0.000035423964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018725013,0.0000600523,0.000102546706,0.000015566136,0.00023451711,0.00014181544,0.0013649373,0.000019858222,0.0000016214276],"category_scores_gemma":[0.0013168423,0.00002711166,0.00007517273,0.00017053458,0.000050040322,0.00031311912,0.0002477887,0.00014661699,0.0000012240076],"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.0017075205,0.0011085948,0.0023828126,0.00065077294,0.0010001914,0.000051730047,0.0055461978,0.18056798,0.07318074,0.45298538,0.13884385,0.14197423],"study_design_scores_gemma":[0.0037482374,0.0020398418,0.027072318,0.001168007,0.00017760413,0.003711649,0.00076740474,0.382921,0.11611104,0.37635148,0.0852822,0.00064922887],"about_ca_topic_score_codex":0.000004843662,"about_ca_topic_score_gemma":0.0000043529794,"teacher_disagreement_score":0.20235303,"about_ca_system_score_codex":0.00008336805,"about_ca_system_score_gemma":0.00018400086,"threshold_uncertainty_score":0.25364158},"labels":[],"label_agreement":null},{"id":"W3176562981","doi":"10.1007/s10009-021-00625-z","title":"What can we monitor over unreliable channels?","year":2021,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","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 Waterloo","funders":"","keywords":"Computer science; Theory of computation; Programming language","score_opus":0.03448311251912821,"score_gpt":0.3164275150670675,"score_spread":0.2819444025479393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176562981","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.029327711,0.00049354817,0.94002974,0.016564839,0.012958457,0.00017604353,0.000028152184,0.00037648526,0.000045005512],"genre_scores_gemma":[0.24351054,0.0026597993,0.7483277,0.0031567293,0.00084564084,0.00018518201,0.000030180034,0.00006243876,0.0012218342],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99813265,0.00005637128,0.00045028544,0.00042901761,0.0005636364,0.0003680177],"domain_scores_gemma":[0.99823,0.00024107385,0.000085026906,0.00045929736,0.00088815694,0.00009645228],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00035793512,0.00021101945,0.00022913024,0.0004709654,0.00018708645,0.001100219,0.0017693393,0.0002926584,0.000068691006],"category_scores_gemma":[0.0006478836,0.00020177558,0.00020282256,0.00043785453,0.000084826264,0.0021953885,0.00009936932,0.0005716575,0.000033402015],"study_design_candidate":"design_other","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.000108520755,0.0002884485,0.0002635565,0.000017799945,0.00029381525,0.00026073863,0.00040908717,0.0006429662,0.0031213216,0.34148744,0.001425052,0.65168124],"study_design_scores_gemma":[0.0037149747,0.00087872334,0.0005867899,0.0008808156,0.00005226684,0.002511211,0.00047988718,0.006154024,0.4653594,0.21142063,0.3070013,0.0009600061],"about_ca_topic_score_codex":0.0000010667176,"about_ca_topic_score_gemma":0.0000025375373,"teacher_disagreement_score":0.65072125,"about_ca_system_score_codex":0.0002436492,"about_ca_system_score_gemma":0.00016834501,"threshold_uncertainty_score":0.99993676},"labels":[],"label_agreement":null},{"id":"W3176592665","doi":"10.1145/3453483.3454089","title":"Phased synthesis of divide and conquer programs","year":2021,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"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":"","keywords":"Divide and conquer algorithms; Computer science; Implementation; Function (biology); Set (abstract data type); Task (project management); Theoretical computer science; Computation; Parallel computing; Algorithm; Computer engineering; Programming language","score_opus":0.03161390019939872,"score_gpt":0.2848018162148728,"score_spread":0.2531879160154741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176592665","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.017104601,0.00007802557,0.9725738,0.00027774659,0.00006790951,0.000054314896,2.752372e-7,0.000052137482,0.009791153],"genre_scores_gemma":[0.42265618,0.000006406306,0.57716984,0.000038429996,0.000004560124,0.000007723579,2.1480064e-7,0.0000013349625,0.00011532462],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999536,0.00006197162,0.000104201295,0.0001344157,0.00009230559,0.000071117865],"domain_scores_gemma":[0.9995075,0.000090165704,0.000035509594,0.00026966556,0.00006933951,0.000027861932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002283644,0.000036569658,0.000072824376,0.000018082992,0.000018862153,0.000036769277,0.00015242139,0.000020637812,0.000017549724],"category_scores_gemma":[0.00018648822,0.000031087187,0.000015365655,0.00015398758,0.000039980212,0.00018232045,0.00005936257,0.000023112845,0.0000036599056],"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.0000014173539,0.000059716105,0.0009816722,0.000022981925,0.000008362331,0.0000019410006,0.00012169919,6.9932344e-7,0.018556371,0.27151978,0.000038665028,0.7086867],"study_design_scores_gemma":[0.00009941115,0.000029377064,0.003171101,0.000018144248,0.0000050414174,0.000013001583,0.000026865926,0.0086590415,0.98103786,0.0031058912,0.003760649,0.000073630355],"about_ca_topic_score_codex":0.0000082260185,"about_ca_topic_score_gemma":0.0000016758897,"teacher_disagreement_score":0.9624815,"about_ca_system_score_codex":0.0000045248717,"about_ca_system_score_gemma":0.000023862534,"threshold_uncertainty_score":0.12676987},"labels":[],"label_agreement":null},{"id":"W3182227832","doi":"10.1109/tac.2021.3094737","title":"Synthesis of Optimal Multiobjective Attack Strategies for Controlled Systems Modeled by Probabilistic Automata","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":24,"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 Toronto","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada","keywords":"Automaton; Probabilistic logic; Computer science; Mathematical optimization; Probabilistic automaton; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.02639574428646195,"score_gpt":0.2915295002899989,"score_spread":0.26513375600353695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182227832","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.008270025,0.00009356123,0.9874101,0.00016662202,0.00070169603,0.0024728593,0.0002187557,0.00045983106,0.00020651103],"genre_scores_gemma":[0.8104001,0.00000623354,0.18687898,0.000032838194,0.000014196125,0.0025082803,0.000002196287,0.000023074617,0.0001340752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715453,0.00056260044,0.0009315888,0.0005445433,0.00043969153,0.00036703883],"domain_scores_gemma":[0.99549663,0.002477545,0.00042015623,0.0009463868,0.00055737834,0.00010189858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008568546,0.00030059484,0.0009095774,0.00016773283,0.00020497521,0.00024189995,0.0005732785,0.00015467351,0.000018341872],"category_scores_gemma":[0.0002932374,0.00027725063,0.00032739446,0.00038498238,0.00009989076,0.00065324164,0.000002936228,0.00013243331,0.000012422471],"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.0005207896,0.0013340268,4.8933185e-7,0.0007189476,0.00095014705,0.0000048018246,0.0010143667,0.91867584,0.017511167,0.016077189,0.00017794536,0.043014303],"study_design_scores_gemma":[0.006280715,0.00023405974,0.000009189511,0.00013421659,0.00025626484,0.000017943945,0.00032033163,0.97354645,0.018640982,0.00028859923,0.000022405036,0.00024882774],"about_ca_topic_score_codex":0.000026470663,"about_ca_topic_score_gemma":0.000006822059,"teacher_disagreement_score":0.8021301,"about_ca_system_score_codex":0.00016886207,"about_ca_system_score_gemma":0.0004578333,"threshold_uncertainty_score":0.999968},"labels":[],"label_agreement":null},{"id":"W3182613696","doi":"10.1007/978-3-030-88885-5_13","title":"Verifying Verified Code","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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 Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Compiler; Reuse; Code (set theory); Semantics (computer science); Model checking; Formal verification; Verification; Software verification; Functional verification; Intelligent verification; Perspective (graphical); Software engineering; Software; Software development; Software construction; Engineering; Set (abstract data type)","score_opus":0.0448862475193956,"score_gpt":0.31948062360021434,"score_spread":0.2745943760808187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182613696","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.023929846,0.00048100526,0.9662666,0.00055568747,0.00800371,0.00036470708,0.0000029467712,0.00033306913,0.000062478626],"genre_scores_gemma":[0.39771703,0.000027781653,0.6013677,0.00064829784,0.00019435897,0.000026239391,0.0000045892452,0.000013417647,5.676445e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948095,0.00030694617,0.0006392907,0.0022483908,0.0011365286,0.00085935235],"domain_scores_gemma":[0.9956253,0.00031353475,0.0003384811,0.0031653417,0.00036750187,0.00018984507],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023878214,0.00048176604,0.0005506399,0.00064188556,0.0002923508,0.0018917125,0.0064997366,0.00040782735,0.000009193271],"category_scores_gemma":[0.0007097087,0.00049336586,0.00015021801,0.0026543967,0.00050050596,0.0010827492,0.007052349,0.001562908,0.000016508873],"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.000005148118,0.00008251547,0.00036328062,0.00013160572,0.000010237687,0.00008431634,0.0033261294,0.29547954,0.0034202354,0.0022020268,0.000005845305,0.6948891],"study_design_scores_gemma":[0.00016118871,0.00004340378,0.0027069822,0.0002915394,0.000004173272,0.000045660683,0.0000010710487,0.9345693,0.049157888,0.012394441,0.00007575096,0.0005486273],"about_ca_topic_score_codex":0.00007489457,"about_ca_topic_score_gemma":0.000044310225,"teacher_disagreement_score":0.6943405,"about_ca_system_score_codex":0.00049349567,"about_ca_system_score_gemma":0.0012799485,"threshold_uncertainty_score":0.9997518},"labels":[],"label_agreement":null},{"id":"W3184919107","doi":"10.1007/978-3-030-81685-8_29","title":"Effective Hybrid System Falsification Using Monte Carlo Tree Search Guided by QB-Robustness","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":36,"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 Alberta","funders":"JST-Mirai Program; Exploratory Research for Advanced Technology; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Robustness (evolution); Computer science; Tree traversal; Scalability; Computation; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.041068489676639376,"score_gpt":0.3003669894834916,"score_spread":0.2592984998068522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184919107","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.0024506138,0.000897541,0.9914581,0.00013578603,0.0026230542,0.0010878573,0.000017048264,0.00028632168,0.0010436696],"genre_scores_gemma":[0.16458395,0.000025148747,0.83450943,0.00015536467,0.00038439178,0.00004106267,0.000012470305,0.000059797254,0.00022835721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938552,0.00036930732,0.0008690912,0.002388818,0.0016616946,0.00085589767],"domain_scores_gemma":[0.99521977,0.00057712273,0.00051377417,0.002518785,0.000939573,0.00023096382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028834057,0.0006942523,0.0008043412,0.00084118405,0.00048055648,0.00094942265,0.0039962362,0.000380312,0.0000046841697],"category_scores_gemma":[0.00022811066,0.00069335266,0.0001932704,0.0011603731,0.0006588476,0.001119639,0.0014338129,0.0010267387,0.000016800266],"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.000010471405,0.00006103582,0.000021288604,0.00030120384,0.000034734712,0.00011973074,0.0006748031,0.31952372,0.0053286254,0.017771466,0.000046682133,0.65610623],"study_design_scores_gemma":[0.0002830347,0.00011020289,0.00005712952,0.0007276792,0.000017610557,0.0002805852,0.0000012669833,0.96718717,0.029612549,0.00083275756,0.00019939424,0.00069062714],"about_ca_topic_score_codex":0.0001232559,"about_ca_topic_score_gemma":0.000015381132,"teacher_disagreement_score":0.6554156,"about_ca_system_score_codex":0.0017485721,"about_ca_system_score_gemma":0.0007135888,"threshold_uncertainty_score":0.9995518},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W3185895498","doi":"10.1007/978-3-030-81685-8_39","title":"Counterexample-Guided Partial Bounding for Recursive Function Synthesis","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"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":"","keywords":"Recursion (computer science); Bounding overwatch; Counterexample; Computer science; μ operator; Function (biology); Primitive recursive function; Set (abstract data type); Recursive functions; Context (archaeology); Algorithm; Theoretical computer science; Mathematics; Discrete mathematics; Programming language","score_opus":0.06086517328587813,"score_gpt":0.3070521637342828,"score_spread":0.24618699044840467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185895498","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.000048259193,0.0002753367,0.99081534,0.00041684252,0.0062631187,0.00065100746,0.0000128913525,0.00016846193,0.0013487206],"genre_scores_gemma":[0.010991931,0.000035937974,0.9867649,0.00088534824,0.0008970559,0.000094294315,0.0000128227,0.000043973792,0.0002737279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957708,0.000092808536,0.00069014065,0.001801703,0.0009209265,0.00072362367],"domain_scores_gemma":[0.9958285,0.0013256231,0.00049274374,0.0015899844,0.000609464,0.00015368189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022315215,0.0005039295,0.00058175105,0.00063159945,0.00046238938,0.0009116868,0.0024613484,0.00039725265,0.000033428936],"category_scores_gemma":[0.0010945905,0.00050928,0.00021111257,0.000605991,0.0004900546,0.0009646482,0.00073450326,0.0005437701,0.00002299491],"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.000024027777,0.000027916507,0.000012524476,0.00009933509,0.000028577862,0.000018579733,0.0005319452,0.005730994,0.0006024492,0.35626844,0.000097845834,0.6365574],"study_design_scores_gemma":[0.00035701177,0.00032432735,0.00008586821,0.00091550016,0.000052230975,0.00012321195,8.682759e-7,0.69594973,0.021560954,0.2613383,0.018132554,0.0011594663],"about_ca_topic_score_codex":0.000013589556,"about_ca_topic_score_gemma":0.000021520276,"teacher_disagreement_score":0.69021875,"about_ca_system_score_codex":0.0006475075,"about_ca_system_score_gemma":0.0007117408,"threshold_uncertainty_score":0.9997359},"labels":[],"label_agreement":null},{"id":"W3189524441","doi":"10.24963/ijcai.2021/643","title":"Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract)","year":2021,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"","keywords":"Maximum satisfiability problem; Boolean satisfiability problem; Solver; Satisfiability; Set (abstract data type); Computer science; Conjunctive normal form; Theoretical computer science; Core (optical fiber); Mathematical optimization; Algorithm; Mathematics; Programming language; Boolean function","score_opus":0.04543824220183446,"score_gpt":0.32736721620317927,"score_spread":0.2819289740013448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189524441","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56345886,0.00019976082,0.36303,0.0008988067,0.0009533017,0.00023484281,0.000003793115,0.00046298746,0.07075766],"genre_scores_gemma":[0.5993398,0.000011091294,0.4002221,0.00022040852,0.000034846544,0.000007091165,0.0000032218857,0.000007242501,0.000154218],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9984138,0.000051230327,0.00043569412,0.00045872363,0.00026495068,0.0003755798],"domain_scores_gemma":[0.99880666,0.00020859115,0.00013406051,0.0006762936,0.00009779355,0.00007658001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008924829,0.00013871044,0.00016985649,0.000108249034,0.00008892055,0.00024183077,0.0006323375,0.00008980401,0.000169506],"category_scores_gemma":[0.0003727522,0.00013740252,0.000057960508,0.00045183973,0.000025968215,0.000845793,0.00027216395,0.00026060757,0.000105241794],"study_design_candidate":"observational","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.000013148357,0.00022791636,0.0073612793,0.00014777273,0.000027692495,0.00033222625,0.0026508577,0.0007558249,0.18718734,0.30271137,0.0012449287,0.49733964],"study_design_scores_gemma":[0.0003363868,0.000021496791,0.812528,0.00007843117,0.0000027829337,0.0000825519,0.00040176965,0.04938853,0.12500021,0.010567038,0.00121898,0.00037381353],"about_ca_topic_score_codex":0.00013017141,"about_ca_topic_score_gemma":0.00007718267,"teacher_disagreement_score":0.8051667,"about_ca_system_score_codex":0.00008759029,"about_ca_system_score_gemma":0.00011053997,"threshold_uncertainty_score":0.5603112},"labels":[],"label_agreement":null},{"id":"W3193574081","doi":"","title":"The reachability problem for two-dimensional vector addition systems with states","year":2021,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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 Montréal; Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Engineering and Physical Sciences Research Council; Université Paris-Saclay; Natural Sciences and Engineering Research Council of Canada; Technische Universität München; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Reachability; Unary operation; Bounded function; Reachability problem; Sequence (biology); Mathematics; Discrete mathematics; Path (computing); Combinatorics; Binary number; Key (lock); Computer science; Arithmetic","score_opus":0.031998113646144244,"score_gpt":0.27340417990446264,"score_spread":0.2414060662583184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193574081","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.052465197,0.00008546425,0.93251616,0.0025082505,0.000178513,0.0015562968,0.00054540107,0.00015633882,0.009988398],"genre_scores_gemma":[0.13734387,0.00035620102,0.8555697,0.000023002827,0.00006848275,0.0000047903777,0.0003939908,0.000029422032,0.006210517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963568,0.0011631898,0.00017429987,0.0007043751,0.00091865816,0.00068266224],"domain_scores_gemma":[0.995333,0.001634529,0.00021851913,0.0010124693,0.0015487728,0.0002526763],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021443195,0.0001860825,0.00028453942,0.00029894518,0.0020207192,0.00012150905,0.0018057912,0.00007897354,0.000020710631],"category_scores_gemma":[0.0001888648,0.00018037648,0.0001543323,0.0011543403,0.0010216521,0.0010896565,0.0010639923,0.00048085308,0.0000043140003],"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.002870933,0.0005832307,0.0013719558,0.0004792932,0.0003907039,0.00020863341,0.004067589,0.006153471,0.0034033544,0.9351984,0.008681741,0.03659069],"study_design_scores_gemma":[0.004319451,0.0021546648,0.009071486,0.00031958913,0.00007530454,0.0000820288,0.016831469,0.38855857,0.0012828615,0.025831128,0.55074435,0.0007291077],"about_ca_topic_score_codex":0.0004978302,"about_ca_topic_score_gemma":0.00087984314,"teacher_disagreement_score":0.90936726,"about_ca_system_score_codex":0.00035619785,"about_ca_system_score_gemma":0.00078663917,"threshold_uncertainty_score":0.9992785},"labels":[],"label_agreement":null},{"id":"W3196034421","doi":"10.1007/978-3-030-85037-1_5","title":"Closing the Gap Between Discrete Abstractions and Continuous Control: Completeness via Robustness and Controllability","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"Controllability; Temporal logic; Reachability; Decidability; Linear temporal logic; Computer science; Completeness (order theory); Robustness (evolution); Control theory (sociology); Nonlinear system; Abstraction; Nonlinear control; Bisimulation; Control system; Theoretical computer science; Mathematics; Control (management); Artificial intelligence; Applied mathematics","score_opus":0.03050971816796247,"score_gpt":0.28087853149942305,"score_spread":0.25036881333146055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196034421","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.0015094242,0.0009624532,0.99370825,0.0016663522,0.0010054008,0.0006699331,0.000023287475,0.000100798585,0.00035410508],"genre_scores_gemma":[0.58388054,0.00004146148,0.4152309,0.00043099088,0.00033601405,0.000017388556,0.000005911925,0.00002413053,0.000032677246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640566,0.00022575032,0.00067751564,0.0014475544,0.00069323624,0.00055027206],"domain_scores_gemma":[0.9955205,0.0020621063,0.0004469456,0.0014023931,0.00039429712,0.00017376],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024565016,0.00048727042,0.000797223,0.00025604575,0.0007188064,0.0010694368,0.001626844,0.00029266658,0.0000060771954],"category_scores_gemma":[0.00027543367,0.0003737774,0.000096967015,0.00036018013,0.001968033,0.00073000434,0.0009119849,0.00094697106,0.0000022726113],"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.000021335725,0.000025981193,0.0014435154,0.00011412116,0.00006280267,0.000038656854,0.00069125515,0.023436237,0.0007065365,0.048666235,0.0000031030518,0.9247902],"study_design_scores_gemma":[0.00080729,0.00011115083,0.013133595,0.00026235433,0.000062793675,0.00022998377,0.0000016598225,0.91683125,0.00054945674,0.06674525,0.0005000738,0.0007651364],"about_ca_topic_score_codex":0.00005082168,"about_ca_topic_score_gemma":0.00005900782,"teacher_disagreement_score":0.92402506,"about_ca_system_score_codex":0.00015638227,"about_ca_system_score_gemma":0.00024216004,"threshold_uncertainty_score":0.9999676},"labels":[],"label_agreement":null},{"id":"W3199168874","doi":"10.1016/j.ifacol.2021.08.470","title":"ROCS 2.0: An Integrated Temporal Logic Control Synthesis Tool for Nonlinear Dynamical Systems","year":2021,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Waterloo","funders":"","keywords":"Reachability; Linear temporal logic; Computer science; Abstraction; Temporal logic; Kernel (algebra); Automaton; Nonlinear system; Control logic; Control (management); Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Discrete mathematics","score_opus":0.030082861777503214,"score_gpt":0.29987301285897794,"score_spread":0.26979015108147475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199168874","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.028803488,0.0002062855,0.9674454,0.0012031078,0.0009814803,0.0005682281,0.0003148526,0.00037994125,0.00009723626],"genre_scores_gemma":[0.05630609,0.000012307694,0.9421631,0.0004991782,0.00031453712,0.00016792002,0.00020468721,0.000031218562,0.00030094475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973168,0.00045236215,0.0005923324,0.000772709,0.00037755416,0.0004882439],"domain_scores_gemma":[0.9976127,0.0004995589,0.00021379707,0.0009808792,0.00051728694,0.00017573446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010055042,0.00030514412,0.00050484104,0.00010113149,0.00018675186,0.00030487284,0.0009397426,0.00024273114,0.000026575253],"category_scores_gemma":[0.0014851844,0.00026432716,0.00017548806,0.0005199609,0.00007974526,0.00067031506,0.00009658984,0.0002612727,0.00004028829],"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.0012806373,0.0047403183,0.0038909193,0.0012168268,0.0008904788,0.0005404901,0.002026138,0.021942709,0.11227967,0.3134132,0.0001517976,0.5376268],"study_design_scores_gemma":[0.00067659176,0.00020532048,0.0004068127,0.000059346945,0.000039239836,0.000079996564,0.00020618987,0.9921751,0.0024192089,0.0001754553,0.0031931344,0.00036360396],"about_ca_topic_score_codex":0.000055329907,"about_ca_topic_score_gemma":0.0000333703,"teacher_disagreement_score":0.97023237,"about_ca_system_score_codex":0.0001614394,"about_ca_system_score_gemma":0.00026707252,"threshold_uncertainty_score":0.99998087},"labels":[],"label_agreement":null},{"id":"W3203056386","doi":"10.4230/lipics.time.2021.5","title":"Model Checking of Stream Processing Pipelines","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Alpen-Adria-Universität Klagenfurt; LOEWE Zentrum AdRIA","keywords":"Computer science; Pipeline transport; Stream processing; Programming language; Model checking; Extension (predicate logic); Set (abstract data type); Computation; Distributed computing; Engineering","score_opus":0.0477818302484747,"score_gpt":0.31496843515858736,"score_spread":0.26718660491011265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203056386","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.04286149,0.00010823139,0.95163643,0.00015644962,0.00044400347,0.00038031515,0.00008346515,0.00018533015,0.004144265],"genre_scores_gemma":[0.3144772,0.000025211995,0.6848302,0.00028542112,0.00006036016,0.00004162984,0.00008090006,0.00002256288,0.00017652287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973162,0.0000428942,0.0012630866,0.0002968738,0.00054446,0.00053648563],"domain_scores_gemma":[0.9972583,0.00007094825,0.00068602525,0.00096597394,0.0008895533,0.00012916616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007894985,0.00029447334,0.00042562056,0.00019926978,0.00023224649,0.00031596122,0.0011589224,0.00018527394,0.000006797886],"category_scores_gemma":[0.00031705538,0.0002823039,0.00019997737,0.0005946378,0.000099092314,0.0026906077,0.00049684825,0.00028136792,0.000016831053],"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.00014396122,0.0013946154,0.0049582436,0.006078616,0.0002498122,0.00001240464,0.046767388,0.022892907,0.007575996,0.2930745,0.0020312318,0.61482036],"study_design_scores_gemma":[0.00080909947,0.00005764543,0.00017992599,0.00021209326,0.0000203269,0.000040632785,0.0006242603,0.9516626,0.040221624,0.0031935407,0.0026630496,0.00031517143],"about_ca_topic_score_codex":0.0000036784606,"about_ca_topic_score_gemma":0.0000046974587,"teacher_disagreement_score":0.9287697,"about_ca_system_score_codex":0.00008677561,"about_ca_system_score_gemma":0.00035084266,"threshold_uncertainty_score":0.9999629},"labels":[],"label_agreement":null},{"id":"W3204801610","doi":"10.1109/access.2021.3117852","title":"A Deployment Framework for Formally Verified Human-Robot Interactions","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Executable; Computer science; Software deployment; Robot; Middleware (distributed applications); Model transformation; Virtual machine; Model checking; Automaton; Distributed computing; Human–computer interaction; Software engineering; Artificial intelligence; Programming language","score_opus":0.15072343457352236,"score_gpt":0.4455941808762787,"score_spread":0.29487074630275634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204801610","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.012213078,0.000037301656,0.9830698,0.0005019839,0.0025959264,0.00024819977,0.000003563354,0.00019350105,0.001136647],"genre_scores_gemma":[0.211717,0.000007908051,0.786869,0.0007462324,0.0001840229,0.00021660113,0.0000052581213,0.000013593467,0.00024042295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988138,0.00006909087,0.00028573404,0.00036635925,0.00019398467,0.00027103367],"domain_scores_gemma":[0.99859005,0.00018741182,0.0001374157,0.00078941154,0.00022108723,0.000074604606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027277722,0.00012120935,0.00014289423,0.000077120865,0.00026342698,0.00052261824,0.0012229596,0.00007109356,0.00003318008],"category_scores_gemma":[0.00019410795,0.00012616305,0.00009478144,0.0004029557,0.00002408312,0.0017221943,0.00022867753,0.00018528184,0.000027382197],"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.000025594089,0.00025747603,0.0002599418,0.00008575765,0.000067733214,0.000013777603,0.00081852113,0.0009608646,0.024592958,0.90527064,0.0026745102,0.06497222],"study_design_scores_gemma":[0.00068388414,0.00014180697,0.006386451,0.00015006273,0.00003442846,0.000052699947,0.0000744082,0.047659475,0.7435854,0.16499592,0.035654932,0.0005805067],"about_ca_topic_score_codex":0.000012661299,"about_ca_topic_score_gemma":0.000021251899,"teacher_disagreement_score":0.7402747,"about_ca_system_score_codex":0.0000791166,"about_ca_system_score_gemma":0.00008381189,"threshold_uncertainty_score":0.514478},"labels":[],"label_agreement":null},{"id":"W3208505901","doi":"10.48550/arxiv.2110.14187","title":"An Experimental Study of Permanently Stored Learned Clauses","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","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":"Simon Fraser University","funders":"","keywords":"Computer science; Limiting; Heuristic; Scheme (mathematics); Centrality; Binary number; Parallel computing; Arithmetic; Theoretical computer science; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.16175536938316426,"score_gpt":0.2717542089286544,"score_spread":0.10999883954549011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208505901","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79794335,0.000046727368,0.2007366,0.0000038616045,0.0005009319,0.00031172897,0.0000026509115,0.0001354589,0.00031869364],"genre_scores_gemma":[0.97647905,0.000017320108,0.023277543,0.00001620967,0.00003289791,0.0000020964333,0.000012810188,0.00001597257,0.00014612573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976309,0.0006120021,0.00029479442,0.001076219,0.00016438673,0.00022168171],"domain_scores_gemma":[0.9972481,0.000037166123,0.0003621807,0.0020353668,0.00019196936,0.00012518185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036749916,0.0002523153,0.0003588893,0.00022658572,0.00011410491,0.000116211304,0.0021737432,0.00019059291,0.000036548063],"category_scores_gemma":[0.000031137002,0.00031053778,0.00012261127,0.00047145318,0.000092860064,0.0007307569,0.0015442471,0.00040839962,0.00000977012],"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.0004595987,0.023171801,0.074007265,0.0004458983,0.00072144764,0.0015294465,0.06230481,0.5596059,0.03550266,0.23855868,0.00010576624,0.0035867668],"study_design_scores_gemma":[0.0023440812,0.002138908,0.022974242,0.00011283443,0.00017876523,0.000013729429,0.030490475,0.89761513,0.04133435,0.0013367964,0.00008798128,0.0013727047],"about_ca_topic_score_codex":0.00025594406,"about_ca_topic_score_gemma":0.00003075094,"teacher_disagreement_score":0.33800927,"about_ca_system_score_codex":0.00018895422,"about_ca_system_score_gemma":0.00013274973,"threshold_uncertainty_score":0.9999347},"labels":[],"label_agreement":null},{"id":"W3210848544","doi":"10.1109/rew53955.2021.00010","title":"Dash+: Extending Alloy with Hierarchical States and Replicated Processes for Modelling Transition Systems","year":2021,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dash; Computer science; Extension (predicate logic); Programming language; Theoretical computer science","score_opus":0.039119254946668604,"score_gpt":0.28387028864653857,"score_spread":0.24475103369986997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210848544","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.023895074,0.00025564505,0.97477394,0.00046245128,0.000048254133,0.00024637926,0.0000033478993,0.00016803197,0.00014685748],"genre_scores_gemma":[0.22058338,0.00010696011,0.77905405,0.0000619571,0.000019180312,0.000078767,0.000014173235,0.000007952422,0.000073616065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990943,0.00005530876,0.00017432253,0.00039218512,0.00012079173,0.00016308729],"domain_scores_gemma":[0.99924254,0.00014157515,0.00004980871,0.00027157762,0.00023818914,0.000056298202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035507383,0.00008559913,0.00011683338,0.000043276523,0.00012129526,0.0002158161,0.00015322353,0.000037864684,7.144956e-7],"category_scores_gemma":[0.000043562093,0.00006805565,0.000012568565,0.00030704017,0.000031337255,0.0005232353,0.000026457763,0.00006135765,5.061187e-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.00011544073,0.00014014757,0.000093702394,0.0015257909,0.000059049748,0.000012568736,0.0036600179,0.23658583,0.012413733,0.726321,0.00006765157,0.019005088],"study_design_scores_gemma":[0.00018590374,0.0000788068,0.000027560434,0.0000660971,0.0000067616033,0.00006938605,0.00011934042,0.9820756,0.013641932,0.0032590134,0.00035850442,0.00011112112],"about_ca_topic_score_codex":0.000013000476,"about_ca_topic_score_gemma":0.0000025415943,"teacher_disagreement_score":0.7454897,"about_ca_system_score_codex":0.000016621458,"about_ca_system_score_gemma":0.00007114387,"threshold_uncertainty_score":0.27752286},"labels":[],"label_agreement":null},{"id":"W3216032196","doi":"10.1093/biosci/biab113","title":"Aversive Conditioning","year":2021,"lang":"en","type":"article","venue":"BioScience","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"World Federation of Science Journalists","funders":"","keywords":"Conditioning; Psychology; Environmental science; Mathematics; Statistics","score_opus":0.02606369266787169,"score_gpt":0.28599850519225367,"score_spread":0.259934812524382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216032196","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.0092342915,0.000039973635,0.9797783,0.00044026965,0.00068798,0.000028092129,9.612132e-7,0.0000815096,0.009708648],"genre_scores_gemma":[0.32259932,0.0000058528863,0.6764341,0.0005445421,0.000018746485,0.0000028326915,7.075363e-7,0.0000012545498,0.0003926539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928236,0.000048445425,0.00007773631,0.00025621263,0.00019331722,0.00014191076],"domain_scores_gemma":[0.9994212,0.000033794062,0.000040167488,0.00035552532,0.000100659054,0.00004867372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023712432,0.000041274492,0.00004203536,0.00003529687,0.00016139657,0.00012633149,0.000527538,0.000020455163,0.00002849683],"category_scores_gemma":[0.00029239466,0.000041636333,0.000020037733,0.0006471353,0.00008180206,0.0006677793,0.00017062736,0.00004540483,0.00013270968],"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":[3.0357816e-7,0.000017363134,0.0002681454,0.0000030875644,0.0000010500963,0.000018955974,0.00032108335,0.000024852468,0.07323116,0.9154573,0.00044514396,0.010211561],"study_design_scores_gemma":[0.00016630777,0.000046296715,0.02734844,0.00002279698,0.0000022660008,0.000132755,0.0001720773,0.07382088,0.86073726,0.012116912,0.025171096,0.00026292464],"about_ca_topic_score_codex":0.000002007023,"about_ca_topic_score_gemma":4.77117e-7,"teacher_disagreement_score":0.9033404,"about_ca_system_score_codex":0.000030493065,"about_ca_system_score_gemma":0.00011111949,"threshold_uncertainty_score":0.17057587},"labels":[],"label_agreement":null},{"id":"W3216294916","doi":"10.4230/lipics.isaac.2021.61","title":"Dynamic Boolean Formula Evaluation.","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Computer science; Boolean function; Theoretical computer science; Algorithm","score_opus":0.027566407644740696,"score_gpt":0.32531156849104576,"score_spread":0.29774516084630503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216294916","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.029081829,0.00015253016,0.95526373,0.0004859836,0.0019160231,0.0011736224,0.00013368357,0.00034013664,0.011452438],"genre_scores_gemma":[0.21039066,0.00004982091,0.78649247,0.0014259167,0.00008319342,0.0002884485,0.0005797826,0.00004549023,0.000644223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630165,0.00014524814,0.0012619557,0.00044172074,0.0010602839,0.00078911544],"domain_scores_gemma":[0.99621266,0.00014996002,0.0005193962,0.0017754572,0.0011161654,0.00022633652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021725371,0.00038431984,0.00040730677,0.00026150013,0.0004411274,0.00065802474,0.0015449723,0.00024666043,0.000078430545],"category_scores_gemma":[0.0006340362,0.00038022784,0.00028916518,0.00071020203,0.0000926888,0.0034060008,0.0006060548,0.0004082095,0.0003107829],"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.00010983486,0.0009707429,0.0016348651,0.0012088389,0.00045447014,0.000019909583,0.01989094,0.0025525594,0.0011562062,0.41703662,0.00886932,0.5460957],"study_design_scores_gemma":[0.0020737415,0.00013370407,0.0013559749,0.00009268707,0.000049040296,0.00013738952,0.0006293926,0.92312443,0.004603452,0.00742251,0.0598244,0.00055328856],"about_ca_topic_score_codex":0.000004190314,"about_ca_topic_score_gemma":0.000014057934,"teacher_disagreement_score":0.92057186,"about_ca_system_score_codex":0.00037701012,"about_ca_system_score_gemma":0.00035317094,"threshold_uncertainty_score":0.99986494},"labels":[],"label_agreement":null},{"id":"W33428999","doi":"10.1007/978-0-387-69216-6_6","title":"Error Correcting Codes","year":2008,"lang":"en","type":"book-chapter","venue":"Springer undergraduate texts in mathematics and technology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.03344220089378232,"score_gpt":0.2741468096142923,"score_spread":0.24070460872050997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33428999","genre_codex":"other","genre_gemma":"methods","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.00092018733,0.0033174097,0.4725359,0.0024961636,0.0010952957,0.0009884675,0.0000067847045,0.0015515968,0.5170882],"genre_scores_gemma":[0.009718256,0.0023756106,0.9328861,0.00004238963,0.000038526498,0.000035579775,0.0000028890488,0.000080795544,0.054819804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981431,0.000015217814,0.00061294815,0.0006141268,0.00025332026,0.00036131614],"domain_scores_gemma":[0.9982313,0.0001523091,0.0004579135,0.0010245176,0.00008150245,0.000052472697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044473735,0.0003854524,0.00058075093,0.0009080808,0.0001382452,0.00006567033,0.00093041087,0.0006772001,0.000007614066],"category_scores_gemma":[0.0001752808,0.0003852214,0.000053280546,0.00021948216,0.0003446267,0.00014101133,0.00067042,0.0008785754,0.000066500485],"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":[7.500392e-7,0.000027044995,0.000017094337,0.00010572689,0.000022274005,0.000038859576,0.00017730685,0.0000033006809,0.00003331189,0.93684864,0.00010341969,0.06262227],"study_design_scores_gemma":[0.00019233562,0.00007143235,0.000012584909,0.00039432207,0.000014903301,0.0004038298,0.000024707162,0.017805304,0.0005392124,0.96151376,0.01853116,0.00049646146],"about_ca_topic_score_codex":0.0000040110385,"about_ca_topic_score_gemma":0.000020311212,"teacher_disagreement_score":0.46226838,"about_ca_system_score_codex":0.0001020786,"about_ca_system_score_gemma":0.000064204025,"threshold_uncertainty_score":0.99986},"labels":[],"label_agreement":null},{"id":"W35494892","doi":"10.1007/978-1-4471-5260-6_7","title":"EB2ALL: An Automatic Code Generation Tool","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Computer science; Programming language; Code generation; Software engineering; Automatic programming; Java; Code (set theory); Operating system; Set (abstract data type)","score_opus":0.07951010754001533,"score_gpt":0.2980396298809087,"score_spread":0.21852952234089337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35494892","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.000035435856,0.000024034407,0.63104075,0.00006931928,0.00052972505,0.00027458524,0.0000020211737,0.00041170465,0.36761245],"genre_scores_gemma":[0.000092311406,0.000014794949,0.67473686,0.00032576657,0.00019381601,0.000026109567,0.000025656216,0.000022888531,0.32456177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998443,0.000050679886,0.00041777175,0.0005262266,0.0003792497,0.00018304169],"domain_scores_gemma":[0.9980734,0.000027376005,0.00023483102,0.0014340307,0.00014743002,0.00008294686],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00043903396,0.0002542717,0.00022671353,0.00013558893,0.000093266724,0.00034186122,0.0010195101,0.00028430572,0.0011963644],"category_scores_gemma":[0.000032356307,0.00022973306,0.00006861802,0.000032790405,0.000039845567,0.0011585907,0.00015965616,0.00020056964,0.0022589695],"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":[1.5275403e-7,0.000006043459,1.7106383e-7,0.000011350491,0.00000740831,9.284728e-7,0.00005930643,0.000014681585,0.00021360206,0.824302,0.0031848855,0.17219946],"study_design_scores_gemma":[0.0000672435,0.0000884657,0.000033657412,0.000022755674,0.0000102618005,0.00001521949,9.916718e-7,0.8815783,0.0007028264,0.047216408,0.069884904,0.0003789252],"about_ca_topic_score_codex":0.000011295936,"about_ca_topic_score_gemma":0.00001058625,"teacher_disagreement_score":0.88156366,"about_ca_system_score_codex":0.000093465555,"about_ca_system_score_gemma":0.000082974046,"threshold_uncertainty_score":0.9997167},"labels":[],"label_agreement":null},{"id":"W357044489","doi":"","title":"Improvements on handling design errors in communication protocols.","year":2005,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.06736609366608098,"score_gpt":0.3007636642854378,"score_spread":0.23339757061935684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W357044489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72498864,0.000052263473,0.26449567,0.0014086385,0.00010190736,0.005910703,0.0000055180453,0.00019956884,0.0028370772],"genre_scores_gemma":[0.56363505,0.000008062391,0.43583682,0.00011535655,0.000012907896,0.000028265395,0.000004162378,0.000010433091,0.00034895304],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.997864,0.0005957026,0.0002742945,0.00045315974,0.0004756954,0.00033712323],"domain_scores_gemma":[0.9980937,0.00012985323,0.0003248202,0.0012116286,0.00012935305,0.000110640496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002283114,0.0001801193,0.00023683654,0.00041279706,0.0003621104,0.000058011905,0.0021306758,0.00017970486,0.000049066864],"category_scores_gemma":[0.00016608817,0.0002267759,0.00008687074,0.00069986546,0.000117268355,0.0020486321,0.00050380366,0.0004668912,0.0001455871],"study_design_candidate":"observational","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.003080637,0.0038415778,0.1338851,0.000413632,0.00023885386,0.00006327233,0.03953792,0.026020503,0.13101488,0.07890525,0.00090685114,0.5820915],"study_design_scores_gemma":[0.009762989,0.0014949838,0.62017095,0.0011485751,0.000045070006,0.000019478046,0.0013729053,0.15815024,0.18628949,0.0074681407,0.012424429,0.0016527519],"about_ca_topic_score_codex":0.000057925336,"about_ca_topic_score_gemma":0.0001188979,"teacher_disagreement_score":0.5804388,"about_ca_system_score_codex":0.0003782777,"about_ca_system_score_gemma":0.000089104935,"threshold_uncertainty_score":0.9247653},"labels":[],"label_agreement":null},{"id":"W37002918","doi":"10.1609/aaai.v28i1.9124","title":"Maximum Satisfiability Using Core-Guided MaxSAT Resolution","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":120,"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":"","keywords":"Maximum satisfiability problem; Boolean satisfiability problem; Solver; Resolution (logic); Satisfiability; Inference; Algorithm; Computer science; Sequence (biology); Core (optical fiber); Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.2078896805235524,"score_gpt":0.3593631138283615,"score_spread":0.1514734333048091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37002918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28702807,0.000007614851,0.6999476,0.0009941091,0.0008353591,0.00047596902,0.0000024958629,0.0001464716,0.010562324],"genre_scores_gemma":[0.7929964,0.0000060680213,0.20673646,0.00013388346,0.00006386071,0.000012982483,2.5367484e-7,0.000009912519,0.000040139344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976969,0.00006792978,0.000647489,0.0005929951,0.0006106527,0.000384074],"domain_scores_gemma":[0.99784225,0.000113886,0.0005798216,0.0006407119,0.0007281376,0.000095169955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021198962,0.00022896928,0.00027274303,0.0001315885,0.00028117752,0.00021023552,0.0021947701,0.00012842119,0.000034017],"category_scores_gemma":[0.0018066892,0.00018278224,0.000116343464,0.00079125876,0.00040189456,0.00063869765,0.00046516213,0.00030253493,0.00005514144],"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.000025283747,0.000055919016,0.0004470625,0.000034421533,0.000004543465,4.6221494e-8,0.00037766478,0.00022626018,0.062158365,0.8781496,0.000051450323,0.058469333],"study_design_scores_gemma":[0.000014569825,0.00008282631,0.00065503904,0.00007613478,0.000006152618,0.00000441166,0.000056325003,0.43791476,0.2584613,0.302513,0.000081160324,0.00013431127],"about_ca_topic_score_codex":0.000078025834,"about_ca_topic_score_gemma":0.0000047941535,"teacher_disagreement_score":0.5756366,"about_ca_system_score_codex":0.00012895241,"about_ca_system_score_gemma":0.00008551262,"threshold_uncertainty_score":0.74536437},"labels":[],"label_agreement":null},{"id":"W376991050","doi":"10.1007/s100090100043","title":"A light-weight framework for hardware verification","year":2001,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"Computer science; Gas meter prover; Automated theorem proving; Mathematical proof; Correctness; Domain (mathematical analysis); Programming language; Theory of computation; Formal verification; Formal proof; Automated reasoning; Formal methods; Rule of inference; First-order logic; Theoretical computer science; Mathematics","score_opus":0.03967065511286106,"score_gpt":0.32750380026130743,"score_spread":0.2878331451484464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W376991050","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.0066093924,0.000114114206,0.9744054,0.014522273,0.0030548882,0.00055481517,0.000038148566,0.0005990602,0.00010191625],"genre_scores_gemma":[0.080993645,0.0001892017,0.9166889,0.0010642816,0.00046618446,0.00041876527,0.000019232892,0.000036761237,0.00012302843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807435,0.000041482966,0.0005611881,0.00047033015,0.00046763482,0.000384983],"domain_scores_gemma":[0.9978767,0.0004034957,0.0001416274,0.0005370438,0.00094999257,0.00009115763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005655546,0.00023431332,0.00024080892,0.00065052503,0.00027598135,0.0003905551,0.0024119443,0.00042612944,0.0000315912],"category_scores_gemma":[0.0016563925,0.00021648029,0.0002642422,0.00041945427,0.000057668065,0.0011775708,0.000044537963,0.00052053126,0.00004255216],"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.00021636837,0.00012493311,0.00019547968,0.000006803111,0.00010018201,0.000012975093,0.00010644215,0.000047235164,0.0009040969,0.7022271,0.00047471985,0.29558364],"study_design_scores_gemma":[0.0016698532,0.00081061496,0.00057950226,0.00018283601,0.00003199063,0.00063332374,0.000040404368,0.0026191715,0.050310638,0.40612015,0.5365542,0.0004472996],"about_ca_topic_score_codex":3.6628006e-7,"about_ca_topic_score_gemma":6.698112e-7,"teacher_disagreement_score":0.5360795,"about_ca_system_score_codex":0.00023035768,"about_ca_system_score_gemma":0.00009396612,"threshold_uncertainty_score":0.88278097},"labels":[],"label_agreement":null},{"id":"W381873492","doi":"10.1016/j.scico.2015.05.007","title":"Implementability of requirements in the four-variable model","year":2015,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Nondeterministic algorithm; Software; Variable (mathematics); Software system; Software requirements; Software requirements specification; Physical system; Functional requirement; Software engineering; Software construction; Theoretical computer science; Programming language; Mathematics","score_opus":0.157395670495039,"score_gpt":0.3779316375933396,"score_spread":0.2205359670983006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W381873492","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.08980228,0.0000122131405,0.9090744,0.00009623826,0.00022695682,0.00031893063,5.0091035e-7,0.000023247483,0.00044519166],"genre_scores_gemma":[0.45755866,2.4858622e-7,0.5423942,0.000025037185,0.000008611944,0.000010611901,1.9882822e-7,0.0000013443675,0.0000010528505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977848,0.00013910314,0.00048002246,0.00033389372,0.0009204195,0.00034177623],"domain_scores_gemma":[0.998486,0.000054966233,0.00023558957,0.0008355065,0.00032117614,0.00006676026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009960054,0.00008763991,0.00015150114,0.00016805623,0.00007354038,0.00010984903,0.0026415666,0.00002322525,5.8422086e-7],"category_scores_gemma":[0.00015788767,0.000065541346,0.00003168246,0.0017859741,0.0004061995,0.0013000126,0.00056022796,0.00008753158,8.6047487e-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.00001168782,0.00034606343,0.0059832977,0.00006862864,0.0000051107722,0.0000010038298,0.009946976,0.0178484,0.003361746,0.47499073,0.000061577826,0.48737478],"study_design_scores_gemma":[0.00024155066,0.00017650033,0.0016194253,0.000024616433,0.0000019480524,0.000004465457,0.00015604425,0.96994275,0.005041772,0.022524634,0.00018221496,0.00008410527],"about_ca_topic_score_codex":0.00006512326,"about_ca_topic_score_gemma":0.00000289036,"teacher_disagreement_score":0.9520943,"about_ca_system_score_codex":0.00008168244,"about_ca_system_score_gemma":0.0004081282,"threshold_uncertainty_score":0.4908732},"labels":[],"label_agreement":null},{"id":"W39084266","doi":"10.1007/978-3-642-21437-0_9","title":"Sampling-Based Runtime Verification","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":43,"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; Runtime verification; Benchmark (surveying); Overhead (engineering); Formal verification; Sampling (signal processing); Integer programming; Distributed computing; Algorithm; Programming language; Filter (signal processing)","score_opus":0.05135206870084809,"score_gpt":0.28860412819111275,"score_spread":0.23725205949026468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39084266","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.00001958634,0.00020279876,0.98948634,0.00021752069,0.002258788,0.00042897812,0.0000038375433,0.0003101949,0.0070719873],"genre_scores_gemma":[0.023389991,0.000017974231,0.9751744,0.00089907786,0.00025940745,0.000018426244,0.0000088183215,0.000038297196,0.00019358525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607277,0.00006053964,0.0006312373,0.0016749549,0.00094433717,0.0006161418],"domain_scores_gemma":[0.99615616,0.00027852852,0.00047661902,0.0025688717,0.0003508859,0.00016896184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017085497,0.0005166409,0.0004470757,0.00097460015,0.000269327,0.00041625474,0.0045729806,0.00041668443,0.000052225834],"category_scores_gemma":[0.00020017034,0.000508997,0.0001374821,0.0007354848,0.00072208716,0.0007968486,0.0006674996,0.00076968747,0.00022359799],"study_design_candidate":"design_other","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.000008996807,0.000039118488,0.000027844993,0.00004024399,0.0000064583123,0.000010338605,0.0004290462,0.011867726,0.0003211976,0.16751456,0.000010417337,0.819724],"study_design_scores_gemma":[0.00024936142,0.00021040026,0.000624504,0.00029234184,0.00001087542,0.000025861313,4.708323e-8,0.72796875,0.009650641,0.2543347,0.005699767,0.00093279104],"about_ca_topic_score_codex":0.000020865093,"about_ca_topic_score_gemma":0.000010551435,"teacher_disagreement_score":0.8187913,"about_ca_system_score_codex":0.0003736634,"about_ca_system_score_gemma":0.00067248975,"threshold_uncertainty_score":0.9997362},"labels":[],"label_agreement":null},{"id":"W39351959","doi":"10.1002/alz.14253","title":"Compositions of Concurrent Processes","year":2006,"lang":"en","type":"article","venue":"Communicating Process Architectures","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Biomedical Imaging and Bioengineering; Canadian Institutes of Health Research; National Institutes of Health; H. Lundbeck A/S; National Institute on Aging; Fujirebio Europe; Pfizer; Novartis Pharmaceuticals Corporation; Biogen; Alzheimer's Drug Discovery Foundation; Merck; Eli Lilly and Company; Servier; GE Healthcare; BioClinica","keywords":"Concurrency; Computer science; Simultaneity; Programming language; Semantics (computer science); Abstraction; Communicating sequential processes; Extension (predicate logic); Theoretical computer science; Observer (physics); Concurrency control; Operational semantics","score_opus":0.025915631030779516,"score_gpt":0.3251006370316497,"score_spread":0.29918500600087017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39351959","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.09873667,0.002349556,0.88674057,0.0004743687,0.00008629041,0.00027696538,0.000008386541,0.00035868632,0.010968514],"genre_scores_gemma":[0.6686103,0.000008663398,0.33126742,0.000032729396,0.00001645803,0.00004298039,0.0000071426402,0.0000068244394,0.000007529546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988014,0.00016548256,0.00038836544,0.0002128759,0.0002370611,0.00019478324],"domain_scores_gemma":[0.9980135,0.0003158699,0.00032098335,0.0010457576,0.0002696712,0.000034193785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003150105,0.00013106906,0.00018072945,0.00011543402,0.00024553304,0.00006056353,0.0023571264,0.00004030155,0.0000037116351],"category_scores_gemma":[0.00025204621,0.000117949014,0.000041985186,0.00061530294,0.00022141395,0.0001261494,0.00037693142,0.00022857681,0.0000029143573],"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.00002373172,0.0011421269,0.0059347185,0.0026792816,0.000055240336,0.0000019109575,0.012050671,0.033453114,0.01909902,0.6870875,0.00023343935,0.23823926],"study_design_scores_gemma":[0.0010052312,0.00038347841,0.021211829,0.0010291245,0.000041440686,0.000118516815,0.00026769435,0.12799774,0.6389061,0.20406097,0.0038877993,0.0010900432],"about_ca_topic_score_codex":0.000046841706,"about_ca_topic_score_gemma":0.000020410034,"teacher_disagreement_score":0.6198071,"about_ca_system_score_codex":0.000014886298,"about_ca_system_score_gemma":0.00010011294,"threshold_uncertainty_score":0.48098212},"labels":[],"label_agreement":null},{"id":"W4200582041","doi":"10.1109/iros51168.2021.9636410","title":"Real-Time Hamilton-Jacobi Reachability Analysis of Autonomous System With An FPGA","year":2021,"lang":"en","type":"article","venue":"2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Reachability; Field-programmable gate array; Curse of dimensionality; Embedded system; Parallel computing; Real-time computing; Algorithm; Artificial intelligence","score_opus":0.056802871160548496,"score_gpt":0.3143942311967452,"score_spread":0.2575913600361967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200582041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17357774,0.00008338629,0.8049947,0.00015376593,0.0017033538,0.0004733312,0.000102878694,0.00015296938,0.018757896],"genre_scores_gemma":[0.9699485,0.00018338929,0.02738105,0.00002705111,0.00011679273,0.00007803956,0.00010826175,0.000019517116,0.0021374302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961915,0.00057383644,0.0010012579,0.0010188363,0.0009062152,0.000308359],"domain_scores_gemma":[0.9964657,0.00016668637,0.00060720026,0.0012509235,0.0012883029,0.00022119787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012708746,0.00033219578,0.0007438269,0.00047302461,0.00013592865,0.00047571317,0.0010156938,0.0001617512,0.00014616622],"category_scores_gemma":[0.00007512576,0.00028198978,0.00017203808,0.0008659954,0.00015313314,0.00054101914,0.00013394178,0.00022735151,0.000041206422],"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.0001402097,0.00051694835,0.0023265735,0.00023780523,0.001494544,0.00007688449,0.002568664,0.037491098,0.017810423,0.9247583,0.00006308643,0.012515439],"study_design_scores_gemma":[0.00020505734,0.00034217842,0.0035665543,0.00032483978,0.00014516746,0.000057592802,0.0009318625,0.9839911,0.009701132,0.00012204652,0.0002598721,0.00035258837],"about_ca_topic_score_codex":0.001040087,"about_ca_topic_score_gemma":0.00009406374,"teacher_disagreement_score":0.9465,"about_ca_system_score_codex":0.00032645703,"about_ca_system_score_gemma":0.000263625,"threshold_uncertainty_score":0.9999632},"labels":[],"label_agreement":null},{"id":"W4205165567","doi":"10.1016/s0304-3975(03)00604-2","title":"Metrics for labelled Markov processes","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","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":"Université Laval","funders":"","keywords":"Bisimulation; Probabilistic logic; Mathematics; Markov process; Metric (unit); Equivalence (formal languages); Markov chain; Property (philosophy); Markov property; Stochastic process; Discrete mathematics; Markov model; Statistics","score_opus":0.021845036099777202,"score_gpt":0.30266108810126563,"score_spread":0.2808160520014884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205165567","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.0042516734,0.00004343195,0.99184537,0.0008699086,0.00073302735,0.00036518474,0.0000016422408,0.00027552425,0.0016142679],"genre_scores_gemma":[0.39681053,0.0000044404132,0.6027512,0.0003360686,0.000064952335,0.000022326354,3.8397795e-7,0.000005231704,0.000004851079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776864,0.000051919542,0.00027818765,0.0006930351,0.00064909586,0.0005591378],"domain_scores_gemma":[0.9979407,0.00037323972,0.000088495704,0.00080814696,0.0005770776,0.00021234788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025470583,0.00016047245,0.000179309,0.00028474338,0.00046354454,0.00044020545,0.0031278392,0.0000548864,0.000006344564],"category_scores_gemma":[0.001309015,0.00013226042,0.000050173163,0.0034684464,0.0015306625,0.001029996,0.0006472168,0.00012219159,0.00003855536],"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.0000074757218,0.000055811026,0.000005799136,0.000026920057,0.000001876384,0.000001182319,0.00023712478,0.00021797673,0.00033533652,0.9604479,0.0000132797695,0.03864929],"study_design_scores_gemma":[0.0005280471,0.0003766961,0.00012694756,0.000029041355,0.0000052629925,0.000027650149,0.0000044478506,0.3199833,0.05500562,0.62320065,0.00043973565,0.00027258927],"about_ca_topic_score_codex":0.0000012722948,"about_ca_topic_score_gemma":2.2714364e-7,"teacher_disagreement_score":0.39255884,"about_ca_system_score_codex":0.00011486244,"about_ca_system_score_gemma":0.00039730003,"threshold_uncertainty_score":0.5812355},"labels":[],"label_agreement":null},{"id":"W4206652101","doi":"10.1007/11817949","title":"CONCUR 2006 – Concurrency Theory","year":2006,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität Duisburg-Essen; Universität des Saarlandes; Università degli Studi di Trento; Rheinische Friedrich-Wilhelms-Universität Bonn; Università di Pisa; Technische Universiteit Eindhoven; Aalborg Universitet; Università degli Studi di Verona; State University of New York; European Research Consortium for Informatics and Mathematics; Imperial College London; York University; Masarykova Univerzita; Deutsche Forschungsgemeinschaft; National ICT Australia; Massachusetts Institute of Technology; Uppsala Universitet; Carl von Ossietzky Universität Oldenburg; Universiteit van Amsterdam; National University of Singapore; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Concurrency; Computer science; Series (stratigraphy); Programming language; Library science","score_opus":0.016647124756150856,"score_gpt":0.27778327976688505,"score_spread":0.26113615501073417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206652101","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.00001437876,0.0008594112,0.9648299,0.00015413965,0.004789425,0.0004989407,0.000013748271,0.0003351547,0.028504891],"genre_scores_gemma":[0.0048588007,0.000018071953,0.98892736,0.0012425063,0.00092065404,0.000031367512,0.000017697532,0.000043324646,0.0039401907],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99436915,0.0003010056,0.00079105515,0.0018898875,0.0016761695,0.00097271614],"domain_scores_gemma":[0.99556756,0.00090819155,0.0005256852,0.002286167,0.00053706503,0.00017531912],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00408242,0.00064051565,0.00063403836,0.0009334304,0.00029806537,0.00068581715,0.006363729,0.0004851885,0.000020943999],"category_scores_gemma":[0.0005326585,0.0005991572,0.00016413146,0.001691913,0.001380093,0.0011275109,0.0014142942,0.0011769958,0.00013587312],"study_design_candidate":"design_other","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.0000040140153,0.000048846712,0.00003966643,0.00005966432,0.0000071530567,0.00004129234,0.00039712552,0.0078010703,0.00006897585,0.18629518,0.0025330137,0.802704],"study_design_scores_gemma":[0.0003715774,0.00019226693,0.00030115878,0.00035559002,0.0000120978375,0.00009354627,1.056068e-7,0.40831065,0.00294402,0.5566133,0.029648272,0.0011573682],"about_ca_topic_score_codex":0.000022259277,"about_ca_topic_score_gemma":0.000018923833,"teacher_disagreement_score":0.80154663,"about_ca_system_score_codex":0.0009645439,"about_ca_system_score_gemma":0.0022654445,"threshold_uncertainty_score":0.999646},"labels":[],"label_agreement":null},{"id":"W4206670752","doi":"10.1145/3498722","title":"Solving constrained Horn clauses modulo algebraic data types and recursive functions","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"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; European Commission; Natural Sciences and Engineering Research Council of Canada; United States-Israel Binational Science Foundation; Israel Science Foundation; United States - Israel Binational Science Foundation","keywords":"Decidability; Correctness; Modulo; Computer science; RDF Schema; Theoretical computer science; Undecidable problem; Counterexample; Programming language; Discrete mathematics; Mathematics; RDF; Artificial intelligence","score_opus":0.03735519205231355,"score_gpt":0.2969661613641396,"score_spread":0.25961096931182603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206670752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97593987,0.0023368425,0.007966795,0.007696605,0.0010421245,0.0015137665,0.00007422585,0.0008005776,0.0026291949],"genre_scores_gemma":[0.58689266,0.000014339489,0.41260418,0.00018505407,0.0000474197,0.000068389854,0.000006131187,0.000013391496,0.00016842068],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988374,0.00002966145,0.00018979853,0.0004077206,0.0003227608,0.00021263825],"domain_scores_gemma":[0.9986148,0.00012244923,0.0002524653,0.0008674148,0.000102469225,0.00004039472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008496116,0.000118751756,0.00013418333,0.00010096518,0.0004205044,0.00014625902,0.0033952387,0.000031823867,0.000008577587],"category_scores_gemma":[0.0020126966,0.00009450028,0.000034593344,0.00049174915,0.00014796834,0.00048044248,0.0035412845,0.00025019934,0.0000016635228],"study_design_candidate":"design_other","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.000058706835,0.00024231129,0.0033732273,0.00019660006,0.00013311183,0.0000019510862,0.007760612,0.000031065614,0.015334671,0.2552584,0.0055509554,0.71205837],"study_design_scores_gemma":[0.0054840413,0.007217984,0.038320504,0.0014315371,0.0009964785,0.0015721704,0.13527665,0.07096664,0.2547732,0.254214,0.22470503,0.005041797],"about_ca_topic_score_codex":0.000023753382,"about_ca_topic_score_gemma":0.0000014715904,"teacher_disagreement_score":0.7070166,"about_ca_system_score_codex":0.000034158766,"about_ca_system_score_gemma":0.000031282587,"threshold_uncertainty_score":0.6309254},"labels":[],"label_agreement":null},{"id":"W4208076","doi":"10.1007/978-3-319-07725-3_42","title":"The Semantics of Refinement Chart","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Notation; Computer science; Chart; Programming language; Semantics (computer science); Representation (politics); Refinement calculus; Theoretical computer science; Mathematics","score_opus":0.02357222707120969,"score_gpt":0.27201239991722026,"score_spread":0.24844017284601058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4208076","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.000017944056,0.00018000558,0.9921138,0.0010905245,0.001920971,0.0002553922,0.0000010764185,0.00005781174,0.0043624346],"genre_scores_gemma":[0.015300506,0.00009148702,0.98323846,0.0005651602,0.00022738769,0.0000072388602,0.000001006879,0.000018990952,0.00054974697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720347,0.000058261718,0.0005761116,0.00077034946,0.0009755829,0.0004162309],"domain_scores_gemma":[0.9966733,0.0004989942,0.00048084173,0.002038167,0.00023286424,0.00007582612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024671326,0.0002986221,0.00034152417,0.00025522243,0.0002560422,0.00021941825,0.0040787784,0.00017757752,0.000009203049],"category_scores_gemma":[0.00022642918,0.00021441259,0.00009434285,0.00041203294,0.0008751132,0.00018392662,0.0014041034,0.0004669943,0.00003744136],"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.0000022423158,0.0000065417908,0.000012171928,0.000022916816,0.0000046355854,0.0000021925855,0.00020035371,0.003707877,0.00011648343,0.27979076,0.000047781417,0.71608603],"study_design_scores_gemma":[0.00014782824,0.00022370876,0.00020287161,0.0002519022,0.000007646837,0.00002553257,9.223757e-8,0.78554684,0.007584599,0.17382368,0.03174387,0.00044139827],"about_ca_topic_score_codex":0.000007656848,"about_ca_topic_score_gemma":0.000019586747,"teacher_disagreement_score":0.781839,"about_ca_system_score_codex":0.00014041952,"about_ca_system_score_gemma":0.00019757141,"threshold_uncertainty_score":0.8743492},"labels":[],"label_agreement":null},{"id":"W4213020116","doi":"10.1007/978-3-642-21827-9_5","title":"Model Checking Commitment Protocols","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; Model checking; Protocol (science); Temporal logic; Modalities; Communications protocol; Programming language; Theoretical computer science; Computer network","score_opus":0.09944316654341848,"score_gpt":0.327938671029536,"score_spread":0.22849550448611752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213020116","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.0000048396855,0.00006842475,0.9769999,0.00013885455,0.0007680804,0.0050489362,0.000002642629,0.00024705025,0.016721293],"genre_scores_gemma":[0.005027597,0.000010444976,0.9927413,0.0008304999,0.00019027242,0.0007405195,0.0000019146578,0.000037840367,0.00041964263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594,0.000052893305,0.00066242,0.0015667502,0.001072129,0.0007057543],"domain_scores_gemma":[0.9964731,0.00013084346,0.00046019646,0.0024827363,0.00027070192,0.00018242492],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018386976,0.0005579087,0.0005183867,0.00069070817,0.00027512954,0.00046184123,0.0054868483,0.00036803566,0.000018701223],"category_scores_gemma":[0.00009802729,0.0005163118,0.00013546349,0.00047546695,0.0006261178,0.00096214016,0.0018910568,0.00091113,0.00007091061],"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.0000062655818,0.000040878924,0.000016503363,0.000058803973,0.000006985025,0.000017137429,0.0011226069,0.029242724,0.00013322289,0.2758086,0.00001472779,0.6935316],"study_design_scores_gemma":[0.00013086347,0.000108802786,0.000028030528,0.00033636956,0.0000031532782,0.000022556716,2.7399418e-8,0.6845908,0.0033105914,0.31003904,0.0009835262,0.0004462427],"about_ca_topic_score_codex":0.000010453641,"about_ca_topic_score_gemma":0.000011687549,"teacher_disagreement_score":0.6930853,"about_ca_system_score_codex":0.00047664903,"about_ca_system_score_gemma":0.0006050007,"threshold_uncertainty_score":0.99989396},"labels":[],"label_agreement":null},{"id":"W4213366324","doi":"10.1016/j.jcjd.2013.02.043","title":"Appendix 5: Approximate Cost Reference List for Antihyperglycemic Agents","year":2013,"lang":"en","type":"article","venue":"Canadian Journal of Diabetes","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Medicine","score_opus":0.04685039645873286,"score_gpt":0.27819757749276786,"score_spread":0.231347181034035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213366324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85659474,0.000542334,0.13658589,0.0012153264,0.0020222643,0.000793536,0.00004433171,0.000035782774,0.0021658165],"genre_scores_gemma":[0.78872365,0.000005233238,0.21063873,0.0003989133,0.00009003351,0.000024798357,0.0000056903923,0.000011621277,0.00010131219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988708,0.000058552625,0.0003477158,0.00015297017,0.00013920131,0.00043076705],"domain_scores_gemma":[0.9984665,0.00007447382,0.00028387454,0.0003157804,0.0003464267,0.0005129256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049748726,0.000113059934,0.0001912192,0.00024574972,0.00014817779,0.0002888133,0.0011086182,0.00006677686,0.00010857364],"category_scores_gemma":[0.00028645786,0.00010201983,0.00006892018,0.00021606429,0.00007207697,0.0009824303,0.000025407495,0.00015645698,0.00009541245],"study_design_candidate":"design_other","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.0000114273425,0.00012221935,0.15394436,0.0004431922,0.0002832272,0.000020411664,0.0025930211,0.0004254501,0.017686559,0.18543021,0.14047532,0.4985646],"study_design_scores_gemma":[0.0039565708,0.0021596367,0.17038901,0.00089969777,0.000117424854,0.00009847178,0.0004740581,0.3689357,0.040297788,0.052388486,0.35809574,0.0021874008],"about_ca_topic_score_codex":0.00025001226,"about_ca_topic_score_gemma":0.00023510488,"teacher_disagreement_score":0.4963772,"about_ca_system_score_codex":0.00012015569,"about_ca_system_score_gemma":0.00040542337,"threshold_uncertainty_score":0.4160248},"labels":[],"label_agreement":null},{"id":"W4225474367","doi":"10.1007/978-3-030-99527-0_35","title":"Ultimate GemCutter and the Axes of Generalization","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"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":"","keywords":"Generalization; Correctness; Computer science; Counterexample; Spurious relationship; Concurrency; Interpolation (computer graphics); Theoretical computer science; Algorithm; Programming language; Artificial intelligence; Discrete mathematics; Mathematics; Machine learning; Image (mathematics)","score_opus":0.020933760023833955,"score_gpt":0.26664843946888384,"score_spread":0.24571467944504988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225474367","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.00009173863,0.0004640471,0.9953138,0.00081995974,0.0010098815,0.0003413769,0.0000035568703,0.000049990405,0.0019056196],"genre_scores_gemma":[0.025956612,0.00017984523,0.97234344,0.001201375,0.0001295604,0.000018174578,0.0000047631,0.00001869917,0.0001475267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977575,0.00011472909,0.00043330964,0.0007201079,0.0007135984,0.0002607376],"domain_scores_gemma":[0.9980182,0.0003695723,0.00037294638,0.0010605117,0.00013415169,0.00004460234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019020953,0.0002471248,0.00033689357,0.0003832303,0.00025026276,0.00019906762,0.002195576,0.00010843839,0.000028063205],"category_scores_gemma":[0.0001224678,0.00017865242,0.000067871384,0.00043968394,0.0011620374,0.000509686,0.0014182776,0.00039729447,0.000002615188],"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.000012208569,0.000008709105,0.000026863365,0.000038314945,0.000008056117,0.000004217844,0.0015704053,0.024884779,0.00014904374,0.6174965,0.000009090757,0.3557918],"study_design_scores_gemma":[0.00031813333,0.000060750703,0.0001687055,0.00005559433,0.0000076484075,0.00004027013,1.4616232e-7,0.81897014,0.0014888253,0.1768394,0.0018101073,0.00024026661],"about_ca_topic_score_codex":0.000029946787,"about_ca_topic_score_gemma":0.0000069843354,"teacher_disagreement_score":0.7940854,"about_ca_system_score_codex":0.000097840624,"about_ca_system_score_gemma":0.0001350078,"threshold_uncertainty_score":0.72852343},"labels":[],"label_agreement":null},{"id":"W4225935545","doi":"10.1109/jsyst.2022.3149677","title":"Assuring Behavior of Multirobot Autonomous Systems With Translation From Formal Verification to ROS Simulation","year":2022,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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 British Columbia","funders":"","keywords":"Correctness; Computer science; Formal verification; Robot; Formal methods; Software engineering; Model checking; Compiler; Abstraction; Distributed computing; Translation (biology); Systems engineering; Embedded system; Programming language; Artificial intelligence; Engineering","score_opus":0.06131905099977851,"score_gpt":0.30426476349411385,"score_spread":0.24294571249433533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225935545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23390591,0.00013865688,0.76280165,0.000024048753,0.0023240622,0.0006627194,0.00002075199,0.000070613634,0.000051583258],"genre_scores_gemma":[0.90583605,0.0000014800654,0.0937059,0.000009590274,0.00020769259,0.00018113926,0.000007748924,0.000020094638,0.000030289919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971413,0.0005462211,0.0008452151,0.0003112906,0.0008734949,0.0002824941],"domain_scores_gemma":[0.998183,0.000111838526,0.00079881167,0.0005161408,0.00025739695,0.00013280805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017262435,0.0001656412,0.0002822193,0.0003010575,0.00047378143,0.00024549122,0.0006957327,0.000062481675,0.000005728568],"category_scores_gemma":[0.000023869465,0.00015890539,0.000067802386,0.00047577123,0.000017645458,0.001316795,0.000046477635,0.0003206066,0.0000069190273],"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.00005184748,0.000065769855,0.0006293238,0.000024878904,0.000021777323,0.00000653975,0.0018305226,0.9690628,0.016852846,0.00036380492,0.000010523816,0.011079369],"study_design_scores_gemma":[0.0006056625,0.00033747902,0.007741737,0.000068586814,0.000031885727,0.00019499494,0.0002247653,0.9871599,0.0024664307,0.000009039731,0.00094834925,0.00021116884],"about_ca_topic_score_codex":0.00033209377,"about_ca_topic_score_gemma":0.0000033818535,"teacher_disagreement_score":0.67193013,"about_ca_system_score_codex":0.00037542748,"about_ca_system_score_gemma":0.00012623885,"threshold_uncertainty_score":0.6479973},"labels":[],"label_agreement":null},{"id":"W4226254196","doi":"10.23919/acc53348.2022.9867253","title":"Sufficient Conditions for Robust Probabilistic Reach-Avoid-Stay Specifications using Stochastic Lyapunov-Barrier Functions","year":2022,"lang":"en","type":"article","venue":"2022 American Control Conference (ACC)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"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 Waterloo","funders":"","keywords":"Lyapunov function; Soundness; Probabilistic logic; Lyapunov optimization; Robustness (evolution); Computer science; Dynamical systems theory; Control theory (sociology); Lyapunov redesign; Mathematical optimization; Robust control; Lyapunov equation; Control-Lyapunov function; Lyapunov stability; Control system; Mathematics; Lyapunov exponent; Control (management); Engineering; Nonlinear system; Artificial intelligence","score_opus":0.09211056549534345,"score_gpt":0.30225893717222013,"score_spread":0.21014837167687667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226254196","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.011370159,0.000056105204,0.98220915,0.0010444823,0.0011717294,0.0019854754,0.0011108604,0.00036257147,0.00068949565],"genre_scores_gemma":[0.8580657,0.000002644813,0.13785176,0.00047357258,0.00013442598,0.002664808,0.00015423297,0.00004295579,0.00060988235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960442,0.00066202274,0.00075639156,0.001084966,0.0007048355,0.00074758305],"domain_scores_gemma":[0.9960445,0.0008029058,0.0007142041,0.0015287728,0.0006444743,0.0002651396],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012350312,0.00036366907,0.0005274135,0.0004499227,0.0020185148,0.00030351657,0.001559242,0.00004904479,0.0005901775],"category_scores_gemma":[0.00095701433,0.0004071294,0.00023303724,0.0017019077,0.00059104833,0.0005120521,0.0003473999,0.0005532693,0.00003518341],"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.0001575044,0.00075828296,0.00017826227,0.00003312653,0.00016463744,0.000005844782,0.0017141601,0.36750913,0.016438426,0.5982735,0.001764639,0.013002492],"study_design_scores_gemma":[0.00085511495,0.00044971562,0.00091636553,0.0000108167815,0.00011557495,0.000041959778,0.0024222122,0.98606867,0.000052855554,0.0024884574,0.00606955,0.0005087151],"about_ca_topic_score_codex":0.00019586265,"about_ca_topic_score_gemma":0.000036248748,"teacher_disagreement_score":0.84669554,"about_ca_system_score_codex":0.00075536594,"about_ca_system_score_gemma":0.001027369,"threshold_uncertainty_score":0.99983805},"labels":[],"label_agreement":null},{"id":"W4229001783","doi":"10.1287/ijoc.2022.1194","title":"Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Minnow Environmental (Canada)","funders":"","keywords":"Computer science; Reinforcement learning; Heuristic; Scalability; Mathematical optimization; Relaxation (psychology); Metric (unit); Set (abstract data type); Artificial intelligence; Linear programming relaxation; Analytics; Linear programming; Bounding overwatch; Variable (mathematics); Machine learning; Algorithm; Mathematics; Data mining","score_opus":0.02586203490071252,"score_gpt":0.284661090906438,"score_spread":0.25879905600572545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229001783","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.16407602,0.000023936678,0.8340456,0.000008440799,0.00092207344,0.0001213379,1.785438e-7,0.000072025476,0.0007304114],"genre_scores_gemma":[0.45661137,0.000002377364,0.5432018,0.00010484193,0.000055633536,0.0000016793086,6.1161643e-7,0.000010045169,0.000011653671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743676,0.00010832895,0.0009296255,0.00021941678,0.0008794617,0.00042642409],"domain_scores_gemma":[0.9978949,0.00021410671,0.0012588921,0.00035035703,0.0001858548,0.000095885065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038952052,0.0001713557,0.00025172543,0.00036060356,0.0011650122,0.00028403348,0.0010784989,0.000041177154,0.000023130617],"category_scores_gemma":[0.00047758047,0.0001556899,0.00009974792,0.00082823134,0.000026355063,0.0009765647,0.0011519849,0.0009155177,0.0000028203094],"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.000023616634,0.000020150654,0.00019509316,0.000019412933,0.000010980817,0.000004843703,0.00070162537,0.75884163,0.0016641191,0.015662244,0.000004472018,0.2228518],"study_design_scores_gemma":[0.00041753214,0.00043809845,0.00008894871,0.00009212215,0.000005024219,0.00033190002,0.00019889841,0.99359053,0.002088774,0.0010661758,0.001498712,0.00018327897],"about_ca_topic_score_codex":0.000026513013,"about_ca_topic_score_gemma":6.3628725e-8,"teacher_disagreement_score":0.29253536,"about_ca_system_score_codex":0.00036390874,"about_ca_system_score_gemma":0.00016287323,"threshold_uncertainty_score":0.89604497},"labels":[],"label_agreement":null},{"id":"W4229045235","doi":"10.1007/978-3-031-15839-1_5","title":"Robustly Complete Finite-State Abstractions for Verification of Stochastic Systems","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"Soundness; Probabilistic logic; State space; Markov chain; Computer science; Nonlinear system; Mathematics; Theoretical computer science","score_opus":0.05683049799423852,"score_gpt":0.28891691553133997,"score_spread":0.23208641753710146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229045235","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.000023399354,0.00022940642,0.99413896,0.00013066754,0.0035651415,0.0011153001,0.000091277376,0.00012300505,0.0005828267],"genre_scores_gemma":[0.07438031,0.00002072192,0.92486924,0.00012096377,0.00019671331,0.00014379805,0.000037613318,0.000042513733,0.0001881457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996502,0.00007117611,0.00086247106,0.0011670291,0.0009312788,0.0004660793],"domain_scores_gemma":[0.9956089,0.0013561689,0.0008807023,0.0015914796,0.00045757944,0.000105160056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001779946,0.00037855958,0.00052078435,0.00090528326,0.0003800728,0.0002536043,0.0028802287,0.00016650074,0.000019929235],"category_scores_gemma":[0.0003202095,0.00040086187,0.00014818784,0.0005846335,0.00047498805,0.0007078927,0.0005552862,0.0006113899,0.000014097892],"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.000011292107,0.000025850455,7.288908e-7,0.00009547729,0.000012570583,0.0000031556779,0.00038664968,0.82775784,0.00032573496,0.09769032,0.000007989967,0.07368238],"study_design_scores_gemma":[0.00019769381,0.00023364897,0.000032092048,0.00013132907,0.000014054853,0.000035043635,4.989998e-7,0.96015656,0.00035222963,0.03672833,0.0017256914,0.00039282467],"about_ca_topic_score_codex":0.000043670276,"about_ca_topic_score_gemma":0.000010491289,"teacher_disagreement_score":0.13239872,"about_ca_system_score_codex":0.00043718013,"about_ca_system_score_gemma":0.00050148397,"threshold_uncertainty_score":0.9998443},"labels":[],"label_agreement":null},{"id":"W4229576726","doi":"10.1145/1273442.1250769","title":"Path invariants","year":2007,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Predicate abstraction; Computer science; Predicate (mathematical logic); Path (computing); Abstract interpretation; Program analysis; Theoretical computer science; Abstraction; Counterexample; Spurious relationship; Path expression; Programming language; Control flow; Invariant (physics); Control flow graph; Algorithm; Model checking; Mathematics; Discrete mathematics","score_opus":0.04224519862286649,"score_gpt":0.31248323854479454,"score_spread":0.2702380399219281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229576726","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.078272745,0.00007626291,0.9043868,0.0002980086,0.00094686396,0.0001084956,0.0000015687259,0.00023241296,0.015676836],"genre_scores_gemma":[0.4623894,0.0000027247324,0.5371617,0.00030305333,0.00006931418,0.0000015290701,0.0000013743122,0.0000037900677,0.00006708102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99901265,0.0000539345,0.00019416027,0.00024511342,0.00023201849,0.00026214612],"domain_scores_gemma":[0.99851364,0.0003216535,0.00010778482,0.00093219744,0.000043615808,0.00008113057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012469823,0.0000876136,0.000087464134,0.00008134698,0.00008819819,0.00010485905,0.0016143658,0.000058733185,0.000019581212],"category_scores_gemma":[0.0007308235,0.00007862862,0.00002279486,0.00029200988,0.000030972613,0.00069430633,0.00027408794,0.00010342019,0.00025998938],"study_design_candidate":"observational","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.00003427447,0.00013201313,0.01234378,0.000063781685,0.000028396757,0.000103024984,0.00338301,0.000049741964,0.007315532,0.6356798,0.0022011346,0.33866554],"study_design_scores_gemma":[0.0012656406,0.000570662,0.6975767,0.00013063724,0.000035731242,0.000107781845,0.00044901916,0.064207226,0.11621358,0.055124167,0.062863894,0.0014549651],"about_ca_topic_score_codex":0.000031595187,"about_ca_topic_score_gemma":0.000012733236,"teacher_disagreement_score":0.68523294,"about_ca_system_score_codex":0.000021509348,"about_ca_system_score_gemma":0.000023693725,"threshold_uncertainty_score":0.33417243},"labels":[],"label_agreement":null},{"id":"W4230169210","doi":"10.1109/iccad.2003.159685","title":"Efficient generation of monitor circuits for GSTE assertion graphs","year":2003,"lang":"en","type":"article","venue":"ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":17,"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 British Columbia","funders":"","keywords":"Computer science; Assertion; Formal verification; Scalability; Overhead (engineering); Automaton; Programming language; Abstraction; Theoretical computer science; Symbolic trajectory evaluation; Electronic circuit; Model checking; Computer engineering","score_opus":0.1474870650686887,"score_gpt":0.33515202622466794,"score_spread":0.18766496115597925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230169210","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.023296919,0.000019594007,0.9621215,0.00014987265,0.011369298,0.0013651787,0.00003831084,0.00019970744,0.0014396352],"genre_scores_gemma":[0.35073313,0.000025430896,0.64786756,0.0003330519,0.00040158242,0.00025372393,0.00003961444,0.000036130314,0.00030974933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533945,0.00069231546,0.0011383508,0.001130917,0.0011285765,0.0005704127],"domain_scores_gemma":[0.99221134,0.000349376,0.0007751903,0.0010146404,0.0054336195,0.0002158495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017676784,0.0005121022,0.0004971094,0.0006439002,0.000245874,0.00040356972,0.0017988124,0.0002753827,0.0000468876],"category_scores_gemma":[0.0012330235,0.000528267,0.00017928483,0.0011438372,0.0001271967,0.000619907,0.000095676245,0.00028614746,0.00013929217],"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.00008476972,0.0005623583,0.00009541689,0.00005980916,0.0001533452,0.0000068184954,0.0005592383,0.0359987,0.13980532,0.7922793,0.004359057,0.026035897],"study_design_scores_gemma":[0.00076684944,0.00057366345,0.00042887233,0.00015028016,0.000021264563,0.000021006732,0.000012409408,0.86956155,0.12463095,0.002659396,0.0006971607,0.0004765928],"about_ca_topic_score_codex":0.000018936267,"about_ca_topic_score_gemma":0.0000019169172,"teacher_disagreement_score":0.83356285,"about_ca_system_score_codex":0.00035579698,"about_ca_system_score_gemma":0.0006023715,"threshold_uncertainty_score":0.9997169},"labels":[],"label_agreement":null},{"id":"W4230233658","doi":"10.1109/date.2004.1268858","title":"Managing don't cares in Boolean satisfiability","year":2004,"lang":"en","type":"article","venue":"Proceedings Design, Automation and Test in Europe Conference and Exhibition","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":18,"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":"","keywords":"Satisfiability; Boolean satisfiability problem; Computer science; And-inverter graph; Boolean circuit; Very-large-scale integration; Boolean function; Circuit minimization for Boolean functions; Maximum satisfiability problem; Theoretical computer science; Representation (politics); Process (computing); Boolean expression; Computability; Algorithm; Programming language; Embedded system","score_opus":0.034860998743407146,"score_gpt":0.2634861605072138,"score_spread":0.22862516176380665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230233658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5071267,0.00007816046,0.4891784,0.0009471032,0.000069346665,0.00041121838,6.144176e-7,0.00021693311,0.0019715263],"genre_scores_gemma":[0.89820236,0.00019881895,0.10142725,0.00011552016,0.000011279582,0.000028840293,0.0000020971881,0.0000058283536,0.0000080043255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998975,0.00004286287,0.0002892665,0.00037003003,0.00014344483,0.0001794039],"domain_scores_gemma":[0.99954,0.00007281203,0.00010547346,0.00009508109,0.00013336276,0.00005328235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083130365,0.0001263459,0.00012997176,0.00022809803,0.00008409718,0.00031109274,0.00014747985,0.000055245346,0.0000027217511],"category_scores_gemma":[0.00052462734,0.00012805888,0.000008335132,0.0005764927,0.00006871183,0.0014716582,0.00007232524,0.0001353888,0.000005205974],"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.000025250325,0.00018587569,0.050591446,0.00033173588,0.0000031840889,0.000011772174,0.011632724,0.00020218588,0.030957175,0.69417965,0.00003455573,0.21184444],"study_design_scores_gemma":[0.0014023222,0.00035503574,0.45956355,0.000554258,0.0000066215207,0.00006180496,0.00062934397,0.36009523,0.02428083,0.15240139,0.00013950316,0.0005101089],"about_ca_topic_score_codex":0.000056111563,"about_ca_topic_score_gemma":0.000015700283,"teacher_disagreement_score":0.54177827,"about_ca_system_score_codex":0.00006206385,"about_ca_system_score_gemma":0.000046679837,"threshold_uncertainty_score":0.5222089},"labels":[],"label_agreement":null},{"id":"W4230255398","doi":"10.1002/stvr.385","title":"Error‐preserving reductions on communication protocols","year":2007,"lang":"en","type":"article","venue":"Software Testing Verification and Reliability","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Windsor","funders":"","keywords":"Reachability; Computer science; Model checking; Variety (cybernetics); State (computer science); Process (computing); Transformation (genetics); Formal methods; Communications protocol; Distributed computing; Theoretical computer science; Programming language; Artificial intelligence; Computer network","score_opus":0.08466286065561494,"score_gpt":0.36484616857315927,"score_spread":0.2801833079175443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230255398","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.041641265,0.000032473195,0.94832,0.000691749,0.00020680334,0.0037769796,0.0000030306473,0.0012785719,0.0040491433],"genre_scores_gemma":[0.17539272,0.000004008882,0.82364696,0.00011166229,0.00003678574,0.0006820834,0.0000089186915,0.000011336694,0.00010549683],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99815774,0.00027473396,0.00048277422,0.0005389791,0.00028715085,0.00025859967],"domain_scores_gemma":[0.99645007,0.00088012894,0.00027340036,0.0018941066,0.00037826673,0.00012401667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003952032,0.00015328437,0.00014035041,0.00011775692,0.00057658955,0.00013607602,0.00076365634,0.00013524354,0.000007374735],"category_scores_gemma":[0.0075218724,0.0001470414,0.00003192825,0.00072521507,0.00019187856,0.0005704486,0.0001829533,0.00035703342,0.000024304416],"study_design_candidate":"observational","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.00013968717,0.0011756764,0.07472285,0.00047977088,0.000022635833,0.0000025735694,0.0043220185,0.0021719742,0.0074796546,0.2047545,0.0019441284,0.70278454],"study_design_scores_gemma":[0.0006498436,0.00038941923,0.8761221,0.00034120752,0.000015078303,0.000047826252,0.00024582053,0.049648408,0.009363617,0.040048793,0.022383604,0.00074425194],"about_ca_topic_score_codex":0.000057630423,"about_ca_topic_score_gemma":0.0000025100048,"teacher_disagreement_score":0.8013993,"about_ca_system_score_codex":0.00012850095,"about_ca_system_score_gemma":0.00006642528,"threshold_uncertainty_score":0.9004927},"labels":[],"label_agreement":null},{"id":"W4230771668","doi":"10.1109/aspdac.2005.1466516","title":"BDD-based two variable sharing extraction","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Formal Methods in Verification","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":"","keywords":"Binary decision diagram; Computer science; Variable (mathematics); Theoretical computer science; Algorithm; Binary number; Product (mathematics); Exploit; Mathematics; Arithmetic","score_opus":0.03509736295451807,"score_gpt":0.27371557636361077,"score_spread":0.2386182134090927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230771668","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.01351093,0.00007408054,0.95737207,0.0008672166,0.00033249398,0.00079664565,0.000006731195,0.0004541333,0.02658571],"genre_scores_gemma":[0.5624797,0.000009820078,0.43604082,0.000055848963,0.0000798493,0.000054890592,0.0000019888269,0.000015573896,0.0012615364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974741,0.000073254596,0.0006844465,0.00062574015,0.00062101556,0.0005214862],"domain_scores_gemma":[0.99808824,0.00009162487,0.00078334846,0.00043830654,0.00043683383,0.00016166118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002386276,0.00031081718,0.0003355045,0.00030897165,0.0003754945,0.0005379642,0.001105296,0.0001784849,0.00008998333],"category_scores_gemma":[0.0002478188,0.00026101127,0.00008932871,0.0005419626,0.00013815431,0.0018503821,0.00016086116,0.00030934814,0.000051009],"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.00016211526,0.00054057816,0.0056739193,0.00043615585,0.00014811553,9.0525594e-7,0.007956433,0.0059700008,0.110987425,0.794726,0.005609638,0.067788675],"study_design_scores_gemma":[0.00067559443,0.0000560663,0.0025155342,0.00017416221,0.00004615474,0.000018728846,0.0005141205,0.94509983,0.041412085,0.005904802,0.0032261577,0.00035676843],"about_ca_topic_score_codex":0.0000076651695,"about_ca_topic_score_gemma":8.7122106e-7,"teacher_disagreement_score":0.9391298,"about_ca_system_score_codex":0.00012336465,"about_ca_system_score_gemma":0.00022852716,"threshold_uncertainty_score":0.9999842},"labels":[],"label_agreement":null},{"id":"W4230932158","doi":"10.1109/fmcad.2007.4401976","title":"Exploiting Resolution Proofs to Speed Up LTL Vacuity Detection for BMC","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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":"","keywords":"Mathematical proof; Model checking; Computer science; Bounded function; Resolution (logic); Property (philosophy); Variable (mathematics); Theoretical computer science; Algorithm; Programming language; Mathematics","score_opus":0.09702471681253161,"score_gpt":0.3561568717694678,"score_spread":0.2591321549569362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230932158","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.04418452,0.0000052463843,0.9514448,0.00006954473,0.0009355184,0.0005910014,4.309943e-7,0.00033164155,0.002437308],"genre_scores_gemma":[0.30244145,2.4826306e-7,0.6968763,0.00010919637,0.00012356689,0.00002248111,6.689713e-7,0.0000059771683,0.00042013722],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988238,0.000052837404,0.00026991995,0.00033435464,0.00020423142,0.000314835],"domain_scores_gemma":[0.9991253,0.00013201473,0.00008953381,0.00040069417,0.00016068196,0.000091783135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002659669,0.00008978788,0.00008529431,0.00014567042,0.00018618506,0.00008368772,0.00037755232,0.000065428794,0.00000393552],"category_scores_gemma":[0.0006561084,0.00008752354,0.000048046262,0.00046977497,0.000012056597,0.00063044264,0.000103756254,0.00007146346,0.000041345378],"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.0001106086,0.000046808742,0.0002678986,0.000049766964,0.0000054829497,4.011912e-7,0.0009989649,0.00037880454,0.12128033,0.14615838,0.00025396253,0.7304486],"study_design_scores_gemma":[0.0002589206,0.00019772317,0.008754951,0.000012085742,0.0000032352564,0.000007511473,0.00011706564,0.3364532,0.6464041,0.004378015,0.0032281855,0.00018503533],"about_ca_topic_score_codex":0.000026804295,"about_ca_topic_score_gemma":0.00008126749,"teacher_disagreement_score":0.73026353,"about_ca_system_score_codex":0.00015531186,"about_ca_system_score_gemma":0.000024828532,"threshold_uncertainty_score":0.35691065},"labels":[],"label_agreement":null},{"id":"W4231140189","doi":"10.1109/iccad.2002.1167524","title":"Specifying and verifying imprecise sequential datapaths by arithmetic transforms","year":2003,"lang":"en","type":"article","venue":"IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002.","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Datapath; Computer science; Arithmetic; Block (permutation group theory); Algorithm; Polynomial; Parallel computing; Mathematics","score_opus":0.12733888875087176,"score_gpt":0.3312783967356497,"score_spread":0.20393950798477792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231140189","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.002559225,0.00017098317,0.98567235,0.00042477914,0.0035244075,0.0005864811,0.000054552744,0.00027208362,0.006735104],"genre_scores_gemma":[0.15888213,0.00037269323,0.83840966,0.0008924297,0.00033168122,0.000078213336,0.00002945579,0.000053777072,0.0009499478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955434,0.00054345524,0.0008760934,0.0012866572,0.0010466819,0.0007036625],"domain_scores_gemma":[0.9973252,0.00034494663,0.00033224613,0.0012681965,0.00040762688,0.0003218305],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013967846,0.00057782873,0.0004740079,0.00044790067,0.0002920774,0.0010672528,0.0026603248,0.00025076044,0.00044514955],"category_scores_gemma":[0.00021057177,0.0005716072,0.00013532386,0.00044614717,0.00018608366,0.0019010553,0.00023372643,0.0006469723,0.0003230979],"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.00030076745,0.00085247296,0.00022326114,0.00011335604,0.000403129,0.00017434216,0.002246261,0.003032759,0.055123296,0.5182343,0.036098577,0.3831975],"study_design_scores_gemma":[0.002764132,0.0007840333,0.0004859127,0.00033126716,0.000042754815,0.0003962496,0.00004647266,0.8600212,0.08599167,0.018285833,0.029259395,0.0015911106],"about_ca_topic_score_codex":0.00003307134,"about_ca_topic_score_gemma":0.0000027425044,"teacher_disagreement_score":0.85698843,"about_ca_system_score_codex":0.00023967861,"about_ca_system_score_gemma":0.00020706822,"threshold_uncertainty_score":0.9999697},"labels":[],"label_agreement":null},{"id":"W4231425351","doi":"10.1109/iccad.1995.479878","title":"The formal verification of a pipelined double-precision IEEE floating-point multiplier","year":2002,"lang":"en","type":"article","venue":"Proceedings of IEEE International Conference on Computer Aided Design (ICCAD)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":32,"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 British Columbia","funders":"","keywords":"Computer science; Intelligent verification; Formal verification; Double-precision floating-point format; Model checking; Multiplier (economics); Functional verification; High-level verification; IEEE floating point; Automated theorem proving; Floating point; Formal equivalence checking; Runtime verification; Software verification; Algorithm; Programming language; Software","score_opus":0.14689818875710486,"score_gpt":0.3220068759063403,"score_spread":0.17510868714923544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231425351","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.022204537,0.000022693206,0.9680165,0.0007450578,0.0018111618,0.00063978217,0.000005013979,0.00013930962,0.0064159143],"genre_scores_gemma":[0.5759812,0.00013755454,0.423385,0.0000880174,0.00018106906,0.00004652322,0.0000017879939,0.000015709407,0.00016310926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655366,0.0000614739,0.0011839654,0.0006465518,0.001154301,0.00040007124],"domain_scores_gemma":[0.99557054,0.00042126444,0.0011224496,0.000459902,0.0023127738,0.000113049195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019221911,0.00032565888,0.00035007496,0.00035657294,0.0002260517,0.00036057277,0.0029094268,0.00015913979,0.00002891909],"category_scores_gemma":[0.00022417563,0.0002638256,0.00016277711,0.00047031822,0.00018845242,0.0017391021,0.0002279044,0.0003538448,0.000057804627],"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.0008358739,0.0004362022,0.000113169444,0.000084816595,0.00011589695,0.0000017781575,0.0021685862,0.0022821217,0.11866867,0.6248835,0.004787751,0.24562165],"study_design_scores_gemma":[0.0009875243,0.0003887161,0.00026668774,0.0001616749,0.0000088861425,0.00001697716,0.000039050796,0.7515447,0.24131916,0.0047458345,0.00030378858,0.0002169675],"about_ca_topic_score_codex":0.000017380355,"about_ca_topic_score_gemma":6.65123e-7,"teacher_disagreement_score":0.74926263,"about_ca_system_score_codex":0.00012389453,"about_ca_system_score_gemma":0.00007016698,"threshold_uncertainty_score":0.9999814},"labels":[],"label_agreement":null},{"id":"W4231442894","doi":"10.1145/940080.940083","title":"Evaluating and improving the automatic analysis of implicit invocation systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Model checking; Invocation; Distributed computing; Programming language; Focus (optics); Software system; Event (particle physics); Abstraction model checking; Software; State (computer science); Software engineering","score_opus":0.07211482217990091,"score_gpt":0.3668339019643182,"score_spread":0.2947190797844173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231442894","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.24637155,0.000086853564,0.7524299,0.000019301651,0.000068479094,0.00012761717,1.4409163e-7,0.000035907975,0.0008602553],"genre_scores_gemma":[0.6500732,0.0000013411732,0.34986708,0.000019523817,0.000002596015,0.000013324391,2.3290912e-7,0.0000014390448,0.000021314407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990101,0.00030074394,0.00025902977,0.00015306978,0.00019131534,0.00008575933],"domain_scores_gemma":[0.9990144,0.00020065412,0.00018885866,0.0004835528,0.00009380688,0.000018727244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027245872,0.000050176346,0.00011332076,0.00012676159,0.00008290153,0.000086123415,0.0002493559,0.000022570435,0.00000385511],"category_scores_gemma":[0.00050079345,0.00003275589,0.000027487426,0.0009530401,0.000023655182,0.00025011608,0.000045627905,0.000035752233,0.0000012232852],"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":[3.599478e-7,0.000012300789,0.001998851,0.000059458467,0.000115385665,4.6568474e-8,0.0013216523,0.004784091,0.018333977,0.855488,0.0000047762896,0.117881104],"study_design_scores_gemma":[0.00003689825,0.000022136108,0.01788096,0.0000044844833,0.00008473343,0.0000022847717,0.00016692867,0.9786367,0.0027035254,0.0004171027,0.0000047421167,0.00003952205],"about_ca_topic_score_codex":0.000115107076,"about_ca_topic_score_gemma":0.0000037310824,"teacher_disagreement_score":0.9738526,"about_ca_system_score_codex":0.00002265063,"about_ca_system_score_gemma":0.000028732922,"threshold_uncertainty_score":0.13357463},"labels":[],"label_agreement":null},{"id":"W4231603837","doi":"10.22215/etd/2013-09622","title":"Verification methodology for DEVS models","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"DEVS; Computer science; Humanities; Operating system; Art; Simulation; Modeling and simulation","score_opus":0.20379508460330156,"score_gpt":0.39299878088647966,"score_spread":0.1892036962831781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231603837","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.0005361645,0.00015421087,0.97101307,0.000073491115,0.002336899,0.0009728088,0.0000035656835,0.00029244597,0.024617363],"genre_scores_gemma":[0.0009424851,0.0000492539,0.97530085,0.00014312025,0.00009685168,0.0010321998,0.00041738802,0.00003122666,0.021986604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813086,0.0002382983,0.00047061234,0.0006445495,0.00022275794,0.00029290034],"domain_scores_gemma":[0.99772817,0.00032126965,0.00038011427,0.0010164215,0.00048326995,0.00007077148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001123018,0.00024654568,0.00032417048,0.00023070072,0.00012031523,0.00015005893,0.0013501385,0.00047362974,0.000039630864],"category_scores_gemma":[0.0003481598,0.000235389,0.00013182315,0.000248932,0.00001789016,0.0009854414,0.000039465234,0.00018486257,0.00013089173],"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.000013185792,0.000015948028,2.143435e-7,0.00008455154,0.000016467236,6.343791e-8,0.00059499533,0.00009078459,0.0025966493,0.86843765,0.0018628335,0.12628667],"study_design_scores_gemma":[0.00022068876,0.00010558714,0.00019975992,0.000025756466,0.00003131807,0.0000035984808,0.00022014875,0.62374455,0.06823644,0.29830834,0.008409684,0.0004941439],"about_ca_topic_score_codex":0.000055861292,"about_ca_topic_score_gemma":0.0000152342545,"teacher_disagreement_score":0.62365377,"about_ca_system_score_codex":0.00007522213,"about_ca_system_score_gemma":0.0001553821,"threshold_uncertainty_score":0.9598885},"labels":[],"label_agreement":null},{"id":"W4232773967","doi":"10.1007/978-3-540-69489-2_16","title":"Modelling and Analysis of Real Time and Embedded Systems – Using UML","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Unified Modeling Language; Perspective (graphical); Model transformation; Transformation (genetics); Software engineering; Data science; Programming language; Artificial intelligence; Software; Consistency (knowledge bases)","score_opus":0.055091772421228556,"score_gpt":0.30631898091861115,"score_spread":0.2512272084973826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232773967","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.0028379813,0.00047670497,0.99520844,0.00000898902,0.00037763178,0.00021644402,0.0000055814794,0.0000529369,0.00081530656],"genre_scores_gemma":[0.03894484,0.00008638138,0.96079534,0.000037494396,0.000074290256,9.8141e-7,0.0000028005127,0.000014392651,0.000043503365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973214,0.00006241981,0.0005829314,0.001008742,0.0006699616,0.00035450788],"domain_scores_gemma":[0.9979247,0.00039679013,0.00043835794,0.0008881939,0.00023293555,0.00011905034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024805758,0.0003097347,0.00066569966,0.0017702708,0.0001400902,0.00027972585,0.0010215829,0.0002677509,0.000001917949],"category_scores_gemma":[0.00004623204,0.00029394188,0.000075339645,0.0012066826,0.0006119022,0.0004985097,0.0006343534,0.00031090973,0.0000010464299],"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.0000041077733,0.000006286332,0.000039144823,0.000043541633,0.000049921455,0.000007929189,0.00073214056,0.8840743,0.00040065995,0.015524274,1.5278984e-7,0.09911758],"study_design_scores_gemma":[0.00006883319,0.00004652775,0.000050651044,0.00016772718,0.00008137892,0.000028126948,1.8562841e-7,0.9942168,0.0003904069,0.004656512,0.000009245389,0.0002836329],"about_ca_topic_score_codex":0.00013270459,"about_ca_topic_score_gemma":0.000006934432,"teacher_disagreement_score":0.110142514,"about_ca_system_score_codex":0.00013249203,"about_ca_system_score_gemma":0.0001377364,"threshold_uncertainty_score":0.99995124},"labels":[],"label_agreement":null},{"id":"W4233082099","doi":"10.1145/2578855.2535881","title":"Fair reactive programming","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Liveness; Mathematical proof; Linear logic; Computer science; Calculus (dental); Mathematics; Constructive; Fixed point; Type theory; Operational semantics; Normalization (sociology); Semantics (computer science); Algebra over a field; Theoretical computer science; Programming language; Type (biology); Pure mathematics","score_opus":0.02960920620908831,"score_gpt":0.29361434681604137,"score_spread":0.26400514060695307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233082099","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.047863115,0.00003043771,0.93935513,0.00062301796,0.0006307224,0.00018182717,7.2019486e-7,0.00042120737,0.010893804],"genre_scores_gemma":[0.45528185,6.9025725e-7,0.5444647,0.000119239085,0.000070672715,0.000011403629,0.00000151649,0.000004345014,0.00004558947],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989923,0.00013372362,0.0001486177,0.00029265258,0.00020858072,0.0002241214],"domain_scores_gemma":[0.99845797,0.00036306155,0.00012994246,0.00093022286,0.000055203116,0.0000635781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006622543,0.00009775971,0.00010525539,0.0000634532,0.00010278126,0.00015983357,0.0014089867,0.00005226826,0.0000050314416],"category_scores_gemma":[0.0011412066,0.0000864664,0.000029086235,0.00022568092,0.000041943465,0.0007864421,0.00025325597,0.0001156364,0.00015488661],"study_design_candidate":"design_other","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.000007977767,0.000046842655,0.0015841413,0.000026126754,0.000013464327,0.0000027273152,0.0016199219,0.000054561864,0.001431377,0.23490447,0.00022821903,0.76008016],"study_design_scores_gemma":[0.0011063843,0.0011200664,0.08158761,0.00014942116,0.000057259665,0.00005501022,0.0005559571,0.29686764,0.09754089,0.0565424,0.46284816,0.0015691716],"about_ca_topic_score_codex":0.000033173554,"about_ca_topic_score_gemma":0.000006586953,"teacher_disagreement_score":0.758511,"about_ca_system_score_codex":0.000021647471,"about_ca_system_score_gemma":0.00001622404,"threshold_uncertainty_score":0.35259977},"labels":[],"label_agreement":null},{"id":"W4233326341","doi":"10.1109/cdc.1995.479065","title":"Macro control languages and decision procedures for COCOLOG","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"McGill University","funders":"","keywords":"Simple (philosophy); Simplicity; Representation (politics); Macro; Computer science; Control (management); Action (physics); Set (abstract data type); Control system; Fragment (logic); Automatic control; Mathematics; Theoretical computer science; Discrete mathematics; Algebra over a field; Algorithm; Programming language; Pure mathematics; Artificial intelligence; Control engineering","score_opus":0.022217850914513823,"score_gpt":0.3288434790831521,"score_spread":0.30662562816863825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233326341","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.0070177065,0.00023962797,0.98955095,0.00034771918,0.000079182195,0.00034740975,0.0000011068399,0.000098887795,0.0023173862],"genre_scores_gemma":[0.32148114,0.000013545047,0.6777445,0.00043059816,0.000019032817,0.00005293897,1.3617867e-7,0.0000023131158,0.00025579144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954295,0.000015338952,0.000093466246,0.00016400227,0.00007349461,0.000110766494],"domain_scores_gemma":[0.99949545,0.00021933886,0.000031603195,0.00017827176,0.000042122476,0.00003320048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022071932,0.000050347728,0.00006795473,0.000034312136,0.00006239709,0.00006604638,0.00022678774,0.000035137025,0.00002477772],"category_scores_gemma":[0.00032142916,0.000038507933,0.000015594922,0.000070004906,0.00002322144,0.00021276524,0.000036248905,0.000026180673,0.000014451441],"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.000014656564,0.000036890848,0.0003792467,0.000025644476,0.000006079435,0.0000011463629,0.0003123935,0.00001547661,0.0016419159,0.30636936,0.008637195,0.68256],"study_design_scores_gemma":[0.0015791361,0.0003006092,0.009322375,0.000015050248,0.000007373657,0.000038639417,0.000058594647,0.94088227,0.007643663,0.028680515,0.01125436,0.00021739391],"about_ca_topic_score_codex":0.000001961369,"about_ca_topic_score_gemma":0.0000039705715,"teacher_disagreement_score":0.9408668,"about_ca_system_score_codex":0.00000812127,"about_ca_system_score_gemma":0.000004839326,"threshold_uncertainty_score":0.15703079},"labels":[],"label_agreement":null},{"id":"W4233495392","doi":"10.1007/978-0-85729-277-3_11","title":"Temporal Logic","year":2011,"lang":"en","type":"book-chapter","venue":"Texts in computer science","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":"Computer science","score_opus":0.07963219756282458,"score_gpt":0.3031907489324207,"score_spread":0.22355855136959613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233495392","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.000014374563,0.00014441501,0.76439756,0.000074064854,0.0021038414,0.0002514248,0.000001464966,0.00023389749,0.23277897],"genre_scores_gemma":[0.004090315,0.000038940594,0.97196263,0.0005667099,0.00021306053,0.00001071795,0.0000017343268,0.000025117344,0.02309076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963756,0.000047198973,0.0006140564,0.0014362055,0.0009142236,0.0006126663],"domain_scores_gemma":[0.9969461,0.000068512534,0.0003907505,0.002192005,0.00021155224,0.00019109006],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002186744,0.00041968893,0.00041717268,0.0008984719,0.00018962896,0.00032298555,0.006308654,0.00025856425,0.00008132533],"category_scores_gemma":[0.000040560455,0.00039858578,0.000102477024,0.00050276634,0.00095926813,0.0013579191,0.0020802629,0.0006029093,0.00063770445],"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.0000014875708,0.000017123117,0.000015989688,0.000011207054,0.0000019911697,0.00003089386,0.00026846523,0.000035387147,0.0000069162024,0.7561135,0.00018960027,0.24330743],"study_design_scores_gemma":[0.00023415731,0.0002868872,0.0009918349,0.00027503615,0.0000051063253,0.00011827917,4.894091e-7,0.124302,0.00032503862,0.835292,0.03712526,0.0010439033],"about_ca_topic_score_codex":0.00002008513,"about_ca_topic_score_gemma":0.0000075274434,"teacher_disagreement_score":0.24226353,"about_ca_system_score_codex":0.00027214843,"about_ca_system_score_gemma":0.0004739299,"threshold_uncertainty_score":0.9998466},"labels":[],"label_agreement":null},{"id":"W4233622121","doi":"10.1109/formalise.2017.11","title":"Correct Safety Critical Hardware Descriptions via Static Analysis and Theorem Proving","year":2017,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Automated theorem proving; Embedding; Computer science; Automation; Programming language; Semantics (computer science); Proof assistant; Function (biology); Programmable logic controller; Software; Theoretical computer science; Mathematics; Artificial intelligence; Mathematical proof; Engineering","score_opus":0.03411847254174925,"score_gpt":0.33221525445003214,"score_spread":0.29809678190828287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233622121","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.002389415,0.000016603128,0.990551,0.0007072917,0.0002584848,0.00009950466,0.0000029757944,0.000103717415,0.0058710137],"genre_scores_gemma":[0.4671336,0.000004552561,0.53257746,0.000072696435,0.000011180957,0.0000068627883,9.1468905e-7,0.0000026273597,0.00019010213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990383,0.0001312704,0.00018296132,0.00029855696,0.00016448321,0.00018443797],"domain_scores_gemma":[0.9985616,0.00017905376,0.0000761422,0.0009853785,0.00010698863,0.00009079743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073754496,0.0000869844,0.00014762812,0.00011207062,0.0006917368,0.00058746495,0.0006734338,0.000036754096,0.00004359702],"category_scores_gemma":[0.0011820898,0.00007264608,0.00005441609,0.00018451575,0.00018688204,0.001096598,0.00026240447,0.000093419454,0.000018291401],"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.0000083624045,0.000042247037,0.009329189,0.000026948186,0.000084986335,0.0000048143975,0.00079943775,0.000038980423,0.0007279188,0.75511926,0.00008964938,0.23372817],"study_design_scores_gemma":[0.00009663194,0.00004362926,0.121801436,0.000011467355,0.000107995904,0.000012084849,0.00006998363,0.8577337,0.0017075136,0.017904546,0.00034462727,0.00016638087],"about_ca_topic_score_codex":0.000088192566,"about_ca_topic_score_gemma":0.000056506422,"teacher_disagreement_score":0.85769475,"about_ca_system_score_codex":0.000033504322,"about_ca_system_score_gemma":0.000027627822,"threshold_uncertainty_score":0.5664938},"labels":[],"label_agreement":null},{"id":"W4233995506","doi":"10.1109/icse.2001.919114","title":"A framework for multi-valued reasoning over inconsistent viewpoints","year":2005,"lang":"en","type":"article","venue":"Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":85,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Viewpoints; Computer science; Negotiation; Theoretical computer science; Artificial intelligence; Model checking; Machine learning","score_opus":0.0757266652675412,"score_gpt":0.34004848790132863,"score_spread":0.26432182263378745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233995506","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.01928774,0.000030569612,0.9781004,0.00049123185,0.0009943052,0.00038778523,0.000016773405,0.00022058524,0.00047056575],"genre_scores_gemma":[0.097782284,0.000030494515,0.90137386,0.0002984453,0.00016021113,0.00009830732,0.0000019559907,0.000022007245,0.00023245144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984245,0.0000075132843,0.00040526674,0.0003746586,0.0004968966,0.0002911683],"domain_scores_gemma":[0.99854463,0.000069286325,0.00033119236,0.00026477646,0.00070458755,0.000085537235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059119624,0.00021896129,0.00021152933,0.00016106118,0.000078605124,0.00014728878,0.0017259357,0.00012546063,0.000036238423],"category_scores_gemma":[0.0037694788,0.00018504419,0.00015530144,0.00026297526,0.000045780955,0.0005947479,0.00030271438,0.00030940815,0.000013376435],"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.000026708918,0.000087948145,0.00084764505,0.000044096654,0.0000427697,1.1322285e-7,0.0002868095,0.00054161274,0.00073403324,0.99276596,0.00047131983,0.0041509755],"study_design_scores_gemma":[0.00045687275,0.000076080025,0.004678819,0.00055186247,0.00001214664,0.000010811328,0.000023708757,0.9739257,0.012624866,0.0041489685,0.003219393,0.0002707809],"about_ca_topic_score_codex":0.0000045148417,"about_ca_topic_score_gemma":6.8305656e-7,"teacher_disagreement_score":0.988617,"about_ca_system_score_codex":0.00019512563,"about_ca_system_score_gemma":0.00005758389,"threshold_uncertainty_score":0.7545883},"labels":[],"label_agreement":null},{"id":"W4234766501","doi":"10.1145/781143.781144","title":"Points-to analysis using BDDs","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary decision diagram; Computer science; Algorithm; Solver; Model checking; Simple (philosophy); Data structure; Theoretical computer science; Programming language","score_opus":0.05826976372535029,"score_gpt":0.3475587982911371,"score_spread":0.2892890345657868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234766501","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.019804921,0.000005172661,0.9612494,0.000075767646,0.00013506725,0.000043449465,1.1332032e-7,0.00007359398,0.018612532],"genre_scores_gemma":[0.15992106,3.119886e-7,0.8394257,0.00039940744,0.0000057309,0.0000016725102,1.0827901e-7,0.0000019750241,0.00024404412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930173,0.00010135762,0.00011978763,0.00019952148,0.00014351879,0.00013406355],"domain_scores_gemma":[0.9993156,0.00002093804,0.000028706534,0.00051801617,0.00005018681,0.00006650394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061876583,0.000050970168,0.00008198614,0.00020967989,0.0000537227,0.000069982736,0.00034821586,0.00002224282,0.00008178167],"category_scores_gemma":[0.00015176159,0.000045858265,0.00005069692,0.0019725533,0.000008229325,0.00026853988,0.000050976432,0.000032698106,0.00009821397],"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":[5.97768e-7,0.000017226213,0.0019407341,0.0000013868793,0.000043477336,8.975338e-7,0.00023007867,0.0026397258,0.0014605003,0.9868561,0.00009396322,0.0067153354],"study_design_scores_gemma":[0.000089567584,0.000033556847,0.0067266375,0.0000024173069,0.00005960908,0.0000055997575,0.00005271453,0.92503077,0.053222306,0.0064117145,0.008116455,0.0002486399],"about_ca_topic_score_codex":0.000017802251,"about_ca_topic_score_gemma":0.000003928943,"teacher_disagreement_score":0.9804444,"about_ca_system_score_codex":0.000037059435,"about_ca_system_score_gemma":0.000020706071,"threshold_uncertainty_score":0.18700458},"labels":[],"label_agreement":null},{"id":"W4235108696","doi":"10.1109/ishls.1994.302332","title":"A divide-and-conquer approach for asynchronous interface synthesis","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Calgary","funders":"Chengdu University of Information Technology","keywords":"Asynchronous communication; Computer science; Divide and conquer algorithms; Interface (matter); High-level synthesis; Graph; Theoretical computer science; Digital electronics; Computer engineering; Computer architecture; Distributed computing; Parallel computing; Electronic circuit; Algorithm; Embedded system; Computer network","score_opus":0.05022010518522898,"score_gpt":0.2773994245491495,"score_spread":0.22717931936392052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235108696","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.00061462563,0.00015903488,0.9786694,0.00033175832,0.00009751279,0.00023719999,0.0000010497441,0.0001617985,0.019727638],"genre_scores_gemma":[0.36555362,0.000009440111,0.63375956,0.00008948044,0.000019234287,0.000101904996,1.4370227e-7,0.0000049102878,0.00046171804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992147,0.000053641663,0.00014939337,0.00030196065,0.0000965314,0.00018379248],"domain_scores_gemma":[0.999266,0.00018643239,0.000046938243,0.00041032367,0.000036757618,0.000053502557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039228247,0.000092261274,0.00011357502,0.000052354968,0.00007877124,0.00010875053,0.00046745274,0.000049470043,0.000045887744],"category_scores_gemma":[0.00023016236,0.0000771836,0.00003499258,0.000113102666,0.000043287087,0.000414744,0.00013591845,0.00005238378,0.000034491015],"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.0000043436053,0.000104830855,0.000091438,0.000055653953,0.00002239122,2.8610202e-7,0.00087105454,0.00013662037,0.0006450401,0.26064762,0.002180088,0.73524064],"study_design_scores_gemma":[0.00011707666,0.00005954246,0.0002040287,0.000006227175,0.0000069826115,0.000016599659,0.000018702798,0.9711713,0.021795824,0.0020697548,0.0043713744,0.00016256055],"about_ca_topic_score_codex":0.000006795128,"about_ca_topic_score_gemma":3.1559182e-7,"teacher_disagreement_score":0.9710347,"about_ca_system_score_codex":0.000027232636,"about_ca_system_score_gemma":0.000004693609,"threshold_uncertainty_score":0.3147456},"labels":[],"label_agreement":null},{"id":"W4235412025","doi":"10.1145/3397619.3397620","title":"Verification column","year":2020,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Column (typography); Computer science; Focus (optics); Quarter (Canadian coin); Automaton; Artificial intelligence; Telecommunications","score_opus":0.07760133858126825,"score_gpt":0.2978954237337485,"score_spread":0.22029408515248025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235412025","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.0075385636,0.00006556097,0.9750484,0.010577934,0.00039734546,0.00019296618,0.0000012958983,0.0003721223,0.005805787],"genre_scores_gemma":[0.21862534,0.000020238962,0.7771962,0.0038970949,0.00013842164,0.000023856455,0.00000400358,0.0000077672075,0.00008706462],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990331,0.000097316035,0.00019343405,0.00033199755,0.00017970339,0.00016446802],"domain_scores_gemma":[0.998695,0.00006801381,0.00009260544,0.0009816614,0.000051713836,0.00011100274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018776534,0.000084092804,0.00009976955,0.000026766184,0.000073929696,0.00009543051,0.0016049005,0.000057711874,0.000030068888],"category_scores_gemma":[0.0009937162,0.00008733316,0.000036806912,0.0004520997,0.000029881096,0.0005114443,0.00027741233,0.000107131615,0.00065946294],"study_design_candidate":"not_applicable","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.000024635588,0.000068158595,0.0028559742,0.000036365946,0.000018496987,0.000008564106,0.003411357,0.00012661252,0.05084654,0.36461213,0.04474605,0.5332451],"study_design_scores_gemma":[0.0008558157,0.0005086463,0.033090565,0.000015195157,0.00001702325,0.000018896071,0.00017975627,0.17349726,0.07281586,0.020622743,0.6976135,0.0007647358],"about_ca_topic_score_codex":0.00002033749,"about_ca_topic_score_gemma":0.0000018728933,"teacher_disagreement_score":0.65286744,"about_ca_system_score_codex":0.000027408325,"about_ca_system_score_gemma":0.000040535906,"threshold_uncertainty_score":0.8476282},"labels":[],"label_agreement":null},{"id":"W4235671471","doi":"10.3233/fi-2011-375","title":"Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Formal Methods in Verification","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Loop (graph theory); Constraint (computer-aided design); Aggregate (composite); Mathematics; Computer science; Algorithm; Theoretical computer science; Combinatorics; Geometry; Materials science","score_opus":0.2274904078581922,"score_gpt":0.3111795232392483,"score_spread":0.08368911538105611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235671471","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.066940725,0.00002418164,0.92229426,0.00012796532,0.00039164853,0.0011696176,0.000008906847,0.00020308333,0.008839606],"genre_scores_gemma":[0.19762552,0.000009768951,0.80154204,0.00050684315,0.000023344912,0.00019899836,0.0000113537335,0.000008806946,0.000073315685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846035,0.0000357506,0.0005905649,0.00023202682,0.00022594127,0.00045536575],"domain_scores_gemma":[0.99885005,0.0000626088,0.0003158386,0.00051228196,0.00010466202,0.00015454697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078970124,0.00020806235,0.00022429337,0.000152533,0.00021123397,0.00023929637,0.0006559196,0.000104121296,0.000026374875],"category_scores_gemma":[0.00010156593,0.00017822812,0.0000659409,0.0002547543,0.00014234243,0.0018405741,0.00028924187,0.00014345847,0.000060520724],"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.000017564176,0.000072978786,0.00041675678,0.00019438205,0.00004241541,0.0000013444536,0.008497757,3.5728854e-7,0.00045259696,0.45965856,0.00009066924,0.53055465],"study_design_scores_gemma":[0.009024795,0.0044724434,0.021821216,0.0010564771,0.00012562262,0.0006548787,0.008154131,0.56962353,0.105543084,0.217809,0.05818749,0.0035273156],"about_ca_topic_score_codex":0.000013189322,"about_ca_topic_score_gemma":0.0000020695136,"teacher_disagreement_score":0.5696232,"about_ca_system_score_codex":0.00007311349,"about_ca_system_score_gemma":0.000061940154,"threshold_uncertainty_score":0.72679317},"labels":[],"label_agreement":null},{"id":"W4236160500","doi":"10.1109/iceccs20050.2012.6299219","title":"Translating PDDL into CSP# - The PAT Approach","year":2012,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"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":"","keywords":"Computer science; Notation; Model checking; Set (abstract data type); Domain (mathematical analysis); Process (computing); Programming language; State (computer science); Modeling language; Software engineering; Software","score_opus":0.052213782781666586,"score_gpt":0.30171683489440515,"score_spread":0.24950305211273857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236160500","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.00192141,0.000115737355,0.9270179,0.00043956793,0.00027233077,0.000097653865,5.8640403e-8,0.00011970319,0.070015624],"genre_scores_gemma":[0.39962777,0.0000010047744,0.5999963,0.00017457592,0.000060708273,0.000011708315,2.6593497e-7,0.0000026079008,0.00012499916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925864,0.00012361446,0.00012636931,0.00012370781,0.00016325474,0.00020441423],"domain_scores_gemma":[0.9993673,0.000051457184,0.00003698295,0.00047879305,0.000018512428,0.00004695263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011360543,0.000063392596,0.00005383114,0.000022215136,0.0001426806,0.0000668647,0.00066898455,0.000032919255,0.00001286888],"category_scores_gemma":[0.00004116353,0.000037606267,0.00003121044,0.00023365417,0.00003348827,0.00074999133,0.00007799247,0.00009834699,0.000059173373],"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":[7.1020196e-7,0.000028710543,0.00063422794,0.000007710499,0.0000034112118,3.3911526e-8,0.007827304,0.000025806996,0.0006086874,0.65100473,0.00011085308,0.3397478],"study_design_scores_gemma":[0.00025291432,0.000050361654,0.012720355,0.000008457722,0.00001061647,0.000034257948,0.000963187,0.92486465,0.016128283,0.011577743,0.032974668,0.0004144888],"about_ca_topic_score_codex":0.000026080152,"about_ca_topic_score_gemma":9.258264e-7,"teacher_disagreement_score":0.92483884,"about_ca_system_score_codex":0.000016431131,"about_ca_system_score_gemma":0.000010638482,"threshold_uncertainty_score":0.15335391},"labels":[],"label_agreement":null},{"id":"W4236854803","doi":"10.1145/3178126.3187006","title":"ROCS","year":2018,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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 Waterloo","funders":"","keywords":"Computer science; Usability; Nonlinear system; Nonlinear dynamical systems; Control (management); Human–computer interaction; Artificial intelligence","score_opus":0.02828522585651348,"score_gpt":0.3114379991752826,"score_spread":0.2831527733187691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236854803","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.0013230806,0.0000024961387,0.84773445,0.00015203447,0.00027024784,0.000016098962,1.8340822e-8,0.00012242458,0.15037917],"genre_scores_gemma":[0.12548576,4.078448e-7,0.8729709,0.00036829046,0.00005989149,0.0000012923497,3.6786705e-8,9.242036e-7,0.001112481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973345,0.000014679298,0.000043588538,0.00008359137,0.000060700175,0.00006396378],"domain_scores_gemma":[0.99964255,0.000007330067,0.000011494915,0.00028335405,0.00003679977,0.000018488476],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015478382,0.000020589267,0.000019226258,0.00001783847,0.00003464996,0.000030166802,0.0003528582,0.000012314236,0.00005517046],"category_scores_gemma":[0.000029979314,0.00001663533,0.000007241201,0.00013199139,0.000022702206,0.00024501482,0.00006711116,0.000016174314,0.00079691247],"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":[2.5152454e-7,0.0000034437733,0.000043711494,3.7053638e-7,4.681167e-7,9.962054e-8,0.00009134137,1.8253536e-7,0.0005997116,0.9107107,0.0015128204,0.08703693],"study_design_scores_gemma":[0.00012901289,0.00019404654,0.011778679,0.0000034626853,0.0000010212549,0.000016496184,0.000015652906,0.396533,0.2938654,0.04838863,0.24888542,0.00018914789],"about_ca_topic_score_codex":0.0000035419584,"about_ca_topic_score_gemma":8.789988e-7,"teacher_disagreement_score":0.86232203,"about_ca_system_score_codex":0.0000060518064,"about_ca_system_score_gemma":0.000007657296,"threshold_uncertainty_score":0.9999811},"labels":[],"label_agreement":null},{"id":"W4237139188","doi":"10.1145/2578855.2535858","title":"Consistency analysis of decision-making programs","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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":"","keywords":"Computer science; Nondeterministic algorithm; Consistency (knowledge bases); Correctness; Solver; Program analysis; Algorithm; Set (abstract data type); Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.03471500761947407,"score_gpt":0.3257529702881921,"score_spread":0.29103796266871806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237139188","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.19846699,0.000058041973,0.79805344,0.00006043036,0.00024838516,0.000090220776,0.0000013866518,0.00009286024,0.0029282265],"genre_scores_gemma":[0.5243224,0.000001356347,0.47560802,0.000044510758,0.000012066773,0.0000034499908,0.0000017664828,0.0000023252078,0.0000041326184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987577,0.0001324404,0.0003328394,0.0002872954,0.00031732838,0.00017240134],"domain_scores_gemma":[0.997043,0.0012164714,0.00028625975,0.0012904553,0.000119375785,0.000044447956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009456091,0.00009409043,0.0002490585,0.00028383406,0.00007330783,0.000092595954,0.0015480408,0.00005343347,0.00001573254],"category_scores_gemma":[0.0021922942,0.00008051775,0.00010041519,0.0013087966,0.00007110805,0.0003670453,0.00026029762,0.00006692943,0.000019962923],"study_design_candidate":"design_other","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.000009426059,0.00006097032,0.02439121,0.000022366974,0.00017440885,0.0000019347883,0.000716526,0.00096313754,0.00017040549,0.1064462,0.000025995585,0.8670174],"study_design_scores_gemma":[0.00018539645,0.00023206254,0.14646205,0.00011278482,0.00044105412,0.0000044328126,0.00009865287,0.82985324,0.0011307404,0.018997433,0.0021633971,0.00031875103],"about_ca_topic_score_codex":0.000021836213,"about_ca_topic_score_gemma":0.000033276323,"teacher_disagreement_score":0.8666987,"about_ca_system_score_codex":0.000012570634,"about_ca_system_score_gemma":0.000019737483,"threshold_uncertainty_score":0.32834187},"labels":[],"label_agreement":null},{"id":"W4237512363","doi":"10.1109/iccad.2014.7001426","title":"Multiple clock domain synchronization in a QBF-based verification environment","year":2014,"lang":"en","type":"article","venue":"2014 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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":"","keywords":"Computer science; Overhead (engineering); Synchronization (alternating current); Model checking; Clock synchronization; Formal verification; Boolean satisfiability problem; Theoretical computer science; Algorithm; Parallel computing; Embedded system; Programming language","score_opus":0.06340559574712286,"score_gpt":0.2853163085096436,"score_spread":0.22191071276252078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237512363","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.005730732,0.000015154162,0.98860836,0.0017549511,0.0019176021,0.00072093966,0.000009016133,0.00025776363,0.0009854648],"genre_scores_gemma":[0.50301206,0.00002502989,0.4960657,0.00045002453,0.00020623606,0.0001191686,0.000046034453,0.000022953702,0.000052769567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537235,0.0010723829,0.0008841841,0.0011685259,0.0010044179,0.0004981195],"domain_scores_gemma":[0.9966448,0.00068614073,0.0005379289,0.0016725394,0.0002781266,0.00018049346],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019918464,0.0004481557,0.00038228917,0.00059828366,0.00016544157,0.00040603292,0.0030022867,0.00024344145,0.00012487751],"category_scores_gemma":[0.0003470219,0.0004755801,0.00011551401,0.0003471336,0.00012477052,0.0008002987,0.0002515855,0.0004148786,0.00080036756],"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.00029188744,0.0009182617,0.0016774152,0.000052081417,0.00006454839,0.000015862106,0.0006895487,0.22293043,0.017235268,0.6033138,0.0028693683,0.14994149],"study_design_scores_gemma":[0.0014235597,0.0004312457,0.0040506963,0.00012247782,0.000005606845,0.000008644835,0.000009872611,0.9618952,0.0092944335,0.019470882,0.0028023086,0.0004850525],"about_ca_topic_score_codex":0.000056398727,"about_ca_topic_score_gemma":0.000008740878,"teacher_disagreement_score":0.7389648,"about_ca_system_score_codex":0.0005954866,"about_ca_system_score_gemma":0.00019120857,"threshold_uncertainty_score":0.99997765},"labels":[],"label_agreement":null},{"id":"W4237615549","doi":"10.1007/3-540-44977-9_5","title":"Simulation of Gate Circuits in the Algebra of Transients","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"SIGNAL (programming language); Computer science; Binary number; State (computer science); Algorithm; Transient (computer programming); Electronic circuit; Word (group theory); Process (computing); Logic gate; Theoretical computer science; Arithmetic; Mathematics; Programming language; Electrical engineering; Engineering","score_opus":0.035443016791599315,"score_gpt":0.2878685339540906,"score_spread":0.2524255171624913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237615549","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.0009165244,0.00015830447,0.99611706,0.00011758439,0.00068364566,0.000421302,0.0000027815643,0.000018807856,0.00156397],"genre_scores_gemma":[0.6770094,0.000012437014,0.32253113,0.00038471955,0.000033568518,0.000004016149,0.000001345772,0.000010659669,0.000012708003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713594,0.00014500329,0.0007127337,0.0006915396,0.0009961639,0.0003186192],"domain_scores_gemma":[0.9972982,0.0007472445,0.00046382,0.0012176842,0.00023302973,0.000040054318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002298433,0.00026452084,0.00039540787,0.00067755743,0.00006137477,0.0000716438,0.0028846387,0.00020975345,0.0000053140393],"category_scores_gemma":[0.00024497847,0.0002103948,0.00009442918,0.0010332506,0.00053859287,0.0004787854,0.00016949157,0.0004419667,0.0000029106402],"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.0000028734185,0.000038781225,0.00005818511,0.00006256849,0.0000037153104,0.0000050682324,0.0028897752,0.6285298,0.00022444662,0.040413614,8.70382e-7,0.32777032],"study_design_scores_gemma":[0.00021286767,0.00013530045,0.00089694205,0.00026728926,0.0000052249993,0.000009094761,3.6908085e-7,0.8889503,0.0036577666,0.10547709,0.00014462198,0.000243173],"about_ca_topic_score_codex":0.000010453764,"about_ca_topic_score_gemma":0.000011550171,"teacher_disagreement_score":0.67609286,"about_ca_system_score_codex":0.00009748634,"about_ca_system_score_gemma":0.00018356898,"threshold_uncertainty_score":0.8579651},"labels":[],"label_agreement":null},{"id":"W4237740194","doi":"10.1109/iccad.2013.6691124","title":"FPGA acceleration of enhanced boolean constraint propagation for SAT solvers","year":2013,"lang":"en","type":"article","venue":"2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Hardware acceleration; Field-programmable gate array; Parallel computing; Boolean satisfiability problem; Gate array; Embedded system; Software; Multi-core processor; Computer architecture; Computer hardware; Theoretical computer science; Operating system","score_opus":0.1346806322324103,"score_gpt":0.32981276578751323,"score_spread":0.19513213355510292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237740194","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.012428621,0.000007755337,0.97985864,0.0016300114,0.0026655367,0.0018969288,0.000015071012,0.00021645168,0.0012809597],"genre_scores_gemma":[0.506542,0.000022239374,0.49248254,0.00027419123,0.00019976262,0.00027097543,0.000039731454,0.00001737364,0.00015116739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666286,0.00030873608,0.00096865854,0.0008389821,0.0007888738,0.0004319123],"domain_scores_gemma":[0.9957249,0.00051334675,0.00079205044,0.0010001734,0.001807189,0.00016230467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009358671,0.0003908227,0.00040673514,0.00040493035,0.00016660258,0.00051858317,0.0024346632,0.00020787698,0.00021195777],"category_scores_gemma":[0.00029317525,0.00038231164,0.00017049628,0.00026625895,0.00018302888,0.0018308577,0.00020835431,0.00027143056,0.00028272765],"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.0001662591,0.00037089665,0.000028698694,0.00007999266,0.00016369681,0.0000018933711,0.0010773793,0.009798396,0.24904832,0.44951683,0.009037206,0.28071043],"study_design_scores_gemma":[0.0008220149,0.0006454657,0.0005065697,0.00012626607,0.000009678886,0.000008043537,0.00004103352,0.7259926,0.24493371,0.026375117,0.00019147355,0.00034800882],"about_ca_topic_score_codex":0.000071287875,"about_ca_topic_score_gemma":0.0000050924255,"teacher_disagreement_score":0.7161942,"about_ca_system_score_codex":0.00022522244,"about_ca_system_score_gemma":0.00029727834,"threshold_uncertainty_score":0.9998629},"labels":[],"label_agreement":null},{"id":"W4238169244","doi":"10.1090/fim/027/12","title":"SDP representability","year":2010,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Formal Methods in Verification","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","score_opus":0.028573301564991268,"score_gpt":0.2943857990034422,"score_spread":0.2658124974384509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238169244","genre_codex":"other","genre_gemma":"methods","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.000031992295,0.000009633122,0.44741789,0.00016031967,0.00014646814,0.00031433682,0.0000054219527,0.00031302412,0.55160093],"genre_scores_gemma":[0.00039644353,0.000009365242,0.82631105,0.0006044645,0.00017306348,0.000047899113,0.0000036905722,0.000059637325,0.17239441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971125,0.000059789047,0.0006967581,0.000927691,0.0007533623,0.0004498708],"domain_scores_gemma":[0.9958365,0.00044143747,0.0006125428,0.0026945604,0.00015160949,0.00026334068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009967887,0.0004686176,0.0007594022,0.000037588336,0.00020039844,0.00015770846,0.0017668699,0.00040242972,0.00024759388],"category_scores_gemma":[0.00019855594,0.0004231845,0.0007407188,0.00005001122,0.001807364,0.00012702307,0.00078525307,0.0012352196,0.00055814],"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.000001847539,0.000023376597,0.000001274486,0.000074682124,0.000056221994,0.0000022071613,0.000747835,1.2490852e-7,0.00034239655,0.9557781,0.00054165965,0.04243023],"study_design_scores_gemma":[0.000106250016,0.000103206985,0.000016905715,0.00007006118,0.000049175993,0.000034887304,0.000046827565,0.003299105,0.0019681905,0.89109993,0.10253552,0.0006699438],"about_ca_topic_score_codex":0.000012984393,"about_ca_topic_score_gemma":0.0000013501909,"teacher_disagreement_score":0.3792065,"about_ca_system_score_codex":0.00013425195,"about_ca_system_score_gemma":0.00013599824,"threshold_uncertainty_score":0.999822},"labels":[],"label_agreement":null},{"id":"W4238413752","doi":"10.1109/sefm.2004.1347541","title":"Verification of the WAP transaction layer","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Computer science; Protocol (science); Model checking; Deadlock; Wireless Application Protocol; Database transaction; Layer (electronics); Set (abstract data type); Computer network; Distributed transaction; Distributed computing; Transaction processing; Wireless; Database; Operating system; Programming language; Wireless network","score_opus":0.03307837744394473,"score_gpt":0.27884271732014915,"score_spread":0.2457643398762044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238413752","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.023699868,0.000008182651,0.9704222,0.00075477065,0.00031195508,0.000086931934,1.9293913e-7,0.00005126622,0.0046646246],"genre_scores_gemma":[0.6600144,0.0000027345116,0.339824,0.000063536216,0.0000069721914,0.0000041875373,1.1063155e-7,0.0000014637064,0.00008259776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995395,0.000034346653,0.00011947491,0.00010411766,0.00014156241,0.00006101999],"domain_scores_gemma":[0.9994258,0.000007957101,0.000057920326,0.00045210173,0.000043349402,0.00001284022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002194717,0.000036305024,0.000038109443,0.000022747376,0.00004494827,0.00001398905,0.0004300096,0.000028693727,0.000008650245],"category_scores_gemma":[0.000020070514,0.000024036297,0.000033785927,0.00026850938,0.000026726646,0.00031577423,0.000015314301,0.000046426514,0.000017788889],"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.0000025125344,0.000039364484,0.00005273119,0.0000068233976,0.0000030812837,3.738421e-8,0.00058464333,0.001403589,0.06916856,0.88498753,0.000016302954,0.04373483],"study_design_scores_gemma":[0.00016173438,0.000024614847,0.022373602,0.0000068795275,0.0000027178226,0.000003950953,0.000021660291,0.009009941,0.9541261,0.012868599,0.0013452667,0.00005490497],"about_ca_topic_score_codex":0.000030871408,"about_ca_topic_score_gemma":0.000002657711,"teacher_disagreement_score":0.88495755,"about_ca_system_score_codex":0.000032604392,"about_ca_system_score_gemma":0.0000300566,"threshold_uncertainty_score":0.09801717},"labels":[],"label_agreement":null},{"id":"W4238727895","doi":"10.1145/764825.764832","title":"Language emptiness checking using MDGs","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Model checking; Computer science; Emptiness; Automaton; Formal equivalence checking; Formal verification; Theoretical computer science; Programming language; Algorithm; Equivalence (formal languages); Mathematics; Discrete mathematics","score_opus":0.05497015897849935,"score_gpt":0.342186102579402,"score_spread":0.2872159436009027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238727895","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.09745178,0.000041814405,0.8812405,0.000014682001,0.0003979807,0.00004282854,6.171592e-8,0.000126383,0.020683967],"genre_scores_gemma":[0.26260933,5.791335e-7,0.7369723,0.00010915998,0.000020574917,0.0000014861146,1.1271995e-7,0.0000034592758,0.00028300637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993974,0.00007243195,0.00011117345,0.00016030092,0.00011520828,0.00014350213],"domain_scores_gemma":[0.99949074,0.000019432724,0.000042331223,0.00036824757,0.00004790101,0.000031371463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049003994,0.000056854387,0.00005804623,0.00004636208,0.0000625203,0.000072463445,0.0003118928,0.000028386778,0.000038531296],"category_scores_gemma":[0.0002193853,0.00005060358,0.000020328509,0.0002883007,0.000013211393,0.00040229806,0.000050009614,0.000051731797,0.00003397822],"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":[8.1505283e-7,0.000027234666,0.0011349571,0.00001330485,0.0000048378643,0.000005794479,0.0017804453,0.00023790821,0.027952699,0.9318115,0.000067029956,0.03696349],"study_design_scores_gemma":[0.000321269,0.00002641392,0.003898588,0.000025208665,0.0000056954573,0.00008488715,0.00041854632,0.45355323,0.53073806,0.0034746912,0.0070141233,0.0004392969],"about_ca_topic_score_codex":0.000020407424,"about_ca_topic_score_gemma":8.6411586e-7,"teacher_disagreement_score":0.9283368,"about_ca_system_score_codex":0.000026337386,"about_ca_system_score_gemma":0.000024004928,"threshold_uncertainty_score":0.20635541},"labels":[],"label_agreement":null},{"id":"W4239171042","doi":"10.1109/aspdac.2008.4483985","title":"Faster projection based methods for circuit level verification","year":2008,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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 British Columbia","funders":"","keywords":"Computer science; Reachability; Very-large-scale integration; Flip-flop; Formal verification; Computation; Digital electronics; Transistor; Reduction (mathematics); Electronic circuit; Computer engineering; Projection (relational algebra); Functional verification; Embedded system; Computer hardware; Algorithm; Electrical engineering; Engineering; Mathematics","score_opus":0.2806138205203848,"score_gpt":0.40583829579367886,"score_spread":0.12522447527329406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239171042","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.00048787965,0.000009229742,0.99394786,0.00020403166,0.0005543325,0.0005354457,0.0000015775647,0.00027268127,0.0039869808],"genre_scores_gemma":[0.020986484,0.000002436845,0.97739905,0.00033280542,0.000055100012,0.00024079483,0.0000063378848,0.0000102589,0.0009667455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988405,0.00020418028,0.0002448329,0.00037177812,0.00014407409,0.00019460211],"domain_scores_gemma":[0.9988948,0.00015194439,0.00010875971,0.0006070409,0.00019005947,0.0000473727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011297336,0.00010576252,0.00011057462,0.0001394475,0.0002036703,0.000050738585,0.00046973905,0.00007935805,0.000015284542],"category_scores_gemma":[0.00025665393,0.00009805475,0.000068077934,0.0003947997,0.000040253795,0.00066541915,0.00003194787,0.000069168855,0.00003145178],"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.000016351702,0.00008819278,0.00013619232,0.000031765783,0.000008776179,2.7958288e-7,0.0005853767,0.000040915536,0.039896633,0.25426573,0.000737101,0.7041927],"study_design_scores_gemma":[0.00033420182,0.00010810317,0.00696301,0.0000044115272,0.000004244221,0.00001841598,0.000013731131,0.7744899,0.20204176,0.002753848,0.013087749,0.00018064318],"about_ca_topic_score_codex":0.000012950383,"about_ca_topic_score_gemma":7.4342864e-7,"teacher_disagreement_score":0.774449,"about_ca_system_score_codex":0.00007524778,"about_ca_system_score_gemma":0.00010558991,"threshold_uncertainty_score":0.39985567},"labels":[],"label_agreement":null},{"id":"W4239208506","doi":"10.1007/978-3-642-21827-9_8","title":"Model Checking Epistemic and Probabilistic Properties of Multi-agent Systems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; Probabilistic logic; Formalism (music); Model checking; Exploit; Markov chain; Epistemic modal logic; Modal logic; Theoretical computer science; Probabilistic CTL; Temporal logic; Modal; Markov decision process; Artificial intelligence; Algorithm; Markov process; Machine learning; Description logic; Probabilistic analysis of algorithms; Multimodal logic; Mathematics","score_opus":0.10375025140732115,"score_gpt":0.2722667960767132,"score_spread":0.1685165446693921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239208506","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.0005501431,0.0018088324,0.9953685,0.00003830746,0.00095853454,0.0006926398,0.000002528887,0.00009326675,0.00048724306],"genre_scores_gemma":[0.40631825,0.00004775626,0.593365,0.00004780407,0.00004720526,0.000018550183,4.3888977e-7,0.000018824298,0.00013616553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971056,0.00006005311,0.0006860714,0.0011120315,0.00062763,0.00040863844],"domain_scores_gemma":[0.9977471,0.000086065906,0.0004958229,0.0012390855,0.00032199355,0.00010988258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014750748,0.0003947493,0.00052960566,0.0004883683,0.00013856251,0.00021800872,0.0021574798,0.00025484306,8.726581e-7],"category_scores_gemma":[0.00018576872,0.0003275081,0.00006521702,0.00027169366,0.0009861524,0.0005478695,0.0010744561,0.0004471581,0.000004620456],"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.000015895743,0.00008297715,0.000059913993,0.0015129307,0.000023712631,0.000013883409,0.007260352,0.3741222,0.0058476743,0.28205487,0.0000014949794,0.32900408],"study_design_scores_gemma":[0.00011924582,0.0000741329,0.00003281948,0.0010430882,0.00000793445,0.000048140053,2.501551e-7,0.96261466,0.002954897,0.032736473,0.00001704678,0.00035132948],"about_ca_topic_score_codex":0.000041975367,"about_ca_topic_score_gemma":0.000010407576,"teacher_disagreement_score":0.58849245,"about_ca_system_score_codex":0.00022612096,"about_ca_system_score_gemma":0.00036889839,"threshold_uncertainty_score":0.9999177},"labels":[],"label_agreement":null},{"id":"W4239560685","doi":"10.1109/dac.2005.193910","title":"Efficient SAT solving: beyond supercubes","year":2005,"lang":"en","type":"article","venue":"Proceedings. 42nd Design Automation Conference, 2005.","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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 British Columbia","funders":"","keywords":"Pruning; Computer science; Speedup; Boolean satisfiability problem; Benchmark (surveying); Maximum satisfiability problem; Solver; Theoretical computer science; Boolean function; Algorithm; Programming language; Parallel computing","score_opus":0.040639984663566754,"score_gpt":0.27470770246718795,"score_spread":0.2340677178036212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239560685","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.014754994,0.00012705171,0.9556574,0.00096463406,0.00039940377,0.0006291843,0.00000246625,0.0012471434,0.026217697],"genre_scores_gemma":[0.4382619,0.000015228381,0.5607064,0.00024162157,0.00013767563,0.000075218966,0.000003727744,0.000016268375,0.0005419694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710417,0.00007724939,0.00066569634,0.00072669797,0.00076221547,0.00066396745],"domain_scores_gemma":[0.99835724,0.00009285232,0.00029547387,0.0003940628,0.00062294037,0.00023744446],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017664046,0.00034577821,0.00030950006,0.0004212866,0.00035978376,0.0008673813,0.0012040928,0.0002031351,0.00019825324],"category_scores_gemma":[0.0003565718,0.00033278408,0.00008599301,0.00067089574,0.00011408826,0.0014830969,0.00019293473,0.00026431718,0.0008509583],"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.000022822036,0.00027316992,0.00023289627,0.00008166729,0.000032248547,0.0000016266154,0.004929539,0.003924532,0.027345149,0.8217582,0.008672047,0.13272609],"study_design_scores_gemma":[0.00033091797,0.00008236955,0.0015887046,0.000047211888,0.0000135594,0.00003592363,0.0001094886,0.9548234,0.030389775,0.0034348813,0.008731784,0.00041202983],"about_ca_topic_score_codex":0.000003960075,"about_ca_topic_score_gemma":0.0000012411235,"teacher_disagreement_score":0.9508988,"about_ca_system_score_codex":0.0002429253,"about_ca_system_score_gemma":0.00025157796,"threshold_uncertainty_score":0.999927},"labels":[],"label_agreement":null},{"id":"W4240265263","doi":"10.1109/fmcad.2014.6987616","title":"Reducing CTL-live model checking to first-order logic validity checking","year":2014,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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 Waterloo","funders":"","keywords":"Model checking; Computation tree logic; Kripke structure; CTL*; Computer science; Temporal logic; Modal μ-calculus; Partial order reduction; Abstraction model checking; Theoretical computer science; Liveness; Linear temporal logic; Abstraction; Algorithm; Description logic; Multimodal logic; Zeroth-order logic","score_opus":0.10547145508365352,"score_gpt":0.32753942851328594,"score_spread":0.22206797342963241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240265263","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.018169874,0.0000075043445,0.960212,0.0008974044,0.00047506782,0.00020697784,3.3268282e-7,0.00037544884,0.019655418],"genre_scores_gemma":[0.36208847,0.0000023522196,0.6366701,0.0007485601,0.000079837766,0.00002025184,5.86177e-7,0.000009834601,0.00037999995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817234,0.0001314399,0.0003204235,0.0006116982,0.0003432319,0.00042086808],"domain_scores_gemma":[0.9984427,0.00012353383,0.0001226672,0.0009806906,0.00018604958,0.00014435945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018349391,0.00018305193,0.00019891538,0.00012541335,0.0003012649,0.00021043578,0.0011239591,0.00009603408,0.000031147512],"category_scores_gemma":[0.0008667515,0.00016846636,0.00006117597,0.00053770375,0.000029520179,0.00072667614,0.0004966999,0.0001845818,0.00021062602],"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.000009501023,0.000085997366,0.00036762186,0.0000610063,0.000013026395,0.0000015661043,0.006218741,0.2759168,0.0064574312,0.6495702,0.0009794796,0.060318578],"study_design_scores_gemma":[0.000097087424,0.000053418327,0.0005603398,0.000033015014,0.0000039082993,0.0000052750756,0.00002968479,0.9738914,0.012000512,0.012124228,0.00095474935,0.00024642752],"about_ca_topic_score_codex":0.0000956247,"about_ca_topic_score_gemma":0.000011985751,"teacher_disagreement_score":0.69797456,"about_ca_system_score_codex":0.00011774474,"about_ca_system_score_gemma":0.000044851327,"threshold_uncertainty_score":0.68698585},"labels":[],"label_agreement":null},{"id":"W4240323496","doi":"10.1007/3-540-45526-4","title":"Automata Implementation","year":2001,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Automaton; Programming language; Theoretical computer science","score_opus":0.026548195699811768,"score_gpt":0.33060929576119646,"score_spread":0.3040611000613847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240323496","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.000036001205,0.000102273916,0.99135286,0.00038831128,0.0026372818,0.00045805273,0.0000038333014,0.00033872563,0.0046826596],"genre_scores_gemma":[0.0020984125,0.000041692136,0.99584,0.00096371013,0.00045975673,0.000024585883,0.000017314069,0.000024835439,0.00052968005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603355,0.000113223745,0.00058796874,0.0014058073,0.0011463985,0.00071305427],"domain_scores_gemma":[0.9970862,0.00024271439,0.00037186538,0.0019489089,0.00021100318,0.0001392946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018621337,0.00040857476,0.00037371853,0.00091150816,0.00024126077,0.0006547248,0.004685937,0.00025911714,0.000030344907],"category_scores_gemma":[0.000112837624,0.00039941288,0.00008939323,0.0017474857,0.00039572467,0.0013398639,0.0012879957,0.0006107451,0.0000973964],"study_design_candidate":"design_other","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.00000150932,0.000019780531,0.000042605803,0.00002360812,0.0000038661688,0.000023224797,0.0004663308,0.0033043977,0.000056271452,0.012141004,0.0002971708,0.9836202],"study_design_scores_gemma":[0.00036054463,0.00018621283,0.0006789988,0.0001514978,0.000006678968,0.00012271905,2.8681058e-7,0.8315805,0.0029091893,0.15146928,0.011820104,0.00071394915],"about_ca_topic_score_codex":0.00002633868,"about_ca_topic_score_gemma":0.000045990164,"teacher_disagreement_score":0.9829063,"about_ca_system_score_codex":0.00088080857,"about_ca_system_score_gemma":0.0013470228,"threshold_uncertainty_score":0.9998458},"labels":[],"label_agreement":null},{"id":"W4240739540","doi":"10.1109/dsd.2007.4341491","title":"Analysis of Variable Reordering on the QMDD Representation of Quantum Circuits","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 New Brunswick","funders":"","keywords":"Binary decision diagram; Variable (mathematics); Heuristic; Computer science; Representation (politics); Simple (philosophy); Algorithm; Data structure; Boolean function; Binary number; Theoretical computer science; Mathematics; Arithmetic; Programming language; Artificial intelligence","score_opus":0.06624080614032819,"score_gpt":0.3408904722816016,"score_spread":0.2746496661412734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240739540","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.071521826,0.0000056349395,0.9081215,0.000054924287,0.00009296189,0.00006860538,4.1803767e-7,0.000024744275,0.020109367],"genre_scores_gemma":[0.79117185,0.0000028515065,0.2086922,0.000048570913,0.0000059618387,0.0000018271892,7.462323e-7,0.0000018841554,0.000074086376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991042,0.00008647226,0.00029974186,0.00015704083,0.00025237194,0.00010014601],"domain_scores_gemma":[0.9985641,0.00041865918,0.00019608361,0.00068522216,0.00011870031,0.000017197595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018893072,0.000045442834,0.0001277284,0.00023021061,0.000035802605,0.000013305949,0.00045496604,0.000027933747,0.000033975753],"category_scores_gemma":[0.00038020377,0.00003241354,0.00005578044,0.002510195,0.0000314502,0.00017881209,0.000057309884,0.000048451333,0.000002471144],"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.0000031307177,0.000027497585,0.0015156684,0.000005147272,0.000071277165,1.4675504e-7,0.00036087004,0.0029765295,0.0125569245,0.9687741,0.000016639473,0.013692098],"study_design_scores_gemma":[0.00005753004,0.000052040534,0.06656319,0.000009625426,0.00005247784,4.950457e-7,0.00014777019,0.7042091,0.22356601,0.0052165496,0.00006551151,0.000059712096],"about_ca_topic_score_codex":0.00015576834,"about_ca_topic_score_gemma":0.000004794698,"teacher_disagreement_score":0.96355754,"about_ca_system_score_codex":0.000016123224,"about_ca_system_score_gemma":0.000014220296,"threshold_uncertainty_score":0.13217859},"labels":[],"label_agreement":null},{"id":"W4240817514","doi":"10.1007/978-0-387-39940-9_3667","title":"SPCU-Algebra","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Formal Methods in Verification","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":"Algebra over a field; Mathematics; Pure mathematics; Computer science","score_opus":0.02411850967403302,"score_gpt":0.2614214369413396,"score_spread":0.23730292726730662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240817514","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000045565093,0.0023802936,0.19790833,0.00003076273,0.0027417173,0.0005563621,0.00026045536,0.00019553867,0.795922],"genre_scores_gemma":[0.00014284751,0.0032262849,0.38020232,0.000080689744,0.0012221475,0.000038646078,0.00044501887,0.00008591765,0.61455613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969163,0.00010526129,0.0010202023,0.0007783177,0.0008498234,0.00033009684],"domain_scores_gemma":[0.99573535,0.00013070372,0.00093377236,0.0028257759,0.00020435725,0.00017002225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010317167,0.00045343142,0.0007011841,0.0003531834,0.00006993586,0.00007381131,0.0019950871,0.00032934287,0.000059730188],"category_scores_gemma":[0.00013929882,0.0004441556,0.0001689053,0.00012021495,0.00008964515,0.00079673406,0.00040181063,0.0004523173,0.0004654115],"study_design_candidate":"not_applicable","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.0000043129894,0.000020794576,0.0000033052947,0.00025310004,0.000031416716,0.000028904598,0.000096206706,0.0000086355,0.000030045165,0.9509076,0.011873349,0.036742367],"study_design_scores_gemma":[0.00017288474,0.000112323156,0.000026655805,0.00069895,0.000037716683,0.000053879736,0.0000067016213,0.0017505724,0.00008632783,0.004345791,0.9921611,0.00054710463],"about_ca_topic_score_codex":0.000050773113,"about_ca_topic_score_gemma":0.0000030923811,"teacher_disagreement_score":0.98028773,"about_ca_system_score_codex":0.000093561735,"about_ca_system_score_gemma":0.00021915711,"threshold_uncertainty_score":0.99980104},"labels":[],"label_agreement":null},{"id":"W4241756194","doi":"10.3233/stal200014","title":"Algebraic Structure of Step Traces and Interval Traces","year":2020,"lang":"en","type":"book-chapter","venue":"IOS Press eBooks","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Interval (graph theory); Algebraic number; Quotient; Algebraic structure; Algebra over a field; Mathematics; Subject (documents); Semantics (computer science); Computer science; Pure mathematics; Programming language; Combinatorics","score_opus":0.040351719546729545,"score_gpt":0.26323194925341437,"score_spread":0.2228802297066848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241756194","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001710913,0.0046195113,0.16388462,0.00014546356,0.0016601285,0.0014228735,0.0002322946,0.00047557038,0.82584864],"genre_scores_gemma":[0.15486826,0.00016014447,0.68955886,0.0003886878,0.00055824895,0.000028629749,0.000018646611,0.00015372712,0.1542648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844176,0.00006276816,0.0004429641,0.00054302,0.00035033803,0.00015917426],"domain_scores_gemma":[0.99867994,0.000085934334,0.00043172768,0.00062344637,0.00007920229,0.000099767894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012517662,0.00031139882,0.00044994283,0.00008877141,0.000046966125,0.00011436838,0.0010533019,0.0002992768,0.000012442743],"category_scores_gemma":[0.000030719948,0.00028555616,0.00009897565,0.000008744611,0.0001968551,0.00019316543,0.00038772987,0.00042365713,0.0000023421212],"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.000018118377,0.000003423021,8.6635026e-7,0.00025495264,0.000063807296,0.000007486806,0.001350409,0.0000022438746,0.0014961023,0.8325786,0.0001609336,0.16406304],"study_design_scores_gemma":[0.0014484565,0.001318853,0.0003284932,0.0015553175,0.00035477942,0.000221259,0.000062139276,0.025791999,0.18087438,0.26403892,0.5214579,0.0025475249],"about_ca_topic_score_codex":0.000015502026,"about_ca_topic_score_gemma":0.000008043671,"teacher_disagreement_score":0.67158383,"about_ca_system_score_codex":0.000016101369,"about_ca_system_score_gemma":0.000042091357,"threshold_uncertainty_score":0.99995965},"labels":[],"label_agreement":null},{"id":"W4242222923","doi":"10.1109/iccad.1990.129967","title":"A method for concurrent decomposition and factorization of Boolean expressions","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Literal (mathematical logic); Decomposition; Factorization; Simplicity; Algebraic expression; Cube (algebra); Benchmark (surveying); Computer science; Duality (order theory); Theoretical computer science; Algebraic number; Algorithm; Algebra over a field; Mathematics; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.05892151951455472,"score_gpt":0.3737392400747193,"score_spread":0.3148177205601646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242222923","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.0007105927,0.00005359464,0.9980324,0.00010951241,0.00016195435,0.00018634685,0.000003074546,0.000048796956,0.0006937607],"genre_scores_gemma":[0.21883538,0.000012403328,0.7810326,0.000028051505,0.000010895349,0.000017875955,0.0000018746024,0.0000022687518,0.00005860854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948376,0.00006534026,0.00015186307,0.00014473806,0.000080705606,0.00007360959],"domain_scores_gemma":[0.9995339,0.0001247773,0.00008160173,0.00015913848,0.00006596138,0.000034613204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020405391,0.000049201448,0.0000749108,0.000051436153,0.00005256286,0.000024039382,0.00014295513,0.000030004023,0.000016431746],"category_scores_gemma":[0.000052440875,0.000042341584,0.000021615648,0.00009828657,0.0000143666375,0.00031139748,0.00004410814,0.00002522132,0.0000013526145],"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.0000020607515,0.00005570997,0.00007796387,0.00003047863,0.00000522423,4.28231e-8,0.00081796537,0.000038161914,0.05565257,0.56541646,0.00039280223,0.37751058],"study_design_scores_gemma":[0.00024584046,0.00010783133,0.00082794245,0.000017879422,0.0000051552674,0.0000029309015,0.00002093743,0.83675766,0.15470095,0.004734118,0.0024986318,0.00008014104],"about_ca_topic_score_codex":0.0000030184342,"about_ca_topic_score_gemma":3.5538082e-7,"teacher_disagreement_score":0.83671945,"about_ca_system_score_codex":0.000010508697,"about_ca_system_score_gemma":0.00000337492,"threshold_uncertainty_score":0.17266397},"labels":[],"label_agreement":null},{"id":"W4242766192","doi":"10.46586/tosc.v2017.i4.99-129","title":"MILP Modeling for (Large) S-boxes to Optimize Probability of Differential Characteristics","year":2017,"lang":"en","type":"article","venue":"IACR Transactions on Symmetric Cryptology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Algorithm; Computer science; Representation (politics); Mathematics; Theoretical computer science; Mathematical optimization","score_opus":0.06615708801716053,"score_gpt":0.33869805454696394,"score_spread":0.2725409665298034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242766192","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.049088273,0.000010299358,0.9481249,0.00040702015,0.0014315336,0.00063380616,0.00007369711,0.000078036464,0.00015247757],"genre_scores_gemma":[0.5172084,0.000009099705,0.4826042,0.000029229093,0.000025739198,0.00010373271,0.0000021072003,0.000007972454,0.0000095132855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998256,0.0001116126,0.00052874343,0.0005131028,0.00021598458,0.00037450276],"domain_scores_gemma":[0.9975661,0.00032428274,0.00027033937,0.0014172528,0.00030524406,0.00011676161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005950177,0.00018219165,0.00041282855,0.0004743277,0.0005176216,0.00010192192,0.0012293822,0.00017247772,0.000022099868],"category_scores_gemma":[0.0006990689,0.00018030065,0.00018162583,0.00037633098,0.00006872023,0.00031666577,0.000033248853,0.00018603946,0.000011542992],"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.00047814802,0.0014020513,0.0003474547,0.00020504798,0.00014733446,0.0000019707265,0.000929179,0.008779522,0.002950306,0.65182006,0.00003297447,0.33290595],"study_design_scores_gemma":[0.0010679943,0.0005553002,0.0051267794,0.00002809991,0.000057011795,0.0000127325275,0.000026728558,0.96782345,0.011158441,0.013445759,0.00036681644,0.0003309131],"about_ca_topic_score_codex":0.000024565192,"about_ca_topic_score_gemma":0.000007341487,"teacher_disagreement_score":0.9590439,"about_ca_system_score_codex":0.00007158288,"about_ca_system_score_gemma":0.000060840615,"threshold_uncertainty_score":0.7352447},"labels":[],"label_agreement":null},{"id":"W4243475163","doi":"10.1109/icse.2003.1201295","title":"/spl chi/Chek: A model checker for multi-valued reasoning","year":2003,"lang":"en","type":"article","venue":"25th International Conference on Software Engineering, 2003. Proceedings.","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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":"","keywords":"Model checking; Symbolic trajectory evaluation; Computer science; Computation tree logic; Generalization; Extension (predicate logic); Temporal logic; Theoretical computer science; Programming language; Linear temporal logic; Algorithm; Mathematics","score_opus":0.08485247251597294,"score_gpt":0.32961700117439113,"score_spread":0.2447645286584182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243475163","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.0027181953,0.000031575284,0.9922743,0.0000016758589,0.0011158799,0.00047897352,0.00002116854,0.0006091866,0.0027490798],"genre_scores_gemma":[0.0032376358,0.000026528896,0.9946276,0.00021114343,0.000103179875,0.00033369928,0.000016490732,0.000049915507,0.0013938211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977755,0.000012235791,0.00044273993,0.0007112952,0.00056140625,0.0004968052],"domain_scores_gemma":[0.9978247,5.444383e-7,0.00024195755,0.0002921201,0.0014620863,0.00017853749],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007249785,0.00036922135,0.00026730244,0.0002740998,0.00013098198,0.0003534368,0.0011768191,0.00018353685,0.0000433712],"category_scores_gemma":[0.0038164505,0.00038466536,0.00009774892,0.0005100978,0.00003771175,0.0009235076,0.00010951242,0.00036182092,0.000041779225],"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.000014443711,0.00007265215,0.0002650342,0.000038809023,0.000036238896,0.0000011246451,0.00035747068,0.0022669786,0.000026705953,0.9962275,0.0006625518,0.000030483327],"study_design_scores_gemma":[0.00064995314,0.00008610203,0.00029706946,0.00012324998,0.000008888057,0.000017910146,0.00003151321,0.9879688,0.006716176,0.00007106805,0.0036038673,0.00042539224],"about_ca_topic_score_codex":0.0000031351758,"about_ca_topic_score_gemma":4.397157e-7,"teacher_disagreement_score":0.99615645,"about_ca_system_score_codex":0.00023695453,"about_ca_system_score_gemma":0.0002084768,"threshold_uncertainty_score":0.9998605},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W4243493946","doi":"10.1109/ase.2004.1342756","title":"Mapping template semantics to SMV","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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 Waterloo","funders":"","keywords":"Computer science; Programming language; Semantics (computer science); Specification language; Set (abstract data type); Model checking; Notation; Natural language processing; Linguistics","score_opus":0.04244733512051396,"score_gpt":0.30085039365759864,"score_spread":0.2584030585370847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243493946","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.016245665,0.000004197934,0.97151977,0.0018126854,0.00031566736,0.000087419554,1.2388432e-7,0.00020382322,0.009810674],"genre_scores_gemma":[0.15332976,0.000001202043,0.84557194,0.0007834083,0.00002257776,0.0000041499297,1.3983696e-7,0.0000029784292,0.00028384346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941194,0.000015657155,0.0001200227,0.00017262541,0.00012865174,0.0001510825],"domain_scores_gemma":[0.9994597,0.000012130474,0.000024327022,0.00040496592,0.00003583472,0.000063075226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002800233,0.000054005886,0.00005598848,0.00008078861,0.000058541384,0.00007414967,0.0005009249,0.00002512038,0.000006802238],"category_scores_gemma":[0.00004995106,0.000049044782,0.000018124709,0.00040574785,0.000008718887,0.0002875026,0.00014690467,0.000047055975,0.00045198904],"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":[8.560233e-7,0.000019618103,0.00009394423,0.000008624385,0.000003768697,0.000004510521,0.0014568662,0.0017812648,0.0059703165,0.96071506,0.00030792304,0.02963724],"study_design_scores_gemma":[0.00125966,0.00040576953,0.039891794,0.00018168069,0.000005872493,0.00018322952,0.00044713574,0.12222943,0.48959485,0.19851477,0.14583735,0.0014484636],"about_ca_topic_score_codex":0.000020822437,"about_ca_topic_score_gemma":0.0000025192403,"teacher_disagreement_score":0.7622003,"about_ca_system_score_codex":0.00003852265,"about_ca_system_score_gemma":0.000022878163,"threshold_uncertainty_score":0.5809555},"labels":[],"label_agreement":null},{"id":"W4243742593","doi":"10.1145/2103656.2103693","title":"Verification of parameterized concurrent programs by modular reasoning about data and control","year":2012,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":30,"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":"","keywords":"Thread (computing); Computer science; Parameterized complexity; Modular design; Programming language; Separation logic; Control flow; Theoretical computer science; Bounded function; Boolean data type; Model checking; Parallel computing; Algorithm; Mathematics","score_opus":0.05235170920159668,"score_gpt":0.3187935233458588,"score_spread":0.26644181414426216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243742593","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.054350715,0.00084954227,0.9439613,0.000054905027,0.00023761007,0.00028997782,0.000011077381,0.00007782501,0.00016700514],"genre_scores_gemma":[0.5723208,0.000026120915,0.42755833,0.000023505107,0.000012738359,0.00001736123,0.000026767353,0.0000032066046,0.000011133032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893546,0.00015278181,0.00025658484,0.00026495347,0.00018577934,0.00020445744],"domain_scores_gemma":[0.9986248,0.000053339296,0.00017837652,0.0009982322,0.00005706757,0.00008819323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011782373,0.000088996276,0.00015159929,0.000028565864,0.00004283563,0.00006597312,0.00070887845,0.00004666264,0.000003940584],"category_scores_gemma":[0.0001876717,0.00007726679,0.000015328318,0.00014320332,0.000079521735,0.001129184,0.00017936468,0.00006301074,0.000004647861],"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.000015766042,0.0002223784,0.0066214823,0.000051319494,0.000034990262,9.954273e-8,0.00061030296,0.0000027211986,0.07319242,0.13574202,0.0002489964,0.7832575],"study_design_scores_gemma":[0.0009544386,0.000118532844,0.01271413,0.00003752712,0.000025616611,0.000009092489,0.00004734676,0.9425108,0.029107118,0.00020039165,0.014036864,0.00023814608],"about_ca_topic_score_codex":0.00001950331,"about_ca_topic_score_gemma":1.9400204e-7,"teacher_disagreement_score":0.9425081,"about_ca_system_score_codex":0.000013194708,"about_ca_system_score_gemma":0.000013772067,"threshold_uncertainty_score":0.31508484},"labels":[],"label_agreement":null},{"id":"W4244071406","doi":"10.1109/fmcad.2007.4401979","title":"Boosting Verification by Automatic Tuning of Decision Procedures","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":25,"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 British Columbia","funders":"","keywords":"Computer science; Heuristics; Parameterized complexity; Solver; Model checking; Boosting (machine learning); Software; Bounded function; Heuristic; Machine learning; Artificial intelligence; Satisfiability modulo theories; Algorithm; Programming language; Mathematics","score_opus":0.019168789614420038,"score_gpt":0.3105799987214886,"score_spread":0.2914112091070686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244071406","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.09874144,0.000054613396,0.8965703,0.000029455237,0.000120612276,0.000106249034,1.9580149e-7,0.00014665147,0.004230456],"genre_scores_gemma":[0.45596156,0.0000021438161,0.5439461,0.00003168405,0.000006660886,0.0000020634686,5.390027e-7,0.000002794632,0.000046489735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989938,0.000029877096,0.0003593673,0.00019161377,0.00026857745,0.00015677787],"domain_scores_gemma":[0.999052,0.00022971914,0.0001851648,0.00039113613,0.0000984324,0.00004358622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015103698,0.00006871639,0.000088105335,0.000101496466,0.00006748946,0.000036884165,0.0004978108,0.00004611707,0.000011722344],"category_scores_gemma":[0.0008913386,0.000061588944,0.000022750584,0.0004185949,0.00002705856,0.0004902052,0.000071647475,0.00005659946,0.000016761935],"study_design_candidate":"design_other","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.0000058345872,0.000049653732,0.00063159014,0.000056825807,0.0000042497986,6.5463485e-7,0.00078478083,0.00003590381,0.13126807,0.08631192,0.00082942116,0.7800211],"study_design_scores_gemma":[0.00018540422,0.00007643479,0.01433422,0.00010113524,0.0000037158366,0.000016276654,0.00013744895,0.55150795,0.42925,0.0035749369,0.0006446911,0.00016779224],"about_ca_topic_score_codex":0.000010569573,"about_ca_topic_score_gemma":0.0000018729337,"teacher_disagreement_score":0.7798533,"about_ca_system_score_codex":0.000034127803,"about_ca_system_score_gemma":0.000034976827,"threshold_uncertainty_score":0.2511524},"labels":[],"label_agreement":null},{"id":"W4244102356","doi":"10.1109/dac.2002.1012607","title":"High-level specification and automatic generation of IP interface monitors","year":2002,"lang":"en","type":"article","venue":"Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":25,"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 British Columbia","funders":"","keywords":"Computer science; Verilog; VHDL; Block (permutation group theory); Embedded system; Interface (matter); Protocol (science); Formal verification; System on a chip; Hardware description language; Chip; Programming language; Operating system; Field-programmable gate array","score_opus":0.19017692829123026,"score_gpt":0.2921177476427763,"score_spread":0.10194081935154606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244102356","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.14151879,0.000062478255,0.8549628,0.00034179588,0.00091849465,0.0008306606,0.000007705462,0.00056093495,0.00079631625],"genre_scores_gemma":[0.47540143,0.00012866748,0.5237292,0.00003658265,0.00013438755,0.00010950349,0.000003900271,0.000021857277,0.00043450628],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678004,0.00014982735,0.001081337,0.00081781123,0.00072899775,0.00044196003],"domain_scores_gemma":[0.9967062,0.0001432785,0.0010349508,0.0005173269,0.0014127389,0.00018551837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012288374,0.00041846305,0.00046069082,0.0004892963,0.00025200527,0.00054329634,0.0009851707,0.0002606126,0.00022790147],"category_scores_gemma":[0.0006773951,0.000434461,0.0000643259,0.0008919088,0.00018682692,0.0028932744,0.000110035035,0.00022563599,0.00039490903],"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.000015201223,0.00029590275,0.00019764762,0.000427702,0.00006515572,0.000001224842,0.007581986,0.0005179217,0.72479016,0.06730241,0.011533355,0.18727133],"study_design_scores_gemma":[0.0003395797,0.00017548513,0.002197267,0.000111416564,0.000023377432,0.000020598174,0.000088557776,0.7940775,0.20173351,0.0007729591,0.0001041474,0.00035557573],"about_ca_topic_score_codex":0.000020566924,"about_ca_topic_score_gemma":7.313343e-7,"teacher_disagreement_score":0.7935596,"about_ca_system_score_codex":0.00021317104,"about_ca_system_score_gemma":0.00008338407,"threshold_uncertainty_score":0.9998107},"labels":[],"label_agreement":null},{"id":"W4244470190","doi":"10.1007/3-540-45139-0_3","title":"Model-checking in finite state-space systems with fine-grained abstractions using SPIN","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":26,"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":"Model checking; Computer science; Abstraction model checking; Finite-state machine; Automaton; Finite state; Class (philosophy); State (computer science); State space; Theoretical computer science; Temporal logic; Transition system; Algorithm; Programming language; Mathematics; Artificial intelligence","score_opus":0.058099221225778756,"score_gpt":0.3018569842492009,"score_spread":0.2437577630234221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244470190","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.0007860135,0.00020146674,0.99482733,0.00016577356,0.0010811184,0.00060383946,0.0000060265497,0.0001715612,0.0021568697],"genre_scores_gemma":[0.1451075,0.000026808424,0.8542624,0.00013887922,0.00014601,0.000016320753,0.0000034830712,0.000043617198,0.00025495284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576664,0.00007254153,0.0007512377,0.0015398102,0.0010545162,0.0008152481],"domain_scores_gemma":[0.99703175,0.0003932947,0.0005725293,0.0015440639,0.00029632606,0.00016206155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015616377,0.0005901129,0.0005903408,0.0014620993,0.0002730691,0.00073686603,0.0023064888,0.0003098068,0.0000043843634],"category_scores_gemma":[0.00013377772,0.0005394542,0.0000803262,0.0012654493,0.0004773897,0.0013285897,0.0005737419,0.001163337,0.00001406221],"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.0000088156485,0.000020829642,0.00004783909,0.000041468615,0.0000056114636,0.000109901135,0.0006245235,0.9451845,0.00014233198,0.01253377,0.000001345915,0.041279055],"study_design_scores_gemma":[0.00024616177,0.000095325646,0.00007546329,0.0007394354,0.0000061940814,0.00017570105,5.476717e-7,0.97689486,0.0003157215,0.020640468,0.00019199858,0.000618147],"about_ca_topic_score_codex":0.00021088058,"about_ca_topic_score_gemma":0.00034298736,"teacher_disagreement_score":0.14432149,"about_ca_system_score_codex":0.0008004372,"about_ca_system_score_gemma":0.00079813576,"threshold_uncertainty_score":0.9997057},"labels":[],"label_agreement":null},{"id":"W4244493924","doi":"10.1109/.2001.980608","title":"On vector trajectory specifications for multi-agent product systems","year":2002,"lang":"en","type":"article","venue":"Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Automaton; Product (mathematics); Spec#; Trajectory; Computer science; Büchi automaton; Theoretical computer science; Algebra over a field; Algorithm; Mathematics; Deterministic automaton; Programming language; Pure mathematics","score_opus":0.1463488633990367,"score_gpt":0.3023302796180064,"score_spread":0.15598141621896972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244493924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40062204,0.00018571042,0.58204585,0.0026061907,0.0051198383,0.0051510795,0.00008082236,0.00034907364,0.003839401],"genre_scores_gemma":[0.8167375,0.00015677606,0.18075147,0.00031685288,0.00020109997,0.0003907359,6.972955e-7,0.00002854201,0.0014163424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972726,0.000055179295,0.00071150827,0.0008717096,0.0006768702,0.0004121294],"domain_scores_gemma":[0.9969718,0.0004033022,0.00062107045,0.0007211413,0.0011031842,0.00017949184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010984797,0.0003505199,0.00047820498,0.00022915268,0.00034918057,0.0003681933,0.0016964519,0.00013301178,0.000022807604],"category_scores_gemma":[0.0016667629,0.0002497193,0.00017885641,0.0003910064,0.00016438229,0.00045527387,0.000088706685,0.00020488714,0.00010009031],"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.0008720047,0.0011687439,0.00042504485,0.00027910282,0.000109130044,6.435134e-7,0.0011996179,0.00019743583,0.29989022,0.57931894,0.009066019,0.10747309],"study_design_scores_gemma":[0.002194532,0.00056360784,0.0059590354,0.0003065268,0.00003652194,0.000009083554,0.00008264957,0.9768187,0.009977417,0.0019995729,0.001676449,0.00037594163],"about_ca_topic_score_codex":0.000007854595,"about_ca_topic_score_gemma":9.605315e-7,"teacher_disagreement_score":0.9766212,"about_ca_system_score_codex":0.00010682666,"about_ca_system_score_gemma":0.000057520352,"threshold_uncertainty_score":0.9999955},"labels":[],"label_agreement":null},{"id":"W4245597843","doi":"10.1145/949952.940083","title":"Evaluating and improving the automatic analysis of implicit invocation systems","year":2003,"lang":"en","type":"article","venue":"ACM SIGSOFT Software Engineering Notes","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Model checking; Invocation; Software system; Programming language; Distributed computing; Event (particle physics); Focus (optics); Abstraction model checking; Software; Software engineering","score_opus":0.04228780558525213,"score_gpt":0.30983958130635925,"score_spread":0.2675517757211071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245597843","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.39624673,0.00040935032,0.60286796,0.000012558651,0.0001500694,0.0001355319,0.0000013249556,0.00017555134,9.1187013e-7],"genre_scores_gemma":[0.58598655,0.0000031503314,0.41395292,0.000009612247,0.000008442725,0.00002870864,0.0000015778696,0.000007420469,0.0000016235881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878037,0.00012183085,0.00036845662,0.00026481276,0.00027163446,0.00019287303],"domain_scores_gemma":[0.97997355,0.018514648,0.0002328203,0.0010921716,0.000139186,0.0000476234],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0016868352,0.00013707303,0.00022948347,0.0002364925,0.0001009083,0.00011311835,0.0006024782,0.000059148853,0.0000024202861],"category_scores_gemma":[0.123830825,0.00011110981,0.000058831403,0.0010821101,0.000024035593,0.0003361589,0.0001423826,0.00010940961,0.0000016168683],"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.000003041726,0.00006370955,0.2886082,0.0011652085,0.00085990893,0.0000016806581,0.0060371184,0.3116067,0.055709243,0.11158481,0.000010991252,0.2243494],"study_design_scores_gemma":[0.000075471224,0.000038796097,0.19012514,0.000040649702,0.0001666127,0.000007390454,0.00002701488,0.80449235,0.004819718,0.000048738373,0.0000118210055,0.00014627754],"about_ca_topic_score_codex":0.000057588986,"about_ca_topic_score_gemma":7.648467e-7,"teacher_disagreement_score":0.49288568,"about_ca_system_score_codex":0.000045381523,"about_ca_system_score_gemma":0.000036965554,"threshold_uncertainty_score":0.8835495},"labels":[],"label_agreement":null},{"id":"W4245921527","doi":"10.1145/781131.781144","title":"Points-to analysis using BDDs","year":2003,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Binary decision diagram; Computer science; Algorithm; Solver; Model checking; Simple (philosophy); Data structure; Satisfiability; Theoretical computer science; Programming language","score_opus":0.05826976372535029,"score_gpt":0.3475587982911371,"score_spread":0.2892890345657868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245921527","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.019804921,0.000005172661,0.9612494,0.000075767646,0.00013506725,0.000043449465,1.1332032e-7,0.00007359398,0.018612532],"genre_scores_gemma":[0.15992106,3.119886e-7,0.8394257,0.00039940744,0.0000057309,0.0000016725102,1.0827901e-7,0.0000019750241,0.00024404412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930173,0.00010135762,0.00011978763,0.00019952148,0.00014351879,0.00013406355],"domain_scores_gemma":[0.9993156,0.00002093804,0.000028706534,0.00051801617,0.00005018681,0.00006650394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061876583,0.000050970168,0.00008198614,0.00020967989,0.0000537227,0.000069982736,0.00034821586,0.00002224282,0.00008178167],"category_scores_gemma":[0.00015176159,0.000045858265,0.00005069692,0.0019725533,0.000008229325,0.00026853988,0.000050976432,0.000032698106,0.00009821397],"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":[5.97768e-7,0.000017226213,0.0019407341,0.0000013868793,0.000043477336,8.975338e-7,0.00023007867,0.0026397258,0.0014605003,0.9868561,0.00009396322,0.0067153354],"study_design_scores_gemma":[0.000089567584,0.000033556847,0.0067266375,0.0000024173069,0.00005960908,0.0000055997575,0.00005271453,0.92503077,0.053222306,0.0064117145,0.008116455,0.0002486399],"about_ca_topic_score_codex":0.000017802251,"about_ca_topic_score_gemma":0.000003928943,"teacher_disagreement_score":0.9804444,"about_ca_system_score_codex":0.000037059435,"about_ca_system_score_gemma":0.000020706071,"threshold_uncertainty_score":0.18700458},"labels":[],"label_agreement":null},{"id":"W4247959368","doi":"10.1109/aspdac.2003.1194999","title":"Logic verification based on diagnosis techniques","year":2003,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC Asia and South Pacific Design Automation Conference, 2003.","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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":"","keywords":"Observability; Controllability; Computer science; Combinational logic; Sequential logic; Logic synthesis; Logic optimization; Logic gate; Automatic test pattern generation; Register-transfer level; Digital electronics; Algorithm; Computer engineering; Theoretical computer science; Electronic circuit; Mathematics; Engineering","score_opus":0.03921058547885966,"score_gpt":0.25726591407611743,"score_spread":0.21805532859725776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247959368","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.0037519762,0.000028312934,0.95325917,0.00038018127,0.00026124055,0.001058877,0.00000505233,0.00040623933,0.040848948],"genre_scores_gemma":[0.6049459,0.000014424301,0.3946372,0.00007104955,0.000010235669,0.00018375703,0.0000011489703,0.000009334025,0.00012696636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981973,0.00015445163,0.00045473923,0.0004713653,0.0004664783,0.00025564074],"domain_scores_gemma":[0.9980241,0.00007349351,0.0005744051,0.0003939518,0.0008528466,0.00008122433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015913459,0.00023838088,0.00024859468,0.0002429699,0.0002713032,0.00026385725,0.00070621487,0.00016852956,0.000021962893],"category_scores_gemma":[0.0012683651,0.00018325944,0.000056253928,0.0012457741,0.00016150741,0.0005918445,0.000047516405,0.00018673105,0.000016264707],"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.000020483223,0.00012028497,0.003023145,0.000085298234,0.00001352177,1.7674773e-7,0.0018329279,0.00003949226,0.0037490223,0.97279066,0.0011729619,0.017152015],"study_design_scores_gemma":[0.00060229836,0.0005077335,0.014844014,0.00034250668,0.00005429401,0.000012640058,0.0014781733,0.5074596,0.44339585,0.027041484,0.0035756032,0.00068582915],"about_ca_topic_score_codex":0.0000013220166,"about_ca_topic_score_gemma":3.598715e-8,"teacher_disagreement_score":0.94574916,"about_ca_system_score_codex":0.000054750653,"about_ca_system_score_gemma":0.00015412515,"threshold_uncertainty_score":0.7473103},"labels":[],"label_agreement":null},{"id":"W4248609189","doi":"10.1109/iccad.2015.7372575","title":"SAT solving using FPGA-based heterogeneous computing","year":2015,"lang":"en","type":"article","venue":"2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Field-programmable gate array; Boolean satisfiability problem; Software; Throughput; Parallel computing; Computation; Solver; Computer architecture; Symmetric multiprocessor system; Gate array; Reconfigurable computing; Embedded system; Theoretical computer science; Algorithm; Programming language; Operating system","score_opus":0.29951472175916677,"score_gpt":0.38552118015739034,"score_spread":0.08600645839822357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248609189","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.014717132,0.000047346617,0.9757886,0.00076130993,0.006732667,0.00052365934,0.000010989828,0.0005800476,0.00083824893],"genre_scores_gemma":[0.4317117,0.0000037052293,0.56688046,0.0007806465,0.00050500984,0.0000125331535,0.000016272872,0.00003477378,0.000054867123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945372,0.0008715671,0.0010045602,0.0012554697,0.0015556474,0.00077560043],"domain_scores_gemma":[0.9951191,0.0005568087,0.00071246276,0.0016832176,0.001438215,0.0004901798],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023030797,0.00061194954,0.00054830866,0.00062806945,0.0002848052,0.0010386213,0.0046106665,0.0002599467,0.000047358073],"category_scores_gemma":[0.00049654854,0.0006360684,0.00020102607,0.00052202085,0.00016048024,0.0010795859,0.000746284,0.0005678122,0.000411175],"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.00034604964,0.0006587324,0.00031721406,0.00005588973,0.00025132246,0.00024059814,0.0015132395,0.81579167,0.014164568,0.07345049,0.006318994,0.08689125],"study_design_scores_gemma":[0.0010885246,0.00048485908,0.00009305371,0.00022620836,0.000014999558,0.00014052357,0.00002251921,0.9643316,0.024612632,0.0077239904,0.0005978358,0.0006632554],"about_ca_topic_score_codex":0.000081078855,"about_ca_topic_score_gemma":0.0000041423837,"teacher_disagreement_score":0.41699457,"about_ca_system_score_codex":0.0007286185,"about_ca_system_score_gemma":0.0008052981,"threshold_uncertainty_score":0.9999984},"labels":[],"label_agreement":null},{"id":"W4250193792","doi":"10.1109/gas.2013.6632584","title":"Towards model checking of computer games with Java PathFinder","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Java; Pathfinder; Programming language; Model checking; Code (set theory); State (computer science); Space (punctuation); Source code; State space; Operating system; World Wide Web; Mathematics; Set (abstract data type)","score_opus":0.03259177534948429,"score_gpt":0.26481656943685183,"score_spread":0.23222479408736754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250193792","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.029040376,0.0000075608978,0.96064115,0.00017347954,0.00007536205,0.00013410789,2.1679888e-7,0.000096242664,0.009831498],"genre_scores_gemma":[0.35150525,0.0000013092033,0.6481495,0.00018010943,0.000012883341,0.000010238412,2.3723716e-7,0.0000040503637,0.00013642984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918354,0.000032090153,0.00017997134,0.00021264907,0.00023231214,0.00015945348],"domain_scores_gemma":[0.99920416,0.000016738635,0.00008686804,0.0004856167,0.00016082852,0.000045769302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021375499,0.00008955317,0.00012121008,0.000059192673,0.00002795275,0.000067555644,0.0005419381,0.000040514205,0.000030464284],"category_scores_gemma":[0.000008879585,0.00006235842,0.000027559696,0.00018384731,0.00004678647,0.00071945344,0.00015627849,0.000066638524,0.000029960394],"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.0000041130197,0.00009702577,0.0008525665,0.000045081968,0.000025875588,6.94655e-7,0.0021998757,0.019270906,0.0025853193,0.50760967,0.001203084,0.4661058],"study_design_scores_gemma":[0.00011375243,0.000059936352,0.007523338,0.00001276729,0.0000016561025,0.0000037435404,0.000013902807,0.9757495,0.01264501,0.003727556,0.0000510259,0.00009782915],"about_ca_topic_score_codex":0.00006553469,"about_ca_topic_score_gemma":0.0000010108239,"teacher_disagreement_score":0.9564786,"about_ca_system_score_codex":0.000016637041,"about_ca_system_score_gemma":0.000049656275,"threshold_uncertainty_score":0.25429025},"labels":[],"label_agreement":null},{"id":"W4250583308","doi":"10.1145/2578855.2535885","title":"Proofs that count","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"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":"","keywords":"Mathematical proof; Computer science; Construct (python library); Argument (complex analysis); Programming language; Key (lock); Field (mathematics); Theoretical computer science; Counting problem; Calculus (dental); Algorithm; Mathematics; Computer security","score_opus":0.04731228292968221,"score_gpt":0.29187634142419716,"score_spread":0.24456405849451496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250583308","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.05660335,0.00009825289,0.92023,0.0013700551,0.001287661,0.00021611481,0.0000019584606,0.00042281812,0.019769805],"genre_scores_gemma":[0.54725665,0.0000025934876,0.45214415,0.00038845942,0.00007866343,0.000009773201,0.0000017116475,0.00000488559,0.000113150774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899405,0.00011808565,0.00013028689,0.00027247265,0.00027580385,0.00020932165],"domain_scores_gemma":[0.9983674,0.00029204847,0.000114276925,0.0011224538,0.00004296943,0.000060819035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075129786,0.00009824822,0.00010536151,0.000053859465,0.00009552816,0.00017216918,0.0017368034,0.000052312695,0.000016088668],"category_scores_gemma":[0.0006013313,0.00008289926,0.000025448506,0.0001522217,0.000039728042,0.0006787364,0.0002531596,0.00009482962,0.00027703153],"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.000015019287,0.00008454077,0.011445777,0.000092982,0.000022744869,0.0000051489214,0.0020422116,0.00026924632,0.0015867095,0.6548057,0.0032543896,0.3263755],"study_design_scores_gemma":[0.0007598948,0.0004914666,0.12106693,0.00009301206,0.00003158371,0.000035554614,0.00010569403,0.40602463,0.06647257,0.05292443,0.350987,0.0010072482],"about_ca_topic_score_codex":0.00001993901,"about_ca_topic_score_gemma":0.0000074761665,"teacher_disagreement_score":0.60188127,"about_ca_system_score_codex":0.000019996818,"about_ca_system_score_gemma":0.000019071103,"threshold_uncertainty_score":0.35607722},"labels":[],"label_agreement":null},{"id":"W4251324159","doi":"10.1109/aspdac.2004.1337569","title":"Design diagnosis using Boolean satisfiability","year":2004,"lang":"en","type":"article","venue":"ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":49,"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":"","keywords":"Boolean satisfiability problem; Computer science; Satisfiability; Maximum satisfiability problem; Boolean function; And-inverter graph; Theoretical computer science; Boolean expression; Algorithm","score_opus":0.07978221306230644,"score_gpt":0.2908238733196982,"score_spread":0.2110416602573918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251324159","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.029145446,0.0001285662,0.9657448,0.00031330693,0.0012404871,0.001617496,0.000022685228,0.0008433034,0.00094392506],"genre_scores_gemma":[0.4912368,0.000041889867,0.50820976,0.00009803329,0.00008872775,0.0001668625,0.000011169485,0.00003537328,0.000111384994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99412274,0.0012674603,0.0012106891,0.001465794,0.00093290466,0.001000383],"domain_scores_gemma":[0.99598294,0.00040327627,0.00074077287,0.0016342732,0.0007568998,0.00048180882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002994867,0.0007360307,0.0007268697,0.00045534622,0.0007256352,0.000862918,0.0011734948,0.00048367959,0.00010327356],"category_scores_gemma":[0.000805969,0.000749694,0.00017074784,0.0010616762,0.00042344126,0.0020814843,0.00013267498,0.0004303348,0.00047847876],"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.00052296737,0.0025604025,0.01687473,0.0013441805,0.0007802451,0.00024662976,0.104428545,0.27544934,0.10344249,0.16824907,0.0062223617,0.31987906],"study_design_scores_gemma":[0.00197213,0.00053146813,0.0067137806,0.00034446368,0.000119339995,0.00010683234,0.0013748888,0.9352224,0.030296873,0.021384902,0.00027693046,0.0016559811],"about_ca_topic_score_codex":0.00011756789,"about_ca_topic_score_gemma":0.0000041447247,"teacher_disagreement_score":0.65977305,"about_ca_system_score_codex":0.0005807019,"about_ca_system_score_gemma":0.0011875915,"threshold_uncertainty_score":0.9994954},"labels":[],"label_agreement":null},{"id":"W4251683102","doi":"10.1109/dac.2006.229439","title":"Early outpoint insertion for high-level software vs. RTL formal combinational equivalence verification","year":2006,"lang":"en","type":"article","venue":"Proceedings - ACM IEEE Design Automation Conference","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 British Columbia","funders":"","keywords":"Computer science; Formal equivalence checking; Equivalence (formal languages); Formal verification; High-level synthesis; Combinational logic; Software; Theoretical computer science; Model checking; Parallel computing; Algorithm; Programming language; Embedded system; Mathematics; Field-programmable gate array; Logic gate; Discrete mathematics","score_opus":0.0981762457468505,"score_gpt":0.29383941544495124,"score_spread":0.19566316969810074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251683102","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.0649334,0.00001213981,0.9310798,0.0007707392,0.0006836333,0.0012831704,0.000024637277,0.001002369,0.00021009445],"genre_scores_gemma":[0.50977826,0.000004150666,0.48941907,0.0000806879,0.000082474966,0.0004714533,0.000037833597,0.000017398172,0.00010863535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968579,0.00007329688,0.00086193084,0.0007979494,0.0008256127,0.00058334833],"domain_scores_gemma":[0.9962142,0.0002952799,0.00081885717,0.000543718,0.0020171376,0.00011081302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018102537,0.00035484156,0.0003044494,0.0003676592,0.00052130595,0.0007996127,0.0018268026,0.00024074604,0.000017917826],"category_scores_gemma":[0.001438515,0.00038577497,0.000089005734,0.0007084688,0.00011637836,0.0056114336,0.00016510255,0.00021640648,0.00008701819],"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.00008437305,0.00018780598,0.0005036308,0.00020556927,0.000016186737,4.008684e-7,0.0007368218,0.0003454313,0.04907846,0.90078676,0.0015426826,0.046511903],"study_design_scores_gemma":[0.0011046173,0.00044631024,0.1740882,0.000119280165,0.000025072482,0.000016532866,0.000026595086,0.50829846,0.13259064,0.18250284,0.00017884774,0.0006026178],"about_ca_topic_score_codex":0.000044360124,"about_ca_topic_score_gemma":0.0000012153611,"teacher_disagreement_score":0.7182839,"about_ca_system_score_codex":0.00029875425,"about_ca_system_score_gemma":0.00027216,"threshold_uncertainty_score":0.9998594},"labels":[],"label_agreement":null},{"id":"W4252953811","doi":"10.1007/978-0-387-39940-9_3080","title":"Monitoring of Real-Time Logic Expressions","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Formal Methods in Verification","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; Real-time computing","score_opus":0.03800812896154181,"score_gpt":0.2929079798645342,"score_spread":0.2548998509029924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252953811","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007824533,0.0018662725,0.07014077,0.000012213411,0.0024520017,0.0006712015,0.000370158,0.00018158158,0.92422754],"genre_scores_gemma":[0.00041358618,0.008599149,0.7440356,0.0000050815515,0.0009468292,0.000042283624,0.00015911016,0.00006723075,0.24573112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971462,0.00013469136,0.0011091152,0.0005929576,0.00075289037,0.00026416648],"domain_scores_gemma":[0.9957546,0.00022730508,0.0012813614,0.0023604892,0.00024182511,0.00013440443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089001574,0.0003626761,0.0007530217,0.00032003413,0.00006183448,0.000026550284,0.0015843913,0.0002872129,0.000032467393],"category_scores_gemma":[0.00016542106,0.00033673047,0.00015208138,0.00011497085,0.00008813796,0.00057447946,0.00041409946,0.0003050543,0.00009995991],"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.000024951714,0.00012978236,0.00008525467,0.0013200025,0.00011395579,0.000056304885,0.00064360345,0.00013781994,0.014992258,0.9372898,0.0054828515,0.039723426],"study_design_scores_gemma":[0.0019463922,0.0015563233,0.0014427142,0.035522144,0.0005308522,0.00022457613,0.0002313066,0.011988522,0.021540314,0.01927801,0.90063596,0.0051028943],"about_ca_topic_score_codex":0.00008203657,"about_ca_topic_score_gemma":2.8583958e-7,"teacher_disagreement_score":0.9180118,"about_ca_system_score_codex":0.00006790448,"about_ca_system_score_gemma":0.00015810608,"threshold_uncertainty_score":0.99990845},"labels":[],"label_agreement":null},{"id":"W4252973786","doi":"10.1007/s00224-017-9754-0","title":"Preface","year":2017,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Formal Methods in Verification","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":"Simon Fraser University","funders":"","keywords":"Political science","score_opus":0.050463706590936026,"score_gpt":0.3230457224523427,"score_spread":0.2725820158614067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252973786","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.07871975,0.00010611493,0.89907056,0.000029524756,0.0015478116,0.00013137503,4.3730654e-7,0.00012248349,0.020271946],"genre_scores_gemma":[0.86392057,9.365877e-7,0.13568273,0.0000086726395,0.000082414204,0.0000013979788,1.3029714e-7,0.0000051767825,0.00029797037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988776,0.00031557961,0.00026645375,0.00019136995,0.00019374154,0.0001552773],"domain_scores_gemma":[0.99764574,0.00015379438,0.00053878693,0.0015361661,0.00008890224,0.00003659171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030407228,0.00008052292,0.00017722296,0.00004436048,0.0003065874,0.0001944321,0.0020354388,0.000041325045,0.0000011113532],"category_scores_gemma":[0.0003060997,0.00007322685,0.000040334366,0.00004521908,0.0001137632,0.00032682312,0.00034245788,0.0000731782,0.000028821916],"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.000003270366,0.000010697285,0.0002231772,0.00005171334,0.000008972859,6.3459265e-7,0.0008406663,0.00056773506,0.0007528281,0.97589976,0.000038481703,0.021602072],"study_design_scores_gemma":[0.0005305522,0.00015567505,0.04298116,0.0005337386,0.000012344806,0.00006190422,0.00019805106,0.88166714,0.018907074,0.05208563,0.0024400866,0.00042665837],"about_ca_topic_score_codex":0.000018195422,"about_ca_topic_score_gemma":9.3067186e-8,"teacher_disagreement_score":0.9238141,"about_ca_system_score_codex":0.000019166957,"about_ca_system_score_gemma":0.000023931461,"threshold_uncertainty_score":0.37823856},"labels":[],"label_agreement":null},{"id":"W4253603427","doi":"10.1145/605466.605489","title":"Composable semantics for model-based notations","year":2002,"lang":"en","type":"article","venue":"ACM SIGSOFT Software Engineering Notes","topic":"Formal Methods in Verification","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":"University of Waterloo","funders":"University of Waterloo","keywords":"Computer science; Programming language; Semantics (computer science); Notation; Concurrency; Operational semantics; Synchronization (alternating current); Component (thermodynamics); Formal specification; Communicating sequential processes; Formal semantics (linguistics); Variety (cybernetics); Theoretical computer science; Action semantics; Denotational semantics; Formal methods; Artificial intelligence; Mathematics","score_opus":0.05376458544241221,"score_gpt":0.27176333453162,"score_spread":0.2179987490892078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253603427","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.0056323926,0.00011984124,0.9921377,0.00046815115,0.00036663885,0.00026016458,0.000017997783,0.0009932104,0.000003909374],"genre_scores_gemma":[0.39387193,0.0000029409332,0.6058484,0.000113956914,0.000034384797,0.00006908379,0.000009121812,0.00002139184,0.000028840544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885964,0.000015358251,0.00025350408,0.00032478647,0.0002015326,0.00034519917],"domain_scores_gemma":[0.98436064,0.014333641,0.00007401564,0.0009861668,0.00015309408,0.00009242751],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00022829145,0.00019482597,0.0001796203,0.00013787622,0.00014644308,0.00011540869,0.0010426411,0.00009065346,0.000009544057],"category_scores_gemma":[0.03948042,0.0002082439,0.00009310372,0.00032439354,0.000022412129,0.0004404558,0.000116721945,0.00013013762,0.00004286203],"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.0000035417766,0.00010040113,0.0037225115,0.00020445605,0.000019544645,0.0000017563016,0.00044914134,0.95150685,0.0017464631,0.029546587,0.0009811758,0.011717594],"study_design_scores_gemma":[0.00023427277,0.000045106484,0.0011399603,0.000033473854,0.000010373961,0.0000028118352,0.0000010224304,0.9873087,0.009435754,0.00029770954,0.0012325858,0.00025825083],"about_ca_topic_score_codex":0.0000022255363,"about_ca_topic_score_gemma":2.52569e-7,"teacher_disagreement_score":0.38823953,"about_ca_system_score_codex":0.000053319825,"about_ca_system_score_gemma":0.000024092862,"threshold_uncertainty_score":0.96861047},"labels":[],"label_agreement":null},{"id":"W4254604099","doi":"10.1002/spe.895","title":"Using XBDDs and ZBDDs in points‐to analysis","year":2008,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Alberta; University of Waterloo","funders":"National Science Council","keywords":"Binary decision diagram; Computer science; Context (archaeology); Overhead (engineering); Model checking; Compiler; Metric (unit); Domain (mathematical analysis); Algorithm; Programming language; Theoretical computer science; Mathematics","score_opus":0.07586281004245486,"score_gpt":0.3804970797183182,"score_spread":0.3046342696758633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254604099","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.43882185,0.00015496083,0.56060225,0.00020571308,0.00005276359,0.0000556997,2.4417568e-7,0.000037593214,0.00006893615],"genre_scores_gemma":[0.42373765,0.000090211026,0.5756185,0.00052149146,0.000008611693,0.000010940025,1.6659553e-7,0.00000269158,0.000009715061],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9988515,0.00013649142,0.00019511656,0.000405371,0.00020574448,0.00020581963],"domain_scores_gemma":[0.9990861,0.00025598836,0.00008994046,0.0003789569,0.00007515131,0.00011389602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050866813,0.00009989575,0.00015185597,0.00024244456,0.00028646225,0.000076114586,0.00027093236,0.00004699953,0.0000041843496],"category_scores_gemma":[0.0018505473,0.00009987432,0.000020687616,0.0014541281,0.00009505638,0.0022821885,0.00032888626,0.000113047994,0.0000045343827],"study_design_candidate":"observational","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.00017674039,0.0003411472,0.37944916,0.000053770837,0.00013975019,0.0003413853,0.46625754,0.0012548852,0.003181664,0.0270985,0.000064049644,0.121641405],"study_design_scores_gemma":[0.0015032938,0.0006921658,0.5912107,0.00013625583,0.00026907685,0.0026798467,0.018730046,0.33746225,0.012881286,0.0030740239,0.028928664,0.0024323396],"about_ca_topic_score_codex":0.00027573833,"about_ca_topic_score_gemma":0.0000094234465,"teacher_disagreement_score":0.4475275,"about_ca_system_score_codex":0.000034230947,"about_ca_system_score_gemma":0.000037861195,"threshold_uncertainty_score":0.40727568},"labels":[],"label_agreement":null},{"id":"W4255120501","doi":"10.1109/iwssd.1993.315500","title":"Using design fragments to modularize the design of communications in concurrent systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Semantics (computer science); Programming language; Traceability; Component (thermodynamics); Concurrent engineering; Process (computing); Formal methods; Software engineering; Engineering","score_opus":0.45385290579278137,"score_gpt":0.38789124498283617,"score_spread":0.0659616608099452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255120501","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.0004744997,0.00026435754,0.99771327,0.0001856282,0.00021809775,0.0006755735,4.951618e-7,0.000031578882,0.00043649672],"genre_scores_gemma":[0.3834049,0.000016327685,0.6164607,0.000049165996,0.0000036804734,0.000034535213,9.3989065e-8,0.0000028220068,0.00002779955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833816,0.0008553356,0.00031419087,0.00015083399,0.00019832664,0.0001431289],"domain_scores_gemma":[0.99821365,0.0002888993,0.00010341316,0.0012835066,0.000074274925,0.000036265024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001381271,0.000072770476,0.0001138795,0.00009176263,0.000083662206,0.000061776445,0.0016978416,0.00003316345,0.000006000551],"category_scores_gemma":[0.00012389613,0.000053707976,0.000018084176,0.0005485823,0.000049277074,0.00023707279,0.0002783981,0.00008903856,0.000020476757],"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.000004224039,0.00030442406,0.00023346355,0.000025437583,0.000022084738,7.8884824e-7,0.004480791,0.49713337,0.016556142,0.44519204,0.00048458317,0.035562664],"study_design_scores_gemma":[0.000093279814,0.00003495951,0.00014963713,0.00003117741,0.0000023360233,0.0000028588995,0.000049749793,0.99673104,0.0023852896,0.00028720792,0.00016935462,0.00006313086],"about_ca_topic_score_codex":0.000095003365,"about_ca_topic_score_gemma":9.359978e-7,"teacher_disagreement_score":0.49959764,"about_ca_system_score_codex":0.00007576982,"about_ca_system_score_gemma":0.000017734577,"threshold_uncertainty_score":0.315504},"labels":[],"label_agreement":null},{"id":"W4255796560","doi":"10.1109/fmcad.2014.6987590","title":"Response property checking via distributed state space exploration","year":2014,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 British Columbia","funders":"Suomen kliinisen kemian yhdistys","keywords":"Liveness; Model checking; Scalability; Computer science; State space; Property (philosophy); State (computer science); Simple (philosophy); Theoretical computer science; Algorithm; Mathematics; Database","score_opus":0.0425243757944552,"score_gpt":0.2853454206092229,"score_spread":0.2428210448147677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255796560","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.0114028705,0.0000027773453,0.9846596,0.0022790323,0.00022108293,0.00014882685,7.6966626e-7,0.00032536287,0.00095969177],"genre_scores_gemma":[0.34441495,0.0000016433709,0.65452564,0.00016049428,0.000018398265,0.000020467536,0.000003802827,0.0000058491137,0.00084877893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986636,0.00049302226,0.00018122363,0.0002652462,0.00021155523,0.00018536786],"domain_scores_gemma":[0.99906826,0.00008875498,0.00008825317,0.0005857173,0.000107911896,0.00006111438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020423129,0.00009049831,0.000086025626,0.00005778884,0.000105717016,0.00014517318,0.00044517894,0.00003399768,0.00000774233],"category_scores_gemma":[0.0005376699,0.000060671904,0.000023265591,0.00035698028,0.000027401733,0.0013115816,0.00012470983,0.00007793406,0.00012446637],"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.0004735853,0.00014984272,0.00036605995,0.000034447752,0.000017579694,0.0000043014675,0.0046405606,0.0032848623,0.1670583,0.1497644,0.0025920328,0.671614],"study_design_scores_gemma":[0.00017018043,0.00011525024,0.0029348594,0.00000887401,0.0000013095681,0.0000044471462,0.000016732225,0.8109894,0.1427686,0.0056065153,0.037226595,0.00015723692],"about_ca_topic_score_codex":0.000023350593,"about_ca_topic_score_gemma":0.0000036997988,"teacher_disagreement_score":0.80770457,"about_ca_system_score_codex":0.00005861782,"about_ca_system_score_gemma":0.000025276788,"threshold_uncertainty_score":0.24741285},"labels":[],"label_agreement":null},{"id":"W4256280318","doi":"10.1109/aspdac.2005.1466203","title":"Integration of supercubing and learning in a SAT solver","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 British Columbia","funders":"","keywords":"Exploit; Solver; Pruning; Computer science; Boolean satisfiability problem; Enhanced Data Rates for GSM Evolution; Point (geometry); Theoretical computer science; Artificial intelligence; Mathematics; Programming language","score_opus":0.03063839314547008,"score_gpt":0.24974613998915138,"score_spread":0.21910774684368128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256280318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5826287,0.00018655305,0.4083432,0.00086768396,0.00012549208,0.00079609157,0.0000032883806,0.00017950484,0.0068694735],"genre_scores_gemma":[0.765839,0.000045453886,0.23369159,0.00001589528,0.0000208278,0.000020268475,0.0000011347586,0.00000867272,0.00035714987],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827945,0.00011136547,0.00059131114,0.00035847697,0.00036547447,0.00029391603],"domain_scores_gemma":[0.9989436,0.00009687664,0.00046701686,0.0001690635,0.00024874,0.00007469451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021447812,0.00020066265,0.00030797516,0.00032477922,0.00015450823,0.00017725317,0.00042997196,0.00014419365,0.000014977921],"category_scores_gemma":[0.0003867075,0.00016186765,0.000048185477,0.00037054572,0.0001605491,0.0012616754,0.000127105,0.00030231616,0.000005528458],"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.00014944794,0.0003042846,0.028291421,0.0005075338,0.00008760068,6.196341e-7,0.1032746,0.0009956037,0.3868757,0.24283607,0.0007453691,0.23593175],"study_design_scores_gemma":[0.00065298064,0.00010798139,0.036303468,0.00040464563,0.000029134138,0.00001860243,0.0063684424,0.9015025,0.051311295,0.0025909606,0.00039616114,0.0003138658],"about_ca_topic_score_codex":0.000008646023,"about_ca_topic_score_gemma":0.000003070837,"teacher_disagreement_score":0.90050685,"about_ca_system_score_codex":0.000055567652,"about_ca_system_score_gemma":0.00009205347,"threshold_uncertainty_score":0.6600771},"labels":[],"label_agreement":null},{"id":"W4281482045","doi":"10.1111/cgf.14479","title":"Fast and Exact Root Parity for Continuous Collision Detection","year":2022,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"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 Victoria","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China; National Science Foundation","keywords":"Parity (physics); Collision; Computer science; Root (linguistics); Collision detection; Algorithm; Parity bit; Mathematics; Physics; Particle physics","score_opus":0.017323379184455003,"score_gpt":0.26088820989430883,"score_spread":0.24356483070985382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281482045","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.056125496,0.000105044484,0.9410558,0.00031815522,0.001646258,0.0004938408,0.000013132482,0.00019546233,0.000046846966],"genre_scores_gemma":[0.718655,0.000009992,0.28062767,0.0004072582,0.00007625699,0.0001745011,0.00000989547,0.0000148599875,0.00002460197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984998,0.00017453183,0.0002575081,0.00047449986,0.00027225004,0.00032138813],"domain_scores_gemma":[0.99900097,0.00014953809,0.00015624531,0.0005067377,0.00010328583,0.00008320649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009071649,0.00014654739,0.00018348826,0.00021334815,0.00083507824,0.00017930767,0.00064384507,0.00006078382,0.0000019798929],"category_scores_gemma":[0.000029435094,0.00015847606,0.00009083671,0.0005404367,0.000059817743,0.0004074723,0.0007586925,0.00023905079,0.0000012303176],"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.00007381554,0.00016769778,0.006013985,0.000049191927,0.00003600249,0.0000047026297,0.0005131822,0.0009831948,0.00047134137,0.58150464,0.0023303395,0.40785193],"study_design_scores_gemma":[0.00058802543,0.0007874284,0.012193371,0.0000066523185,0.000007019,0.000064731714,0.00003563733,0.9368531,0.0017007892,0.018789966,0.028720936,0.00025235352],"about_ca_topic_score_codex":0.000018863948,"about_ca_topic_score_gemma":0.00001903986,"teacher_disagreement_score":0.9358699,"about_ca_system_score_codex":0.000053543918,"about_ca_system_score_gemma":0.000026395672,"threshold_uncertainty_score":0.6462466},"labels":[],"label_agreement":null},{"id":"W4283209583","doi":"10.1145/3500921","title":"When satisfiability solving meets symbolic computation","year":2022,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"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 Waterloo; Wilfrid Laurier University; University of Windsor","funders":"","keywords":"Computer science; Symbolic computation; Computation; Satisfiability; Brute force; Theoretical computer science; Algorithm; Mathematics; Computer security","score_opus":0.07326705349603489,"score_gpt":0.3332004790898047,"score_spread":0.2599334255937698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283209583","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.1792396,0.0032893142,0.4449319,0.3372134,0.0027286864,0.0028102319,0.00006359055,0.0008966373,0.028826624],"genre_scores_gemma":[0.48061725,0.0000085131105,0.5191965,0.0001020596,0.000003443153,0.000048438797,0.0000028806605,0.0000034138345,0.00001747366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980626,0.0010588821,0.000310405,0.00016933832,0.0002846708,0.00011412184],"domain_scores_gemma":[0.97001016,0.00048204273,0.00027810258,0.029094461,0.000111330024,0.000023889108],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0014915437,0.00006890064,0.00010933506,0.00006739101,0.00081042974,0.00003529481,0.040461395,0.000020021256,0.000010181462],"category_scores_gemma":[0.0043891505,0.00006283389,0.00007340542,0.00050370285,0.00017055057,0.0002723513,0.049452487,0.000245419,0.0000053917324],"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.000005779985,0.0003712643,0.006056105,0.00003475943,0.000040621147,8.667277e-8,0.009901027,0.0061746635,0.004648729,0.90034354,0.016617857,0.05580557],"study_design_scores_gemma":[0.00019353526,0.000043167092,0.045398567,0.00001575454,0.000014950235,0.000011535783,0.00029207696,0.22704233,0.0023291446,0.7126314,0.011865834,0.00016170752],"about_ca_topic_score_codex":0.000075593176,"about_ca_topic_score_gemma":0.000008430336,"teacher_disagreement_score":0.33711135,"about_ca_system_score_codex":0.00011866317,"about_ca_system_score_gemma":0.00007764559,"threshold_uncertainty_score":0.96473014},"labels":[],"label_agreement":null},{"id":"W4285029733","doi":"","title":"Cubicle: A Parallel SMT-based Model Checker for Parameterized Systems","year":2012,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Formal Methods in Verification","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":"Prevention of Organ Failure","funders":"","keywords":"Parameterized complexity; Computer science; Model checking; Programming language; Parallel computing; Theoretical computer science; Algorithm","score_opus":0.03776713243971597,"score_gpt":0.2688883674599676,"score_spread":0.23112123502025161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285029733","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.011763963,0.00043665676,0.9802285,0.0012681354,0.0003224948,0.0006696349,0.00001654412,0.0003595579,0.0049345205],"genre_scores_gemma":[0.32952332,0.000016016733,0.66864234,0.00012833234,0.000016081705,0.0002727117,0.000036687445,0.000021960801,0.0013425531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539584,0.0026598019,0.00049383705,0.00049947883,0.00038320728,0.00056785747],"domain_scores_gemma":[0.9954199,0.00072969374,0.00037036597,0.0021241386,0.0011035588,0.00025234988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008375369,0.00023613953,0.0002795572,0.0001435753,0.00034371729,0.00038749716,0.0015648892,0.00015035285,0.000009822564],"category_scores_gemma":[0.0014719827,0.00023791748,0.00016119763,0.00048679975,0.00012786032,0.0008157592,0.00027148848,0.00018125662,0.000043078653],"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.000018835926,0.00041269851,0.00039388644,0.00008075144,0.00002261889,2.3339778e-7,0.002665219,0.001597611,0.0042136493,0.97990406,0.00059233204,0.010098093],"study_design_scores_gemma":[0.0007044705,6.508069e-7,0.00057511,0.00013591029,0.000013872033,0.000005344972,0.000025203617,0.9629948,0.027296422,0.0010834914,0.0068914588,0.00027327854],"about_ca_topic_score_codex":0.000096929056,"about_ca_topic_score_gemma":0.00001781275,"teacher_disagreement_score":0.97882056,"about_ca_system_score_codex":0.00010788575,"about_ca_system_score_gemma":0.00015035464,"threshold_uncertainty_score":0.97019935},"labels":[],"label_agreement":null},{"id":"W4285206815","doi":"10.1007/978-3-662-64821-6_6","title":"Concurrency Paradigms","year":2022,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Concurrency; Computer science; Concurrent computing; Key (lock); Concurrent object-oriented programming; Programming language; Concurrency control; Isolation (microbiology); Distributed computing; Theoretical computer science; Computer security; Programming paradigm; Database transaction","score_opus":0.2148993535353326,"score_gpt":0.41556815544916537,"score_spread":0.20066880191383277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285206815","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.0000020048963,0.0078247795,0.68795824,0.0002913443,0.0030676692,0.00035383384,0.000022127717,0.00013891338,0.30034107],"genre_scores_gemma":[0.010004031,0.00651106,0.91635174,0.0008089887,0.00034040114,0.0002870058,0.000093581504,0.00008219748,0.06552103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972266,0.0000952916,0.00082065933,0.0008011958,0.0007689695,0.00028726686],"domain_scores_gemma":[0.997761,0.00091815856,0.00040521618,0.0005773176,0.00028196402,0.000056308872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076792866,0.00037102806,0.00047623023,0.00037486988,0.0002250505,0.000051239094,0.0016095848,0.000114332805,0.0002861717],"category_scores_gemma":[0.00024143225,0.0004045386,0.00013167052,0.00023638296,0.00042165112,0.00036348987,0.0011054897,0.00071685255,0.0002223498],"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.0000035999083,0.000016931015,0.000005434734,0.000046213634,0.000056281162,0.000033308934,0.00095722015,0.033884026,9.7096915e-8,0.91606265,0.0007246477,0.04820958],"study_design_scores_gemma":[0.00004643668,0.00010385338,0.000021347683,0.00013042714,0.000008268344,0.000039574097,0.00006594071,0.057524115,0.000010997268,0.8191668,0.12245427,0.000427999],"about_ca_topic_score_codex":0.0000054424527,"about_ca_topic_score_gemma":0.0000037926366,"teacher_disagreement_score":0.23482004,"about_ca_system_score_codex":0.0005145011,"about_ca_system_score_gemma":0.00019585268,"threshold_uncertainty_score":0.9998407},"labels":[],"label_agreement":null},{"id":"W4285242424","doi":"10.1007/978-3-662-64821-6_3","title":"Semantical Domains","year":2022,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.1634781274759913,"score_gpt":0.40619143363519794,"score_spread":0.24271330615920664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285242424","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.000003739099,0.002155645,0.7875695,0.0004715039,0.0018080019,0.00028343574,0.000012298917,0.00012539754,0.20757043],"genre_scores_gemma":[0.005656098,0.0017821844,0.9552455,0.0006426669,0.00020910283,0.00010631689,0.000033431264,0.000050186005,0.03627452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972374,0.00009657786,0.00075007265,0.0007721716,0.00085367553,0.00029010684],"domain_scores_gemma":[0.99778545,0.0010426168,0.0002759564,0.0005704144,0.00026805326,0.00005748518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087787764,0.00034077602,0.00045397805,0.00037585836,0.00023516965,0.00005102394,0.0014369831,0.00012357804,0.00023942033],"category_scores_gemma":[0.00028380906,0.00036406136,0.0001339095,0.0002226195,0.00045989885,0.000297871,0.0014548221,0.00071343867,0.00022511283],"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.0000052899472,0.000020709222,0.000004516133,0.00004737675,0.000062988125,0.00006427593,0.00076115347,0.033475265,1.8107512e-7,0.9475273,0.000531078,0.017499894],"study_design_scores_gemma":[0.000044505905,0.00009236903,0.00002917368,0.00011468323,0.000009402629,0.000056553417,0.00007733695,0.07580705,0.000011821167,0.87127346,0.052098617,0.00038500692],"about_ca_topic_score_codex":0.000003963068,"about_ca_topic_score_gemma":0.0000055980368,"teacher_disagreement_score":0.17129591,"about_ca_system_score_codex":0.00051148405,"about_ca_system_score_gemma":0.00015035346,"threshold_uncertainty_score":0.99988115},"labels":[],"label_agreement":null},{"id":"W4285303404","doi":"10.1007/978-3-031-06773-0_5","title":"The Prusti Project: Formal Verification for Rust","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":34,"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":"Computer science; Rust (programming language); Correctness; Programming language; Key (lock); Overhead (engineering); Feature (linguistics); Formal verification; Memory safety; Software engineering; Software; Operating system","score_opus":0.03897975609536008,"score_gpt":0.30002799376774086,"score_spread":0.2610482376723808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285303404","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.000008041229,0.00032465847,0.9900578,0.00074860256,0.0035653429,0.0015611302,0.0000130056105,0.00017819509,0.0035431914],"genre_scores_gemma":[0.003167935,0.00009779556,0.9947676,0.0005467631,0.00044077475,0.0002994311,0.000016199692,0.000039459046,0.0006240135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618256,0.00007227209,0.00061812473,0.0012763067,0.0010562148,0.0007945376],"domain_scores_gemma":[0.996256,0.00084736507,0.00050182745,0.0020125962,0.0003009812,0.00008124438],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0035170966,0.00040936627,0.00031587976,0.0004968251,0.0015311047,0.00075168075,0.0053742267,0.00021198968,0.00001099601],"category_scores_gemma":[0.00039083144,0.00032514107,0.00014942113,0.00074982125,0.0006466053,0.0013130029,0.0014492099,0.000784652,0.000012655427],"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.000013020282,0.000011084477,0.000002009955,0.000023472221,0.00000485962,0.0000019436825,0.00042247793,0.0035158882,0.00003305274,0.35974374,0.0000529018,0.6361755],"study_design_scores_gemma":[0.00025684026,0.00032641212,0.000070387476,0.00006022316,0.000009795035,0.000049789156,8.223491e-7,0.7123403,0.0009369436,0.09286129,0.19251518,0.0005720423],"about_ca_topic_score_codex":0.000016473237,"about_ca_topic_score_gemma":0.000019369874,"teacher_disagreement_score":0.7088244,"about_ca_system_score_codex":0.00056614086,"about_ca_system_score_gemma":0.0009289351,"threshold_uncertainty_score":0.99992007},"labels":[],"label_agreement":null},{"id":"W4285686555","doi":"","title":"Labelled Cyclic Proofs for Separation Logic","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Formal Methods in Verification","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":"Prevention of Organ Failure","funders":"","keywords":"Mathematical proof; Computer science; Separation logic; Programming language; Algorithm; Mathematics","score_opus":0.03583974648464041,"score_gpt":0.30545938563666775,"score_spread":0.26961963915202736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285686555","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.0072138486,0.0004039735,0.96039075,0.005830663,0.0008081461,0.0014531569,0.000033245247,0.00059573574,0.023270471],"genre_scores_gemma":[0.07372976,0.000140152,0.9198473,0.00019798348,0.00007852121,0.00056501816,0.00032412526,0.00004482299,0.00507232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922824,0.0047087525,0.0007488787,0.001272436,0.0005053408,0.00048220242],"domain_scores_gemma":[0.9904116,0.001193919,0.00090572913,0.0038590997,0.0034566184,0.00017305838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.010014045,0.0004103329,0.0004347553,0.000261293,0.0005315422,0.00080044434,0.003412284,0.00046224307,0.000040599243],"category_scores_gemma":[0.003185709,0.0004323134,0.00025592753,0.0005380898,0.00024763413,0.0004524144,0.0020705967,0.00050752406,0.00010999584],"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.00001955529,0.0004710198,0.00016024688,0.0002884206,0.000070823466,0.0000011033155,0.006862673,0.00011336894,0.0031923223,0.91749346,0.0033096983,0.0680173],"study_design_scores_gemma":[0.0009521323,0.0000032421533,0.0014009285,0.0011012695,0.000060114755,0.000014236623,0.000030191812,0.59387827,0.1810952,0.18578911,0.03466075,0.0010145347],"about_ca_topic_score_codex":0.00011803849,"about_ca_topic_score_gemma":0.0001670212,"teacher_disagreement_score":0.73170435,"about_ca_system_score_codex":0.00019671401,"about_ca_system_score_gemma":0.00037556226,"threshold_uncertainty_score":0.99981284},"labels":[],"label_agreement":null},{"id":"W4285813996","doi":"10.1109/iwcmc55113.2022.9824136","title":"Reasoning about Uncertainty over IoT Systems","year":2022,"lang":"en","type":"article","venue":"2022 International Wireless Communications and Mobile Computing (IWCMC)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Scalability; Model checking; Internet of Things; Set (abstract data type); Block (permutation group theory); Model transformation; Reliability (semiconductor); Distributed computing; Cyber-physical system; Transformation (genetics); Formal verification; Formal methods; Software engineering; Embedded system; Theoretical computer science; Artificial intelligence; Programming language; Consistency (knowledge bases); Database; Operating system","score_opus":0.021544970717745214,"score_gpt":0.3113688206764853,"score_spread":0.2898238499587401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285813996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5736315,0.0050993967,0.40710193,0.0010301445,0.0038026928,0.0009542309,0.00005375418,0.000613534,0.0077127917],"genre_scores_gemma":[0.9509546,0.0002751096,0.047575597,0.00025128853,0.00009095549,0.00033887336,0.000077153716,0.000020938007,0.00041547354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754995,0.0005855499,0.00053989637,0.0004749875,0.0005758927,0.00027371052],"domain_scores_gemma":[0.9971469,0.00039259982,0.00040120236,0.0017472634,0.00022014287,0.000091875525],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015103124,0.00018750415,0.00022200603,0.00023899668,0.0013841477,0.00034720963,0.0037021725,0.000049614184,0.00004815689],"category_scores_gemma":[0.00006974523,0.00021233734,0.000082048115,0.0005153096,0.00013688269,0.00018782564,0.004512693,0.0005761579,0.000008282285],"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.000013491679,0.0002591364,0.0023414886,0.000023411736,0.000097258206,0.0000043607165,0.002406703,0.06616056,0.00073778414,0.79859763,0.00096266455,0.12839551],"study_design_scores_gemma":[0.00026806394,0.00006769597,0.0023901984,0.000041780586,0.0000065659874,0.00007380419,0.00051971554,0.90221393,0.000023291901,0.00033538966,0.093843125,0.00021640895],"about_ca_topic_score_codex":0.00038372615,"about_ca_topic_score_gemma":0.000009404567,"teacher_disagreement_score":0.8360534,"about_ca_system_score_codex":0.00034375512,"about_ca_system_score_gemma":0.000099493904,"threshold_uncertainty_score":0.9999159},"labels":[],"label_agreement":null},{"id":"W4289325413","doi":"","title":"Modelling and Verifying Dynamic Properties of Biological Neural Networks in Coq","year":2018,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Formal Methods in Verification","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 Ottawa","funders":"","keywords":"Computer science; Artificial neural network; Programming language; Artificial intelligence","score_opus":0.04380900533606108,"score_gpt":0.25325120277837737,"score_spread":0.2094421974423163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289325413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3882026,0.0004002656,0.61000824,0.0003717311,0.000058892947,0.000092967304,4.7572158e-7,0.000051293704,0.0008135403],"genre_scores_gemma":[0.7105342,0.000119863544,0.28924817,0.000023200773,0.000004387673,0.000008506212,0.0000025031545,0.000005293386,0.000053867607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709356,0.0018920302,0.00031601932,0.0003445185,0.00014148168,0.00021238792],"domain_scores_gemma":[0.9982804,0.00025517383,0.00016814389,0.00072492764,0.0005153055,0.000056034827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003255012,0.000111178815,0.00015984575,0.00010585183,0.00014748466,0.000105972074,0.0007299433,0.000088185334,0.0000038836424],"category_scores_gemma":[0.00041183428,0.000100318524,0.000032610133,0.00043136944,0.00034365253,0.0003193758,0.00040353788,0.00016438394,0.0000021214646],"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.00007042916,0.0006060029,0.011110928,0.00014550523,0.000033881992,0.0000039621827,0.030969694,0.020495227,0.040924754,0.5501127,0.000021003403,0.3455059],"study_design_scores_gemma":[0.00015439611,0.0000010251597,0.0017793056,0.00019027025,0.0000016456016,0.0000055363007,0.00004028405,0.9733667,0.023451665,0.00082183717,0.00008282167,0.00010452309],"about_ca_topic_score_codex":0.00020468532,"about_ca_topic_score_gemma":0.00010248213,"teacher_disagreement_score":0.95287144,"about_ca_system_score_codex":0.000032423348,"about_ca_system_score_gemma":0.000028083448,"threshold_uncertainty_score":0.40908706},"labels":[],"label_agreement":null},{"id":"W4290033761","doi":"10.1007/s10270-022-01012-1","title":"Dash: declarative behavioural modelling in Alloy with control state hierarchy","year":2022,"lang":"en","type":"article","venue":"Software & Systems Modeling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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; Dash; Programming language; Hierarchy; Semantics (computer science); Concurrency; Theoretical computer science; Software engineering","score_opus":0.05159158778423613,"score_gpt":0.25647110666871836,"score_spread":0.20487951888448225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290033761","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.21673399,0.00034435492,0.78164434,0.000029321973,0.00037523016,0.00056827493,0.000017160657,0.00026600208,0.00002132637],"genre_scores_gemma":[0.68452245,0.0000033001265,0.3150019,0.000047991285,0.000018467215,0.00033335746,0.000007059153,0.000023775287,0.000041684245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996868,0.00063739263,0.00062877045,0.00062915555,0.00072814914,0.0005085313],"domain_scores_gemma":[0.9987179,0.000113044625,0.00023715972,0.0006670518,0.0001616135,0.00010322152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017569021,0.00023789683,0.00035194177,0.00028158806,0.00040457555,0.00019926758,0.0009579429,0.000048506026,0.000002381378],"category_scores_gemma":[0.000035376754,0.00022753669,0.000058276182,0.0006045167,0.000030119958,0.00090042345,0.00024077964,0.00053640536,0.0000044572607],"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.00004567098,0.00003716756,0.003902695,0.000020997171,0.000013857942,0.00002669463,0.0032296134,0.98752284,0.00003624959,0.0038016723,0.0000025919314,0.001359929],"study_design_scores_gemma":[0.000712137,0.0001373057,0.000061500534,0.0000613939,0.000007547409,0.00005078496,0.0003982288,0.9974419,0.000014601351,0.00078451406,0.000038543567,0.00029153182],"about_ca_topic_score_codex":0.0010266594,"about_ca_topic_score_gemma":0.000025368683,"teacher_disagreement_score":0.46778846,"about_ca_system_score_codex":0.0004210275,"about_ca_system_score_gemma":0.00020054687,"threshold_uncertainty_score":0.9278677},"labels":[],"label_agreement":null},{"id":"W4290087445","doi":"10.1007/978-3-031-13185-1_2","title":"Program Verification with Constrained Horn Clauses (Invited Paper)","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":29,"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 Waterloo","funders":"","keywords":"Horn clause; Computer science; Satisfiability; Programming language; Boolean satisfiability problem; Satisfiability modulo theories; Fragment (logic); Formal verification; Solver; Type inference; Model checking; Automated theorem proving; Theoretical computer science; Software verification; Inference; Algorithm; Prolog; Artificial intelligence; Software","score_opus":0.024336521792334805,"score_gpt":0.27434275704658523,"score_spread":0.2500062352542504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290087445","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.000117804804,0.00020022999,0.9920104,0.0008482566,0.001159035,0.0011246046,0.000008569246,0.000608629,0.0039224527],"genre_scores_gemma":[0.023724379,0.00005118008,0.974112,0.0016121351,0.00019061695,0.00013656334,0.000026444552,0.00004683779,0.000099853736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954054,0.000112806454,0.0005963946,0.001816583,0.0013965643,0.00067228876],"domain_scores_gemma":[0.9967226,0.00031411822,0.000502196,0.0019832018,0.00030182741,0.0001760887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013299838,0.000567648,0.0004884172,0.00081442465,0.000469138,0.00061366236,0.0036784254,0.00026612217,0.00007985645],"category_scores_gemma":[0.00013983752,0.0005055976,0.00009866608,0.0013549025,0.0012751453,0.0013004991,0.00087500317,0.0010840055,0.000022467664],"study_design_candidate":"design_other","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.000019744883,0.00006959324,0.000026317515,0.000037532733,0.000015318103,0.0000417709,0.0005437992,0.0075875786,0.00028229674,0.10033706,0.00002132324,0.8910177],"study_design_scores_gemma":[0.0009959714,0.002430039,0.000813503,0.00045373873,0.000041765306,0.00047730206,0.0000018079801,0.82073724,0.005183704,0.094717726,0.07180491,0.0023422712],"about_ca_topic_score_codex":0.000021044501,"about_ca_topic_score_gemma":0.000028341545,"teacher_disagreement_score":0.8886754,"about_ca_system_score_codex":0.0004841248,"about_ca_system_score_gemma":0.0006031108,"threshold_uncertainty_score":0.9997396},"labels":[],"label_agreement":null},{"id":"W4291470783","doi":"10.1007/978-3-031-14391-5_18","title":"Model Checking Intelligent Information Systems with 3-Valued Timed Commitments","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Computer science; Model checking; Semantics (computer science); Temporal logic; Computation tree logic; Domain (mathematical analysis); Logic model; Software engineering; Set (abstract data type); Reliability (semiconductor); Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.04172249753148007,"score_gpt":0.27690135554843787,"score_spread":0.2351788580169578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291470783","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.000030036528,0.00014736764,0.9894367,0.00009759824,0.0016653361,0.0008781521,0.00000830248,0.00022649266,0.0075100344],"genre_scores_gemma":[0.03745609,0.000027391912,0.96142375,0.0006790277,0.00009795789,0.000072044844,0.000024652743,0.000030189782,0.0001889189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592406,0.00008106998,0.00074183126,0.0009084394,0.0017685883,0.0005760021],"domain_scores_gemma":[0.9970883,0.00014617754,0.0006492394,0.0016644053,0.0003033396,0.00014851063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017996114,0.00049868634,0.00047529273,0.000992423,0.0004373915,0.0008066804,0.0036859247,0.000205723,0.000015341187],"category_scores_gemma":[0.00007534785,0.00044033382,0.000079746846,0.0007724218,0.00036492335,0.0025133642,0.0015345982,0.0009416385,0.000041837426],"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.000012140862,0.000017048478,0.000008973482,0.000052081366,0.0000124826565,0.0000075625794,0.0014095544,0.68709636,0.000010658864,0.123210356,0.000008625448,0.18815419],"study_design_scores_gemma":[0.00021024524,0.00018623835,0.000012726914,0.00020891553,0.000008796146,0.00005845124,7.464972e-7,0.985415,0.0003743313,0.010628847,0.0023847306,0.00051100604],"about_ca_topic_score_codex":0.000034427492,"about_ca_topic_score_gemma":0.0000061888036,"teacher_disagreement_score":0.29831862,"about_ca_system_score_codex":0.0010322707,"about_ca_system_score_gemma":0.0006103607,"threshold_uncertainty_score":0.99980485},"labels":[],"label_agreement":null},{"id":"W4293243668","doi":"10.1109/tcad.2022.3197693","title":"Online Reset for Signal Temporal Logic Monitoring","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"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 Alberta","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science","keywords":"Reset (finance); Computer science; SIGNAL (programming language); Semantics (computer science); Real-time computing; Overhead (engineering); Temporal logic; Point (geometry); Programming language; Mathematics","score_opus":0.11263788402016542,"score_gpt":0.30764909197544266,"score_spread":0.19501120795527724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293243668","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.0039871903,0.0001723451,0.99160326,0.000041340572,0.0028660498,0.0009493541,0.0001716466,0.0001926423,0.000016188038],"genre_scores_gemma":[0.7632829,0.000015353222,0.23621336,0.000034374643,0.00008665695,0.00025796087,0.0000105782065,0.000020454574,0.000078361976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972516,0.0007152174,0.00071129826,0.0005524933,0.00045204733,0.00031735116],"domain_scores_gemma":[0.9982893,0.00047124957,0.00031141,0.00051061704,0.00030524607,0.00011220602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013870009,0.0002554366,0.00042370238,0.00041544324,0.0004921273,0.00015140946,0.0007732337,0.00009799533,0.000007807306],"category_scores_gemma":[0.000009815124,0.00023692187,0.00011923234,0.0006938268,0.000061031198,0.00031923546,0.000008519119,0.00040593834,0.0000015965062],"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.00015363208,0.0010497562,0.000035426387,0.00021678941,0.00021194406,0.000018820692,0.0010754606,0.7257658,0.024723815,0.014365071,0.00047063472,0.23191284],"study_design_scores_gemma":[0.00068239646,0.0020337524,0.000034025936,0.000114025606,0.000021183147,0.00010620588,0.00027645504,0.98260474,0.012789282,0.0006450145,0.00041609642,0.00027683473],"about_ca_topic_score_codex":0.00014975284,"about_ca_topic_score_gemma":0.0000010457139,"teacher_disagreement_score":0.7592957,"about_ca_system_score_codex":0.00018444598,"about_ca_system_score_gemma":0.00016222363,"threshold_uncertainty_score":0.9661393},"labels":[],"label_agreement":null},{"id":"W4298317514","doi":"","title":"On Tracking for the PVTOL with Bounded Feedbacks.","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Formal Methods in Verification","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":"Toronto Metropolitan University","funders":"","keywords":"Bounded function; Computer science; Tracking (education); Control theory (sociology); Artificial intelligence; Mathematics; Psychology; Control (management); Mathematical analysis","score_opus":0.03750347955549675,"score_gpt":0.26311047327961495,"score_spread":0.2256069937241182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298317514","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.003958869,0.00033583376,0.9636866,0.0047818446,0.000512766,0.0011241413,0.000020734302,0.00034778894,0.025231412],"genre_scores_gemma":[0.2236363,0.0001243108,0.772989,0.00024751472,0.00003077377,0.00041853866,0.00006592721,0.000051336352,0.0024362921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945864,0.0029743316,0.0004872064,0.0009960026,0.00052172714,0.00043430072],"domain_scores_gemma":[0.98956877,0.003044091,0.00072195276,0.004534414,0.0020006457,0.00013013592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008092019,0.00038274276,0.0003354196,0.00016654187,0.0007117854,0.0009895975,0.0043308837,0.00026245852,0.000029548466],"category_scores_gemma":[0.0017941857,0.00029189384,0.00020797616,0.00041300428,0.00030723808,0.00032569762,0.0012000033,0.00075490115,0.000034360623],"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.000026287766,0.00021807083,0.000047192436,0.00007946189,0.00006326899,9.4408716e-7,0.006500571,0.00011286476,0.00014652264,0.90013534,0.0004703001,0.09219916],"study_design_scores_gemma":[0.0021445777,0.000009377173,0.0074336585,0.0043175127,0.00020498555,0.000052685482,0.0002367206,0.4433791,0.20857234,0.2922099,0.03938476,0.0020543688],"about_ca_topic_score_codex":0.00032559864,"about_ca_topic_score_gemma":0.0003263936,"teacher_disagreement_score":0.6079255,"about_ca_system_score_codex":0.00014087425,"about_ca_system_score_gemma":0.0003326973,"threshold_uncertainty_score":0.9999533},"labels":[],"label_agreement":null},{"id":"W4301405716","doi":"10.1007/978-3-031-79855-9_4","title":"MRF Models of Logic Gates","year":2013,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on digital circuits and systems","topic":"Formal Methods in Verification","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 Calgary","funders":"","keywords":"Truth table; Probabilistic logic; Computer science; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.05397718771594808,"score_gpt":0.24047492935965853,"score_spread":0.18649774164371044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301405716","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011033433,0.0032740657,0.108846076,0.00003975287,0.0005027978,0.00059416,0.000078518875,0.0001416805,0.8864126],"genre_scores_gemma":[0.9579042,0.00017506738,0.0011720296,0.00006791853,0.0001455866,0.00006556166,0.000007934706,0.00006242979,0.040399257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979337,0.000055171822,0.00059176533,0.00062983664,0.00052474387,0.00026478915],"domain_scores_gemma":[0.9977816,0.0005141486,0.0005270355,0.0008879448,0.00017204536,0.00011726866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030736977,0.00041904795,0.00069884525,0.00025976205,0.00007612741,0.00063260406,0.00080179214,0.00038420418,0.000019034436],"category_scores_gemma":[0.00019028847,0.00032076307,0.00015897701,0.000052127405,0.00013347852,0.00063778734,0.00011797435,0.00022008811,0.00008191717],"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.000002232451,0.000013710906,0.0000013117159,0.00021741622,0.000060911316,0.0000029020268,0.000094347575,0.0003439266,0.000051680716,0.90800095,0.00030172008,0.090908885],"study_design_scores_gemma":[0.00031289467,0.0007766769,0.0000960555,0.0033983837,0.00012450671,0.00023630592,0.000048457507,0.0831358,0.0033206074,0.8642787,0.041809753,0.0024619089],"about_ca_topic_score_codex":0.000014662675,"about_ca_topic_score_gemma":4.313248e-7,"teacher_disagreement_score":0.9577939,"about_ca_system_score_codex":0.000053261665,"about_ca_system_score_gemma":0.000048378246,"threshold_uncertainty_score":0.9999244},"labels":[],"label_agreement":null},{"id":"W4301963297","doi":"10.48550/arxiv.1312.3399","title":"Scalable Safety-Preserving Robust Control Synthesis for Continuous-Time\\n Linear Systems","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Computing, Information and Cognitive Systems","keywords":"Reachability; Control theory (sociology); Ellipsoid; Scalability; Bounded function; Kernel (algebra); Computer science; Piecewise; Controller (irrigation); Computation; Time complexity; Linear system; LTI system theory; Mathematics; Algorithm; Mathematical optimization; Control (management); Discrete mathematics; Artificial intelligence","score_opus":0.07328843911402154,"score_gpt":0.2016514352264208,"score_spread":0.12836299611239926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301963297","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.010651271,0.00011631275,0.9824136,0.00009220613,0.0012728478,0.0017356157,0.000086697764,0.00047909067,0.003152392],"genre_scores_gemma":[0.72530335,0.00008914215,0.265934,0.00007564737,0.00031415973,0.000059560567,0.000022437718,0.00006899895,0.008132721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967124,0.0005418116,0.0005640763,0.0013934904,0.00016038804,0.00062782445],"domain_scores_gemma":[0.9950555,0.00096043956,0.0007137707,0.0023943754,0.0006413371,0.00023459127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015675311,0.0004522196,0.0008041744,0.0003113187,0.00033026247,0.00035136563,0.0038327123,0.0005495934,0.00006285319],"category_scores_gemma":[0.0008138945,0.0005115977,0.00033009244,0.0004272979,0.000121591875,0.0009151455,0.0016356596,0.0005166214,0.00033888128],"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.000077732715,0.00007552683,0.0005529914,0.00041004046,0.00016776363,0.000017017781,0.000056940426,0.85975575,0.00014510468,0.1370186,0.0010232728,0.0006992597],"study_design_scores_gemma":[0.00054807815,0.00004795459,0.0001613585,0.00023531042,0.00013198188,0.0000040245086,0.00004550089,0.9927153,0.00028260762,0.0027928702,0.0024919244,0.00054307305],"about_ca_topic_score_codex":0.00039704933,"about_ca_topic_score_gemma":0.0000038348867,"teacher_disagreement_score":0.71647954,"about_ca_system_score_codex":0.0003705625,"about_ca_system_score_gemma":0.00017282681,"threshold_uncertainty_score":0.99973357},"labels":[],"label_agreement":null},{"id":"W4302798199","doi":"10.1007/978-3-031-02010-0_6","title":"Covering Arguments","year":2014,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Formal Methods in Verification","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":"","keywords":"Object (grammar); Computer science; Value (mathematics); Process (computing); Programming language; Artificial intelligence","score_opus":0.016819149317491504,"score_gpt":0.24936951820619194,"score_spread":0.23255036888870043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302798199","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.000035113004,0.00018681335,0.8386906,0.00009375928,0.0009669242,0.00028170517,0.00006847609,0.0007237086,0.1589529],"genre_scores_gemma":[0.5427616,0.00014892484,0.3826939,0.0037557455,0.0025255205,0.00009770598,0.00044152568,0.00069458963,0.06688044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962931,0.0004953015,0.00068400335,0.0011628465,0.0007388623,0.000625879],"domain_scores_gemma":[0.9943799,0.0024908746,0.00075515,0.0020549349,0.00013979775,0.00017936526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021626272,0.0007618486,0.00075308594,0.00031678367,0.0004010218,0.0003267307,0.002620743,0.00056058733,0.00012612987],"category_scores_gemma":[0.001412371,0.00073190377,0.0003602414,0.00012459596,0.0001642051,0.00010128808,0.0006212302,0.0008864604,0.0004367016],"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.000034393204,0.00001710893,9.1211473e-7,0.000047289603,0.00012377242,0.000009730714,0.00004631753,0.001600505,0.00003799212,0.8161931,0.0010917215,0.18079716],"study_design_scores_gemma":[0.0003705118,0.00026593998,0.00014344872,0.0017699644,0.00017373747,0.00006593555,0.0000052815867,0.04335243,0.013767567,0.7103975,0.2274624,0.002225308],"about_ca_topic_score_codex":0.0000018541101,"about_ca_topic_score_gemma":3.789998e-7,"teacher_disagreement_score":0.5427265,"about_ca_system_score_codex":0.0003780983,"about_ca_system_score_gemma":0.00009264029,"threshold_uncertainty_score":0.9995132},"labels":[],"label_agreement":null},{"id":"W4308090482","doi":"10.1109/ccece49351.2022.9918479","title":"Toward a Coalgebraic Model of Control Programs","year":2022,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Ontario Tech University","funders":"Research and Development","keywords":"Functor; Computer science; Programming language; Control (management); Polynomial; Architecture; Controller (irrigation); Algebra over a field; Theoretical computer science; Mathematics; Discrete mathematics; Pure mathematics; Artificial intelligence","score_opus":0.0683813118493291,"score_gpt":0.2773458617624775,"score_spread":0.2089645499131484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308090482","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.0064090015,0.000018065617,0.9889517,0.0002971035,0.000114581584,0.00019860879,0.0000016521614,0.00012095475,0.0038883742],"genre_scores_gemma":[0.5542024,3.3451258e-7,0.445428,0.00015609016,0.000002904299,0.00006342602,5.1475484e-7,0.0000020153886,0.00014433668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921846,0.00008797577,0.00015890977,0.00015443878,0.00026062835,0.00011959535],"domain_scores_gemma":[0.9994775,0.000019817317,0.00007335332,0.0003592834,0.00004067151,0.000029391997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000522875,0.0000479273,0.00009014167,0.000046484645,0.00005799536,0.000018715262,0.00072670256,0.000012551711,0.00002671983],"category_scores_gemma":[0.000022521717,0.00004450852,0.000040193663,0.00024338986,0.000025786649,0.00017680733,0.00021796992,0.0000766433,0.0000045065053],"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.00000782442,0.00008326092,0.00011149615,0.000008103673,0.000006229104,4.576711e-7,0.00059768825,0.008937417,0.0012786685,0.9337109,0.000104723265,0.055153247],"study_design_scores_gemma":[0.00022034605,0.00012481723,0.000057437454,7.6528255e-7,0.0000019744855,0.000004484897,0.000039353996,0.9815533,0.0014161329,0.016166506,0.00035912593,0.000055764765],"about_ca_topic_score_codex":0.000011640486,"about_ca_topic_score_gemma":3.151195e-7,"teacher_disagreement_score":0.9726159,"about_ca_system_score_codex":0.000028045635,"about_ca_system_score_gemma":0.00005376917,"threshold_uncertainty_score":0.18150048},"labels":[],"label_agreement":null},{"id":"W4310419450","doi":"10.4230/lipics.fscd.2022.20","title":"Decision Problems for Linear Logic with Least and Greatest Fixed Points","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Fixed point; Computer science; Mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.04310459302682623,"score_gpt":0.3080269835349024,"score_spread":0.26492239050807614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310419450","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.021863049,0.00009866906,0.96867067,0.0003862436,0.001739224,0.00486545,0.0010508042,0.00037486662,0.0009510484],"genre_scores_gemma":[0.01940432,0.000095777694,0.97633773,0.0007238176,0.00014923955,0.0018218389,0.0011246109,0.000092837174,0.0002498513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99567354,0.00010157145,0.0015932878,0.00085975765,0.0008632293,0.00090860034],"domain_scores_gemma":[0.99545556,0.0004135551,0.0013071874,0.0019377649,0.0006047445,0.0002811876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00203985,0.0007885666,0.0008728864,0.0004990525,0.0006878665,0.0008350731,0.0025775067,0.00047491753,0.000024922796],"category_scores_gemma":[0.000381835,0.000664103,0.00028589723,0.00041000984,0.00020324308,0.0015816131,0.0031182421,0.0011111723,0.00002713542],"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.0048291115,0.0035438626,0.025049273,0.032724038,0.0023467736,0.000051221683,0.074587286,0.049518578,0.00015559963,0.32227167,0.013244099,0.4716785],"study_design_scores_gemma":[0.0054296115,0.0019707729,0.0015164051,0.0010083844,0.00013699022,0.00021358958,0.00064276636,0.8674499,0.00045273383,0.020455288,0.09896392,0.0017596822],"about_ca_topic_score_codex":0.000019064119,"about_ca_topic_score_gemma":0.00001328235,"teacher_disagreement_score":0.8179313,"about_ca_system_score_codex":0.00030283415,"about_ca_system_score_gemma":0.00023417803,"threshold_uncertainty_score":0.99958104},"labels":[],"label_agreement":null},{"id":"W4311273059","doi":"10.29007/f57w","title":"Two Simulink Models with Requirements for a Simple Controller of a Pacemaker Device","year":2022,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Computer science; Controller (irrigation); Simple (philosophy); Software; Embedded system; Reliability engineering; Programming language; Engineering","score_opus":0.07123724100950812,"score_gpt":0.34587019364010924,"score_spread":0.2746329526306011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311273059","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.077019274,0.00006199288,0.92130846,0.00015995392,0.00021707789,0.0005256446,0.000003818294,0.0000650659,0.0006387208],"genre_scores_gemma":[0.5508987,4.864151e-7,0.44883707,0.00017006043,0.00002046393,0.000045163626,0.0000019018624,0.000007648812,0.000018514564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843156,0.00021015646,0.00042323835,0.00033971365,0.00030417443,0.00029113158],"domain_scores_gemma":[0.9988231,0.0003498123,0.00028396823,0.00040424144,0.00010733451,0.000031565825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001424897,0.00012217504,0.0002619104,0.00010579158,0.00022421767,0.000036639394,0.0004984554,0.000020700007,0.000007159815],"category_scores_gemma":[0.00013084593,0.00011938886,0.000043100983,0.0005261884,0.00004923559,0.00046107653,0.00049706607,0.00013970447,4.314993e-7],"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.00026263113,0.00009499523,0.0013549202,0.000073979005,0.00003583141,0.000006674528,0.004449142,0.70255405,0.00028204705,0.26989746,0.000050583665,0.020937664],"study_design_scores_gemma":[0.001509059,0.0003141313,0.00022477341,0.000023061843,0.000004825083,0.000015708847,0.0004272547,0.9751215,0.00070589106,0.020709202,0.0008042854,0.00014028914],"about_ca_topic_score_codex":0.000032583066,"about_ca_topic_score_gemma":0.000009255398,"teacher_disagreement_score":0.4738794,"about_ca_system_score_codex":0.000103469276,"about_ca_system_score_gemma":0.000073455594,"threshold_uncertainty_score":0.48685366},"labels":[],"label_agreement":null},{"id":"W4311273067","doi":"10.29007/fhnk","title":"ARCH-COMP 2022 Category Report: Falsification with Ubounded Resources","year":2022,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"JST-Mirai Program; Core Research for Evolutional Science and Technology; Exploratory Research for Advanced Technology; National Science Foundation; Division of Civil, Mechanical and Manufacturing Innovation; ACT-X; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Division of Industrial Innovation and Partnerships; Defense Advanced Research Projects Agency","keywords":"Comparability; Competition (biology); Arch; Computer science; Work (physics); Data science; Software engineering; Engineering; Civil engineering; Mathematics; Mechanical engineering","score_opus":0.02085790349343988,"score_gpt":0.2712023298882709,"score_spread":0.25034442639483107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311273067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35892314,0.00025568838,0.6338502,0.0008161234,0.00090763,0.0002953535,9.0974646e-7,0.00033131812,0.0046195965],"genre_scores_gemma":[0.66837645,0.0000026829434,0.33111548,0.00013082824,0.00006784115,0.000030110874,0.000010236177,0.000013282045,0.00025306526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752617,0.00049114396,0.00047530117,0.000617688,0.00053637486,0.00035330295],"domain_scores_gemma":[0.99832004,0.00017157446,0.00038889062,0.0010053947,0.000062371095,0.000051725303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024305175,0.00015544168,0.00020735043,0.00018626516,0.0007432938,0.00013848003,0.0011920802,0.000034684377,0.0000486499],"category_scores_gemma":[0.0001627642,0.00016726927,0.00003633729,0.0009564,0.00014038154,0.00043951554,0.00075527595,0.00045180897,0.0000075944076],"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.00028654994,0.00071852456,0.050857548,0.00018949152,0.000089042274,0.0012875496,0.09557209,0.098191485,0.003011927,0.39055356,0.0018227925,0.35741943],"study_design_scores_gemma":[0.0015129299,0.001085465,0.15052804,0.00009058703,0.0000149843645,0.0043787197,0.0093983635,0.7032407,0.0025534637,0.03780273,0.08804655,0.0013474457],"about_ca_topic_score_codex":0.0002373543,"about_ca_topic_score_gemma":0.000036811936,"teacher_disagreement_score":0.60504925,"about_ca_system_score_codex":0.00019911467,"about_ca_system_score_gemma":0.00010425388,"threshold_uncertainty_score":0.6821043},"labels":[],"label_agreement":null},{"id":"W4312833690","doi":"10.1109/ficloud57274.2022.00031","title":"Verifying Timed Commitment Specifications for IoT-Cloud Systems with Uncertainty","year":2022,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cloud computing; Scalability; Model checking; Distributed computing; Reliability (semiconductor); Set (abstract data type); Transformation (genetics); Temporal logic; Internet of Things; Model transformation; Software engineering; Embedded system; Theoretical computer science; Database; Consistency (knowledge bases); Artificial intelligence; Programming language; Operating system","score_opus":0.09184743074219678,"score_gpt":0.2917466613605452,"score_spread":0.19989923061834844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312833690","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.0011284037,0.00006457181,0.9907822,0.0007696943,0.0009060436,0.0008899239,0.000013509403,0.00022680445,0.0052188626],"genre_scores_gemma":[0.14438589,0.0000019771896,0.85224885,0.00017163249,0.000089471105,0.001254519,0.000017978788,0.000012435747,0.0018172364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877894,0.00015242887,0.0002201009,0.00031975392,0.0003141065,0.00021469686],"domain_scores_gemma":[0.99880785,0.00016140501,0.00012342582,0.0007600578,0.00008880001,0.00005848735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076644786,0.00009961097,0.00012206386,0.00007494303,0.00055686024,0.00011380681,0.00084328937,0.000018686496,0.000042248674],"category_scores_gemma":[0.000029647832,0.000085009706,0.000036174875,0.00040826664,0.00003054982,0.00012679311,0.0001806039,0.000109480214,0.000016121201],"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.000024237612,0.000086546075,0.00007291196,0.000018414486,0.000021892602,8.7994533e-7,0.00051742635,0.037510127,0.00025482377,0.95116556,0.0048382957,0.0054888995],"study_design_scores_gemma":[0.00042942795,0.00029070972,0.00031680198,0.000006397311,0.000008303277,0.000022735263,0.00058072835,0.79303294,0.0005871418,0.001004243,0.20352308,0.00019749242],"about_ca_topic_score_codex":0.000053027838,"about_ca_topic_score_gemma":0.000003582678,"teacher_disagreement_score":0.9501613,"about_ca_system_score_codex":0.00025271534,"about_ca_system_score_gemma":0.00009834121,"threshold_uncertainty_score":0.42829752},"labels":[],"label_agreement":null},{"id":"W4312912094","doi":"10.1016/j.ifacol.2022.10.355","title":"Expressiveness and analysis of Delayable Timed Petri Net*","year":2022,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Formal Methods in Verification","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":"Polytechnique Montréal","funders":"","keywords":"Petri net; Reachability; Computer science; Stochastic Petri net; Successor cardinal; Extension (predicate logic); Theoretical computer science; State (computer science); Symbolic data analysis; State space; Interval (graph theory); Semantics (computer science); Net (polyhedron); Algorithm; Programming language; Mathematics; Combinatorics","score_opus":0.017011102847473085,"score_gpt":0.2717989095640772,"score_spread":0.2547878067166041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312912094","genre_codex":"empirical","genre_gemma":"methods","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.5026464,0.00073295773,0.49454987,0.0004054656,0.00030799405,0.00019618685,0.00008412726,0.00011402033,0.0009630158],"genre_scores_gemma":[0.13003963,0.000022266911,0.8693472,0.0001411418,0.000018843248,0.000028715906,0.00003357792,0.000006960992,0.0003616376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867725,0.00019250032,0.0002534283,0.00033874536,0.00035234558,0.00018572599],"domain_scores_gemma":[0.9990099,0.00012717507,0.0001867421,0.00054323213,0.000067971334,0.000064976026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058368035,0.000105893756,0.00026510467,0.00032955047,0.00017565418,0.000031858726,0.00064503634,0.000031606058,0.00013007353],"category_scores_gemma":[0.00008915589,0.00010594688,0.0000861518,0.0017747153,0.000052709594,0.00026413577,0.00042119727,0.00013402081,0.000002585829],"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.00041133657,0.0017105932,0.05921789,0.00027002522,0.0033561443,0.00012090958,0.018450445,0.14975677,0.24111791,0.09851014,0.00011073357,0.42696708],"study_design_scores_gemma":[0.00036977127,0.0001485457,0.02263143,0.000005462612,0.00018620958,0.000012418942,0.00024041577,0.9692378,0.005236157,0.00017268155,0.0015511728,0.00020793929],"about_ca_topic_score_codex":0.0000636113,"about_ca_topic_score_gemma":0.0000033592046,"teacher_disagreement_score":0.819481,"about_ca_system_score_codex":0.000045987705,"about_ca_system_score_gemma":0.000044200107,"threshold_uncertainty_score":0.43203884},"labels":[],"label_agreement":null},{"id":"W4312990487","doi":"10.1109/iros47612.2022.9981758","title":"FC<sup>3</sup>: Feasibility-Based Control Chain Coordination","year":2022,"lang":"en","type":"article","venue":"2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Robustness (evolution); Controller (irrigation); Task (project management); Theoretical computer science; Artificial intelligence; Programming language; Engineering","score_opus":0.07942348290803092,"score_gpt":0.3194038397952061,"score_spread":0.23998035688717517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312990487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025946502,0.00015810799,0.96019846,0.0025483882,0.0044147796,0.0012720305,0.00017954403,0.00022717439,0.005055035],"genre_scores_gemma":[0.9930721,0.00003081728,0.0030609635,0.0007019926,0.00020032762,0.0005650839,0.00008888372,0.00002524078,0.0022546097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954835,0.0008823475,0.00085949764,0.00095235516,0.0014202625,0.0004020069],"domain_scores_gemma":[0.99785435,0.0002490772,0.00048631517,0.0007680407,0.0004537042,0.00018851404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024646495,0.00035168315,0.00041073782,0.00048184016,0.0005454482,0.000566134,0.0016097709,0.00010695724,0.00048600783],"category_scores_gemma":[0.00020462532,0.00034831365,0.00014837756,0.00041837344,0.00011679667,0.00044767826,0.00020601126,0.0005605797,0.00009032804],"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.0002094978,0.0003978429,0.0016035395,0.00006192765,0.00009337472,0.000021307365,0.0009943317,0.20668268,0.002139306,0.7784786,0.0017885757,0.007529013],"study_design_scores_gemma":[0.0007646579,0.00053024123,0.0003781957,0.00006277905,0.000012268447,0.000038288123,0.00061648677,0.9886848,0.00081237423,0.0015344009,0.006195107,0.00037041915],"about_ca_topic_score_codex":0.00015590934,"about_ca_topic_score_gemma":0.0000062354607,"teacher_disagreement_score":0.9671256,"about_ca_system_score_codex":0.00063253526,"about_ca_system_score_gemma":0.00019269627,"threshold_uncertainty_score":0.9998969},"labels":[],"label_agreement":null},{"id":"W4315471929","doi":"10.1109/cdc51059.2022.9992723","title":"Correct-by-Design Control of Parametric Stochastic Systems","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; HORIZON EUROPE Framework Programme; CODE","keywords":"Computer science; Parametric statistics; Parameterized complexity; Nonlinear system; Closeness; Set (abstract data type); Mathematical optimization; Mathematics; Algorithm","score_opus":0.03962984599292955,"score_gpt":0.27848612620606983,"score_spread":0.2388562802131403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315471929","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.0032588984,0.0009727953,0.99171317,0.00018380253,0.0023148707,0.0010028556,0.000095163836,0.00010257178,0.00035586217],"genre_scores_gemma":[0.99057376,0.00006341913,0.008245449,0.0004078059,0.000035270867,0.00036155398,0.0000033685674,0.000018854502,0.00029050527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99581814,0.0010906279,0.0007561324,0.00074551423,0.0011780119,0.0004115678],"domain_scores_gemma":[0.99590015,0.002142708,0.0005305607,0.0009606249,0.0002633478,0.00020262311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002433892,0.00029751562,0.00066273817,0.00049167604,0.00036735256,0.00023767154,0.0013720004,0.000099645695,0.00014783713],"category_scores_gemma":[0.0007145359,0.00027605967,0.000109304754,0.0010213066,0.00010890793,0.00028226027,0.00015050553,0.00046552165,0.0000400079],"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.0027282783,0.0008836603,0.00013873335,0.00005173667,0.0001965885,0.00003610753,0.00062081683,0.08780545,0.024023345,0.23093839,0.0112720495,0.64130485],"study_design_scores_gemma":[0.0035655154,0.0013684544,0.00020558402,0.000037828904,0.000034079196,0.000037490936,0.00018702656,0.98961556,0.0003131203,0.0026802912,0.0016271396,0.00032793626],"about_ca_topic_score_codex":0.00004732599,"about_ca_topic_score_gemma":9.236824e-7,"teacher_disagreement_score":0.9873149,"about_ca_system_score_codex":0.00011658783,"about_ca_system_score_gemma":0.0001841386,"threshold_uncertainty_score":0.9999692},"labels":[],"label_agreement":null},{"id":"W4315630815","doi":"10.1145/3571243","title":"Type-Preserving, Dependence-Aware Guide Generation for Sound, Effective Amortized Probabilistic Inference","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Soundness; Inference; Computer science; Type inference; Probabilistic logic; Fuzz testing; Theoretical computer science; Programming language; Exploit; Machine learning; Artificial intelligence","score_opus":0.05363607663135606,"score_gpt":0.36434413653709535,"score_spread":0.3107080599057393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315630815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9473338,0.00010171091,0.045636766,0.0009576688,0.0008579074,0.0035761206,0.0000073165947,0.0009713461,0.00055735523],"genre_scores_gemma":[0.69577163,0.0000059725053,0.30318075,0.000046932684,0.00010557925,0.00061153626,0.0000051449706,0.000018315644,0.0002541251],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985141,0.00003135546,0.00030386323,0.00043608816,0.00039401205,0.00032055203],"domain_scores_gemma":[0.9978761,0.00041525165,0.00033367032,0.0007403086,0.0005881007,0.00004657792],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0013360993,0.00016658235,0.00019000818,0.00012972002,0.00021051726,0.00022692431,0.0028587673,0.00008717246,0.0000020522164],"category_scores_gemma":[0.020950656,0.00012142028,0.0000908718,0.00094285805,0.000077840596,0.00044211812,0.0009894805,0.00014494095,0.000011042971],"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.00018549158,0.00029341795,0.015662072,0.0018292331,0.00016273292,0.000002751346,0.010801262,0.00073426345,0.13794424,0.20515607,0.0073823743,0.6198461],"study_design_scores_gemma":[0.0018268996,0.0017792325,0.022418445,0.0008092509,0.00015601047,0.000030374486,0.0024235696,0.27624035,0.54047877,0.14812616,0.0044441153,0.0012668488],"about_ca_topic_score_codex":0.000020477077,"about_ca_topic_score_gemma":0.000009556029,"teacher_disagreement_score":0.6185792,"about_ca_system_score_codex":0.00007114804,"about_ca_system_score_gemma":0.000039401344,"threshold_uncertainty_score":0.9872963},"labels":[],"label_agreement":null},{"id":"W4316662751","doi":"10.1007/978-3-031-24950-1_7","title":"A Pragmatic Approach to Stateful Partial Order Reduction","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Toronto","funders":"","keywords":"Computer science; Partial order reduction; Stateful firewall; Reduction (mathematics); Model checking; Context (archaeology); Java; Focus (optics); Overhead (engineering); State space; State (computer science); Theoretical computer science; Programming language; Algorithm; Distributed computing","score_opus":0.03692247566977151,"score_gpt":0.2911935676370818,"score_spread":0.2542710919673103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316662751","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.000032017633,0.00003272043,0.9886714,0.00050587027,0.0036691122,0.0008292172,0.0000041662333,0.00045161397,0.00580388],"genre_scores_gemma":[0.002908317,0.0000125162005,0.9951088,0.00041109486,0.00048678584,0.00006262582,0.000009106035,0.00004847756,0.00095231406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954886,0.000096839336,0.0006497253,0.0017819881,0.0012483783,0.00073445647],"domain_scores_gemma":[0.9970838,0.00019416113,0.0003031204,0.0018387722,0.00034907018,0.00023110642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022750548,0.00047902702,0.00046917182,0.0011274242,0.00025816556,0.0006079357,0.0032369995,0.00029441703,0.0000069896146],"category_scores_gemma":[0.0004033401,0.0004521247,0.0000870924,0.0020578974,0.00040510108,0.0008188787,0.0013044553,0.0007614639,0.00027743052],"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.000009503521,0.000049438702,0.000002462041,0.000092080176,0.000012714792,0.00001369308,0.0029532963,0.16481665,0.0002375607,0.17048928,0.00009166957,0.66123164],"study_design_scores_gemma":[0.0001482385,0.00017093877,0.000040954572,0.00020275632,0.000007673605,0.00008676342,6.3024004e-7,0.8831805,0.0013033072,0.11228884,0.0019225874,0.00064683316],"about_ca_topic_score_codex":0.000018797231,"about_ca_topic_score_gemma":0.000005922867,"teacher_disagreement_score":0.7183638,"about_ca_system_score_codex":0.00037288354,"about_ca_system_score_gemma":0.0005309684,"threshold_uncertainty_score":0.99979305},"labels":[],"label_agreement":null},{"id":"W4317033095","doi":"10.1145/3573074.3573083","title":"jpf-logic","year":2023,"lang":"en","type":"article","venue":"ACM SIGSOFT Software Engineering Notes","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computation tree logic; Programming language; Model checking; Computer science; Linear temporal logic; Abstract syntax tree; Parsing; Temporal logic; Dynamic logic (digital electronics); Temporal logic of actions; Extension (predicate logic); Interval temporal logic; Theoretical computer science","score_opus":0.04048924396420903,"score_gpt":0.28534570351474847,"score_spread":0.24485645955053945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317033095","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.046760987,0.0001446271,0.9457911,0.00040612603,0.0012904479,0.00013415892,0.0000041280405,0.005457432,0.00001097776],"genre_scores_gemma":[0.31385168,0.000013547583,0.68580794,0.00010675464,0.000087760214,0.000036478996,0.000008430684,0.000021917105,0.000065486405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9986946,0.000027509135,0.00021445451,0.00037476182,0.00027394967,0.0004146994],"domain_scores_gemma":[0.98379624,0.014732613,0.000054832475,0.0012502166,0.00006460921,0.000101474245],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00049856404,0.00017925532,0.00015705144,0.00022902482,0.00009379085,0.00010934728,0.0016241841,0.00009582424,0.000014796584],"category_scores_gemma":[0.13013388,0.000181054,0.000068534595,0.0010901814,0.000020357325,0.00049461774,0.000542066,0.00018267268,0.0007917091],"study_design_candidate":"observational","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.0000134460415,0.000134617,0.18749882,0.000578899,0.00012390244,0.00021346769,0.0032257128,0.048622,0.025002077,0.36985922,0.009480869,0.35524696],"study_design_scores_gemma":[0.00059581,0.00023460496,0.8151356,0.00017505696,0.00002129973,0.000083398205,0.000019397585,0.099261686,0.046053443,0.0059065,0.030810762,0.001702442],"about_ca_topic_score_codex":0.000006754537,"about_ca_topic_score_gemma":1.9420347e-7,"teacher_disagreement_score":0.6276368,"about_ca_system_score_codex":0.00004386641,"about_ca_system_score_gemma":0.000027407537,"threshold_uncertainty_score":0.9999863},"labels":[],"label_agreement":null},{"id":"W4320005455","doi":"10.1109/tse.2023.3242588","title":"Trace Diagnostics for Signal-Based Temporal Properties","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Software Engineering","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"TRACE (psycholinguistics); Computer science; Digital subscriber line; Property (philosophy); Context (archaeology); Domain-specific language; Specification language; Complement (music); Medical diagnosis; SIGNAL (programming language); Programming language; Root cause; Theoretical computer science; Reliability engineering","score_opus":0.04247656139871854,"score_gpt":0.2590470647484599,"score_spread":0.21657050334974137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320005455","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.0043017445,0.00003734828,0.9922747,0.00008273414,0.0010676476,0.00034529783,0.000019374449,0.0018687317,0.0000023987393],"genre_scores_gemma":[0.39347574,0.000008544849,0.60600334,0.000035483718,0.00003331652,0.00032476272,0.000002012465,0.000026886068,0.00008988351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999019,0.000021358504,0.0002047572,0.00026777375,0.00020249197,0.00028457172],"domain_scores_gemma":[0.9990647,0.00040163027,0.00003487847,0.00035212128,0.00007247366,0.00007422628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029009138,0.0001552396,0.00013056438,0.00025478707,0.00014703524,0.00007528396,0.00036683696,0.000076440454,0.0000043926975],"category_scores_gemma":[0.000110862835,0.0001571763,0.00009751433,0.00063816365,0.000017604676,0.00031166335,0.0000015578406,0.00016103267,0.000042341235],"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.000010642779,0.00004458601,0.000014382365,0.000113630565,0.000014801146,0.0000031355762,0.0002063041,0.9684201,0.0012117168,0.0003892057,0.00016017674,0.029411329],"study_design_scores_gemma":[0.00021481437,0.00010745684,0.00014748264,0.00006437371,0.000008704857,0.000002145679,0.000008415174,0.869149,0.12801549,0.000025570425,0.0020555435,0.0002009707],"about_ca_topic_score_codex":0.0000055738487,"about_ca_topic_score_gemma":0.0000013778279,"teacher_disagreement_score":0.389174,"about_ca_system_score_codex":0.00006720798,"about_ca_system_score_gemma":0.00005546428,"threshold_uncertainty_score":0.6409463},"labels":[],"label_agreement":null},{"id":"W4321503122","doi":"10.1016/j.iot.2023.100732","title":"A framework for modeling and analyzing cyber-physical systems using statistical model checking","year":2023,"lang":"en","type":"article","venue":"Internet of Things","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Systems Modeling Language; Soundness; Computer science; Cyber-physical system; Model checking; Semantics (computer science); Model transformation; Theoretical computer science; Construct (python library); Unified Modeling Language; Software engineering; Programming language; Artificial intelligence; Consistency (knowledge bases); Software","score_opus":0.10087643435249742,"score_gpt":0.3779280407577688,"score_spread":0.2770516064052714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321503122","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.19730139,0.000027991124,0.80218756,0.00002906724,0.00019157513,0.000121480094,0.0000028011987,0.00010636985,0.00003175593],"genre_scores_gemma":[0.4963928,0.0000014822059,0.5035392,0.000014369508,0.000025554064,0.000007437521,9.709314e-7,0.000007864879,0.000010318902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892944,0.00004399727,0.0002899377,0.0003061655,0.00020628814,0.00022414778],"domain_scores_gemma":[0.99917513,0.00028431322,0.00013380374,0.000257974,0.0000940143,0.000054777563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074448314,0.00010723827,0.00022430596,0.00013348105,0.000051020732,0.00014895537,0.00043009833,0.000071372204,2.2122454e-7],"category_scores_gemma":[0.00045140507,0.00010538741,0.00004898699,0.0002266673,0.000040248862,0.0005416218,0.00026934737,0.00015699577,0.000001813563],"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.0000110580795,0.000012945889,0.000035389505,0.00013472262,0.000021881111,0.0000011767123,0.005400545,0.18269096,0.0020142505,0.80524933,0.000012377811,0.0044153286],"study_design_scores_gemma":[0.00006614154,0.000029179128,0.000006775737,0.000210509,0.0000122749025,0.0000043324458,0.0000659,0.91125524,0.00083545566,0.08741135,0.0000039653196,0.00009886988],"about_ca_topic_score_codex":0.00011825511,"about_ca_topic_score_gemma":1.5125529e-7,"teacher_disagreement_score":0.72856426,"about_ca_system_score_codex":0.000044574484,"about_ca_system_score_gemma":0.000024960513,"threshold_uncertainty_score":0.4297574},"labels":[],"label_agreement":null},{"id":"W4322631336","doi":"10.54097/hset.v32i.4933","title":"The Analysis of Open Source Search Engines","year":2023,"lang":"en","type":"article","venue":"Highlights in Science Engineering and Technology","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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":"","keywords":"Open source; Computer science; The Internet; Search engine; Disadvantage; World Wide Web; Information source (mathematics); Source code; Information retrieval; Software; Operating system","score_opus":0.022502815814668634,"score_gpt":0.3047298477155451,"score_spread":0.2822270319008765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322631336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72333646,0.00017413423,0.27140996,0.0037081724,0.000395829,0.00020581849,0.0000011361462,0.0005645419,0.00020398805],"genre_scores_gemma":[0.9222179,0.00015297865,0.07752313,0.0000029862338,0.0000049243117,0.000021432783,2.2135481e-7,0.000003374431,0.000073038456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990188,0.000015940675,0.0001791716,0.00028850447,0.00020834422,0.0002892723],"domain_scores_gemma":[0.99910796,0.00015820602,0.000035775767,0.0005969385,0.00007056999,0.00003055048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019441468,0.00006616535,0.00014446343,0.0020509765,0.00016810508,0.00014039906,0.0025469486,0.00005151133,2.6440057e-7],"category_scores_gemma":[0.00032645787,0.000046206154,0.000014756767,0.017875006,0.00037134072,0.00034964606,0.0010293798,0.00010674304,0.000008716633],"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":[5.629137e-7,0.0000048039024,0.00045810008,0.0000032593375,0.000012529605,0.0000014686926,0.00024586992,0.017254293,0.009562661,0.9562688,0.000009122964,0.016178546],"study_design_scores_gemma":[0.000051250292,0.000018306288,0.01259338,0.000008517054,0.000005725322,0.0000018861309,0.0000635258,0.94548285,0.036257528,0.0008771969,0.0045663617,0.0000734848],"about_ca_topic_score_codex":0.000021999269,"about_ca_topic_score_gemma":0.0000060173666,"teacher_disagreement_score":0.9553916,"about_ca_system_score_codex":0.000024482077,"about_ca_system_score_gemma":0.0000414211,"threshold_uncertainty_score":0.8588348},"labels":[],"label_agreement":null},{"id":"W4323026395","doi":"10.1007/978-3-031-27481-7","title":"Formal Methods","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","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":"College of Engineering, Michigan State University; Gran Sasso Science Institute; Mälardalens högskola; Universidad Nacional de Río Cuarto; RWTH Aachen University; Bauhaus-Universität Weimar; Technische Universität Darmstadt; Technische Universität Wien; Universität zu Lübeck; Macquarie University; Centre National de la Recherche Scientifique; Universität des Saarlandes; Vysoké Učení Technické v Brně; Chinese Academy of Sciences; Radboud Universiteit; Universität Bremen; Nanyang Technological University; Universitetet i Oslo; Universiteit Stellenbosch; Helsingin Yliopisto; University of Alberta; Danmarks Tekniske Universitet; Kennesaw State University; Amazon Web Services; Imperial College London; McMaster University; University of Toronto; Universidade do Minho; Michigan State University; Microsoft Research; University of Waterloo; National Institute of Informatics; University of Twente","keywords":"Computer science","score_opus":0.04229805829515437,"score_gpt":0.35406301768523574,"score_spread":0.31176495939008136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323026395","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.0000051652078,0.00018502264,0.9871026,0.0002848995,0.0066371295,0.00041472152,0.0000030408155,0.00065709476,0.0047103013],"genre_scores_gemma":[0.00016854014,0.000028553184,0.9957033,0.00081307144,0.000573756,0.000032245323,0.000006305696,0.000045827717,0.002628398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949701,0.00027326593,0.0007027032,0.0017270981,0.0011607924,0.0011660351],"domain_scores_gemma":[0.9956453,0.0010989044,0.0003755331,0.0024135248,0.00026374552,0.00020299449],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0063919425,0.00052736205,0.0005842479,0.0014057321,0.000343467,0.0006911331,0.0068797222,0.00045643203,0.000008586002],"category_scores_gemma":[0.00074237713,0.0004930138,0.00016552268,0.0030446646,0.00069525506,0.0017967151,0.0031241698,0.0011588293,0.00023187796],"study_design_candidate":"design_other","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.0000021434155,0.000013412891,0.0000056521603,0.00004549007,0.000005760675,0.000024843046,0.0005603227,0.008959003,0.000103464736,0.025977071,0.0001538653,0.964149],"study_design_scores_gemma":[0.00012948652,0.0001110778,0.00016234376,0.00016148225,0.000004793786,0.000050007613,1.0387084e-7,0.7538961,0.0033195273,0.23754779,0.0040688356,0.00054843654],"about_ca_topic_score_codex":0.000009139598,"about_ca_topic_score_gemma":0.000012243424,"teacher_disagreement_score":0.9636005,"about_ca_system_score_codex":0.00072551606,"about_ca_system_score_gemma":0.0015420127,"threshold_uncertainty_score":0.99975216},"labels":[],"label_agreement":null},{"id":"W4323662928","doi":"10.1016/j.nahs.2023.101340","title":"Lyapunov-barrier characterization of robust reach–avoid–stay specifications for hybrid systems","year":2023,"lang":"en","type":"article","venue":"Nonlinear Analysis Hybrid Systems","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 Waterloo","funders":"","keywords":"Hybrid system; Lyapunov function; Discretization; Reachability; Dynamical systems theory; Mathematics; Differential inclusion; Control theory (sociology); State space; Nonlinear system; Computer science; Topology (electrical circuits); Mathematical optimization; Control (management); Algorithm; Mathematical analysis","score_opus":0.0801088667584379,"score_gpt":0.2947939312418153,"score_spread":0.2146850644833774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323662928","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.082694985,0.00011771152,0.9129697,0.00009616023,0.0014814328,0.0010459729,0.0008870962,0.00043387007,0.0002730524],"genre_scores_gemma":[0.8195057,0.00015167701,0.16736943,0.000039476912,0.0012182083,0.00076832256,0.0038909845,0.00010386635,0.0069523584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958215,0.0004964141,0.0015045038,0.0008816817,0.0007952614,0.0005006857],"domain_scores_gemma":[0.9955151,0.00030020124,0.0010633548,0.002026174,0.0009195756,0.00017561395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030149103,0.00031735125,0.0008778079,0.0013301026,0.00029086185,0.00035744547,0.0013174837,0.00009158292,0.000009549651],"category_scores_gemma":[0.00035836498,0.00031138147,0.00048766745,0.003961383,0.00008216065,0.00070432754,0.00014256535,0.00016179626,0.00011712539],"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.00024385378,0.0014325789,0.016061706,0.004539519,0.009959353,0.00007998674,0.0031741355,0.41456497,0.32097954,0.20470534,0.008241348,0.016017683],"study_design_scores_gemma":[0.00023892541,0.000051699557,0.0018744876,0.00005065271,0.0002963682,0.000016563692,0.00011974503,0.96800435,0.009374446,0.000032687676,0.01962731,0.00031279458],"about_ca_topic_score_codex":0.00012195276,"about_ca_topic_score_gemma":0.000004625381,"teacher_disagreement_score":0.7456003,"about_ca_system_score_codex":0.00015651742,"about_ca_system_score_gemma":0.00012949378,"threshold_uncertainty_score":0.99993384},"labels":[],"label_agreement":null},{"id":"W4362725787","doi":"10.1007/978-3-030-54621-2_712-1","title":"Decision Diagrams for Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital","funders":"","keywords":"Computer science; Influence diagram; Artificial intelligence; Decision tree","score_opus":0.01993996292632648,"score_gpt":0.2671341508412789,"score_spread":0.2471941879149524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362725787","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":[3.4496918e-7,0.00021102678,0.7294744,0.000050746716,0.0015293206,0.00081774744,0.00003089844,0.00012904615,0.26775643],"genre_scores_gemma":[0.0000066261705,0.0036701318,0.94954205,0.00004835107,0.00016343994,0.00015391376,0.0004947233,0.00007645761,0.045844335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757254,0.000053602693,0.0008344519,0.00066922384,0.0006377859,0.00023239097],"domain_scores_gemma":[0.9972373,0.00034458115,0.00095603353,0.0009815933,0.00039824142,0.00008221728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069612573,0.00034282575,0.0004273825,0.0004132283,0.00020178797,0.000064906526,0.0010852375,0.00031849512,0.0006545529],"category_scores_gemma":[0.00042339085,0.00038263053,0.0002094387,0.00020525814,0.000057402453,0.0008502871,0.00032922832,0.000238277,0.000007980179],"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.00002068034,0.000021402695,0.0000015924135,0.00003509061,0.000014786166,6.0600235e-7,0.000089094945,0.6864036,4.3499637e-7,0.2741788,0.00089319824,0.038340725],"study_design_scores_gemma":[0.0003361769,0.00020435643,0.0000031669135,0.000056489265,0.00004343198,0.000004157731,0.000002981021,0.81979966,0.000016778533,0.00923379,0.16993791,0.00036110386],"about_ca_topic_score_codex":0.0000029090304,"about_ca_topic_score_gemma":8.1920433e-7,"teacher_disagreement_score":0.264945,"about_ca_system_score_codex":0.0001876916,"about_ca_system_score_gemma":0.00017283625,"threshold_uncertainty_score":0.99986255},"labels":[],"label_agreement":null},{"id":"W4366503778","doi":"10.1007/978-3-031-30829-1_14","title":"Explainability of Probabilistic Bisimilarity Distances for Labelled Markov Chains","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"University of Oxford","keywords":"Probabilistic logic; Markov chain; Probabilistic CTL; Sequence (biology); Computer science; Similarity (geometry); Algorithm; Discrete mathematics; Construct (python library); Markov process; Theoretical computer science; Mathematics; Probabilistic analysis of algorithms; Artificial intelligence; Programming language; Statistics","score_opus":0.0411923936904238,"score_gpt":0.2994723685979013,"score_spread":0.25827997490747745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366503778","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.00014413439,0.00011450448,0.99476707,0.00044303446,0.002133057,0.001349198,0.00004053427,0.00021656298,0.0007918957],"genre_scores_gemma":[0.028266989,0.000030259362,0.97081786,0.00015624154,0.00018212968,0.00009083278,0.00000907545,0.000035717443,0.00041086745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590963,0.000088503526,0.0008409665,0.001611765,0.0009250368,0.00062409125],"domain_scores_gemma":[0.99514985,0.0015938559,0.0005529033,0.001968199,0.00060880545,0.0001263753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036814483,0.0004581526,0.0007031053,0.0005931524,0.0002564544,0.00019058769,0.0036714424,0.0003267678,0.000005206812],"category_scores_gemma":[0.0016135378,0.00041941414,0.00019045247,0.00096846744,0.0012438614,0.0005155267,0.0010604716,0.000493704,0.0000054992875],"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.00003642874,0.000073253344,0.00009381821,0.00067772553,0.00001532768,0.000008152537,0.0010963031,0.0077174306,0.000116806295,0.42679226,0.000020794247,0.5633517],"study_design_scores_gemma":[0.0002189197,0.00019419471,0.00027298406,0.00025485223,0.00000863964,0.0000048925713,3.3134015e-7,0.55030185,0.0012102092,0.44658026,0.0005395959,0.0004132333],"about_ca_topic_score_codex":0.0000143356965,"about_ca_topic_score_gemma":0.00009296497,"teacher_disagreement_score":0.56293845,"about_ca_system_score_codex":0.00036617924,"about_ca_system_score_gemma":0.0005922544,"threshold_uncertainty_score":0.9998258},"labels":[],"label_agreement":null},{"id":"W4376622659","doi":"10.1007/978-3-031-33163-3_10","title":"Modelling an Automotive Software System with TASTD","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Programming language; Compiler; Abstraction; Modular design; Notation; Algebraic specification; Modularity (biology); Representation (politics); State (computer science); Formal specification; Theoretical computer science","score_opus":0.039509631027362935,"score_gpt":0.26659672237751314,"score_spread":0.2270870913501502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376622659","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.00004042692,0.000057563804,0.9953018,0.00007594117,0.0018090046,0.00049026223,0.000008737637,0.0012374914,0.0009787624],"genre_scores_gemma":[0.01454022,0.000007587472,0.9845977,0.000208312,0.00030034047,0.000020866792,0.000007904278,0.000069457914,0.0002476025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952777,0.0000880173,0.00053320813,0.0019881432,0.0013692629,0.00074363983],"domain_scores_gemma":[0.99629307,0.00035577486,0.0004038423,0.002141128,0.0005738768,0.00023228879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016954149,0.0005902258,0.00055655255,0.0009620625,0.0003755865,0.0006825826,0.004189953,0.00034734138,0.0000027235617],"category_scores_gemma":[0.00008371509,0.00050267635,0.00008538237,0.0011114433,0.00059795333,0.0014228893,0.0009482172,0.00089893385,0.000087807886],"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.000005436227,0.000010452207,0.000006841193,0.000069034955,0.00000803287,0.00007539379,0.0008555031,0.7648865,0.0000044075987,0.07796572,0.0000017837817,0.15611087],"study_design_scores_gemma":[0.0001362204,0.00029181904,0.000019114763,0.00074762164,0.000007753051,0.00010731017,8.603875e-7,0.9714338,0.000346861,0.02623686,0.00006959304,0.0006021419],"about_ca_topic_score_codex":0.000047488404,"about_ca_topic_score_gemma":0.000028754064,"teacher_disagreement_score":0.20654732,"about_ca_system_score_codex":0.0005588452,"about_ca_system_score_gemma":0.0006156215,"threshold_uncertainty_score":0.9997425},"labels":[],"label_agreement":null},{"id":"W4376622664","doi":"10.1007/978-3-031-33163-3_11","title":"TASTD: A Real-Time Extension for ASTD","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Interrupt; Computer science; Timeout; Programming language; Extension (predicate logic); Guard (computer science); Algebraic specification; Theoretical computer science; Real-time computing; Embedded system; Formal specification; Computer network; Microcontroller","score_opus":0.039336080156800464,"score_gpt":0.2994853823723836,"score_spread":0.26014930221558313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376622664","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.000024813353,0.000053786473,0.99227893,0.00045685522,0.0030062676,0.0008171279,0.000012526474,0.0005588616,0.0027908245],"genre_scores_gemma":[0.00060719176,0.000056271434,0.9959829,0.0004782186,0.0005026404,0.000043007727,0.0000128587135,0.00006531483,0.002251584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559855,0.000053783515,0.00063055434,0.0019248616,0.0010056383,0.0007865899],"domain_scores_gemma":[0.99598205,0.00091353396,0.00039360832,0.0020970975,0.00043536726,0.0001783689],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025425646,0.0005221564,0.0005714719,0.0010024644,0.00032376483,0.00046107572,0.0036944132,0.00040383774,0.000012010146],"category_scores_gemma":[0.00047412017,0.00049197365,0.0001854482,0.0008818424,0.0005145794,0.0007215862,0.0013910334,0.00053261156,0.00028080356],"study_design_candidate":"design_other","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.00001423057,0.000020744112,0.0000025435309,0.000065454085,0.0000095559235,0.000030602896,0.0004283473,0.009987832,0.0021323746,0.115589805,0.00018691878,0.8715316],"study_design_scores_gemma":[0.00019838606,0.00024864727,0.000095008065,0.0002982312,0.0000073539713,0.000037848855,7.261584e-8,0.7637393,0.0020571894,0.23095258,0.0018162829,0.0005491195],"about_ca_topic_score_codex":0.0000149997595,"about_ca_topic_score_gemma":0.0000106128655,"teacher_disagreement_score":0.87098247,"about_ca_system_score_codex":0.00030660155,"about_ca_system_score_gemma":0.00046285245,"threshold_uncertainty_score":0.9997532},"labels":[],"label_agreement":null},{"id":"W4376623433","doi":"10.1109/tac.2023.3276290","title":"Underapproximate Reachability Analysis for a Class of Linear Systems With Inputs","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Waterloo","funders":"","keywords":"Reachability; Linear system; Mathematics; Approximations of π; Affine transformation; Hausdorff distance; Class (philosophy); Applied mathematics; Matrix (chemical analysis); Computer science; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.03156073234859015,"score_gpt":0.2923149227919577,"score_spread":0.26075419044336756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376623433","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.015363182,0.000005236535,0.98237836,0.0003119349,0.00026580147,0.0009956587,0.000046335863,0.0005768698,0.000056609137],"genre_scores_gemma":[0.85506105,0.0000018809463,0.14431185,0.00003728469,0.000008537703,0.0004729745,0.000001980604,0.000010777014,0.0000936775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983963,0.0002137929,0.00048206036,0.00033943297,0.0003300137,0.00023840036],"domain_scores_gemma":[0.99808496,0.0005956099,0.00022429398,0.0008473756,0.00018138348,0.00006638838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011627439,0.00014903644,0.00043354923,0.00050559413,0.00014420654,0.00005132001,0.00039805504,0.00007581656,0.00000432628],"category_scores_gemma":[0.000028976254,0.00012185094,0.00019855282,0.0020267523,0.00006545847,0.00023199704,0.0000012977201,0.00008427511,0.000013127724],"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.00018356559,0.00050440524,0.00011414859,0.0008025116,0.0020905875,0.0000026603982,0.0017498075,0.91679615,0.0028836066,0.009708921,0.00002976033,0.065133885],"study_design_scores_gemma":[0.0009312967,0.00026608,0.0007097018,0.000033830438,0.00026730253,0.0000025034403,0.00004202606,0.99483335,0.002554095,0.000201113,0.000036412617,0.00012226812],"about_ca_topic_score_codex":0.000043032258,"about_ca_topic_score_gemma":0.000021396621,"teacher_disagreement_score":0.83969784,"about_ca_system_score_codex":0.000073426,"about_ca_system_score_gemma":0.0000759165,"threshold_uncertainty_score":0.49689373},"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":"W43771048","doi":"10.1007/978-3-662-07003-1_10","title":"Fixed Point Logics and Complexity Classes","year":2004,"lang":"en","type":"book-chapter","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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":"Reachability; Graph; Theoretical computer science; Computer science; Mathematics; Fixed point; Computation; Discrete mathematics; Algorithm","score_opus":0.12771086779019478,"score_gpt":0.3037117558248579,"score_spread":0.1760008880346631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43771048","genre_codex":"other","genre_gemma":"methods","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.0000029780426,0.00008262272,0.4915454,0.00026545595,0.00020947818,0.00011515921,0.0000030579174,0.00015197626,0.50762385],"genre_scores_gemma":[0.0004677873,0.00012609232,0.906751,0.00051766325,0.000056665,0.0000031267903,0.0000070122605,0.00001405877,0.09205665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998877,0.000021881428,0.00026171576,0.00044305366,0.00023509053,0.00016126614],"domain_scores_gemma":[0.99891067,0.000058947517,0.00016373103,0.0006966318,0.000088383385,0.00008165939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029304918,0.00022411658,0.0002475249,0.00009005272,0.00008515686,0.00013264582,0.00060969935,0.0002278118,0.00022267236],"category_scores_gemma":[0.000039008275,0.00019435535,0.00005915005,0.000029348197,0.00020896054,0.00027729978,0.00040168708,0.0002628384,0.00011765631],"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.0000014366835,0.0000053019476,0.00000201479,0.000022287659,0.0000077113755,0.0000040588884,0.000040393144,0.0000027001624,0.000008088504,0.9882174,0.000350785,0.011337818],"study_design_scores_gemma":[0.000120346085,0.000084088955,0.00029723515,0.00004683966,0.0000073658352,0.000033036435,0.0000025834604,0.0022889392,0.00020510916,0.94722784,0.04938952,0.00029707752],"about_ca_topic_score_codex":0.000020844385,"about_ca_topic_score_gemma":0.000011229943,"teacher_disagreement_score":0.41556722,"about_ca_system_score_codex":0.000093127266,"about_ca_system_score_gemma":0.00007843254,"threshold_uncertainty_score":0.79255813},"labels":[],"label_agreement":null},{"id":"W4377200038","doi":"10.1007/978-3-031-32726-1_25","title":"Compressing Branch-and-Bound Trees","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","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":"University of British Columbia","funders":"","keywords":"Branch and bound; Upper and lower bounds; Computer science; Branching (polymer chemistry); Search tree; Tree (set theory); Heuristic; Compression (physics); Node (physics); Branch and cut; Algorithm; Combinatorics; Integer programming; Mathematics; Artificial intelligence; Search algorithm","score_opus":0.042264135851868924,"score_gpt":0.29507209685717095,"score_spread":0.252807961005302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200038","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.00012635854,0.00039301367,0.9925368,0.00042852465,0.0025417898,0.000274393,0.0000032014602,0.00039275177,0.0033031972],"genre_scores_gemma":[0.040961064,0.00009289747,0.9568837,0.00072104443,0.00041571792,0.000010377134,0.0000034909363,0.00005052992,0.0008611736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964896,0.00005875791,0.0005012046,0.0014586587,0.0008977659,0.00059402786],"domain_scores_gemma":[0.99723583,0.00076788204,0.0002845373,0.0014011154,0.00015328954,0.00015733587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013718902,0.0004530608,0.00047990927,0.00083859375,0.00037253593,0.00096522114,0.0028391206,0.00030086385,0.0000066817474],"category_scores_gemma":[0.00022689358,0.00042862364,0.000088149616,0.00069589,0.0010464567,0.0009052634,0.0016602427,0.0007439418,0.00007023101],"study_design_candidate":"design_other","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.0000027160643,0.000008411312,0.000034454613,0.000037396596,0.00000686493,0.000025117382,0.00065559667,0.0072277193,0.00035752862,0.100440145,0.0000096720005,0.8911944],"study_design_scores_gemma":[0.00017058509,0.00008538574,0.0009252818,0.00041664488,0.0000064389055,0.00005226822,1.1968501e-7,0.66260266,0.0016861322,0.33242196,0.0010495909,0.0005829454],"about_ca_topic_score_codex":0.000020876816,"about_ca_topic_score_gemma":0.000046688532,"teacher_disagreement_score":0.8906114,"about_ca_system_score_codex":0.00017415782,"about_ca_system_score_gemma":0.00026173546,"threshold_uncertainty_score":0.99981654},"labels":[],"label_agreement":null},{"id":"W4382866769","doi":"10.1609/icaps.v33i1.27238","title":"Exploration Policies for On-the-Fly Controller Synthesis: A Reinforcement Learning Approach","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Secretaría de Ciencia y Técnica, Universidad de Buenos Aires; International Development Research Centre; Agencia Nacional de Investigación e Innovación","keywords":"Reinforcement learning; Heuristics; Computer science; Heuristic; Task (project management); Set (abstract data type); Controller (irrigation); Supervisory control; Domain (mathematical analysis); Artificial intelligence; Space (punctuation); Control (management); Machine learning; Mathematical optimization; Mathematics; Engineering","score_opus":0.1186295975928637,"score_gpt":0.33159983778870095,"score_spread":0.21297024019583724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7207681,0.000029972483,0.23448895,0.015865125,0.0007796248,0.001263251,0.000008025842,0.0018001462,0.024996802],"genre_scores_gemma":[0.9736695,0.000011459996,0.02568907,0.00016727461,0.00004203713,0.00019236324,0.000002629972,0.000008253243,0.00021737716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989296,0.000020070845,0.00026665418,0.00023154294,0.00038349157,0.00016861525],"domain_scores_gemma":[0.9989704,0.00029109165,0.00030983958,0.0000850547,0.00031612688,0.000027500113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011859939,0.0001223167,0.00013350155,0.00017279947,0.00030505317,0.0003131578,0.0007733498,0.000054072105,0.000001440601],"category_scores_gemma":[0.0014785425,0.00007995291,0.00005088946,0.0002534189,0.000049813203,0.00033897156,0.00013604893,0.000177734,0.000004620727],"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.00008462011,0.000017407374,0.00020180707,0.000040445262,0.0000588929,8.268614e-8,0.0027302827,0.08320982,0.01263649,0.8994174,0.00033474067,0.001267993],"study_design_scores_gemma":[0.00017277036,0.00006608696,0.0003374745,0.00030380118,0.0000066362445,0.00000229607,0.0013486078,0.9750097,0.019124841,0.0034387298,0.000100299934,0.000088796354],"about_ca_topic_score_codex":0.000004725758,"about_ca_topic_score_gemma":3.166053e-8,"teacher_disagreement_score":0.8959787,"about_ca_system_score_codex":0.00003266862,"about_ca_system_score_gemma":0.000027968706,"threshold_uncertainty_score":0.32603848},"labels":[],"label_agreement":null},{"id":"W4384080509","doi":"10.1109/ojcsys.2023.3294829","title":"Robustly Complete Finite-State Abstractions for Control Synthesis of Stochastic Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Open Journal of Control Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Soundness; Probabilistic logic; Abstraction; Nonlinear system; Computer science; State space; Theoretical computer science; Mathematics; Discrete mathematics; Programming language","score_opus":0.07688564880482071,"score_gpt":0.3240751556907926,"score_spread":0.24718950688597188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384080509","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.0018666331,0.00026251847,0.9898072,0.00024971337,0.005451506,0.0019145499,0.00020256075,0.00004721341,0.00019813656],"genre_scores_gemma":[0.9889016,0.000009859571,0.010274352,0.000026823958,0.00030836966,0.00028383796,9.93757e-7,0.00002796768,0.00016620258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962152,0.0006909079,0.0017914212,0.00026738958,0.00062681304,0.00040826833],"domain_scores_gemma":[0.991161,0.0043006907,0.002526094,0.00062123896,0.001199528,0.00019143247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006224816,0.00022158348,0.0010791052,0.00043506856,0.00019942028,0.00059863366,0.0022922882,0.00009412031,0.000002464808],"category_scores_gemma":[0.0012216544,0.00018867185,0.00026134655,0.00045625525,0.00006593427,0.0012196436,0.000049809478,0.00022347008,0.000045501307],"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.00026939268,0.00005612192,0.000014984438,0.00018067204,0.00038934126,0.000019835341,0.00016062972,0.98519576,0.0048386133,0.006364631,0.0010149836,0.0014950483],"study_design_scores_gemma":[0.0028920693,0.00037955176,0.00019992072,0.00051546673,0.000141649,0.0002202772,0.00019028544,0.99369305,0.00021785458,0.00029670697,0.0010451368,0.00020803847],"about_ca_topic_score_codex":0.00013266214,"about_ca_topic_score_gemma":0.0000035691705,"teacher_disagreement_score":0.987035,"about_ca_system_score_codex":0.00011317638,"about_ca_system_score_gemma":0.00026565287,"threshold_uncertainty_score":0.76938146},"labels":[],"label_agreement":null},{"id":"W4384163226","doi":"10.1145/3605156.3606454","title":"Dependency-Free Capture Tracking","year":2023,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dependency (UML); Computer science; Tracking (education); Type (biology); Artificial intelligence","score_opus":0.048199694747578146,"score_gpt":0.30710995756440196,"score_spread":0.25891026281682383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384163226","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.0037721563,0.000017213886,0.95547277,0.0008072482,0.0005427668,0.000062640895,4.931141e-7,0.0009085957,0.038416103],"genre_scores_gemma":[0.1517276,0.0000065567397,0.8451439,0.00025355016,0.000043668595,0.000009793216,0.0000011052782,0.000005868831,0.00280793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927604,0.00004065914,0.00010566768,0.00019676238,0.0002053316,0.00017554952],"domain_scores_gemma":[0.9991061,0.00004606841,0.000027967744,0.00074319245,0.00003735936,0.000039313814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047270287,0.00005619026,0.000053557622,0.00008475872,0.00006619188,0.00008683374,0.0011643784,0.000045701894,0.00002972821],"category_scores_gemma":[0.00021677074,0.00004849959,0.000027875016,0.00052341947,0.000012247698,0.00052211195,0.00026097917,0.00008579368,0.0005089],"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":[6.495048e-7,0.000006864558,0.00019029021,0.000006535115,0.0000030026947,0.000010108457,0.0005932453,0.00008254846,0.0012421733,0.89637524,0.005991857,0.095497474],"study_design_scores_gemma":[0.0004376081,0.00005536691,0.043805137,0.000021063313,0.0000052199866,0.000060372233,0.0002398447,0.58380693,0.043660555,0.30745387,0.019946767,0.00050725584],"about_ca_topic_score_codex":0.00002009591,"about_ca_topic_score_gemma":0.0000074976256,"teacher_disagreement_score":0.58892137,"about_ca_system_score_codex":0.000016019385,"about_ca_system_score_gemma":0.000021005297,"threshold_uncertainty_score":0.65410495},"labels":[],"label_agreement":null},{"id":"W4384296680","doi":"10.32920/23688762","title":"Hybrid Temporal Situation Calculus","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Formal Methods in Verification","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":"Toronto Metropolitan University; York University","funders":"","keywords":"Situation calculus; Action (physics); Automaton; Calculus (dental); Hybrid automaton; Computer science; Mathematics; Theoretical computer science; Artificial intelligence; Physics","score_opus":0.09078279154764969,"score_gpt":0.34091812233534347,"score_spread":0.2501353307876938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384296680","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.0022700888,0.000021400261,0.9881051,0.0008196634,0.0032271687,0.00029497253,0.0000050705416,0.0012530176,0.0040034885],"genre_scores_gemma":[0.08024356,0.000014128207,0.91574734,0.00014646638,0.00015740155,0.0000787626,0.00006000256,0.000018216268,0.0035341508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833083,0.0001363001,0.00033026497,0.00060839363,0.00038318086,0.00021101763],"domain_scores_gemma":[0.9982568,0.000050448165,0.00019119288,0.0013132468,0.0001201768,0.00006813571],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009772752,0.0001739376,0.00018103694,0.0001737181,0.00006690882,0.00024996686,0.0014183356,0.000132395,0.000018329849],"category_scores_gemma":[0.0001949144,0.00016736622,0.00009470282,0.00017945872,0.00002796319,0.00028668225,0.0018491896,0.00035904083,0.0008119257],"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.0000064831247,0.00008294646,0.0003758993,0.00021988583,0.00005853814,0.000041540192,0.0009005065,0.0057036267,0.00028783362,0.78357494,0.024073742,0.18467408],"study_design_scores_gemma":[0.000070009955,0.000020464791,0.0030105482,0.000032755655,0.0000057395728,0.000006347805,0.000007324765,0.91257024,0.0051504876,0.07682297,0.0020146407,0.00028844504],"about_ca_topic_score_codex":0.000260481,"about_ca_topic_score_gemma":0.0000114278555,"teacher_disagreement_score":0.9068666,"about_ca_system_score_codex":0.00011101372,"about_ca_system_score_gemma":0.00014987594,"threshold_uncertainty_score":0.9999661},"labels":[],"label_agreement":null},{"id":"W4384471467","doi":"10.1007/978-3-031-37709-9_18","title":"Early Verification of Legal Compliance via Bounded Satisfiability Checking","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"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 Ottawa; University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Satisfiability modulo theories; Counterexample; Computer science; Satisfiability; Model checking; Formalism (music); Bounded function; Boolean satisfiability problem; Formal verification; Theoretical computer science; Solver; Property (philosophy); Algorithm; Programming language; Mathematics; Discrete mathematics","score_opus":0.05357459175041632,"score_gpt":0.30324636415967793,"score_spread":0.2496717724092616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384471467","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.000965121,0.000081501166,0.9937045,0.0002052538,0.0023927528,0.00053097535,0.000006982783,0.00023207162,0.0018808529],"genre_scores_gemma":[0.24036752,0.000015743819,0.7591068,0.000131444,0.00016053217,0.000014993473,0.000004320035,0.000033501856,0.00016513678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954923,0.00009947395,0.00093511195,0.0016108984,0.0012763286,0.0005859214],"domain_scores_gemma":[0.9957294,0.00047083074,0.00073677674,0.002442025,0.0004918832,0.00012909825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025440368,0.00046066835,0.0006160677,0.0006945161,0.00024378118,0.00038411884,0.003852961,0.00034126654,0.000008105146],"category_scores_gemma":[0.00034622723,0.00047792812,0.000149834,0.0012474951,0.0012016903,0.00088621886,0.0009897676,0.00078725355,0.000066805624],"study_design_candidate":"design_other","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.000012312411,0.000035167315,0.0002288236,0.00016712052,0.000013215608,0.000012258421,0.00088548224,0.0059583993,0.002679782,0.2354276,0.0000033642386,0.7545765],"study_design_scores_gemma":[0.0002154544,0.00019022055,0.012049863,0.00050457515,0.000008839413,0.00002537882,1.7412299e-7,0.68044066,0.010021907,0.29553688,0.0003474299,0.0006586224],"about_ca_topic_score_codex":0.00012035587,"about_ca_topic_score_gemma":0.000038845577,"teacher_disagreement_score":0.7539179,"about_ca_system_score_codex":0.00042312255,"about_ca_system_score_gemma":0.00047583226,"threshold_uncertainty_score":0.99976724},"labels":[],"label_agreement":null},{"id":"W4384573135","doi":"10.1007/978-3-031-37703-7_4","title":"Fast Approximations of Quantifier Elimination","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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":"Natural Sciences and Engineering Research Council of Canada; European Commission; Israel Science Foundation; Microsoft Research","keywords":"Quantifier elimination; Computer science; Reduction (mathematics); Quantifier (linguistics); Projection (relational algebra); Solver; Equivalence (formal languages); Satisfiability modulo theories; Algorithm; Horn clause; Theoretical computer science; Programming language; Prolog; Artificial intelligence; Discrete mathematics; Mathematics","score_opus":0.045578936242325355,"score_gpt":0.2978557020979952,"score_spread":0.2522767658556699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384573135","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.00003056716,0.000050447936,0.9925185,0.00035643918,0.002016803,0.00035646153,0.0000070755755,0.00019749276,0.004466242],"genre_scores_gemma":[0.019140111,0.000027984675,0.9798156,0.00012782402,0.00014356295,0.000014651114,0.000009339638,0.000028843127,0.0006920535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969395,0.000049509526,0.0006441012,0.000979739,0.0010079201,0.00037922116],"domain_scores_gemma":[0.99714977,0.00041813165,0.00048026512,0.0014468239,0.00042528854,0.00007970889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016861489,0.00030970512,0.00038207736,0.001219943,0.00016037114,0.00020722435,0.0027223388,0.00027007004,0.000008834439],"category_scores_gemma":[0.00033852848,0.0003028274,0.000106872416,0.0011859391,0.00059358357,0.00075770996,0.0008228191,0.00047217333,0.00007849779],"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.0000016568979,0.000015951557,0.00000651259,0.000054429802,0.0000048222937,0.000004064634,0.00071066426,0.015597221,0.00030931813,0.43729085,0.000008837005,0.5459957],"study_design_scores_gemma":[0.00009488067,0.00008253149,0.00038158672,0.0002346379,0.0000056447884,0.0000125150755,3.1293243e-7,0.79243684,0.005982385,0.20027651,0.00017438484,0.000317791],"about_ca_topic_score_codex":0.000010320808,"about_ca_topic_score_gemma":0.000016296714,"teacher_disagreement_score":0.7768396,"about_ca_system_score_codex":0.00016795956,"about_ca_system_score_gemma":0.00032045887,"threshold_uncertainty_score":0.99994236},"labels":[],"label_agreement":null},{"id":"W4385005490","doi":"10.1145/3632872","title":"Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Technische Universität Wien; Vienna Science and Technology Fund; McGill University","keywords":"Invariant (physics); Probabilistic logic; Mathematics; Polynomial; Decidability; Bracket polynomial; Reachability; Discrete mathematics; Matrix polynomial; Combinatorics; Square-free polynomial; Mathematical analysis","score_opus":0.06247433803599339,"score_gpt":0.30772430562095204,"score_spread":0.24524996758495865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385005490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9588588,0.0008003613,0.01300169,0.013426308,0.0034211809,0.007381241,0.00010139024,0.0009492973,0.0020597633],"genre_scores_gemma":[0.81111634,0.000004396438,0.18805377,0.00006478887,0.00015541894,0.00038266715,0.000002499064,0.000033132565,0.00018700016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979942,0.000042099982,0.0004484162,0.0005461581,0.0005455394,0.00042360145],"domain_scores_gemma":[0.9978996,0.0003333657,0.00046164,0.0009623649,0.00028186437,0.00006116886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017258152,0.00025771215,0.00029887684,0.00012942088,0.00018822106,0.00046990355,0.0040604887,0.00011462102,0.0000037228626],"category_scores_gemma":[0.0043087914,0.00015213026,0.00018746554,0.00065347506,0.00022982499,0.00043521525,0.0007815893,0.00032091685,0.0000047029957],"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.00016281154,0.00043104144,0.0019424213,0.0013342922,0.00016724234,0.0000017298521,0.0033911553,0.000019099272,0.0061444254,0.57651913,0.002402911,0.40748373],"study_design_scores_gemma":[0.0035879877,0.0076363687,0.056676,0.013838296,0.00073022966,0.000112771384,0.018523624,0.051563304,0.757559,0.05213481,0.03472137,0.0029162602],"about_ca_topic_score_codex":0.00003001139,"about_ca_topic_score_gemma":0.0000035853259,"teacher_disagreement_score":0.75141454,"about_ca_system_score_codex":0.000078589925,"about_ca_system_score_gemma":0.000076993645,"threshold_uncertainty_score":0.7545466},"labels":[],"label_agreement":null},{"id":"W4386206471","doi":"10.1007/978-3-031-38938-2_6","title":"Alternative Methods for Retaining Explicit and Finding Implicit Sharing in Embedded DSLs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Computer science; Memory footprint; Domain (mathematical analysis); Theoretical computer science; Interface (matter); Hash function; Programming language; Parallel computing","score_opus":0.09291485620620997,"score_gpt":0.3912667999303437,"score_spread":0.2983519437241337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386206471","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.00041882248,0.00015975554,0.9959749,0.00016978884,0.0014416156,0.0007978931,0.0000041278677,0.00018942663,0.00084365305],"genre_scores_gemma":[0.012288786,0.000044463246,0.9868193,0.00031573584,0.00023242182,0.000082397484,0.000003424401,0.00005292169,0.00016053944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957811,0.00009322363,0.000755319,0.002061123,0.0004976783,0.00081150857],"domain_scores_gemma":[0.9960192,0.0020027258,0.0004381921,0.0012200653,0.00018102396,0.00013881609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005427681,0.00050394656,0.0006701624,0.0015642205,0.00026597898,0.0006191151,0.0031513763,0.00032407328,0.0000021889055],"category_scores_gemma":[0.0009090357,0.00050983037,0.00010441668,0.0010018015,0.000276979,0.0009493814,0.0022223338,0.0008083132,0.0000061811547],"study_design_candidate":"design_other","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.0000073770175,0.0000059811264,0.00005285646,0.00005997989,0.000009185817,0.000013071524,0.0035545724,0.011070091,0.0008912078,0.21167856,8.886156e-7,0.7726562],"study_design_scores_gemma":[0.0001913176,0.000083414714,0.000099923636,0.00036312905,0.0000037398918,0.000019056053,0.000001135328,0.6261229,0.0058816294,0.36680079,0.000069340065,0.00036362174],"about_ca_topic_score_codex":0.000030774758,"about_ca_topic_score_gemma":0.00002968891,"teacher_disagreement_score":0.7722926,"about_ca_system_score_codex":0.00039050274,"about_ca_system_score_gemma":0.00018479589,"threshold_uncertainty_score":0.99973536},"labels":[],"label_agreement":null},{"id":"W4386711818","doi":"10.21711/2319023x2023/pmo1124","title":"Determinantes de Hurwitz para verificar quando polinômios possuem somente raízes reais","year":2023,"lang":"pt","type":"article","venue":"Revista Professor de Matemática On line","topic":"Formal Methods in Verification","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":"WiLAN (Canada)","funders":"","keywords":"Physics","score_opus":0.10325354376842834,"score_gpt":0.3922155032317745,"score_spread":0.2889619594633462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386711818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7142481,0.0047324584,0.22866838,0.035448153,0.0053811315,0.0056719584,0.00043295015,0.003657787,0.0017590522],"genre_scores_gemma":[0.8591512,0.0043638917,0.104590826,0.0014738889,0.0011988734,0.0006147189,0.00012737807,0.00030476408,0.028174503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921922,0.0019314291,0.0015903701,0.0013616065,0.00091811793,0.0020062707],"domain_scores_gemma":[0.9949175,0.0008424228,0.00082949037,0.0025328593,0.0003212704,0.00055642583],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004757711,0.0007957212,0.0010818763,0.0005851598,0.00063291553,0.0007993411,0.002241649,0.00051145186,0.00009221636],"category_scores_gemma":[0.0019425238,0.00076195376,0.00035072883,0.0020244077,0.0003060135,0.00060524145,0.00068906293,0.0009849573,0.002418328],"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.002704432,0.002716717,0.0049910014,0.013619197,0.0007763528,0.0019202508,0.020532861,0.000520427,0.08589462,0.7255384,0.040863782,0.09992197],"study_design_scores_gemma":[0.004530803,0.003819927,0.02207662,0.008299583,0.00057362084,0.00045495963,0.0019803555,0.70555353,0.113387406,0.0046567777,0.13106479,0.003601653],"about_ca_topic_score_codex":0.000035454228,"about_ca_topic_score_gemma":0.0000030523388,"teacher_disagreement_score":0.7208816,"about_ca_system_score_codex":0.0005474336,"about_ca_system_score_gemma":0.00047834546,"threshold_uncertainty_score":0.99948317},"labels":[],"label_agreement":null},{"id":"W4387185322","doi":"10.3233/faia230293","title":"Cache-Efficient Dynamic Programming MDP Solver","year":2023,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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é du Québec à Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Memory hierarchy; Solver; Parallel computing; Hierarchy; State (computer science); Domain (mathematical analysis); Dynamic programming; Cache algorithms; Cache-oblivious algorithm; Component (thermodynamics); CPU cache; Distributed computing; Algorithm; Programming language; Mathematics","score_opus":0.05499757586910129,"score_gpt":0.3088359084503276,"score_spread":0.2538383325812263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387185322","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.0000059300487,0.0005154466,0.98112845,0.00023582792,0.0007333159,0.0010608194,0.00001552328,0.0002673874,0.016037269],"genre_scores_gemma":[0.0023498915,0.0011416666,0.94725233,0.00010822108,0.00022846856,0.0010835016,0.00007315169,0.000096580894,0.047666185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779016,0.000027946196,0.0006645505,0.00083532935,0.00030678153,0.00037521886],"domain_scores_gemma":[0.99862,0.00006823196,0.00025120107,0.00084759714,0.000099678095,0.00011330285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058836717,0.00030338313,0.00032674038,0.00047959748,0.0002330594,0.00019828629,0.0009194503,0.00030430962,0.000008914255],"category_scores_gemma":[0.000037670583,0.00033371593,0.00009698515,0.00039164402,0.00029307773,0.00015073869,0.00027534782,0.0004810755,0.00025394693],"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.0000018879603,0.000021761498,0.0000033728475,0.000018366934,0.000008539423,0.000001788528,0.00017183386,0.00048512907,0.0000068837267,0.52498126,0.00011746077,0.4741817],"study_design_scores_gemma":[0.000017946164,0.000039427523,0.000021189464,0.00010906073,0.000024433028,0.000005137207,0.00021880909,0.36488697,0.00030217695,0.5466388,0.087202206,0.0005338906],"about_ca_topic_score_codex":0.000013873976,"about_ca_topic_score_gemma":0.00002854863,"teacher_disagreement_score":0.4736478,"about_ca_system_score_codex":0.00016257801,"about_ca_system_score_gemma":0.00008808859,"threshold_uncertainty_score":0.9999115},"labels":[],"label_agreement":null},{"id":"W4387191111","doi":"10.1016/j.inffus.2023.102048","title":"Multi-valued model checking IoT and intelligent systems with commitment protocols in multi-source data environments","year":2023,"lang":"en","type":"article","venue":"Information Fusion","topic":"Formal Methods in Verification","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 Alberta; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Higher Education, Malaysia; Concordia University","keywords":"Liveness; Computer science; Model checking; Reachability; Internet of Things; Distributed computing; Formal verification; Theoretical computer science; Embedded system","score_opus":0.18675881537601055,"score_gpt":0.366215782642522,"score_spread":0.17945696726651147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387191111","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.013395162,0.000009667191,0.9802817,0.000033666223,0.00007042017,0.0059994594,0.000009187441,0.00013911634,0.00006159891],"genre_scores_gemma":[0.07786112,0.000039209706,0.9189971,0.00010660266,0.000010068301,0.0026961523,0.00014624627,0.000012362511,0.00013115398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985853,0.00009386335,0.00047871415,0.0002306897,0.00040239835,0.0002090568],"domain_scores_gemma":[0.99876994,0.000021839582,0.00024933522,0.00086739106,0.000027274438,0.00006422565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013203571,0.00013597895,0.00013443733,0.0002502836,0.0001302635,0.00020828481,0.0007375703,0.00006912957,0.0000010243602],"category_scores_gemma":[0.00007214604,0.000114373324,0.0000101134965,0.0003847545,0.000033221157,0.0019149822,0.0008631424,0.00013308601,0.00008251413],"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.00007597558,0.00022496273,0.0030788898,0.0003664309,0.000017973489,0.0000028642608,0.017688168,0.7416958,0.0017500792,0.0032259545,0.00015742423,0.23171544],"study_design_scores_gemma":[0.00072936993,0.000044394237,0.004638872,0.00015634716,0.0000018887405,0.000004700342,0.00026413475,0.98830444,0.0007169721,0.000007559066,0.004991819,0.0001395128],"about_ca_topic_score_codex":0.000050879196,"about_ca_topic_score_gemma":0.0000063152856,"teacher_disagreement_score":0.2466086,"about_ca_system_score_codex":0.00010794491,"about_ca_system_score_gemma":0.000029290102,"threshold_uncertainty_score":0.4664009},"labels":[],"label_agreement":null},{"id":"W4387304729","doi":"10.1007/s11227-023-05669-3","title":"Performance modeling and quantitative evaluation for cyber-physical systems based on LTS","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"Fundamental Research Funds for the Central Universities; Chinese Aeronautical Establishment; National Natural Science Foundation of China","keywords":"Computer science; Cyber-physical system; Probabilistic logic; Reliability (semiconductor); Software deployment; Model checking; Complex system; Distributed computing; Reliability engineering; Theoretical computer science; Artificial intelligence; Software engineering","score_opus":0.1274955694609024,"score_gpt":0.36929573885408246,"score_spread":0.24180016939318005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387304729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5088297,0.000029476865,0.49057582,0.00012464804,0.00025673714,0.00012984184,3.3301959e-7,0.000017740229,0.000035701018],"genre_scores_gemma":[0.8791855,0.000008357852,0.12062467,0.000029664892,0.00013889199,0.0000035679473,5.977602e-7,0.000006905435,0.0000018512422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986249,0.00033480607,0.0003077048,0.0001101864,0.00045853975,0.0001638561],"domain_scores_gemma":[0.9983639,0.0008670527,0.00017067385,0.00018653154,0.00037526284,0.00003657529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071848347,0.00008490979,0.00015115828,0.00015102583,0.00025047973,0.00007885414,0.00038873116,0.000025097032,1.4983634e-7],"category_scores_gemma":[0.0003798921,0.000056979377,0.00004493815,0.0003299466,0.000025672423,0.0004583063,0.00005440847,0.00015638772,0.0000037257116],"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.00003118744,0.000013074949,0.000056197463,0.0000310646,0.000008091828,2.815876e-7,0.0025027208,0.97071254,0.0009433928,0.0040550358,0.00001595334,0.021630485],"study_design_scores_gemma":[0.00032313156,0.0003423541,0.0007674222,0.00016481617,0.000019646903,0.000016589802,0.00045287836,0.99693996,0.0003799325,0.0005202379,0.0000066562257,0.000066354725],"about_ca_topic_score_codex":0.000004791933,"about_ca_topic_score_gemma":1.1607319e-7,"teacher_disagreement_score":0.3703558,"about_ca_system_score_codex":0.000056550176,"about_ca_system_score_gemma":0.000065468106,"threshold_uncertainty_score":0.24901347},"labels":[],"label_agreement":null},{"id":"W4387842564","doi":"10.1007/978-3-031-43345-0","title":"Recent Trends in Algebraic Development Techniques","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universitat Politècnica de Catalunya; Universidade do Minho; Université Paris-Saclay; Universitetet i Oslo; University of Oxford; Universidad Complutense de Madrid; Universidade de Aveiro; Swansea University; University of Ottawa","keywords":"Computer science; Algebraic number; Development (topology); Algebra over a field; Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.03700882443920046,"score_gpt":0.3105604988519152,"score_spread":0.2735516744127148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387842564","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.000046874375,0.00024406506,0.99364114,0.00053510844,0.0020877153,0.00032443597,0.0000013051354,0.00058750005,0.0025318654],"genre_scores_gemma":[0.00039326004,0.00012263868,0.9967106,0.0006704627,0.00022014073,0.00007260531,0.000014881975,0.000038194634,0.0017571887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995321,0.00014003497,0.0008171625,0.0016970542,0.001160652,0.0008641142],"domain_scores_gemma":[0.9975193,0.00031275098,0.0003075065,0.0015424911,0.00018234763,0.00013560668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031156647,0.00049557135,0.0005156215,0.0032215656,0.0001696382,0.00040690025,0.004760279,0.00040360348,0.000013198286],"category_scores_gemma":[0.00023399125,0.00047813836,0.00007159301,0.0053127096,0.00037328948,0.00070046395,0.0018248714,0.0009766227,0.0000776764],"study_design_candidate":"design_other","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.000002063448,0.000027224882,0.000029124778,0.00002078415,0.0000027779781,0.000035629848,0.0010084728,0.00085513794,0.00004829286,0.0021806692,0.0001385773,0.99565125],"study_design_scores_gemma":[0.000662645,0.0004715268,0.009375476,0.00216943,0.000009250043,0.00013204904,7.2293955e-7,0.557175,0.06728665,0.2335389,0.12565604,0.003522355],"about_ca_topic_score_codex":0.000010528635,"about_ca_topic_score_gemma":0.00016938518,"teacher_disagreement_score":0.9921289,"about_ca_system_score_codex":0.0019836542,"about_ca_system_score_gemma":0.0015538952,"threshold_uncertainty_score":0.999767},"labels":[],"label_agreement":null},{"id":"W4388511218","doi":"10.1007/978-981-99-7584-6_14","title":"Proving Local Invariants in ASTDs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université de Sherbrooke","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Guard (computer science); Modular design; Invariant (physics); Process calculus; Theoretical computer science; Programming language; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.03633262221751391,"score_gpt":0.2815690185027539,"score_spread":0.24523639628524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388511218","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.000046499295,0.000075179574,0.99231315,0.00031405716,0.0027898487,0.000451766,0.0000022537051,0.00027709894,0.003730161],"genre_scores_gemma":[0.042074855,0.000024703022,0.95640826,0.00066531013,0.00026600275,0.000021843265,0.0000031993422,0.000048873615,0.0004869606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956738,0.00008547245,0.0006911439,0.0016717516,0.0010871916,0.00079067034],"domain_scores_gemma":[0.997343,0.0004638767,0.00029033766,0.0016014992,0.00015664414,0.00014462526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026811322,0.00046497287,0.00049521716,0.0015307764,0.00015746531,0.0004672431,0.0043302346,0.00040855753,0.000009260308],"category_scores_gemma":[0.00036796322,0.00045701046,0.00008512742,0.0015924125,0.00069016276,0.0010435644,0.0020340127,0.0011443341,0.0001696899],"study_design_candidate":"design_other","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.0000029992636,0.000017390226,0.00007302886,0.000044002787,0.0000033438828,0.00011878988,0.00067970966,0.031250898,0.00006873798,0.09771885,0.000008066996,0.8700142],"study_design_scores_gemma":[0.00017965665,0.000116044735,0.00090262474,0.0004647653,0.0000020952864,0.000041157662,2.5079788e-7,0.82404286,0.0009017348,0.17255016,0.00028916975,0.0005095002],"about_ca_topic_score_codex":0.000059221326,"about_ca_topic_score_gemma":0.00017137648,"teacher_disagreement_score":0.8695047,"about_ca_system_score_codex":0.0005677692,"about_ca_system_score_gemma":0.0007445836,"threshold_uncertainty_score":0.99978817},"labels":[],"label_agreement":null},{"id":"W4388511321","doi":"10.1007/978-981-99-7584-6","title":"Formal Methods and Software Engineering","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Universitat Politècnica de València; Japan Aerospace Exploration Agency; University of Science and Technology Beijing; National Cheng Kung University; Academia Româna; Syddansk Universitet; Universitetet i Oslo; Shanghai Jiao Tong University; Zhejiang University; East China Normal University; Tongji University; Università degli Studi di Trento; Universidad Complutense de Madrid; Chinese Academy of Sciences; Fondazione Bruno Kessler; Peking University; Academia Sinica; University of New South Wales; National Institute of Informatics; Aston University; Victoria University of Wellington; National University of Singapore; Griffith University; Nanyang Technological University; Indian Institute of Technology Kanpur; Université de Sherbrooke; National Aeronautics and Space Administration; Singapore Management University; Università degli Studi di Milano; Concordia University; McMaster University; Technische Universität Darmstadt; Teesside University; Langley Research Center; Eidgenössische Technische Hochschule Zürich; Universidade de São Paulo; RMIT University; Carnegie Mellon University; Southwest University; Université de Lorraine; Florida International University; Victoria University; Université du Luxembourg","keywords":"Computer science; Software engineering; Formal methods; Formal verification; Programming language","score_opus":0.024763554960233098,"score_gpt":0.31415459819574465,"score_spread":0.28939104323551157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388511321","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.000028362332,0.00034917056,0.99539906,0.00009226225,0.0030967614,0.00028672282,0.0000025632987,0.0005812042,0.00016391036],"genre_scores_gemma":[0.00017923277,0.000035496003,0.9987007,0.00028467132,0.0003027043,0.000021247151,0.0000033393208,0.000037722864,0.00043492045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967305,0.0000971053,0.00045968493,0.0012608117,0.0006525626,0.0007993179],"domain_scores_gemma":[0.9970336,0.0011949122,0.00019669741,0.0012629383,0.00014200633,0.0001698555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003524518,0.00042061397,0.0004460144,0.0009985805,0.00021455684,0.00055036944,0.0028554006,0.00032524244,0.0000020465538],"category_scores_gemma":[0.001263023,0.00040642088,0.00007606398,0.0015923117,0.0003430895,0.0013308134,0.0023907227,0.00083845586,0.00002411055],"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.0000012915713,0.0000059003128,0.00002332121,0.00009720924,0.0000055998858,0.000018359808,0.00055542093,0.018816462,0.00010154373,0.008558258,0.000028830766,0.9717878],"study_design_scores_gemma":[0.000116075935,0.000084773725,0.00063580176,0.00023649067,0.0000049027553,0.000074022435,8.900802e-8,0.9547754,0.002026315,0.039995782,0.0015394106,0.00051092496],"about_ca_topic_score_codex":0.00000565629,"about_ca_topic_score_gemma":0.0000044772305,"teacher_disagreement_score":0.9712769,"about_ca_system_score_codex":0.00034395757,"about_ca_system_score_gemma":0.00056036725,"threshold_uncertainty_score":0.99983877},"labels":[],"label_agreement":null},{"id":"W4389785926","doi":"10.21203/rs.3.rs-3668418/v1","title":"Applying Formal Methods to Build a Safe Continuous-Control Architecture for an Unmanned Aerial Vehicle","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa e Inovação do Estado de Santa Catarina; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Royal Academy of Engineering","keywords":"Computer science; Architecture; Process (computing); Cyber-physical system; Model checking; Formal verification; Embedded system; Concurrency; Software; Software architecture; Distributed computing; Real-time computing; Software engineering; Programming language; Operating system","score_opus":0.13306478006519032,"score_gpt":0.4793031136798104,"score_spread":0.3462383336146201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389785926","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.0039144875,0.00008922139,0.9817571,0.0016579587,0.001701559,0.009670428,0.00019132547,0.00068275654,0.0003351373],"genre_scores_gemma":[0.03190585,0.000010534137,0.9528321,0.00020775039,0.0012270036,0.013317826,0.000080153266,0.00011039091,0.00030836844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99081,0.0032289808,0.0007814,0.0017508536,0.0015075504,0.0019212653],"domain_scores_gemma":[0.9931921,0.0019641153,0.00023894414,0.0028396235,0.0011492433,0.00061602186],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.019440046,0.00047509986,0.0007795461,0.0011564184,0.0007573377,0.0011037635,0.004484901,0.0006217477,0.000009920502],"category_scores_gemma":[0.004475185,0.00046336433,0.000346971,0.0012587432,0.00014133142,0.0006151367,0.003759962,0.0020577055,0.00009288491],"study_design_candidate":"design_other","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.0011897782,0.0002039297,0.00012335234,0.0014848311,0.00014390194,0.000016547663,0.003940743,0.020522155,0.018005459,0.058697555,0.0025393248,0.89313245],"study_design_scores_gemma":[0.0030193748,0.0031251935,0.0022684548,0.00087502814,0.000040670504,0.000016189133,0.0006006062,0.7509219,0.025029404,0.119374014,0.09316554,0.0015636407],"about_ca_topic_score_codex":0.0002836611,"about_ca_topic_score_gemma":0.000085007145,"teacher_disagreement_score":0.8915688,"about_ca_system_score_codex":0.00036876855,"about_ca_system_score_gemma":0.0005916871,"threshold_uncertainty_score":0.9999332},"labels":[],"label_agreement":null},{"id":"W4389894494","doi":"10.1007/978-3-031-49737-7_5","title":"An Enhanced Interface-Based Probabilistic Compositional Verification Approach","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Computer science; Soundness; Model checking; Probabilistic logic; Nondeterministic algorithm; Runtime verification; Probabilistic automaton; Formal verification; Theoretical computer science; Abstraction; Scalability; Automaton; Programming language; Artificial intelligence","score_opus":0.03582711177144161,"score_gpt":0.2956694696132953,"score_spread":0.2598423578418537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389894494","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.000119976714,0.000039941653,0.99442065,0.00018326883,0.0016322403,0.0007465068,0.000011638144,0.00056465267,0.0022811268],"genre_scores_gemma":[0.16643333,0.000004544141,0.83278674,0.00029899835,0.0002253262,0.00006104457,0.000054328033,0.00004372947,0.00009195134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953896,0.0001337842,0.0006714814,0.0020031203,0.0012162458,0.0005857652],"domain_scores_gemma":[0.9963604,0.00036650806,0.00040954252,0.0022391805,0.00042980484,0.00019455659],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017576393,0.00052679394,0.0004619536,0.0009258626,0.00030466323,0.0006335504,0.004238342,0.00036842265,0.000010880612],"category_scores_gemma":[0.0001623686,0.00052562775,0.00011087756,0.000995956,0.0008628374,0.00094493467,0.00046563477,0.0007962631,0.00010758363],"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.000022914533,0.00013819023,0.000004796273,0.00012557753,0.000009567231,0.0000075036364,0.00068346283,0.51995176,0.0056395438,0.17042987,0.0000074075965,0.30297938],"study_design_scores_gemma":[0.00019179207,0.00023199362,0.0001914379,0.0001889778,0.0000064388155,0.000013373333,1.8778239e-7,0.89848864,0.012790499,0.08728635,0.000070169976,0.0005401265],"about_ca_topic_score_codex":0.000008213175,"about_ca_topic_score_gemma":0.000007421061,"teacher_disagreement_score":0.37853685,"about_ca_system_score_codex":0.0005612466,"about_ca_system_score_gemma":0.00069071015,"threshold_uncertainty_score":0.9997195},"labels":[],"label_agreement":null},{"id":"W4390604697","doi":"10.1145/3632925","title":"Commutativity Simplifies Proofs of Parameterized Programs","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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":"","keywords":"Parameterized complexity; Mathematical proof; Computer science; Thread (computing); Theoretical computer science; Programming language; Commutative property; Soundness; Bounded function; Parametric statistics; Concurrency; Reduction (mathematics); Algorithm; Mathematics; Discrete mathematics","score_opus":0.0337666528042439,"score_gpt":0.3208212074906647,"score_spread":0.28705455468642077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390604697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98442024,0.0009937945,0.008555374,0.0019129404,0.00042251783,0.0014079995,0.000004965251,0.00081594626,0.0014662225],"genre_scores_gemma":[0.5968891,0.000005759655,0.40290755,0.000018671804,0.0000186095,0.000087187356,6.5560465e-7,0.00001169814,0.00006081835],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985867,0.000034204146,0.0003524969,0.00033242334,0.00043114377,0.0002629955],"domain_scores_gemma":[0.99857426,0.00018806323,0.00027221083,0.00074625976,0.00017937731,0.000039802428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011085179,0.00017129832,0.00024976008,0.00012165287,0.000079024256,0.00025896353,0.0030064771,0.00007368527,0.000001582105],"category_scores_gemma":[0.0018061623,0.00011203013,0.00015112358,0.0008668764,0.0002377783,0.00048208953,0.000978082,0.00023822385,0.0000034162017],"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.0000237727,0.00016815994,0.0013023398,0.0009323073,0.000055996996,9.696673e-7,0.004187643,0.0000018333201,0.022528524,0.12182684,0.000104586354,0.848867],"study_design_scores_gemma":[0.0003679588,0.0010745409,0.0033118248,0.0014842347,0.00007237725,0.000043729706,0.0015253876,0.0057444847,0.931251,0.04778631,0.006882812,0.00045533633],"about_ca_topic_score_codex":0.000019617897,"about_ca_topic_score_gemma":6.568604e-7,"teacher_disagreement_score":0.90872246,"about_ca_system_score_codex":0.00003066151,"about_ca_system_score_gemma":0.00003166182,"threshold_uncertainty_score":0.5586833},"labels":[],"label_agreement":null},{"id":"W4392024063","doi":"10.1109/tac.2024.3368867","title":"Stochastic Lyapunov-Barrier Functions for Robust Probabilistic Reach-Avoid-Stay Specifications","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Government of Ontario","keywords":"Lyapunov function; Probabilistic logic; Computer science; Control theory (sociology); Lyapunov optimization; Lyapunov redesign; Stochastic process; Robust control; Lyapunov equation; Mathematical optimization; Mathematics; Lyapunov exponent; Engineering; Control system; Control (management); Nonlinear system; Artificial intelligence; Statistics","score_opus":0.04816046516080474,"score_gpt":0.2793994966779182,"score_spread":0.23123903151711345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392024063","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.00030112203,0.00009932888,0.9903662,0.0012753921,0.0033532092,0.002109305,0.00021916776,0.0018794369,0.00039683576],"genre_scores_gemma":[0.64108473,0.000003755823,0.3538954,0.00016115181,0.00013481529,0.0025488094,0.000008168379,0.00005454269,0.0021086358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743414,0.00019871107,0.00070125586,0.00077402295,0.00041862772,0.00047323562],"domain_scores_gemma":[0.9968384,0.0014144945,0.00012084508,0.0012245274,0.0002106064,0.00019115064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090894144,0.00032898644,0.00033984508,0.0005060705,0.00057795586,0.00045213135,0.0006873585,0.00014825845,0.0001896177],"category_scores_gemma":[0.00016030173,0.00031013228,0.00031377134,0.0009417727,0.00013524332,0.0007054244,0.0000027950466,0.0003134759,0.00043628184],"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.00007441189,0.00079158816,6.8466676e-7,0.0005443672,0.0004837775,0.000007389087,0.0017892766,0.39123845,0.0045314897,0.1258659,0.002126926,0.47254574],"study_design_scores_gemma":[0.00067157956,0.00020937968,0.000047701793,0.00012250528,0.00018857582,0.00003731516,0.00005918054,0.99161065,0.00053628685,0.0041337768,0.0020594953,0.0003235457],"about_ca_topic_score_codex":0.000010222935,"about_ca_topic_score_gemma":0.000017093658,"teacher_disagreement_score":0.6407836,"about_ca_system_score_codex":0.00035293598,"about_ca_system_score_gemma":0.00030477694,"threshold_uncertainty_score":0.9999351},"labels":[],"label_agreement":null},{"id":"W4393161108","doi":"10.1609/aaai.v38i18.30049","title":"Delegation-Relegation for Boolean Matrix Factorization","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut Universitaire de Gériatrie de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Delegation; Factorization; Matrix (chemical analysis); Mathematics; Computer science; Logical matrix; Algebra over a field; Theoretical computer science; Pure mathematics; Political science; Algorithm; Physics; Materials science","score_opus":0.09672853750853222,"score_gpt":0.3595913327743344,"score_spread":0.2628627952658022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161108","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.012405715,0.000031848478,0.98112094,0.0023137543,0.0012612548,0.00062082964,0.0000077236,0.00021312831,0.00202482],"genre_scores_gemma":[0.8747018,0.000018224877,0.1247303,0.00004655986,0.00011512966,0.00007245535,0.000002021047,0.0000134133925,0.00030007339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99844927,0.000016497268,0.0004990363,0.00042881625,0.0003839168,0.00022244683],"domain_scores_gemma":[0.9986721,0.00013454347,0.00023353778,0.00023831915,0.00067323557,0.0000482131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007033225,0.00016249434,0.00014518548,0.00017092375,0.00018025366,0.0005172578,0.0011763572,0.00009402309,0.00001953876],"category_scores_gemma":[0.0006235984,0.00012696527,0.00010884831,0.0008091742,0.00010167076,0.0010547835,0.00011392473,0.00017561438,0.000062813386],"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.000014515047,0.00002414612,0.000015002975,0.000078755715,0.000007277102,3.5154045e-8,0.0007652423,0.00008186594,0.03900395,0.863283,0.00013587259,0.09659033],"study_design_scores_gemma":[0.00000748087,0.00007604939,0.00004914891,0.000106419626,0.0000069424545,0.0000010790932,0.00008426669,0.3274016,0.39826193,0.27355373,0.0003610414,0.00009030889],"about_ca_topic_score_codex":0.000015044907,"about_ca_topic_score_gemma":0.0000023977911,"teacher_disagreement_score":0.8622961,"about_ca_system_score_codex":0.00008592721,"about_ca_system_score_gemma":0.000115504794,"threshold_uncertainty_score":0.51774937},"labels":[],"label_agreement":null},{"id":"W4393870941","doi":"10.1007/978-3-031-57246-3_1","title":"DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"University of British Columbia; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Amazon Web Services","keywords":"Mathematical proof; Modulo; Monotonic function; Computer science; Discrete mathematics; Calculus (dental); Arithmetic; Algorithm; Theoretical computer science; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.01924433394267295,"score_gpt":0.2850667452238818,"score_spread":0.26582241128120887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393870941","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.00014642163,0.00072307093,0.99220204,0.00037200138,0.0028797113,0.0011904362,0.000024719637,0.00018384907,0.002277738],"genre_scores_gemma":[0.09563411,0.000022580489,0.90348697,0.00016642104,0.00021642247,0.00006137268,0.000004622853,0.00003446205,0.00037304702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962286,0.00005149958,0.00076158857,0.0016164976,0.0008025489,0.00053928746],"domain_scores_gemma":[0.99627674,0.00079675706,0.00036547973,0.0020376488,0.00041929467,0.00010407826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024795916,0.00048420765,0.0006174464,0.00061894825,0.00016189736,0.00036427483,0.0033201436,0.00034519166,0.00000663113],"category_scores_gemma":[0.0003548026,0.0004158105,0.00021380863,0.0006958829,0.0012566313,0.0007121745,0.001122458,0.00059014425,0.000017530152],"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.000009355933,0.0000152024195,0.000017680399,0.0002524112,0.000010400399,0.0000026121904,0.00078801555,0.007454159,0.00020484168,0.6467932,0.0000044840067,0.34444764],"study_design_scores_gemma":[0.00007834405,0.00016463408,0.000044178054,0.00020883564,0.000008366314,0.000009122558,1.4388121e-7,0.40426806,0.007613265,0.5868151,0.00051815127,0.00027178522],"about_ca_topic_score_codex":0.000011217873,"about_ca_topic_score_gemma":0.00002919171,"teacher_disagreement_score":0.3968139,"about_ca_system_score_codex":0.00035082348,"about_ca_system_score_gemma":0.0006344633,"threshold_uncertainty_score":0.99982935},"labels":[],"label_agreement":null},{"id":"W4394009907","doi":"10.1007/s10107-024-02080-5","title":"Compressing branch-and-bound trees","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Branch and bound; Upper and lower bounds; Mathematics; Branching (polymer chemistry); Tree (set theory); Combinatorics; Branch and cut; Heuristic; Search tree; Compression (physics); Integer programming; Algorithm; Discrete mathematics; Mathematical optimization; Search algorithm","score_opus":0.041553838997276306,"score_gpt":0.3275159605329665,"score_spread":0.2859621215356902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394009907","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.0053590643,0.00075344765,0.98960793,0.00034898857,0.0001797748,0.00015725865,1.9183312e-7,0.0006184836,0.0029748362],"genre_scores_gemma":[0.30623007,0.0000026694725,0.6935372,0.000028069242,0.00004089019,0.000023820112,3.4176645e-7,0.000008900118,0.00012805282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901795,0.00005315345,0.00021950371,0.0002764408,0.00020488574,0.0002280626],"domain_scores_gemma":[0.999292,0.00029732782,0.000026418413,0.00029182163,0.000018093715,0.00007429373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060463883,0.000105068764,0.00013305769,0.000069311915,0.00011240535,0.0010151035,0.00031061505,0.000047810336,0.000012387969],"category_scores_gemma":[0.00017444826,0.00008466493,0.000044259355,0.00026142225,0.00010327895,0.0005303994,0.00016709957,0.00014387375,0.00009510409],"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":[3.7144298e-7,0.000015361138,0.000004585368,0.00014816293,0.0000056148288,0.0000042216843,0.00061566674,0.0000013439766,0.00046951202,0.5023885,0.000010254277,0.49633643],"study_design_scores_gemma":[0.00006312121,0.00003904132,0.00008797028,0.00028926178,0.000011934852,0.000069089205,0.000035283054,0.7290617,0.0013590396,0.25393108,0.014879516,0.00017292729],"about_ca_topic_score_codex":0.0000015193422,"about_ca_topic_score_gemma":3.0070217e-7,"teacher_disagreement_score":0.7290604,"about_ca_system_score_codex":0.00002165005,"about_ca_system_score_gemma":0.000015168519,"threshold_uncertainty_score":0.9788667},"labels":[],"label_agreement":null},{"id":"W4394987214","doi":"10.4204/eptcs.402.10","title":"CHC-COMP 2023: Competition Report","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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 Waterloo","funders":"","keywords":"Competition (biology); French horn; Class (philosophy); Computer science; Operations research; Engineering; Sociology; Artificial intelligence","score_opus":0.0072524103978991025,"score_gpt":0.276505250815857,"score_spread":0.2692528404179579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394987214","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.019764014,0.0002526059,0.96053517,0.0013008164,0.0012765938,0.00028389326,4.365615e-7,0.0006222476,0.015964247],"genre_scores_gemma":[0.74966,0.000021845632,0.24988516,0.00017522577,0.00018143922,0.000033464643,0.0000010027467,0.000011835652,0.000029984598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959771,0.000040868857,0.0005371296,0.0013492319,0.0009511526,0.0011445128],"domain_scores_gemma":[0.99888146,0.00012013572,0.000088731496,0.0005022562,0.00022992211,0.00017749396],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005416739,0.0002499045,0.0002399771,0.0006299296,0.0002573658,0.0012094621,0.002716271,0.0000974635,0.000033361648],"category_scores_gemma":[0.00026842768,0.00022643343,0.00007788172,0.004124702,0.0013886772,0.0023040492,0.00076050416,0.0007362615,0.0001198254],"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.0000044257954,0.00003719134,0.00003563533,0.00003193117,0.0000033956535,0.000042631324,0.00033442167,0.000021460057,0.001298947,0.9750249,0.00006812618,0.023096971],"study_design_scores_gemma":[0.00007793094,0.00016565631,0.0003061036,0.000100394,0.000002558632,0.0006728234,0.000006225117,0.6161463,0.0060540764,0.37454882,0.0016974299,0.00022164646],"about_ca_topic_score_codex":0.0000044007243,"about_ca_topic_score_gemma":8.763806e-7,"teacher_disagreement_score":0.729896,"about_ca_system_score_codex":0.0006793249,"about_ca_system_score_gemma":0.00052898604,"threshold_uncertainty_score":0.9998274},"labels":[],"label_agreement":null},{"id":"W4396904796","doi":"10.1007/s10009-024-00748-z","title":"An Event-B model of an automotive adaptive exterior light system","year":2024,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Computer science; Visibility; Theory of computation; Context (archaeology); Event (particle physics); Controller (irrigation); Key (lock); Real-time computing; Algorithm; Computer security","score_opus":0.03258320893785447,"score_gpt":0.32559853777195463,"score_spread":0.29301532883410014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396904796","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.063795336,0.00009600109,0.93255115,0.0007670447,0.00156262,0.00026616285,0.00011211154,0.00080343575,0.00004613292],"genre_scores_gemma":[0.60804904,0.000010319869,0.39167845,0.00007471516,0.00008259871,0.000057053076,0.000005175406,0.000019998042,0.000022652262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981723,0.00008367987,0.0005649193,0.00043645734,0.0004993697,0.00024328846],"domain_scores_gemma":[0.99850136,0.000105886706,0.00008724433,0.0004186916,0.00079639966,0.000090413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066214753,0.00020310914,0.00024633287,0.0008036205,0.00010080337,0.00030549528,0.0020344744,0.00025818558,0.000006965113],"category_scores_gemma":[0.00013743767,0.00017706437,0.00018201856,0.00033381704,0.000088538436,0.0023887241,0.00004174025,0.00044642942,0.000012138619],"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.00016439152,0.0001857688,0.000008346087,0.000031732252,0.00017907444,0.00005985647,0.00059963565,0.008296204,0.011814267,0.6839969,0.000025122617,0.2946387],"study_design_scores_gemma":[0.00052405533,0.0016353595,0.00006257248,0.0004232049,0.000031559408,0.00053693785,0.00017921226,0.8576805,0.11513704,0.022935225,0.0006045949,0.00024975173],"about_ca_topic_score_codex":9.756025e-7,"about_ca_topic_score_gemma":0.0000011951643,"teacher_disagreement_score":0.8493843,"about_ca_system_score_codex":0.00029123228,"about_ca_system_score_gemma":0.00018768848,"threshold_uncertainty_score":0.72204757},"labels":[],"label_agreement":null},{"id":"W4396932180","doi":"10.1007/s10009-024-00749-y","title":"Modeling of a speed control system using Event-B","year":2024,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","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":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Computer science; Theory of computation; Event (particle physics); Control (management); Algorithm; Artificial intelligence","score_opus":0.044912694429051256,"score_gpt":0.33188686174655296,"score_spread":0.2869741673175017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396932180","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.05673664,0.0002527202,0.93925834,0.0006381521,0.0023860252,0.000221741,0.000041383948,0.00043799318,0.00002701749],"genre_scores_gemma":[0.70065445,0.000011465058,0.29914576,0.00005602146,0.00009891232,0.000010667427,0.0000014513208,0.000014459943,0.0000067828796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984811,0.000044718,0.00057676114,0.00026631285,0.00042430454,0.0002068068],"domain_scores_gemma":[0.9989984,0.00015316033,0.0000540057,0.00023609109,0.000515888,0.00004244753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067102525,0.00014514226,0.00022198811,0.0007528303,0.00007734986,0.0002396582,0.0012292425,0.00018440382,0.000005103269],"category_scores_gemma":[0.00025183457,0.00012811078,0.00021697233,0.00030259142,0.000051776697,0.0008326285,0.000030375762,0.00036148494,0.0000081565295],"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.00013925855,0.000068410285,0.00006318835,0.0000848621,0.0003776311,0.00007565081,0.00013637905,0.09482665,0.0076205926,0.7853711,0.000014883426,0.111221366],"study_design_scores_gemma":[0.0006541005,0.00016102663,0.000007404958,0.0004969245,0.00003082937,0.00072222797,0.00004328264,0.98076195,0.009312202,0.0071580634,0.00052328303,0.00012871854],"about_ca_topic_score_codex":0.0000020125544,"about_ca_topic_score_gemma":3.1347992e-7,"teacher_disagreement_score":0.8859353,"about_ca_system_score_codex":0.00026219361,"about_ca_system_score_gemma":0.00013217409,"threshold_uncertainty_score":0.5224206},"labels":[],"label_agreement":null},{"id":"W4399094989","doi":"10.1007/s11227-024-06190-x","title":"Simplified algorithms for order-based core maintenance","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Trent University","funders":"","keywords":"Core (optical fiber); Computer science; Algorithm; Order (exchange); Business; Telecommunications","score_opus":0.08875001468785083,"score_gpt":0.34971537947116355,"score_spread":0.2609653647833127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399094989","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.02025641,0.00047913674,0.97591734,0.0015158264,0.0015144795,0.00013911158,0.000001675847,0.00007307352,0.000102975246],"genre_scores_gemma":[0.31782258,0.0000099767585,0.68153363,0.00028281996,0.00031368196,0.0000012823347,4.0835002e-7,0.000011298164,0.00002433815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878937,0.000107037886,0.0004517236,0.00013367053,0.00026668198,0.00025154412],"domain_scores_gemma":[0.99828464,0.0008931852,0.00013578245,0.00029672397,0.00033473878,0.000054916272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036115493,0.00011049094,0.00016529385,0.000118361146,0.00017520599,0.00016410805,0.0011092924,0.00004245498,0.0000030773615],"category_scores_gemma":[0.0003530263,0.00006868698,0.00011187618,0.00049329654,0.00005515532,0.00042363757,0.00008711381,0.00028790443,0.000006984415],"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.00007870696,0.0000782654,0.00007543069,0.00026532178,0.0001054566,0.000041050058,0.0046947002,0.036443923,0.014069526,0.14259796,0.0053654546,0.7961842],"study_design_scores_gemma":[0.00022351508,0.00016719502,0.00014351086,0.00019723197,0.00001805651,0.0002339699,0.00012715968,0.98440534,0.0032049539,0.006020452,0.005162871,0.000095732],"about_ca_topic_score_codex":0.0000051570846,"about_ca_topic_score_gemma":3.994883e-7,"teacher_disagreement_score":0.94796145,"about_ca_system_score_codex":0.000071472336,"about_ca_system_score_gemma":0.00017197561,"threshold_uncertainty_score":0.28009737},"labels":[],"label_agreement":null},{"id":"W4399487396","doi":"10.1145/3649476.3658808","title":"Accelerating Boolean Constraint Propagation for Efficient SAT-Solving on FPGAs","year":2024,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Field-programmable gate array; Constraint (computer-aided design); Parallel computing; Boolean satisfiability problem; Boolean function; Theoretical computer science; Algorithm; Mathematics; Embedded system","score_opus":0.06124641551256968,"score_gpt":0.3272905061577154,"score_spread":0.26604409064514567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399487396","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.011764767,0.00003283284,0.97491884,0.0005711733,0.0008585716,0.00047968808,0.0000016323589,0.0005041472,0.010868328],"genre_scores_gemma":[0.47676888,5.269137e-7,0.52280164,0.00013544454,0.000067983114,0.000045715216,0.0000021757046,0.0000065451113,0.00017108418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989467,0.000049009457,0.00023163033,0.00036726144,0.00020008374,0.00020528799],"domain_scores_gemma":[0.9993429,0.0002064004,0.00004437295,0.00029407334,0.00006781372,0.000044401644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009388371,0.000101467565,0.00008004928,0.00010829891,0.00014818543,0.00047267557,0.0003109106,0.00004252036,0.00001427066],"category_scores_gemma":[0.00022514413,0.00008335701,0.00005295495,0.00024106268,0.000030819054,0.0002716076,0.000064233835,0.00010663768,0.00007291825],"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.0000021587005,0.000015094202,0.0000022254007,0.00004355153,0.0000041591124,0.0000010258493,0.00039312977,0.0023880494,0.004977125,0.7537521,0.00016705062,0.23825434],"study_design_scores_gemma":[0.00007261184,0.00010951374,0.00008203775,0.00007756666,0.0000027197345,0.000007772159,0.000050612707,0.94326425,0.053126395,0.0017696024,0.0013282216,0.00010870638],"about_ca_topic_score_codex":0.0000028784646,"about_ca_topic_score_gemma":8.517694e-7,"teacher_disagreement_score":0.9408762,"about_ca_system_score_codex":0.00009677736,"about_ca_system_score_gemma":0.0000724112,"threshold_uncertainty_score":0.45580214},"labels":[],"label_agreement":null},{"id":"W4399567210","doi":"10.1007/978-3-031-61433-0_8","title":"Relational Structures for Interval Order Semantics of Concurrent Systems","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","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":"McMaster University","funders":"","keywords":"Computer science; Semantics (computer science); Programming language; Interval (graph theory); Operational semantics; Theoretical computer science; Order (exchange); Algorithm; Mathematics; Combinatorics","score_opus":0.0521159731185842,"score_gpt":0.31178800946567387,"score_spread":0.2596720363470897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399567210","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.000023829072,0.0009205945,0.98940516,0.00021187132,0.007863452,0.0006104365,0.000031155214,0.00009117771,0.0008423454],"genre_scores_gemma":[0.031168655,0.000020116846,0.967862,0.00010661764,0.0003863351,0.0000183162,0.000011575193,0.0000311257,0.00039522228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997092,0.000030402978,0.0007106413,0.0009923924,0.0008255164,0.00034902315],"domain_scores_gemma":[0.9976688,0.0004928271,0.00040130984,0.0008661405,0.00049195735,0.000078951525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010407767,0.00036393263,0.0004752532,0.00055900234,0.00009855019,0.00027309987,0.001991093,0.00028877993,0.00001036359],"category_scores_gemma":[0.00021538734,0.00031782332,0.00013304301,0.0005160442,0.000561143,0.00039075356,0.00090846507,0.00052244193,0.000014351201],"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.0000036305626,0.000008465508,0.000010325213,0.00025669404,0.000016729344,0.000003601801,0.00036986763,0.055070322,0.00006457932,0.84316254,0.000037986792,0.100995235],"study_design_scores_gemma":[0.00010480671,0.00012496897,0.000025992367,0.0003938104,0.000012599738,0.000032992724,1.2535689e-7,0.76205474,0.0007254142,0.23242994,0.0038258682,0.0002687314],"about_ca_topic_score_codex":0.000008976402,"about_ca_topic_score_gemma":0.0000071486465,"teacher_disagreement_score":0.70698446,"about_ca_system_score_codex":0.00022861117,"about_ca_system_score_gemma":0.00036051715,"threshold_uncertainty_score":0.9999274},"labels":[],"label_agreement":null},{"id":"W4399876957","doi":"10.1007/978-3-031-63790-2_26","title":"Modelling a Mechanical Lung Ventilation System Using TASTD","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science","score_opus":0.04497275327196975,"score_gpt":0.2930414644173879,"score_spread":0.24806871114541812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399876957","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.00005892753,0.00059565966,0.99239224,0.00005872874,0.0047136494,0.00042292493,0.0000038475314,0.00038998094,0.0013640649],"genre_scores_gemma":[0.09175196,0.000009607931,0.90753883,0.00008003303,0.00045650327,0.0000073123265,0.000002888113,0.00004186737,0.00011099829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597657,0.00004986332,0.00068954704,0.0016038122,0.0011173616,0.0005628718],"domain_scores_gemma":[0.9978114,0.00017242316,0.00031235587,0.0013440566,0.00022114157,0.00013865581],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018464664,0.00046437897,0.00045771443,0.000955061,0.00025561254,0.00081668014,0.0024410244,0.00039135217,0.000004684489],"category_scores_gemma":[0.000035763325,0.0004505024,0.00016047191,0.00084076985,0.00022807776,0.000888737,0.0012026477,0.00089671236,0.00005115143],"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.000003138936,0.0000054903335,6.417611e-7,0.00015109785,0.0000076292117,0.000036246372,0.00022631399,0.60880315,0.00018674285,0.3459735,0.0000011454135,0.044604883],"study_design_scores_gemma":[0.00006400748,0.00003889737,6.746408e-7,0.0011607769,0.000019089537,0.00013017612,1.8762655e-7,0.91461337,0.0015192343,0.08187962,0.00016643375,0.0004075245],"about_ca_topic_score_codex":0.000020513693,"about_ca_topic_score_gemma":0.0000028339343,"teacher_disagreement_score":0.30581018,"about_ca_system_score_codex":0.0010790552,"about_ca_system_score_gemma":0.00038503078,"threshold_uncertainty_score":0.99979466},"labels":[],"label_agreement":null},{"id":"W4400973174","doi":"10.1007/978-3-031-65627-9_8","title":"Formally Certified Approximate Model Counting","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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":"Simons Institute for the Theory of Computing, University of California Berkeley; National Supercomputing Centre Singapore; Ministry of Education, India; Vetenskapsrådet; National Research Foundation Singapore; National Research Foundation","keywords":"Computer science; Algorithm; Correctness; True quantified Boolean formula; HOL; Proof assistant; Automated theorem proving; Maximum satisfiability problem; Discrete mathematics; Boolean function; Programming language; Mathematics; Mathematical proof","score_opus":0.039997819473361014,"score_gpt":0.2814009612170026,"score_spread":0.24140314174364158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400973174","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.000023116581,0.00034706923,0.972185,0.00037291282,0.0033884237,0.00045003378,0.000005803786,0.0004857572,0.022741873],"genre_scores_gemma":[0.0148136355,0.000030944637,0.982042,0.00083505694,0.00030794702,0.000020720398,0.000004634598,0.00005626892,0.0018887684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953117,0.000023192699,0.0007477335,0.0018361127,0.0012410168,0.0008402743],"domain_scores_gemma":[0.9970884,0.00019103102,0.00032451638,0.001958532,0.00027901703,0.0001585319],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021610444,0.0005952771,0.0005022024,0.0009640642,0.00027797007,0.0012291095,0.004491909,0.00040100733,0.000008008038],"category_scores_gemma":[0.000116650175,0.0005457764,0.00016091437,0.0007777266,0.0005502226,0.0014473664,0.0020925195,0.0011636259,0.00012921696],"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.0000044023977,0.000012526384,0.0000027087415,0.00014360253,0.00000949397,0.00003135267,0.00082237605,0.15506242,0.00025677084,0.5053767,0.000017478953,0.33826014],"study_design_scores_gemma":[0.00006125203,0.00003672094,0.0000031460588,0.00023333871,0.0000062378895,0.000040110383,6.7521675e-8,0.6544287,0.001397327,0.34280768,0.0005815605,0.00040382074],"about_ca_topic_score_codex":0.000007681354,"about_ca_topic_score_gemma":0.000011642878,"teacher_disagreement_score":0.4993663,"about_ca_system_score_codex":0.00043528853,"about_ca_system_score_gemma":0.00058786274,"threshold_uncertainty_score":0.9998077},"labels":[],"label_agreement":null},{"id":"W4401633153","doi":"10.22215/etd/2024-16034","title":"Hardware-Accelerated SAT Solvers","year":2024,"lang":"en","type":"dissertation","venue":"","topic":"Formal Methods in Verification","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":"Carleton University","funders":"","keywords":"Computer science; Bottleneck; Parallel computing; Field-programmable gate array; DPLL algorithm; Boolean satisfiability problem; Solver; Hardware acceleration; Algorithm; Computer hardware; Embedded system; Programming language","score_opus":0.043278618355239294,"score_gpt":0.3346166273715036,"score_spread":0.29133800901626433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401633153","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.004803437,0.0007232485,0.56994,0.00018276222,0.016395295,0.0005144912,0.0000069994317,0.002133089,0.40530068],"genre_scores_gemma":[0.0056760437,0.00008596339,0.8251308,0.00022413813,0.00016897671,0.00008408589,0.00064643106,0.00005611431,0.16792744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984703,0.000052163927,0.0003050824,0.000580644,0.00035007548,0.0002417197],"domain_scores_gemma":[0.9989508,0.000026784848,0.000109471956,0.0006940526,0.00014790462,0.000071035734],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002953742,0.0002418939,0.00020558084,0.00024026916,0.000078971694,0.00048444967,0.0010856524,0.00027475884,0.00018004955],"category_scores_gemma":[0.000057451187,0.00021871753,0.00010972003,0.0006091067,0.000012820158,0.0004972036,0.00007527029,0.00036074582,0.0021556742],"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.000027430104,0.00005419569,0.00000897422,0.0006213152,0.0001381273,0.000040336123,0.005433933,0.000040331975,0.005686662,0.6775702,0.064048745,0.24632975],"study_design_scores_gemma":[0.00054460234,0.00031078907,0.0029383155,0.0008296042,0.00017877045,0.000039477545,0.0018588994,0.26475078,0.2033451,0.03108495,0.4910345,0.0030842046],"about_ca_topic_score_codex":0.000042933345,"about_ca_topic_score_gemma":0.000042040814,"teacher_disagreement_score":0.64648527,"about_ca_system_score_codex":0.00009676243,"about_ca_system_score_gemma":0.00018760179,"threshold_uncertainty_score":0.9986213},"labels":[],"label_agreement":null},{"id":"W4401718857","doi":"10.1109/rew61692.2024.00014","title":"Requirements-Driven Slicing of Simulink Models using LLMs","year":2024,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Ottawa","funders":"","keywords":"Slicing; Computer science; Computer graphics (images)","score_opus":0.1653595772884823,"score_gpt":0.3821323352972364,"score_spread":0.2167727580087541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401718857","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.013438849,0.00008537058,0.9789449,0.00006288196,0.00044873357,0.00008114725,4.7654373e-7,0.00018034932,0.006757307],"genre_scores_gemma":[0.43225008,0.0000040145337,0.5675986,0.000037298523,0.000019548355,0.0000010823402,2.0410373e-7,0.0000040829727,0.00008513261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999159,0.000044463202,0.00022884643,0.0002203045,0.0002130349,0.00013437643],"domain_scores_gemma":[0.9994449,0.00004713647,0.000041827094,0.00037996747,0.000055637916,0.00003053341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041914813,0.000066564106,0.000088998975,0.00010507425,0.000035041197,0.00007656053,0.00043187552,0.000035223817,0.000011665353],"category_scores_gemma":[0.000024542034,0.000058239435,0.000040561175,0.00038221286,0.000024016907,0.0010830407,0.00016654143,0.000065123946,0.000010971342],"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.0000017520715,0.000014415788,0.000016107264,0.00006939149,0.000016088059,0.00000334767,0.0009974325,0.123304754,0.033851143,0.8055023,0.00004605034,0.036177196],"study_design_scores_gemma":[0.000032934575,0.000019863726,0.000009547445,0.000059014368,0.000004168379,0.0000036176032,0.0000156326,0.9656164,0.021592775,0.012431143,0.00014997463,0.00006489463],"about_ca_topic_score_codex":0.00004143999,"about_ca_topic_score_gemma":6.7513764e-7,"teacher_disagreement_score":0.8423117,"about_ca_system_score_codex":0.000052147883,"about_ca_system_score_gemma":0.000047376503,"threshold_uncertainty_score":0.23749353},"labels":[],"label_agreement":null},{"id":"W4402364429","doi":"10.1007/978-3-031-71167-1_2","title":"Assessing Logical Reasoning Capabilities of Encoder-Only Transformer Models","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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 Alberta","funders":"","keywords":"Computer science; Encoder; Transformer; Programming language; Electrical engineering; Operating system; Engineering","score_opus":0.05022977370404413,"score_gpt":0.31128250951734276,"score_spread":0.26105273581329863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402364429","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.00024695072,0.0009710284,0.9743296,0.00023262078,0.0016657048,0.0003201369,0.000005129886,0.00019851547,0.02203032],"genre_scores_gemma":[0.1416396,0.00005328976,0.85765874,0.00018161058,0.00017911177,0.000008083522,0.0000022735687,0.000030344818,0.00024694644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995805,0.00006305251,0.0008315956,0.0014895513,0.001198955,0.00061179907],"domain_scores_gemma":[0.99750006,0.00051480054,0.00028494137,0.0012752546,0.00029216087,0.0001327832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002035826,0.00050945394,0.00064703,0.00065909553,0.00017567354,0.00077538,0.0028697345,0.0004206386,0.000015785525],"category_scores_gemma":[0.00013485637,0.0004367758,0.00020986842,0.0007188137,0.0012204978,0.0022915336,0.0005201254,0.0010279872,0.0000145694285],"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.0000029695414,0.000016996191,0.0000072152757,0.00015364542,0.0000091490065,0.00001838612,0.002125609,0.048729114,0.00026625305,0.5491207,0.0000018064176,0.39954814],"study_design_scores_gemma":[0.000054881988,0.00008055213,0.000018124989,0.00057924207,0.00000831218,0.00007143777,0.0000012384521,0.5722309,0.002248377,0.42427152,0.00012416944,0.0003112423],"about_ca_topic_score_codex":0.000025551903,"about_ca_topic_score_gemma":0.000014982232,"teacher_disagreement_score":0.52350175,"about_ca_system_score_codex":0.000355558,"about_ca_system_score_gemma":0.0008782706,"threshold_uncertainty_score":0.99980843},"labels":[],"label_agreement":null},{"id":"W4402830973","doi":"10.21203/rs.3.rs-4974405/v1","title":"Bounded Satisfiability Checking of FOL * Formulas with Aggregations","year":2024,"lang":"en","type":"preprint","venue":"Research Square","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; National Aeronautics and Space Administration","keywords":"Bounded function; Satisfiability; Model checking; Mathematics; Discrete mathematics; Computer science; Calculus (dental); Algorithm; Mathematical analysis; Medicine","score_opus":0.11005783087287657,"score_gpt":0.4445573786069087,"score_spread":0.3344995477340321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402830973","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.22689311,0.0010312289,0.7526116,0.001339146,0.0007235062,0.0030549977,0.000071528135,0.0003956445,0.013879241],"genre_scores_gemma":[0.61334586,0.0000351607,0.38612002,0.000004470993,0.00006181095,0.00026302336,0.000011907262,0.000020289168,0.00013744467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957193,0.00070588617,0.00047756816,0.00086921256,0.0017057657,0.0005222562],"domain_scores_gemma":[0.99570346,0.0004836389,0.0001932925,0.0023274466,0.0011572033,0.00013494884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004896669,0.00021767442,0.00033171568,0.0005856452,0.00021263295,0.0004729625,0.0017631616,0.00026112457,0.00002282946],"category_scores_gemma":[0.0011323926,0.00018248831,0.00013978785,0.001378279,0.0003484747,0.0002175557,0.003636102,0.0017844755,0.000048180264],"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.000041589054,0.00019069236,0.0016132928,0.00697753,0.00013281427,0.000021482567,0.006063654,0.0009469483,0.0008120201,0.8900984,0.0003082054,0.09279339],"study_design_scores_gemma":[0.00030928667,0.0005102126,0.014214011,0.0038310844,0.000025910545,0.000016351976,0.00032948906,0.2428684,0.027558418,0.7081932,0.0016168875,0.00052676135],"about_ca_topic_score_codex":0.00031485836,"about_ca_topic_score_gemma":0.00008349606,"teacher_disagreement_score":0.38645276,"about_ca_system_score_codex":0.0004639656,"about_ca_system_score_gemma":0.0012756503,"threshold_uncertainty_score":0.77527577},"labels":[],"label_agreement":null},{"id":"W4403306309","doi":"10.1017/9781009302180.010","title":"The Loop Invariant for Lower Bounds","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Formal Methods in Verification","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":"York University","funders":"","keywords":"Invariant (physics); Loop (graph theory); Mathematics; Control theory (sociology); Computer science; Combinatorics; Mathematical physics; Artificial intelligence; Control (management)","score_opus":0.03501374652453076,"score_gpt":0.23769230878849323,"score_spread":0.20267856226396247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403306309","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017773885,0.00023884255,0.24100254,0.00006953688,0.0016796048,0.0004889402,0.000069057874,0.00020684645,0.7562429],"genre_scores_gemma":[0.00002909737,0.00008450276,0.019901207,0.00007690498,0.00016835272,0.0000042957163,0.000009645315,0.000036803798,0.9796892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985425,0.000036030204,0.00020994822,0.0006147596,0.00028105394,0.0003157062],"domain_scores_gemma":[0.99800116,0.00022268873,0.00019014123,0.0012657181,0.00020896202,0.00011134795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004631589,0.00029878312,0.00023527304,0.00012367345,0.0004807732,0.00040351506,0.0020894015,0.00029186814,6.710578e-7],"category_scores_gemma":[0.000031041905,0.00026645698,0.0002575838,0.000016593282,0.00026798487,0.00020600209,0.0009036343,0.0004327182,0.000038096998],"study_design_candidate":"not_applicable","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.00003474782,0.0000031865036,1.7558948e-8,0.000057402187,0.0000812634,0.000049260805,0.000039746123,0.0000015416398,0.000016851282,0.9633513,0.031202793,0.0051618824],"study_design_scores_gemma":[0.00017152392,0.000077812554,8.112789e-7,0.00009420835,0.00008886185,0.00001595753,0.000007959355,0.007451096,0.00025887488,0.0013151057,0.99020106,0.0003167559],"about_ca_topic_score_codex":0.00001632037,"about_ca_topic_score_gemma":0.0000012520139,"teacher_disagreement_score":0.9620362,"about_ca_system_score_codex":0.00023804136,"about_ca_system_score_gemma":0.00018115836,"threshold_uncertainty_score":0.9999788},"labels":[],"label_agreement":null},{"id":"W4403492851","doi":"10.1145/3689492.3690053","title":"Abstract Debuggers: Exploring Program Behaviors using Static Analysis Results","year":2024,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"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 Waterloo","funders":"","keywords":"Computer science; Static analysis; Programming language; Human–computer interaction","score_opus":0.19198254619877114,"score_gpt":0.408192117782729,"score_spread":0.21620957158395787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403492851","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.22425984,0.000052462383,0.7729868,0.00007055037,0.00035079257,0.00016900004,0.0000023593439,0.0010014251,0.0011067516],"genre_scores_gemma":[0.4275211,0.000006202905,0.57236564,0.000009951785,0.000018306917,0.000034583347,0.0000024456601,0.0000055619066,0.000036204005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986248,0.00004818943,0.00034943022,0.00044037655,0.00029218313,0.0002450229],"domain_scores_gemma":[0.9991473,0.00009269257,0.000055836343,0.00057681394,0.000050868162,0.00007648702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079597166,0.000112614536,0.00012879267,0.00041134297,0.00007541821,0.0005677969,0.00044832728,0.000036368387,0.00001846105],"category_scores_gemma":[0.00007203552,0.00009765869,0.00011513548,0.0022196688,0.00002754746,0.0015835378,0.00009215695,0.0001277908,0.000045205445],"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.000007545945,0.00012255709,0.00022413554,0.00007371163,0.00020776498,0.000058064765,0.0026048284,0.0063056382,0.0020847714,0.018529125,0.00007704432,0.9697048],"study_design_scores_gemma":[0.00005747203,0.000043755463,0.0061547593,0.0000573714,0.00011365916,0.000004289107,0.00011406174,0.9867735,0.005556798,0.00030845616,0.0006386149,0.00017724597],"about_ca_topic_score_codex":0.00013701526,"about_ca_topic_score_gemma":0.000009061368,"teacher_disagreement_score":0.98046786,"about_ca_system_score_codex":0.00009326582,"about_ca_system_score_gemma":0.000050789025,"threshold_uncertainty_score":0.54752785},"labels":[],"label_agreement":null},{"id":"W4403943776","doi":"10.1007/978-3-031-67695-6_1","title":"The ARCH-COMP Friendly Verification Competition for Continuous and Hybrid Systems","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","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":"McMaster University","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Arch; Engineering; Structural engineering","score_opus":0.017324553294924317,"score_gpt":0.2649090069582571,"score_spread":0.24758445366333276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403943776","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.00007220416,0.002281174,0.98884743,0.0006704764,0.0049538547,0.0010744705,0.000019926138,0.00020322805,0.001877228],"genre_scores_gemma":[0.13581422,0.0002979,0.86146116,0.00028830415,0.00087702426,0.00017721341,0.00002501547,0.00006472318,0.00099443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968747,0.00005940634,0.00058825704,0.0013017665,0.00066593353,0.0005099708],"domain_scores_gemma":[0.99698514,0.00096664566,0.00032323555,0.0012829407,0.0003299503,0.000112114074],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022556812,0.00039291373,0.0003863984,0.0003993246,0.00056861766,0.0015634322,0.0021841733,0.00016883147,8.3422344e-7],"category_scores_gemma":[0.00016843996,0.000304415,0.000093392744,0.00031704924,0.00095196033,0.0005039105,0.00058897893,0.0005564401,0.000021449127],"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.000007034065,0.000006304238,0.0000029017833,0.000090897,0.000008458736,0.000005434458,0.00018139584,0.0018667227,0.00011156136,0.7424939,0.000021933361,0.25520343],"study_design_scores_gemma":[0.00013890087,0.0002084393,0.000042102914,0.0003509801,0.000011761389,0.00011772234,7.0627215e-7,0.7321773,0.0007126367,0.23807423,0.027794192,0.00037103108],"about_ca_topic_score_codex":0.000018603985,"about_ca_topic_score_gemma":0.000011841431,"teacher_disagreement_score":0.73031056,"about_ca_system_score_codex":0.00025741046,"about_ca_system_score_gemma":0.00022538811,"threshold_uncertainty_score":0.9999408},"labels":[],"label_agreement":null},{"id":"W4404287396","doi":"10.1007/978-3-031-75775-4_4","title":"A Probabilistic Analysis of Simplified Cluedo with Storm: The Birthday Cake Case","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Computer science; Storm; Probabilistic logic; Operations research; Artificial intelligence; Meteorology; Mathematics; Geography","score_opus":0.025192186358100718,"score_gpt":0.278831299248363,"score_spread":0.25363911289026225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404287396","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.0009297924,0.00033091946,0.9955106,0.0003257028,0.00083468936,0.00056493765,0.00001796609,0.00013321707,0.0013521772],"genre_scores_gemma":[0.3872702,0.000013611556,0.61182946,0.00037762162,0.00014594482,0.000029602319,0.000004661319,0.00003641998,0.00029249105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628717,0.00007813453,0.00065353786,0.0014249511,0.001070754,0.00048548056],"domain_scores_gemma":[0.9957572,0.00078232674,0.00043317623,0.002521372,0.00038818203,0.00011773404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019888182,0.0004741455,0.00067283155,0.0015220209,0.00023576012,0.00044431348,0.003143488,0.0002205241,0.000012513953],"category_scores_gemma":[0.00017364793,0.00029518316,0.00020758626,0.0038069603,0.0013613249,0.00038017172,0.0009811709,0.0008167895,0.000012938154],"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.00001881309,0.00004314767,0.00005129374,0.00018395374,0.0003375378,0.0007994513,0.0046028974,0.35680482,0.000052090305,0.35446504,0.000008312385,0.28263265],"study_design_scores_gemma":[0.00008972174,0.0002131796,0.00013030948,0.0001805483,0.00027128542,0.0005586115,9.884301e-7,0.9390269,0.00028437292,0.058309194,0.000515309,0.0004195631],"about_ca_topic_score_codex":0.00011706457,"about_ca_topic_score_gemma":0.0009433208,"teacher_disagreement_score":0.5822221,"about_ca_system_score_codex":0.00029267734,"about_ca_system_score_gemma":0.00053187006,"threshold_uncertainty_score":0.99995005},"labels":[],"label_agreement":null},{"id":"W4405022145","doi":"10.1109/lcsys.2024.3511407","title":"Underapproximating Safe Domains of Attraction for Discrete-Time Systems Using Implicit Representations of Backward Reachable Sets","year":2024,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Discrete time and continuous time; Attraction; Computer science; Mathematics; Theoretical computer science; Control theory (sociology); Artificial intelligence; Statistics","score_opus":0.0371756085811912,"score_gpt":0.3275783915530437,"score_spread":0.2904027829718525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405022145","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.060054008,0.00032889197,0.93500566,0.0003258061,0.0024532801,0.001468394,0.00007192596,0.00013672016,0.00015530144],"genre_scores_gemma":[0.90542316,0.0000022447934,0.09406376,0.000042392552,0.00019659818,0.00018865443,0.000007834149,0.000028474784,0.00004686461],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974664,0.00039969353,0.00096945546,0.00045906845,0.00039259336,0.00031278844],"domain_scores_gemma":[0.997742,0.00074418454,0.0005940329,0.00068544067,0.0001729721,0.00006139548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017057895,0.00018839238,0.0004959977,0.0002638237,0.00013473086,0.00023435452,0.0004391258,0.00009983032,7.495266e-7],"category_scores_gemma":[0.00011004175,0.00017873541,0.00018041059,0.00042695386,0.00006505759,0.0009153963,0.00002793736,0.00012570858,0.0000059760814],"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.00002475694,0.00002023072,0.00006605514,0.0012032954,0.00016941078,0.0000022557913,0.0005053878,0.12213534,0.8508839,0.024087543,0.00045587978,0.00044592112],"study_design_scores_gemma":[0.00050755666,0.000061318584,0.00008280627,0.00053232355,0.000066193636,0.00005312424,0.00013024583,0.9932199,0.004852186,0.00012161029,0.00020622948,0.000166464],"about_ca_topic_score_codex":0.0005424306,"about_ca_topic_score_gemma":0.0000012717925,"teacher_disagreement_score":0.8710846,"about_ca_system_score_codex":0.0002075809,"about_ca_system_score_gemma":0.00007087905,"threshold_uncertainty_score":0.72886187},"labels":[],"label_agreement":null},{"id":"W4405182083","doi":"10.1145/3658644.3690210","title":"SpecGuard: Specification Aware Recovery for Robotic Autonomous Vehicles from Physical Attacks","year":2024,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"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 British Columbia","funders":"","keywords":"Computer science; Computer security; Robot; Control (management); Artificial intelligence","score_opus":0.042359939956147986,"score_gpt":0.3205548544671846,"score_spread":0.2781949145110366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405182083","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.007732856,0.00015476864,0.9868238,0.0010017179,0.0015829748,0.00031411077,0.000010200956,0.0006542655,0.0017253335],"genre_scores_gemma":[0.31510592,0.0000145682825,0.68222344,0.00011022098,0.00065416656,0.000066475586,0.000029199991,0.000019822724,0.001776195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870217,0.000059670663,0.00023956185,0.0005777347,0.0001962621,0.00022460496],"domain_scores_gemma":[0.9987939,0.00035698037,0.00005251272,0.00066948193,0.000063491476,0.00006364069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027116254,0.00014457271,0.0001634222,0.000093117815,0.000086005835,0.00042134649,0.00064312696,0.00007002441,0.000028919181],"category_scores_gemma":[0.000051791616,0.00013006252,0.00013023084,0.00029890068,0.000035984685,0.0009109012,0.000097271186,0.00012739893,0.0004514304],"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.00001335877,0.00008804913,0.00002369755,0.000053354575,0.000042226675,0.000004184298,0.0007250186,0.002124852,0.0065567675,0.44017714,0.0075161983,0.54267514],"study_design_scores_gemma":[0.00008657931,0.00008491344,0.0018048139,0.000030450827,0.000014304238,0.000003460092,0.00002868512,0.92323744,0.023746222,0.033449315,0.017314456,0.00019932717],"about_ca_topic_score_codex":0.000036552156,"about_ca_topic_score_gemma":0.000004622306,"teacher_disagreement_score":0.9211126,"about_ca_system_score_codex":0.000147817,"about_ca_system_score_gemma":0.00008192222,"threshold_uncertainty_score":0.5802375},"labels":[],"label_agreement":null},{"id":"W4405599589","doi":"10.1109/lcsys.2024.3520152","title":"Signal Temporal Logic Planning With Time-Varying Robustness","year":2024,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Robustness (evolution); Computer science; Temporal logic; Theoretical computer science","score_opus":0.025087266889032817,"score_gpt":0.26147013791247364,"score_spread":0.23638287102344083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405599589","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.01374575,0.00061744754,0.9810922,0.0011574267,0.0018792057,0.00042815137,0.0000035348598,0.00067637267,0.00039989318],"genre_scores_gemma":[0.946969,3.8378118e-7,0.051512573,0.00078120286,0.0004762546,0.00010318977,0.0000024528376,0.000026554726,0.00012843333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979811,0.00031141957,0.0003522092,0.0005263107,0.00042558383,0.00040341896],"domain_scores_gemma":[0.99905086,0.00021416762,0.00012693966,0.00046330737,0.000052819614,0.00009188061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009680822,0.0002263148,0.00029883705,0.00019691465,0.00013721173,0.00072119955,0.00069444336,0.0000776412,0.000004501336],"category_scores_gemma":[0.0000136266035,0.00017604622,0.000067965906,0.0004163249,0.00006066888,0.0008897607,0.000028935328,0.00025413517,0.00011241408],"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.00004947091,0.000017918635,0.00034199204,0.00025470013,0.00014718248,0.0005838988,0.0005414604,0.90204775,0.08462493,0.0054376423,0.0037586708,0.002194365],"study_design_scores_gemma":[0.00041665017,0.000074507734,0.000059468894,0.0003729325,0.000018873196,0.00020239457,0.000012027263,0.99698496,0.0004088067,0.000015080854,0.0011674262,0.00026689647],"about_ca_topic_score_codex":0.000035903184,"about_ca_topic_score_gemma":2.3341678e-7,"teacher_disagreement_score":0.9332232,"about_ca_system_score_codex":0.00012412561,"about_ca_system_score_gemma":0.000060467333,"threshold_uncertainty_score":0.7178956},"labels":[],"label_agreement":null},{"id":"W4406575454","doi":"10.1016/s1558-0164(08)70419-x","title":"10.1016/s1558-0164(08)70419-x","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Medicine; Schedule; Economics; Management","score_opus":0.011208209112677824,"score_gpt":0.21083344026540932,"score_spread":0.19962523115273148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406575454","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007093612,0.000027410128,0.008545359,0.00026845114,0.000006130553,0.00016084978,0.0000024369797,0.0003232811,0.99059516],"genre_scores_gemma":[0.000021648137,1.5910064e-7,0.17832823,0.0000655367,0.00007255491,0.00001925002,0.0000019282165,0.000010618862,0.8214801],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988181,0.00009689754,0.00020301892,0.00033707588,0.0002579133,0.00028697314],"domain_scores_gemma":[0.9989106,0.00004711675,0.000042079235,0.0008081543,0.00005272878,0.00013928876],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004259429,0.00012725635,0.0001301514,0.00008530507,0.00009427931,0.000113276685,0.0010336734,0.000059937654,0.97253305],"category_scores_gemma":[0.00007157163,0.00012636515,0.000048214282,0.00046478864,0.00003064843,0.0004402263,0.000119550285,0.00010937779,0.9983705],"study_design_candidate":"not_applicable","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.000016465388,0.00003731796,1.2459489e-8,0.0000040291034,0.0000057980815,0.000002844788,0.00005635696,0.00013752373,0.00009918401,0.00022778392,0.1838499,0.8155628],"study_design_scores_gemma":[0.00010144507,0.00010297609,0.000054553144,0.000008541169,0.0000030297413,0.000012180907,2.7599006e-7,0.016166838,0.0008375106,0.00009817496,0.9824474,0.00016710063],"about_ca_topic_score_codex":0.000008579821,"about_ca_topic_score_gemma":3.3282827e-8,"teacher_disagreement_score":0.81539565,"about_ca_system_score_codex":0.000049829323,"about_ca_system_score_gemma":0.000032911445,"threshold_uncertainty_score":0.5153021},"labels":[],"label_agreement":null},{"id":"W4406714353","doi":"10.1007/978-3-031-82700-6","title":"Verification, Model Checking, and Abstract Interpretation","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Software, Chinese Academy of Sciences; University of California, Davis; Indian Institute of Technology Delhi; Universidade Federal de Minas Gerais; Indian Institute of Technology Bombay; Ludwig-Maximilians-Universität München; Uppsala Universitet; Chinese Academy of Sciences; Vysoké Učení Technické v Brně; Sorbonne Université; University of Twente; Aalborg Universitet; Technische Universiteit Delft; Tata Institute of Fundamental Research; Institute of Science and Technology Austria; Indian Institute of Science; Florida International University; York University; University of Southern California","keywords":"Computer science; Programming language; Interpretation (philosophy); Model checking; Abstract interpretation","score_opus":0.019858046014594254,"score_gpt":0.29246290401498254,"score_spread":0.2726048580003883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406714353","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.000060400616,0.00034457337,0.99195164,0.0002975941,0.0011119352,0.00035421507,0.0000034401487,0.00016466653,0.0057115145],"genre_scores_gemma":[0.037873287,0.000058500875,0.9603415,0.0007910093,0.00011157176,0.000023586268,0.000008850059,0.000014313526,0.00077736296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706215,0.00004981543,0.00053050957,0.0013345856,0.0006171013,0.00040583123],"domain_scores_gemma":[0.9976599,0.00028603672,0.00032932017,0.0013437428,0.00028279,0.000098184806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014616487,0.00035690077,0.00034643,0.0008269909,0.00021002158,0.0006147582,0.0025672368,0.0003054079,0.000002585462],"category_scores_gemma":[0.00036109102,0.00035800657,0.000060330243,0.0009187479,0.0004870639,0.0011050352,0.0008026649,0.0006623855,0.000009779158],"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.000005241196,0.000021109285,0.00001648544,0.000106720356,0.0000056353733,0.0000032183177,0.0014137827,0.08291514,0.0001856287,0.028354472,0.000101655634,0.8868709],"study_design_scores_gemma":[0.00009452212,0.000030722087,0.00040019926,0.00029055052,0.00000486002,0.000009323841,1.1595359e-7,0.8770392,0.0013375131,0.120180584,0.00031618372,0.00029621352],"about_ca_topic_score_codex":0.000007906929,"about_ca_topic_score_gemma":0.0000090906115,"teacher_disagreement_score":0.8865747,"about_ca_system_score_codex":0.00047619877,"about_ca_system_score_gemma":0.0013567664,"threshold_uncertainty_score":0.99988717},"labels":[],"label_agreement":null},{"id":"W4406716180","doi":"10.1007/978-3-031-82703-7","title":"Verification, Model Checking, and Abstract Interpretation","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Software, Chinese Academy of Sciences; Indian Institute of Technology Delhi; Universidade Federal de Minas Gerais; Indian Institute of Technology Bombay; Ludwig-Maximilians-Universität München; University of Twente; Uppsala Universitet; Chinese Academy of Sciences; Aalborg Universitet; Technische Universiteit Delft; Tata Institute of Fundamental Research; Indian Institute of Science; Florida International University; York University; University of Southern California","keywords":"Computer science; Interpretation (philosophy); Model checking; Abstract interpretation; Programming language","score_opus":0.019858046014594254,"score_gpt":0.29246290401498254,"score_spread":0.2726048580003883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406716180","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.000060400616,0.00034457337,0.99195164,0.0002975941,0.0011119352,0.00035421507,0.0000034401487,0.00016466653,0.0057115145],"genre_scores_gemma":[0.037873287,0.000058500875,0.9603415,0.0007910093,0.00011157176,0.000023586268,0.000008850059,0.000014313526,0.00077736296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706215,0.00004981543,0.00053050957,0.0013345856,0.0006171013,0.00040583123],"domain_scores_gemma":[0.9976599,0.00028603672,0.00032932017,0.0013437428,0.00028279,0.000098184806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014616487,0.00035690077,0.00034643,0.0008269909,0.00021002158,0.0006147582,0.0025672368,0.0003054079,0.000002585462],"category_scores_gemma":[0.00036109102,0.00035800657,0.000060330243,0.0009187479,0.0004870639,0.0011050352,0.0008026649,0.0006623855,0.000009779158],"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.000005241196,0.000021109285,0.00001648544,0.000106720356,0.0000056353733,0.0000032183177,0.0014137827,0.08291514,0.0001856287,0.028354472,0.000101655634,0.8868709],"study_design_scores_gemma":[0.00009452212,0.000030722087,0.00040019926,0.00029055052,0.00000486002,0.000009323841,1.1595359e-7,0.8770392,0.0013375131,0.120180584,0.00031618372,0.00029621352],"about_ca_topic_score_codex":0.000007906929,"about_ca_topic_score_gemma":0.0000090906115,"teacher_disagreement_score":0.8865747,"about_ca_system_score_codex":0.00047619877,"about_ca_system_score_gemma":0.0013567664,"threshold_uncertainty_score":0.99988717},"labels":[],"label_agreement":null},{"id":"W4406716471","doi":"10.1007/978-3-031-82703-7_4","title":"Synthesis of Parametric Locally Symmetric Protocols from Abstract Temporal Specifications","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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; Parametric statistics; Theoretical computer science; Distributed computing; Mathematics; Statistics","score_opus":0.057291667460120536,"score_gpt":0.30813902253182357,"score_spread":0.250847355071703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406716471","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.000025111829,0.00019932649,0.9832191,0.00020977837,0.0007916699,0.004202654,0.000035323363,0.00014259084,0.011174433],"genre_scores_gemma":[0.049501818,0.000028782242,0.94937944,0.000159669,0.00016940499,0.0005755614,0.0000070219903,0.000023212307,0.00015506103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952393,0.00008148602,0.0011882506,0.0016396615,0.0013333013,0.0005180107],"domain_scores_gemma":[0.9930248,0.002575299,0.0009281813,0.0027841327,0.0005384465,0.00014913392],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017407719,0.00052261126,0.0007891808,0.0031343724,0.00018093963,0.00039980267,0.005748998,0.00045212897,0.000042581178],"category_scores_gemma":[0.0016105854,0.00049786235,0.00020481678,0.003912506,0.00074806047,0.0006943819,0.0009788104,0.00082646025,0.000043891225],"study_design_candidate":"design_other","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.000009366415,0.00008588864,0.00016436093,0.00009272403,0.000018933935,0.000011068649,0.000088523615,0.0040164553,0.0001031689,0.07422259,0.00002881546,0.9211581],"study_design_scores_gemma":[0.00040702737,0.00028641007,0.009362696,0.0025672917,0.000041092146,0.000017068267,4.6031857e-7,0.659086,0.04689397,0.27562895,0.004251103,0.0014579394],"about_ca_topic_score_codex":0.00010732949,"about_ca_topic_score_gemma":0.000017846767,"teacher_disagreement_score":0.91970015,"about_ca_system_score_codex":0.0004215273,"about_ca_system_score_gemma":0.0011349068,"threshold_uncertainty_score":0.9997473},"labels":[],"label_agreement":null},{"id":"W4408151444","doi":"10.1145/3658617.3697721","title":"MTLSO: A Multi-Task Learning Approach for Logic Synthesis Optimization","year":2025,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Task (project management); Artificial intelligence; Multi-task learning; Machine learning; Systems engineering; Engineering","score_opus":0.0501171141136901,"score_gpt":0.318499557619319,"score_spread":0.2683824435056289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408151444","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.000025004376,0.000036033613,0.9889861,0.00016473015,0.00014081573,0.0003175207,4.1162914e-7,0.0002928137,0.010036625],"genre_scores_gemma":[0.014653851,0.00000996569,0.98309493,0.0001811824,0.000012058684,0.0002239429,0.0000034714649,0.0000050354665,0.0018155382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991416,0.000118994314,0.00017357622,0.0003125829,0.00008753646,0.00016571372],"domain_scores_gemma":[0.99930775,0.000189563,0.000066470755,0.00031704223,0.000093985305,0.000025185342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006543183,0.0000859691,0.00010820212,0.00012454715,0.00016367924,0.00011191977,0.0005115871,0.00006671506,0.0000064107],"category_scores_gemma":[0.00089993014,0.00007603493,0.00004933359,0.00041872528,0.000022402382,0.0003269045,0.000110411136,0.00007589732,0.0000053122826],"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.000007796787,0.00008880693,0.00009922642,0.00005838401,0.00001538378,1.1536662e-7,0.00015618592,0.6031849,0.00036603794,0.31376913,0.00018876209,0.08206528],"study_design_scores_gemma":[0.00012849543,0.000018758725,0.00010298312,0.000007482767,0.0000067352958,8.153309e-7,0.000033536704,0.9947894,0.0034905677,0.0003665418,0.0009676495,0.00008701454],"about_ca_topic_score_codex":0.000005850282,"about_ca_topic_score_gemma":2.0725044e-7,"teacher_disagreement_score":0.3916045,"about_ca_system_score_codex":0.000043195294,"about_ca_system_score_gemma":0.000034104192,"threshold_uncertainty_score":0.31006142},"labels":[],"label_agreement":null},{"id":"W4408159621","doi":"10.7748/ns.40.3.34.s14","title":"Boolean operators to RCTs – research terms explained","year":2025,"lang":"en","type":"article","venue":"Nursing Standard","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"World Federation of Science Journalists","funders":"","keywords":"Computer science; Mathematics; Psychology","score_opus":0.061045743915030176,"score_gpt":0.4552149998863301,"score_spread":0.3941692559712999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408159621","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.013577948,0.000051488045,0.9373536,0.005049215,0.001453042,0.00030287294,0.0000038883472,0.0001985168,0.042009432],"genre_scores_gemma":[0.3366359,0.0000032949683,0.66168594,0.00040451458,0.00006082998,0.000029184315,0.000001027543,0.0000094419165,0.0011698975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981241,0.000298207,0.00019905785,0.00041274665,0.0005569082,0.0004089497],"domain_scores_gemma":[0.9986931,0.000100323945,0.000022995819,0.0008069998,0.00026391825,0.0001126445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022375467,0.000100537756,0.00013902852,0.00040086565,0.00039057975,0.0003471652,0.000959453,0.0000641321,0.000008101697],"category_scores_gemma":[0.00057288643,0.00009572247,0.000030360658,0.0013921729,0.00010397656,0.00035094097,0.00013535334,0.00023394404,0.000043906894],"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.00006677718,0.000035760735,0.000111464986,0.00001383335,0.000006039068,0.0000046764276,0.0030946638,0.000054122775,0.00409972,0.53429246,0.027623115,0.43059736],"study_design_scores_gemma":[0.0017388671,0.0015403524,0.009621374,0.0026960345,0.000016399406,0.00002296068,0.0016697567,0.026584025,0.43040022,0.13600364,0.3887348,0.0009715536],"about_ca_topic_score_codex":0.0000064186515,"about_ca_topic_score_gemma":0.0000022867207,"teacher_disagreement_score":0.4296258,"about_ca_system_score_codex":0.0005045294,"about_ca_system_score_gemma":0.00019087775,"threshold_uncertainty_score":0.39034492},"labels":[],"label_agreement":null},{"id":"W4409183528","doi":"10.1007/978-981-96-4656-2_5","title":"Testing and Design of Uniform CNF Samplers: A Virtuous Cycle Enabled by Distribution Testing","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","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":"University of Toronto","funders":"","keywords":"Computer science; Distribution (mathematics); Mathematics","score_opus":0.0400573742236029,"score_gpt":0.2695620406360729,"score_spread":0.22950466641247003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409183528","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.000110675064,0.0002539009,0.9974219,0.00007908159,0.00048155317,0.0005081263,0.000023497278,0.00015039777,0.0009708401],"genre_scores_gemma":[0.027847389,0.000012727902,0.97182477,0.00016576877,0.00006820372,0.000011017925,0.000008111226,0.000014761593,0.000047282716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969686,0.0000864192,0.00065056153,0.0011332615,0.0006408871,0.00052022235],"domain_scores_gemma":[0.9952293,0.0027097934,0.0005261195,0.0009490566,0.00047366985,0.00011204632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020557141,0.0004071537,0.0004795323,0.00040649297,0.00029927646,0.00032922177,0.001915162,0.00026672828,0.0000017572079],"category_scores_gemma":[0.0027287067,0.00039640046,0.000044658045,0.0013469084,0.00063103647,0.0007044735,0.001070916,0.00053868,0.0000019641705],"study_design_candidate":"design_other","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.0000067434485,0.00002267959,0.000118102405,0.00010747039,0.000007922058,0.000007070203,0.00019633204,0.031536862,0.0022712082,0.013827021,0.000019317227,0.95187926],"study_design_scores_gemma":[0.00017543671,0.00022997464,0.00021217731,0.0006326407,0.000010110435,0.00003679571,2.3566098e-7,0.9072746,0.005360645,0.08559161,0.00010470391,0.00037107832],"about_ca_topic_score_codex":0.000095197196,"about_ca_topic_score_gemma":0.00000338883,"teacher_disagreement_score":0.95150816,"about_ca_system_score_codex":0.0003160847,"about_ca_system_score_gemma":0.0005709635,"threshold_uncertainty_score":0.9998488},"labels":[],"label_agreement":null},{"id":"W4409189769","doi":"10.1007/s42979-025-03824-6","title":"Testing Stream Programs from Pre/Post-models","year":2025,"lang":"en","type":"article","venue":"SN Computer Science","topic":"Formal Methods in Verification","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é du Québec à Chicoutimi","funders":"Canada Excellence Research Chairs, Government of Canada","keywords":"Computer science","score_opus":0.04824223859352365,"score_gpt":0.3105425945507961,"score_spread":0.2623003559572724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409189769","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.05446409,0.000046269535,0.9391351,0.0002660445,0.0017541108,0.00029979553,0.0000017509363,0.0005179633,0.0035148887],"genre_scores_gemma":[0.26131546,8.0264493e-7,0.7381337,0.00040973088,0.00007114252,0.000022224702,0.0000015575713,0.0000039882652,0.000041398464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974656,0.000089325265,0.00033408118,0.0009855037,0.00060249446,0.0005229678],"domain_scores_gemma":[0.99765563,0.00019253595,0.00013309531,0.0013751637,0.00051018875,0.0001333684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00116502,0.00018424912,0.00017286067,0.0002786257,0.00044793636,0.0009776755,0.0040015755,0.000057457695,0.000001584881],"category_scores_gemma":[0.00018178624,0.00017027017,0.000047360394,0.0032267359,0.000405127,0.0025796667,0.0015519144,0.00018527679,0.000026068905],"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.00000194687,0.00006641256,0.0007967669,0.0000084360745,0.000004404999,0.0000025462678,0.00056323764,0.001487004,0.002317946,0.11164645,0.000043206812,0.88306165],"study_design_scores_gemma":[0.0001218421,0.000109407374,0.018617785,0.000086984626,0.0000032597904,0.0000044176713,0.0000072568823,0.93923956,0.0050063734,0.03636863,0.00025250364,0.00018198379],"about_ca_topic_score_codex":0.00019911121,"about_ca_topic_score_gemma":0.0000055236883,"teacher_disagreement_score":0.93775254,"about_ca_system_score_codex":0.000116707764,"about_ca_system_score_gemma":0.00050702144,"threshold_uncertainty_score":0.94277483},"labels":[],"label_agreement":null},{"id":"W4409360835","doi":"10.1609/aaai.v39i28.35275","title":"Algorithm Selection for Word-Level Hardware Model Checking (Student Abstract)","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Waterloo","funders":"Deutsche Forschungsgemeinschaft","keywords":"Selection (genetic algorithm); Computer science; Word (group theory); Programming language; Arithmetic; Natural language processing; Artificial intelligence; Mathematics","score_opus":0.15450902196768995,"score_gpt":0.37692259502137576,"score_spread":0.2224135730536858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409360835","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.007834704,0.000013671326,0.98457026,0.0012602662,0.00062324887,0.0006790083,0.0000077695795,0.00011824512,0.0048928102],"genre_scores_gemma":[0.58334506,0.00001560772,0.4156084,0.00016785233,0.000044923094,0.000118974036,5.300016e-7,0.000009384469,0.0006892934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980858,0.0000111505515,0.00060528546,0.00053935806,0.0004155836,0.00034280305],"domain_scores_gemma":[0.99807626,0.000084305066,0.00039815827,0.00028380333,0.0011049408,0.000052537154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009462186,0.00021744515,0.00024008282,0.00019374197,0.00032098018,0.00031769404,0.0020603936,0.00012348489,0.000009015239],"category_scores_gemma":[0.00050428865,0.00018222012,0.00013890537,0.0007913044,0.00012920811,0.0005737145,0.0003138307,0.00029094092,0.000013577316],"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.00002329952,0.000086891676,0.00003742963,0.000044172488,0.000012968844,1.8671793e-8,0.0005268272,0.00073697086,0.014903299,0.6190068,0.00009229538,0.36452898],"study_design_scores_gemma":[0.000018984332,0.00003668992,0.00025723458,0.00013328712,0.000008660958,5.9239403e-7,0.00014793832,0.51229817,0.34187913,0.14504178,0.00007202265,0.00010552246],"about_ca_topic_score_codex":0.000019172212,"about_ca_topic_score_gemma":0.000005903429,"teacher_disagreement_score":0.5755103,"about_ca_system_score_codex":0.00013086038,"about_ca_system_score_gemma":0.00018524256,"threshold_uncertainty_score":0.7430721},"labels":[],"label_agreement":null},{"id":"W4409364628","doi":"10.1609/aaai.v39i14.33659","title":"Checking Consistency of CP-Theory Preferences in Polynomial Time","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Science Foundation","keywords":"Consistency (knowledge bases); Mathematics; Polynomial; Time consistency; Mathematical economics; Computer science; Discrete mathematics; Economics; Mathematical analysis; Actuarial science","score_opus":0.0639208776143401,"score_gpt":0.32031585337393076,"score_spread":0.2563949757595907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7473642,0.00014491282,0.088001154,0.0019239503,0.0012705559,0.0011283101,0.00000809065,0.00015981228,0.159999],"genre_scores_gemma":[0.97764724,0.000021945545,0.021891331,0.000072834315,0.000017101,0.000019645078,2.2162017e-7,0.000005781173,0.0003239154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980717,0.00006768018,0.00081915385,0.0004273569,0.00034139137,0.00027275164],"domain_scores_gemma":[0.9983975,0.00020226614,0.00051029585,0.00037468257,0.00047723367,0.00003800027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015118471,0.00018589811,0.00033803962,0.00031455135,0.00010313243,0.00010292482,0.002389827,0.000116979034,0.0000485531],"category_scores_gemma":[0.0012888634,0.0001493515,0.000101472004,0.0011520372,0.00046626682,0.00042935516,0.00044230607,0.00028340885,0.000027036871],"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.00007391188,0.00009988796,0.0003375066,0.00005494823,0.000009541981,8.657809e-8,0.0007567379,0.000017738459,0.059440646,0.8209092,0.000028816305,0.11827095],"study_design_scores_gemma":[0.00002840018,0.00010819431,0.0010738538,0.00043573664,0.00000843905,9.549786e-7,0.0003140399,0.019856902,0.6802426,0.2977774,0.000029297784,0.00012412641],"about_ca_topic_score_codex":0.0000413809,"about_ca_topic_score_gemma":0.0000052841765,"teacher_disagreement_score":0.620802,"about_ca_system_score_codex":0.000059083577,"about_ca_system_score_gemma":0.00020568563,"threshold_uncertainty_score":0.60903776},"labels":[],"label_agreement":null},{"id":"W4409967420","doi":"10.1007/978-3-031-90660-2_2","title":"Weakly Acyclic Diagrams: A Data Structure for Infinite-State Symbolic Verification","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; State diagram; State (computer science); Data structure; Theoretical computer science; Programming language; Algorithm","score_opus":0.04171524278728744,"score_gpt":0.3111681039484762,"score_spread":0.2694528611611888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409967420","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.000058866466,0.00042740625,0.9930356,0.0006870532,0.0031651559,0.0012459501,0.00019397597,0.00026593488,0.0009200613],"genre_scores_gemma":[0.014799016,0.00010975668,0.98268044,0.0012431327,0.0004093508,0.00004390925,0.00018812814,0.00004162218,0.00048462217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947219,0.00008525673,0.0008656713,0.002624763,0.00091201614,0.0007903782],"domain_scores_gemma":[0.9923158,0.0009764164,0.0005871594,0.005520133,0.00043145474,0.00016902752],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001668408,0.000667185,0.00065759587,0.0011309262,0.00038574342,0.0008923907,0.010428329,0.00045727735,0.000008213016],"category_scores_gemma":[0.00096588663,0.00064121827,0.00012121779,0.0011995389,0.00063165015,0.0015586315,0.0028011266,0.00090024015,0.00001726163],"study_design_candidate":"design_other","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.000013053998,0.000020813592,0.000020279831,0.0001300003,0.000018733208,0.000004642351,0.00052800507,0.0058995853,0.00038684654,0.068677135,0.000110321824,0.9241906],"study_design_scores_gemma":[0.00025264558,0.00010765358,0.00023188826,0.00032223295,0.0000191961,0.000016890468,1.8018466e-7,0.756495,0.0025282977,0.22558208,0.013770334,0.00067361223],"about_ca_topic_score_codex":0.000021781469,"about_ca_topic_score_gemma":0.000085452535,"teacher_disagreement_score":0.923517,"about_ca_system_score_codex":0.000355568,"about_ca_system_score_gemma":0.0010259071,"threshold_uncertainty_score":0.9996039},"labels":[],"label_agreement":null},{"id":"W4410211360","doi":"10.1145/3730584","title":"GOLDYLOC: Global Optimizations &amp; Lightweight Dynamic Logic for Concurrency","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Concurrency; Parallel computing; Distributed computing; Programming language","score_opus":0.018092089414499066,"score_gpt":0.31365807022529435,"score_spread":0.29556598081079527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410211360","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.00004330049,0.00020165234,0.99250764,0.004072844,0.0005431419,0.0006284145,0.00011034577,0.00027741486,0.0016152387],"genre_scores_gemma":[0.01793782,0.00023689351,0.9802981,0.00066471397,0.000013914486,0.00019946115,0.00006493597,0.0000109476605,0.00057320064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986585,0.00010637224,0.00031593922,0.0005201464,0.00014862137,0.00025041576],"domain_scores_gemma":[0.9987369,0.00014644967,0.000098989825,0.00078221835,0.00015939772,0.00007604101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018091916,0.00021928707,0.00018981702,0.00023351556,0.0004872116,0.00016065752,0.0006431594,0.00014839564,0.000024380048],"category_scores_gemma":[0.0001246998,0.00020705543,0.000091217116,0.0009332152,0.000082084785,0.00029326216,0.000024712548,0.00017332146,0.000004581741],"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.00003411265,0.000092569586,0.000006048,0.000034123866,0.000027391556,1.8602577e-7,0.00015699219,0.76460433,0.000039105704,0.05537548,0.000091083995,0.17953856],"study_design_scores_gemma":[0.0006466569,0.00011749615,0.00008226223,0.00004917709,0.000061760926,0.000012763647,0.00001623986,0.95186913,0.00026914387,0.04129398,0.0053286413,0.00025273458],"about_ca_topic_score_codex":0.0000034218947,"about_ca_topic_score_gemma":0.000050230406,"teacher_disagreement_score":0.1872648,"about_ca_system_score_codex":0.0000948708,"about_ca_system_score_gemma":0.00009451305,"threshold_uncertainty_score":0.84434754},"labels":[],"label_agreement":null},{"id":"W4410416269","doi":"10.1007/978-3-031-88930-1_2","title":"Some Uses of Modal Semirings","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Computer science; Modal","score_opus":0.022905842909908856,"score_gpt":0.2804070665169648,"score_spread":0.2575012236070559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410416269","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.00007722117,0.00058932777,0.9925784,0.0002900983,0.0021663408,0.00028462688,0.000005212213,0.0001322054,0.0038766076],"genre_scores_gemma":[0.013874943,0.0000731699,0.98442805,0.0007002636,0.0002580046,0.0000071605464,0.0000017379886,0.00001631969,0.0006403411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968202,0.00004546855,0.00061749644,0.0011681768,0.0008865802,0.00046208664],"domain_scores_gemma":[0.9970823,0.00043524086,0.00039330433,0.0017081494,0.00028760493,0.00009340739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011576081,0.00039344298,0.0005260395,0.001036358,0.0001282343,0.0002030128,0.0042880583,0.00030985425,0.000007241977],"category_scores_gemma":[0.0002523765,0.00037641934,0.0001327064,0.00071281876,0.0007656397,0.0009520427,0.001689041,0.00061933417,0.0000137663765],"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.000004461577,0.0000212086,0.00003379679,0.00010543746,0.000009268332,0.000010468279,0.00039015102,0.009118584,0.00047213217,0.46765107,0.000028931605,0.52215445],"study_design_scores_gemma":[0.00016137224,0.00012717234,0.00017942241,0.0006321461,0.000008460961,0.000021202586,8.0560625e-8,0.5265872,0.024232091,0.44620174,0.0013451631,0.000503969],"about_ca_topic_score_codex":0.000021158703,"about_ca_topic_score_gemma":0.00000608736,"teacher_disagreement_score":0.5216505,"about_ca_system_score_codex":0.00023018499,"about_ca_system_score_gemma":0.00064128055,"threshold_uncertainty_score":0.99986875},"labels":[],"label_agreement":null},{"id":"W4411271981","doi":"10.1109/icse-companion66252.2025.00061","title":"Structured State Space Exploration of Dash+ Models","year":2025,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Dash; Computer science; Space (punctuation); State (computer science); Space exploration; Aerospace engineering; Engineering; Programming language; Operating system","score_opus":0.0522554194748681,"score_gpt":0.31973381858939226,"score_spread":0.26747839911452415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411271981","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.0036296507,0.000019461655,0.98146725,0.00035265583,0.00025656336,0.00010456342,7.4195174e-7,0.00008395206,0.014085174],"genre_scores_gemma":[0.30567056,0.000007959602,0.6933594,0.00005853739,0.0000031330167,0.0000050856515,6.8733794e-7,0.0000014453526,0.00089320296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942917,0.000055799577,0.0001604638,0.00015092592,0.000121948244,0.00008172277],"domain_scores_gemma":[0.9993672,0.000024242774,0.00006389506,0.0004341196,0.00009400725,0.000016533488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022821694,0.00005186161,0.0000753227,0.00009426212,0.000027725937,0.000033686072,0.00038247564,0.000024829998,0.0000042355923],"category_scores_gemma":[0.000035112935,0.000045584882,0.000018926963,0.0003888646,0.000020481395,0.0014084114,0.000098351025,0.00004097196,0.000003316251],"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.0000032185283,0.0000066419634,0.000010613675,0.000010449221,0.000003801538,8.426173e-8,0.0004871671,0.009705575,0.0033673393,0.9542741,0.00017946622,0.0319515],"study_design_scores_gemma":[0.00006903608,0.000012213337,0.0002370056,0.000005635016,0.0000011173363,1.5309529e-7,0.000025124815,0.5456305,0.12544267,0.3283194,0.00022055005,0.0000365817],"about_ca_topic_score_codex":0.000019943804,"about_ca_topic_score_gemma":0.0000058677974,"teacher_disagreement_score":0.62595475,"about_ca_system_score_codex":0.000019374807,"about_ca_system_score_gemma":0.00004509138,"threshold_uncertainty_score":0.18588975},"labels":[],"label_agreement":null},{"id":"W4411374877","doi":"10.1145/3724389.3731259","title":"Communicating StateCharts (CSC)","year":2025,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Computer science; Programming language","score_opus":0.0277427560660596,"score_gpt":0.33610786643506635,"score_spread":0.30836511036900677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411374877","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.0009119711,0.00003774666,0.83454996,0.00083230017,0.00014740913,0.00005303997,1.00074416e-7,0.00022748063,0.16324],"genre_scores_gemma":[0.121779844,0.000008944106,0.876093,0.00066861184,0.0000031223865,0.000008947662,3.66167e-7,0.000001376873,0.0014358455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951696,0.00007131305,0.00012400582,0.00011856872,0.000067624125,0.00010153192],"domain_scores_gemma":[0.9989751,0.0000684468,0.000030581843,0.0008701511,0.000038829454,0.000016896163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004484618,0.000041384505,0.000050295006,0.000059077724,0.000094060095,0.00007007122,0.0009955621,0.000021837695,0.000010237365],"category_scores_gemma":[0.00008246167,0.00003753907,0.000015712894,0.0003282513,0.000021507543,0.0002751342,0.0003781279,0.0000759417,0.000047068203],"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":[3.4722783e-7,0.000008163709,0.00007354463,0.0000035324388,0.0000019463257,1.2794881e-7,0.00011648886,0.0000071077043,0.00058431964,0.8868035,0.0006969113,0.11170402],"study_design_scores_gemma":[0.00028443395,0.0000412886,0.0051916176,0.000053483524,0.0000036578886,0.000004169234,0.00012245313,0.62398356,0.10762199,0.11039301,0.15205052,0.00024980307],"about_ca_topic_score_codex":0.000018202381,"about_ca_topic_score_gemma":0.0000027098802,"teacher_disagreement_score":0.77641046,"about_ca_system_score_codex":0.000021609372,"about_ca_system_score_gemma":0.000025935436,"threshold_uncertainty_score":0.18500187},"labels":[],"label_agreement":null},{"id":"W4412514770","doi":"10.1007/978-3-031-98679-6_12","title":"Robust Probabilistic Bisimilarity for Labelled Markov Chains","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Clarendon Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Markov chain; Probabilistic logic; Theoretical computer science; Markov process; Examples of Markov chains; Algorithm; Artificial intelligence; Markov model; Markov property; Machine learning; Mathematics; Statistics","score_opus":0.0426541683168992,"score_gpt":0.2839261103288533,"score_spread":0.2412719420119541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412514770","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.000007753314,0.0002332468,0.98878056,0.0010292083,0.0031840724,0.0014974612,0.000022438771,0.00025811707,0.004987132],"genre_scores_gemma":[0.0013878495,0.000028791048,0.99511963,0.0012433793,0.0002996404,0.000078596226,0.000010647302,0.000027707802,0.001803753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956689,0.000076026314,0.0007043922,0.0019687288,0.00080641033,0.00077554403],"domain_scores_gemma":[0.9956596,0.0010921041,0.00036658163,0.0021703478,0.0005558317,0.0001555734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002525377,0.00058317627,0.00065037946,0.0009409896,0.0004168575,0.0005175509,0.00467432,0.00048112564,0.000011822529],"category_scores_gemma":[0.001052198,0.0005547226,0.00019057623,0.00095132756,0.0006971711,0.00055579864,0.001501297,0.0007897332,0.000010550432],"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.000016223099,0.0000463195,0.000012028675,0.00024291057,0.000014044209,0.000009685973,0.00027863984,0.025623616,0.00004523481,0.3517269,0.00013558318,0.6218488],"study_design_scores_gemma":[0.00028257366,0.00014345959,0.00004321185,0.00032695924,0.00001266241,0.000012660858,6.2708956e-8,0.8142834,0.00056356663,0.18097831,0.0028351129,0.00051806954],"about_ca_topic_score_codex":0.000010925584,"about_ca_topic_score_gemma":0.000051133266,"teacher_disagreement_score":0.78865975,"about_ca_system_score_codex":0.00054835714,"about_ca_system_score_gemma":0.0010269688,"threshold_uncertainty_score":0.9996904},"labels":[],"label_agreement":null},{"id":"W4412532934","doi":"10.1007/978-3-031-98668-0_15","title":"Btor2-Select: Machine Learning Based Algorithm Selection for Hardware Model Checking","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Waterloo","funders":"","keywords":"Computer science; Selection (genetic algorithm); Artificial intelligence; Machine learning; Algorithm","score_opus":0.026053147191581867,"score_gpt":0.2833365784270469,"score_spread":0.25728343123546504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412532934","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.0000017613394,0.00036614382,0.9956423,0.00031320166,0.0014072234,0.0007729041,0.000013335724,0.00041841203,0.0010646979],"genre_scores_gemma":[0.0015839643,0.000024845576,0.9958864,0.0008138304,0.00028564676,0.000060508104,0.000025035513,0.000043367974,0.001276442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583143,0.0000782898,0.00062561047,0.0018137507,0.00087542576,0.0007754752],"domain_scores_gemma":[0.99732643,0.0005472474,0.00043221322,0.00092842686,0.0006330268,0.00013265335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020072085,0.0006018193,0.0005712731,0.0012458174,0.00064703595,0.0005865988,0.0027613493,0.000461745,0.000007487756],"category_scores_gemma":[0.0004230102,0.0006198453,0.00020547891,0.001089892,0.00026755154,0.00073083455,0.0006282112,0.001250037,0.000006495276],"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.000006430104,0.000013814617,0.000010493565,0.0000636043,0.0000067372207,0.0000015471196,0.0001307496,0.31772465,0.00011833196,0.009122611,0.0000128013835,0.67278826],"study_design_scores_gemma":[0.0003012169,0.00018181466,0.00000666541,0.000333208,0.0000140445445,0.00001248458,5.4360683e-8,0.95223004,0.0064870897,0.037338354,0.0025126762,0.0005823533],"about_ca_topic_score_codex":0.000023390508,"about_ca_topic_score_gemma":0.000029706716,"teacher_disagreement_score":0.67220587,"about_ca_system_score_codex":0.0007199046,"about_ca_system_score_gemma":0.0011903932,"threshold_uncertainty_score":0.99962527},"labels":[],"label_agreement":null},{"id":"W4412543519","doi":"10.1007/978-3-031-98682-6_6","title":"Panini: An Efficient and Flexible Knowledge Compiler","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jilin Province","keywords":"Computer science; Compiler; Programming language; Software engineering","score_opus":0.031140392111636408,"score_gpt":0.30685456873615186,"score_spread":0.2757141766245155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412543519","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.00012247627,0.0008024111,0.97951126,0.00018016195,0.002464886,0.00042324886,0.0000050479657,0.00028170034,0.016208818],"genre_scores_gemma":[0.024424877,0.00004245415,0.97364026,0.0006660447,0.0002507822,0.000012904098,0.00000486724,0.000023888517,0.0009339113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963426,0.00009775355,0.0005392208,0.0017805783,0.0006354195,0.00060441566],"domain_scores_gemma":[0.99699724,0.00041582764,0.00023137691,0.0018339126,0.0003033666,0.0002182581],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016499594,0.00051097944,0.00051823055,0.0010226663,0.00035076367,0.0006225484,0.0032156534,0.0003443,0.000012363993],"category_scores_gemma":[0.00012879669,0.00047944777,0.00007725851,0.0008256186,0.00088249607,0.0005507795,0.0019159247,0.00077106245,0.000035373658],"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.000004935524,0.000049922466,0.0000229835,0.00005928715,0.000005757789,0.000009020694,0.0009508964,0.011417662,0.00006984141,0.25902677,0.000025045358,0.7283579],"study_design_scores_gemma":[0.00020705212,0.00018912677,0.00037036746,0.00033902706,0.000007831028,0.00003704839,2.42964e-7,0.94035643,0.0015830662,0.052403934,0.003944129,0.000561749],"about_ca_topic_score_codex":0.000011441051,"about_ca_topic_score_gemma":0.000017999497,"teacher_disagreement_score":0.92893875,"about_ca_system_score_codex":0.00026871724,"about_ca_system_score_gemma":0.00060967513,"threshold_uncertainty_score":0.9997657},"labels":[],"label_agreement":null},{"id":"W4412543571","doi":"10.1007/978-3-031-98682-6_5","title":"Engineering an Efficient Probabilistic Exact Model Counter","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; National Supercomputing Centre Singapore; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Computer science; Probabilistic logic; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.020603537807788255,"score_gpt":0.26610933682305205,"score_spread":0.2455057990152638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412543571","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.00007815888,0.00010618805,0.9935244,0.000119707605,0.0018393783,0.0005249018,0.000006253799,0.00030205393,0.0034989915],"genre_scores_gemma":[0.024682088,0.000007611935,0.97414225,0.000504799,0.00016562105,0.00002244016,0.000004452508,0.000028303482,0.0004424532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960679,0.00003827103,0.0005708798,0.0017069262,0.00096232706,0.0006537171],"domain_scores_gemma":[0.9968318,0.00029236646,0.00021388939,0.0021823545,0.00030509627,0.00017454616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015414404,0.00053923356,0.00046588376,0.00092825387,0.00018290839,0.000567013,0.004044853,0.00032162937,0.000010184855],"category_scores_gemma":[0.00028745868,0.00051588134,0.00010525095,0.000652792,0.00034948325,0.00061821,0.0011156148,0.00081542507,0.000029236091],"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.0000026319678,0.0000241051,0.0000013778556,0.000056244502,0.0000035971646,0.000008476458,0.0003218215,0.7721687,0.000073083334,0.11961716,0.0000062523404,0.10771658],"study_design_scores_gemma":[0.000109928704,0.00007532549,0.000016869148,0.00035184066,0.0000070951883,0.000019943021,3.39739e-8,0.9690477,0.00052342686,0.029069407,0.0002716122,0.00050679565],"about_ca_topic_score_codex":0.0000068774357,"about_ca_topic_score_gemma":0.000006048519,"teacher_disagreement_score":0.19687904,"about_ca_system_score_codex":0.00063248567,"about_ca_system_score_gemma":0.00073463446,"threshold_uncertainty_score":0.9997293},"labels":[],"label_agreement":null},{"id":"W4412647363","doi":"10.55016/ojs/cdm.v3i1.61999","title":"Arcs in Desarguesian nets","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Ministero dell’Istruzione, dell’Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Combinatorics","score_opus":0.030685607786433755,"score_gpt":0.32472518810292195,"score_spread":0.2940395803164882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647363","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.01495464,0.000046881654,0.9797689,0.0011611603,0.00014356148,0.00038232308,0.00001959055,0.00015196628,0.0033709777],"genre_scores_gemma":[0.33764678,0.000010602635,0.6619358,0.00016592868,0.000024522195,0.00006576452,0.0000054191087,0.000007646723,0.00013753392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986747,0.0000825756,0.00039502804,0.00025013747,0.00023936942,0.00035821146],"domain_scores_gemma":[0.99872077,0.00011616294,0.000087448505,0.00078882155,0.00014301427,0.00014377566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000564112,0.00013446441,0.00021142507,0.00019090723,0.00018059947,0.000059230148,0.0007667926,0.00006988741,0.000011301326],"category_scores_gemma":[0.0010133217,0.00012832596,0.000056078374,0.00082933664,0.000062559244,0.0003619611,0.00019883241,0.00013959162,0.00021743584],"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.0000025674774,0.00010758802,0.0002541186,0.000015438074,0.0000067200167,0.000019244157,0.0025260667,0.00023526343,0.00068234315,0.9936658,0.00090192264,0.0015829378],"study_design_scores_gemma":[0.0016369164,0.00030279643,0.027185766,0.00029872413,0.000023041925,0.00046876396,0.00028706942,0.7259711,0.023821797,0.19156414,0.027114483,0.0013253633],"about_ca_topic_score_codex":0.000008194419,"about_ca_topic_score_gemma":0.000006391308,"teacher_disagreement_score":0.8021017,"about_ca_system_score_codex":0.00016672649,"about_ca_system_score_gemma":0.000085652966,"threshold_uncertainty_score":0.5232981},"labels":[],"label_agreement":null},{"id":"W4413156306","doi":"10.1109/mcs.2025.3577050","title":"Risk-Aware Robotics: Tail Risk Measures in Planning, Control, and Verification [Focus on Education]","year":2025,"lang":"en","type":"article","venue":"IEEE Control Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"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":"","keywords":"Robotics; Focus (optics); Artificial intelligence; Control (management); Computer science; Risk analysis (engineering); Engineering; Psychology; Robot; Business; Physics","score_opus":0.016740975240475815,"score_gpt":0.28413768970328424,"score_spread":0.26739671446280844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413156306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009818897,0.0027123021,0.98130906,0.0003862434,0.0029370422,0.0011022642,0.000022392258,0.00017023242,0.001541591],"genre_scores_gemma":[0.99343586,0.00009299538,0.00561017,0.0001585737,0.00015997732,0.00033687562,0.000001973235,0.000012776557,0.00019079912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698067,0.0011913611,0.0006091069,0.0005813253,0.00033439035,0.0003031542],"domain_scores_gemma":[0.9977779,0.0004901066,0.0005101175,0.00089249876,0.0002374543,0.000091917456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020827877,0.00023004708,0.00039937746,0.0003825915,0.00021361018,0.00030952724,0.0006336046,0.00017367047,4.5070044e-7],"category_scores_gemma":[0.0006429337,0.00021098851,0.000055225126,0.000439504,0.000061124985,0.00039315704,0.000021687722,0.00034670235,0.000028351973],"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.00047243826,0.0005939497,0.17459889,0.00024016107,0.00030831216,0.000008770144,0.0020890885,0.31953588,0.0025002232,0.30699933,0.004432956,0.18822001],"study_design_scores_gemma":[0.003219979,0.00016740082,0.10844769,0.0003975472,0.000071675146,0.000007790242,0.00022805636,0.87979794,0.0003646442,0.003457819,0.0034573264,0.00038215762],"about_ca_topic_score_codex":0.00077449385,"about_ca_topic_score_gemma":0.00002603329,"teacher_disagreement_score":0.98361695,"about_ca_system_score_codex":0.00021628867,"about_ca_system_score_gemma":0.00024032204,"threshold_uncertainty_score":0.8603862},"labels":[],"label_agreement":null},{"id":"W4413186177","doi":"10.55016/ojs/cdm.v5i2.62061","title":"Bounds and constructions for n-e.c. tournaments","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Mitacs","keywords":"Combinatorics; Mathematics","score_opus":0.013908649085259137,"score_gpt":0.33539140497317166,"score_spread":0.32148275588791253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186177","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.016542407,0.000012282621,0.9797177,0.0014562296,0.00058470434,0.0005444699,0.00013222719,0.00011133486,0.00089867564],"genre_scores_gemma":[0.13570014,0.000002464652,0.86382145,0.000090548114,0.00006242568,0.00015571217,0.0000068046425,0.0000071323234,0.00015331325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914247,0.000019082767,0.0002667889,0.00020697457,0.00012700832,0.00023765379],"domain_scores_gemma":[0.99877346,0.00016719506,0.0000971702,0.00052923145,0.00027195303,0.00016099916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005137231,0.000107062966,0.0001491823,0.0000967024,0.00038135832,0.00026230974,0.00038799486,0.00006999442,0.000009117151],"category_scores_gemma":[0.0013619403,0.00009914117,0.00004788697,0.00023200904,0.00009866905,0.00031572854,0.0001440524,0.000132497,0.000023496394],"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.0000012876158,0.000023730461,0.00002525916,0.000013745522,0.000010733883,1.6950935e-7,0.00031363135,0.0000028527718,0.005160377,0.98999685,0.0004294263,0.004021938],"study_design_scores_gemma":[0.0012952616,0.00023363503,0.0012354335,0.00006896413,0.00008011982,0.00023780085,0.0003054329,0.26581258,0.020579133,0.6305799,0.07891443,0.0006572957],"about_ca_topic_score_codex":0.0000016333826,"about_ca_topic_score_gemma":0.0000047907774,"teacher_disagreement_score":0.35941693,"about_ca_system_score_codex":0.000037050762,"about_ca_system_score_gemma":0.000055781755,"threshold_uncertainty_score":0.40428597},"labels":[],"label_agreement":null},{"id":"W4413311677","doi":"10.1145/3748355.3748368","title":"Kernel Extension DSLs Should Be Verifier-Safe!","year":2025,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Mitel (Canada)","funders":"","keywords":"Extension (predicate logic); Computer science; Kernel (algebra); Programming language; Operating system; Parallel computing; Mathematics; Discrete mathematics","score_opus":0.07147188544943618,"score_gpt":0.35349120735944484,"score_spread":0.28201932191000867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413311677","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.0025939688,0.00006609928,0.8941481,0.002814072,0.0010140609,0.00012383935,4.413658e-7,0.0002619552,0.09897747],"genre_scores_gemma":[0.08715215,0.00002264169,0.89712816,0.004389019,0.000029575427,0.00001622393,0.0000013497593,0.000005177435,0.011255668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988983,0.00008886676,0.00021627099,0.00037339333,0.00021577452,0.00020735215],"domain_scores_gemma":[0.99877596,0.000082797495,0.000045679502,0.0009491065,0.000096249925,0.000050197996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061413716,0.00010575487,0.00011893193,0.00011986713,0.00011009008,0.00010320657,0.00081277796,0.00008899505,0.00004512792],"category_scores_gemma":[0.00021096121,0.000091770686,0.000050237486,0.000545754,0.000040289648,0.00047075792,0.00030994372,0.00013213967,0.00010807948],"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.0000058698465,0.000034198118,0.00009375714,0.000011149625,0.0000063203297,0.0000022844977,0.000101569385,0.000039133036,0.0060230438,0.8836615,0.011637186,0.09838398],"study_design_scores_gemma":[0.0006046066,0.0001191638,0.024286516,0.00006984693,0.000015991214,0.00001547996,0.000082441235,0.42314944,0.19757009,0.052072775,0.3015051,0.0005085674],"about_ca_topic_score_codex":0.000034937933,"about_ca_topic_score_gemma":0.0000028286022,"teacher_disagreement_score":0.83158875,"about_ca_system_score_codex":0.000046764897,"about_ca_system_score_gemma":0.00006158733,"threshold_uncertainty_score":0.37423},"labels":[],"label_agreement":null},{"id":"W4413965736","doi":"10.70930/tac/02b4cd96","title":"On a Universal Property of the Algebra of Contracts","year":2024,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"American Society for Engineering Education; National Science Foundation","keywords":"Property (philosophy); Algebra over a field; Mathematics; Computer science; Pure mathematics; Philosophy; Epistemology","score_opus":0.01100094850310093,"score_gpt":0.2554886172477502,"score_spread":0.24448766874464925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413965736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048131246,0.00047302275,0.94222337,0.00027469816,0.00007578792,0.00035054015,0.000010183759,0.000041909298,0.008419249],"genre_scores_gemma":[0.9923759,0.000022127966,0.00729319,0.000014137683,0.000008065742,0.000022015382,5.235151e-7,0.0000025383147,0.00026150374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954647,0.00008787754,0.00013582643,0.00009860816,0.000085999316,0.0000452374],"domain_scores_gemma":[0.99921817,0.00026517664,0.000077426834,0.0003637479,0.00006329308,0.000012207283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005020525,0.000044045857,0.00007899372,0.000040778305,0.00004069423,0.000011224548,0.00035808762,0.000023972023,0.0000037258933],"category_scores_gemma":[0.000055553406,0.000024191664,0.000025859323,0.0002859188,0.00032198505,0.0001423167,0.00006444313,0.00005116376,0.0000012959306],"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.000014343842,0.0000220366,0.00000530809,0.000053747415,0.000008874042,3.025624e-8,0.00068839366,0.000012640659,0.0048201466,0.9585183,0.00001646455,0.03583969],"study_design_scores_gemma":[0.00005334377,0.000049149967,0.000399007,0.000032066153,0.000012650349,0.0000020790883,0.00017526362,0.00095500104,0.20222244,0.7931654,0.0028936353,0.000039968432],"about_ca_topic_score_codex":0.000006853146,"about_ca_topic_score_gemma":3.2832492e-7,"teacher_disagreement_score":0.9442446,"about_ca_system_score_codex":0.0000051659435,"about_ca_system_score_gemma":0.00005045478,"threshold_uncertainty_score":0.11863673},"labels":[],"label_agreement":null},{"id":"W4413972931","doi":"10.70930/tac/ktrjz7jo","title":"Differential Restriction Categories","year":2011,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Differential (mechanical device); Computer science; Physics","score_opus":0.024222460687633833,"score_gpt":0.2641853258140066,"score_spread":0.23996286512637277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413972931","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.027148077,0.00013050674,0.96430355,0.000017251346,0.000088652334,0.00017246102,0.000002660902,0.000106807,0.008030045],"genre_scores_gemma":[0.938039,0.00011135988,0.061496746,0.000011556524,0.000040177383,0.00013722882,0.0000044152307,0.000005092933,0.0001544034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929905,0.000107837295,0.00020192932,0.00018888389,0.00009485163,0.00010745444],"domain_scores_gemma":[0.99917656,0.00008396378,0.0001265238,0.00048216185,0.00009051919,0.000040288134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000344452,0.00008721719,0.00010819971,0.00008976483,0.00015886608,0.00002927965,0.00040730223,0.000050304607,0.00002583447],"category_scores_gemma":[0.000036307672,0.00007810165,0.000024562853,0.00030366465,0.00027306844,0.000409658,0.00010532501,0.000067485,0.000008868792],"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.000021386517,0.000037117567,0.000105961124,0.000015605445,0.000007480171,6.998225e-8,0.0011716357,4.4199723e-7,0.0011620661,0.9717407,0.000010613539,0.02572687],"study_design_scores_gemma":[0.00007939111,0.000049258124,0.0053245537,0.0000024175527,0.000013876614,0.000004767694,0.00033850697,0.00011852002,0.13299039,0.8597993,0.0011782733,0.000100696154],"about_ca_topic_score_codex":0.000022088352,"about_ca_topic_score_gemma":9.363985e-7,"teacher_disagreement_score":0.91089094,"about_ca_system_score_codex":0.0000074579743,"about_ca_system_score_gemma":0.00002358754,"threshold_uncertainty_score":0.31848928},"labels":[],"label_agreement":null},{"id":"W4414783286","doi":"10.1145/3769868","title":"The Complexity of Linear Temporal Verification for Continuous Counter Systems","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Formal Methods in Verification","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":"Université de Sherbrooke","funders":"","keywords":"Linear temporal logic; Temporal logic; Fragment (logic); Constant (computer programming); Computational complexity theory; Time complexity; Hybrid system; Linear logic","score_opus":0.08437898775922498,"score_gpt":0.3436640172484169,"score_spread":0.2592850294891919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414783286","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.00068085524,0.000088953806,0.99478126,0.0023669493,0.0010292636,0.000605603,0.000042657746,0.00009911075,0.00030533405],"genre_scores_gemma":[0.5465728,0.000006351252,0.45294473,0.00014835957,0.000016029446,0.00012265162,0.000017938555,0.0000040864115,0.00016704507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872506,0.00015427452,0.00044427312,0.0002716735,0.0002508501,0.00015389042],"domain_scores_gemma":[0.99774945,0.0009270685,0.00019436196,0.0006121709,0.0004897245,0.000027247315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067926827,0.00011685728,0.00016905938,0.00011881137,0.00051944406,0.00008844816,0.00090883754,0.000066493194,0.0000024641492],"category_scores_gemma":[0.00013258758,0.00009248945,0.0000994646,0.0004027657,0.00025732195,0.00019257028,0.000012852772,0.00012147665,0.000010018722],"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.000066219756,0.00012154272,0.000025323812,0.000043386695,0.00004509299,1.3715808e-7,0.000080785285,0.113896325,0.00007344703,0.8691935,0.00019199625,0.016262254],"study_design_scores_gemma":[0.00043195873,0.00016088784,0.0020838578,0.00003227884,0.000015608888,0.000004085791,0.00007300682,0.8059425,0.00068534294,0.18536758,0.0050953683,0.00010752446],"about_ca_topic_score_codex":0.000025663523,"about_ca_topic_score_gemma":0.000004098447,"teacher_disagreement_score":0.69204617,"about_ca_system_score_codex":0.000075418015,"about_ca_system_score_gemma":0.000118144155,"threshold_uncertainty_score":0.39951962},"labels":[],"label_agreement":null},{"id":"W4414978537","doi":"10.1145/3763128","title":"TraceLinking Implementations with Their Verified Designs","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"TRACE (psycholinguistics); Compiler; Correctness; Modular design; Tracing; Verifiable secret sharing; Debugging; Semantics (computer science); Implementation; Signature (topology)","score_opus":0.03409471806375904,"score_gpt":0.3255725245977236,"score_spread":0.2914778065339646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414978537","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75250316,0.00036383636,0.2262235,0.007727615,0.00044591457,0.0020436551,0.0000058153196,0.0008309893,0.0098555265],"genre_scores_gemma":[0.4699872,0.0000037063176,0.52969277,0.00013161192,0.000012340342,0.00006817364,4.7044455e-7,0.0000060550624,0.00009768044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99907434,0.000016470718,0.00021146609,0.00025854702,0.0002171847,0.00022198759],"domain_scores_gemma":[0.99893177,0.00010444511,0.00020818414,0.00056454015,0.00016678449,0.000024287827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058866927,0.00012780054,0.00012918022,0.000119977594,0.00020432558,0.00016541581,0.0024457984,0.000041035397,0.0000020047567],"category_scores_gemma":[0.000601781,0.00007866908,0.000056932393,0.0007817633,0.00007697198,0.00036746686,0.00043719474,0.00014995299,9.797958e-7],"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.00004448198,0.00013337845,0.0045926264,0.00016563313,0.000078757475,4.1907106e-7,0.0065607848,0.000020346539,0.034624573,0.53615355,0.00036096168,0.41726446],"study_design_scores_gemma":[0.0006954733,0.00037553534,0.010543552,0.00049220765,0.000053788906,0.000011597094,0.006930058,0.0011457215,0.95741844,0.015919758,0.0060989913,0.00031488002],"about_ca_topic_score_codex":0.000013278433,"about_ca_topic_score_gemma":0.0000025753923,"teacher_disagreement_score":0.92279387,"about_ca_system_score_codex":0.000039015602,"about_ca_system_score_gemma":0.000040106326,"threshold_uncertainty_score":0.45449424},"labels":[],"label_agreement":null},{"id":"W4415401143","doi":"10.1016/j.ic.2025.105368","title":"Finite-time safety and reach-avoid verification of stochastic discrete-time systems","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Software, Chinese Academy of Sciences; Canadian Anesthesiologists' Society","keywords":"Complement (music); Bounding overwatch; Upper and lower bounds; Set (abstract data type); Work (physics); Stochastic process","score_opus":0.009379646626617956,"score_gpt":0.2623910646279248,"score_spread":0.25301141800130683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415401143","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.0048846905,0.00009163579,0.9919647,0.00018737708,0.0001842433,0.00032937297,0.000009397089,0.00010806176,0.0022405498],"genre_scores_gemma":[0.92067367,0.000026940332,0.07887727,0.0001232374,0.000013774209,0.00002191588,0.00011631933,0.000004159646,0.00014271005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888736,0.00011067708,0.0005645099,0.00014200514,0.00019022165,0.00010523051],"domain_scores_gemma":[0.9990175,0.00019808159,0.00032692804,0.00021150867,0.00020455506,0.000041450698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006261023,0.0001074403,0.00016991136,0.0002735159,0.00013533521,0.00018400414,0.00016997258,0.00007427187,0.000001921213],"category_scores_gemma":[0.00019238605,0.00010684719,0.000020164965,0.0004022673,0.00006390894,0.0018349814,0.00008274496,0.00007520044,0.00003089291],"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.0001386964,0.000043232936,0.000078845456,0.00049667613,0.00004849774,1.680291e-7,0.0042395717,0.13383546,0.0010204866,0.45962664,0.0003073914,0.40016434],"study_design_scores_gemma":[0.000348786,0.000051039307,0.0044275457,0.000077514494,0.000009649749,0.0000043754776,0.00009080872,0.9925663,0.00015275594,0.0015794996,0.000592508,0.00009921218],"about_ca_topic_score_codex":0.000018023919,"about_ca_topic_score_gemma":1.4755788e-7,"teacher_disagreement_score":0.915789,"about_ca_system_score_codex":0.000041691546,"about_ca_system_score_gemma":0.000051216473,"threshold_uncertainty_score":0.4357102},"labels":[],"label_agreement":null},{"id":"W4415903173","doi":"10.24963/kr.2025/53","title":"Efficient Volume Computation for SMT Formulas","year":2025,"lang":"","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Satisfiability modulo theories; Computation; Volume (thermodynamics); Satisfiability; Context (archaeology); Automated reasoning; Set (abstract data type); Modulo; Software; Semiring","score_opus":0.03070991135187328,"score_gpt":0.3430744459743921,"score_spread":0.3123645346225188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415903173","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.002987418,0.00020578518,0.9710488,0.0015702733,0.00496073,0.0015777254,0.000008147939,0.00021336736,0.017427798],"genre_scores_gemma":[0.30003813,0.0000048313805,0.6915029,0.00054325856,0.00006582365,0.00008967389,0.0000057564794,0.000010230208,0.007739369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973256,0.00016485792,0.0007955556,0.0007951079,0.00034811095,0.0005707663],"domain_scores_gemma":[0.99800324,0.00028602005,0.00025423308,0.0007485832,0.0006023632,0.00010552965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016490981,0.00027997515,0.00031455336,0.00035762775,0.0004966155,0.00043440095,0.0009785269,0.00014951118,0.000039374554],"category_scores_gemma":[0.00043637477,0.00028949877,0.00021106057,0.0012431778,0.00012270591,0.0002789458,0.00036425889,0.00016589559,0.00015392773],"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.00004053544,0.00017881018,0.00006791248,0.000192696,0.000032087883,3.0139742e-7,0.00045127867,0.07675032,0.00018093469,0.5290186,0.003819243,0.38926727],"study_design_scores_gemma":[0.0007533088,0.0001803001,0.0021137048,0.00008361247,0.000037331236,0.000002154786,0.00006008961,0.96776366,0.003665185,0.010886801,0.014176897,0.00027693168],"about_ca_topic_score_codex":0.000027354245,"about_ca_topic_score_gemma":0.0000037921757,"teacher_disagreement_score":0.8910134,"about_ca_system_score_codex":0.0002741354,"about_ca_system_score_gemma":0.00032760255,"threshold_uncertainty_score":0.9999557},"labels":[],"label_agreement":null},{"id":"W4416099633","doi":"10.1007/978-3-032-10444-1_10","title":"A Rodin Plugin for Generating Proof Obligations for Invariant Preservation for ASTDs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Sherbrooke","funders":"","keywords":"Plug-in; Correctness; JSON; Invariant (physics); Process calculus; Guard (computer science); Liveness; State (computer science)","score_opus":0.05342179538499845,"score_gpt":0.31368442778404376,"score_spread":0.2602626323990453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416099633","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.000010712968,0.00012920654,0.99125713,0.0015329802,0.0020544208,0.0044734953,0.00007274074,0.00013299212,0.00033634325],"genre_scores_gemma":[0.0009060104,0.0000044050985,0.9953324,0.000975812,0.000616379,0.0011562833,0.00006581368,0.000030706393,0.0009121423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966067,0.000040346757,0.00076590915,0.00148565,0.00049505,0.00060630834],"domain_scores_gemma":[0.9956091,0.0016577775,0.00050111604,0.001197879,0.000941207,0.00009293323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026943726,0.00042259035,0.00046240436,0.00077924284,0.0006252856,0.00070548564,0.002673401,0.00035121085,0.0000017826897],"category_scores_gemma":[0.0018078935,0.00041796346,0.00019401048,0.0006347985,0.00022386666,0.0011939843,0.00056118343,0.0003061616,0.000001008296],"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.00001799143,0.000023197239,0.0000037746906,0.00025817103,0.000013194388,3.4038874e-7,0.00043522194,0.05565345,0.0007590605,0.48529503,0.00020115785,0.4573394],"study_design_scores_gemma":[0.00035452767,0.00023725236,0.000006888773,0.00024661302,0.000012419294,0.000002906402,1.3551131e-7,0.7135593,0.008497598,0.27168524,0.0050810366,0.00031604126],"about_ca_topic_score_codex":0.000008485015,"about_ca_topic_score_gemma":0.000054584052,"teacher_disagreement_score":0.6579059,"about_ca_system_score_codex":0.00037345965,"about_ca_system_score_gemma":0.0011121226,"threshold_uncertainty_score":0.9998272},"labels":[],"label_agreement":null},{"id":"W4416336086","doi":"10.18280/isi.300903","title":"A Mutation Analysis-Based Approach for Testing Coordination Mechanisms in Multi-Agent Systems: Application to Air Traffic Control Systems","year":2025,"lang":"","type":"article","venue":"Ingénierie des systèmes d information","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Air traffic control; Mutation; Control (management); Control system; Identification (biology)","score_opus":0.03211865122461743,"score_gpt":0.2888629261902687,"score_spread":0.2567442749656513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416336086","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.005807442,0.00029991168,0.97995555,0.00008736307,0.0014393507,0.011510905,0.00014395238,0.00043175602,0.00032377546],"genre_scores_gemma":[0.64544135,0.0000016520094,0.3481519,0.00017967579,0.00003598034,0.0057424014,0.0003849673,0.000021043272,0.000041016425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99290514,0.0009495547,0.0034340667,0.0009401951,0.0008600536,0.0009109847],"domain_scores_gemma":[0.99321085,0.0006674196,0.0021069623,0.001166324,0.0026274784,0.00022098045],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0067670117,0.000685782,0.0011301306,0.0044353832,0.00078188314,0.0015151877,0.0011642316,0.000562628,8.2712074e-7],"category_scores_gemma":[0.002332416,0.0007849861,0.000293004,0.010457766,0.00011951479,0.004622659,0.000111557245,0.00033308312,0.000028223942],"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.00015018681,0.00021372864,0.00020457337,0.003040907,0.00023472217,5.5444156e-7,0.002886252,0.882331,0.00031489166,0.045911334,0.000023333583,0.064688504],"study_design_scores_gemma":[0.0028464836,0.00032610743,0.003604401,0.00065660896,0.0005037967,0.000007747736,0.0022449763,0.9882938,0.0003918363,0.00026873252,0.00018664854,0.0006688614],"about_ca_topic_score_codex":0.00051172543,"about_ca_topic_score_gemma":0.000027782706,"teacher_disagreement_score":0.63963395,"about_ca_system_score_codex":0.0032636407,"about_ca_system_score_gemma":0.00066648267,"threshold_uncertainty_score":0.9995213},"labels":[],"label_agreement":null},{"id":"W4416510022","doi":"10.1016/j.jsc.2025.102527","title":"Efficient detection of redundancies in systems of linear inequalities","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Formal Methods in Verification","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":"Western University","funders":"Mitacs; National Natural Science Foundation of China","keywords":"Redundancy (engineering); Linear inequality; Gaussian; Linear system; Software; Gaussian elimination","score_opus":0.02511455571546124,"score_gpt":0.318067309482351,"score_spread":0.2929527537668898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416510022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47180012,0.00022160084,0.52727085,0.000024364235,0.0005370665,0.000058549256,3.6121682e-7,0.000005128723,0.000081956576],"genre_scores_gemma":[0.9348333,0.0000112050575,0.06510268,0.0000064116043,0.000030552466,0.0000016392408,1.9712496e-7,0.000002398712,0.0000116132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838763,0.00022127853,0.00093358423,0.00008132084,0.00029308334,0.000083076266],"domain_scores_gemma":[0.9983103,0.0001754245,0.0008495187,0.00012915285,0.00051679945,0.000018767769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014683836,0.00006491632,0.00026608573,0.0006615845,0.000025734982,0.000019134784,0.00025407484,0.000047313333,2.5451706e-7],"category_scores_gemma":[0.00026168243,0.000060238504,0.000060092454,0.0007941868,0.000042302683,0.00015786439,0.00004453434,0.00011369645,3.57197e-7],"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.000057510046,0.00015260573,0.00087178685,0.0004245219,0.00003031342,0.0000014879402,0.00545433,0.8854925,0.03009802,0.043942515,0.000010295594,0.033464096],"study_design_scores_gemma":[0.00038951833,0.00017207486,0.029310374,0.00040600565,0.000009195471,0.000017635877,0.00065381546,0.9318258,0.035425734,0.0017040201,0.000031773856,0.00005403361],"about_ca_topic_score_codex":0.00006576915,"about_ca_topic_score_gemma":0.000002130497,"teacher_disagreement_score":0.46303317,"about_ca_system_score_codex":0.000092569186,"about_ca_system_score_gemma":0.00012654312,"threshold_uncertainty_score":0.2456455},"labels":[],"label_agreement":null},{"id":"W4416684846","doi":"10.1007/978-3-032-12086-1_2","title":"A Modular Orthogonal Integration of Operational and Prescriptive Timing Requirements Using TASTD","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Sherbrooke","funders":"Agence Nationale de la Recherche","keywords":"Modular design; Process (computing); Formal specification; Unified Modeling Language; Scheme (mathematics); System requirements specification; Formal methods; Software requirements specification","score_opus":0.06379155558351089,"score_gpt":0.3194676322387537,"score_spread":0.2556760766552428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416684846","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.0007859229,0.00021428098,0.9967601,0.00008157525,0.0008492786,0.00035112796,0.000007897593,0.000033579858,0.0009162414],"genre_scores_gemma":[0.061379716,0.00001485717,0.9381623,0.00023071306,0.000086421394,0.00000543401,0.000006095561,0.00000908805,0.000105329964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975278,0.000062715844,0.00052503124,0.0008950737,0.00072944415,0.0002599741],"domain_scores_gemma":[0.9984322,0.00015202744,0.00030893044,0.000635113,0.0004103876,0.000061336636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010615189,0.00028805353,0.00033055898,0.00069051253,0.00018543843,0.00023710413,0.0011621501,0.00018506664,0.0000056814333],"category_scores_gemma":[0.00021692175,0.0002753647,0.000054680124,0.0004359335,0.0004878654,0.0010434358,0.00086150534,0.00037246512,9.202251e-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.000013220425,0.000029095221,0.00007530371,0.00007949013,0.00002022836,0.000007440514,0.0012494951,0.044967398,0.014228315,0.30050862,0.000003417044,0.63881797],"study_design_scores_gemma":[0.00012598564,0.00007959608,0.00029262636,0.0005580829,0.000008664556,0.000017334822,3.0213516e-7,0.94312936,0.008601647,0.04689885,0.000059308073,0.00022825428],"about_ca_topic_score_codex":0.000021276683,"about_ca_topic_score_gemma":0.000010474565,"teacher_disagreement_score":0.89816195,"about_ca_system_score_codex":0.00023854323,"about_ca_system_score_gemma":0.00053418684,"threshold_uncertainty_score":0.99996984},"labels":[],"label_agreement":null},{"id":"W4416780431","doi":"10.48550/arxiv.2511.21621","title":"Two behavioural pseudometrics for continuous-time Markov processes","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données; UK Research and Innovation","keywords":"Markov chain; Markov process; Equivalence (formal languages); Metric (unit); Bisimulation; Markov renewal process; Markov model","score_opus":0.08630296180542839,"score_gpt":0.347369726635171,"score_spread":0.2610667648297426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416780431","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.25186613,0.0013166779,0.7313156,0.0007187811,0.0069762785,0.0037242817,0.00028405184,0.0005054076,0.0032927901],"genre_scores_gemma":[0.21279305,0.00052814366,0.76766545,0.00052118517,0.0006008506,0.0013417859,0.00014349661,0.00008596855,0.016320065],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9921293,0.0005563847,0.0020680393,0.0028005114,0.0009810652,0.0014646514],"domain_scores_gemma":[0.98980266,0.0018117267,0.0017611345,0.0032751989,0.002972127,0.00037714318],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0037363486,0.0011662066,0.0015289956,0.0013107653,0.0007243927,0.00080948195,0.0058229635,0.00087028916,0.00013634507],"category_scores_gemma":[0.0076701213,0.001283807,0.0006233433,0.0040944903,0.00042288075,0.0012468161,0.0035936025,0.0014283456,0.0003644781],"study_design_candidate":"observational","study_design_consensus":"observational","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.0006094057,0.0021441923,0.69663084,0.007730135,0.00069720746,0.000041822022,0.003200867,0.0007028247,0.0019054239,0.014560335,0.0038429715,0.267934],"study_design_scores_gemma":[0.01107302,0.0030732513,0.4748223,0.0058480757,0.0027589346,0.00020399617,0.0005393059,0.30916536,0.12032762,0.009366913,0.052206654,0.010614575],"about_ca_topic_score_codex":0.00016897227,"about_ca_topic_score_gemma":0.000010223687,"teacher_disagreement_score":0.30846253,"about_ca_system_score_codex":0.0005233579,"about_ca_system_score_gemma":0.0020309372,"threshold_uncertainty_score":0.999556},"labels":[],"label_agreement":null},{"id":"W4417250731","doi":"10.1109/models-c68889.2025.00020","title":"DTChecker: A Real-Time Signal Monitoring and Property Specification Tool for Digital Twins","year":2025,"lang":"","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Temporal logic; Robustness (evolution); Linear temporal logic; Specification language; Formal specification; Interval temporal logic; Computation tree logic; Domain (mathematical analysis)","score_opus":0.042390725741259024,"score_gpt":0.30662682144585685,"score_spread":0.26423609570459783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417250731","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.023409935,0.00014919545,0.95137036,0.0007404937,0.000988145,0.0016686154,0.000017335884,0.00022897236,0.021426935],"genre_scores_gemma":[0.2591919,0.00021714519,0.7132089,0.00003564984,0.00034820437,0.00019431452,0.0000074987784,0.00002233944,0.026774045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734664,0.0001035709,0.0007538147,0.00097240775,0.00032855856,0.0004949989],"domain_scores_gemma":[0.99813247,0.00025769105,0.00021893244,0.00088817,0.0003874902,0.00011525504],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010340326,0.00032231145,0.00032891546,0.00021320657,0.0003935292,0.0014764392,0.0007937039,0.0001923451,0.000032554442],"category_scores_gemma":[0.000296181,0.00025605434,0.00011557425,0.00070509553,0.00017333878,0.0023879046,0.00039702418,0.00017684947,0.00006902248],"study_design_candidate":"design_other","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.00014847756,0.00022400159,0.00224228,0.0002540171,0.00006662119,0.0000011036738,0.0010093553,0.000037383696,0.0370102,0.06519965,0.0011112451,0.89269567],"study_design_scores_gemma":[0.0012553264,0.0005532483,0.021543061,0.00043266252,0.00007570695,0.000014414145,0.00023945539,0.8067913,0.13540776,0.0059274854,0.026878934,0.00088065665],"about_ca_topic_score_codex":0.00002571781,"about_ca_topic_score_gemma":2.3578252e-7,"teacher_disagreement_score":0.891815,"about_ca_system_score_codex":0.00020965436,"about_ca_system_score_gemma":0.00026902792,"threshold_uncertainty_score":0.99998915},"labels":[],"label_agreement":null},{"id":"W45766481","doi":"","title":"Efficient ADD operations for point-based algorithms","year":2008,"lang":"en","type":"article","venue":"International Conference on Automated Planning and Scheduling","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":34,"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 Waterloo","funders":"","keywords":"Computer science; Scalability; Representation (politics); Locality; Point (geometry); Reachability; Algorithm; Set (abstract data type); State (computer science); Set operations; State space; Current (fluid); Theoretical computer science; Backup; Mathematical optimization; Mathematics","score_opus":0.10068697586323345,"score_gpt":0.36205347605977206,"score_spread":0.2613665001965386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45766481","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.13191186,0.000026909333,0.8648109,0.0006391821,0.0005692799,0.00015337812,0.000016635642,0.0005951311,0.0012767109],"genre_scores_gemma":[0.5384413,0.000001591116,0.4612396,0.00018363746,0.000033439894,0.000032315562,0.00002180008,0.0000049148266,0.000041377065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989168,0.000051507133,0.00024776132,0.00033639508,0.00026806002,0.00017945211],"domain_scores_gemma":[0.99923563,0.00013027807,0.0000755695,0.00019442015,0.00029037555,0.00007371644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037895076,0.00013077792,0.00011885314,0.00019472819,0.00032116918,0.00018477837,0.0004288948,0.00007034414,0.000014966396],"category_scores_gemma":[0.00026749456,0.00012574159,0.00003857649,0.00012851505,0.00005344624,0.0001502658,0.000045586658,0.00013535538,0.000015229216],"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.000046934405,0.00010395877,0.000292803,0.000013299406,0.000035072837,0.0000177155,0.0012984023,0.69974834,0.0032112263,0.29097888,0.00015581932,0.004097558],"study_design_scores_gemma":[0.00044873488,0.00008863267,0.0011172504,0.00009851054,0.0000026811304,0.00003159655,0.00006989132,0.9948984,0.002813167,0.00019262821,0.0000878847,0.00015065659],"about_ca_topic_score_codex":0.000009569053,"about_ca_topic_score_gemma":3.9607562e-7,"teacher_disagreement_score":0.40652946,"about_ca_system_score_codex":0.00004251767,"about_ca_system_score_gemma":0.00012183079,"threshold_uncertainty_score":0.5127593},"labels":[],"label_agreement":null},{"id":"W48429505","doi":"10.1007/978-0-387-68276-1_4","title":"Equivalent Conditions for Majorization","year":2010,"lang":"en","type":"book-chapter","venue":"Springer series in statistics","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"Majorization; Order (exchange); Mathematics; Computer science; Operations research; Combinatorics; Business","score_opus":0.03853287789627583,"score_gpt":0.3187533888830987,"score_spread":0.2802205109868228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48429505","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.000003885579,0.000042811185,0.9485023,0.00007772832,0.0025298845,0.00051260606,0.00074895646,0.00008537992,0.04749646],"genre_scores_gemma":[0.00012462588,0.00011764555,0.9347472,0.000060604536,0.00016621823,0.00009347666,0.00019609169,0.000045395656,0.06444875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985671,0.00001837717,0.00047536858,0.00042781455,0.00026051994,0.00025083148],"domain_scores_gemma":[0.9984532,0.00017061718,0.00030691968,0.0007646833,0.0002415667,0.000063038606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033318458,0.00025008072,0.00026664705,0.00020428657,0.00012717406,0.00011948787,0.0006628539,0.0003057824,0.00010254277],"category_scores_gemma":[0.00026147938,0.0002925907,0.000049922204,0.000055440778,0.00017726126,0.0002624971,0.00021845833,0.0003945888,0.000048218397],"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.00000684082,0.000009271265,0.000005726833,0.000100137855,0.000010368496,0.0000049872765,0.00013746429,0.000016126609,0.00024843306,0.9908828,0.00037560443,0.008202248],"study_design_scores_gemma":[0.00017595664,0.00010641982,0.00018436724,0.000077244236,0.00002009986,0.000009021479,0.00000422107,0.0039262637,0.00078034104,0.69869965,0.29563537,0.00038102403],"about_ca_topic_score_codex":0.0000032396158,"about_ca_topic_score_gemma":0.00004401926,"teacher_disagreement_score":0.29525977,"about_ca_system_score_codex":0.00011488345,"about_ca_system_score_gemma":0.00012659658,"threshold_uncertainty_score":0.9999526},"labels":[],"label_agreement":null},{"id":"W49053417","doi":"","title":"Modelling an Aircraft Landing System in Event-B (Full Report)","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Correctness; Avionics; Computer science; Benchmark (surveying); Formal methods; Reliability engineering; Process (computing); Event (particle physics); Formal verification; Reliability (semiconductor); Software; Life-critical system; Complex system; Software system; Software engineering; Systems engineering; Programming language; Engineering","score_opus":0.11294812086271147,"score_gpt":0.23058086635983058,"score_spread":0.1176327454971191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49053417","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.18008696,0.000015891052,0.8174438,0.0000069927405,0.00084616255,0.0002405075,0.0000024838926,0.000327135,0.0010300702],"genre_scores_gemma":[0.78514105,0.000011151058,0.21454227,0.000009878361,0.00007697811,0.0000017342011,0.000014750031,0.000016805816,0.00018537002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972544,0.00045222198,0.000491698,0.001296775,0.00013550078,0.00036945828],"domain_scores_gemma":[0.9970991,0.000061435945,0.000551059,0.0020014853,0.00012866262,0.00015823587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017731871,0.00028810505,0.00039281926,0.00044344083,0.00012043811,0.00013777733,0.0018754723,0.00035427636,0.0000028019451],"category_scores_gemma":[0.00004168421,0.00035102127,0.00013605753,0.0005397189,0.00004593625,0.0006984029,0.0010435543,0.0006521768,0.000039944276],"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.000009301506,0.000030769457,0.0011446262,0.00012270143,0.00001042723,0.0004718886,0.00014561458,0.862489,0.00001317797,0.1350593,0.0000043017913,0.0004988819],"study_design_scores_gemma":[0.00019436584,0.000034458757,0.00011662491,0.0002158726,0.00001935946,0.00005438022,0.00008707181,0.9915972,0.000066689456,0.0071283896,0.00011960147,0.00036598864],"about_ca_topic_score_codex":0.00034021423,"about_ca_topic_score_gemma":0.000025814134,"teacher_disagreement_score":0.6050541,"about_ca_system_score_codex":0.00058147527,"about_ca_system_score_gemma":0.00012569636,"threshold_uncertainty_score":0.9998942},"labels":[],"label_agreement":null},{"id":"W51776367","doi":"","title":"Timed test generation based on timed temporal logic","year":2010,"lang":"en","type":"article","venue":"International Conference on Information and Automation","topic":"Formal Methods in Verification","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":"Bishop's University","funders":"","keywords":"Temporal logic; Computer science; Interval temporal logic; Linear temporal logic; Temporal logic of actions; Computation tree logic; Process (computing); Logic analyzer; Algorithm; Programming language","score_opus":0.04492357170955044,"score_gpt":0.31101389722234485,"score_spread":0.26609032551279443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W51776367","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.02365832,9.831433e-7,0.9106024,0.0064672707,0.0019393286,0.00041831742,0.000027451353,0.0004881872,0.056397736],"genre_scores_gemma":[0.8610581,0.00000382568,0.13652037,0.0018781878,0.00009820749,0.000055176504,0.00026822643,0.0000045271363,0.0001133857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998611,0.000053831664,0.00044165878,0.00020641275,0.00054701883,0.00014013401],"domain_scores_gemma":[0.9987798,0.000090691334,0.00033235218,0.00032791155,0.0003908225,0.000078472534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005678724,0.00016147892,0.00010444479,0.00039302316,0.00015900066,0.0006160241,0.00045882218,0.00012587456,0.00024631058],"category_scores_gemma":[0.00053945434,0.00014777057,0.000035116645,0.0001910033,0.000050773346,0.00255234,0.000046501213,0.00024721632,0.00043980705],"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.000017605129,0.00008465288,0.00028845263,0.000010092639,0.000005849281,5.356023e-7,0.00035413262,0.0006435804,0.006426881,0.8643536,0.0008189782,0.12699565],"study_design_scores_gemma":[0.00044045274,0.00014339897,0.007950204,0.000020160753,0.0000019546917,0.000006053698,0.00001587699,0.9794307,0.005744783,0.0025828192,0.0034972953,0.00016633217],"about_ca_topic_score_codex":0.000011222694,"about_ca_topic_score_gemma":0.000004947268,"teacher_disagreement_score":0.97878706,"about_ca_system_score_codex":0.000058508544,"about_ca_system_score_gemma":0.000103599385,"threshold_uncertainty_score":0.6025909},"labels":[],"label_agreement":null},{"id":"W54721420","doi":"10.1007/978-3-642-33314-9_17","title":"Relation Algebras, Matrices, and Multi-valued Decision Diagrams","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Relation (database); Algebra over a field; Representation (politics); Matrix (chemical analysis); Matrix representation; Relation algebra; Matrix algebra; Computer science; Logical matrix; Theoretical computer science; Pure mathematics; Mathematics; Algebra representation; Data mining; Cellular algebra; Group (periodic table)","score_opus":0.030991108865879934,"score_gpt":0.289139860361894,"score_spread":0.2581487514960141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54721420","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.00027234224,0.003120825,0.99292433,0.00008113228,0.002537123,0.00046233015,0.0000019307072,0.00018266002,0.0004173383],"genre_scores_gemma":[0.01728888,0.00039694385,0.9815868,0.0003170252,0.000289535,0.000009386639,0.000004817915,0.000030060679,0.00007653814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964273,0.00007797974,0.0006019195,0.0013116562,0.0009836276,0.0005975457],"domain_scores_gemma":[0.99730384,0.00045847852,0.0004212077,0.0013932167,0.00019533759,0.000227892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022178688,0.00046915925,0.0004216113,0.00081734563,0.0002982034,0.00051358336,0.0021407062,0.0004600877,0.000011743325],"category_scores_gemma":[0.00032832962,0.00042443816,0.00008226838,0.0006881568,0.0005200938,0.0015949805,0.0012688106,0.00074660196,0.00006717485],"study_design_candidate":"design_other","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.000004279948,0.00001976894,0.00024871746,0.00002127765,0.0000038983007,0.0000061970245,0.0004439552,0.0012466374,0.000052326268,0.087881364,0.0000059090953,0.91006565],"study_design_scores_gemma":[0.00030774463,0.00009383926,0.0047994927,0.0002882617,0.000011982282,0.00008044018,1.0662874e-7,0.8770686,0.00055183884,0.11526041,0.0009258835,0.00061139907],"about_ca_topic_score_codex":0.000015708942,"about_ca_topic_score_gemma":0.000019340805,"teacher_disagreement_score":0.9094543,"about_ca_system_score_codex":0.00028840458,"about_ca_system_score_gemma":0.0001747143,"threshold_uncertainty_score":0.99982077},"labels":[],"label_agreement":null},{"id":"W59043292","doi":"10.1007/978-3-642-31612-8_4","title":"Off the Trail: Re-examining the CDCL Algorithm","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Toronto","funders":"","keywords":"DPLL algorithm; Backtracking; Computer science; Extension (predicate logic); Local search (optimization); Search algorithm; Boolean satisfiability problem; Algorithm; Theoretical computer science; Programming language","score_opus":0.04865092424620726,"score_gpt":0.2868546918142298,"score_spread":0.23820376756802253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59043292","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.000014453849,0.0019049604,0.9864902,0.0015473614,0.0036141996,0.00051266287,0.000003544997,0.00016823235,0.0057443883],"genre_scores_gemma":[0.010193299,0.00012958795,0.9851314,0.0028556264,0.0012029083,0.000025537964,0.0000022508073,0.000040019288,0.00041937522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585605,0.00018325573,0.0005897633,0.0011730111,0.0013442277,0.0008536811],"domain_scores_gemma":[0.9950582,0.0012383729,0.0004492678,0.002906151,0.00021088046,0.00013717347],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0047137965,0.00052266876,0.0003940455,0.00034316993,0.0007404936,0.0007655212,0.007983401,0.00031050888,0.000032445725],"category_scores_gemma":[0.00023707715,0.00030605472,0.00013052467,0.0008413478,0.0015049803,0.0009277414,0.0017928962,0.0014403171,0.00009397133],"study_design_candidate":"design_other","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.0000011866094,0.000009208708,0.0000076180963,0.0000068344416,0.0000071283557,0.00000559845,0.0019475658,0.0017048332,0.00002736664,0.029088607,0.000036008896,0.967158],"study_design_scores_gemma":[0.00015983079,0.0001473863,0.00083341834,0.00019601044,0.000019599915,0.00016459824,0.000001791495,0.8806846,0.0011934752,0.080407314,0.035448268,0.000743683],"about_ca_topic_score_codex":0.000015241343,"about_ca_topic_score_gemma":0.000018420407,"teacher_disagreement_score":0.96641433,"about_ca_system_score_codex":0.0002462391,"about_ca_system_score_gemma":0.00034879075,"threshold_uncertainty_score":0.99993914},"labels":[],"label_agreement":null},{"id":"W597267286","doi":"","title":"Timed Automata for the Development of Real-Time Systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Automaton; Computer science; Formalism (music); Timed automaton; Theoretical computer science","score_opus":0.09531220217764919,"score_gpt":0.3012645223682212,"score_spread":0.20595232019057202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W597267286","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.0012067598,0.0000098405535,0.97411716,0.000019461853,0.00024360808,0.0003096125,4.996378e-7,0.00011835176,0.023974713],"genre_scores_gemma":[0.022044834,0.0000015642783,0.97661537,0.00000842431,0.000009305029,0.00006991962,5.337544e-7,0.000003474734,0.0012465535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993895,0.0000358623,0.0002308297,0.00011767268,0.000121993595,0.0001040995],"domain_scores_gemma":[0.99919385,0.00011015317,0.00009773065,0.00050316844,0.00007414923,0.000020965965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010352759,0.00004906966,0.00007548854,0.000027805623,0.000065329994,0.00001840855,0.00077638315,0.000024777459,0.0000151705],"category_scores_gemma":[0.000044789194,0.000029702333,0.000019678228,0.00010949952,0.000021702714,0.00015289093,0.000101463265,0.000017438311,0.000057821715],"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.000016995271,0.000084455234,0.0000462022,0.00008331848,0.00005302267,1.6209498e-7,0.008163406,0.000020100237,0.008244514,0.8412739,0.00215359,0.13986032],"study_design_scores_gemma":[0.00018046505,0.000057462017,0.006234582,0.000018003238,0.0000059535973,0.0000032630423,0.0000903342,0.89320785,0.09451344,0.0006867318,0.004883976,0.000117916214],"about_ca_topic_score_codex":0.000027085445,"about_ca_topic_score_gemma":8.529015e-7,"teacher_disagreement_score":0.89318776,"about_ca_system_score_codex":0.000017364617,"about_ca_system_score_gemma":0.000062699684,"threshold_uncertainty_score":0.1442726},"labels":[],"label_agreement":null},{"id":"W66604613","doi":"10.1007/978-3-642-35632-2_14","title":"BabelTrace: A Collection of Transducers for Trace Validation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université du Québec à Chicoutimi","funders":"","keywords":"TRACE (psycholinguistics); Computer science; Set (abstract data type); Variety (cybernetics); Process (computing); Formal specification; Software; Formal methods; Software engineering; Programming language; Artificial intelligence","score_opus":0.03085186621804042,"score_gpt":0.2848132706717848,"score_spread":0.2539614044537444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66604613","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.00022536519,0.00017475584,0.9946901,0.0003521081,0.001816931,0.001171433,0.000006552448,0.00010488157,0.0014578236],"genre_scores_gemma":[0.031646114,0.000036675443,0.96751225,0.00012197334,0.00016096717,0.00006081232,0.0000054682237,0.000027728216,0.0004280071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707276,0.000053709562,0.00066547876,0.0010571444,0.00072956074,0.00042133767],"domain_scores_gemma":[0.9973718,0.0005064999,0.0005069155,0.0010082126,0.00050886074,0.00009771806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015076415,0.00036174036,0.00046294878,0.000813333,0.00019257484,0.00021148536,0.0019919658,0.00034895825,0.000023706436],"category_scores_gemma":[0.00020241947,0.00035657617,0.00015957865,0.0007649011,0.00044078552,0.0009902786,0.00015682139,0.00038907517,0.000013100519],"study_design_candidate":"design_other","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.000018196044,0.000043222863,0.000008732173,0.00015893705,0.000014781197,0.0000012443157,0.0015393608,0.024397133,0.0037194642,0.070843145,0.000054352065,0.89920145],"study_design_scores_gemma":[0.00038859298,0.00041223658,0.00012612596,0.00023331816,0.00001599266,0.000024316572,3.225745e-7,0.7951383,0.07699592,0.12481367,0.0013468823,0.0005043162],"about_ca_topic_score_codex":0.000020595244,"about_ca_topic_score_gemma":0.000010131215,"teacher_disagreement_score":0.89869714,"about_ca_system_score_codex":0.0003164961,"about_ca_system_score_gemma":0.00047662517,"threshold_uncertainty_score":0.9998886},"labels":[],"label_agreement":null},{"id":"W6891653032","doi":"10.4230/lipics.sat.2025.18","title":"Towards Practical First-Order Model Counting","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","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":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Inference; Scalability; Domain (mathematical analysis); Code (set theory); Function (biology); State (computer science); Scale (ratio)","score_opus":0.03395770335754854,"score_gpt":0.34158758421404917,"score_spread":0.3076298808565006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891653032","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.0035666234,0.000027546821,0.96405405,0.0019777748,0.0013293624,0.00090658927,0.000064134496,0.00039044753,0.027683483],"genre_scores_gemma":[0.059716918,0.000030450901,0.9365275,0.0026960433,0.00007585251,0.00020211436,0.00006771593,0.00002778122,0.0006556373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968224,0.000054951834,0.0012601973,0.0003940914,0.0006343763,0.0008339497],"domain_scores_gemma":[0.9971504,0.00022956036,0.0004724589,0.0012954391,0.00069151906,0.00016057368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016171572,0.0003953605,0.00043428768,0.00036515197,0.0005690097,0.0007463239,0.0015873085,0.0003104881,0.000013679911],"category_scores_gemma":[0.0010563588,0.00037347287,0.00020216193,0.00086875254,0.00013920947,0.0037936908,0.0008329902,0.0005763958,0.000115887124],"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.00010240765,0.00041288201,0.00095393305,0.0009952012,0.00017713521,0.0000034439138,0.0063505727,0.004439036,0.00005222932,0.93755877,0.016135678,0.032818682],"study_design_scores_gemma":[0.0010890231,0.00006971286,0.00021679587,0.00011686794,0.000029154797,0.000024453824,0.0002492822,0.9154094,0.0009066035,0.0069711762,0.0745462,0.0003713402],"about_ca_topic_score_codex":0.000014718694,"about_ca_topic_score_gemma":0.000008696408,"teacher_disagreement_score":0.93058765,"about_ca_system_score_codex":0.00025490377,"about_ca_system_score_gemma":0.0004171454,"threshold_uncertainty_score":0.99987173},"labels":[],"label_agreement":null},{"id":"W6891699754","doi":"10.4230/lipics.sat.2024.27","title":"Revisiting SATZilla Features in 2024","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","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 British Columbia","funders":"","keywords":"Satisfiability; Preprocessor; Feature selection; Benchmark (surveying); Feature (linguistics); Boolean satisfiability problem; Ranging; Software","score_opus":0.01815246545251966,"score_gpt":0.3067046303418024,"score_spread":0.28855216488928276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891699754","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.029624011,0.0013894697,0.92034054,0.001440623,0.0062074163,0.0017055019,0.00018446463,0.0010071475,0.038100824],"genre_scores_gemma":[0.281825,0.00019004803,0.713791,0.0013083693,0.00059820944,0.00024096381,0.00014439881,0.00007752216,0.0018244468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971529,0.00007821296,0.0011211078,0.00040071981,0.0005060698,0.0007409505],"domain_scores_gemma":[0.9983585,0.00024462782,0.00020701032,0.0009056254,0.00013867913,0.00014554286],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017457459,0.00035708668,0.00037611715,0.00058216025,0.00018518548,0.0011538821,0.0013623455,0.00023690223,0.000027710712],"category_scores_gemma":[0.00028852155,0.00032057974,0.00021953431,0.0010103645,0.00007791682,0.0029255764,0.00046766072,0.0006909779,0.00028516317],"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.000044733068,0.000095656425,0.0016338892,0.0022400091,0.00010976231,0.000037642058,0.016868332,0.0003315362,0.00023825295,0.63296074,0.012263698,0.33317578],"study_design_scores_gemma":[0.001343747,0.0001976355,0.0038271148,0.0015805024,0.00003295739,0.00030787202,0.0011188685,0.55560714,0.003251901,0.0078775445,0.42373368,0.0011210053],"about_ca_topic_score_codex":0.000015531457,"about_ca_topic_score_gemma":0.000006845614,"teacher_disagreement_score":0.6250832,"about_ca_system_score_codex":0.0002405975,"about_ca_system_score_gemma":0.00010673856,"threshold_uncertainty_score":0.9999246},"labels":[],"label_agreement":null},{"id":"W6891771343","doi":"10.48550/arxiv.1504.03014","title":"Proceedings 6th Workshop on Formal Methods and Analysis in SPL Engineering","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Formal methods; Event (particle physics); State (computer science); Formal specification; Extension (predicate logic); Formal verification","score_opus":0.10975640529015407,"score_gpt":0.26290502163340335,"score_spread":0.15314861634324928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891771343","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.22404121,0.000034897013,0.774073,0.000017152322,0.00019964438,0.00016876913,0.0000019286779,0.00012940004,0.0013339655],"genre_scores_gemma":[0.58086056,0.000049154172,0.41889614,0.000018841927,0.000023100289,0.0000015507374,0.0000032462037,0.0000094681045,0.00013792468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982539,0.000098593955,0.0002618618,0.0009268871,0.00010259224,0.00035617754],"domain_scores_gemma":[0.9987317,0.0000949832,0.00022531115,0.0006366563,0.0001439151,0.00016746175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019686841,0.00027743803,0.00041848613,0.0011347642,0.000053717682,0.00014696717,0.0011440798,0.00029605345,0.0000031515713],"category_scores_gemma":[0.0002580825,0.000320311,0.00012924611,0.002254575,0.00004675103,0.0008055821,0.0015070011,0.0007065388,0.000005956356],"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.000041051848,0.00005780942,0.009197463,0.00011201294,0.00018012653,0.00003561218,0.0008296373,0.59974,0.0000342211,0.38270932,0.000021058244,0.0070416452],"study_design_scores_gemma":[0.000196652,0.000028109254,0.007503246,0.00005937003,0.000119974575,0.0000018425729,0.000068257956,0.9865096,0.00016901737,0.00486175,0.00015592342,0.00032623883],"about_ca_topic_score_codex":0.000030701773,"about_ca_topic_score_gemma":0.0000065967283,"teacher_disagreement_score":0.38676956,"about_ca_system_score_codex":0.00030774044,"about_ca_system_score_gemma":0.000060217397,"threshold_uncertainty_score":0.9999249},"labels":[],"label_agreement":null},{"id":"W6891894453","doi":"10.48550/arxiv.1305.6110","title":"On a New Notion of Partial Refinement","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Partial function; Partial evaluation; Refinement calculus; State (computer science); Refinement; Implementation; Software; Formal specification; Partial order reduction","score_opus":0.12713707888008846,"score_gpt":0.22227092632198864,"score_spread":0.09513384744190018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891894453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14628717,0.000007983593,0.8489035,0.00006705627,0.00068463705,0.00023044256,0.000002312985,0.0000946746,0.0037222528],"genre_scores_gemma":[0.91327244,0.000024770034,0.08520006,0.00005148522,0.000057623056,0.0000010221951,0.000005737486,0.000007767451,0.0013790869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998686,0.00013998064,0.00024592882,0.00063190446,0.00011120252,0.00018495848],"domain_scores_gemma":[0.9980973,0.000049209986,0.0003841292,0.0012477161,0.000113707116,0.000107914406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028565852,0.00017871273,0.0002155126,0.0001916656,0.0000462823,0.000040712373,0.0012294851,0.00018972077,0.000066334316],"category_scores_gemma":[0.00007586101,0.00019930414,0.00012300762,0.0003174675,0.00004993915,0.00024838658,0.0008480183,0.00030571123,0.00018563088],"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.000022043849,0.000074655196,0.00014869584,0.0000434035,0.000021910306,0.000006552189,0.000115055205,0.086016044,0.00009412393,0.90788364,0.00049694785,0.0050769034],"study_design_scores_gemma":[0.0004586834,0.00020945292,0.0022609793,0.000116216506,0.000039788945,8.3909725e-7,0.000013831081,0.8725663,0.0042189127,0.11876691,0.0009908534,0.0003572586],"about_ca_topic_score_codex":0.00028527883,"about_ca_topic_score_gemma":0.000003652273,"teacher_disagreement_score":0.78911674,"about_ca_system_score_codex":0.00015341821,"about_ca_system_score_gemma":0.00013009987,"threshold_uncertainty_score":0.8127387},"labels":[],"label_agreement":null},{"id":"W6891913297","doi":"10.48550/arxiv.1608.02692","title":"Proceedings Combined 23rd International Workshop on Expressiveness in Concurrency and 13th Workshop on Structural Operational Semantics","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Concurrency; Semantics (computer science); Operational semantics; Petri net; Field (mathematics); Formal semantics (linguistics); Event (particle physics); Focus (optics); Isolation (microbiology)","score_opus":0.08359964394604776,"score_gpt":0.2510327791278095,"score_spread":0.16743313518176178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891913297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7435818,0.000017441716,0.25115454,0.00053595606,0.0017898021,0.00044646885,0.000022497634,0.00011899825,0.0023325125],"genre_scores_gemma":[0.9911877,0.0000798859,0.007909512,0.000114036884,0.000117937925,0.0000049966156,0.000021222011,0.000015703701,0.00054902537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980037,0.000101268044,0.00031715244,0.0010818536,0.00021500383,0.00028097144],"domain_scores_gemma":[0.9985674,0.00021945935,0.00033088817,0.0004947402,0.00027254364,0.00011497332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033920663,0.00033649718,0.00029628628,0.00042190135,0.00013014262,0.00025708793,0.0015986777,0.000302918,0.000022792377],"category_scores_gemma":[0.00024690662,0.0003262014,0.00007363206,0.00035686378,0.00015591626,0.0007492998,0.0011977048,0.00066575565,0.000016412554],"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.00019006192,0.00008032732,0.012772047,0.00005364591,0.000038483937,0.000039330265,0.0004679691,0.014091014,0.00010301591,0.967937,0.00010168809,0.0041253995],"study_design_scores_gemma":[0.0020472973,0.00013448107,0.03488477,0.0015753715,0.000024763147,0.000008695471,0.00017287747,0.8874263,0.0008740814,0.0715675,0.00034146587,0.00094241166],"about_ca_topic_score_codex":0.000006856457,"about_ca_topic_score_gemma":0.0000033539138,"teacher_disagreement_score":0.8963695,"about_ca_system_score_codex":0.00032254186,"about_ca_system_score_gemma":0.000110758076,"threshold_uncertainty_score":0.999919},"labels":[],"label_agreement":null},{"id":"W6898824802","doi":"10.57745/ptva1t","title":"WW_Heritability.rds","year":2025,"lang":"en","type":"dataset","venue":"Recherche Data Gouv France","topic":"Formal Methods in Verification","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":"Canadian Nautical Research Society","funders":"","keywords":"Selection (genetic algorithm); Identification (biology); Term (time)","score_opus":0.31277500905769845,"score_gpt":0.45862844150447846,"score_spread":0.14585343244678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6898824802","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.7759714e-7,0.0010015371,0.3652274,0.00031699048,0.0015155837,0.00029300095,0.6310954,0.0001526889,0.00039714322],"genre_scores_gemma":[6.762071e-8,0.00092417025,0.44096908,0.00045228025,0.00014021524,0.000046897072,0.55681556,0.000006460372,0.00064527965],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99443245,0.0019715573,0.00068316923,0.0018076936,0.0005755684,0.00052955444],"domain_scores_gemma":[0.9829544,0.0012387221,0.00034741667,0.015135607,0.00019775215,0.00012614703],"candidate_categories":["metaresearch","metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.007814221,0.00046207308,0.0005835031,0.00018673202,0.00014060807,0.00030100683,0.016543994,0.0012924126,0.000070831426],"category_scores_gemma":[0.008422104,0.000472757,0.000087433174,0.0016176414,0.00014525387,0.0014124415,0.0044162315,0.002400963,0.00018922363],"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.0000040241803,0.00007943243,0.0000036105134,0.0003691919,0.000026588717,0.0000049234272,0.000019967814,0.0000013790118,0.000011667474,0.000718591,0.9408356,0.057925053],"study_design_scores_gemma":[0.00013203846,0.000026329257,0.000059634163,0.0001806325,0.000027830392,0.0000069380135,0.0000037811885,0.0053663123,0.000105918574,0.0013154674,0.99233,0.00044508153],"about_ca_topic_score_codex":0.00044481928,"about_ca_topic_score_gemma":0.000051169754,"teacher_disagreement_score":0.0757417,"about_ca_system_score_codex":0.00035213013,"about_ca_system_score_gemma":0.00090148015,"threshold_uncertainty_score":0.9999304},"labels":[],"label_agreement":null},{"id":"W6910401814","doi":"10.48550/arxiv.0912.1903","title":"Verifying Real-Time Systems using Explicit-time Description Methods","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","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":"St. Francis Xavier University","funders":"","keywords":"Process (computing); Modularity (biology); Rotation formalisms in three dimensions; Synchronization (alternating current); Model checking; Rendezvous; Semaphore; Asynchronous communication","score_opus":0.2032167767078547,"score_gpt":0.2735258106125422,"score_spread":0.07030903390468751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910401814","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.09998372,0.00009098784,0.8936626,0.000009471779,0.0012029097,0.00051778427,0.000005953884,0.0006754897,0.0038511257],"genre_scores_gemma":[0.1920611,0.00014291379,0.80642045,0.000024619027,0.00016323538,0.00000210139,0.000016025006,0.000037132824,0.0011324094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558705,0.0015863696,0.0005519302,0.001528057,0.00018512858,0.00056148064],"domain_scores_gemma":[0.9963517,0.00015209004,0.0007714884,0.0022178811,0.0002849057,0.0002219231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002374319,0.0004983837,0.00065692625,0.0005562604,0.0003139097,0.00043165425,0.002409707,0.00060223194,0.00001980012],"category_scores_gemma":[0.00013343302,0.00061959,0.0002694808,0.0010228262,0.00007988152,0.0013469564,0.001438245,0.00070291484,0.0001997683],"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.000060871742,0.00014032755,0.00020972938,0.00029979562,0.0001299925,0.0001522475,0.00046647858,0.6630404,0.050386664,0.27727604,0.00017829081,0.0076591605],"study_design_scores_gemma":[0.00020809847,0.00006497011,0.00026411554,0.00021163227,0.00009425684,0.000022083857,0.000040116083,0.9884641,0.0012311554,0.0085501745,0.00022968433,0.00061961793],"about_ca_topic_score_codex":0.00039752002,"about_ca_topic_score_gemma":7.5115787e-7,"teacher_disagreement_score":0.3254237,"about_ca_system_score_codex":0.000979475,"about_ca_system_score_gemma":0.00020343879,"threshold_uncertainty_score":0.99962556},"labels":[],"label_agreement":null},{"id":"W6910429548","doi":"10.48550/arxiv.0912.2553","title":"An Efficient Explicit-time Description Method for Timed Model Checking","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","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":"St. Francis Xavier University","funders":"","keywords":"Model checking; Process (computing); Rendezvous; Synchronization (alternating current); Modularity (biology); Automaton; State (computer science); Variable (mathematics); Semaphore","score_opus":0.1467152215149306,"score_gpt":0.2580255565066435,"score_spread":0.11131033499171289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910429548","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.04211115,0.000018143866,0.95537007,0.00003257722,0.00035277815,0.00078503124,0.000013926016,0.00049825234,0.00081809744],"genre_scores_gemma":[0.34902683,0.000007917327,0.6504363,0.00007034214,0.00005473979,0.000005234293,0.00002412678,0.000019135288,0.00035539945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719715,0.00036711217,0.0003578052,0.0014705916,0.00014382327,0.00046348863],"domain_scores_gemma":[0.9971096,0.00009015329,0.0004407401,0.0018607352,0.000297102,0.00020167128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017274002,0.00037456737,0.0004105846,0.00038606764,0.00024491316,0.00021710205,0.0023562345,0.00041598984,0.000006152861],"category_scores_gemma":[0.00009263901,0.00045597044,0.00025756803,0.00050903775,0.000040754596,0.00065760064,0.0006246061,0.00044476084,0.000037521382],"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.000035193443,0.0001072448,0.000008376606,0.0000363827,0.000015851338,0.000004615978,0.00022594618,0.7854232,0.002240693,0.20676729,0.000040759,0.0050944025],"study_design_scores_gemma":[0.00033250893,0.00011337951,0.00008819175,0.00004729876,0.000062234525,0.0000026624307,0.000020622365,0.9451364,0.0025984151,0.05108622,0.000050239647,0.00046177497],"about_ca_topic_score_codex":0.000026853635,"about_ca_topic_score_gemma":0.0000016553049,"teacher_disagreement_score":0.3069157,"about_ca_system_score_codex":0.00045714714,"about_ca_system_score_gemma":0.00016691105,"threshold_uncertainty_score":0.9997892},"labels":[],"label_agreement":null},{"id":"W6910646248","doi":"10.48550/arxiv.1107.1204","title":"Analysis of Non-Linear Probabilistic Hybrid Systems","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Probabilistic logic; Class (philosophy); Hybrid system; Probabilistic analysis of algorithms; Variable (mathematics); Probabilistic relevance model; Process (computing); Probabilistic CTL","score_opus":0.11891113386274539,"score_gpt":0.22612854797330448,"score_spread":0.10721741411055909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910646248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19478211,0.000025872763,0.80168426,0.0000021207718,0.0006241751,0.00030890314,0.000022501315,0.00010589767,0.0024441746],"genre_scores_gemma":[0.956966,0.000031538028,0.04251547,0.000006747739,0.000028354169,0.000002056148,0.000019738432,0.000011271485,0.00041883535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797213,0.0002505667,0.0004305326,0.00097375124,0.00012229243,0.0002507023],"domain_scores_gemma":[0.9964677,0.00008397895,0.0007027509,0.0022684156,0.00036029943,0.00011685785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075860706,0.00025352315,0.0006170555,0.0007737579,0.00006453766,0.00004314379,0.0024332542,0.000186431,0.000014614732],"category_scores_gemma":[0.00010872471,0.00028549743,0.0003504977,0.0016604684,0.00014492433,0.00028636237,0.0013425879,0.0003600146,0.00003671089],"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.000016588428,0.000101179605,0.004110493,0.0002557351,0.000612025,0.000040424067,0.00018497529,0.7456505,0.000025338124,0.24875304,0.000017538248,0.00023217424],"study_design_scores_gemma":[0.00010351689,0.00003978314,0.0034568645,0.00004816811,0.0008036603,0.0000015692098,0.000019651918,0.9907119,0.00022252598,0.0042818724,0.00003830281,0.00027212975],"about_ca_topic_score_codex":0.000453044,"about_ca_topic_score_gemma":0.000008826242,"teacher_disagreement_score":0.7621839,"about_ca_system_score_codex":0.00017261274,"about_ca_system_score_gemma":0.00014265746,"threshold_uncertainty_score":0.9999597},"labels":[],"label_agreement":null},{"id":"W6910670333","doi":"10.48550/arxiv.1107.1206","title":"Computing Distances between Probabilistic Automata","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","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":"Université Laval","funders":"","keywords":"Negation; Bisimulation; Probabilistic logic; Finitary; A priori and a posteriori; Algebra over a field; Term (time); Probabilistic automaton; Modal logic","score_opus":0.17484045400758896,"score_gpt":0.23078928475009242,"score_spread":0.05594883074250345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910670333","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.11008516,0.000028108354,0.8811997,0.000017829654,0.000744975,0.00032629518,0.000013209896,0.00062933227,0.006955353],"genre_scores_gemma":[0.84516776,0.000015969721,0.15443157,0.000016256006,0.00009340161,6.9009485e-7,0.000013956327,0.000015063562,0.00024532276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762315,0.0002990273,0.0003548915,0.0012213144,0.00011683327,0.00038480028],"domain_scores_gemma":[0.9971258,0.00014950529,0.0005067491,0.0019110718,0.00015285875,0.00015399816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007615061,0.00031797105,0.00039136392,0.00019058294,0.00019972016,0.000145437,0.0034329905,0.00027799016,0.000011250797],"category_scores_gemma":[0.00013857475,0.0003637596,0.0001559094,0.0005588808,0.00019924952,0.0004893468,0.00283568,0.0006090327,0.0001027971],"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.000009111403,0.000068438894,0.010425632,0.0002528239,0.000058689708,0.00005079107,0.0004737278,0.019292733,0.000004017015,0.962414,0.00006723863,0.0068827504],"study_design_scores_gemma":[0.00021897402,0.000053039425,0.017214661,0.00014161355,0.00007464018,0.0000027706556,0.000029460232,0.7650878,0.00012126617,0.21605924,0.0004021585,0.00059441663],"about_ca_topic_score_codex":0.00009630113,"about_ca_topic_score_gemma":0.000008607698,"teacher_disagreement_score":0.7463548,"about_ca_system_score_codex":0.00023883542,"about_ca_system_score_gemma":0.00015025317,"threshold_uncertainty_score":0.99988145},"labels":[],"label_agreement":null},{"id":"W6917380677","doi":"10.57907/mirri/fuorc0","title":"MIRRI0127676","year":2022,"lang":"en","type":"dataset","venue":"Entrepôt pour orphelin","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Taxon; Organism; Circumscription; Key (lock)","score_opus":0.023076227312002186,"score_gpt":0.28643566052479963,"score_spread":0.2633594332127974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6917380677","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004119257,0.0003693146,0.053408142,0.00061807566,0.0033153915,0.00029136345,0.9416954,0.00024951104,0.00004868326],"genre_scores_gemma":[8.0419494e-7,0.00022088445,0.16706842,0.0008030342,0.0002744713,0.00010807937,0.8303641,0.000020471129,0.0011397296],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99700266,0.0005023611,0.0005197006,0.00079859764,0.00072152773,0.0004551426],"domain_scores_gemma":[0.9968421,0.00016777279,0.0004222892,0.0023476894,0.000072574985,0.00014756735],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009820939,0.0003513106,0.0003290225,0.00026399584,0.00021506072,0.00019430424,0.0034500463,0.00021800467,0.7650001],"category_scores_gemma":[0.00035795054,0.0003652897,0.00017899135,0.00044824713,0.000040930845,0.00031850528,0.0013796854,0.0007942747,0.15651904],"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.0000046925697,0.00009409047,0.0000020429584,0.000035882706,0.000022724647,0.00005281662,0.000036117395,0.00003231054,0.000019776882,0.0024180242,0.9919279,0.005353596],"study_design_scores_gemma":[0.00019346681,0.00004415547,0.000014446392,0.000015908023,0.000021126581,0.000052676038,0.000010169056,0.0009368545,0.0002308062,0.00096489023,0.9971268,0.00038867875],"about_ca_topic_score_codex":0.00012271189,"about_ca_topic_score_gemma":0.00000913772,"teacher_disagreement_score":0.6084811,"about_ca_system_score_codex":0.0002197053,"about_ca_system_score_gemma":0.00027980158,"threshold_uncertainty_score":0.9998799},"labels":[],"label_agreement":null},{"id":"W6920362924","doi":"10.6084/m9.figshare.11330102.v2","title":"Additional file 1 of Action, actor, context, target, time (AACTT): a framework for specifying behaviour","year":2020,"lang":"en","type":"article","venue":"Figshare","topic":"Formal Methods in Verification","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":"Ottawa Hospital; University of Ottawa","funders":"","keywords":"Blank; Data file; Key (lock); Component (thermodynamics); Term (time)","score_opus":0.13107487410355467,"score_gpt":0.3205665451649839,"score_spread":0.18949167106142922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920362924","genre_codex":"dataset","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011668699,0.000013701611,0.04487052,0.00013324624,0.00005161101,0.00022352376,0.953985,0.00012212258,0.0005991432],"genre_scores_gemma":[0.00019734798,1.0161553e-7,0.5783182,0.00034143953,0.0001993684,0.000552189,0.42022935,0.0000107415,0.00015124909],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910945,0.000038790047,0.0002103645,0.000270302,0.00020738484,0.0001637374],"domain_scores_gemma":[0.9978238,0.0013583439,0.00023834353,0.00026755218,0.00021452282,0.00009746185],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00003340407,0.00010609871,0.00014418023,0.00003726885,0.00008195066,0.000052753607,0.0005765892,0.00010441784,0.97480947],"category_scores_gemma":[0.008097185,0.00011338138,0.00010011306,0.00025066888,0.000007727691,0.00046943186,0.00012116007,0.00015740425,0.0024794159],"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.0000065289346,0.000016728573,5.508938e-7,0.00004424573,0.000006085052,6.976912e-7,0.00011787759,0.000003897422,0.000039468454,0.0006876253,0.9935785,0.00549782],"study_design_scores_gemma":[0.000075396005,0.00007892124,0.00051243656,0.00050443783,0.0000019892473,0.0000026107532,0.000018314104,0.016786091,0.003415935,0.000772261,0.9776937,0.00013794552],"about_ca_topic_score_codex":4.4938952e-7,"about_ca_topic_score_gemma":1.7215974e-7,"teacher_disagreement_score":0.97233003,"about_ca_system_score_codex":0.000036067053,"about_ca_system_score_gemma":0.00009972636,"threshold_uncertainty_score":0.9982973},"labels":[],"label_agreement":null},{"id":"W6925161364","doi":"10.1594/pangaea.915384","title":"Soilsurface temperatures in 2 cm depth between summer 2018 and 2019 with iButton-sensor 122 in Churchill, Canada","year":2020,"lang":"en","type":"dataset","venue":"Publishing Network for Geoscientific and Environmental Data (PANGAEA) (Alfred Wegener Institute for Polar and Marine Research)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Bundesministerium für Bildung und Forschung","keywords":"Transect; Interval (graph theory); Hydrology (agriculture); Air temperature; Latitude","score_opus":0.06541184562547618,"score_gpt":0.29119212044804926,"score_spread":0.22578027482257307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925161364","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039585973,0.0014426386,0.0030859786,0.00088433496,0.0007937683,0.0014609601,0.98832816,0.000021834718,0.00002371892],"genre_scores_gemma":[0.0011129174,0.0018925531,0.040023584,0.00014118153,0.0003479713,0.00008773238,0.9560841,0.000039417522,0.0002705507],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99518764,0.0003155933,0.00059663673,0.0018223769,0.0008872352,0.0011905154],"domain_scores_gemma":[0.99739534,0.00034303346,0.0002167188,0.0015206608,0.00003721325,0.00048701232],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0037485587,0.00049263524,0.0006112027,0.00037675668,0.0008253425,0.0019379441,0.0023187094,0.0003007493,0.0000051024904],"category_scores_gemma":[0.00041347384,0.00044296632,0.000041517425,0.00069349684,0.000748718,0.0034121303,0.0037707232,0.0011202829,0.0000019723968],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008371817,0.00007232773,0.0054642884,0.00025399876,0.000052345113,0.000014855396,0.00004617581,0.00008665624,0.000015353018,0.00024549925,0.98735523,0.0063095535],"study_design_scores_gemma":[0.0011247172,0.00015109069,0.015354234,0.000112708505,0.000038542123,0.000020414973,0.00006538962,0.0045327405,0.000021323547,0.00014531407,0.9779129,0.0005206332],"about_ca_topic_score_codex":0.9481418,"about_ca_topic_score_gemma":0.9503642,"teacher_disagreement_score":0.036937606,"about_ca_system_score_codex":0.0002769309,"about_ca_system_score_gemma":0.00041329043,"threshold_uncertainty_score":0.99980223},"labels":[],"label_agreement":null},{"id":"W6929142233","doi":"10.4224/20377235","title":"Design criteria for sprinklered mobile shelving units for the National Library of Canada","year":2005,"lang":"en","type":"report","venue":"NPARC","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"National standard; Row; Space (punctuation); Technical standard; National library; Library classification","score_opus":0.142326963909221,"score_gpt":0.34795837449743744,"score_spread":0.20563141058821643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929142233","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.000015056441,0.00027629267,0.9731318,0.0004574036,0.001749245,0.0015121804,0.00018530342,0.000053292108,0.022619458],"genre_scores_gemma":[0.0033776425,0.00008622412,0.99172586,0.0001666643,0.0006193828,0.0009002303,0.000034997433,0.00003148358,0.0030575122],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981491,0.0000947849,0.00045131988,0.0003150578,0.00074171904,0.00024804485],"domain_scores_gemma":[0.9966949,0.0013034327,0.00041085092,0.000587021,0.0009538781,0.000049919403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017573935,0.00016606777,0.00024077817,0.00008865838,0.00016273274,0.00008984456,0.0017539987,0.00013569504,0.00008227959],"category_scores_gemma":[0.0016052948,0.0001352763,0.00006845178,0.00027593935,0.00003851038,0.00037371038,0.00023239138,0.00013373786,4.3741827e-7],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004639026,0.000039819177,0.0000058667933,0.0005406048,0.000120612836,8.5687196e-7,0.00025084917,0.0019730758,0.0027479148,0.04643009,0.8148194,0.13302454],"study_design_scores_gemma":[0.00020631886,0.00010009642,0.00024195228,0.00010646148,0.000025253177,0.000016527476,0.000013776468,0.28088742,0.015438357,0.011536656,0.69115347,0.00027371966],"about_ca_topic_score_codex":0.000957866,"about_ca_topic_score_gemma":0.0004550118,"teacher_disagreement_score":0.27891436,"about_ca_system_score_codex":0.00025599726,"about_ca_system_score_gemma":0.008979446,"threshold_uncertainty_score":0.9966387},"labels":[],"label_agreement":null},{"id":"W6929198917","doi":"10.4230/lipics.cp.2025.23","title":"RPID: Rust Programmable Interface for Domain-Independent Dynamic Programming","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Solver; Flexibility (engineering); Rust (programming language); Interface (matter); Software; Set (abstract data type); Dynamic programming; Class (philosophy)","score_opus":0.012899159785055066,"score_gpt":0.31897544518650495,"score_spread":0.3060762854014499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929198917","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.011742669,0.00010616704,0.9779131,0.0005816869,0.0022651758,0.0046161124,0.000115730014,0.0006142135,0.0020451888],"genre_scores_gemma":[0.09267607,0.000016785743,0.90380937,0.00048349987,0.00005967193,0.0016792095,0.00018640845,0.000047315694,0.0010416701],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99594176,0.000076939185,0.001562964,0.00057690067,0.0005517898,0.0012896509],"domain_scores_gemma":[0.9969054,0.00020467768,0.0006574906,0.001493551,0.0005280859,0.00021082266],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002023639,0.0005416048,0.00058014644,0.000501389,0.0006435471,0.001183315,0.0025411164,0.00034569504,0.000006948847],"category_scores_gemma":[0.00025826695,0.0005140711,0.00037846368,0.00081149576,0.00016899557,0.002444568,0.00081887824,0.0005014469,0.00006135083],"study_design_candidate":"design_other","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.00037261812,0.0008976244,0.0010944156,0.0030740448,0.00045935655,0.000003101731,0.009413883,0.00047715948,0.0003058534,0.31996632,0.0028748398,0.6610608],"study_design_scores_gemma":[0.004294051,0.00063897105,0.00033220678,0.00042389435,0.00007162539,0.00004447675,0.0019977668,0.34080648,0.0044267396,0.008690617,0.63735783,0.0009153425],"about_ca_topic_score_codex":0.000012678754,"about_ca_topic_score_gemma":0.000023188564,"teacher_disagreement_score":0.66014546,"about_ca_system_score_codex":0.00049779017,"about_ca_system_score_gemma":0.00021632254,"threshold_uncertainty_score":0.99985355},"labels":[],"label_agreement":null},{"id":"W6940031851","doi":"10.7282/t3g73htz","title":"Better Complexity Bounds for Cost Register Automata","year":2017,"lang":"en","type":"preprint","venue":"Rutgers University Community Repository (Rutgers University)","topic":"Formal Methods in Verification","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":"Université de Montréal","funders":"","keywords":"Semiring; Automaton; Class (philosophy); Set (abstract data type); Polynomial; State (computer science); Time complexity; Finite-state machine","score_opus":0.11614152043849489,"score_gpt":0.29319131320082353,"score_spread":0.17704979276232863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6940031851","genre_codex":"other","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.0006955764,0.000029817767,0.4620673,0.0008778489,0.0025867734,0.0013723376,0.00019956166,0.0009336256,0.5312371],"genre_scores_gemma":[0.49604374,0.00013635898,0.48386887,0.00034931418,0.00034460577,0.0000063295697,0.0005536722,0.00012453795,0.018572584],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9936435,0.0027064478,0.00060503004,0.0013945051,0.0006521689,0.0009983239],"domain_scores_gemma":[0.9877171,0.0005858985,0.0017950105,0.00847351,0.00086748606,0.0005610321],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0017918849,0.0009234502,0.0011330673,0.001355974,0.006785556,0.0011325877,0.013989015,0.0011594669,0.000010287114],"category_scores_gemma":[0.00022454088,0.0012857188,0.0009559008,0.00063160516,0.0018688531,0.0024096332,0.008526971,0.003259045,0.000025267094],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.010104948,0.013721694,0.014061783,0.017888516,0.013786964,0.00672278,0.062099125,0.0052571474,0.2731885,0.2352156,0.19470058,0.15325235],"study_design_scores_gemma":[0.019813795,0.0021371287,0.0013837336,0.0029923697,0.0035172713,0.00037036635,0.0008148685,0.19739719,0.41680267,0.03792248,0.30248806,0.014360087],"about_ca_topic_score_codex":0.0021040966,"about_ca_topic_score_gemma":0.0000036418687,"teacher_disagreement_score":0.51266456,"about_ca_system_score_codex":0.0024085643,"about_ca_system_score_gemma":0.0009401067,"threshold_uncertainty_score":0.99990433},"labels":[],"label_agreement":null},{"id":"W6948793038","doi":"10.5281/zenodo.11852471","title":"Iso 17987 pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"OSI model; Protocol (science); Interconnection; Service (business); Automotive industry; Interface (matter); Conformance testing; Layer (electronics); Set (abstract data type); Local area network; Communications protocol","score_opus":0.04221542986834593,"score_gpt":0.27983300799522315,"score_spread":0.23761757812687723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948793038","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.7727307e-7,0.00035004425,0.2096974,0.00028737207,0.0005601877,0.0003002629,0.000063621286,0.0027146926,0.7860255],"genre_scores_gemma":[0.00013518055,0.0002079172,0.06490727,0.0001838827,0.00050655287,7.81347e-8,0.00049730006,0.0087323645,0.9248295],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99777544,0.0003700291,0.000252181,0.0007395917,0.00048707952,0.00037570865],"domain_scores_gemma":[0.9982426,0.00001025378,0.0001588736,0.0012399963,0.00019091326,0.00015733099],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000809341,0.00022839652,0.00019481152,0.00058027194,0.0005233688,0.0016172989,0.0031807267,0.00018727081,0.053010687],"category_scores_gemma":[0.00036161003,0.00023947397,0.00007725167,0.0008811814,0.00013512335,0.00024940947,0.0024243915,0.00045531872,0.34580263],"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.0000024743827,0.00002845356,2.1320398e-8,0.00012024607,0.000030614847,0.000009785624,0.0002373421,0.0000014800567,0.00010328015,0.06798313,0.85352504,0.07795815],"study_design_scores_gemma":[0.00010746028,0.00008763209,0.0000051825436,0.0001189627,0.000011444754,0.00008704301,0.00002294842,0.0013043083,0.00009621298,0.0010615683,0.99684525,0.00025198946],"about_ca_topic_score_codex":0.000013548997,"about_ca_topic_score_gemma":1.7226823e-7,"teacher_disagreement_score":0.29279196,"about_ca_system_score_codex":0.00014117453,"about_ca_system_score_gemma":0.0000053450744,"threshold_uncertainty_score":0.9994191},"labels":[],"label_agreement":null},{"id":"W6949189625","doi":"10.5281/zenodo.11754214","title":"Karte island pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Gloom; Nucleofection; Population; Articular cartilage damage","score_opus":0.03582012850390425,"score_gpt":0.2711277083381531,"score_spread":0.23530757983424883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949189625","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.908518e-7,0.0002869512,0.22119029,0.00023403237,0.00047797573,0.00026786365,0.000082561775,0.001986794,0.7754725],"genre_scores_gemma":[0.00015361886,0.00018633694,0.038389083,0.00014837937,0.00049593503,6.844444e-8,0.00053198845,0.0074383565,0.9526562],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99801993,0.00032914153,0.0002237948,0.00065984996,0.00043014303,0.00033712512],"domain_scores_gemma":[0.9984836,0.000009450161,0.00013995607,0.0010711874,0.00016103797,0.00013478627],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00072110357,0.0002058824,0.00017918252,0.00050380605,0.00047463475,0.0015304963,0.002550444,0.0001625087,0.04746999],"category_scores_gemma":[0.00027436233,0.00021127083,0.00006551782,0.0007218973,0.00011546145,0.00022083685,0.0018697632,0.00040188606,0.27878118],"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.0000025631844,0.000023800834,3.0101578e-8,0.000109482484,0.00003077036,0.000012147707,0.00025860075,0.0000015598129,0.00008164198,0.042514578,0.90269864,0.054266192],"study_design_scores_gemma":[0.00011933079,0.00008468,0.0000049731675,0.0001089248,0.000011189378,0.00008738501,0.00001645084,0.0014664032,0.00006697992,0.0010724759,0.99673486,0.00022635712],"about_ca_topic_score_codex":0.000012122681,"about_ca_topic_score_gemma":4.3845083e-7,"teacher_disagreement_score":0.23131119,"about_ca_system_score_codex":0.00010535877,"about_ca_system_score_gemma":0.0000044133835,"threshold_uncertainty_score":0.999506},"labels":[],"label_agreement":null},{"id":"W6957835487","doi":"10.6068/dp14baa33f26379","title":"Trend 2006 - 2008. Statistics Canada. CANSIM: Environment - Environmental Protection | Country: Canada | Province: Saskatchewan | Table: Capital and operating expenditures on environmental protection, by type of activity | Variable: Environmental assessments and audits (x 1,000,000), Capital expenditures | Units: $CAD, 2006-2008. Data-Planet™ Statistical Ready Reference by Conquest Systems, Inc. Dataset-ID: 075-001-084.","year":2015,"lang":"en","type":"other","venue":"Data Planet","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Economic statistics; Census; Summary statistics; Official statistics; Capital expenditure; Capital (architecture); Natural capital; Audit; Statistical analysis","score_opus":0.02000248458934446,"score_gpt":0.24408187221591868,"score_spread":0.22407938762657423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957835487","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000692933,0.0015964813,0.0012153062,0.0000024024073,0.0006341441,0.0019303827,0.9943007,0.000053237574,0.00019803116],"genre_scores_gemma":[0.0025151786,0.0005297291,0.002275048,0.000073257695,0.00016207623,0.000111336994,0.99257034,0.00017414194,0.001588887],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940228,0.00070350984,0.0008504745,0.00187655,0.0017527033,0.0007939629],"domain_scores_gemma":[0.996032,0.00015984238,0.0010912197,0.0022034654,0.0000055432806,0.00050790986],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00057125656,0.0009849016,0.00083777244,0.000114742164,0.00039026764,0.0002925854,0.001583853,0.0005396651,0.001314591],"category_scores_gemma":[0.000023234074,0.0009867457,5.68325e-7,0.000074984484,0.00048941793,0.0009303123,0.0011595618,0.0010295609,0.000017559187],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009612142,0.0003181874,0.000027712236,0.00017158956,0.00020693202,0.000087930195,0.000017819488,0.000105197905,0.0009997537,0.000036322406,0.99682057,0.0011118932],"study_design_scores_gemma":[0.0008163189,0.00050713617,0.000058783327,0.000022647946,0.00017729952,0.00020469807,0.0005452358,0.007168577,0.00002619412,4.1558172e-7,0.9894928,0.000979897],"about_ca_topic_score_codex":0.98759735,"about_ca_topic_score_gemma":0.84496826,"teacher_disagreement_score":0.14262909,"about_ca_system_score_codex":0.00097133504,"about_ca_system_score_gemma":0.0019989023,"threshold_uncertainty_score":0.9995983},"labels":[],"label_agreement":null},{"id":"W6961208355","doi":"10.14288/1.0372865","title":"Canadian Pacific Railway lines timetable","year":2018,"lang":"en","type":"article","venue":"Open Collections","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Work (physics); Line (geometry); Fishing; Pacific ocean","score_opus":0.03400179450825893,"score_gpt":0.2983785911132435,"score_spread":0.2643767966049846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6961208355","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028979019,0.000010738133,0.2336498,0.0006436343,0.0010518577,0.00028401718,0.000006789501,0.0000691791,0.764255],"genre_scores_gemma":[0.0053514084,0.0000043959203,0.5377156,0.00018972807,0.00013727954,0.000083260624,0.0000021541748,0.0000074448208,0.45650873],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991583,0.00008821491,0.00014087386,0.00026540013,0.00009624439,0.00025091937],"domain_scores_gemma":[0.99895626,0.000031319934,0.000044065204,0.0006017085,0.00020430407,0.00016235851],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000455836,0.00007660052,0.00009310023,0.00012783526,0.0028217433,0.002142708,0.0011699729,0.000049824015,0.0007316255],"category_scores_gemma":[0.00012530519,0.00007671487,0.000025222282,0.0022107658,0.000049496695,0.0008310007,0.00018443102,0.00007917187,0.00039783336],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003967357,0.000034340224,0.000046495774,0.0000017146913,0.000017693119,0.0000014875283,0.0003338393,0.000016561255,0.00017261988,0.02387465,0.9658013,0.009695317],"study_design_scores_gemma":[0.00012631736,0.000087704386,0.00018670084,0.000005676919,0.000004469642,0.000021606402,0.0000489566,0.03159228,0.0036276993,0.0049114698,0.9592439,0.00014325087],"about_ca_topic_score_codex":0.2586015,"about_ca_topic_score_gemma":0.2139108,"teacher_disagreement_score":0.30774626,"about_ca_system_score_codex":0.00017563901,"about_ca_system_score_gemma":0.0005707319,"threshold_uncertainty_score":0.99889314},"labels":[],"label_agreement":null},{"id":"W6966852693","doi":"10.48550/arxiv.1108.2349","title":"Specification and Verification of Context-dependent Services","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Correctness; Formal verification; Formal methods; Formal specification; Model checking; Service (business); Automaton","score_opus":0.11517206515754404,"score_gpt":0.2070091709671081,"score_spread":0.09183710580956407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966852693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22030134,0.00027025852,0.7760065,0.000016533722,0.0003983802,0.0003044091,0.000009941345,0.00011584402,0.0025767423],"genre_scores_gemma":[0.9634421,0.00042095804,0.035873506,0.000019404753,0.000026280328,0.0000016716347,0.000011894377,0.000010407197,0.00019378435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843925,0.00017217833,0.0003136118,0.00081959134,0.00009792409,0.00015743953],"domain_scores_gemma":[0.9975594,0.000039327475,0.00057440175,0.0015147477,0.00022785926,0.00008424264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052358763,0.00019738727,0.00026789424,0.0002101052,0.00007123104,0.0000533914,0.001380853,0.0002393767,0.000014323222],"category_scores_gemma":[0.000021218106,0.00023456934,0.00008807028,0.0002709363,0.00011931056,0.00052419066,0.0008333217,0.00026848185,0.000029742267],"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.000039312275,0.00009474928,0.0043040793,0.0003326845,0.00006066524,0.0000059387803,0.0010929458,0.0027297412,0.0004960696,0.97684246,0.000008310297,0.013993053],"study_design_scores_gemma":[0.00082958053,0.00017201531,0.07054705,0.00024131146,0.00020600455,0.000010592578,0.0007468746,0.7777756,0.017734004,0.12958767,0.0011619969,0.0009873299],"about_ca_topic_score_codex":0.00026471957,"about_ca_topic_score_gemma":0.000015621561,"teacher_disagreement_score":0.8472548,"about_ca_system_score_codex":0.00008937515,"about_ca_system_score_gemma":0.00005472433,"threshold_uncertainty_score":0.956546},"labels":[],"label_agreement":null},{"id":"W6979279164","doi":"","title":"Time for Timed Monitorability","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Nondeterministic algorithm; Undecidable problem; Decidability; Automaton; Property (philosophy); Model checking; Finite-state machine; Temporal logic","score_opus":0.045721540325241804,"score_gpt":0.3329349345452383,"score_spread":0.28721339421999653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979279164","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.400272,0.00003988784,0.5953022,0.0007843205,0.0006090478,0.00028488936,0.0000017282656,0.0001970019,0.0025088855],"genre_scores_gemma":[0.5089067,0.0000022129611,0.4871396,0.0003712114,0.00007112482,0.00010151069,0.0000029763391,0.0000062994573,0.0033983374],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991537,0.000075500306,0.00018798454,0.00030690487,0.00008989021,0.00018602461],"domain_scores_gemma":[0.9988977,0.00017261693,0.00005354105,0.00073234935,0.00010606771,0.00003774726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062724296,0.00008360727,0.000113754555,0.000057512778,0.00010928132,0.000036807804,0.0006861982,0.00006165068,0.000012607967],"category_scores_gemma":[0.0004350184,0.000080305865,0.000057669906,0.00033341767,0.00005924596,0.00031739223,0.00014141963,0.00007469698,0.00025994593],"study_design_candidate":"observational","study_design_consensus":"observational","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.00013544282,0.0006301344,0.3987305,0.0003200921,0.00014642294,0.000003479341,0.0012793543,0.0002168357,0.07214942,0.19227757,0.020960787,0.31314996],"study_design_scores_gemma":[0.00067613024,0.00013976946,0.5952266,0.00004088611,0.000020849691,0.0000016620021,0.000020188212,0.19163798,0.15037915,0.015513585,0.045990445,0.00035275865],"about_ca_topic_score_codex":0.0000054301686,"about_ca_topic_score_gemma":3.1961994e-7,"teacher_disagreement_score":0.31279722,"about_ca_system_score_codex":0.000059295508,"about_ca_system_score_gemma":0.00006154339,"threshold_uncertainty_score":0.33411655},"labels":[],"label_agreement":null},{"id":"W6985183608","doi":"","title":"9783631831694.pdf","year":2020,"lang":"en","type":"other","venue":"OAPEN (The OAPEN Foundation)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Bishops; Quarter (Canadian coin); Middle Ages; Delegate; Period (music)","score_opus":0.025477100399556037,"score_gpt":0.28090706556472633,"score_spread":0.2554299651651703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6985183608","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.546734e-7,0.000002636242,0.33387297,0.0018124207,0.0013595602,0.00052975264,5.121236e-9,0.0004449065,0.6619773],"genre_scores_gemma":[0.000060188344,0.00007988467,0.31162825,0.0015296164,0.00073325355,0.00013567533,0.000103790866,0.00025559287,0.68547374],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99733174,0.00034874157,0.00044592997,0.0008133175,0.0006717446,0.0003885187],"domain_scores_gemma":[0.99721116,0.00013495989,0.00060311635,0.0018396408,0.00006564218,0.00014549356],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006079204,0.00041749902,0.00038709526,0.00019015107,0.00025666654,0.00066839374,0.0036312276,0.00022420706,0.48157856],"category_scores_gemma":[0.00022365799,0.00033733615,0.00015636571,0.0007987513,0.00015923035,0.0005843546,0.0006551677,0.00048197794,0.95328647],"study_design_candidate":"not_applicable","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.0000035305313,0.000020365871,0.000009691629,0.000029507677,0.000053556243,0.0000038835087,0.00010887566,0.000003232616,0.000030699102,0.06926872,0.005971974,0.924496],"study_design_scores_gemma":[0.0001877062,0.00004273963,0.00017481476,0.00005590083,0.000032839154,0.000016535761,0.000012358281,0.004187246,0.00011793177,0.0024143138,0.9923518,0.00040584346],"about_ca_topic_score_codex":0.00010665422,"about_ca_topic_score_gemma":0.000026785397,"teacher_disagreement_score":0.9863798,"about_ca_system_score_codex":0.00011360187,"about_ca_system_score_gemma":0.00021637321,"threshold_uncertainty_score":0.99990785},"labels":[],"label_agreement":null},{"id":"W6986752330","doi":"","title":"On queued testing and its application to delay-insensitive systems","year":2003,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Asynchronous communication; Cover (algebra); System testing; Model-based testing; Queueing theory; Range (aeronautics)","score_opus":0.02877091056390278,"score_gpt":0.2759297466896528,"score_spread":0.24715883612575004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986752330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9009489,0.00034400518,0.0016493434,0.000020067198,0.0033627097,0.0037963663,0.00028965285,0.0009387054,0.088650264],"genre_scores_gemma":[0.8944243,0.000040328763,0.10095292,0.0005017949,0.00005294817,0.0007530538,0.00015058296,0.00016826314,0.0029557804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9949053,0.00081884995,0.00092559855,0.0017523218,0.00091784704,0.00068011205],"domain_scores_gemma":[0.99577415,0.0007330603,0.000797169,0.0012180294,0.0010399484,0.0004376265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019854975,0.00073751074,0.0006620618,0.0006110637,0.0010566246,0.00027129156,0.0010356385,0.00068878866,0.0000034490422],"category_scores_gemma":[0.0039964574,0.0008189171,0.00011195965,0.0014798556,0.00002340776,0.001010928,0.00015905494,0.0010954253,0.0004070824],"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.00006569359,0.00007930549,0.0000027185433,0.00025721578,0.00005064436,0.000021605765,0.00002177962,0.00051319605,0.051402863,0.80858314,0.0000033316737,0.1389985],"study_design_scores_gemma":[0.002978607,0.0026855092,0.0043201344,0.004891097,0.00047105865,0.0007673232,0.0007453718,0.12472628,0.7281558,0.08775393,0.033652667,0.008852239],"about_ca_topic_score_codex":0.00017500436,"about_ca_topic_score_gemma":0.00006773421,"teacher_disagreement_score":0.72082925,"about_ca_system_score_codex":0.0007490737,"about_ca_system_score_gemma":0.000070452414,"threshold_uncertainty_score":0.9994262},"labels":[],"label_agreement":null},{"id":"W69945531","doi":"10.1007/978-0-387-68759-9_6","title":"Implementation of Automata Manipulations","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Formal Methods in Verification","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":"Computer Research Institute of Montréal","funders":"","keywords":"Automaton; Computer science; Predicate (mathematical logic); Boolean function; Finite-state machine; Theoretical computer science; Transition system; Transition (genetics); Algorithm; Programming language","score_opus":0.10361102377767627,"score_gpt":0.340985924269885,"score_spread":0.23737490049220872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69945531","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.0000021775966,0.000011164607,0.51331735,0.000017594748,0.00015716767,0.00011193317,0.0000038108112,0.00008451364,0.4862943],"genre_scores_gemma":[0.0017865767,0.00003135916,0.8493414,0.000039212508,0.00002821767,0.000007848088,0.00002036985,0.000015392934,0.14872965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991201,0.00001318624,0.00035713386,0.00022140436,0.00020066909,0.000087506676],"domain_scores_gemma":[0.99877834,0.000018109175,0.00031442693,0.00075749453,0.00010226438,0.00002935352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021311197,0.000119828146,0.00014086206,0.00015496746,0.00003186668,0.000018856845,0.0006033669,0.000105495084,0.000882969],"category_scores_gemma":[0.0000047016656,0.00011778558,0.00006306299,0.00003246399,0.000029250112,0.00031539018,0.00017036856,0.000076428034,0.00014625942],"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":[3.5143026e-7,0.000003089573,0.00000759718,0.00001181255,0.000010594101,2.5375442e-7,0.000097110766,6.44051e-7,0.00001618483,0.923181,0.0004071167,0.07626423],"study_design_scores_gemma":[0.00033867848,0.0002113253,0.0057289554,0.00007273849,0.000059516882,0.000018345016,0.000021340955,0.007980478,0.007063392,0.85582334,0.12204692,0.000634987],"about_ca_topic_score_codex":0.00006434262,"about_ca_topic_score_gemma":0.000020611798,"teacher_disagreement_score":0.33756465,"about_ca_system_score_codex":0.00003241122,"about_ca_system_score_gemma":0.00005567077,"threshold_uncertainty_score":0.9667891},"labels":[],"label_agreement":null},{"id":"W6998675034","doi":"","title":"Arithmetic transform in verification of datapath circuits","year":2003,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Datapath; Electronic circuit; Digital electronics; Boolean function; Adder","score_opus":0.028463356308081538,"score_gpt":0.2742527410634472,"score_spread":0.2457893847553657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6998675034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7221302,0.00090148393,0.0017611424,0.00003097951,0.005753331,0.0032744207,0.0010771543,0.0005942026,0.26447713],"genre_scores_gemma":[0.88401145,0.00055326516,0.11125412,0.0001213813,0.000021997243,0.00034478572,0.001028332,0.00016297783,0.0025016838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9945154,0.0006871443,0.0016061878,0.0014126821,0.0010834258,0.0006951316],"domain_scores_gemma":[0.99613225,0.0001787393,0.00096338976,0.0020663366,0.0004467517,0.00021253462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026706066,0.00066249183,0.0008452678,0.0009875041,0.0003338294,0.000098832985,0.0024369697,0.0008441983,0.000045191922],"category_scores_gemma":[0.0009365992,0.00076793716,0.00022025217,0.0019839117,0.000068643436,0.002235984,0.00007711586,0.0013606246,0.00010902128],"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.000028944283,0.00026193066,0.000010276642,0.00045258392,0.000039092432,0.000011614496,0.000038784445,0.000034145327,0.03851752,0.49343938,0.0000012810731,0.46716446],"study_design_scores_gemma":[0.0021370642,0.0005516452,0.009077598,0.0012618672,0.0001807612,0.00006924134,0.0003297119,0.002561914,0.84046835,0.10868432,0.032082666,0.002594894],"about_ca_topic_score_codex":0.00015980852,"about_ca_topic_score_gemma":0.00030315368,"teacher_disagreement_score":0.8019508,"about_ca_system_score_codex":0.0006899218,"about_ca_system_score_gemma":0.0001505284,"threshold_uncertainty_score":0.99947715},"labels":[],"label_agreement":null},{"id":"W7000652012","doi":"","title":"Frequently asked questions about objective-based codes","year":2001,"lang":"en","type":"article","venue":"NPARC","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Frequently asked questions; Confidentiality; Context (archaeology); Questions and answers","score_opus":0.0277690980851516,"score_gpt":0.30204639822522783,"score_spread":0.27427730014007623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7000652012","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.01458514,0.00002658027,0.9319434,0.0005884954,0.00034999626,0.00013473174,0.000002535763,0.00031485248,0.05205425],"genre_scores_gemma":[0.4196029,0.000008713578,0.5798127,0.00028033703,0.00003922303,0.00003097916,0.0000019204258,0.000005292583,0.00021795506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989375,0.00016892866,0.00017025227,0.0002730302,0.00022534748,0.00022493569],"domain_scores_gemma":[0.9990421,0.000090322734,0.00007411329,0.0005977943,0.00011778973,0.000077887984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044222284,0.00009847796,0.00010330883,0.0001008405,0.00015075627,0.00010119669,0.00060789357,0.000058552087,0.00008735165],"category_scores_gemma":[0.00020858372,0.00009663571,0.00004733179,0.00044545133,0.0000716191,0.0003990979,0.000050875333,0.00012716437,0.0001559858],"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.00001369952,0.0001383349,0.0034842675,0.00001115519,0.000012159267,0.00001406942,0.00037788207,0.0003760719,0.03279071,0.85851467,0.0007912314,0.10347577],"study_design_scores_gemma":[0.00090671144,0.00027011134,0.10925549,0.000095497555,0.000018117134,0.00005325665,0.00003760028,0.60302514,0.064387195,0.18149081,0.03981742,0.000642652],"about_ca_topic_score_codex":0.000025749978,"about_ca_topic_score_gemma":0.0000086569435,"teacher_disagreement_score":0.6770238,"about_ca_system_score_codex":0.00008815631,"about_ca_system_score_gemma":0.00009941989,"threshold_uncertainty_score":0.394069},"labels":[],"label_agreement":null},{"id":"W7001290351","doi":"","title":"Interface timing verification using constraint logic programming and binary decision diagrams","year":2004,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Binary decision diagram; Digital electronics; Functional verification; Process (computing); Formal verification; Constraint logic programming; Constraint programming; Constraint (computer-aided design); High-level verification; Interface (matter)","score_opus":0.050596212699967565,"score_gpt":0.31900358125752826,"score_spread":0.2684073685575607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7001290351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9746059,0.0009331491,0.015811881,0.000015659236,0.0027998874,0.0015711669,0.00007263087,0.0007313109,0.003458391],"genre_scores_gemma":[0.5390818,0.0001372963,0.46033263,0.000045536093,0.000025292591,0.000080828904,0.000116086965,0.00007868281,0.00010184054],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9949077,0.00044920584,0.001194593,0.001755501,0.00089515286,0.0007978405],"domain_scores_gemma":[0.9965109,0.00029374863,0.001046544,0.0013166805,0.0004920534,0.00034007774],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0020000802,0.0008166083,0.0006915202,0.0006076237,0.001310375,0.0005107138,0.0014895503,0.00088367506,0.00001837962],"category_scores_gemma":[0.0010892262,0.0008750914,0.000221667,0.0010421637,0.0001628361,0.0022268598,0.00039037698,0.001411678,0.00007042465],"study_design_candidate":"design_other","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.000068706206,0.0001355685,0.00000979116,0.00025099883,0.000049099363,0.00003088639,0.00005631094,0.00047749295,0.045578733,0.18183866,2.1555455e-7,0.7715035],"study_design_scores_gemma":[0.004487785,0.0019964082,0.0059508295,0.009914857,0.00074294227,0.0011166622,0.0028131332,0.06650037,0.5855104,0.29535198,0.017312359,0.008302263],"about_ca_topic_score_codex":0.00012413184,"about_ca_topic_score_gemma":0.00006714383,"teacher_disagreement_score":0.7632013,"about_ca_system_score_codex":0.001257832,"about_ca_system_score_gemma":0.00013946957,"threshold_uncertainty_score":0.9999898},"labels":[],"label_agreement":null},{"id":"W7001658772","doi":"","title":"Le pouvoir des tribunaux administratifs québécois de refuser de donner effet à des textes qu'ils jugent inconstitutionnels","year":2015,"lang":"fr","type":"article","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Natural (archaeology); Object (grammar)","score_opus":0.027777470556137728,"score_gpt":0.2257898218400711,"score_spread":0.19801235128393338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7001658772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5391762,0.03377084,0.38391882,0.0022690345,0.002087644,0.0005815714,0.000085993015,0.00035840677,0.037751462],"genre_scores_gemma":[0.7514779,0.00050357945,0.23583266,0.00029260694,0.0003126369,0.000045008004,0.000023056868,0.000028258983,0.011484302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99551535,0.0009719408,0.0006577797,0.0008708486,0.00078956655,0.0011945269],"domain_scores_gemma":[0.99623245,0.00025407938,0.0004340749,0.00091729057,0.0008660434,0.0012960571],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0019145182,0.0005398466,0.0004683344,0.00031494143,0.006924996,0.00035456393,0.0012873037,0.00050533697,0.000020536725],"category_scores_gemma":[0.000983427,0.0006379969,0.0003136725,0.00089092273,0.0027642504,0.0026883383,0.0005844692,0.00053121825,0.00011833435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00045004248,0.00072285155,0.011888576,0.0001910212,0.00023840723,0.0017989301,0.080278,0.012208651,0.007819237,0.8600294,0.0010142304,0.023360664],"study_design_scores_gemma":[0.0073235207,0.0017386872,0.07570025,0.0016699788,0.0007980359,0.02229743,0.05928784,0.080116734,0.15879211,0.07522687,0.5138233,0.003225275],"about_ca_topic_score_codex":0.15376286,"about_ca_topic_score_gemma":0.0350284,"teacher_disagreement_score":0.7848025,"about_ca_system_score_codex":0.014010603,"about_ca_system_score_gemma":0.01903198,"threshold_uncertainty_score":0.99994963},"labels":[],"label_agreement":null},{"id":"W7014614997","doi":"","title":"Proposed technical changes for the new objective-based codes","year":2002,"lang":"en","type":"article","venue":"NPARC","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Code (set theory); Field (mathematics); Key (lock); Set (abstract data type); Process (computing)","score_opus":0.05907826729427139,"score_gpt":0.3000002895377355,"score_spread":0.2409220222434641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7014614997","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.00006808494,0.00007423365,0.9834383,0.0100706015,0.00020249891,0.0004982409,0.0000016131535,0.0001859081,0.005460478],"genre_scores_gemma":[0.12767811,0.000009873783,0.8710561,0.0005232712,0.00010636203,0.00008324112,4.495786e-7,0.000006691512,0.0005359495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992981,0.000055117856,0.000092449554,0.00020633974,0.00017019501,0.00017778421],"domain_scores_gemma":[0.99906385,0.00027757447,0.000054337463,0.0005039579,0.000056097393,0.00004417791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040388558,0.00007511862,0.000079311634,0.000038644426,0.00013979441,0.00007063828,0.0007425742,0.0000490645,0.000048436228],"category_scores_gemma":[0.00026083607,0.000050012353,0.00003977111,0.00023517656,0.00006355639,0.000112379894,0.00005491845,0.0000855139,0.000024911966],"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.000016538248,0.00007083519,0.000020633559,0.000017424982,0.000008707092,6.6250533e-7,0.00040550914,0.00005128899,0.04655192,0.34289664,0.014363824,0.595596],"study_design_scores_gemma":[0.00050874165,0.00032920187,0.0007823107,0.000017470738,0.000011467667,0.000007003925,0.000014584975,0.7498691,0.14198594,0.030599376,0.07568892,0.00018586816],"about_ca_topic_score_codex":0.0000032966254,"about_ca_topic_score_gemma":0.000007230208,"teacher_disagreement_score":0.74981785,"about_ca_system_score_codex":0.000037207377,"about_ca_system_score_gemma":0.000032997126,"threshold_uncertainty_score":0.20394446},"labels":[],"label_agreement":null},{"id":"W7017161555","doi":"","title":"AlphaSMT: A Reinforcement Learning Guided SMT Solver","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Formal Methods in Verification","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":"Blackberry (Canada)","funders":"","keywords":"Satisfiability modulo theories; Reinforcement learning; Flexibility (engineering); Solver; Class (philosophy); Function (biology); Artificial neural network; Software","score_opus":0.028642621160720087,"score_gpt":0.25902003009614327,"score_spread":0.2303774089354232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017161555","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8885653,0.000119704295,0.093852066,0.00102618,0.004042905,0.0011414167,0.0000069390785,0.001480628,0.009764843],"genre_scores_gemma":[0.008883366,0.00015038945,0.13347773,0.000017679044,0.000039750852,0.0000014761531,0.00027512255,0.000033893484,0.8571206],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982324,0.00011984571,0.00022484618,0.0005217183,0.0005449619,0.00035622274],"domain_scores_gemma":[0.9983865,0.000044227425,0.00051034155,0.0006879401,0.00026996326,0.00010100913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005334374,0.000252042,0.00036469923,0.00045051242,0.00030374335,0.000059660117,0.001371295,0.00029316024,0.00009815548],"category_scores_gemma":[0.000073358395,0.00031077652,0.00019598528,0.00054846605,0.00005571428,0.000617751,0.0002620767,0.0003765451,0.000408567],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029934928,0.00016041954,0.00032027063,0.001604436,0.00063101115,0.00023030471,0.81783074,0.01732746,0.017167207,0.040602196,0.02744339,0.07638322],"study_design_scores_gemma":[0.004756669,0.0016436091,0.019865269,0.00208739,0.00062937534,0.000030802887,0.355644,0.5263308,0.0460006,0.0036394778,0.035141986,0.0042299973],"about_ca_topic_score_codex":0.010546865,"about_ca_topic_score_gemma":0.002593382,"teacher_disagreement_score":0.87968194,"about_ca_system_score_codex":0.0001442215,"about_ca_system_score_gemma":0.00012696265,"threshold_uncertainty_score":0.99993443},"labels":[],"label_agreement":null},{"id":"W7018147088","doi":"","title":"CoreASM: an extensible modeling framework &amp; tool environment for high-level design and analysis of distributed systems","year":2009,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Executable; Abstraction; Abstract state machines; Extensibility; Variety (cybernetics); Abstraction layer; Software; Modeling language; Formal specification","score_opus":0.05053131440959336,"score_gpt":0.2663036374672186,"score_spread":0.21577232305762523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7018147088","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.08258247,0.00013152747,0.9160567,0.0000084717085,0.00023220641,0.0006216328,0.00026461147,0.00007639199,0.000026001366],"genre_scores_gemma":[0.25201488,0.00014943784,0.74475825,0.000011063346,0.000024729015,0.000006839721,0.0025282695,0.000020503912,0.00048600734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978472,0.000251942,0.00045556948,0.00077424385,0.0003763282,0.0002947411],"domain_scores_gemma":[0.99791497,0.00019460122,0.00050446944,0.0009991144,0.00025432772,0.00013252343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005569469,0.00032373084,0.0006521596,0.0009659207,0.0002051504,0.000107162945,0.000903112,0.00047439302,0.000005533172],"category_scores_gemma":[0.000105213774,0.0003779276,0.00016575775,0.0013312384,0.000040111045,0.00062629284,0.00006433306,0.0002456027,0.0000024001545],"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.0006145177,0.0003271082,0.005057471,0.0003096519,0.0011074347,0.000016166985,0.00018938906,0.85241807,0.00007331161,0.121040955,0.00026689898,0.01857901],"study_design_scores_gemma":[0.00036708597,0.00018492807,0.0024625703,0.00011442491,0.0014542753,9.3407335e-9,0.0016353421,0.98984516,0.00041207674,0.0019463095,0.0010416084,0.0005361917],"about_ca_topic_score_codex":0.00021889154,"about_ca_topic_score_gemma":0.0007719108,"teacher_disagreement_score":0.17129841,"about_ca_system_score_codex":0.00020971338,"about_ca_system_score_gemma":0.0000841478,"threshold_uncertainty_score":0.99986726},"labels":[],"label_agreement":null},{"id":"W7023310863","doi":"","title":"Objective-based codes: a progress report","year":2002,"lang":"en","type":"article","venue":"NPARC","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Commission; Plan (archaeology); Publication; Web site","score_opus":0.041134804895824245,"score_gpt":0.2997275009794305,"score_spread":0.25859269608360624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023310863","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.00463163,0.00003988194,0.93378115,0.00073260086,0.00032023937,0.00018035,7.0972357e-7,0.00030684905,0.060006585],"genre_scores_gemma":[0.34487134,0.0000011542912,0.6545969,0.00011528222,0.000029306379,0.000043310916,6.6041474e-7,0.000004517223,0.0003375069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999009,0.000086216016,0.00017575655,0.0002868753,0.00025876274,0.00018336343],"domain_scores_gemma":[0.99900824,0.00003787446,0.00010456408,0.0007043949,0.000088616565,0.000056330653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044577778,0.00007793525,0.00009113062,0.00006295477,0.00007790571,0.000076986355,0.0004975334,0.00004336778,0.00009253468],"category_scores_gemma":[0.000152033,0.00007248231,0.000038246904,0.00033453337,0.00007060994,0.00027045282,0.00005684491,0.00009136018,0.00011081982],"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.000014908179,0.00052012666,0.005058101,0.00006476533,0.000022914535,0.0004433577,0.0019316324,0.0000982018,0.0074010263,0.2669109,0.009005553,0.7085285],"study_design_scores_gemma":[0.0003254789,0.00014394554,0.004031649,0.000028642318,0.0000053116296,0.00018309492,0.000012242267,0.92340326,0.04021649,0.010201138,0.021184321,0.00026440568],"about_ca_topic_score_codex":0.0000016182803,"about_ca_topic_score_gemma":4.2956836e-7,"teacher_disagreement_score":0.9233051,"about_ca_system_score_codex":0.000046511996,"about_ca_system_score_gemma":0.000026408512,"threshold_uncertainty_score":0.29557428},"labels":[],"label_agreement":null},{"id":"W7023955939","doi":"","title":"Programa de comercialización de Hongos (Suillus luteus) comestibles para mejorar las condiciones de vida en Marayhuaca – Incahuasi – Ferreñafe – Lambayeque.","year":2019,"lang":"es","type":"dissertation","venue":"renati","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Qualitative analysis","score_opus":0.0266857343110235,"score_gpt":0.34536393339702126,"score_spread":0.31867819908599776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023955939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4915619,0.0032160871,0.49181816,0.001270953,0.0033690874,0.0035497213,0.00018111995,0.0010315977,0.0040013585],"genre_scores_gemma":[0.5608721,0.0016209263,0.43173575,0.00062915194,0.0004497631,0.000561752,0.0010236446,0.00022484764,0.002882042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918032,0.0023940331,0.001347703,0.0014569972,0.0012999645,0.0016980708],"domain_scores_gemma":[0.99464774,0.0009669152,0.0014163343,0.0017767398,0.000644007,0.00054829015],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0035971026,0.0011150147,0.0013335618,0.00092987897,0.0005765547,0.0013079647,0.0032884546,0.0014991678,0.000075346456],"category_scores_gemma":[0.0015699791,0.0011752873,0.00039031572,0.0017380879,0.00035606438,0.0010457785,0.00042561835,0.0012915429,0.00036260544],"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.00071472273,0.0015749007,0.05814729,0.0064827898,0.0009581157,0.00036620974,0.03706427,0.0023278194,0.021706898,0.59741855,0.0028617205,0.2703767],"study_design_scores_gemma":[0.004545478,0.0022204004,0.36895502,0.006321456,0.0010158527,0.0009016648,0.003614885,0.45452026,0.059000254,0.01701839,0.075719446,0.0061668805],"about_ca_topic_score_codex":0.0012548085,"about_ca_topic_score_gemma":0.00010134852,"teacher_disagreement_score":0.58040017,"about_ca_system_score_codex":0.0012224519,"about_ca_system_score_gemma":0.0023444602,"threshold_uncertainty_score":0.9997971},"labels":[],"label_agreement":null},{"id":"W7024062212","doi":"","title":"Progressive Waste Solutions Ltd. Opens Canada's Largest Renewable Natural Gas Facility","year":2015,"lang":"en","type":"other","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Renewable energy; Natural gas; Renewable natural gas; Natural (archaeology); Fossil fuel; Greenhouse gas","score_opus":0.030830273560428993,"score_gpt":0.2743262521318069,"score_spread":0.2434959785713779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024062212","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036329623,0.0017713663,0.1375381,0.0005991931,0.0028147823,0.00067474064,0.0002708525,0.0004962027,0.85583115],"genre_scores_gemma":[0.00019229442,0.00001242177,0.29188475,0.00013542225,0.00014289684,0.00005168735,0.00011599852,0.000054103526,0.70741045],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977911,0.00019916102,0.0002641649,0.00061218697,0.00059585227,0.0005375155],"domain_scores_gemma":[0.9979496,0.000026897387,0.00025645597,0.0013376639,0.00022817112,0.00020119695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056405895,0.00028774902,0.00030611802,0.00011803248,0.00013553443,0.00013763702,0.0015464816,0.00020802396,0.0004324296],"category_scores_gemma":[0.00022291171,0.0002458239,0.000046939538,0.00039343463,0.00008901642,0.00023550497,0.00057237095,0.0003005218,0.00010757317],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016190662,0.000021027172,0.0000044218623,0.000024246865,0.000022693957,0.000013266725,0.000034275356,0.000025212032,0.000010677949,0.006228669,0.9916557,0.0019581807],"study_design_scores_gemma":[0.00014487233,0.000023608778,0.00000969191,0.000053485797,0.000009256466,0.000025640074,0.000039816514,0.008918327,0.00030229238,0.00030833617,0.9898036,0.0003610787],"about_ca_topic_score_codex":0.51740915,"about_ca_topic_score_gemma":0.6901593,"teacher_disagreement_score":0.17275017,"about_ca_system_score_codex":0.000408739,"about_ca_system_score_gemma":0.0019339208,"threshold_uncertainty_score":0.9999994},"labels":[],"label_agreement":null},{"id":"W7027925264","doi":"","title":"Descriptional complexity of formal systems 15th international workshop, DCFS 2013, London, Canada, July 22 - 25, 2013 ; proceedings","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Formal system; Subject (documents); Formal methods; Systems theory","score_opus":0.04946287073204324,"score_gpt":0.2639296469112705,"score_spread":0.21446677617922727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027925264","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.045908183,0.00015369228,0.92545664,0.0034264897,0.003573523,0.0008407203,0.000026833033,0.0001582502,0.02045569],"genre_scores_gemma":[0.58071387,0.000015949305,0.41603452,0.0002342449,0.00019686171,0.00009969758,0.000014473991,0.000011935523,0.0026784313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976913,0.000040469036,0.0006164357,0.00037351708,0.00087219983,0.00040610484],"domain_scores_gemma":[0.998118,0.00004846741,0.00034744348,0.00034074244,0.0009808829,0.00016450649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059059355,0.00019445021,0.00023456723,0.00015142211,0.00013301706,0.00026661693,0.0015485742,0.00008924099,0.0002897358],"category_scores_gemma":[0.00009145255,0.00017388597,0.000059416678,0.00032552512,0.00015204363,0.0023617237,0.00036776185,0.00020351486,0.00010953758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013147952,0.00006665835,0.0015078805,0.00006472217,0.000044978846,7.6272835e-7,0.00019443763,0.00028039867,0.000983222,0.71947163,0.27445433,0.0029178327],"study_design_scores_gemma":[0.000526005,0.00008680609,0.051497605,0.00008426629,0.000008517602,0.00007634384,0.00026000882,0.8658242,0.0016590965,0.0037211122,0.07580179,0.0004541956],"about_ca_topic_score_codex":0.22370696,"about_ca_topic_score_gemma":0.013284531,"teacher_disagreement_score":0.86554384,"about_ca_system_score_codex":0.00027560987,"about_ca_system_score_gemma":0.00026607892,"threshold_uncertainty_score":0.78146243},"labels":[],"label_agreement":null},{"id":"W7029046129","doi":"","title":"Improvements to Many-Sorted Finite Model Finding using SMT Solvers","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Formal Methods in Verification","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":"Blackberry (Canada)","funders":"","keywords":"Undecidable problem; Correctness; Decidability; Satisfiability; Boolean satisfiability problem; Integer (computer science); Satisfiability modulo theories; Model checking; Modulo","score_opus":0.04870011054934035,"score_gpt":0.2774841647500175,"score_spread":0.22878405420067718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7029046129","genre_codex":"empirical","genre_gemma":"methods","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.7818536,0.0000060818506,0.21627147,0.00008519426,0.00089664815,0.00040552483,0.00002446131,0.00021941433,0.0002375811],"genre_scores_gemma":[0.014147823,0.000027617722,0.7105491,0.000041405587,0.000027693048,0.0000014134797,0.00019156568,0.0000504195,0.27496293],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819434,0.00006274509,0.00020140123,0.00063482666,0.00048990804,0.0004167985],"domain_scores_gemma":[0.998516,0.000037728078,0.00037311856,0.00071648986,0.00021272144,0.00014388992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003720358,0.00027306427,0.00035606668,0.0007494914,0.00031341394,0.00006878388,0.0014375894,0.00027759757,0.000016265367],"category_scores_gemma":[0.000046231642,0.00036044844,0.00016035515,0.0007765049,0.00003341322,0.0007123644,0.00033105176,0.00025536807,0.000112311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045139773,0.000249022,0.00038173396,0.0014452836,0.0006225329,0.00013337519,0.62537557,0.15358563,0.15281723,0.013943248,0.0021810804,0.048813898],"study_design_scores_gemma":[0.00039134163,0.000091363516,0.0013059671,0.00024677665,0.00007857486,6.466712e-7,0.022076514,0.9685697,0.0062439465,0.0004539273,0.00006375096,0.0004774778],"about_ca_topic_score_codex":0.008575403,"about_ca_topic_score_gemma":0.002535481,"teacher_disagreement_score":0.8149841,"about_ca_system_score_codex":0.0002363788,"about_ca_system_score_gemma":0.00014908452,"threshold_uncertainty_score":0.9998847},"labels":[],"label_agreement":null},{"id":"W7030150816","doi":"","title":"On the Microeconomics of Specialization","year":2004,"lang":"en","type":"article","venue":"Research Portal (Queen's University Belfast)","topic":"Formal Methods in Verification","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":"Queen's University","funders":"","keywords":"Production (economics); Productivity; Work (physics); Selection (genetic algorithm); Government (linguistics)","score_opus":0.038460119201860106,"score_gpt":0.30026725937015775,"score_spread":0.26180714016829765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030150816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46972716,0.0000060733228,0.45752215,0.007950836,0.00031118936,0.0007556206,0.000022032811,0.00012313873,0.0635818],"genre_scores_gemma":[0.9494507,0.00008197642,0.04893225,0.00007133917,0.000056420326,0.0000010931335,0.0000072496487,0.000010021553,0.0013889931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859726,0.00026670832,0.00014948935,0.00027406611,0.00042806947,0.00028443156],"domain_scores_gemma":[0.9987239,0.0001892785,0.00010568262,0.0006372799,0.000260663,0.00008318967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001192576,0.00008389834,0.00010789759,0.00029535312,0.00030454254,0.000050614628,0.0012114198,0.00006884257,0.00006468669],"category_scores_gemma":[0.00022784983,0.00007632325,0.00006203715,0.00077069516,0.00026029223,0.0004753348,0.0003369096,0.00028219807,0.000086238775],"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.00001886073,0.000063842985,0.000110977,0.0000075035096,0.000010415197,0.000016861113,0.00027628086,0.00049035373,0.00026821176,0.9970794,0.000826906,0.0008304251],"study_design_scores_gemma":[0.0058522616,0.0034053775,0.08020181,0.00053234084,0.000050164388,0.000051091556,0.007659972,0.010818181,0.34614342,0.38781506,0.1555365,0.001933824],"about_ca_topic_score_codex":0.00028239354,"about_ca_topic_score_gemma":0.0000089599025,"teacher_disagreement_score":0.6092643,"about_ca_system_score_codex":0.00021711172,"about_ca_system_score_gemma":0.00026585505,"threshold_uncertainty_score":0.31123722},"labels":[],"label_agreement":null},{"id":"W7033872003","doi":"","title":"Soluciones locales para un problema global. Los mejores ejemplos de lucha contra el extremismo en barrios empobrecidos y multiétnicos","year":2022,"lang":"en","type":"article","venue":"Dialnet (Universidad de la Rioja)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ethnic group; Poverty; Disconnection; Social exclusion; Civil society; Qualitative research","score_opus":0.01578502348561515,"score_gpt":0.28526816301106345,"score_spread":0.2694831395254483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033872003","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.117666006,0.0006006512,0.8729789,0.0016352282,0.00049025903,0.0010043653,0.000111326975,0.00063543045,0.0048778155],"genre_scores_gemma":[0.710071,0.00008475112,0.28876793,0.00057202205,0.00009832251,0.0001312597,0.000023903724,0.0000319712,0.00021880066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955915,0.0017987456,0.00036679333,0.00077384256,0.0006785843,0.0007904938],"domain_scores_gemma":[0.9977045,0.00057102344,0.00030393654,0.0009799793,0.000115415445,0.00032516624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001711006,0.00035437092,0.00039279723,0.00024179136,0.0007260888,0.00019905408,0.0022630123,0.00022882746,0.00018380988],"category_scores_gemma":[0.00029417427,0.00041459242,0.00020104546,0.00095972366,0.00023206617,0.00084452913,0.000921953,0.0005278316,0.00004318355],"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.0004486869,0.0009958209,0.011224004,0.0002064242,0.00035840724,0.0007775868,0.014800399,0.008596875,0.015894815,0.7115754,0.0057467725,0.2293748],"study_design_scores_gemma":[0.006103551,0.0006674318,0.087499976,0.00012369068,0.00020353739,0.0007212891,0.0035506217,0.7294156,0.011658098,0.060904194,0.09708665,0.002065361],"about_ca_topic_score_codex":0.00025965454,"about_ca_topic_score_gemma":0.00005021023,"teacher_disagreement_score":0.7208187,"about_ca_system_score_codex":0.0008941755,"about_ca_system_score_gemma":0.00046089923,"threshold_uncertainty_score":0.9998306},"labels":[],"label_agreement":null},{"id":"W7034192385","doi":"","title":"Static verification of concurrent system design","year":2008,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Formal Methods in Verification","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":"McGill University","funders":"","keywords":"Deadlock; Sequence diagram; Synchronization (alternating current); Systems design; Concurrent engineering; Sequence (biology); Deadlock prevention algorithms; Concurrency; Object (grammar)","score_opus":0.04542081757740958,"score_gpt":0.280528846956667,"score_spread":0.23510802937925745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034192385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67278844,0.0033093905,0.096679516,0.000052046864,0.038048986,0.01368979,0.0025643134,0.0056857206,0.16718177],"genre_scores_gemma":[0.7514647,0.00034577743,0.24623106,0.000041130144,0.00003321324,0.0003456471,0.0004093311,0.00012715856,0.0010019344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9936253,0.001362985,0.0016859057,0.0013121885,0.0013764263,0.00063718826],"domain_scores_gemma":[0.99445117,0.00039849893,0.001963928,0.0019256705,0.0009845289,0.00027618927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020336565,0.0007272747,0.000936411,0.000617072,0.0007206861,0.00009485186,0.002404293,0.0006777937,0.000018731322],"category_scores_gemma":[0.00088687835,0.0007946452,0.00031445306,0.0011697954,0.000093424846,0.0014701225,0.00014733445,0.0010023352,0.0002697159],"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.00007552747,0.00019224285,0.0000023208693,0.0012832892,0.00012119996,0.000021978438,0.000063169005,0.0002795889,0.025078151,0.7145245,0.000014449059,0.25834355],"study_design_scores_gemma":[0.0017351147,0.00087486417,0.0016003179,0.002419177,0.00032338043,0.00018124882,0.00071004406,0.030225787,0.92943823,0.0101586,0.01962238,0.0027108716],"about_ca_topic_score_codex":0.00008355547,"about_ca_topic_score_gemma":0.000013885636,"teacher_disagreement_score":0.90436006,"about_ca_system_score_codex":0.0010801484,"about_ca_system_score_gemma":0.00020223351,"threshold_uncertainty_score":0.99945045},"labels":[],"label_agreement":null},{"id":"W7034288389","doi":"","title":"‘There is no such place as away’: residential deconstruction as a method for waste diversion in Canada’s built environment","year":2024,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Deconstruction (building); Demolition; Context (archaeology); Municipal solid waste; Demolition waste; Single-family detached home; Cleaner production; Waste collection; Work (physics)","score_opus":0.012659795278278641,"score_gpt":0.24185733124448539,"score_spread":0.22919753596620673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034288389","genre_codex":"empirical","genre_gemma":"methods","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.8049977,0.00039613387,0.18169945,0.0015194949,0.0041851797,0.0014379836,0.0000993455,0.00009845816,0.0055662915],"genre_scores_gemma":[0.059579715,0.00070512056,0.9200437,0.00010872151,0.00020612356,0.0000107443775,0.00031716115,0.0000840533,0.018944668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997936,0.00019020612,0.00021259439,0.0007362159,0.0006186231,0.00030632463],"domain_scores_gemma":[0.99868333,0.000118432734,0.0003896857,0.00057641,0.00013108675,0.000101045516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046979848,0.00027387738,0.00036529786,0.00038711002,0.00022752467,0.000057126148,0.0010463104,0.00028297436,0.00004286265],"category_scores_gemma":[0.00005698092,0.00037363695,0.00014488999,0.0002979797,0.000039820978,0.00052329036,0.00025656229,0.0003489233,0.00013709335],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01045844,0.0009169072,0.018821266,0.014475361,0.0026340247,0.0017426527,0.05315761,0.010802178,0.028409071,0.10603286,0.28435352,0.46819612],"study_design_scores_gemma":[0.0056760474,0.0015560922,0.08913572,0.0027519607,0.0011373481,0.00014395229,0.3167905,0.37109506,0.06121847,0.0108792465,0.13570085,0.0039147674],"about_ca_topic_score_codex":0.7792199,"about_ca_topic_score_gemma":0.9838531,"teacher_disagreement_score":0.74541795,"about_ca_system_score_codex":0.001627077,"about_ca_system_score_gemma":0.0014351429,"threshold_uncertainty_score":0.99987155},"labels":[],"label_agreement":null},{"id":"W7036301429","doi":"","title":"Associations entre la qualité alimentaire en début de grossesse, l'adiposité abdominale, l'homéostasie glycémique et d'autres variables métaboliques pendant la grossesse","year":2023,"lang":"fr","type":"other","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Instituto Danone; Danone Institute of Canada; Canadian Institutes of Health Research; Université Laval; Danone","keywords":"Food intake; Congenital disease; Context (archaeology)","score_opus":0.028252198352013317,"score_gpt":0.3523203532476211,"score_spread":0.3240681548956078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036301429","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.0027828577,0.00164907,0.69076246,0.0044014133,0.0023248382,0.0015817577,0.0011000291,0.0025741586,0.29282337],"genre_scores_gemma":[0.0059992326,0.005250262,0.6226367,0.0013101829,0.0010439744,0.00048633636,0.00025575378,0.0008828303,0.36213478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9871863,0.007207449,0.0015201701,0.0016408499,0.0010384681,0.0014067707],"domain_scores_gemma":[0.99033475,0.0059218258,0.0013324782,0.0015478707,0.0004241187,0.0004389413],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0071203117,0.0011719909,0.0012710455,0.000584692,0.00055175985,0.002014354,0.0026297115,0.0016031655,0.0019173875],"category_scores_gemma":[0.0019186847,0.0012057086,0.00045980664,0.0014152675,0.00045295816,0.0017634332,0.0010892975,0.0013385095,0.0005870025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003340328,0.0006283751,0.0031969117,0.0003476346,0.0006119572,0.000269665,0.007300804,0.00015559084,0.0020897817,0.9495306,0.013642607,0.022192683],"study_design_scores_gemma":[0.0021998137,0.00040444266,0.115874246,0.002550254,0.0010587143,0.0010203033,0.0021293962,0.015799493,0.031397212,0.04963893,0.77402157,0.0039056193],"about_ca_topic_score_codex":0.00690704,"about_ca_topic_score_gemma":0.0040490776,"teacher_disagreement_score":0.8998917,"about_ca_system_score_codex":0.0010957632,"about_ca_system_score_gemma":0.0017682064,"threshold_uncertainty_score":0.99970603},"labels":[],"label_agreement":null},{"id":"W7036499993","doi":"","title":"Canada VMap1, Library 16: Storage Points","year":2016,"lang":"en","type":"other","venue":"The Faculty Digital Archive (New York University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scale (ratio); Product (mathematics); Vector map; Geographic information system; Base (topology); Natural resource; Digital mapping","score_opus":0.018505091103671257,"score_gpt":0.20538602393744262,"score_spread":0.18688093283377136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036499993","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007707244,0.000027135087,0.25590995,0.00076220825,0.00035496696,0.00022272227,0.0014914303,0.00033680582,0.7408871],"genre_scores_gemma":[0.00020952322,0.000015445408,0.033888582,0.00026734543,0.00019844853,5.3123176e-7,0.00020094395,0.00011053366,0.96510863],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984101,0.0001294178,0.00016103157,0.00051654107,0.0003931605,0.00038975486],"domain_scores_gemma":[0.998373,0.00011636262,0.00027799825,0.0009647392,0.0000138406385,0.0002540891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053153723,0.00033136044,0.00026146258,0.0002848205,0.00014485787,0.00022621056,0.0033978603,0.00010070411,0.0003272835],"category_scores_gemma":[0.000034464098,0.00024002226,0.00012798009,0.00042840373,0.00018604033,0.0008541284,0.001043634,0.00026489075,0.00044846503],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013543959,0.000012337365,0.000036180656,0.000012216025,0.0000541547,0.00003974628,0.00009540477,0.0000021621013,0.000001937474,0.09244187,0.88780266,0.019487754],"study_design_scores_gemma":[0.00024075812,0.000026044649,0.00011591583,0.000090923786,0.000012206996,0.000008513197,0.00005724778,0.0000535111,0.000030429095,0.0025191223,0.9965024,0.0003429421],"about_ca_topic_score_codex":0.04203116,"about_ca_topic_score_gemma":0.023615506,"teacher_disagreement_score":0.22422156,"about_ca_system_score_codex":0.00021715453,"about_ca_system_score_gemma":0.0010891681,"threshold_uncertainty_score":0.99420094},"labels":[],"label_agreement":null},{"id":"W7036929673","doi":"","title":"Dimensões de inovações organizacionais e sociais no processo de certificação fair trade: o caso da Casa Apis","year":2016,"lang":"en","type":"article","venue":"Americanae (AECID Library)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Fair trade; Certification; Triangulation; Inclusion (mineral); Social innovation; Content analysis; Process (computing); Obstacle; Qualitative research; Social responsibility","score_opus":0.015814843615229328,"score_gpt":0.24776528129093178,"score_spread":0.23195043767570245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036929673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4406436,0.000288897,0.5385878,0.015276485,0.00062802876,0.00044230116,0.000044084238,0.001567324,0.0025214832],"genre_scores_gemma":[0.661471,0.00012809756,0.33532962,0.0018405651,0.00016467489,0.00005730357,0.00000606577,0.000060736384,0.00094189943],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9972171,0.00030946446,0.0004639717,0.0007594085,0.00042415792,0.00082589913],"domain_scores_gemma":[0.9979421,0.00030472482,0.00032925757,0.0010034131,0.00007550222,0.00034501625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031699718,0.00034278282,0.00037621259,0.0002069708,0.00026678064,0.00015994739,0.0018707423,0.0001501814,0.0003655289],"category_scores_gemma":[0.00042995816,0.00027224227,0.00011368717,0.0014890229,0.0003887487,0.0030255301,0.00037423064,0.00021909304,0.0003228353],"study_design_candidate":"observational","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.000074360185,0.0004137036,0.26368782,0.00012273705,0.00020498513,0.00016491149,0.0068000364,0.000018057428,0.06376111,0.07674162,0.0876435,0.50036716],"study_design_scores_gemma":[0.0010569644,0.0006734328,0.6499255,0.00015178887,0.000059094098,0.00023714878,0.0004736524,0.0059387973,0.29016995,0.0088022575,0.040604364,0.0019070379],"about_ca_topic_score_codex":0.0011346331,"about_ca_topic_score_gemma":0.000004654473,"teacher_disagreement_score":0.49846014,"about_ca_system_score_codex":0.00021112397,"about_ca_system_score_gemma":0.00057355827,"threshold_uncertainty_score":0.999973},"labels":[],"label_agreement":null},{"id":"W7038543379","doi":"","title":"The influence of physicians on medication adherence","year":2021,"lang":"en","type":"dissertation","venue":"University Library (University of Saskatchewan)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Medication adherence; Health care; Population; Multiple Chronic Conditions; MEDLINE; Statin; Retrospective cohort study; Cohort study; Cohort","score_opus":0.008650336918811473,"score_gpt":0.203290830820576,"score_spread":0.19464049390176452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038543379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9702043,0.00016948908,0.014307161,0.0007737783,0.0007432724,0.00038921187,0.00007711935,0.00020310999,0.013132571],"genre_scores_gemma":[0.86007196,0.001007105,0.09154086,0.0000808807,0.000036902216,1.6712589e-7,0.00034617382,0.000023089708,0.04689286],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9984232,0.0002468709,0.00018344706,0.00044687252,0.0004979744,0.00020163484],"domain_scores_gemma":[0.99773145,0.00023745644,0.0007762819,0.0009728234,0.00021894307,0.00006306548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016533217,0.0001969964,0.00031803612,0.00022512201,0.00038503387,0.00003071869,0.0027407366,0.00025469848,0.00004071526],"category_scores_gemma":[0.00003372159,0.00023208266,0.00019006136,0.00091448234,0.00027190297,0.0018100932,0.00028415103,0.0003650788,0.00001858409],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.002098961,0.0013008955,0.0027194966,0.0019972476,0.0011223397,0.00031345093,0.36835936,0.00264115,0.013441955,0.2452234,0.010552233,0.35022953],"study_design_scores_gemma":[0.002100791,0.0011250079,0.203024,0.0029778301,0.00037790343,0.0000067673272,0.68361545,0.0049841134,0.048193097,0.005282745,0.046541896,0.0017704258],"about_ca_topic_score_codex":0.0004110552,"about_ca_topic_score_gemma":0.00047604408,"teacher_disagreement_score":0.3484591,"about_ca_system_score_codex":0.00006081131,"about_ca_system_score_gemma":0.0006974809,"threshold_uncertainty_score":0.94640565},"labels":[],"label_agreement":null},{"id":"W7038831514","doi":"","title":"\"Kyl joka mimmist voi tulla kui hyvä vaan\" : dialoginen analyysi sukupuolisuudesta skeittaamaan oppimisessa","year":2016,"lang":"en","type":"other","venue":"Työväentutkimus Vuosikirja","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Dialogical self; Negotiation; Focus group; Social relation; Qualitative research; Social practice; Order (exchange); Period (music)","score_opus":0.014711308173241924,"score_gpt":0.2902766176749,"score_spread":0.2755653095016581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038831514","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003077893,0.0014468455,0.30487737,0.0009492925,0.002619349,0.0010193327,0.00018756677,0.0018919818,0.6869775],"genre_scores_gemma":[0.0029942822,0.001830997,0.17108421,0.001327665,0.0031739238,0.0003002129,0.00023841248,0.0012403281,0.81780994],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9930133,0.0006336044,0.001159673,0.0021836918,0.0014512737,0.0015584617],"domain_scores_gemma":[0.9932423,0.00028004358,0.0012139396,0.004371282,0.0002463242,0.00064605987],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0012513988,0.0013297827,0.0013551702,0.0012015091,0.00030829804,0.0005911914,0.0056671756,0.0010503706,0.0031867817],"category_scores_gemma":[0.00037087043,0.0011457151,0.0005534499,0.0011330501,0.00050584675,0.0007648761,0.0012014005,0.00079823384,0.0043986207],"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.0000301094,0.00024494765,0.00026123508,0.0002801805,0.0002817159,0.00009607991,0.00019215746,0.000016062946,0.00052925356,0.11919568,0.82949483,0.04937775],"study_design_scores_gemma":[0.001001732,0.00013487898,0.0004868755,0.00043211272,0.00013260491,0.000052360756,0.000019875131,0.0014193726,0.00074650254,0.0017854767,0.9921782,0.0016100244],"about_ca_topic_score_codex":0.00050257257,"about_ca_topic_score_gemma":0.000114764494,"teacher_disagreement_score":0.16268335,"about_ca_system_score_codex":0.00050850277,"about_ca_system_score_gemma":0.0004659392,"threshold_uncertainty_score":0.99994534},"labels":[],"label_agreement":null},{"id":"W7039353198","doi":"","title":"Making sense of illness in the absence of diagnosis : patients' and physicians' narratives of medically unexplained symptoms","year":2006,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Canadian Institutes of Health Research; Hôpitaux Universitaires de Genève; McGill University","keywords":"Narrative; Disease; Mental illness; MEDLINE","score_opus":0.01589752306359754,"score_gpt":0.2721401401114514,"score_spread":0.25624261704785384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039353198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940174,0.00014450916,0.00009397047,0.000014583778,0.00048603077,0.00064673927,0.00019264701,0.00003330946,0.0043707835],"genre_scores_gemma":[0.97743547,0.000069705304,0.022148712,0.000055759978,0.000010569294,0.00012036256,0.00009024005,0.00003395893,0.000035244986],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9956327,0.000948316,0.001295386,0.0006607624,0.0011246408,0.00033817024],"domain_scores_gemma":[0.99609804,0.0007087921,0.0017308083,0.000833753,0.00057936576,0.00004923949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016791554,0.0004093319,0.000751648,0.0004050523,0.0002374652,0.00002997854,0.001247163,0.00035466053,0.000005119073],"category_scores_gemma":[0.0011360139,0.00035338497,0.00016551837,0.0011973804,0.00024006992,0.00080377253,0.0001589972,0.0006023252,0.0000012043567],"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.00017243947,0.0010169384,0.0018880828,0.0015726674,0.00012439233,0.000015854017,0.0031407962,0.0001044386,0.019737061,0.47547963,0.0000031183858,0.49674457],"study_design_scores_gemma":[0.0038886582,0.0018041697,0.3114694,0.009174424,0.00022327929,0.000020436017,0.011618633,0.0023174782,0.56582135,0.08859494,0.0021978484,0.002869366],"about_ca_topic_score_codex":0.00015383222,"about_ca_topic_score_gemma":0.00023667916,"teacher_disagreement_score":0.5460843,"about_ca_system_score_codex":0.0001017502,"about_ca_system_score_gemma":0.00004368583,"threshold_uncertainty_score":0.9998918},"labels":[],"label_agreement":null},{"id":"W7039636885","doi":"","title":"MidAmerican Transmission Enters Joint Venture In Canada","year":2012,"lang":"en","type":"other","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Joint (building); Government (linguistics); Joint venture; Transmission (telecommunications)","score_opus":0.01666623376765039,"score_gpt":0.23259051808574593,"score_spread":0.21592428431809554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039636885","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.0000050391386,0.00043453445,0.53565234,0.00021902831,0.0008263707,0.00014897452,0.000002219008,0.00007898483,0.4626325],"genre_scores_gemma":[0.0009201703,0.00009600294,0.7862182,0.00047489852,0.00008670243,0.00001740051,0.0000062802746,0.00009719615,0.21208315],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990624,0.00008029264,0.0001633658,0.00023365661,0.00022746397,0.00023280291],"domain_scores_gemma":[0.999339,0.000007967158,0.00011145414,0.0004388696,0.000006090961,0.000096608295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012637058,0.00014349913,0.0001789689,0.00013764476,0.000010301996,0.000014236134,0.0005369363,0.000081321596,0.00081526896],"category_scores_gemma":[0.000005629412,0.00012030789,0.000030634925,0.00020813319,0.000014171211,0.000072429364,0.000046596597,0.00016955732,0.000022644066],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022578156,0.000038334754,0.00025783182,0.000088712004,0.000014145127,0.000010916682,0.00026124786,0.000009379547,0.00013907017,0.0088065835,0.49818403,0.4921875],"study_design_scores_gemma":[0.000074256284,0.000008541407,0.0008632612,0.000093570154,0.0000020635237,0.000003411811,0.000020364012,0.0020897875,0.0003762778,0.000024130337,0.9962684,0.00017596383],"about_ca_topic_score_codex":0.8265603,"about_ca_topic_score_gemma":0.47295153,"teacher_disagreement_score":0.49808434,"about_ca_system_score_codex":0.00032465966,"about_ca_system_score_gemma":0.000367142,"threshold_uncertainty_score":0.89266235},"labels":[],"label_agreement":null},{"id":"W7043173380","doi":"","title":"An SCL-Based Constraint Representation Language for Intrusion Detection","year":2017,"lang":"en","type":"dissertation","venue":"QSpace (Queen's University Library)","topic":"Formal Methods in Verification","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":"Queen's University","funders":"U.S. Department of Defense","keywords":"Constraint (computer-aided design); Digital subscriber line; Constraint programming; Focus (optics); Representation (politics); Constraint graph; Context (archaeology); Constraint logic programming; Java; Domain (mathematical analysis)","score_opus":0.01437398323047326,"score_gpt":0.2690332464868546,"score_spread":0.25465926325638133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043173380","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.06026482,0.000014908959,0.9219492,0.0035442105,0.0021105625,0.0016053062,0.00008703903,0.0011683432,0.00925558],"genre_scores_gemma":[0.29886264,0.000052383293,0.65219504,0.000118473676,0.0002587729,0.000019172094,0.0022867848,0.000082118306,0.046124656],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998035,0.0002985364,0.00020745119,0.00082772004,0.00032666037,0.00030463128],"domain_scores_gemma":[0.9974717,0.00012264357,0.00065684336,0.0014323081,0.0001453238,0.00017118275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018456222,0.00030764146,0.00031095263,0.0005485672,0.0006528798,0.0004332614,0.001576846,0.00044223407,0.000051683117],"category_scores_gemma":[0.00014521416,0.0003713847,0.0001839775,0.00033711124,0.00008599327,0.0042410316,0.000078973426,0.0003346232,0.000018339944],"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.0033827287,0.0007262043,0.0007797574,0.0014590733,0.00024092804,0.00024125137,0.011646488,0.0014048424,0.013190401,0.10546527,0.018634325,0.84282875],"study_design_scores_gemma":[0.002855672,0.0014114319,0.014671079,0.0005324388,0.00022796936,0.0000019057156,0.0069688214,0.041932188,0.873205,0.0027933994,0.05329537,0.0021047278],"about_ca_topic_score_codex":0.0013238619,"about_ca_topic_score_gemma":0.00011498487,"teacher_disagreement_score":0.8600146,"about_ca_system_score_codex":0.00014997557,"about_ca_system_score_gemma":0.00036985052,"threshold_uncertainty_score":0.9998738},"labels":[],"label_agreement":null},{"id":"W7043192945","doi":"","title":"Shooting near The 606 leads to arrest","year":2015,"lang":"en","type":"other","venue":"Internet Archive (Internet Archive)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Officer; Block (permutation group theory); Accidental; Quarter (Canadian coin); Gun violence","score_opus":0.030561002135747077,"score_gpt":0.29136211518103844,"score_spread":0.26080111304529136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043192945","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000120551245,0.00014661018,0.44175714,0.00034544966,0.0024033345,0.0007328528,0.00011916942,0.0005397937,0.5538351],"genre_scores_gemma":[0.0016769428,0.000014795098,0.29404512,0.0009445137,0.0009056975,0.0001332198,0.000113431204,0.00038694005,0.7017793],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99484026,0.00095084275,0.000805264,0.0014944205,0.0009109681,0.0009982276],"domain_scores_gemma":[0.9959675,0.00043516685,0.0005877179,0.0024027694,0.00008528956,0.0005215647],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010871851,0.0008471558,0.0007161242,0.0005828051,0.00009933085,0.0010009734,0.007031651,0.0001994899,0.00091884175],"category_scores_gemma":[0.0005200592,0.00065415766,0.00031703326,0.00042133522,0.0006899828,0.00023631648,0.00347644,0.0012561035,0.0072375564],"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.000046918416,0.00006008457,0.000107602034,0.000054125772,0.00011333457,0.000041384275,0.007456076,0.00005624095,0.00011000964,0.02985244,0.95922613,0.002875632],"study_design_scores_gemma":[0.00027234986,0.00030782484,0.0002101005,0.00072491914,0.000029943367,0.00006260222,0.000038294194,0.039112497,0.00028899143,0.0025369327,0.9556885,0.0007270475],"about_ca_topic_score_codex":0.005765292,"about_ca_topic_score_gemma":0.0077153016,"teacher_disagreement_score":0.14794423,"about_ca_system_score_codex":0.00011248512,"about_ca_system_score_gemma":0.0002893734,"threshold_uncertainty_score":0.99999446},"labels":[],"label_agreement":null},{"id":"W7046442857","doi":"","title":"Decentralized Crash-Resilient Runtime Verification","year":2017,"lang":"en","type":"dissertation","venue":"MacSphere (McMaster University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"","score_opus":0.021243495879191204,"score_gpt":0.2604139779469768,"score_spread":0.2391704820677856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7046442857","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018508963,0.00022771306,0.12433031,0.00007930327,0.0026185513,0.000659569,0.000016043161,0.0004025502,0.86981505],"genre_scores_gemma":[0.00475959,0.00020390477,0.11586902,0.000047381393,0.000090466594,0.000005931776,0.00024652816,0.000050667797,0.8787265],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997379,0.00024138397,0.0003987797,0.0009687926,0.0005228399,0.0004892126],"domain_scores_gemma":[0.9969228,0.00004136334,0.00082802377,0.0017671465,0.0002475633,0.00019309208],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029558173,0.00044154207,0.00043313246,0.0003053043,0.0005489666,0.0004664964,0.0034237902,0.0004745315,0.013264228],"category_scores_gemma":[0.0000987981,0.0005196355,0.00022645932,0.00046069454,0.00007723428,0.0013192445,0.0001790846,0.00043691712,0.0005477242],"study_design_candidate":"not_applicable","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.0001438819,0.00010449455,0.00037754347,0.00016779106,0.00008188849,0.000050683342,0.00081323046,0.00003843212,0.0012367484,0.06284026,0.0013462862,0.93279874],"study_design_scores_gemma":[0.0009470025,0.000082424456,0.010893831,0.00017601505,0.00012082428,0.000006254,0.00044813895,0.00459002,0.007544136,0.0005224173,0.9738443,0.0008246402],"about_ca_topic_score_codex":0.0000880229,"about_ca_topic_score_gemma":0.00013043445,"teacher_disagreement_score":0.972498,"about_ca_system_score_codex":0.00033448375,"about_ca_system_score_gemma":0.00020882805,"threshold_uncertainty_score":0.9997255},"labels":[],"label_agreement":null},{"id":"W7066110447","doi":"","title":"Expressiveness in mobile process calculi","year":2001,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Formal Methods in Verification","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":true,"ca_institutions":"Bibliothèque et Archives nationales du Québec; McGill University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Process (computing); Order (exchange); Field (mathematics); Class (philosophy); Inheritance (genetic algorithm)","score_opus":0.021017797370448798,"score_gpt":0.2991660008796065,"score_spread":0.2781482035091577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7066110447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90141714,0.00065187697,0.00016690197,0.0000069344487,0.0032966698,0.0018144238,0.00017545301,0.0007087664,0.091761835],"genre_scores_gemma":[0.9125887,0.00064578943,0.067154154,0.00026673614,0.000120717064,0.003269082,0.0007011418,0.00033145706,0.014922216],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9941174,0.0006789154,0.0012183792,0.0018174076,0.0011772346,0.000990661],"domain_scores_gemma":[0.9962495,0.00019230695,0.00087475474,0.0017849474,0.00058214075,0.00031638186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015609607,0.00084419927,0.0008563317,0.0007969505,0.00066252606,0.00022806259,0.0033448604,0.0010386301,0.0000951266],"category_scores_gemma":[0.00078832125,0.0009285551,0.0002620426,0.0020452894,0.00006177906,0.0028272723,0.0002629593,0.0017976396,0.00028394928],"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.0001900501,0.0005037445,0.000059965714,0.0010322812,0.00007694683,0.0002842504,0.00013607366,0.001518553,0.023508452,0.31927273,0.0000037077348,0.65341324],"study_design_scores_gemma":[0.0028055748,0.0005788226,0.0033693155,0.0028060318,0.00012919326,0.00019020814,0.0012371484,0.006407915,0.773945,0.10853753,0.094951235,0.005042064],"about_ca_topic_score_codex":0.0001303782,"about_ca_topic_score_gemma":0.00023836395,"teacher_disagreement_score":0.7504365,"about_ca_system_score_codex":0.00079968106,"about_ca_system_score_gemma":0.00014318389,"threshold_uncertainty_score":0.9993165},"labels":[],"label_agreement":null},{"id":"W7070655296","doi":"","title":"Protocol modeling and recasting for handshaking circuits","year":2005,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Handshaking; Asynchronous communication; Protocol (science); Focus (optics); Handshake; Synchronization (alternating current); Data transmission; Asynchronous system","score_opus":0.06689107615937671,"score_gpt":0.3279760361467416,"score_spread":0.26108495998736486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7070655296","genre_codex":"protocol","genre_gemma":"methods","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.31776598,0.0005227442,0.04919293,0.000082941704,0.008270041,0.35010338,0.000862394,0.0047620567,0.26843753],"genre_scores_gemma":[0.19404626,0.000024291443,0.68810207,0.00021516654,0.0002546276,0.114894934,0.0001986153,0.00028833962,0.0019756907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99549097,0.00029244996,0.0011299213,0.0015647069,0.0006983925,0.00082357944],"domain_scores_gemma":[0.9969174,0.00027203342,0.00089442154,0.0010129922,0.00063881156,0.00026433807],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0024902788,0.00070400815,0.0006428319,0.00047823595,0.0016263319,0.00042520973,0.0013986294,0.00073732744,0.000011080058],"category_scores_gemma":[0.0017861478,0.0007797508,0.00022596019,0.00058121514,0.000029015202,0.0023841271,0.0002402178,0.0010899944,0.000024727791],"study_design_candidate":"design_other","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.000052641262,0.00005357104,0.0000020503435,0.00072074315,0.0000408662,0.000004288179,0.0000280063,0.0006090817,0.009275059,0.19308513,6.422102e-7,0.7961279],"study_design_scores_gemma":[0.0033030028,0.00054570544,0.00013022062,0.0030782218,0.00017926964,0.00013291129,0.00026076185,0.7313097,0.12057129,0.0876318,0.049484815,0.0033723132],"about_ca_topic_score_codex":0.000025309693,"about_ca_topic_score_gemma":0.000104468374,"teacher_disagreement_score":0.7927556,"about_ca_system_score_codex":0.00046898963,"about_ca_system_score_gemma":0.000083335704,"threshold_uncertainty_score":0.9996734},"labels":[],"label_agreement":null},{"id":"W7071192861","doi":"","title":"Runtime verification 7th International Workshop, RV 2007, Vancouver, Canada, March 13, 2007 ; revised selected papers","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Runtime verification; Formal verification; Software; Software verification; Context (archaeology)","score_opus":0.013367691927572842,"score_gpt":0.2674002270225395,"score_spread":0.25403253509496665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7071192861","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.0019268579,0.000079540885,0.91023135,0.0006776949,0.006415397,0.0003639722,0.0000052716473,0.00027659885,0.080023296],"genre_scores_gemma":[0.14064513,0.000068269175,0.83140683,0.001858248,0.0005525368,0.00003392983,0.00006328156,0.00003634968,0.02533542],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973456,0.000113932525,0.00055944733,0.0005897133,0.0008631585,0.0005281267],"domain_scores_gemma":[0.9979968,0.00022625091,0.00022731624,0.00082879077,0.000526609,0.00019424802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001577371,0.00021667611,0.00018473376,0.00020003747,0.00016984648,0.00012418636,0.0015114567,0.00012746861,0.0007225647],"category_scores_gemma":[0.00052927044,0.00021691906,0.00005019408,0.0011139989,0.000054158,0.00062495325,0.00016224956,0.00028964964,0.00007839926],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001691603,0.0002255118,0.0038290701,0.000040190138,0.00013313386,0.000035259574,0.00036539396,0.00057893345,0.008134482,0.035830766,0.7400813,0.21057676],"study_design_scores_gemma":[0.0009115302,0.00006436371,0.12110462,0.00005608593,0.000017937553,0.000022274902,0.0001971517,0.10084277,0.010272562,0.00023067933,0.76548356,0.00079644605],"about_ca_topic_score_codex":0.024289144,"about_ca_topic_score_gemma":0.1032795,"teacher_disagreement_score":0.20978032,"about_ca_system_score_codex":0.00067320256,"about_ca_system_score_gemma":0.0005636847,"threshold_uncertainty_score":0.9822082},"labels":[],"label_agreement":null},{"id":"W7071777083","doi":"","title":"A Symbolic Execution-Based Approach to Model Transformation Verification Using Structural Contracts","year":2018,"lang":"en","type":"dissertation","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transformation (genetics); Context (archaeology); Representation (politics); Key (lock); Set (abstract data type)","score_opus":0.026059820608894307,"score_gpt":0.2878755984725986,"score_spread":0.26181577786370425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7071777083","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.078387745,0.00018299223,0.9153897,0.00019133039,0.00053600356,0.0022161482,0.000060401875,0.00097000436,0.0020656579],"genre_scores_gemma":[0.3481832,0.00001370175,0.6495034,0.0005691793,0.00012210953,0.00072151725,0.0006114922,0.00007718698,0.00019815398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956779,0.00027527634,0.0011016492,0.0010884474,0.00094038824,0.0009163609],"domain_scores_gemma":[0.9961557,0.000055679902,0.00079643325,0.0018902529,0.0006690702,0.0004328995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012247275,0.00073063874,0.0006484064,0.0012392458,0.0005863551,0.0006391929,0.001937551,0.0009414763,0.0000054451784],"category_scores_gemma":[0.00028299418,0.00080132874,0.0002745756,0.0013833821,0.000065986365,0.001558404,0.00006677498,0.0006900855,0.000023138036],"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.00059897645,0.00044109832,0.00010520156,0.0006260148,0.00012416385,0.0000049307073,0.011050585,0.3904777,0.0689366,0.46374676,0.00060545997,0.06328255],"study_design_scores_gemma":[0.00036362393,0.00009664275,0.00235823,0.00013596195,0.00006397197,0.000024478117,0.00013265443,0.94849026,0.044431973,0.0028955801,0.00022813922,0.00077848457],"about_ca_topic_score_codex":0.0015450211,"about_ca_topic_score_gemma":0.00030635082,"teacher_disagreement_score":0.5580126,"about_ca_system_score_codex":0.0013135695,"about_ca_system_score_gemma":0.0010872826,"threshold_uncertainty_score":0.99944377},"labels":[],"label_agreement":null},{"id":"W7084138647","doi":"10.5281/zenodo.17242725","title":"CANADA 🇨🇦, AUSTRALIA 🇦🇺,UK 🇬🇧 WORK VISAS AVAILABLE CALL OR WHATSAPP MR PETER OBENDE ON ☎(08143870581).","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics)","score_opus":0.06049285733049312,"score_gpt":0.27854324267385433,"score_spread":0.2180503853433612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084138647","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013652452,0.00008180727,0.03681092,0.00041863046,0.0009832613,0.00071775494,0.0002982319,0.0011973451,0.9594784],"genre_scores_gemma":[0.0008800019,0.000106758445,0.026279282,0.00061877305,0.00028795566,2.528599e-7,0.00057505857,0.0027499571,0.968502],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99647146,0.0005909022,0.00040647993,0.0010078507,0.00085222744,0.00067108794],"domain_scores_gemma":[0.9972553,0.000051512703,0.00029055055,0.0017382782,0.00039177225,0.00027255467],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00073703076,0.00038985466,0.00033670265,0.000496242,0.00090738403,0.0013574782,0.0038381384,0.00024200045,0.07962348],"category_scores_gemma":[0.00079374877,0.00037492326,0.000071704264,0.0012217889,0.00012662282,0.00023685783,0.0017212523,0.0006510344,0.026300158],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004067173,0.000051970874,0.0000011456991,0.00009794196,0.000055739656,0.000035617395,0.00007799667,0.000019072644,0.000038293165,0.011252001,0.97066,0.017669605],"study_design_scores_gemma":[0.00028185206,0.00014877412,0.00006595673,0.0002658267,0.00001541735,0.00002445652,0.000011647872,0.00027968656,0.00023784053,0.000047328966,0.9982251,0.00039613334],"about_ca_topic_score_codex":0.016226968,"about_ca_topic_score_gemma":0.00095485203,"teacher_disagreement_score":0.05332332,"about_ca_system_score_codex":0.0006479013,"about_ca_system_score_gemma":0.00010053362,"threshold_uncertainty_score":0.99987024},"labels":[],"label_agreement":null},{"id":"W7096235370","doi":"","title":"A Case Study on Model Checking and Refinement of Abstract State Machines","year":2001,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"State (computer science); Model checking; Finite-state machine; Formal verification; Key (lock)","score_opus":0.10878769913827509,"score_gpt":0.3644723669336147,"score_spread":0.2556846677953396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096235370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65344554,0.000004432947,0.34442937,0.000028002534,0.000024389781,0.00009787249,3.268218e-7,0.000027462589,0.0019426098],"genre_scores_gemma":[0.7329814,0.0000036128592,0.26685935,0.000031656295,0.0000030865754,0.0000051482534,7.052591e-8,0.000002207855,0.00011347188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939966,0.000024878913,0.00017711145,0.00017197081,0.00013920869,0.00008719591],"domain_scores_gemma":[0.9995304,0.000025499392,0.000068812944,0.00031332034,0.0000326903,0.00002928947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047627796,0.00006347285,0.000077439,0.00006025073,0.000041716998,0.00002998444,0.00015228403,0.000010985111,0.0000040723253],"category_scores_gemma":[0.000020073183,0.0000495244,0.000011214209,0.0001105086,0.000012181182,0.00018228772,0.000083007384,0.00004855459,0.0000016734416],"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.00006430731,0.0015014657,0.012900268,0.00005127873,0.000048788334,0.0010557955,0.02132862,0.02603938,0.004903268,0.029568134,0.00006453632,0.90247416],"study_design_scores_gemma":[0.00026640337,0.00021472583,0.010103426,0.000006064706,0.0000027964902,0.00021899886,0.00022628998,0.98651755,0.0014859493,0.00086007855,0.00001784468,0.00007989612],"about_ca_topic_score_codex":0.00023285829,"about_ca_topic_score_gemma":0.000026772397,"teacher_disagreement_score":0.9604781,"about_ca_system_score_codex":0.000012134402,"about_ca_system_score_gemma":0.000009806933,"threshold_uncertainty_score":0.20195463},"labels":[],"label_agreement":null},{"id":"W7096963805","doi":"","title":"VaqUoT: A Tool for Vacuity Detection","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Set (abstract data type); State (computer science); Value (mathematics); Algebra over a field; Calculus (dental); Truth value","score_opus":0.030817315243402903,"score_gpt":0.3099704638847175,"score_spread":0.2791531486413146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096963805","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.00693419,0.0000067351693,0.9890806,0.00029707848,0.00024210986,0.00018369827,3.8146428e-7,0.00021534975,0.0030398746],"genre_scores_gemma":[0.25504026,0.0000010264258,0.74407923,0.00023450324,0.00008373676,0.00004162282,2.1763738e-7,0.0000023805856,0.00051703554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948955,0.000024448453,0.00011277265,0.00016462567,0.00008611025,0.0001225076],"domain_scores_gemma":[0.9995418,0.00004360672,0.00003434989,0.00030634427,0.000050930114,0.000022961658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044038414,0.000047635993,0.00004667818,0.000037399408,0.000076110024,0.000056603083,0.00029840195,0.00003476749,0.000013608067],"category_scores_gemma":[0.0000995758,0.00004252504,0.000034924153,0.00013323668,0.000008099846,0.0006030427,0.000044957982,0.000036534806,0.00007033685],"study_design_candidate":"design_other","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.00000334306,0.000016728467,0.00002080095,0.0000038730655,0.0000019008125,3.230048e-8,0.00007801543,0.00004495305,0.0035667738,0.15429126,0.00022160969,0.84175074],"study_design_scores_gemma":[0.00019262933,0.000073178264,0.0029461677,0.0000015725881,0.0000021804576,0.0000064952046,0.0000037091393,0.6733075,0.24845381,0.0059665246,0.06893209,0.00011419195],"about_ca_topic_score_codex":0.0000031439872,"about_ca_topic_score_gemma":0.000008209758,"teacher_disagreement_score":0.84163654,"about_ca_system_score_codex":0.00004578731,"about_ca_system_score_gemma":0.000012530974,"threshold_uncertainty_score":0.17341208},"labels":[],"label_agreement":null},{"id":"W7097233980","doi":"","title":"Game Research at McGill","year":2005,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Reachability; Petri net; Narrative; Automaton; Context (archaeology); Model checking; Representation (politics); Class (philosophy)","score_opus":0.2001537828674916,"score_gpt":0.437638931405798,"score_spread":0.2374851485383064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097233980","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.016211893,0.00004181493,0.5928067,0.0026527457,0.00019362713,0.0001312105,6.657121e-7,0.00027750197,0.38768384],"genre_scores_gemma":[0.1865185,0.000007368446,0.79869103,0.00030161356,0.00005035655,0.000008767875,2.5257924e-7,0.0000030171493,0.014419091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990202,0.00013518838,0.00010033692,0.00020544778,0.00031700797,0.00022178657],"domain_scores_gemma":[0.9991989,0.00007912304,0.00001529533,0.0005569213,0.00009195296,0.000057815752],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013778448,0.000038334463,0.000040997358,0.00008045927,0.00012532396,0.00003238054,0.0006914097,0.00003177046,0.00015220034],"category_scores_gemma":[0.00009256965,0.000032458007,0.000016903143,0.0003454605,0.000038782415,0.00042060818,0.0003748593,0.00010081991,0.0032347993],"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.0000017244624,0.00001867641,0.000027970806,0.000002246792,0.0000011329957,6.811587e-7,0.00010839375,0.00003239179,0.002024606,0.79389983,0.0052255127,0.19865681],"study_design_scores_gemma":[0.00008042604,0.00003703322,0.0014094526,0.0000029109697,2.5801648e-7,0.000011197276,0.0000056320873,0.13219506,0.09371283,0.0040969704,0.7683722,0.00007603601],"about_ca_topic_score_codex":0.000010652545,"about_ca_topic_score_gemma":0.000009153557,"teacher_disagreement_score":0.7898029,"about_ca_system_score_codex":0.0001297172,"about_ca_system_score_gemma":0.0000108753375,"threshold_uncertainty_score":0.9975413},"labels":[],"label_agreement":null},{"id":"W7106013273","doi":"10.48550/arxiv.2511.13245","title":"Proceedings Seventh International Workshop on Formal Methods for Autonomous Systems","year":2025,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Publication; Formal methods; Work (physics); International community","score_opus":0.1358241543724429,"score_gpt":0.29716438227319997,"score_spread":0.16134022790075706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106013273","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.0025563207,0.000082362625,0.9579739,0.00018352502,0.01277378,0.002465967,0.00008772479,0.00036588125,0.023510514],"genre_scores_gemma":[0.39848256,0.0002655193,0.5747815,0.00017639306,0.00047879576,0.000058667967,0.00004453854,0.000044588003,0.025667448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99440646,0.00041041698,0.0011039267,0.0027741264,0.0002516638,0.0010533754],"domain_scores_gemma":[0.99455017,0.0008202569,0.0014689411,0.0014809576,0.0013445257,0.00033513823],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0043802527,0.0008733353,0.0009048211,0.0011319357,0.0006755502,0.0007977105,0.0058484967,0.000948996,0.000033037],"category_scores_gemma":[0.00085276755,0.0010745651,0.00069912575,0.001482149,0.0002486849,0.0020590876,0.00338214,0.0013243412,0.00005722928],"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.00038976173,0.00024139168,0.00018590398,0.0005250644,0.0003062291,0.000008800469,0.00058824924,0.17181994,0.000026287247,0.7808739,0.00024008221,0.044794418],"study_design_scores_gemma":[0.0010017569,0.00019995507,0.00022372989,0.0007928437,0.00021184403,0.000011958568,0.00047995613,0.9497296,0.00048894546,0.013482081,0.032472637,0.0009046665],"about_ca_topic_score_codex":0.00004707825,"about_ca_topic_score_gemma":0.0000018291165,"teacher_disagreement_score":0.7779097,"about_ca_system_score_codex":0.0018325901,"about_ca_system_score_gemma":0.0006266481,"threshold_uncertainty_score":0.9995303},"labels":[],"label_agreement":null},{"id":"W7110343338","doi":"10.4230/lipics.concur.2025.19","title":"Time for Timed Monitorability","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Nondeterministic algorithm; Undecidable problem; Decidability; Automaton; Property (philosophy); Model checking; Finite-state machine; Temporal logic","score_opus":0.015610811169329131,"score_gpt":0.3057536024058803,"score_spread":0.2901427912365512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110343338","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.022738725,0.00003470955,0.96489257,0.00058815355,0.0018172888,0.0023806507,0.00024672877,0.00045394557,0.0068472107],"genre_scores_gemma":[0.062299646,0.000009941311,0.932726,0.001332414,0.00015498465,0.0008243427,0.0002622846,0.00003585037,0.0023544917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721265,0.00007360421,0.0012128408,0.00039454055,0.00037038853,0.0007360065],"domain_scores_gemma":[0.9970051,0.0004005755,0.00040104386,0.0014972864,0.0005431098,0.00015290295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001712877,0.00036316755,0.00046998824,0.0003190301,0.00043457185,0.0004146687,0.001958893,0.0002763732,0.000016647775],"category_scores_gemma":[0.00062743324,0.0003433901,0.0003099232,0.00059299474,0.00017681133,0.0020314583,0.00047449957,0.00028821602,0.00019951542],"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.00095395284,0.0019568296,0.0048877057,0.005156364,0.00087028835,0.000002571,0.019407222,0.00096201216,0.0017948046,0.4751994,0.08755892,0.40124992],"study_design_scores_gemma":[0.002838782,0.00029908118,0.0012759814,0.00014423089,0.000039932485,0.000009609391,0.0002910319,0.7759815,0.011213912,0.012030481,0.1952567,0.000618794],"about_ca_topic_score_codex":0.000005126296,"about_ca_topic_score_gemma":0.0000012632185,"teacher_disagreement_score":0.77501947,"about_ca_system_score_codex":0.0002494002,"about_ca_system_score_gemma":0.00017207001,"threshold_uncertainty_score":0.99990183},"labels":[],"label_agreement":null},{"id":"W7117276983","doi":"","title":"The Limitations and Power of NP-Oracle-Based Functional Synthesis Techniques","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Oracle; Tuple; Scalability; Set (abstract data type); Boolean function; Class (philosophy); Function (biology); Construct (python library)","score_opus":0.07686800602444017,"score_gpt":0.3022238584691346,"score_spread":0.22535585244469442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117276983","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.122810245,0.0014356631,0.8621368,0.0072039845,0.0010920301,0.00045272542,0.000009681192,0.00013219488,0.0047267075],"genre_scores_gemma":[0.84318656,0.0003854851,0.15542287,0.00044017014,0.000031056516,0.00012187133,0.0000010088384,0.000010582674,0.00040040052],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99791634,0.00043097313,0.00059138704,0.0004643784,0.00031225706,0.00028466393],"domain_scores_gemma":[0.9955624,0.0026082715,0.00031650765,0.000988477,0.00045994396,0.000064404216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016350574,0.00020580649,0.0002225087,0.00021979978,0.00067427836,0.00014508997,0.0006980399,0.00014998057,0.00002107905],"category_scores_gemma":[0.0025001876,0.00017106696,0.000112300404,0.000986423,0.000647529,0.00045703954,0.00024161677,0.0002499586,0.000021923324],"study_design_candidate":"observational","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.00018936051,0.0004343387,0.12992811,0.00018019465,0.00019081273,0.0000020204197,0.00074886857,0.00008220613,0.011316536,0.24421218,0.0018221489,0.6108932],"study_design_scores_gemma":[0.00021980758,0.00020324507,0.73429275,0.0002513712,0.00010384246,0.000004074571,0.00022055472,0.021764457,0.20927593,0.0034496852,0.029906807,0.0003074577],"about_ca_topic_score_codex":0.00001570037,"about_ca_topic_score_gemma":0.0000051131374,"teacher_disagreement_score":0.7203763,"about_ca_system_score_codex":0.000069888716,"about_ca_system_score_gemma":0.0003311019,"threshold_uncertainty_score":0.6975908},"labels":[],"label_agreement":null},{"id":"W7123345093","doi":"10.1109/cdc57313.2025.11312570","title":"Unraveling tensor structures in correct-by-design controller synthesis","year":2025,"lang":"","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"CODE","keywords":"Markov decision process; Probabilistic logic; Probabilistic automaton; State space; Curse of dimensionality; Leverage (statistics); Probabilistic CTL; Markov chain; Markov process","score_opus":0.027183487399345344,"score_gpt":0.2989786447209209,"score_spread":0.27179515732157555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7123345093","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.00062719494,0.0011257094,0.9832156,0.001036541,0.002472046,0.0009395254,0.000005894384,0.00013172448,0.010445765],"genre_scores_gemma":[0.459321,0.0001424923,0.5363901,0.00090877607,0.000039992956,0.00008345558,4.3670693e-7,0.0000149333155,0.003098811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533194,0.0013658294,0.0010822786,0.0010461039,0.00044130042,0.000732552],"domain_scores_gemma":[0.9962078,0.002208546,0.0002711404,0.0009566285,0.000239244,0.00011664541],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027174868,0.00043696654,0.00068727,0.0005939518,0.0002499167,0.00048013756,0.0016959945,0.00035231665,0.00026259673],"category_scores_gemma":[0.003332104,0.00040173088,0.00013686994,0.0017270437,0.00018260416,0.00057943456,0.0003129454,0.00049233646,0.00007386731],"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.00030872435,0.00016984035,0.0004489401,0.000099257486,0.000108404696,0.000007224144,0.0007888377,0.0083935205,0.009924057,0.22006486,0.008925427,0.7507609],"study_design_scores_gemma":[0.0007941843,0.000070347196,0.0021738482,0.00020112064,0.000040629846,0.000004551174,0.00020334865,0.8772016,0.106267504,0.010865731,0.0017441686,0.00043292678],"about_ca_topic_score_codex":0.00022194424,"about_ca_topic_score_gemma":0.000008232003,"teacher_disagreement_score":0.8688081,"about_ca_system_score_codex":0.00028272986,"about_ca_system_score_gemma":0.00034059386,"threshold_uncertainty_score":0.9998435},"labels":[],"label_agreement":null},{"id":"W7123354390","doi":"10.1109/cdc57313.2025.11312003","title":"Smooth Logic Constraints in Nonlinear Optimization and Optimal Control Problems","year":2025,"lang":"","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convergence (economics); Optimal control; Encoding (memory); Optimization problem; Control theory (sociology); Constrained optimization; Control (management); Nonlinear programming","score_opus":0.0215368397903801,"score_gpt":0.29064743354942374,"score_spread":0.2691105937590436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7123354390","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.0014158975,0.0004601137,0.98391473,0.0013719506,0.00065303285,0.0011076316,0.0000077603645,0.00008785317,0.01098104],"genre_scores_gemma":[0.19613999,0.0002069209,0.80241734,0.00079111394,0.000024356828,0.000038112245,0.0000031489071,0.000007704208,0.00037131447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972524,0.00041608888,0.0008184863,0.00079439225,0.00024072878,0.00047790463],"domain_scores_gemma":[0.9987296,0.00019598597,0.00021251409,0.0005475038,0.00020978611,0.000104633786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017026563,0.00028879673,0.0003938479,0.00040482567,0.00014837165,0.0003865772,0.00061041926,0.00025857397,0.00014033567],"category_scores_gemma":[0.00037698474,0.00028514455,0.00005041831,0.0011197855,0.0005805953,0.00083231955,0.00025094373,0.00033786794,0.000013418431],"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.000043928343,0.0002630995,0.0018441819,0.00015608057,0.000027326601,0.000006680628,0.00052693463,0.5771488,0.00022535429,0.24949676,0.000032681335,0.17022818],"study_design_scores_gemma":[0.001945604,0.0001456372,0.0021618342,0.00017025006,0.000018747662,0.000009045667,0.00008043081,0.99348325,0.00031115563,0.0011360768,0.00027669175,0.00026128007],"about_ca_topic_score_codex":0.0000404182,"about_ca_topic_score_gemma":0.000008757594,"teacher_disagreement_score":0.41633445,"about_ca_system_score_codex":0.000115734074,"about_ca_system_score_gemma":0.00031003798,"threshold_uncertainty_score":0.99996006},"labels":[],"label_agreement":null},{"id":"W7124168539","doi":"10.65109/fsai8221","title":"On the verification of social commitments and time","year":2011,"lang":"","type":"article","venue":"","topic":"Formal Methods in Verification","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":"Concordia University","funders":"","keywords":"Model checking; Binary decision diagram; Symbolic trajectory evaluation; Representation (politics); Modalities; Formal verification; Computation tree logic; Temporal logic","score_opus":0.08727473891793311,"score_gpt":0.28970248538933757,"score_spread":0.20242774647140446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124168539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16416213,0.00006668563,0.5186119,0.0012355937,0.0007464618,0.0009759398,0.000009713221,0.000075911594,0.31411567],"genre_scores_gemma":[0.888414,0.000013012209,0.11035418,0.00025397018,0.000022084494,0.000013446769,7.454776e-7,0.000006563797,0.0009219971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986152,0.00038408098,0.00031919,0.00026210563,0.0002602933,0.00015913736],"domain_scores_gemma":[0.99890465,0.00012371696,0.0002662518,0.00056788104,0.000100681005,0.000036835838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011384692,0.00012304817,0.00013849809,0.000053411004,0.00024330622,0.000044992816,0.00068316894,0.00008586256,0.00062036625],"category_scores_gemma":[0.00010704063,0.00008748225,0.00004224488,0.00025474204,0.00030794812,0.0002787261,0.0001669601,0.00012112174,0.00023138578],"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.000029446244,0.00013290858,0.000042399515,0.000009745965,0.000017406983,1.0717658e-7,0.0062276195,2.113803e-7,0.0009721852,0.9478208,0.0005620376,0.044185154],"study_design_scores_gemma":[0.0010987152,0.0019238833,0.2546719,0.00008794623,0.00009977803,0.000009008095,0.00064663566,0.39944947,0.21664092,0.12178457,0.0028222618,0.00076490844],"about_ca_topic_score_codex":0.000021257687,"about_ca_topic_score_gemma":2.494572e-7,"teacher_disagreement_score":0.8260362,"about_ca_system_score_codex":0.000025691617,"about_ca_system_score_gemma":0.00003043186,"threshold_uncertainty_score":0.6792575},"labels":[],"label_agreement":null},{"id":"W7124280466","doi":"10.65109/azkd1797","title":"Managing an Agent's Changing Intentions Using ltlf Synthesis","year":2025,"lang":"","type":"article","venue":"","topic":"Formal Methods in Verification","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":"York University","funders":"","keywords":"Exploit; Nondeterministic algorithm; Domain (mathematical analysis); Linear temporal logic; Temporal logic; Domain knowledge; Multi-agent system","score_opus":0.08121746610711375,"score_gpt":0.35667523328649253,"score_spread":0.27545776717937875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124280466","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.0052939197,0.00023306515,0.9544999,0.000888021,0.0036599664,0.00033716336,0.0000020426662,0.00027652667,0.034809366],"genre_scores_gemma":[0.3454964,0.00006712791,0.652241,0.00040580914,0.00007850703,0.000024689358,6.936865e-7,0.00001490651,0.0016708706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967015,0.000537743,0.0006466561,0.0008885944,0.00043764064,0.0007879142],"domain_scores_gemma":[0.9977484,0.00015061718,0.00021599869,0.0015242387,0.00021061373,0.0001501837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024233966,0.00030655443,0.00030643557,0.0014067522,0.001059008,0.00092082826,0.001592,0.00014010874,0.00019859028],"category_scores_gemma":[0.00039099177,0.00034249126,0.00017971075,0.0026093298,0.00014888107,0.0023485518,0.0010300323,0.00026654665,0.000066400935],"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.000006352935,0.00012524394,0.000118771764,0.00012683484,0.0000697342,0.0000061664828,0.0011242401,0.0015287412,0.0041787783,0.43581906,0.000030356965,0.55686575],"study_design_scores_gemma":[0.00008824176,0.000024329216,0.0005629828,0.00043380822,0.00010901946,0.000011559096,0.001356215,0.96943647,0.02137326,0.0056331567,0.0006456813,0.00032530274],"about_ca_topic_score_codex":0.00011366838,"about_ca_topic_score_gemma":0.000012055901,"teacher_disagreement_score":0.9679077,"about_ca_system_score_codex":0.00034234775,"about_ca_system_score_gemma":0.00019111477,"threshold_uncertainty_score":0.9999027},"labels":[],"label_agreement":null},{"id":"W7125768444","doi":"10.21428/594757db.6ae0c84a","title":"The QBF Cover encoding for Harary Tic-Tac-Toe’s","year":2025,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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é du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cover (algebra); Encoding (memory); Representation (politics); Semantics (computer science); Reduction (mathematics); Current (fluid); True quantified Boolean formula","score_opus":0.030137956347243974,"score_gpt":0.32820576328741685,"score_spread":0.2980678069401729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125768444","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.00021298022,0.00008070515,0.8969834,0.0020012066,0.0010291705,0.00020019243,5.7610004e-7,0.00010824777,0.09938356],"genre_scores_gemma":[0.0390899,0.000022380837,0.91717327,0.0015841069,0.00005516436,0.00008721708,7.746617e-7,0.000004445634,0.04198277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934155,0.000047755526,0.00015035401,0.00018195923,0.00010896669,0.00016940992],"domain_scores_gemma":[0.99893135,0.00043726244,0.00003981121,0.0005023494,0.00006798096,0.000021258564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007506301,0.000060782648,0.000060348404,0.00003813873,0.00027650708,0.00020155657,0.0008279326,0.000033903154,0.000008038843],"category_scores_gemma":[0.00031281108,0.00004038697,0.000043521773,0.00022598641,0.00003327164,0.00037307656,0.00015867162,0.000058692127,0.000047899986],"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.000004012289,0.0000067313836,0.000047823545,0.0000074839477,0.00000615743,1.216885e-7,0.00007646058,0.000023346629,0.00046641394,0.9241184,0.013914287,0.061328746],"study_design_scores_gemma":[0.00020634827,0.00003679359,0.0009881787,0.00001560145,0.0000054621078,0.0000016063674,0.000042588683,0.37616244,0.03140378,0.04625326,0.54476583,0.00011812404],"about_ca_topic_score_codex":0.000003643288,"about_ca_topic_score_gemma":9.857936e-7,"teacher_disagreement_score":0.87786514,"about_ca_system_score_codex":0.000032409454,"about_ca_system_score_gemma":0.00006108567,"threshold_uncertainty_score":0.21266969},"labels":[],"label_agreement":null},{"id":"W7125896959","doi":"10.1109/ase63991.2025.00110","title":"Agentic Specification Generator for Move Programs","year":2025,"lang":"","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Waterloo","funders":"","keywords":"Verifiable secret sharing; Toolchain; Key (lock); Code generation; Modular design; Specification language; Focus (optics); Generator (circuit theory); Programming language specification","score_opus":0.06807825008260023,"score_gpt":0.3411191454062153,"score_spread":0.2730408953236151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125896959","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.0017496728,0.0005807266,0.9755205,0.0013814319,0.0048468956,0.0024127234,0.0000042873835,0.00021423468,0.013289564],"genre_scores_gemma":[0.07669477,0.0000885339,0.9017176,0.00059043145,0.00025609363,0.0005064039,0.00001686041,0.00001648523,0.020112798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972509,0.00018923149,0.00077768473,0.0009416672,0.00030240166,0.0005381155],"domain_scores_gemma":[0.9975009,0.00009434992,0.00025947,0.0014996361,0.0005282799,0.00011735244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013608558,0.00028031724,0.00027287067,0.00024086636,0.00036031267,0.00079991744,0.001369734,0.00020327207,0.000065520646],"category_scores_gemma":[0.0002768456,0.00028482152,0.00019918634,0.0013938752,0.00013655788,0.00072338944,0.00024280707,0.00015323135,0.00014728382],"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.000014757226,0.00015658769,0.00006312352,0.00010228092,0.000028190389,2.21711e-7,0.00019301694,0.000020115942,0.0015320063,0.52046555,0.0016837738,0.4757404],"study_design_scores_gemma":[0.0005490844,0.00017732599,0.001935707,0.00007517716,0.000055019675,0.0000017939352,0.000086631844,0.797953,0.068725705,0.016943967,0.11315074,0.0003458693],"about_ca_topic_score_codex":0.0000111692625,"about_ca_topic_score_gemma":0.000003257251,"teacher_disagreement_score":0.79793286,"about_ca_system_score_codex":0.0002187354,"about_ca_system_score_gemma":0.0003004026,"threshold_uncertainty_score":0.9999604},"labels":[],"label_agreement":null},{"id":"W7126375877","doi":"10.21428/594757db.a4de9762","title":"Robust Reinforcement Learning for Linear Temporal Logic Specifications with Finite Trajectory Duration","year":2024,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Temporal logic; Linear temporal logic; Reinforcement learning; A priori and a posteriori; Variety (cybernetics); Trajectory; Limit (mathematics); Robot; Robotics","score_opus":0.14032904170133478,"score_gpt":0.30847531566858827,"score_spread":0.16814627396725348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126375877","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.00021383376,0.000051995197,0.9923618,0.00062614254,0.0002838799,0.00038324585,5.969939e-7,0.00048782266,0.0055907113],"genre_scores_gemma":[0.19587268,0.0000117368145,0.79992044,0.00007336511,0.000106662774,0.00011022184,0.00002880172,0.000010162176,0.0038659046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990074,0.000049828515,0.00026365698,0.00032472756,0.00018488594,0.00016949145],"domain_scores_gemma":[0.999305,0.00016058383,0.0000688907,0.00031751464,0.000103164006,0.00004481084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005523953,0.00010649843,0.000083655876,0.00013338675,0.0001692138,0.00020518254,0.00028903646,0.000046374334,0.000042854663],"category_scores_gemma":[0.00009921896,0.00008199631,0.000043984084,0.00042131,0.000032498298,0.00070555205,0.000033232594,0.00013779914,0.00007180241],"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.00001525431,0.000020316515,0.000065290194,0.00006557178,0.000017970866,0.0000019120077,0.0006365246,0.3360819,0.00051485177,0.6519587,0.0005040338,0.0101176435],"study_design_scores_gemma":[0.00010646543,0.00023421383,0.00021978361,0.00002511479,0.000006561986,0.000005576276,0.000066769106,0.97005945,0.0024055054,0.0006102203,0.02613035,0.00012996755],"about_ca_topic_score_codex":0.0000075989897,"about_ca_topic_score_gemma":0.00000757638,"teacher_disagreement_score":0.65134853,"about_ca_system_score_codex":0.00007129469,"about_ca_system_score_gemma":0.00008834632,"threshold_uncertainty_score":0.33437124},"labels":[],"label_agreement":null},{"id":"W7131243771","doi":"10.1109/jproc.2026.3659717","title":"Open-World Verification: A Grand Challenge for Autonomous Systems","year":2025,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Formal Methods in Verification","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":"Pleiades Robotics (Canada)","funders":"European Commission; Royal Academy of Engineering; Jet Propulsion Laboratory; UK Research and Innovation; California Institute of Technology; National Aeronautics and Space Administration","keywords":"Viewpoints; Automation; Robotics; Process (computing); Key (lock); Autonomy","score_opus":0.045669968706591874,"score_gpt":0.31760687458939624,"score_spread":0.2719369058828044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131243771","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.012610648,0.0012059789,0.7449352,0.012163247,0.008958754,0.0061706263,0.000015722675,0.00040771152,0.21353209],"genre_scores_gemma":[0.6824222,0.000024967047,0.30797264,0.00018517587,0.00010843387,0.00070101244,3.6651966e-7,0.0000131027755,0.008572073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910235,0.000009851307,0.00029299778,0.00029126793,0.00014660282,0.00015691601],"domain_scores_gemma":[0.9990021,0.000057133646,0.0002621282,0.00033099714,0.0003222302,0.000025421357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009316013,0.00009684689,0.00017364649,0.000102231716,0.00017544605,0.00027119747,0.003150212,0.000045057855,6.2652526e-7],"category_scores_gemma":[0.00014126732,0.00007435231,0.000060224,0.0005860598,0.000054529897,0.00061357184,0.0003241302,0.00008116126,0.0000025191778],"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.000019565165,0.00004646413,0.000057116395,0.00026753356,0.000017741966,1.41159635e-8,0.00032073498,0.000023773866,0.0033427319,0.9844998,0.005657828,0.005746713],"study_design_scores_gemma":[0.0020511835,0.0002563919,0.0022811582,0.0008473013,0.00008492009,0.0000107365,0.00025860552,0.25725284,0.2903013,0.11566958,0.3304098,0.0005761886],"about_ca_topic_score_codex":0.00001555654,"about_ca_topic_score_gemma":0.0000015165581,"teacher_disagreement_score":0.8688302,"about_ca_system_score_codex":0.00006395006,"about_ca_system_score_gemma":0.0000689591,"threshold_uncertainty_score":0.585393},"labels":[],"label_agreement":null},{"id":"W7133052102","doi":"","title":"Automated Reasoning For Uncertain Markov Processes","year":2025,"lang":"","type":"dissertation","venue":"TSpace","topic":"Formal Methods in Verification","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":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Probabilistic logic; Markov process; Markov decision process; Markov model; Embedding; Range (aeronautics); Bilinear interpolation; Set (abstract data type)","score_opus":0.04399409955211963,"score_gpt":0.4090815985299973,"score_spread":0.3650874989778777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133052102","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.005349768,0.0022284894,0.9625541,0.0005976991,0.0050395555,0.00298558,0.000030223619,0.0019245103,0.019290073],"genre_scores_gemma":[0.007876514,0.00032694286,0.9278068,0.00015240369,0.00019905625,0.0009921847,0.00055913354,0.000068826186,0.062018137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957296,0.00034490728,0.00088625605,0.0015154569,0.0006386392,0.0008851311],"domain_scores_gemma":[0.99460095,0.00087171706,0.001108574,0.0013293027,0.0019152109,0.000174217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016996143,0.00074029685,0.0007556205,0.0005115582,0.000764341,0.0006879025,0.0021354184,0.00072109536,0.000050828723],"category_scores_gemma":[0.0067291763,0.0008229729,0.00021648998,0.0026981134,0.00007224614,0.0007090649,0.00018078512,0.0004988791,0.0000402936],"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.002131122,0.0008670644,0.00017711087,0.050911445,0.00084558374,0.00003061988,0.13121043,0.006369616,0.005260316,0.2143849,0.030164301,0.5576475],"study_design_scores_gemma":[0.00064674596,0.00027598947,0.0005430932,0.0030929483,0.00018052795,0.000008711336,0.0039098775,0.951698,0.02317588,0.00094965164,0.014527805,0.0009907786],"about_ca_topic_score_codex":0.00024677796,"about_ca_topic_score_gemma":0.00009083898,"teacher_disagreement_score":0.94532835,"about_ca_system_score_codex":0.0003452319,"about_ca_system_score_gemma":0.0030146758,"threshold_uncertainty_score":0.99942213},"labels":[],"label_agreement":null},{"id":"W7133094736","doi":"","title":"Handling inductance in early power grid verification","year":2007,"lang":"","type":"dissertation","venue":"TSpace","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Graduate Education; University of Toronto","keywords":"Voltage drop; Grid; Inductance; Voltage; Power grid; Power network design; RLC circuit; Node (physics)","score_opus":0.04475464543004688,"score_gpt":0.4045554362292987,"score_spread":0.3598007907992518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133094736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65441704,0.0010408389,0.31522128,0.00015235943,0.009074183,0.0010431213,0.0000037890622,0.00016852954,0.018878827],"genre_scores_gemma":[0.57094055,0.00033127476,0.42411655,0.00012067909,0.00039761115,0.000107902204,0.00012321127,0.00009515213,0.0037670364],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99429524,0.00045297548,0.0013617881,0.0016733756,0.0011667685,0.001049824],"domain_scores_gemma":[0.9957122,0.00022409526,0.0012855345,0.001930364,0.0006091421,0.00023864808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034135752,0.0007309433,0.00069678755,0.001068122,0.0003247519,0.0004912864,0.0020250557,0.0010543485,0.00011196948],"category_scores_gemma":[0.0008145634,0.0008881063,0.00017972021,0.0029562595,0.00014273725,0.0014833019,0.00013156087,0.0016559324,0.0005242673],"study_design_candidate":"observational","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.0014879565,0.0013321488,0.008115404,0.0011068215,0.00016680354,0.00016546143,0.47568905,0.0010017448,0.07489182,0.24979016,0.0004935445,0.18575908],"study_design_scores_gemma":[0.0025351634,0.0009990844,0.71241605,0.0030840547,0.00010426248,0.000050956693,0.01609549,0.04651616,0.19919282,0.0035256664,0.011076334,0.004403975],"about_ca_topic_score_codex":0.0006269807,"about_ca_topic_score_gemma":0.00015008076,"teacher_disagreement_score":0.70430064,"about_ca_system_score_codex":0.00059939566,"about_ca_system_score_gemma":0.0004933733,"threshold_uncertainty_score":0.999357},"labels":[],"label_agreement":null},{"id":"W7165107384","doi":"10.34727/2022/isbn.978-3-85448-053-2_30</div","title":"Synthesizing Locally Symmetric Parameterized Protocols from Temporal Specifications","year":2022,"lang":"en","type":"article","venue":"Open MIND","topic":"Formal Methods in Verification","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 Waterloo","funders":"","keywords":"Parameterized complexity; Algebra over a field; Protocol (science); Key (lock); Identification (biology)","score_opus":0.21916732844196676,"score_gpt":0.37362086512783266,"score_spread":0.1544535366858659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7165107384","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.021937845,0.000027444521,0.9412451,0.00059950957,0.00036368042,0.014996687,0.000059204707,0.000027327198,0.020743234],"genre_scores_gemma":[0.08582073,5.811137e-7,0.90447706,0.000064035165,0.00003214229,0.009192534,0.000017105738,0.000010799032,0.00038504135],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99799585,0.00046566097,0.00037866444,0.0005536046,0.00038565317,0.0002205813],"domain_scores_gemma":[0.99822766,0.00023260429,0.00025334166,0.0011562511,0.000050074763,0.00008007131],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013278128,0.00012132134,0.00019284557,0.00016449993,0.00040452642,0.00063830224,0.003412309,0.000033310935,0.001322329],"category_scores_gemma":[0.00024997574,0.0001269755,0.000050575673,0.0011766737,0.000038653223,0.00076246075,0.0013767859,0.0002079828,0.00035417808],"study_design_candidate":"design_other","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.00006314922,0.00031346048,0.0005626106,0.0000037445648,0.00002710476,0.000016424088,0.0010154468,0.00019118398,0.0078078355,0.013110059,0.00033372297,0.9765552],"study_design_scores_gemma":[0.0012506112,0.00044148255,0.0071211113,0.000051583378,0.000020522446,0.000034140878,0.0004964638,0.15483487,0.052497957,0.0063458644,0.7761117,0.0007936902],"about_ca_topic_score_codex":0.00008914802,"about_ca_topic_score_gemma":0.000002936081,"teacher_disagreement_score":0.9757616,"about_ca_system_score_codex":0.00013811853,"about_ca_system_score_gemma":0.00016872022,"threshold_uncertainty_score":0.9995906},"labels":[],"label_agreement":null},{"id":"W72841774","doi":"10.1007/978-3-642-05151-7_12","title":"Verification of CERT Secure Coding Rules: Case Studies","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Computer science; Software verification; Secure coding; Model checking; Software security assurance; Software; Coding (social sciences); Formal verification; Software engineering; Programming language; Software system; Software construction; Embedded system; Computer security; Information security; Security service","score_opus":0.05165673657441901,"score_gpt":0.32219035599001583,"score_spread":0.27053361941559684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72841774","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.00029906986,0.0010950408,0.99470335,0.00024241905,0.0014760393,0.0003876212,0.000006255814,0.00013540938,0.0016547896],"genre_scores_gemma":[0.08939187,0.0002165722,0.90968096,0.00034437302,0.00022308445,0.000007944545,0.0000035460414,0.000020410327,0.00011121513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965984,0.00007863676,0.00076987693,0.0012452599,0.0008520906,0.00045569483],"domain_scores_gemma":[0.9965189,0.00043196348,0.00064865197,0.0017194555,0.0005759401,0.000105090665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017140055,0.00045357487,0.0006229184,0.0008217855,0.00025202424,0.00018968657,0.0024014001,0.00030546985,0.000005155232],"category_scores_gemma":[0.0003476478,0.0004221673,0.00012429748,0.0006695597,0.00082035194,0.0008170541,0.0006567967,0.00061780313,0.000015841853],"study_design_candidate":"design_other","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.000005839819,0.000026823287,0.000008349578,0.00011800443,0.000017996439,0.0002559194,0.0032115784,0.0041093533,0.00037130146,0.12441008,0.000014933933,0.8674498],"study_design_scores_gemma":[0.0003594265,0.0004560991,0.00009284629,0.0011037196,0.00003160255,0.0021234988,0.0000036712884,0.68408436,0.0150648365,0.29420763,0.0013628032,0.0011094662],"about_ca_topic_score_codex":0.000009280537,"about_ca_topic_score_gemma":0.000012066388,"teacher_disagreement_score":0.86634034,"about_ca_system_score_codex":0.00038342044,"about_ca_system_score_gemma":0.00031305745,"threshold_uncertainty_score":0.99982303},"labels":[],"label_agreement":null},{"id":"W7320307","doi":"10.1007/3-540-45657-0_41","title":"ΧChek: A Multi-valued Model-Checker","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":28,"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":"Negation; Model checking; Computer science; Computation tree logic; CTL*; Algorithm; Theoretical computer science; Discrete mathematics; Programming language; Mathematics","score_opus":0.0641780889293681,"score_gpt":0.3000164506333427,"score_spread":0.2358383617039746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7320307","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.000018777475,0.00033571917,0.9916758,0.00016690664,0.0016341463,0.00049707026,0.000004853978,0.00033763595,0.0053291176],"genre_scores_gemma":[0.004617682,0.00006745017,0.9923386,0.0012513015,0.0002440803,0.000018959117,0.0000028731865,0.000050330356,0.0014087054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949647,0.00006911708,0.0007272898,0.0020330695,0.0013266809,0.0008791433],"domain_scores_gemma":[0.99634576,0.00009863448,0.0004197572,0.002563869,0.00032815302,0.00024383837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015784417,0.0006864353,0.0006115418,0.0009134297,0.00029991096,0.0005540859,0.005087136,0.0005561474,0.00003405925],"category_scores_gemma":[0.00021866166,0.00064947765,0.0002011764,0.00077024155,0.00082583335,0.0010851172,0.0016385504,0.0011969114,0.00018676092],"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.0000054788497,0.00008079728,0.000015257451,0.000054985154,0.000016126936,0.000056368302,0.0018544808,0.16957706,0.0001662872,0.38430503,0.000054819684,0.4438133],"study_design_scores_gemma":[0.00026092315,0.00007283785,0.000033373322,0.00015636368,0.0000074098816,0.000049291604,5.2938965e-8,0.936735,0.001518513,0.059989925,0.00048786544,0.0006884455],"about_ca_topic_score_codex":0.000010332761,"about_ca_topic_score_gemma":0.000009934996,"teacher_disagreement_score":0.7671579,"about_ca_system_score_codex":0.0005167953,"about_ca_system_score_gemma":0.00038806905,"threshold_uncertainty_score":0.99959564},"labels":[],"label_agreement":null},{"id":"W73986762","doi":"10.1007/978-3-642-32469-7_5","title":"Microcontroller Assembly Synthesis from Timed Automaton Task Specifications","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"McMaster University","funders":"","keywords":"Computer science; Automaton; Timed automaton; Task (project management); Programming language; Microcontroller; Embedded system; Theoretical computer science","score_opus":0.034346529038926245,"score_gpt":0.26220471976385173,"score_spread":0.2278581907249255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W73986762","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.00008183303,0.0008702989,0.98812515,0.00070455315,0.0023060304,0.0006015152,0.000026140342,0.00038553073,0.006898963],"genre_scores_gemma":[0.048219983,0.00008153391,0.9498809,0.0006231674,0.0007742384,0.000058634818,0.00001163256,0.000052769934,0.00029711574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531215,0.00013271591,0.00082967104,0.0017438676,0.0011132173,0.00086834945],"domain_scores_gemma":[0.9945761,0.0014083482,0.00060514937,0.0028344041,0.00029448152,0.0002815374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001611384,0.00065618096,0.00073202996,0.0009020869,0.00036169557,0.00067203876,0.005082884,0.0005247755,0.0001307741],"category_scores_gemma":[0.00034548316,0.0006209395,0.00020856391,0.00071021647,0.0006178887,0.0012775674,0.0010578346,0.0008419046,0.0006030099],"study_design_candidate":"design_other","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.000007851108,0.0000613731,0.000035447945,0.000017323218,0.000030831012,0.000012645701,0.0007676332,0.0013766605,0.0052026096,0.045034137,0.000091731556,0.94736177],"study_design_scores_gemma":[0.0004437653,0.00008086776,0.0021337534,0.0005001249,0.00006208004,0.00006379795,2.9076537e-7,0.7780411,0.045314815,0.1510027,0.020585634,0.0017710578],"about_ca_topic_score_codex":0.000040448373,"about_ca_topic_score_gemma":0.00001970955,"teacher_disagreement_score":0.9455907,"about_ca_system_score_codex":0.0005405701,"about_ca_system_score_gemma":0.00046597858,"threshold_uncertainty_score":0.9996242},"labels":[],"label_agreement":null},{"id":"W793391272","doi":"","title":"Improved Subsumption for CLP-based Verification","year":2001,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Formal Methods in Verification","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":"Prevention of Organ Failure","funders":"","keywords":"Computer science","score_opus":0.023914831482699052,"score_gpt":0.2601421462265722,"score_spread":0.23622731474387318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W793391272","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.01714437,0.0001241469,0.9696242,0.005574352,0.00024363467,0.0005676596,0.000007791444,0.00043524356,0.00627858],"genre_scores_gemma":[0.29358438,0.000059656257,0.7043517,0.00016293903,0.00002000815,0.0001765957,0.000099065306,0.000021460843,0.0015241896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620396,0.0020438803,0.0004459576,0.00065085356,0.00029339216,0.00036192944],"domain_scores_gemma":[0.99490464,0.00088588335,0.0003661972,0.0020350823,0.0016656066,0.00014260618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060966406,0.00020192719,0.00018536144,0.00018762359,0.00041572223,0.00035297128,0.0014416601,0.00014498208,0.000029692432],"category_scores_gemma":[0.0016106167,0.00022130238,0.00013820107,0.00070274714,0.000116972755,0.00065928407,0.00014546959,0.0001672226,0.000040724706],"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.000033976143,0.00042013562,0.0007033135,0.000052868545,0.000017167462,7.33282e-7,0.0016578905,0.00006756644,0.04737613,0.63655144,0.0003901835,0.31272858],"study_design_scores_gemma":[0.0008727554,0.0000016900727,0.00501569,0.00012985858,0.000013537259,0.000008342859,0.000025876809,0.73292667,0.21739717,0.004221945,0.039054632,0.00033185972],"about_ca_topic_score_codex":0.00011485891,"about_ca_topic_score_gemma":0.00012081002,"teacher_disagreement_score":0.7328591,"about_ca_system_score_codex":0.0001272686,"about_ca_system_score_gemma":0.00014958072,"threshold_uncertainty_score":0.9024449},"labels":[],"label_agreement":null},{"id":"W79611872","doi":"10.1007/978-3-540-89985-3_7","title":"Optimizing Fixpoint Evaluation of Logic Programs with Uncertainty","year":2008,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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":"Multiset; Computer science; Backtracking; Set (abstract data type); Fixed point; Lattice (music); Context (archaeology); Algorithm; Theoretical computer science; Programming language; Mathematics; Discrete mathematics","score_opus":0.1423135322840594,"score_gpt":0.35092938189508566,"score_spread":0.20861584961102625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79611872","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.00015915035,0.00062145735,0.84455925,0.00021147034,0.00017338751,0.00097405043,0.00000419723,0.00009201758,0.153205],"genre_scores_gemma":[0.031856865,0.0015924119,0.96613604,0.0001647095,0.000013427901,0.00006840381,0.000043934124,0.000007232611,0.00011695768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738806,0.00010364913,0.00081898394,0.00031046325,0.0011598967,0.00021892088],"domain_scores_gemma":[0.99492913,0.000117399366,0.00074889726,0.002488569,0.0016367212,0.00007926201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034229783,0.00022410929,0.00028735716,0.00087967544,0.0003405332,0.00024424936,0.0030102844,0.0001246719,0.0000043282243],"category_scores_gemma":[0.000087630775,0.0001969059,0.000042070853,0.0006739643,0.001425455,0.006058845,0.0013113332,0.00036406046,0.00001121569],"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.0000046147056,0.00002709427,0.000020617841,0.00003098618,0.0000071327754,1.5643683e-7,0.003621177,0.008975064,0.0000023955356,0.4565215,0.000027832024,0.5307614],"study_design_scores_gemma":[0.00038839455,0.00016330519,0.0005497811,0.0002922154,0.000012623067,0.000046356792,0.000030374329,0.9813941,0.000030843526,0.0049272957,0.011894957,0.00026976925],"about_ca_topic_score_codex":0.000014686118,"about_ca_topic_score_gemma":0.000007955031,"teacher_disagreement_score":0.972419,"about_ca_system_score_codex":0.00027985344,"about_ca_system_score_gemma":0.00068855355,"threshold_uncertainty_score":0.80295897},"labels":[],"label_agreement":null},{"id":"W80513260","doi":"10.14236/ewic/vecos2007.12","title":"Zenoness detection and timed model checking for real time systems","year":2007,"lang":"en","type":"article","venue":"Electronic workshops in computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Zeno's paradoxes; Petri net; Bounded function; Computer science; Model checking; State (computer science); Class (philosophy); Property (philosophy); Reachability; Infinity; Algorithm; Theoretical computer science; Control theory (sociology); Mathematics; Artificial intelligence","score_opus":0.016931873437771174,"score_gpt":0.2907240179441869,"score_spread":0.2737921445064157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W80513260","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.14556642,0.00024282839,0.8527517,0.000022372706,0.00025988035,0.00038362917,1.5821624e-7,0.0002028915,0.0005701475],"genre_scores_gemma":[0.7628565,0.000010726319,0.23690069,0.000015869738,0.00011922951,0.0000111444915,0.0000011935851,0.000016747286,0.000067933994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980701,0.00008623905,0.00042588403,0.0004660685,0.00018792305,0.00076376606],"domain_scores_gemma":[0.9989532,0.00039784063,0.00018756874,0.00033267337,0.00007151167,0.00005717434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004144469,0.00016039284,0.00021510707,0.00020509578,0.00021518033,0.00014488096,0.00043360933,0.00013982698,3.1427425e-7],"category_scores_gemma":[0.00012332395,0.00017780132,0.000036681435,0.00057287334,0.000030201556,0.00032083972,0.00015209461,0.00032032377,0.0000028539998],"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.00008384784,0.000064719374,0.00015602101,0.0000952202,0.000025873574,0.000003143585,0.0017018903,0.17934702,0.018394614,0.10535143,0.000015880154,0.6947603],"study_design_scores_gemma":[0.00032721416,0.00006528857,0.0005124439,0.00006839088,0.000004122627,0.000026639871,0.000028978875,0.993102,0.0034827343,0.0021333103,0.000057134843,0.00019171069],"about_ca_topic_score_codex":0.000019797362,"about_ca_topic_score_gemma":0.000014247438,"teacher_disagreement_score":0.81375504,"about_ca_system_score_codex":0.00040933935,"about_ca_system_score_gemma":0.00007888234,"threshold_uncertainty_score":0.7250527},"labels":[],"label_agreement":null},{"id":"W84587889","doi":"10.1007/978-3-642-24372-1_8","title":"Formalization of Finite-State Discrete-Time Markov Chains in HOL","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"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; Computer science; Markov chain; Automated theorem proving; Markov process; Theoretical computer science; Examples of Markov chains; Probabilistic logic; Binary number; Markov model; Scalability; Variable-order Markov model; Markov property; Algorithm; Mathematics; Programming language; Artificial intelligence; Machine learning","score_opus":0.022025617073300575,"score_gpt":0.2588579265956386,"score_spread":0.23683230952233802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84587889","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.00015957061,0.00012398644,0.99287045,0.00008765852,0.0008472554,0.0004932247,0.0000098138835,0.000089209134,0.005318858],"genre_scores_gemma":[0.07428856,0.00007688407,0.9246465,0.00030747897,0.00009309123,0.000015332593,0.000011157511,0.00003595328,0.0005250666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965003,0.00009343944,0.0008706905,0.0011308648,0.00081468635,0.0005900274],"domain_scores_gemma":[0.9971358,0.00036081357,0.0006138941,0.0015304505,0.00024546756,0.000113558905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019238736,0.0004468296,0.0005641346,0.0013613773,0.00010004903,0.00015339916,0.0032648358,0.00029451406,0.000030531774],"category_scores_gemma":[0.00029251812,0.000423793,0.000110645975,0.0010475548,0.0006425613,0.0012040283,0.0010918735,0.00057488575,0.000033853994],"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.000029202849,0.000061063285,0.00016954365,0.00013303135,0.000010247573,0.00004853267,0.0042995634,0.051221017,0.000364484,0.07350775,0.000007494449,0.87014806],"study_design_scores_gemma":[0.00020679497,0.00019453879,0.0004932576,0.00040940434,0.000004176846,0.000020013913,1.1823354e-7,0.88765526,0.0055643385,0.104701295,0.00024082186,0.00050998124],"about_ca_topic_score_codex":0.000041101717,"about_ca_topic_score_gemma":0.000045141078,"teacher_disagreement_score":0.8696381,"about_ca_system_score_codex":0.0002360288,"about_ca_system_score_gemma":0.0003381931,"threshold_uncertainty_score":0.99982136},"labels":[],"label_agreement":null},{"id":"W851324503","doi":"10.1017/cbo9780511808241.009","title":"The Loop Invariant for Lower Bounds","year":2008,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Formal Methods in Verification","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":"York University","funders":"","keywords":"Loop (graph theory); Invariant (physics); Mathematics; Computer science; Combinatorics; Mathematical physics","score_opus":0.0410786066416894,"score_gpt":0.22964555216856206,"score_spread":0.18856694552687264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W851324503","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000044110784,0.00013863435,0.29839966,0.000034280965,0.00084217056,0.0004923999,0.000043457007,0.0001379906,0.699907],"genre_scores_gemma":[0.000034668243,0.0002722361,0.03651884,0.000101263126,0.0001372433,0.0000036640038,0.000010423872,0.00003070504,0.962891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984902,0.000059623402,0.00022389561,0.0005675744,0.0003127747,0.00034588898],"domain_scores_gemma":[0.9976234,0.0002447626,0.00031025882,0.001409863,0.00028485377,0.00012688275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034931226,0.00030660673,0.00026616495,0.00010740053,0.0008341868,0.0001741051,0.0023045752,0.00031265663,5.314319e-7],"category_scores_gemma":[0.000046461595,0.00028583736,0.00024670182,0.000014012495,0.00038008025,0.00024366862,0.0006869403,0.00037133705,0.000015144615],"study_design_candidate":"not_applicable","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.000050049992,0.0000050882977,6.1355635e-8,0.000019260666,0.00005367565,0.000046514335,0.00005177314,0.0000020195898,0.000012046182,0.93499625,0.05817225,0.0065910127],"study_design_scores_gemma":[0.00031274074,0.000089789864,0.0000042810625,0.0000421991,0.000041499614,0.00003401922,0.0000051403363,0.0036133216,0.0002971672,0.000095612726,0.9951221,0.00034213118],"about_ca_topic_score_codex":0.0000207522,"about_ca_topic_score_gemma":0.0000010158234,"teacher_disagreement_score":0.93694985,"about_ca_system_score_codex":0.00022459128,"about_ca_system_score_gemma":0.00023136572,"threshold_uncertainty_score":0.99995935},"labels":[],"label_agreement":null},{"id":"W8796604","doi":"10.1145/2393596.2393664","title":"Conditional model checking","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Model checking; Undecidable problem; Computer science; Programming language; State space; Automaton; Formal specification; Software verification; Abstraction model checking; Temporal logic; Formal verification; Theoretical computer science; Algorithm; Software; Software development; Mathematics; Decidability; Software construction","score_opus":0.114391988809025,"score_gpt":0.34973379635878116,"score_spread":0.23534180754975614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W8796604","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.0003213413,0.000059835784,0.9505177,0.00016621464,0.00082076504,0.00012000257,0.0000055840455,0.00027230408,0.047716245],"genre_scores_gemma":[0.15396126,0.0000054573934,0.84486324,0.00025199927,0.00012556677,0.000041985964,0.000024909343,0.0000068038116,0.0007188058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894166,0.000049596103,0.00020293721,0.00032610525,0.0002776874,0.00020203496],"domain_scores_gemma":[0.9988814,0.000023769018,0.00013382778,0.0008060447,0.00008429483,0.00007068758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005688579,0.00013473605,0.00012780125,0.00007562272,0.000055343808,0.0001229207,0.0011365865,0.00018276641,0.000051004463],"category_scores_gemma":[0.00004059451,0.00012980649,0.00007069003,0.0000659695,0.000029964252,0.00042071054,0.0014213674,0.00035284573,0.00013790779],"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":[4.042596e-7,0.000018015264,0.000020182424,0.000021311436,0.000006832909,1.9074544e-7,0.00016698104,0.017060058,0.000105210886,0.97708905,0.0005482043,0.0049635554],"study_design_scores_gemma":[0.000027650207,0.000001589134,0.00039304004,0.000009899313,0.0000030733759,0.0000033734518,0.0000014357745,0.82820994,0.001771324,0.16902141,0.0004146736,0.00014260667],"about_ca_topic_score_codex":0.000005783979,"about_ca_topic_score_gemma":2.495065e-7,"teacher_disagreement_score":0.81114984,"about_ca_system_score_codex":0.00007544763,"about_ca_system_score_gemma":0.0001189061,"threshold_uncertainty_score":0.5293355},"labels":[],"label_agreement":null},{"id":"W9154768","doi":"10.1007/978-3-642-15228-3_12","title":"Soundness of the Translation Algorithm","year":2010,"lang":"en","type":"book-chapter","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","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":"Defence Research and Development Canada; Concordia University","funders":"","keywords":"Soundness; Translation (biology); Computer science; Algorithm; Programming language; Biology","score_opus":0.03890197638013539,"score_gpt":0.2640244026315895,"score_spread":0.2251224262514541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9154768","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":[8.7967993e-7,0.000031208547,0.6258569,0.00008265147,0.00083305745,0.00012051293,0.0000028589016,0.00003651192,0.37303546],"genre_scores_gemma":[0.000066613065,0.000010429177,0.8647173,0.000052398842,0.0000647269,0.0000032124772,0.0000017892205,0.000011077352,0.13507244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991317,0.000020851885,0.00024686818,0.00021145395,0.0003072688,0.00008187504],"domain_scores_gemma":[0.9986846,0.000047015543,0.00021946356,0.000927415,0.000100050696,0.000021470916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032638936,0.00012512894,0.0001395269,0.000055832137,0.000058285208,0.000030523584,0.0011049225,0.0002651025,0.00008718513],"category_scores_gemma":[0.00001137778,0.00008441665,0.00011405158,0.000042703832,0.00010692222,0.00018092124,0.000095733776,0.00031952513,0.000029020253],"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":[2.8618527e-7,0.000002473446,2.6990512e-7,0.000006832804,0.0000042941956,7.1256814e-8,0.000086129075,7.2613267e-7,0.00019319604,0.6517133,0.000016215343,0.3479762],"study_design_scores_gemma":[0.00017877079,0.000044516233,0.00012820252,0.00007654173,0.000030515439,0.000019980595,0.0000030355948,0.042870507,0.02188666,0.56533563,0.3690156,0.00041000725],"about_ca_topic_score_codex":0.000006703063,"about_ca_topic_score_gemma":0.00000641857,"teacher_disagreement_score":0.3689994,"about_ca_system_score_codex":0.000013937099,"about_ca_system_score_gemma":0.00006368951,"threshold_uncertainty_score":0.3442411},"labels":[],"label_agreement":null},{"id":"W92682349","doi":"","title":"A New Branch and Bound Method for Incremental Satisfiability Problem.","year":2004,"lang":"en","type":"article","venue":"International Conference on Computational Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 Regina","funders":"","keywords":"Branch and bound; Satisfiability; Boolean satisfiability problem; Scheduling (production processes); Conjunctive normal form; Computer science; Routing (electronic design automation); Mathematical optimization; Upper and lower bounds; Theoretical computer science; Mathematics","score_opus":0.08678413591221729,"score_gpt":0.3965719329139487,"score_spread":0.3097877970017314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92682349","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.0015849036,0.000021243837,0.98972106,0.004125725,0.00055158744,0.0005187063,0.000024476074,0.00011042864,0.0033418837],"genre_scores_gemma":[0.3695343,0.000008350787,0.6298085,0.00043035296,0.00006665749,0.000053072792,0.000019781051,0.0000069987927,0.00007201003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798524,0.00008320021,0.00047744976,0.00065096276,0.0005755836,0.0002275758],"domain_scores_gemma":[0.9984845,0.00037379118,0.00019754913,0.00026112306,0.0005386475,0.00014438525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007570294,0.00020919878,0.00017705305,0.00017932279,0.00015931511,0.00039209993,0.00094789284,0.0000762699,0.00008011408],"category_scores_gemma":[0.0002395903,0.00021403511,0.00006951121,0.00021653711,0.00009090627,0.00072623853,0.00018951287,0.0001760456,0.00004477045],"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.000037183363,0.000054678207,0.00005690093,0.000010861177,0.000024119963,6.952417e-7,0.00036283425,0.03149872,0.00043450447,0.8268421,0.000051364725,0.14062601],"study_design_scores_gemma":[0.0002435811,0.00017122128,0.00095925893,0.000043349075,0.0000031946702,0.000020348074,0.000025683034,0.34940737,0.005203458,0.64344865,0.00030615172,0.00016774643],"about_ca_topic_score_codex":0.00019802067,"about_ca_topic_score_gemma":0.000026393625,"teacher_disagreement_score":0.36794943,"about_ca_system_score_codex":0.00022570154,"about_ca_system_score_gemma":0.00041023106,"threshold_uncertainty_score":0.8728099},"labels":[],"label_agreement":null},{"id":"W94759620","doi":"","title":"A Preliminary Report on Tool Support and Methodology for Feature Interaction Detection","year":2007,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"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 Waterloo","funders":"","keywords":"Automotive industry; Stateflow; Feature (linguistics); Computer science; Feature model; Set (abstract data type); Cruise control; Correctness; Domain (mathematical analysis); Software; MATLAB; Engineering; Artificial intelligence; Control (management); Programming language","score_opus":0.10829818383167286,"score_gpt":0.40285368756377543,"score_spread":0.2945555037321026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94759620","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.022603078,0.000005696595,0.9728733,0.0002798316,0.001110312,0.00031429657,4.6670644e-7,0.00014509459,0.002667965],"genre_scores_gemma":[0.16050763,0.0000018896278,0.83825177,0.00031652753,0.00008063247,0.000027637212,0.000003918505,0.0000057415346,0.00080424565],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990589,0.00009121004,0.00022445053,0.00034721245,0.000107646854,0.00017059181],"domain_scores_gemma":[0.99886656,0.00049962744,0.00014363822,0.00036465874,0.000085875334,0.0000396158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031256978,0.0000884586,0.00010754381,0.00014036613,0.000088059634,0.00004062037,0.0001473343,0.00011930719,0.0000036848346],"category_scores_gemma":[0.00075987447,0.00007779929,0.000037933503,0.00014792246,0.000021162079,0.00045144864,0.000058482663,0.00013227764,0.000004930792],"study_design_candidate":"design_other","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.0003819248,0.000043041382,0.00013455603,0.000021837744,0.000013396312,0.000027150862,0.00034317604,0.000011815256,0.019710762,0.052460857,0.0006407672,0.9262107],"study_design_scores_gemma":[0.00050977967,0.0032453022,0.056847647,0.000013752976,0.000021682412,0.0034328478,0.00013705122,0.03514133,0.8452205,0.0074875355,0.047594592,0.00034795972],"about_ca_topic_score_codex":0.000009053131,"about_ca_topic_score_gemma":0.000007941127,"teacher_disagreement_score":0.9258627,"about_ca_system_score_codex":0.000054118038,"about_ca_system_score_gemma":0.000016063408,"threshold_uncertainty_score":0.3172563},"labels":[],"label_agreement":null},{"id":"W954629016","doi":"10.1007/978-3-662-43652-3_32","title":"Staged Evaluation of Partial Instances in a Relational Model Finder","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"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":"Axiom; Computer science; Generator (circuit theory); Property (philosophy); Scalability; Spurious relationship; Scope (computer science); Theoretical computer science; Algorithm; Programming language; Mathematics; Database; Machine learning; Power (physics)","score_opus":0.0837871617167047,"score_gpt":0.3233108398344413,"score_spread":0.23952367811773662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W954629016","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.0010346257,0.00015349823,0.9947473,0.00015164103,0.0007696084,0.00043933615,0.000003269162,0.00004007029,0.0026606924],"genre_scores_gemma":[0.35221303,0.0000071279437,0.6474802,0.00014869035,0.000078110636,0.0000146675875,0.0000033773736,0.000010339048,0.000044466415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572945,0.00017851725,0.0007295891,0.0009837524,0.002027145,0.00035157334],"domain_scores_gemma":[0.9975594,0.0003495383,0.0005000207,0.0010118008,0.00051406753,0.000065166954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00602907,0.0002917817,0.00039002302,0.0008320355,0.00009522235,0.00010079905,0.0017163253,0.00028552543,0.000014498005],"category_scores_gemma":[0.0004893514,0.00028368938,0.00007288366,0.00059992017,0.0004785661,0.0006790013,0.00042847474,0.0005776779,0.0000079976435],"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.000005293409,0.000012209887,0.00006659243,0.000014689867,0.0000023013456,7.6985077e-7,0.0005616483,0.59954363,0.00006338587,0.15560508,0.0000016997718,0.2441227],"study_design_scores_gemma":[0.00027439618,0.00004703141,0.00044266184,0.00015888069,0.000005160438,0.0000031443906,8.6116685e-8,0.77572566,0.0009796508,0.22209714,0.000046317127,0.00021987931],"about_ca_topic_score_codex":0.000009910113,"about_ca_topic_score_gemma":0.00005358623,"teacher_disagreement_score":0.35117838,"about_ca_system_score_codex":0.00042477174,"about_ca_system_score_gemma":0.0011009023,"threshold_uncertainty_score":0.99996156},"labels":[],"label_agreement":null},{"id":"W96010459","doi":"10.1007/978-3-319-10431-7_23","title":"A Tool for Verifying Dynamic Properties in B","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","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":"Université de Sherbrooke","funders":"","keywords":"Property (philosophy); Computer science; Reservation; Programming language; Computer network","score_opus":0.03354115495685481,"score_gpt":0.2786419527166393,"score_spread":0.24510079775978447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96010459","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.00037471936,0.0002552597,0.9959208,0.0002701293,0.0016827892,0.0008185508,0.000002101215,0.00013416176,0.0005415123],"genre_scores_gemma":[0.11337808,0.000014564183,0.88552094,0.0006048808,0.00014631238,0.000063184656,0.0000019834172,0.000030694602,0.00023938467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967783,0.0000537738,0.0005933544,0.0013276768,0.0006145863,0.0006322798],"domain_scores_gemma":[0.99782217,0.00032134252,0.00027022845,0.001327553,0.00018778865,0.00007094159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019883418,0.00042091528,0.00048585449,0.00083843863,0.00017496744,0.0004032397,0.003135114,0.00030619843,0.000003095936],"category_scores_gemma":[0.00037590522,0.00037905737,0.00010737796,0.00046697003,0.00044911512,0.0004432078,0.0007718936,0.0005804033,0.000017694008],"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.000011069647,0.000015494355,0.000024679197,0.00013316478,0.000003554337,0.0000062599775,0.0007104907,0.02369878,0.00048349443,0.04633728,0.0000026716307,0.9285731],"study_design_scores_gemma":[0.0002384093,0.00014571467,0.00015755321,0.00048525693,0.0000028910458,0.000021718404,9.344786e-8,0.9275854,0.0014749301,0.068272196,0.0011198042,0.0004960102],"about_ca_topic_score_codex":0.000009788917,"about_ca_topic_score_gemma":0.00004715887,"teacher_disagreement_score":0.92807704,"about_ca_system_score_codex":0.00047179367,"about_ca_system_score_gemma":0.000372439,"threshold_uncertainty_score":0.9998661},"labels":[],"label_agreement":null},{"id":"W965675865","doi":"10.48550/arxiv.1507.06248","title":"Computing finite abstractions with robustness margins via local reachable set over-approximation","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Waterloo","funders":"National Science Foundation","keywords":"Robustness (evolution); Spurious relationship; Nonlinear system; Linearization; Computer science; Affine transformation; Finite set; Imperfect; Mathematical optimization; Control theory (sociology); Algorithm; Mathematics; Control (management)","score_opus":0.1110153816749567,"score_gpt":0.23037286724953765,"score_spread":0.11935748557458095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W965675865","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.10838909,0.000011451361,0.887864,0.000028509376,0.00056634354,0.00036730838,0.000014471239,0.0003563258,0.0024025044],"genre_scores_gemma":[0.8403092,0.000008192915,0.15917265,0.000021510723,0.00007017952,0.0000017678695,0.00006393972,0.00002258171,0.00032995158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772984,0.00028697535,0.00032245167,0.0010597842,0.00020662276,0.00039432154],"domain_scores_gemma":[0.9972608,0.0001515798,0.0005820797,0.0014394644,0.0003656049,0.00020044442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001005156,0.00036533645,0.00036834105,0.0003271684,0.00026353236,0.00018600396,0.001421724,0.0003543307,0.000016277281],"category_scores_gemma":[0.00005322267,0.00039306018,0.000105157844,0.00074484677,0.00017463995,0.0010049285,0.0010872108,0.0008868931,0.000062676554],"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.00004038752,0.000058688398,0.0009761532,0.00009765411,0.000039782477,0.000050952116,0.00021185353,0.96591306,0.000007898054,0.030586388,0.00009302288,0.0019241729],"study_design_scores_gemma":[0.00043818657,0.00009743707,0.0015359621,0.00008497328,0.000059936556,0.000019342851,0.00010257936,0.99261993,0.00014395243,0.0041951295,0.00026037506,0.00044218064],"about_ca_topic_score_codex":0.00029701117,"about_ca_topic_score_gemma":0.000047552905,"teacher_disagreement_score":0.7319201,"about_ca_system_score_codex":0.00061254896,"about_ca_system_score_gemma":0.00026218148,"threshold_uncertainty_score":0.9998521},"labels":[],"label_agreement":null},{"id":"W984026403","doi":"","title":"Abstract Acceleration in Linear relation analysis (extended version)","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Formal Methods in Verification","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":"Emera (Canada)","funders":"","keywords":"Acceleration; Relation (database); Linear acceleration; Mathematics; Computer science; Physics; Classical mechanics; Data mining","score_opus":0.02519061736080492,"score_gpt":0.27144939426098025,"score_spread":0.24625877690017534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W984026403","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.11858951,0.00020781578,0.8604496,0.0030415875,0.00043449088,0.0005576522,0.0000141377905,0.00031496433,0.016390216],"genre_scores_gemma":[0.5153415,0.00017534984,0.4828466,0.000046676403,0.000016840328,0.00008219761,0.00040779295,0.000019168163,0.0010638617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99280494,0.0041238475,0.00091699214,0.0011208643,0.00065813353,0.00037522055],"domain_scores_gemma":[0.99292016,0.00087608193,0.0008996775,0.0032784964,0.0018672346,0.00015832737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007821565,0.00035662865,0.00046314788,0.0009244266,0.00026285223,0.0007011658,0.0023568198,0.00048902456,0.0002006836],"category_scores_gemma":[0.0017415397,0.0003990272,0.00029061752,0.001821961,0.00011059347,0.0010549383,0.0014640434,0.00096723816,0.00021317022],"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.00003404307,0.0018302143,0.01370545,0.00038265763,0.0006083184,0.000013675622,0.020976279,0.020062368,0.006462186,0.6858788,0.0012332367,0.24881276],"study_design_scores_gemma":[0.00033197858,3.6678304e-7,0.22874494,0.00038303752,0.00006817126,0.0000017066789,0.000031706073,0.7480623,0.012314967,0.008522208,0.0010970542,0.00044153028],"about_ca_topic_score_codex":0.0015281858,"about_ca_topic_score_gemma":0.0006906533,"teacher_disagreement_score":0.728,"about_ca_system_score_codex":0.00032341396,"about_ca_system_score_gemma":0.0002597554,"threshold_uncertainty_score":0.99984616},"labels":[],"label_agreement":null},{"id":"W986923873","doi":"10.1007/978-3-319-21668-3_5","title":"Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":36,"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":"Satisfiability; Set (abstract data type); Combinatorics; Intersection (aeronautics); Duality (order theory); Discrete mathematics; Computer science; Computation; Algorithm; Mathematics","score_opus":0.06497413392949586,"score_gpt":0.333500299153706,"score_spread":0.26852616522421013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W986923873","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.001780427,0.00021935579,0.9845206,0.00030582497,0.0100428285,0.00089884107,0.000015263717,0.00032867942,0.0018881714],"genre_scores_gemma":[0.025530145,0.0000045564193,0.9726693,0.0010360447,0.000420201,0.000013234216,0.000011394255,0.000064850086,0.00025026873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932123,0.00013676069,0.000965856,0.0024446025,0.002070003,0.0011705246],"domain_scores_gemma":[0.99557364,0.00039974664,0.0005776159,0.0020705936,0.00083216635,0.00054623786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002593881,0.0008594912,0.000839571,0.0015947613,0.00045761775,0.00084739795,0.004136565,0.0005389605,0.000017572449],"category_scores_gemma":[0.00035766998,0.0008768624,0.0001648692,0.0018106203,0.00068846636,0.001113539,0.0022276961,0.0010282922,0.00011967119],"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.00003437543,0.000060770566,0.00006286142,0.00004817073,0.00001601416,0.00007295762,0.0023517131,0.47293043,0.00040207026,0.0038074944,0.00045604055,0.5197571],"study_design_scores_gemma":[0.00031260232,0.00041376628,0.00025861972,0.00044913366,0.00001603037,0.00027863428,0.000001168835,0.9869245,0.0016994751,0.006655064,0.0020169164,0.0009740869],"about_ca_topic_score_codex":0.00007896477,"about_ca_topic_score_gemma":0.0000421681,"teacher_disagreement_score":0.518783,"about_ca_system_score_codex":0.001271799,"about_ca_system_score_gemma":0.0012476017,"threshold_uncertainty_score":0.9993682},"labels":[],"label_agreement":null},{"id":"W9929366","doi":"10.1007/978-3-662-04558-9_15","title":"UPPAAL — Timed Systems","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"Formal Methods in Verification","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":"Université de Montréal","funders":"","keywords":"Computer science; The Internet; Software engineering; Systems engineering; Operating system; Engineering","score_opus":0.045208595363498076,"score_gpt":0.26974012815065157,"score_spread":0.2245315327871535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9929366","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.1545602e-7,0.00014878938,0.45882937,0.00003289646,0.0009348084,0.00013193335,0.0000011356393,0.0002143044,0.53970665],"genre_scores_gemma":[0.000027956656,0.000055227858,0.2547208,0.000084904,0.00019354935,0.000008865842,0.0000052154687,0.000019242358,0.74488425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986678,0.00002646743,0.0003185883,0.0004245875,0.00036751572,0.00019505748],"domain_scores_gemma":[0.998491,0.000044005446,0.00018828046,0.0010921765,0.00009993941,0.000084636864],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003728796,0.00022050091,0.00024757523,0.00013998087,0.000053908294,0.00015995957,0.0011348902,0.00028828034,0.00029797133],"category_scores_gemma":[0.000018390945,0.00019683053,0.00008407395,0.00004283682,0.000040110986,0.00026335716,0.00020950506,0.00023661766,0.0023153573],"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":[8.5861666e-7,0.000002761454,3.808432e-7,0.00001407298,0.00001161952,0.000008923823,0.000016380895,0.000010506005,0.000004769764,0.97480124,0.005782619,0.019345844],"study_design_scores_gemma":[0.00006659158,0.00003916695,0.000004612346,0.00005566544,0.000007553029,0.000076188786,0.0000012400758,0.035301924,0.000041122265,0.017942943,0.9461653,0.0002976519],"about_ca_topic_score_codex":0.000015251499,"about_ca_topic_score_gemma":8.2565464e-7,"teacher_disagreement_score":0.95685834,"about_ca_system_score_codex":0.00008955503,"about_ca_system_score_gemma":0.000058578455,"threshold_uncertainty_score":0.9984615},"labels":[],"label_agreement":null}]}